Difference between revisions of "cpp/container/multimap"
(+requirements) |
m (r2.7.3) (Robot: Adding fr, ja, pl, zh) |
||
Line 84: | Line 84: | ||
{{dcl list template | cpp/container/dcl list swap2 | multimap}} | {{dcl list template | cpp/container/dcl list swap2 | multimap}} | ||
{{dcl list end}} | {{dcl list end}} | ||
+ | |||
+ | [[fr:cpp/container/multimap]] | ||
+ | [[ja:cpp/container/multimap]] | ||
+ | [[pl:cpp/container/multimap]] | ||
+ | [[zh:cpp/container/multimap]] |
Revision as of 11:51, 4 May 2012
Template:cpp/container/multimap/sidebar
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 |
Member types
Template:tdcl list begin Template:tdcl list hitem Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list end