323 |
} |
} |
324 |
for (UInt_t j = 0; j < nobefrun; j++){ |
for (UInt_t j = 0; j < nobefrun; j++){ |
325 |
// |
// |
326 |
NDtrclone->GetEntry(j); |
if ( NDtrclone->GetEntry(j) <= 0 ) throw -36; |
327 |
// |
// |
328 |
// copy ndclone to mydec |
// copy ndclone to mydec |
329 |
// |
// |
477 |
// |
// |
478 |
if ( procev%1000 == 0 && procev > 0 && verbose ) printf(" %iK \n",procev/1000); |
if ( procev%1000 == 0 && procev > 0 && verbose ) printf(" %iK \n",procev/1000); |
479 |
// |
// |
480 |
l0head->GetEntry(re); |
if ( l0head->GetEntry(re) <= 0 ) throw -36; |
481 |
// |
// |
482 |
// absolute time of this event |
// absolute time of this event |
483 |
// |
// |
497 |
// |
// |
498 |
nd->Clear(); |
nd->Clear(); |
499 |
// |
// |
500 |
l0ND->GetEntry(re); |
if ( l0ND->GetEntry(re) <= 0 ) throw -36; |
501 |
tmpSize = l0ne->Records->GetEntries(); |
tmpSize = l0ne->Records->GetEntries(); |
502 |
if ( tmpSize && l0ne->unpackError == 0 ){ |
if ( tmpSize && l0ne->unpackError == 0 ){ |
503 |
for (Int_t j = 0; j < tmpSize; j++){ |
for (Int_t j = 0; j < tmpSize; j++){ |
547 |
// |
// |
548 |
// Get entry from old tree |
// Get entry from old tree |
549 |
// |
// |
550 |
NDtrclone->GetEntry(j); |
if ( NDtrclone->GetEntry(j) <= 0 ) throw -36; |
551 |
// |
// |
552 |
// copy ndclone to nd |
// copy ndclone to nd |
553 |
// |
// |