diff options
Diffstat (limited to 'boost/intrusive/unordered_set.hpp')
| -rw-r--r-- | boost/intrusive/unordered_set.hpp | 854 |
1 files changed, 427 insertions, 427 deletions
diff --git a/boost/intrusive/unordered_set.hpp b/boost/intrusive/unordered_set.hpp index 6407fcfa45..a06d74bf31 100644 --- a/boost/intrusive/unordered_set.hpp +++ b/boost/intrusive/unordered_set.hpp @@ -1,7 +1,7 @@ ///////////////////////////////////////////////////////////////////////////// // // (C) Copyright Olaf Krzikalla 2004-2006. -// (C) Copyright Ion Gaztanaga 2006-2009 +// (C) Copyright Ion Gaztanaga 2006-2012 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at @@ -23,7 +23,7 @@ namespace boost { namespace intrusive { -//! The class template unordered_set is an intrusive container, that mimics most of +//! The class template unordered_set is an intrusive container, that mimics most of //! the interface of std::tr1::unordered_set as described in the C++ TR1. //! //! unordered_set is a semi-intrusive container: each object to be stored in the @@ -113,73 +113,73 @@ class unordered_set_impl //! //! <b>Effects</b>: Constructs an empty unordered_set_impl, storing a reference //! to the bucket array and copies of the hasher and equal functors. - //! - //! <b>Complexity</b>: Constant. - //! + //! + //! <b>Complexity</b>: Constant. + //! //! <b>Throws</b>: If value_traits::node_traits::node //! constructor throws (this does not happen with predefined Boost.Intrusive hooks) - //! or the copy constructor or invocation of Hash or Equal throws. + //! or the copy constructor or invocation of Hash or Equal throws. //! //! <b>Notes</b>: buckets array must be disposed only after - //! *this is disposed. + //! *this is disposed. unordered_set_impl( const bucket_traits &b_traits , const hasher & hash_func = hasher() , const key_equal &equal_func = key_equal() - , const value_traits &v_traits = value_traits()) + , const value_traits &v_traits = value_traits()) : table_(b_traits, hash_func, equal_func, v_traits) {} //! <b>Requires</b>: buckets must not be being used by any other resource //! and Dereferencing iterator must yield an lvalue of type value_type. - //! - //! <b>Effects</b>: Constructs an empty unordered_set and inserts elements from + //! + //! <b>Effects</b>: Constructs an empty unordered_set and inserts elements from //! [b, e). - //! + //! //! <b>Complexity</b>: If N is std::distance(b, e): Average case is O(N) //! (with a good hash function and with buckets_len >= N),worst case O(N2). - //! + //! //! <b>Throws</b>: If value_traits::node_traits::node //! constructor throws (this does not happen with predefined Boost.Intrusive hooks) - //! or the copy constructor or invocation of hasher or key_equal throws. + //! or the copy constructor or invocation of hasher or key_equal throws. //! //! <b>Notes</b>: buckets array must be disposed only after - //! *this is disposed. + //! *this is disposed. template<class Iterator> unordered_set_impl( Iterator b , Iterator e , const bucket_traits &b_traits , const hasher & hash_func = hasher() , const key_equal &equal_func = key_equal() - , const value_traits &v_traits = value_traits()) + , const value_traits &v_traits = value_traits()) : table_(b_traits, hash_func, equal_func, v_traits) { table_.insert_unique(b, e); } //! <b>Effects</b>: to-do - //! - unordered_set_impl(BOOST_RV_REF(unordered_set_impl) x) + //! + unordered_set_impl(BOOST_RV_REF(unordered_set_impl) x) : table_(::boost::move(x.table_)) {} //! <b>Effects</b>: to-do - //! - unordered_set_impl& operator=(BOOST_RV_REF(unordered_set_impl) x) + //! + unordered_set_impl& operator=(BOOST_RV_REF(unordered_set_impl) x) { table_ = ::boost::move(x.table_); return *this; } - //! <b>Effects</b>: Detaches all elements from this. The objects in the unordered_set + //! <b>Effects</b>: Detaches all elements from this. The objects in the unordered_set //! are not deleted (i.e. no destructors are called). - //! - //! <b>Complexity</b>: Linear to the number of elements in the unordered_set, if + //! + //! <b>Complexity</b>: Linear to the number of elements in the unordered_set, if //! it's a safe-mode or auto-unlink value. Otherwise constant. - //! + //! //! <b>Throws</b>: Nothing. - ~unordered_set_impl() + ~unordered_set_impl() {} //! <b>Effects</b>: Returns an iterator pointing to the beginning of the unordered_set. - //! + //! //! <b>Complexity</b>: Constant time if `cache_begin<>` is true. Amortized //! constant time with worst case (empty unordered_set) O(this->bucket_count()) - //! + //! //! <b>Throws</b>: Nothing. iterator begin() { return table_.begin(); } @@ -189,7 +189,7 @@ class unordered_set_impl //! //! <b>Complexity</b>: Constant time if `cache_begin<>` is true. Amortized //! constant time with worst case (empty unordered_set) O(this->bucket_count()) - //! + //! //! <b>Throws</b>: Nothing. const_iterator begin() const { return table_.begin(); } @@ -199,76 +199,76 @@ class unordered_set_impl //! //! <b>Complexity</b>: Constant time if `cache_begin<>` is true. Amortized //! constant time with worst case (empty unordered_set) O(this->bucket_count()) - //! + //! //! <b>Throws</b>: Nothing. const_iterator cbegin() const { return table_.cbegin(); } //! <b>Effects</b>: Returns an iterator pointing to the end of the unordered_set. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. iterator end() { return table_.end(); } //! <b>Effects</b>: Returns a const_iterator pointing to the end of the unordered_set. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. const_iterator end() const { return table_.end(); } //! <b>Effects</b>: Returns a const_iterator pointing to the end of the unordered_set. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. const_iterator cend() const { return table_.cend(); } //! <b>Effects</b>: Returns the hasher object used by the unordered_set. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If hasher copy-constructor throws. hasher hash_function() const { return table_.hash_function(); } //! <b>Effects</b>: Returns the key_equal object used by the unordered_set. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If key_equal copy-constructor throws. key_equal key_eq() const { return table_.key_eq(); } //! <b>Effects</b>: Returns true if the container is empty. - //! + //! //! <b>Complexity</b>: if constant-time size and cache_last options are disabled, //! average constant time (worst case, with empty() == true: O(this->bucket_count()). //! Otherwise constant. - //! + //! //! <b>Throws</b>: Nothing. bool empty() const { return table_.empty(); } //! <b>Effects</b>: Returns the number of elements stored in the unordered_set. - //! + //! //! <b>Complexity</b>: Linear to elements contained in *this if //! constant-time size option is disabled. Constant-time otherwise. - //! + //! //! <b>Throws</b>: Nothing. size_type size() const { return table_.size(); } //! <b>Requires</b>: the hasher and the equality function unqualified swap //! call should not throw. - //! + //! //! <b>Effects</b>: Swaps the contents of two unordered_sets. //! Swaps also the contained bucket array and equality and hasher functors. - //! + //! //! <b>Complexity</b>: Constant. //! //! <b>Throws</b>: If the swap() call for the comparison or hash functors @@ -281,7 +281,7 @@ class unordered_set_impl //! hash than the original node. //! //! <b>Effects</b>: Erases all the elements from *this - //! calling Disposer::operator()(pointer), clones all the + //! calling Disposer::operator()(pointer), clones all the //! elements from src calling Cloner::operator()(const_reference ) //! and inserts them on *this. The hash function and the equality //! predicate are copied from the source. @@ -290,9 +290,9 @@ class unordered_set_impl //! //! If any operation throws, all cloned elements are unlinked and disposed //! calling Disposer::operator()(pointer). - //! + //! //! <b>Complexity</b>: Linear to erased plus inserted elements. - //! + //! //! <b>Throws</b>: If cloner or hasher throw or hash or equality predicate copying //! throws. Basic guarantee. template <class Cloner, class Disposer> @@ -300,7 +300,7 @@ class unordered_set_impl { table_.clone_from(src.table_, cloner, disposer); } //! <b>Requires</b>: value must be an lvalue - //! + //! //! <b>Effects</b>: Tries to inserts value into the unordered_set. //! //! <b>Returns</b>: If the value @@ -308,40 +308,40 @@ class unordered_set_impl //! iterator to the new value and true. If there is an equivalent value //! returns a pair containing an iterator to the already present value //! and false. - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. Strong guarantee. - //! + //! //! <b>Note</b>: Does not affect the validity of iterators and references. //! No copy-constructors are called. std::pair<iterator, bool> insert(reference value) { return table_.insert_unique(value); } - //! <b>Requires</b>: Dereferencing iterator must yield an lvalue + //! <b>Requires</b>: Dereferencing iterator must yield an lvalue //! of type value_type. - //! + //! //! <b>Effects</b>: Equivalent to this->insert(t) for each element in [b, e). - //! + //! //! <b>Complexity</b>: Average case O(N), where N is std::distance(b, e). //! Worst case O(N*this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. Basic guarantee. - //! + //! //! <b>Note</b>: Does not affect the validity of iterators and references. //! No copy-constructors are called. template<class Iterator> void insert(Iterator b, Iterator e) { table_.insert_unique(b, e); } - //! <b>Requires</b>: "hasher" must be a hash function that induces + //! <b>Requires</b>: "hasher" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hasher" hashes the given key instead of the value_type. //! - //! "key_value_equal" must be a equality function that induces + //! "key_value_equal" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "key_value_equal" compares an arbitrary key with the contained values. - //! + //! //! <b>Effects</b>: Checks if a value can be inserted in the unordered_set, using //! a user provided key instead of the value itself. //! @@ -350,11 +350,11 @@ class unordered_set_impl //! and false. If the value can be inserted returns true in the returned //! pair boolean and fills "commit_data" that is meant to be used with //! the "insert_commit" function. - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). //! //! <b>Throws</b>: If hasher or key_value_equal throw. Strong guarantee. - //! + //! //! <b>Notes</b>: This function is used to improve performance when constructing //! a value_type is expensive: if there is an equivalent value //! the constructed object must be discarded. Many times, the part of the @@ -378,16 +378,16 @@ class unordered_set_impl //! must have been obtained from a previous call to "insert_check". //! No objects should have been inserted or erased from the unordered_set between //! the "insert_check" that filled "commit_data" and the call to "insert_commit". - //! + //! //! <b>Effects</b>: Inserts the value in the unordered_set using the information obtained //! from the "commit_data" that a previous "insert_check" filled. //! //! <b>Returns</b>: An iterator to the newly inserted object. - //! + //! //! <b>Complexity</b>: Constant time. //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Notes</b>: This function has only sense if a "insert_check" has been //! previously executed to fill "commit_data". No value should be inserted or //! erased between the "insert_check" and "insert_commit" calls. @@ -396,61 +396,61 @@ class unordered_set_impl iterator insert_commit(reference value, const insert_commit_data &commit_data) { return table_.insert_unique_commit(value, commit_data); } - //! <b>Effects</b>: Erases the element pointed to by i. - //! + //! <b>Effects</b>: Erases the element pointed to by i. + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased element. No destructors are called. void erase(const_iterator i) { table_.erase(i); } - //! <b>Effects</b>: Erases the range pointed to by b end e. - //! + //! <b>Effects</b>: Erases the range pointed to by b end e. + //! //! <b>Complexity</b>: Average case O(std::distance(b, e)), //! worst case O(this->size()). - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. void erase(const_iterator b, const_iterator e) { table_.erase(b, e); } //! <b>Effects</b>: Erases all the elements with the given value. - //! + //! //! <b>Returns</b>: The number of erased elements. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. Basic guarantee. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. size_type erase(const_reference value) { return table_.erase(value); } - //! <b>Requires</b>: "hasher" must be a hash function that induces + //! <b>Requires</b>: "hasher" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hasher" hashes the given key instead of the value_type. //! - //! "key_value_equal" must be a equality function that induces + //! "key_value_equal" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "key_value_equal" compares an arbitrary key with the contained values. //! //! <b>Effects</b>: Erases all the elements that have the same hash and //! compare equal with the given key. - //! + //! //! <b>Returns</b>: The number of erased elements. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If hash_func or equal_func throw. Basic guarantee. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. template<class KeyType, class KeyHasher, class KeyValueEqual> @@ -459,14 +459,14 @@ class unordered_set_impl //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw. //! - //! <b>Effects</b>: Erases the element pointed to by i. + //! <b>Effects</b>: Erases the element pointed to by i. //! Disposer::operator()(pointer) is called for the removed element. - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: Nothing. - //! - //! <b>Note</b>: Invalidates the iterators + //! + //! <b>Note</b>: Invalidates the iterators //! to the erased elements. template<class Disposer> void erase_and_dispose(const_iterator i, Disposer disposer @@ -480,12 +480,12 @@ class unordered_set_impl //! //! <b>Effects</b>: Erases the range pointed to by b end e. //! Disposer::operator()(pointer) is called for the removed elements. - //! + //! //! <b>Complexity</b>: Average case O(std::distance(b, e)), //! worst case O(this->size()). - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: Invalidates the iterators //! to the erased elements. template<class Disposer> @@ -496,14 +496,14 @@ class unordered_set_impl //! //! <b>Effects</b>: Erases all the elements with the given value. //! Disposer::operator()(pointer) is called for the removed elements. - //! + //! //! <b>Returns</b>: The number of erased elements. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. Basic guarantee. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. template<class Disposer> @@ -517,39 +517,39 @@ class unordered_set_impl //! Disposer::operator()(pointer) is called for the removed elements. //! //! <b>Returns</b>: The number of erased elements. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If hash_func or equal_func throw. Basic guarantee. - //! + //! //! <b>Note</b>: Invalidates the iterators //! to the erased elements. template<class KeyType, class KeyHasher, class KeyValueEqual, class Disposer> size_type erase_and_dispose(const KeyType& key, KeyHasher hash_func, KeyValueEqual equal_func, Disposer disposer) { return table_.erase_and_dispose(key, hash_func, equal_func, disposer); } - //! <b>Effects</b>: Erases all of the elements. - //! + //! <b>Effects</b>: Erases all of the elements. + //! //! <b>Complexity</b>: Linear to the number of elements on the container. //! if it's a safe-mode or auto-unlink value_type. Constant time otherwise. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. void clear() { return table_.clear(); } //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw. - //! - //! <b>Effects</b>: Erases all of the elements. - //! + //! + //! <b>Effects</b>: Erases all of the elements. + //! //! <b>Complexity</b>: Linear to the number of elements on the container. //! Disposer::operator()(pointer) is called for the removed elements. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. template<class Disposer> @@ -557,25 +557,25 @@ class unordered_set_impl { return table_.clear_and_dispose(disposer); } //! <b>Effects</b>: Returns the number of contained elements with the given value - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. size_type count(const_reference value) const { return table_.find(value) != end(); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "equal_func" must be a equality function that induces + //! "equal_func" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "equal_func" compares an arbitrary key with the contained values. //! //! <b>Effects</b>: Returns the number of contained elements with the given key //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If hash_func or equal_func throw. template<class KeyType, class KeyHasher, class KeyValueEqual> size_type count(const KeyType& key, KeyHasher hash_func, KeyValueEqual equal_func) const @@ -585,25 +585,25 @@ class unordered_set_impl //! "value" or end() if that element does not exist. //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. iterator find(const_reference value) { return table_.find(value); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "equal_func" must be a equality function that induces + //! "equal_func" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "equal_func" compares an arbitrary key with the contained values. //! - //! <b>Effects</b>: Finds an iterator to the first element whose key is + //! <b>Effects</b>: Finds an iterator to the first element whose key is //! "key" according to the given hasher and equality functor or end() if //! that element does not exist. //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If hash_func or equal_func throw. //! //! <b>Note</b>: This function is used when constructing a value_type @@ -613,29 +613,29 @@ class unordered_set_impl iterator find(const KeyType& key, KeyHasher hash_func, KeyValueEqual equal_func) { return table_.find(key, hash_func, equal_func); } - //! <b>Effects</b>: Finds a const_iterator to the first element whose key is + //! <b>Effects</b>: Finds a const_iterator to the first element whose key is //! "key" or end() if that element does not exist. - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. const_iterator find(const_reference value) const { return table_.find(value); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "equal_func" must be a equality function that induces + //! "equal_func" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "equal_func" compares an arbitrary key with the contained values. //! - //! <b>Effects</b>: Finds an iterator to the first element whose key is + //! <b>Effects</b>: Finds an iterator to the first element whose key is //! "key" according to the given hasher and equality functor or end() if //! that element does not exist. - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If hash_func or equal_func throw. //! //! <b>Note</b>: This function is used when constructing a value_type @@ -646,30 +646,30 @@ class unordered_set_impl { return table_.find(key, hash_func, equal_func); } //! <b>Effects</b>: Returns a range containing all elements with values equivalent - //! to value. Returns std::make_pair(this->end(), this->end()) if no such + //! to value. Returns std::make_pair(this->end(), this->end()) if no such //! elements exist. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. std::pair<iterator,iterator> equal_range(const_reference value) { return table_.equal_range(value); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "equal_func" must be a equality function that induces + //! "equal_func" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "equal_func" compares an arbitrary key with the contained values. //! //! <b>Effects</b>: Returns a range containing all elements with equivalent - //! keys. Returns std::make_pair(this->end(), this->end()) if no such + //! keys. Returns std::make_pair(this->end(), this->end()) if no such //! elements exist. - //! + //! //! <b>Complexity</b>: Average case O(this->count(key, hash_func, hash_func)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If hash_func or the equal_func throw. //! //! <b>Note</b>: This function is used when constructing a value_type @@ -680,31 +680,31 @@ class unordered_set_impl { return table_.equal_range(key, hash_func, equal_func); } //! <b>Effects</b>: Returns a range containing all elements with values equivalent - //! to value. Returns std::make_pair(this->end(), this->end()) if no such + //! to value. Returns std::make_pair(this->end(), this->end()) if no such //! elements exist. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. std::pair<const_iterator, const_iterator> equal_range(const_reference value) const { return table_.equal_range(value); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "equal_func" must be a equality function that induces + //! "equal_func" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "equal_func" compares an arbitrary key with the contained values. //! //! <b>Effects</b>: Returns a range containing all elements with equivalent - //! keys. Returns std::make_pair(this->end(), this->end()) if no such + //! keys. Returns std::make_pair(this->end(), this->end()) if no such //! elements exist. - //! + //! //! <b>Complexity</b>: Average case O(this->count(key, hash_func, equal_func)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the hash_func or equal_func throw. //! //! <b>Note</b>: This function is used when constructing a value_type @@ -717,38 +717,38 @@ class unordered_set_impl //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_set of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid iterator belonging to the unordered_set //! that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If the internal hash function throws. iterator iterator_to(reference value) { return table_.iterator_to(value); } //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_set of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid const_iterator belonging to the //! unordered_set that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If the internal hash function throws. const_iterator iterator_to(const_reference value) const { return table_.iterator_to(value); } //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_set of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid local_iterator belonging to the unordered_set //! that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: This static function is available only if the <i>value traits</i> //! is stateless. static local_iterator s_local_iterator_to(reference value) @@ -756,14 +756,14 @@ class unordered_set_impl //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_set of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid const_local_iterator belonging to //! the unordered_set that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: This static function is available only if the <i>value traits</i> //! is stateless. static const_local_iterator s_local_iterator_to(const_reference value) @@ -771,33 +771,33 @@ class unordered_set_impl //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_set of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid local_iterator belonging to the unordered_set //! that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. local_iterator local_iterator_to(reference value) { return table_.local_iterator_to(value); } //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_set of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid const_local_iterator belonging to //! the unordered_set that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. const_local_iterator local_iterator_to(const_reference value) const { return table_.local_iterator_to(value); } //! <b>Effects</b>: Returns the number of buckets passed in the constructor //! or the last rehash function. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. size_type bucket_count() const { return table_.bucket_count(); } @@ -805,33 +805,33 @@ class unordered_set_impl //! <b>Requires</b>: n is in the range [0, this->bucket_count()). //! //! <b>Effects</b>: Returns the number of elements in the nth bucket. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. size_type bucket_size(size_type n) const { return table_.bucket_size(n); } //! <b>Effects</b>: Returns the index of the bucket in which elements //! with keys equivalent to k would be found, if any such element existed. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If the hash functor throws. //! //! <b>Note</b>: the return value is in the range [0, this->bucket_count()). size_type bucket(const value_type& k) const { return table_.bucket(k); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! //! <b>Effects</b>: Returns the index of the bucket in which elements //! with keys equivalent to k would be found, if any such element existed. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If hash_func throws. //! //! <b>Note</b>: the return value is in the range [0, this->bucket_count()). @@ -841,9 +841,9 @@ class unordered_set_impl //! <b>Effects</b>: Returns the bucket array pointer passed in the constructor //! or the last rehash function. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. bucket_ptr bucket_pointer() const { return table_.bucket_pointer(); } @@ -852,13 +852,13 @@ class unordered_set_impl //! //! <b>Effects</b>: Returns a local_iterator pointing to the beginning //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. local_iterator begin(size_type n) { return table_.begin(n); } @@ -866,13 +866,13 @@ class unordered_set_impl //! //! <b>Effects</b>: Returns a const_local_iterator pointing to the beginning //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. const_local_iterator begin(size_type n) const { return table_.begin(n); } @@ -880,13 +880,13 @@ class unordered_set_impl //! //! <b>Effects</b>: Returns a const_local_iterator pointing to the beginning //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. const_local_iterator cbegin(size_type n) const { return table_.cbegin(n); } @@ -894,13 +894,13 @@ class unordered_set_impl //! //! <b>Effects</b>: Returns a local_iterator pointing to the end //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. local_iterator end(size_type n) { return table_.end(n); } @@ -908,13 +908,13 @@ class unordered_set_impl //! //! <b>Effects</b>: Returns a const_local_iterator pointing to the end //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. const_local_iterator end(size_type n) const { return table_.end(n); } @@ -922,13 +922,13 @@ class unordered_set_impl //! //! <b>Effects</b>: Returns a const_local_iterator pointing to the end //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. const_local_iterator cend(size_type n) const { return table_.cend(n); } @@ -938,22 +938,22 @@ class unordered_set_impl //! n can be bigger or smaller than this->bucket_count(). //! //! <b>Effects</b>: Updates the internal reference with the new bucket erases - //! the values from the old bucket and inserts then in the new one. + //! the values from the old bucket and inserts then in the new one. //! //! If store_hash option is true, this method does not use the hash function. - //! + //! //! <b>Complexity</b>: Average case linear in this->size(), worst case quadratic. - //! + //! //! <b>Throws</b>: If the hasher functor throws. Basic guarantee. void rehash(const bucket_traits &new_bucket_traits) { table_.rehash(new_bucket_traits); } //! <b>Requires</b>: //! - //! <b>Effects</b>: - //! - //! <b>Complexity</b>: - //! + //! <b>Effects</b>: + //! + //! <b>Complexity</b>: + //! //! <b>Throws</b>: //! //! <b>Note</b>: this method is only available if incremental<true> option is activated. @@ -966,22 +966,22 @@ class unordered_set_impl //! <b>Requires</b>: //! - //! <b>Effects</b>: - //! - //! <b>Complexity</b>: - //! - //! <b>Throws</b>: + //! <b>Effects</b>: + //! + //! <b>Complexity</b>: + //! + //! <b>Throws</b>: size_type split_count() const { return table_.split_count(); } //! <b>Effects</b>: Returns the nearest new bucket count optimized for //! the container that is bigger than n. This suggestion can be used //! to create bucket arrays with a size that will usually improve - //! container's performance. If such value does not exist, the + //! container's performance. If such value does not exist, the //! higher possible value is returned. - //! + //! //! <b>Complexity</b>: Amortized constant time. - //! + //! //! <b>Throws</b>: Nothing. static size_type suggested_upper_bucket_count(size_type n) { return table_type::suggested_upper_bucket_count(n); } @@ -989,11 +989,11 @@ class unordered_set_impl //! <b>Effects</b>: Returns the nearest new bucket count optimized for //! the container that is smaller than n. This suggestion can be used //! to create bucket arrays with a size that will usually improve - //! container's performance. If such value does not exist, the + //! container's performance. If such value does not exist, the //! lower possible value is returned. - //! + //! //! <b>Complexity</b>: Amortized constant time. - //! + //! //! <b>Throws</b>: Nothing. static size_type suggested_lower_bucket_count(size_type n) { return table_type::suggested_lower_bucket_count(n); } @@ -1016,7 +1016,7 @@ struct make_unordered_set /// @cond typedef unordered_set_impl < typename make_hashtable_opt - <T, true, + <T, true, #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 #else @@ -1036,7 +1036,7 @@ template<class T, class O1, class O2, class O3, class O4, class O5, class O6, cl template<class T, class ...Options> #endif class unordered_set - : public make_unordered_set<T, + : public make_unordered_set<T, #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 #else @@ -1045,7 +1045,7 @@ class unordered_set >::type { typedef typename make_unordered_set - <T, + <T, #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 #else @@ -1070,7 +1070,7 @@ class unordered_set unordered_set ( const bucket_traits &b_traits , const hasher & hash_func = hasher() , const key_equal &equal_func = key_equal() - , const value_traits &v_traits = value_traits()) + , const value_traits &v_traits = value_traits()) : Base(b_traits, hash_func, equal_func, v_traits) {} @@ -1080,7 +1080,7 @@ class unordered_set , const bucket_traits &b_traits , const hasher & hash_func = hasher() , const key_equal &equal_func = key_equal() - , const value_traits &v_traits = value_traits()) + , const value_traits &v_traits = value_traits()) : Base(b, e, b_traits, hash_func, equal_func, v_traits) {} @@ -1095,7 +1095,7 @@ class unordered_set #endif -//! The class template unordered_multiset is an intrusive container, that mimics most of +//! The class template unordered_multiset is an intrusive container, that mimics most of //! the interface of std::tr1::unordered_multiset as described in the C++ TR1. //! //! unordered_multiset is a semi-intrusive container: each object to be stored in the @@ -1184,34 +1184,34 @@ class unordered_multiset_impl //! //! <b>Effects</b>: Constructs an empty unordered_multiset, storing a reference //! to the bucket array and copies of the hasher and equal functors. - //! - //! <b>Complexity</b>: Constant. - //! + //! + //! <b>Complexity</b>: Constant. + //! //! <b>Throws</b>: If value_traits::node_traits::node //! constructor throws (this does not happen with predefined Boost.Intrusive hooks) - //! or the copy constructor or invocation of Hash or Equal throws. + //! or the copy constructor or invocation of Hash or Equal throws. //! //! <b>Notes</b>: buckets array must be disposed only after - //! *this is disposed. + //! *this is disposed. unordered_multiset_impl ( const bucket_traits &b_traits , const hasher & hash_func = hasher() , const key_equal &equal_func = key_equal() - , const value_traits &v_traits = value_traits()) + , const value_traits &v_traits = value_traits()) : table_(b_traits, hash_func, equal_func, v_traits) {} //! <b>Requires</b>: buckets must not be being used by any other resource //! and Dereferencing iterator must yield an lvalue of type value_type. - //! - //! <b>Effects</b>: Constructs an empty unordered_multiset and inserts elements from + //! + //! <b>Effects</b>: Constructs an empty unordered_multiset and inserts elements from //! [b, e). - //! + //! //! <b>Complexity</b>: If N is std::distance(b, e): Average case is O(N) //! (with a good hash function and with buckets_len >= N),worst case O(N2). - //! + //! //! <b>Throws</b>: If value_traits::node_traits::node //! constructor throws (this does not happen with predefined Boost.Intrusive hooks) - //! or the copy constructor or invocation of hasher or key_equal throws. + //! or the copy constructor or invocation of hasher or key_equal throws. //! //! <b>Notes</b>: buckets array must be disposed only after //! *this is disposed. @@ -1221,36 +1221,36 @@ class unordered_multiset_impl , const bucket_traits &b_traits , const hasher & hash_func = hasher() , const key_equal &equal_func = key_equal() - , const value_traits &v_traits = value_traits()) + , const value_traits &v_traits = value_traits()) : table_(b_traits, hash_func, equal_func, v_traits) { table_.insert_equal(b, e); } //! <b>Effects</b>: to-do - //! - unordered_multiset_impl(BOOST_RV_REF(unordered_multiset_impl) x) + //! + unordered_multiset_impl(BOOST_RV_REF(unordered_multiset_impl) x) : table_(::boost::move(x.table_)) {} //! <b>Effects</b>: to-do - //! - unordered_multiset_impl& operator=(BOOST_RV_REF(unordered_multiset_impl) x) + //! + unordered_multiset_impl& operator=(BOOST_RV_REF(unordered_multiset_impl) x) { table_ = ::boost::move(x.table_); return *this; } - //! <b>Effects</b>: Detaches all elements from this. The objects in the unordered_multiset + //! <b>Effects</b>: Detaches all elements from this. The objects in the unordered_multiset //! are not deleted (i.e. no destructors are called). - //! - //! <b>Complexity</b>: Linear to the number of elements in the unordered_multiset, if + //! + //! <b>Complexity</b>: Linear to the number of elements in the unordered_multiset, if //! it's a safe-mode or auto-unlink value. Otherwise constant. - //! + //! //! <b>Throws</b>: Nothing. - ~unordered_multiset_impl() + ~unordered_multiset_impl() {} //! <b>Effects</b>: Returns an iterator pointing to the beginning of the unordered_multiset. - //! + //! //! <b>Complexity</b>: Constant time if `cache_begin<>` is true. Amortized //! constant time with worst case (empty unordered_set) O(this->bucket_count()) - //! + //! //! <b>Throws</b>: Nothing. iterator begin() { return table_.begin(); } @@ -1260,7 +1260,7 @@ class unordered_multiset_impl //! //! <b>Complexity</b>: Constant time if `cache_begin<>` is true. Amortized //! constant time with worst case (empty unordered_set) O(this->bucket_count()) - //! + //! //! <b>Throws</b>: Nothing. const_iterator begin() const { return table_.begin(); } @@ -1270,77 +1270,77 @@ class unordered_multiset_impl //! //! <b>Complexity</b>: Constant time if `cache_begin<>` is true. Amortized //! constant time with worst case (empty unordered_set) O(this->bucket_count()) - //! + //! //! <b>Throws</b>: Nothing. const_iterator cbegin() const { return table_.cbegin(); } //! <b>Effects</b>: Returns an iterator pointing to the end of the unordered_multiset. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. iterator end() { return table_.end(); } //! <b>Effects</b>: Returns a const_iterator pointing to the end of the unordered_multiset. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. const_iterator end() const { return table_.end(); } //! <b>Effects</b>: Returns a const_iterator pointing to the end of the unordered_multiset. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. const_iterator cend() const { return table_.cend(); } //! <b>Effects</b>: Returns the hasher object used by the unordered_set. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If hasher copy-constructor throws. hasher hash_function() const { return table_.hash_function(); } //! <b>Effects</b>: Returns the key_equal object used by the unordered_multiset. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If key_equal copy-constructor throws. key_equal key_eq() const { return table_.key_eq(); } //! <b>Effects</b>: Returns true if the container is empty. - //! + //! //! <b>Complexity</b>: if constant-time size and cache_last options are disabled, //! average constant time (worst case, with empty() == true: O(this->bucket_count()). //! Otherwise constant. - //! + //! //! <b>Throws</b>: Nothing. bool empty() const { return table_.empty(); } //! <b>Effects</b>: Returns the number of elements stored in the unordered_multiset. - //! + //! //! <b>Complexity</b>: Linear to elements contained in *this if //! constant-time size option is disabled. Constant-time otherwise. - //! + //! //! <b>Throws</b>: Nothing. size_type size() const { return table_.size(); } //! <b>Requires</b>: the hasher and the equality function unqualified swap //! call should not throw. - //! + //! //! <b>Effects</b>: Swaps the contents of two unordered_multisets. //! Swaps also the contained bucket array and equality and hasher functors. //! - //! + //! //! <b>Complexity</b>: Constant. //! //! <b>Throws</b>: If the swap() call for the comparison or hash functors @@ -1353,7 +1353,7 @@ class unordered_multiset_impl //! hash than the original node. //! //! <b>Effects</b>: Erases all the elements from *this - //! calling Disposer::operator()(pointer), clones all the + //! calling Disposer::operator()(pointer), clones all the //! elements from src calling Cloner::operator()(const_reference ) //! and inserts them on *this. The hash function and the equality //! predicate are copied from the source. @@ -1362,9 +1362,9 @@ class unordered_multiset_impl //! //! If any operation throws, all cloned elements are unlinked and disposed //! calling Disposer::operator()(pointer). - //! + //! //! <b>Complexity</b>: Linear to erased plus inserted elements. - //! + //! //! <b>Throws</b>: If cloner or hasher throw or hash or equality predicate copying //! throws. Basic guarantee. template <class Cloner, class Disposer> @@ -1372,92 +1372,92 @@ class unordered_multiset_impl { table_.clone_from(src.table_, cloner, disposer); } //! <b>Requires</b>: value must be an lvalue - //! + //! //! <b>Effects</b>: Inserts value into the unordered_multiset. //! //! <b>Returns</b>: An iterator to the new inserted value. - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. Strong guarantee. - //! + //! //! <b>Note</b>: Does not affect the validity of iterators and references. //! No copy-constructors are called. iterator insert(reference value) { return table_.insert_equal(value); } - //! <b>Requires</b>: Dereferencing iterator must yield an lvalue + //! <b>Requires</b>: Dereferencing iterator must yield an lvalue //! of type value_type. - //! + //! //! <b>Effects</b>: Equivalent to this->insert(t) for each element in [b, e). - //! + //! //! <b>Complexity</b>: Average case is O(N), where N is the //! size of the range. - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. Basic guarantee. - //! + //! //! <b>Note</b>: Does not affect the validity of iterators and references. //! No copy-constructors are called. template<class Iterator> void insert(Iterator b, Iterator e) { table_.insert_equal(b, e); } - //! <b>Effects</b>: Erases the element pointed to by i. - //! + //! <b>Effects</b>: Erases the element pointed to by i. + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased element. No destructors are called. void erase(const_iterator i) { table_.erase(i); } - //! <b>Effects</b>: Erases the range pointed to by b end e. - //! + //! <b>Effects</b>: Erases the range pointed to by b end e. + //! //! <b>Complexity</b>: Average case O(std::distance(b, e)), //! worst case O(this->size()). - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. void erase(const_iterator b, const_iterator e) { table_.erase(b, e); } //! <b>Effects</b>: Erases all the elements with the given value. - //! + //! //! <b>Returns</b>: The number of erased elements. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. Basic guarantee. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. size_type erase(const_reference value) { return table_.erase(value); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "key_value_equal" must be a equality function that induces + //! "key_value_equal" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "key_value_equal" compares an arbitrary key with the contained values. //! //! <b>Effects</b>: Erases all the elements that have the same hash and //! compare equal with the given key. - //! + //! //! <b>Returns</b>: The number of erased elements. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the hash_func or the equal_func functors throws. //! Basic guarantee. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. template<class KeyType, class KeyHasher, class KeyValueEqual> @@ -1466,14 +1466,14 @@ class unordered_multiset_impl //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw. //! - //! <b>Effects</b>: Erases the element pointed to by i. + //! <b>Effects</b>: Erases the element pointed to by i. //! Disposer::operator()(pointer) is called for the removed element. - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: Nothing. - //! - //! <b>Note</b>: Invalidates the iterators + //! + //! <b>Note</b>: Invalidates the iterators //! to the erased elements. template<class Disposer> void erase_and_dispose(const_iterator i, Disposer disposer @@ -1493,12 +1493,12 @@ class unordered_multiset_impl //! //! <b>Effects</b>: Erases the range pointed to by b end e. //! Disposer::operator()(pointer) is called for the removed elements. - //! + //! //! <b>Complexity</b>: Average case O(std::distance(b, e)), //! worst case O(this->size()). - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: Invalidates the iterators //! to the erased elements. template<class Disposer> @@ -1509,14 +1509,14 @@ class unordered_multiset_impl //! //! <b>Effects</b>: Erases all the elements with the given value. //! Disposer::operator()(pointer) is called for the removed elements. - //! + //! //! <b>Returns</b>: The number of erased elements. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. Basic guarantee. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. template<class Disposer> @@ -1530,12 +1530,12 @@ class unordered_multiset_impl //! Disposer::operator()(pointer) is called for the removed elements. //! //! <b>Returns</b>: The number of erased elements. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If hash_func or equal_func throw. Basic guarantee. - //! + //! //! <b>Note</b>: Invalidates the iterators //! to the erased elements. template<class KeyType, class KeyHasher, class KeyValueEqual, class Disposer> @@ -1543,26 +1543,26 @@ class unordered_multiset_impl { return table_.erase_and_dispose(key, hash_func, equal_func, disposer); } //! <b>Effects</b>: Erases all the elements of the container. - //! + //! //! <b>Complexity</b>: Linear to the number of elements on the container. //! if it's a safe-mode or auto-unlink value_type. Constant time otherwise. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. void clear() { return table_.clear(); } //! <b>Requires</b>: Disposer::operator()(pointer) shouldn't throw. - //! + //! //! <b>Effects</b>: Erases all the elements of the container. - //! + //! //! <b>Complexity</b>: Linear to the number of elements on the container. //! Disposer::operator()(pointer) is called for the removed elements. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: Invalidates the iterators (but not the references) //! to the erased elements. No destructors are called. template<class Disposer> @@ -1570,53 +1570,53 @@ class unordered_multiset_impl { return table_.clear_and_dispose(disposer); } //! <b>Effects</b>: Returns the number of contained elements with the given key - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. size_type count(const_reference value) const { return table_.count(value); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "key_value_equal" must be a equality function that induces + //! "key_value_equal" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "key_value_equal" compares an arbitrary key with the contained values. //! //! <b>Effects</b>: Returns the number of contained elements with the given key //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. template<class KeyType, class KeyHasher, class KeyValueEqual> size_type count(const KeyType& key, KeyHasher hash_func, KeyValueEqual equal_func) const { return table_.count(key, hash_func, equal_func); } - //! <b>Effects</b>: Finds an iterator to the first element whose value is + //! <b>Effects</b>: Finds an iterator to the first element whose value is //! "value" or end() if that element does not exist. //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. iterator find(const_reference value) { return table_.find(value); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "key_value_equal" must be a equality function that induces + //! "key_value_equal" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "key_value_equal" compares an arbitrary key with the contained values. //! - //! <b>Effects</b>: Finds an iterator to the first element whose key is + //! <b>Effects</b>: Finds an iterator to the first element whose key is //! "key" according to the given hasher and equality functor or end() if //! that element does not exist. //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. //! //! <b>Note</b>: This function is used when constructing a value_type @@ -1626,29 +1626,29 @@ class unordered_multiset_impl iterator find(const KeyType& key, KeyHasher hash_func, KeyValueEqual equal_func) { return table_.find(key, hash_func, equal_func); } - //! <b>Effects</b>: Finds a const_iterator to the first element whose key is + //! <b>Effects</b>: Finds a const_iterator to the first element whose key is //! "key" or end() if that element does not exist. - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. const_iterator find(const_reference value) const { return table_.find(value); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "key_value_equal" must be a equality function that induces + //! "key_value_equal" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "key_value_equal" compares an arbitrary key with the contained values. //! - //! <b>Effects</b>: Finds an iterator to the first element whose key is + //! <b>Effects</b>: Finds an iterator to the first element whose key is //! "key" according to the given hasher and equality functor or end() if //! that element does not exist. - //! + //! //! <b>Complexity</b>: Average case O(1), worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. //! //! <b>Note</b>: This function is used when constructing a value_type @@ -1659,30 +1659,30 @@ class unordered_multiset_impl { return table_.find(key, hash_func, equal_func); } //! <b>Effects</b>: Returns a range containing all elements with values equivalent - //! to value. Returns std::make_pair(this->end(), this->end()) if no such + //! to value. Returns std::make_pair(this->end(), this->end()) if no such //! elements exist. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. std::pair<iterator,iterator> equal_range(const_reference value) { return table_.equal_range(value); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "key_value_equal" must be a equality function that induces + //! "key_value_equal" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "key_value_equal" compares an arbitrary key with the contained values. //! //! <b>Effects</b>: Returns a range containing all elements with equivalent - //! keys. Returns std::make_pair(this->end(), this->end()) if no such + //! keys. Returns std::make_pair(this->end(), this->end()) if no such //! elements exist. - //! + //! //! <b>Complexity</b>: Average case O(this->count(key, hash_func, equal_func)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. //! //! <b>Note</b>: This function is used when constructing a value_type @@ -1694,31 +1694,31 @@ class unordered_multiset_impl { return table_.equal_range(key, hash_func, equal_func); } //! <b>Effects</b>: Returns a range containing all elements with values equivalent - //! to value. Returns std::make_pair(this->end(), this->end()) if no such + //! to value. Returns std::make_pair(this->end(), this->end()) if no such //! elements exist. - //! + //! //! <b>Complexity</b>: Average case O(this->count(value)). Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. std::pair<const_iterator, const_iterator> equal_range(const_reference value) const { return table_.equal_range(value); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! - //! "key_value_equal" must be a equality function that induces + //! "key_value_equal" must be a equality function that induces //! the same equality as key_equal. The difference is that //! "key_value_equal" compares an arbitrary key with the contained values. //! //! <b>Effects</b>: Returns a range containing all elements with equivalent - //! keys. Returns std::make_pair(this->end(), this->end()) if no such + //! keys. Returns std::make_pair(this->end(), this->end()) if no such //! elements exist. - //! + //! //! <b>Complexity</b>: Average case O(this->count(key, hash_func, equal_func)). //! Worst case O(this->size()). - //! + //! //! <b>Throws</b>: If the internal hasher or the equality functor throws. //! //! <b>Note</b>: This function is used when constructing a value_type @@ -1731,38 +1731,38 @@ class unordered_multiset_impl //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_multiset of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid iterator belonging to the unordered_multiset //! that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If the hash function throws. iterator iterator_to(reference value) { return table_.iterator_to(value); } //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_multiset of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid const_iterator belonging to the //! unordered_multiset that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If the hash function throws. const_iterator iterator_to(const_reference value) const { return table_.iterator_to(value); } //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_set of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid local_iterator belonging to the unordered_set //! that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: This static function is available only if the <i>value traits</i> //! is stateless. static local_iterator s_local_iterator_to(reference value) @@ -1770,14 +1770,14 @@ class unordered_multiset_impl //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_set of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid const_local_iterator belonging to //! the unordered_set that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: This static function is available only if the <i>value traits</i> //! is stateless. static const_local_iterator s_local_iterator_to(const_reference value) @@ -1785,33 +1785,33 @@ class unordered_multiset_impl //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_set of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid local_iterator belonging to the unordered_set //! that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. local_iterator local_iterator_to(reference value) { return table_.local_iterator_to(value); } //! <b>Requires</b>: value must be an lvalue and shall be in a unordered_set of //! appropriate type. Otherwise the behavior is undefined. - //! + //! //! <b>Effects</b>: Returns: a valid const_local_iterator belonging to //! the unordered_set that points to the value - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. const_local_iterator local_iterator_to(const_reference value) const { return table_.local_iterator_to(value); } //! <b>Effects</b>: Returns the number of buckets passed in the constructor //! or the last rehash function. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. size_type bucket_count() const { return table_.bucket_count(); } @@ -1819,33 +1819,33 @@ class unordered_multiset_impl //! <b>Requires</b>: n is in the range [0, this->bucket_count()). //! //! <b>Effects</b>: Returns the number of elements in the nth bucket. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. size_type bucket_size(size_type n) const { return table_.bucket_size(n); } //! <b>Effects</b>: Returns the index of the bucket in which elements //! with keys equivalent to k would be found, if any such element existed. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If the hash functor throws. //! //! <b>Note</b>: the return value is in the range [0, this->bucket_count()). size_type bucket(const value_type& k) const { return table_.bucket(k); } - //! <b>Requires</b>: "hash_func" must be a hash function that induces + //! <b>Requires</b>: "hash_func" must be a hash function that induces //! the same hash values as the stored hasher. The difference is that //! "hash_func" hashes the given key instead of the value_type. //! //! <b>Effects</b>: Returns the index of the bucket in which elements //! with keys equivalent to k would be found, if any such element existed. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: If the hash functor throws. //! //! <b>Note</b>: the return value is in the range [0, this->bucket_count()). @@ -1855,9 +1855,9 @@ class unordered_multiset_impl //! <b>Effects</b>: Returns the bucket array pointer passed in the constructor //! or the last rehash function. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. bucket_ptr bucket_pointer() const { return table_.bucket_pointer(); } @@ -1866,13 +1866,13 @@ class unordered_multiset_impl //! //! <b>Effects</b>: Returns a local_iterator pointing to the beginning //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. local_iterator begin(size_type n) { return table_.begin(n); } @@ -1880,13 +1880,13 @@ class unordered_multiset_impl //! //! <b>Effects</b>: Returns a const_local_iterator pointing to the beginning //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. const_local_iterator begin(size_type n) const { return table_.begin(n); } @@ -1894,13 +1894,13 @@ class unordered_multiset_impl //! //! <b>Effects</b>: Returns a const_local_iterator pointing to the beginning //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. const_local_iterator cbegin(size_type n) const { return table_.cbegin(n); } @@ -1908,13 +1908,13 @@ class unordered_multiset_impl //! //! <b>Effects</b>: Returns a local_iterator pointing to the end //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. local_iterator end(size_type n) { return table_.end(n); } @@ -1922,13 +1922,13 @@ class unordered_multiset_impl //! //! <b>Effects</b>: Returns a const_local_iterator pointing to the end //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. const_local_iterator end(size_type n) const { return table_.end(n); } @@ -1936,13 +1936,13 @@ class unordered_multiset_impl //! //! <b>Effects</b>: Returns a const_local_iterator pointing to the end //! of the sequence stored in the bucket n. - //! + //! //! <b>Complexity</b>: Constant. - //! + //! //! <b>Throws</b>: Nothing. - //! + //! //! <b>Note</b>: [this->begin(n), this->end(n)) is a valid range - //! containing all of the elements in the nth bucket. + //! containing all of the elements in the nth bucket. const_local_iterator cend(size_type n) const { return table_.cend(n); } @@ -1952,22 +1952,22 @@ class unordered_multiset_impl //! n can be bigger or smaller than this->bucket_count(). //! //! <b>Effects</b>: Updates the internal reference with the new bucket erases - //! the values from the old bucket and inserts then in the new one. + //! the values from the old bucket and inserts then in the new one. //! //! If store_hash option is true, this method does not use the hash function. - //! + //! //! <b>Complexity</b>: Average case linear in this->size(), worst case quadratic. - //! + //! //! <b>Throws</b>: If the hasher functor throws. void rehash(const bucket_traits &new_bucket_traits) { table_.rehash(new_bucket_traits); } //! <b>Requires</b>: //! - //! <b>Effects</b>: - //! - //! <b>Complexity</b>: - //! + //! <b>Effects</b>: + //! + //! <b>Complexity</b>: + //! //! <b>Throws</b>: //! //! <b>Note</b>: this method is only available if incremental<true> option is activated. @@ -1980,22 +1980,22 @@ class unordered_multiset_impl //! <b>Requires</b>: //! - //! <b>Effects</b>: - //! - //! <b>Complexity</b>: - //! - //! <b>Throws</b>: + //! <b>Effects</b>: + //! + //! <b>Complexity</b>: + //! + //! <b>Throws</b>: size_type split_count() const { return table_.split_count(); } //! <b>Effects</b>: Returns the nearest new bucket count optimized for //! the container that is bigger than n. This suggestion can be used //! to create bucket arrays with a size that will usually improve - //! container's performance. If such value does not exist, the + //! container's performance. If such value does not exist, the //! higher possible value is returned. - //! + //! //! <b>Complexity</b>: Amortized constant time. - //! + //! //! <b>Throws</b>: Nothing. static size_type suggested_upper_bucket_count(size_type n) { return table_type::suggested_upper_bucket_count(n); } @@ -2003,11 +2003,11 @@ class unordered_multiset_impl //! <b>Effects</b>: Returns the nearest new bucket count optimized for //! the container that is smaller than n. This suggestion can be used //! to create bucket arrays with a size that will usually improve - //! container's performance. If such value does not exist, the + //! container's performance. If such value does not exist, the //! lower possible value is returned. - //! + //! //! <b>Complexity</b>: Amortized constant time. - //! + //! //! <b>Throws</b>: Nothing. static size_type suggested_lower_bucket_count(size_type n) { return table_type::suggested_lower_bucket_count(n); } @@ -2030,7 +2030,7 @@ struct make_unordered_multiset /// @cond typedef unordered_multiset_impl < typename make_hashtable_opt - <T, false, + <T, false, #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 #else @@ -2050,7 +2050,7 @@ template<class T, class O1, class O2, class O3, class O4, class O5, class O6, cl template<class T, class ...Options> #endif class unordered_multiset - : public make_unordered_multiset<T, + : public make_unordered_multiset<T, #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 #else @@ -2059,7 +2059,7 @@ class unordered_multiset >::type { typedef typename make_unordered_multiset - <T, + <T, #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) O1, O2, O3, O4, O5, O6, O7, O8, O9, O10 #else @@ -2083,7 +2083,7 @@ class unordered_multiset unordered_multiset( const bucket_traits &b_traits , const hasher & hash_func = hasher() , const key_equal &equal_func = key_equal() - , const value_traits &v_traits = value_traits()) + , const value_traits &v_traits = value_traits()) : Base(b_traits, hash_func, equal_func, v_traits) {} @@ -2093,7 +2093,7 @@ class unordered_multiset , const bucket_traits &b_traits , const hasher & hash_func = hasher() , const key_equal &equal_func = key_equal() - , const value_traits &v_traits = value_traits()) + , const value_traits &v_traits = value_traits()) : Base(b, e, b_traits, hash_func, equal_func, v_traits) {} @@ -2107,8 +2107,8 @@ class unordered_multiset #endif -} //namespace intrusive -} //namespace boost +} //namespace intrusive +} //namespace boost #include <boost/intrusive/detail/config_end.hpp> |