PXDDQMEfficiencySelftrackModule.h

/**************************************************************************
 * BASF2 (Belle Analysis Framework 2)                                     *
 * Copyright(C) 2016 - Belle II Collaboration                             *
 *                                                                        *
 * Author: The Belle II Collaboration                                     *
 * Contributors: Thomas Lueck, Ulf Stolzenberg, Benjamin Schwenker, Uwe Gebauer, Bjoern Spruck *
 *                                                                        *
 * This software is provided "as is" without any warranty.                *
 **************************************************************************/
 
 
#pragma once
 
#include <framework/core/HistoModule.h>
#include <framework/datastore/StoreArray.h>
 
#include <pxd/dataobjects/PXDCluster.h>
 
#include <vxd/geometry/GeoCache.h>
#include <vxd/geometry/SensorInfoBase.h>
 
#include <tracking/dataobjects/RecoTrack.h>
#include <tracking/dataobjects/ROIid.h>
 
#include "TH1F.h"
#include "TH2F.h"
#include "TVector3.h"
 
 
namespace Belle2 {
  class PXDDQMEfficiencySelftrackModule : public HistoModule {
 
  public:
 
    PXDDQMEfficiencySelftrackModule();
 
  private:
 
    void event() override final;
 
    void beginRun() override final;
 
    void initialize() override final;
 
    void defineHisto() override final;
 
 
 
  private:
    /* returns the space point in local coordinates where the track hits the sensor:
      sensorInfo: info of the sensor under investigation
      aTrack: the track to be tested
      isgood: flag which is false if some error occured (do not use the point if false)
      du and dv are the uncertainties in u and v on the sensor plane of the fit (local coordinates)
     */
    TVector3 getTrackInterSec(const VXD::SensorInfoBase& pxdSensorInfo, const RecoTrack& aTrack, bool& isgood, double& du, double& dv);
    int findClosestCluster(const VxdID& vxdid, TVector3 intersection);
    bool isCloseToBorder(int u, int v, int checkDistance);
    bool isDeadPixelClose(int u, int v, int checkDistance, const VxdID& moduleID);
 
    bool m_requireROIs;
 
    bool m_useAlignment;
    bool m_maskDeadPixels;
    bool m_cutBorders;
    bool m_verboseHistos;
 
    VXD::GeoCache& m_vxdGeometry;
 
    std::string m_histogramDirectoryName;
 
    std::string m_pxdClustersName; 
    std::string m_tracksName; 
    std::string m_ROIsName; 
 
    int m_u_bins; 
    int m_v_bins; 
 
    StoreArray<PXDCluster> m_pxdclusters; 
    StoreArray<RecoTrack> m_tracks; 
    StoreArray<ROIid> m_ROIs; 
 
    double m_distcut; 
    double m_uFactor; 
    double m_vFactor; 
    double m_pcut; 
    double m_momCut; 
    double m_pTCut; 
    unsigned int m_minSVDHits; 
    double m_z0minCut;
    double m_z0maxCut;
    double m_d0Cut;
    int m_maskedDistance; 
 
    //Histograms to later determine efficiency
    std::map<VxdID, TH2F*> m_h_track_hits; 
    std::map<VxdID, TH2F*> m_h_matched_cluster; 
    std::map<VxdID, TH1F*> m_h_p; 
    std::map<VxdID, TH1F*> m_h_pt; 
    std::map<VxdID, TH1F*> m_h_su; 
    std::map<VxdID, TH1F*> m_h_sv; 
    std::map<VxdID, TH1F*> m_h_p2; 
    std::map<VxdID, TH1F*> m_h_pt2; 
    std::map<VxdID, TH1F*> m_h_su2; 
    std::map<VxdID, TH1F*> m_h_sv2; 
 
  };
}