mlpack  1.0.12
traits.hpp
Go to the documentation of this file.
1 
14 #ifndef __MLPACK_CORE_TREE_BINARY_SPACE_TREE_TRAITS_HPP
15 #define __MLPACK_CORE_TREE_BINARY_SPACE_TREE_TRAITS_HPP
16 
18 
19 namespace mlpack {
20 namespace tree {
21 
28 template<typename BoundType,
29  typename StatisticType,
30  typename MatType>
31 class TreeTraits<BinarySpaceTree<BoundType, StatisticType, MatType> >
32 {
33  public:
39  static const bool HasOverlappingChildren = false;
40 
44  static const bool FirstPointIsCentroid = false;
45 
49  static const bool HasSelfChildren = false;
50 
54  static const bool RearrangesDataset = true;
55 };
56 
57 }; // namespace tree
58 }; // namespace mlpack
59 
60 #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.
A binary space partitioning tree, such as a KD-tree or a ball tree.
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
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