Group :: System/Libraries
RPM: libdatrie
Navigation
Main Changelog Spec Patches Sources Download Gear Bugs and FR Repocop
Current version: 0.2.13-alt1_7
Build date: 29 august 2023, 17:48 ( 34.0 weeks ago )
Size: 315.92 Kb
Home page: http://linux.thai.net/projects/datrie
License: LGPL-2.1-or-later
Summary: Implementation of Double-Array structure for representing trie
Description:
List of contributors List of rpms provided by this srpm:
ACL:
Build date: 29 august 2023, 17:48 ( 34.0 weeks ago )
Size: 315.92 Kb
Home page: http://linux.thai.net/projects/datrie
License: LGPL-2.1-or-later
Summary: Implementation of Double-Array structure for representing trie
Description:
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: http://linux.thai.net/~thep/datrie/datrie.html
Current maintainer: Igor Vlasenko 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: http://linux.thai.net/~thep/datrie/datrie.html
List of contributors List of rpms provided by this srpm:
- libdatrie
- libdatrie-debuginfo
- libdatrie-devel
- libdatrie-devel-debuginfo