Difference between revisions of "cpp/container/unordered multimap"
(+requirements) |
(-extra space) |
||
| Line 35: | Line 35: | ||
{{tdcl list template | cpp/container/tdcl list const_local_iterator | unordered_multimap}} | {{tdcl list template | cpp/container/tdcl list const_local_iterator | unordered_multimap}} | ||
{{tdcl list end}} | {{tdcl list end}} | ||
| − | |||
| − | |||
===Member functions=== | ===Member functions=== | ||
Revision as of 03:45, 21 April 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 |
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 template Template:tdcl list end
