kp Namespace Reference

Functions
template<class T1 , class T2 >
void	constructor (T1 *p, T2 &val)
template<class T1 >
void	constructor (T1 *p)
template<class T1 >
void	destructor (T1 *p)

Detailed Description

The tree.hh library for C++ provides an STL-like container class for n-ary trees, templated over the data stored at the nodes. Various types of iterators are provided (post-order, pre-order, and others). Where possible the access methods are compatible with the STL or alternative algorithms are available.

Function Documentation

constructor() [1/2]

template<class T1 , class T2 >

void kp::constructor	(	T1 *	p,
		T2 &	val
	)

Referenced by tree< Filter *>::append_child(), tree< Filter *>::insert(), tree< Filter *>::insert_after(), tree< Filter *>::prepend_child(), and tree< Filter *>::replace().

Here is the caller graph for this function:

constructor() [2/2]

template<class T1 >

void kp::constructor

(

T1 *

p

)

destructor()

template<class T1 >

void kp::destructor

(

T1 *

p

)

Referenced by tree< Filter *>::erase(), tree< Filter *>::erase_children(), and tree< Filter *>::replace().

Here is the caller graph for this function: