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++

LanguageConceptsUtilities libraryStrings libraryContainers libraryAlgorithms libraryIterators libraryNumerics libraryInput/output libraryLocalizations libraryRegular expressions library(C++11)Atomic operations library(C++11)Thread support library(C++11)

 

Containers library

array(C++11)vectordequeforward_list(C++11)listsetmultisetmapmultimapunordered_set(C++11)unordered_multiset(C++11)unordered_map(C++11)unordered_multimap(C++11)stackqueuepriority_queue

 

std::map

Member functionsmap::mapmap::~mapmap::operator=map::get_allocatorElement accessmap::atmap::operator[]Iteratorsmap::begin
map::cbegin
(C++11)map::end
map::cend
(C++11)map::rbegin
map::crbegin
(C++11)map::rend
map::crend
(C++11)Capacitymap::emptymap::sizemap::max_sizeModifiersmap::clearmap::insertmap::emplace(C++11)map::emplace_hint(C++11)map::erasemap::swapLookupmap::countmap::findmap::equal_rangemap::lower_boundmap::upper_boundObserversmap::key_compmap::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 functionCompare. Search, removal, and insertion operations have logarithmic complexity. Maps are usually implemented asred-black trees.

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

Contents

 [hide] 

• 1Member types
• 2Member classes
• 3Member functions
  • 3.1Element access
  • 3.2Iterators
  • 3.3Capacity
  • 3.4Modifiers
  • 3.5Lookup
  • 3.6Observers
• 4Non-member functions

[edit]Member types

 Member typeDefinition key_typeKey [edit] mapped_typeT [edit] value_typestd::pair<const Key, T>[edit] size_typeUnsigned integral type (usually size_t)[edit] difference_typeSigned integer type (usually ptrdiff_t)[edit] key_compareCompare [edit] allocator_typeAllocator [edit] referenceAllocator::reference (until C++11)
value_type& (since C++11) [edit] const_referenceAllocator::const_reference (until C++11)
const value_type& (since C++11) [edit] pointerAllocator::pointer (until C++11)
std::allocator_traits<Allocator>::pointer(since C++11) [edit] const_pointerAllocator::const_pointer(until C++11)
std::allocator_traits<Allocator>::const_pointer(since C++11) [edit] iteratorBidirectionalIterator[edit] const_iteratorConstant bidirectional iterator [edit] reverse_iteratorstd::reverse_iterator<iterator>[edit] const_reverse_iteratorstd::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

•