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

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

Branch: pkgsrc-2009Q1, Version: 0.1.3, Package name: libdatrie-0.1.3, 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]

Master sites:

SHA1: 5a41b911885e0aae84e9546df8f509e5949f2b07
RMD160: 2a9825ecedaf03dace1eec1a5fc2a1bb22668b8c
Filesize: 349.209 KB

Version history: (Expand)