cpp/container/map

is a sorted associative container that contains key-value pairs with unique keys. Keys are sorted by using the comparison function. Search, removal, and insertion operations have logarithmic complexity. Maps are usually implemented as s.

Everywhere the standard library uses the requirements, uniqueness is determined by using the equivalence relation. In imprecise terms, two objects and  are considered equivalent (not unique) if neither compares less than the other:.

meets the requirements of, , and.