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

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

Branch: pkgsrc-2009Q3, Version: 0.2.2, Package name: libdatrie-0.2.2, 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/libtool-base] [devel/pkg-config]

Master sites: (Expand)

SHA1: 10b04eb93e99a0708012e0dc8f73867e4d1a1f0a
RMD160: 19d001f31c2a97c98127641dca44c20714814c1f
Filesize: 342.923 KB

Version history: (Expand)