Belle II Software development
PXDDQMEfficiencySelftrackModule.h
1/**************************************************************************
2 * basf2 (Belle II Analysis Software Framework) *
3 * Author: The Belle II Collaboration *
4 * *
5 * See git log for contributors and copyright holders. *
6 * This file is licensed under LGPL-3.0, see LICENSE.md. *
7 **************************************************************************/
8
9#pragma once
10
11#include <framework/core/HistoModule.h>
12#include <framework/datastore/StoreArray.h>
13
14#include <vxd/geometry/GeoCache.h>
15
16#include "TH1F.h"
17#include "TH2F.h"
18
19namespace Belle2 {
24 class PXDCluster;
25 class RecoTrack;
26 class ROIid;
27
38
39 public:
40
45
46 private:
47
51 void event() override final;
52
56 void beginRun() override final;
57
61 void initialize() override final;
62
66 void defineHisto() override final;
67
68
69
70 private:
72 /* returns the space point in local coordinates where the track hits the sensor:
73 sensorInfo: info of the sensor under investigation
74 aTrack: the track to be tested
75 isgood: flag which is false if some error occurred (do not use the point if false)
76 du and dv are the uncertainties in u and v on the sensor plane of the fit (local coordinates)
77 */
78 ROOT::Math::XYZVector getTrackInterSec(const VXD::SensorInfoBase& pxdSensorInfo, const RecoTrack& aTrack, bool& isgood, double& du,
79 double& dv);
81 int findClosestCluster(const VxdID& vxdid, ROOT::Math::XYZVector intersection);
83 bool isCloseToBorder(int u, int v, int checkDistance);
85 bool isDeadPixelClose(int u, int v, int checkDistance, const VxdID& moduleID);
86
89
98
101
104
105 std::string m_pxdClustersName;
106 std::string m_tracksName;
107 std::string m_ROIsName;
108
111
115
116 double m_distcut;
117 double m_uFactor;
118 double m_vFactor;
119 double m_pcut;
120 double m_momCut;
121 double m_pTCut;
122 unsigned int m_minSVDHits;
125 double m_d0Cut;
127
128 //Histograms to later determine efficiency
129 std::map<VxdID, TH2F*> m_h_track_hits;
130 std::map<VxdID, TH2F*> m_h_matched_cluster;
131 std::map<VxdID, TH1F*> m_h_p;
132 std::map<VxdID, TH1F*> m_h_pt;
133 std::map<VxdID, TH1F*> m_h_su;
134 std::map<VxdID, TH1F*> m_h_sv;
135 std::map<VxdID, TH1F*> m_h_p2;
136 std::map<VxdID, TH1F*> m_h_pt2;
137 std::map<VxdID, TH1F*> m_h_su2;
138 std::map<VxdID, TH1F*> m_h_sv2;
139
140 };
141
142}
HistoModule()
Constructor.
Definition HistoModule.h:32
The PXD Cluster class This class stores all information about reconstructed PXD clusters The position...
Definition PXDCluster.h:30
std::map< VxdID, TH1F * > m_h_su
histograms of su
void initialize() override final
initializes the need store arrays, trees and histograms
std::map< VxdID, TH2F * > m_h_track_hits
histograms of track hits
double m_d0Cut
cut abs(d0) in cm (large positive value eg 9999 disables)
bool isCloseToBorder(int u, int v, int checkDistance)
is it close to the border
std::map< VxdID, TH1F * > m_h_su2
histrograms of su2
double m_vFactor
factor for track-error on distcut comparison
unsigned int m_minSVDHits
Required hits in SVD strips for tracks.
StoreArray< PXDCluster > m_pxdclusters
store array of pxd clusters
bool m_verboseHistos
add some verbose histograms for cuts
std::map< VxdID, TH1F * > m_h_sv2
histrograms of sv2
int findClosestCluster(const VxdID &vxdid, ROOT::Math::XYZVector intersection)
find the closest cluster
PXDDQMEfficiencySelftrackModule()
Constructor: Sets the description, the properties and the parameters of the module.
void defineHisto() override final
actually defines the trees and histograms
ROOT::Math::XYZVector getTrackInterSec(const VXD::SensorInfoBase &pxdSensorInfo, const RecoTrack &aTrack, bool &isgood, double &du, double &dv)
helper functions to do some of the calculations
bool isDeadPixelClose(int u, int v, int checkDistance, const VxdID &moduleID)
is a dead pixel close
double m_z0maxCut
cut z0 maximum in cm (large positive value eg 9999 disables)
std::map< VxdID, TH1F * > m_h_pt2
histograms of pt2
bool m_requireROIs
Require tracks going through ROIs.
void event() override final
main function which fills trees and histograms
std::map< VxdID, TH1F * > m_h_sv
histograms of sv
std::string m_pxdClustersName
name of the store array of pxd clusters
std::string m_histogramDirectoryName
Where to save the histograms too.
double m_z0minCut
cut z0 minimum in cm (large negative value eg -9999 disables)
int m_maskedDistance
Distance inside which no dead pixel or module border is allowed.
std::string m_ROIsName
name of the store array of ROIs
std::map< VxdID, TH2F * > m_h_matched_cluster
histograms of matched clusters
std::map< VxdID, TH1F * > m_h_p2
histograms of p2
bool m_useAlignment
if true alignment will be used!
void beginRun() override final
begin run function which resets histograms
StoreArray< RecoTrack > m_tracks
store array of tracks
double m_uFactor
factor for track-error on distcut comparison
std::map< VxdID, TH1F * > m_h_p
histograms of momenta
std::map< VxdID, TH1F * > m_h_pt
histograms of transverse momenta
std::string m_tracksName
name of the store array of tracks
StoreArray< ROIid > m_ROIs
store array of ROIs
ROIid stores the U and V ids and the sensor id of the Region Of Interest.
Definition ROIid.h:25
This is the Reconstruction Event-Data Model Track.
Definition RecoTrack.h:79
Accessor to arrays stored in the data store.
Definition StoreArray.h:113
Class to facilitate easy access to sensor information of the VXD like coordinate transformations or p...
Definition GeoCache.h:38
Base class to provide Sensor Information for PXD and SVD.
Class to uniquely identify a any structure of the PXD and SVD.
Definition VxdID.h:32
Abstract base class for different kinds of events.