rurban/Perfect-Hash
View on GitHub ↗ ★ 79 C
generate perfect hashes (alpha)
5 mentions on Hacker News by 1 person: 0 stories, 5 comments · first 2015-03-19 · latest 2024-12-30
20082026
-
gperf or nbperf, but there are other methods also, benchmarked in my Perfect::Hash perl module. https://github.com/rurban/Perfect-Hash?tab=readme-ov-file#be...
comment by rurban · 2024-12-30 · in How to create an efficient static hash table? -
…But I haven't added this NetBSD code yet and also not yet the new perl5 mph code, will do soon. https://github.com/rurban/Perfect-Hash
comment by rurban · 2019-01-11 · in Use perfect hashing, instead of binary search, for keyword lookup -
…smaller hash tables a simple perfect hash or even an optimized memcmp switch table is still faster. https://github.com/rurban/Perfect-Hash#benchmarks cmph is usually 2-3x slower than a trivial PH, and much slower for small tables.
comment by rurban · 2018-02-03 · in Minimal Perfect Hash-Tables in Common Lisp -
…is a high constant overhead and a high run-time overhead with the 2 hashes. For comparisons see https://github.com/rurban/Perfect-Hash#benchmarks
comment by rurban · 2015-12-18 · in O(1) Data Lookups with Minimal Perfect Hashing -
…project, and will come back to this one soon. EDIT: I've renamed the frontend to "pperf" now https://github.com/rurban/Perfect-Hash/commit/b475886f37d9 But the memcmp trick with unrolling of the comparisons beforehand for constant keys is…
comment by rurban · 2015-03-19 · in Perfect Hashes and faster than memcmp