5 files changed, 70 insertions, 0 deletions

diff --git a/devel/Makefile b/devel/Makefile
index 0ee58c8f9c1d..f9602e037a96 100644
--- a/devel/Makefile
+++ b/devel/Makefile
@@ -1009,6 +1009,7 @@
     SUBDIR += p5-Time-modules
     SUBDIR += p5-TimeDate
     SUBDIR += p5-TraceFuncs
+    SUBDIR += p5-Tree-Binary
     SUBDIR += p5-Tree-DAG_Node
     SUBDIR += p5-Tree-Parser
     SUBDIR += p5-Tree-Simple
diff --git a/devel/p5-Tree-Binary/Makefile b/devel/p5-Tree-Binary/Makefile
new file mode 100644
index 000000000000..8e6155f8fb3f
--- /dev/null
+++ b/devel/p5-Tree-Binary/Makefile
@@ -0,0 +1,35 @@
+# New ports collection makefile for:	Tree::Binary
+# Date created:				1 September 2004
+# Whom:					Aaron Dalton <aaron@daltons.ca>
+#
+# $FreeBSD$
+#
+
+PORTNAME=	Tree-Binary
+PORTVERSION=	0.04
+CATEGORIES=	devel perl5
+MASTER_SITES=	${MASTER_SITE_PERL_CPAN}
+MASTER_SITE_SUBDIR=	Tree
+PKGNAMEPREFIX=	p5-
+
+MAINTAINER=	aaron@daltons.ca
+COMMENT=	An Object Oriented Binary Tree for Perl
+
+MAN3=		Tree::Binary.3 Tree::Binary::Search.3 \
+		Tree::Binary::Search::Node.3 \
+		Tree::Binary::Visitor::Base.3 \
+		Tree::Binary::Visitor::BreadthFirstTraversal.3 \
+		Tree::Binary::Visitor::InOrderTraversal.3 \
+		Tree::Binary::Visitor::PostOrderTraversal.3 \
+		Tree::Binary::Visitor::PreOrderTraversal.3 \
+		Tree::Binary::VisitorFactory.3
+
+PERL_CONFIGURE=	yes
+
+.include <bsd.port.pre.mk>
+
+.if ${PERL_LEVEL} < 500600
+IGNORE=		Port requires perl 5.6.x or later. Install lang/perl5 then try again
+.endif
+
+.include <bsd.port.post.mk>
diff --git a/devel/p5-Tree-Binary/distinfo b/devel/p5-Tree-Binary/distinfo
new file mode 100644
index 000000000000..9d59802dc53d
--- /dev/null
+++ b/devel/p5-Tree-Binary/distinfo
@@ -0,0 +1,2 @@
+MD5 (Tree-Binary-0.04.tar.gz) = c63a619041d3b130cf74088ed0e3af96
+SIZE (Tree-Binary-0.04.tar.gz) = 26968
diff --git a/devel/p5-Tree-Binary/pkg-descr b/devel/p5-Tree-Binary/pkg-descr
new file mode 100644
index 000000000000..4ebebc8e4557
--- /dev/null
+++ b/devel/p5-Tree-Binary/pkg-descr
@@ -0,0 +1,16 @@
+This module is a fully object oriented implementation of a binary tree. Binary
+trees are a specialized type of tree which has only two possible branches, a
+left branch and a right branch. While it is possible to use an n-ary tree, like
+Tree::Simple, to fill most of your binary tree needs, a true binary tree object
+is just easier to mantain and use.
+
+Binary Tree objects are especially useful (to me anyway) when building parse
+trees of things like mathematical or boolean expressions. They can also be used
+in games for such things as descisions trees. Binary trees are a well studied
+data structure and there is a wealth of information on the web about them.
+
+WWW: http://search.cpan.org/dist/Tree-Binary/
+Author: Stevan Little <stevan@iinteractive.com>
+
+- Aaron Dalton
+aaron@daltons.ca
diff --git a/devel/p5-Tree-Binary/pkg-plist b/devel/p5-Tree-Binary/pkg-plist
new file mode 100644
index 000000000000..bb058f3c4461
--- /dev/null
+++ b/devel/p5-Tree-Binary/pkg-plist
@@ -0,0 +1,16 @@
+%%SITE_PERL%%/Tree/Binary.pm
+%%SITE_PERL%%/Tree/Binary/Search.pm
+%%SITE_PERL%%/Tree/Binary/Search/Node.pm
+%%SITE_PERL%%/Tree/Binary/Visitor/Base.pm
+%%SITE_PERL%%/Tree/Binary/Visitor/BreadthFirstTraversal.pm
+%%SITE_PERL%%/Tree/Binary/Visitor/InOrderTraversal.pm
+%%SITE_PERL%%/Tree/Binary/Visitor/PostOrderTraversal.pm
+%%SITE_PERL%%/Tree/Binary/Visitor/PreOrderTraversal.pm
+%%SITE_PERL%%/Tree/Binary/VisitorFactory.pm
+%%SITE_PERL%%/%%PERL_ARCH%%/auto/Tree/Binary/.packlist
+@dirrm %%SITE_PERL%%/%%PERL_ARCH%%/auto/Tree/Binary
+@unexec rmdir %D/%%SITE_PERL%%/%%PERL_ARCH%%/auto/Tree 2>/dev/null || true
+@dirrm %%SITE_PERL%%/Tree/Binary/Visitor
+@dirrm %%SITE_PERL%%/Tree/Binary/Search
+@dirrm %%SITE_PERL%%/Tree/Binary
+@unexec rmdir %D/%%SITE_PERL%%/Tree 2>/dev/null || true