typedef.hpp
Go to the documentation of this file.
1 
13 #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_TYPEDEF_HPP
14 #define MLPACK_CORE_TREE_RECTANGLE_TREE_TYPEDEF_HPP
15 
16 #include "rectangle_tree.hpp"
17 
18 namespace mlpack {
19 namespace tree {
20 
41 template<typename MetricType, typename StatisticType, typename MatType>
42 using RTree = RectangleTree<MetricType,
43  StatisticType,
44  MatType,
45  RTreeSplit,
46  RTreeDescentHeuristic,
48 
69 template<typename MetricType, typename StatisticType, typename MatType>
70 using RStarTree = RectangleTree<MetricType,
71  StatisticType,
72  MatType,
76 
95 template<typename MetricType, typename StatisticType, typename MatType>
96 using XTree = RectangleTree<MetricType,
97  StatisticType,
98  MatType,
99  XTreeSplit,
100  RTreeDescentHeuristic,
102 
126 template<typename TreeType>
129 
130 template<typename MetricType, typename StatisticType, typename MatType>
131 using HilbertRTree = RectangleTree<MetricType,
132  StatisticType,
133  MatType,
137 
161 template<typename MetricType, typename StatisticType, typename MatType>
162 using RPlusTree = RectangleTree<MetricType,
163  StatisticType,
164  MatType,
169 
190 template<typename MetricType, typename StatisticType, typename MatType>
191 using RPlusPlusTree = RectangleTree<MetricType,
192  StatisticType,
193  MatType,
198 } // namespace tree
199 } // namespace mlpack
200 
201 #endif
The RPlusTreeSplit class performs the split process of a node on overflow.
.hpp
Definition: add_to_po.hpp:21
RectangleTree< MetricType, StatisticType, MatType, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation > RTree
An implementation of the R tree that satisfies the TreeType policy API.
Definition: typedef.hpp:47
This class chooses the best child of a node in a Hilbert R tree when inserting a new point...
The splitting procedure for the Hilbert R tree.
The RPlusPlusTreeSplitPolicy helps to determine the subtree into which we should insert a child of an...
A rectangle type tree tree, such as an R-tree or X-tree.
A Rectangle Tree has new points inserted at the bottom.
When descending a RectangleTree to insert a point, we need to have a way to choose a child node when ...
The XTreeAuxiliaryInformation class provides information specific to X trees for each node in a Recta...
The MinimalSplitsNumberSweep class finds a partition along which we can split a node according to the...
A Rectangle Tree has new points inserted at the bottom.
The MinimalCoverageSweep class finds a partition along which we can split a node according to the cov...
The RPlusPlusTreeSplitPolicy helps to determine the subtree into which we should insert a child of an...