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
18namespace mlpack {
19namespace tree {
20
41template<typename MetricType, typename StatisticType, typename MatType>
42using RTree = RectangleTree<MetricType,
43 StatisticType,
44 MatType,
48
69template<typename MetricType, typename StatisticType, typename MatType>
70using RStarTree = RectangleTree<MetricType,
71 StatisticType,
72 MatType,
76
95template<typename MetricType, typename StatisticType, typename MatType>
96using XTree = RectangleTree<MetricType,
97 StatisticType,
98 MatType,
102
126template<typename TreeType>
129
130template<typename MetricType, typename StatisticType, typename MatType>
131using HilbertRTree = RectangleTree<MetricType,
132 StatisticType,
133 MatType,
137
161template<typename MetricType, typename StatisticType, typename MatType>
162using RPlusTree = RectangleTree<MetricType,
163 StatisticType,
164 MatType,
169
190template<typename MetricType, typename StatisticType, typename MatType>
191using RPlusPlusTree = RectangleTree<MetricType,
192 StatisticType,
193 MatType,
198} // namespace tree
199} // namespace mlpack
200
201#endif
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 MinimalCoverageSweep class finds a partition along which we can split a node according to the cov...
The MinimalSplitsNumberSweep class finds a partition along which we can split a node according to the...
The RPlusPlusTreeSplitPolicy helps to determine the subtree into which we should insert a child of an...
The RPlusPlusTreeSplitPolicy helps to determine the subtree into which we should insert a child of an...
The RPlusTreeSplit class performs the split process of a node on overflow.
When descending a RectangleTree to insert a point, we need to have a way to choose a child node when ...
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 ...
A Rectangle Tree has new points inserted at the bottom.
A rectangle type tree tree, such as an R-tree or X-tree.
The XTreeAuxiliaryInformation class provides information specific to X trees for each node in a Recta...
A Rectangle Tree has new points inserted at the bottom.
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: cv.hpp:1