mlpack  3.4.2
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,
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,
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
rectangle_tree.hpp
mlpack::tree::HilbertRTreeDescentHeuristic
This class chooses the best child of a node in a Hilbert R tree when inserting a new point.
Definition: hilbert_r_tree_descent_heuristic.hpp:27
mlpack::tree::RTreeDescentHeuristic
When descending a RectangleTree to insert a point, we need to have a way to choose a child node when ...
Definition: r_tree_descent_heuristic.hpp:27
mlpack::tree::XTreeAuxiliaryInformation
The XTreeAuxiliaryInformation class provides information specific to X trees for each node in a Recta...
Definition: x_tree_auxiliary_information.hpp:25
mlpack::tree::RPlusTreeSplit
The RPlusTreeSplit class performs the split process of a node on overflow.
Definition: r_plus_tree_split.hpp:33
mlpack::tree::MinimalSplitsNumberSweep
The MinimalSplitsNumberSweep class finds a partition along which we can split a node according to the...
Definition: minimal_splits_number_sweep.hpp:32
mlpack::tree::HilbertRTreeSplit
The splitting procedure for the Hilbert R tree.
Definition: hilbert_r_tree_split.hpp:30
mlpack::tree::RPlusTreeSplitPolicy
The RPlusPlusTreeSplitPolicy helps to determine the subtree into which we should insert a child of an...
Definition: r_plus_tree_split_policy.hpp:26
mlpack::tree::XTreeSplit
A Rectangle Tree has new points inserted at the bottom.
Definition: x_tree_split.hpp:37
mlpack::tree::RPlusTreeDescentHeuristic
Definition: r_plus_tree_descent_heuristic.hpp:22
mlpack
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: add_to_cli11.hpp:21
mlpack::tree::RPlusPlusTreeAuxiliaryInformation
Definition: r_plus_plus_tree_auxiliary_information.hpp:25
mlpack::tree::RTreeSplit
A Rectangle Tree has new points inserted at the bottom.
Definition: r_tree_split.hpp:27
mlpack::tree::RStarTreeDescentHeuristic
When descending a RectangleTree to insert a point, we need to have a way to choose a child node when ...
Definition: r_star_tree_descent_heuristic.hpp:27
mlpack::tree::RStarTreeSplit
A Rectangle Tree has new points inserted at the bottom.
Definition: r_star_tree_split.hpp:27
mlpack::tree::RectangleTree
A rectangle type tree tree, such as an R-tree or X-tree.
Definition: rectangle_tree.hpp:55
mlpack::tree::MinimalCoverageSweep
The MinimalCoverageSweep class finds a partition along which we can split a node according to the cov...
Definition: minimal_coverage_sweep.hpp:31
mlpack::tree::NoAuxiliaryInformation
Definition: no_auxiliary_information.hpp:21
mlpack::tree::RPlusPlusTreeDescentHeuristic
Definition: r_plus_plus_tree_descent_heuristic.hpp:22
mlpack::tree::HilbertRTreeAuxiliaryInformation
Definition: hilbert_r_tree_auxiliary_information.hpp:23
mlpack::tree::RPlusPlusTreeSplitPolicy
The RPlusPlusTreeSplitPolicy helps to determine the subtree into which we should insert a child of an...
Definition: r_plus_plus_tree_split_policy.hpp:26