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

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

Branch: pkgsrc-2020Q3, Version: 0.2.12nb1, Package name: libdatrie-0.2.12nb1, 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: 8516d3c86e05338d3cd3ce0421181d66709dba18
RMD160: 8e29779b2f850830f9d2bb720cf21adc768333fd
Filesize: 302.965 KB

Version history: (Expand)