This is an implementation of double-array structure for representing trie,
as proposed by Junichi Aoe [1].
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental m ...
/dl/409492.html
标签：
implementation
double-array
representing
structure
上传时间：
2013-12-10
上传用户：shinesyh
