Will std::set and std::unordered_set implement extra optimizations for low-number of expected unique values with too many duplicates?

This page summarizes the projects mentioned and recommended in the original post on /r/cpp

WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors

  • flat_hash_map

    A very fast hashtable

    • I have done similar benchmarks (with a lot of care) a few months ago, but the results were different than yours when using a very fast hash map. I was surprised that even for small maps, flat_hash_map was faster than searching small arrays (searching int64_t).

  • hash-table-shootout

    A benchmark of some prominent C/C++ hash table implementations

  • WorkOS

    The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

    WorkOS logo
NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a more popular project.

Suggest a related project

Related posts