#include <string>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include "TROOT.h"
#include "TFile.h"
#include "TF1.h"
#include "TH1D.h"
#include "TMath.h"
#include "JFit/JGandalf.hh"
#include "JTools/JElement.hh"
#include "JTools/JConstants.hh"
#include "JTools/JQuantile.hh"
#include "JROOT/JRootToolkit.hh"
#include "JMath/JGauss.hh"
#include "Jeep/JTimer.hh"
#include "Jeep/JPrint.hh"
#include "Jeep/JParser.hh"
#include "Jeep/JMessage.hh"
Go to the source code of this file.
|
int | main (int argc, char **argv) |
|
Program to test JFIT::JGandalf algorithm.
- Author
- mdejong
Definition in file JGandalfFitToGauss.cc.
◆ main()
int main |
( |
int |
argc, |
|
|
char ** |
argv |
|
) |
| |
Definition at line 72 of file JGandalfFitToGauss.cc.
85 JParser<> zap(
"Program to test JGandalf algorithm.");
95 catch(
const exception& error) {
96 FATAL(error.what() << endl);
101 ASSERT(numberOfEvents > 0);
105 TF1 fs(
"fs",
"exp(-0.5 * (x-[0])*(x-[0]) / ([1]*[1]))");
108 fs.FixParameter(0, gauss.
mean);
109 fs.FixParameter(1, gauss.
sigma);
112 const Double_t xmin = -5.0;
113 const Double_t xmax = +5.0;
120 TH1D
H[] = { TH1D(
"ha",
"", 101, -0.1, +0.1),
121 TH1D(
"hb",
"", 101, -0.1, +0.1),
122 TH1D(
"hc",
"", 101, -100.0, +100.0),
123 TH1D(
"hd",
"", 101, -100.0, +100.0) };
127 for (
int i = 0; i != numberOfEvents; ++i) {
129 STATUS(
"event: " << setw(10) << i <<
'\r');
DEBUG(endl);
131 TH1D h0(
"h0", NULL, nx, xmin, xmax);
135 h0.FillRandom(
"fs", (Int_t) gauss.
signal);
136 h0.FillRandom(
"fb", (Int_t) gauss.
background);
140 for (Int_t i = 1; i <= h0.GetNbinsX(); ++i) {
141 data.push_back(JElement_t(h0.GetBinCenter (i),
142 h0.GetBinContent(i)));
156 h0.GetEntries() * (xmax - xmin) / nx - h0.GetMinimum(),
163 const double chi2 = fit(
g1, data.begin(), data.end());
168 DEBUG(
"Chi2 " << chi2 << endl);
175 for (
int i = 0; i !=
sizeof(Q)/
sizeof(Q[0]); ++i) {
181 for (
int i = 0; i !=
sizeof(Q)/
sizeof(Q[0]); ++i) {
193 for (
int i = 0; i !=
sizeof(
H)/
sizeof(
H[0]); ++i) {
201 for (
int i = 0; i !=
sizeof(Q)/
sizeof(Q[0]); ++i) {