./devel/libdatrie, Implementation of Double-Array Trie

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: pkgsrc-2013Q1, Version: 0.2.5, Package name: libdatrie-0.2.5, Maintainer: obache

datrie 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.

Master sites: (Expand)

SHA1: 433d12351e7cf728e2f0ac68dd59b12b0026bf6d
RMD160: 714187f16cbc328b8c2d5184db80cfed0393cace
Filesize: 372.37 KB

Version history: (Expand)