RPlusPlusTreeDescentHeuristic Class Reference

Static Public Member Functions
template < typename TreeType >
static size_t	ChooseDescentNode (TreeType *node, const size_t point)
	Evaluate the node using a heuristic. More...
template < typename TreeType >
static size_t	ChooseDescentNode (const TreeType *node, const TreeType *insertedNode)
	Evaluate the node using a heuristic. More...

Detailed Description

Definition at line 21 of file r_plus_plus_tree_descent_heuristic.hpp.

Member Function Documentation

ChooseDescentNode() [1/2]

static size_t ChooseDescentNode ( TreeType *  node, const size_t  point  )

static

Evaluate the node using a heuristic.

Returns the number of the node with minimum largest Hilbert value is greater than the Hilbert value of the point being inserted.

Parameters

node	The node that is being evaluated.
point	The number of the point that is being inserted.

ChooseDescentNode() [2/2]

static size_t ChooseDescentNode ( const TreeType *  node, const TreeType *  insertedNode  )

static

Evaluate the node using a heuristic.

Returns the number of the node with minimum largest Hilbert value is greater than the largest Hilbert value of the point being inserted.

Parameters

node	The node that is being evaluated.
insertedNode	The node that is being inserted.

---

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

• /home/ryan/src/mlpack.org/_src/mlpack-git/src/mlpack/core/tree/rectangle_tree/r_plus_plus_tree_descent_heuristic.hpp