unordered_set Class

The template class describes an object that controls a varying-length sequence of elements of type const Key. The sequence is weakly ordered by a hash function, which partitions the sequence into an ordered set of subsequences called buckets. Within each bucket a comparison function determines whether any pair of elements has equivalent ordering. Each element serves as both a sort key and a value. The sequence is represented in a way that permits lookup, insertion, and removal of an arbitrary element with a number of operations that can be independent of the number of elements in the sequence (constant time), at least when all buckets are of roughly equal length. In the worst case, when all of the elements are in one bucket, the number of operations is proportional to the number of elements in the sequence (linear time). Moreover, inserting an element invalidates no iterators, and removing an element invalidates only those iterators which point at the removed element.

template<class Key,
    class Hash = std::tr1::hash<Key>,
    class Pred = std::equal_to<Key>,
    class Alloc = std::allocator<Key> >
    class unordered_set;

Parameters

• Key
  The key type.

• Hash
  The hash function object type.

• Pred
  The equality comparison function object type.

• Alloc
  The allocator class.

Members

Type Definition	Description
unordered_set::allocator_type	The type of an allocator for managing storage.
unordered_set::const_iterator	The type of a constant iterator for the controlled sequence.
unordered_set::const_local_iterator	The type of a constant bucket iterator for the controlled sequence.
unordered_set::const_pointer	The type of a constant pointer to an element.
unordered_set::const_reference	The type of a constant reference to an element.
unordered_set::difference_type	The type of a signed distance between two elements.
unordered_set::hasher	The type of the hash function.
unordered_set::iterator	The type of an iterator for the controlled sequence.
unordered_set::key_equal	The type of the comparison function.
unordered_set::key_type	The type of an ordering key.
unordered_set::local_iterator	The type of a bucket iterator for the controlled sequence.
unordered_set::pointer	The type of a pointer to an element.
unordered_set::reference	The type of a reference to an element.
unordered_set::size_type	The type of an unsigned distance between two elements.
unordered_set::value_type	The type of an element.

Member Function	Description
unordered_set::begin	Designates the beginning of the controlled sequence.
unordered_set::bucket	Gets the bucket number for a key value.
unordered_set::bucket_count	Gets the number of buckets.
unordered_set::bucket_size	Gets the size of a bucket.
unordered_set::clear	Removes all elements.
unordered_set::count	Finds the number of elements matching a specified key.
unordered_set::empty	Tests whether no elements are present.
unordered_set::end	Designates the end of the controlled sequence.
unordered_set::equal_range	Finds range that matches a specified key.
unordered_set::erase	Removes elements at specified positions.
unordered_set::find	Finds an element that matches a specified key.
unordered_set::get_allocator	Gets the stored allocator object.
unordered_set::hash_function	Gets the stored hash function object.
unordered_set::insert	Adds elements.
unordered_set::key_eq	Gets the stored comparison function object.
unordered_set::load_factor	Counts the average elements per bucket.
unordered_set::max_bucket_count	Gets the maximum number of buckets.
unordered_set::max_load_factor	Gets or sets the maximum elements per bucket.
unordered_set::max_size	Gets the maximum size of the controlled sequence.
unordered_set::rehash	Rebuilds the hash table.
unordered_set::size	Counts the number of elements.
unordered_set::swap	Swaps the contents of two containers.
unordered_set::unordered_set	Constructs a container object.

Remarks

The object orders the sequence it controls by calling two stored objects, a comparison function object of type unordered_set::key_equal and a hash function object of type unordered_set::hasher. You access the first stored object by calling the member function unordered_set::key_eq(); and you access the second stored object by calling the member function unordered_set::hash_function(). Specifically, for all values X and Y of type Key, the call key_eq()(X, Y) returns true only if the two argument values have equivalent ordering; the call hash_function()(keyval) yields a distribution of values of type size_t. Unlike template class unordered_multiset Class, an object of template class unordered_set ensures that key_eq()(X, Y) is always false for any two elements of the controlled sequence. (Keys are unique.)

The object also stores a maximum load factor, which specifies the maximum desired average number of elements per bucket. If inserting an element causes unordered_set::load_factor() to exceed the maximum load factor, the container increases the number of buckets and rebuilds the hash table as needed.

The actual order of elements in the controlled sequence depends on the hash function, the comparison function, the order of insertion, the maximum load factor, and the current number of buckets. You cannot in general predict the order of elements in the controlled sequence. You can always be assured, however, that any subset of elements that have equivalent ordering are adjacent in the controlled sequence.

The object allocates and frees storage for the sequence it controls through a stored allocator object of type unordered_set::allocator_type. Such an allocator object must have the same external interface as an object of template class allocator. Note that the stored allocator object is not copied when the container object is assigned.

Requirements

Header: <unordered_set>

Namespace: std::tr1

See Also

Reference

<unordered_set>

unordered_set Class