TreeTraits< CoverTree< MetricType, StatisticType, MatType, RootPointPolicy > > Class Template Reference

The specialization of the TreeTraits class for the CoverTree tree type. More...

Static Public Attributes

static const bool BinaryTree = false
 The cover tree is not necessarily a binary tree. More...

 
static const bool FirstPointIsCentroid = true
 Each cover tree node contains only one point, and that point is its centroid. More...

 
static const bool HasDuplicatedPoints = true
 Cover trees do have self-children, so points can be included in more than one node. More...

 
static const bool HasOverlappingChildren = true
 The cover tree (or, this implementation of it) does not require that children represent non-overlapping subsets of the parent node. More...

 
static const bool HasSelfChildren = true
 Cover trees do have self-children. More...

 
static const bool RearrangesDataset = false
 Points are not rearranged when the tree is built. More...

 
static const bool UniqueNumDescendants = true
 NumDescendants() represents the number of unique descendant points. More...

 

Detailed Description


template
<
typename
MetricType
,
typename
StatisticType
,
typename
MatType
,
typename
RootPointPolicy
>

class mlpack::tree::TreeTraits< CoverTree< MetricType, StatisticType, MatType, RootPointPolicy > >

The specialization of the TreeTraits class for the CoverTree tree type.

It defines characteristics of the cover 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 31 of file traits.hpp.

Member Data Documentation

◆ BinaryTree

const bool BinaryTree = false
static

The cover tree is not necessarily a binary tree.

Definition at line 65 of file traits.hpp.

◆ FirstPointIsCentroid

const bool FirstPointIsCentroid = true
static

Each cover tree node contains only one point, and that point is its centroid.

Definition at line 50 of file traits.hpp.

◆ HasDuplicatedPoints

const bool HasDuplicatedPoints = true
static

Cover trees do have self-children, so points can be included in more than one node.

Definition at line 44 of file traits.hpp.

◆ HasOverlappingChildren

const bool HasOverlappingChildren = true
static

The cover tree (or, this implementation of it) does not require that children represent non-overlapping subsets of the parent node.

Definition at line 38 of file traits.hpp.

◆ HasSelfChildren

const bool HasSelfChildren = true
static

Cover trees do have self-children.

Definition at line 55 of file traits.hpp.

◆ RearrangesDataset

const bool RearrangesDataset = false
static

Points are not rearranged when the tree is built.

Definition at line 60 of file traits.hpp.

◆ UniqueNumDescendants

const bool UniqueNumDescendants = true
static

NumDescendants() represents the number of unique descendant points.

Definition at line 70 of file traits.hpp.


The documentation for this class was generated from the following file:
  • /home/jenkins-mlpack/mlpack.org/_src/mlpack-3.3.1/src/mlpack/core/tree/cover_tree/traits.hpp