Billion-query-per-second lookup tables in C++(lemire.me)
15 points by signa11 | 2 comments
Daniel Lemire blog post presenting a C++23 compile-time perfect hash library that uses SIMD string comparison to achieve ~1-2 ns lookups, benchmarked against gperf and std::unordered_map.