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

(lemire.me)

3 points | by smilelamp 6 hours ago ago

1 comments

  • rurban 6 hours ago ago

    Beating gperf is nice and easy, but only for very small sets. Once you get to millions of strings to compare pthash will beat it. Or my statically compiled pthash, once the c++ reflection compilers get good enough