Logo ROOT  
Reference Guide
 
Loading...
Searching...
No Matches
ROOT::Math::KDTree< _DataPoint >::HeadNode Class Reference

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

Definition at line 127 of file KDTree.h.

Public Member Functions

 HeadNode (BaseNode &rNode)
 
virtual ~HeadNode ()
 
virtual const BinNodeFindNode (const point_type &rPoint) const
 
virtual void GetClosestPoints (const point_type &rRef, UInt_t nPoints, std::vector< std::pair< const _DataPoint *, Double_t > > &vFoundPoints) const
 
virtual void GetPointsWithinDist (const point_type &rRef, value_type fDist, std::vector< const _DataPoint * > &vFoundPoints) const
 
virtual Bool_t Insert (const point_type &rPoint)
 
virtual void Print (Int_t) const
 
- Public Member Functions inherited from ROOT::Math::KDTree< _DataPoint >::BaseNode
 BaseNode (BaseNode *pParent=0)
 
virtual ~BaseNode ()
 
BaseNode *& GetParentPointer ()
 
Bool_t IsLeftChild () const
 
BaseNode *& LeftChild ()
 
const BaseNodeLeftChild () const
 
BaseNode *& Parent ()
 
const BaseNodeParent () const
 
BaseNode *& RightChild ()
 
const BaseNodeRightChild () const
 

Private Member Functions

 HeadNode (const HeadNode &)
 
virtual HeadNodeClone ()
 
BaseNode *& GetParentPointer ()
 
virtual bool IsHeadNode () const
 
Bool_t IsLeftChild () const
 
BaseNode *& LeftChild ()
 
const BaseNodeLeftChild () const
 
HeadNodeoperator= (const HeadNode &)
 
BaseNode *& Parent ()
 
const BaseNodeParent () const
 
BaseNode *& RightChild ()
 
const BaseNodeRightChild () const
 
Inheritance diagram for ROOT::Math::KDTree< _DataPoint >::HeadNode:
[legend]

Constructor & Destructor Documentation

◆ HeadNode() [1/2]

template<class _DataPoint >
ROOT::Math::KDTree< _DataPoint >::HeadNode::HeadNode ( BaseNode rNode)
inline

Definition at line 131 of file KDTree.h.

◆ ~HeadNode()

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

Definition at line 132 of file KDTree.h.

◆ HeadNode() [2/2]

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

Definition at line 143 of file KDTree.h.

Member Function Documentation

◆ Clone()

template<class _DataPoint >
KDTree< _DataPoint >::HeadNode * ROOT::Math::KDTree< _DataPoint >::HeadNode::Clone
privatevirtual

Implements ROOT::Math::KDTree< _DataPoint >::BaseNode.

Definition at line 556 of file KDTree.icc.

◆ FindNode()

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

Implements ROOT::Math::KDTree< _DataPoint >::BaseNode.

Definition at line 135 of file KDTree.h.

◆ GetClosestPoints()

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

Implements ROOT::Math::KDTree< _DataPoint >::BaseNode.

Definition at line 572 of file KDTree.icc.

◆ GetParentPointer()

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

Definition at line 112 of file KDTree.icc.

◆ GetPointsWithinDist()

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

Implements ROOT::Math::KDTree< _DataPoint >::BaseNode.

Definition at line 580 of file KDTree.icc.

◆ Insert()

template<class _DataPoint >
virtual Bool_t ROOT::Math::KDTree< _DataPoint >::HeadNode::Insert ( const point_type rPoint)
inlinevirtual

Implements ROOT::Math::KDTree< _DataPoint >::BaseNode.

Definition at line 138 of file KDTree.h.

◆ IsHeadNode()

template<class _DataPoint >
virtual bool ROOT::Math::KDTree< _DataPoint >::HeadNode::IsHeadNode ( ) const
inlineprivatevirtual

Reimplemented from ROOT::Math::KDTree< _DataPoint >::BaseNode.

Definition at line 147 of file KDTree.h.

◆ IsLeftChild()

template<class _DataPoint >
bool ROOT::Math::KDTree< _DataPoint >::BaseNode::IsLeftChild
private

Definition at line 114 of file KDTree.icc.

◆ LeftChild() [1/2]

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

Definition at line 104 of file KDTree.h.

◆ LeftChild() [2/2]

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

Definition at line 105 of file KDTree.h.

◆ operator=()

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

Definition at line 144 of file KDTree.h.

◆ Parent() [1/2]

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

Definition at line 106 of file KDTree.h.

◆ Parent() [2/2]

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

Definition at line 107 of file KDTree.h.

◆ Print()

template<class _DataPoint >
virtual void ROOT::Math::KDTree< _DataPoint >::HeadNode::Print ( Int_t  ) const
inlinevirtual

Implements ROOT::Math::KDTree< _DataPoint >::BaseNode.

Definition at line 139 of file KDTree.h.

◆ RightChild() [1/2]

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

Definition at line 108 of file KDTree.h.

◆ RightChild() [2/2]

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

Definition at line 109 of file KDTree.h.

  • math/mathcore/inc/Math/KDTree.h
  • math/mathcore/inc/Math/KDTree.icc