std::map and std::set are designed to support a large set of use cases, and as a result, cannot really be optimized. In particular, the iterator invalidation se

std::map and std::set are designed to support a large set of use cases, and as a result, cannot really be optimized. In particular, the iterator invalidation semantics prevent implementers from using more cache-friendly data structures like B-trees.