Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: libdatrie1 | Distribution: Mageia |
Version: 0.2.13 | Vendor: Mageia.Org |
Release: 3.mga10 | Build date: Thu Jun 26 09:12:45 2025 |
Group: System/Libraries | Build host: localhost |
Size: 23916 | Source RPM: libdatrie-0.2.13-3.mga10.src.rpm |
Packager: umeabot <umeabot> | |
Url: https://linux.thai.net/ | |
Summary: Double-array structure for representing trie |
This 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.
LGPLv2+ and GPLv2+
* Thu Jun 26 2025 umeabot <umeabot> 0.2.13-3.mga10 + Revision: 2196607 - Mageia 10 Mass Rebuild
/usr/lib/.build-id /usr/lib/.build-id/65 /usr/lib/.build-id/65/5ecb28c33dbf59bddb8ff848279f14ad5812d7 /usr/lib/libdatrie.so.1 /usr/lib/libdatrie.so.1.4.0
Generated by rpm2html 1.8.1
Fabrice Bellet, Fri Jun 27 04:23:55 2025