|`Key` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it).
|_Mapped_
|`Mapped` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it).
|_Hash_
|A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.
|_Pred_
|A binary function object that implements an equivalence relation on values of type `Key`. 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.
=== Typedefs
[source,c++,subs=+quotes]
----
typedef typename allocator_type::pointer pointer;
----
`value_type*` if `allocator_type::pointer` is not defined.
Constructs an empty container using `hasher()` as the hash function,
`key_equal()` as the key equality predicate, `allocator_type()` as the allocator
and a maximum load factor of `1.0`.
Postconditions:: `size() == 0`
Requires:: If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
---
==== Bucket Count Constructor
```c++
explicit unordered_multimap(size_type n,
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`
Requires:: If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.
If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.
Requires:: `value_type` is copy constructible
---
==== Move Constructor
```c++
unordered_multimap(unordered_multimap&& other);
```
The move constructor.
Notes:: This is implemented using Boost.Move.
Requires:: `value_type` is move-constructible. On compilers without rvalue reference support the emulation does not support moving without calling `boost::move` if `value_type` is not copyable.
So, for example, you can't return the container from a function.
---
==== Allocator Constructor
```c++
explicit unordered_multimap(Allocator const& a);
```
Constructs an empty container, using allocator `a`.
Construct a container moving ``other``'s contained elements, and having the hash function, predicate and maximum load factor, but using allocate `a`.
Notes:: This is implemented using Boost.Move.
Requires:: `value_type` is move insertable.
---
==== Bucket Count Constructor with Allocator
```c++
unordered_multimap(size_type n, allocator_type const& a);
```
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, the default hash function and key equality predicate, `a` as the allocator and a maximum load factor of `1.0`.
Postconditions:: `size() == 0`
Requires:: `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
---
==== Bucket Count Constructor with Hasher and Allocator
```c++
unordered_multimap(size_type n, hasher const& hf, allocator_type const& a);
```
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, the default key equality predicate, `a` as the allocator and a maximum load factor of `1.0`.
Postconditions:: `size() == 0`
Requires:: `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
---
==== Initializer List Constructor
[source,c++,subs="quotes,macros"]
----
unordered_multimap(initializer_list++<++value_type++>++ il,
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 `il` into it.
Requires:: If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
---
==== Iterator Range Constructor
[source,c++,subs="quotes,macros"]
----
template++<++typename InputIterator++>++
unordered_multimap(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.
Requires:: If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
---
==== Iterator Range Constructor with Bucket Count and Allocator
[source,c++,subs="quotes,macros"]
----
template++<++typename InputIterator++>++
unordered_multimap(InputIterator f,
InputIterator l,
size_type n,
allocator_type const& a);
----
Constructs an empty container with at least `n` buckets, using `a` as the allocator, with the default hash function and key equality predicate and a maximum load factor of `1.0` and inserts the elements from `[f, l)` into it.
Requires:: `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
==== Iterator Range Constructor with Bucket Count and Hasher
[source,c++,subs="quotes,macros"]
----
template++<++typename InputIterator++>++
unordered_multimap(InputIterator f,
InputIterator l,
size_type n,
hasher const& hf,
allocator_type const& a);
----
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator, with the default key equality predicate and a maximum load factor of `1.0` and inserts the elements from `[f, l)` into it.
Requires:: `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
---
=== Destructor
```c++
~unordered_multimap();
```
Note:: The destructor is applied to every element, and all memory is deallocated
The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.
If `Alloc::propagate_on_container_copy_assignment` exists and `Alloc::propagate_on_container_copy_assignment::value` is `true`, the allocator is overwritten, if not the copied elements are created using the existing allocator.
If `Alloc::propagate_on_container_move_assignment` exists and `Alloc::propagate_on_container_move_assignment::value` is `true`, the allocator is overwritten, if not the moved elements are created using the existing allocator.
Notes:: On compilers without rvalue references, this is emulated using Boost.Move. Note that on some compilers the copy assignment operator may be used in some circumstances.
Assign from values in initializer list. All existing elements are either overwritten by the new elements or destroyed.
Requires:: `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] into the container and https://en.cppreference.com/w/cpp/named_req/CopyAssignable[CopyAssignable^].
=== Size and Capacity
==== empty
```c++
bool empty() const;
```
Returns:: `size() == 0`
---
==== size
```c++
size_type size() const;
```
Returns:: `std::distance(begin(), end())`
---
==== max_size
```c++
size_type max_size() const;
```
Returns:: `size()` of the largest possible container.
---
=== Iterators
==== begin
```c++
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.
---
==== end
```c++
iterator end();
const_iterator end() const;
```
Returns:: An iterator which refers to the past-the-end value for the container.
---
==== cbegin
```c++
const_iterator cbegin() const;
```
Returns:: A `const_iterator` referring to the first element of the container, or if the container is empty the past-the-end value for the container.
---
==== cend
```c++
const_iterator cend() const;
```
Returns:: A `const_iterator` which refers to the past-the-end value for the container.
Inserts an object, constructed with the arguments `args`, in the container.
Requires:: `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `args`.
Returns:: An iterator pointing to the inserted element.
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.
Since existing `std::pair` implementations don't support `std::piecewise_construct` this emulates it, but using `boost::unordered::piecewise_construct`.
Inserts an object, constructed with the arguments args, in the container.
`hint` is a suggestion to where the element should be inserted.
Requires:: `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `args`.
Returns:: An iterator pointing to the inserted element.
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 key.
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.
Since existing `std::pair` implementations don't support `std::piecewise_construct` this emulates it, but using `boost::unordered::piecewise_construct`.
Requires:: `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^].
Returns:: An iterator pointing to the inserted element.
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.
Requires:: `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^].
Returns:: An iterator pointing to the inserted element.
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.
Requires:: `nh` is empty or `nh.get_allocator()` is equal to the container's allocator.
Returns:: If `nh` was empty, returns `end()`. Otherwise returns an iterator pointing to the newly inserted element.
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. In C++17 this can be used to insert a node extracted from a compatible `unordered_map`, but that is not supported yet.
`hint` is a suggestion to where the element should be inserted.
Requires:: `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^].
Returns:: An iterator pointing to the inserted element.
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 key. 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.
`hint` is a suggestion to where the element should be inserted.
Requires:: `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^].
Returns:: An iterator pointing to the inserted element.
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 key. 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.
Only participates in overload resolution if `std::is_constructible<value_type, P&&>::value` is `true`.
`hint` is a suggestion to where the element should be inserted.
Returns:: An iterator pointing to the inserted element.
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 key. 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.
`hint` is a suggestion to where the element should be inserted.
Requires:: `nh` is empty or `nh.get_allocator()` is equal to the container's allocator.
Returns:: If `nh` was empty, returns `end()`. +
+
Otherwise returns an iterator pointing to the newly inserted element.
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 key. 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. In C++17 this can be used to insert a node extracted from a compatible `unordered_map`, but that is not supported yet.
Requires:: `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `*first`.
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.
---
==== Insert Initializer List
```c++
void insert(initializer_list<value_type> il);
```
Inserts a range of elements into the container.
Requires:: `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `*first`.
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.
---
==== Extract by Iterator
```c++
node_type extract(const_iterator position);
```
Removes the element pointed to by `position`.
Returns:: A `node_type` owning the element.
Notes:: In C++17 a node extracted using this method can be inserted into a compatible `unordered_map`, but that is not supported yet.
---
==== Transparent Extract by Key
```c++
template<typename K>
node_type extract(K&& k);
```
Removes an element with key equivalent to `k`.
This overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.
Returns:: A `node_type` owning the element if found, otherwise an empty `node_type`.
Throws:: Only throws an exception if it is thrown by `hasher` or `key_equal`.
Notes:: In C++17 a node extracted using this method can be inserted into a compatible `unordered_map`, but that is not supported yet.
---
==== Extract by Key
```c++
node_type extract(key_type const& k);
```
Removes an element with key equivalent to `k`.
Returns:: A `node_type` owning the element if found, otherwise an empty `node_type`.
Throws:: Only throws an exception if it is thrown by `hasher` or `key_equal`.
Notes:: In C++17 a node extracted using this method can be inserted into a compatible `unordered_map`, but that is not supported yet.
==== Erase by Position
```c++
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`.
Notes:: In older versions this could be inefficient because it had to search through several buckets to find the position of the returned iterator. The data structure has been changed so that this is no longer the case, and the alternative erase methods have been deprecated.
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.
---
==== Transparent Erase by Key
```c++
template<typename K>
size_type erase(K&& k);
```
Erase all elements with key equivalent to `k`.
This overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.
Returns:: The number of elements erased.
Throws:: Only throws an exception if it is thrown by `hasher` or `key_equal`.
---
==== Erase by Key
```c++
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`.
---
==== quick_erase
```c++
void quick_erase(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 method was implemented because returning an iterator to the next element from erase was expensive, but the container has been redesigned so that is no longer the case. So this method is now deprecated.
---
==== erase_return_void
```c++
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 method was implemented because returning an iterator to the next element from erase was expensive, but the container has been redesigned so that is no longer the case. So this method is now deprecated.
---
==== clear
```c++
void clear();
```
Erases all elements in the container.
Postconditions:: `size() == 0`
Throws:: Never throws an exception.
---
==== swap
```c++
void swap(unordered_multimap& other);
```
Swaps the contents of the container with the parameter.
If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the containers' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior.
Throws:: Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of `key_equal` or `hasher`.
Notes:: The exception specifications aren't quite the same as the C++11 standard, as the equality predicate and hash function are swapped using their copy constructors.
Notes:: Does not support merging with a compatible `unordered_map` yet.
---
=== Observers
==== get_allocator
```
allocator_type get_allocator() const;
```
---
==== hash_function
```
hasher hash_function() const;
```
Returns:: The container's hash function.
---
```
key_equal key_eq() const;
```
Returns:: The container's key equality predicate
---
=== Lookup
==== find
```c++
iterator find(key_type const& k);
const_iterator find(key_type const& k) const;
template<typename K>
iterator
find(K const& k);
template<typename K>
const_iterator
find(K 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 containing `CompatibleKey`, `CompatibleHash` and `CompatiblePredicate` are non-standard extensions which allow 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 and instead the `K` member function templates should be used. +
The `template <typename K>` overloads only participate in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.
---
==== contains
```c++
template<typename K>
bool contains(K const& key);
bool contains(key_type const& key) const;
```
Returns:: A boolean indicating whether or not there is an element with key equal to `key` in the container
Notes:: The `template <typename K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.
---
==== count
```c++
template<typename K>
size_type count(K const& k) const;
size_type count(key_type const& k) const;
```
Returns:: The number of elements with key equivalent to `k`.
Notes:: The `template <typename K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.
---
==== equal_range
```c++
std::pair<iterator, iterator>
equal_range(key_type const& k);
std::pair<const_iterator, const_iterator>
equal_range(key_type const& k) const;
template<typename K>
std::pair<iterator, iterator>
equal_range(K const& k);
template<typename K>
std::pair<const_iterator, const_iterator>
equal_range(K const& k) const;
```
Returns:: A range containing all elements with key equivalent to `k`. If the container doesn't contain any such elements, returns `std::make_pair(b.end(), b.end())`.
Notes:: The `template <typename K>` overloads only participate in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.
---
=== Bucket Interface
==== bucket_count
```c++
size_type bucket_count() const;
```
Returns:: The number of buckets.
---
==== max_bucket_count
```c++
size_type max_bucket_count() const;
```
Returns:: An upper bound on the number of buckets.
---
==== bucket_size
```c++
size_type bucket_size(size_type n) const;
```
Requires:: `n < bucket_count()`
Returns:: The number of elements in bucket `n`.
---
==== bucket
```c++
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()`.
---
==== begin
```c++
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`.
---
==== end
```c++
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`.
---
==== cbegin
```c++
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`.
---
==== cend
```c++
const_local_iterator cend(size_type n) const;
```
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`.
---
=== Hash Policy
==== load_factor
```c++
float load_factor() const;
```
Returns:: The average number of elements per bucket.
---
==== max_load_factor
```c++
float max_load_factor() const;
```
Returns:: Returns the current maximum load factor.
---
==== Set max_load_factor
```c++
void max_load_factor(float z);
```
Effects:: Changes the container's maximum load factor, using `z` as a hint.
---
==== rehash
```c++
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.
---
==== reserve
```c++
void reserve(size_type n);
```
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.
Return `true` if `x.size() == y.size()` and for every equivalent key group in `x`, there is a group in `y` for the same key, which is a permutation (using `operator==` to compare the value types).
Notes:: The behavior of this function was changed to match the C++11 standard in Boost 1.48. Behavior is undefined if the two containers don't have equivalent equality predicates.
Return `false` if `x.size() == y.size()` and for every equivalent key group in `x`, there is a group in `y` for the same key, which is a permutation (using `operator==` to compare the value types).
Notes:: The behavior of this function was changed to match the C++11 standard in Boost 1.48. Behavior is undefined if the two containers don't have equivalent equality predicates.
If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the containers' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior.
Effects:: `x.swap(y)`
Throws:: Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of `key_equal` or `hasher`.
Notes:: The exception specifications aren't quite the same as the C++11 standard, as the equality predicate and hash function are swapped using their copy constructors.
