Class template unordered_set

boost::unordered_set — An unordered associative container that stores unique values.

Synopsis

// In header: <boost/unordered_set.hpp>

template<typename Value, typename Hash = boost::hash<Value>, 
         typename Pred = std::equal_to<Value>, 
         typename Alloc = std::allocator<Value> > 
class unordered_set {
public:
  // types
  typedef Value                                    key_type;            
  typedef Value                                    value_type;          
  typedef Hash                                     hasher;              
  typedef Pred                                     key_equal;           
  typedef Alloc                                    allocator_type;      
  typedef typename allocator_type::pointer         pointer;             
  typedef typename allocator_type::const_pointer   const_pointer;       
  typedef typename allocator_type::reference       reference;             // lvalue of value_type.
  typedef typename allocator_type::const_reference const_reference;       // const lvalue of value_type.
  typedef implementation-defined size_type;
  typedef implementation-defined difference_type;
  typedef implementation-defined iterator;
  typedef implementation-defined const_iterator;
  typedef implementation-defined local_iterator;
  typedef implementation-defined const_local_iterator;

  // construct/copy/destruct
  explicit unordered_set(size_type = implementation-defined, 
                         hasher const& = hasher(), 
                         key_equal const& = key_equal(), 
                         allocator_type const& = allocator_type());
  template<typename InputIterator> 
    unordered_set(InputIterator, InputIterator, 
                  size_type = implementation-defined, 
                  hasher const& = hasher(), key_equal const& = key_equal(), 
                  allocator_type const& = allocator_type());
  unordered_set(unordered_set const&);
  unordered_set(unordered_set &&);
  explicit unordered_set(Allocator const&);
  unordered_set(unordered_set const&, Allocator const&);
  ~unordered_set();
  unordered_set& operator=(unordered_set const&);
  unordered_set& operator=(unordered_set &&);
  allocator_type get_allocator() const;

  // size and capacity
  bool empty() const;
  size_type size() const;
  size_type max_size() const;

  // iterators
  iterator begin();
  const_iterator begin() const;
  iterator end();
  const_iterator end() const;
  const_iterator cbegin() const;
  const_iterator cend() const;

  // modifiers
  template<typename... Args> std::pair<iterator, bool> emplace(Args&&...);
  template<typename... Args> iterator emplace_hint(const_iterator, Args&&...);
  std::pair<iterator, bool> insert(value_type const&);
  iterator insert(const_iterator, value_type const&);
  template<typename InputIterator> void insert(InputIterator, InputIterator);
  iterator erase(const_iterator);
  size_type erase(key_type const&);
  iterator erase(const_iterator, const_iterator);
  void erase_return_void(const_iterator);
  void clear();
  void swap(unordered_set&);

  // observers
  hasher hash_function() const;
  key_equal key_eq() const;

  // lookup
  iterator find(key_type const&);
  const_iterator find(key_type const&) const;
  template<typename CompatibleKey, typename CompatibleHash, 
           typename CompatiblePredicate> 
    iterator find(CompatibleKey const&, CompatibleHash const&, 
                  CompatiblePredicate const&);
  template<typename CompatibleKey, typename CompatibleHash, 
           typename CompatiblePredicate> 
    const_iterator 
    find(CompatibleKey const&, CompatibleHash const&, 
         CompatiblePredicate const&) const;
  size_type count(key_type const&) const;
  std::pair<iterator, iterator> equal_range(key_type const&);
  std::pair<const_iterator, const_iterator> equal_range(key_type const&) const;

  // bucket interface
  size_type bucket_count() const;
  size_type max_bucket_count() const;
  size_type bucket_size(size_type) const;
  size_type bucket(key_type const&) const;
  local_iterator begin(size_type);
  const_local_iterator begin(size_type) const;
  local_iterator end(size_type);
  const_local_iterator end(size_type) const;
  const_local_iterator cbegin(size_type) const;
  const_local_iterator cend(size_type);

  // hash policy
  float load_factor() const;
  float max_load_factor() const;
  void max_load_factor(float);
  void rehash(size_type);
};

// Equality Comparisons
template<typename Value, typename Hash, typename Pred, typename Alloc> 
  bool operator==(unordered_set<Value, Hash, Pred, Alloc> const&, 
                  unordered_set<Value, Hash, Pred, Alloc> const&);
template<typename Value, typename Hash, typename Pred, typename Alloc> 
  bool operator!=(unordered_set<Value, Hash, Pred, Alloc> const&, 
                  unordered_set<Value, Hash, Pred, Alloc> const&);

// swap
template<typename Value, typename Hash, typename Pred, typename Alloc> 
  void swap(unordered_set<Value, Hash, Pred, Alloc>&, 
            unordered_set<Value, Hash, Pred, Alloc>&);

Description

Based on chapter 23 of the working draft of the C++ standard [n2960]. But without the updated rules for allocators.

Template Parameters

Value	Value must be Assignable and CopyConstructible
Hash	A unary function object type that acts a hash function for a `Value`. It takes a single argument of type `Value` and returns a value of type std::size_t.
Pred	A binary function object that implements an equivalence relation on values of type `Value`. A binary function object that induces an equivalence relation on values of type Key. It takes two arguments of type Key and returns a value of type bool.
Alloc	An allocator whose value type is the same as the container's value type.

The elements are organized into buckets. Keys with the same hash code are stored in the same bucket.

The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.

`unordered_set` public types

typedef implementation-defined size_type;

An unsigned integral type.

size_type can represent any non-negative value of difference_type.
typedef implementation-defined difference_type;

A signed integral type.

Is identical to the difference type of iterator and const_iterator.
typedef implementation-defined iterator;

A constant iterator whose value type is value_type.

The iterator category is at least a forward iterator.

Convertible to const_iterator.
typedef implementation-defined const_iterator;

A constant iterator whose value type is value_type.

The iterator category is at least a forward iterator.
typedef implementation-defined local_iterator;

An iterator with the same value type, difference type and pointer and reference type as iterator.

A local_iterator object can be used to iterate through a single bucket.
typedef implementation-defined const_local_iterator;

A constant iterator with the same value type, difference type and pointer and reference type as const_iterator.

A const_local_iterator object can be used to iterate through a single bucket.

`unordered_set` public construct/copy/destruct

explicit unordered_set(size_type n = implementation-defined, 
                       hasher const& hf = hasher(), 
                       key_equal const& eq = key_equal(), 
                       allocator_type const& a = allocator_type());

Constructs an empty container with at least n buckets, using hf as the hash function, eq as the key equality predicate, a as the allocator and a maximum load factor of 1.0.

Postconditions:

size() == 0

template<typename InputIterator> 
  unordered_set(InputIterator f, InputIterator l, 
                size_type n = implementation-defined, 
                hasher const& hf = hasher(), 
                key_equal const& eq = key_equal(), 
                allocator_type const& a = allocator_type());

Constructs an empty container with at least n buckets, using hf as the hash function, eq as the key equality predicate, a as the allocator and a maximum load factor of 1.0 and inserts the elements from [f, l) into it.

```
unordered_set(unordered_set const&);
```
The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.

Requires:

value_type is copy constructible

unordered_set(unordered_set &&);

The move constructor.

Notes:	This is emulated on compilers without rvalue references.
Requires:	`value_type` is move constructible. (TODO: This is not actually required in this implementation).

```
explicit unordered_set(Allocator const& a);
```
Constructs an empty container, using allocator a.
```
unordered_set(unordered_set const& x, Allocator const& a);
```
Constructs an container, copying x's contained elements, hash function, predicate, maximum load factor, but using allocator a.
```
~unordered_set();
```
Notes:

The destructor is applied to every element, and all memory is deallocated

unordered_set& operator=(unordered_set const&);

The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.

Notes:	On compilers without rvalue references, there is a single assignment operator with the signature `operator=(unordered_set)` in order to emulate move semantics.
Requires:	`value_type` is copy constructible

unordered_set& operator=(unordered_set &&);

The move assignment operator.

Notes:	On compilers without rvalue references, there is a single assignment operator with the signature `operator=(unordered_set)` in order to emulate move semantics.
Requires:	`value_type` is move constructible. (TODO: This is not actually required in this implementation).

allocator_type get_allocator() const;

`unordered_set` size and capacity

```
bool empty() const;
```
Returns:
size() == 0
```
size_type size() const;
```
Returns:
std::distance(begin(), end())
```
size_type max_size() const;
```
Returns:
size() of the largest possible container.

`unordered_set` iterators

```
iterator begin();
const_iterator begin() const;
```
Returns:
An iterator referring to the first element of the container, or if the container is empty the past-the-end value for the container.
```
iterator end();
const_iterator end() const;
```
Returns:
An iterator which refers to the past-the-end value for the container.
```
const_iterator cbegin() const;
```
Returns:
A constant iterator referring to the first element of the container, or if the container is empty the past-the-end value for the container.
```
const_iterator cend() const;
```
Returns:
A constant iterator which refers to the past-the-end value for the container.

`unordered_set` modifiers

template<typename... Args> std::pair<iterator, bool> emplace(Args&&... args);

Inserts an object, constructed with the arguments args, in the container if and only if there is no element in the container with an equivalent value.

Returns:

The bool component of the return type is true if an insert took place.

If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent value.

Throws:

If an exception is thrown by an operation other than a call to hasher the function has no effect.

Notes:

Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.

Pointers and references to elements are never invalidated.

If the compiler doesn't support variadic template arguments or rvalue references, this is emulated for up to 10 arguments, with no support for rvalue references or move semantics.

template<typename... Args> 
  iterator emplace_hint(const_iterator hint, Args&&... args);

Inserts an object, constructed with the arguments args, in the container if and only if there is no element in the container with an equivalent value.

hint is a suggestion to where the element should be inserted.

Returns:

If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent value.

Throws:

If an exception is thrown by an operation other than a call to hasher the function has no effect.

Notes:

The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same value.

Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.

Pointers and references to elements are never invalidated.

If the compiler doesn't support variadic template arguments or rvalue references, this is emulated for up to 10 arguments, with no support for rvalue references or move semantics.

std::pair<iterator, bool> insert(value_type const& obj);

Inserts obj in the container if and only if there is no element in the container with an equivalent value.

Returns:

The bool component of the return type is true if an insert took place.

If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent value.

Throws:

If an exception is thrown by an operation other than a call to hasher the function has no effect.

Notes:

Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.

Pointers and references to elements are never invalidated.

iterator insert(const_iterator hint, value_type const& obj);

Inserts obj in the container if and only if there is no element in the container with an equivalent value.

hint is a suggestion to where the element should be inserted.

Returns:

If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent value.

Throws:

If an exception is thrown by an operation other than a call to hasher the function has no effect.

Notes:

The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same value.

Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.

Pointers and references to elements are never invalidated.

template<typename InputIterator> 
  void insert(InputIterator first, InputIterator last);

Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent value.

Throws:

When inserting a single element, if an exception is thrown by an operation other than a call to hasher the function has no effect.

Notes:

Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.

Pointers and references to elements are never invalidated.

iterator erase(const_iterator position);

Erase the element pointed to by position.

Returns:

The iterator following position before the erasure.

Throws:

Only throws an exception if it is thrown by hasher or key_equal.

In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations.

Notes:

When the number of elements is a lot smaller than the number of buckets this function can be very inefficient as it has to search through empty buckets for the next element, in order to return the iterator. As a temporary workaround, the container has the method erase_return_void which will be faster.

```
size_type erase(key_type const& k);
```
Erase all elements with key equivalent to k.

Returns:

The number of elements erased.

Throws:

Only throws an exception if it is thrown by hasher or key_equal.

iterator erase(const_iterator first, const_iterator last);

Erases the elements in the range from first to last.

Returns:

The iterator following the erased elements - i.e. last.

Throws:

Only throws an exception if it is thrown by hasher or key_equal.

In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations.

void erase_return_void(const_iterator position);

Erase the element pointed to by position.

Throws:

Only throws an exception if it is thrown by hasher or key_equal.

In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations.

Notes:

This is a temporary workaround for the inefficient erase method. Hopefully, in a future version the signature of erase will be changed and this will be deprecated.

```
void clear();
```
Erases all elements in the container.

Postconditions:

size() == 0

Throws:

Never throws an exception.

void swap(unordered_set&);

Throws:	If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of `key_equal` or `hasher`.
Notes:	For a discussion of the behavior when allocators aren't equal see the implementation details.

`unordered_set` observers

```
hasher hash_function() const;
```
Returns:
The container's hash function.
```
key_equal key_eq() const;
```
Returns:
The container's key equality predicate.

`unordered_set` lookup

iterator find(key_type const& k);
const_iterator find(key_type const& k) const;
template<typename CompatibleKey, typename CompatibleHash, 
         typename CompatiblePredicate> 
  iterator find(CompatibleKey const& k, CompatibleHash const& hash, 
                CompatiblePredicate const& eq);
template<typename CompatibleKey, typename CompatibleHash, 
         typename CompatiblePredicate> 
  const_iterator 
  find(CompatibleKey const& k, CompatibleHash const& hash, 
       CompatiblePredicate const& eq) const;

Returns:	An iterator pointing to an element with key equivalent to `k`, or `b.end()` if no such element exists.
Notes:	The templated overloads are a non-standard extensions which allows you to use a compatible hash function and equality predicate for a key of a different type in order to avoid an expensive type cast. In general, its use is not encouraged.

```
size_type count(key_type const& k) const;
```
Returns:

The number of elements with key equivalent to k.

std::pair<iterator, iterator> equal_range(key_type const& k);
std::pair<const_iterator, const_iterator> equal_range(key_type const& k) const;

Returns:

A range containing all elements with key equivalent to k. If the container doesn't container any such elements, returns std::make_pair(b.end(),b.end()).

`unordered_set` bucket interface

```
size_type bucket_count() const;
```
Returns:

The number of buckets.
```
size_type max_bucket_count() const;
```
Returns:

An upper bound on the number of buckets.
```
size_type bucket_size(size_type n) const;
```
Requires:

n < bucket_count()

Returns:

The number of elements in bucket n.
```
size_type bucket(key_type const& k) const;
```
Returns:

The index of the bucket which would contain an element with key k.

Postconditions:

The return value is less than bucket_count()
```
local_iterator begin(size_type n);
const_local_iterator begin(size_type n) const;
```
Requires:

n shall be in the range [0, bucket_count()).

Returns:

A local iterator pointing the first element in the bucket with index n.
```
local_iterator end(size_type n);
const_local_iterator end(size_type n) const;
```
Requires:

n shall be in the range [0, bucket_count()).

Returns:

A local iterator pointing the 'one past the end' element in the bucket with index n.
```
const_local_iterator cbegin(size_type n) const;
```
Requires:

n shall be in the range [0, bucket_count()).

Returns:

A constant local iterator pointing the first element in the bucket with index n.
```
const_local_iterator cend(size_type n);
```
Requires:

n shall be in the range [0, bucket_count()).

Returns:

A constant local iterator pointing the 'one past the end' element in the bucket with index n.

`unordered_set` hash policy

```
float load_factor() const;
```
Returns:

The average number of elements per bucket.
```
float max_load_factor() const;
```
Returns:

Returns the current maximum load factor.
```
void max_load_factor(float z);
```
Effects:

Changes the container's maximum load factor, using z as a hint.
```
void rehash(size_type n);
```
Changes the number of buckets so that there at least n buckets, and so that the load factor is less than the maximum load factor.

Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.

Throws:

The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.

`unordered_set` Equality Comparisons

template<typename Value, typename Hash, typename Pred, typename Alloc> 
  bool operator==(unordered_set<Value, Hash, Pred, Alloc> const& x, 
                  unordered_set<Value, Hash, Pred, Alloc> const& y);

Notes:

This is a boost extension.

Behavior is undefined if the two containers don't have equivalent equality predicates.

template<typename Value, typename Hash, typename Pred, typename Alloc> 
  bool operator!=(unordered_set<Value, Hash, Pred, Alloc> const& x, 
                  unordered_set<Value, Hash, Pred, Alloc> const& y);

Notes:

This is a boost extension.

Behavior is undefined if the two containers don't have equivalent equality predicates.

`unordered_set` swap

template<typename Value, typename Hash, typename Pred, typename Alloc> 
  void swap(unordered_set<Value, Hash, Pred, Alloc>& x, 
            unordered_set<Value, Hash, Pred, Alloc>& y);

Effects:	`x.swap(y)`
Throws:	If the allocators are equal, doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of `Hash` or `Pred`.
Notes:	For a discussion of the behavior when allocators aren't equal see the implementation details.

Returns:	The number of elements erased.
Throws:	Only throws an exception if it is thrown by `hasher` or `key_equal`.

Requires:	`n < bucket_count()`
Returns:	The number of elements in bucket `n`.

Returns:	The index of the bucket which would contain an element with key `k`.
Postconditions:	The return value is less than `bucket_count()`

Requires:	`n` shall be in the range `[0, bucket_count())`.
Returns:	A local iterator pointing the first element in the bucket with index `n`.

Boost C++ Libraries