4 results (1.232 seconds)
Net::IP::Match::Trie - Efficiently match IP addresses against IP ranges with Trie (prefix tree) 2 ++

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 GMT - Search in distribution

Net::IP::LPM - Perl implementation of Longest Prefix Match algorithm ++

The module Net::IP::LPM implements the Longest Prefix Match algorithm to both protocols, IPv4 and IPv6. The module uses Trie algo. PERFORMANCE The module is able to match ~ 1 mln. lookups per second to a complete Internet BGP table (approx. 500,000 p...

TPODER/Net-IP-LPM-1.05 - 02 Oct 2013 16:49:57 GMT - Search in distribution

Net::Patricia - Patricia Trie perl module for fast IP address lookups ++

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   (1 review) - 15 Oct 2013 19:45:51 GMT - Search in distribution

perldelta - what is new for perl v5.20.0 210 ++

This document describes differences between the 5.18.0 release and the 5.20.0 release. If you are upgrading from an earlier release such as 5.16.0, first read perl5180delta, which describes differences between 5.16.0 and 5.18.0. Core Enhancements Exp...

RJBS/perl-5.20.0   (5 reviews) - 27 May 2014 01:35:13 GMT - Search in distribution




Hosting generously
sponsored by Bytemark