Standard Template Library Programmer's Guide

pair<iterator, bool> insert(const value_type& x)	Unique Associative Container	Inserts x into the set.
iterator insert(iterator pos, const value_type& x)	Unique Sorted Associative Container	Inserts x into the set , using pos as a hint to where it will be inserted.
template <class InputIterator> void insert(InputIterator, InputIterator) [1]	Unique Sorted Associative Container	Inserts a range into the set.
void erase(iterator pos)	Associative Container	Erases the element pointed to by pos.
size_type erase(const key_type& k)	Associative Container	Erases the element whose key is k.
void erase(iterator first, iterator last)	Associative Container	Erases all elements in a range.
void clear()	Associative Container	Erases all of the elements.
iterator find(const key_type& k) const	Associative Container	Finds an element whose key is k.
size_type count(const key_type& k) const	Unique Associative Container	Counts the number of elements whose key is k.
iterator lower_bound(const key_type& k) const	Sorted Associative Container	Finds the first element whose key is not less than k.
iterator upper_bound(const key_type& k) const	Sorted Associative Container	Finds the first element whose key greater than k.
pair<iterator, iterator> equal_range(const key_type& k) const	Sorted Associative Container	Finds a range containing all elements whose key is k.
bool operator==(const set&, const set&)	Forward Container	Tests two sets for equality. This is a global function, not a member function.
bool operator<(const set&, const set&)	Forward Container	Lexicographical comparison. This is a global function, not a member function.

New members

All of set 's members are defined in the Unique Sorted Associative Container and Simple Associative Container requirements. Set does not introduce any new members.

Notes

[1] This member function relies on member template functions, which at present (early 1998) are not supported by all compilers. If your compiler supports member templates, you can call this function with any type of input iterator. If your compiler does not yet support member templates, though, then the arguments must either be of type const value_type* or of type set::const_iterator.

See also

Associative Container, Sorted Associative Container, Simple Associative Container, Unique Sorted Associative Container, map, multiset, multimap, hash_set, hash_map, hash_multiset, hash_multimap

map<Key, Data, Compare, Alloc>