map

cppreference.com

Search

Log in / create account

Namespaces

• Page
• Discussion

Variants

Views

• View
• Edit
• History

Actions

std::map

From cppreference.com

< cpp | container

 

C++

Language

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

Containers library

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

std::map

Member functions

map::map

map::~map

map::operator=

map::get_allocator

Element access

map::at

map::operator[]

Iterators

map::begin map::cbegin (C++11)

map::end map::cend (C++11)

map::rbegin map::crbegin (C++11)

map::rend map::crend (C++11)

Capacity

map::empty

map::size

map::max_size

Modifiers

map::clear

map::insert

map::emplace (C++11)

map::emplace_hint (C++11)

map::erase

map::swap

Lookup

map::count

map::find

map::equal_range

map::lower_bound

map::upper_bound

Observers

map::key_comp

map::value_comp

 

Defined in header <map>
template<     class Key,     class T,     class Compare = std::less<Key>,     class Allocator = std::allocator<std::pair<const Key, T> > > class map ;

std::map is a sorted associative container that contains key-value pairs with unique keys. Keys are sorted by using the comparison function Compare. Search, removal, and insertion operations have logarithmic complexity. Maps are usually implemented as red-black trees.

std::map meets the requirements of Container, AllocatorAwareContainer, AssociativeContainer and ReversibleContainer.

[edit] Member types

Member type	Definition
key_type	Key [edit]
mapped_type	T [edit]
value_type	std::pair<const Key, T> [edit]
size_type	Unsigned integral type (usually size_t) [edit]
difference_type	Signed integer type (usually ptrdiff_t) [edit]
key_compare	Compare [edit]
allocator_type	Allocator [edit]
reference	Allocator::reference (until C++11) value_type& (since C++11) [edit]
const_reference	Allocator::const_reference (until C++11) const value_type& (since C++11) [edit]
pointer	Allocator::pointer (until C++11) std::allocator_traits<Allocator>::pointer (since C++11) [edit]
const_pointer	Allocator::const_pointer (until C++11) std::allocator_traits<Allocator>::const_pointer (since C++11) [edit]
iterator	BidirectionalIterator [edit]
const_iterator	Constant bidirectional iterator [edit]
reverse_iterator	std::reverse_iterator<iterator> [edit]
const_reverse_iterator	std::reverse_iterator<const_iterator> [edit]

[edit] Member classes

value_compare	compares objects of type value_type (class) [edit]

[edit] Member functions

(constructor)	constructs the map (public member function) [edit]
(destructor)	destructs the map (public member function) [edit]
operator=	assigns values to the container (public member function) [edit]
get_allocator	returns the associated allocator (public member function) [edit]
Element access
at (C++11)	access specified element with bounds checking (public member function) [edit]
operator[]	access specified element (public member function) [edit]
Iterators
begin cbegin	returns an iterator to the beginning (public member function) [edit]
end cend	returns an iterator to the end (public member function) [edit]
rbegin crbegin	returns a reverse iterator to the beginning (public member function) [edit]
rend crend	returns a reverse iterator to the end (public member function) [edit]
Capacity
empty	checks whether the container is empty (public member function) [edit]
size	returns the number of elements (public member function) [edit]
max_size	returns the maximum possible number of elements (public member function) [edit]
Modifiers
clear	clears the contents (public member function) [edit]
insert	inserts elements (public member function) [edit]
emplace (C++11)	constructs element in-place (public member function) [edit]
emplace_hint (C++11)	constructs elements in-place using a hint (public member function) [edit]
erase	erases elements (public member function) [edit]
swap	swaps the contents (public member function) [edit]
Lookup
count	returns the number of elements matching specific key (public member function) [edit]
find	finds element with specific key (public member function) [edit]
equal_range	returns range of elements matching a specific key (public member function) [edit]
lower_bound	returns an iterator to the first element not less than the given value (public member function) [edit]
upper_bound	returns an iterator to the first element greater than a certain value (public member function) [edit]
Observers
key_comp	returns the function that compares keys (public member function) [edit]
value_comp	returns the function that compares keys (public member function) [edit]

[edit] Non-member functions

operator== operator!= operator< operator<= operator> operator>=	lexicographically compares the values in the map (function template) [edit]
std::swap (std::map)	specializes the std::swap algorithm (function template) [edit]

Retrieved from " http://en.cppreference.com/mwiki/index.php?title=cpp/container/map&oldid=39047"

Navigation

• Recent changes
• FAQ
• Store
• Offline version

Toolbox

• What links here
• Related changes
• Upload file
• Special pages
• Printable version
• Permanent link

• In other languages

• Italiano
• 日本語
• Polski
• Русский
• 中文

• This page was last modified on 23 August 2012, at 15:59.
• This page has been accessed 63,366 times.

• Privacy policy
• About cppreference.com
• Disclaimers

•