| ///////////////////////////////////////////////////////////////////////////// |
| // |
| // (C) Copyright Ion Gaztanaga 2007-2014 |
| // |
| // Distributed under the Boost Software License, Version 1.0. |
| // (See accompanying file LICENSE_1_0.txt or copy at |
| // http://www.boost.org/LICENSE_1_0.txt) |
| // |
| // See http://www.boost.org/libs/intrusive for documentation. |
| // |
| ///////////////////////////////////////////////////////////////////////////// |
| #ifndef BOOST_INTRUSIVE_AVL_SET_HPP |
| #define BOOST_INTRUSIVE_AVL_SET_HPP |
| |
| #include <boost/intrusive/detail/config_begin.hpp> |
| #include <boost/intrusive/intrusive_fwd.hpp> |
| #include <boost/intrusive/avltree.hpp> |
| #include <boost/intrusive/detail/mpl.hpp> |
| #include <boost/move/utility_core.hpp> |
| #include <boost/static_assert.hpp> |
| |
| #if defined(BOOST_HAS_PRAGMA_ONCE) |
| # pragma once |
| #endif |
| |
| namespace boost { |
| namespace intrusive { |
| |
| //! The class template avl_set is an intrusive container, that mimics most of |
| //! the interface of std::set as described in the C++ standard. |
| //! |
| //! The template parameter \c T is the type to be managed by the container. |
| //! The user can specify additional options and if no options are provided |
| //! default options are used. |
| //! |
| //! The container supports the following options: |
| //! \c base_hook<>/member_hook<>/value_traits<>, |
| //! \c constant_time_size<>, \c size_type<> and |
| //! \c compare<>. |
| #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) |
| template<class T, class ...Options> |
| #else |
| template<class ValueTraits, class Compare, class SizeType, bool ConstantTimeSize, typename HeaderHolder> |
| #endif |
| class avl_set_impl |
| #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| : public bstree_impl<ValueTraits, Compare, SizeType, ConstantTimeSize, AvlTreeAlgorithms, HeaderHolder> |
| #endif |
| { |
| /// @cond |
| typedef bstree_impl<ValueTraits, Compare, SizeType, ConstantTimeSize, AvlTreeAlgorithms, HeaderHolder> tree_type; |
| BOOST_MOVABLE_BUT_NOT_COPYABLE(avl_set_impl) |
| |
| typedef tree_type implementation_defined; |
| /// @endcond |
| |
| public: |
| typedef typename implementation_defined::value_type value_type; |
| typedef typename implementation_defined::value_traits value_traits; |
| typedef typename implementation_defined::pointer pointer; |
| typedef typename implementation_defined::const_pointer const_pointer; |
| typedef typename implementation_defined::reference reference; |
| typedef typename implementation_defined::const_reference const_reference; |
| typedef typename implementation_defined::difference_type difference_type; |
| typedef typename implementation_defined::size_type size_type; |
| typedef typename implementation_defined::value_compare value_compare; |
| typedef typename implementation_defined::key_compare key_compare; |
| typedef typename implementation_defined::iterator iterator; |
| typedef typename implementation_defined::const_iterator const_iterator; |
| typedef typename implementation_defined::reverse_iterator reverse_iterator; |
| typedef typename implementation_defined::const_reverse_iterator const_reverse_iterator; |
| typedef typename implementation_defined::insert_commit_data insert_commit_data; |
| typedef typename implementation_defined::node_traits node_traits; |
| typedef typename implementation_defined::node node; |
| typedef typename implementation_defined::node_ptr node_ptr; |
| typedef typename implementation_defined::const_node_ptr const_node_ptr; |
| typedef typename implementation_defined::node_algorithms node_algorithms; |
| |
| static const bool constant_time_size = tree_type::constant_time_size; |
| |
| public: |
| |
| //! @copydoc ::boost::intrusive::avltree::avltree(const value_compare &,const value_traits &) |
| explicit avl_set_impl( const value_compare &cmp = value_compare() |
| , const value_traits &v_traits = value_traits()) |
| : tree_type(cmp, v_traits) |
| {} |
| |
| //! @copydoc ::boost::intrusive::avltree::avltree(bool,Iterator,Iterator,const value_compare &,const value_traits &) |
| template<class Iterator> |
| avl_set_impl( Iterator b, Iterator e |
| , const value_compare &cmp = value_compare() |
| , const value_traits &v_traits = value_traits()) |
| : tree_type(true, b, e, cmp, v_traits) |
| {} |
| |
| //! @copydoc ::boost::intrusive::avltree::avltree(avltree &&) |
| avl_set_impl(BOOST_RV_REF(avl_set_impl) x) |
| : tree_type(BOOST_MOVE_BASE(tree_type, x)) |
| {} |
| |
| //! @copydoc ::boost::intrusive::avltree::operator=(avltree &&) |
| avl_set_impl& operator=(BOOST_RV_REF(avl_set_impl) x) |
| { return static_cast<avl_set_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); } |
| |
| #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| |
| //! @copydoc ::boost::intrusive::avltree::~avltree() |
| ~avl_set_impl(); |
| |
| //! @copydoc ::boost::intrusive::avltree::begin() |
| iterator begin(); |
| |
| //! @copydoc ::boost::intrusive::avltree::begin()const |
| const_iterator begin() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::cbegin()const |
| const_iterator cbegin() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::end() |
| iterator end(); |
| |
| //! @copydoc ::boost::intrusive::avltree::end()const |
| const_iterator end() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::cend()const |
| const_iterator cend() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::begin() |
| reverse_iterator avlegin(); |
| |
| //! @copydoc ::boost::intrusive::avltree::begin()const |
| const_reverse_iterator avlegin() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::crbegin()const |
| const_reverse_iterator crbegin() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::rend() |
| reverse_iterator rend(); |
| |
| //! @copydoc ::boost::intrusive::avltree::rend()const |
| const_reverse_iterator rend() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::crend()const |
| const_reverse_iterator crend() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::container_from_end_iterator(iterator) |
| static avl_set_impl &container_from_end_iterator(iterator end_iterator); |
| |
| //! @copydoc ::boost::intrusive::avltree::container_from_end_iterator(const_iterator) |
| static const avl_set_impl &container_from_end_iterator(const_iterator end_iterator); |
| |
| //! @copydoc ::boost::intrusive::avltree::container_from_iterator(iterator) |
| static avl_set_impl &container_from_iterator(iterator it); |
| |
| //! @copydoc ::boost::intrusive::avltree::container_from_iterator(const_iterator) |
| static const avl_set_impl &container_from_iterator(const_iterator it); |
| |
| //! @copydoc ::boost::intrusive::avltree::key_comp()const |
| key_compare key_comp() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::value_comp()const |
| value_compare value_comp() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::empty()const |
| bool empty() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::size()const |
| size_type size() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::swap |
| void swap(avl_set_impl& other); |
| |
| //! @copydoc ::boost::intrusive::avltree::clone_from |
| template <class Cloner, class Disposer> |
| void clone_from(const avl_set_impl &src, Cloner cloner, Disposer disposer); |
| |
| #endif //#ifdef BOOST_iNTRUSIVE_DOXYGEN_INVOKED |
| |
| //! @copydoc ::boost::intrusive::avltree::insert_unique(reference) |
| std::pair<iterator, bool> insert(reference value) |
| { return tree_type::insert_unique(value); } |
| |
| //! @copydoc ::boost::intrusive::avltree::insert_unique(const_iterator,reference) |
| iterator insert(const_iterator hint, reference value) |
| { return tree_type::insert_unique(hint, value); } |
| |
| //! @copydoc ::boost::intrusive::avltree::insert_unique_check(const KeyType&,KeyValueCompare,insert_commit_data&) |
| template<class KeyType, class KeyValueCompare> |
| std::pair<iterator, bool> insert_check |
| (const KeyType &key, KeyValueCompare key_value_comp, insert_commit_data &commit_data) |
| { return tree_type::insert_unique_check(key, key_value_comp, commit_data); } |
| |
| //! @copydoc ::boost::intrusive::avltree::insert_unique_check(const_iterator,const KeyType&,KeyValueCompare,insert_commit_data&) |
| template<class KeyType, class KeyValueCompare> |
| std::pair<iterator, bool> insert_check |
| (const_iterator hint, const KeyType &key |
| ,KeyValueCompare key_value_comp, insert_commit_data &commit_data) |
| { return tree_type::insert_unique_check(hint, key, key_value_comp, commit_data); } |
| |
| //! @copydoc ::boost::intrusive::avltree::insert_unique(Iterator,Iterator) |
| template<class Iterator> |
| void insert(Iterator b, Iterator e) |
| { tree_type::insert_unique(b, e); } |
| |
| //! @copydoc ::boost::intrusive::avltree::insert_unique_commit |
| iterator insert_commit(reference value, const insert_commit_data &commit_data) |
| { return tree_type::insert_unique_commit(value, commit_data); } |
| |
| #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| //! @copydoc ::boost::intrusive::avltree::insert_before |
| iterator insert_before(const_iterator pos, reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::push_back |
| void push_back(reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::push_front |
| void push_front(reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase(const_iterator) |
| iterator erase(const_iterator i); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase(const_iterator,const_iterator) |
| iterator erase(const_iterator b, const_iterator e); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase(const_reference) |
| size_type erase(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase(const KeyType&,KeyValueCompare) |
| template<class KeyType, class KeyValueCompare> |
| size_type erase(const KeyType& key, KeyValueCompare comp); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase_and_dispose(const_iterator,Disposer) |
| template<class Disposer> |
| iterator erase_and_dispose(const_iterator i, Disposer disposer); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase_and_dispose(const_iterator,const_iterator,Disposer) |
| template<class Disposer> |
| iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase_and_dispose(const_reference, Disposer) |
| template<class Disposer> |
| size_type erase_and_dispose(const_reference value, Disposer disposer); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase_and_dispose(const KeyType&,KeyValueCompare,Disposer) |
| template<class KeyType, class KeyValueCompare, class Disposer> |
| size_type erase_and_dispose(const KeyType& key, KeyValueCompare comp, Disposer disposer); |
| |
| //! @copydoc ::boost::intrusive::avltree::clear |
| void clear(); |
| |
| //! @copydoc ::boost::intrusive::avltree::clear_and_dispose |
| template<class Disposer> |
| void clear_and_dispose(Disposer disposer); |
| |
| #endif // #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| |
| //! @copydoc ::boost::intrusive::avltree::count(const_reference)const |
| size_type count(const_reference value) const |
| { return static_cast<size_type>(this->tree_type::find(value) != this->tree_type::cend()); } |
| |
| //! @copydoc ::boost::intrusive::avltree::count(const KeyType&,KeyValueCompare)const |
| template<class KeyType, class KeyValueCompare> |
| size_type count(const KeyType& key, KeyValueCompare comp) const |
| { return static_cast<size_type>(this->tree_type::find(key, comp) != this->tree_type::cend()); } |
| |
| #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| |
| //! @copydoc ::boost::intrusive::avltree::lower_bound(const_reference) |
| iterator lower_bound(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::lower_bound(const KeyType&,KeyValueCompare) |
| template<class KeyType, class KeyValueCompare> |
| iterator lower_bound(const KeyType& key, KeyValueCompare comp); |
| |
| //! @copydoc ::boost::intrusive::avltree::lower_bound(const_reference)const |
| const_iterator lower_bound(const_reference value) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::lower_bound(const KeyType&,KeyValueCompare)const |
| template<class KeyType, class KeyValueCompare> |
| const_iterator lower_bound(const KeyType& key, KeyValueCompare comp) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::upper_bound(const_reference) |
| iterator upper_bound(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::upper_bound(const KeyType&,KeyValueCompare) |
| template<class KeyType, class KeyValueCompare> |
| iterator upper_bound(const KeyType& key, KeyValueCompare comp); |
| |
| //! @copydoc ::boost::intrusive::avltree::upper_bound(const_reference)const |
| const_iterator upper_bound(const_reference value) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::upper_bound(const KeyType&,KeyValueCompare)const |
| template<class KeyType, class KeyValueCompare> |
| const_iterator upper_bound(const KeyType& key, KeyValueCompare comp) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::find(const_reference) |
| iterator find(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::find(const KeyType&,KeyValueCompare) |
| template<class KeyType, class KeyValueCompare> |
| iterator find(const KeyType& key, KeyValueCompare comp); |
| |
| //! @copydoc ::boost::intrusive::avltree::find(const_reference)const |
| const_iterator find(const_reference value) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::find(const KeyType&,KeyValueCompare)const |
| template<class KeyType, class KeyValueCompare> |
| const_iterator find(const KeyType& key, KeyValueCompare comp) const; |
| |
| #endif // #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| |
| //! @copydoc ::boost::intrusive::rbtree::equal_range(const_reference) |
| std::pair<iterator,iterator> equal_range(const_reference value) |
| { return this->tree_type::lower_bound_range(value); } |
| |
| //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyValueCompare) |
| template<class KeyType, class KeyValueCompare> |
| std::pair<iterator,iterator> equal_range(const KeyType& key, KeyValueCompare comp) |
| { return this->tree_type::lower_bound_range(key, comp); } |
| |
| //! @copydoc ::boost::intrusive::rbtree::equal_range(const_reference)const |
| std::pair<const_iterator, const_iterator> |
| equal_range(const_reference value) const |
| { return this->tree_type::lower_bound_range(value); } |
| |
| //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyValueCompare)const |
| template<class KeyType, class KeyValueCompare> |
| std::pair<const_iterator, const_iterator> |
| equal_range(const KeyType& key, KeyValueCompare comp) const |
| { return this->tree_type::lower_bound_range(key, comp); } |
| |
| #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| |
| //! @copydoc ::boost::intrusive::avltree::bounded_range(const_reference,const_reference,bool,bool) |
| std::pair<iterator,iterator> bounded_range |
| (const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed); |
| |
| //! @copydoc ::boost::intrusive::avltree::bounded_range(const KeyType&,const KeyType&,KeyValueCompare,bool,bool) |
| template<class KeyType, class KeyValueCompare> |
| std::pair<iterator,iterator> bounded_range |
| (const KeyType& lower_key, const KeyType& upper_key, KeyValueCompare comp, bool left_closed, bool right_closed); |
| |
| //! @copydoc ::boost::intrusive::avltree::bounded_range(const_reference,const_reference,bool,bool)const |
| std::pair<const_iterator, const_iterator> |
| bounded_range(const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::bounded_range(const KeyType&,const KeyType&,KeyValueCompare,bool,bool)const |
| template<class KeyType, class KeyValueCompare> |
| std::pair<const_iterator, const_iterator> bounded_range |
| (const KeyType& lower_key, const KeyType& upper_key, KeyValueCompare comp, bool left_closed, bool right_closed) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::s_iterator_to(reference) |
| static iterator s_iterator_to(reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::s_iterator_to(const_reference) |
| static const_iterator s_iterator_to(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::iterator_to(reference) |
| iterator iterator_to(reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::iterator_to(const_reference)const |
| const_iterator iterator_to(const_reference value) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::init_node(reference) |
| static void init_node(reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::unlink_leftmost_without_rebalance |
| pointer unlink_leftmost_without_rebalance(); |
| |
| //! @copydoc ::boost::intrusive::avltree::replace_node |
| void replace_node(iterator replace_this, reference with_this); |
| |
| //! @copydoc ::boost::intrusive::avltree::remove_node |
| void remove_node(reference value); |
| #endif //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| }; |
| |
| #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) |
| |
| template<class T, class ...Options> |
| bool operator!= (const avl_set_impl<T, Options...> &x, const avl_set_impl<T, Options...> &y); |
| |
| template<class T, class ...Options> |
| bool operator>(const avl_set_impl<T, Options...> &x, const avl_set_impl<T, Options...> &y); |
| |
| template<class T, class ...Options> |
| bool operator<=(const avl_set_impl<T, Options...> &x, const avl_set_impl<T, Options...> &y); |
| |
| template<class T, class ...Options> |
| bool operator>=(const avl_set_impl<T, Options...> &x, const avl_set_impl<T, Options...> &y); |
| |
| template<class T, class ...Options> |
| void swap(avl_set_impl<T, Options...> &x, avl_set_impl<T, Options...> &y); |
| |
| #endif //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) |
| |
| //! Helper metafunction to define a \c set that yields to the same type when the |
| //! same options (either explicitly or implicitly) are used. |
| #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) |
| template<class T, class ...Options> |
| #else |
| template<class T, class O1 = void, class O2 = void |
| , class O3 = void, class O4 = void |
| , class O5 = void> |
| #endif |
| struct make_avl_set |
| { |
| /// @cond |
| typedef typename pack_options |
| < avltree_defaults, |
| #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) |
| O1, O2, O3, O4, O5 |
| #else |
| Options... |
| #endif |
| >::type packed_options; |
| |
| typedef typename detail::get_value_traits |
| <T, typename packed_options::proto_value_traits>::type value_traits; |
| |
| typedef avl_set_impl |
| < value_traits |
| , typename packed_options::compare |
| , typename packed_options::size_type |
| , packed_options::constant_time_size |
| , typename packed_options::header_holder_type |
| > implementation_defined; |
| /// @endcond |
| typedef implementation_defined type; |
| }; |
| |
| #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) |
| template<class T, class O1, class O2, class O3, class O4, class O5> |
| #else |
| template<class T, class ...Options> |
| #endif |
| class avl_set |
| : public make_avl_set<T, |
| #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) |
| O1, O2, O3, O4, O5 |
| #else |
| Options... |
| #endif |
| >::type |
| { |
| typedef typename make_avl_set |
| <T, |
| #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) |
| O1, O2, O3, O4, O5 |
| #else |
| Options... |
| #endif |
| >::type Base; |
| |
| BOOST_MOVABLE_BUT_NOT_COPYABLE(avl_set) |
| public: |
| typedef typename Base::value_compare value_compare; |
| typedef typename Base::value_traits value_traits; |
| typedef typename Base::iterator iterator; |
| typedef typename Base::const_iterator const_iterator; |
| |
| //Assert if passed value traits are compatible with the type |
| BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value)); |
| |
| explicit avl_set( const value_compare &cmp = value_compare() |
| , const value_traits &v_traits = value_traits()) |
| : Base(cmp, v_traits) |
| {} |
| |
| template<class Iterator> |
| avl_set( Iterator b, Iterator e |
| , const value_compare &cmp = value_compare() |
| , const value_traits &v_traits = value_traits()) |
| : Base(b, e, cmp, v_traits) |
| {} |
| |
| avl_set(BOOST_RV_REF(avl_set) x) |
| : Base(BOOST_MOVE_BASE(Base, x)) |
| {} |
| |
| avl_set& operator=(BOOST_RV_REF(avl_set) x) |
| { return static_cast<avl_set &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x))); } |
| |
| static avl_set &container_from_end_iterator(iterator end_iterator) |
| { return static_cast<avl_set &>(Base::container_from_end_iterator(end_iterator)); } |
| |
| static const avl_set &container_from_end_iterator(const_iterator end_iterator) |
| { return static_cast<const avl_set &>(Base::container_from_end_iterator(end_iterator)); } |
| |
| static avl_set &container_from_iterator(iterator it) |
| { return static_cast<avl_set &>(Base::container_from_iterator(it)); } |
| |
| static const avl_set &container_from_iterator(const_iterator it) |
| { return static_cast<const avl_set &>(Base::container_from_iterator(it)); } |
| }; |
| |
| #endif |
| |
| //! The class template avl_multiset is an intrusive container, that mimics most of |
| //! the interface of std::_multiset as described in the C++ standard. |
| //! |
| //! The template parameter \c T is the type to be managed by the container. |
| //! The user can specify additional options and if no options are provided |
| //! default options are used. |
| //! |
| //! The container supports the following options: |
| //! \c base_hook<>/member_hook<>/value_traits<>, |
| //! \c constant_time_size<>, \c size_type<> and |
| //! \c compare<>. |
| #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) |
| template<class T, class ...Options> |
| #else |
| template<class ValueTraits, class Compare, class SizeType, bool ConstantTimeSize, typename HeaderHolder> |
| #endif |
| class avl_multiset_impl |
| #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| : public bstree_impl<ValueTraits, Compare, SizeType, ConstantTimeSize, AvlTreeAlgorithms, HeaderHolder> |
| #endif |
| { |
| /// @cond |
| typedef bstree_impl<ValueTraits, Compare, SizeType, ConstantTimeSize, AvlTreeAlgorithms, HeaderHolder> tree_type; |
| |
| BOOST_MOVABLE_BUT_NOT_COPYABLE(avl_multiset_impl) |
| typedef tree_type implementation_defined; |
| /// @endcond |
| |
| public: |
| typedef typename implementation_defined::value_type value_type; |
| typedef typename implementation_defined::value_traits value_traits; |
| typedef typename implementation_defined::pointer pointer; |
| typedef typename implementation_defined::const_pointer const_pointer; |
| typedef typename implementation_defined::reference reference; |
| typedef typename implementation_defined::const_reference const_reference; |
| typedef typename implementation_defined::difference_type difference_type; |
| typedef typename implementation_defined::size_type size_type; |
| typedef typename implementation_defined::value_compare value_compare; |
| typedef typename implementation_defined::key_compare key_compare; |
| typedef typename implementation_defined::iterator iterator; |
| typedef typename implementation_defined::const_iterator const_iterator; |
| typedef typename implementation_defined::reverse_iterator reverse_iterator; |
| typedef typename implementation_defined::const_reverse_iterator const_reverse_iterator; |
| typedef typename implementation_defined::insert_commit_data insert_commit_data; |
| typedef typename implementation_defined::node_traits node_traits; |
| typedef typename implementation_defined::node node; |
| typedef typename implementation_defined::node_ptr node_ptr; |
| typedef typename implementation_defined::const_node_ptr const_node_ptr; |
| typedef typename implementation_defined::node_algorithms node_algorithms; |
| |
| static const bool constant_time_size = tree_type::constant_time_size; |
| |
| public: |
| //! @copydoc ::boost::intrusive::avltree::avltree(const value_compare &,const value_traits &) |
| explicit avl_multiset_impl( const value_compare &cmp = value_compare() |
| , const value_traits &v_traits = value_traits()) |
| : tree_type(cmp, v_traits) |
| {} |
| |
| //! @copydoc ::boost::intrusive::avltree::avltree(bool,Iterator,Iterator,const value_compare &,const value_traits &) |
| template<class Iterator> |
| avl_multiset_impl( Iterator b, Iterator e |
| , const value_compare &cmp = value_compare() |
| , const value_traits &v_traits = value_traits()) |
| : tree_type(false, b, e, cmp, v_traits) |
| {} |
| |
| //! @copydoc ::boost::intrusive::avltree::avltree(avltree &&) |
| avl_multiset_impl(BOOST_RV_REF(avl_multiset_impl) x) |
| : tree_type(BOOST_MOVE_BASE(tree_type, x)) |
| {} |
| |
| //! @copydoc ::boost::intrusive::avltree::operator=(avltree &&) |
| avl_multiset_impl& operator=(BOOST_RV_REF(avl_multiset_impl) x) |
| { return static_cast<avl_multiset_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); } |
| |
| #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| //! @copydoc ::boost::intrusive::avltree::~avltree() |
| ~avl_multiset_impl(); |
| |
| //! @copydoc ::boost::intrusive::avltree::begin() |
| iterator begin(); |
| |
| //! @copydoc ::boost::intrusive::avltree::begin()const |
| const_iterator begin() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::cbegin()const |
| const_iterator cbegin() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::end() |
| iterator end(); |
| |
| //! @copydoc ::boost::intrusive::avltree::end()const |
| const_iterator end() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::cend()const |
| const_iterator cend() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::rbegin() |
| reverse_iterator rbegin(); |
| |
| //! @copydoc ::boost::intrusive::avltree::rbegin()const |
| const_reverse_iterator rbegin() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::crbegin()const |
| const_reverse_iterator crbegin() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::rend() |
| reverse_iterator rend(); |
| |
| //! @copydoc ::boost::intrusive::avltree::rend()const |
| const_reverse_iterator rend() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::crend()const |
| const_reverse_iterator crend() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::container_from_end_iterator(iterator) |
| static avl_multiset_impl &container_from_end_iterator(iterator end_iterator); |
| |
| //! @copydoc ::boost::intrusive::avltree::container_from_end_iterator(const_iterator) |
| static const avl_multiset_impl &container_from_end_iterator(const_iterator end_iterator); |
| |
| //! @copydoc ::boost::intrusive::avltree::container_from_iterator(iterator) |
| static avl_multiset_impl &container_from_iterator(iterator it); |
| |
| //! @copydoc ::boost::intrusive::avltree::container_from_iterator(const_iterator) |
| static const avl_multiset_impl &container_from_iterator(const_iterator it); |
| |
| //! @copydoc ::boost::intrusive::avltree::key_comp()const |
| key_compare key_comp() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::value_comp()const |
| value_compare value_comp() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::empty()const |
| bool empty() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::size()const |
| size_type size() const; |
| |
| //! @copydoc ::boost::intrusive::avltree::swap |
| void swap(avl_multiset_impl& other); |
| |
| //! @copydoc ::boost::intrusive::avltree::clone_from |
| template <class Cloner, class Disposer> |
| void clone_from(const avl_multiset_impl &src, Cloner cloner, Disposer disposer); |
| |
| #endif //#ifdef BOOST_iNTRUSIVE_DOXYGEN_INVOKED |
| |
| //! @copydoc ::boost::intrusive::avltree::insert_equal(reference) |
| iterator insert(reference value) |
| { return tree_type::insert_equal(value); } |
| |
| //! @copydoc ::boost::intrusive::avltree::insert_equal(const_iterator,reference) |
| iterator insert(const_iterator hint, reference value) |
| { return tree_type::insert_equal(hint, value); } |
| |
| //! @copydoc ::boost::intrusive::avltree::insert_equal(Iterator,Iterator) |
| template<class Iterator> |
| void insert(Iterator b, Iterator e) |
| { tree_type::insert_equal(b, e); } |
| |
| #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| //! @copydoc ::boost::intrusive::avltree::insert_before |
| iterator insert_before(const_iterator pos, reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::push_back |
| void push_back(reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::push_front |
| void push_front(reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase(const_iterator) |
| iterator erase(const_iterator i); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase(const_iterator,const_iterator) |
| iterator erase(const_iterator b, const_iterator e); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase(const_reference) |
| size_type erase(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase(const KeyType&,KeyValueCompare) |
| template<class KeyType, class KeyValueCompare> |
| size_type erase(const KeyType& key, KeyValueCompare comp); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase_and_dispose(const_iterator,Disposer) |
| template<class Disposer> |
| iterator erase_and_dispose(const_iterator i, Disposer disposer); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase_and_dispose(const_iterator,const_iterator,Disposer) |
| template<class Disposer> |
| iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase_and_dispose(const_reference, Disposer) |
| template<class Disposer> |
| size_type erase_and_dispose(const_reference value, Disposer disposer); |
| |
| //! @copydoc ::boost::intrusive::avltree::erase_and_dispose(const KeyType&,KeyValueCompare,Disposer) |
| template<class KeyType, class KeyValueCompare, class Disposer> |
| size_type erase_and_dispose(const KeyType& key, KeyValueCompare comp, Disposer disposer); |
| |
| //! @copydoc ::boost::intrusive::avltree::clear |
| void clear(); |
| |
| //! @copydoc ::boost::intrusive::avltree::clear_and_dispose |
| template<class Disposer> |
| void clear_and_dispose(Disposer disposer); |
| |
| //! @copydoc ::boost::intrusive::avltree::count(const_reference)const |
| size_type count(const_reference value) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::count(const KeyType&,KeyValueCompare)const |
| template<class KeyType, class KeyValueCompare> |
| size_type count(const KeyType& key, KeyValueCompare comp) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::lower_bound(const_reference) |
| iterator lower_bound(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::lower_bound(const KeyType&,KeyValueCompare) |
| template<class KeyType, class KeyValueCompare> |
| iterator lower_bound(const KeyType& key, KeyValueCompare comp); |
| |
| //! @copydoc ::boost::intrusive::avltree::lower_bound(const_reference)const |
| const_iterator lower_bound(const_reference value) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::lower_bound(const KeyType&,KeyValueCompare)const |
| template<class KeyType, class KeyValueCompare> |
| const_iterator lower_bound(const KeyType& key, KeyValueCompare comp) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::upper_bound(const_reference) |
| iterator upper_bound(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::upper_bound(const KeyType&,KeyValueCompare) |
| template<class KeyType, class KeyValueCompare> |
| iterator upper_bound(const KeyType& key, KeyValueCompare comp); |
| |
| //! @copydoc ::boost::intrusive::avltree::upper_bound(const_reference)const |
| const_iterator upper_bound(const_reference value) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::upper_bound(const KeyType&,KeyValueCompare)const |
| template<class KeyType, class KeyValueCompare> |
| const_iterator upper_bound(const KeyType& key, KeyValueCompare comp) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::find(const_reference) |
| iterator find(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::find(const KeyType&,KeyValueCompare) |
| template<class KeyType, class KeyValueCompare> |
| iterator find(const KeyType& key, KeyValueCompare comp); |
| |
| //! @copydoc ::boost::intrusive::avltree::find(const_reference)const |
| const_iterator find(const_reference value) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::find(const KeyType&,KeyValueCompare)const |
| template<class KeyType, class KeyValueCompare> |
| const_iterator find(const KeyType& key, KeyValueCompare comp) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::equal_range(const_reference) |
| std::pair<iterator,iterator> equal_range(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::equal_range(const KeyType&,KeyValueCompare) |
| template<class KeyType, class KeyValueCompare> |
| std::pair<iterator,iterator> equal_range(const KeyType& key, KeyValueCompare comp); |
| |
| //! @copydoc ::boost::intrusive::avltree::equal_range(const_reference)const |
| std::pair<const_iterator, const_iterator> |
| equal_range(const_reference value) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::equal_range(const KeyType&,KeyValueCompare)const |
| template<class KeyType, class KeyValueCompare> |
| std::pair<const_iterator, const_iterator> |
| equal_range(const KeyType& key, KeyValueCompare comp) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::bounded_range(const_reference,const_reference,bool,bool) |
| std::pair<iterator,iterator> bounded_range |
| (const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed); |
| |
| //! @copydoc ::boost::intrusive::avltree::bounded_range(const KeyType&,const KeyType&,KeyValueCompare,bool,bool) |
| template<class KeyType, class KeyValueCompare> |
| std::pair<iterator,iterator> bounded_range |
| (const KeyType& lower_key, const KeyType& upper_key, KeyValueCompare comp, bool left_closed, bool right_closed); |
| |
| //! @copydoc ::boost::intrusive::avltree::bounded_range(const_reference,const_reference,bool,bool)const |
| std::pair<const_iterator, const_iterator> |
| bounded_range(const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::bounded_range(const KeyType&,const KeyType&,KeyValueCompare,bool,bool)const |
| template<class KeyType, class KeyValueCompare> |
| std::pair<const_iterator, const_iterator> bounded_range |
| (const KeyType& lower_key, const KeyType& upper_key, KeyValueCompare comp, bool left_closed, bool right_closed) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::s_iterator_to(reference) |
| static iterator s_iterator_to(reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::s_iterator_to(const_reference) |
| static const_iterator s_iterator_to(const_reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::iterator_to(reference) |
| iterator iterator_to(reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::iterator_to(const_reference)const |
| const_iterator iterator_to(const_reference value) const; |
| |
| //! @copydoc ::boost::intrusive::avltree::init_node(reference) |
| static void init_node(reference value); |
| |
| //! @copydoc ::boost::intrusive::avltree::unlink_leftmost_without_rebalance |
| pointer unlink_leftmost_without_rebalance(); |
| |
| //! @copydoc ::boost::intrusive::avltree::replace_node |
| void replace_node(iterator replace_this, reference with_this); |
| |
| //! @copydoc ::boost::intrusive::avltree::remove_node |
| void remove_node(reference value); |
| #endif //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| }; |
| |
| #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) |
| |
| template<class T, class ...Options> |
| bool operator!= (const avl_multiset_impl<T, Options...> &x, const avl_multiset_impl<T, Options...> &y); |
| |
| template<class T, class ...Options> |
| bool operator>(const avl_multiset_impl<T, Options...> &x, const avl_multiset_impl<T, Options...> &y); |
| |
| template<class T, class ...Options> |
| bool operator<=(const avl_multiset_impl<T, Options...> &x, const avl_multiset_impl<T, Options...> &y); |
| |
| template<class T, class ...Options> |
| bool operator>=(const avl_multiset_impl<T, Options...> &x, const avl_multiset_impl<T, Options...> &y); |
| |
| template<class T, class ...Options> |
| void swap(avl_multiset_impl<T, Options...> &x, avl_multiset_impl<T, Options...> &y); |
| |
| #endif //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) |
| |
| //! Helper metafunction to define a \c avl_multiset that yields to the same type when the |
| //! same options (either explicitly or implicitly) are used. |
| #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) |
| template<class T, class ...Options> |
| #else |
| template<class T, class O1 = void, class O2 = void |
| , class O3 = void, class O4 = void |
| , class O5 = void> |
| #endif |
| struct make_avl_multiset |
| { |
| /// @cond |
| typedef typename pack_options |
| < avltree_defaults, |
| #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) |
| O1, O2, O3, O4, O5 |
| #else |
| Options... |
| #endif |
| >::type packed_options; |
| |
| typedef typename detail::get_value_traits |
| <T, typename packed_options::proto_value_traits>::type value_traits; |
| |
| typedef avl_multiset_impl |
| < value_traits |
| , typename packed_options::compare |
| , typename packed_options::size_type |
| , packed_options::constant_time_size |
| , typename packed_options::header_holder_type |
| > implementation_defined; |
| /// @endcond |
| typedef implementation_defined type; |
| }; |
| |
| #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED |
| |
| #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) |
| template<class T, class O1, class O2, class O3, class O4, class O5> |
| #else |
| template<class T, class ...Options> |
| #endif |
| class avl_multiset |
| : public make_avl_multiset<T, |
| #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) |
| O1, O2, O3, O4, O5 |
| #else |
| Options... |
| #endif |
| >::type |
| { |
| typedef typename make_avl_multiset<T, |
| #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES) |
| O1, O2, O3, O4, O5 |
| #else |
| Options... |
| #endif |
| >::type Base; |
| |
| BOOST_MOVABLE_BUT_NOT_COPYABLE(avl_multiset) |
| |
| public: |
| typedef typename Base::value_compare value_compare; |
| typedef typename Base::value_traits value_traits; |
| typedef typename Base::iterator iterator; |
| typedef typename Base::const_iterator const_iterator; |
| |
| //Assert if passed value traits are compatible with the type |
| BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value)); |
| |
| explicit avl_multiset( const value_compare &cmp = value_compare() |
| , const value_traits &v_traits = value_traits()) |
| : Base(cmp, v_traits) |
| {} |
| |
| template<class Iterator> |
| avl_multiset( Iterator b, Iterator e |
| , const value_compare &cmp = value_compare() |
| , const value_traits &v_traits = value_traits()) |
| : Base(b, e, cmp, v_traits) |
| {} |
| |
| avl_multiset(BOOST_RV_REF(avl_multiset) x) |
| : Base(BOOST_MOVE_BASE(Base, x)) |
| {} |
| |
| avl_multiset& operator=(BOOST_RV_REF(avl_multiset) x) |
| { return static_cast<avl_multiset &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x))); } |
| |
| static avl_multiset &container_from_end_iterator(iterator end_iterator) |
| { return static_cast<avl_multiset &>(Base::container_from_end_iterator(end_iterator)); } |
| |
| static const avl_multiset &container_from_end_iterator(const_iterator end_iterator) |
| { return static_cast<const avl_multiset &>(Base::container_from_end_iterator(end_iterator)); } |
| |
| static avl_multiset &container_from_iterator(iterator it) |
| { return static_cast<avl_multiset &>(Base::container_from_iterator(it)); } |
| |
| static const avl_multiset &container_from_iterator(const_iterator it) |
| { return static_cast<const avl_multiset &>(Base::container_from_iterator(it)); } |
| }; |
| |
| #endif |
| |
| } //namespace intrusive |
| } //namespace boost |
| |
| #include <boost/intrusive/detail/config_end.hpp> |
| |
| #endif //BOOST_INTRUSIVE_AVL_SET_HPP |
