Difference between revisions of "cpp/container/unordered set"
From cppreference.com
m (Text replace - "{{tdcl list begin" to "{{dcl list begin") |
m (Text replace - "{{tdcl list end" to "{{dcl list end") |
||
| Line 32: | Line 32: | ||
{{tdcl list template | cpp/container/tdcl list local_iterator | unordered_set}} | {{tdcl list template | cpp/container/tdcl list local_iterator | unordered_set}} | ||
{{tdcl list template | cpp/container/tdcl list const_local_iterator | unordered_set}} | {{tdcl list template | cpp/container/tdcl list const_local_iterator | unordered_set}} | ||
| − | {{ | + | {{dcl list end}} |
Revision as of 01:28, 12 June 2012
Template:cpp/container/unordered set/sidebar
| Defined in header <unordered_set>
|
||
| template< class Key, |
(since C++11) | |
Unordered set is an associative container that contains set of unique objects of type Key. Search, insertion, and removal have average constant-time complexity.
std::unordered_set meets the requirements of Template:concept, Template:concept, Template:concept.
Contents |
Member types
