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).
Linear search generally does outperform for small collections though (itβs better for caches and the branch predictor).
See: https://en.cppreference.com/w/cpp/header/flat_map