cpp/container/set

is an associative container that contains a sorted set of unique objects of type. Sorting is done using the key comparison function. Search, removal, and insertion operations have logarithmic complexity. Sets 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 if neither compares less than the other:.

meets the requirements of, , and.