mlpack  2.0.1
typedef.hpp
Go to the documentation of this file.
1 
15 #ifndef __MLPACK_CORE_TREE_BINARY_SPACE_TREE_TYPEDEF_HPP
16 #define __MLPACK_CORE_TREE_BINARY_SPACE_TREE_TYPEDEF_HPP
17 
18 // In case it hasn't been included yet.
19 #include "../binary_space_tree.hpp"
20 
21 namespace mlpack {
22 namespace tree {
23 
60 template<typename MetricType, typename StatisticType, typename MatType>
61 using KDTree = BinarySpaceTree<MetricType,
62  StatisticType,
63  MatType,
64  bound::HRectBound,
66 
77 template<typename MetricType, typename StatisticType, typename MatType>
78 using MeanSplitKDTree = BinarySpaceTree<MetricType,
79  StatisticType,
80  MatType,
81  bound::HRectBound,
83 
109 template<typename MetricType, typename StatisticType, typename MatType>
110 using BallTree = BinarySpaceTree<MetricType,
111  StatisticType,
112  MatType,
113  bound::HRectBound,
115 
138 template<typename MetricType, typename StatisticType, typename MatType>
139 using MeanSplitBallTree = BinarySpaceTree<MetricType,
140  StatisticType,
141  MatType,
142  bound::HRectBound,
144 
145 } // namespace tree
146 } // namespace mlpack
147 
148 #endif
BinarySpaceTree< MetricType, StatisticType, MatType, bound::HRectBound, MidpointSplit > KDTree
The standard midpoint-split kd-tree.
Definition: typedef.hpp:65
Linear algebra utility functions, generally performed on matrices or vectors.
A binary space partitioning tree, such as a KD-tree or a ball tree.
A binary space partitioning tree node is split into its left and right child.
A binary space partitioning tree node is split into its left and right child.
Definition: mean_split.hpp:30