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++; |
85 |
} |
} |
86 |
|
|
87 |
unsigned int firstFailed = _cuts.size(); |
unsigned int firstFailed = _cuts.size(); |
88 |
for (unsigned int icut = 0; icut < _cuts.size(); icut++) { |
unsigned int iAction = iBeforeCuts; |
89 |
if (_cuts[icut]->ApplyCut(event) != CUTOK && firstFailed == _cuts.size()) { |
for (unsigned int iCut = 0; iCut < _cuts.size(); iCut++) { |
90 |
firstFailed = icut; |
if (_cuts[iCut]->ApplyCut(event) != CUTOK && firstFailed == _cuts.size()) { |
91 |
|
firstFailed = iCut; |
92 |
|
// Apply the bad actions at the end of the bunch |
93 |
|
if (iAction < _actions.size()) { |
94 |
|
unsigned int lastPosition = _actionsPositions[iAction]; |
95 |
|
for (; iAction < _actions.size(); iAction++) { |
96 |
|
if (_actionsPositions[iAction] > (int) lastPosition) // Don't do actions at the end of successive bunches |
97 |
|
break; |
98 |
|
_actions[iAction]->OnBad(event, (int) firstFailed); |
99 |
|
|
100 |
|
} |
101 |
|
} |
102 |
break; |
break; |
103 |
} |
} |
104 |
} |
else if (iAction < _actions.size()) { |
105 |
|
// Do the good actions if we are at the end of the bunch |
106 |
//Do actions |
while (_actionsPositions[iAction] == (int) iCut) { |
107 |
if (_actions.size() > 0) { |
_actions[iAction]->OnGood(event); |
108 |
unsigned int lastPosition = _cuts.size(); |
iAction++; |
109 |
for (unsigned int i = 0; i < _actions.size(); i++) { |
if (iAction == _actions.size()) |
|
if (_actionsPositions[i] < firstFailed) |
|
|
_actions[i]->OnGood(event); |
|
|
else { // A cut has failed |
|
|
if (lastPosition == _cuts.size()) // Record the position of the end of the bunch |
|
|
lastPosition = _actionsPositions[i]; |
|
|
if (_actionsPositions[i] > lastPosition) // Don't do actions at the end of successive bunches |
|
110 |
break; |
break; |
|
_actions[i]->OnBad(event, firstFailed); |
|
111 |
} |
} |
112 |
} |
} |
113 |
} |
} |