Difference between revisions of "cpp/container/unordered multiset"
From cppreference.com
m (Text replace - "container/tdcl" to "container/dcl") |
m (Text replace - "/sidebar" to "/navbar") |
||
Line 1: | Line 1: | ||
{{cpp/title|unordered_multiset}} | {{cpp/title|unordered_multiset}} | ||
− | {{cpp/container/unordered_multiset/ | + | {{cpp/container/unordered_multiset/navbar}} |
{{ddcl | header=unordered_set | notes={{mark since c++11}} | | {{ddcl | header=unordered_set | notes={{mark since c++11}} | | ||
template< | template< |
Revision as of 12:29, 15 June 2012
Defined in header <unordered_set>
|
||
template< class Key, |
(since C++11) | |
Unordered multiset is an associative container that contains set of possibly non-unique objects of type Key. Search, insertion, and removal have average constant-time complexity.
std::unordered_multiset
meets the requirements of Template:concept, Template:concept, Template:concept.
Contents |
Member types