News for hackers. Stuff that matters.
Re:Modern Perfect Hashing by adzm on Friday October 24, 2025 @05:07PM (#45699098)
Make sure to read the post linked right at the beginning as well: http://0x80.pl/notesen/2023-04-30-lookup-in-strings.html as well as the magic bitboards linked, too https://www.chessprogramming.org/Magic_Bitboards

Though honestly this post really needed some numbers and benchmarks.

Re:Modern Perfect Hashing by Sesse__ on Friday October 24, 2025 @05:18PM (#45699197)
I never really finished the project, thus only the rough qualitative benchmarks you get at the bottom (measured mostly by profiling and size(1)); I saw that it wasn't enough of a win in the larger context where I needed it, thus it made sense to stop early instead of making exhaustive benchmarks.

The blog post was mainly for curious readers, I'm surprised it hit HN at all. :-)

Re:Modern Perfect Hashing by jibal on Friday October 24, 2025 @06:15PM (#45699650)
gperf is very limited in the number of keys it can handle as opposed to, say, https://burtleburtle.net/bob/hash/perfect.html
Re:Modern Perfect Hashing by Sesse__ on Friday October 24, 2025 @06:22PM (#45699708)
Well, again, different problem constraints, different solutions. Seemingly that tool can handle larger sets than gperf (although it claims gperf stops at a couple hundred, which is an exaggeration; try it with the first 1000 lines of /usr/dict/words and it's nearly instant, and with the first 10k it needs 35 seconds or so), but it also says the runtime is even slower. My goal was to have faster runtime, not handle more keys. YMMV.
Re:Modern Perfect Hashing by jibal on Friday October 24, 2025 @06:38PM (#45699823)
Not an exaggeration, just written when machines were a lot slower. Anyway, more work in this space is always welcome, so thanks.