Data Structures
class	fixed_depth_iterator
	Iterator which traverses only the nodes at a given depth from the root. More...

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

class	iterator_base_less
	Comparator class for iterators (compares the actual node content, not pointer values). More...

class	post_order_iterator
	Depth-first iterator, first accessing the children, then the node itself. More...

class	pre_order_iterator
	Depth-first iterator, first accessing the node, then its children. More...

class	sibling_iterator
	Iterator which traverses only the nodes which are siblings of each other. More...

Public Types
typedef T	value_type
	Value of the data stored at a node. More...

typedef pre_order_iterator	iterator
	The default iterator type throughout the tree class. More...

Public Member Functions
	tree (const T &)

	tree (const iterator_base &)

	tree (const tree< T, tree_node_allocator > &)

void	operator= (const tree< T, tree_node_allocator > &)

pre_order_iterator	begin () const
	Return iterator to the beginning of the tree. More...

pre_order_iterator	end () const
	Return iterator to the end of the tree. More...

post_order_iterator	begin_post () const
	Return post-order iterator to the beginning of the tree. More...

post_order_iterator	end_post () const
	Return post-order iterator to the end of the tree. More...

fixed_depth_iterator	begin_fixed (const iterator_base &, unsigned int) const
	Return fixed-depth iterator to the first node at a given depth. More...

fixed_depth_iterator	end_fixed (const iterator_base &, unsigned int) const
	Return fixed-depth iterator to end of the nodes at given depth. More...

sibling_iterator	begin (const iterator_base &) const
	Return sibling iterator to the first child of given node. More...

sibling_iterator	end (const iterator_base &) const
	Return sibling iterator to the end of the children of a given node. More...

template<typename iter >
iter	parent (iter) const
	Return iterator to the parent of a node. More...

template<typename iter >
iter	previous_sibling (iter) const
	Return iterator to the previous sibling of a node. More...

template<typename iter >
iter	next_sibling (iter) const
	Return iterator to the next sibling of a node. More...

template<typename iter >
iter	next_at_same_depth (iter) const
	Return iterator to the next node at a given depth. More...

void	clear ()
	Erase all nodes of the tree. More...

template<typename iter >
iter	erase (iter)
	Erase element at position pointed to by iterator, return incremented iterator. More...

void	erase_children (const iterator_base &)
	Erase all children of the node pointed to by iterator. More...

template<typename iter >
iter	append_child (iter position)
	Insert empty node as last child of node pointed to by position. More...

template<typename iter >
iter	append_child (iter position, const T &x)
	Insert node as last child of node pointed to by position. More...

template<typename iter >
iter	append_child (iter position, iter other_position)
	Append the node (plus its children) at other_position as a child of position. More...

template<typename iter >
iter	append_children (iter position, sibling_iterator from, sibling_iterator to)
	Append the nodes in the from-to range (plus their children) as children of position. More...

pre_order_iterator	set_head (const T &x)
	Short-hand to insert topmost node in otherwise empty tree. More...

template<typename iter >
iter	insert (iter position, const T &x)
	Insert node as previous sibling of node pointed to by position. More...

sibling_iterator	insert (sibling_iterator position, const T &x)
	Specialisation of previous member. More...

template<typename iter >
iter	insert_subtree (iter position, const iterator_base &subtree)
	Insert node (with children) pointed to by subtree as previous sibling of node pointed to by position. More...

template<typename iter >
iter	insert_after (iter position, const T &x)
	Insert node as next sibling of node pointed to by position. More...

template<typename iter >
iter	replace (iter position, const T &x)
	Replace node at 'position' with other node (keeping same children); 'position' becomes invalid. More...

template<typename iter >
iter	replace (iter position, const iterator_base &from)
	Replace node at 'position' with subtree starting at 'from' (do not erase subtree at 'from'); see above. More...

sibling_iterator	replace (sibling_iterator orig_begin, sibling_iterator orig_end, sibling_iterator new_begin, sibling_iterator new_end)
	Replace string of siblings (plus their children) with copy of a new string (with children); see above. More...

template<typename iter >
iter	flatten (iter position)
	Move all children of node at 'position' to be siblings, returns position. More...

template<typename iter >
iter	reparent (iter position, sibling_iterator begin, sibling_iterator end)
	Move nodes in range to be children of 'position'. More...

template<typename iter >
iter	reparent (iter position, iter from)
	Move all child nodes of 'from' to be children of 'position'. More...

template<typename iter >
iter	move_after (iter target, iter source)
	Move 'source' node (plus its children) to become the next sibling of 'target'. More...

template<typename iter >
iter	move_before (iter target, iter source)
	Move 'source' node (plus its children) to become the previous sibling of 'target'. More...

template<typename iter >
iter	move_ontop (iter target, iter source)
	Move 'source' node (plus its children) to become the node at 'target' (erasing the node at 'target'). More...

void	merge (sibling_iterator, sibling_iterator, sibling_iterator, sibling_iterator, bool duplicate_leaves=false)
	Merge with other tree, creating new branches and leaves only if they are not already present. More...

void	sort (sibling_iterator from, sibling_iterator to, bool deep=false)
	Sort (std::sort only moves values of nodes, this one moves children as well). More...

template<class StrictWeakOrdering >
void	sort (sibling_iterator from, sibling_iterator to, StrictWeakOrdering comp, bool deep=false)

template<typename iter >
bool	equal (const iter &one, const iter &two, const iter &three) const
	Compare two ranges of nodes (compares nodes as well as tree structure). More...

template<typename iter , class BinaryPredicate >
bool	equal (const iter &one, const iter &two, const iter &three, BinaryPredicate) const

template<typename iter >
bool	equal_subtree (const iter &one, const iter &two) const

template<typename iter , class BinaryPredicate >
bool	equal_subtree (const iter &one, const iter &two, BinaryPredicate) const

tree	subtree (sibling_iterator from, sibling_iterator to) const
	Extract a new tree formed by the range of siblings plus all their children. More...

void	subtree (tree &, sibling_iterator from, sibling_iterator to) const

void	swap (sibling_iterator it)
	Exchange the node (plus subtree) with its sibling node (do nothing if no sibling present). More...

int	size () const
	Count the total number of nodes. More...

bool	empty () const
	Check if tree is empty. More...

int	depth (const iterator_base &) const
	Compute the depth to the root. More...

unsigned int	number_of_children (const iterator_base &) const
	Count the number of children of node at position. More...

unsigned int	number_of_siblings (const iterator_base &) const
	Count the number of 'next' siblings of node at iterator. More...

bool	is_in_subtree (const iterator_base &position, const iterator_base &begin, const iterator_base &end) const
	Determine whether node at position is in the subtrees with root in the range. More...

bool	is_valid (const iterator_base &) const
	Determine whether the iterator is an 'end' iterator and thus not actually pointing to a node. More...

unsigned int	index (sibling_iterator it) const
	Determine the index of a node in the range of siblings to which it belongs. More...

sibling_iterator	child (const iterator_base &position, unsigned int) const
	Inverse of 'index': return the n-th child of the node at position. More...

Data Fields
tree_node *	head

tree_node *	feet

Protected Types
typedef tree_node_< T >	tree_node

Detailed Description

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

Definition at line 106 of file tree.hh.

Member Typedef Documentation

◆ iterator

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

typedef pre_order_iterator tree< T, tree_node_allocator >::iterator

The default iterator type throughout the tree class.

Definition at line 203 of file tree.hh.

◆ tree_node

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

typedef tree_node_<T> tree< T, tree_node_allocator >::tree_node

protected

Definition at line 109 of file tree.hh.

◆ value_type

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

typedef T tree< T, tree_node_allocator >::value_type

Value of the data stored at a node.

Definition at line 112 of file tree.hh.

Constructor & Destructor Documentation

◆ tree() [1/4]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::tree

Definition at line 439 of file tree.hh.

◆ tree() [2/4]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::tree ( const T & x )

Definition at line 445 of file tree.hh.

◆ tree() [3/4]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::tree ( const iterator_base & other )

Definition at line 452 of file tree.hh.

◆ tree() [4/4]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::tree ( const tree< T, tree_node_allocator > & other )

Definition at line 493 of file tree.hh.

◆ ~tree()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::~tree

Definition at line 460 of file tree.hh.

Member Function Documentation

◆ append_child() [1/3]

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::append_child ( iter position )

Insert empty node as last child of node pointed to by position.

Definition at line 742 of file tree.hh.

Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::merge(), and tree< T, tree_node_allocator >::replace().

◆ append_child() [2/3]

template<class T , class tree_node_allocator >

template<class iter >

iter tree< T, tree_node_allocator >::append_child	(	iter	position,
		const T &	x
	)

Insert node as last child of node pointed to by position.

Definition at line 768 of file tree.hh.

◆ append_child() [3/3]

template<class T , class tree_node_allocator >

template<class iter >

iter tree< T, tree_node_allocator >::append_child	(	iter	position,
		iter	other_position
	)

Append the node (plus its children) at other_position as a child of position.

Definition at line 798 of file tree.hh.

◆ append_children()

template<class T , class tree_node_allocator >

template<class iter >

iter tree< T, tree_node_allocator >::append_children	(	iter	position,
		sibling_iterator	from,
		sibling_iterator	to
	)

Append the nodes in the from-to range (plus their children) as children of position.

Definition at line 808 of file tree.hh.

◆ begin() [1/2]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::pre_order_iterator tree< T, tree_node_allocator >::begin

inline

Return iterator to the beginning of the tree.

Definition at line 581 of file tree.hh.

Referenced by tree< T, tree_node_allocator >::empty(), OfxMainContainer::gen_event(), tree< T, tree_node_allocator >::is_in_subtree(), tree< T, tree_node_allocator >::reparent(), tree< T, tree_node_allocator >::size(), and tree< T, tree_node_allocator >::subtree().

◆ begin() [2/2]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::begin ( const iterator_base & pos ) const

Return sibling iterator to the first child of given node.

Definition at line 650 of file tree.hh.

◆ begin_fixed()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::fixed_depth_iterator tree< T, tree_node_allocator >::begin_fixed	(	const iterator_base &	pos,
		unsigned int	dp
	)		const

Return fixed-depth iterator to the first node at a given depth.

Definition at line 611 of file tree.hh.

◆ begin_post()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::begin_post

Return post-order iterator to the beginning of the tree.

Definition at line 593 of file tree.hh.

◆ child()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::child	(	const iterator_base &	position,
		unsigned int	num
	)		const

Inverse of 'index': return the n-th child of the node at position.

Definition at line 1554 of file tree.hh.

◆ clear()

template<class T , class tree_node_allocator >

void tree< T, tree_node_allocator >::clear

Erase all nodes of the tree.

Definition at line 523 of file tree.hh.

◆ depth()

template<class T , class tree_node_allocator >

int tree< T, tree_node_allocator >::depth ( const iterator_base & it ) const

Compute the depth to the root.

Definition at line 1428 of file tree.hh.

◆ empty()

template<class T , class tree_node_allocator >

bool tree< T, tree_node_allocator >::empty

Check if tree is empty.

Definition at line 1421 of file tree.hh.

◆ end() [1/2]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::pre_order_iterator tree< T, tree_node_allocator >::end

inline

Return iterator to the end of the tree.

Definition at line 587 of file tree.hh.

Referenced by tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::empty(), OfxMainContainer::gen_event(), tree< T, tree_node_allocator >::is_in_subtree(), tree< T, tree_node_allocator >::reparent(), tree< T, tree_node_allocator >::size(), and tree< T, tree_node_allocator >::subtree().

◆ end() [2/2]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::end ( const iterator_base & pos ) const

Return sibling iterator to the end of the children of a given node.

Definition at line 660 of file tree.hh.

◆ end_fixed()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::fixed_depth_iterator tree< T, tree_node_allocator >::end_fixed	(	const iterator_base &	pos,
		unsigned int	dp
	)		const

Return fixed-depth iterator to end of the nodes at given depth.

Definition at line 630 of file tree.hh.

◆ end_post()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::end_post

Return post-order iterator to the end of the tree.

Definition at line 605 of file tree.hh.

◆ equal() [1/2]

template<class T , class tree_node_allocator >

template<typename iter >

bool tree< T, tree_node_allocator >::equal	(	const iter &	one,
		const iter &	two,
		const iter &	three
	)		const

Compare two ranges of nodes (compares nodes as well as tree structure).

Definition at line 1346 of file tree.hh.

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

◆ equal() [2/2]

template<class T , class tree_node_allocator >

template<typename iter , class BinaryPredicate >

bool tree< T, tree_node_allocator >::equal	(	const iter &	one,
		const iter &	two,
		const iter &	three,
		BinaryPredicate	fun
	)		const

Definition at line 1362 of file tree.hh.

◆ equal_subtree() [1/2]

template<class T , class tree_node_allocator >

template<typename iter >

bool tree< T, tree_node_allocator >::equal_subtree	(	const iter &	one,
		const iter &	two
	)		const

Definition at line 1354 of file tree.hh.

◆ equal_subtree() [2/2]

template<class T , class tree_node_allocator >

template<typename iter , class BinaryPredicate >

bool tree< T, tree_node_allocator >::equal_subtree	(	const iter &	one,
		const iter &	two,
		BinaryPredicate	fun
	)		const

Definition at line 1382 of file tree.hh.

◆ erase()

template<class T , class tree_node_allocator >

template<class iter >

iter tree< T, tree_node_allocator >::erase ( iter it )

Erase element at position pointed to by iterator, return incremented iterator.

Definition at line 550 of file tree.hh.

Referenced by tree< T, tree_node_allocator >::clear(), tree< T, tree_node_allocator >::move_ontop(), and tree< T, tree_node_allocator >::replace().

◆ erase_children()

template<class T , class tree_node_allocator >

void tree< T, tree_node_allocator >::erase_children ( const iterator_base & it )

Erase all children of the node pointed to by iterator.

Definition at line 531 of file tree.hh.

Referenced by tree< T, tree_node_allocator >::erase(), tree< T, tree_node_allocator >::erase_children(), and tree< T, tree_node_allocator >::replace().

◆ flatten()

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::flatten ( iter position )

Move all children of node at 'position' to be siblings, returns position.

Definition at line 1064 of file tree.hh.

◆ index()

template<class T , class tree_node_allocator >

unsigned int tree< T, tree_node_allocator >::index ( sibling_iterator it ) const

Determine the index of a node in the range of siblings to which it belongs.

Definition at line 1530 of file tree.hh.

◆ insert() [1/2]

template<class T , class tree_node_allocator >

template<class iter >

iter tree< T, tree_node_allocator >::insert	(	iter	position,
		const T &	x
	)

Insert node as previous sibling of node pointed to by position.

Definition at line 829 of file tree.hh.

Referenced by tree< T, tree_node_allocator >::insert_subtree(), and tree< T, tree_node_allocator >::set_head().

◆ insert() [2/2]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::insert	(	sibling_iterator	position,
		const T &	x
	)

Specialisation of previous member.

Definition at line 857 of file tree.hh.

◆ insert_after()

template<class T , class tree_node_allocator >

template<class iter >

iter tree< T, tree_node_allocator >::insert_after	(	iter	position,
		const T &	x
	)

Insert node as next sibling of node pointed to by position.

Definition at line 890 of file tree.hh.

◆ insert_subtree()

template<class T , class tree_node_allocator >

template<class iter >

iter tree< T, tree_node_allocator >::insert_subtree	(	iter	position,
		const iterator_base &	subtree
	)

Insert node (with children) pointed to by subtree as previous sibling of node pointed to by position.

Definition at line 916 of file tree.hh.

Referenced by tree< T, tree_node_allocator >::append_children(), tree< T, tree_node_allocator >::merge(), and tree< T, tree_node_allocator >::replace().

◆ is_in_subtree()

template<class T , class tree_node_allocator >

bool tree< T, tree_node_allocator >::is_in_subtree	(	const iterator_base &	position,
		const iterator_base &	begin,
		const iterator_base &	end
	)		const

Determine whether node at position is in the subtrees with root in the range.

Definition at line 1509 of file tree.hh.

◆ is_valid()

template<class T , class tree_node_allocator >

bool tree< T, tree_node_allocator >::is_valid ( const iterator_base & it ) const

Determine whether the iterator is an 'end' iterator and thus not actually pointing to a node.

Definition at line 1523 of file tree.hh.

◆ merge()

template<class T , class tree_node_allocator >

void tree< T, tree_node_allocator >::merge	(	sibling_iterator	to1,
		sibling_iterator	to2,
		sibling_iterator	from1,
		sibling_iterator	from2,
		bool	duplicate_leaves = `false`
	)

Merge with other tree, creating new branches and leaves only if they are not already present.

Definition at line 1243 of file tree.hh.

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

◆ move_after()

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::move_after	(	iter	target,
		iter	source
	)

Move 'source' node (plus its children) to become the next sibling of 'target'.

Definition at line 1155 of file tree.hh.

◆ move_before()

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::move_before	(	iter	target,
		iter	source
	)

Move 'source' node (plus its children) to become the previous sibling of 'target'.

Definition at line 1182 of file tree.hh.

◆ move_ontop()

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::move_ontop	(	iter	target,
		iter	source
	)

Move 'source' node (plus its children) to become the node at 'target' (erasing the node at 'target').

Definition at line 1208 of file tree.hh.

◆ next_at_same_depth()

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::next_at_same_depth ( iter position ) const

Return iterator to the next node at a given depth.

Definition at line 697 of file tree.hh.

◆ next_sibling()

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::next_sibling ( iter position ) const

Return iterator to the next sibling of a node.

Definition at line 687 of file tree.hh.

◆ number_of_children()

template<class T , class tree_node_allocator >

unsigned int tree< T, tree_node_allocator >::number_of_children ( const iterator_base & it ) const

Count the number of children of node at position.

Definition at line 1442 of file tree.hh.

◆ number_of_siblings()

template<class T , class tree_node_allocator >

unsigned int tree< T, tree_node_allocator >::number_of_siblings ( const iterator_base & it ) const

Count the number of 'next' siblings of node at iterator.

Definition at line 1458 of file tree.hh.

◆ operator=()

template<class T , class tree_node_allocator >

void tree< T, tree_node_allocator >::operator= ( const tree< T, tree_node_allocator > & other )

Definition at line 487 of file tree.hh.

◆ parent()

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::parent ( iter position ) const

Return iterator to the parent of a node.

Definition at line 669 of file tree.hh.

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

◆ previous_sibling()

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::previous_sibling ( iter position ) const

Return iterator to the previous sibling of a node.

Definition at line 677 of file tree.hh.

◆ reparent() [1/2]

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::reparent	(	iter	position,
		iter	from
	)

Move all child nodes of 'from' to be children of 'position'.

Definition at line 1148 of file tree.hh.

◆ reparent() [2/2]

template<class T , class tree_node_allocator >

template<typename iter >

iter tree< T, tree_node_allocator >::reparent	(	iter	position,
		sibling_iterator	begin,
		sibling_iterator	end
	)

Move nodes in range to be children of 'position'.

Definition at line 1095 of file tree.hh.

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

◆ replace() [1/3]

template<class T , class tree_node_allocator >

template<class iter >

iter tree< T, tree_node_allocator >::replace	(	iter	position,
		const iterator_base &	from
	)

Replace node at 'position' with subtree starting at 'from' (do not erase subtree at 'from'); see above.

Definition at line 945 of file tree.hh.

◆ replace() [2/3]

template<class T , class tree_node_allocator >

template<class iter >

iter tree< T, tree_node_allocator >::replace	(	iter	position,
		const T &	x
	)

Replace node at 'position' with other node (keeping same children); 'position' becomes invalid.

Definition at line 936 of file tree.hh.

Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::insert_subtree(), and tree< T, tree_node_allocator >::subtree().

◆ replace() [3/3]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::replace	(	sibling_iterator	orig_begin,
		sibling_iterator	orig_end,
		sibling_iterator	new_begin,
		sibling_iterator	new_end
	)

Replace string of siblings (plus their children) with copy of a new string (with children); see above.

Definition at line 1015 of file tree.hh.

◆ set_head()

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::pre_order_iterator tree< T, tree_node_allocator >::set_head ( const T & x )

Short-hand to insert topmost node in otherwise empty tree.

Definition at line 821 of file tree.hh.

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

◆ size()

template<class T , class tree_node_allocator >

int tree< T, tree_node_allocator >::size

Count the total number of nodes.

Definition at line 1408 of file tree.hh.

◆ sort() [1/2]

template<class T , class tree_node_allocator >

void tree< T, tree_node_allocator >::sort	(	sibling_iterator	from,
		sibling_iterator	to,
		bool	deep = `false`
	)

Sort (std::sort only moves values of nodes, this one moves children as well).

Definition at line 1272 of file tree.hh.

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

◆ sort() [2/2]

template<class T , class tree_node_allocator >

template<class StrictWeakOrdering >

void tree< T, tree_node_allocator >::sort	(	sibling_iterator	from,
		sibling_iterator	to,
		StrictWeakOrdering	comp,
		bool	deep = `false`
	)

Definition at line 1280 of file tree.hh.

◆ subtree() [1/2]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator > tree< T, tree_node_allocator >::subtree	(	sibling_iterator	from,
		sibling_iterator	to
	)		const

Extract a new tree formed by the range of siblings plus all their children.

Definition at line 1392 of file tree.hh.

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

◆ subtree() [2/2]

template<class T , class tree_node_allocator >

void tree< T, tree_node_allocator >::subtree	(	tree< T, tree_node_allocator > &	tmp,
		sibling_iterator	from,
		sibling_iterator	to
	)		const

Definition at line 1401 of file tree.hh.

◆ swap()

template<class T , class tree_node_allocator >

void tree< T, tree_node_allocator >::swap ( sibling_iterator it )

Exchange the node (plus subtree) with its sibling node (do nothing if no sibling present).

Definition at line 1473 of file tree.hh.

Field Documentation

◆ feet

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

tree_node * tree< T, tree_node_allocator >::feet

Definition at line 383 of file tree.hh.

◆ head

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

tree_node* tree< T, tree_node_allocator >::head

Definition at line 383 of file tree.hh.

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

tree.hh

Data Structures

Public Types

Public Member Functions

Data Fields

Protected Types

Detailed Description

Member Typedef Documentation

◆ iterator

◆ tree_node

◆ value_type

Constructor & Destructor Documentation

◆ tree() [1/4]

◆ tree() [2/4]

◆ tree() [3/4]

◆ tree() [4/4]

◆ ~tree()

Member Function Documentation

◆ append_child() [1/3]

◆ append_child() [2/3]

◆ append_child() [3/3]

◆ append_children()

◆ begin() [1/2]

◆ begin() [2/2]

◆ begin_fixed()

◆ begin_post()

◆ child()

◆ clear()

◆ depth()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ end_fixed()

◆ end_post()

◆ equal() [1/2]

◆ equal() [2/2]

◆ equal_subtree() [1/2]

◆ equal_subtree() [2/2]

◆ erase()

◆ erase_children()

◆ flatten()

◆ index()

◆ insert() [1/2]

◆ insert() [2/2]

◆ insert_after()

◆ insert_subtree()

◆ is_in_subtree()

◆ is_valid()

◆ merge()

◆ move_after()

◆ move_before()

◆ move_ontop()

◆ next_at_same_depth()

◆ next_sibling()

◆ number_of_children()

◆ number_of_siblings()

◆ operator=()

◆ parent()

◆ previous_sibling()

◆ reparent() [1/2]

◆ reparent() [2/2]

◆ replace() [1/3]

◆ replace() [2/3]

◆ replace() [3/3]

◆ set_head()

◆ size()

◆ sort() [1/2]

◆ sort() [2/2]

◆ subtree() [1/2]

◆ subtree() [2/2]

◆ swap()

Field Documentation

◆ feet

◆ head