Members

Member	Where defined	Description
`key_type`	Associative Container	The map 's key type, Key.
`data_type`	Pair Associative Container	The type of object associated with the keys.
`value_type`	Pair Associative Container	The type of object, pair, stored in the map.
`key_compare`	Sorted Associative Container	Function object that compares two keys for ordering.
`value_compare`	Sorted Associative Container	Function object that compares two values for ordering.
`pointer`	Container	Pointer to T.
`reference`	Container	Reference to T
`const_reference`	Container	Const reference to T
`size_type`	Container	An unsigned integral type.
`difference_type`	Container	A signed integral type.
`iterator`	Container	Iterator used to iterate through a map. [1]
`const_iterator`	Container	Const iterator used to iterate through a map.
`reverse_iterator`	Reversible Container	Iterator used to iterate backwards through a map. [1]
`const_reverse_iterator`	Reversible Container	Const iterator used to iterate backwards through a map.
`iterator begin()`	Container	Returns an iterator pointing to the beginning of the map.
`iterator end()`	Container	Returns an iterator pointing to the end of the map.
`const_iterator begin() const`	Container	Returns a const_iterator pointing to the beginning of the map.
`const_iterator end() const`	Container	Returns a const_iterator pointing to the end of the map.
`reverse_iterator rbegin()`	Reversible Container	Returns a reverse_iterator pointing to the beginning of the reversed map.
`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 map(InputIterator f, InputIterator l)` [2]	Unique Sorted Associative Container	Creates a map with a copy of a range.
`template 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 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 void insert(InputIterator, InputIterator)` [2]	Unique Sorted Associative Container	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 equal_range(const key_type& k)`	Sorted Associative Container	Finds a range containing all elements whose key is k.
`pair 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.

Type requirements | Standard Template Library Programmer`s Guide | New members

fantasy space fantasy fantasy is horrors heroic prose military child russian detective action child ironical historical political western adventure adventure (child) child's stories love religion antique	Scientific literature biography business home pets animals art history computers linguistics mathematics religion home_garden sport technique publicism philosophy chemistry
close