Standard Template Library Programmer's Guide

Inserts a range into the map.
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)	Associative Container	Finds an element whose key is k.
const_iterator find(const key_type& k) const	Associative Container	Finds an element whose key is k.
size_type count(const key_type& k)	Unique Associative Container	Counts the number of elements whose key is k.
iterator lower_bound(const key_type& k)	Sorted Associative Container	Finds the first element whose key is not less than k.
const_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)	Sorted Associative Container	Finds the first element whose key greater than k.
const_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)	Sorted Associative Container	Finds a range containing all elements whose key is k.
pair<const_iterator, const_iterator> equal_range(const key_type& k) const	Sorted Associative Container	Finds a range containing all elements whose key is k.
data_type& operator[](const key_type& k) [3]	map	See below.
bool operator==(const map&, const map&)	Forward Container	Tests two maps for equality. This is a global function, not a member function.
bool operator<(const map&, const map&)	Forward Container	Lexicographical comparison. This is a global function, not a member function.

New members

These members are not defined in the Unique Sorted Associative Container and Pair Associative Container requirements, but are unique to map: