Trietool-0.2 Installation On A Debian, Ubuntu, Arch, Kali, Fedora And Raspbian
trietool-0.2
Programs for double-array trie library
Install trietool-0.2
-
Debian
apt-get install libdatrie1-binClick to copy -
Ubuntu
apt-get install libdatrie1-binClick to copy -
Arch Linux
pacman -S libdatrieClick to copy -
Kali Linux
apt-get install libdatrie1-binClick to copy -
Fedora
dnf install libdatrie-develClick to copy -
Raspbian
apt-get install libdatrie1-binClick to copy
libdatrie1-bin
Programs for double-array trie libraryTrie 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.
libdatrie-devel
Development files for libdatrielibdatrie
datrie is an implementation of double-array structure forrepresenting trie. 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. Details of the implementation: http://linux.thai.net/~thep/datrie/datrie.html