L1HitsSortHelper.h

Go to the documentation of this file.

#ifndef _L1HitsL1HitsSortHelper_h_
#define _L1HitsL1HitsSortHelper_h_
 
#include "L1Grid.h"
#include "L1HitPoint.h"
#include "L1StsHit.h"
#include <algorithm>
#include <vector>
 
using std::vector;
 
struct L1HitsSortHelperData {
  L1StsHit* h;
  L1HitPoint* p;
  unsigned int bin;
  THitI i;
 
  static bool compare(const L1HitsSortHelperData& a,
                      const L1HitsSortHelperData& b) {
    return a.bin < b.bin || (a.bin == b.bin && a.p->V() < b.p->V());
  }
};
 
class L1HitsSortHelper {
public:
  L1HitsSortHelper(vector<L1StsHit>& hits,
                   vector<L1HitPoint>& points,
                   vector<THitI>& indices,
                   const L1Grid* grid,
                   THitI* iStart,
                   THitI* iStop,
                   int nStations,
                   int nDontUsedHits);
 
  void Sort();
 
private:
  vector<L1HitsSortHelperData> fD;
  vector<L1StsHit>& fHits;
  vector<L1HitPoint>& fPoints;
  vector<THitI>& fIndices;
  const L1Grid* fGrid;
  THitI *fStsHitsUnusedStartIndex, *fStsHitsUnusedStopIndex;
  int fNStations;
  int fnDontUsedHits;
 
  L1HitsSortHelper(const L1HitsSortHelper&);
  L1HitsSortHelper& operator=(const L1HitsSortHelper&);
};
 
#endif