I just want to be sure my recollection is correct. I can't find this
in the standard but I believe maps are defined so that if I iterate
through one from begin() to end() the keys are always in order. Maps
are basically unstable sorted based on key right? Conceptually I could
consider it as an unstable sorted array of values linked to other
values?
I know that is what my implementation does and very likely, if it isn't
defined by the standard, my map is a binary tree that iterates
in-order. I would like to be sure that is defined by standard and not
an assumption based on most implementations.