triehash binary package in openKylin Yangtze V1.0 arm64
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.
Publishing history
Date | Status | Target | Component | Section | Priority | Phased updates | Version | ||
---|---|---|---|---|---|---|---|---|---|
2023-07-05 02:27:38 UTC | Published | openKylin Yangtze V1.0 arm64 | release | main | devel | Optional | 0.3-ok1 | ||
|
|||||||||
2023-02-08 09:44:20 UTC | Published | openKylin Yangtze V1.0 arm64 | proposed | main | devel | Optional | 0.3-ok1 | ||
|