std::unordered_set

Defined in header <unordered_set>
template<     class Key,     class Hash = std::hash<Key>,     class KeyEqual = std::equal_to<Key>,     class Allocator = std::allocator<Key> > class unordered_set;		(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.

Member functions

Template:cpp/container/dcl list constructorTemplate:cpp/container/dcl list destructorTemplate:cpp/container/dcl list operator=Template:cpp/container/dcl list get allocatorTemplate:cpp/container/dcl list beginTemplate:cpp/container/dcl list endTemplate:cpp/container/dcl list emptyTemplate:cpp/container/dcl list sizeTemplate:cpp/container/dcl list max sizeTemplate:cpp/container/dcl list clearTemplate:cpp/container/dcl list insertTemplate:cpp/container/dcl list emplaceTemplate:cpp/container/dcl list emplace hintTemplate:cpp/container/dcl list eraseTemplate:cpp/container/dcl list swapTemplate:cpp/container/dcl list countTemplate:cpp/container/dcl list findTemplate:cpp/container/dcl list equal rangeTemplate:cpp/container/dcl list begin(int)Template:cpp/container/dcl list end(int)Template:cpp/container/dcl list bucket countTemplate:cpp/container/dcl list max bucket countTemplate:cpp/container/dcl list bucket sizeTemplate:cpp/container/dcl list bucketTemplate:cpp/container/dcl list load factorTemplate:cpp/container/dcl list max load factorTemplate:cpp/container/dcl list rehashTemplate:cpp/container/dcl list reserveTemplate:cpp/container/dcl list hash functionTemplate:cpp/container/dcl list key eq

Iterators

Capacity

Modifiers

Lookup

Bucket interface

Hash policy

Observers

Non-member functions

Template:cpp/container/dcl list operator cmp unordTemplate:cpp/container/dcl list swap2