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

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

Branch: pkgsrc-2010Q1, Version: 0.2.3, Package name: libdatrie-0.2.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/pkg-config]

Master sites: (Expand)

SHA1: b5cc81aac438b46e6c79178ea069548ff86b38cb
RMD160: de08e964a0c793b9f0b03f16ffd45b7aa0883df2
Filesize: 350.023 KB

Version history: (Expand)