libdatrie - An Implementation of Double-Array Trie
Trie is a kind of digital search tree, an efficient indexing method
in which search time is independent of database size. It only takes
O(m) search time, where m is the length of the search string.
Maintained by: fuzzix
Keywords: datrie,double,array,trie,algorithm
ChangeLog: libdatrie
Homepage:
https://linux.thai.net/~thep/datrie/datrie.html
Download SlackBuild:
libdatrie.tar.gz
libdatrie.tar.gz.asc (FAQ)
(the SlackBuild does not include the source)
Individual Files: |
README |
libdatrie.SlackBuild |
libdatrie.info |
slack-desc |
© 2006-2025 SlackBuilds.org Project. All rights reserved.
Slackware® is a registered trademark of
Patrick Volkerding
Linux® is a registered trademark of
Linus Torvalds