| 661 |
//UInt_t tjump = 100; |
//UInt_t tjump = 100; |
| 662 |
while ( tjump > 0 ){ |
while ( tjump > 0 ){ |
| 663 |
pktlast = numeric_limits<UInt_t>::max(); |
pktlast = numeric_limits<UInt_t>::max(); |
| 664 |
while ( pktlast > chpktmax && (Int_t)(nevent-1-it) >= 0 ){ |
while ( PKT(pktlast) > PKT(chpktmax) && (Int_t)(nevent-1-it) >= 0 ){ |
| 665 |
if ( (Int_t)(nevent-1-it) >= 0 ){ |
if ( (Int_t)(nevent-1-it) >= 0 ){ |
| 666 |
T->GetEntry(nevent-1-it); |
T->GetEntry(nevent-1-it); |
| 667 |
ph = eh->GetPscuHeader(); |
ph = eh->GetPscuHeader(); |
| 669 |
} else { |
} else { |
| 670 |
pktlast = chpktmax + 1; |
pktlast = chpktmax + 1; |
| 671 |
}; |
}; |
| 672 |
if ( (!(it%1000) || abs((int)pktlast - (int)chpktmax)<1000 ) && debug ) printf(" look for up %i %i %i nevent %u (nevent-1-it) %i \n",it,pktlast,chpktmax,nevent,(Int_t)(nevent-1-it)); |
if ( (!(it%1000) || abs((int)(PKT(pktlast) - PKT(chpktmax)))<1000 ) && debug ) printf(" look for up %i %i %i nevent %u (nevent-1-it) %i \n",it,pktlast,chpktmax,nevent,(Int_t)(nevent-1-it)); |
| 673 |
it += tjump; |
it += tjump; |
| 674 |
}; |
}; |
| 675 |
if ( tjump > 1 ) it -= 2*tjump; |
if ( tjump > 1 ) it -= 2*tjump; |
| 694 |
//tjump = 100; |
//tjump = 100; |
| 695 |
while ( tjump > 0 ){ |
while ( tjump > 0 ){ |
| 696 |
pktlast = 0; |
pktlast = 0; |
| 697 |
while ( pktlast < chpktmin && it < (Int_t)nevent ){ |
while ( PKT(pktlast) < PKT(chpktmin) && it < (Int_t)nevent ){ |
| 698 |
if ( it < (Int_t)nevent ){ |
if ( it < (Int_t)nevent ){ |
| 699 |
T->GetEntry(it); |
T->GetEntry(it); |
| 700 |
ph = eh->GetPscuHeader(); |
ph = eh->GetPscuHeader(); |