---
name: libstree
version: 0.4.2
origin: textproc/libstree
comment: A Generic Suffix Tree Library
arch: freebsd:9:x86:64
www: http://www.icir.org/christian/libstree/
maintainer: clsung@FreeBSD.org
prefix: /usr/local
licenselogic: single
flatsize: 89531
desc: "libstree is a generic suffix tree implementation, written in C. \nIt can handle
  arbitrary data structures as elements of a string. \nUnlike most demo implementations,
  it is not limited to simple ASCII \ncharacter strings. Suffix tree generation in
  libstree is highly \nefficient and implemented using the algorithm by Ukkonen, which
  \nmeans that libstree builds suffix trees in time linear to the length \nof the
  strings (assuming that string element comparisons can be done \nin O(1)).\n\nWWW:\thttp://www.icir.org/christian/libstree/\n"
categories: [textproc]
files:
  /usr/local/include/libstree.h: d0496bebbef8b85b496e23627faa26607251041d9763fc4f1a4d486033bd83fd
  /usr/local/include/stree/lst_algorithms.h: 76c1fc3e2c3e14bfaaf3daf52b4732ba9dbf5060a5ee07382a469dd123f9af78
  /usr/local/include/stree/lst_macros.h: 4b11837b4c394c9fcb61e378bdbadb7463874e3de277e54e38387931cac0143b
  /usr/local/include/stree/lst_stree.h: 8fa1990e6cccd0ac238302cca84c5bdd28304d541ca758b2f5ef978ddb898548
  /usr/local/include/stree/lst_string.h: 5c56e8f0d86cbfbf34403513bf9f648139f8ef028c0f638af301c6ad9554ba10
  /usr/local/include/stree/lst_structs.h: 04810c61b2746c47a0aa027bc99dc67852510cb6d0ec14d45bf557d3782be80e
  /usr/local/include/stree/lst_timestamp.h: f30e1ed513576c4ce7776bfd9452535ce649e022942c52f847dfd48e2846a209
  /usr/local/lib/libstree.a: 821a391fe67056318c26cee40f5dda1698b3f15a7d5a36b8e244da898e8175a2
  /usr/local/lib/libstree.la: 2d82361cd4b75fd19260e1fc9aef99ef17099b9afb22afd7ddc456a376aa9d8e
  /usr/local/lib/libstree.so: '-'
  /usr/local/lib/libstree.so.0: d6c99dc73f0b1e3b68f9fafe65304f2d804ebe5fad9aa83d75ec51923592eb9d
directories:
  /usr/local/include/stree/: n
scripts:
  post-install: |
    /sbin/ldconfig -m /usr/local/lib
  pre-deinstall: |
    /sbin/ldconfig -R
