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: 2.mga9 | Build date: Sat Mar 19 08:01:58 2022 |
Group: System/Libraries | Build host: localhost |
Size: 40620 | Source RPM: libdatrie-0.2.13-2.mga9.src.rpm |
Packager: umeabot <umeabot> | |
Url: http://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+
* Sat Mar 19 2022 umeabot <umeabot> 0.2.13-2.mga9 + Revision: 1799822 - Mageia 9 Mass Rebuild * Sun Apr 18 2021 daviddavid <daviddavid> 0.2.13-1.mga9 + Revision: 1716355 - new version: 0.2.13
/usr/lib/.build-id /usr/lib/.build-id/32 /usr/lib/.build-id/32/bcca6b86e80640836b20821f200d4161bbf6e9 /usr/lib/libdatrie.so.1 /usr/lib/libdatrie.so.1.4.0
Generated by rpm2html 1.8.1
Fabrice Bellet, Wed Oct 30 10:42:39 2024