Collections/SmartBlindCollection/SmartBlindCollection.cpp

/*
 * SmartBlindCollection.cpp
 *
 *  Created on: 16-mag-2009
 *      Author: Nicola Mori
 */

/*! @file SmartCollection.cpp The SmartBlindCollection class implementation file */

#include "SmartBlindCollection.h"

int SmartBlindCollection::ApplyCut(PamLevel2 *event) {

  _nEv++;
  if (_cuts.size() == 0) {
    _nGood++;
    OnGood(event);
    return CUTOK;
  }

  unsigned int bunchEnd = -1;
  unsigned int nActions = 0;
  unsigned int firstActionOfBunch = -1;
  if (_actions.size() > 0) {
    // Set the bunch end to the position of the first action
    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++;
  }

  int firstFailed = CUTOK;
  for (unsigned int icut = 0; icut < _cuts.size(); icut++) {
    if (_cuts[icut]->ApplyCut(event) != CUTOK && firstFailed == CUTOK) {
      firstFailed = icut;
    }
    if (bunchEnd == icut) {
      if (firstFailed == CUTOK) {
        for (unsigned int i = 0; i < nActions; i++) {
          _actions[firstActionOfBunch + i]->OnGood(event);
        }
      }
      else {
        for (unsigned int i = 0; i < nActions; i++) {
          _actions[firstActionOfBunch + i]->OnBad(event, icut);
        }
      }

      if (firstActionOfBunch + nActions < _actions.size()) {
        // Current bunch is done, but actions are not finished yet. Set up the next bunch.
        // Set the end of the new bunch and the number of actions at this end
        firstActionOfBunch += nActions;
        bunchEnd = _actionsPositions[firstActionOfBunch];
        nActions = 1;
        while (_actionsPositions[firstActionOfBunch + nActions] == bunchEnd)
          nActions++;
      }
    }
  }

  if (firstFailed == CUTOK) {
    _nGood++;
    OnGood(event);
  }
  else {
    OnBad(event, firstFailed);
  }
  return firstFailed;

}
1	pam-fi	1.1	/*
2			* SmartBlindCollection.cpp
3			*
4			* Created on: 16-mag-2009
5			* Author: Nicola Mori
6			*/
7
8	pam-fi	1.2	/! @file SmartCollection.cpp The SmartBlindCollection class implementation file /
9	pam-fi	1.1
10			#include "SmartBlindCollection.h"
11
12	pam-fi	1.2	int SmartBlindCollection::ApplyCut(PamLevel2 *event) {
13	pam-fi	1.1
14	pam-fi	1.2	_nEv++;
15			if (_cuts.size() == 0) {
16			_nGood++;
17			OnGood(event);
18			return CUTOK;
19			}
20	pam-fi	1.1
21	pam-fi	1.2	unsigned int bunchEnd = -1;
22			unsigned int nActions = 0;
23			unsigned int firstActionOfBunch = -1;
24			if (_actions.size() > 0) {
25			// Set the bunch end to the position of the first action
26			bunchEnd = _actionsPositions[0];
27			// Set the position of the first action at the end of the bunch
28			firstActionOfBunch = 0;
29			// Set the number of actions at the end of this bunch of cuts
30			nActions = 1;
31			while (_actionsPositions[nActions] == bunchEnd)
32			nActions++;
33			}
34	pam-fi	1.1
35	pam-fi	1.2	int firstFailed = CUTOK;
36			for (unsigned int icut = 0; icut < _cuts.size(); icut++) {
37			if (_cuts[icut]->ApplyCut(event) != CUTOK && firstFailed == CUTOK) {
38			firstFailed = icut;
39			}
40			if (bunchEnd == icut) {
41			if (firstFailed == CUTOK) {
42			for (unsigned int i = 0; i < nActions; i++) {
43			_actions[firstActionOfBunch + i]->OnGood(event);
44			}
45			}
46			else {
47			for (unsigned int i = 0; i < nActions; i++) {
48			_actions[firstActionOfBunch + i]->OnBad(event, icut);
49			}
50			}
51
52			if (firstActionOfBunch + nActions < _actions.size()) {
53			// Current bunch is done, but actions are not finished yet. Set up the next bunch.
54			// Set the end of the new bunch and the number of actions at this end
55			firstActionOfBunch += nActions;
56			bunchEnd = _actionsPositions[firstActionOfBunch];
57			nActions = 1;
58			while (_actionsPositions[firstActionOfBunch + nActions] == bunchEnd)
59			nActions++;
60			}
61			}
62	pam-fi	1.1	}
63
64	pam-fi	1.2	if (firstFailed == CUTOK) {
65			_nGood++;
66			OnGood(event);
67	pam-fi	1.1	}
68	pam-fi	1.2	else {
69			OnBad(event, firstFailed);
70	pam-fi	1.1	}
71	pam-fi	1.2	return firstFailed;
72	pam-fi	1.1
73			}