13 #ifndef MLPACK_CORE_TREE_COVER_TREE_TRAITS_HPP 14 #define MLPACK_CORE_TREE_COVER_TREE_TRAITS_HPP 27 template<
typename MetricType,
28 typename StatisticType,
30 typename RootPointPolicy>
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: cv.hpp:1
static const bool RearrangesDataset
This is true if the tree rearranges points in the dataset when it is built.
Definition: tree_traits.hpp:105
static const bool HasOverlappingChildren
This is true if the subspaces represented by the children of a node can overlap.
Definition: tree_traits.hpp:84
static const bool FirstPointIsCentroid
This is true if the first point of each node is the centroid of its bound.
Definition: tree_traits.hpp:94
static const bool UniqueNumDescendants
This is true if the NumDescendants() method doesn't include duplicated points.
Definition: tree_traits.hpp:116
static const bool HasDuplicatedPoints
This is true if a point can be included in more than one node.
Definition: tree_traits.hpp:89
The TreeTraits class provides compile-time information on the characteristics of a given tree type...
Definition: tree_traits.hpp:77
static const bool BinaryTree
This is true if the tree always has only two children.
Definition: tree_traits.hpp:110
A cover tree is a tree specifically designed to speed up nearest-neighbor computation in high-dimensi...
Definition: cover_tree.hpp:99
static const bool HasSelfChildren
This is true if the points contained in the first child of a node (Child(0)) are also contained in th...
Definition: tree_traits.hpp:100