3 ms·

These are flat_map, flat_set, flat_hash_map, etc ... See: https://en.cppreference.com/w/cpp/header/flat_map https://en.cppreference.com/w/cpp/header/flat_map

• usefulcat 4y ago
  I believe that flat_map and flat_set at least are sorted, so that binary_search/lower_bound can be used for lookups. Linear search generally does outperform for small collections though (it’s better for caches and the branch predictor).
• asveikau 4y ago
  C++23! The future is here.