summaryrefslogtreecommitdiff
path: root/textproc/libstree
diff options
context:
space:
mode:
authorRenato Botelho <garga@FreeBSD.org>2006-03-15 10:40:38 +0000
committerRenato Botelho <garga@FreeBSD.org>2006-03-15 10:40:38 +0000
commit0a4fa21bc3a2344cb5ee3d7747003f6e6928446b (patch)
treee44b3011e69943165904da8e6a060e6a00d4bdab /textproc/libstree
parentUpdate to 0.14 (diff)
Add libstree 0.4.2, a Generic Suffix Tree Library.
PR: ports/94008 Submitted by: clsung
Notes
Notes: svn path=/head/; revision=157206
Diffstat (limited to 'textproc/libstree')
-rw-r--r--textproc/libstree/Makefile24
-rw-r--r--textproc/libstree/distinfo3
-rw-r--r--textproc/libstree/pkg-descr10
-rw-r--r--textproc/libstree/pkg-plist12
4 files changed, 49 insertions, 0 deletions
diff --git a/textproc/libstree/Makefile b/textproc/libstree/Makefile
new file mode 100644
index 000000000000..cde2b1131daf
--- /dev/null
+++ b/textproc/libstree/Makefile
@@ -0,0 +1,24 @@
+# Ports collection makefile for: libstree
+# Date created: Thu Mar 2 08:50:15 CST 2006
+# Whom: clsung
+#
+# $FreeBSD$
+#
+
+PORTNAME= libstree
+PORTVERSION= 0.4.2
+CATEGORIES= textproc
+MASTER_SITES= http://www.cl.cam.ac.uk/~cpk25/downloads/
+
+MAINTAINER= clsung@FreeBSD.org
+COMMENT= A Generic Suffix Tree Library
+
+GNU_CONFIGURE= yes
+USE_GMAKE= yes
+INSTALLS_SHLIB= yes
+
+post-patch:
+ @${REINPLACE_CMD} -e 's,^\(SUBDIRS = src test\) docs,\1,' \
+ ${WRKSRC}/Makefile.in
+
+.include <bsd.port.mk>
diff --git a/textproc/libstree/distinfo b/textproc/libstree/distinfo
new file mode 100644
index 000000000000..11d7209bfcfc
--- /dev/null
+++ b/textproc/libstree/distinfo
@@ -0,0 +1,3 @@
+MD5 (libstree-0.4.2.tar.gz) = 1d3e13e1cb3169fefce7052fc4b3fa73
+SHA256 (libstree-0.4.2.tar.gz) = 6a9d6ea2ed776d449397f5f35d9135609aa5e91e9e6361dec5f4df5d252ae2b6
+SIZE (libstree-0.4.2.tar.gz) = 334483
diff --git a/textproc/libstree/pkg-descr b/textproc/libstree/pkg-descr
new file mode 100644
index 000000000000..efaabe86bf8a
--- /dev/null
+++ b/textproc/libstree/pkg-descr
@@ -0,0 +1,10 @@
+libstree is a generic suffix tree implementation, written in C.
+It can handle arbitrary data structures as elements of a string.
+Unlike most demo implementations, it is not limited to simple ASCII
+character strings. Suffix tree generation in libstree is highly
+efficient and implemented using the algorithm by Ukkonen, which
+means that libstree builds suffix trees in time linear to the length
+of the strings (assuming that string element comparisons can be done
+in O(1)).
+
+WWW: http://www.cl.cam.ac.uk/~cpk25/libstree/
diff --git a/textproc/libstree/pkg-plist b/textproc/libstree/pkg-plist
new file mode 100644
index 000000000000..455b6d7d0c1c
--- /dev/null
+++ b/textproc/libstree/pkg-plist
@@ -0,0 +1,12 @@
+include/libstree.h
+include/stree/lst_macros.h
+include/stree/lst_stree.h
+include/stree/lst_string.h
+include/stree/lst_structs.h
+include/stree/lst_algorithms.h
+include/stree/lst_timestamp.h
+@dirrm include/stree
+lib/libstree.so.0
+lib/libstree.so
+lib/libstree.la
+lib/libstree.a