In C++, std::set and std::map are typically implemented as RB trees. To compare the performance of those to a hash backed container, try std::unordered_set and

In C++, std::set and std::map are typically implemented as RB trees. To compare the performance of those to a hash backed container, try std::unordered_set and std::unordered_map.