binary_tree represents a binary tree with the ability to ‘cascade’ visitor objects down the tree More...

#include <binary_tree.h>

Inheritance diagram for exsample::binary_tree< Value >:

Classes
class	const_iterator
	const_iterator More...

struct	istream_generator
	generator reading binary tree from istream More...

class	iterator
	iterator More...

struct	ostream_visitor
	forward visitor writing out the tree to given ostream More...

Public Types
type definitions
typedef Value	value_type
	define the object type

Public Member Functions
constructors
	binary_tree ()
	default constructor

	binary_tree (const value_type &thevalue, binary_tree *theparent=0)
	construct giving key/cell and parent

	binary_tree (const binary_tree &x)
	binary_tree has a strict ownership; on copying binary trees ownership is transferred

binary_tree &	operator= (const binary_tree &x)
	binary_tree has a strict ownership; on copying binary trees ownership is transferred

Public member access
value_type &	value ()
	return the value held by this node

const value_type &	value () const
	return the value held by this node

bool	root () const
	return true, if this is the root node

bool	leaf () const
	return true, if this node has got children

standard-conforming leaf iterators
std::pair< binary_tree , binary_tree >	neighbours_
	the left and right neighbours of this node

iterator	begin ()
	return begin iterator

iterator	end ()
	return end iterator

iterator	global_begin ()
	return global begin iterator

iterator	global_end ()
	return global end iterator

const_iterator	begin () const
	return begin const_iterator

const_iterator	end () const
	return end const_iterator

const_iterator	global_begin () const
	return global begin iterator

const_iterator	global_end () const
	return global end iterator

bool	empty () const
	return true, if this node is empty

void	clear ()
	clear this node

std::pair< iterator, iterator >	split (std::pair< value_type, value_type > children)
	split this node

template<class Selector >
iterator	select (const Selector &selector)
	select using a selector

template<class Selector , unsigned long bits>
void	subtree_hash (const Selector &selector, bit_container< bits > &bhash)
	generate a hash value for the sub-tree selected by the given selector object

template<class Accessor , class BinaryOp >
BinaryOp::result_type	accumulate (const Accessor &acc, BinaryOp binary_op) const
	accumulate values using a binary function and accessor object

template<class Selector , class Accessor , class BinaryOp >
BinaryOp::result_type	accumulate (const Selector &selector, const Accessor &acc, BinaryOp binary_op) const
	accumulate values only from branches matching a Selector

template<class Accessor , class BinaryOp >
BinaryOp::result_type	tree_accumulate (const Accessor &acc, BinaryOp binary_op)
	accumulate values using a binary function and accessor object, storing intermediate values in nodes

template<class Selector , class Accessor , class BinaryOp >
BinaryOp::result_type	tree_accumulate (const Selector &selector, const Accessor &acc, BinaryOp binary_op)
	accumulate values only from branches matching a Selector

template<class Visitor >
void	cascade (Visitor visitor) const
	forward propagate a visitor to all children nodes

template<class Generator >
void	generate (Generator generator)
	succesively split using a generator

void	left_neighbour (binary_tree *n)
	set the left neighbour

void	right_neighbour (binary_tree *n)
	set the right neighbour

binary_tree *	left_neighbour () const
	get the left neighbour

binary_tree *	right_neighbour () const
	get the right neighbour

binary_tree *	left_most ()
	return the left-most leaf

binary_tree *	right_most ()
	return the right-most leaf

const binary_tree *	left_most () const
	return the left-most leaf

const binary_tree *	right_most () const
	return the right-most leaf

private member access
binary_tree *	parent_
	the parent of this node

std::unique_ptr< value_type >	value_
	the cell held by this node

std::pair< std::unique_ptr< binary_tree >, std::unique_ptr< binary_tree > >	children_
	the children of this node

binary_tree &	parent ()
	return the parent of this node

const binary_tree &	parent () const
	return the parent of this node

binary_tree &	left_child ()
	return the left child of this node

const binary_tree &	left_child () const
	return the left child of this node

binary_tree &	right_child ()
	return the right child of this node

const binary_tree &	right_child () const
	return the right child of this node

put and get from streams
template<class OStream >
void	put (OStream &os) const
	put to ostream

template<class IStream >
void	get (IStream &is)
	get from istream

template<class Selector , unsigned long bits>
void	do_subtree_hash (const Selector &selector, bit_container< bits > &current, unsigned long &position, bool selected=true) const
	calculate hash value

Detailed Description

template<class Value>
class exsample::binary_tree< Value >

binary_tree represents a binary tree with the ability to ‘cascade’ visitor objects down the tree

Definition at line 21 of file binary_tree.h.

Member Typedef Documentation

◆ value_type

template<class Value >

typedef Value exsample::binary_tree< Value >::value_type

define the object type

Definition at line 29 of file binary_tree.h.

Constructor & Destructor Documentation

◆ binary_tree() [1/3]

template<class Value >

exsample::binary_tree< Value >::binary_tree ( )

inline

default constructor

Definition at line 39 of file binary_tree.h.

Referenced by exsample::binary_tree< Value >::split().

◆ binary_tree() [2/3]

template<class Value >

exsample::binary_tree< Value >::binary_tree	(	const value_type &	thevalue,
		binary_tree< Value > *	theparent = `0`
	)

inline

construct giving key/cell and parent

Definition at line 46 of file binary_tree.h.

◆ binary_tree() [3/3]

template<class Value >

exsample::binary_tree< Value >::binary_tree ( const binary_tree< Value > & x )

inline

binary_tree has a strict ownership; on copying binary trees ownership is transferred

Definition at line 55 of file binary_tree.h.

References exsample::binary_tree< Value >::children_, exsample::binary_tree< Value >::neighbours_, exsample::binary_tree< Value >::parent_, exsample::binary_tree< Value >::root(), and exsample::binary_tree< Value >::value_.

Member Function Documentation

◆ accumulate() [1/2]

template<class Value >

template<class Accessor , class BinaryOp >

BinaryOp::result_type exsample::binary_tree< Value >::accumulate	(	const Accessor &	acc,
		BinaryOp	binary_op
	)		const

inline

accumulate values using a binary function and accessor object

Definition at line 525 of file binary_tree.h.

References exsample::binary_tree< Value >::accumulate(), exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), exsample::binary_tree< Value >::right_child(), and exsample::binary_tree< Value >::value().

Referenced by exsample::binary_tree< Value >::accumulate().

◆ accumulate() [2/2]

template<class Value >

template<class Selector , class Accessor , class BinaryOp >

BinaryOp::result_type exsample::binary_tree< Value >::accumulate	(	const Selector &	selector,
		const Accessor &	acc,
		BinaryOp	binary_op
	)		const

inline

accumulate values only from branches matching a Selector

Definition at line 541 of file binary_tree.h.

References exsample::binary_tree< Value >::accumulate(), exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), exsample::binary_tree< Value >::right_child(), and exsample::binary_tree< Value >::value().

◆ begin() [1/2]

template<class Value >

iterator exsample::binary_tree< Value >::begin ( )

inline

return begin iterator

Definition at line 225 of file binary_tree.h.

References exsample::binary_tree< Value >::left_most().

◆ begin() [2/2]

template<class Value >

const_iterator exsample::binary_tree< Value >::begin ( ) const

inline

return begin const_iterator

Definition at line 371 of file binary_tree.h.

References exsample::binary_tree< Value >::left_most().

◆ cascade()

template<class Value >

template<class Visitor >

void exsample::binary_tree< Value >::cascade ( Visitor visitor ) const

inline

forward propagate a visitor to all children nodes

Definition at line 611 of file binary_tree.h.

References exsample::binary_tree< Value >::cascade(), exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), exsample::binary_tree< Value >::right_child(), and exsample::binary_tree< Value >::value().

Referenced by exsample::binary_tree< Value >::cascade(), and exsample::binary_tree< Value >::put().

◆ clear()

template<class Value >

void exsample::binary_tree< Value >::clear ( )

inline

clear this node

Definition at line 439 of file binary_tree.h.

References exsample::binary_tree< Value >::children_, exsample::binary_tree< Value >::clear(), exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), exsample::binary_tree< Value >::neighbours_, exsample::binary_tree< Value >::parent_, exsample::binary_tree< Value >::right_child(), and exsample::binary_tree< Value >::value_.

Referenced by exsample::binary_tree< Value >::clear().

◆ do_subtree_hash()

template<class Value >

template<class Selector , unsigned long bits>

void exsample::binary_tree< Value >::do_subtree_hash	(	const Selector &	selector,
		bit_container< bits > &	current,
		unsigned long &	position,
		bool	selected = `true`
	)		const

inlineprivate

calculate hash value

Definition at line 814 of file binary_tree.h.

References exsample::bit_container< bits >::bit(), exsample::binary_tree< Value >::do_subtree_hash(), exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), exsample::binary_tree< Value >::right_child(), and exsample::binary_tree< Value >::value().

Referenced by exsample::binary_tree< Value >::do_subtree_hash().

◆ empty()

template<class Value >

bool exsample::binary_tree< Value >::empty ( ) const

inline

return true, if this node is empty

Definition at line 436 of file binary_tree.h.

References exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::root(), and exsample::binary_tree< Value >::value_.

Referenced by exsample::binary_tree< Value >::get(), and exsample::binary_tree< Value >::put().

◆ end() [1/2]

template<class Value >

iterator exsample::binary_tree< Value >::end ( )

inline

return end iterator

Definition at line 228 of file binary_tree.h.

References exsample::binary_tree< Value >::right_most().

◆ end() [2/2]

template<class Value >

const_iterator exsample::binary_tree< Value >::end ( ) const

inline

return end const_iterator

Definition at line 374 of file binary_tree.h.

References exsample::binary_tree< Value >::right_most().

◆ generate()

template<class Value >

template<class Generator >

void exsample::binary_tree< Value >::generate ( Generator generator )

inline

succesively split using a generator

Definition at line 622 of file binary_tree.h.

References exsample::generator< Function, Random >::generate(), exsample::binary_tree< Value >::root(), exsample::generator< Function, Random >::split(), exsample::binary_tree< Value >::split(), exsample::binary_tree< Value >::value(), and exsample::binary_tree< Value >::value_.

Referenced by exsample::binary_tree< Value >::get().

◆ get()

template<class Value >

template<class IStream >

void exsample::binary_tree< Value >::get ( IStream & is )

inline

get from istream

Definition at line 788 of file binary_tree.h.

References exsample::binary_tree< Value >::empty(), exsample::binary_tree< Value >::generate(), exsample::binary_tree< Value >::value(), and exsample::binary_tree< Value >::value_.

◆ global_begin() [1/2]

template<class Value >

iterator exsample::binary_tree< Value >::global_begin ( )

inline

return global begin iterator

Definition at line 231 of file binary_tree.h.

References exsample::binary_tree< Value >::global_begin(), exsample::binary_tree< Value >::left_most(), exsample::binary_tree< Value >::parent(), and exsample::binary_tree< Value >::root().

Referenced by exsample::binary_tree< Value >::global_begin().

◆ global_begin() [2/2]

template<class Value >

const_iterator exsample::binary_tree< Value >::global_begin ( ) const

inline

return global begin iterator

Definition at line 377 of file binary_tree.h.

References exsample::binary_tree< Value >::global_begin(), exsample::binary_tree< Value >::left_most(), exsample::binary_tree< Value >::parent(), and exsample::binary_tree< Value >::root().

◆ global_end() [1/2]

template<class Value >

iterator exsample::binary_tree< Value >::global_end ( )

inline

return global end iterator

Definition at line 238 of file binary_tree.h.

References exsample::binary_tree< Value >::global_end(), exsample::binary_tree< Value >::parent(), exsample::binary_tree< Value >::right_most(), and exsample::binary_tree< Value >::root().

Referenced by exsample::binary_tree< Value >::global_end(), and exsample::binary_tree< Value >::select().

◆ global_end() [2/2]

template<class Value >

const_iterator exsample::binary_tree< Value >::global_end ( ) const

inline

return global end iterator

Definition at line 384 of file binary_tree.h.

References exsample::binary_tree< Value >::global_end(), exsample::binary_tree< Value >::parent(), exsample::binary_tree< Value >::right_most(), and exsample::binary_tree< Value >::root().

◆ leaf()

template<class Value >

bool exsample::binary_tree< Value >::leaf ( ) const

inline

return true, if this node has got children

Definition at line 647 of file binary_tree.h.

References exsample::binary_tree< Value >::children_.

◆ left_child() [1/2]

template<class Value >

binary_tree & exsample::binary_tree< Value >::left_child ( )

inlineprivate

return the left child of this node

Definition at line 848 of file binary_tree.h.

References exsample::binary_tree< Value >::children_.

Referenced by exsample::binary_tree< Value >::accumulate(), exsample::binary_tree< Value >::cascade(), exsample::binary_tree< Value >::clear(), exsample::binary_tree< Value >::do_subtree_hash(), exsample::binary_tree< Value >::left_most(), exsample::binary_tree< Value >::select(), and exsample::binary_tree< Value >::tree_accumulate().

◆ left_child() [2/2]

template<class Value >

const binary_tree & exsample::binary_tree< Value >::left_child ( ) const

inlineprivate

return the left child of this node

Definition at line 851 of file binary_tree.h.

References exsample::binary_tree< Value >::children_.

◆ left_most() [1/2]

template<class Value >

binary_tree * exsample::binary_tree< Value >::left_most ( )

inlineprivate

return the left-most leaf

Definition at line 405 of file binary_tree.h.

References exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), and exsample::binary_tree< Value >::left_most().

Referenced by exsample::binary_tree< Value >::begin(), exsample::binary_tree< Value >::global_begin(), and exsample::binary_tree< Value >::left_most().

◆ left_most() [2/2]

template<class Value >

const binary_tree * exsample::binary_tree< Value >::left_most ( ) const

inlineprivate

return the left-most leaf

Definition at line 417 of file binary_tree.h.

References exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), and exsample::binary_tree< Value >::left_most().

◆ left_neighbour() [1/2]

template<class Value >

binary_tree * exsample::binary_tree< Value >::left_neighbour ( ) const

inlineprivate

get the left neighbour

Definition at line 399 of file binary_tree.h.

References exsample::binary_tree< Value >::neighbours_.

◆ left_neighbour() [2/2]

template<class Value >

void exsample::binary_tree< Value >::left_neighbour ( binary_tree< Value > * n )

inlineprivate

set the left neighbour

Definition at line 393 of file binary_tree.h.

References exsample::binary_tree< Value >::neighbours_.

Referenced by exsample::binary_tree< Value >::iterator::operator--(), and exsample::binary_tree< Value >::const_iterator::operator--().

◆ operator=()

template<class Value >

binary_tree & exsample::binary_tree< Value >::operator= ( const binary_tree< Value > & x )

inline

binary_tree has a strict ownership; on copying binary trees ownership is transferred

Definition at line 71 of file binary_tree.h.

References exsample::binary_tree< Value >::children_, exsample::binary_tree< Value >::neighbours_, exsample::binary_tree< Value >::parent_, exsample::binary_tree< Value >::root(), and exsample::binary_tree< Value >::value_.

◆ parent() [1/2]

template<class Value >

binary_tree & exsample::binary_tree< Value >::parent ( )

inlineprivate

return the parent of this node

Definition at line 842 of file binary_tree.h.

References exsample::binary_tree< Value >::parent_.

Referenced by exsample::binary_tree< Value >::global_begin(), exsample::binary_tree< Value >::global_end(), and exsample::binary_tree< Value >::ostream_visitor< OStream >::visit().

◆ parent() [2/2]

template<class Value >

const binary_tree & exsample::binary_tree< Value >::parent ( ) const

inlineprivate

return the parent of this node

Definition at line 845 of file binary_tree.h.

References exsample::binary_tree< Value >::parent_.

◆ put()

template<class Value >

template<class OStream >

void exsample::binary_tree< Value >::put ( OStream & os ) const

inline

put to ostream

Definition at line 765 of file binary_tree.h.

References exsample::binary_tree< Value >::cascade(), exsample::binary_tree< Value >::empty(), exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::root(), exsample::ostream_traits< OStream >::separator(), and exsample::binary_tree< Value >::value().

Referenced by exsample::binary_tree< Value >::ostream_visitor< OStream >::visit().

◆ right_child() [1/2]

template<class Value >

binary_tree & exsample::binary_tree< Value >::right_child ( )

inlineprivate

return the right child of this node

Definition at line 854 of file binary_tree.h.

References exsample::binary_tree< Value >::children_.

Referenced by exsample::binary_tree< Value >::accumulate(), exsample::binary_tree< Value >::cascade(), exsample::binary_tree< Value >::clear(), exsample::binary_tree< Value >::do_subtree_hash(), exsample::binary_tree< Value >::right_most(), exsample::binary_tree< Value >::select(), and exsample::binary_tree< Value >::tree_accumulate().

◆ right_child() [2/2]

template<class Value >

const binary_tree & exsample::binary_tree< Value >::right_child ( ) const

inlineprivate

return the right child of this node

Definition at line 857 of file binary_tree.h.

References exsample::binary_tree< Value >::children_.

◆ right_most() [1/2]

template<class Value >

binary_tree * exsample::binary_tree< Value >::right_most ( )

inlineprivate

return the right-most leaf

Definition at line 411 of file binary_tree.h.

References exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::right_child(), and exsample::binary_tree< Value >::right_most().

Referenced by exsample::binary_tree< Value >::end(), exsample::binary_tree< Value >::global_end(), and exsample::binary_tree< Value >::right_most().

◆ right_most() [2/2]

template<class Value >

const binary_tree * exsample::binary_tree< Value >::right_most ( ) const

inlineprivate

return the right-most leaf

Definition at line 423 of file binary_tree.h.

References exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::right_child(), and exsample::binary_tree< Value >::right_most().

◆ right_neighbour() [1/2]

template<class Value >

binary_tree * exsample::binary_tree< Value >::right_neighbour ( ) const

inlineprivate

get the right neighbour

Definition at line 402 of file binary_tree.h.

References exsample::binary_tree< Value >::neighbours_.

◆ right_neighbour() [2/2]

template<class Value >

void exsample::binary_tree< Value >::right_neighbour ( binary_tree< Value > * n )

inlineprivate

set the right neighbour

Definition at line 396 of file binary_tree.h.

References exsample::binary_tree< Value >::neighbours_.

Referenced by exsample::binary_tree< Value >::iterator::operator++(), and exsample::binary_tree< Value >::const_iterator::operator++().

◆ root()

template<class Value >

bool exsample::binary_tree< Value >::root ( ) const

inline

return true, if this is the root node

Definition at line 644 of file binary_tree.h.

References exsample::binary_tree< Value >::parent_.

Referenced by exsample::binary_tree< Value >::binary_tree(), exsample::binary_tree< Value >::empty(), exsample::binary_tree< Value >::generate(), exsample::binary_tree< Value >::global_begin(), exsample::binary_tree< Value >::global_end(), exsample::binary_tree< Value >::operator=(), and exsample::binary_tree< Value >::put().

◆ select()

template<class Value >

template<class Selector >

iterator exsample::binary_tree< Value >::select ( const Selector & selector )

inline

select using a selector

Definition at line 486 of file binary_tree.h.

References exsample::binary_tree< Value >::global_end(), exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), exsample::binary_tree< Value >::right_child(), exsample::binary_tree< Value >::select(), and exsample::binary_tree< Value >::value().

Referenced by exsample::binary_tree< Value >::select().

◆ split()

template<class Value >

std::pair< iterator, iterator > exsample::binary_tree< Value >::split ( std::pair< value_type, value_type > children )

inline

split this node

Definition at line 454 of file binary_tree.h.

References exsample::binary_tree< Value >::binary_tree(), exsample::binary_tree< Value >::children_, exsample::binary_tree< Value >::leaf(), and exsample::binary_tree< Value >::neighbours_.

Referenced by exsample::binary_tree< Value >::generate().

◆ subtree_hash()

template<class Value >

template<class Selector , unsigned long bits>

void exsample::binary_tree< Value >::subtree_hash	(	const Selector &	selector,
		bit_container< bits > &	bhash
	)

inline

generate a hash value for the sub-tree selected by the given selector object

Definition at line 516 of file binary_tree.h.

◆ tree_accumulate() [1/2]

template<class Value >

template<class Accessor , class BinaryOp >

BinaryOp::result_type exsample::binary_tree< Value >::tree_accumulate	(	const Accessor &	acc,
		BinaryOp	binary_op
	)

inline

accumulate values using a binary function and accessor object, storing intermediate values in nodes

Definition at line 567 of file binary_tree.h.

References exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), exsample::binary_tree< Value >::right_child(), exsample::binary_tree< Value >::tree_accumulate(), and exsample::binary_tree< Value >::value().

Referenced by exsample::binary_tree< Value >::tree_accumulate().

◆ tree_accumulate() [2/2]

template<class Value >

template<class Selector , class Accessor , class BinaryOp >

BinaryOp::result_type exsample::binary_tree< Value >::tree_accumulate	(	const Selector &	selector,
		const Accessor &	acc,
		BinaryOp	binary_op
	)

inline

accumulate values only from branches matching a Selector

Definition at line 585 of file binary_tree.h.

References exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), exsample::binary_tree< Value >::right_child(), exsample::binary_tree< Value >::tree_accumulate(), and exsample::binary_tree< Value >::value().

◆ value() [1/2]

template<class Value >

value_type & exsample::binary_tree< Value >::value ( )

inline

return the value held by this node

Definition at line 638 of file binary_tree.h.

References exsample::binary_tree< Value >::value_.

Referenced by exsample::binary_tree< Value >::accumulate(), exsample::binary_tree< Value >::cascade(), exsample::binary_tree< Value >::do_subtree_hash(), exsample::binary_tree< Value >::generate(), exsample::binary_tree< Value >::get(), exsample::binary_tree< Value >::iterator::operator*(), exsample::binary_tree< Value >::const_iterator::operator*(), exsample::binary_tree< Value >::put(), exsample::binary_tree< Value >::select(), and exsample::binary_tree< Value >::tree_accumulate().

◆ value() [2/2]

template<class Value >

const value_type & exsample::binary_tree< Value >::value ( ) const

inline

return the value held by this node

Definition at line 641 of file binary_tree.h.

References exsample::binary_tree< Value >::value_.

Member Data Documentation

◆ children_

template<class Value >

std::pair<std::unique_ptr<binary_tree>, std::unique_ptr<binary_tree> > exsample::binary_tree< Value >::children_

private

the children of this node

Definition at line 871 of file binary_tree.h.

Referenced by exsample::binary_tree< Value >::binary_tree(), exsample::binary_tree< Value >::clear(), exsample::binary_tree< Value >::leaf(), exsample::binary_tree< Value >::left_child(), exsample::binary_tree< Value >::operator=(), exsample::binary_tree< Value >::right_child(), and exsample::binary_tree< Value >::split().

◆ neighbours_

template<class Value >

std::pair<binary_tree*,binary_tree*> exsample::binary_tree< Value >::neighbours_

private

the left and right neighbours of this node

Definition at line 429 of file binary_tree.h.

Referenced by exsample::binary_tree< Value >::binary_tree(), exsample::binary_tree< Value >::clear(), exsample::binary_tree< Value >::left_neighbour(), exsample::binary_tree< Value >::operator=(), exsample::binary_tree< Value >::right_neighbour(), and exsample::binary_tree< Value >::split().

◆ parent_

template<class Value >

binary_tree* exsample::binary_tree< Value >::parent_

private

the parent of this node

Definition at line 864 of file binary_tree.h.

Referenced by exsample::binary_tree< Value >::binary_tree(), exsample::binary_tree< Value >::clear(), exsample::binary_tree< Value >::operator=(), exsample::binary_tree< Value >::parent(), and exsample::binary_tree< Value >::root().

◆ value_

template<class Value >

std::unique_ptr<value_type> exsample::binary_tree< Value >::value_

private

the cell held by this node

Definition at line 867 of file binary_tree.h.

Referenced by exsample::binary_tree< Value >::binary_tree(), exsample::binary_tree< Value >::clear(), exsample::binary_tree< Value >::empty(), exsample::binary_tree< Value >::generate(), exsample::binary_tree< Value >::get(), exsample::binary_tree< Value >::operator=(), and exsample::binary_tree< Value >::value().

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

binary_tree.h

Classes

Public Types

Public Member Functions

standard-conforming leaf iterators

private member access

put and get from streams

Detailed Description

Member Typedef Documentation

◆ value_type

Constructor & Destructor Documentation

◆ binary_tree() [1/3]

◆ binary_tree() [2/3]

◆ binary_tree() [3/3]

Member Function Documentation

◆ accumulate() [1/2]

◆ accumulate() [2/2]

◆ begin() [1/2]

◆ begin() [2/2]

◆ cascade()

◆ clear()

◆ do_subtree_hash()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ generate()

◆ get()

◆ global_begin() [1/2]

◆ global_begin() [2/2]

◆ global_end() [1/2]

◆ global_end() [2/2]

◆ leaf()

◆ left_child() [1/2]

◆ left_child() [2/2]

◆ left_most() [1/2]

◆ left_most() [2/2]

◆ left_neighbour() [1/2]

◆ left_neighbour() [2/2]

◆ operator=()

◆ parent() [1/2]

◆ parent() [2/2]

◆ put()

◆ right_child() [1/2]

◆ right_child() [2/2]

◆ right_most() [1/2]

◆ right_most() [2/2]

◆ right_neighbour() [1/2]

◆ right_neighbour() [2/2]

◆ root()

◆ select()

◆ split()

◆ subtree_hash()

◆ tree_accumulate() [1/2]

◆ tree_accumulate() [2/2]

◆ value() [1/2]

◆ value() [2/2]

Member Data Documentation

◆ children_

◆ neighbours_

◆ parent_

◆ value_