triehash 0.3-ok1 source package in openKylin
Changelog
triehash (0.3-ok1) yangtze; urgency=medium * Build for openKylin. -- denghao <email address hidden> Thu, 02 Feb 2023 15:41:14 +0800
triehash (0.3-ok1) yangtze; urgency=medium * Build for openKylin. -- denghao <email address hidden> Thu, 02 Feb 2023 15:41:14 +0800
Series | Published | Component | Section | |
---|---|---|---|---|
Nile V2.0 | proposed | main | devel | |
Nile V2.0 | release | main | devel | |
Yangtze V1.0 | release | main | devel | |
Yangtze V1.0 | proposed | main | devel |
File | Size | SHA-256 Checksum |
---|---|---|
triehash_0.3.orig.tar.gz | 92.1 KiB | 84efdce75fef725b5fd44dbf845e427973cbdb186ca58397a9e4780c8b809d4e |
triehash_0.3-ok1.debian.tar.xz | 2.3 KiB | 1d8743178a0a60053d23d8b2e1ced6fa193791a9d0428df81453b9f68931ff5c |
triehash_0.3-ok1.dsc | 1.6 KiB | 61dcb8c6c75ab53981be27df87700dc46561a5b15ebdfd50320fb9dab588faff |
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.