To be useful that would require that the nodes are allocated in the order they appear in the map (and still has pointer overhead). Is that a given with an unord

To be useful that would require that the nodes are allocated in the order they appear in the map (and still has pointer overhead). Is that a given with an unordered map or does it break down the moment the map is rehashed?