Package : libdatrie > RPM : libdatrie-0.2.12-1.mga7.src.rpm
Basic items
| Name | libdatrie |
| Version | 0.2.12 |
| Release | 1.mga7 |
| URL | http://linux.thai.net |
| Group | System/Libraries |
| Summary | Double-array structure for representing trie |
| Size | 316KB |
| Arch | aarch64 |
| License | LGPLv2+ and GPLv2+ |
Description
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.
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.
Media information
| Distribution release | Mageia 7 |
| Media name | core-release |
| Media arch | i586 |
Advanced items
| Source RPM | NOT IN DATABASE ?! |
| Build time | 2018-12-30 02:29:06 |
| Changelog | View in Sophie |
| Files | View in Sophie |
| Dependencies | View in Sophie |