| 660 |
UInt_t tjump = 50000; |
UInt_t tjump = 50000; |
| 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 |
|
pktlast = chpktmax + 1; |
| 665 |
while ( PKT(pktlast) > PKT(chpktmax) && (Int_t)(nevent-1-it) >= 0 ){ |
while ( PKT(pktlast) > PKT(chpktmax) && (Int_t)(nevent-1-it) >= 0 ){ |
| 666 |
if ( (Int_t)(nevent-1-it) >= 0 ){ |
if ( (Int_t)(nevent-1-it) >= 0 ){ |
| 667 |
T->GetEntry(nevent-1-it); |
T->GetEntry(nevent-1-it); |
| 694 |
tjump = 50000; |
tjump = 50000; |
| 695 |
//tjump = 100; |
//tjump = 100; |
| 696 |
while ( tjump > 0 ){ |
while ( tjump > 0 ){ |
| 697 |
pktlast = 0; |
// pktlast = 0; |
| 698 |
|
pktlast = chpktmin - 1; |
| 699 |
|
if ( debug ) printf("LLlook for down %i %i %llu %llu \n",it,pktlast,PKT(pktlast),PKT(chpktmin)); |
| 700 |
while ( PKT(pktlast) < PKT(chpktmin) && it < (Int_t)nevent ){ |
while ( PKT(pktlast) < PKT(chpktmin) && it < (Int_t)nevent ){ |
| 701 |
if ( it < (Int_t)nevent ){ |
if ( it < (Int_t)nevent ){ |
| 702 |
T->GetEntry(it); |
T->GetEntry(it); |