forked from Lainports/opnsense-ports
8cb1a96ede
Taken from: https://github.com/freebsd/freebsd-ports.git Commit id: 5070672073b68be364139bc6b3a89100bd17d331
10 lines
459 B
Text
10 lines
459 B
Text
This is an implementation of double-array structure for representing trie,
|
|
as proposed by Junichi Aoe.
|
|
|
|
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 matching and key spelling
|
|
manipulation. This makes it ideal for lexical analyzers, as well as
|
|
spelling dictionaries.
|
|
|
|
WWW: http://linux.thai.net/projects/datrie/
|