The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.

Search results for "module:Net::IPTrie"

Net::IPTrie - Perl module for building IPv4 and IPv6 address space hierarchies River stage zero No dependents

This module uses a radix tree (or trie) to quickly build the hierarchy of a given address space (both IPv4 and IPv6). This allows the user to perform fast subnet or routing lookups. It is implemented exclusively in Perl....

CVICENTE/Net-IPTrie-0.7 - 20 Aug 2010 20:45:14 UTC

Net::IPTrie::Node River stage zero No dependents

See Net::IPTrie...

CVICENTE/Net-IPTrie-0.7 - 20 Aug 2010 20:45:14 UTC

Net::IP::Match::Trie - Efficiently match IP addresses against IP ranges with Trie (prefix tree) River stage one • 2 direct dependents • 2 total dependents

Net::IP::Match::Trie is XS or Pure Perl implementation of matching IP address against Net ranges. Net::IP::Match::Trie uses Trie (prefix tree) data structure, so very fast lookup time (match_ip) but slow setup (add) time. This module is useful for on...

HIROSE/Net-IP-Match-Trie-1.00 - 28 Nov 2013 06:25:44 UTC

lib/Net/IP/Match/Trie/XS.pm River stage one • 2 direct dependents • 2 total dependents

HIROSE/Net-IP-Match-Trie-1.00 - 28 Nov 2013 06:25:44 UTC

lib/Net/IP/Match/Trie/PP.pm River stage one • 2 direct dependents • 2 total dependents

HIROSE/Net-IP-Match-Trie-1.00 - 28 Nov 2013 06:25:44 UTC

Net::IP::LPM - Perl implementation of Longest Prefix Match algorithm River stage zero No dependents

The module Net::IP::LPM implements the Longest Prefix Match algorithm to both protocols, IPv4 and IPv6. The module uses Trie algo....

TPODER/Net-IP-LPM-1.10 - 03 Aug 2015 08:40:34 UTC
6 results (0.031 seconds)