Public Types
typedef TreeType::ElemType	ElemType
	The element type held by the tree.

typedef bound::HRectBound< metric::EuclideanDistance, ElemType >	BoundType
	The bound type held by the auxiliary information.

Public Member Functions
	RPlusPlusTreeAuxiliaryInformation ()
	Construct the auxiliary information object.

	RPlusPlusTreeAuxiliaryInformation (const TreeType *)
	Construct this as an auxiliary information for the given node. More...

	RPlusPlusTreeAuxiliaryInformation (const RPlusPlusTreeAuxiliaryInformation &other, TreeType *tree, bool=true)
	Create an auxiliary information object by copying from another object. More...

	RPlusPlusTreeAuxiliaryInformation (RPlusPlusTreeAuxiliaryInformation &&other)
	Create an auxiliary information object by moving from another node. More...

bool	HandlePointInsertion (TreeType *, const size_t)
	Some tree types require to save some properties at the insertion process. More...

bool	HandleNodeInsertion (TreeType , TreeType , bool)
	Some tree types require to save some properties at the insertion process. More...

bool	HandlePointDeletion (TreeType *, const size_t)
	Some tree types require to save some properties at the deletion process. More...

bool	HandleNodeRemoval (TreeType *, const size_t)
	Some tree types require to save some properties at the deletion process. More...

bool	UpdateAuxiliaryInfo (TreeType *)
	Some tree types require to propagate the information upward. More...

void	SplitAuxiliaryInfo (TreeType treeOne, TreeType treeTwo, const size_t axis, const ElemType cut)
	The R++ tree requires to split the maximum bounding rectangle of a node that is being split. More...

void	NullifyData ()
	Nullify the auxiliary information in order to prevent an invalid free.

BoundType &	OuterBound ()
	Return the maximum bounding rectangle.

const BoundType &	OuterBound () const
	Modify the maximum bounding rectangle.

template<typename Archive >
void	serialize (Archive &, const uint32_t)
	Serialize the information.

Constructor & Destructor Documentation

◆ RPlusPlusTreeAuxiliaryInformation() [1/3]

template<typename TreeType >

mlpack::tree::RPlusPlusTreeAuxiliaryInformation< TreeType >::RPlusPlusTreeAuxiliaryInformation ( const TreeType * tree )

Construct this as an auxiliary information for the given node.

Parameters

*	(node) The node that stores this auxiliary information.

◆ RPlusPlusTreeAuxiliaryInformation() [2/3]

template<typename TreeType >

mlpack::tree::RPlusPlusTreeAuxiliaryInformation< TreeType >::RPlusPlusTreeAuxiliaryInformation	(	const RPlusPlusTreeAuxiliaryInformation< TreeType > &	other,
		TreeType *	tree,
		bool	= `true`
	)

Create an auxiliary information object by copying from another object.

Parameters

other	Another auxiliary information object from which the information will be copied.
tree	The node that holds the auxiliary information.
*	(deepCopy) If false, the new object uses the same memory (not used here).

◆ RPlusPlusTreeAuxiliaryInformation() [3/3]

template<typename TreeType >

mlpack::tree::RPlusPlusTreeAuxiliaryInformation< TreeType >::RPlusPlusTreeAuxiliaryInformation ( RPlusPlusTreeAuxiliaryInformation< TreeType > && other )

Create an auxiliary information object by moving from another node.

Parameters

other The auxiliary information object from which the information will be moved.

Member Function Documentation

◆ HandleNodeInsertion()

template<typename TreeType >

bool mlpack::tree::RPlusPlusTreeAuxiliaryInformation< TreeType >::HandleNodeInsertion	(	TreeType *	,
		TreeType *	,
		bool
	)

Some tree types require to save some properties at the insertion process.

This method allows the auxiliary information the option of manipulating the tree in order to perform the insertion process. If the auxiliary information does that, then the method should return true; if the method returns false the RectangleTree performs its default behavior.

Parameters

*	(node) The node in which the nodeToInsert is being inserted.
*	(nodeToInsert) The node being inserted.
*	(insertionLevel) The level of the tree at which the nodeToInsert should be inserted.

◆ HandleNodeRemoval()

template<typename TreeType >

bool mlpack::tree::RPlusPlusTreeAuxiliaryInformation< TreeType >::HandleNodeRemoval	(	TreeType *	,
		const size_t
	)

Some tree types require to save some properties at the deletion process.

This method allows the auxiliary information the option of manipulating the tree in order to perform the deletion process. If the auxiliary information does that, then the method should return true; if the method returns false the RectangleTree performs its default behavior.

Parameters

*	(node) The node from which the node is being deleted.
*	(nodeIndex) The local index of the node being deleted.

◆ HandlePointDeletion()

template<typename TreeType >

bool mlpack::tree::RPlusPlusTreeAuxiliaryInformation< TreeType >::HandlePointDeletion	(	TreeType *	,
		const size_t
	)

Some tree types require to save some properties at the deletion process.

This method allows the auxiliary information the option of manipulating the tree in order to perform the deletion process. If the auxiliary information does that, then the method should return true; if the method returns false the RectangleTree performs its default behavior.

Parameters

*	(node) The node from which the point is being deleted.
*	(localIndex) The local index of the point being deleted.

◆ HandlePointInsertion()

template<typename TreeType >

bool mlpack::tree::RPlusPlusTreeAuxiliaryInformation< TreeType >::HandlePointInsertion	(	TreeType *	,
		const size_t
	)

Some tree types require to save some properties at the insertion process.

This method allows the auxiliary information the option of manipulating the tree in order to perform the insertion process. If the auxiliary information does that, then the method should return true; if the method returns false the RectangleTree performs its default behavior.

Parameters

*	(node) The node in which the point is being inserted.
*	(point) The global number of the point being inserted.

◆ SplitAuxiliaryInfo()

template<typename TreeType >

void mlpack::tree::RPlusPlusTreeAuxiliaryInformation< TreeType >::SplitAuxiliaryInfo	(	TreeType *	treeOne,
		TreeType *	treeTwo,
		const size_t	axis,
		const ElemType	cut
	)

The R++ tree requires to split the maximum bounding rectangle of a node that is being split.

This method is intended for that.

Parameters

treeOne	The first subtree.
treeTwo	The second subtree.
axis	The axis along which the split is performed.
cut	The coordinate at which the node is split.

◆ UpdateAuxiliaryInfo()

template<typename TreeType >

bool mlpack::tree::RPlusPlusTreeAuxiliaryInformation< TreeType >::UpdateAuxiliaryInfo ( TreeType * )

Some tree types require to propagate the information upward.

This method should return false if this is not the case. If true is returned, the update will be propagated upward.

Parameters

*	(node) The node in which the auxiliary information being update.

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

src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_auxiliary_information.hpp
src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_auxiliary_information_impl.hpp

Public Types

Public Member Functions

Constructor & Destructor Documentation

◆ RPlusPlusTreeAuxiliaryInformation() [1/3]

◆ RPlusPlusTreeAuxiliaryInformation() [2/3]

◆ RPlusPlusTreeAuxiliaryInformation() [3/3]

Member Function Documentation

◆ HandleNodeInsertion()

◆ HandleNodeRemoval()

◆ HandlePointDeletion()

◆ HandlePointInsertion()

◆ SplitAuxiliaryInfo()

◆ UpdateAuxiliaryInfo()