tree< T > Class Template Reference

#include <tree.h>

Inheritance diagram for tree< T >:

Collaboration diagram for tree< T >:

List of all members.

Public Types
typedef class generic_iterator< T >	generic_iterator
typedef class generic_const_iterator< T >	generic_const_iterator
typedef class preorder_iterator< T >	preorder_iterator
typedef class const_preorder_iterator< T >	const_preorder_iterator
typedef class sibling_iterator< T >	sibling_iterator
typedef class const_sibling_iterator< T >	const_sibling_iterator
typedef preorder_iterator	iterator
typedef const_preorder_iterator	const_iterator
Public Member Functions
	tree ()
	Method implementations for class tree.
	tree (const T &)
	constructor: one-node tree
	tree (const tree< T > &)
	copy constructor
	tree (const typename tree< T >::preorder_iterator &)
	constructor from an iterator
	~tree ()
	destructor
tree< T > &	operator= (const tree< T > &)
	assignment
unsigned int	num_children () const
	number of children
sibling_iterator	nth_child (unsigned int) const
	access nth child
iterator	get_parent () const
	access parent
tree< T > &	nth_child_ref (unsigned int) const
	access nth child ref (useful for Java API)
T &	get_info ()
	access info (useful for Java API)
void	append_child (const tree< T > &)
	append child to a tree
void	hang_child (tree< T > &, bool=true)
	hang a tree as last child of another (no copying!!)
void	clear ()
bool	empty () const
	detect empty tree
sibling_iterator	sibling_begin ()
	begin/end sibling iterator
const_sibling_iterator	sibling_begin () const
sibling_iterator	sibling_end ()
const_sibling_iterator	sibling_end () const
sibling_iterator	sibling_rbegin ()
const_sibling_iterator	sibling_rbegin () const
sibling_iterator	sibling_rend ()
const_sibling_iterator	sibling_rend () const
preorder_iterator	begin ()
	begin/end preorder iterator
const_preorder_iterator	begin () const
preorder_iterator	end ()
const_preorder_iterator	end () const
Public Attributes
T	info
Private Member Functions
void	clone (const tree< T > &)
	clone an entire tree
Private Attributes
bool	isempty
tree *	parent
tree *	first
tree *	last
tree *	prev
tree *	next
Friends
class	preorder_iterator< T >
class	const_preorder_iterator< T >
class	sibling_iterator< T >
class	const_sibling_iterator< T >

template<class T>
class tree< T >

---

Member Typedef Documentation

template<class T>

typedef const_preorder_iterator tree< T >::const_iterator

template<class T>

typedef class const_preorder_iterator< T > tree< T >::const_preorder_iterator

template<class T>

typedef class const_sibling_iterator< T > tree< T >::const_sibling_iterator

template<class T>

typedef class generic_const_iterator< T > tree< T >::generic_const_iterator

template<class T>

typedef class generic_iterator< T > tree< T >::generic_iterator

template<class T>

typedef preorder_iterator tree< T >::iterator

template<class T>

typedef class preorder_iterator< T > tree< T >::preorder_iterator

template<class T>

typedef class sibling_iterator< T > tree< T >::sibling_iterator

---

Constructor & Destructor Documentation

template<class T >

tree< T >::tree

(

)

Method implementations for class tree.

constructor: empty tree doesn't exist, it's a one-node tree with no info. Be careful

References last, next, and prev.

template<class T>

tree< T >::tree

(

const T &

x

)

constructor: one-node tree

References tree< T >::first, tree< T >::isempty, tree< T >::last, tree< T >::next, tree< T >::parent, and tree< T >::prev.

template<class T>

tree< T >::tree

(

const tree< T > &

t

)

copy constructor

template<class T>

tree< T >::tree

(

const typename tree< T >::preorder_iterator &

p

)

constructor from an iterator

template<class T >

tree< T >::~tree

(

)

destructor

References tree< T >::next.

---

Member Function Documentation

template<class T>

void tree< T >::append_child

(

const tree< T > &

child

)

append child to a tree

References tree< T >::clone(), last, tree< T >::next, tree< T >::parent, and tree< T >::prev.

template<class T >

tree< T >::preorder_iterator tree< T >::begin

(

)

begin/end preorder iterator

Referenced by dep_txala::analyze(), completer::applyRule(), completer::complete(), and depLabeler::label().

template<class T >

tree< T >::const_preorder_iterator tree< T >::begin

(

)

const

template<class T >

void tree< T >::clear

(

)

References last, tree< T >::next, next, and prev.

template<class T>

void tree< T >::clone

(

const tree< T > &

t

)

[private]

clone an entire tree

References tree< T >::clone(), tree< T >::first, tree< T >::info, tree< T >::isempty, last, tree< T >::next, next, tree< T >::parent, tree< T >::prev, and prev.

Referenced by tree< T >::append_child(), and tree< T >::clone().

template<class T >

bool tree< T >::empty

(

)

const

detect empty tree

template<class T >

tree< T >::preorder_iterator tree< T >::end

(

)

template<class T >

tree< T >::const_preorder_iterator tree< T >::end

(

)

const

template<class T >

T & tree< T >::get_info

(

)

access info (useful for Java API)

template<class T >

tree< T >::iterator tree< T >::get_parent

(

)

const

access parent

template<class T>

void tree< T >::hang_child	(	tree< T > &	child,
		bool	last = true
	)

hang a tree as last child of another (no copying!!)

References tree< T >::first, tree< T >::last, last, tree< T >::next, tree< T >::parent, and tree< T >::prev.

Referenced by completer::applyRule(), completer::complete(), and dep_txala::dependencies().

template<class T >

tree< T >::sibling_iterator tree< T >::nth_child

(

unsigned int

n

)

const

access nth child

template<class T >

tree< T > & tree< T >::nth_child_ref

(

unsigned int

n

)

const

access nth child ref (useful for Java API)

template<class T >

unsigned int tree< T >::num_children

(

)

const

number of children

References tree< T >::next.

Referenced by completer::complete().

template<class T>

tree< T > & tree< T >::operator=

(

const tree< T > &

t

)

assignment

template<class T >

tree< T >::sibling_iterator tree< T >::sibling_begin

(

)

begin/end sibling iterator

Referenced by completer::complete().

template<class T >

tree< T >::const_sibling_iterator tree< T >::sibling_begin

(

)

const

template<class T >

tree< T >::sibling_iterator tree< T >::sibling_end

(

)

Referenced by completer::complete().

template<class T >

tree< T >::const_sibling_iterator tree< T >::sibling_end

(

)

const

template<class T >

tree< T >::sibling_iterator tree< T >::sibling_rbegin

(

)

References last.

template<class T >

tree< T >::const_sibling_iterator tree< T >::sibling_rbegin

(

)

const

References last.

template<class T >

tree< T >::sibling_iterator tree< T >::sibling_rend

(

)

template<class T >

tree< T >::const_sibling_iterator tree< T >::sibling_rend

(

)

const

---

Friends And Related Function Documentation

template<class T>

friend class const_preorder_iterator< T > [friend]

template<class T>

friend class const_sibling_iterator< T > [friend]

template<class T>

friend class preorder_iterator< T > [friend]

template<class T>

friend class sibling_iterator< T > [friend]

---

Member Data Documentation

template<class T>

tree* tree< T >::first [private]

Referenced by tree< T >::clone(), tree< T >::hang_child(), and tree< T >::tree().

template<class T>

T tree< T >::info

Referenced by tree< T >::clone(), completer::complete(), and dep_txala::dependencies().

template<class T>

bool tree< T >::isempty [private]

Referenced by tree< T >::clone(), and tree< T >::tree().

template<class T>

tree * tree< T >::last [private]

Referenced by tree< T >::hang_child(), and tree< T >::tree().

template<class T>

tree * tree< T >::next [private]

Referenced by tree< T >::append_child(), tree< T >::clear(), tree< T >::clone(), tree< T >::hang_child(), tree< T >::num_children(), tree< T >::tree(), and tree< T >::~tree().

template<class T>

tree* tree< T >::parent [private]

Referenced by tree< T >::append_child(), tree< T >::clone(), tree< T >::hang_child(), and tree< T >::tree().

template<class T>

tree* tree< T >::prev [private]

Referenced by tree< T >::append_child(), tree< T >::clone(), tree< T >::hang_child(), and tree< T >::tree().

---

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

• tree.h