Scrooge.h

/**************************************************************************
 * BASF2 (Belle Analysis Framework 2)                                     *
 * Copyright(C) 2010 - Belle II Collaboration                             *
 *                                                                        *
 * Author: The Belle II Collaboration                                     *
 * Contributors: Martin Heck                                              *
 *                                                                        *
 * This software is provided "as is" without any warranty.                *
 **************************************************************************/
#pragma once
 
#include <tracking/trackFindingVXD/trackSetEvaluator/OverlapResolverNodeInfo.h>
 
#include <vector>
#include <algorithm>
 
namespace Belle2 {
  class Scrooge {
  public:
    void performSelection(std::vector <OverlapResolverNodeInfo>& overlapResolverNodeInfo)
    {
      //sort the vector according to the QI supplied.
      std::sort(overlapResolverNodeInfo.begin(), overlapResolverNodeInfo.end(),
      [](OverlapResolverNodeInfo const & lhs, OverlapResolverNodeInfo const & rhs) -> bool {
        return lhs.qualityIndicator > rhs.qualityIndicator;
      });
 
      //kill all tracks, that have overlaps and lower QI:
      auto endOfOverlapResolverNodeInfo   = overlapResolverNodeInfo.cend();
      for (auto trackIter = overlapResolverNodeInfo.begin(); trackIter != endOfOverlapResolverNodeInfo; trackIter++) {
        if (!trackIter->activityState) continue;
        for (auto testTrackIter = trackIter; testTrackIter != endOfOverlapResolverNodeInfo; testTrackIter++) {
          if (std::find(trackIter->overlaps.begin(), trackIter->overlaps.end(), testTrackIter->trackIndex) !=
              trackIter->overlaps.end()) {
            testTrackIter->activityState = 0.;
          }
        }
      }
    }
  };
}