29 TMom::TMom(
const std::vector<double>& cutlow,
const std::vector<double>& cuthigh)
57 _cutLow.push_back(cutlow);
58 _cutHigh.push_back(cuthigh);
59 for(
int i=0;
i<101;
i++){
64 void TMom::init(
const std::vector<double>& cutlow,
const std::vector<double>& cuthigh)
79 assert(cutlow.size()==cuthigh.size());
82 _dimCut=cutlow.size();
85 for(
int i=0;
i<101;
i++){
95 _cutLow.push_back(cutlow);
96 _cutHigh.push_back(cuthigh);
99 void TMom::setCut(
const std::vector<double>& cutlow ,
const std::vector<double>& cuthigh){
101 assert(cutlow.size( )== cuthigh.size());
104 _dimCut=cutlow.size();
112 std::vector<double> dumb;
120 int passingAllCuts=1;
122 for (
int iCut=0;iCut<_dimCut;iCut++){
124 if( valcut.at(iCut)>_cutLow.at(iCut) && valcut.at(iCut) <=_cutHigh.at(iCut) ){
130 if( passingAllCuts == 1 ){
140 _ampl.push_back(val);
168 double m2=getMean2();
169 if(
nevt!=0)
rms=TMath::Sqrt( m2 - m*m );
177 double m2=getMean2();
178 double m3=getMean3();
179 double sig = getRMS();
181 if(
nevt!=0 && sig!=0) M3=( m3 - 3.0*m*(m2-m*
m) - m*m*m )/(sig*sig*sig);
191 std::vector<double>
p;
192 double wbin=(
max-
min)/100.;
195 for(
unsigned int i=0;
i<_ampl.size();
i++){
199 bung= (
int) ((_ampl.at(
i)-
min)/wbin)+1;
200 if(1 <= bung && bung <= 100)
208 for(
int k=1;
k<101;
k++) {
209 if(bing[
k] > popmax) {
214 peakM -> peakFinder(&bing[0]);
215 p.push_back(peakM -> getPeakValue(0));
216 p.push_back(peakM -> getPeakValue(1));
void addEntry(double val)
void setCut(double, double)
void init(double, double)
def addEntry(schema, datatableName, entryinfo, branchinfo)
std::vector< double > getPeak()