Chris@16: /////////////////////////////////////////////////////////////////////////////
Chris@16: //
Chris@16: // (C) Copyright Olaf Krzikalla 2004-2006.
Chris@101: // (C) Copyright Ion Gaztanaga  2006-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_SET_HPP
Chris@16: #define BOOST_INTRUSIVE_SET_HPP
Chris@16: 
Chris@16: #include <boost/intrusive/detail/config_begin.hpp>
Chris@16: #include <boost/intrusive/intrusive_fwd.hpp>
Chris@101: 
Chris@16: #include <boost/intrusive/detail/mpl.hpp>
Chris@16: #include <boost/intrusive/rbtree.hpp>
Chris@101: #include <boost/move/utility_core.hpp>
Chris@101: #include <boost/static_assert.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: //! The class template set is an intrusive container, that mimics most of
Chris@16: //! the interface of std::set as described in the C++ standard.
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 Compare, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
Chris@16: #endif
Chris@16: class set_impl
Chris@16: #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@101:    : public bstree_impl<ValueTraits, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder>
Chris@16: #endif
Chris@16: {
Chris@16:    /// @cond
Chris@101:    typedef bstree_impl<ValueTraits, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder> tree_type;
Chris@16:    BOOST_MOVABLE_BUT_NOT_COPYABLE(set_impl)
Chris@16: 
Chris@16:    typedef tree_type implementation_defined;
Chris@16:    /// @endcond
Chris@16: 
Chris@16:    public:
Chris@16:    typedef typename implementation_defined::value_type               value_type;
Chris@16:    typedef typename implementation_defined::value_traits             value_traits;
Chris@16:    typedef typename implementation_defined::pointer                  pointer;
Chris@16:    typedef typename implementation_defined::const_pointer            const_pointer;
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::insert_commit_data       insert_commit_data;
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 = tree_type::constant_time_size;
Chris@16: 
Chris@16:    public:
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rbtree(const value_compare &,const value_traits &)
Chris@16:    explicit set_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::rbtree::rbtree(bool,Iterator,Iterator,const value_compare &,const value_traits &)
Chris@16:    template<class Iterator>
Chris@16:    set_impl( 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(true, b, e, cmp, v_traits)
Chris@16:    {}
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rbtree(rbtree &&)
Chris@16:    set_impl(BOOST_RV_REF(set_impl) x)
Chris@101:       :  tree_type(BOOST_MOVE_BASE(tree_type, x))
Chris@16:    {}
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::operator=(rbtree &&)
Chris@16:    set_impl& operator=(BOOST_RV_REF(set_impl) x)
Chris@101:    {  return static_cast<set_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); }
Chris@16: 
Chris@16:    #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::~rbtree()
Chris@16:    ~set_impl();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::begin()
Chris@16:    iterator begin();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::begin()const
Chris@16:    const_iterator begin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::cbegin()const
Chris@16:    const_iterator cbegin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::end()
Chris@16:    iterator end();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::end()const
Chris@16:    const_iterator end() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::cend()const
Chris@16:    const_iterator cend() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rbegin()
Chris@16:    reverse_iterator rbegin();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rbegin()const
Chris@16:    const_reverse_iterator rbegin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::crbegin()const
Chris@16:    const_reverse_iterator crbegin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rend()
Chris@16:    reverse_iterator rend();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rend()const
Chris@16:    const_reverse_iterator rend() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::crend()const
Chris@16:    const_reverse_iterator crend() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::container_from_end_iterator(iterator)
Chris@16:    static set_impl &container_from_end_iterator(iterator end_iterator);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::container_from_end_iterator(const_iterator)
Chris@16:    static const set_impl &container_from_end_iterator(const_iterator end_iterator);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::container_from_iterator(iterator)
Chris@16:    static set_impl &container_from_iterator(iterator it);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::container_from_iterator(const_iterator)
Chris@16:    static const set_impl &container_from_iterator(const_iterator it);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::key_comp()const
Chris@16:    key_compare key_comp() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::value_comp()const
Chris@16:    value_compare value_comp() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::empty()const
Chris@16:    bool empty() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::size()const
Chris@16:    size_type size() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::swap
Chris@16:    void swap(set_impl& other);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::clone_from
Chris@16:    template <class Cloner, class Disposer>
Chris@16:    void clone_from(const set_impl &src, Cloner cloner, Disposer disposer);
Chris@101: 
Chris@16:    #endif   //#ifdef BOOST_iNTRUSIVE_DOXYGEN_INVOKED
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::insert_unique(reference)
Chris@16:    std::pair<iterator, bool> insert(reference value)
Chris@16:    {  return tree_type::insert_unique(value);  }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::insert_unique(const_iterator,reference)
Chris@16:    iterator insert(const_iterator hint, reference value)
Chris@16:    {  return tree_type::insert_unique(hint, value);  }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::insert_unique_check(const KeyType&,KeyValueCompare,insert_commit_data&)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    std::pair<iterator, bool> insert_check
Chris@16:       (const KeyType &key, KeyValueCompare key_value_comp, insert_commit_data &commit_data)
Chris@16:    {  return tree_type::insert_unique_check(key, key_value_comp, commit_data); }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::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_check
Chris@16:       (const_iterator hint, const KeyType &key
Chris@16:       ,KeyValueCompare key_value_comp, insert_commit_data &commit_data)
Chris@16:    {  return tree_type::insert_unique_check(hint, key, key_value_comp, commit_data); }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::insert_unique(Iterator,Iterator)
Chris@16:    template<class Iterator>
Chris@16:    void insert(Iterator b, Iterator e)
Chris@16:    {  tree_type::insert_unique(b, e);  }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::insert_unique_commit
Chris@16:    iterator insert_commit(reference value, const insert_commit_data &commit_data)
Chris@16:    {  return tree_type::insert_unique_commit(value, commit_data);  }
Chris@16: 
Chris@16:    #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::insert_before
Chris@16:    iterator insert_before(const_iterator pos, reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::push_back
Chris@16:    void push_back(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::push_front
Chris@16:    void push_front(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::erase(const_iterator)
Chris@16:    iterator erase(const_iterator i);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::erase(const_iterator,const_iterator)
Chris@16:    iterator erase(const_iterator b, const_iterator e);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::erase(const_reference)
Chris@16:    size_type erase(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::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::rbtree::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::rbtree::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::rbtree::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::rbtree::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::rbtree::clear
Chris@16:    void clear();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::clear_and_dispose
Chris@16:    template<class Disposer>
Chris@16:    void clear_and_dispose(Disposer disposer);
Chris@16: 
Chris@101:    #endif   //   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@101: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::count(const_reference)const
Chris@101:    size_type count(const_reference value) const
Chris@101:    {  return static_cast<size_type>(this->tree_type::find(value) != this->tree_type::cend()); }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::count(const KeyType&,KeyValueCompare)const
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@101:    size_type count(const KeyType& key, KeyValueCompare comp) const
Chris@101:    {  return static_cast<size_type>(this->tree_type::find(key, comp) != this->tree_type::cend()); }
Chris@101: 
Chris@101:    #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@101: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::lower_bound(const_reference)
Chris@16:    iterator lower_bound(const_reference value);
Chris@101: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::lower_bound(const KeyType&,KeyValueCompare)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    iterator lower_bound(const KeyType& key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::lower_bound(const_reference)const
Chris@16:    const_iterator lower_bound(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::lower_bound(const KeyType&,KeyValueCompare)const
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::rbtree::upper_bound(const_reference)
Chris@16:    iterator upper_bound(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::upper_bound(const KeyType&,KeyValueCompare)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    iterator upper_bound(const KeyType& key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::upper_bound(const_reference)const
Chris@16:    const_iterator upper_bound(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::upper_bound(const KeyType&,KeyValueCompare)const
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::rbtree::find(const_reference)
Chris@16:    iterator find(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::find(const KeyType&,KeyValueCompare)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    iterator find(const KeyType& key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::find(const_reference)const
Chris@16:    const_iterator find(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::find(const KeyType&,KeyValueCompare)const
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    const_iterator find(const KeyType& key, KeyValueCompare comp) const;
Chris@16: 
Chris@101:    #endif   //   #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@101: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::equal_range(const_reference)
Chris@101:    std::pair<iterator,iterator> equal_range(const_reference value)
Chris@101:    {  return this->tree_type::lower_bound_range(value); }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyValueCompare)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@101:    std::pair<iterator,iterator> equal_range(const KeyType& key, KeyValueCompare comp)
Chris@101:    {  return this->tree_type::lower_bound_range(key, comp); }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::equal_range(const_reference)const
Chris@16:    std::pair<const_iterator, const_iterator>
Chris@101:       equal_range(const_reference value) const
Chris@101:    {  return this->tree_type::lower_bound_range(value); }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyValueCompare)const
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    std::pair<const_iterator, const_iterator>
Chris@101:       equal_range(const KeyType& key, KeyValueCompare comp) const
Chris@101:    {  return this->tree_type::lower_bound_range(key, comp); }
Chris@101: 
Chris@101:    #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::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::rbtree::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::rbtree::bounded_range(const_reference,const_reference,bool,bool)const
Chris@16:    std::pair<const_iterator, const_iterator>
Chris@16:       bounded_range(const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::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::rbtree::s_iterator_to(reference)
Chris@16:    static iterator s_iterator_to(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::s_iterator_to(const_reference)
Chris@16:    static const_iterator s_iterator_to(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::iterator_to(reference)
Chris@16:    iterator iterator_to(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::iterator_to(const_reference)const
Chris@16:    const_iterator iterator_to(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::init_node(reference)
Chris@16:    static void init_node(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::unlink_leftmost_without_rebalance
Chris@16:    pointer unlink_leftmost_without_rebalance();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::replace_node
Chris@16:    void replace_node(iterator replace_this, reference with_this);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::remove_node
Chris@16:    void remove_node(reference value);
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 set_impl<T, Options...> &x, const set_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator>(const set_impl<T, Options...> &x, const set_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator<=(const set_impl<T, Options...> &x, const set_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator>=(const set_impl<T, Options...> &x, const set_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: void swap(set_impl<T, Options...> &x, set_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 set 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_set
Chris@16: {
Chris@16:    /// @cond
Chris@16:    typedef typename pack_options
Chris@16:       < rbtree_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 set_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: #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
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 set
Chris@16:    :  public make_set<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_set
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: 
Chris@16:    BOOST_MOVABLE_BUT_NOT_COPYABLE(set)
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: 
Chris@16:    //Assert if passed value traits are compatible with the type
Chris@16:    BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
Chris@16: 
Chris@16:    explicit set( 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:    set( Iterator b, Iterator e
Chris@16:       , const value_compare &cmp = value_compare()
Chris@16:       , const value_traits &v_traits = value_traits())
Chris@16:       :  Base(b, e, cmp, v_traits)
Chris@16:    {}
Chris@16: 
Chris@16:    set(BOOST_RV_REF(set) x)
Chris@101:       :  Base(BOOST_MOVE_BASE(Base, x))
Chris@16:    {}
Chris@16: 
Chris@16:    set& operator=(BOOST_RV_REF(set) x)
Chris@101:    {  return static_cast<set &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
Chris@16: 
Chris@16:    static set &container_from_end_iterator(iterator end_iterator)
Chris@16:    {  return static_cast<set &>(Base::container_from_end_iterator(end_iterator));   }
Chris@16: 
Chris@16:    static const set &container_from_end_iterator(const_iterator end_iterator)
Chris@16:    {  return static_cast<const set &>(Base::container_from_end_iterator(end_iterator));   }
Chris@16: 
Chris@16:    static set &container_from_iterator(iterator it)
Chris@16:    {  return static_cast<set &>(Base::container_from_iterator(it));   }
Chris@16: 
Chris@16:    static const set &container_from_iterator(const_iterator it)
Chris@16:    {  return static_cast<const set &>(Base::container_from_iterator(it));   }
Chris@16: };
Chris@16: 
Chris@16: #endif
Chris@16: 
Chris@16: //! The class template multiset is an intrusive container, that mimics most of
Chris@16: //! the interface of std::multiset as described in the C++ standard.
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 Compare, class SizeType, bool ConstantTimeSize, typename HeaderHolder>
Chris@16: #endif
Chris@16: class multiset_impl
Chris@16: #ifndef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@101:    : public bstree_impl<ValueTraits, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder>
Chris@16: #endif
Chris@16: {
Chris@16:    /// @cond
Chris@101:    typedef bstree_impl<ValueTraits, Compare, SizeType, ConstantTimeSize, RbTreeAlgorithms, HeaderHolder> tree_type;
Chris@16: 
Chris@16:    BOOST_MOVABLE_BUT_NOT_COPYABLE(multiset_impl)
Chris@16:    typedef tree_type implementation_defined;
Chris@16:    /// @endcond
Chris@16: 
Chris@16:    public:
Chris@16:    typedef typename implementation_defined::value_type               value_type;
Chris@16:    typedef typename implementation_defined::value_traits             value_traits;
Chris@16:    typedef typename implementation_defined::pointer                  pointer;
Chris@16:    typedef typename implementation_defined::const_pointer            const_pointer;
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::insert_commit_data       insert_commit_data;
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 = tree_type::constant_time_size;
Chris@16: 
Chris@16:    public:
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rbtree(const value_compare &,const value_traits &)
Chris@16:    explicit multiset_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::rbtree::rbtree(bool,Iterator,Iterator,const value_compare &,const value_traits &)
Chris@16:    template<class Iterator>
Chris@16:    multiset_impl( 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(false, b, e, cmp, v_traits)
Chris@16:    {}
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rbtree(rbtree &&)
Chris@16:    multiset_impl(BOOST_RV_REF(multiset_impl) x)
Chris@101:       :  tree_type(BOOST_MOVE_BASE(tree_type, x))
Chris@16:    {}
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::operator=(rbtree &&)
Chris@16:    multiset_impl& operator=(BOOST_RV_REF(multiset_impl) x)
Chris@101:    {  return static_cast<multiset_impl&>(tree_type::operator=(BOOST_MOVE_BASE(tree_type, x))); }
Chris@16: 
Chris@16:    #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::~rbtree()
Chris@16:    ~multiset_impl();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::begin()
Chris@16:    iterator begin();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::begin()const
Chris@16:    const_iterator begin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::cbegin()const
Chris@16:    const_iterator cbegin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::end()
Chris@16:    iterator end();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::end()const
Chris@16:    const_iterator end() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::cend()const
Chris@16:    const_iterator cend() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rbegin()
Chris@16:    reverse_iterator rbegin();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rbegin()const
Chris@16:    const_reverse_iterator rbegin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::crbegin()const
Chris@16:    const_reverse_iterator crbegin() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rend()
Chris@16:    reverse_iterator rend();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::rend()const
Chris@16:    const_reverse_iterator rend() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::crend()const
Chris@16:    const_reverse_iterator crend() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::container_from_end_iterator(iterator)
Chris@16:    static multiset_impl &container_from_end_iterator(iterator end_iterator);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::container_from_end_iterator(const_iterator)
Chris@16:    static const multiset_impl &container_from_end_iterator(const_iterator end_iterator);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::container_from_iterator(iterator)
Chris@16:    static multiset_impl &container_from_iterator(iterator it);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::container_from_iterator(const_iterator)
Chris@16:    static const multiset_impl &container_from_iterator(const_iterator it);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::key_comp()const
Chris@16:    key_compare key_comp() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::value_comp()const
Chris@16:    value_compare value_comp() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::empty()const
Chris@16:    bool empty() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::size()const
Chris@16:    size_type size() const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::swap
Chris@16:    void swap(multiset_impl& other);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::clone_from
Chris@16:    template <class Cloner, class Disposer>
Chris@16:    void clone_from(const multiset_impl &src, Cloner cloner, Disposer disposer);
Chris@16: 
Chris@16:    #endif   //#ifdef BOOST_iNTRUSIVE_DOXYGEN_INVOKED
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::insert_equal(reference)
Chris@16:    iterator insert(reference value)
Chris@16:    {  return tree_type::insert_equal(value);  }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::insert_equal(const_iterator,reference)
Chris@16:    iterator insert(const_iterator hint, reference value)
Chris@16:    {  return tree_type::insert_equal(hint, value);  }
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::insert_equal(Iterator,Iterator)
Chris@16:    template<class Iterator>
Chris@16:    void insert(Iterator b, Iterator e)
Chris@16:    {  tree_type::insert_equal(b, e);  }
Chris@16: 
Chris@16:    #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::insert_before
Chris@16:    iterator insert_before(const_iterator pos, reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::push_back
Chris@16:    void push_back(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::push_front
Chris@16:    void push_front(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::erase(const_iterator)
Chris@16:    iterator erase(const_iterator i);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::erase(const_iterator,const_iterator)
Chris@16:    iterator erase(const_iterator b, const_iterator e);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::erase(const_reference)
Chris@16:    size_type erase(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::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::rbtree::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::rbtree::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::rbtree::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::rbtree::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::rbtree::clear
Chris@16:    void clear();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::clear_and_dispose
Chris@16:    template<class Disposer>
Chris@16:    void clear_and_dispose(Disposer disposer);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::count(const_reference)const
Chris@16:    size_type count(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::count(const KeyType&,KeyValueCompare)const
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    size_type count(const KeyType& key, KeyValueCompare comp) const;
Chris@101: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::lower_bound(const_reference)
Chris@16:    iterator lower_bound(const_reference value);
Chris@101: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::lower_bound(const KeyType&,KeyValueCompare)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    iterator lower_bound(const KeyType& key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::lower_bound(const_reference)const
Chris@16:    const_iterator lower_bound(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::lower_bound(const KeyType&,KeyValueCompare)const
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::rbtree::upper_bound(const_reference)
Chris@16:    iterator upper_bound(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::upper_bound(const KeyType&,KeyValueCompare)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    iterator upper_bound(const KeyType& key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::upper_bound(const_reference)const
Chris@16:    const_iterator upper_bound(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::upper_bound(const KeyType&,KeyValueCompare)const
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::rbtree::find(const_reference)
Chris@16:    iterator find(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::find(const KeyType&,KeyValueCompare)
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    iterator find(const KeyType& key, KeyValueCompare comp);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::find(const_reference)const
Chris@16:    const_iterator find(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::find(const KeyType&,KeyValueCompare)const
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::rbtree::equal_range(const_reference)
Chris@16:    std::pair<iterator,iterator> equal_range(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyValueCompare)
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::rbtree::equal_range(const_reference)const
Chris@16:    std::pair<const_iterator, const_iterator>
Chris@16:       equal_range(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::equal_range(const KeyType&,KeyValueCompare)const
Chris@16:    template<class KeyType, class KeyValueCompare>
Chris@16:    std::pair<const_iterator, const_iterator>
Chris@16:       equal_range(const KeyType& key, KeyValueCompare comp) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::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::rbtree::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::rbtree::bounded_range(const_reference,const_reference,bool,bool)const
Chris@16:    std::pair<const_iterator, const_iterator>
Chris@16:       bounded_range(const_reference lower_value, const_reference upper_value, bool left_closed, bool right_closed) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::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::rbtree::s_iterator_to(reference)
Chris@16:    static iterator s_iterator_to(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::s_iterator_to(const_reference)
Chris@16:    static const_iterator s_iterator_to(const_reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::iterator_to(reference)
Chris@16:    iterator iterator_to(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::iterator_to(const_reference)const
Chris@16:    const_iterator iterator_to(const_reference value) const;
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::init_node(reference)
Chris@16:    static void init_node(reference value);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::unlink_leftmost_without_rebalance
Chris@16:    pointer unlink_leftmost_without_rebalance();
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::replace_node
Chris@16:    void replace_node(iterator replace_this, reference with_this);
Chris@16: 
Chris@16:    //! @copydoc ::boost::intrusive::rbtree::remove_node
Chris@16:    void remove_node(reference value);
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 multiset_impl<T, Options...> &x, const multiset_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator>(const multiset_impl<T, Options...> &x, const multiset_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator<=(const multiset_impl<T, Options...> &x, const multiset_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: bool operator>=(const multiset_impl<T, Options...> &x, const multiset_impl<T, Options...> &y);
Chris@16: 
Chris@16: template<class T, class ...Options>
Chris@16: void swap(multiset_impl<T, Options...> &x, multiset_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 multiset 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_multiset
Chris@16: {
Chris@16:    /// @cond
Chris@16:    typedef typename pack_options
Chris@16:       < rbtree_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 multiset_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: #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 multiset
Chris@16:    :  public make_multiset<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_multiset<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: 
Chris@16:    BOOST_MOVABLE_BUT_NOT_COPYABLE(multiset)
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: 
Chris@16:    //Assert if passed value traits are compatible with the type
Chris@16:    BOOST_STATIC_ASSERT((detail::is_same<typename value_traits::value_type, T>::value));
Chris@16: 
Chris@16:    multiset( 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:    multiset( Iterator b, Iterator e
Chris@16:            , const value_compare &cmp = value_compare()
Chris@16:            , const value_traits &v_traits = value_traits())
Chris@16:       :  Base(b, e, cmp, v_traits)
Chris@16:    {}
Chris@16: 
Chris@16:    multiset(BOOST_RV_REF(multiset) x)
Chris@101:       :  Base(BOOST_MOVE_BASE(Base, x))
Chris@16:    {}
Chris@16: 
Chris@16:    multiset& operator=(BOOST_RV_REF(multiset) x)
Chris@101:    {  return static_cast<multiset &>(this->Base::operator=(BOOST_MOVE_BASE(Base, x)));  }
Chris@16: 
Chris@16:    static multiset &container_from_end_iterator(iterator end_iterator)
Chris@16:    {  return static_cast<multiset &>(Base::container_from_end_iterator(end_iterator));   }
Chris@16: 
Chris@16:    static const multiset &container_from_end_iterator(const_iterator end_iterator)
Chris@16:    {  return static_cast<const multiset &>(Base::container_from_end_iterator(end_iterator));   }
Chris@16: 
Chris@16:    static multiset &container_from_iterator(iterator it)
Chris@16:    {  return static_cast<multiset &>(Base::container_from_iterator(it));   }
Chris@16: 
Chris@16:    static const multiset &container_from_iterator(const_iterator it)
Chris@16:    {  return static_cast<const multiset &>(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_SET_HPP