Difference between revisions of "cpp/container/unordered multimap"
From cppreference.com
(-extra space) |
m (Text replace - "{{tdcl list begin" to "{{dcl list begin") |
||
| Line 16: | Line 16: | ||
===Member types=== | ===Member types=== | ||
| − | {{ | + | {{dcl list begin}} |
{{tdcl list hitem | Member type | Definition}} | {{tdcl list hitem | Member type | Definition}} | ||
{{tdcl list template | cpp/container/tdcl list key_type | unordered_multimap}} | {{tdcl list template | cpp/container/tdcl list key_type | unordered_multimap}} | ||
Revision as of 01:12, 12 June 2012
Template:cpp/container/unordered multimap/sidebar
| 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 |
