The C++ Set is an associative container that contains an ordered set of objects.
| begin() |
returns an iterator to the first element |
| clear() |
removes all elements |
| count() |
returns the number of elements |
| empty() |
true if the set is empty |
| end() |
returns an iterator to the last element |
| equal_range() |
returns iterators to the first and last elements that match a certain key |
| erase() |
removes elements |
| find() |
finds a given element |
| get_allocator() |
returns the set's allocator |
| insert() |
inserts elements into the set |
| lower_bound() |
returns an iterator to the first element greater than a certain value |
| key_comp() |
returns the function that compares keys |
| max_size() |
the maximum number of elements that the set can hold |
| rbegin() |
returns a reverse iterator to the end of the set |
| rend() |
returns a reverse iterator to the beginning of the set |
| size() |
the number of elements in the set |
| swap() |
exchanges two sets |
| upper_bound() |
returns an iterator to the first element greater than a certain value |
| value_comp() |
returns the function that compares values |