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

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

Branch: pkgsrc-2013Q3, Version: 0.2.6, Package name: libdatrie-0.2.6, 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: ab538194c627f16993ea6391db04cec914ef25ef
RMD160: c8b34e7f085a17307846ba28936cb03442c32b11
Filesize: 262.977 KB

Version history: (Expand)