ME0SegmentAlgorithm.h

Go to the documentation of this file.

#ifndef GEMRecHit_ME0SegmentAlgorithm_h
#define GEMRecHit_ME0SegmentAlgorithm_h

#include "FWCore/MessageLogger/interface/MessageLogger.h"
#include "RecoLocalMuon/GEMSegment/plugins/ME0SegmentAlgorithmBase.h"
#include "DataFormats/GEMRecHit/interface/ME0RecHit.h"

#include <deque>
#include <vector>

class MuonSegFit;

class ME0SegmentAlgorithm : public ME0SegmentAlgorithmBase {


public:

  typedef std::vector<HitAndPositionPtrContainer> ProtoSegments;

  explicit ME0SegmentAlgorithm(const edm::ParameterSet& ps);
  virtual ~ME0SegmentAlgorithm();

  std::vector<ME0Segment> run(const ME0Chamber * chamber, const HitAndPositionContainer& rechits);

private:

  //  Build groups of rechits that are separated in x and y to save time on the segment finding
  ProtoSegments clusterHits(const HitAndPositionContainer& rechits);

  // Build groups of rechits that are separated in strip numbers and Z to save time on the segment finding
  ProtoSegments chainHits(const ME0Chamber * chamber, const HitAndPositionContainer& rechits);

  bool isGoodToMerge(const ME0Chamber * chamber, const HitAndPositionPtrContainer& newChain, const HitAndPositionPtrContainer& oldChain);

  // Build track segments in this chamber (this is where the actual segment-building algorithm hides.)
  void buildSegments(const ME0Chamber * chamber, const HitAndPositionPtrContainer& rechits, std::vector<ME0Segment>& me0segs);

  // Member variables
  const std::string myName; 

  // input from .cfi file
  bool    debug;
  unsigned int     minHitsPerSegment;
  bool    preClustering;
  double  dXclusBoxMax;
  double  dYclusBoxMax;
  bool    preClustering_useChaining;
  double  dPhiChainBoxMax;
  double  dEtaChainBoxMax;
  double  dTimeChainBoxMax;
  int     maxRecHitsInCluster;
  
  static constexpr float running_max=std::numeric_limits<float>::max();
  std::unique_ptr<MuonSegFit> sfit_;

};

#endif