PXDDQMEfficiencyModule.h

/**************************************************************************
 * basf2 (Belle II Analysis Software Framework)                           *
 * Author: The Belle II Collaboration                                     *
 *                                                                        *
 * See git log for contributors and copyright holders.                    *
 * This file is licensed under LGPL-3.0, see LICENSE.md.                  *
 **************************************************************************/
 
 
#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 <tracking/dataobjects/PXDIntercept.h>
 
#include "TH1F.h"
#include "TH1D.h"
#include "TH2F.h"
#include <Math/Vector3D.h>
 
 
namespace Belle2 {
  class PXDDQMEfficiencyModule : public HistoModule {
 
  public:
 
    PXDDQMEfficiencyModule();
 
  private:
 
    void event() override final;
 
    void beginRun() override final;
 
    void initialize() override final;
 
    void defineHisto() override final;
 
 
 
  private:
    /* helper functions to do some of the calculations*/
    int findClosestCluster(const VxdID& vxdid, ROOT::Math::XYZVector 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; 
    std::string m_PXDInterceptListName; 
    int m_u_bins; 
    int m_v_bins; 
 
    StoreArray<PXDCluster> m_pxdclusters; 
    StoreArray<RecoTrack> m_tracks; 
    StoreArray<ROIid> m_ROIs; 
    StoreArray<PXDIntercept> m_intercepts; 
 
    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; 
 
    std::map<VxdID, int> revLUT; 
 
    //Histograms to later determine efficiency and crosscheck
    TH1D* m_h_combined{}; 
    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; 
 
  };
}