48 SetNameTitle( title, title );
71 if (ibin < 0 ) ibin = 0;
143 Float_t a = cos1*(dm2-dm3) + cos2*(dm3-dm1) + cos3*(dm1-dm2);
144 Float_t b = cos1*(dm2*dm2-dm3*dm3) + cos2*(dm3*dm3-dm1*dm1) + cos3*(dm1*dm1-dm2*dm2);
145 Float_t c = cos1*(dm2-dm3)*dm2*dm3 + cos2*(dm3-dm1)*dm3*dm1 + cos3*(dm1-dm2)*dm1*dm2;
147 Float_t denom = (dm2-dm3)*(dm3-dm1)*(dm1-dm2);
149 return (denom != 0.0) ? (-a*dm*dm+b*dm-
c)/denom : 0.0;
virtual void GetKnot(Int_t i, Double_t &x, Double_t &y) const
no knots
virtual void BuildCoeff(void)
no coefficients to precompute
virtual Double_t Eval(Double_t x) const
returns quadratically interpolated TGraph entry around x
virtual ~TSpline2(void)
destructor
Double_t Quadrax(Float_t dm, Float_t dm1, Float_t dm2, Float_t dm3, Float_t cos1, Float_t cos2, Float_t cos3) const
quadratic interpolation Revised and checked by Francois Nov, 16th, 2000 Note the beautiful non-sponta...
Abstract ClassifierFactory template that handles arbitrary types.
A Graph is a graphics object made of two arrays X and Y with npoints each.
you should not use this method at all Int_t Int_t Double_t Double_t Double_t Int_t Double_t Double_t Double_t Double_t b
Long64_t BinarySearch(Long64_t n, const T *array, T value)