5 ms·

Is there something better than Swiss tables ?.

• szmarczak 3mo ago
  No. Fundamentally it's not possible to be faster.
  • infamouscow 3mo ago
    This is not true. It is fast as a general purpose hash table, but claiming it's the fastest across all datasets and workloads is silly.
    • szmarczak 3mo ago
      > claiming it's the fastest across all datasets I never claimed so. Please stop stating I said something when I didn't. > as a general purpose hash table That's what I claimed. The question IS about hash tables. If you want a hash table of any content, it's impossible to get faster. Unless you check all possible keys at once - only this will get you faster.
• reinitctxoffset 3mo ago
  On modern super wide znver5 or SBSA with full-clock scalar 256 or 512 ALUs / SIMD lanes deep pipelines hight BTB pressure eyc. it's just really difficult to make a priori statements about performance for a given workload. absl::flat_hash_map (or folly::F14) are great defaults if you can eat the invalidation semantics. But if it's really hot you measure by workload and have infrastructure to flag the right ones in. This seems promising. I'll start benching it alongside the other likely lads.