libdatrie: libdatrie 0.2.13 (Trie C Library)
libdatrie: 
libdatrie: This is an implementation of double-array structure for representing 
libdatrie: trie, as proposed by Junichi Aoe [1]. Trie is a data structure that 
libdatrie: provides efficient incremental matching, independent of database 
libdatrie: size. It only takes O(m) search time, where m is the length of the 
libdatrie: search string. It is comparably as efficient as hashing.
libdatrie: 
libdatrie: https://github.com/tlwg/libdatrie
libdatrie: https://linux.thai.net/~thep/datrie/datrie.html
libdatrie: 

