hash_map vs unordered_map

hash_map is Visual C++ specific and unordered_map is from the standard.
Both work the same storing everything in "buckets" based on hash values generated from their keys.

So why is there a hash_map in Visual C++, what does this provide that unordered_map does not?
A small google search tells me that they implemented hash_map before unordered_map was introduced in C++11 and I guess it is just there still.

If anyone knows more please tell me!
What more do you want? You already answered your own question. Research first then ask.
If there is anymore to know, maybe a different reason. But ok, I shall do research first and then ask.
The hash_map documentation for Visual Studio 2012 says
This API is obsolete. The alternative is unordered_map Class.
Alright thanks!


So I should never use hash_map.
Topic archived. No new replies allowed.