tree< T, tree_node_allocator >::sibling_iterator Class Reference

Iterator which traverses only the nodes which are siblings of each other. More...

#include <tree.hh>

Inheritance diagram for tree< T, tree_node_allocator >::sibling_iterator:

Collaboration diagram for tree< T, tree_node_allocator >::sibling_iterator:

Public Member Functions
	sibling_iterator ()
	sibling_iterator (tree_node *)
	sibling_iterator (const sibling_iterator &)
	sibling_iterator (const iterator_base &)
bool	operator== (const sibling_iterator &) const
bool	operator!= (const sibling_iterator &) const
sibling_iterator &	operator++ ()
sibling_iterator &	operator-- ()
sibling_iterator	operator++ (int)
sibling_iterator	operator-- (int)
sibling_iterator &	operator+= (unsigned int)
sibling_iterator &	operator-= (unsigned int)
tree_node *	range_first () const
tree_node *	range_last () const
Public Member Functions inherited from tree< T, tree_node_allocator >::iterator_base
	iterator_base ()
	iterator_base (tree_node *)
T &	operator* () const
T *	operator-> () const
void	skip_children ()
	When called, the next increment/decrement skips children of this node. More...
void	skip_children (bool skip)
unsigned int	number_of_children () const
	Number of children of the node pointed to by the iterator. More...
sibling_iterator	begin () const
sibling_iterator	end () const

Public Attributes
tree_node *	parent_
Public Attributes inherited from tree< T, tree_node_allocator >::iterator_base
tree_node *	node

Additional Inherited Members
Public Types inherited from tree< T, tree_node_allocator >::iterator_base
typedef T	value_type
typedef T *	pointer
typedef T &	reference
typedef size_t	size_type
typedef ptrdiff_t	difference_type
typedef std::bidirectional_iterator_tag	iterator_category
Protected Attributes inherited from tree< T, tree_node_allocator >::iterator_base
bool	skip_current_children_

Detailed Description

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
class tree< T, tree_node_allocator >::sibling_iterator

Iterator which traverses only the nodes which are siblings of each other.

Constructor & Destructor Documentation

sibling_iterator() [1/4]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator

(

)

sibling_iterator() [2/4]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator

(

tree_node *

tn

)

sibling_iterator() [3/4]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator

(

const sibling_iterator &

other

)

References tree< T, tree_node_allocator >::iterator_base::node, tree_node_< T >::parent, and tree< T, tree_node_allocator >::sibling_iterator::parent_.

sibling_iterator() [4/4]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator

(

const iterator_base &

other

)

Member Function Documentation

operator!=()

template<class T , class tree_node_allocator >

bool tree< T, tree_node_allocator >::sibling_iterator::operator!=

(

const sibling_iterator &

other

)

const

References tree< T, tree_node_allocator >::iterator_base::node.

operator++() [1/2]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator++

(

)

References tree_node_< T >::next_sibling, and tree< T, tree_node_allocator >::iterator_base::node.

operator++() [2/2]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::sibling_iterator::operator++

(

int

)

operator+=()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator+=

(

unsigned int

num

)

operator--() [1/2]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator--

(

)

References tree_node_< T >::last_child, tree< T, tree_node_allocator >::iterator_base::node, tree< T, tree_node_allocator >::sibling_iterator::parent_, and tree_node_< T >::prev_sibling.

operator--() [2/2]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::sibling_iterator::operator--

(

int

)

operator-=()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator-=

(

unsigned int

num

)

operator==()

template<class T , class tree_node_allocator >

bool tree< T, tree_node_allocator >::sibling_iterator::operator==

(

const sibling_iterator &

other

)

const

References tree< T, tree_node_allocator >::iterator_base::node.

range_first()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::tree_node * tree< T, tree_node_allocator >::sibling_iterator::range_first

(

)

const

References tree_node_< T >::first_child, and tree< T, tree_node_allocator >::sibling_iterator::parent_.

range_last()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::tree_node * tree< T, tree_node_allocator >::sibling_iterator::range_last

(

)

const

References tree_node_< T >::last_child, and tree< T, tree_node_allocator >::sibling_iterator::parent_.

Referenced by tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator(), tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator(), and tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator().

Here is the caller graph for this function:

Member Data Documentation

parent_

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>

tree_node* tree< T, tree_node_allocator >::sibling_iterator::parent_

Referenced by tree< T, tree_node_allocator >::iterator_base::begin(), tree< T, tree_node_allocator >::iterator_base::end(), tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator(), tree< T, tree_node_allocator >::sibling_iterator::operator--(), tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator(), tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator(), tree< T, tree_node_allocator >::sibling_iterator::range_first(), tree< T, tree_node_allocator >::sibling_iterator::range_last(), and tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator().

---

The documentation for this class was generated from the following file:

• tree.hh