Difference between revisions of "cpp/container/unordered multiset"
m (Text replace - "operator_comp" to "operator_cmp") |
m (Text replace - "{{mark c++11 feature}}" to "{{mark since c++11}}") |
||
| Line 1: | Line 1: | ||
{{cpp/title|unordered_multiset}} | {{cpp/title|unordered_multiset}} | ||
{{cpp/container/unordered_multiset/sidebar}} | {{cpp/container/unordered_multiset/sidebar}} | ||
| − | {{ddcl | header=unordered_set | notes={{mark c++11 | + | {{ddcl | header=unordered_set | notes={{mark since c++11}} | |
template< | template< | ||
class Key, | class Key, | ||
Revision as of 14:51, 24 December 2011
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.
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 end
