title: Does std::unordered_map equality depend on insertion order
body: <p>If you create two <code>std::unordered_map</code> containers using the same set of (non equal) key-value pairs, but inserted in a different order (so the containers hold equal elements, but potentially in different orders), are the containers guaranteed to be equal, according to the equality operator (<a href="https://en.cppreference.com/w/cpp/container/unordered_map/operator_cmp" rel="noreferrer"><code>operator==</code></a>). I'm assuming that the hash-code and equality operators of the container elements satisfy all the required constraints on their implementation.</p>