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

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

Branch: pkgsrc-2011Q3, Version: 0.2.4, Package name: libdatrie-0.2.4, 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.


Required to build:
[devel/pkg-config] [devel/libtool-base]

Master sites: (Expand)

SHA1: 723fb01530c7917982cfdd68deb2361d16a6e6ab
RMD160: 49b05944ea7cb943cd896df82c7be1f91a434651
Filesize: 351.229 KB

Version history: (Expand)