Type of tree for paritioning the hough space. More...

Inheritance diagram for WeightedParititioningDynTree< T, ADomain, ADomainDivsion >:

Collaboration diagram for WeightedParititioningDynTree< T, ADomain, ADomainDivsion >:

[legend]

Public Member Functions
	WeightedParititioningDynTree (ADomain topDomain, ADomainDivsion domainDivsion)
	Constructor attaching a vector of the weigthed items to the top most node domain.

Node &	getTopNode ()
	Getter for the top node of the tree.

const Node &	getTopNode () const
	Constant getter for the top node of the tree.

int	getNNodes () const
	Gets the number of nodes currently contained in the tree Also demonstrates how to walk over the tree.

std::map< int, int >	getNNodesByLevel () const
	Gets the number of nodes by level in the tree Also demonstrates how to walk over the tree.

void	walk (AWalker &walker)
	Forward walk to the top node.

void	walk (AWalker &walker, APriorityMeasure &priority)
	Forward walk to the top node.

void	fell ()
	Fell to tree meaning deleting all child nodes from the tree. Keeps the top node.

void	raze ()
	Like fell but also releases all memory the tree has aquired during long execution.

Public Attributes
SubPropertiesFactory	m_subPropertiesFactory
	Instance of the properties factory for the sub nodes.

Node	m_topNode
	Memory for the top node of the tree.

std::deque< typename Node::Children >	m_children
	Central point to provide memory for the child structures.

size_t	m_nUsedChildren
	Last index of used children.

Private Types
using	Super = DynTree< WithWeightedItems< ADomain, T >, ADomainDivsion >
	Type of the base class.

using	This = DynTree< WithWeightedItems< ADomain, T >, ADomainDivsion >
	Type of this class.

using	Properties = WithWeightedItems< ADomain, T >
	Type of the Properties.

using	SubPropertiesFactory = ADomainDivsion
	Type of the factory for the sub node properties.

Private Member Functions
std::vector< Node > *	createChildren (Node *parentNode)
	Create child nodes for the given parents.

std::vector< Node > *	getUnusedChildren ()
	Aquire the next unused child node structure, recycling all memory.

Detailed Description

Type of tree for paritioning the hough space.

Definition at line 29 of file WeightedFastHoughTree.h.

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

Public Member Functions