diff --git a/doc/ref.xml b/doc/ref.xml index 99f869f6..e0125e17 100644 --- a/doc/ref.xml +++ b/doc/ref.xml @@ -47,17 +47,14 @@ 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. + 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. + 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. @@ -175,22 +172,22 @@ size_type - implementation-defined + implementation-defined - hasher const& - hasher() + hasher const& + hasher() - key_equal const& - key_equal() + key_equal const& + key_equal() - allocator_type const& - allocator_type() + allocator_type const& + allocator_type() - size() == 0 + size() == 0 Constructs an empty container with at least n buckets, using hf as the hash function, eq as the key equality predicate, a as the allocatorand a maximum load factor of 1.0. @@ -210,19 +207,19 @@ size_type - implementation-defined + implementation-defined - hasher const& - hasher() + hasher const& + hasher() - key_equal const& - key_equal() + key_equal const& + key_equal() - allocator_type const& - allocator_type() + allocator_type const& + 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. @@ -231,7 +228,7 @@ - unordered_set const& + unordered_set const& The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator. @@ -242,9 +239,13 @@ - unordered_set const& + unordered_set const& - unordered_set&The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator. + unordered_set& + + The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator. + + allocator_type @@ -253,19 +254,18 @@ bool - size() == 0 + size() == 0 size_type - std::distance(begin(), end()) + std::distance(begin(), end()) size_type - - size() of the largest possible container. + size() of the largest possible container. @@ -300,13 +300,12 @@ size_type - - std::distance(begin(), end()) + std::distance(begin(), end()) - value_type const& + value_type const& std::pair<iterator, bool> @@ -320,8 +319,7 @@ - If an exception is thrown by an operation other than a call to - hasher the function has no effect. + If an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -335,7 +333,7 @@ iterator - value_type const& + value_type const& iterator @@ -344,7 +342,7 @@ const_iterator - value_type const& + value_type const& const_iterator @@ -359,8 +357,7 @@ - If an exception is thrown by an operation other than a call to - hasher the function has no effect. + If an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -368,6 +365,8 @@ Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + In this implementation, iterator and const_iterator are the same type, so a single overload is defined to implement both signatures. + @@ -387,8 +386,7 @@ - When inserting a single element, if an exception is thrown by an operation other than a call to - hasher the function has no effect. + When inserting a single element, if an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -410,34 +408,33 @@ const_iterator - Erase the element pointed to by - position. + Erase the element pointed to by position. - The iterator following - position before the erasure. + The iterator following position before the erasure. - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. They don't get called by the current implementation Boost.Unordered but other implementations may call them. + + In this implementation, iterator and const_iterator are the same type, so a single overload is defined to implement both signatures. + + - key_type const& + key_type const& size_type - Erase all elements with key equivalent to - k. + Erase all elements with key equivalent to k. @@ -445,9 +442,7 @@ - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. @@ -471,20 +466,15 @@ const_iterator - Erases the elements in the range from - first to - last. + Erases the elements in the range from first to last. - The iterator following the erased elements - i.e. - last. + The iterator following the erased elements - i.e. last. - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. They don't get called by the current implementation Boost.Unordered but other implementations may call them. @@ -497,8 +487,7 @@ - - size() == 0 + size() == 0 @@ -508,13 +497,11 @@ - unordered_set& + unordered_set& void - Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of - key_equal or - hasher. + Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of key_equal or hasher. @@ -535,51 +522,46 @@ - key_type const& + key_type const& iterator - key_type const& + key_type const& iterator - An iterator pointing to an element with key equivalent to - k, or - b.end() if no such element exists. + An iterator pointing to an element with key equivalent to k, or b.end() if no such element exists. - key_type const& + key_type const& size_type - The number of elements with key equivalent to - k. + The number of elements with key equivalent to k. - key_type const& + key_type const& std::pair<iterator, iterator> - key_type const& + key_type const& std::pair<iterator, iterator> - A range with 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()). + A range with 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()). @@ -617,17 +599,15 @@ - key_type const& + key_type const& size_type - The index of the bucket which would contain an element with key - k. + The index of the bucket which would contain an element with key k. - The return value is less than - bucket_count() + The return value is less than bucket_count() @@ -645,14 +625,12 @@ const_local_iterator - - n shall be in the range + n shall be in the range [0, bucket_count()). - A local iterator pointing the first element in the bucket with index - n. + A local iterator pointing the first element in the bucket with index n. @@ -670,14 +648,12 @@ const_local_iterator - - n shall be in the range + n shall be in the range [0, bucket_count()). - A local iterator pointing the 'one past the end' element in the bucket with index - n. + A local iterator pointing the 'one past the end' element in the bucket with index n. @@ -703,8 +679,7 @@ float - Changes the container's maximum load factor, using - z as a hint. + Changes the container's maximum load factor, using z as a hint. @@ -714,8 +689,7 @@ void - 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. + 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 @@ -739,10 +713,10 @@ - unordered_set<Key, T, Hash, Pred, Alloc>& + unordered_set<Key, T, Hash, Pred, Alloc>& - unordered_set<Key, T, Hash, Pred, Alloc>& + unordered_set<Key, T, Hash, Pred, Alloc>& void @@ -750,9 +724,7 @@ - Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of - Hash or - Pred. + Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of Hash or Pred. @@ -798,17 +770,14 @@ 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. + 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. + 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. @@ -926,22 +895,22 @@ size_type - implementation-defined + implementation-defined - hasher const& - hasher() + hasher const& + hasher() - key_equal const& - key_equal() + key_equal const& + key_equal() - allocator_type const& - allocator_type() + allocator_type const& + allocator_type() - size() == 0 + size() == 0 Constructs an empty container with at least n buckets, using hf as the hash function, eq as the key equality predicate, a as the allocatorand a maximum load factor of 1.0. @@ -961,19 +930,19 @@ size_type - implementation-defined + implementation-defined - hasher const& - hasher() + hasher const& + hasher() - key_equal const& - key_equal() + key_equal const& + key_equal() - allocator_type const& - allocator_type() + allocator_type const& + 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. @@ -982,7 +951,7 @@ - unordered_multiset const& + unordered_multiset const& The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator. @@ -993,9 +962,13 @@ - unordered_multiset const& + unordered_multiset const& - unordered_multiset&The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator. + unordered_multiset& + + The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator. + + allocator_type @@ -1004,19 +977,18 @@ bool - size() == 0 + size() == 0 size_type - std::distance(begin(), end()) + std::distance(begin(), end()) size_type - - size() of the largest possible container. + size() of the largest possible container. @@ -1051,13 +1023,12 @@ size_type - - std::distance(begin(), end()) + std::distance(begin(), end()) - value_type const& + value_type const& iterator @@ -1069,8 +1040,7 @@ - If an exception is thrown by an operation other than a call to - hasher the function has no effect. + If an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -1084,7 +1054,7 @@ iterator - value_type const& + value_type const& iterator @@ -1093,7 +1063,7 @@ const_iterator - value_type const& + value_type const& const_iterator @@ -1108,8 +1078,7 @@ - If an exception is thrown by an operation other than a call to - hasher the function has no effect. + If an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -1136,8 +1105,7 @@ - When inserting a single element, if an exception is thrown by an operation other than a call to - hasher the function has no effect. + When inserting a single element, if an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -1159,34 +1127,31 @@ const_iterator - Erase the element pointed to by - position. + Erase the element pointed to by position. - The iterator following - position before the erasure. + The iterator following position before the erasure. - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. They don't get called by the current implementation Boost.Unordered but other implementations may call them. + + - key_type const& + key_type const& size_type - Erase all elements with key equivalent to - k. + Erase all elements with key equivalent to k. @@ -1194,9 +1159,7 @@ - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. @@ -1220,20 +1183,15 @@ const_iterator - Erases the elements in the range from - first to - last. + Erases the elements in the range from first to last. - The iterator following the erased elements - i.e. - last. + The iterator following the erased elements - i.e. last. - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. They don't get called by the current implementation Boost.Unordered but other implementations may call them. @@ -1246,8 +1204,7 @@ - - size() == 0 + size() == 0 @@ -1257,13 +1214,11 @@ - unordered_multiset& + unordered_multiset& void - Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of - key_equal or - hasher. + Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of key_equal or hasher. @@ -1284,51 +1239,46 @@ - key_type const& + key_type const& iterator - key_type const& + key_type const& iterator - An iterator pointing to an element with key equivalent to - k, or - b.end() if no such element exists. + An iterator pointing to an element with key equivalent to k, or b.end() if no such element exists. - key_type const& + key_type const& size_type - The number of elements with key equivalent to - k. + The number of elements with key equivalent to k. - key_type const& + key_type const& std::pair<iterator, iterator> - key_type const& + key_type const& std::pair<iterator, iterator> - A range with 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()). + A range with 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()). @@ -1366,17 +1316,15 @@ - key_type const& + key_type const& size_type - The index of the bucket which would contain an element with key - k. + The index of the bucket which would contain an element with key k. - The return value is less than - bucket_count() + The return value is less than bucket_count() @@ -1394,14 +1342,12 @@ const_local_iterator - - n shall be in the range + n shall be in the range [0, bucket_count()). - A local iterator pointing the first element in the bucket with index - n. + A local iterator pointing the first element in the bucket with index n. @@ -1419,14 +1365,12 @@ const_local_iterator - - n shall be in the range + n shall be in the range [0, bucket_count()). - A local iterator pointing the 'one past the end' element in the bucket with index - n. + A local iterator pointing the 'one past the end' element in the bucket with index n. @@ -1452,8 +1396,7 @@ float - Changes the container's maximum load factor, using - z as a hint. + Changes the container's maximum load factor, using z as a hint. @@ -1463,8 +1406,7 @@ void - 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. + 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 @@ -1488,10 +1430,10 @@ - unordered_multiset<Key, T, Hash, Pred, Alloc>& + unordered_multiset<Key, T, Hash, Pred, Alloc>& - unordered_multiset<Key, T, Hash, Pred, Alloc>& + unordered_multiset<Key, T, Hash, Pred, Alloc>& void @@ -1499,9 +1441,7 @@ - Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of - Hash or - Pred. + Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of Hash or Pred. @@ -1564,17 +1504,14 @@ 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. + 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. + 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. @@ -1695,22 +1632,22 @@ size_type - implementation-defined + implementation-defined - hasher const& - hasher() + hasher const& + hasher() - key_equal const& - key_equal() + key_equal const& + key_equal() - allocator_type const& - allocator_type() + allocator_type const& + allocator_type() - size() == 0 + size() == 0 Constructs an empty container with at least n buckets, using hf as the hash function, eq as the key equality predicate, a as the allocatorand a maximum load factor of 1.0. @@ -1730,19 +1667,19 @@ size_type - implementation-defined + implementation-defined - hasher const& - hasher() + hasher const& + hasher() - key_equal const& - key_equal() + key_equal const& + key_equal() - allocator_type const& - allocator_type() + allocator_type const& + 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. @@ -1751,7 +1688,7 @@ - unordered_map const& + unordered_map const& The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator. @@ -1762,9 +1699,13 @@ - unordered_map const& + unordered_map const& - unordered_map&The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator. + unordered_map& + + The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator. + + allocator_type @@ -1773,19 +1714,18 @@ bool - size() == 0 + size() == 0 size_type - std::distance(begin(), end()) + std::distance(begin(), end()) size_type - - size() of the largest possible container. + size() of the largest possible container. @@ -1820,13 +1760,12 @@ size_type - - std::distance(begin(), end()) + std::distance(begin(), end()) - value_type const& + value_type const& std::pair<iterator, bool> @@ -1840,8 +1779,7 @@ - If an exception is thrown by an operation other than a call to - hasher the function has no effect. + If an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -1855,7 +1793,7 @@ iterator - value_type const& + value_type const& iterator @@ -1864,7 +1802,7 @@ const_iterator - value_type const& + value_type const& const_iterator @@ -1879,8 +1817,7 @@ - If an exception is thrown by an operation other than a call to - hasher the function has no effect. + If an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -1888,6 +1825,8 @@ Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + In this implementation, iterator and const_iterator are the same type, so a single overload is defined to implement both signatures. + @@ -1907,8 +1846,7 @@ - When inserting a single element, if an exception is thrown by an operation other than a call to - hasher the function has no effect. + When inserting a single element, if an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -1930,34 +1868,33 @@ const_iterator - Erase the element pointed to by - position. + Erase the element pointed to by position. - The iterator following - position before the erasure. + The iterator following position before the erasure. - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. They don't get called by the current implementation Boost.Unordered but other implementations may call them. + + In this implementation, iterator and const_iterator are the same type, so a single overload is defined to implement both signatures. + + - key_type const& + key_type const& size_type - Erase all elements with key equivalent to - k. + Erase all elements with key equivalent to k. @@ -1965,9 +1902,7 @@ - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. @@ -1991,20 +1926,15 @@ const_iterator - Erases the elements in the range from - first to - last. + Erases the elements in the range from first to last. - The iterator following the erased elements - i.e. - last. + The iterator following the erased elements - i.e. last. - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. They don't get called by the current implementation Boost.Unordered but other implementations may call them. @@ -2017,8 +1947,7 @@ - - size() == 0 + size() == 0 @@ -2028,13 +1957,11 @@ - unordered_map& + unordered_map& void - Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of - key_equal or - hasher. + Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of key_equal or hasher. @@ -2055,72 +1982,64 @@ - key_type const& + key_type const& iterator - key_type const& + key_type const& iterator - An iterator pointing to an element with key equivalent to - k, or - b.end() if no such element exists. + An iterator pointing to an element with key equivalent to k, or b.end() if no such element exists. - key_type const& + key_type const& size_type - The number of elements with key equivalent to - k. + The number of elements with key equivalent to k. - key_type const& + key_type const& std::pair<iterator, iterator> - key_type const& + key_type const& std::pair<iterator, iterator> - A range with 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()). + A range with 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()). - key_type const& + key_type const& - mapped_type& + mapped_type& - If the container does not already contain an elements with a key equivalent to - k, inserts the value std::pair<key_type const, mapped_type>(k, mapped_type()) + If the container does not already contain an elements with a key equivalent to k, inserts the value std::pair<key_type const, mapped_type>(k, mapped_type()) - A reference to x.second where x is the element already in the container, or the newly inserted element with a key equivalent to - k + A reference to x.second where x is the element already in the container, or the newly inserted element with a key equivalent to k - If an exception is thrown by an operation other than a call to - hasher the function has no effect. + If an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -2162,17 +2081,15 @@ - key_type const& + key_type const& size_type - The index of the bucket which would contain an element with key - k. + The index of the bucket which would contain an element with key k. - The return value is less than - bucket_count() + The return value is less than bucket_count() @@ -2190,14 +2107,12 @@ const_local_iterator - - n shall be in the range + n shall be in the range [0, bucket_count()). - A local iterator pointing the first element in the bucket with index - n. + A local iterator pointing the first element in the bucket with index n. @@ -2215,14 +2130,12 @@ const_local_iterator - - n shall be in the range + n shall be in the range [0, bucket_count()). - A local iterator pointing the 'one past the end' element in the bucket with index - n. + A local iterator pointing the 'one past the end' element in the bucket with index n. @@ -2248,8 +2161,7 @@ float - Changes the container's maximum load factor, using - z as a hint. + Changes the container's maximum load factor, using z as a hint. @@ -2259,8 +2171,7 @@ void - 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. + 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 @@ -2286,10 +2197,10 @@ - unordered_map<Key, T, Hash, Pred, Alloc>& + unordered_map<Key, T, Hash, Pred, Alloc>& - unordered_map<Key, T, Hash, Pred, Alloc>& + unordered_map<Key, T, Hash, Pred, Alloc>& void @@ -2297,9 +2208,7 @@ - Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of - Hash or - Pred. + Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of Hash or Pred. @@ -2354,17 +2263,14 @@ 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. + 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. + 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. @@ -2485,22 +2391,22 @@ size_type - implementation-defined + implementation-defined - hasher const& - hasher() + hasher const& + hasher() - key_equal const& - key_equal() + key_equal const& + key_equal() - allocator_type const& - allocator_type() + allocator_type const& + allocator_type() - size() == 0 + size() == 0 Constructs an empty container with at least n buckets, using hf as the hash function, eq as the key equality predicate, a as the allocatorand a maximum load factor of 1.0. @@ -2520,19 +2426,19 @@ size_type - implementation-defined + implementation-defined - hasher const& - hasher() + hasher const& + hasher() - key_equal const& - key_equal() + key_equal const& + key_equal() - allocator_type const& - allocator_type() + allocator_type const& + 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. @@ -2541,7 +2447,7 @@ - unordered_multimap const& + unordered_multimap const& The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator. @@ -2552,9 +2458,13 @@ - unordered_multimap const& + unordered_multimap const& - unordered_multimap&The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator. + unordered_multimap& + + The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator. + + allocator_type @@ -2563,19 +2473,18 @@ bool - size() == 0 + size() == 0 size_type - std::distance(begin(), end()) + std::distance(begin(), end()) size_type - - size() of the largest possible container. + size() of the largest possible container. @@ -2610,13 +2519,12 @@ size_type - - std::distance(begin(), end()) + std::distance(begin(), end()) - value_type const& + value_type const& iterator @@ -2628,8 +2536,7 @@ - If an exception is thrown by an operation other than a call to - hasher the function has no effect. + If an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -2643,7 +2550,7 @@ iterator - value_type const& + value_type const& iterator @@ -2652,7 +2559,7 @@ const_iterator - value_type const& + value_type const& const_iterator @@ -2667,8 +2574,7 @@ - If an exception is thrown by an operation other than a call to - hasher the function has no effect. + If an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -2695,8 +2601,7 @@ - When inserting a single element, if an exception is thrown by an operation other than a call to - hasher the function has no effect. + When inserting a single element, if an exception is thrown by an operation other than a call to hasher the function has no effect. @@ -2718,34 +2623,31 @@ const_iterator - Erase the element pointed to by - position. + Erase the element pointed to by position. - The iterator following - position before the erasure. + The iterator following position before the erasure. - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. They don't get called by the current implementation Boost.Unordered but other implementations may call them. + + - key_type const& + key_type const& size_type - Erase all elements with key equivalent to - k. + Erase all elements with key equivalent to k. @@ -2753,9 +2655,7 @@ - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. @@ -2779,20 +2679,15 @@ const_iterator - Erases the elements in the range from - first to - last. + Erases the elements in the range from first to last. - The iterator following the erased elements - i.e. - last. + The iterator following the erased elements - i.e. last. - Only throws an exception, if it is thrown by a call to - hasher or - key_equal. + Only throws an exception, if it is thrown by a call to hasher or key_equal. They don't get called by the current implementation Boost.Unordered but other implementations may call them. @@ -2805,8 +2700,7 @@ - - size() == 0 + size() == 0 @@ -2816,13 +2710,11 @@ - unordered_multimap& + unordered_multimap& void - Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of - key_equal or - hasher. + Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of key_equal or hasher. @@ -2843,51 +2735,46 @@ - key_type const& + key_type const& iterator - key_type const& + key_type const& iterator - An iterator pointing to an element with key equivalent to - k, or - b.end() if no such element exists. + An iterator pointing to an element with key equivalent to k, or b.end() if no such element exists. - key_type const& + key_type const& size_type - The number of elements with key equivalent to - k. + The number of elements with key equivalent to k. - key_type const& + key_type const& std::pair<iterator, iterator> - key_type const& + key_type const& std::pair<iterator, iterator> - A range with 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()). + A range with 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()). @@ -2925,17 +2812,15 @@ - key_type const& + key_type const& size_type - The index of the bucket which would contain an element with key - k. + The index of the bucket which would contain an element with key k. - The return value is less than - bucket_count() + The return value is less than bucket_count() @@ -2953,14 +2838,12 @@ const_local_iterator - - n shall be in the range + n shall be in the range [0, bucket_count()). - A local iterator pointing the first element in the bucket with index - n. + A local iterator pointing the first element in the bucket with index n. @@ -2978,14 +2861,12 @@ const_local_iterator - - n shall be in the range + n shall be in the range [0, bucket_count()). - A local iterator pointing the 'one past the end' element in the bucket with index - n. + A local iterator pointing the 'one past the end' element in the bucket with index n. @@ -3011,8 +2892,7 @@ float - Changes the container's maximum load factor, using - z as a hint. + Changes the container's maximum load factor, using z as a hint. @@ -3022,8 +2902,7 @@ void - 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. + 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 @@ -3049,10 +2928,10 @@ - unordered_multimap<Key, T, Hash, Pred, Alloc>& + unordered_multimap<Key, T, Hash, Pred, Alloc>& - unordered_multimap<Key, T, Hash, Pred, Alloc>& + unordered_multimap<Key, T, Hash, Pred, Alloc>& void @@ -3060,9 +2939,7 @@ - Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of - Hash or - Pred. + Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of Hash or Pred.