Package: libdatrie-dev (0.2.13-3)
Links for libdatrie-dev
Debian Resources:
Download Source Package libdatrie:
Maintainer:
External Resources:
- Homepage [linux.thai.net]
Similar packages:
Development 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 the development libraries, header files and manpages you need to develop your programs using the datrie library.
Other Packages Related to libdatrie-dev
|
|
|
|
-
- dep: libdatrie1 (= 0.2.13-3)
- Double-array tried 라이브러리
-
- dep: pkgconf
- manage compile and link flags for libraries
-
- sug: libdatrie-doc (= 0.2.13-3)
- Documentation files for double-array trie library
Download libdatrie-dev
Architecture | Package Size | Installed Size | Files |
---|---|---|---|
armhf | 14.9 kB | 60.0 kB | [list of files] |