for loop一个unordered_map，顺序得到的元素就是按照插入顺序来的吗?

asker160

我发现，我如果遍历一个unordered_map的元素，得到的输出顺序就是我当初插入元素的顺序。
这个是C++标准规定的，还是取决于实现的? 我的代码可以依赖于这个特性吗?

lxyscls

Internally, the elements are not sorted in any particular order, but organized into buckets. Which bucket an element is placed into depends entirely on the hash of its key. This allows fast access to individual elements, since once the hash is computed, it refers to the exact bucket the element is placed into.

http://en.cppreference.com/w/cpp/container/unordered_map

windoze

当然




















不是。
要不然怎么叫unordered_map