blob: 9413fb811023b71ab03891e283309af8e757b0c2 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
|
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: https://linux.thai.net/projects/datrie/
|
