mlpack  1.0.12
traits.hpp
Go to the documentation of this file.
1 
15 #ifndef __MLPACK_CORE_TREE_COVER_TREE_TRAITS_HPP
16 #define __MLPACK_CORE_TREE_COVER_TREE_TRAITS_HPP
17 
19 
20 namespace mlpack {
21 namespace tree {
22 
29 template<typename MetricType,
30  typename RootPointPolicy,
31  typename StatisticType>
32 class TreeTraits<CoverTree<MetricType, RootPointPolicy, StatisticType> >
33 {
34  public:
39  static const bool HasOverlappingChildren = true;
40 
45  static const bool FirstPointIsCentroid = true;
46 
50  static const bool HasSelfChildren = true;
51 
55  static const bool RearrangesDataset = false;
56 };
57 
58 }; // namespace tree
59 }; // namespace mlpack
60 
61 #endif
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: load.hpp:23
static const bool RearrangesDataset
This is true if the tree rearranges points in the dataset when it is built.
static const bool HasOverlappingChildren
This is true if the subspaces represented by the children of a node can overlap.
Definition: tree_traits.hpp:87
static const bool FirstPointIsCentroid
This is true if Point(0) is the centroid of the node.
Definition: tree_traits.hpp:92
The TreeTraits class provides compile-time information on the characteristics of a given tree type...
Definition: tree_traits.hpp:80
A cover tree is a tree specifically designed to speed up nearest-neighbor computation in high-dimensi...
Definition: cover_tree.hpp:95
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:98