1 files changed, 26 insertions, 0 deletions
diff --git a/perl-cpan/net-patricia/DETAILS b/perl-cpan/net-patricia/DETAILS
new file mode 100755
index 0000000000..238ec41f23
--- /dev/null
+++ b/perl-cpan/net-patricia/DETAILS
@@ -0,0 +1,26 @@
+           SPELL=net-patricia
+         VERSION=1.22
+          SOURCE="Net-Patricia-${VERSION}.tar.gz"
+   SOURCE_URL[0]=$PERL_CPAN_URL/authors/id/G/GR/GRUBER/${SOURCE}
+     SOURCE_HASH=sha512:d76702d30784f8448dcf3a5269e052bc7bd6f5fe5a16824b6e3ede1d0182deb139522e45e1fb78749a7527ddbc950c213d843e43f45b5b0ed63b5b985b329861
+SOURCE_DIRECTORY="${BUILD_DIRECTORY}/Net-Patricia-${VERSION}"
+        WEB_SITE="http://search.cpan.org/~gruber/Net-Patricia-${VERSION}/"
+      LICENSE[0]=ART
+         ENTERED=20150718
+           SHORT="Patricia Trie perl module for fast IP address lookups"
+cat << EOF
+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 patricia implementations called "radix" as well.
+The term "Trie" is derived from the word "retrieval" but is pronounced like
+"try".  Patricia stands for "Practical Algorithm to Retrieve Information
+Coded as Alphanumeric", and was first suggested for routing table lookups by
+Van Jacobsen.  Patricia Trie performance characteristics are well-known as
+it has been employed for routing table lookups within the BSD kernel since
+the 4.3 Reno release.
+
+The BSD radix code is thoroughly described in "TCP/IP Illustrated, Volume 2"
+by Wright and Stevens and in the paper ``A Tree-Based Packet Routing Table
+for Berkeley Unix'' by Keith Sklower.
+EOF