59using std::deque, std::endl, std::ostream, std::list, std::vector, std::cout, std::setw, std::min;
82 const RooArgSet *normVars,
double prec,
double resolution,
bool shiftToZero,
WingMode wmode,
83 Int_t nEvalError,
Int_t doEEVal,
double eeVal,
bool showProg)
84 : _showProgress(showProg)
92 if(0 != strlen(
f.getUnit()) || 0 != strlen(
x.getUnit())) {
94 if(0 != strlen(
f.getUnit())) {
98 if(0 != strlen(
x.getUnit())) {
108 std::unique_ptr<RooAbsFunc> funcPtr{scaledFunc.
bindVars(
x, normVars,
true)};
113 std::unique_ptr<std::list<double>> hint{
f.plotSamplingHint(
x,xlo,xhi)};
114 addPoints(*funcPtr,xlo,xhi,xbins+1,prec,resolution,wmode,nEvalError,doEEVal,eeVal,hint.get());
116 ccoutP(Plotting) << endl ;
121 int nBinsX =
x.numBins();
122 for(
int i=0; i<nBinsX; ++i){
123 double xval =
x.getBinning().binCenter(i);
132 for (
int i=0 ; i<
GetN() ; i++) {
148 double xlo,
double xhi,
UInt_t minPoints,
double prec,
double resolution,
153 addPoints(func,xlo,xhi,minPoints+1,prec,resolution,wmode,nEvalError,doEEVal,eeVal);
158 for (
int i=0 ; i<
GetN() ; i++) {
186 deque<double> pointList ;
193 for (i1=0 ; i1<n1 ; i1++) {
194 c1.GetPoint(i1,
x,
y) ;
195 pointList.push_back(
x) ;
201 for (i2=0 ; i2<n2 ; i2++) {
202 c2.GetPoint(i2,
x,
y) ;
203 pointList.push_back(
x) ;
207 sort(pointList.begin(),pointList.end()) ;
211 for (
auto point : pointList) {
213 if ((point-last)>1
e-10) {
215 addPoint(point,scale1*
c1.interpolate(point)+scale2*
c2.interpolate(point)) ;
246 double minVal = std::numeric_limits<double>::infinity();
247 double maxVal = -std::numeric_limits<double>::infinity();
250 for (
int i = 1; i <
GetN() - 1; i++) {
254 minVal = std::min(
y, minVal);
255 maxVal = std::max(
y, maxVal);
259 for (
int i = 1; i <
GetN() - 1; i++) {
278 Int_t minPoints,
double prec,
double resolution,
WingMode wmode,
279 Int_t numee,
bool doEEVal,
double eeVal, list<double>* samplingHint)
283 coutE(InputArguments) <<
fName <<
"::addPoints: input function is not valid" << endl;
286 if(minPoints <= 0 || xhi <= xlo) {
287 coutE(InputArguments) <<
fName <<
"::addPoints: bad input (nothing added)" << endl;
296 minPoints = samplingHint->size() ;
299 double dx= (xhi-xlo)/(minPoints-1.);
301 std::vector<double> yval(minPoints);
305 std::vector<double> xval;
307 for(
int step= 0; step < minPoints; step++) {
308 xval.push_back(xlo + step*dx) ;
311 std::copy(samplingHint->begin(), samplingHint->end(), std::back_inserter(xval));
314 for (
unsigned int step=0; step < xval.size(); ++step) {
315 double xx = xval[step];
316 if (step ==
static_cast<unsigned int>(minPoints-1))
319 yval[step]= func(&xx);
327 coutW(Plotting) <<
"At observable [x]=" << xx <<
" " ;
337 const double ymax = *std::max_element(yval.begin(), yval.end());
338 const double ymin = *std::min_element(yval.begin(), yval.end());
342 double minDx= resolution*(xhi-xlo);
358 auto iter2 = xval.begin() ;
364 if (iter2==xval.end()) {
372 addRange(func,
x1,
x2,yval[step-1],yval[step],prec*yrangeEst,minDx,numee,doEEVal,eeVal,epsilon);
381 addPoint(xhi+dx,yval[minPoints-1]) ;
396 double y1,
double y2,
double minDy,
double minDx,
397 int numee,
bool doEEVal,
double eeVal,
double epsilon)
400 if (std::abs(
x2-
x1) <= epsilon) {
405 double xmid= 0.5*(
x1+
x2);
406 double ymid= func(&xmid);
414 coutW(Plotting) <<
"At observable [x]=" << xmid <<
" " ;
424 double dy= ymid - 0.5*(
y1+
y2);
425 if((xmid -
x1 >= minDx) && std::abs(dy)>0 && std::abs(dy) >= minDy) {
427 addRange(func,
x1,xmid,
y1,ymid,minDy,minDx,numee,doEEVal,eeVal,epsilon);
428 addRange(func,xmid,
x2,ymid,
y2,minDy,minDx,numee,doEEVal,eeVal,epsilon);
512 os <<
indent <<
"--- RooCurve ---" << endl ;
514 os <<
indent <<
" Contains " <<
n <<
" points" << endl;
515 os <<
indent <<
" Graph points:" << endl;
516 for(
Int_t i= 0; i <
n; i++) {
517 os <<
indent << setw(3) << i <<
") x = " <<
fX[i] <<
" , y = " <<
fY[i] << endl;
549 for (i=0 ; i<
np ; i++) {
555 if (x<xstart || x>xstop) continue ;
567 double pull = (
y>avg) ? ((
y-avg)/eyl) : ((
y-avg)/eyh) ;
574 return chisq.
Sum() / (nbin-nFitParam) ;
586 coutE(InputArguments) <<
"RooCurve::average(" <<
GetName()
587 <<
") invalid range (" << xFirst <<
"," << xLast <<
")" << endl ;
602 GetPoint(ifirst,xFirstPt,yFirstPt) ;
605 double tolerance=1
e-3*(xLast-xFirst) ;
608 if (ilast-ifirst==1 &&(xFirstPt-xFirst)<-1*tolerance && (xLastPt-xLast)>tolerance) {
609 return 0.5*(yFirst+yLast) ;
614 if ((xFirstPt-xFirst)<-1*tolerance) {
621 if ((xLastPt-xLast)>tolerance) {
633 sum += (xFirstPt-xFirst)*(yFirst+yFirstPt)/2 ;
637 for (i=ifirst ; i<ilast ; i++) {
644 sum += (xLast-xLastPt)*(yLastPt+yLast)/2 ;
645 return sum/(xLast-xFirst) ;
656 double delta(std::numeric_limits<double>::max());
662 for (i=0 ; i<
n ; i++) {
664 if (std::abs(xvalue-
x)<delta) {
665 delta = std::abs(xvalue-
x) ;
670 return (delta<tolerance)?ibest:-1 ;
691 if (std::abs(xbest-xvalue)<tolerance) {
705 if (xother==xbest)
return ybest ;
706 retVal = ybest + (yother-ybest)*(xvalue-xbest)/(xother-xbest) ;
714 if (xother==xbest)
return ybest ;
715 retVal = yother + (ybest-yother)*(xvalue-xother)/(xbest-xother) ;
737 vector<double> bandLo(
GetN()) ;
738 vector<double> bandHi(
GetN()) ;
739 for (
int i=0 ; i<
GetN() ; i++) {
743 for (
int i=0 ; i<
GetN() ; i++) {
746 for (
int i=
GetN()-1 ; i>=0 ; i--) {
777 vector<double> bandLo(
GetN()) ;
778 vector<double> bandHi(
GetN()) ;
779 for (
int i=0 ; i<
GetN() ; i++) {
783 for (
int i=0 ; i<
GetN() ; i++) {
786 for (
int i=
GetN()-1 ; i>=0 ; i--) {
810 vector<double> y_plus(plusVar.size());
811 vector<double> y_minus(minusVar.size());
813 for (vector<RooCurve*>::const_iterator iter=plusVar.begin() ; iter!=plusVar.end() ; ++iter) {
814 y_plus[j++] = (*iter)->interpolate(
GetX()[i]) ;
817 for (vector<RooCurve*>::const_iterator iter=minusVar.begin() ; iter!=minusVar.end() ; ++iter) {
818 y_minus[j++] = (*iter)->interpolate(
GetX()[i]) ;
820 double y_cen =
GetY()[i] ;
825 for (j=0 ; j<
n ; j++) {
826 F[j] = (y_plus[j]-y_minus[j])/2 ;
830 double sum =
F*(C*
F) ;
832 lo= y_cen + sqrt(
sum) ;
833 hi= y_cen - sqrt(
sum) ;
842 vector<double>
y(variations.size()) ;
844 for (vector<RooCurve*>::const_iterator iter=variations.begin() ; iter!=variations.end() ; ++iter) {
845 y[j++] = (*iter)->interpolate(
GetX()[i]) ;
852 sort(
y.begin(),
y.end()) ;
854 hi =
y[
y.size()-delta] ;
859 for (
unsigned int k=0 ; k<
y.size() ; k++) {
861 sum_ysq +=
y[k]*
y[k] ;
864 sum_ysq /=
y.size() ;
866 double rms = sqrt(sum_ysq - (sum_y*sum_y)) ;
867 lo =
GetY()[i] - Z*rms ;
887 for(
Int_t i= 0; i <
n; i++) {
896 for(
Int_t i= 2; i <
n-2; i++) {
898 double rdy = std::abs(yTest-other.
fY[i])/Yrange ;
901 if(!verbose)
continue;
902 cout <<
"RooCurve::isIdentical[" << std::setw(3) << i <<
"] Y tolerance exceeded (" << std::setprecision(5) << std::setw(10) << rdy <<
">" << tol <<
"),";
903 cout <<
" x,y=(" << std::right << std::setw(10) <<
fX[i] <<
"," << std::setw(10) <<
fY[i] <<
")\tref: y="
904 << std::setw(10) << other.
interpolate(
fX[i], 1.E-15) <<
". [Nearest point from ref: ";
906 std::cout <<
"j=" << j <<
"\tx,y=(" << std::setw(10) << other.
fX[j] <<
"," << std::setw(10) << other.
fY[j] <<
") ]" <<
"\trange=" << Yrange << std::endl;
923 auto hint =
new std::list<double>;
932 hint->push_back(xlo + delta);
933 hint->push_back(xhi - delta);
937 for (
const double x : boundaries) {
938 if (
x - xlo > delta && xhi -
x > delta) {
939 hint->push_back(
x - delta);
940 hint->push_back(
x + delta);
static void indent(ostringstream &buf, int indent_level)
Option_t Option_t SetLineWidth
Option_t Option_t TPoint TPoint const char GetTextMagnitude GetFillStyle GetLineColor GetLineWidth GetMarkerStyle GetTextAlign GetTextColor GetTextSize void char Point_t Rectangle_t WindowAttributes_t Float_t Float_t Float_t Int_t Int_t UInt_t UInt_t Rectangle_t Int_t Int_t Window_t TString Int_t GCValues_t GetPrimarySelectionOwner GetDisplay GetScreen GetColormap GetNativeEvent const char const char dpyName wid window const char font_name cursor keysym reg const char only_if_exist regb h Point_t np
Option_t Option_t SetLineColor
Option_t Option_t TPoint TPoint const char x2
Option_t Option_t TPoint TPoint const char x1
Option_t Option_t TPoint TPoint const char y2
Option_t Option_t TPoint TPoint const char y1
The Kahan summation is a compensated summation algorithm, which significantly reduces numerical error...
Abstract interface for evaluating a real-valued function of one real variable and performing numerica...
Abstract base class for objects that represent a real value that may appear on the left hand side of ...
Abstract base class for objects that represent a real value and implements functionality common to al...
RooFit::OwningPtr< RooAbsFunc > bindVars(const RooArgSet &vars, const RooArgSet *nset=nullptr, bool clipInvalid=false) const
Create an interface adaptor f(vars) that binds us to the specified variables (in arbitrary order).
static Int_t numEvalErrors()
Return the number of logged evaluation errors since the last clearing.
static void printEvalErrors(std::ostream &os=std::cout, Int_t maxPerNode=10000000)
Print all outstanding logged evaluation error on the given ostream.
static void clearEvalErrorLog()
Clear the stack of evaluation error messages.
RooArgSet is a container object that can hold multiple RooAbsArg objects.
One-dimensional graphical representation of a real-valued function.
void addPoints(const RooAbsFunc &func, double xlo, double xhi, Int_t minPoints, double prec, double resolution, WingMode wmode, Int_t numee=0, bool doEEVal=false, double eeVal=0.0, std::list< double > *samplingHint=nullptr)
Add points calculated with the specified function, over the range (xlo,xhi).
void printTitle(std::ostream &os) const override
Print the title of this curve.
void initialize()
Perform initialization that is common to all curves.
double getFitRangeBinW() const override
Get the bin width associated with this plotable object.
static constexpr double relativeXEpsilon()
The distance between two points x1 and x2 relative to the full plot range below which two points are ...
void addRange(const RooAbsFunc &func, double x1, double x2, double y1, double y2, double minDy, double minDx, int numee, bool doEEVal, double eeVal, double epsilon)
Fill the range (x1,x2) with points calculated using func(&x).
void printName(std::ostream &os) const override
Print name of object.
void printMultiline(std::ostream &os, Int_t contents, bool verbose=false, TString indent="") const override
Print the details of this curve.
double interpolate(double x, double tolerance=1e-10) const
Return linearly interpolated value of curve at xvalue.
static std::list< double > * plotSamplingHintForBinBoundaries(std::span< const double > boundaries, double xlo, double xhi)
Returns sampling hints for a histogram with given boundaries.
void printClassName(std::ostream &os) const override
Print the class name of this curve.
RooCurve()
Default constructor.
bool _showProgress
! Show progress indication when adding points
RooCurve * makeErrorBand(const std::vector< RooCurve * > &variations, double Z=1) const
Construct filled RooCurve represented error band that captures alpha% of the variations of the curves...
double chiSquare(const RooHist &hist, int nFitParam) const
Calculate the chi^2/NDOF of this curve with respect to the histogram 'hist' accounting nFitParam floa...
void calcBandInterval(const std::vector< RooCurve * > &variations, Int_t i, double Z, double &lo, double &hi, bool approxGauss) const
double getFitRangeNEvt() const override
Return the number of events associated with the plotable object, it is always 1 for curves.
void shiftCurveToZero()
Find lowest point in curve and move all points in curve so that lowest point will go exactly through ...
void addPoint(double x, double y)
Add a point with the specified coordinates. Update our y-axis limits.
bool isIdentical(const RooCurve &other, double tol=1e-6, bool verbose=true) const
Return true if curve is identical to other curve allowing for given absolute tolerance on each point ...
Int_t findPoint(double value, double tolerance=1e-10) const
Find the nearest point to xvalue.
double average(double lo, double hi) const
Return average curve value in [xFirst,xLast] by integrating curve between points and dividing by xLas...
Graphical representation of binned data based on the TGraphAsymmErrors class.
static constexpr double infinity()
Return internal infinity representation.
void updateYAxisLimits(double y)
void setYAxisLimits(double ymin, double ymax)
void setYAxisLabel(const char *label)
Represents the product of a given set of RooAbsReal objects.
virtual void SetFillColor(Color_t fcolor)
Set the fill area color.
virtual void SetLineWidth(Width_t lwidth)
Set the line width.
virtual void SetLineColor(Color_t lcolor)
Set the line color.
virtual void SetBinLabel(Int_t bin, const char *label)
Set label for bin.
Bool_t IsAlphanumeric() const
const char * GetBinLabel(Int_t bin) const
Return label for bin.
virtual void Set(Int_t nbins, Double_t xmin, Double_t xmax)
Initialize axis with fix bins.
Double_t * GetEXlow() const override
Double_t * GetEYhigh() const override
Double_t * GetEXhigh() const override
Double_t * GetEYlow() const override
virtual void SetPoint(Int_t i, Double_t x, Double_t y)
Set x and y values for point number i.
Double_t * fY
[fNpoints] array of Y points
virtual void Sort(Bool_t(*greater)(const TGraph *, Int_t, Int_t)=&TGraph::CompareX, Bool_t ascending=kTRUE, Int_t low=0, Int_t high=-1111)
Sorts the points of this TGraph using in-place quicksort (see e.g.
void SetName(const char *name="") override
Set graph name.
TAxis * GetXaxis() const
Get x axis of the graph.
Double_t * fX
[fNpoints] array of X points
void SetTitle(const char *title="") override
Change (i.e.
virtual Int_t GetPoint(Int_t i, Double_t &x, Double_t &y) const
Get x and y values for point number i.
const char * GetName() const override
Returns name of object.
const char * GetTitle() const override
Returns title of object.
virtual const char * ClassName() const
Returns name of class to which the object belongs.
const char * Data() const
TString & Append(const char *cs)
RooConstVar & RooConst(double val)
Double_t Erfc(Double_t x)
Computes the complementary error function erfc(x).
static uint64_t sum(uint64_t i)