Download Source Package libdatrie:
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.
This library is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. The details of the implementation can be found at http://linux.thai.net/~thep/datrie/datrie.html
This package contains the development libraries, header files and manpages you need to develop your programs using the datrie library.
|
|
|
| Architecture | Package Size | Installed Size | Files |
|---|---|---|---|
| alpha | 27.8 kB | 156 kB | [list of files] |
| amd64 | 23.9 kB | 128 kB | [list of files] |
| arm | 23.4 kB | 120 kB | [list of files] |
| armel | 22.5 kB | 120 kB | [list of files] |
| hppa | 24.0 kB | 124 kB | [list of files] |
| i386 | 22.3 kB | 76 kB | [list of files] |
| ia64 | 29.2 kB | 152 kB | [list of files] |
| mips | 24.4 kB | 128 kB | [list of files] |
| mipsel | 24.4 kB | 128 kB | [list of files] |
| powerpc | 23.1 kB | 124 kB | [list of files] |
| s390 | 24.0 kB | 124 kB | [list of files] |
| sparc | 22.3 kB | 120 kB | [list of files] |