Difference between revisions of "cpp/container/unordered multimap"
From cppreference.com
m (Text replace - "/sidebar" to "/navbar") |
m (r2.7.3) (Robot: Adding de, es, fr, it, ja, pt, ru, zh) |
||
Line 89: | Line 89: | ||
{{dcl list template | cpp/container/dcl list swap2 | unordered_multimap}} | {{dcl list template | cpp/container/dcl list swap2 | unordered_multimap}} | ||
{{dcl list end}} | {{dcl list end}} | ||
+ | |||
+ | [[de:cpp/container/unordered multimap]] | ||
+ | [[es:cpp/container/unordered multimap]] | ||
+ | [[fr:cpp/container/unordered multimap]] | ||
+ | [[it:cpp/container/unordered multimap]] | ||
+ | [[ja:cpp/container/unordered multimap]] | ||
+ | [[pt:cpp/container/unordered multimap]] | ||
+ | [[ru:cpp/container/unordered multimap]] | ||
+ | [[zh:cpp/container/unordered multimap]] |
Revision as of 09:14, 2 November 2012
Defined in header <unordered_map>
|
||
template< class Key, |
(since C++11) | |
Unordered multimap is an unordered associative container that supports equivalent keys (an unordered_multimap may contain multiple copies of each key value) and that associates values of another type with the keys. The unordered_multimap class supports forward iterators. Search, insertion, and removal have average constant-time complexity.
std::unordered_multimap
meets the requirements of Template:concept, Template:concept, Template:concept.
Contents |