BaseNode(BaseNode *pParent=0) | ROOT::Math::KDTree< _DataPoint >::BaseNode | |
BinNode(BaseNode *pParent=0) | ROOT::Math::KDTree< _DataPoint >::BinNode | |
BinNode(const BinNode ©) | ROOT::Math::KDTree< _DataPoint >::BinNode | |
Clone() | ROOT::Math::KDTree< _DataPoint >::TerminalNode | inlineprivatevirtual |
const_data_it typedef | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
ConvertToBinNode() | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
data_it typedef | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
EmptyBin() | ROOT::Math::KDTree< _DataPoint >::TerminalNode | virtual |
fBoundaries | ROOT::Math::KDTree< _DataPoint >::BinNode | protected |
fBucketSize | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
fDataPoints | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
fEntries | ROOT::Math::KDTree< _DataPoint >::BinNode | protected |
FindNode(const point_type &) const | ROOT::Math::KDTree< _DataPoint >::TerminalNode | inlineprivatevirtual |
fOwnData | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
fSplitAxis | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
fSplitOption | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
fSumw | ROOT::Math::KDTree< _DataPoint >::BinNode | protected |
fSumw2 | ROOT::Math::KDTree< _DataPoint >::BinNode | protected |
GetBinCenter() const | ROOT::Math::KDTree< _DataPoint >::BinNode | |
GetBinContent() const | ROOT::Math::KDTree< _DataPoint >::BinNode | inline |
GetBoundaries() const | ROOT::Math::KDTree< _DataPoint >::TerminalNode | virtual |
GetClosestPoints(const point_type &rRef, UInt_t nPoints, std::vector< std::pair< const _DataPoint *, Double_t > > &vFoundPoints) const | ROOT::Math::KDTree< _DataPoint >::TerminalNode | virtual |
GetDensity() const | ROOT::Math::KDTree< _DataPoint >::BinNode | inline |
GetEffectiveEntries() const | ROOT::Math::KDTree< _DataPoint >::BinNode | inline |
GetEntries() const | ROOT::Math::KDTree< _DataPoint >::BinNode | inline |
GetParentPointer() | ROOT::Math::KDTree< _DataPoint >::BaseNode | |
GetPoints() const | ROOT::Math::KDTree< _DataPoint >::TerminalNode | inline |
GetPointsWithinDist(const point_type &rRef, value_type fDist, std::vector< const _DataPoint *> &vFoundPoints) const | ROOT::Math::KDTree< _DataPoint >::TerminalNode | virtual |
GetSumw() const | ROOT::Math::KDTree< _DataPoint >::BinNode | inline |
GetSumw2() const | ROOT::Math::KDTree< _DataPoint >::BinNode | inline |
GetVolume() const | ROOT::Math::KDTree< _DataPoint >::BinNode | |
Insert(const point_type &rPoint) | ROOT::Math::KDTree< _DataPoint >::TerminalNode | privatevirtual |
IsHeadNode() const | ROOT::Math::KDTree< _DataPoint >::BaseNode | inlinevirtual |
IsInBin(const point_type &rPoint) const | ROOT::Math::KDTree< _DataPoint >::BinNode | |
IsLeftChild() const | ROOT::Math::KDTree< _DataPoint >::BaseNode | |
KDTree< _DataPoint > class | ROOT::Math::KDTree< _DataPoint >::TerminalNode | friend |
LeftChild() | ROOT::Math::KDTree< _DataPoint >::BaseNode | inline |
LeftChild() const | ROOT::Math::KDTree< _DataPoint >::BaseNode | inline |
operator=(const TerminalNode &) | ROOT::Math::KDTree< _DataPoint >::TerminalNode | inlineprivate |
Parent() | ROOT::Math::KDTree< _DataPoint >::BaseNode | inline |
Parent() const | ROOT::Math::KDTree< _DataPoint >::BaseNode | inline |
Print(int iRow=0) const | ROOT::Math::KDTree< _DataPoint >::TerminalNode | virtual |
RightChild() | ROOT::Math::KDTree< _DataPoint >::BaseNode | inline |
RightChild() const | ROOT::Math::KDTree< _DataPoint >::BaseNode | inline |
SetOwner(Bool_t bIsOwner=true) | ROOT::Math::KDTree< _DataPoint >::TerminalNode | inlineprivate |
SetSplitOption(eSplitOption opt) | ROOT::Math::KDTree< _DataPoint >::TerminalNode | inlineprivate |
Split() | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
SplitBinContent() | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
SplitEffectiveEntries() | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
tBoundary typedef | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
TerminalNode(Double_t iBucketSize, BaseNode *pParent=0) | ROOT::Math::KDTree< _DataPoint >::TerminalNode | |
TerminalNode(const TerminalNode &) | ROOT::Math::KDTree< _DataPoint >::TerminalNode | inlineprivate |
TerminalNode(Double_t iBucketSize, UInt_t iSplitAxis, data_it first, data_it end) | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
UpdateBoundaries() | ROOT::Math::KDTree< _DataPoint >::TerminalNode | private |
~BaseNode() | ROOT::Math::KDTree< _DataPoint >::BaseNode | virtual |
~BinNode() | ROOT::Math::KDTree< _DataPoint >::BinNode | inlinevirtual |
~TerminalNode() | ROOT::Math::KDTree< _DataPoint >::TerminalNode | virtual |