MLPACK  1.0.10
traits.hpp
Go to the documentation of this file.
1 
22 #ifndef __MLPACK_CORE_TREE_BINARY_SPACE_TREE_TRAITS_HPP
23 #define __MLPACK_CORE_TREE_BINARY_SPACE_TREE_TRAITS_HPP
24 
26 
27 namespace mlpack {
28 namespace tree {
29 
36 template<typename BoundType,
37  typename StatisticType,
38  typename MatType>
39 class TreeTraits<BinarySpaceTree<BoundType, StatisticType, MatType> >
40 {
41  public:
47  static const bool HasOverlappingChildren = false;
48 
52  static const bool FirstPointIsCentroid = false;
53 
57  static const bool HasSelfChildren = false;
58 
62  static const bool RearrangesDataset = true;
63 };
64 
65 }; // namespace tree
66 }; // namespace mlpack
67 
68 #endif
Linear algebra utility functions, generally performed on matrices or vectors.
Definition: load.hpp:31
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:95
static const bool FirstPointIsCentroid
This is true if Point(0) is the centroid of the node.
The TreeTraits class provides compile-time information on the characteristics of a given tree type...
Definition: tree_traits.hpp:88
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...