6 files changed, 57 insertions, 0 deletions

diff --git a/devel/avltree/Makefile b/devel/avltree/Makefile
new file mode 100644
index 000000000000..4a9671a843a1
--- /dev/null
+++ b/devel/avltree/Makefile
@@ -0,0 +1,17 @@
+# New ports collection makefile for:	avltree
+# Version required:			1.1
+# Date created:				13 January 2000
+# Whom:					Bill Ross <bross@nas.nasa.gov>
+#
+# $FreeBSD$
+
+DISTNAME=	avltree-1.1
+CATEGORIES=	devel
+MASTER_SITES=	ftp://odin.compchem.ucsf.edu/pub/amber/
+
+MAINTAINER=	bross@nas.nasa.gov
+
+MAN3=		avltree.3
+MANCOMPRESSED=	yes
+
+.include <bsd.port.mk>
diff --git a/devel/avltree/distinfo b/devel/avltree/distinfo
new file mode 100644
index 000000000000..0e43515fb112
--- /dev/null
+++ b/devel/avltree/distinfo
@@ -0,0 +1 @@
+MD5 (avltree-1.1.tar.gz) = 45a5dafb8de20059b450ce3137860c53
diff --git a/devel/avltree/files/patch-aa b/devel/avltree/files/patch-aa
new file mode 100644
index 000000000000..e457595e7505
--- /dev/null
+++ b/devel/avltree/files/patch-aa
@@ -0,0 +1,11 @@
+--- Makefile.orig	Sun Jan 23 15:00:51 2000
++++ Makefile	Sun Jan 23 15:00:56 2000
+@@ -3,7 +3,7 @@
+ # Date created:		13 January 2000
+ # Whom:			Bill Ross <bross@nas.nasa.gov> <ross@cgl.ucsf.edu>
+ #
+-CC=	cc
++CC?=	cc
+ 
+ all:		libavltree.a
+ 
diff --git a/devel/avltree/pkg-comment b/devel/avltree/pkg-comment
new file mode 100644
index 000000000000..b445082dc2b9
--- /dev/null
+++ b/devel/avltree/pkg-comment
@@ -0,0 +1 @@
+An in-memory index w/ binary and string keys and key counts
diff --git a/devel/avltree/pkg-descr b/devel/avltree/pkg-descr
new file mode 100644
index 000000000000..3de9878d5d40
--- /dev/null
+++ b/devel/avltree/pkg-descr
@@ -0,0 +1,24 @@
+AVLtree is a small, malloc-based, in-memory index package generally
+like B-trees and hash tables.
+
+The interface resembles that of the BPLUS (B-tree) index package.
+
+Index creation options are:
+
+  - fixed-length binary keys OR variable-length string keys
+  - unique OR duplicate keys
+  - with duplicate keys:
+      standard (void *) pointers for each key OR
+      instance-counting (saves time and memory)
+
+Key insert/search time is O(log N).  References:
+
+Adelson-Velskii, G. M., and E. M. Landis.
+  "An Algorithm for the Organization of Information."
+  Soviet Math. Doclady 3, 1962, pp. 1259-1263.
+Knuth, D. E.
+  The Art of Computer Programming, Volume 3: Sorting and Searching
+  (2nd printing).  Addison-Wesley, 1975, pp. 451-468.
+
+AVLtree was written by Gregory Tseytin, tseyting@acm.org.
+Port-ified by Bill Ross, bross@nas.nasa.gov and ross@cgl.ucsf.edu.
diff --git a/devel/avltree/pkg-plist b/devel/avltree/pkg-plist
new file mode 100644
index 000000000000..141879a89830
--- /dev/null
+++ b/devel/avltree/pkg-plist
@@ -0,0 +1,3 @@
+include/avltree.h
+lib/libavltree.a
+@exec ranlib %D/%F