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

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

Branch: pkgsrc-2014Q1, Version: 0.2.8, Package name: libdatrie-0.2.8, 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: cf064f97ef10ee297c15e45463fab87cc6fad0dc
RMD160: b03871d76916b139d629d0f12fc484ef57e1aa3f
Filesize: 279.715 KB

Version history: (Expand)