No votes yet

Programs for double-array trie library
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
This package contains the program files which is used with the library,
including trietool, the trie manipulation tool.

Application versions: 
File libdatrie1-bin_0.2.4-1_armel.deb23.69 KB05/08/2013 - 10:57

libdatrie (0.2.4-1) unstable; urgency=low

* New upstream release
- debian/libdatrie1.symbols: Add new symbols according to upstream.
* Bump Standards-Version to 3.9.0 (no changes needed)