| Paketname | libdatrie-doc |
| Beschreibung | Documentation files for double-array trie library |
| Archiv/Repository | Offizielles Ubuntu Archiv lucid (main) |
| Version | 0.2.2-3 |
| Sektion | doc |
| Priorität | optional |
| Installierte Größe | 188 Byte |
| Hängt ab von | lynx | www-browser |
| Empfohlene Pakete | |
| Paketbetreuer | Ubuntu Developers |
| Quelle | libdatrie |
| Paketgröße | 36612 Byte |
| Prüfsumme MD5 | 8e676834e51076be77abb6fa4fe025dd |
| Prüfsumme SHA1 | 8e432404507d6296c3e44c0255f86ad33a70130f |
| Prüfsumme SHA256 | 72cd2bba271927a02dcb1d491945f680bba362d8449130005b9b6fa8ecd153ea |
| Link zum Herunterladen | libdatrie-doc_0.2.2-3_all.deb |
| Ausführliche Beschreibung | 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.
.
This library is an implementation of double-array structure for representing
trie, as proposed by Junichi Aoe. The details of the implementation can be
found at http://linux.thai.net/~thep/datrie/datrie.html
.
This package contains some documents about the datrie library.
|