Date: Thu, 2 Mar 2006 09:27:19 +0800 (CST) From: Cheng-Lung Sung <clsung@FreeBSD.org> To: FreeBSD-gnats-submit@FreeBSD.org Subject: ports/94008: [NEW PORT] textproc/libstree: A Generic Suffix Tree Library Message-ID: <20060302012719.7E6417E9AF@FreeBSD.csie.nctu.edu.tw> Resent-Message-ID: <200603020130.k221U54Z002707@freefall.freebsd.org>
next in thread | raw e-mail | index | archive | help
>Number: 94008 >Category: ports >Synopsis: [NEW PORT] textproc/libstree: A Generic Suffix Tree Library >Confidential: no >Severity: non-critical >Priority: low >Responsible: freebsd-ports-bugs >State: open >Quarter: >Keywords: >Date-Required: >Class: change-request >Submitter-Id: current-users >Arrival-Date: Thu Mar 02 01:30:05 GMT 2006 >Closed-Date: >Last-Modified: >Originator: Cheng-Lung Sung >Release: FreeBSD 6.0-STABLE i386 >Organization: FreeBSD @ Taiwan >Environment: System: FreeBSD FreeBSD.csie.nctu.edu.tw 6.0-STABLE FreeBSD 6.0-STABLE #3: Fri Nov 25 11:26:33 CST 2005 >Description: 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/ Generated with FreeBSD Port Tools 0.63 >How-To-Repeat: >Fix: --- libstree-0.4.2.shar begins here --- # This is a shell archive. Save it in a file, remove anything before # this line, and then unpack it by entering "sh file". Note, it may # create directories; files and directories will be owned by you and # have default permissions. # # This archive contains: # # libstree # libstree/Makefile # libstree/pkg-descr # libstree/distinfo # libstree/pkg-plist # echo c - libstree mkdir -p libstree > /dev/null 2>&1 echo x - libstree/Makefile sed 's/^X//' >libstree/Makefile << 'END-of-libstree/Makefile' X# ex:ts=8 X# Ports collection makefile for: libstree X# Date created: Thu Mar 2 08:50:15 CST 2006 X# Whom: clsung X# X# $FreeBSD$ X# X XPORTNAME= libstree XPORTVERSION= 0.4.2 XCATEGORIES= textproc XMASTER_SITES= http://www.cl.cam.ac.uk/~cpk25/downloads/ X XMAINTAINER= clsung@FreeBSD.org XCOMMENT= A Generic Suffix Tree Library X XGNU_CONFIGURE= yes XUSE_GMAKE= yes XINSTALLS_SHLIB= yes X X.include <bsd.port.mk> END-of-libstree/Makefile echo x - libstree/pkg-descr sed 's/^X//' >libstree/pkg-descr << 'END-of-libstree/pkg-descr' Xlibstree is a generic suffix tree implementation, written in C. XIt can handle arbitrary data structures as elements of a string. XUnlike most demo implementations, it is not limited to simple ASCII Xcharacter strings. Suffix tree generation in libstree is highly Xefficient and implemented using the algorithm by Ukkonen, which Xmeans that libstree builds suffix trees in time linear to the length Xof the strings (assuming that string element comparisons can be done Xin O(1)). X XWWW: http://www.cl.cam.ac.uk/~cpk25/libstree/ END-of-libstree/pkg-descr echo x - libstree/distinfo sed 's/^X//' >libstree/distinfo << 'END-of-libstree/distinfo' XMD5 (libstree-0.4.2.tar.gz) = 1d3e13e1cb3169fefce7052fc4b3fa73 XSHA256 (libstree-0.4.2.tar.gz) = 6a9d6ea2ed776d449397f5f35d9135609aa5e91e9e6361dec5f4df5d252ae2b6 XSIZE (libstree-0.4.2.tar.gz) = 334483 END-of-libstree/distinfo echo x - libstree/pkg-plist sed 's/^X//' >libstree/pkg-plist << 'END-of-libstree/pkg-plist' Xinclude/libstree.h Xinclude/stree/lst_macros.h Xinclude/stree/lst_stree.h Xinclude/stree/lst_string.h Xinclude/stree/lst_structs.h Xinclude/stree/lst_algorithms.h Xinclude/stree/lst_timestamp.h Xlib/libstree.so.0 Xlib/libstree.so Xlib/libstree.la Xlib/libstree.a END-of-libstree/pkg-plist exit --- libstree-0.4.2.shar ends here --- >Release-Note: >Audit-Trail: >Unformatted:
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20060302012719.7E6417E9AF>