libdatrie
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: http://linux.thai.net/~thep/datrie/datrie.html
Releases Overview
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 0.2.13-10.fc41 | - |
| Fedora 41 | 0.2.13-10.fc41 | - |
| Fedora 40 | 0.2.13-9.fc40 | - |
| Fedora 39 | 0.2.13-7.fc39 | - |
File a new bug report »
Package Info
Related Packages
Package Info
- Upstream: http://linux.thai.net/projects/datrie
- License(s): LGPL-2.1-or-later
- Maintainers: pwu, cicku, ueno
Related Packages
You can contact the maintainers of this package via email at
libdatrie dash maintainers at fedoraproject dot org.
Sources on Pagure