Chris@16: ////////////////////////////////////////////////////////////////////////////// Chris@16: // Chris@101: // (C) Copyright Ion Gaztanaga 2005-2013. Distributed under the Boost Chris@16: // Software License, Version 1.0. (See accompanying file Chris@16: // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) Chris@16: // Chris@16: // See http://www.boost.org/libs/container for documentation. Chris@16: // Chris@16: ////////////////////////////////////////////////////////////////////////////// Chris@16: #ifndef BOOST_CONTAINER_FLAT_SET_HPP Chris@16: #define BOOST_CONTAINER_FLAT_SET_HPP Chris@16: Chris@101: #ifndef BOOST_CONFIG_HPP Chris@101: # include Chris@101: #endif Chris@101: Chris@101: #if defined(BOOST_HAS_PRAGMA_ONCE) Chris@16: # pragma once Chris@16: #endif Chris@16: Chris@16: #include Chris@16: #include Chris@16: Chris@101: // container Chris@101: #include Chris@16: #include Chris@101: #include //new_allocator Chris@101: // container/detail Chris@16: #include Chris@16: #include Chris@101: // move Chris@101: #include Chris@101: #include Chris@101: // move/detail Chris@101: #if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) Chris@101: #include Chris@101: #endif Chris@16: #include Chris@101: // intrusive/detail Chris@101: #include //pair Chris@101: #include //less, equal Chris@101: // std Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: #include Chris@101: #endif Chris@16: Chris@16: namespace boost { Chris@16: namespace container { Chris@16: Chris@16: //! flat_set is a Sorted Associative Container that stores objects of type Key. Chris@16: //! It is also a Unique Associative Container, meaning that no two elements are the same. Chris@16: //! Chris@16: //! flat_set is similar to std::set but it's implemented like an ordered vector. Chris@16: //! This means that inserting a new element into a flat_set invalidates Chris@16: //! previous iterators and references Chris@16: //! Chris@16: //! Erasing an element of a flat_set invalidates iterators and references Chris@16: //! pointing to elements that come after (their keys are bigger) the erased element. Chris@16: //! Chris@16: //! This container provides random-access iterators. Chris@101: //! Chris@101: //! \tparam Key is the type to be inserted in the set, which is also the key_type Chris@101: //! \tparam Compare is the comparison functor used to order keys Chris@101: //! \tparam Allocator is the allocator to be used to allocate memory for this container Chris@16: #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@101: template , class Allocator = new_allocator > Chris@16: #else Chris@16: template Chris@16: #endif Chris@16: class flat_set Chris@101: ///@cond Chris@101: : public container_detail::flat_tree, Compare, Allocator> Chris@101: ///@endcond Chris@16: { Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: private: Chris@16: BOOST_COPYABLE_AND_MOVABLE(flat_set) Chris@101: typedef container_detail::flat_tree, Compare, Allocator> base_t; Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: public: Chris@16: ////////////////////////////////////////////// Chris@16: // Chris@16: // types Chris@16: // Chris@16: ////////////////////////////////////////////// Chris@16: typedef Key key_type; Chris@16: typedef Key value_type; Chris@16: typedef Compare key_compare; Chris@16: typedef Compare value_compare; Chris@101: typedef ::boost::container::allocator_traits allocator_traits_type; Chris@16: typedef typename ::boost::container::allocator_traits::pointer pointer; Chris@16: typedef typename ::boost::container::allocator_traits::const_pointer const_pointer; Chris@16: typedef typename ::boost::container::allocator_traits::reference reference; Chris@16: typedef typename ::boost::container::allocator_traits::const_reference const_reference; Chris@16: typedef typename ::boost::container::allocator_traits::size_type size_type; Chris@16: typedef typename ::boost::container::allocator_traits::difference_type difference_type; Chris@16: typedef Allocator allocator_type; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::stored_allocator_type) stored_allocator_type; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::iterator) iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_iterator) const_iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::reverse_iterator) reverse_iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_reverse_iterator) const_reverse_iterator; Chris@16: Chris@16: public: Chris@16: ////////////////////////////////////////////// Chris@16: // Chris@16: // construct/copy/destroy Chris@16: // Chris@16: ////////////////////////////////////////////// Chris@16: Chris@101: //! Effects: Default constructs an empty container. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: explicit flat_set() Chris@101: : base_t() Chris@16: {} Chris@16: Chris@101: //! Effects: Constructs an empty container using the specified Chris@16: //! comparison object and allocator. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: explicit flat_set(const Compare& comp, Chris@16: const allocator_type& a = allocator_type()) Chris@101: : base_t(comp, a) Chris@16: {} Chris@16: Chris@101: //! Effects: Constructs an empty container using the specified allocator. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: explicit flat_set(const allocator_type& a) Chris@101: : base_t(a) Chris@16: {} Chris@16: Chris@101: //! Effects: Constructs an empty container using the specified comparison object and Chris@16: //! allocator, and inserts elements from the range [first ,last ). Chris@16: //! Chris@16: //! Complexity: Linear in N if the range [first ,last ) is already sorted using Chris@16: //! comp and otherwise N logN, where N is last - first. Chris@16: template Chris@16: flat_set(InputIterator first, InputIterator last, Chris@16: const Compare& comp = Compare(), Chris@16: const allocator_type& a = allocator_type()) Chris@101: : base_t(true, first, last, comp, a) Chris@16: {} Chris@16: Chris@101: //! Effects: Constructs an empty container using the specified Chris@101: //! allocator, and inserts elements from the range [first ,last ). Chris@101: //! Chris@101: //! Complexity: Linear in N if the range [first ,last ) is already sorted using Chris@101: //! comp and otherwise N logN, where N is last - first. Chris@101: template Chris@101: flat_set(InputIterator first, InputIterator last, const allocator_type& a) Chris@101: : base_t(true, first, last, Compare(), a) Chris@101: {} Chris@101: Chris@101: //! Effects: Constructs an empty container using the specified comparison object and Chris@16: //! allocator, and inserts elements from the ordered unique range [first ,last). This function Chris@16: //! is more efficient than the normal range creation for ordered ranges. Chris@16: //! Chris@16: //! Requires: [first ,last) must be ordered according to the predicate and must be Chris@16: //! unique values. Chris@16: //! Chris@16: //! Complexity: Linear in N. Chris@16: //! Chris@16: //! Note: Non-standard extension. Chris@16: template Chris@16: flat_set(ordered_unique_range_t, InputIterator first, InputIterator last, Chris@16: const Compare& comp = Compare(), Chris@16: const allocator_type& a = allocator_type()) Chris@101: : base_t(ordered_range, first, last, comp, a) Chris@16: {} Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! Effects: Constructs an empty container using the specified comparison object and Chris@101: //! allocator, and inserts elements from the range [il.begin(), il.end()). Chris@101: //! Chris@101: //! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using Chris@101: //! comp and otherwise N logN, where N is il.begin() - il.end(). Chris@101: flat_set(std::initializer_list il, const Compare& comp = Compare(), Chris@101: const allocator_type& a = allocator_type()) Chris@101: : base_t(true, il.begin(), il.end(), comp, a) Chris@101: {} Chris@101: Chris@101: //! Effects: Constructs an empty container using the specified Chris@101: //! allocator, and inserts elements from the range [il.begin(), il.end()). Chris@101: //! Chris@101: //! Complexity: Linear in N if the range [il.begin(), il.end()) is already sorted using Chris@101: //! comp and otherwise N logN, where N is il.begin() - il.end(). Chris@101: flat_set(std::initializer_list il, const allocator_type& a) Chris@101: : base_t(true, il.begin(), il.end(), Compare(), a) Chris@101: {} Chris@101: Chris@101: //! Effects: Constructs an empty container using the specified comparison object and Chris@101: //! allocator, and inserts elements from the ordered unique range [il.begin(), il.end()). This function Chris@101: //! is more efficient than the normal range creation for ordered ranges. Chris@101: //! Chris@101: //! Requires: [il.begin(), il.end()) must be ordered according to the predicate and must be Chris@101: //! unique values. Chris@101: //! Chris@101: //! Complexity: Linear in N. Chris@101: //! Chris@101: //! Note: Non-standard extension. Chris@101: flat_set(ordered_unique_range_t, std::initializer_list il, Chris@101: const Compare& comp = Compare(), const allocator_type& a = allocator_type()) Chris@101: : base_t(ordered_range, il.begin(), il.end(), comp, a) Chris@101: {} Chris@101: #endif Chris@101: Chris@101: //! Effects: Copy constructs the container. Chris@16: //! Chris@16: //! Complexity: Linear in x.size(). Chris@16: flat_set(const flat_set& x) Chris@101: : base_t(static_cast(x)) Chris@16: {} Chris@16: Chris@101: //! Effects: Move constructs thecontainer. Constructs *this using x's resources. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: //! Chris@16: //! Postcondition: x is emptied. Chris@101: flat_set(BOOST_RV_REF(flat_set) x) Chris@101: : base_t(BOOST_MOVE_BASE(base_t, x)) Chris@16: {} Chris@16: Chris@101: //! Effects: Copy constructs a container using the specified allocator. Chris@16: //! Chris@16: //! Complexity: Linear in x.size(). Chris@16: flat_set(const flat_set& x, const allocator_type &a) Chris@101: : base_t(static_cast(x), a) Chris@16: {} Chris@16: Chris@101: //! Effects: Move constructs a container using the specified allocator. Chris@16: //! Constructs *this using x's resources. Chris@16: //! Chris@101: //! Complexity: Constant if a == x.get_allocator(), linear otherwise Chris@101: flat_set(BOOST_RV_REF(flat_set) x, const allocator_type &a) Chris@101: : base_t(BOOST_MOVE_BASE(base_t, x), a) Chris@16: {} Chris@16: Chris@16: //! Effects: Makes *this a copy of x. Chris@16: //! Chris@16: //! Complexity: Linear in x.size(). Chris@16: flat_set& operator=(BOOST_COPY_ASSIGN_REF(flat_set) x) Chris@101: { return static_cast(this->base_t::operator=(static_cast(x))); } Chris@16: Chris@101: //! Throws: If allocator_traits_type::propagate_on_container_move_assignment Chris@101: //! is false and (allocation throws or value_type's move constructor throws) Chris@16: //! Chris@101: //! Complexity: Constant if allocator_traits_type:: Chris@101: //! propagate_on_container_move_assignment is true or Chris@101: //! this->get>allocator() == x.get_allocator(). Linear otherwise. Chris@101: flat_set& operator=(BOOST_RV_REF(flat_set) x) Chris@101: BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value Chris@101: && boost::container::container_detail::is_nothrow_move_assignable::value ) Chris@101: { return static_cast(this->base_t::operator=(BOOST_MOVE_BASE(base_t, x))); } Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! Effects: Copy all elements from il to *this. Chris@101: //! Chris@101: //! Complexity: Linear in il.size(). Chris@101: flat_set& operator=(std::initializer_list il) Chris@101: { Chris@101: this->clear(); Chris@101: this->insert(il.begin(), il.end()); Chris@101: return *this; Chris@101: } Chris@101: #endif Chris@101: Chris@101: #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@101: //! Effects: Returns a copy of the allocator that Chris@16: //! was passed to the object's constructor. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a reference to the internal allocator. Chris@16: //! Chris@16: //! Throws: Nothing Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: //! Chris@16: //! Note: Non-standard extension. Chris@101: stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a reference to the internal allocator. Chris@16: //! Chris@16: //! Throws: Nothing Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: //! Chris@16: //! Note: Non-standard extension. Chris@101: const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns an iterator to the first element contained in the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: iterator begin() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_iterator to the first element contained in the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_iterator begin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns an iterator to the end of the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: iterator end() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_iterator to the end of the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a reverse_iterator pointing to the beginning Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_reverse_iterator pointing to the beginning Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a reverse_iterator pointing to the end Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_reverse_iterator pointing to the end Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_iterator to the first element contained in the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_iterator to the end of the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_reverse_iterator pointing to the beginning Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns a const_reverse_iterator pointing to the end Chris@16: //! of the reversed container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns true if the container contains no elements. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: bool empty() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns the number of the elements contained in the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: size_type size() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns the largest possible size of the container. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Number of elements for which memory has been allocated. Chris@16: //! capacity() is always greater than or equal to size(). Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: If n is less than or equal to capacity(), this call has no Chris@16: //! effect. Otherwise, it is a request for allocation of additional memory. Chris@16: //! If the request is successful, then capacity() is greater than or equal to Chris@16: //! n; otherwise, capacity() is unchanged. In either case, size() is unchanged. Chris@16: //! Chris@16: //! Throws: If memory allocation allocation throws or Key's copy constructor throws. Chris@16: //! Chris@16: //! Note: If capacity() is less than "cnt", iterators and references to Chris@16: //! to values might be invalidated. Chris@101: void reserve(size_type cnt); Chris@16: Chris@16: //! Effects: Tries to deallocate the excess of memory created Chris@16: // with previous allocations. The size of the vector is unchanged Chris@16: //! Chris@16: //! Throws: If memory allocation throws, or Key's copy constructor throws. Chris@16: //! Chris@16: //! Complexity: Linear to size(). Chris@101: void shrink_to_fit(); Chris@101: Chris@101: #endif // #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: ////////////////////////////////////////////// Chris@16: // Chris@16: // modifiers Chris@16: // Chris@16: ////////////////////////////////////////////// Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: //! Effects: Inserts an object x of type Key constructed with Chris@16: //! std::forward(args)... if and only if there is no element in the container Chris@16: //! with key equivalent to the key of x. Chris@16: //! Chris@16: //! Returns: The bool component of the returned pair is true if and only Chris@16: //! if the insertion takes place, and the iterator component of the pair Chris@16: //! points to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time plus linear insertion Chris@16: //! to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: template Chris@101: std::pair emplace(BOOST_FWD_REF(Args)... args) Chris@101: { return this->base_t::emplace_unique(boost::forward(args)...); } Chris@16: Chris@16: //! Effects: Inserts an object of type Key constructed with Chris@16: //! std::forward(args)... in the container if and only if there is Chris@16: //! no element in the container with key equivalent to the key of x. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time (constant if x is inserted Chris@16: //! right before p) plus insertion linear to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: template Chris@101: iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args) Chris@101: { return this->base_t::emplace_hint_unique(p, boost::forward(args)...); } Chris@16: Chris@101: #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) Chris@16: Chris@101: #define BOOST_CONTAINER_FLAT_SET_EMPLACE_CODE(N) \ Chris@101: BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \ Chris@101: std::pair emplace(BOOST_MOVE_UREF##N)\ Chris@101: { return this->base_t::emplace_unique(BOOST_MOVE_FWD##N); }\ Chris@101: \ Chris@101: BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \ Chris@101: iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\ Chris@101: { return this->base_t::emplace_hint_unique(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\ Chris@101: // Chris@101: BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_FLAT_SET_EMPLACE_CODE) Chris@101: #undef BOOST_CONTAINER_FLAT_SET_EMPLACE_CODE Chris@16: Chris@101: #endif // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) Chris@16: Chris@16: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: //! Effects: Inserts x if and only if there is no element in the container Chris@16: //! with key equivalent to the key of x. Chris@16: //! Chris@16: //! Returns: The bool component of the returned pair is true if and only Chris@16: //! if the insertion takes place, and the iterator component of the pair Chris@16: //! points to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time plus linear insertion Chris@16: //! to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: std::pair insert(const value_type &x); Chris@16: Chris@16: //! Effects: Inserts a new value_type move constructed from the pair if and Chris@16: //! only if there is no element in the container with key equivalent to the key of x. Chris@16: //! Chris@16: //! Returns: The bool component of the returned pair is true if and only Chris@16: //! if the insertion takes place, and the iterator component of the pair Chris@16: //! points to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time plus linear insertion Chris@16: //! to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: std::pair insert(value_type &&x); Chris@16: #else Chris@16: private: Chris@16: typedef std::pair insert_return_pair; Chris@16: public: Chris@16: BOOST_MOVE_CONVERSION_AWARE_CATCH(insert, value_type, insert_return_pair, this->priv_insert) Chris@16: #endif Chris@16: Chris@16: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: //! Effects: Inserts a copy of x in the container if and only if there is Chris@16: //! no element in the container with key equivalent to the key of x. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time (constant if x is inserted Chris@16: //! right before p) plus insertion linear to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: iterator insert(const_iterator p, const value_type &x); Chris@16: Chris@16: //! Effects: Inserts an element move constructed from x in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time (constant if x is inserted Chris@16: //! right before p) plus insertion linear to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@101: iterator insert(const_iterator p, value_type &&x); Chris@16: #else Chris@16: BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(insert, value_type, iterator, this->priv_insert, const_iterator, const_iterator) Chris@16: #endif Chris@16: Chris@16: //! Requires: first, last are not iterators into *this. Chris@16: //! Chris@16: //! Effects: inserts each element from the range [first,last) if and only Chris@16: //! if there is no element with key equivalent to the key of that element. Chris@16: //! Chris@16: //! Complexity: At most N log(size()+N) (N is the distance from first to last) Chris@16: //! search time plus N*size() insertion time. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: template Chris@16: void insert(InputIterator first, InputIterator last) Chris@101: { this->base_t::insert_unique(first, last); } Chris@16: Chris@16: //! Requires: first, last are not iterators into *this and Chris@16: //! must be ordered according to the predicate and must be Chris@16: //! unique values. Chris@16: //! Chris@16: //! Effects: inserts each element from the range [first,last) .This function Chris@16: //! is more efficient than the normal range creation for ordered ranges. Chris@16: //! Chris@16: //! Complexity: At most N log(size()+N) (N is the distance from first to last) Chris@16: //! search time plus N*size() insertion time. Chris@16: //! Chris@16: //! Note: Non-standard extension. If an element is inserted it might invalidate elements. Chris@16: template Chris@16: void insert(ordered_unique_range_t, InputIterator first, InputIterator last) Chris@101: { this->base_t::insert_unique(ordered_unique_range, first, last); } Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! Effects: inserts each element from the range [il.begin(), il.end()) if and only Chris@101: //! if there is no element with key equivalent to the key of that element. Chris@101: //! Chris@101: //! Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) Chris@101: //! search time plus N*size() insertion time. Chris@101: //! Chris@101: //! Note: If an element is inserted it might invalidate elements. Chris@101: void insert(std::initializer_list il) Chris@101: { this->base_t::insert_unique(il.begin(), il.end()); } Chris@101: Chris@101: //! Requires: Range [il.begin(), il.end()) must be ordered according to the predicate Chris@101: //! and must be unique values. Chris@101: //! Chris@101: //! Effects: inserts each element from the range [il.begin(), il.end()) .This function Chris@101: //! is more efficient than the normal range creation for ordered ranges. Chris@101: //! Chris@101: //! Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) Chris@101: //! search time plus N*size() insertion time. Chris@101: //! Chris@101: //! Note: Non-standard extension. If an element is inserted it might invalidate elements. Chris@101: void insert(ordered_unique_range_t, std::initializer_list il) Chris@101: { this->base_t::insert_unique(ordered_unique_range, il.begin(), il.end()); } Chris@101: #endif Chris@101: Chris@101: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@101: Chris@101: //! Effects: Erases the element pointed to by p. Chris@16: //! Chris@16: //! Returns: Returns an iterator pointing to the element immediately Chris@16: //! following q prior to the element being erased. If no such element exists, Chris@16: //! returns end(). Chris@16: //! Chris@101: //! Complexity: Linear to the elements with keys bigger than p Chris@16: //! Chris@16: //! Note: Invalidates elements with keys Chris@16: //! not less than the erased element. Chris@101: iterator erase(const_iterator p); Chris@16: Chris@16: //! Effects: Erases all elements in the container with key equivalent to x. Chris@16: //! Chris@16: //! Returns: Returns the number of erased elements. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time plus erasure time Chris@16: //! linear to the elements with bigger keys. Chris@101: size_type erase(const key_type& x); Chris@16: Chris@16: //! Effects: Erases all the elements in the range [first, last). Chris@16: //! Chris@16: //! Returns: Returns last. Chris@16: //! Chris@16: //! Complexity: size()*N where N is the distance from first to last. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time plus erasure time Chris@16: //! linear to the elements with bigger keys. Chris@101: iterator erase(const_iterator first, const_iterator last); Chris@16: Chris@16: //! Effects: Swaps the contents of *this and x. Chris@16: //! Chris@16: //! Throws: Nothing. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@16: void swap(flat_set& x) Chris@101: BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value Chris@101: && boost::container::container_detail::is_nothrow_swappable::value ); Chris@16: Chris@16: //! Effects: erase(a.begin(),a.end()). Chris@16: //! Chris@16: //! Postcondition: size() == 0. Chris@16: //! Chris@16: //! Complexity: linear in size(). Chris@101: void clear() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@16: //! Effects: Returns the comparison object out Chris@16: //! of which a was constructed. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: key_compare key_comp() const; Chris@16: Chris@16: //! Effects: Returns an object of value_compare constructed out Chris@16: //! of the comparison object. Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: value_compare value_comp() const; Chris@16: Chris@16: //! Returns: An iterator pointing to an element with the key Chris@16: //! equivalent to x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic. Chris@101: iterator find(const key_type& x); Chris@16: Chris@101: //! Returns: A const_iterator pointing to an element with the key Chris@16: //! equivalent to x, or end() if such an element is not found. Chris@16: //! Chris@101: //! Complexity: Logarithmic. Chris@101: const_iterator find(const key_type& x) const; Chris@101: Chris@101: //! Requires: size() >= n. Chris@101: //! Chris@101: //! Effects: Returns an iterator to the nth element Chris@101: //! from the beginning of the container. Returns end() Chris@101: //! if n == size(). Chris@101: //! Chris@101: //! Throws: Nothing. Chris@101: //! Chris@101: //! Complexity: Constant. Chris@101: //! Chris@101: //! Note: Non-standard extension Chris@101: iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! Requires: size() >= n. Chris@101: //! Chris@101: //! Effects: Returns a const_iterator to the nth element Chris@101: //! from the beginning of the container. Returns end() Chris@101: //! if n == size(). Chris@101: //! Chris@101: //! Throws: Nothing. Chris@101: //! Chris@101: //! Complexity: Constant. Chris@101: //! Chris@101: //! Note: Non-standard extension Chris@101: const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! Requires: size() >= n. Chris@101: //! Chris@101: //! Effects: Returns an iterator to the nth element Chris@101: //! from the beginning of the container. Returns end() Chris@101: //! if n == size(). Chris@101: //! Chris@101: //! Throws: Nothing. Chris@101: //! Chris@101: //! Complexity: Constant. Chris@101: //! Chris@101: //! Note: Non-standard extension Chris@101: size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! Requires: begin() <= p <= end(). Chris@101: //! Chris@101: //! Effects: Returns the index of the element pointed by p Chris@101: //! and size() if p == end(). Chris@101: //! Chris@101: //! Throws: Nothing. Chris@101: //! Chris@101: //! Complexity: Constant. Chris@101: //! Chris@101: //! Note: Non-standard extension Chris@101: size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: #endif // #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: //! Returns: The number of elements with key equivalent to x. Chris@16: //! Chris@16: //! Complexity: log(size())+count(k) Chris@16: size_type count(const key_type& x) const Chris@101: { return static_cast(this->base_t::find(x) != this->base_t::cend()); } Chris@16: Chris@101: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: //! Returns: An iterator pointing to the first element with key not less Chris@16: //! than k, or a.end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: iterator lower_bound(const key_type& x); Chris@16: Chris@101: //! Returns: A const iterator pointing to the first element with key not Chris@16: //! less than k, or a.end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: const_iterator lower_bound(const key_type& x) const; Chris@16: Chris@16: //! Returns: An iterator pointing to the first element with key not less Chris@16: //! than x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: iterator upper_bound(const key_type& x); Chris@16: Chris@101: //! Returns: A const iterator pointing to the first element with key not Chris@16: //! less than x, or end() if such an element is not found. Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@101: const_iterator upper_bound(const key_type& x) const; Chris@101: Chris@101: #endif // #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: //! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)). Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@16: std::pair equal_range(const key_type& x) const Chris@101: { return this->base_t::lower_bound_range(x); } Chris@16: Chris@16: //! Effects: Equivalent to std::make_pair(this->lower_bound(k), this->upper_bound(k)). Chris@16: //! Chris@16: //! Complexity: Logarithmic Chris@16: std::pair equal_range(const key_type& x) Chris@101: { return this->base_t::lower_bound_range(x); } Chris@16: Chris@101: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@101: //! Effects: Returns true if x and y are equal Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator==(const flat_set& x, const flat_set& y); Chris@16: Chris@101: //! Effects: Returns true if x and y are unequal Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator!=(const flat_set& x, const flat_set& y); Chris@101: Chris@101: //! Effects: Returns true if x is less than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator<(const flat_set& x, const flat_set& y); Chris@101: Chris@101: //! Effects: Returns true if x is greater than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator>(const flat_set& x, const flat_set& y); Chris@101: Chris@101: //! Effects: Returns true if x is equal or less than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator<=(const flat_set& x, const flat_set& y); Chris@101: Chris@101: //! Effects: Returns true if x is equal or greater than y Chris@101: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator>=(const flat_set& x, const flat_set& y); Chris@101: Chris@101: //! Effects: x.swap(y) Chris@101: //! Chris@101: //! Complexity: Constant. Chris@101: friend void swap(flat_set& x, flat_set& y); Chris@101: Chris@101: #endif //#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@101: Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: private: Chris@16: template Chris@16: std::pair priv_insert(BOOST_FWD_REF(KeyType) x) Chris@101: { return this->base_t::insert_unique(::boost::forward(x)); } Chris@16: Chris@16: template Chris@16: iterator priv_insert(const_iterator p, BOOST_FWD_REF(KeyType) x) Chris@101: { return this->base_t::insert_unique(p, ::boost::forward(x)); } Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: }; Chris@16: Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: } //namespace container { Chris@16: Chris@16: //!has_trivial_destructor_after_move<> == true_type Chris@16: //!specialization for optimizations Chris@101: template Chris@101: struct has_trivial_destructor_after_move > Chris@16: { Chris@101: typedef typename ::boost::container::allocator_traits::pointer pointer; Chris@101: static const bool value = ::boost::has_trivial_destructor_after_move::value && Chris@101: ::boost::has_trivial_destructor_after_move::value && Chris@101: ::boost::has_trivial_destructor_after_move::value; Chris@16: }; Chris@16: Chris@16: namespace container { Chris@16: Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: //! flat_multiset is a Sorted Associative Container that stores objects of type Key. Chris@16: //! Chris@16: //! flat_multiset can store multiple copies of the same key value. Chris@16: //! Chris@16: //! flat_multiset is similar to std::multiset but it's implemented like an ordered vector. Chris@16: //! This means that inserting a new element into a flat_multiset invalidates Chris@16: //! previous iterators and references Chris@16: //! Chris@16: //! Erasing an element invalidates iterators and references Chris@16: //! pointing to elements that come after (their keys are bigger) the erased element. Chris@16: //! Chris@16: //! This container provides random-access iterators. Chris@101: //! Chris@101: //! \tparam Key is the type to be inserted in the multiset, which is also the key_type Chris@101: //! \tparam Compare is the comparison functor used to order keys Chris@101: //! \tparam Allocator is the allocator to be used to allocate memory for this container Chris@16: #ifdef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@101: template , class Allocator = new_allocator > Chris@16: #else Chris@16: template Chris@16: #endif Chris@16: class flat_multiset Chris@101: ///@cond Chris@101: : public container_detail::flat_tree, Compare, Allocator> Chris@101: ///@endcond Chris@16: { Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: private: Chris@16: BOOST_COPYABLE_AND_MOVABLE(flat_multiset) Chris@101: typedef container_detail::flat_tree, Compare, Allocator> base_t; Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: public: Chris@16: ////////////////////////////////////////////// Chris@16: // Chris@16: // types Chris@16: // Chris@16: ////////////////////////////////////////////// Chris@16: typedef Key key_type; Chris@16: typedef Key value_type; Chris@16: typedef Compare key_compare; Chris@16: typedef Compare value_compare; Chris@101: typedef ::boost::container::allocator_traits allocator_traits_type; Chris@16: typedef typename ::boost::container::allocator_traits::pointer pointer; Chris@16: typedef typename ::boost::container::allocator_traits::const_pointer const_pointer; Chris@16: typedef typename ::boost::container::allocator_traits::reference reference; Chris@16: typedef typename ::boost::container::allocator_traits::const_reference const_reference; Chris@16: typedef typename ::boost::container::allocator_traits::size_type size_type; Chris@16: typedef typename ::boost::container::allocator_traits::difference_type difference_type; Chris@16: typedef Allocator allocator_type; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::stored_allocator_type) stored_allocator_type; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::iterator) iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_iterator) const_iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::reverse_iterator) reverse_iterator; Chris@101: typedef typename BOOST_CONTAINER_IMPDEF(base_t::const_reverse_iterator) const_reverse_iterator; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::flat_set() Chris@16: explicit flat_multiset() Chris@101: : base_t() Chris@16: {} Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::flat_set(const Compare&, const allocator_type&) Chris@16: explicit flat_multiset(const Compare& comp, Chris@16: const allocator_type& a = allocator_type()) Chris@101: : base_t(comp, a) Chris@16: {} Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::flat_set(const allocator_type&) Chris@16: explicit flat_multiset(const allocator_type& a) Chris@101: : base_t(a) Chris@16: {} Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::flat_set(InputIterator, InputIterator, const Compare& comp, const allocator_type&) Chris@16: template Chris@16: flat_multiset(InputIterator first, InputIterator last, Chris@16: const Compare& comp = Compare(), Chris@16: const allocator_type& a = allocator_type()) Chris@101: : base_t(false, first, last, comp, a) Chris@101: {} Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::flat_set(InputIterator, InputIterator, const allocator_type&) Chris@101: template Chris@101: flat_multiset(InputIterator first, InputIterator last, const allocator_type& a) Chris@101: : base_t(false, first, last, Compare(), a) Chris@16: {} Chris@16: Chris@16: //! Effects: Constructs an empty flat_multiset using the specified comparison object and Chris@16: //! allocator, and inserts elements from the ordered range [first ,last ). This function Chris@16: //! is more efficient than the normal range creation for ordered ranges. Chris@16: //! Chris@16: //! Requires: [first ,last) must be ordered according to the predicate. Chris@16: //! Chris@16: //! Complexity: Linear in N. Chris@16: //! Chris@16: //! Note: Non-standard extension. Chris@16: template Chris@16: flat_multiset(ordered_range_t, InputIterator first, InputIterator last, Chris@16: const Compare& comp = Compare(), Chris@16: const allocator_type& a = allocator_type()) Chris@101: : base_t(ordered_range, first, last, comp, a) Chris@16: {} Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! @copydoc ::boost::container::flat_set::flat_set(std::initializer_list, const Compare& comp, const allocator_type&) Chris@101: flat_multiset(std::initializer_list il, const Compare& comp = Compare(), Chris@101: const allocator_type& a = allocator_type()) Chris@101: : base_t(false, il.begin(), il.end(), comp, a) Chris@16: {} Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::flat_set(std::initializer_list, const allocator_type&) Chris@101: flat_multiset(std::initializer_list il, const allocator_type& a) Chris@101: : base_t(false, il.begin(), il.end(), Compare(), a) Chris@16: {} Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::flat_set(ordered_unique_range_t, std::initializer_list, const Compare& comp, const allocator_type&) Chris@101: flat_multiset(ordered_unique_range_t, std::initializer_list il, Chris@101: const Compare& comp = Compare(), const allocator_type& a = allocator_type()) Chris@101: : base_t(ordered_range, il.begin(), il.end(), comp, a) Chris@101: {} Chris@101: #endif Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::flat_set(const flat_set &) Chris@101: flat_multiset(const flat_multiset& x) Chris@101: : base_t(static_cast(x)) Chris@16: {} Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set(flat_set &&) Chris@101: flat_multiset(BOOST_RV_REF(flat_multiset) x) Chris@101: : base_t(boost::move(static_cast(x))) Chris@16: {} Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set(const flat_set &, const allocator_type &) Chris@101: flat_multiset(const flat_multiset& x, const allocator_type &a) Chris@101: : base_t(static_cast(x), a) Chris@101: {} Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set(flat_set &&, const allocator_type &) Chris@101: flat_multiset(BOOST_RV_REF(flat_multiset) x, const allocator_type &a) Chris@101: : base_t(BOOST_MOVE_BASE(base_t, x), a) Chris@101: {} Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::operator=(const flat_set &) Chris@16: flat_multiset& operator=(BOOST_COPY_ASSIGN_REF(flat_multiset) x) Chris@101: { return static_cast(this->base_t::operator=(static_cast(x))); } Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::operator=(flat_set &&) Chris@101: flat_multiset& operator=(BOOST_RV_REF(flat_multiset) x) Chris@101: BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value Chris@101: && boost::container::container_detail::is_nothrow_move_assignable::value ) Chris@101: { return static_cast(this->base_t::operator=(BOOST_MOVE_BASE(base_t, x))); } Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! @copydoc ::boost::container::flat_set::operator=(std::initializer_list) Chris@101: flat_multiset& operator=(std::initializer_list il) Chris@101: { Chris@101: this->clear(); Chris@101: this->insert(il.begin(), il.end()); Chris@101: return *this; Chris@101: } Chris@101: #endif Chris@16: Chris@101: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::get_allocator() Chris@101: allocator_type get_allocator() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::get_stored_allocator() Chris@101: stored_allocator_type &get_stored_allocator() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::get_stored_allocator() const Chris@101: const stored_allocator_type &get_stored_allocator() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::begin() Chris@101: iterator begin() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::begin() const Chris@101: const_iterator begin() const; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::cbegin() const Chris@101: const_iterator cbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::end() Chris@101: iterator end() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::end() const Chris@101: const_iterator end() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::cend() const Chris@101: const_iterator cend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::rbegin() Chris@101: reverse_iterator rbegin() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::rbegin() const Chris@101: const_reverse_iterator rbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::crbegin() const Chris@101: const_reverse_iterator crbegin() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::rend() Chris@101: reverse_iterator rend() BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::rend() const Chris@101: const_reverse_iterator rend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::crend() const Chris@101: const_reverse_iterator crend() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::empty() const Chris@101: bool empty() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::size() const Chris@101: size_type size() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::max_size() const Chris@101: size_type max_size() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::capacity() const Chris@101: size_type capacity() const BOOST_NOEXCEPT_OR_NOTHROW; Chris@16: Chris@101: //! @copydoc ::boost::container::flat_set::reserve(size_type) Chris@101: void reserve(size_type cnt); Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::shrink_to_fit() Chris@101: void shrink_to_fit(); Chris@101: Chris@101: #endif // #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: ////////////////////////////////////////////// Chris@16: // Chris@16: // modifiers Chris@16: // Chris@16: ////////////////////////////////////////////// Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: Chris@16: //! Effects: Inserts an object of type Key constructed with Chris@16: //! std::forward(args)... and returns the iterator pointing to the Chris@16: //! newly inserted element. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time plus linear insertion Chris@16: //! to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: template Chris@101: iterator emplace(BOOST_FWD_REF(Args)... args) Chris@101: { return this->base_t::emplace_equal(boost::forward(args)...); } Chris@16: Chris@16: //! Effects: Inserts an object of type Key constructed with Chris@16: //! std::forward(args)... in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time (constant if x is inserted Chris@16: //! right before p) plus insertion linear to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: template Chris@101: iterator emplace_hint(const_iterator p, BOOST_FWD_REF(Args)... args) Chris@101: { return this->base_t::emplace_hint_equal(p, boost::forward(args)...); } Chris@16: Chris@101: #else // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) Chris@16: Chris@101: #define BOOST_CONTAINER_FLAT_MULTISET_EMPLACE_CODE(N) \ Chris@101: BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \ Chris@101: iterator emplace(BOOST_MOVE_UREF##N)\ Chris@101: { return this->base_t::emplace_equal(BOOST_MOVE_FWD##N); }\ Chris@101: \ Chris@101: BOOST_MOVE_TMPL_LT##N BOOST_MOVE_CLASS##N BOOST_MOVE_GT##N \ Chris@101: iterator emplace_hint(const_iterator hint BOOST_MOVE_I##N BOOST_MOVE_UREF##N)\ Chris@101: { return this->base_t::emplace_hint_equal(hint BOOST_MOVE_I##N BOOST_MOVE_FWD##N); }\ Chris@101: // Chris@101: BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_FLAT_MULTISET_EMPLACE_CODE) Chris@101: #undef BOOST_CONTAINER_FLAT_MULTISET_EMPLACE_CODE Chris@16: Chris@101: #endif // !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) Chris@16: Chris@16: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: //! Effects: Inserts x and returns the iterator pointing to the Chris@16: //! newly inserted element. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time plus linear insertion Chris@16: //! to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: iterator insert(const value_type &x); Chris@16: Chris@16: //! Effects: Inserts a new value_type move constructed from x Chris@16: //! and returns the iterator pointing to the newly inserted element. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time plus linear insertion Chris@16: //! to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: iterator insert(value_type &&x); Chris@16: #else Chris@16: BOOST_MOVE_CONVERSION_AWARE_CATCH(insert, value_type, iterator, this->priv_insert) Chris@16: #endif Chris@16: Chris@16: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@16: //! Effects: Inserts a copy of x in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time (constant if x is inserted Chris@16: //! right before p) plus insertion linear to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: iterator insert(const_iterator p, const value_type &x); Chris@16: Chris@16: //! Effects: Inserts a new value move constructed from x in the container. Chris@16: //! p is a hint pointing to where the insert should start to search. Chris@16: //! Chris@16: //! Returns: An iterator pointing to the element with key equivalent Chris@16: //! to the key of x. Chris@16: //! Chris@16: //! Complexity: Logarithmic search time (constant if x is inserted Chris@16: //! right before p) plus insertion linear to the elements with bigger keys than x. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@101: iterator insert(const_iterator p, value_type &&x); Chris@16: #else Chris@16: BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(insert, value_type, iterator, this->priv_insert, const_iterator, const_iterator) Chris@16: #endif Chris@16: Chris@16: //! Requires: first, last are not iterators into *this. Chris@16: //! Chris@16: //! Effects: inserts each element from the range [first,last) . Chris@16: //! Chris@16: //! Complexity: At most N log(size()+N) (N is the distance from first to last) Chris@16: //! search time plus N*size() insertion time. Chris@16: //! Chris@16: //! Note: If an element is inserted it might invalidate elements. Chris@16: template Chris@16: void insert(InputIterator first, InputIterator last) Chris@101: { this->base_t::insert_equal(first, last); } Chris@16: Chris@16: //! Requires: first, last are not iterators into *this and Chris@16: //! must be ordered according to the predicate. Chris@16: //! Chris@16: //! Effects: inserts each element from the range [first,last) .This function Chris@16: //! is more efficient than the normal range creation for ordered ranges. Chris@16: //! Chris@16: //! Complexity: At most N log(size()+N) (N is the distance from first to last) Chris@16: //! search time plus N*size() insertion time. Chris@16: //! Chris@16: //! Note: Non-standard extension. If an element is inserted it might invalidate elements. Chris@16: template Chris@16: void insert(ordered_range_t, InputIterator first, InputIterator last) Chris@101: { this->base_t::insert_equal(ordered_range, first, last); } Chris@16: Chris@101: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) Chris@101: //! Effects: inserts each element from the range [il.begin(), il.end()). Chris@16: //! Chris@101: //! Complexity: At most N log(size()+N) (N is the distance from first to last) Chris@101: //! search time plus N*size() insertion time. Chris@16: //! Chris@101: //! Note: If an element is inserted it might invalidate elements. Chris@101: void insert(std::initializer_list il) Chris@101: { this->base_t::insert_equal(il.begin(), il.end()); } Chris@101: Chris@101: //! Requires: Range [il.begin(), il.end()) must be ordered according to the predicate. Chris@16: //! Chris@101: //! Effects: inserts each element from the range [il.begin(), il.end()). This function Chris@101: //! is more efficient than the normal range creation for ordered ranges. Chris@101: //! Chris@101: //! Complexity: At most N log(size()+N) (N is the distance from il.begin() to il.end()) Chris@101: //! search time plus N*size() insertion time. Chris@101: //! Chris@101: //! Note: Non-standard extension. If an element is inserted it might invalidate elements. Chris@101: void insert(ordered_range_t, std::initializer_list il) Chris@101: { this->base_t::insert_equal(ordered_range, il.begin(), il.end()); } Chris@101: #endif Chris@16: Chris@101: #if defined(BOOST_CONTAINER_DOXYGEN_INVOKED) Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::erase(const_iterator) Chris@101: iterator erase(const_iterator p); Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::erase(const key_type&) Chris@101: size_type erase(const key_type& x); Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::erase(const_iterator,const_iterator) Chris@101: iterator erase(const_iterator first, const_iterator last); Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::swap Chris@101: void swap(flat_multiset& x) Chris@101: BOOST_NOEXCEPT_IF( allocator_traits_type::is_always_equal::value Chris@101: && boost::container::container_detail::is_nothrow_swappable::value ); Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::clear Chris@101: void clear() BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::key_comp Chris@101: key_compare key_comp() const; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::value_comp Chris@101: value_compare value_comp() const; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::find(const key_type& ) Chris@101: iterator find(const key_type& x); Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::find(const key_type& ) const Chris@101: const_iterator find(const key_type& x) const; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::nth(size_type) Chris@101: iterator nth(size_type n) BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::nth(size_type) const Chris@101: const_iterator nth(size_type n) const BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::index_of(iterator) Chris@101: size_type index_of(iterator p) BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::index_of(const_iterator) const Chris@101: size_type index_of(const_iterator p) const BOOST_NOEXCEPT_OR_NOTHROW; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::count(const key_type& ) const Chris@101: size_type count(const key_type& x) const; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::lower_bound(const key_type& ) Chris@101: iterator lower_bound(const key_type& x); Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::lower_bound(const key_type& ) const Chris@101: const_iterator lower_bound(const key_type& x) const; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::upper_bound(const key_type& ) Chris@101: iterator upper_bound(const key_type& x); Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::upper_bound(const key_type& ) const Chris@101: const_iterator upper_bound(const key_type& x) const; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::equal_range(const key_type& ) const Chris@101: std::pair equal_range(const key_type& x) const; Chris@101: Chris@101: //! @copydoc ::boost::container::flat_set::equal_range(const key_type& ) Chris@101: std::pair equal_range(const key_type& x); Chris@101: Chris@101: //! Effects: Returns true if x and y are equal Chris@16: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator==(const flat_multiset& x, const flat_multiset& y); Chris@101: Chris@101: //! Effects: Returns true if x and y are unequal Chris@16: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator!=(const flat_multiset& x, const flat_multiset& y); Chris@16: Chris@101: //! Effects: Returns true if x is less than y Chris@16: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator<(const flat_multiset& x, const flat_multiset& y); Chris@101: Chris@101: //! Effects: Returns true if x is greater than y Chris@16: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator>(const flat_multiset& x, const flat_multiset& y); Chris@101: Chris@101: //! Effects: Returns true if x is equal or less than y Chris@16: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator<=(const flat_multiset& x, const flat_multiset& y); Chris@16: Chris@101: //! Effects: Returns true if x is equal or greater than y Chris@16: //! Chris@101: //! Complexity: Linear to the number of elements in the container. Chris@101: friend bool operator>=(const flat_multiset& x, const flat_multiset& y); Chris@101: Chris@101: //! Effects: x.swap(y) Chris@16: //! Chris@16: //! Complexity: Constant. Chris@101: friend void swap(flat_multiset& x, flat_multiset& y); Chris@16: Chris@101: #endif //#ifdef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: private: Chris@16: template Chris@16: iterator priv_insert(BOOST_FWD_REF(KeyType) x) Chris@101: { return this->base_t::insert_equal(::boost::forward(x)); } Chris@16: Chris@16: template Chris@16: iterator priv_insert(const_iterator p, BOOST_FWD_REF(KeyType) x) Chris@101: { return this->base_t::insert_equal(p, ::boost::forward(x)); } Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: }; Chris@16: Chris@101: #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: } //namespace container { Chris@16: Chris@16: //!has_trivial_destructor_after_move<> == true_type Chris@16: //!specialization for optimizations Chris@101: template Chris@101: struct has_trivial_destructor_after_move > Chris@16: { Chris@101: typedef typename ::boost::container::allocator_traits::pointer pointer; Chris@101: static const bool value = ::boost::has_trivial_destructor_after_move::value && Chris@101: ::boost::has_trivial_destructor_after_move::value && Chris@101: ::boost::has_trivial_destructor_after_move::value; Chris@16: }; Chris@16: Chris@16: namespace container { Chris@16: Chris@101: #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED Chris@16: Chris@16: }} Chris@16: Chris@16: #include Chris@16: Chris@101: #endif // BOOST_CONTAINER_FLAT_SET_HPP