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

Search results for "module:Net::IP::Match::XS"

Net::IP::Match::XS - Efficiently match IP addresses against IP ranges with C. River stage one • 2 direct dependents • 2 total dependents

Net::IP::Match::XS is based upon, and does the same thing as Net::IP::Match. The unconditionally exported subroutine 'match_ip' determines if the ip to match ( first argument ) matches any of the subsequent ip arguments. Match arguments may be absolu...

BEAU/Net-IP-Match-XS-0.03 - 25 Dec 2004 05:38:14 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

Net::IP::Match::Regexp - Efficiently match IP addresses against ranges River stage one • 3 direct dependents • 6 total dependents

This module allows you to check an IP address against one or more IP ranges. It employs Perl's highly optimized regular expression engine to do the hard work, so it is very fast. It is optimized for speed by doing the match against a regexp which imp...

CDOLAN/Net-IP-Match-Regexp-1.01 - 04 Oct 2008 02:40:08 UTC

Net::IP::Match::Bin - Perl extension for match IP addresses against Net ranges River stage zero No dependents

This module is XS implementation of matching IP addresses against Net ranges. Using similar method to Net::IP::Match::Regexp in storing Net ranges into memory. By implementing in XS C-code, and does not use regexp, more fast setup time and less using...

TOMO/Net-IP-Match-Bin-0.14 - 07 Aug 2014 13:52:39 UTC

Net::Patricia - Patricia Trie perl module for fast IP address lookups River stage one • 1 direct dependent • 1 total dependent

This module uses a Patricia Trie data structure to quickly perform IP address prefix matching for applications such as IP subnet, network or routing table lookups. The data structure is based on a radix tree using a radix of two, so sometimes you see...

GRUBER/Net-Patricia-1.22 - 15 Oct 2013 19:45:51 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

Net::IP::Resolver - Resolve IPs to a particular network River stage zero No dependents

"Net::IP::Resolver" provides a mechanism for registering a number of different networks (specified by a set of ip ranges), and then finding the network for a given IP based on this specification. The identifier for a network can be any defined value ...

ADAMK/Net-IP-Resolver-0.02 - 04 Sep 2006 00:46:25 UTC

JCM::Net::Patricia - Patricia Trie perl module for fast IP address lookups River stage zero No dependents

This module uses a Patricia Trie data structure to quickly perform IP address prefix matching for applications such as IP subnet, network or routing table lookups. The data structure is based on a radix tree using a radix of two, so sometimes you see...

JMASLAK/JCM-Net-Patricia-1.05 - 29 Mar 2021 18:10:24 UTC
8 results (0.066 seconds)