[ 原始碼： libdatrie ]
套件：libdatrie-doc（0.2.13-3）
Documentation files for double-array trie library
Trie is a kind of digital search tree, an efficient indexing method in which search time is independent of database size. It only takes O(m) search time, where m is the length of the search string. 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 https://linux.thai.net/~thep/datrie/datrie.html
This package contains some documents about the datrie library.
其他與 libdatrie-doc 有關的套件
|
|
|
|
-
- dep: libjs-jquery
- JavaScript library for dynamic web applications
-
- sug: www-browser
- 本虛擬套件由這些套件填實： chromium, dillo, edbrowse, elinks, epiphany-browser, falkon, firefox, firefox-esr, hv3, konqueror, links, links2, luakit, lynx, morph-browser, netrik, netsurf-fb, netsurf-gtk, qutebrowser, sugar-browse-activity, surf, w3m, xemacs21-gnome-mule, xemacs21-gnome-mule-canna-wnn, xemacs21-gnome-nomule, xemacs21-mule, xemacs21-mule-canna-wnn, xemacs21-nomule