Difference between revisions of "cpp/container/unordered multimap"
m (complexity note) |
(target has been moved) |
||
Line 87: | Line 87: | ||
{{dcl list begin}} | {{dcl list begin}} | ||
{{dcl list template | cpp/container/dcl list operator_comp_unord | unordered_multimap}} | {{dcl list template | cpp/container/dcl list operator_comp_unord | unordered_multimap}} | ||
− | {{dcl list template | cpp/container/dcl list | + | {{dcl list template | cpp/container/dcl list swap2 | unordered_multimap}} |
{{dcl list end}} | {{dcl list end}} |
Revision as of 10:57, 3 November 2011
Template:cpp/container/unordered multimap/sidebar
Defined in header <unordered_map>
|
||
template< class Key, |
Template:mark c++11 feature | |
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.
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