trietool
Development files for libdatrie
Install
- All systems
-
curl cmd.cat/trietool.sh
- Debian
-
apt-get install libdatrie1-bin
- Ubuntu
-
apt-get install libdatrie1-bin
- Arch Linux
-
pacman -S libdatrie
- Kali Linux
-
apt-get install libdatrie1-bin
- Fedora
-
dnf install libdatrie-devel
- Windows (WSL2)
-
sudo apt-get update
sudo apt-get install libdatrie1-bin
- Raspbian
-
apt-get install libdatrie1-bin
- Dockerfile
- dockerfile.run/trietool
libdatrie-devel
Development files for libdatrie
libdatrie1-bin
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.
libdatrie
datrie is an implementation of double-array structure for
representing 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