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

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

Branch: pkgsrc-2018Q1, Version: 0.2.10, Package name: libdatrie-0.2.10, 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: 29162b5a63b75f54bb00f6b60fb8a9fb8502d89b
RMD160: 7af9ebbd93a667a8db15a013d9bd75fc93bdd886
Filesize: 287.48 KB

Version history: (Expand)