Map "sorted data"

[Thembi]

I wanna know if ,the map stores sorted data or not.

[JosAH]

I wanna know if ,the map stores sorted data or not.

Yup, most, if not all maps are implemented as balanced binary search trees.
(AVL trees or red/black trees). No matter their implementation: the keys are
in ascending order.

kind regards,

Jos

[weaknessforcats]

Not quite true:

No matter their implementation: the keys are
in ascending order.

The keys are in the order based on the operator< of the underlying class or the binary predicate supplied to the map. You can have keys in descending order with the appropriate comparator function.

[JosAH]

Not quite true:


The keys are in the order based on the operator< of the underlying class or the binary predicate supplied to the map. You can have keys in descending order with the appropriate comparator function.

Sure, same with what the operator< tells; we call that ascending: if a < b
that b is considered "larger or equal" than a. It doesn't matter what predicate
one uses, i.e 'a < b' symbolically tells you that a is less than b if the first
predicate happens to be true no matter what the actual comparison (if any)
happens to be.

kind regards,

Jos