| 9 |
|
|
| 10 |
#include "SmartCollection.h" |
#include "SmartCollection.h" |
| 11 |
|
|
| 12 |
void SmartCollection::AddAction(CollectionAction& action) { |
SmartCollection::~SmartCollection(){ |
| 13 |
_actions.push_back(&action); |
if (_owns){ |
| 14 |
|
for (unsigned int i = 0; i < _actions.size(); i++) |
| 15 |
|
if (_actions[i] != NULL){ |
| 16 |
|
delete _actions[i]; |
| 17 |
|
_actions[i] = NULL; |
| 18 |
|
} |
| 19 |
|
} |
| 20 |
|
} |
| 21 |
|
|
| 22 |
|
void SmartCollection::AddAction(CollectionAction *action) { |
| 23 |
|
_actions.push_back(action); |
| 24 |
_actionsPositions.push_back(GetSize() - 1); |
_actionsPositions.push_back(GetSize() - 1); |
| 25 |
} |
} |
| 26 |
|
|
| 33 |
return _actions[iAction]; |
return _actions[iAction]; |
| 34 |
} |
} |
| 35 |
|
|
| 36 |
|
CollectionAction *SmartCollection::GetAction(const char *actionName) { |
| 37 |
|
if (_actions.size() == 0) |
| 38 |
|
return NULL; |
| 39 |
|
for (unsigned int i = 0; i < _actions.size(); i++) { |
| 40 |
|
if (strcmp(_actions[i]->GetName(), actionName) == 0) |
| 41 |
|
return _actions[i]; |
| 42 |
|
} |
| 43 |
|
|
| 44 |
|
return NULL; |
| 45 |
|
} |
| 46 |
|
|
| 47 |
void SmartCollection::Setup(PamLevel2 *events) { |
void SmartCollection::Setup(PamLevel2 *events) { |
| 48 |
PamCutCollection::Setup(events); |
PamCutCollection::Setup(events); |
| 49 |
|
//cout << GetName() << endl; |
| 50 |
|
|
| 51 |
for (unsigned int i = 0; i < _actions.size(); i++) { |
for (unsigned int i = 0; i < _actions.size(); i++) { |
| 52 |
_actions[i]->Setup(events); |
_actions[i]->Setup(events); |
| 64 |
int SmartCollection::ApplyCut(PamLevel2 *event) { |
int SmartCollection::ApplyCut(PamLevel2 *event) { |
| 65 |
|
|
| 66 |
_nEv++; |
_nEv++; |
| 67 |
|
|
| 68 |
|
// Execute the actions placed before the cuts |
| 69 |
|
unsigned int iBeforeCuts = 0; |
| 70 |
|
//cout << GetName() << endl; |
| 71 |
|
if (_actions.size() > 0) { |
| 72 |
|
while (_actionsPositions[iBeforeCuts] == -1) { |
| 73 |
|
_actions[iBeforeCuts]->OnGood(event); |
| 74 |
|
iBeforeCuts++; |
| 75 |
|
if (iBeforeCuts == _actions.size()) |
| 76 |
|
break; |
| 77 |
|
} |
| 78 |
|
} |
| 79 |
|
|
| 80 |
// Apply the cuts |
// Apply the cuts |
| 81 |
if (_cuts.size() == 0) { |
if (_cuts.size() == 0) { |
| 82 |
_nGood++; |
_nGood++; |
| 84 |
return CUTOK; |
return CUTOK; |
| 85 |
} |
} |
| 86 |
|
|
| 87 |
unsigned int bunchEnd = -1; |
unsigned int firstFailed = _cuts.size(); |
| 88 |
unsigned int nActions = 0; |
for (unsigned int iCut = 0; iCut < _cuts.size(); iCut++) { |
| 89 |
unsigned int firstActionOfBunch = -1; |
if (_cuts[iCut]->ApplyCut(event) != CUTOK && firstFailed == _cuts.size()) { |
| 90 |
if (_actions.size() > 0) { |
firstFailed = iCut; |
| 91 |
// Set the bunch end to the position of the first action |
break; |
|
bunchEnd = _actionsPositions[0]; |
|
|
// Set the position of the first action at the end of the bunch |
|
|
firstActionOfBunch = 0; |
|
|
// Set the number of actions at the end of this bunch of cuts |
|
|
nActions = 1; |
|
|
while (_actionsPositions[nActions] == bunchEnd) |
|
|
nActions++; |
|
|
} |
|
|
|
|
|
for (unsigned int icut = 0; icut < _cuts.size(); icut++) { |
|
|
if (_cuts[icut]->ApplyCut(event) != CUTOK) { |
|
|
// Check if there are actions at the end of the current bunch |
|
|
// (last bunch may have no actions at its end) |
|
|
if (bunchEnd >= icut) { |
|
|
for (unsigned int i = 0; i < nActions; i++) { |
|
|
_actions[firstActionOfBunch + i]->OnBad(event, icut); |
|
|
} |
|
|
} |
|
|
OnBad(event, icut); |
|
|
return icut; |
|
| 92 |
} |
} |
| 93 |
else if (bunchEnd == icut) { |
} |
| 94 |
// We are at the end of the bunch of cuts, so let's execute the actions |
|
| 95 |
for (unsigned int i = 0; i < nActions; i++) { |
//Do actions |
| 96 |
_actions[firstActionOfBunch + i]->OnGood(event); |
if (_actions.size() > 0) { |
| 97 |
} |
unsigned int lastPosition = _cuts.size(); |
| 98 |
if (firstActionOfBunch + nActions < _actions.size()) { |
for (unsigned int i = iBeforeCuts; i < _actions.size(); i++) { |
| 99 |
// Current bunch is done, but actions are not finished yet. Set up the next bunch. |
if (_actionsPositions[i] < (int) firstFailed) |
| 100 |
// Set the end of the new bunch and the number of actions at this end |
_actions[i]->OnGood(event); |
| 101 |
firstActionOfBunch += nActions; |
else { // A cut has failed |
| 102 |
bunchEnd = _actionsPositions[firstActionOfBunch]; |
if (lastPosition == _cuts.size()) // Record the position of the end of the bunch |
| 103 |
nActions = 1; |
lastPosition = _actionsPositions[i]; |
| 104 |
while (_actionsPositions[firstActionOfBunch + nActions] == bunchEnd) |
if (_actionsPositions[i] > (int) lastPosition) // Don't do actions at the end of successive bunches |
| 105 |
nActions++; |
break; |
| 106 |
|
_actions[i]->OnBad(event, (int) firstFailed); |
| 107 |
} |
} |
| 108 |
} |
} |
| 109 |
} |
} |
| 110 |
|
|
| 111 |
_nGood++; |
if (firstFailed == _cuts.size()) { |
| 112 |
OnGood(event); |
_nGood++; |
| 113 |
return CUTOK; |
OnGood(event); |
| 114 |
|
return CUTOK; |
| 115 |
|
} |
| 116 |
|
else { |
| 117 |
|
OnBad(event, firstFailed); |
| 118 |
|
return firstFailed; |
| 119 |
|
} |
| 120 |
} |
} |