Difference between revisions of "cpp/container/multimap"
m (Text replace - "{{mark c++11 feature}}" to "{{mark since c++11}}") |
(+requirements) |
||
| Line 13: | Line 13: | ||
The order of the key-value pairs whose keys compare equivalent is the order of insertion and does not change. {{mark since c++11}} | The order of the key-value pairs whose keys compare equivalent is the order of insertion and does not change. {{mark since c++11}} | ||
| + | |||
| + | {{tt|std::multimap}} meets the requirements of {{concept|Container}}, {{concept|AllocatorAwareContainer}}, {{concept|AssociativeContainer}} and {{concept|ReversibleContainer}}. | ||
===Member types=== | ===Member types=== | ||
Revision as of 10:01, 17 March 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
