summaryrefslogtreecommitdiffstats
path: root/libraries/libdatrie/README
blob: b850b8af35d17245d5a30be5a6336209124ab9cb (plain)
1
2
3
4
5
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.