Package libdatrie: Information

Source package: libdatrie
Version: 0.2.9-alt1_6
Build time:  Dec 10, 2020, 03:30 PM
Category: System/Libraries
Report package bug
License: LGPLv2+
Summary: Implementation of Double-Array structure for representing trie
datrie is an implementation of double-array structure for representing trie.

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.

Details of the implementation:

List of rpms provided by this srpm:
libdatrie (e2kv5, e2kv4, e2k)
libdatrie-debuginfo (e2kv5, e2kv4, e2k)
libdatrie-devel (e2kv5, e2kv4, e2k)
libdatrie-devel-debuginfo (e2kv5, e2kv4, e2k)

Maintainer: Igor Vlasenko

List of contributors:
Igor Vlasenko

    1. autoconf
    2. automake
    3. libtool
    4. doxygen

Last changed

Nov. 26, 2017 Igor Vlasenko 0.2.9-alt1_6
- new version
Sept. 8, 2014 Igor Vlasenko 0.2.8-alt1_5
- new version