Chris@16: /////////////////////////////////////////////////////////////////////////////
Chris@16: //
Chris@101: // (C) Copyright Ion Gaztanaga  2007-2014
Chris@16: //
Chris@16: // Distributed under the Boost Software License, Version 1.0.
Chris@16: //    (See accompanying file LICENSE_1_0.txt or copy at
Chris@16: //          http://www.boost.org/LICENSE_1_0.txt)
Chris@16: //
Chris@16: // See http://www.boost.org/libs/intrusive for documentation.
Chris@16: //
Chris@16: /////////////////////////////////////////////////////////////////////////////
Chris@16: #ifndef BOOST_INTRUSIVE_SPLAYTREE_HPP
Chris@16: #define BOOST_INTRUSIVE_SPLAYTREE_HPP
Chris@16: 
Chris@16: #include <boost/intrusive/detail/config_begin.hpp>
Chris@101: #include <boost/intrusive/intrusive_fwd.hpp>
Chris@16: #include <cstddef>
Chris@101: #include <boost/intrusive/detail/minimal_less_equal_header.hpp>
Chris@101: #include <boost/intrusive/detail/minimal_pair_header.hpp>   //std::pair
Chris@16: 
Chris@16: #include <boost/static_assert.hpp>
Chris@16: #include <boost/intrusive/bstree.hpp>
Chris@16: #include <boost/intrusive/detail/tree_node.hpp>
Chris@16: #include <boost/intrusive/detail/mpl.hpp>
Chris@16: #include <boost/intrusive/pointer_traits.hpp>
Chris@16: #include <boost/intrusive/detail/function_detector.hpp>
Chris@101: #include <boost/intrusive/detail/get_value_traits.hpp>
Chris@16: #include <boost/intrusive/splaytree_algorithms.hpp>
Chris@16: #include <boost/intrusive/link_mode.hpp>
Chris@101: #include <boost/intrusive/detail/key_nodeptr_comp.hpp>
Chris@101: #include <boost/move/utility_core.hpp>
Chris@101: 
Chris@101: #if defined(BOOST_HAS_PRAGMA_ONCE)
Chris@101: #  pragma once
Chris@101: #endif
Chris@16: 
Chris@16: namespace boost {
Chris@16: namespace intrusive {
Chris@16: 
Chris@16: /// @cond
Chris@16: 
Chris@16: struct splaytree_defaults
Chris@16: {
Chris@101:    typedef default_bstree_hook_applier proto_value_traits;
Chris@16:    static const bool constant_time_size = true;
Chris@16:    typedef std::size_t size_type;
Chris@16:    typedef void compare;
Chris@101:    typedef void header_holder_type;
Chris@16: };
Chris@16: 
Chris@16: /// @endcond
Chris@16: 
Chris@16: //! The class template splaytree is an intrusive splay tree container that
Chris@16: //! is used to construct intrusive splay_set and splay_multiset containers. The no-throw
Chris@16: //! guarantee holds only, if the value_compare object
Chris@16: //! doesn't throw.
Chris@16: //!
Chris@16: //! The template parameter \c T is the type to be managed by the container.
Chris@16: //! The user can specify additional options and if no options are provided
Chris@16: //! default options are used.
Chris@16: //!
Chris@16: //! The container supports the following options:
Chris@16: //! \c base_hook<>/member_hook<>/value_traits<>,
Chris@16: //! \c constant_time_size<>, \c size_type<> and
Chris@16: //! \c compare<>.
Chris@16: #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
Chris@16: template<class T, class ...Options>
Chris@16: #else
Chris@101: template<class ValueTraits, class VoidOrKeyComp, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
Chris@16: #endif
Chris@16: class splaytree_impl
Chris@16:    /// @cond
Chris@101:    :  public bstree_impl<ValueTraits, VoidOrKeyComp, SizeType, ConstantTimeSize, SplayTreeAlgorithms, HeaderHolder>
Chris@16:    /// @endcond
Chris@16: {
Chris@16:    public:
Chris@16:    typedef ValueTraits                                               value_traits;
Chris@16:    /// @cond
Chris@16:    typedef bstree_impl< ValueTraits, VoidOrKeyComp, SizeType
Chris@101:                       , ConstantTimeSize, SplayTreeAlgorithms
Chris@101:                       , HeaderHolder>                                tree_type;
Chris@16:    typedef tree_type                                                 implementation_defined;
Chris@16:    /// @endcond
Chris@16: 
Chris@16:    typedef typename implementation_defined::pointer                  pointer;
Chris@16:    typedef typename implementation_defined::const_pointer            const_pointer;
Chris@16:    typedef typename implementation_defined::value_type               value_type;
Chris@16:    typedef typename implementation_defined::key_type                 key_type;
Chris@16:    typedef typename implementation_defined::reference                reference;
Chris@16:    typedef typename implementation_defined::const_reference          const_reference;
Chris@16:    typedef typename implementation_defined::difference_type          difference_type;
Chris@16:    typedef typename implementation_defined::size_type                size_type;
Chris@16:    typedef typename implementation_defined::value_compare            value_compare;
Chris@16:    typedef typename implementation_defined::key_compare              key_compare;
Chris@16:    typedef typename implementation_defined::iterator                 iterator;
Chris@16:    typedef typename implementation_defined::const_iterator           const_iterator;
Chris@16:    typedef typename implementation_defined::reverse_iterator         reverse_iterator;
Chris@16:    typedef typename implementation_defined::const_reverse_iterator   const_reverse_iterator;
Chris@16:    typedef typename implementation_defined::node_traits              node_traits;
Chris@16:    typedef typename implementation_defined::node                     node;
Chris@16:    typedef typename implementation_defined::node_ptr                 node_ptr;
Chris@16:    typedef typename implementation_defined::const_node_ptr           const_node_ptr;
Chris@16:    typedef typename implementation_defined::node_algorithms          node_algorithms;
Chris@16: 
Chris@16:    static const bool constant_time_size = implementation_defined::constant_time_size;
Chris@16:    /// @cond
Chris@16:    private:
Chris@16: 
Chris@16:    //noncopyable
Chris@16:    BOOST_MOVABLE_BUT_NOT_COPYABLE(splaytree_impl)
Chris@16: 
Chris@16:    /// @endcond
Chris@16: 
Chris@16:    public:
Chris@16: 
Chris@16:    typedef typename implementation_defined::insert_commit_data insert_commit_data;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::bstree(const value_compare &,const value_traits &)
Chris@16:    explicit splaytree_impl( const value_compare &cmp = value_compare()
Chris@16:                           , const value_traits &v_traits = value_traits())
Chris@16:       :  tree_type(cmp, v_traits)
Chris@16:    {}
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::bstree(bool,Iterator,Iterator,const value_compare &,const value_traits &)
Chris@16:    template<class Iterator>
Chris@16:    splaytree_impl( bool unique, Iterator b, Iterator e
Chris@16:               , const value_compare &cmp     = value_compare()
Chris@16:               , const value_traits &v_traits = value_traits())
Chris@16:       : tree_type(cmp, v_traits)
Chris@16:    {
Chris@16:       if(unique)
Chris@16:          this->insert_unique(b, e);
Chris@16:       else
Chris@16:          this->insert_equal(b, e);
Chris@16:    }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::bstree(bstree &&)
Chris@16:    splaytree_impl(BOOST_RV_REF(splaytree_impl) x)
Chris@101:       :  tree_type(BOOST_MOVE_BASE(tree_type, x))
Chris@16:    {}
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::operator=(bstree &&)
Chris@16:    splaytree_impl& operator=(BOOST_RV_REF(splaytree_impl) x)
Chris@101:    {  return static_cast<splaytree_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); }
Chris@16: 
Chris@16:    #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@16:    //! @copydoc ::boost::intrusive::bstree::~bstree()
Chris@16:    ~splaytree_impl();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::begin()
Chris@16:    iterator begin();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::begin()const
Chris@16:    const_iterator begin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::cbegin()const
Chris@16:    const_iterator cbegin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::end()
Chris@16:    iterator end();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::end()const
Chris@16:    const_iterator end() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::cend()const
Chris@16:    const_iterator cend() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::rbegin()
Chris@16:    reverse_iterator rbegin();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::rbegin()const
Chris@16:    const_reverse_iterator rbegin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::crbegin()const
Chris@16:    const_reverse_iterator crbegin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::rend()
Chris@16:    reverse_iterator rend();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::rend()const
Chris@16:    const_reverse_iterator rend() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::crend()const
Chris@16:    const_reverse_iterator crend() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(iterator)
Chris@16:    static splaytree_impl &container_from_end_iterator(iterator end_iterator);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::container_from_end_iterator(const_iterator)
Chris@16:    static const splaytree_impl &container_from_end_iterator(const_iterator end_iterator);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::container_from_iterator(iterator)
Chris@16:    static splaytree_impl &container_from_iterator(iterator it);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::container_from_iterator(const_iterator)
Chris@16:    static const splaytree_impl &container_from_iterator(const_iterator it);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::key_comp()const
Chris@16:    key_compare key_comp() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::value_comp()const
Chris@16:    value_compare value_comp() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::empty()const
Chris@16:    bool empty() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::size()const
Chris@16:    size_type size() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::swap
Chris@16:    void swap(splaytree_impl& other);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::clone_from
Chris@16:    template <class Cloner, class Disposer>
Chris@16:    void clone_from(const splaytree_impl &src, Cloner cloner, Disposer disposer);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::insert_equal(reference)
Chris@16:    iterator insert_equal(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::insert_equal(const_iterator,reference)
Chris@16:    iterator insert_equal(const_iterator hint, reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::insert_equal(Iterator,Iterator)
Chris@16:    template<class Iterator>
Chris@16:    void insert_equal(Iterator b, Iterator e);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::insert_unique(reference)
Chris@16:    std::pair<iterator, bool> insert_unique(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::insert_unique(const_iterator,reference)
Chris@16:    iterator insert_unique(const_iterator hint, reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const KeyType&,KeyValueCompare,insert_commit_data&)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    std::pair<iterator, bool> insert_unique_check
Chris@16:       (const KeyType &key, KeyValueCompare key_value_comp, insert_commit_data &commit_data);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::insert_unique_check(const_iterator,const KeyType&,KeyValueCompare,insert_commit_data&)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    std::pair<iterator, bool> insert_unique_check
Chris@16:       (const_iterator hint, const KeyType &key
Chris@16:       ,KeyValueCompare key_value_comp, insert_commit_data &commit_data);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::insert_unique_commit
Chris@16:    iterator insert_unique_commit(reference value, const insert_commit_data &commit_data);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::insert_unique(Iterator,Iterator)
Chris@16:    template<class Iterator>
Chris@16:    void insert_unique(Iterator b, Iterator e);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::insert_before
Chris@16:    iterator insert_before(const_iterator pos, reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::push_back
Chris@16:    void push_back(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::push_front
Chris@16:    void push_front(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::erase(const_iterator)
Chris@16:    iterator erase(const_iterator i);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::erase(const_iterator,const_iterator)
Chris@16:    iterator erase(const_iterator b, const_iterator e);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::erase(const_reference)
Chris@16:    size_type erase(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::erase(const KeyType&,KeyValueCompare)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    size_type erase(const KeyType& key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,Disposer)
Chris@16:    template<class Disposer>
Chris@16:    iterator erase_and_dispose(const_iterator i, Disposer disposer);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_iterator,const_iterator,Disposer)
Chris@16:    template<class Disposer>
Chris@16:    iterator erase_and_dispose(const_iterator b, const_iterator e, Disposer disposer);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const_reference, Disposer)
Chris@16:    template<class Disposer>
Chris@16:    size_type erase_and_dispose(const_reference value, Disposer disposer);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::erase_and_dispose(const KeyType&,KeyValueCompare,Disposer)
Chris@16:    template<class KeyType, class KeyValueCompare, class Disposer>
Chris@16:    size_type erase_and_dispose(const KeyType& key, KeyValueCompare comp, Disposer disposer);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::clear
Chris@16:    void clear();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::clear_and_dispose
Chris@16:    template<class Disposer>
Chris@16:    void clear_and_dispose(Disposer disposer);
Chris@16: 
Chris@101:    //! @copydoc ::boost::intrusive::bstree::count(const_reference)const
Chris@101:    //! Additional note: non-const function, splaying is performed.
Chris@101:    size_type count(const_reference value);
Chris@101: 
Chris@101:    //! @copydoc ::boost::intrusive::bstree::count(const KeyType&,KeyValueCompare)const
Chris@101:    //! Additional note: non-const function, splaying is performed.
Chris@101:    template<class KeyType, class KeyValueCompare>
Chris@101:    size_type count(const KeyType &key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::count(const_reference)const
Chris@101:    //! Additional note: const function, no splaying is performed
Chris@101:    size_type count(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::count(const KeyType&,KeyValueCompare)const
Chris@101:    //! Additional note: const function, no splaying is performed
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@101:    size_type count(const KeyType &key, KeyValueCompare comp) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::lower_bound(const_reference)
Chris@101:    //! Additional note: non-const function, splaying is performed.
Chris@16:    iterator lower_bound(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::lower_bound(const_reference)const
Chris@16:    //! Additional note: const function, no splaying is performed
Chris@16:    const_iterator lower_bound(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyValueCompare)
Chris@16:    //! Additional note: non-const function, splaying is performed for the first
Chris@16:    //! element of the equal range of "key"
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    iterator lower_bound(const KeyType &key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::lower_bound(const KeyType&,KeyValueCompare)const
Chris@16:    //! Additional note: const function, no splaying is performed
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    const_iterator lower_bound(const KeyType &key, KeyValueCompare comp) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::upper_bound(const_reference)
Chris@16:    //! Additional note: non-const function, splaying is performed for the first
Chris@16:    //! element of the equal range of "value"
Chris@16:    iterator upper_bound(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::upper_bound(const_reference)const
Chris@16:    //! Additional note: const function, no splaying is performed
Chris@16:    const_iterator upper_bound(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyValueCompare)
Chris@16:    //! Additional note: non-const function, splaying is performed for the first
Chris@16:    //! element of the equal range of "key"
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    iterator upper_bound(const KeyType &key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::upper_bound(const KeyType&,KeyValueCompare)const
Chris@16:    //! Additional note: const function, no splaying is performed
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    const_iterator upper_bound(const KeyType &key, KeyValueCompare comp) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::find(const_reference)
Chris@16:    //! Additional note: non-const function, splaying is performed for the first
Chris@16:    //! element of the equal range of "value"
Chris@16:    iterator find(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::find(const_reference)const
Chris@16:    //! Additional note: const function, no splaying is performed
Chris@16:    const_iterator find(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyValueCompare)
Chris@16:    //! Additional note: non-const function, splaying is performed for the first
Chris@16:    //! element of the equal range of "key"
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    iterator find(const KeyType &key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::find(const KeyType&,KeyValueCompare)const
Chris@16:    //! Additional note: const function, no splaying is performed
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    const_iterator find(const KeyType &key, KeyValueCompare comp) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::equal_range(const_reference)
Chris@16:    //! Additional note: non-const function, splaying is performed for the first
Chris@16:    //! element of the equal range of "value"
Chris@16:    std::pair<iterator, iterator> equal_range(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::equal_range(const_reference)const
Chris@16:    //! Additional note: const function, no splaying is performed
Chris@16:    std::pair<const_iterator, const_iterator> equal_range(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyValueCompare)
Chris@16:    //! Additional note: non-const function, splaying is performed for the first
Chris@16:    //! element of the equal range of "key"
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    std::pair<iterator, iterator> equal_range(const KeyType &key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::equal_range(const KeyType&,KeyValueCompare)const
Chris@16:    //! Additional note: const function, no splaying is performed
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    std::pair<const_iterator, const_iterator> equal_range(const KeyType &key, KeyValueCompare comp) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::bounded_range(const_reference,const_reference,bool,bool)
Chris@16:    std::pair<iterator,iterator> bounded_range
Chris@16:       (const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyValueCompare,bool,bool)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    std::pair<iterator,iterator> bounded_range
Chris@16:       (const KeyType& lower_key, const KeyType& upper_key, KeyValueCompare comp, bool left_closed, bool right_closed);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::bounded_range(const_reference,const_reference,bool,bool)const
Chris@16:    std::pair<const_iterator, const_iterator> bounded_range
Chris@16:       (const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::bounded_range(const KeyType&,const KeyType&,KeyValueCompare,bool,bool)const
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    std::pair<const_iterator, const_iterator> bounded_range
Chris@16:          (const KeyType& lower_key, const KeyType& upper_key, KeyValueCompare comp, bool left_closed, bool right_closed) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::s_iterator_to(reference)
Chris@16:    static iterator s_iterator_to(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::s_iterator_to(const_reference)
Chris@16:    static const_iterator s_iterator_to(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::iterator_to(reference)
Chris@16:    iterator iterator_to(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::iterator_to(const_reference)const
Chris@16:    const_iterator iterator_to(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::init_node(reference)
Chris@16:    static void init_node(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::unlink_leftmost_without_rebalance
Chris@16:    pointer unlink_leftmost_without_rebalance();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::replace_node
Chris@16:    void replace_node(iterator replace_this, reference with_this);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::remove_node
Chris@16:    void remove_node(reference value);
Chris@16: 
Chris@16:    #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@16: 
Chris@16:    //! <b>Requires</b>: i must be a valid iterator of *this.
Chris@16:    //!
Chris@16:    //! <b>Effects</b>: Rearranges the container so that the element pointed by i
Chris@16:    //!   is placed as the root of the tree, improving future searches of this value.
Chris@16:    //!
Chris@16:    //! <b>Complexity</b>: Amortized logarithmic.
Chris@16:    //!
Chris@16:    //! <b>Throws</b>: Nothing.
Chris@16:    void splay_up(iterator i)
Chris@16:    {  return node_algorithms::splay_up(i.pointed_node(), tree_type::header_ptr());   }
Chris@16: 
Chris@16:    //! <b>Effects</b>: Rearranges the container so that if *this stores an element
Chris@16:    //!   with a key equivalent to value the element is placed as the root of the
Chris@16:    //!   tree. If the element is not present returns the last node compared with the key.
Chris@16:    //!   If the tree is empty, end() is returned.
Chris@16:    //!
Chris@16:    //! <b>Complexity</b>: Amortized logarithmic.
Chris@16:    //!
Chris@16:    //! <b>Returns</b>: An iterator to the new root of the tree, end() if the tree is empty.
Chris@16:    //!
Chris@16:    //! <b>Throws</b>: If the comparison functor throws.
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    iterator splay_down(const KeyType &key, KeyValueCompare comp)
Chris@16:    {
Chris@101:       detail::key_nodeptr_comp<value_compare, value_traits>
Chris@101:          key_node_comp(comp, &this->get_value_traits());
Chris@16:       node_ptr r = node_algorithms::splay_down(tree_type::header_ptr(), key, key_node_comp);
Chris@101:       return iterator(r, this->priv_value_traits_ptr());
Chris@16:    }
Chris@16: 
Chris@16:    //! <b>Effects</b>: Rearranges the container so that if *this stores an element
Chris@16:    //!   with a key equivalent to value the element is placed as the root of the
Chris@16:    //!   tree.
Chris@16:    //!
Chris@16:    //! <b>Complexity</b>: Amortized logarithmic.
Chris@16:    //!
Chris@16:    //! <b>Returns</b>: An iterator to the new root of the tree, end() if the tree is empty.
Chris@16:    //!
Chris@16:    //! <b>Throws</b>: If the predicate throws.
Chris@16:    iterator splay_down(const_reference value)
Chris@16:    {  return this->splay_down(value, this->value_comp());   }
Chris@16: 
Chris@16:    #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@16:    //! @copydoc ::boost::intrusive::bstree::rebalance
Chris@16:    void rebalance();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::bstree::rebalance_subtree
Chris@16:    iterator rebalance_subtree(iterator root);
Chris@16:    #endif   //#ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@16: };
Chris@16: 
Chris@16: #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator< (const splaytree_impl<T, Options...> &x, const splaytree_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator==(const splaytree_impl<T, Options...> &x, const splaytree_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator!= (const splaytree_impl<T, Options...> &x, const splaytree_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator>(const splaytree_impl<T, Options...> &x, const splaytree_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator<=(const splaytree_impl<T, Options...> &x, const splaytree_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator>=(const splaytree_impl<T, Options...> &x, const splaytree_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: void swap(splaytree_impl<T, Options...> &x, splaytree_impl<T, Options...> &y);
Chris@16: 
Chris@16: #endif   //#if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED)
Chris@16: 
Chris@16: //! Helper metafunction to define a \c splaytree that yields to the same type when the
Chris@16: //! same options (either explicitly or implicitly) are used.
Chris@16: #if defined(BOOST_INTRUSIVE_DOXYGEN_INVOKED) || defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
Chris@16: template<class T, class ...Options>
Chris@16: #else
Chris@16: template<class T, class O1 = void, class O2 = void
Chris@101:                 , class O3 = void, class O4 = void
Chris@101:                 , class O5 = void>
Chris@16: #endif
Chris@16: struct make_splaytree
Chris@16: {
Chris@16:    /// @cond
Chris@16:    typedef typename pack_options
Chris@16:       < splaytree_defaults,
Chris@16:       #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
Chris@101:       O1, O2, O3, O4, O5
Chris@16:       #else
Chris@16:       Options...
Chris@16:       #endif
Chris@16:       >::type packed_options;
Chris@16: 
Chris@16:    typedef typename detail::get_value_traits
Chris@16:       <T, typename packed_options::proto_value_traits>::type value_traits;
Chris@16: 
Chris@16:    typedef splaytree_impl
Chris@16:          < value_traits
Chris@16:          , typename packed_options::compare
Chris@16:          , typename packed_options::size_type
Chris@16:          , packed_options::constant_time_size
Chris@101:          , typename packed_options::header_holder_type
Chris@16:          > implementation_defined;
Chris@16:    /// @endcond
Chris@16:    typedef implementation_defined type;
Chris@16: };
Chris@16: 
Chris@16: 
Chris@16: #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@16: 
Chris@16: #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
Chris@101: template<class T, class O1, class O2, class O3, class O4, class O5>
Chris@16: #else
Chris@16: template<class T, class ...Options>
Chris@16: #endif
Chris@16: class splaytree
Chris@16:    :  public make_splaytree<T,
Chris@16:       #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
Chris@101:       O1, O2, O3, O4, O5
Chris@16:       #else
Chris@16:       Options...
Chris@16:       #endif
Chris@16:       >::type
Chris@16: {
Chris@16:    typedef typename make_splaytree
Chris@16:       <T,
Chris@16:       #if !defined(BOOST_INTRUSIVE_VARIADIC_TEMPLATES)
Chris@101:       O1, O2, O3, O4, O5
Chris@16:       #else
Chris@16:       Options...
Chris@16:       #endif
Chris@16:       >::type   Base;
Chris@16:    BOOST_MOVABLE_BUT_NOT_COPYABLE(splaytree)
Chris@16: 
Chris@16:    public:
Chris@16:    typedef typename Base::value_compare      value_compare;
Chris@16:    typedef typename Base::value_traits       value_traits;
Chris@16:    typedef typename Base::iterator           iterator;
Chris@16:    typedef typename Base::const_iterator     const_iterator;
Chris@16:    typedef typename Base::reverse_iterator           reverse_iterator;
Chris@16:    typedef typename Base::const_reverse_iterator     const_reverse_iterator;
Chris@16: 
Chris@16:    //Assert if passed value traits are compatible with the type
Chris@101:    BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
Chris@16: 
Chris@16:    explicit splaytree( const value_compare &cmp = value_compare()
Chris@16:                      , const value_traits &v_traits = value_traits())
Chris@16:       :  Base(cmp, v_traits)
Chris@16:    {}
Chris@16: 
Chris@16:    template<class Iterator>
Chris@16:    splaytree( bool unique, Iterator b, Iterator e
Chris@16:          , const value_compare &cmp = value_compare()
Chris@16:          , const value_traits &v_traits = value_traits())
Chris@16:       :  Base(unique, b, e, cmp, v_traits)
Chris@16:    {}
Chris@16: 
Chris@16:    splaytree(BOOST_RV_REF(splaytree) x)
Chris@101:       :  Base(BOOST_MOVE_BASE(Base, x))
Chris@16:    {}
Chris@16: 
Chris@16:    splaytree& operator=(BOOST_RV_REF(splaytree) x)
Chris@101:    {  return static_cast<splaytree &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
Chris@16: 
Chris@16:    static splaytree &container_from_end_iterator(iterator end_iterator)
Chris@16:    {  return static_cast<splaytree &>(Base::container_from_end_iterator(end_iterator));   }
Chris@16: 
Chris@16:    static const splaytree &container_from_end_iterator(const_iterator end_iterator)
Chris@16:    {  return static_cast<const splaytree &>(Base::container_from_end_iterator(end_iterator));   }
Chris@16: 
Chris@16:    static splaytree &container_from_iterator(iterator it)
Chris@16:    {  return static_cast<splaytree &>(Base::container_from_iterator(it));   }
Chris@16: 
Chris@16:    static const splaytree &container_from_iterator(const_iterator it)
Chris@16:    {  return static_cast<const splaytree &>(Base::container_from_iterator(it));   }
Chris@16: };
Chris@16: 
Chris@16: #endif
Chris@16: 
Chris@16: } //namespace intrusive
Chris@16: } //namespace boost
Chris@16: 
Chris@16: #include <boost/intrusive/detail/config_end.hpp>
Chris@16: 
Chris@16: #endif //BOOST_INTRUSIVE_SPLAYTREE_HPP