triehash 0.3-3 (i386 binary) in ubuntu noble
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.
Details
- Package version:
- 0.3-3
- Status:
- Published
- Component:
- universe
- Priority:
- Optional
Downloadable files
amd64 build of triehash 0.3-3 in ubuntu groovy PROPOSED produced
these files:
- triehash_0.3-3_all.deb (12.1 KiB)
Package relationships
- Depends on: