LibSTree is a library containing generic string algorithms based on suffix trees. The underlying implementation is based on Ukkonen's linear suffix tree creation algorithm, supporting multiple strings per tree.
45 lines
1.5 KiB
Text
45 lines
1.5 KiB
Text
@comment $NetBSD: PLIST,v 1.1.1.1 2003/12/04 04:52:46 gson Exp $
|
|
include/libstree.h
|
|
include/stree/lst_algorithms.h
|
|
include/stree/lst_macros.h
|
|
include/stree/lst_stree.h
|
|
include/stree/lst_string.h
|
|
include/stree/lst_structs.h
|
|
include/stree/lst_timestamp.h
|
|
lib/libstree.a
|
|
lib/libstree.la
|
|
lib/libstree.so
|
|
lib/libstree.so.0
|
|
lib/libstree.so.0.0
|
|
share/doc/html/libstree/a1501.html
|
|
share/doc/html/libstree/a1502.html
|
|
share/doc/html/libstree/a1503.html
|
|
share/doc/html/libstree/a1543.html
|
|
share/doc/html/libstree/about.html
|
|
share/doc/html/libstree/api.html
|
|
share/doc/html/libstree/b1513.html
|
|
share/doc/html/libstree/b1514.html
|
|
share/doc/html/libstree/b1515.html
|
|
share/doc/html/libstree/b1555.html
|
|
share/doc/html/libstree/c14.html
|
|
share/doc/html/libstree/c15.html
|
|
share/doc/html/libstree/c16.html
|
|
share/doc/html/libstree/c39.html
|
|
share/doc/html/libstree/c40.html
|
|
share/doc/html/libstree/c41.html
|
|
share/doc/html/libstree/index.html
|
|
share/doc/html/libstree/index.sgml
|
|
share/doc/html/libstree/libstree-lst-algorithms.html
|
|
share/doc/html/libstree/libstree-lst-debug.html
|
|
share/doc/html/libstree/libstree-lst-stree.html
|
|
share/doc/html/libstree/libstree-lst-string.html
|
|
share/doc/html/libstree/libstree-lst-structs.html
|
|
share/doc/html/libstree/stylesheet.css
|
|
share/doc/html/libstree/x22.html
|
|
share/doc/html/libstree/x23.html
|
|
share/doc/html/libstree/x24.html
|
|
share/doc/html/libstree/x36.html
|
|
share/doc/html/libstree/x37.html
|
|
share/doc/html/libstree/x38.html
|
|
@dirrm share/doc/html/libstree
|
|
@dirrm include/stree
|