Extra data for each node in the tree. More...

Public Member Functions
	NeighborSearchStat ()
	Initialize the statistic with the worst possible distance according to our sorting policy.

template<typename TreeType >
	NeighborSearchStat (TreeType &)
	Initialization for a fully initialized node. More...

void	Reset ()
	Reset statistic parameters to initial values.

double	FirstBound () const
	Get the first bound.

double &	FirstBound ()
	Modify the first bound.

double	SecondBound () const
	Get the second bound.

double &	SecondBound ()
	Modify the second bound.

double	AuxBound () const
	Get the aux bound.

double &	AuxBound ()
	Modify the aux bound.

double	LastDistance () const
	Get the last distance calculation.

double &	LastDistance ()
	Modify the last distance calculation.

template<typename Archive >
void	serialize (Archive &ar, const uint32_t)
	Serialize the statistic to/from an archive.

Detailed Description

Extra data for each node in the tree.

For neighbor searches, each node only needs to store a bound on neighbor distances.

Constructor & Destructor Documentation

template<typename SortPolicy>

template<typename TreeType >

mlpack::neighbor::NeighborSearchStat< SortPolicy >::NeighborSearchStat ( TreeType & )

inline

Initialization for a fully initialized node.

In this case, we don't need to worry about the node.

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