Logo ROOT   master
Reference Guide
ROOT::Math::KDTree< _DataPoint >::BaseNode Class Referenceabstract

template<class _DataPoint>
class ROOT::Math::KDTree< _DataPoint >::BaseNode

Definition at line 87 of file KDTree.h.

Public Member Functions

 BaseNode (BaseNode *pParent=0)
 
virtual ~BaseNode ()
 
virtual BaseNodeClone ()=0
 
virtual const BinNodeFindNode (const point_type &rPoint) const =0
 
virtual void GetClosestPoints (const point_type &rRef, UInt_t nPoints, std::vector< std::pair< const _DataPoint *, Double_t > > &vFoundPoints) const =0
 
BaseNode *& GetParentPointer ()
 
virtual void GetPointsWithinDist (const point_type &rRef, value_type fDist, std::vector< const point_type *> &vFoundPoints) const =0
 
virtual Bool_t Insert (const point_type &rPoint)=0
 
virtual Bool_t IsHeadNode () const
 
Bool_t IsLeftChild () const
 
BaseNode *& LeftChild ()
 
const BaseNodeLeftChild () const
 
BaseNode *& Parent ()
 
const BaseNodeParent () const
 
virtual void Print (int iRow=0) const =0
 
BaseNode *& RightChild ()
 
const BaseNodeRightChild () const
 

Private Member Functions

 BaseNode (const BaseNode &)
 
BaseNodeoperator= (const BaseNode &)
 

Private Attributes

BaseNodefLeftChild
 pointer to parent node More...
 
BaseNodefParent
 
BaseNodefRightChild
 pointer to left child More...
 
Inheritance diagram for ROOT::Math::KDTree< _DataPoint >::BaseNode:
[legend]

Constructor & Destructor Documentation

◆ BaseNode() [1/2]

template<class _DataPoint >
ROOT::Math::KDTree< _DataPoint >::BaseNode::BaseNode ( BaseNode pParent = 0)

Definition at line 496 of file KDTree.icc.

◆ ~BaseNode()

template<class _DataPoint >
ROOT::Math::KDTree< _DataPoint >::BaseNode::~BaseNode ( )
virtual

Definition at line 506 of file KDTree.icc.

◆ BaseNode() [2/2]

template<class _DataPoint>
ROOT::Math::KDTree< _DataPoint >::BaseNode::BaseNode ( const BaseNode )
inlineprivate

Definition at line 117 of file KDTree.h.

Member Function Documentation

◆ Clone()

◆ FindNode()

template<class _DataPoint>
virtual const BinNode* ROOT::Math::KDTree< _DataPoint >::BaseNode::FindNode ( const point_type rPoint) const
pure virtual

◆ GetClosestPoints()

template<class _DataPoint>
virtual void ROOT::Math::KDTree< _DataPoint >::BaseNode::GetClosestPoints ( const point_type rRef,
UInt_t  nPoints,
std::vector< std::pair< const _DataPoint *, Double_t > > &  vFoundPoints 
) const
pure virtual

◆ GetParentPointer()

template<class _DataPoint >
KDTree< _DataPoint >::BaseNode *& ROOT::Math::KDTree< _DataPoint >::BaseNode::GetParentPointer ( )

Definition at line 520 of file KDTree.icc.

◆ GetPointsWithinDist()

template<class _DataPoint>
virtual void ROOT::Math::KDTree< _DataPoint >::BaseNode::GetPointsWithinDist ( const point_type rRef,
value_type  fDist,
std::vector< const point_type *> &  vFoundPoints 
) const
pure virtual

◆ Insert()

◆ IsHeadNode()

template<class _DataPoint>
virtual Bool_t ROOT::Math::KDTree< _DataPoint >::BaseNode::IsHeadNode ( ) const
inlinevirtual

Reimplemented in ROOT::Math::KDTree< _DataPoint >::HeadNode.

Definition at line 112 of file KDTree.h.

◆ IsLeftChild()

template<class _DataPoint >
bool ROOT::Math::KDTree< _DataPoint >::BaseNode::IsLeftChild ( ) const

Definition at line 542 of file KDTree.icc.

◆ LeftChild() [1/2]

template<class _DataPoint>
BaseNode*& ROOT::Math::KDTree< _DataPoint >::BaseNode::LeftChild ( )
inline

Definition at line 103 of file KDTree.h.

◆ LeftChild() [2/2]

template<class _DataPoint>
const BaseNode* ROOT::Math::KDTree< _DataPoint >::BaseNode::LeftChild ( ) const
inline

Definition at line 104 of file KDTree.h.

◆ operator=()

template<class _DataPoint>
BaseNode& ROOT::Math::KDTree< _DataPoint >::BaseNode::operator= ( const BaseNode )
inlineprivate

Definition at line 118 of file KDTree.h.

◆ Parent() [1/2]

template<class _DataPoint>
BaseNode*& ROOT::Math::KDTree< _DataPoint >::BaseNode::Parent ( )
inline

Definition at line 105 of file KDTree.h.

◆ Parent() [2/2]

template<class _DataPoint>
const BaseNode* ROOT::Math::KDTree< _DataPoint >::BaseNode::Parent ( ) const
inline

Definition at line 106 of file KDTree.h.

◆ Print()

◆ RightChild() [1/2]

template<class _DataPoint>
BaseNode*& ROOT::Math::KDTree< _DataPoint >::BaseNode::RightChild ( )
inline

Definition at line 107 of file KDTree.h.

◆ RightChild() [2/2]

template<class _DataPoint>
const BaseNode* ROOT::Math::KDTree< _DataPoint >::BaseNode::RightChild ( ) const
inline

Definition at line 108 of file KDTree.h.

Member Data Documentation

◆ fLeftChild

template<class _DataPoint>
BaseNode* ROOT::Math::KDTree< _DataPoint >::BaseNode::fLeftChild
private

pointer to parent node

Definition at line 122 of file KDTree.h.

◆ fParent

template<class _DataPoint>
BaseNode* ROOT::Math::KDTree< _DataPoint >::BaseNode::fParent
private

Definition at line 121 of file KDTree.h.

◆ fRightChild

template<class _DataPoint>
BaseNode* ROOT::Math::KDTree< _DataPoint >::BaseNode::fRightChild
private

pointer to left child

Definition at line 123 of file KDTree.h.


The documentation for this class was generated from the following files: