mirror/freebsd-ports
1
0
Fork 0
mirror of https://git.FreeBSD.org/ports.git synced 2025-01-05 06:27:37 +00:00
Code Issues Releases Activity
13c306d9db
freebsd-ports/net/p5-Net-Patricia/Makefile

24 lines
513 B
Makefile
Raw Normal View History

new port p5-Net-Patricia 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. WWW: http://net.doit.wisc.edu/~plonka/Net-Patricia/
2001-03-13 21:12:21 +00:00
# New ports collection makefile for: p5-Net-Patricia
# Date created: Di 13 M<>r 2001 19:37:25 CET
# Whom: Andreas Klemm <andreas@klemm.gtn.com>
#
# $FreeBSD$
#
PORTNAME= Net-Patricia
- update to 1.014 - remove patch, since <sys/types.h> is included. - take maintainership
2005-12-11 10:28:29 +00:00
PORTVERSION= 1.014
new port p5-Net-Patricia 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. WWW: http://net.doit.wisc.edu/~plonka/Net-Patricia/
2001-03-13 21:12:21 +00:00
CATEGORIES= net perl5
Add CPAN as primary site to download tarball PR: 35914 Submitted by: Kimura Fuyuki <fuyuki@mj.0038.net>
2002-03-15 05:10:46 +00:00
MASTER_SITES= ${MASTER_SITE_PERL_CPAN} \
http://net.doit.wisc.edu/~plonka/Net-Patricia/
MASTER_SITE_SUBDIR= Net
new port p5-Net-Patricia 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. WWW: http://net.doit.wisc.edu/~plonka/Net-Patricia/
2001-03-13 21:12:21 +00:00
PKGNAMEPREFIX= p5-
- update to 1.014 - remove patch, since <sys/types.h> is included. - take maintainership
2005-12-11 10:28:29 +00:00
MAINTAINER= clsung@FreeBSD.org
De-pkg-comment.
2003-02-20 19:00:52 +00:00
COMMENT= Perl module for fast IP address lookups
new port p5-Net-Patricia 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. WWW: http://net.doit.wisc.edu/~plonka/Net-Patricia/
2001-03-13 21:12:21 +00:00
PERL_CONFIGURE= YES
MAN3= Net::Patricia.3
.include <bsd.port.mk>
Reference in New Issue Copy Permalink