Changeset 2507 in Sophya for trunk/SophyaLib/HiStats/histos.cc
- Timestamp:
- Mar 15, 2004, 5:47:21 PM (22 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/SophyaLib/HiStats/histos.cc
r2341 r2507 1 1 // 2 // $Id: histos.cc,v 1.1 6 2003-03-10 14:10:24ansari Exp $2 // $Id: histos.cc,v 1.17 2004-03-15 16:47:20 ansari Exp $ 3 3 // 4 4 … … 26 26 binWidth(0) 27 27 { 28 END_CONSTRUCTOR29 28 } 30 29 … … 39 38 { 40 39 Zero(); 41 END_CONSTRUCTOR42 40 } 43 41 … … 52 50 { 53 51 Zero(); 54 END_CONSTRUCTOR55 52 } 56 53 … … 71 68 } 72 69 } 73 END_CONSTRUCTOR74 70 } 75 71 … … 168 164 Histo& Histo::operator /= (r_8 b) 169 165 { 170 if (b==0.) THROW(inconsistentErr);166 if (b==0.) throw ParmError(PExcLongMessage("")); 171 167 r_8 b2 = b*b; 172 168 for(int_4 i=0;i<mBins;i++) { … … 213 209 Histo& Histo::operator += (const Histo& a) 214 210 { 215 if(mBins!=a.mBins) THROW(sizeMismatchErr);211 if(mBins!=a.mBins) throw SzMismatchError(PExcLongMessage("")); 216 212 for(int_4 i=0;i<mBins;i++) { 217 213 mData[i] += a(i); … … 231 227 Histo& Histo::operator -= (const Histo& a) 232 228 { 233 if(mBins!=a.mBins) THROW(sizeMismatchErr);229 if(mBins!=a.mBins) throw SzMismatchError(PExcLongMessage("")); 234 230 for(int_4 i=0;i<mBins;i++) { 235 231 mData[i] -= a(i); … … 249 245 Histo& Histo::operator *= (const Histo& a) 250 246 { 251 if(mBins!=a.mBins) THROW(sizeMismatchErr);247 if(mBins!=a.mBins) throw SzMismatchError(PExcLongMessage("")); 252 248 nHist = 0.; 253 249 for(int_4 i=0;i<mBins;i++) { … … 269 265 Histo& Histo::operator /= (const Histo& a) 270 266 { 271 if(mBins!=a.mBins) THROW(sizeMismatchErr);267 if(mBins!=a.mBins) throw SzMismatchError(PExcLongMessage("")); 272 268 nHist = 0.; 273 269 for(int_4 i=0;i<mBins;i++) { … … 339 335 void Histo::PutValue(TVector<r_8> &v, int_4 ierr) 340 336 { 341 //if(v.NElts()<(uint_4) mBins) THROW(sizeMismatchErr);337 //if(v.NElts()<(uint_4) mBins) throw SzMismatchError(PExcLongMessage("")); 342 338 uint_4 n = (v.NElts()<(uint_4) mBins) ? v.NElts(): (uint_4) mBins; 343 339 if(n>0) for(uint_4 i=0;i<n;i++) { … … 353 349 void Histo::PutValueAdd(TVector<r_8> &v, int_4 ierr) 354 350 { 355 //if(v.NElts()<(uint_4) mBins) THROW(sizeMismatchErr);351 //if(v.NElts()<(uint_4) mBins) throw SzMismatchError(PExcLongMessage("")); 356 352 uint_4 n = (v.NElts()<(uint_4) mBins) ? v.NElts(): (uint_4) mBins; 357 353 if(n>0) for(uint_4 i=0;i<n;i++) { … … 367 363 void Histo::PutError2(TVector<r_8> &v) 368 364 { 369 //if(v.NElts()<(uint_4) mBins) THROW(sizeMismatchErr);365 //if(v.NElts()<(uint_4) mBins) throw SzMismatchError(PExcLongMessage("")); 370 366 uint_4 n = (v.NElts()<(uint_4) mBins) ? v.NElts(): (uint_4) mBins; 371 367 if(n>0) { … … 381 377 void Histo::PutError2Add(TVector<r_8> &v) 382 378 { 383 //if(v.NElts()<(uint_4) mBins) THROW(sizeMismatchErr);379 //if(v.NElts()<(uint_4) mBins) throw SzMismatchError(PExcLongMessage("")); 384 380 uint_4 n = (v.NElts()<(uint_4) mBins) ? v.NElts(): (uint_4) mBins; 385 381 if(n>0) { … … 395 391 void Histo::PutError(TVector<r_8> &v) 396 392 { 397 //if(v.NElts()<(uint_4) mBins) THROW(sizeMismatchErr);393 //if(v.NElts()<(uint_4) mBins) throw SzMismatchError(PExcLongMessage("")); 398 394 uint_4 n = (v.NElts()<(uint_4) mBins) ? v.NElts(): (uint_4) mBins; 399 395 if(n>0) { … … 955 951 cout<<"Histo::FitMax : Nb Entrees histo ="<<NEntries()<<endl; 956 952 957 if (NEntries() < 1) THROW(inconsistentErr);953 if (NEntries() < 1) throw ParmError(PExcLongMessage("")); 958 954 959 955 int_4 iMax = IMax(); … … 1021 1017 for(k=0;k<nLowHigh;k++) cout<<" "<<e2Fit(k); cout<<endl; 1022 1018 } 1023 if( ii != nLowHigh ) THROW(inconsistentErr);1019 if( ii != nLowHigh ) throw ParmError(PExcLongMessage("")); 1024 1020 Poly pol(degree); 1025 1021 TRY { … … 1049 1045 // on est dans le cas d'un fit de parabole 1050 1046 r_8 r=0; 1051 if (pol.Root1(r)==0) THROW(inconsistentErr);1047 if (pol.Root1(r)==0) throw ParmError(PExcLongMessage("")); 1052 1048 fd = r + xCenter; 1053 1049 } else if (DPolDeg == 2) { … … 1055 1051 r_8 r1=0; 1056 1052 r_8 r2=0; 1057 if (pol.Root2(r1,r2) == 0) THROW(inconsistentErr);1053 if (pol.Root2(r1,r2) == 0) throw ParmError(PExcLongMessage("")); 1058 1054 pol.Derivate(); 1059 1055 fd = (pol(r1)<0) ? r1 + xCenter : r2 + xCenter; 1060 1056 } else { 1061 1057 // on est dans un cas non prevu 1062 THROW(inconsistentErr);1058 throw ParmError(PExcLongMessage("")); 1063 1059 } 1064 1060 … … 1104 1100 << " , nbin= " << NBins() << endl; 1105 1101 1106 if (NEntries() < 1) THROW(inconsistentErr);1107 if (NBins() < 3) THROW(inconsistentErr);1102 if (NEntries() < 1) throw ParmError(PExcLongMessage("")); 1103 if (NBins() < 3) throw ParmError(PExcLongMessage("")); 1108 1104 1109 1105 int_4 iMax = FindBin(xmax); 1110 if (iMax<0 || iMax>=NBins()) THROW(inconsistentErr);1106 if (iMax<0 || iMax>=NBins()) throw ParmError(PExcLongMessage("")); 1111 1107 r_8 hmax = mData[iMax]; 1112 1108 r_8 limit = frac*hmax;
Note:
See TracChangeset
for help on using the changeset viewer.