| 4 |
ClassImp(CaloLong); |
ClassImp(CaloLong); |
| 5 |
ClassImp(Calo2D); |
ClassImp(Calo2D); |
| 6 |
|
|
| 7 |
|
|
| 8 |
|
int isempty(struct stack *s){ |
| 9 |
|
return (s->top == EMPTY) ? 1 : 0; |
| 10 |
|
} |
| 11 |
|
|
| 12 |
|
void emptystack(struct stack* s){ |
| 13 |
|
s->top=EMPTY; |
| 14 |
|
strcpy(s->data," "); |
| 15 |
|
} |
| 16 |
|
|
| 17 |
|
void push(struct stack* s,int item){ |
| 18 |
|
if(s->top == (MAX-1)){ |
| 19 |
|
printf("\n ERROR! STACK FULL (too many digits in SetLower/UpperLimit)\n"); |
| 20 |
|
} else { |
| 21 |
|
s->data[++s->top]=(char)item; |
| 22 |
|
}; |
| 23 |
|
} |
| 24 |
|
|
| 25 |
|
char pop(struct stack* s){ |
| 26 |
|
char ret=(char)EMPTY; |
| 27 |
|
if(!isempty(s)){ |
| 28 |
|
ret= s->data[s->top--]; |
| 29 |
|
}; |
| 30 |
|
return ret; |
| 31 |
|
} |
| 32 |
|
|
| 33 |
|
|
| 34 |
|
int ipop(struct stack* s){ |
| 35 |
|
int ret=EMPTY; |
| 36 |
|
if(s->top == EMPTY) |
| 37 |
|
printf("\n ERROR! STACK EMPTY (too few digits in SetLower/UpperLimit)\n"); |
| 38 |
|
else { |
| 39 |
|
ret= s->data[s->top--]; |
| 40 |
|
}; |
| 41 |
|
return ret; |
| 42 |
|
} |
| 43 |
|
|
| 44 |
|
|
| 45 |
|
void display(struct stack s){ |
| 46 |
|
int ss = s.top; |
| 47 |
|
while(s.top != EMPTY){ |
| 48 |
|
printf("\n%d",s.data[s.top--]); |
| 49 |
|
}; |
| 50 |
|
printf(" s.top %i \n",ss); |
| 51 |
|
} |
| 52 |
|
|
| 53 |
|
int isoperator(char e){ |
| 54 |
|
if(e == '+' || e == '-' || e == '*' || e == '/' || e == '%') |
| 55 |
|
return 1; |
| 56 |
|
else |
| 57 |
|
return 0; |
| 58 |
|
} |
| 59 |
|
|
| 60 |
|
|
| 61 |
|
int priority(char e){ |
| 62 |
|
int pri = 0; |
| 63 |
|
if(e == '*' || e == '/' || e =='%') |
| 64 |
|
pri = 2; |
| 65 |
|
else { |
| 66 |
|
if(e == '+' || e == '-') pri = 1; |
| 67 |
|
}; |
| 68 |
|
return pri; |
| 69 |
|
} |
| 70 |
|
|
| 71 |
|
void infix2postfix(char* infix, char * postfix, int insertspace){ |
| 72 |
|
char *i,*p; |
| 73 |
|
struct stack X; |
| 74 |
|
char n1; |
| 75 |
|
emptystack(&X); |
| 76 |
|
i = &infix[0]; |
| 77 |
|
p = &postfix[0]; |
| 78 |
|
while(*i){ |
| 79 |
|
while(*i == ' ' || *i == '\t' ){ |
| 80 |
|
i++; |
| 81 |
|
}; |
| 82 |
|
TString c=i; |
| 83 |
|
if( isdigit(*i) || isalpha(*i) || c.BeginsWith(".") ){ |
| 84 |
|
while( isdigit(*i) || isalpha(*i) || c.BeginsWith(".") ){ |
| 85 |
|
*p = *i; |
| 86 |
|
p++; |
| 87 |
|
i++; |
| 88 |
|
c=i; |
| 89 |
|
}; |
| 90 |
|
/*SPACE CODE*/ |
| 91 |
|
if(insertspace){ |
| 92 |
|
*p = ' '; |
| 93 |
|
p++; |
| 94 |
|
}; |
| 95 |
|
/*END SPACE CODE*/ |
| 96 |
|
}; |
| 97 |
|
if( *i == '(' ){ |
| 98 |
|
push(&X,*i); |
| 99 |
|
i++; |
| 100 |
|
}; |
| 101 |
|
if( *i == ')'){ |
| 102 |
|
n1 = pop(&X); |
| 103 |
|
while( n1 != '(' ){ |
| 104 |
|
*p = n1; |
| 105 |
|
p++; |
| 106 |
|
/*SPACE CODE*/ |
| 107 |
|
if(insertspace){ |
| 108 |
|
*p = ' '; |
| 109 |
|
p++; |
| 110 |
|
}; |
| 111 |
|
/*END SPACE CODE*/ |
| 112 |
|
n1 = pop(&X); |
| 113 |
|
}; |
| 114 |
|
i++; |
| 115 |
|
}; |
| 116 |
|
if( isoperator(*i) ){ |
| 117 |
|
if(isempty(&X)){ |
| 118 |
|
push(&X,*i); |
| 119 |
|
} else { |
| 120 |
|
n1 = pop(&X); |
| 121 |
|
while( priority(n1) >= priority(*i) ){ |
| 122 |
|
*p = n1; |
| 123 |
|
p++; |
| 124 |
|
/*SPACE CODE*/ |
| 125 |
|
if(insertspace){ |
| 126 |
|
*p = ' '; |
| 127 |
|
p++; |
| 128 |
|
}; |
| 129 |
|
/*END SPACE CODE*/ |
| 130 |
|
n1 = pop(&X); |
| 131 |
|
}; |
| 132 |
|
push(&X,n1); |
| 133 |
|
push(&X,*i); |
| 134 |
|
}; |
| 135 |
|
i++; |
| 136 |
|
}; |
| 137 |
|
}; |
| 138 |
|
while(!isempty(&X)){ |
| 139 |
|
n1 = pop(&X); |
| 140 |
|
*p = n1; |
| 141 |
|
p++; |
| 142 |
|
/*SPACE CODE*/ |
| 143 |
|
if(insertspace){ |
| 144 |
|
*p = ' '; |
| 145 |
|
p++; |
| 146 |
|
}; |
| 147 |
|
/*END SPACE CODE*/ |
| 148 |
|
}; |
| 149 |
|
*p = '\0'; |
| 150 |
|
} |
| 151 |
|
|
| 152 |
|
|
| 153 |
|
Float_t evaluate(char *postfix){ |
| 154 |
|
// |
| 155 |
|
Float_t op1 = 0.; |
| 156 |
|
Float_t op2 = 0.; |
| 157 |
|
Float_t result = 0.; |
| 158 |
|
// |
| 159 |
|
TString e = postfix; |
| 160 |
|
Float_t st[50]; |
| 161 |
|
memset(st,0,50*sizeof(Float_t)); |
| 162 |
|
TObjArray *ae = e.Tokenize(" "); |
| 163 |
|
Int_t o = 0; |
| 164 |
|
Int_t a = 0; |
| 165 |
|
Int_t ap = 0; |
| 166 |
|
// |
| 167 |
|
while ( o < ae->GetEntries() ){ |
| 168 |
|
if ( ((TString)(((TObjString*)ae->At(o))->GetString())).IsFloat() ){ |
| 169 |
|
st[a] = (Float_t)((TString)(((TObjString*)ae->At(o))->GetString())).Atof();; |
| 170 |
|
a++; |
| 171 |
|
} else { |
| 172 |
|
ap = a-1; |
| 173 |
|
op1 = st[ap--]; |
| 174 |
|
op2 = st[ap]; |
| 175 |
|
const char *p=((TString)(((TObjString*)ae->At(o))->GetString())).Data(); |
| 176 |
|
switch(*p){ |
| 177 |
|
case '+': |
| 178 |
|
result = op2 + op1; |
| 179 |
|
break; |
| 180 |
|
case '-': |
| 181 |
|
result = op2 - op1; |
| 182 |
|
break; |
| 183 |
|
case '/': |
| 184 |
|
result = op2 / op1; |
| 185 |
|
break; |
| 186 |
|
case '*': |
| 187 |
|
result = op2 * op1; |
| 188 |
|
break; |
| 189 |
|
case '%': |
| 190 |
|
result = (Int_t)round(op2) % (Int_t)round(op1); |
| 191 |
|
break; |
| 192 |
|
default: |
| 193 |
|
printf("\nInvalid Operator: %s \n",((TString)(((TObjString*)ae->At(o))->GetString())).Data()); |
| 194 |
|
return 0; |
| 195 |
|
}; |
| 196 |
|
st[ap] = result; |
| 197 |
|
a = ap+1; |
| 198 |
|
// |
| 199 |
|
}; |
| 200 |
|
o++; |
| 201 |
|
}; |
| 202 |
|
return result; |
| 203 |
|
// |
| 204 |
|
} |
| 205 |
|
|
| 206 |
|
|
| 207 |
|
|
| 208 |
//////////////////////////////////////////////////////////////////////// |
//////////////////////////////////////////////////////////////////////// |
| 209 |
/** |
/** |
| 210 |
* 1-dimension function describing lateral distribution of the |
* 1-dimension function describing lateral distribution of the |
| 652 |
PKT = 0; |
PKT = 0; |
| 653 |
atime = 0; |
atime = 0; |
| 654 |
// |
// |
| 655 |
|
clp = L2->GetCaloLevel2(); |
| 656 |
|
// |
| 657 |
sel = true; |
sel = true; |
| 658 |
cont = false; |
cont = false; |
| 659 |
N = 0; |
N = 0; |
| 667 |
maskYE = false; |
maskYE = false; |
| 668 |
maskYO = false; |
maskYO = false; |
| 669 |
// |
// |
| 670 |
|
lmax = 0.; |
| 671 |
|
umax = 100.; |
| 672 |
|
slmax = ""; |
| 673 |
|
sumax = ""; |
| 674 |
|
// |
| 675 |
}; |
}; |
| 676 |
|
|
| 677 |
void CaloLong::MaskSection(TString sec){ |
void CaloLong::MaskSection(TString sec){ |
| 682 |
if ( sec.Contains("YE") ) maskYE = true; |
if ( sec.Contains("YE") ) maskYE = true; |
| 683 |
} |
} |
| 684 |
|
|
| 685 |
|
void CaloLong::UnMaskSections(){ |
| 686 |
|
this->UnMaskSection("XEXOYEYO"); |
| 687 |
|
} |
| 688 |
|
|
| 689 |
|
void CaloLong::UnMaskSection(TString sec){ |
| 690 |
|
sec.ToUpper(); |
| 691 |
|
if ( sec.Contains("XO") ) maskXO = false; |
| 692 |
|
if ( sec.Contains("YO") ) maskYO = false; |
| 693 |
|
if ( sec.Contains("XE") ) maskXE = false; |
| 694 |
|
if ( sec.Contains("YE") ) maskYE = false; |
| 695 |
|
} |
| 696 |
|
|
| 697 |
void CaloLong::Clear(){ |
void CaloLong::Clear(){ |
| 698 |
// |
// |
| 699 |
memset(eplane,0, 2*22*sizeof(Float_t)); |
memset(eplane,0, 2*22*sizeof(Float_t)); |
| 701 |
chi2 = 0.; |
chi2 = 0.; |
| 702 |
ndf = 0.; |
ndf = 0.; |
| 703 |
E0 = 0.; |
E0 = 0.; |
| 704 |
|
defE0 = 0.; |
| 705 |
a = 0.; |
a = 0.; |
| 706 |
b = 0.; |
b = 0.; |
| 707 |
errE0 = 0.; |
errE0 = 0.; |
| 727 |
printf(" nchi2 :.. %f\n",chi2/ndf); |
printf(" nchi2 :.. %f\n",chi2/ndf); |
| 728 |
printf(" E0 :.. %f\n",E0); |
printf(" E0 :.. %f\n",E0); |
| 729 |
printf(" E0/260. :.. %f\n",E0/260.); |
printf(" E0/260. :.. %f\n",E0/260.); |
| 730 |
|
printf(" defE0 :.. %f\n",defE0); |
| 731 |
|
printf(" lower :.. %f\n",lmax); |
| 732 |
|
printf(" upper :.. %f\n",umax); |
| 733 |
|
printf(" s lower :.. %s\n",slmax.Data()); |
| 734 |
|
printf(" s upper :.. %s\n",sumax.Data()); |
| 735 |
printf(" a :.. %f\n",a); |
printf(" a :.. %f\n",a); |
| 736 |
printf(" b :.. %f\n",b); |
printf(" b :.. %f\n",b); |
| 737 |
printf(" errE0 :.. %f\n",errE0); |
printf(" errE0 :.. %f\n",errE0); |
| 850 |
// |
// |
| 851 |
Float_t ytgx = 0; |
Float_t ytgx = 0; |
| 852 |
Float_t ytgy = 0; |
Float_t ytgy = 0; |
| 853 |
ytgx = 0.76 * L2->GetCaloLevel2()->tanx[0]; |
ytgx = 0.76 * clp->tanx[0]; |
| 854 |
ytgy = 0.76 * L2->GetCaloLevel2()->tany[0]; |
ytgy = 0.76 * clp->tany[0]; |
| 855 |
X0pl = sqrt( pow(0.76,2.) + pow(ytgx,2.) + pow(ytgy,2.) ); |
X0pl = sqrt( pow(0.76,2.) + pow(ytgx,2.) + pow(ytgy,2.) ); |
| 856 |
// |
// |
| 857 |
// Find experimental plane of maximum |
// Find experimental plane of maximum |
| 879 |
// |
// |
| 880 |
}; |
}; |
| 881 |
|
|
| 882 |
|
void CaloLong::SetEnergies(Float_t myene[][22]){ |
| 883 |
|
// |
| 884 |
|
if ( !L2 ){ |
| 885 |
|
printf(" ERROR: cannot find PamLevel2 object, use the correct constructor or check your program!\n"); |
| 886 |
|
printf(" ERROR: CaloHough variables not filled \n"); |
| 887 |
|
return; |
| 888 |
|
}; |
| 889 |
|
// |
| 890 |
|
Bool_t newentry = false; |
| 891 |
|
// |
| 892 |
|
if ( L2->IsORB() ){ |
| 893 |
|
if ( L2->GetOrbitalInfo()->pkt_num != PKT || L2->GetOrbitalInfo()->OBT != OBT || L2->GetOrbitalInfo()->absTime != atime ){ |
| 894 |
|
newentry = true; |
| 895 |
|
OBT = L2->GetOrbitalInfo()->OBT; |
| 896 |
|
PKT = L2->GetOrbitalInfo()->pkt_num; |
| 897 |
|
atime = L2->GetOrbitalInfo()->absTime; |
| 898 |
|
}; |
| 899 |
|
} else { |
| 900 |
|
newentry = true; |
| 901 |
|
}; |
| 902 |
|
// |
| 903 |
|
if ( !newentry ) return; |
| 904 |
|
// |
| 905 |
|
if ( debug ) printf(" SET ENERGIES Start processing event at OBT %u PKT %u time %u \n",OBT,PKT,atime); |
| 906 |
|
// |
| 907 |
|
Clear(); |
| 908 |
|
// |
| 909 |
|
// let's start |
| 910 |
|
// |
| 911 |
|
if ( cont ){ |
| 912 |
|
for (Int_t i=0; i<22; i++){ |
| 913 |
|
if ( i == (18+N) ){ |
| 914 |
|
mask18b = 18 + N; |
| 915 |
|
break; |
| 916 |
|
}; |
| 917 |
|
}; |
| 918 |
|
}; |
| 919 |
|
// |
| 920 |
|
if ( sel ){ |
| 921 |
|
for (Int_t i=0; i<22; i++){ |
| 922 |
|
if ( i == (18-N) ){ |
| 923 |
|
mask18b = 18 - N; |
| 924 |
|
break; |
| 925 |
|
}; |
| 926 |
|
}; |
| 927 |
|
}; |
| 928 |
|
// |
| 929 |
|
// if ( mask18b == 18 ) mask18b = -1; |
| 930 |
|
// |
| 931 |
|
Int_t view = 0; |
| 932 |
|
Int_t plane = 0; |
| 933 |
|
Bool_t gof = true; |
| 934 |
|
for (view=0; view < 2; view++){ |
| 935 |
|
for (plane=0; plane < 22; plane++){ |
| 936 |
|
gof = true; |
| 937 |
|
if ( maskXE && (plane%2)==0 && view==1 ) gof = false; |
| 938 |
|
if ( maskXO && (plane%2)!=0 && view==1 ) gof = false; |
| 939 |
|
if ( maskYE && (plane%2)!=0 && view==0 ) gof = false; |
| 940 |
|
if ( maskYO && (plane%2)==0 && view==0 ) gof = false; |
| 941 |
|
if ( gof ) eplane[view][plane] = myene[view][plane]; |
| 942 |
|
if ( debug ) printf(" XE %i XO %i YE %i YO %i eplane %i %i = %f ........... myene %i %i = %f\n", maskXE, maskXO, maskYE, maskYO,view,plane,eplane[view][plane],view,plane,myene[view][plane]); |
| 943 |
|
}; |
| 944 |
|
}; |
| 945 |
|
// |
| 946 |
|
// inclination factor (stolen from Daniele's code) |
| 947 |
|
// |
| 948 |
|
Float_t ytgx = 0; |
| 949 |
|
Float_t ytgy = 0; |
| 950 |
|
ytgx = 0.76 * clp->tanx[0]; |
| 951 |
|
ytgy = 0.76 * clp->tany[0]; |
| 952 |
|
X0pl = sqrt( pow(0.76,2.) + pow(ytgx,2.) + pow(ytgy,2.) ); |
| 953 |
|
// |
| 954 |
|
// Find experimental plane of maximum |
| 955 |
|
// |
| 956 |
|
Int_t pmax = 0; |
| 957 |
|
Int_t vmax = 0; |
| 958 |
|
Float_t emax = 0.; |
| 959 |
|
for (Int_t v=0; v<2; v++){ |
| 960 |
|
for (Int_t i=0; i<22; i++){ |
| 961 |
|
if ( eplane[v][i] > emax ){ |
| 962 |
|
emax = eplane[v][i]; |
| 963 |
|
vmax = v; |
| 964 |
|
pmax = i; |
| 965 |
|
}; |
| 966 |
|
}; |
| 967 |
|
}; |
| 968 |
|
// |
| 969 |
|
// |
| 970 |
|
// |
| 971 |
|
if ( vmax == 0 ) pmax++; |
| 972 |
|
etmax = pmax * X0pl; |
| 973 |
|
// |
| 974 |
|
if ( debug ) this->Print(); |
| 975 |
|
if ( debug ) printf(" exit \n"); |
| 976 |
|
// |
| 977 |
|
}; |
| 978 |
|
|
| 979 |
Double_t ccurve(Double_t *ti,Double_t *par){ |
Double_t ccurve(Double_t *ti,Double_t *par){ |
| 980 |
// |
// |
| 994 |
this->Fit(false); |
this->Fit(false); |
| 995 |
}; |
}; |
| 996 |
|
|
| 997 |
|
Float_t CaloLong::Evaluate(TString s, Float_t tmax){ |
| 998 |
|
/* SAMPLE OUTPUT: |
| 999 |
|
Enter Infix Expression : A + B + C / (E - F) |
| 1000 |
|
Postfix Expression is : A B + C E F - / + |
| 1001 |
|
*/ |
| 1002 |
|
if ( !s.Contains("t") ){ |
| 1003 |
|
printf(" ERROR, the input formula must contain \"t\"\n"); |
| 1004 |
|
return 0.; |
| 1005 |
|
}; |
| 1006 |
|
TString g=Form("%f",tmax); |
| 1007 |
|
TString *ts= new TString(""); |
| 1008 |
|
ts->Prepend(s.Data()); |
| 1009 |
|
ts->ReplaceAll("t",1,g.Data(),g.Capacity()); |
| 1010 |
|
ts->Prepend("("); |
| 1011 |
|
ts->Append(")"); |
| 1012 |
|
if ( debug ) printf(" ts %s tssize %i capac %i s %s g %s \n",ts->Data(),ts->Sizeof(),ts->Capacity(),s.Data(),g.Data()); |
| 1013 |
|
char in[50],post[50]; |
| 1014 |
|
strcpy(&in[0]," "); |
| 1015 |
|
strcpy(&in[0],ts->Data()); |
| 1016 |
|
strcpy(&post[0]," "); |
| 1017 |
|
if ( debug ) printf("Infix Expression is : ##%s##\n",&in[0]); |
| 1018 |
|
infix2postfix(&in[0],&post[0],1); |
| 1019 |
|
if ( debug ) printf("Postfix Expression is : ##%s##\n",&post[0]); |
| 1020 |
|
/* SAMPLE OUTPUT: |
| 1021 |
|
Enter Postfix Expression : 3 5 + 2 / |
| 1022 |
|
3 5 + 2 / EQUALS 4 |
| 1023 |
|
*/ |
| 1024 |
|
Float_t res = evaluate(&post[0]); |
| 1025 |
|
if ( debug ) printf("%s EQUALS %f\n",post,res); |
| 1026 |
|
return res; |
| 1027 |
|
} |
| 1028 |
|
|
| 1029 |
void CaloLong::Fit(Bool_t draw){ |
void CaloLong::Fit(Bool_t draw){ |
| 1030 |
// |
// |
| 1031 |
Process(); |
Process(); |
| 1096 |
xpos = (st - mmin) * X0pl; |
xpos = (st - mmin) * X0pl; |
| 1097 |
if ( st > mmin && st < mmax ){ |
if ( st > mmin && st < mmax ){ |
| 1098 |
if ( no18x && ( st == 18+1 || st == mask18b+1 )){ |
if ( no18x && ( st == 18+1 || st == mask18b+1 )){ |
| 1099 |
enemip = 2. * eplane[1][st]; |
if ( !maskYO ){ |
| 1100 |
|
enemip = 2. * eplane[1][st]; |
| 1101 |
|
} else { |
| 1102 |
|
enemip = eplane[1][st]; |
| 1103 |
|
}; |
| 1104 |
} else { |
} else { |
| 1105 |
enemip = eplane[0][st-1] + eplane[1][st]; |
enemip = eplane[0][st-1] + eplane[1][st]; |
| 1106 |
}; |
}; |
| 1107 |
} else { |
} else { |
| 1108 |
if ( st == mmin ) enemip = 2. * eplane[1][st]; |
if ( st == mmin ){ |
| 1109 |
if ( st == mmax ) enemip = 2. * eplane[0][st-1]; |
if ( !maskYE ){ |
| 1110 |
|
enemip = 2. * eplane[1][st]; |
| 1111 |
|
} else { |
| 1112 |
|
enemip = eplane[1][st]; |
| 1113 |
|
}; |
| 1114 |
|
}; |
| 1115 |
|
if ( st == mmax ){ |
| 1116 |
|
if ( !maskXE ){ |
| 1117 |
|
enemip = 2. * eplane[0][st-1]; |
| 1118 |
|
} else { |
| 1119 |
|
enemip = eplane[0][st-1]; |
| 1120 |
|
}; |
| 1121 |
|
}; |
| 1122 |
}; |
}; |
| 1123 |
// |
// |
| 1124 |
qtotparz += enemip; |
qtotparz += enemip; |
| 1152 |
}; |
}; |
| 1153 |
// |
// |
| 1154 |
TF1 *lfit = new TF1("lfit",ccurve,0.,xmax,3); |
TF1 *lfit = new TF1("lfit",ccurve,0.,xmax,3); |
| 1155 |
if ( debug ) printf("qtot %f qtotparz %f \n",L2->GetCaloLevel2()->qtot,qtotparz); |
if ( debug ) printf("qtot %f qtotparz %f \n",clp->qtot,qtotparz); |
| 1156 |
E0 = qtotparz; |
E0 = qtotparz; |
| 1157 |
// E0 = L2->GetCaloLevel2()->qtot; |
// E0 = clp->qtot; |
| 1158 |
a = 5.; |
a = 5.; |
| 1159 |
b = 0.5; |
b = 0.5; |
| 1160 |
if ( debug ) printf(" STARTING PARAMETERS: E0 %f a %f b %f \n",E0,a,b); |
if ( debug ) printf(" STARTING PARAMETERS: E0 %f a %f b %f \n",E0,a,b); |
| 1197 |
if ( fitresult != 0 ){ |
if ( fitresult != 0 ){ |
| 1198 |
if ( debug ) printf(" The fit failed, no integrals calculation and asymm is set to -1. \n"); |
if ( debug ) printf(" The fit failed, no integrals calculation and asymm is set to -1. \n"); |
| 1199 |
asymm = -1.; |
asymm = -1.; |
| 1200 |
|
defE0 = -1.; |
| 1201 |
} else { |
} else { |
| 1202 |
|
if ( slmax.MaybeRegexp() ) lmax = this->Evaluate(slmax,tmax); |
| 1203 |
|
if ( sumax.MaybeRegexp() ) umax = this->Evaluate(sumax,tmax); |
| 1204 |
Int_t npp = 1000; |
Int_t npp = 1000; |
| 1205 |
|
double *xpp=new double[npp]; |
| 1206 |
|
double *wpp=new double[npp]; |
| 1207 |
|
lfit->CalcGaussLegendreSamplingPoints(npp,xpp,wpp,1e-12); |
| 1208 |
|
defE0 = lfit->IntegralFast(npp,xpp,wpp,lmax,umax); |
| 1209 |
|
// |
| 1210 |
double *xp=new double[npp]; |
double *xp=new double[npp]; |
| 1211 |
double *wp=new double[npp]; |
double *wp=new double[npp]; |
| 1212 |
lfit->CalcGaussLegendreSamplingPoints(npp,xp,wp,1e-12); |
lfit->CalcGaussLegendreSamplingPoints(npp,xp,wp,1e-12); |
| 1358 |
Clear(); |
Clear(); |
| 1359 |
//delete this; |
//delete this; |
| 1360 |
}; |
}; |
| 1361 |
|
|
| 1362 |
|
|
| 1363 |
|
|
| 1364 |
|
|
| 1365 |
|
|
| 1366 |
|
|
| 1367 |
|
|
| 1368 |
|
|
| 1369 |
|
|
| 1370 |
|
|
| 1371 |
|
|
| 1372 |
|
|
| 1373 |
|
|
| 1374 |
|
|
| 1375 |
|
|
| 1376 |
|
|
| 1377 |
|
|
| 1378 |
|
|
| 1379 |
|
|
| 1380 |
|
|