Difference between revisions of "cpp/container/multimap"
From cppreference.com
m (Text replace - "container/tdcl" to "container/dcl") |
m (Text replace - "/sidebar" to "/navbar") |
||
Line 1: | Line 1: | ||
{{cpp/title|multimap}} | {{cpp/title|multimap}} | ||
− | {{cpp/container/multimap/ | + | {{cpp/container/multimap/navbar}} |
{{ddcl | header=map | | {{ddcl | header=map | | ||
template< | template< |
Revision as of 12:29, 15 June 2012
Defined in header <map>
|
||
template< class Key, |
||
Multimap is an associative container that contains a sorted list of key-value pairs. Sorting is done according to the comparison function Compare
, applied to the keys. Search, insertion, and removal operations have logarithmic complexity.
The order of the key-value pairs whose keys compare equivalent is the order of insertion and does not change. (since C++11)
std::multimap
meets the requirements of Template:concept, Template:concept, Template:concept and Template:concept.
Contents |