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

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

Branch: pkgsrc-2018Q2, Version: 0.2.11, Package name: libdatrie-0.2.11, Maintainer: pkgsrc-users

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:

SHA1: 29689f5fcd4a6be42ea77edbbee6d4a421966084
RMD160: 57d7d19ef9e38a0f231a2c2456ffed47b74d0cda
Filesize: 301.926 KB

Version history: (Expand)