mlpack-3.2.1/doxygen/core_2tree_2rectangle__tree_2typedef_8hpp_source.html

 #ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_TYPEDEF_HPP
 #define MLPACK_CORE_TREE_RECTANGLE_TREE_TYPEDEF_HPP

 #include "rectangle_tree.hpp"

 namespace mlpack {
 namespace tree {

 template<typename MetricType, typename StatisticType, typename MatType>
 using RTree = RectangleTree<MetricType,
                             StatisticType,
                             MatType,
                             RTreeSplit,
                             RTreeDescentHeuristic,
                             NoAuxiliaryInformation>;

 template<typename MetricType, typename StatisticType, typename MatType>
 using RStarTree = RectangleTree<MetricType,
                                 StatisticType,
                                 MatType,
                                 RStarTreeSplit,
                                 RStarTreeDescentHeuristic,
                                 NoAuxiliaryInformation>;

 template<typename MetricType, typename StatisticType, typename MatType>
 using XTree = RectangleTree<MetricType,
                             StatisticType,
                             MatType,
                             XTreeSplit,
                             RTreeDescentHeuristic,
                             XTreeAuxiliaryInformation>;

 template<typename TreeType>
 using DiscreteHilbertRTreeAuxiliaryInformation =
       HilbertRTreeAuxiliaryInformation<TreeType, DiscreteHilbertValue>;

 template<typename MetricType, typename StatisticType, typename MatType>
 using HilbertRTree = RectangleTree<MetricType,
                             StatisticType,
                             MatType,
                             HilbertRTreeSplit<2>,
                             HilbertRTreeDescentHeuristic,
                             DiscreteHilbertRTreeAuxiliaryInformation>;

 template<typename MetricType, typename StatisticType, typename MatType>
 using RPlusTree = RectangleTree<MetricType,
                             StatisticType,
                             MatType,
                             RPlusTreeSplit<RPlusTreeSplitPolicy,
                                            MinimalCoverageSweep>,
                             RPlusTreeDescentHeuristic,
                             NoAuxiliaryInformation>;

 template<typename MetricType, typename StatisticType, typename MatType>
 using RPlusPlusTree = RectangleTree<MetricType,
                             StatisticType,
                             MatType,
                             RPlusTreeSplit<RPlusPlusTreeSplitPolicy,
                                            MinimalSplitsNumberSweep>,
                             RPlusPlusTreeDescentHeuristic,
                             RPlusPlusTreeAuxiliaryInformation>;
 } // namespace tree
 } // namespace mlpack

 #endif
mlpack::tree::RPlusTreeSplit
The RPlusTreeSplit class performs the split process of a node on overflow.
Definition: r_plus_tree_split.hpp:32

mlpack
.hpp
Definition: add_to_po.hpp:21

mlpack::tree::HilbertRTreeAuxiliaryInformation
Definition: hilbert_r_tree_auxiliary_information.hpp:22

mlpack::tree::RPlusPlusTreeAuxiliaryInformation
Definition: r_plus_plus_tree_auxiliary_information.hpp:24

mlpack::tree::RTree
RectangleTree< MetricType, StatisticType, MatType, RTreeSplit, RTreeDescentHeuristic, NoAuxiliaryInformation > RTree
An implementation of the R tree that satisfies the TreeType policy API.
Definition: typedef.hpp:47

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:26

mlpack::tree::HilbertRTreeSplit
The splitting procedure for the Hilbert R tree.
Definition: hilbert_r_tree_split.hpp:29

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:25

mlpack::tree::RPlusTreeDescentHeuristic
Definition: r_plus_tree_descent_heuristic.hpp:21

mlpack::tree::RectangleTree
A rectangle type tree tree, such as an R-tree or X-tree.
Definition: rectangle_tree.hpp:54

mlpack::tree::RStarTreeSplit
A Rectangle Tree has new points inserted at the bottom.
Definition: r_star_tree_split.hpp:26

rectangle_tree.hpp

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:26

mlpack::tree::XTreeAuxiliaryInformation
The XTreeAuxiliaryInformation class provides information specific to X trees for each node in a Recta...
Definition: x_tree_auxiliary_information.hpp:24

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:31

mlpack::tree::NoAuxiliaryInformation
Definition: no_auxiliary_information.hpp:20

mlpack::tree::RPlusPlusTreeDescentHeuristic
Definition: r_plus_plus_tree_descent_heuristic.hpp:21

mlpack::tree::XTreeSplit
A Rectangle Tree has new points inserted at the bottom.
Definition: x_tree_split.hpp:36

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: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:25