mlpack 3.4.2
typedef.hpp
Go to the documentation of this file.
1
13#ifndef MLPACK_CORE_TREE_BINARY_SPACE_TREE_TYPEDEF_HPP
14#define MLPACK_CORE_TREE_BINARY_SPACE_TREE_TYPEDEF_HPP
15
16// In case it hasn't been included yet.
17#include "../binary_space_tree.hpp"
18
19namespace mlpack {
20namespace tree {
21
58template<typename MetricType, typename StatisticType, typename MatType>
59using KDTree = BinarySpaceTree<MetricType,
60 StatisticType,
61 MatType,
64
75template<typename MetricType, typename StatisticType, typename MatType>
77 StatisticType,
78 MatType,
80 MeanSplit>;
81
107template<typename MetricType, typename StatisticType, typename MatType>
108using BallTree = BinarySpaceTree<MetricType,
109 StatisticType,
110 MatType,
113
136template<typename MetricType, typename StatisticType, typename MatType>
138 StatisticType,
139 MatType,
141 MeanSplit>;
142
190template<typename BoundType,
191 typename MatType = arma::mat>
193
194template<typename MetricType, typename StatisticType, typename MatType>
195using VPTree = BinarySpaceTree<MetricType,
196 StatisticType,
197 MatType,
200
227template<typename MetricType, typename StatisticType, typename MatType>
228using MaxRPTree = BinarySpaceTree<MetricType,
229 StatisticType,
230 MatType,
233
261template<typename MetricType, typename StatisticType, typename MatType>
262using RPTree = BinarySpaceTree<MetricType,
263 StatisticType,
264 MatType,
267
296template<typename MetricType, typename StatisticType, typename MatType>
297using UBTree = BinarySpaceTree<MetricType,
298 StatisticType,
299 MatType,
302
303} // namespace tree
304} // namespace mlpack
305
306#endif
Ball bound encloses a set of points at a specific distance (radius) from a specific point (center).
Definition: ballbound.hpp:33
The CellBound class describes a bound that consists of a number of hyperrectangles.
Definition: cellbound.hpp:76
Hyper-rectangle bound for an L-metric.
Definition: hrectbound.hpp:55
Hollow ball bound encloses a set of points at a specific distance (radius) from a specific point (cen...
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.
Definition: mean_split.hpp:30
A binary space partitioning tree node is split into its left and right child.
This class splits a node by a random hyperplane.
This class splits a binary space tree.
Split a node into two parts according to the median address of points contained in the node.
The class splits a binary space partitioning tree node according to the median distance to the vantag...
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: cv.hpp:1