kpriv/freebsd-ports
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
freebsd-ports/net/p5-Net-Patricia/Makefile

22 lines
452 B
Makefile
Raw Normal View History

- Update to 1.20 [1] - Remove dependency on p5-version (already in core) - Add TEST_DEPENDS Changes: http://search.cpan.org/dist/Net-Patricia/Changes PR: ports/172580 [1] Submitted by: Nick Hilliard <nick@foobar.org> Feature safe: yes
2012-10-12 11:45:56 +02:00
# Created by: Andreas Klemm <andreas@klemm.gtn.com>
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 22:12:21 +01:00
# $FreeBSD$
PORTNAME= Net-Patricia
- Update to 1.22 - Support staging Changes: http://search.cpan.org/dist/Net-Patricia/Changes
2013-10-16 09:07:00 +02:00
PORTVERSION= 1.22
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 22:12:21 +01:00
CATEGORIES= net perl5
- Update to 1.15 Changes: http://search.cpan.org/dist/Net-Patricia/Changes
2009-06-24 11:05:04 +02:00
MASTER_SITES= CPAN
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 22:12:21 +01:00
PKGNAMEPREFIX= p5-
- Assign clsung's p5- ports to perl@ Approved by: clsung via IRC
2012-05-01 03:47:10 +02:00
MAINTAINER= perl@FreeBSD.org
De-pkg-comment.
2003-02-20 20:00:52 +01: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 22:12:21 +01:00
- Update to 1.20 [1] - Remove dependency on p5-version (already in core) - Add TEST_DEPENDS Changes: http://search.cpan.org/dist/Net-Patricia/Changes PR: ports/172580 [1] Submitted by: Nick Hilliard <nick@foobar.org> Feature safe: yes
2012-10-12 11:45:56 +02:00
BUILD_DEPENDS= p5-Net-CIDR-Lite>=0.20:${PORTSDIR}/net/p5-Net-CIDR-Lite
RUN_DEPENDS= p5-Socket6>=0:${PORTSDIR}/net/p5-Socket6
- requires p5-version to run - bump PORTREVISION PR: ports/136209 Submitted by: Matthew Luckie <mluckie_AT_cs dot waikato dot ac dot nz>
2009-07-08 03:46:55 +02:00
- fix buiild by addding: MAKE_JOBS_UNSAFE=yes error: libpatricia/libpatricia.a: could not read symbols: Archive has no index; run ranlib to add one *** [blib/arch/auto/Net/Patricia/Patricia.so] Error code 1
2014-03-25 12:03:45 +01:00
MAKE_JOBS_UNSAFE=yes
- Convert to new perl framework - Trim Makefile header - Remove MAKE_JOBS_SAFE=yes, it's the default.
2013-08-02 20:52:07 +02:00
USES= perl5
USE_PERL5= configure
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 22:12:21 +01:00
Cleanup supporting perl version 5.8 and 5.10, lang/perl5.8 and lang/5.10 will be removed from ports tree soon.
2012-12-17 16:39:36 +01:00
.include <bsd.port.mk>
Reference in a new issue Copy permalink