[ 原始碼： libdatrie ]
套件：libdatrie1-bin（0.2.13-2 以及其他的）
Programs 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 the program files which is used with the library, including trietool, the trie manipulation tool.
其他與 libdatrie1-bin 有關的套件
|
|
|
|
-
- dep: libc6 (>= 2.34)
- GNU C 函式庫：共用函式庫
同時作為一個虛擬套件由這些套件填實： libc6-udeb
-
- dep: libdatrie1 (>= 0.2.0)
- Double-array trie library