The RPlusTreeSplit class performs the split process of a node on overflow.
More...
#include <r_plus_tree_split.hpp>
|
|
typedef SplitPolicyType | SplitPolicy |
| |
|
| template<typename TreeType > |
| static void | SplitLeafNode (TreeType *tree, std::vector< bool > &relevels) |
| | Split a leaf node using the "default" algorithm. More...
|
| |
| template<typename TreeType > |
| static bool | SplitNonLeafNode (TreeType *tree, std::vector< bool > &relevels) |
| | Split a non-leaf node using the "default" algorithm. More...
|
| |
template<typename SplitPolicyType, template< typename > class SweepType>
class mlpack::tree::RPlusTreeSplit< SplitPolicyType, SweepType >
The RPlusTreeSplit class performs the split process of a node on overflow.
- Template Parameters
-
| SplitPolicyType | The class that helps to determine the subtree into which we should insert a child node. |
| SweepType | The class that finds the partition of a node along a given axis. The partition algorithm tries to find a partition along each axis, evaluates each partition and chooses the best one. |
◆ SplitLeafNode()
template<typename SplitPolicyType , template< typename > class SweepType>
template<typename TreeType >
Split a leaf node using the "default" algorithm.
If necessary, this split will propagate upwards through the tree.
- Parameters
-
| tree | The node that is being split. |
| relevels | Not used. |
◆ SplitNonLeafNode()
template<typename SplitPolicyType , template< typename > class SweepType>
template<typename TreeType >
Split a non-leaf node using the "default" algorithm.
If this is a root node, the tree increases in depth.
- Parameters
-
| tree | The node that is being split. |
| relevels | Not used. |
The documentation for this class was generated from the following files:
