ROOT logo
ROOT » MATH » MATHCORE » ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >

class ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >


This class is also known as (typedefs to this class)

ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::KDTree<point_type>, ROOT::Math::KDTree<ROOT::Math::TDataPoint1D>

Function Members (Methods)

public:
~KDTree<ROOT::Math::TDataPoint<1,double> >()
static UInt_tDimension()
voidEmptyBins()
ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::iteratorEnd()
const ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::iteratorEnd() const
const ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::Bin*FindBin(const ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::point_type& rPoint) const
ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::iteratorFirst()
const ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::iteratorFirst() const
voidFreeze()
Double_tGetBucketSize() const
voidGetClosestPoints(const ROOT::Math::TDataPoint<1,double>& rRef, UInt_t nPoints, vector<std::pair<const ROOT::Math::TDataPoint<1,double>*,Double_t> >& vFoundPoints) const
Double_tGetEffectiveEntries() const
UInt_tGetEntries() const
ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >*GetFrozenCopy()
UInt_tGetNBins() const
voidGetPointsWithinDist(const ROOT::Math::TDataPoint<1,double>& rRef, ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::value_type fDist, vector<const ROOT::Math::TDataPoint<1,double>*>& vFoundPoints) const
Double_tGetTotalSumw() const
Double_tGetTotalSumw2() const
Bool_tInsert(const ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::point_type& rData)
Bool_tIsFrozen() const
ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >KDTree<ROOT::Math::TDataPoint<1,double> >(UInt_t iBucketSize)
ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::iteratorLast()
const ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::iteratorLast() const
voidPrint()
voidReset()
voidSetOwner(Bool_t bIsOwner = true)
voidSetSplitOption(ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::eSplitOption opt)

Data Members

public:
enum eSplitOption { kEffective
kBinContent
};
private:
Double_tfBucketSize
ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::BaseNode*fHead
Bool_tfIsFrozen

Class Charts

Inheritance Inherited Members Includes Libraries
Class Charts

Function documentation

UInt_t Dimension()
{return _DataPoint::Dimension();}
void GetClosestPoints(const ROOT::Math::TDataPoint<1,double>& rRef, UInt_t nPoints, vector<std::pair<const ROOT::Math::TDataPoint<1,double>*,Double_t> >& vFoundPoints) const
void GetPointsWithinDist(const ROOT::Math::TDataPoint<1,double>& rRef, ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::value_type fDist, vector<const ROOT::Math::TDataPoint<1,double>*>& vFoundPoints) const
Bool_t Insert(const ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::point_type& rData)
void Print(int iRow = 0)
BaseNode& operator=(const ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::KDTree<point_type>& )
{return *this;}
Double_t GetEffectiveEntries() const
{return (GetSumw2()) ? std::pow(GetSumw(),2)/GetSumw2() : 0;}
UInt_t GetEntries() const
{return fEntries;}
void SetOwner(Bool_t bIsOwner = true)
{fOwnData = bIsOwner;}
void SetSplitOption(ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::eSplitOption opt)
{fSplitOption = opt;}
void EmptyBins()
public member functions
iterator End()
const iterator End() const
const Bin* FindBin(const ROOT::Math::KDTree<ROOT::Math::TDataPoint<1,double> >::point_type& rPoint) const
{return fHead->FindNode(rPoint);}
iterator First()
const iterator First() const
void Freeze()
Double_t GetBucketSize() const
{return fBucketSize;}
KDTree<_DataPoint>* GetFrozenCopy()
UInt_t GetNBins() const
Double_t GetTotalSumw() const
Double_t GetTotalSumw2() const
Bool_t IsFrozen() const
{return fIsFrozen;}
iterator Last()
const iterator Last() const
void Reset()