| FreeLing
    4.0
    | 
nonconst iterator. More...
#include <tree.h>


nonconst iterator.
A const iterator X (preorder or sibling) plus non-const * and ->, plus access to nonconst operations of the underlying tree
| freeling::basic_nonconst_tree_iterator< T >::basic_nonconst_tree_iterator | ( | ) | 
---------------------------------------------------------------------------------- basic_nonconst_tree_iterator ---------------------------------------------------------
| freeling::basic_nonconst_tree_iterator< T >::~basic_nonconst_tree_iterator | ( | ) | 
| void freeling::basic_nonconst_tree_iterator< T >::add_child | ( | const tree< T > & | t, | 
| bool | last = true | ||
| ) | 
copy given tree and add it as a child
| tree_preorder_iterator< T > freeling::basic_nonconst_tree_iterator< T >::begin | ( | ) | 
iterators begin/end
| tree_preorder_iterator< T > freeling::basic_nonconst_tree_iterator< T >::end | ( | ) | 
| T * freeling::basic_nonconst_tree_iterator< T >::get_info | ( | ) | const | 
emulate operator -> for java/python/perl APIS
Reimplemented from freeling::basic_tree_iterator< T, tree< T > >.
| tree_preorder_iterator< T > freeling::basic_nonconst_tree_iterator< T >::get_parent | ( | ) | 
get iterator to parent node
| void freeling::basic_nonconst_tree_iterator< T >::hang_child | ( | tree< T > & | t, | 
| tree_sibling_iterator< T > | where = tree_sibling_iterator<T>(NULL) | ||
| ) | 
add given tree and as a child reordering structure. NO COPIES MADE.
| void freeling::basic_nonconst_tree_iterator< T >::hang_child | ( | basic_nonconst_tree_iterator< T > & | p, | 
| tree_sibling_iterator< T > | where = tree_sibling_iterator<T>(NULL) | ||
| ) | 
| tree_sibling_iterator< T > freeling::basic_nonconst_tree_iterator< T >::nth_child | ( | unsigned int | n | ) | 
---------------------------------------------------------------------------------- non-const tree operations accessed via the iterator ------------------------------------------
| tree< T > & freeling::basic_nonconst_tree_iterator< T >::nth_child_ref | ( | unsigned int | n | ) | 
| T & freeling::basic_nonconst_tree_iterator< T >::operator* | ( | ) | const | 
basic const iterator operations
Reimplemented from freeling::basic_tree_iterator< T, tree< T > >.
| T * freeling::basic_nonconst_tree_iterator< T >::operator-> | ( | ) | const | 
Reimplemented from freeling::basic_tree_iterator< T, tree< T > >.
| tree_sibling_iterator< T > freeling::basic_nonconst_tree_iterator< T >::sibling_begin | ( | ) | 
| tree_sibling_iterator< T > freeling::basic_nonconst_tree_iterator< T >::sibling_end | ( | ) | 
| tree_sibling_iterator< T > freeling::basic_nonconst_tree_iterator< T >::sibling_rbegin | ( | ) | 
| tree_sibling_iterator< T > freeling::basic_nonconst_tree_iterator< T >::sibling_rend | ( | ) | 
| friend class const_tree_preorder_iterator< T >  [friend] | 
| friend class const_tree_sibling_iterator< T >  [friend] | 
| friend class tree_preorder_iterator< T >  [friend] | 
| friend class tree_sibling_iterator< T >  [friend] | 
 1.7.6.1
 1.7.6.1