//
// Subset of matheamtical functions not included in the TMath
//
-
-///////////////////////////////////////////////////////////////////////////
+//
+/////////////////////////////////////////////////////////////////////////
#include "TMath.h"
#include "Riostream.h"
#include "TH1F.h"
+#include "TH2F.h"
#include "TH3.h"
#include "TF1.h"
#include "TTree.h"
#include "TChain.h"
#include "TObjString.h"
#include "TLinearFitter.h"
-
+#include "TGraph2D.h"
+#include "TGraph.h"
+#include "TGraphErrors.h"
+#include "TMultiGraph.h"
+#include "TCanvas.h"
+#include "TLatex.h"
+#include "TCut.h"
//
// includes neccessary for test functions
//
#include "TStatToolkit.h"
+
+using std::cout;
+using std::cerr;
+using std::endl;
+
ClassImp(TStatToolkit) // Class implementation to enable ROOT I/O
}
Double_t norm = 1./Double_t(hh);
- Double_t norm2 = 1./Double_t(hh-1);
+ Double_t norm2 = (hh-1)>0 ? 1./Double_t(hh-1):1;
for (Int_t i=hh; i<nvectors; i++){
Double_t cmean = sumx*norm;
Double_t csigma = (sumx2 - hh*cmean*cmean)*norm2;
Int_t * sindexS = new Int_t[n]; // temp array for sorting
Int_t * sindexF = new Int_t[2*n];
- for (Int_t i=0;i<n;i++) sindexF[i]=0;
+ for (Int_t i=0;i<n;i++) sindexS[i]=0;
+ for (Int_t i=0;i<2*n;i++) sindexF[i]=0;
//
TMath::Sort(n,inlist, sindexS, down);
Int_t last = inlist[sindexS[0]];
}
//___TStatToolkit__________________________________________________________________________
-void TStatToolkit::TruncatedMean(TH1F * his, TVectorD *param, Float_t down, Float_t up, Bool_t verbose){
+void TStatToolkit::TruncatedMean(const TH1 * his, TVectorD *param, Float_t down, Float_t up, Bool_t verbose){
//
//
//
if (verbose) printf("Mean\t%f\t Sigma2\t%f\n", mean,sigma2);
}
-void TStatToolkit::LTM(TH1F * his, TVectorD *param , Float_t fraction, Bool_t verbose){
+void TStatToolkit::LTM(TH1 * his, TVectorD *param , Float_t fraction, Bool_t verbose){
+ //
+ // LTM : Trimmed mean on histogram - Modified version for binned data
//
- // LTM
+ // Robust statistic to estimate properties of the distribution
+ // See http://en.wikipedia.org/w/index.php?title=Trimmed_estimator&oldid=582847999
//
+ // New faster version is under preparation
+ //
+ if (!param) return;
+ (*param)[0]=0;
+ (*param)[1]=0;
+ (*param)[2]=0;
Int_t nbins = his->GetNbinsX();
Int_t nentries = (Int_t)his->GetEntries();
+ if (nentries<=0) return;
Double_t *data = new Double_t[nentries];
Int_t npoints=0;
for (Int_t ibin=1;ibin<nbins; ibin++){
- Float_t entriesI = his->GetBinContent(ibin);
- Float_t xcenter= his->GetBinCenter(ibin);
+ Double_t entriesI = his->GetBinContent(ibin);
+ //Double_t xcenter= his->GetBinCenter(ibin);
+ Double_t x0 = his->GetXaxis()->GetBinLowEdge(ibin);
+ Double_t w = his->GetXaxis()->GetBinWidth(ibin);
for (Int_t ic=0; ic<entriesI; ic++){
if (npoints<nentries){
- data[npoints]= xcenter;
+ data[npoints]= x0+w*Double_t((ic+0.5)/entriesI);
npoints++;
}
}
}
- Double_t mean, sigma;
+ Double_t mean, sigma;
Int_t npoints2=TMath::Min(Int_t(fraction*Float_t(npoints)),npoints-1);
npoints2=TMath::Max(Int_t(0.5*Float_t(npoints)),npoints2);
TStatToolkit::EvaluateUni(npoints, data, mean,sigma,npoints2);
}
}
-Double_t TStatToolkit::FitGaus(TH1F* his, TVectorD *param, TMatrixD *matrix, Float_t xmin, Float_t xmax, Bool_t verbose){
+
+void TStatToolkit::MedianFilter(TH1 * his1D, Int_t nmedian){
+ //
+ // Algorithm to filter histogram
+ // author: marian.ivanov@cern.ch
+ // Details of algorithm:
+ // http://en.wikipedia.org/w/index.php?title=Median_filter&oldid=582191524
+ // Input parameters:
+ // his1D - input histogam - to be modiefied by Medianfilter
+ // nmendian - number of bins in median filter
+ //
+ Int_t nbins = his1D->GetNbinsX();
+ TVectorD vectorH(nbins);
+ for (Int_t ibin=0; ibin<nbins; ibin++) vectorH[ibin]=his1D->GetBinContent(ibin+1);
+ for (Int_t ibin=0; ibin<nbins; ibin++) {
+ Int_t index0=ibin-nmedian;
+ Int_t index1=ibin+nmedian;
+ if (index0<0) {index1+=-index0; index0=0;}
+ if (index1>=nbins) {index0-=index1-nbins+1; index1=nbins-1;}
+ Double_t value= TMath::Median(index1-index0,&(vectorH.GetMatrixArray()[index0]));
+ his1D->SetBinContent(ibin+1, value);
+ }
+}
+
+Bool_t TStatToolkit::LTMHisto(TH1 *his1D, TVectorD ¶ms , Float_t fraction){
+ //
+ // LTM : Trimmed mean on histogram - Modified version for binned data
+ //
+ // Robust statistic to estimate properties of the distribution
+ // To handle binning error special treatment
+ // for definition of unbinned data see:
+ // http://en.wikipedia.org/w/index.php?title=Trimmed_estimator&oldid=582847999
+ //
+ // Function parameters:
+ // his1D - input histogram
+ // params - vector with parameters
+ // - 0 - area
+ // - 1 - mean
+ // - 2 - rms
+ // - 3 - error estimate of mean
+ // - 4 - error estimate of RMS
+ // - 5 - first accepted bin position
+ // - 6 - last accepted bin position
+ //
+ Int_t nbins = his1D->GetNbinsX();
+ Int_t nentries = (Int_t)his1D->GetEntries();
+ const Double_t kEpsilon=0.0000000001;
+
+ if (nentries<=0) return 0;
+ if (fraction>1) fraction=0;
+ if (fraction<0) return 0;
+ TVectorD vectorX(nbins);
+ TVectorD vectorMean(nbins);
+ TVectorD vectorRMS(nbins);
+ Double_t sumCont=0;
+ for (Int_t ibin0=1; ibin0<=nbins; ibin0++) sumCont+=his1D->GetBinContent(ibin0);
+ //
+ Double_t minRMS=his1D->GetRMS()*10000;
+ Int_t maxBin=0;
+ //
+ for (Int_t ibin0=1; ibin0<nbins; ibin0++){
+ Double_t sum0=0, sum1=0, sum2=0;
+ Int_t ibin1=ibin0;
+ for ( ibin1=ibin0; ibin1<nbins; ibin1++){
+ Double_t cont=his1D->GetBinContent(ibin1);
+ Double_t x= his1D->GetBinCenter(ibin1);
+ sum0+=cont;
+ sum1+=cont*x;
+ sum2+=cont*x*x;
+ if ( (ibin0!=ibin1) && sum0>=fraction*sumCont) break;
+ }
+ vectorX[ibin0]=his1D->GetBinCenter(ibin0);
+ if (sum0<fraction*sumCont) continue;
+ //
+ // substract fractions of bin0 and bin1 to keep sum0=fration*sumCont
+ //
+ Double_t diff = sum0-fraction*sumCont;
+ Double_t mean = (sum0>0) ? sum1/sum0:0;
+ //
+ Double_t x0=his1D->GetBinCenter(ibin0);
+ Double_t x1=his1D->GetBinCenter(ibin1);
+ Double_t y0=his1D->GetBinContent(ibin0);
+ Double_t y1=his1D->GetBinContent(ibin1);
+ //
+ Double_t d = y0+y1-diff; //enties to keep
+ Double_t w0=0,w1=0;
+ if (y0<=kEpsilon&&y1>kEpsilon){
+ w1=d/y1;
+ }
+ if (y1<=kEpsilon&&y0>kEpsilon){
+ w0=d/y0;
+ }
+ if (y0>kEpsilon && y1>kEpsilon && x1>x0 ){
+ w0 = (d*(x1-mean))/((x1-x0)*y0);
+ w1 = (d-y0*w0)/y1;
+ //
+ if (w0>1) {w1+=(w0-1)*y0/y1; w0=1;}
+ if (w1>1) {w0+=(w1-1)*y1/y0; w1=1;}
+ }
+ if ( (x1>x0) &&TMath::Abs(y0*w0+y1*w1-d)>kEpsilon*sum0){
+ printf(" TStatToolkit::LTMHisto error\n");
+ }
+ sum0-=y0+y1;
+ sum1-=y0*x0;
+ sum1-=y1*x1;
+ sum2-=y0*x0*x0;
+ sum2-=y1*x1*x1;
+ //
+ Double_t xx0=his1D->GetXaxis()->GetBinUpEdge(ibin0)-0.5*w0*his1D->GetBinWidth(ibin0);
+ Double_t xx1=his1D->GetXaxis()->GetBinLowEdge(ibin1)+0.5*w1*his1D->GetBinWidth(ibin1);
+ sum0+=y0*w0+y1*w1;
+ sum1+=y0*w0*xx0;
+ sum1+=y1*w1*xx1;
+ sum2+=y0*w0*xx0*xx0;
+ sum2+=y1*w1*xx1*xx1;
+
+ //
+ // choose the bin with smallest rms
+ //
+ if (sum0>0){
+ vectorMean[ibin0]=sum1/sum0;
+ vectorRMS[ibin0]=TMath::Sqrt(TMath::Abs(sum2/sum0-vectorMean[ibin0]*vectorMean[ibin0]));
+ if (vectorRMS[ibin0]<minRMS){
+ minRMS=vectorRMS[ibin0];
+ params[0]=sum0;
+ params[1]=vectorMean[ibin0];
+ params[2]=vectorRMS[ibin0];
+ params[3]=vectorRMS[ibin0]/TMath::Sqrt(sumCont*fraction);
+ params[4]=0; // what is the formula for error of RMS???
+ params[5]=ibin0;
+ params[6]=ibin1;
+ params[7]=his1D->GetBinCenter(ibin0);
+ params[8]=his1D->GetBinCenter(ibin1);
+ maxBin=ibin0;
+ }
+ }else{
+ break;
+ }
+ }
+ return kTRUE;
+}
+
+
+Double_t TStatToolkit::FitGaus(TH1* his, TVectorD *param, TMatrixD */*matrix*/, Float_t xmin, Float_t xmax, Bool_t verbose){
//
// Fit histogram with gaussian function
//
Double_t chi2 = fitter.GetChisquare()/Float_t(npoints);
//fitter.GetParameters();
if (!param) param = new TVectorD(3);
- if (!matrix) matrix = new TMatrixD(3,3);
+ // if (!matrix) matrix = new TMatrixD(3,3); // Covariance matrix to be implemented
(*param)[1] = par[1]/(-2.*par[2]);
(*param)[2] = 1./TMath::Sqrt(TMath::Abs(-2.*par[2]));
(*param)[0] = TMath::Exp(par[0]+ par[1]* (*param)[1] + par[2]*(*param)[1]*(*param)[1]);
return chi2;
}
-Double_t TStatToolkit::FitGaus(Float_t *arr, Int_t nBins, Float_t xMin, Float_t xMax, TVectorD *param, TMatrixD *matrix, Bool_t verbose){
+Double_t TStatToolkit::FitGaus(Float_t *arr, Int_t nBins, Float_t xMin, Float_t xMax, TVectorD *param, TMatrixD */*matrix*/, Bool_t verbose){
//
// Fit histogram with gaussian function
//
fitter.ClearPoints();
TVectorD par(3);
TVectorD sigma(3);
- TMatrixD A(3,3);
+ TMatrixD matA(3,3);
TMatrixD b(3,1);
Float_t rms = TMath::RMS(nBins,arr);
Float_t max = TMath::MaxElement(nBins,arr);
Float_t val = TMath::Log(Float_t(entriesI));
fitter.AddPoint(&xcenter,val,error);
if (npoints<3){
- A(npoints,0)=1;
- A(npoints,1)=xcenter;
- A(npoints,2)=xcenter*xcenter;
+ matA(npoints,0)=1;
+ matA(npoints,1)=xcenter;
+ matA(npoints,2)=xcenter*xcenter;
b(npoints,0)=val;
meanCOG+=xcenter*entriesI;
rms2COG +=xcenter*entriesI*xcenter;
if (npoints>=3){
if ( npoints == 3 ){
//analytic calculation of the parameters for three points
- A.Invert();
+ matA.Invert();
TMatrixD res(1,3);
- res.Mult(A,b);
+ res.Mult(matA,b);
par[0]=res(0,0);
par[1]=res(0,1);
par[2]=res(0,2);
if (TMath::Abs(par[2])<kTol) return -4;
if (!param) param = new TVectorD(3);
- if (!matrix) matrix = new TMatrixD(3,3); // !!!!might be a memory leek. use dummy matrix pointer to call this function!
+ //if (!matrix) matrix = new TMatrixD(3,3); // !!!!might be a memory leek. use dummy matrix pointer to call this function! // Covariance matrix to be implemented
(*param)[1] = par[1]/(-2.*par[2]);
(*param)[2] = 1./TMath::Sqrt(TMath::Abs(-2.*par[2]));
}
-Float_t TStatToolkit::GetCOG(Short_t *arr, Int_t nBins, Float_t xMin, Float_t xMax, Float_t *rms, Float_t *sum)
+Float_t TStatToolkit::GetCOG(const Short_t *arr, Int_t nBins, Float_t xMin, Float_t xMax, Float_t *rms, Float_t *sum)
{
//
// calculate center of gravity rms and sum for array 'arr' with nBins an a x range xMin to xMax
// ROOT gauss fit
// nhistos - number of histograms to be used for test
//
- TTreeSRedirector *pcstream = new TTreeSRedirector("fitdebug.root");
+ TTreeSRedirector *pcstream = new TTreeSRedirector("fitdebug.root","recreate");
Float_t *xTrue = new Float_t[nhistos];
Float_t *sTrue = new Float_t[nhistos];
h1f[i]->FillRandom("myg");
}
- TStopwatch s;
+ TStopwatch s;
s.Start();
//standard gaus fit
for (Int_t i=0; i<nhistos; i++){
for (Int_t iy=0; iy<nbiny;iy++){
Float_t xcenter = xaxis->GetBinCenter(ix);
Float_t ycenter = yaxis->GetBinCenter(iy);
- sprintf(name,"%s_%d_%d",his->GetName(), ix,iy);
+ snprintf(name,1000,"%s_%d_%d",his->GetName(), ix,iy);
TH1 *projection = his->ProjectionZ(name,ix-delta0,ix+delta0,iy-delta1,iy+delta1);
Float_t stat= 0;
if (type==0) stat = projection->GetMean();
if (type==1) stat = projection->GetRMS();
if (type==2 || type==3){
- TVectorD vec(3);
+ TVectorD vec(10);
TStatToolkit::LTM((TH1F*)projection,&vec,0.7);
if (type==2) stat= vec[1];
if (type==3) stat= vec[0];
return graph;
}
-TGraph * TStatToolkit::MakeStat1D(TH3 * his, Int_t delta1, Int_t type){
+TGraphErrors * TStatToolkit::MakeStat1D(TH2 * his, Int_t deltaBin, Double_t fraction, Int_t returnType, Int_t markerStyle, Int_t markerColor){
//
+ // function to retrieve the "mean and RMS estimate" of 2D histograms
+ //
+ // Robust statistic to estimate properties of the distribution
+ // See http://en.wikipedia.org/wiki/Trimmed_estimator
//
- //
- // delta - number of bins to integrate
- // type - 0 - mean value
-
+ // deltaBin - number of bins to integrate (bin+-deltaBin)
+ // fraction - fraction of values for the LTM and for the gauss fit
+ // returnType -
+ // 0 - mean value
+ // 1 - RMS
+ // 2 - LTM mean
+ // 3 - LTM sigma
+ // 4 - Gaus fit mean - on LTM range
+ // 5 - Gaus fit sigma - on LTM range
+ //
TAxis * xaxis = his->GetXaxis();
- TAxis * yaxis = his->GetYaxis();
- // TAxis * zaxis = his->GetZaxis();
Int_t nbinx = xaxis->GetNbins();
- Int_t nbiny = yaxis->GetNbins();
char name[1000];
Int_t icount=0;
- TGraph *graph = new TGraph(nbinx);
+ //
+ TVectorD vecX(nbinx);
+ TVectorD vecXErr(nbinx);
+ TVectorD vecY(nbinx);
+ TVectorD vecYErr(nbinx);
+ //
TF1 f1("f1","gaus");
- for (Int_t ix=0; ix<nbinx;ix++){
- Float_t xcenter = xaxis->GetBinCenter(ix);
- // Float_t ycenter = yaxis->GetBinCenter(iy);
- sprintf(name,"%s_%d",his->GetName(), ix);
- TH1 *projection = his->ProjectionZ(name,ix-delta1,ix+delta1,0,nbiny);
- Float_t stat= 0;
- if (type==0) stat = projection->GetMean();
- if (type==1) stat = projection->GetRMS();
- if (type==2 || type==3){
- TVectorD vec(3);
- TStatToolkit::LTM((TH1F*)projection,&vec,0.7);
- if (type==2) stat= vec[1];
- if (type==3) stat= vec[0];
+ TVectorD vecLTM(10);
+
+ for (Int_t jx=1; jx<=nbinx;jx++){
+ Int_t ix=jx-1;
+ Float_t xcenter = xaxis->GetBinCenter(jx);
+ snprintf(name,1000,"%s_%d",his->GetName(), ix);
+ TH1 *projection = his->ProjectionY(name,TMath::Max(jx-deltaBin,1),TMath::Min(jx+deltaBin,nbinx));
+ Double_t stat= 0;
+ Double_t err =0;
+ TStatToolkit::LTMHisto((TH1F*)projection,vecLTM,fraction);
+ //
+ if (returnType==0) {
+ stat = projection->GetMean();
+ err = projection->GetMeanError();
}
- if (type==4|| type==5){
- projection->Fit(&f1);
- if (type==4) stat= f1.GetParameter(1);
- if (type==5) stat= f1.GetParameter(2);
+ if (returnType==1) {
+ stat = projection->GetRMS();
+ err = projection->GetRMSError();
}
- //printf("%d\t%f\t%f\t%f\n", icount,xcenter, ycenter, stat);
- graph->SetPoint(icount,xcenter, stat);
+ if (returnType==2 || returnType==3){
+ if (returnType==2) {stat= vecLTM[1]; err =projection->GetRMSError();}
+ if (returnType==3) {stat= vecLTM[2]; err =projection->GetRMSError();}
+ }
+ if (returnType==4|| returnType==5){
+ projection->Fit(&f1,"QN","QN", vecLTM[7], vecLTM[8]);
+ if (returnType==4) {
+ stat= f1.GetParameter(1);
+ err=f1.GetParError(1);
+ }
+ if (returnType==5) {
+ stat= f1.GetParameter(2);
+ err=f1.GetParError(2);
+ }
+ }
+ vecX[icount]=xcenter;
+ vecY[icount]=stat;
+ vecYErr[icount]=err;
icount++;
+ delete projection;
}
+ TGraphErrors *graph = new TGraphErrors(icount,vecX.GetMatrixArray(), vecY.GetMatrixArray(),0, vecYErr.GetMatrixArray());
+ graph->SetMarkerStyle(markerStyle);
+ graph->SetMarkerColor(markerColor);
return graph;
}
-TString* TStatToolkit::FitPlane(TTree *tree, const char* drawCommand, const char* formula, const char* cuts, Double_t & chi2, Int_t &npoints, TVectorD &fitParam, TMatrixD &covMatrix, Float_t frac, Int_t start, Int_t stop){
+TString* TStatToolkit::FitPlane(TTree *tree, const char* drawCommand, const char* formula, const char* cuts, Double_t & chi2, Int_t &npoints, TVectorD &fitParam, TMatrixD &covMatrix, Float_t frac, Int_t start, Int_t stop,Bool_t fix0){
//
// fit an arbitrary function, specified by formula into the data, specified by drawCommand and cuts
// returns chi2, fitParam and covMatrix
TObjArray* valTokens = strVal.Tokenize(":");
drawStr = valTokens->At(0)->GetName();
ferr = valTokens->At(1)->GetName();
+ delete valTokens;
}
fitter->ClearPoints();
Int_t entries = tree->Draw(drawStr.Data(), cutStr.Data(), "goff", stop-start, start);
- if (entries == -1) return new TString("An ERROR has occured during fitting!");
- Double_t **values = new Double_t*[dim+1] ;
+ if (entries == -1) {
+ delete formulaTokens;
+ return new TString(TString::Format("ERROR expr: %s\t%s\tEntries==0",drawStr.Data(),cutStr.Data()));
+ }
+ Double_t **values = new Double_t*[dim+1] ;
+ for (Int_t i=0; i<dim+1; i++) values[i]=NULL;
//
entries = tree->Draw(ferr.Data(), cutStr.Data(), "goff", stop-start, start);
- if (entries == -1) return new TString("An ERROR has occured during fitting!");
+ if (entries == -1) {
+ delete formulaTokens;
+ delete []values;
+ return new TString(TString::Format("ERROR error part: %s\t%s\tEntries==0",ferr.Data(),cutStr.Data()));
+ }
Double_t *errors = new Double_t[entries];
memcpy(errors, tree->GetV1(), entries*sizeof(Double_t));
if (i < dim) centries = tree->Draw(((TObjString*)formulaTokens->At(i))->GetName(), cutStr.Data(), "goff", stop-start,start);
else centries = tree->Draw(drawStr.Data(), cutStr.Data(), "goff", stop-start,start);
- if (entries != centries) return new TString("An ERROR has occured during fitting!");
+ if (entries != centries) {
+ delete []errors;
+ delete []values;
+ return new TString(TString::Format("ERROR: %s\t%s\tEntries==%d\tEntries2=%d\n",drawStr.Data(),cutStr.Data(),entries,centries));
+ }
values[i] = new Double_t[entries];
memcpy(values[i], tree->GetV1(), entries*sizeof(Double_t));
}
fitter->Eval();
if (frac>0.5 && frac<1){
fitter->EvalRobust(frac);
+ }else{
+ if (fix0) {
+ fitter->FixParameter(0,0);
+ fitter->Eval();
+ }
}
fitter->GetParameters(fitParam);
fitter->GetCovarianceMatrix(covMatrix);
chi2 = fitter->GetChisquare();
- chi2 = chi2;
- npoints = entries;
-// TString *preturnFormula = new TString(Form("%f*(",fitParam[0])), &returnFormula = *preturnFormula;
+ npoints = entries;
+ TString *preturnFormula = new TString(Form("( %f+",fitParam[0])), &returnFormula = *preturnFormula;
+
+ for (Int_t iparam = 0; iparam < dim; iparam++) {
+ returnFormula.Append(Form("%s*(%f)",((TObjString*)formulaTokens->At(iparam))->GetName(),fitParam[iparam+1]));
+ if (iparam < dim-1) returnFormula.Append("+");
+ }
+ returnFormula.Append(" )");
+
+
+ for (Int_t j=0; j<dim+1;j++) delete [] values[j];
+
+
+ delete formulaTokens;
+ delete fitter;
+ delete[] values;
+ delete[] errors;
+ return preturnFormula;
+}
+
+TString* TStatToolkit::FitPlaneConstrain(TTree *tree, const char* drawCommand, const char* formula, const char* cuts, Double_t & chi2, Int_t &npoints, TVectorD &fitParam, TMatrixD &covMatrix, Float_t frac, Int_t start, Int_t stop,Double_t constrain){
+ //
+ // fit an arbitrary function, specified by formula into the data, specified by drawCommand and cuts
+ // returns chi2, fitParam and covMatrix
+ // returns TString with fitted formula
+ //
+
+ TString formulaStr(formula);
+ TString drawStr(drawCommand);
+ TString cutStr(cuts);
+ TString ferr("1");
+
+ TString strVal(drawCommand);
+ if (strVal.Contains(":")){
+ TObjArray* valTokens = strVal.Tokenize(":");
+ drawStr = valTokens->At(0)->GetName();
+ ferr = valTokens->At(1)->GetName();
+ delete valTokens;
+ }
+
+
+ formulaStr.ReplaceAll("++", "~");
+ TObjArray* formulaTokens = formulaStr.Tokenize("~");
+ Int_t dim = formulaTokens->GetEntriesFast();
+
+ fitParam.ResizeTo(dim);
+ covMatrix.ResizeTo(dim,dim);
+
+ TLinearFitter* fitter = new TLinearFitter(dim+1, Form("hyp%d",dim));
+ fitter->StoreData(kTRUE);
+ fitter->ClearPoints();
-// for (Int_t iparam = 0; iparam < dim; iparam++) {
-// returnFormula.Append(Form("%s*(%f)",((TObjString*)formulaTokens->At(iparam))->GetName(),fitParam[iparam+1]/fitParam[0]));
-// if (iparam < dim-1) returnFormula.Append("+");
-// }
-// returnFormula.Append(" )");
+ Int_t entries = tree->Draw(drawStr.Data(), cutStr.Data(), "goff", stop-start, start);
+ if (entries == -1) {
+ delete formulaTokens;
+ return new TString("An ERROR has occured during fitting!");
+ }
+ Double_t **values = new Double_t*[dim+1] ;
+ for (Int_t i=0; i<dim+1; i++) values[i]=NULL;
+ //
+ entries = tree->Draw(ferr.Data(), cutStr.Data(), "goff", stop-start, start);
+ if (entries == -1) {
+ delete formulaTokens;
+ delete [] values;
+ return new TString("An ERROR has occured during fitting!");
+ }
+ Double_t *errors = new Double_t[entries];
+ memcpy(errors, tree->GetV1(), entries*sizeof(Double_t));
+
+ for (Int_t i = 0; i < dim + 1; i++){
+ Int_t centries = 0;
+ if (i < dim) centries = tree->Draw(((TObjString*)formulaTokens->At(i))->GetName(), cutStr.Data(), "goff", stop-start,start);
+ else centries = tree->Draw(drawStr.Data(), cutStr.Data(), "goff", stop-start,start);
+
+ if (entries != centries) {
+ delete []errors;
+ delete []values;
+ delete formulaTokens;
+ return new TString("An ERROR has occured during fitting!");
+ }
+ values[i] = new Double_t[entries];
+ memcpy(values[i], tree->GetV1(), entries*sizeof(Double_t));
+ }
+
+ // add points to the fitter
+ for (Int_t i = 0; i < entries; i++){
+ Double_t x[1000];
+ for (Int_t j=0; j<dim;j++) x[j]=values[j][i];
+ fitter->AddPoint(x, values[dim][i], errors[i]);
+ }
+ if (constrain>0){
+ for (Int_t i = 0; i < dim; i++){
+ Double_t x[1000];
+ for (Int_t j=0; j<dim;j++) if (i!=j) x[j]=0;
+ x[i]=1.;
+ fitter->AddPoint(x, 0, constrain);
+ }
+ }
+
+
+ fitter->Eval();
+ if (frac>0.5 && frac<1){
+ fitter->EvalRobust(frac);
+ }
+ fitter->GetParameters(fitParam);
+ fitter->GetCovarianceMatrix(covMatrix);
+ chi2 = fitter->GetChisquare();
+ npoints = entries;
TString *preturnFormula = new TString(Form("( %f+",fitParam[0])), &returnFormula = *preturnFormula;
}
returnFormula.Append(" )");
+ for (Int_t j=0; j<dim+1;j++) delete [] values[j];
delete formulaTokens;
delete fitter;
delete[] values;
+ delete[] errors;
+ return preturnFormula;
+}
+
+
+
+TString* TStatToolkit::FitPlaneFixed(TTree *tree, const char* drawCommand, const char* formula, const char* cuts, Double_t & chi2, Int_t &npoints, TVectorD &fitParam, TMatrixD &covMatrix, Float_t frac, Int_t start, Int_t stop){
+ //
+ // fit an arbitrary function, specified by formula into the data, specified by drawCommand and cuts
+ // returns chi2, fitParam and covMatrix
+ // returns TString with fitted formula
+ //
+
+ TString formulaStr(formula);
+ TString drawStr(drawCommand);
+ TString cutStr(cuts);
+ TString ferr("1");
+
+ TString strVal(drawCommand);
+ if (strVal.Contains(":")){
+ TObjArray* valTokens = strVal.Tokenize(":");
+ drawStr = valTokens->At(0)->GetName();
+ ferr = valTokens->At(1)->GetName();
+ delete valTokens;
+ }
+
+
+ formulaStr.ReplaceAll("++", "~");
+ TObjArray* formulaTokens = formulaStr.Tokenize("~");
+ Int_t dim = formulaTokens->GetEntriesFast();
+
+ fitParam.ResizeTo(dim);
+ covMatrix.ResizeTo(dim,dim);
+ TString fitString="x0";
+ for (Int_t i=1; i<dim; i++) fitString+=Form("++x%d",i);
+ TLinearFitter* fitter = new TLinearFitter(dim, fitString.Data());
+ fitter->StoreData(kTRUE);
+ fitter->ClearPoints();
+
+ Int_t entries = tree->Draw(drawStr.Data(), cutStr.Data(), "goff", stop-start, start);
+ if (entries == -1) {
+ delete formulaTokens;
+ return new TString("An ERROR has occured during fitting!");
+ }
+ Double_t **values = new Double_t*[dim+1] ;
+ for (Int_t i=0; i<dim+1; i++) values[i]=NULL;
+ //
+ entries = tree->Draw(ferr.Data(), cutStr.Data(), "goff", stop-start, start);
+ if (entries == -1) {
+ delete []values;
+ delete formulaTokens;
+ return new TString("An ERROR has occured during fitting!");
+ }
+ Double_t *errors = new Double_t[entries];
+ memcpy(errors, tree->GetV1(), entries*sizeof(Double_t));
+
+ for (Int_t i = 0; i < dim + 1; i++){
+ Int_t centries = 0;
+ if (i < dim) centries = tree->Draw(((TObjString*)formulaTokens->At(i))->GetName(), cutStr.Data(), "goff", stop-start,start);
+ else centries = tree->Draw(drawStr.Data(), cutStr.Data(), "goff", stop-start,start);
+
+ if (entries != centries) {
+ delete []errors;
+ delete []values;
+ delete formulaTokens;
+ return new TString("An ERROR has occured during fitting!");
+ }
+ values[i] = new Double_t[entries];
+ memcpy(values[i], tree->GetV1(), entries*sizeof(Double_t));
+ }
+
+ // add points to the fitter
+ for (Int_t i = 0; i < entries; i++){
+ Double_t x[1000];
+ for (Int_t j=0; j<dim;j++) x[j]=values[j][i];
+ fitter->AddPoint(x, values[dim][i], errors[i]);
+ }
+
+ fitter->Eval();
+ if (frac>0.5 && frac<1){
+ fitter->EvalRobust(frac);
+ }
+ fitter->GetParameters(fitParam);
+ fitter->GetCovarianceMatrix(covMatrix);
+ chi2 = fitter->GetChisquare();
+ npoints = entries;
+
+ TString *preturnFormula = new TString("("), &returnFormula = *preturnFormula;
+
+ for (Int_t iparam = 0; iparam < dim; iparam++) {
+ returnFormula.Append(Form("%s*(%f)",((TObjString*)formulaTokens->At(iparam))->GetName(),fitParam[iparam]));
+ if (iparam < dim-1) returnFormula.Append("+");
+ }
+ returnFormula.Append(" )");
+
+
+ for (Int_t j=0; j<dim+1;j++) delete [] values[j];
+
+ delete formulaTokens;
+ delete fitter;
+ delete[] values;
+ delete[] errors;
return preturnFormula;
}
+
+
+
+
+
+Int_t TStatToolkit::GetFitIndex(const TString fString, const TString subString){
+ //
+ // fitString - ++ separated list of fits
+ // substring - ++ separated list of the requiered substrings
+ //
+ // return the last occurance of substring in fit string
+ //
+ TObjArray *arrFit = fString.Tokenize("++");
+ TObjArray *arrSub = subString.Tokenize("++");
+ Int_t index=-1;
+ for (Int_t i=0; i<arrFit->GetEntries(); i++){
+ Bool_t isOK=kTRUE;
+ TString str =arrFit->At(i)->GetName();
+ for (Int_t isub=0; isub<arrSub->GetEntries(); isub++){
+ if (str.Contains(arrSub->At(isub)->GetName())==0) isOK=kFALSE;
+ }
+ if (isOK) index=i;
+ }
+ delete arrFit;
+ delete arrSub;
+ return index;
+}
+
+
+TString TStatToolkit::FilterFit(const TString &input, const TString filter, TVectorD ¶m, TMatrixD & covar){
+ //
+ // Filter fit expression make sub-fit
+ //
+ TObjArray *array0= input.Tokenize("++");
+ TObjArray *array1= filter.Tokenize("++");
+ //TString *presult=new TString("(0");
+ TString result="(0.0";
+ for (Int_t i=0; i<array0->GetEntries(); i++){
+ Bool_t isOK=kTRUE;
+ TString str(array0->At(i)->GetName());
+ for (Int_t j=0; j<array1->GetEntries(); j++){
+ if (str.Contains(array1->At(j)->GetName())==0) isOK=kFALSE;
+ }
+ if (isOK) {
+ result+="+"+str;
+ result+=Form("*(%f)",param[i+1]);
+ printf("%f\t%f\t%s\n",param[i+1], TMath::Sqrt(covar(i+1,i+1)),str.Data());
+ }
+ }
+ result+="-0.)";
+ delete array0;
+ delete array1;
+ return result;
+}
+
+void TStatToolkit::Update1D(Double_t delta, Double_t sigma, Int_t s1, TMatrixD &vecXk, TMatrixD &covXk){
+ //
+ // Update parameters and covariance - with one measurement
+ // Input:
+ // vecXk - input vector - Updated in function
+ // covXk - covariance matrix - Updated in function
+ // delta, sigma, s1 - new measurement, rms of new measurement and the index of measurement
+ const Int_t knMeas=1;
+ Int_t knElem=vecXk.GetNrows();
+
+ TMatrixD mat1(knElem,knElem); // update covariance matrix
+ TMatrixD matHk(1,knElem); // vector to mesurement
+ TMatrixD vecYk(knMeas,1); // Innovation or measurement residual
+ TMatrixD matHkT(knElem,knMeas); // helper matrix Hk transpose
+ TMatrixD matSk(knMeas,knMeas); // Innovation (or residual) covariance
+ TMatrixD matKk(knElem,knMeas); // Optimal Kalman gain
+ TMatrixD covXk2(knElem,knElem); // helper matrix
+ TMatrixD covXk3(knElem,knElem); // helper matrix
+ TMatrixD vecZk(1,1);
+ TMatrixD measR(1,1);
+ vecZk(0,0)=delta;
+ measR(0,0)=sigma*sigma;
+ //
+ // reset matHk
+ for (Int_t iel=0;iel<knElem;iel++)
+ for (Int_t ip=0;ip<knMeas;ip++) matHk(ip,iel)=0;
+ //mat1
+ for (Int_t iel=0;iel<knElem;iel++) {
+ for (Int_t jel=0;jel<knElem;jel++) mat1(iel,jel)=0;
+ mat1(iel,iel)=1;
+ }
+ //
+ matHk(0, s1)=1;
+ vecYk = vecZk-matHk*vecXk; // Innovation or measurement residual
+ matHkT=matHk.T(); matHk.T();
+ matSk = (matHk*(covXk*matHkT))+measR; // Innovation (or residual) covariance
+ matSk.Invert();
+ matKk = (covXk*matHkT)*matSk; // Optimal Kalman gain
+ vecXk += matKk*vecYk; // updated vector
+ covXk2= (mat1-(matKk*matHk));
+ covXk3 = covXk2*covXk;
+ covXk = covXk3;
+ Int_t nrows=covXk3.GetNrows();
+
+ for (Int_t irow=0; irow<nrows; irow++)
+ for (Int_t icol=0; icol<nrows; icol++){
+ // rounding problems - make matrix again symteric
+ covXk(irow,icol)=(covXk3(irow,icol)+covXk3(icol,irow))*0.5;
+ }
+}
+
+
+
+void TStatToolkit::Constrain1D(const TString &input, const TString filter, TVectorD ¶m, TMatrixD & covar, Double_t mean, Double_t sigma){
+ //
+ // constrain linear fit
+ // input - string description of fit function
+ // filter - string filter to select sub fits
+ // param,covar - parameters and covariance matrix of the fit
+ // mean,sigma - new measurement uning which the fit is updated
+ //
+
+ TObjArray *array0= input.Tokenize("++");
+ TObjArray *array1= filter.Tokenize("++");
+ TMatrixD paramM(param.GetNrows(),1);
+ for (Int_t i=0; i<=array0->GetEntries(); i++){paramM(i,0)=param(i);}
+
+ if (filter.Length()==0){
+ TStatToolkit::Update1D(mean, sigma, 0, paramM, covar);//
+ }else{
+ for (Int_t i=0; i<array0->GetEntries(); i++){
+ Bool_t isOK=kTRUE;
+ TString str(array0->At(i)->GetName());
+ for (Int_t j=0; j<array1->GetEntries(); j++){
+ if (str.Contains(array1->At(j)->GetName())==0) isOK=kFALSE;
+ }
+ if (isOK) {
+ TStatToolkit::Update1D(mean, sigma, i+1, paramM, covar);//
+ }
+ }
+ }
+ for (Int_t i=0; i<=array0->GetEntries(); i++){
+ param(i)=paramM(i,0);
+ }
+ delete array0;
+ delete array1;
+}
+
+TString TStatToolkit::MakeFitString(const TString &input, const TVectorD ¶m, const TMatrixD & covar, Bool_t verbose){
+ //
+ //
+ //
+ TObjArray *array0= input.Tokenize("++");
+ TString result=Form("(%f",param[0]);
+ printf("%f\t%f\t\n", param[0], TMath::Sqrt(covar(0,0)));
+ for (Int_t i=0; i<array0->GetEntries(); i++){
+ TString str(array0->At(i)->GetName());
+ result+="+"+str;
+ result+=Form("*(%f)",param[i+1]);
+ if (verbose) printf("%f\t%f\t%s\n", param[i+1], TMath::Sqrt(covar(i+1,i+1)),str.Data());
+ }
+ result+="-0.)";
+ delete array0;
+ return result;
+}
+
+TGraphErrors * TStatToolkit::MakeGraphErrors(TTree * tree, const char * expr, const char * cut, Int_t mstyle, Int_t mcolor, Float_t msize, Float_t offset){
+ //
+ // Query a graph errors
+ // return TGraphErrors specified by expr and cut
+ // Example usage TStatToolkit::MakeGraphError(tree,"Y:X:ErrY","X>0", 25,2,0.4)
+ // tree - tree with variable
+ // expr - examp
+ const Int_t entries = tree->Draw(expr,cut,"goff");
+ if (entries<=0) {
+ TStatToolkit t;
+ t.Error("TStatToolkit::MakeGraphError",Form("Empty or Not valid expression (%s) or cut *%s)", expr,cut));
+ return 0;
+ }
+ if ( tree->GetV2()==0){
+ TStatToolkit t;
+ t.Error("TStatToolkit::MakeGraphError",Form("Not valid expression (%s) ", expr));
+ return 0;
+ }
+ TGraphErrors * graph=0;
+ if ( tree->GetV3()!=0){
+ graph = new TGraphErrors (entries, tree->GetV2(),tree->GetV1(),0,tree->GetV3());
+ }else{
+ graph = new TGraphErrors (entries, tree->GetV2(),tree->GetV1(),0,0);
+ }
+ graph->SetMarkerStyle(mstyle);
+ graph->SetMarkerColor(mcolor);
+ graph->SetLineColor(mcolor);
+ graph->SetTitle(expr);
+ TString chstring(expr);
+ TObjArray *charray = chstring.Tokenize(":");
+ graph->GetXaxis()->SetTitle(charray->At(1)->GetName());
+ graph->GetYaxis()->SetTitle(charray->At(0)->GetName());
+ delete charray;
+ if (msize>0) graph->SetMarkerSize(msize);
+ for(Int_t i=0;i<graph->GetN();i++) graph->GetX()[i]+=offset;
+ return graph;
+
+}
+
+
+TGraph * TStatToolkit::MakeGraphSparse(TTree * tree, const char * expr, const char * cut, Int_t mstyle, Int_t mcolor, Float_t msize, Float_t offset){
+ //
+ // Make a sparse draw of the variables
+ // Format of expr : Var:Run or Var:Run:ErrorY or Var:Run:ErrorY:ErrorX
+ // offset : points can slightly be shifted in x for better visibility with more graphs
+ //
+ // Written by Weilin.Yu
+ // updated & merged with QA-code by Patrick Reichelt
+ //
+ const Int_t entries = tree->Draw(expr,cut,"goff");
+ if (entries<=0) {
+ TStatToolkit t;
+ t.Error("TStatToolkit::MakeGraphSparse",Form("Empty or Not valid expression (%s) or cut (%s)", expr, cut));
+ return 0;
+ }
+ // TGraph * graph = (TGraph*)gPad->GetPrimitive("Graph"); // 2D
+
+ Double_t *graphY, *graphX;
+ graphY = tree->GetV1();
+ graphX = tree->GetV2();
+
+ // sort according to run number
+ Int_t *index = new Int_t[entries*4];
+ TMath::Sort(entries,graphX,index,kFALSE);
+
+ // define arrays for the new graph
+ Double_t *unsortedX = new Double_t[entries];
+ Int_t *runNumber = new Int_t[entries];
+ Double_t count = 0.5;
+
+ // evaluate arrays for the new graph according to the run-number
+ Int_t icount=0;
+ //first entry
+ unsortedX[index[0]] = count;
+ runNumber[0] = graphX[index[0]];
+ // loop the rest of entries
+ for(Int_t i=1;i<entries;i++)
+ {
+ if(graphX[index[i]]==graphX[index[i-1]])
+ unsortedX[index[i]] = count;
+ else if(graphX[index[i]]!=graphX[index[i-1]]){
+ count++;
+ icount++;
+ unsortedX[index[i]] = count;
+ runNumber[icount]=graphX[index[i]];
+ }
+ }
+
+ // count the number of xbins (run-wise) for the new graph
+ const Int_t newNbins = int(count+0.5);
+ Double_t *newBins = new Double_t[newNbins+1];
+ for(Int_t i=0; i<=count+1;i++){
+ newBins[i] = i;
+ }
+
+ // define and fill the new graph
+ TGraph *graphNew = 0;
+ if (tree->GetV3()) {
+ if (tree->GetV4()) {
+ graphNew = new TGraphErrors(entries,unsortedX,graphY,tree->GetV4(),tree->GetV3());
+ }
+ else { graphNew = new TGraphErrors(entries,unsortedX,graphY,0,tree->GetV3()); }
+ }
+ else { graphNew = new TGraphErrors(entries,unsortedX,graphY,0,0); }
+ // with "Set(...)", the x-axis is being sorted
+ graphNew->GetXaxis()->Set(newNbins,newBins);
+
+ // set the bins for the x-axis, apply shifting of points
+ Char_t xName[50];
+ for(Int_t i=0;i<count;i++){
+ snprintf(xName,50,"%d",runNumber[i]);
+ graphNew->GetXaxis()->SetBinLabel(i+1,xName);
+ graphNew->GetX()[i]+=offset;
+ }
+
+ graphNew->GetHistogram()->SetTitle("");
+ graphNew->SetMarkerStyle(mstyle);
+ graphNew->SetMarkerColor(mcolor); graphNew->SetLineColor(mcolor);
+ if (msize>0) { graphNew->SetMarkerSize(msize); graphNew->SetLineWidth(msize); }
+ delete [] unsortedX;
+ delete [] runNumber;
+ delete [] index;
+ delete [] newBins;
+ //
+ graphNew->SetTitle(expr);
+ TString chstring(expr);
+ TObjArray *charray = chstring.Tokenize(":");
+ graphNew->GetXaxis()->SetTitle(charray->At(1)->GetName());
+ graphNew->GetYaxis()->SetTitle(charray->At(0)->GetName());
+ delete charray;
+ return graphNew;
+}
+
+
+
+//
+// functions used for the trending
+//
+
+Int_t TStatToolkit::MakeStatAlias(TTree * tree, const char * expr, const char * cut, const char * alias)
+{
+ //
+ // Add alias using statistical values of a given variable.
+ // (by MI, Patrick Reichelt)
+ //
+ // tree - input tree
+ // expr - variable expression
+ // cut - selection criteria
+ // Output - return number of entries used to define variable
+ // In addition mean, rms, median, and robust mean and rms (choosing fraction of data with smallest RMS)
+ //
+ /* Example usage:
+ 1.) create the robust estimators for variable expr="QA.TPC.CPass1.meanTPCncl" and create a corresponding
+ aliases with the prefix alias[0]="ncl", calculated using fraction alias[1]="0.90"
+
+ TStatToolkit::MakeStatAlias(tree,"QA.TPC.CPass1.meanTPCncl","QA.TPC.CPass1.status>0","ncl:0.9");
+ root [4] tree->GetListOfAliases().Print()
+ OBJ: TNamed ncl_Median (130.964333+0)
+ OBJ: TNamed ncl_Mean (122.120387+0)
+ OBJ: TNamed ncl_RMS (33.509623+0)
+ OBJ: TNamed ncl_Mean90 (131.503862+0)
+ OBJ: TNamed ncl_RMS90 (3.738260+0)
+ */
+ //
+ Int_t entries = tree->Draw(expr,cut,"goff");
+ if (entries<=1){
+ printf("Expression or cut not valid:\t%s\t%s\n", expr, cut);
+ return 0;
+ }
+ //
+ TObjArray* oaAlias = TString(alias).Tokenize(":");
+ if (oaAlias->GetEntries()<2) {
+ printf("Alias must have 2 arguments:\t%s\n", alias);
+ return 0;
+ }
+ Float_t entryFraction = atof( oaAlias->At(1)->GetName() );
+ //
+ Double_t median = TMath::Median(entries,tree->GetV1());
+ Double_t mean = TMath::Mean(entries,tree->GetV1());
+ Double_t rms = TMath::RMS(entries,tree->GetV1());
+ Double_t meanEF=0, rmsEF=0;
+ TStatToolkit::EvaluateUni(entries, tree->GetV1(), meanEF, rmsEF, entries*entryFraction);
+ //
+ tree->SetAlias(Form("%s_Median",oaAlias->At(0)->GetName()), Form("(%f+0)",median));
+ tree->SetAlias(Form("%s_Mean",oaAlias->At(0)->GetName()), Form("(%f+0)",mean));
+ tree->SetAlias(Form("%s_RMS",oaAlias->At(0)->GetName()), Form("(%f+0)",rms));
+ tree->SetAlias(Form("%s_Mean%d",oaAlias->At(0)->GetName(),Int_t(entryFraction*100)), Form("(%f+0)",meanEF));
+ tree->SetAlias(Form("%s_RMS%d",oaAlias->At(0)->GetName(),Int_t(entryFraction*100)), Form("(%f+0)",rmsEF));
+ delete oaAlias;
+ return entries;
+}
+
+Int_t TStatToolkit::SetStatusAlias(TTree * tree, const char * expr, const char * cut, const char * alias)
+{
+ //
+ // Add alias to trending tree using statistical values of a given variable.
+ // (by MI, Patrick Reichelt)
+ //
+ // format of expr : varname (e.g. meanTPCncl)
+ // format of cut : char like in TCut
+ // format of alias: alias:query:entryFraction(EF) (fraction of entries used for uniformity evaluation)
+ // e.g.: varname_Out:(abs(varname-meanEF)>6.*rmsEF):0.8
+ // available internal variables are: 'varname, Median, Mean, MeanEF, RMS, RMSEF'
+ // in the alias, 'varname' will be replaced by its content, and 'EF' by the percentage (e.g. MeanEF -> Mean80)
+ //
+ /* Example usage:
+ 1.) Define robust mean (possible, but easier done with TStatToolkit::MakeStatAlias(...))
+ TStatToolkit::SetStatusAlias(tree, "meanTPCnclF", "meanTPCnclF>0", "meanTPCnclF_MeanEF:MeanEF:0.80") ;
+ root [10] tree->GetListOfAliases()->Print()
+ Collection name='TList', class='TList', size=1
+ OBJ: TNamed meanTPCnclF_Mean80 0.899308
+ 2.) create alias outlyers - 6 sigma cut
+ TStatToolkit::SetStatusAlias(tree, "meanTPCnclF", "meanTPCnclF>0", "meanTPCnclF_Out:(abs(meanTPCnclF-MeanEF)>6.*RMSEF):0.8")
+ meanTPCnclF_Out ==> (abs(meanTPCnclF-0.899308)>6.*0.016590)
+ 3.) the same functionality as in 2.)
+ TStatToolkit::SetStatusAlias(tree, "meanTPCnclF", "meanTPCnclF>0", "varname_Out2:(abs(varname-MeanEF)>6.*RMSEF):0.8")
+ meanTPCnclF_Out2 ==> (abs(meanTPCnclF-0.899308)>6.*0.016590)
+ */
+ //
+ Int_t entries = tree->Draw(expr,cut,"goff");
+ if (entries<1){
+ printf("Expression or cut not valid:\t%s\t%s\n", expr, cut);
+ return 0;
+ }
+ //
+ TObjArray* oaVar = TString(expr).Tokenize(":");
+ char varname[50];
+ snprintf(varname,50,"%s", oaVar->At(0)->GetName());
+ Float_t entryFraction = 0.8;
+ //
+ TObjArray* oaAlias = TString(alias).Tokenize(":");
+ if (oaAlias->GetEntries()<2) {
+ printf("Alias must have at least 2 arguments:\t%s\n", alias);
+ return 0;
+ }
+ else if (oaAlias->GetEntries()<3) {
+ //printf("Using default entryFraction if needed:\t%f\n", entryFraction);
+ }
+ else entryFraction = atof( oaAlias->At(2)->GetName() );
+ //
+ Double_t median = TMath::Median(entries,tree->GetV1());
+ Double_t mean = TMath::Mean(entries,tree->GetV1());
+ Double_t rms = TMath::RMS(entries,tree->GetV1());
+ Double_t meanEF=0, rmsEF=0;
+ TStatToolkit::EvaluateUni(entries, tree->GetV1(), meanEF, rmsEF, entries*entryFraction);
+ //
+ TString sAlias( oaAlias->At(0)->GetName() );
+ sAlias.ReplaceAll("varname",varname);
+ sAlias.ReplaceAll("MeanEF", Form("Mean%1.0f",entryFraction*100) );
+ sAlias.ReplaceAll("RMSEF", Form("RMS%1.0f",entryFraction*100) );
+ TString sQuery( oaAlias->At(1)->GetName() );
+ sQuery.ReplaceAll("varname",varname);
+ sQuery.ReplaceAll("MeanEF", Form("%f",meanEF) );
+ sQuery.ReplaceAll("RMSEF", Form("%f",rmsEF) ); //make sure to replace 'RMSEF' before 'RMS'...
+ sQuery.ReplaceAll("Median", Form("%f",median) );
+ sQuery.ReplaceAll("Mean", Form("%f",mean) );
+ sQuery.ReplaceAll("RMS", Form("%f",rms) );
+ printf("define alias:\t%s = %s\n", sAlias.Data(), sQuery.Data());
+ //
+ char query[200];
+ char aname[200];
+ snprintf(query,200,"%s", sQuery.Data());
+ snprintf(aname,200,"%s", sAlias.Data());
+ tree->SetAlias(aname, query);
+ delete oaVar;
+ delete oaAlias;
+ return entries;
+}
+
+TMultiGraph* TStatToolkit::MakeStatusMultGr(TTree * tree, const char * expr, const char * cut, const char * alias, Int_t igr)
+{
+ //
+ // Compute a trending multigraph that shows for which runs a variable has outliers.
+ // (by MI, Patrick Reichelt)
+ //
+ // format of expr : varname:xaxis (e.g. meanTPCncl:run, but 'varname' can be any string that you need for seach-and-replace)
+ // format of cut : char like in TCut
+ // format of alias: (1):(statisticOK):(varname_Warning):(varname_Out)[:(varname_PhysAcc):(varname_Extra)]
+ //
+ // function MakeGraphSparse() is called for each alias argument, which will be used as tree expression.
+ // each alias argument is supposed to be a Boolean statement which can be evaluated as tree expression.
+ // the order of these criteria should be kept, as the marker styles and colors are chosen to be meaningful this way!
+ // 'statisticOK' could e.g. be an alias for '(meanTPCncl>0)'.
+ // if you dont need e.g. a 'warning' condition, then just replace it by (0).
+ // in the alias, 'varname' will be replaced by its content (e.g. varname_Out -> meanTPCncl_Out)
+ // note: the aliases 'varname_Out' etc have to be defined by function TStatToolkit::SetStatusAlias(...)
+ // counter igr is used to shift the multigraph in y when filling a TObjArray.
+ //
+ //
+ // To create the Status Bar, the following is done in principle.
+ // ( example current usage in $ALICE_ROOT/PWGPP/TPC/macros/drawPerformanceTPCQAMatchTrends.C and ./qaConfig.C. )
+ //
+ // TStatToolkit::SetStatusAlias(tree, "meanTPCncl", "", "varname_Out:(abs(varname-MeanEF)>6.*RMSEF):0.8");
+ // TStatToolkit::SetStatusAlias(tree, "tpcItsMatchA", "", "varname_Out:(abs(varname-MeanEF)>6.*RMSEF):0.8");
+ // TStatToolkit::SetStatusAlias(tree, "meanTPCncl", "", "varname_Warning:(abs(varname-MeanEF)>3.*RMSEF):0.8");
+ // TStatToolkit::SetStatusAlias(tree, "tpcItsMatchA", "", "varname_Warning:(abs(varname-MeanEF)>3.*RMSEF):0.8");
+ // TObjArray* oaMultGr = new TObjArray(); int igr=0;
+ // oaMultGr->Add( TStatToolkit::MakeStatusMultGr(tree, "tpcItsMatchA:run", "", "(1):(meanTPCncl>0):(varname_Warning):(varname_Outlier):", igr) ); igr++;
+ // oaMultGr->Add( TStatToolkit::MakeStatusMultGr(tree, "meanTPCncl:run", "", "(1):(meanTPCncl>0):(varname_Warning):(varname_Outlier):", igr) ); igr++;
+ // TCanvas *c1 = new TCanvas("c1","c1");
+ // TStatToolkit::AddStatusPad(c1, 0.30, 0.40);
+ // TStatToolkit::DrawStatusGraphs(oaMultGr);
+
+
+ TObjArray* oaVar = TString(expr).Tokenize(":");
+ if (oaVar->GetEntries()<2) {
+ printf("Expression has to be of type 'varname:xaxis':\t%s\n", expr);
+ return 0;
+ }
+ char varname[50];
+ char var_x[50];
+ snprintf(varname,50,"%s", oaVar->At(0)->GetName());
+ snprintf(var_x ,50,"%s", oaVar->At(1)->GetName());
+ //
+ TString sAlias(alias);
+ sAlias.ReplaceAll("varname",varname);
+ TObjArray* oaAlias = TString(sAlias.Data()).Tokenize(":");
+ if (oaAlias->GetEntries()<2) {
+ printf("Alias must have 2-6 arguments:\t%s\n", alias);
+ return 0;
+ }
+ char query[200];
+ TMultiGraph* multGr = new TMultiGraph();
+ Int_t marArr[6] = {24+igr%2, 20+igr%2, 20+igr%2, 20+igr%2, 20+igr%2, 20+igr%2};
+ Int_t colArr[6] = {kBlack, kBlack, kOrange, kRed, kGreen+1, kBlue};
+ Double_t sizeArr[6] = {1.4, 1.1, 1.5, 1.1, 1.4, 0.8};
+ Double_t shiftArr[6] = {0., 0., 0.25, 0.25, -0.25, -0.25};
+ const Int_t ngr = oaAlias->GetEntriesFast();
+ for (Int_t i=0; i<ngr; i++){
+ snprintf(query,200, "%f*(%s-0.5):%s", 1.+igr, oaAlias->At(i)->GetName(), var_x);
+ multGr->Add( (TGraphErrors*) TStatToolkit::MakeGraphSparse(tree,query,cut,marArr[i],colArr[i],sizeArr[i],shiftArr[i]) );
+ }
+ //
+ multGr->SetName(varname);
+ multGr->SetTitle(varname); // used for y-axis labels of status bar, can be modified by calling function.
+ delete oaVar;
+ delete oaAlias;
+ return multGr;
+}
+
+
+void TStatToolkit::AddStatusPad(TCanvas* c1, Float_t padratio, Float_t bottommargin)
+{
+ //
+ // add pad to bottom of canvas for Status graphs (by Patrick Reichelt)
+ // call function "DrawStatusGraphs(...)" afterwards
+ //
+ TCanvas* c1_clone = (TCanvas*) c1->Clone("c1_clone");
+ c1->Clear();
+ // produce new pads
+ c1->cd();
+ TPad* pad1 = new TPad("pad1", "pad1", 0., padratio, 1., 1.);
+ pad1->Draw();
+ pad1->SetNumber(1); // so it can be called via "c1->cd(1);"
+ c1->cd();
+ TPad* pad2 = new TPad("pad2", "pad2", 0., 0., 1., padratio);
+ pad2->Draw();
+ pad2->SetNumber(2);
+ // draw original canvas into first pad
+ c1->cd(1);
+ c1_clone->DrawClonePad();
+ pad1->SetBottomMargin(0.001);
+ pad1->SetRightMargin(0.01);
+ // set up second pad
+ c1->cd(2);
+ pad2->SetGrid(3);
+ pad2->SetTopMargin(0);
+ pad2->SetBottomMargin(bottommargin); // for the long x-axis labels (runnumbers)
+ pad2->SetRightMargin(0.01);
+}
+
+
+void TStatToolkit::DrawStatusGraphs(TObjArray* oaMultGr)
+{
+ //
+ // draw Status graphs into active pad of canvas (by MI, Patrick Reichelt)
+ // ...into bottom pad, if called after "AddStatusPad(...)"
+ //
+ const Int_t nvars = oaMultGr->GetEntriesFast();
+ TGraph* grAxis = (TGraph*) ((TMultiGraph*) oaMultGr->At(0))->GetListOfGraphs()->At(0);
+ grAxis->SetMaximum(0.5*nvars+0.5);
+ grAxis->SetMinimum(0);
+ grAxis->GetYaxis()->SetLabelSize(0);
+ grAxis->GetYaxis()->SetTitle("");
+ grAxis->SetTitle("");
+ Int_t entries = grAxis->GetN();
+ grAxis->GetXaxis()->SetLabelSize(5.7*TMath::Min(TMath::Max(5./entries,0.01),0.03));
+ grAxis->GetXaxis()->LabelsOption("v");
+ grAxis->Draw("ap");
+ //
+ // draw multigraphs & names of status variables on the y axis
+ for (Int_t i=0; i<nvars; i++){
+ ((TMultiGraph*) oaMultGr->At(i))->Draw("p");
+ TLatex* ylabel = new TLatex(-0.1, 0.5*i+0.5, ((TMultiGraph*) oaMultGr->At(i))->GetTitle());
+ ylabel->SetTextAlign(32); //hor:right & vert:centered
+ ylabel->SetTextSize(0.025/gPad->GetHNDC());
+ ylabel->Draw();
+ }
+}
+
+
+TTree* TStatToolkit::WriteStatusToTree(TObject* oStatusGr)
+{
+ //
+ // Create Tree with Integers for each status variable flag (warning, outlier, physacc).
+ // (by Patrick Reichelt)
+ //
+ // input: either a TMultiGraph with status of single variable, which
+ // was computed by TStatToolkit::MakeStatusMultGr(),
+ // or a TObjArray which contains up to 10 of such variables.
+ // example: TTree* statusTree = WriteStatusToTree( TStatToolkit::MakeStatusMultGr(tree, "tpcItsMatch:run", "", sCriteria.Data(), 0) );
+ // or : TTree* statusTree = TStatToolkit::WriteStatusToTree(oaMultGr);
+ //
+ // output tree: 1=flag is true, 0=flag is false, -1=flag was not computed.
+ // To be rewritten to the pcstream
+
+ TObjArray* oaMultGr = NULL;
+ Bool_t needDeletion=kFALSE;
+ if (oStatusGr->IsA() == TObjArray::Class()) {
+ oaMultGr = (TObjArray*) oStatusGr;
+ }
+ else if (oStatusGr->IsA() == TMultiGraph::Class()) {
+ oaMultGr = new TObjArray(); needDeletion=kTRUE;
+ oaMultGr->Add((TMultiGraph*) oStatusGr);
+ }
+ else {
+ Printf("WriteStatusToTree(): Error! 'oStatusGr' must be a TMultiGraph or a TObjArray of them!");
+ return 0;
+ }
+ // variables for output tree
+ const int nvarsMax=10;
+ const int ncritMax=5;
+ Int_t currentRun;
+ Int_t treevars[nvarsMax*ncritMax];
+ TString varnames[nvarsMax*ncritMax];
+ for (int i=0; i<nvarsMax*ncritMax; i++) treevars[i]=-1;
+
+ Printf("WriteStatusToTree(): writing following variables to TTree (maybe only subset of listed criteria filled)");
+ for (Int_t vari=0; vari<nvarsMax; vari++)
+ {
+ if (vari < oaMultGr->GetEntriesFast()) {
+ varnames[vari*ncritMax+0] = Form("%s_statisticOK", ((TMultiGraph*) oaMultGr->At(vari))->GetName());
+ varnames[vari*ncritMax+1] = Form("%s_Warning", ((TMultiGraph*) oaMultGr->At(vari))->GetName());
+ varnames[vari*ncritMax+2] = Form("%s_Outlier", ((TMultiGraph*) oaMultGr->At(vari))->GetName());
+ varnames[vari*ncritMax+3] = Form("%s_PhysAcc", ((TMultiGraph*) oaMultGr->At(vari))->GetName());
+ varnames[vari*ncritMax+4] = Form("%s_Extra", ((TMultiGraph*) oaMultGr->At(vari))->GetName());
+ }
+ else {
+ varnames[vari*ncritMax+0] = Form("dummy");
+ varnames[vari*ncritMax+1] = Form("dummy");
+ varnames[vari*ncritMax+2] = Form("dummy");
+ varnames[vari*ncritMax+3] = Form("dummy");
+ varnames[vari*ncritMax+4] = Form("dummy");
+ }
+ cout << " " << varnames[vari*ncritMax+0].Data() << " " << varnames[vari*ncritMax+1].Data() << " " << varnames[vari*ncritMax+2].Data() << " " << varnames[vari*ncritMax+3].Data() << " " << varnames[vari*ncritMax+4].Data() << endl;
+ }
+
+ TTree* statusTree = new TTree("statusTree","statusTree");
+ statusTree->Branch("run", ¤tRun );
+ statusTree->Branch(varnames[ 0].Data(), &treevars[ 0]);
+ statusTree->Branch(varnames[ 1].Data(), &treevars[ 1]);
+ statusTree->Branch(varnames[ 2].Data(), &treevars[ 2]);
+ statusTree->Branch(varnames[ 3].Data(), &treevars[ 3]);
+ statusTree->Branch(varnames[ 4].Data(), &treevars[ 4]);
+ statusTree->Branch(varnames[ 5].Data(), &treevars[ 5]);
+ statusTree->Branch(varnames[ 6].Data(), &treevars[ 6]);
+ statusTree->Branch(varnames[ 7].Data(), &treevars[ 7]);
+ statusTree->Branch(varnames[ 8].Data(), &treevars[ 8]);
+ statusTree->Branch(varnames[ 9].Data(), &treevars[ 9]);
+ statusTree->Branch(varnames[10].Data(), &treevars[10]);
+ statusTree->Branch(varnames[11].Data(), &treevars[11]);
+ statusTree->Branch(varnames[12].Data(), &treevars[12]);
+ statusTree->Branch(varnames[13].Data(), &treevars[13]);
+ statusTree->Branch(varnames[14].Data(), &treevars[14]);
+ statusTree->Branch(varnames[15].Data(), &treevars[15]);
+ statusTree->Branch(varnames[16].Data(), &treevars[16]);
+ statusTree->Branch(varnames[17].Data(), &treevars[17]);
+ statusTree->Branch(varnames[18].Data(), &treevars[18]);
+ statusTree->Branch(varnames[19].Data(), &treevars[19]);
+ statusTree->Branch(varnames[20].Data(), &treevars[20]);
+ statusTree->Branch(varnames[21].Data(), &treevars[21]);
+ statusTree->Branch(varnames[22].Data(), &treevars[22]);
+ statusTree->Branch(varnames[23].Data(), &treevars[23]);
+ statusTree->Branch(varnames[24].Data(), &treevars[24]);
+ statusTree->Branch(varnames[25].Data(), &treevars[25]);
+ statusTree->Branch(varnames[26].Data(), &treevars[26]);
+ statusTree->Branch(varnames[27].Data(), &treevars[27]);
+ statusTree->Branch(varnames[28].Data(), &treevars[28]);
+ statusTree->Branch(varnames[29].Data(), &treevars[29]);
+ statusTree->Branch(varnames[30].Data(), &treevars[30]);
+ statusTree->Branch(varnames[31].Data(), &treevars[31]);
+ statusTree->Branch(varnames[32].Data(), &treevars[32]);
+ statusTree->Branch(varnames[33].Data(), &treevars[33]);
+ statusTree->Branch(varnames[34].Data(), &treevars[34]);
+ statusTree->Branch(varnames[35].Data(), &treevars[35]);
+ statusTree->Branch(varnames[36].Data(), &treevars[36]);
+ statusTree->Branch(varnames[37].Data(), &treevars[37]);
+ statusTree->Branch(varnames[38].Data(), &treevars[38]);
+ statusTree->Branch(varnames[39].Data(), &treevars[39]);
+ statusTree->Branch(varnames[40].Data(), &treevars[40]);
+ statusTree->Branch(varnames[41].Data(), &treevars[41]);
+ statusTree->Branch(varnames[42].Data(), &treevars[42]);
+ statusTree->Branch(varnames[43].Data(), &treevars[43]);
+ statusTree->Branch(varnames[44].Data(), &treevars[44]);
+ statusTree->Branch(varnames[45].Data(), &treevars[45]);
+ statusTree->Branch(varnames[46].Data(), &treevars[46]);
+ statusTree->Branch(varnames[47].Data(), &treevars[47]);
+ statusTree->Branch(varnames[48].Data(), &treevars[48]);
+ statusTree->Branch(varnames[49].Data(), &treevars[49]);
+
+ // run loop
+ Double_t graphX; // x-position of marker (0.5, 1.5, ...)
+ Double_t graphY; // if >0 -> warning/outlier/physacc! if =-0.5 -> no warning/outlier/physacc
+ TList* arrRuns = (TList*) ((TGraph*) ((TMultiGraph*) oaMultGr->At(0))->GetListOfGraphs()->At(0))->GetXaxis()->GetLabels();
+ //'TAxis->GetLabels()' returns THashList of TObjString, but using THashList gives compilation error "... incomplete type 'struct THashList' "
+ for (Int_t runi=0; runi<arrRuns->GetSize(); runi++)
+ {
+ currentRun = atoi( arrRuns->At(runi)->GetName() );
+ //Printf(" runi=%2i, name: %s \t run number: %i", runi, arrRuns->At(runi)->GetName(), currentRun);
+
+ // status variable loop
+ for (Int_t vari=0; vari<oaMultGr->GetEntriesFast(); vari++)
+ {
+ TMultiGraph* multGr = (TMultiGraph*) oaMultGr->At(vari);
+
+ // criteria loop
+ // the order is given by TStatToolkit::MakeStatusMultGr().
+ // criterion #1 is 'statisticOK' and mandatory, the rest is optional. (#0 is always True, thus skipped)
+ for (Int_t criti=1; criti<multGr->GetListOfGraphs()->GetEntries(); criti++)
+ {
+ TGraph* grCriterion = (TGraph*) multGr->GetListOfGraphs()->At(criti);
+ graphX = -1, graphY = -1;
+ grCriterion->GetPoint(runi, graphX, graphY);
+ treevars[(vari)*ncritMax+(criti-1)] = (graphY>0)?1:0;
+ }
+ }
+ statusTree->Fill();
+ }
+
+ if (needDeletion) delete oaMultGr;
+
+ return statusTree;
+}
+
+
+void TStatToolkit::MakeSummaryTree(TTree* treeIn, TTreeSRedirector *pcstream, TObjString & sumID, TCut &selection){
+ //
+ // Make a summary tree for the input tree
+ // For the moment statistic works only for the primitive branches (Float/Double/Int)
+ // Extension recursive version planned for graphs a and histograms
+ //
+ // Following statistics are exctracted:
+ // - Standard: mean, meadian, rms
+ // - LTM robust statistic: mean60, rms60, mean90, rms90
+ // Parameters:
+ // treeIn - input tree
+ // pctream - Output redirector
+ // sumID - ID as will be used in output tree
+ // selection - selection criteria define the set of entries used to evaluat statistic
+ //
+ TObjArray * brArray = treeIn->GetListOfBranches();
+ Int_t tEntries= treeIn->GetEntries();
+ Int_t nBranches=brArray->GetEntries();
+ TString treeName = treeIn->GetName();
+ treeName+="Summary";
+
+ (*pcstream)<<treeName.Data()<<"entries="<<tEntries;
+ (*pcstream)<<treeName.Data()<<"ID.="<<&sumID;
+
+ TMatrixD valBranch(nBranches,7);
+ for (Int_t iBr=0; iBr<nBranches; iBr++){
+ TString brName= brArray->At(iBr)->GetName();
+ Int_t entries=treeIn->Draw(brArray->At(iBr)->GetName(),selection);
+ if (entries==0) continue;
+ Double_t median, mean, rms, mean60,rms60, mean90, rms90;
+ mean = TMath::Mean(entries,treeIn->GetV1());
+ median= TMath::Median(entries,treeIn->GetV1());
+ rms = TMath::RMS(entries,treeIn->GetV1());
+ TStatToolkit::EvaluateUni(entries, treeIn->GetV1(), mean60,rms60,TMath::Min(TMath::Max(2., 0.60*entries),Double_t(entries)));
+ TStatToolkit::EvaluateUni(entries, treeIn->GetV1(), mean90,rms90,TMath::Min(TMath::Max(2., 0.90*entries),Double_t(entries)));
+ valBranch(iBr,0)=mean;
+ valBranch(iBr,1)=median;
+ valBranch(iBr,2)=rms;
+ valBranch(iBr,3)=mean60;
+ valBranch(iBr,4)=rms60;
+ valBranch(iBr,5)=mean90;
+ valBranch(iBr,6)=rms90;
+ (*pcstream)<<treeName.Data()<<
+ brName+"_Mean="<<valBranch(iBr,0)<<
+ brName+"_Median="<<valBranch(iBr,1)<<
+ brName+"_RMS="<<valBranch(iBr,2)<<
+ brName+"_Mean60="<<valBranch(iBr,3)<<
+ brName+"_RMS60="<<valBranch(iBr,4)<<
+ brName+"_Mean90="<<valBranch(iBr,5)<<
+ brName+"_RMS90="<<valBranch(iBr,6);
+ }
+ (*pcstream)<<treeName.Data()<<"\n";
+}
+
+
+
+TMultiGraph* TStatToolkit::MakeStatusLines(TTree * tree, const char * expr, const char * cut, const char * alias)
+{
+ //
+ // Create status lines for trending using MakeGraphSparse(), very similar to MakeStatusMultGr().
+ // (by Patrick Reichelt)
+ //
+ // format of expr : varname:xaxis (e.g. meanTPCncl:run, but 'varname' can be any string that you need for seach-and-replace)
+ // format of cut : char like in TCut
+ // format of alias: varname_OutlierMin:varname_OutlierMax:varname_WarningMin:varname_WarningMax:varname_PhysAccMin:varname_PhysAccMax:varname_RobustMean
+ //
+ TObjArray* oaVar = TString(expr).Tokenize(":");
+ if (oaVar->GetEntries()<2) {
+ printf("Expression has to be of type 'varname:xaxis':\t%s\n", expr);
+ return 0;
+ }
+ char varname[50];
+ char var_x[50];
+ snprintf(varname,50,"%s", oaVar->At(0)->GetName());
+ snprintf(var_x ,50,"%s", oaVar->At(1)->GetName());
+ //
+ TString sAlias(alias);
+ if (sAlias.IsNull()) { // alias for default usage set here:
+ sAlias = "varname_OutlierMin:varname_OutlierMax:varname_WarningMin:varname_WarningMax:varname_PhysAccMin:varname_PhysAccMax:varname_RobustMean";
+ }
+ sAlias.ReplaceAll("varname",varname);
+ TObjArray* oaAlias = TString(sAlias.Data()).Tokenize(":");
+ if (oaAlias->GetEntries()<2) {
+ printf("Alias must have 2-7 arguments:\t%s\n", alias);
+ return 0;
+ }
+ char query[200];
+ TMultiGraph* multGr = new TMultiGraph();
+ Int_t colArr[7] = {kRed, kRed, kOrange, kOrange, kGreen+1, kGreen+1, kGray+2};
+ const Int_t ngr = oaAlias->GetEntriesFast();
+ for (Int_t i=0; i<ngr; i++){
+ snprintf(query,200, "%s:%s", oaAlias->At(i)->GetName(), var_x);
+ multGr->Add( (TGraphErrors*) TStatToolkit::MakeGraphSparse(tree,query,cut,29,colArr[i],1.5) );
+ }
+ //
+ multGr->SetName(varname);
+ multGr->SetTitle(varname);
+ delete oaVar;
+ delete oaAlias;
+ return multGr;
+}
+
+
+TH1* TStatToolkit::DrawHistogram(TTree * tree, const char* drawCommand, const char* cuts, const char* histoname, const char* histotitle, Int_t nsigma, Float_t fraction )
+{
+ //
+ // Draw histogram from TTree with robust range
+ // Only for 1D so far!
+ //
+ // Parameters:
+ // - histoname: name of histogram
+ // - histotitle: title of histgram
+ // - fraction: fraction of data to define the robust mean
+ // - nsigma: nsigma value for range
+ //
+
+ TString drawStr(drawCommand);
+ TString cutStr(cuts);
+ Int_t dim = 1;
+
+ if(!tree) {
+ cerr<<" Tree pointer is NULL!"<<endl;
+ return 0;
+ }
+
+ // get entries
+ Int_t entries = tree->Draw(drawStr.Data(), cutStr.Data(), "goff");
+ if (entries == -1) {
+ cerr<<"TTree draw returns -1"<<endl;
+ return 0;
+ }
+
+ // get dimension
+ if(tree->GetV1()) dim = 1;
+ if(tree->GetV2()) dim = 2;
+ if(tree->GetV3()) dim = 3;
+ if(dim > 2){
+ cerr<<"TTree has more than 2 dimensions (not yet supported)"<<endl;
+ return 0;
+ }
+
+ // draw robust
+ Double_t meanX, rmsX=0;
+ Double_t meanY, rmsY=0;
+ TStatToolkit::EvaluateUni(entries, tree->GetV1(),meanX,rmsX, fraction*entries);
+ if(dim==2){
+ TStatToolkit::EvaluateUni(entries, tree->GetV1(),meanY,rmsY, fraction*entries);
+ TStatToolkit::EvaluateUni(entries, tree->GetV2(),meanX,rmsX, fraction*entries);
+ }
+ TH1* hOut=NULL;
+ if(dim==1){
+ hOut = new TH1F(histoname, histotitle, 200, meanX-nsigma*rmsX, meanX+nsigma*rmsX);
+ for (Int_t i=0; i<entries; i++) hOut->Fill(tree->GetV1()[i]);
+ hOut->GetXaxis()->SetTitle(tree->GetHistogram()->GetXaxis()->GetTitle());
+ hOut->Draw();
+ }
+ else if(dim==2){
+ hOut = new TH2F(histoname, histotitle, 200, meanX-nsigma*rmsX, meanX+nsigma*rmsX,200, meanY-nsigma*rmsY, meanY+nsigma*rmsY);
+ for (Int_t i=0; i<entries; i++) hOut->Fill(tree->GetV2()[i],tree->GetV1()[i]);
+ hOut->GetXaxis()->SetTitle(tree->GetHistogram()->GetXaxis()->GetTitle());
+ hOut->GetYaxis()->SetTitle(tree->GetHistogram()->GetYaxis()->GetTitle());
+ hOut->Draw("colz");
+ }
+ return hOut;
+}
+
+void TStatToolkit::CheckTreeAliases(TTree * tree, Int_t ncheck){
+ //
+ // Check consistency of tree aliases
+ //
+ Int_t nCheck=100;
+ TList * aliases = (TList*)tree->GetListOfAliases();
+ Int_t entries = aliases->GetEntries();
+ for (Int_t i=0; i<entries; i++){
+ TObject * object= aliases->At(i);
+ if (!object) continue;
+ Int_t ndraw=tree->Draw(aliases->At(i)->GetName(),"1","goff",nCheck);
+ if (ndraw==0){
+ ::Error("Alias:\tProblem",aliases->At(i)->GetName());
+ }else{
+ ::Info("Alias:\tOK",aliases->At(i)->GetName());
+ }
+ }
+}