|static const bool ||BinaryTree = true|
| ||This is always a binary tree. More...|
|static const bool ||FirstPointIsCentroid = false|
| ||There is no guarantee that the first point in a node is its centroid. More...|
|static const bool ||HasDuplicatedPoints = false|
| ||Each binary space tree node doesn't share points with any other node. More...|
|static const bool ||HasOverlappingChildren = false|
| ||Each binary space tree node has two children which represent non-overlapping subsets of the space which the node represents. More...|
|static const bool ||HasSelfChildren = false|
| ||Points are not contained at multiple levels of the binary space tree. More...|
|static const bool ||RearrangesDataset = true|
| ||Points are rearranged during building of the tree. More...|
|static const bool ||UniqueNumDescendants = true|
| ||Binary space trees don't have duplicated points, so NumDescendants() represents the number of unique descendant points. More...|
template<typename MetricType, typename StatisticType, typename MatType, template< typename BoundMetricType, typename... > class BoundType, template< typename SplitBoundType, typename SplitMatType > class SplitType>
class mlpack::tree::TreeTraits< BinarySpaceTree< MetricType, StatisticType, MatType, BoundType, SplitType > >
This is a specialization of the TreeTraits class to the BinarySpaceTree tree type.
It defines characteristics of the binary space tree, and is used to help write tree-independent (but still optimized) tree-based algorithms. See mlpack/core/tree/tree_traits.hpp for more information.
Definition at line 33 of file traits.hpp.