6 lines
250 B
Plaintext
6 lines
250 B
Plaintext
|
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.
|