Revision 716fb731a3c8c9b583235feddac21006994d9626 authored by Kyle Cranmer on 03 August 2011, 22:09:36 UTC, committed by Kyle Cranmer on 03 August 2011, 22:09:36 UTC
git-svn-id: http://root.cern.ch/svn/root/branches/v5-30-00-patches@40446 27541ba8-7e3a-0410-8455-c3a389f83636
1 parent 0db9ccb
RooCurve.cxx
/*****************************************************************************
* Project: RooFit *
* Package: RooFitCore *
* @(#)root/roofitcore:$Id$
* Authors: *
* WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu *
* DK, David Kirkby, UC Irvine, dkirkby@uci.edu *
* *
* Copyright (c) 2000-2005, Regents of the University of California *
* and Stanford University. All rights reserved. *
* *
* Redistribution and use in source and binary forms, *
* with or without modification, are permitted according to the terms *
* listed in LICENSE (http://roofit.sourceforge.net/license.txt) *
*****************************************************************************/
//////////////////////////////////////////////////////////////////////////////
//
// BEGIN_HTML
// A RooCurve is a one-dimensional graphical representation of a real-valued function.
// A curve is approximated by straight line segments with endpoints chosen to give
// a "good" approximation to the true curve. The goodness of the approximation is
// controlled by a precision and a resolution parameter. To view the points where
// a function y(x) is actually evaluated to approximate a smooth curve, use:
// END_HTML
//
// RooPlot *p= y.plotOn(x.frame());
// p->getAttMarker("curve_y")->SetMarkerStyle(20);
// p->setDrawOptions("curve_y","PL");
// p->Draw();
//
#include "RooFit.h"
#include "RooCurve.h"
#include "RooHist.h"
#include "RooAbsReal.h"
#include "RooArgSet.h"
#include "RooRealVar.h"
#include "RooRealIntegral.h"
#include "RooRealBinding.h"
#include "RooScaledFunc.h"
#include "RooMsgService.h"
#include "Riostream.h"
#include "TClass.h"
#include "TMath.h"
#include "TMatrixD.h"
#include "TVectorD.h"
#include <iomanip>
#include <math.h>
#include <assert.h>
#include <deque>
#include <algorithm>
using namespace std ;
ClassImp(RooCurve)
//_____________________________________________________________________________
RooCurve::RooCurve() : _showProgress(kFALSE)
{
// Default constructor
initialize();
}
//_____________________________________________________________________________
RooCurve::RooCurve(const RooAbsReal &f, RooAbsRealLValue &x, Double_t xlo, Double_t xhi, Int_t xbins,
Double_t scaleFactor, const RooArgSet *normVars, Double_t prec, Double_t resolution,
Bool_t shiftToZero, WingMode wmode, Int_t nEvalError, Int_t doEEVal, Double_t eeVal,
Bool_t showProg) : _showProgress(showProg)
{
// Create a 1-dim curve of the value of the specified real-valued expression
// as a function of x. Use the optional precision parameter to control
// how precisely the smooth curve is rasterized. Use the optional argument set
// to specify how the expression should be normalized. Use the optional scale
// factor to rescale the expression after normalization.
// If shiftToZero is set, the entire curve is shift down to make the lowest
// point in of the curve go through zero.
// grab the function's name and title
TString name(f.GetName());
SetName(name.Data());
TString title(f.GetTitle());
SetTitle(title.Data());
// append " ( [<funit> ][/ <xunit> ])" to our y-axis label if necessary
if(0 != strlen(f.getUnit()) || 0 != strlen(x.getUnit())) {
title.Append(" ( ");
if(0 != strlen(f.getUnit())) {
title.Append(f.getUnit());
title.Append(" ");
}
if(0 != strlen(x.getUnit())) {
title.Append("/ ");
title.Append(x.getUnit());
title.Append(" ");
}
title.Append(")");
}
setYAxisLabel(title.Data());
RooAbsFunc *funcPtr = 0;
RooAbsFunc *rawPtr = 0;
funcPtr= f.bindVars(x,normVars,kTRUE);
// apply a scale factor if necessary
if(scaleFactor != 1) {
rawPtr= funcPtr;
funcPtr= new RooScaledFunc(*rawPtr,scaleFactor);
}
assert(0 != funcPtr);
// calculate the points to add to our curve
Double_t prevYMax = getYAxisMax() ;
list<Double_t>* hint = f.plotSamplingHint(x,xlo,xhi) ;
addPoints(*funcPtr,xlo,xhi,xbins+1,prec,resolution,wmode,nEvalError,doEEVal,eeVal,hint);
if (_showProgress) {
ccoutP(Plotting) << endl ;
}
if (hint) {
delete hint ;
}
initialize();
// cleanup
delete funcPtr;
if(rawPtr) delete rawPtr;
if (shiftToZero) shiftCurveToZero(prevYMax) ;
// Adjust limits
Int_t i ;
for (i=0 ; i<GetN() ; i++) {
Double_t x2,y2 ;
GetPoint(i,x2,y2) ;
updateYAxisLimits(y2);
}
}
//_____________________________________________________________________________
RooCurve::RooCurve(const char *name, const char *title, const RooAbsFunc &func,
Double_t xlo, Double_t xhi, UInt_t minPoints, Double_t prec, Double_t resolution,
Bool_t shiftToZero, WingMode wmode, Int_t nEvalError, Int_t doEEVal, Double_t eeVal) :
_showProgress(kFALSE)
{
// Create a 1-dim curve of the value of the specified real-valued
// expression as a function of x. Use the optional precision
// parameter to control how precisely the smooth curve is
// rasterized. If shiftToZero is set, the entire curve is shift
// down to make the lowest point in of the curve go through zero.
SetName(name);
SetTitle(title);
Double_t prevYMax = getYAxisMax() ;
addPoints(func,xlo,xhi,minPoints+1,prec,resolution,wmode,nEvalError,doEEVal,eeVal);
initialize();
if (shiftToZero) shiftCurveToZero(prevYMax) ;
// Adjust limits
Int_t i ;
for (i=0 ; i<GetN() ; i++) {
Double_t x,y ;
GetPoint(i,x,y) ;
updateYAxisLimits(y);
}
}
//_____________________________________________________________________________
RooCurve::RooCurve(const char* name, const char* title, const RooCurve& c1, const RooCurve& c2, Double_t scale1, Double_t scale2) :
_showProgress(kFALSE)
{
// Constructor of curve as sum of two other curves
//
// Csum = scale1*c1 + scale2*c2
//
initialize() ;
SetName(name) ;
SetTitle(title) ;
// Make deque of points in X
deque<Double_t> pointList ;
Double_t x,y ;
// Add X points of C1
Int_t i1,n1 = c1.GetN() ;
for (i1=0 ; i1<n1 ; i1++) {
const_cast<RooCurve&>(c1).GetPoint(i1,x,y) ;
pointList.push_back(x) ;
}
// Add X points of C2
Int_t i2,n2 = c2.GetN() ;
for (i2=0 ; i2<n2 ; i2++) {
const_cast<RooCurve&>(c2).GetPoint(i2,x,y) ;
pointList.push_back(x) ;
}
// Sort X points
sort(pointList.begin(),pointList.end()) ;
// Loop over X points
deque<double>::iterator iter ;
Double_t last(-RooNumber::infinity()) ;
for (iter=pointList.begin() ; iter!=pointList.end() ; ++iter) {
if ((*iter-last)>1e-10) {
// Add OR of points to new curve, skipping duplicate points within tolerance
addPoint(*iter,scale1*c1.interpolate(*iter)+scale2*c2.interpolate(*iter)) ;
}
last = *iter ;
}
}
//_____________________________________________________________________________
RooCurve::~RooCurve()
{
// Destructor
}
//_____________________________________________________________________________
void RooCurve::initialize()
{
// Perform initialization that is common to all curves
// set default line width in pixels
SetLineWidth(3);
// set default line color
SetLineColor(kBlue);
}
//_____________________________________________________________________________
void RooCurve::shiftCurveToZero(Double_t prevYMax)
{
// Find lowest point in curve and move all points in curve so that
// lowest point will go exactly through zero
Int_t i ;
Double_t minVal(1e30) ;
Double_t maxVal(-1e30) ;
// First iteration, find current lowest point
for (i=1 ; i<GetN()-1 ; i++) {
Double_t x,y ;
GetPoint(i,x,y) ;
if (y<minVal) minVal=y ;
if (y>maxVal) maxVal=y ;
}
// Second iteration, lower all points by minVal
for (i=1 ; i<GetN()-1 ; i++) {
Double_t x,y ;
GetPoint(i,x,y) ;
SetPoint(i,x,y-minVal) ;
}
// Check if y-axis range needs readjustment
if (getYAxisMax()>prevYMax) {
Double_t newMax = maxVal - minVal ;
setYAxisLimits(getYAxisMin(), newMax<prevYMax ? prevYMax : newMax) ;
}
}
//_____________________________________________________________________________
void RooCurve::addPoints(const RooAbsFunc &func, Double_t xlo, Double_t xhi,
Int_t minPoints, Double_t prec, Double_t resolution, WingMode wmode,
Int_t numee, Bool_t doEEVal, Double_t eeVal, list<Double_t>* samplingHint)
{
// Add points calculated with the specified function, over the range (xlo,xhi).
// Add at least minPoints equally spaced points, and add sufficient points so that
// the maximum deviation from the final straight-line segements is prec*(ymax-ymin),
// down to a minimum horizontal spacing of resolution*(xhi-xlo).
// check the inputs
if(!func.isValid()) {
coutE(InputArguments) << fName << "::addPoints: input function is not valid" << endl;
return;
}
if(minPoints <= 0 || xhi <= xlo) {
coutE(InputArguments) << fName << "::addPoints: bad input (nothing added)" << endl;
return;
}
// Perform a coarse scan of the function to estimate its y range.
// Save the results so we do not have to re-evaluate at the scan points.
// Adjust minimum number of points to external sampling hint if used
if (samplingHint) {
minPoints = samplingHint->size() ;
}
Int_t step;
Double_t dx= (xhi-xlo)/(minPoints-1.);
Double_t *yval= new Double_t[minPoints];
// Get list of initial x values. If function provides sampling hint use that,
// otherwise use default binning of frame
list<Double_t>* xval = samplingHint ;
if (!xval) {
xval = new list<Double_t> ;
for(step= 0; step < minPoints; step++) {
xval->push_back(xlo + step*dx) ;
}
}
Double_t ymax(-1e30), ymin(1e30) ;
step=0 ;
for(list<Double_t>::iterator iter = xval->begin() ; iter!=xval->end() ; ++iter,++step) {
Double_t xx = *iter ;
if (step==minPoints-1) xx-=1e-15 ;
yval[step]= func(&xx);
if (_showProgress) {
ccoutP(Plotting) << "." ;
cout.flush() ;
}
if (RooAbsReal::numEvalErrors()>0) {
if (numee>=0) {
coutW(Plotting) << "At observable [x]=" << xx << " " ;
RooAbsReal::printEvalErrors(ccoutW(Plotting),numee) ;
}
if (doEEVal) {
yval[step]=eeVal ;
}
}
RooAbsReal::clearEvalErrorLog() ;
if (yval[step]>ymax) ymax=yval[step] ;
if (yval[step]<ymin) ymin=yval[step] ;
}
Double_t yrangeEst=(ymax-ymin) ;
// store points of the coarse scan and calculate any refinements necessary
Double_t minDx= resolution*(xhi-xlo);
Double_t x1,x2= xlo;
if (wmode==Extended) {
addPoint(xlo-dx,0) ;
addPoint(xlo-dx,yval[0]) ;
} else if (wmode==Straight) {
addPoint(xlo,0) ;
}
addPoint(xlo,yval[0]);
list<Double_t>::iterator iter2 = xval->begin() ;
x1 = *iter2 ;
step=1 ;
while(true) {
x1= x2;
iter2++ ;
if (iter2==xval->end()) {
break ;
}
x2= *iter2 ;
addRange(func,x1,x2,yval[step-1],yval[step],prec*yrangeEst,minDx,numee,doEEVal,eeVal);
step++ ;
}
addPoint(xhi,yval[minPoints-1]) ;
if (wmode==Extended) {
addPoint(xhi+dx,yval[minPoints-1]) ;
addPoint(xhi+dx,0) ;
} else if (wmode==Straight) {
addPoint(xhi,0) ;
}
// cleanup
delete [] yval;
if (xval != samplingHint) {
delete xval ;
}
}
//_____________________________________________________________________________
void RooCurve::addRange(const RooAbsFunc& func, Double_t x1, Double_t x2,
Double_t y1, Double_t y2, Double_t minDy, Double_t minDx,
Int_t numee, Bool_t doEEVal, Double_t eeVal)
{
// Fill the range (x1,x2) with points calculated using func(&x). No point will
// be added at x1, and a point will always be added at x2. The density of points
// will be calculated so that the maximum deviation from a straight line
// approximation is prec*(ymax-ymin) down to the specified minimum horizontal spacing.
// Explicitly skip empty ranges to eliminate point duplication
if (fabs(x2-x1)<1e-20) {
return ;
}
// calculate our value at the midpoint of this range
Double_t xmid= 0.5*(x1+x2);
Double_t ymid= func(&xmid);
if (_showProgress) {
ccoutP(Plotting) << "." ;
cout.flush() ;
}
if (RooAbsReal::numEvalErrors()>0) {
if (numee>=0) {
coutW(Plotting) << "At observable [x]=" << xmid << " " ;
RooAbsReal::printEvalErrors(ccoutW(Plotting),numee) ;
}
if (doEEVal) {
ymid=eeVal ;
}
}
RooAbsReal::clearEvalErrorLog() ;
// test if the midpoint is sufficiently close to a straight line across this interval
Double_t dy= ymid - 0.5*(y1+y2);
if((xmid - x1 >= minDx) && fabs(dy)>0 && fabs(dy) >= minDy) {
// fill in each subrange
addRange(func,x1,xmid,y1,ymid,minDy,minDx,numee,doEEVal,eeVal);
addRange(func,xmid,x2,ymid,y2,minDy,minDx,numee,doEEVal,eeVal);
}
else {
// add the endpoint
addPoint(x2,y2);
}
}
//_____________________________________________________________________________
void RooCurve::addPoint(Double_t x, Double_t y)
{
// Add a point with the specified coordinates. Update our y-axis limits.
// cout << "RooCurve("<< GetName() << ") adding point at (" << x << "," << y << ")" << endl ;
Int_t next= GetN();
SetPoint(next, x, y);
updateYAxisLimits(y) ;
}
//_____________________________________________________________________________
Double_t RooCurve::getFitRangeNEvt() const {
// Return the number of events associated with the plotable object,
// it is always 1 for curves
return 1;
}
//_____________________________________________________________________________
Double_t RooCurve::getFitRangeNEvt(Double_t, Double_t) const
{
// Return the number of events associated with the plotable object,
// in the given range. It is always 1 for curves
return 1 ;
}
//_____________________________________________________________________________
Double_t RooCurve::getFitRangeBinW() const {
// Get the bin width associated with this plotable object.
// It is alwats zero for curves
return 0 ;
}
//_____________________________________________________________________________
void RooCurve::printName(ostream& os) const
//
{
// Print the name of this curve
os << GetName() ;
}
//_____________________________________________________________________________
void RooCurve::printTitle(ostream& os) const
{
// Print the title of this curve
os << GetTitle() ;
}
//_____________________________________________________________________________
void RooCurve::printClassName(ostream& os) const
{
// Print the class name of this curve
os << IsA()->GetName() ;
}
//_____________________________________________________________________________
void RooCurve::printMultiline(ostream& os, Int_t /*contents*/, Bool_t /*verbose*/, TString indent) const
{
// Print the details of this curve
os << indent << "--- RooCurve ---" << endl ;
Int_t n= GetN();
os << indent << " Contains " << n << " points" << endl;
os << indent << " Graph points:" << endl;
for(Int_t i= 0; i < n; i++) {
os << indent << setw(3) << i << ") x = " << fX[i] << " , y = " << fY[i] << endl;
}
}
//_____________________________________________________________________________
Double_t RooCurve::chiSquare(const RooHist& hist, Int_t nFitParam) const
{
// Calculate the chi^2/NDOF of this curve with respect to the histogram
// 'hist' accounting nFitParam floating parameters in case the curve
// was the result of a fit
Int_t i,np = hist.GetN() ;
Double_t x,y,eyl,eyh,exl,exh ;
// Find starting and ending bin of histogram based on range of RooCurve
Double_t xstart,xstop ;
#if ROOT_VERSION_CODE >= ROOT_VERSION(4,0,1)
GetPoint(0,xstart,y) ;
GetPoint(GetN()-1,xstop,y) ;
#else
const_cast<RooCurve*>(this)->GetPoint(0,xstart,y) ;
const_cast<RooCurve*>(this)->GetPoint(GetN()-1,xstop,y) ;
#endif
Int_t nbin(0) ;
Double_t chisq(0) ;
for (i=0 ; i<np ; i++) {
// Retrieve histogram contents
((RooHist&)hist).GetPoint(i,x,y) ;
// Check if point is in range of curve
if (x<xstart || x>xstop) continue ;
nbin++ ;
eyl = hist.GetEYlow()[i] ;
eyh = hist.GetEYhigh()[i] ;
exl = hist.GetEXlow()[i] ;
exh = hist.GetEXhigh()[i] ;
// Integrate function over this bin
Double_t avg = average(x-exl,x+exh) ;
// Add pull^2 to chisq
if (y!=0) {
Double_t pull = (y>avg) ? ((y-avg)/eyl) : ((y-avg)/eyh) ;
chisq += pull*pull ;
}
}
// Return chisq/nDOF
return chisq / (nbin-nFitParam) ;
}
//_____________________________________________________________________________
Double_t RooCurve::average(Double_t xFirst, Double_t xLast) const
{
// Return average curve value in [xFirst,xLast] by integrating curve between points
// and dividing by xLast-xFirst
if (xFirst>=xLast) {
coutE(InputArguments) << "RooCurve::average(" << GetName()
<< ") invalid range (" << xFirst << "," << xLast << ")" << endl ;
return 0 ;
}
// Find Y values and begin and end points
Double_t yFirst = interpolate(xFirst,1e-10) ;
Double_t yLast = interpolate(xLast,1e-10) ;
// Find first and last mid points
Int_t ifirst = findPoint(xFirst,1e10) ;
Int_t ilast = findPoint(xLast,1e10) ;
Double_t xFirstPt,yFirstPt,xLastPt,yLastPt ;
const_cast<RooCurve&>(*this).GetPoint(ifirst,xFirstPt,yFirstPt) ;
const_cast<RooCurve&>(*this).GetPoint(ilast,xLastPt,yLastPt) ;
Double_t tolerance=1e-3*(xLast-xFirst) ;
// Handle trivial scenario -- no midway points, point only at or outside given range
if (ilast-ifirst==1 &&(xFirstPt-xFirst)<-1*tolerance && (xLastPt-xLast)>tolerance) {
return 0.5*(yFirst+yLast) ;
}
// If first point closest to xFirst is at xFirst or before xFirst take the next point
// as the first midway point
if ((xFirstPt-xFirst)<-1*tolerance) {
ifirst++ ;
const_cast<RooCurve&>(*this).GetPoint(ifirst,xFirstPt,yFirstPt) ;
}
// If last point closest to yLast is at yLast or beyond yLast the the previous point
// as the last midway point
if ((xLastPt-xLast)>tolerance) {
ilast-- ;
const_cast<RooCurve&>(*this).GetPoint(ilast,xLastPt,yLastPt) ;
}
Double_t sum(0),x1,y1,x2,y2 ;
// Trapezoid integration from lower edge to first midpoint
sum += (xFirstPt-xFirst)*(yFirst+yFirstPt)/2 ;
// Trapezoid integration between midpoints
Int_t i ;
for (i=ifirst ; i<ilast ; i++) {
const_cast<RooCurve&>(*this).GetPoint(i,x1,y1) ;
const_cast<RooCurve&>(*this).GetPoint(i+1,x2,y2) ;
sum += (x2-x1)*(y1+y2)/2 ;
}
// Trapezoid integration from last midpoint to upper edge
sum += (xLast-xLastPt)*(yLastPt+yLast)/2 ;
return sum/(xLast-xFirst) ;
}
//_____________________________________________________________________________
Int_t RooCurve::findPoint(Double_t xvalue, Double_t tolerance) const
{
// Find the nearest point to xvalue. Return -1 if distance
// exceeds tolerance
Double_t delta(999.),x,y ;
Int_t i,n = GetN() ;
Int_t ibest(-1) ;
for (i=0 ; i<n ; i++) {
((RooCurve&)*this).GetPoint(i,x,y) ;
if (fabs(xvalue-x)<delta) {
delta = fabs(xvalue-x) ;
ibest = i ;
}
}
return (delta<tolerance)?ibest:-1 ;
}
//_____________________________________________________________________________
Double_t RooCurve::interpolate(Double_t xvalue, Double_t tolerance) const
{
// Return linearly interpolated value of curve at xvalue. If distance
// to nearest point is less than tolerance, return nearest point value
// instead
// Find best point
int n = GetN() ;
int ibest = findPoint(xvalue,1e10) ;
// Get position of best point
Double_t xbest, ybest ;
const_cast<RooCurve*>(this)->GetPoint(ibest,xbest,ybest) ;
// Handle trivial case of being dead on
if (fabs(xbest-xvalue)<tolerance) {
return ybest ;
}
// Get nearest point on other side w.r.t. xvalue
Double_t xother,yother, retVal(0) ;
if (xbest<xvalue) {
if (ibest==n-1) {
// Value beyond end requested -- return value of last point
return ybest ;
}
const_cast<RooCurve*>(this)->GetPoint(ibest+1,xother,yother) ;
if (xother==xbest) return ybest ;
retVal = ybest + (yother-ybest)*(xvalue-xbest)/(xother-xbest) ;
} else {
if (ibest==0) {
// Value before 1st point requested -- return value of 1st point
return ybest ;
}
const_cast<RooCurve*>(this)->GetPoint(ibest-1,xother,yother) ;
if (xother==xbest) return ybest ;
retVal = yother + (ybest-yother)*(xvalue-xother)/(xbest-xother) ;
}
return retVal ;
}
//_____________________________________________________________________________
RooCurve* RooCurve::makeErrorBand(const vector<RooCurve*>& variations, Double_t Z) const
{
// Construct filled RooCurve represented error band that captures alpha% of the variations
// of the curves passed through argument variations, where the percentage alpha corresponds to
// the central interval fraction of a significance Z
RooCurve* band = new RooCurve ;
band->SetName(Form("%s_errorband",GetName())) ;
band->SetLineWidth(1) ;
band->SetFillColor(kCyan) ;
band->SetLineColor(kCyan) ;
vector<double> bandLo(GetN()) ;
vector<double> bandHi(GetN()) ;
for (int i=0 ; i<GetN() ; i++) {
calcBandInterval(variations,i,Z,bandLo[i],bandHi[i],kFALSE) ;
}
for (int i=0 ; i<GetN() ; i++) {
band->addPoint(GetX()[i],bandLo[i]) ;
}
for (int i=GetN()-1 ; i>=0 ; i--) {
band->addPoint(GetX()[i],bandHi[i]) ;
}
return band ;
}
//_____________________________________________________________________________
RooCurve* RooCurve::makeErrorBand(const vector<RooCurve*>& plusVar, const vector<RooCurve*>& minusVar, const TMatrixD& C, Double_t Z) const
{
// Construct filled RooCurve represented error band represent the error added in quadrature defined by the curves arguments
// plusVar and minusVar corresponding to one-sigma variations of each parameter. The resulting error band, combined used the correlation matrix C
// is multiplied with the significance parameter Z to construct the equivalent of a Z sigma error band (in Gaussian approximation)
RooCurve* band = new RooCurve ;
band->SetName(Form("%s_errorband",GetName())) ;
band->SetLineWidth(1) ;
band->SetFillColor(kCyan) ;
band->SetLineColor(kCyan) ;
vector<double> bandLo(GetN()) ;
vector<double> bandHi(GetN()) ;
for (int i=0 ; i<GetN() ; i++) {
calcBandInterval(plusVar,minusVar,i,C,Z,bandLo[i],bandHi[i]) ;
}
for (int i=0 ; i<GetN() ; i++) {
band->addPoint(GetX()[i],bandLo[i]) ;
}
for (int i=GetN()-1 ; i>=0 ; i--) {
band->addPoint(GetX()[i],bandHi[i]) ;
}
return band ;
}
//_____________________________________________________________________________
void RooCurve::calcBandInterval(const vector<RooCurve*>& plusVar, const vector<RooCurve*>& minusVar,Int_t i, const TMatrixD& C, Double_t /*Z*/, Double_t& lo, Double_t& hi) const
{
// Retrieve variation points from curves
vector<double> y_plus(plusVar.size()), y_minus(minusVar.size()) ;
Int_t j(0) ;
for (vector<RooCurve*>::const_iterator iter=plusVar.begin() ; iter!=plusVar.end() ; iter++) {
y_plus[j++] = (*iter)->interpolate(GetX()[i]) ;
}
j=0 ;
for (vector<RooCurve*>::const_iterator iter=minusVar.begin() ; iter!=minusVar.end() ; iter++) {
y_minus[j++] = (*iter)->interpolate(GetX()[i]) ;
}
Double_t y_cen = GetY()[i] ;
Int_t n = j ;
// Make vector of variations
TVectorD F(plusVar.size()) ;
for (j=0 ; j<n ; j++) {
F[j] = (y_plus[j]-y_minus[j])/2 ;
}
// Calculate error in linear approximation from variations and correlation coefficient
Double_t sum = F*(C*F) ;
lo= y_cen + sqrt(sum) ;
hi= y_cen - sqrt(sum) ;
}
//_____________________________________________________________________________
void RooCurve::calcBandInterval(const vector<RooCurve*>& variations,Int_t i,Double_t Z, Double_t& lo, Double_t& hi, Bool_t approxGauss) const
{
vector<double> y(variations.size()) ;
Int_t j(0) ;
for (vector<RooCurve*>::const_iterator iter=variations.begin() ; iter!=variations.end() ; iter++) {
y[j++] = (*iter)->interpolate(GetX()[i]) ;
}
if (!approxGauss) {
// Construct central 68% interval from variations collected at each point
Double_t pvalue = TMath::Erfc(Z/sqrt(2.)) ;
Int_t delta = Int_t( y.size()*(pvalue)/2 + 0.5) ;
sort(y.begin(),y.end()) ;
lo = y[delta] ;
hi = y[y.size()-delta] ;
} else {
// Estimate R.M.S of variations at each point and use that as Gaussian sigma
Double_t sum_y(0), sum_ysq(0) ;
for (unsigned int k=0 ; k<y.size() ; k++) {
sum_y += y[k] ;
sum_ysq += y[k]*y[k] ;
}
sum_y /= y.size() ;
sum_ysq /= y.size() ;
Double_t rms = sqrt(sum_ysq - (sum_y*sum_y)) ;
lo = GetY()[i] - Z*rms ;
hi = GetY()[i] + Z*rms ;
}
}
//_____________________________________________________________________________
Bool_t RooCurve::isIdentical(const RooCurve& other, Double_t tol) const
{
// Return true if curve is identical to other curve allowing for given
// absolute tolerance on each point compared point.
// Determine X range and Y range
Int_t n= min(GetN(),other.GetN());
Double_t xmin(1e30), xmax(-1e30), ymin(1e30), ymax(-1e30) ;
for(Int_t i= 0; i < n; i++) {
if (fX[i]<xmin) xmin=fX[i] ;
if (fX[i]>xmax) xmax=fX[i] ;
if (fY[i]<ymin) ymin=fY[i] ;
if (fY[i]>ymax) ymax=fY[i] ;
}
Double_t Yrange=ymax-ymin ;
Bool_t ret(kTRUE) ;
for(Int_t i= 2; i < n-2; i++) {
Double_t yTest = interpolate(other.fX[i],1e-10) ;
Double_t rdy = fabs(yTest-other.fY[i])/Yrange ;
if (rdy>tol) {
// cout << "xref = " << other.fX[i] << " yref = " << other.fY[i] << " xtest = " << fX[i] << " ytest = " << fY[i]
// << " ytestInt[other.fX] = " << interpolate(other.fX[i],1e-10) << endl ;
cout << "RooCurve::isIdentical[" << i << "] Y tolerance exceeded (" << rdy << ">" << tol
<< "), X=" << other.fX[i] << "(" << fX[i] << ")" << " Ytest=" << yTest << " Yref=" << other.fY[i] << " range = " << Yrange << endl ;
ret=kFALSE ;
}
}
return ret ;
}
![swh spinner](/static/img/swh-spinner.gif)
Computing file changes ...