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

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

Branch: pkgsrc-2021Q1, Version: 0.2.13, Package name: libdatrie-0.2.13, 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: ff3d30605fdc9a226e7acde8de3752125b3a8791
RMD160: ecc5608111427f537e0f1b825275a191f3080eca
Filesize: 306.711 KB

Version history: (Expand)