ROOT
6.06/09
Reference Guide
|
Public Member Functions | |
BaseNode (BaseNode *pParent=0) | |
virtual | ~BaseNode () |
virtual BaseNode * | Clone ()=0 |
virtual const BinNode * | FindNode (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 |
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 void | Print (int iRow=0) const =0 |
BaseNode *& | LeftChild () |
const BaseNode * | LeftChild () const |
BaseNode *& | Parent () |
const BaseNode * | Parent () const |
BaseNode *& | RightChild () |
const BaseNode * | RightChild () const |
BaseNode *& | GetParentPointer () |
virtual Bool_t | IsHeadNode () const |
Bool_t | IsLeftChild () const |
Private Member Functions | |
BaseNode (const BaseNode &) | |
BaseNode & | operator= (const BaseNode &) |
Private Attributes | |
BaseNode * | fParent |
BaseNode * | fLeftChild |
pointer to parent node More... | |
BaseNode * | fRightChild |
pointer to left child More... | |
ROOT::Math::KDTree< _DataPoint >::BaseNode::BaseNode | ( | BaseNode * | pParent = 0 | ) |
Definition at line 492 of file KDTree.icc.
|
virtual |
Definition at line 502 of file KDTree.icc.
|
inlineprivate |
|
pure virtual |
Implemented in ROOT::Math::KDTree< _DataPoint >::TerminalNode, ROOT::Math::KDTree< _DataPoint >::BinNode, ROOT::Math::KDTree< _DataPoint >::SplitNode, and ROOT::Math::KDTree< _DataPoint >::HeadNode.
Referenced by ROOT::Math::KDTree< _DataPoint >::HeadNode::Clone(), and ROOT::Math::KDTree< _DataPoint >::SplitNode::Clone().
|
pure virtual |
Implemented in ROOT::Math::KDTree< _DataPoint >::TerminalNode, ROOT::Math::KDTree< _DataPoint >::BinNode, ROOT::Math::KDTree< _DataPoint >::SplitNode, and ROOT::Math::KDTree< _DataPoint >::HeadNode.
Referenced by ROOT::Math::KDTree< _DataPoint >::FindBin(), and ROOT::Math::KDTree< _DataPoint >::HeadNode::FindNode().
|
pure virtual |
KDTree< _DataPoint >::BaseNode *& ROOT::Math::KDTree< _DataPoint >::BaseNode::GetParentPointer | ( | ) |
Definition at line 516 of file KDTree.icc.
Referenced by ROOT::Math::KDTree< _DataPoint >::Freeze().
|
pure virtual |
|
pure virtual |
Implemented in ROOT::Math::KDTree< _DataPoint >::TerminalNode, ROOT::Math::KDTree< _DataPoint >::BinNode, ROOT::Math::KDTree< _DataPoint >::SplitNode, and ROOT::Math::KDTree< _DataPoint >::HeadNode.
Referenced by ROOT::Math::KDTree< _DataPoint >::HeadNode::Insert(), and ROOT::Math::KDTree< _DataPoint >::Insert().
|
inlinevirtual |
Reimplemented in ROOT::Math::KDTree< _DataPoint >::HeadNode.
Definition at line 112 of file KDTree.h.
Referenced by ROOT::Math::KDTree< _DataPoint >::iterator::Next(), and ROOT::Math::KDTree< _DataPoint >::iterator::Previous().
bool ROOT::Math::KDTree< _DataPoint >::BaseNode::IsLeftChild | ( | ) | const |
Definition at line 538 of file KDTree.icc.
Referenced by ROOT::Math::KDTree< _DataPoint >::iterator::Next().
|
inline |
Definition at line 103 of file KDTree.h.
Referenced by ROOT::Math::KDTree< _DataPoint >::BinNode::BinNode(), ROOT::Math::KDTree< _DataPoint >::First(), ROOT::Math::KDTree< _DataPoint >::iterator::Next(), ROOT::Math::KDTree< _DataPoint >::iterator::Previous(), and ROOT::Math::KDTree< _DataPoint >::SplitNode::SplitNode().
|
inline |
|
inlineprivate |
|
inline |
Definition at line 105 of file KDTree.h.
Referenced by ROOT::Math::KDTree< _DataPoint >::BinNode::BinNode(), ROOT::Math::KDTree< _DataPoint >::HeadNode::Clone(), ROOT::Math::KDTree< _DataPoint >::SplitNode::Clone(), ROOT::Math::KDTree< _DataPoint >::HeadNode::FindNode(), ROOT::Math::KDTree< _DataPoint >::First(), ROOT::Math::KDTree< _DataPoint >::Freeze(), ROOT::Math::KDTree< _DataPoint >::HeadNode::Insert(), ROOT::Math::KDTree< _DataPoint >::Insert(), ROOT::Math::KDTree< _DataPoint >::KDTree(), ROOT::Math::KDTree< _DataPoint >::Last(), ROOT::Math::KDTree< _DataPoint >::iterator::Next(), ROOT::Math::KDTree< _DataPoint >::iterator::Previous(), ROOT::Math::KDTree< _DataPoint >::HeadNode::Print(), ROOT::Math::KDTree< _DataPoint >::Print(), ROOT::Math::KDTree< _DataPoint >::Reset(), ROOT::Math::KDTree< _DataPoint >::TerminalNode::Split(), and ROOT::Math::KDTree< _DataPoint >::HeadNode::~HeadNode().
|
inline |
|
pure virtual |
Implemented in ROOT::Math::KDTree< _DataPoint >::TerminalNode, ROOT::Math::KDTree< _DataPoint >::BinNode, ROOT::Math::KDTree< _DataPoint >::SplitNode, and ROOT::Math::KDTree< _DataPoint >::HeadNode.
Referenced by ROOT::Math::KDTree< _DataPoint >::HeadNode::Print(), and ROOT::Math::KDTree< _DataPoint >::Print().
|
inline |
Definition at line 107 of file KDTree.h.
Referenced by ROOT::Math::KDTree< _DataPoint >::BinNode::BinNode(), ROOT::Math::KDTree< _DataPoint >::Last(), ROOT::Math::KDTree< _DataPoint >::iterator::Next(), ROOT::Math::KDTree< _DataPoint >::iterator::Previous(), and ROOT::Math::KDTree< _DataPoint >::SplitNode::SplitNode().
|
inline |
|
private |
pointer to parent node
Definition at line 122 of file KDTree.h.
Referenced by ROOT::Math::KDTree< _DataPoint >::BaseNode::LeftChild().
|
private |
Definition at line 121 of file KDTree.h.
Referenced by ROOT::Math::KDTree< _DataPoint >::BaseNode::Parent().
|
private |
pointer to left child
Definition at line 123 of file KDTree.h.
Referenced by ROOT::Math::KDTree< _DataPoint >::BaseNode::RightChild().