std::set
Defined in header <set>
|
||
template< class Key, |
||
std::set
is an associative container that contains a sorted set of unique objects of type Key. Sorting is done using the key comparison function Compare. Search, removal, and insertion operations have logarithmic complexity. Sets are usually implemented as red-black trees.
std::set
meets the requirements of Template:concept, Template:concept, Template:concept and Template:concept.
Contents |
Member types
Member functions
Non-member functions
Notes
The member types iterator
and const_iterator
may be aliases to the same type. This means defining a pair of function overloads using the two types as parameter types may violate the One Definition Rule. Since iterator
is convertible to const_iterator
, a single function with a const_iterator
as parameter type will work instead.