| 51 |
|
{ |
| 52 |
|
// Add trigger objects corresponding to trigger id. |
| 53 |
|
|
| 54 |
< |
const BitMask256 &ba = fTrigBitsAnd.Ref(tid); |
| 55 |
< |
const BitMask256 &bm = fTrigBitsCmp.Ref(tid); |
| 54 |
> |
const BitMask256 &ba = fTrigBitsAnd.at(tid); |
| 55 |
> |
const BitMask256 &bm = fTrigBitsCmp.at(tid); |
| 56 |
|
for (UInt_t i=0; i<bm.Size(); ++i) { |
| 57 |
|
if (ba.TestBit(i)==0) |
| 58 |
|
continue; // not an active trigger bit |
| 72 |
|
{ |
| 73 |
|
// Get HLT tree and set branches. Compute bitmasks to be used when comparing to the HLT bits. |
| 74 |
|
|
| 75 |
< |
fTrigBitsAnd.Reset(); |
| 76 |
< |
fTrigBitsCmp.Reset(); |
| 75 |
> |
fTrigBitsAnd.clear(); |
| 76 |
> |
fTrigBitsCmp.clear(); |
| 77 |
|
|
| 78 |
|
if (fPrintTable) |
| 79 |
|
fTriggers->Print(); |
| 106 |
|
} |
| 107 |
|
delete arr; |
| 108 |
|
} |
| 109 |
< |
fTrigBitsAnd.AddCopy(amask); |
| 110 |
< |
fTrigBitsCmp.AddCopy(tmask); |
| 109 |
> |
fTrigBitsAnd.push_back(amask); |
| 110 |
> |
fTrigBitsCmp.push_back(tmask); |
| 111 |
|
} |
| 112 |
|
} |
| 113 |
|
|
| 126 |
|
fMyTrgObjs->SetOwner(kFALSE); // the objects are owned by the object table |
| 127 |
|
fBitsDone.Clear(); |
| 128 |
|
Bool_t accept = kFALSE; |
| 129 |
< |
for (UInt_t i = 0; i<fTrigBitsAnd.Entries(); ++i) { |
| 130 |
< |
BitMask256 bitmask(*fBits); |
| 131 |
< |
bitmask &= fTrigBitsAnd.Ref(i); |
| 132 |
< |
if (bitmask==fTrigBitsCmp.Ref(i)) { |
| 129 |
> |
for (UInt_t i = 0; i<fTrigBitsAnd.size(); ++i) { |
| 130 |
> |
BitMask256 bitmask(fBits->Get()); |
| 131 |
> |
bitmask &= fTrigBitsAnd.at(i); |
| 132 |
> |
if (bitmask==fTrigBitsCmp.at(i)) { |
| 133 |
|
accept = kTRUE; |
| 134 |
|
AddTrigObjs(i); |
| 135 |
|
} |
