GiNaCRA
0.6.4
|
Iterator which traverses only the leaves. More...
#include <tree.h>
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 | |
leaf_iterator () | |
leaf_iterator (tree_node *, tree_node *top=0) | |
leaf_iterator (const sibling_iterator &) | |
leaf_iterator (const iterator_base &) | |
bool | operator== (const leaf_iterator &) const |
bool | operator!= (const leaf_iterator &) const |
leaf_iterator & | operator++ () |
leaf_iterator & | operator-- () |
leaf_iterator | operator++ (int) |
leaf_iterator | operator-- (int) |
leaf_iterator & | operator+= (unsigned int) |
leaf_iterator & | operator-= (unsigned int) |
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_ |
Private Attributes | |
tree_node * | top_node |
Iterator which traverses only the leaves.
typedef ptrdiff_t GiNaCRA::tree< T, tree_node_allocator >::iterator_base::difference_type [inherited] |
typedef std::bidirectional_iterator_tag GiNaCRA::tree< T, tree_node_allocator >::iterator_base::iterator_category [inherited] |
typedef T* GiNaCRA::tree< T, tree_node_allocator >::iterator_base::pointer [inherited] |
typedef T& GiNaCRA::tree< T, tree_node_allocator >::iterator_base::reference [inherited] |
typedef size_t GiNaCRA::tree< T, tree_node_allocator >::iterator_base::size_type [inherited] |
typedef T GiNaCRA::tree< T, tree_node_allocator >::iterator_base::value_type [inherited] |
GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | ) |
GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | tree_node * | tn, |
tree_node * | top = 0 |
||
) |
GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | const sibling_iterator & | other | ) |
Definition at line 3238 of file tree.h.
References GiNaCRA::tree< T, tree_node_allocator >::sibling_iterator::parent_, and GiNaCRA::tree< T, tree_node_allocator >::sibling_iterator::range_last().
GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | const iterator_base & | other | ) |
tree< T, tree_node_allocator >::sibling_iterator GiNaCRA::tree< T, tree_node_allocator >::iterator_base::begin | ( | ) | const [inherited] |
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().
tree< T, tree_node_allocator >::sibling_iterator GiNaCRA::tree< T, tree_node_allocator >::iterator_base::end | ( | ) | const [inherited] |
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().
unsigned int GiNaCRA::tree< T, tree_node_allocator >::iterator_base::number_of_children | ( | ) | const [inherited] |
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().
bool GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator!= | ( | const leaf_iterator & | other | ) | const |
Definition at line 2445 of file tree.h.
References GiNaCRA::tree< T, tree_node_allocator >::iterator_base::node.
T & GiNaCRA::tree< T, tree_node_allocator >::iterator_base::operator* | ( | ) | const [inherited] |
tree< T, tree_node_allocator >::leaf_iterator & GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator++ | ( | ) |
tree< T, tree_node_allocator >::leaf_iterator GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator++ | ( | int | ) |
tree< T, tree_node_allocator >::leaf_iterator & GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator+= | ( | unsigned int | num | ) |
tree< T, tree_node_allocator >::leaf_iterator & GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator-- | ( | ) |
tree< T, tree_node_allocator >::leaf_iterator GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator-- | ( | int | ) |
tree< T, tree_node_allocator >::leaf_iterator & GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator-= | ( | unsigned int | num | ) |
T * GiNaCRA::tree< T, tree_node_allocator >::iterator_base::operator-> | ( | ) | const [inherited] |
bool GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator== | ( | const leaf_iterator & | other | ) | const |
Definition at line 2453 of file tree.h.
References GiNaCRA::tree< T, tree_node_allocator >::iterator_base::node, and GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::top_node.
void GiNaCRA::tree< T, tree_node_allocator >::iterator_base::skip_children | ( | ) | [inherited] |
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_().
void GiNaCRA::tree< T, tree_node_allocator >::iterator_base::skip_children | ( | bool | skip | ) | [inherited] |
tree_node* GiNaCRA::tree< T, tree_node_allocator >::iterator_base::node [inherited] |
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().
bool GiNaCRA::tree< T, tree_node_allocator >::iterator_base::skip_current_children_ [protected, inherited] |
tree_node* GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::top_node [private] |
Definition at line 270 of file tree.h.
Referenced by GiNaCRA::tree< T, tree_node_allocator >::leaf_iterator::operator==().