Binary package “triehash” in openkylin huanghe
Generates perfect hash functions as native machine code
TrieHash generates perfect hash functions as C code which then gets
compiled into optimal machine code as part of the usual program compilation.
.
TrieHash works by translating a list of strings to a trie, and then converting
the trie to a set of recursive switch statements; first switching by length,
and then switching by bytes.
.
TrieHash has various optimizations such as processing multiple bytes at once
(on GNU C), and shortcuts for reducing the complexity of case-insensitive
matching (ASCII only). Generated code performs substantially faster than
gperf, but is larger.
.
TrieHash was written for use in APT.
Source package
Published versions
- triehash 0.3-ok1 in amd64 (Proposed)
- triehash 0.3-ok1 in amd64 (Release)
- triehash 0.3-ok1 in arm64 (Proposed)
- triehash 0.3-ok1 in arm64 (Release)
- triehash 0.3-ok1 in i386 (Proposed)
- triehash 0.3-ok1 in i386 (Release)
- triehash 0.3-ok1 in loong64 (Proposed)
- triehash 0.3-ok1 in loong64 (Release)
- triehash 0.3-ok1 in riscv64 (Proposed)
- triehash 0.3-ok1 in riscv64 (Release)
- triehash 0.3-ok1 in rv64g (Proposed)
- triehash 0.3-ok1 in rv64g (Release)