48
Ordered Container Equivalence
•During insertion in an ordered map or set, keys are compared for equivalence, not equality. •Ordered keys are equivalent if the following relation (known as “strict weak ordering”) is true:
not (L < R) and not (R < L)