C++ Sets

set<Key, Compare, Alloc>

The C++ Set is an associative STL container that contains a sorted set of unique objects of type Key. Sorting is done using the key comparison function Compare (default is set to std::less<Key>).

Constructorsdefault methods to allocate, copy, and deallocate sets
Operatorsassign and compare sets
beginreturns an iterator to the beginning of the set
clearremoves all elements from the set
countreturns the number of elements matching a certain key
emptytrue if the set has no elements
endreturns an iterator just past the last element of a set
equal_rangereturns iterators to the first and just past the last elements matching a specific key
eraseremoves elements from a set
findreturns an iterator to specific element
insertinsert items into a set
key_compreturns the function that compares keys
lower_boundreturns an iterator to the first element greater than or equal to a certain value
max_sizereturns the maximum number of elements that the set can hold
rbeginreturns a reverse_iterator to the end of the set
rendreturns a reverse_iterator to the beginning of the set
sizereturns the number of items in the set
swapswap the contents of this set with another
upper_boundreturns an iterator to the first element greater than a certain value
value_compreturns the function that compares values