CSCSegAlgoTC.h

Go to the documentation of this file.

#ifndef CSCSegment_CSCSegAlgoTC_h
#define CSCSegment_CSCSegAlgoTC_h

#include <RecoLocalMuon/CSCSegment/src/CSCSegmentAlgorithm.h>

#include <DataFormats/CSCRecHit/interface/CSCRecHit2D.h>

#include <deque>
#include <vector>

class CSCSegFit;

class CSCSegAlgoTC : public CSCSegmentAlgorithm {
 public:
  
  typedef std::vector<int> LayerIndex;
  typedef std::vector<const CSCRecHit2D*> ChamberHitContainer;
  typedef ChamberHitContainer::const_iterator ChamberHitContainerCIt;
  
  // We need to be able to flag a hit as 'used' and so need a container
  // of bool's. Naively, this would be vector<bool>... but AVOID that since it's
  // non-standard i.e. packed-bit implementation which is not a standard STL container. 
  // We don't need what it offers and it could lead to unexpected trouble in the future
  
  typedef std::deque<bool> BoolContainer;
  
  explicit CSCSegAlgoTC(const edm::ParameterSet& ps);
  ~CSCSegAlgoTC() override {};
  
  std::vector<CSCSegment> buildSegments(const ChamberHitContainer& rechits);
  
  std::vector<CSCSegment> run(const CSCChamber* aChamber, const ChamberHitContainer& rechits) override;
  
 private:
  
  
  bool addHit(const CSCRecHit2D* aHit, int layer);
  bool replaceHit(const CSCRecHit2D* h, int layer);
  void compareProtoSegment(const CSCRecHit2D* h, int layer);
  void increaseProtoSegment(const CSCRecHit2D* h, int layer);
  
  bool areHitsCloseInLocalX(const CSCRecHit2D* h1, const CSCRecHit2D* h2) const;
  
  bool areHitsCloseInGlobalPhi(const CSCRecHit2D* h1, const CSCRecHit2D* h2) const;
  
  bool hasHitOnLayer(int layer) const;
  
  bool isHitNearSegment(const CSCRecHit2D* h) const;
  
  void dumpHits(const ChamberHitContainer& rechits) const;
  
  void tryAddingHitsToSegment(const ChamberHitContainer& rechits, 
                  const ChamberHitContainerCIt i1, 
                  const ChamberHitContainerCIt i2);
  
  bool isSegmentGood(std::vector<CSCSegFit*>::iterator is, 
             const ChamberHitContainer& rechitsInChamber,  
             BoolContainer& used) const;
  
  void flagHitsAsUsed(std::vector<CSCSegFit*>::iterator is, 
              const ChamberHitContainer& rechitsInChamber, BoolContainer& used) const;
  
  void pruneTheSegments(const ChamberHitContainer& rechitsInChamber);
  void segmentSort(void);  
  
  float phiAtZ(float z) const;  

  void updateParameters(void);

  void dumpSegment( const CSCSegment& seg ) const;
  
  // ================
  
  const CSCChamber* theChamber;

  ChamberHitContainer proto_segment;

  // Pointer to most recent candidate fit
  CSCSegFit* sfit_;

  // Store pointers to set of candidate fits
  std::vector<CSCSegFit*> candidates;
  
  float chi2Max;
  
  float chi2ndfProbMin;

  float dRPhiFineMax;
  
  float dPhiFineMax;
  
  float dRPhiMax;
  
  float dPhiMax;
  
  int minLayersApart;
  
  int SegmentSorting;

  const std::string myName;
  bool debugInfo;

};

#endif