Difference between revisions of "cpp/container/unordered set"
m (Text replace - "{{mark c++11 feature}}" to "{{mark since c++11}}") |
(+requirements) |
||
| Line 11: | Line 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. | Unordered set is an associative container that contains set of unique objects of type Key. Search, insertion, and removal have average constant-time complexity. | ||
| + | |||
| + | {{tt|std::unordered_set}} meets the requirements of {{concept|Container}}, {{concept|AllocatorAwareContainer}}, {{concept|UnorderedAssociativeContainer}}. | ||
===Member types=== | ===Member types=== | ||
Revision as of 10:01, 17 March 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
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
