/* ======================================================================== *\ ! ! * ! * This file is part of MARS, the MAGIC Analysis and Reconstruction ! * Software. It is distributed to you in the hope that it can be a useful ! * and timesaving tool in analysing Data of imaging Cerenkov telescopes. ! * It is distributed WITHOUT ANY WARRANTY. ! * ! * Permission to use, copy, modify and distribute this software and its ! * documentation for any purpose is hereby granted without fee, ! * provided that the above copyright notice appear in all copies and ! * that both that copyright notice and this permission notice appear ! * in supporting documentation. It is provided "as is" without express ! * or implied warranty. ! * ! ! ! Author(s): Thomas Bretz 1/2009 ! ! Copyright: Software Development, 2000-2009 ! ! \* ======================================================================== */ ////////////////////////////////////////////////////////////////////////////// // // MSpline3 // // This is a extension of TSpline3. In addition to TSpline3 it allows access // to Xmin, Xman and Np. The construction is a bit simplified because no // title hase to be given (it can be given later by SetTitle anyway) // and is provides constructors which allow to scale the x-values by // pre-defined multiplier (e.g. frequency) to create the spline. // ////////////////////////////////////////////////////////////////////////////// #include "MSpline3.h" #include #include "MArrayD.h" ClassImp(MSpline3); using namespace std; // -------------------------------------------------------------------------- // // Constructor. // MSpline3::MSpline3(const TF1 &f, const char *opt, Double_t valbeg, Double_t valend) : TSpline3("MSpline3", f.GetXmin(), f.GetXmax(), &f, f.GetNpx(), opt, valbeg, valend) { } MSpline3::MSpline3(const TF1 &f, Double_t freq, const char *opt,Double_t valbeg, Double_t valend) : TSpline3("MSpline3", f.GetXmin()*freq, f.GetXmax()*freq, ConvertFunc(f, freq).GetArray(), f.GetNpx(), opt, valbeg, valend) { } // -------------------------------------------------------------------------- // // This is a helper to convert the x-values by multiplying with freq // before initializing the spline // TGraph *MSpline3::ConvertSpline(const TSpline &s, Float_t freq) const { const UInt_t npx = s.GetNpx(); // WARNING: This is a stupid workaround because the TSpline3- // constructor takes a pointer as input! It is not thread-safe! static TGraph g; g.Set(npx); for (UInt_t i=0; i 5.22/00 /* Double_t MSpline3::EvalFast(Double_t x) const { // Eval this spline at x const Int_t klow=FindFast(x); return fPoly[klow].Eval(x); } Int_t MSpline3::FindFast(Double_t x) const { // // If out of boundaries, extrapolate // It may be badly wrong // if (x<=fXmin) // return 0; // // if (x>=fXmax) // return fNp-1; // // Equidistant knots, use histogramming if (fKstep) return TMath::Min(Int_t((x-fXmin)/fDelta),fNp-1); // // Non equidistant knots, binary search Int_t klow = 0; Int_t khig = fNp-1; Int_t khalf; while (khig-klow>1) if(x>fPoly[khalf=(klow+khig)/2].X()) klow=khalf; else khig=khalf; // This could be removed, sanity check //if(!(fPoly[klow].X()<=x && x<=fPoly[klow+1].X())) // Error("Eval", // "Binary search failed x(%d) = %f < %f < x(%d) = %f\n", // klow,fPoly[klow].X(),x,fPoly[klow+1].X()); return klow; } */