Пакет: libdatrie-dev (0.2.13-3)
Ссылки для libdatrie-dev
Ресурсы Debian:
- Сообщения об ошибках
- Developer Information
- Debian журнал изменений
- Файл авторских прав
- Отслеживание заплат Debian
Исходный код libdatrie:
Сопровождающий:
Внешние ресурсы:
- Сайт [linux.thai.net]
Подобные пакеты:
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.
Другие пакеты, относящиеся к libdatrie-dev
|
|
|
|
-
- dep: libdatrie1 (= 0.2.13-3)
- реализация двухмассивного префиксного дерева
-
- dep: pkgconf
- manage compile and link flags for libraries
-
- sug: libdatrie-doc (= 0.2.13-3)
- Documentation files for double-array trie library
Загрузка libdatrie-dev
Архитектура | Размер пакета | В установленном виде | Файлы |
---|---|---|---|
mips64el | 18,9 Кб | 102,0 Кб | [список файлов] |