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

Classic Lemire post, squeezing lookup tables down to cache friendly structures. Always amazes me how much perf is left on the table in 'simple' code. Anyone applied these tricks outside of benchmarks?