Difference between revisions of "cpp/container/unordered multiset"
From cppreference.com
m (Text replace - "{{tdcl list begin" to "{{dcl list begin") |
m (Text replace - "{{tdcl" to "{{dcl") |
||
Line 16: | Line 16: | ||
===Member types=== | ===Member types=== | ||
{{dcl list begin}} | {{dcl list begin}} | ||
− | {{ | + | {{dcl list hitem | Member type | Definition}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list key_type | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list value_type | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list size_type | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list difference_type | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list hasher | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list key_equal | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list allocator_type | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list reference | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list const_reference | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list pointer | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list const_pointer | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list iterator | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list const_iterator | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list local_iterator | unordered_multiset}} |
− | {{ | + | {{dcl list template | cpp/container/tdcl list const_local_iterator | unordered_multiset}} |
− | {{ | + | {{dcl list end}} |
Revision as of 01:24, 12 June 2012
Template:cpp/container/unordered multiset/sidebar
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