Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/container/unordered set"

From cppreference.com
< cpp‎ | container
m (Shorten template names. Use {{lc}} where appropriate.)
m (Update links.)
Line 17: Line 17:
 
{{dsc begin}}
 
{{dsc begin}}
 
{{dsc hitem | Member type | Definition}}
 
{{dsc hitem | Member type | Definition}}
−
{{dsc inc | cpp/container/dcl list key_type | unordered_set}}
+
{{dsc inc | cpp/container/dsc key_type | unordered_set}}
−
{{dsc inc | cpp/container/dcl list value_type | unordered_set}}
+
{{dsc inc | cpp/container/dsc value_type | unordered_set}}
−
{{dsc inc | cpp/container/dcl list size_type | unordered_set}}
+
{{dsc inc | cpp/container/dsc size_type | unordered_set}}
−
{{dsc inc | cpp/container/dcl list difference_type | unordered_set}}
+
{{dsc inc | cpp/container/dsc difference_type | unordered_set}}
−
{{dsc inc | cpp/container/dcl list hasher | unordered_set}}
+
{{dsc inc | cpp/container/dsc hasher | unordered_set}}
−
{{dsc inc | cpp/container/dcl list key_equal | unordered_set}}
+
{{dsc inc | cpp/container/dsc key_equal | unordered_set}}
−
{{dsc inc | cpp/container/dcl list allocator_type | unordered_set}}
+
{{dsc inc | cpp/container/dsc allocator_type | unordered_set}}
−
{{dsc inc | cpp/container/dcl list reference | unordered_set}}
+
{{dsc inc | cpp/container/dsc reference | unordered_set}}
−
{{dsc inc | cpp/container/dcl list const_reference | unordered_set}}
+
{{dsc inc | cpp/container/dsc const_reference | unordered_set}}
−
{{dsc inc | cpp/container/dcl list pointer | unordered_set}}
+
{{dsc inc | cpp/container/dsc pointer | unordered_set}}
−
{{dsc inc | cpp/container/dcl list const_pointer | unordered_set}}
+
{{dsc inc | cpp/container/dsc const_pointer | unordered_set}}
−
{{dsc inc | cpp/container/dcl list iterator | unordered_set}}
+
{{dsc inc | cpp/container/dsc iterator | unordered_set}}
−
{{dsc inc | cpp/container/dcl list const_iterator | unordered_set}}
+
{{dsc inc | cpp/container/dsc const_iterator | unordered_set}}
−
{{dsc inc | cpp/container/dcl list local_iterator | unordered_set}}
+
{{dsc inc | cpp/container/dsc local_iterator | unordered_set}}
−
{{dsc inc | cpp/container/dcl list const_local_iterator | unordered_set}}
+
{{dsc inc | cpp/container/dsc const_local_iterator | unordered_set}}
 
{{dsc end}}
 
{{dsc end}}
  
Line 38: Line 38:
 
===Member functions===
 
===Member functions===
 
{{dsc begin}}
 
{{dsc begin}}
−
{{dsc inc | cpp/container/dcl list constructor | unordered_set}}
+
{{dsc inc | cpp/container/dsc constructor | unordered_set}}
−
{{dsc inc | cpp/container/dcl list destructor | unordered_set}}
+
{{dsc inc | cpp/container/dsc destructor | unordered_set}}
−
{{dsc inc | cpp/container/dcl list operator{{=}} | unordered_set}}
+
{{dsc inc | cpp/container/dsc operator{{=}} | unordered_set}}
−
{{dsc inc | cpp/container/dcl list get_allocator | unordered_set}}
+
{{dsc inc | cpp/container/dsc get_allocator | unordered_set}}
  
 
{{dsc h2 | Iterators}}
 
{{dsc h2 | Iterators}}
−
{{dsc inc | cpp/container/dcl list begin | unordered_set}}
+
{{dsc inc | cpp/container/dsc begin | unordered_set}}
−
{{dsc inc | cpp/container/dcl list end | unordered_set}}
+
{{dsc inc | cpp/container/dsc end | unordered_set}}
  
 
{{dsc h2 | Capacity}}
 
{{dsc h2 | Capacity}}
−
{{dsc inc | cpp/container/dcl list empty | unordered_set}}
+
{{dsc inc | cpp/container/dsc empty | unordered_set}}
−
{{dsc inc | cpp/container/dcl list size | unordered_set}}
+
{{dsc inc | cpp/container/dsc size | unordered_set}}
−
{{dsc inc | cpp/container/dcl list max_size | unordered_set}}
+
{{dsc inc | cpp/container/dsc max_size | unordered_set}}
  
 
{{dsc h2 | Modifiers}}
 
{{dsc h2 | Modifiers}}
−
{{dsc inc | cpp/container/dcl list clear | unordered_set}}
+
{{dsc inc | cpp/container/dsc clear | unordered_set}}
−
{{dsc inc | cpp/container/dcl list insert | unordered_set}}
+
{{dsc inc | cpp/container/dsc insert | unordered_set}}
−
{{dsc inc | cpp/container/dcl list emplace | unordered_set}}
+
{{dsc inc | cpp/container/dsc emplace | unordered_set}}
−
{{dsc inc | cpp/container/dcl list emplace_hint | unordered_set}}
+
{{dsc inc | cpp/container/dsc emplace_hint | unordered_set}}
−
{{dsc inc | cpp/container/dcl list erase | unordered_set}}
+
{{dsc inc | cpp/container/dsc erase | unordered_set}}
−
{{dsc inc | cpp/container/dcl list swap | unordered_set}}
+
{{dsc inc | cpp/container/dsc swap | unordered_set}}
  
 
{{dsc h2 | Lookup}}
 
{{dsc h2 | Lookup}}
−
{{dsc inc | cpp/container/dcl list count | unordered_set}}
+
{{dsc inc | cpp/container/dsc count | unordered_set}}
−
{{dsc inc | cpp/container/dcl list find | unordered_set}}
+
{{dsc inc | cpp/container/dsc find | unordered_set}}
−
{{dsc inc | cpp/container/dcl list equal_range | unordered_set}}
+
{{dsc inc | cpp/container/dsc equal_range | unordered_set}}
  
 
{{dsc h2 | Bucket interface}}
 
{{dsc h2 | Bucket interface}}
−
{{dsc inc | cpp/container/dcl list begin(int) | unordered_set}}
+
{{dsc inc | cpp/container/dsc begin(int) | unordered_set}}
−
{{dsc inc | cpp/container/dcl list end(int) | unordered_set}}
+
{{dsc inc | cpp/container/dsc end(int) | unordered_set}}
−
{{dsc inc | cpp/container/dcl list bucket_count | unordered_set}}
+
{{dsc inc | cpp/container/dsc bucket_count | unordered_set}}
−
{{dsc inc | cpp/container/dcl list max_bucket_count | unordered_set}}
+
{{dsc inc | cpp/container/dsc max_bucket_count | unordered_set}}
−
{{dsc inc | cpp/container/dcl list bucket_size | unordered_set}}
+
{{dsc inc | cpp/container/dsc bucket_size | unordered_set}}
−
{{dsc inc | cpp/container/dcl list bucket | unordered_set}}
+
{{dsc inc | cpp/container/dsc bucket | unordered_set}}
  
 
{{dsc h2 | Hash policy}}
 
{{dsc h2 | Hash policy}}
−
{{dsc inc | cpp/container/dcl list load_factor | unordered_set}}
+
{{dsc inc | cpp/container/dsc load_factor | unordered_set}}
−
{{dsc inc | cpp/container/dcl list max_load_factor | unordered_set}}
+
{{dsc inc | cpp/container/dsc max_load_factor | unordered_set}}
−
{{dsc inc | cpp/container/dcl list rehash | unordered_set}}
+
{{dsc inc | cpp/container/dsc rehash | unordered_set}}
−
{{dsc inc | cpp/container/dcl list reserve | unordered_set}}
+
{{dsc inc | cpp/container/dsc reserve | unordered_set}}
  
 
{{dsc h2 | Observers}}
 
{{dsc h2 | Observers}}
−
{{dsc inc | cpp/container/dcl list hash_function | unordered_set}}
+
{{dsc inc | cpp/container/dsc hash_function | unordered_set}}
−
{{dsc inc | cpp/container/dcl list key_eq | unordered_set}}
+
{{dsc inc | cpp/container/dsc key_eq | unordered_set}}
 
{{dsc end}}
 
{{dsc end}}
  
 
===Non-member functions===
 
===Non-member functions===
 
{{dsc begin}}
 
{{dsc begin}}
−
{{dsc inc | cpp/container/dcl list operator_cmp_unord | unordered_set}}
+
{{dsc inc | cpp/container/dsc operator_cmp_unord | unordered_set}}
−
{{dsc inc | cpp/container/dcl list swap2 | unordered_set}}
+
{{dsc inc | cpp/container/dsc swap2 | unordered_set}}
 
{{dsc end}}
 
{{dsc end}}
  

Revision as of 21:51, 31 May 2013

 
C++
 
Containers library
 
std::unordered_set
Member types
Member functions
Non-member functions
(until C++20)
Deduction guides (C++17)
 
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.

std::unordered_set meets the requirements of Template:concept, Template:concept, Template:concept.

Contents

Member types

Member type Definition
key_type Key[edit]
value_type Key[edit]
size_type Unsigned integer type (usually std::size_t)[edit]
difference_type Signed integer type (usually std::ptrdiff_t)[edit]
hasher Hash[edit]
key_equal KeyEqual[edit]
allocator_type Allocator[edit]
reference value_type&[edit]
const_reference const value_type&[edit]
pointer std::allocator_traits<Allocator>::pointer[edit]
const_pointer std::allocator_traits<Allocator>::const_pointer[edit]
iterator Constant LegacyForwardIterator to value_type[edit]
const_iterator LegacyForwardIterator to const value_type[edit]
local_iterator An iterator type whose category, value, difference, pointer and
reference types are the same as iterator. This iterator
can be used to iterate through a single bucket but not across buckets[edit]
const_local_iterator An iterator type whose category, value, difference, pointer and
reference types are the same as const_iterator. This iterator
can be used to iterate through a single bucket but not across buckets[edit]


Member functions

 constructs the unordered_set
(public member function) [edit]
destructs the unordered_set
(public member function) [edit]
assigns values to the container
(public member function) [edit]
returns the associated allocator
(public member function) [edit]
Iterators
returns an iterator to the beginning
(public member function) [edit]
returns an iterator to the end
(public member function) [edit]
Capacity
checks whether the container is empty
(public member function) [edit]
returns the number of elements
(public member function) [edit]
returns the maximum possible number of elements
(public member function) [edit]
Modifiers
clears the contents
(public member function) [edit]
inserts elements or nodes(since C++17)
(public member function) [edit]
constructs element in-place
(public member function) [edit]
constructs elements in-place using a hint
(public member function) [edit]
erases elements
(public member function) [edit]
swaps the contents
(public member function) [edit]
Lookup
returns the number of elements matching specific key
(public member function) [edit]
finds element with specific key
(public member function) [edit]
returns range of elements matching a specific key
(public member function) [edit]
Bucket interface
returns an iterator to the beginning of the specified bucket
(public member function) [edit]
returns an iterator to the end of the specified bucket
(public member function) [edit]
returns the number of buckets
(public member function) [edit]
returns the maximum number of buckets
(public member function) [edit]
returns the number of elements in specific bucket
(public member function) [edit]
returns the bucket for specific key
(public member function) [edit]
Hash policy
returns average number of elements per bucket
(public member function) [edit]
manages maximum average number of elements per bucket
(public member function) [edit]
reserves at least the specified number of buckets and regenerates the hash table
(public member function) [edit]
reserves space for at least the specified number of elements and regenerates the hash table
(public member function) [edit]
Observers
returns function used to hash the keys
(public member function) [edit]
returns the function used to compare keys for equality
(public member function) [edit]

Non-member functions

(C++11)(C++11)(removed in C++20)
 compares the values in the unordered_set
(function template) [edit]
(C++11)
 specializes the std::swap algorithm
(function template) [edit]

Notes

The member types iterator and const_iterator may be aliases to the same type. This means defining a pair of function overloads using the two types as parameter types may violate the One Definition Rule. Since iterator is convertible to const_iterator, a single function with a const_iterator as parameter type will work instead.

Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/container/unordered_set&oldid=57325"