| 15 |
|
|
| 16 |
/*! @brief A collection class designed to use CollectionAction objects. |
/*! @brief A collection class designed to use CollectionAction objects. |
| 17 |
* |
* |
| 18 |
* The SmartCollection class is designed to handle CollectionAction objects. These |
* The SmartCollection class is designed to handle CollectionAction objects. It |
| 19 |
* defines the procedures to do when an event is selected or discarded. A SmartCollection |
* holds a vector of these objects and takes care of calling Setup and Finalize for |
| 20 |
* handles a vector of these objects, calling CollectionAction::OnGood() for each of them |
* each of them at the beginning and at the end of the analysis, respectively. |
| 21 |
* when a good event is selected and CollectionAction::OnBad() when a bad one is rejected. |
* Actions can be added to the SmartCollection by means of the AddAction() method. |
| 22 |
* It will also call the CollectionAction::Setup() and CollectionAction::Finalize() methods |
* If a bunch of cuts have been already added to the collection, the action will |
| 23 |
* at the beginning and at the end of the analysis, respectively. |
* be logically placed after the cuts. The SmartCollection will call |
| 24 |
|
* CollectionAction::OnGood() if the cuts preceding the actions are satisfied, and |
| 25 |
|
* CollectionAction::OnBad() if at least one of them fails. An action will not be |
| 26 |
|
* sensitive to cuts added to the collection after the action itself. |
| 27 |
|
* The resulting structure is composed by bunches of cuts intertwined by actions, |
| 28 |
|
* which are "executed" depending on the result of the bunch of cuts that precedes the |
| 29 |
|
* action. Note that CollectionAction::OnBad() is called only for those actions at |
| 30 |
|
* the end of the bunch where the first failed cut is: if after these actions there |
| 31 |
|
* are other bunches of cuts and actions, they will be ignored. |
| 32 |
|
* For example, in the sequence below: |
| 33 |
* |
* |
| 34 |
|
* | cut1 | cut2 | action1 | action2 | cut3 | cut4 | action3 | ... |
| 35 |
|
* |
| 36 |
|
* action1 and action2 are executed (eg., OnGood is called for them) if cut1 and cut2 |
| 37 |
|
* are both satisfied, then cut3 and cut4 are evaluated and if both of them are satisfied |
| 38 |
|
* then action3 is executed. If, for example, cut 1 or cut2 fail, then OnBad is called for |
| 39 |
|
* action1 and action2; however, cut3, cut4, action3 and all that follows are ignored. The |
| 40 |
|
* analysis goes on with the next event. |
| 41 |
*/ |
*/ |
| 42 |
class SmartCollection: public PamCutCollection { |
class SmartCollection: public PamCutCollection { |
| 43 |
|
|
| 83 |
*/ |
*/ |
| 84 |
void Finalize(); |
void Finalize(); |
| 85 |
|
|
| 86 |
/*! @brief Post-selection tasks. |
/*! Applies the cuts and executes the actions. |
|
* |
|
|
* This routine is automatically called after a good event has been selected by |
|
|
* ApplyCut(). It will simply call PamCutCollection::OnGood() and then CollectionAction::OnGood() for each |
|
|
* action in the SmartCollection. |
|
|
* @param event The event which satisfy the cut. |
|
|
*/ |
|
|
void OnGood(PamLevel2 *event); |
|
|
|
|
|
/*! @brief Post-selection tasks. |
|
| 87 |
* |
* |
| 88 |
* This routine is automatically called after a bad event has been rejected by |
* When cuts are applied, a SmartCollection will also execute the actions at the end of the bunches of cuts. |
|
* ApplyCut(). It will simply call PamCutCollection::OnBad() and then CollectionAction::OnBad() for each |
|
|
* action in the SmartCollection. |
|
| 89 |
* |
* |
| 90 |
* @see OnGood |
* @param event The event to analyze. |
|
* @param event The event which don't satisfy the cut. |
|
|
* @param selectionResult The return value of the Check() routine. |
|
| 91 |
*/ |
*/ |
| 92 |
void OnBad(PamLevel2 *event, int selectionResult); |
int ApplyCut(PamLevel2 *event); |
| 93 |
|
|
| 94 |
private: |
protected: |
| 95 |
|
|
| 96 |
std::vector<CollectionAction*> _actions; |
std::vector<CollectionAction*> _actions; |
| 97 |
|
std::vector<unsigned int> _actionsPositions; |
| 98 |
|
|
| 99 |
|
|
| 100 |
|
|
| 101 |
}; |
}; |
| 102 |
|
|