589enum EInconsistencyBits {
590 kFullyConsistent = 0,
591 kDifferentLabels =
BIT(0),
592 kDifferentBinLimits =
BIT(1),
593 kDifferentAxisLimits =
BIT(2),
594 kDifferentNumberOfBins =
BIT(3),
595 kDifferentDimensions =
BIT(4)
691 if (nbins <= 0) {
Warning(
"TH1",
"nbins is <=0 - set to nbins = 1"); nbins = 1; }
713 if (nbins <= 0) {
Warning(
"TH1",
"nbins is <=0 - set to nbins = 1"); nbins = 1; }
735 if (nbins <= 0) {
Warning(
"TH1",
"nbins is <=0 - set to nbins = 1"); nbins = 1; }
754 Draw(
b ?
b->GetDrawOption() :
"");
819 Error(
"Add",
"Attempt to add a non-existing function");
839 for (
Int_t i = 0; i < 10; ++i)
s1[i] = 0;
845 Int_t bin, binx, biny, binz;
850 for (binz = 0; binz < ncellsz; ++binz) {
852 for (biny = 0; biny < ncellsy; ++biny) {
854 for (binx = 0; binx < ncellsx; ++binx) {
858 bin = binx + ncellsx * (biny + ncellsy * binz);
877 if (inconsistency & kDifferentDimensions) {
879 Info(
name,
"Histograms have different dimensions - trying to use TH1::Merge");
881 Error(
name,
"Histograms have different dimensions");
883 }
else if (inconsistency & kDifferentNumberOfBins) {
885 Info(
name,
"Histograms have different number of bins - trying to use TH1::Merge");
887 Error(
name,
"Histograms have different number of bins");
889 }
else if (inconsistency & kDifferentAxisLimits) {
891 Info(
name,
"Histograms have different axis limits - trying to use TH1::Merge");
893 Warning(
name,
"Histograms have different axis limits");
894 }
else if (inconsistency & kDifferentBinLimits) {
896 Info(
name,
"Histograms have different bin limits - trying to use TH1::Merge");
898 Warning(
name,
"Histograms have different bin limits");
899 }
else if (inconsistency & kDifferentLabels) {
902 Info(
name,
"Histograms have different labels - trying to use TH1::Merge");
904 Info(
name,
"Histograms have different labels");
907 return inconsistency;
947 Error(
"Add",
"Attempt to add a non-existing histogram");
954 bool useMerge =
false;
958 if(inconsistency >= kDifferentNumberOfBins && !considerMerge) {
962 if(inconsistency > kFullyConsistent) {
963 useMerge = considerMerge;
968 l.Add(
const_cast<TH1*
>(
h1));
1011 if (e1sq) w1 = 1. / e1sq;
1016 double sf = (s2[0] != 0) ? s2[1]/s2[0] : 1;
1020 if (e2sq) w2 = 1. / e2sq;
1025 double sf = (
s1[0] != 0) ?
s1[1]/
s1[0] : 1;
1030 double y = (w1*
y1 + w2*
y2)/(w1 + w2);
1033 double err2 = 1./(w1 + w2);
1034 if (err2 < 1.E-200) err2 = 0;
1050 if (i == 1)
s1[i] +=
c1*
c1*s2[i];
1051 else s1[i] +=
c1*s2[i];
1098 Error(
"Add",
"Attempt to add a non-existing histogram");
1106 if (
h1 == h2 &&
c2 < 0) {
c2 = 0; normWidth =
kTRUE;}
1109 bool useMerge =
false;
1118 if(inconsistency >= kDifferentNumberOfBins && !considerMerge) {
1122 if(inconsistency > kFullyConsistent) {
1123 useMerge = considerMerge;
1129 l.Add(
const_cast<TH1*
>(
h1));
1130 l.Add(
const_cast<TH1*
>(h2));
1152 Bool_t resetStats = (
c1*
c2 < 0) || normWidth;
1159 if (i == 1) s3[i] =
c1*
c1*
s1[i] +
c2*
c2*s2[i];
1161 else s3[i] =
c1*
s1[i] +
c2*s2[i];
1177 Int_t bin, binx, biny, binz;
1178 for (binz = 0; binz < nbinsz; ++binz) {
1180 for (biny = 0; biny < nbinsy; ++biny) {
1182 for (binx = 0; binx < nbinsx; ++binx) {
1184 bin =
GetBin(binx, biny, binz);
1205 if (e1sq) w1 = 1./ e1sq;
1209 double sf = (
s1[0] != 0) ?
s1[1]/
s1[0] : 1;
1213 if (e2sq) w2 = 1./ e2sq;
1217 double sf = (s2[0] != 0) ? s2[1]/s2[0] : 1;
1222 double y = (w1*
y1 + w2*
y2)/(w1 + w2);
1225 double err2 = 1./(w1 + w2);
1226 if (err2 < 1.E-200) err2 = 0;
1300 return ((next &&
x > 0.) || (!next &&
x <= 0.)) ? std::ldexp(std::copysign(1., f2), nn)
1301 : std::ldexp(std::copysign(1., f2), --nn);
1314 return (
Int_t)std::ldexp(1., nn);
1354 Double_t rr = (xhma - xhmi) / (xma - xmi);
1364 Int_t nbup = (xhma - xma) / bw;
1367 if (nbup != nbside) {
1369 xhma -= bw * (nbup - nbside);
1370 nb -= (nbup - nbside);
1374 Int_t nblw = (xmi - xhmi) / bw;
1377 if (nblw != nbside) {
1379 xhmi += bw * (nblw - nbside);
1380 nb -= (nblw - nbside);
1410 if (nbentries == 0) {
1420 if (nbentries < 0 && action == 0)
return 0;
1423 if (nbentries < 0) {
1424 nbentries = -nbentries;
1436 for (
Int_t i=0;i<nbentries;i++) {
1439 if (!std::isfinite(
x))
continue;
1448 "inconsistency found by power-of-2 autobin algorithm: fallback to standard method");
1466 DoFillN(nbentries,&buffer[2],&buffer[1],2);
1500 if (nbentries < 0) {
1503 nbentries = -nbentries;
1535 if ( h2Array->
fN != fN ) {
1539 for (
int i = 0; i < fN; ++i ) {
1570 for (
int i = 1; i <= a1->
GetNbins(); ++i) {
1573 if (label1 != label2) {
1602 ::Info(
"CheckEqualAxes",
"Axes have different number of bins : nbin1 = %d nbin2 = %d",a1->
GetNbins(),a2->
GetNbins() );
1606 ::Info(
"CheckEqualAxes",
"Axes have different limits");
1610 ::Info(
"CheckEqualAxes",
"Axes have different bin limits");
1616 ::Info(
"CheckEqualAxes",
"Axes have different labels");
1631 Int_t nbins1 = lastBin1-firstBin1 + 1;
1639 if (firstBin2 < lastBin2) {
1641 nbins2 = lastBin1-firstBin1 + 1;
1646 if (nbins1 != nbins2 ) {
1647 ::Info(
"CheckConsistentSubAxes",
"Axes have different number of bins");
1655 ::Info(
"CheckConsistentSubAxes",
"Axes have different limits");
1667 if (
h1 == h2)
return kFullyConsistent;
1670 return kDifferentDimensions;
1681 (dim > 1 && nbinsy != h2->
GetNbinsY()) ||
1682 (dim > 2 && nbinsz != h2->
GetNbinsZ()) ) {
1683 return kDifferentNumberOfBins;
1692 if (!ret)
return kDifferentAxisLimits;
1698 if (!ret)
return kDifferentBinLimits;
1705 if (!ret)
return kDifferentLabels;
1708 return kFullyConsistent;
2000 Int_t ndf = 0, igood = 0;
2008 printf(
"Chi2 = %f, Prob = %g, NDF = %d, igood = %d\n", chi2,prob,ndf,igood);
2011 if (ndf == 0)
return 0;
2059 Int_t i_start, i_end;
2060 Int_t j_start, j_end;
2061 Int_t k_start, k_end;
2090 Error(
"Chi2TestX",
"Histograms have different dimensions.");
2095 if (nbinx1 != nbinx2) {
2096 Error(
"Chi2TestX",
"different number of x channels");
2098 if (nbiny1 != nbiny2) {
2099 Error(
"Chi2TestX",
"different number of y channels");
2101 if (nbinz1 != nbinz2) {
2102 Error(
"Chi2TestX",
"different number of z channels");
2106 i_start = j_start = k_start = 1;
2137 ndf = (i_end - i_start + 1) * (j_end - j_start + 1) * (k_end - k_start + 1) - 1;
2144 if (scaledHistogram && !comparisonUU) {
2145 Info(
"Chi2TestX",
"NORM option should be used together with UU option. It is ignored");
2152 Double_t effEntries1 = (s[1] ? s[0] * s[0] / s[1] : 0.0);
2156 Double_t effEntries2 = (s[1] ? s[0] * s[0] / s[1] : 0.0);
2158 if (!comparisonUU && !comparisonUW && !comparisonWW ) {
2160 if (
TMath::Abs(sumBinContent1 - effEntries1) < 1) {
2161 if (
TMath::Abs(sumBinContent2 - effEntries2) < 1) comparisonUU =
true;
2162 else comparisonUW =
true;
2164 else comparisonWW =
true;
2168 if (
TMath::Abs(sumBinContent1 - effEntries1) >= 1) {
2169 Warning(
"Chi2TestX",
"First histogram is not unweighted and option UW has been requested");
2172 if ( (!scaledHistogram && comparisonUU) ) {
2173 if ( (
TMath::Abs(sumBinContent1 - effEntries1) >= 1) || (
TMath::Abs(sumBinContent2 - effEntries2) >= 1) ) {
2174 Warning(
"Chi2TestX",
"Both histograms are not unweighted and option UU has been requested");
2180 if (comparisonUU && scaledHistogram) {
2181 for (
Int_t i = i_start; i <= i_end; ++i) {
2182 for (
Int_t j = j_start; j <= j_end; ++j) {
2183 for (
Int_t k = k_start; k <= k_end; ++k) {
2192 if (e1sq > 0.0) cnt1 =
TMath::Floor(cnt1 * cnt1 / e1sq + 0.5);
2195 if (e2sq > 0.0) cnt2 =
TMath::Floor(cnt2 * cnt2 / e2sq + 0.5);
2206 if (sumw1 <= 0.0 || sumw2 <= 0.0) {
2207 Error(
"Chi2TestX",
"Cannot use option NORM when one histogram has all zero errors");
2212 for (
Int_t i = i_start; i <= i_end; ++i) {
2213 for (
Int_t j = j_start; j <= j_end; ++j) {
2214 for (
Int_t k = k_start; k <= k_end; ++k) {
2228 if (sum1 == 0.0 || sum2 == 0.0) {
2229 Error(
"Chi2TestX",
"one histogram is empty");
2233 if ( comparisonWW && ( sumw1 <= 0.0 && sumw2 <= 0.0 ) ){
2234 Error(
"Chi2TestX",
"Hist1 and Hist2 have both all zero errors\n");
2244 for (
Int_t i = i_start; i <= i_end; ++i) {
2245 for (
Int_t j = j_start; j <= j_end; ++j) {
2246 for (
Int_t k = k_start; k <= k_end; ++k) {
2253 if (scaledHistogram) {
2258 if (e1sq > 0) cnt1 =
TMath::Floor(cnt1 * cnt1 / e1sq + 0.5);
2261 if (e2sq > 0) cnt2 =
TMath::Floor(cnt2 * cnt2 / e2sq + 0.5);
2265 if (
Int_t(cnt1) == 0 &&
Int_t(cnt2) == 0) --ndf;
2272 if (res) res[i - i_start] = (cnt1 - nexp1) /
TMath::Sqrt(nexp1);
2281 Double_t delta = sum2 * cnt1 - sum1 * cnt2;
2282 chi2 += delta * delta / cntsum;
2287 chi2 /= sum1 * sum2;
2292 Info(
"Chi2TestX",
"There is a bin in h1 with less than 1 event.\n");
2296 Info(
"Chi2TestX",
"There is a bin in h2 with less than 1 event.\n");
2307 if ( comparisonUW ) {
2308 for (
Int_t i = i_start; i <= i_end; ++i) {
2309 for (
Int_t j = j_start; j <= j_end; ++j) {
2310 for (
Int_t k = k_start; k <= k_end; ++k) {
2319 if (cnt1 * cnt1 == 0 && cnt2 * cnt2 == 0) {
2325 if (cnt2 * cnt2 == 0 && e2sq == 0) {
2329 e2sq = sumw2 / sum2;
2334 Error(
"Chi2TestX",
"Hist2 has in bin (%d,%d,%d) zero content and zero errors\n", i, j, k);
2340 if (e2sq > 0 && cnt2 * cnt2 / e2sq < 10)
n++;
2342 Double_t var1 = sum2 * cnt2 - sum1 * e2sq;
2343 Double_t var2 = var1 * var1 + 4. * sum2 * sum2 * cnt1 * e2sq;
2348 while (var1 * var1 + cnt1 == 0 || var1 + var2 == 0) {
2351 var1 = sum2 * cnt2 - sum1 * e2sq;
2352 var2 = var1 * var1 + 4. * sum2 * sum2 * cnt1 * e2sq;
2356 while (var1 + var2 == 0) {
2359 var1 = sum2 * cnt2 - sum1 * e2sq;
2360 var2 = var1 * var1 + 4. * sum2 * sum2 * cnt1 * e2sq;
2361 while (var1 * var1 + cnt1 == 0 || var1 + var2 == 0) {
2364 var1 = sum2 * cnt2 - sum1 * e2sq;
2365 var2 = var1 * var1 + 4. * sum2 * sum2 * cnt1 * e2sq;
2370 Double_t probb = (var1 + var2) / (2. * sum2 * sum2);
2378 chi2 += delta1 * delta1 / nexp1;
2381 chi2 += delta2 * delta2 / e2sq;
2386 Double_t temp1 = sum2 * e2sq / var2;
2387 Double_t temp2 = 1.0 + (sum1 * e2sq - sum2 * cnt2) / var2;
2388 temp2 = temp1 * temp1 * sum1 * probb * (1.0 - probb) + temp2 * temp2 * e2sq / 4.0;
2401 Info(
"Chi2TestX",
"There is a bin in h1 with less than 1 event.\n");
2405 Info(
"Chi2TestX",
"There is a bin in h2 with less than 10 effective events.\n");
2415 for (
Int_t i = i_start; i <= i_end; ++i) {
2416 for (
Int_t j = j_start; j <= j_end; ++j) {
2417 for (
Int_t k = k_start; k <= k_end; ++k) {
2427 if (cnt1 * cnt1 == 0 && cnt2 * cnt2 == 0) {
2432 if (e1sq == 0 && e2sq == 0) {
2434 Error(
"Chi2TestX",
"h1 and h2 both have bin %d,%d,%d with all zero errors\n", i,j,k);
2439 Double_t delta = sum2 * cnt1 - sum1 * cnt2;
2440 chi2 += delta * delta /
sigma;
2443 Double_t temp = cnt1 * sum1 * e2sq + cnt2 * sum2 * e1sq;
2456 res[i - i_start] = z;
2459 if (e1sq > 0 && cnt1 * cnt1 / e1sq < 10)
m++;
2460 if (e2sq > 0 && cnt2 * cnt2 / e2sq < 10)
n++;
2466 Info(
"Chi2TestX",
"There is a bin in h1 with less than 10 effective events.\n");
2470 Info(
"Chi2TestX",
"There is a bin in h2 with less than 10 effective events.\n");
2488 Error(
"Chisquare",
"Function pointer is Null - return -1");
2536 Int_t nbins = nbinsx * nbinsy * nbinsz;
2541 for (
Int_t binz=1; binz <= nbinsz; ++binz) {
2542 for (
Int_t biny=1; biny <= nbinsy; ++biny) {
2543 for (
Int_t binx=1; binx <= nbinsx; ++binx) {
2546 if (onlyPositive &&
y < 0) {
2547 Error(
"ComputeIntegral",
"Bin content is negative - return a NaN value");
2558 Error(
"ComputeIntegral",
"Integral = zero");
return 0;
2613 hintegrated->
Reset();
2617 for (
Int_t binz = firstZ; binz <= lastZ; ++binz) {
2618 for (
Int_t biny = firstY; biny <= lastY; ++biny) {
2619 for (
Int_t binx = firstX; binx <= lastX; ++binx) {
2620 const Int_t bin = hintegrated->
GetBin(binx, biny, binz);
2631 for (
Int_t binz = lastZ; binz >= firstZ; --binz) {
2632 for (
Int_t biny = lastY; biny >= firstY; --biny) {
2633 for (
Int_t binx = lastX; binx >= firstX; --binx) {
2634 const Int_t bin = hintegrated->
GetBin(binx, biny, binz);
2665 ((
TH1&)obj).fDirectory =
nullptr;
2679 delete [] ((
TH1&)obj).fBuffer;
2680 ((
TH1&)obj).fBuffer =
nullptr;
2686 ((
TH1&)obj).fBuffer = buf;
2712 ((
TH1&)obj).fXaxis.SetParent(&obj);
2713 ((
TH1&)obj).fYaxis.SetParent(&obj);
2714 ((
TH1&)obj).fZaxis.SetParent(&obj);
2724 ((
TH1&)obj).fFunctions->UseRWLock();
2752 oldparent = oldstats->GetParent();
2753 oldstats->SetParent(
nullptr);
2759 oldstats->SetParent(oldparent);
2771 if(newname && strlen(newname) ) {
2826 Error(
"Divide",
"Attempt to divide by a non-existing function");
2844 Int_t bin, binx, biny, binz;
2849 for (binz = 0; binz < nz; ++binz) {
2851 for (biny = 0; biny < ny; ++biny) {
2853 for (binx = 0; binx < nx; ++binx) {
2857 bin = binx + nx * (biny + ny * binz);
2894 Error(
"Divide",
"Input histogram passed does not exist (NULL).");
2957 Error(
"Divide",
"At least one of the input histograms passed does not exist (NULL).");
2970 Error(
"Divide",
"Coefficient of dividing histogram cannot be zero");
3007 fSumw2.
fArray[i] = c1sq * c2sq * (e1sq * b2sq + e2sq * b1sq) / (c2sq * c2sq * b2sq * b2sq);
3066 if (!
gPad->IsEditable())
gROOT->MakeDefCanvas();
3068 if (
gPad->GetX1() == 0 &&
gPad->GetX2() == 1 &&
3069 gPad->GetY1() == 0 &&
gPad->GetY2() == 1 &&
3077 gPad->IncrementPaletteColor(1, opt1);
3102 if (name_postfix) newName.
Form(
"%s%s",
GetName(), name_postfix);
3106 if (
gPad)
gPad->IncrementPaletteColor(1, opt);
3131 Error(
"DrawNormalized",
"Sum of weights is null. Cannot normalize histogram: %s",
GetName());
3143 if (opt.
IsNull() || opt ==
"SAME") opt +=
"HIST";
3178 Int_t range, stat, add;
3198 for (
Int_t binz = 1; binz <= nbinsz; ++binz) {
3200 for (
Int_t biny = 1; biny <= nbinsy; ++biny) {
3202 for (
Int_t binx = 1; binx <= nbinsx; ++binx) {
3300 if (!fft)
return nullptr;
3302 for (
Int_t binx = 1; binx<=ndim[0]; binx++) {
3303 for (
Int_t biny=1; biny<=ndim[1]; biny++) {
3304 for (
Int_t binz=1; binz<=ndim[2]; binz++) {
3334 if (bin <0)
return -1;
3367 if (bin <0)
return -1;
3400 if (bin <0)
return -1;
3436 for (i=0;i<ntimes;i+=stride) {
3443 auto weights =
w ? &
w[i] :
nullptr;
3444 DoFillN((ntimes-i)/stride,&
x[i],weights,stride);
3464 for (i=0;i<ntimes;i+=stride) {
3466 if (bin <0)
continue;
3471 if (bin == 0 || bin > nbins) {
3504 Int_t bin, binx, ibin, loop;
3508 if (!
f1) {
Error(
"FillRandom",
"Unknown function: %s",fname);
return; }
3518 Info(
"FillRandom",
"Using function axis and range [%g,%g]",
xmin,
xmax);
3528 for (binx=1;binx<=nbinsx;binx++) {
3530 integral[binx] = integral[binx-1] + fint;
3534 if (integral[nbinsx] == 0 ) {
3536 Error(
"FillRandom",
"Integral = zero");
return;
3538 for (bin=1;bin<=nbinsx;bin++) integral[bin] /= integral[nbinsx];
3541 for (loop=0;loop<ntimes;loop++) {
3547 +xAxis->
GetBinWidth(ibin+
first)*(r1-integral[ibin])/(integral[ibin+1] - integral[ibin]);
3575 if (!
h) {
Error(
"FillRandom",
"Null histogram");
return; }
3577 Error(
"FillRandom",
"Histograms with different dimensions");
return;
3579 if (std::isnan(
h->ComputeIntegral(
true))) {
3580 Error(
"FillRandom",
"Histograms contains negative bins, does not represent probabilities");
3589 if (ntimes > 10*nbins) {
3591 if (inconsistency != kFullyConsistent)
return;
3593 if (sumw == 0)
return;
3596 Double_t mean =
h->RetrieveBinContent(bin)*ntimes/sumw;
3607 if (sumgen < ntimes) {
3609 for (i =
Int_t(sumgen+0.5); i < ntimes; ++i)
3615 else if (sumgen > ntimes) {
3617 i =
Int_t(sumgen+0.5);
3618 while( i > ntimes) {
3635 if (
h->ComputeIntegral() ==0)
return;
3638 for (loop=0;loop<ntimes;loop++) {
3664 return binx + nx*biny;
3672 return binx + nx*(biny +ny*binz);
3697 return binx + nx*biny;
3705 return binx + nx*(biny +ny*binz);
3723 Warning(
"FindFirstBinAbove",
"Invalid axis number : %d, axis x assumed\n",axis);
3737 for (
Int_t binx = firstBin; binx <= lastBin; binx++) {
3738 for (
Int_t biny = 1; biny <= nbinsy; biny++) {
3739 for (
Int_t binz = 1; binz <= nbinsz; binz++) {
3745 else if (axis == 2) {
3749 for (
Int_t biny = firstBin; biny <= lastBin; biny++) {
3750 for (
Int_t binx = 1; binx <= nbinsx; binx++) {
3751 for (
Int_t binz = 1; binz <= nbinsz; binz++) {
3757 else if (axis == 3) {
3761 for (
Int_t binz = firstBin; binz <= lastBin; binz++) {
3762 for (
Int_t binx = 1; binx <= nbinsx; binx++) {
3763 for (
Int_t biny = 1; biny <= nbinsy; biny++) {
3787 Warning(
"FindFirstBinAbove",
"Invalid axis number : %d, axis x assumed\n",axis);
3801 for (
Int_t binx = lastBin; binx >= firstBin; binx--) {
3802 for (
Int_t biny = 1; biny <= nbinsy; biny++) {
3803 for (
Int_t binz = 1; binz <= nbinsz; binz++) {
3809 else if (axis == 2) {
3813 for (
Int_t biny = lastBin; biny >= firstBin; biny--) {
3814 for (
Int_t binx = 1; binx <= nbinsx; binx++) {
3815 for (
Int_t binz = 1; binz <= nbinsz; binz++) {
3821 else if (axis == 3) {
3825 for (
Int_t binz = lastBin; binz >= firstBin; binz--) {
3826 for (
Int_t binx = 1; binx <= nbinsx; binx++) {
3827 for (
Int_t biny = 1; biny <= nbinsy; biny++) {
3884 linear= (
char*)strstr(fname,
"++");
3888 TF1 f1(fname, fname, xxmin, xxmax);
3892 TF2 f2(fname, fname);
3893 return Fit(&f2,
option,goption,xxmin,xxmax);
3896 TF3 f3(fname, fname);
3897 return Fit(&f3,
option,goption,xxmin,xxmax);
3902 if (!
f1) {
Printf(
"Unknown function: %s",fname);
return -1; }
4270 gROOT->MakeDefCanvas();
4273 Error(
"FitPanel",
"Unable to create a default canvas");
4280 if (handler && handler->
LoadPlugin() != -1) {
4282 Error(
"FitPanel",
"Unable to create the FitPanel");
4285 Error(
"FitPanel",
"Unable to find the FitPanel plug-in");
4342 asym->
Divide(top,bottom);
4356 for(
Int_t k=1; k<= zmax; k++){
4435 return (s[1] ? s[0]*s[0]/s[1] :
TMath::Abs(s[0]) );
4447 Info(
"SetHighlight",
"Supported only 1-D or 2-D histograms");
4464 return ((
TH1*)
this)->GetPainter()->GetObjectInfo(px,py);
4565 Error(
"GetQuantiles",
"Only available for 1-d histograms");
4575 Int_t nq = nprobSum;
4576 if (probSum ==
nullptr) {
4580 for (i=1;i<nq;i++) {
4585 for (i = 0; i < nq; i++) {
4587 while (ibin < nbins-1 &&
fIntegral[ibin+1] == prob[i]) {
4588 if (
fIntegral[ibin+2] == prob[i]) ibin++;
4596 if (!probSum)
delete [] prob;
4614 Double_t allcha, sumx, sumx2,
x, val, stddev, mean;
4625 allcha = sumx = sumx2 = 0;
4626 for (bin=hxfirst;bin<=hxlast;bin++) {
4629 if (val > valmax) valmax = val;
4634 if (allcha == 0)
return;
4636 stddev = sumx2/allcha - mean*mean;
4639 if (stddev == 0) stddev = binwidx*(hxlast-hxfirst+1)/4;
4646 Double_t constant = 0.5*(valmax+binwidx*allcha/(sqrtpi*stddev));
4654 if ((mean < xmin || mean >
xmax) && stddev > (
xmax-
xmin)) {
4675 Int_t nchanx = hxlast - hxfirst + 1;
4696 Int_t nchanx = hxlast - hxfirst + 1;
4699 if (nchanx <=1 || npar == 1) {
4722 const Int_t idim = 20;
4733 if (
m > idim ||
m >
n)
return;
4736 for (
l = 2;
l <=
m; ++
l) {
4738 b[
m +
l*20 - 21] = zero;
4745 for (k = hxfirst; k <= hxlast; ++k) {
4750 for (
l = 2;
l <=
m; ++
l) {
4753 da[
l-1] += power*yk;
4755 for (
l = 2;
l <=
m; ++
l) {
4757 b[
m +
l*20 - 21] += power;
4760 for (i = 3; i <=
m; ++i) {
4761 for (k = i; k <=
m; ++k) {
4762 b[k - 1 + (i-1)*20 - 21] =
b[k + (i-2)*20 - 21];
4767 for (i=0; i<
m; ++i)
a[i] = da[i];
4787 xbar = ybar = x2bar = xybar = 0;
4792 for (i = hxfirst; i <= hxlast; ++i) {
4796 if (yk <= 0) yk = 1
e-9;
4805 det = fn*x2bar - xbar*xbar;
4813 a0 = (x2bar*ybar - xbar*xybar) / det;
4814 a1 = (fn*xybar - xbar*ybar) / det;
4825 Int_t a_dim1, a_offset, b_dim1, b_offset;
4827 Int_t im1, jp1, nm1, nmi;
4833 b_offset = b_dim1 + 1;
4836 a_offset = a_dim1 + 1;
4839 if (idim <
n)
return;
4842 for (j = 1; j <=
n; ++j) {
4843 if (
a[j + j*a_dim1] <= 0) { ifail = -1;
return; }
4844 a[j + j*a_dim1] = one /
a[j + j*a_dim1];
4845 if (j ==
n)
continue;
4847 for (
l = jp1;
l <=
n; ++
l) {
4848 a[j +
l*a_dim1] =
a[j + j*a_dim1] *
a[
l + j*a_dim1];
4849 s1 = -
a[
l + (j+1)*a_dim1];
4850 for (i = 1; i <= j; ++i) {
s1 =
a[
l + i*a_dim1] *
a[i + (j+1)*a_dim1] +
s1; }
4851 a[
l + (j+1)*a_dim1] = -
s1;
4856 for (
l = 1;
l <= k; ++
l) {
4857 b[
l*b_dim1 + 1] =
a[a_dim1 + 1]*
b[
l*b_dim1 + 1];
4860 for (
l = 1;
l <= k; ++
l) {
4861 for (i = 2; i <=
n; ++i) {
4863 s21 = -
b[i +
l*b_dim1];
4864 for (j = 1; j <= im1; ++j) {
4865 s21 =
a[i + j*a_dim1]*
b[j +
l*b_dim1] + s21;
4867 b[i +
l*b_dim1] = -
a[i + i*a_dim1]*s21;
4870 for (i = 1; i <= nm1; ++i) {
4872 s22 = -
b[nmi +
l*b_dim1];
4873 for (j = 1; j <= i; ++j) {
4875 s22 =
a[nmi + nmjp1*a_dim1]*
b[nmjp1 +
l*b_dim1] + s22;
4877 b[nmi +
l*b_dim1] = -s22;
4915 if (binx < 0) binx = 0;
4916 if (binx > ofx) binx = ofx;
4931 binx = binglobal%nx;
4937 binx = binglobal%nx;
4938 biny = ((binglobal-binx)/nx)%ny;
4943 binx = binglobal%nx;
4944 biny = ((binglobal-binx)/nx)%ny;
4945 binz = ((binglobal-binx)/nx -biny)/ny;
4964 Error(
"GetRandom",
"Function only valid for 1-d histograms");
4974 integral = ((
TH1*)
this)->ComputeIntegral(
true);
4976 if (integral == 0)
return 0;
5015 if (bin < 0) bin = 0;
5041 Error(
"GetBinWithContent",
"function is only valid for 1-D histograms");
5047 if (firstx <= 0) firstx = 1;
5051 for (
Int_t i=firstx;i<=lastx;i++) {
5053 if (diff <= 0) {binx = i;
return diff;}
5054 if (diff < curmax && diff <= maxdiff) {curmax = diff, binminx=i;}
5089 return y0 + (
x-x0)*((
y1-y0)/(
x1-x0));
5098 Error(
"Interpolate",
"This function must be called with 1 argument for a TH1");
5107 Error(
"Interpolate",
"This function must be called with 1 argument for a TH1");
5135 Int_t binx, biny, binz;
5157 Error(
"IsBinOverflow",
"Invalid axis value");