std::map and behavior of already inserted data
c++, stl
Solution
The map is implemented as a tree, and when you insert a new element, the tree may need to be rebalanced.
This does not invalidate any iterators or references to elements in the tree. This balancing is done via the manipulation of pointers, so you have nothing to worry about; the nodes themselves stay put.
Balancing involves changing the structure of the tree by telling nodes who their children, parents, and siblings are via re-assigning pointers, but this is an implementation detail. Logically nothing has changed.
Problem
Does `std::map` move around already inserted values when inserting new data ?