GiNaCRA::tree< T, tree_node_allocator >::iterator_base Class Reference

Base class for iterators, only pointers stored, no traversal logic. More...

#include <tree.h>

Inheritance diagram for GiNaCRA::tree< T, tree_node_allocator >::iterator_base:

Collaboration diagram for GiNaCRA::tree< T, tree_node_allocator >::iterator_base:

Public Types
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
Public Member Functions
	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.
void	skip_children (bool skip)
unsigned int	number_of_children () const
	Number of children of the node pointed to by the iterator.
sibling_iterator	begin () const
sibling_iterator	end () const
Data Fields
tree_node *	node
Protected Attributes
bool	skip_current_children_

---

Detailed Description

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

Base class for iterators, only pointers stored, no traversal logic.

Definition at line 105 of file tree.h.

---

Member Typedef Documentation

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

typedef ptrdiff_t GiNaCRA::tree< T, tree_node_allocator >::iterator_base::difference_type

Definition at line 113 of file tree.h.

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

typedef std::bidirectional_iterator_tag GiNaCRA::tree< T, tree_node_allocator >::iterator_base::iterator_category

Definition at line 114 of file tree.h.

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

typedef T* GiNaCRA::tree< T, tree_node_allocator >::iterator_base::pointer

Definition at line 110 of file tree.h.

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

typedef T& GiNaCRA::tree< T, tree_node_allocator >::iterator_base::reference

Definition at line 111 of file tree.h.

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

typedef size_t GiNaCRA::tree< T, tree_node_allocator >::iterator_base::size_type

Definition at line 112 of file tree.h.

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

typedef T GiNaCRA::tree< T, tree_node_allocator >::iterator_base::value_type

Definition at line 109 of file tree.h.

---

Constructor & Destructor Documentation

template<class T , class tree_node_allocator >

GiNaCRA::tree< T, tree_node_allocator >::iterator_base::iterator_base

(

)

Definition at line 2376 of file tree.h.

template<class T , class tree_node_allocator >

GiNaCRA::tree< T, tree_node_allocator >::iterator_base::iterator_base

(

tree_node *

tn

)

Definition at line 2381 of file tree.h.

---

Member Function Documentation

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator GiNaCRA::tree< T, tree_node_allocator >::iterator_base::begin

(

)

const

Definition at line 2462 of file tree.h.

References GiNaCRA::tree< T, tree_node_allocator >::end(), and GiNaCRA::tree< T, tree_node_allocator >::sibling_iterator::parent_.

Referenced by GiNaCRA::tree< T, tree_node_allocator >::merge().

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator GiNaCRA::tree< T, tree_node_allocator >::iterator_base::end

(

)

const

Definition at line 2474 of file tree.h.

References GiNaCRA::tree< T, tree_node_allocator >::sibling_iterator::parent_.

Referenced by GiNaCRA::tree< T, tree_node_allocator >::merge().

template<class T , class tree_node_allocator >

unsigned int GiNaCRA::tree< T, tree_node_allocator >::iterator_base::number_of_children

(

)

const

Number of children of the node pointed to by the iterator.

Definition at line 2497 of file tree.h.

References GiNaCRA::tree_node_< T >::first_child, GiNaCRA::tree_node_< T >::last_child, and GiNaCRA::tree_node_< T >::next_sibling.

Referenced by GiNaCRA::tree< T, tree_node_allocator >::equal().

template<class T , class tree_node_allocator >

T & GiNaCRA::tree< T, tree_node_allocator >::iterator_base::operator*

(

)

const

Definition at line 2385 of file tree.h.

template<class T , class tree_node_allocator >

T * GiNaCRA::tree< T, tree_node_allocator >::iterator_base::operator->

(

)

const

Definition at line 2391 of file tree.h.

template<class T , class tree_node_allocator >

void GiNaCRA::tree< T, tree_node_allocator >::iterator_base::skip_children

(

)

When called, the next increment/decrement skips children of this node.

Definition at line 2483 of file tree.h.

Referenced by GiNaCRA::tree< T, tree_node_allocator >::copy_().

template<class T , class tree_node_allocator >

void GiNaCRA::tree< T, tree_node_allocator >::iterator_base::skip_children

(

bool

skip

)

Definition at line 2490 of file tree.h.

---

Field Documentation

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

tree_node* GiNaCRA::tree< T, tree_node_allocator >::iterator_base::node

Definition at line 131 of file tree.h.

Referenced by GiNaCRA::tree< T, tree_node_allocator >::begin_fixed(), GiNaCRA::tree< T, tree_node_allocator >::debug_verify_consistency(), GiNaCRA::tree< T, tree_node_allocator >::index(), GiNaCRA::tree< T, tree_node_allocator >::insert(), GiNaCRA::tree< T, tree_node_allocator >::move_before(), GiNaCRA::tree< T, tree_node_allocator >::pre_order_iterator::operator!=(), GiNaCRA::tree< T, tree_node_allocator >::post_order_iterator::operator!=(), GiNaCRA::tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator!=(), GiNaCRA::tree< T, tree_node_allocator >::fixed_depth_iterator::operator!=(), GiNaCRA::tree< T, tree_node_allocator >::sibling_iterator::operator!=(), GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator!=(), GiNaCRA::tree< T, tree_node_allocator >::iterator_base_less::operator()(), GiNaCRA::tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++(), GiNaCRA::tree< T, tree_node_allocator >::pre_order_iterator::operator==(), GiNaCRA::tree< T, tree_node_allocator >::post_order_iterator::operator==(), GiNaCRA::tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator==(), GiNaCRA::tree< T, tree_node_allocator >::fixed_depth_iterator::operator==(), GiNaCRA::tree< T, tree_node_allocator >::sibling_iterator::operator==(), GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator==(), GiNaCRA::tree< T, tree_node_allocator >::reparent(), GiNaCRA::tree< T, tree_node_allocator >::replace(), GiNaCRA::tree< T, tree_node_allocator >::sort(), and GiNaCRA::tree< T, tree_node_allocator >::swap().

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

bool GiNaCRA::tree< T, tree_node_allocator >::iterator_base::skip_current_children_ [protected]

Definition at line 133 of file tree.h.

---

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

• tree.h