Chris@102: /////////////////////////////////////////////////////////////////////////////
Chris@102: //
Chris@102: // (C) Copyright Ion Gaztanaga  2007-2013
Chris@102: //
Chris@102: // Distributed under the Boost Software License, Version 1.0.
Chris@102: //    (See accompanying file LICENSE_1_0.txt or copy at
Chris@102: //          http://www.boost.org/LICENSE_1_0.txt)
Chris@102: //
Chris@102: // See http://www.boost.org/libs/intrusive for documentation.
Chris@102: //
Chris@102: /////////////////////////////////////////////////////////////////////////////
Chris@102: 
Chris@102: #ifndef BOOST_INTRUSIVE_TREE_ITERATOR_HPP
Chris@102: #define BOOST_INTRUSIVE_TREE_ITERATOR_HPP
Chris@102: 
Chris@102: #ifndef BOOST_CONFIG_HPP
Chris@102: #  include <boost/config.hpp>
Chris@102: #endif
Chris@102: 
Chris@102: #if defined(BOOST_HAS_PRAGMA_ONCE)
Chris@102: #  pragma once
Chris@102: #endif
Chris@102: 
Chris@102: #include <boost/intrusive/detail/config_begin.hpp>
Chris@102: #include <boost/intrusive/detail/std_fwd.hpp>
Chris@102: #include <boost/intrusive/detail/iiterator.hpp>
Chris@102: #include <boost/intrusive/detail/bstree_algorithms_base.hpp>
Chris@102: 
Chris@102: namespace boost {
Chris@102: namespace intrusive {
Chris@102: 
Chris@102: /////////////////////////////////////////////////////////////////////////////
Chris@102: //                                                                         //
Chris@102: //                   Implementation of the tree iterator                   //
Chris@102: //                                                                         //
Chris@102: /////////////////////////////////////////////////////////////////////////////
Chris@102: 
Chris@102: // tree_iterator provides some basic functions for a
Chris@102: // node oriented bidirectional iterator:
Chris@102: template<class ValueTraits, bool IsConst>
Chris@102: class tree_iterator
Chris@102: {
Chris@102:    protected:
Chris@102:    typedef iiterator< ValueTraits, IsConst
Chris@102:                     , std::bidirectional_iterator_tag>   types_t;
Chris@102: 
Chris@102:    typedef ValueTraits                                   value_traits;
Chris@102:    typedef typename types_t::node_traits                 node_traits;
Chris@102: 
Chris@102:    typedef typename types_t::node                        node;
Chris@102:    typedef typename types_t::node_ptr                    node_ptr;
Chris@102:    typedef typename types_t::const_value_traits_ptr      const_value_traits_ptr;
Chris@102:    typedef bstree_algorithms_base<node_traits>           node_algorithms;
Chris@102: 
Chris@102:    static const bool stateful_value_traits = types_t::stateful_value_traits;
Chris@102: 
Chris@102:    void unspecified_bool_type_func() const {}
Chris@102:    typedef void (tree_iterator::*unspecified_bool_type)() const;
Chris@102: 
Chris@102:    public:
Chris@102:    typedef typename types_t::iterator_traits::difference_type    difference_type;
Chris@102:    typedef typename types_t::iterator_traits::value_type         value_type;
Chris@102:    typedef typename types_t::iterator_traits::pointer            pointer;
Chris@102:    typedef typename types_t::iterator_traits::reference          reference;
Chris@102:    typedef typename types_t::iterator_traits::iterator_category  iterator_category;
Chris@102: 
Chris@102:    tree_iterator()
Chris@102:    {}
Chris@102: 
Chris@102:    explicit tree_iterator(const node_ptr & nodeptr, const const_value_traits_ptr &traits_ptr)
Chris@102:       : members_(nodeptr, traits_ptr)
Chris@102:    {}
Chris@102: 
Chris@102:    tree_iterator(tree_iterator<value_traits, false> const& other)
Chris@102:       :  members_(other.pointed_node(), other.get_value_traits())
Chris@102:    {}
Chris@102: 
Chris@102:    const node_ptr &pointed_node() const
Chris@102:    { return members_.nodeptr_; }
Chris@102: 
Chris@102:    tree_iterator &operator=(const node_ptr &nodeptr)
Chris@102:    {  members_.nodeptr_ = nodeptr;  return static_cast<tree_iterator&>(*this);  }
Chris@102: 
Chris@102:    public:
Chris@102:    tree_iterator& operator++()
Chris@102:    {
Chris@102:       members_.nodeptr_ = node_algorithms::next_node(members_.nodeptr_);
Chris@102:       return static_cast<tree_iterator&> (*this);
Chris@102:    }
Chris@102: 
Chris@102:    tree_iterator operator++(int)
Chris@102:    {
Chris@102:       tree_iterator result (*this);
Chris@102:       members_.nodeptr_ = node_algorithms::next_node(members_.nodeptr_);
Chris@102:       return result;
Chris@102:    }
Chris@102: 
Chris@102:    tree_iterator& operator--()
Chris@102:    {
Chris@102:       members_.nodeptr_ = node_algorithms::prev_node(members_.nodeptr_);
Chris@102:       return static_cast<tree_iterator&> (*this);
Chris@102:    }
Chris@102: 
Chris@102:    tree_iterator operator--(int)
Chris@102:    {
Chris@102:       tree_iterator result (*this);
Chris@102:       members_.nodeptr_ = node_algorithms::prev_node(members_.nodeptr_);
Chris@102:       return result;
Chris@102:    }
Chris@102: 
Chris@102:    void go_left()
Chris@102:    { members_.nodeptr_ = node_traits::get_left(members_.nodeptr_); }
Chris@102: 
Chris@102:    void go_right()
Chris@102:    { members_.nodeptr_ = node_traits::get_right(members_.nodeptr_); }
Chris@102: 
Chris@102:    void go_parent()
Chris@102:    { members_.nodeptr_ = node_traits::get_parent(members_.nodeptr_); }
Chris@102: 
Chris@102:    operator unspecified_bool_type() const
Chris@102:    {  return members_.nodeptr_ ? &tree_iterator::unspecified_bool_type_func : 0;   }
Chris@102: 
Chris@102:    bool operator! () const
Chris@102:    {  return !members_.nodeptr_;   }
Chris@102: 
Chris@102:    friend bool operator== (const tree_iterator& l, const tree_iterator& r)
Chris@102:    { return l.pointed_node() == r.pointed_node(); }
Chris@102: 
Chris@102:    friend bool operator!= (const tree_iterator& l, const tree_iterator& r)
Chris@102:    {  return !(l == r);   }
Chris@102: 
Chris@102:    reference operator*() const
Chris@102:    {  return *operator->();   }
Chris@102: 
Chris@102:    pointer operator->() const
Chris@102:    { return this->operator_arrow(detail::bool_<stateful_value_traits>()); }
Chris@102: 
Chris@102:    const_value_traits_ptr get_value_traits() const
Chris@102:    {  return members_.get_ptr();  }
Chris@102: 
Chris@102:    tree_iterator end_iterator_from_it() const
Chris@102:    {
Chris@102:       return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits());
Chris@102:    }
Chris@102: 
Chris@102:    tree_iterator<value_traits, false> unconst() const
Chris@102:    {  return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits());   }
Chris@102: 
Chris@102:    private:
Chris@102:    pointer operator_arrow(detail::false_) const
Chris@102:    { return ValueTraits::to_value_ptr(members_.nodeptr_); }
Chris@102: 
Chris@102:    pointer operator_arrow(detail::true_) const
Chris@102:    { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); }
Chris@102: 
Chris@102:    iiterator_members<node_ptr, const_value_traits_ptr, stateful_value_traits> members_;
Chris@102: };
Chris@102: 
Chris@102: } //namespace intrusive
Chris@102: } //namespace boost
Chris@102: 
Chris@102: #include <boost/intrusive/detail/config_end.hpp>
Chris@102: 
Chris@102: #endif //BOOST_INTRUSIVE_TREE_ITERATOR_HPP