reverse_iterator rend() | Reversible Container | Returns a reverse_iterator pointing to the end of the reversed map. |
const_reverse_iterator rbegin() const | Reversible Container | Returns a const_reverse_iterator pointing to the beginning of the reversed map. |
const_reverse_iterator rend() const | Reversible Container | Returns a const_reverse_iterator pointing to the end of the reversed map. |
size_type size() const | Container | Returns the size of the map. |
size_type max_size() const | Container | Returns the largest possible size of the map. |
bool empty() const | Container | true if the map 's size is 0. |
key_compare key_comp() const | Sorted Associative Container | Returns the key_compare object used by the map. |
value_compare value_comp() const | Sorted Associative Container | Returns the value_compare object used by the map. |
map() | Container | Creates an empty map. |
map(const key_compare& comp) | Sorted Associative Container | Creates an empty map , using comp as the key_compare object. |
template <class InputIterator> map(InputIterator f, InputIterator l) [2] | Unique Sorted Associative Container | Creates a map with a copy of a range. |
template <class InputIterator> map(InputIterator f, InputIterator l, const key_compare& comp) [2] | Unique Sorted Associative Container | Creates a map with a copy of a range, using comp as the key_compare object. |
map(const map&) | Container | The copy constructor. |
map& operator=(const map&) | Container | The assignment operator |
void swap(map&) | Container | Swaps the contents of two maps. |
pair<iterator, bool> insert(const value_type& x) | Unique Associative Container | Inserts x into the map. |
iterator insert(iterator pos, const value_type& x) | Unique Sorted Associative Container | Inserts x into the map, using pos as a hint to where it will be inserted. |
template <class InputIterator> void insert(InputIterator, InputIterator) [2] | Unique Sorted Associative Container |
