Billion-query-per-second lookup tables in C++

A C++ library enables compile-time construction of perfect hash functions that eliminate collisions for known, static string-to-value mappings, allowing billion-query-per-second lookups with a single hash computation and comparison instead of the runtime overhead of std::unordered_map. The approach, based on the classic gperf tool, works by computing slot positions using key length plus values from an association table indexed by selected characters, with optimal association values determined through a greedy algorithm executed at compile time.