Jump to letter: [ 3ABCDEFGHIJKLMNOPQRSTUVWXYZ ]

libdatrie - Implementation of Double-Array structure for representing trie

Description:

datrie is an implementation of double-array structure for representing trie.

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.

Details of the implementation: http://linux.thai.net/~thep/datrie/datrie.html

Packages

- Rebuilt for https://fedoraproject.org/wiki/Fedora_23_Mass_Rebuild

Listing created by Repoview-0.6.6-7.fc23