I know that there std::unordered_map
uses hashing and works 4x faster than std::map
. I also know that std::unordered_map
has bad hashing which if not using any custom hashing, may result in getting hacked. Credit to blog about ways to prevent getting hacked blog. Is there any way for std::map
to work a fast as std::unordered_map
so that I can use functionalities such as lower_bound and upper_bound and not getting hacked? Thanks.