|
| 1 | +// Copyright 2019-2020 CERN and copyright holders of ALICE O2. |
| 2 | +// See https://alice-o2.web.cern.ch/copyright for details of the copyright holders. |
| 3 | +// All rights not expressly granted are reserved. |
| 4 | +// |
| 5 | +// This software is distributed under the terms of the GNU General Public |
| 6 | +// License v3 (GPL Version 3), copied verbatim in the file "COPYING". |
| 7 | +// |
| 8 | +// In applying this license CERN does not waive the privileges and immunities |
| 9 | +// granted to it by virtue of its status as an Intergovernmental Organization |
| 10 | +// or submit itself to any jurisdiction. |
| 11 | + |
| 12 | +// |
| 13 | +// Class for track selection |
| 14 | +// |
| 15 | + |
| 16 | +#ifndef PWGEM_DILEPTON_CORE_EMTRACKCUT_H_ |
| 17 | +#define PWGEM_DILEPTON_CORE_EMTRACKCUT_H_ |
| 18 | + |
| 19 | +// #include "PWGEM/Dilepton/Utils/EMTrackUtilities.h" |
| 20 | + |
| 21 | +#include "CommonConstants/PhysicsConstants.h" |
| 22 | +#include "Framework/DataTypes.h" |
| 23 | +#include "Framework/Logger.h" |
| 24 | + |
| 25 | +#include "Math/Vector4D.h" |
| 26 | +#include "TNamed.h" |
| 27 | + |
| 28 | +#include <algorithm> |
| 29 | +#include <set> |
| 30 | +#include <string> |
| 31 | +#include <utility> |
| 32 | +#include <vector> |
| 33 | + |
| 34 | +// using namespace o2::aod::pwgem::dilepton::utils::emtrackutil; |
| 35 | + |
| 36 | +class EMTrackCut : public TNamed |
| 37 | +{ |
| 38 | + public: |
| 39 | + EMTrackCut() = default; |
| 40 | + EMTrackCut(const char* name, const char* title) : TNamed(name, title) {} |
| 41 | + ~EMTrackCut() {} |
| 42 | + |
| 43 | + enum class EMTrackCuts : int { |
| 44 | + // track cut |
| 45 | + kTrackPtRange, |
| 46 | + kTrackEtaRange, |
| 47 | + kTrackPhiRange, |
| 48 | + kTPCNCls, |
| 49 | + kTPCCrossedRows, |
| 50 | + kTPCCrossedRowsOverNCls, |
| 51 | + kTPCFracSharedClusters, |
| 52 | + kTPCChi2NDF, |
| 53 | + kDCAxy, |
| 54 | + kDCAz, |
| 55 | + kITSNCls, |
| 56 | + kITSChi2NDF, |
| 57 | + kNCuts |
| 58 | + }; |
| 59 | + |
| 60 | + template <typename TTrack> |
| 61 | + bool IsSelected(TTrack const& track) const |
| 62 | + { |
| 63 | + if (!track.hasITS() || !track.hasTPC()) { |
| 64 | + return false; |
| 65 | + } |
| 66 | + |
| 67 | + if (!IsSelectedTrack(track, EMTrackCuts::kTrackPtRange)) { |
| 68 | + return false; |
| 69 | + } |
| 70 | + if (!IsSelectedTrack(track, EMTrackCuts::kTrackEtaRange)) { |
| 71 | + return false; |
| 72 | + } |
| 73 | + |
| 74 | + if (!IsSelectedTrack(track, EMTrackCuts::kTrackPhiRange)) { |
| 75 | + return false; |
| 76 | + } |
| 77 | + if (!IsSelectedTrack(track, EMTrackCuts::kDCAxy)) { |
| 78 | + return false; |
| 79 | + } |
| 80 | + if (!IsSelectedTrack(track, EMTrackCuts::kDCAz)) { |
| 81 | + return false; |
| 82 | + } |
| 83 | + |
| 84 | + // ITS cuts |
| 85 | + if (!IsSelectedTrack(track, EMTrackCuts::kITSNCls)) { |
| 86 | + return false; |
| 87 | + } |
| 88 | + if (!IsSelectedTrack(track, EMTrackCuts::kITSChi2NDF)) { |
| 89 | + return false; |
| 90 | + } |
| 91 | + |
| 92 | + if (mRequireITSibAny) { |
| 93 | + auto hits_ib = std::count_if(its_ib_any_Requirement.second.begin(), its_ib_any_Requirement.second.end(), [&](auto&& requiredLayer) { return track.itsClusterMap() & (1 << requiredLayer); }); |
| 94 | + if (hits_ib < its_ib_any_Requirement.first) { |
| 95 | + return false; |
| 96 | + } |
| 97 | + } |
| 98 | + |
| 99 | + if (mRequireITSib1st) { |
| 100 | + auto hits_ib = std::count_if(its_ib_1st_Requirement.second.begin(), its_ib_1st_Requirement.second.end(), [&](auto&& requiredLayer) { return track.itsClusterMap() & (1 << requiredLayer); }); |
| 101 | + if (hits_ib < its_ib_1st_Requirement.first) { |
| 102 | + return false; |
| 103 | + } |
| 104 | + } |
| 105 | + |
| 106 | + // TPC cuts |
| 107 | + if (!IsSelectedTrack(track, EMTrackCuts::kTPCNCls)) { |
| 108 | + return false; |
| 109 | + } |
| 110 | + if (!IsSelectedTrack(track, EMTrackCuts::kTPCCrossedRows)) { |
| 111 | + return false; |
| 112 | + } |
| 113 | + if (!IsSelectedTrack(track, EMTrackCuts::kTPCCrossedRowsOverNCls)) { |
| 114 | + return false; |
| 115 | + } |
| 116 | + if (!IsSelectedTrack(track, EMTrackCuts::kTPCFracSharedClusters)) { |
| 117 | + return false; |
| 118 | + } |
| 119 | + if (!IsSelectedTrack(track, EMTrackCuts::kTPCChi2NDF)) { |
| 120 | + return false; |
| 121 | + } |
| 122 | + |
| 123 | + return true; |
| 124 | + } |
| 125 | + |
| 126 | + template <typename T> |
| 127 | + bool IsSelectedTrack(T const& track, const EMTrackCuts& cut) const |
| 128 | + { |
| 129 | + switch (cut) { |
| 130 | + case EMTrackCuts::kTrackPtRange: |
| 131 | + return track.pt() > mMinTrackPt && track.pt() < mMaxTrackPt; |
| 132 | + |
| 133 | + case EMTrackCuts::kTrackEtaRange: |
| 134 | + return track.eta() > mMinTrackEta && track.eta() < mMaxTrackEta; |
| 135 | + |
| 136 | + case EMTrackCuts::kTrackPhiRange: |
| 137 | + return track.phi() > mMinTrackPhi && track.phi() < mMaxTrackPhi; |
| 138 | + |
| 139 | + case EMTrackCuts::kTPCNCls: |
| 140 | + return track.tpcNClsFound() >= mMinNClustersTPC; |
| 141 | + |
| 142 | + case EMTrackCuts::kTPCCrossedRows: |
| 143 | + return track.tpcNClsCrossedRows() >= mMinNCrossedRowsTPC; |
| 144 | + |
| 145 | + case EMTrackCuts::kTPCCrossedRowsOverNCls: |
| 146 | + return track.tpcCrossedRowsOverFindableCls() > mMinNCrossedRowsOverFindableClustersTPC; |
| 147 | + |
| 148 | + case EMTrackCuts::kTPCFracSharedClusters: |
| 149 | + return track.tpcFractionSharedCls() < mMaxFracSharedClustersTPC; |
| 150 | + |
| 151 | + case EMTrackCuts::kTPCChi2NDF: |
| 152 | + return mMinChi2PerClusterTPC < track.tpcChi2NCl() && track.tpcChi2NCl() < mMaxChi2PerClusterTPC; |
| 153 | + |
| 154 | + case EMTrackCuts::kDCAxy: |
| 155 | + return std::fabs(track.dcaXY()) < ((mMaxDcaXYPtDep) ? mMaxDcaXYPtDep(track.pt()) : mMaxDcaXY); |
| 156 | + |
| 157 | + case EMTrackCuts::kDCAz: |
| 158 | + return std::fabs(track.dcaZ()) < mMaxDcaZ; |
| 159 | + |
| 160 | + case EMTrackCuts::kITSNCls: |
| 161 | + return mMinNClustersITS <= track.itsNCls() && track.itsNCls() <= mMaxNClustersITS; |
| 162 | + |
| 163 | + case EMTrackCuts::kITSChi2NDF: |
| 164 | + return mMinChi2PerClusterITS < track.itsChi2NCl() && track.itsChi2NCl() < mMaxChi2PerClusterITS; |
| 165 | + |
| 166 | + default: |
| 167 | + return false; |
| 168 | + } |
| 169 | + } |
| 170 | + |
| 171 | + // Setters |
| 172 | + void SetTrackPtRange(float minPt = 0.f, float maxPt = 1e10f); |
| 173 | + void SetTrackEtaRange(float minEta = -1e10f, float maxEta = 1e10f); |
| 174 | + void SetTrackPhiRange(float minPhi = 0.f, float maxPhi = 6.3f); |
| 175 | + void SetMinNClustersTPC(int minNClustersTPC); |
| 176 | + void SetMinNCrossedRowsTPC(int minNCrossedRowsTPC); |
| 177 | + void SetMinNCrossedRowsOverFindableClustersTPC(float minNCrossedRowsOverFindableClustersTPC); |
| 178 | + void SetMaxFracSharedClustersTPC(float max); |
| 179 | + void SetChi2PerClusterTPC(float min, float max); |
| 180 | + void SetNClustersITS(int min, int max); |
| 181 | + void SetChi2PerClusterITS(float min, float max); |
| 182 | + |
| 183 | + void SetTrackDca3DRange(float min, float max); // in sigma |
| 184 | + void SetTrackMaxDcaXY(float maxDcaXY); // in cm |
| 185 | + void SetTrackMaxDcaZ(float maxDcaZ); // in cm |
| 186 | + void SetTrackMaxDcaXYPtDep(std::function<float(float)> ptDepCut); |
| 187 | + void RequireITSibAny(bool flag); |
| 188 | + void RequireITSib1st(bool flag); |
| 189 | + |
| 190 | + private: |
| 191 | + static const std::pair<int8_t, std::set<uint8_t>> its_ib_any_Requirement; |
| 192 | + static const std::pair<int8_t, std::set<uint8_t>> its_ib_1st_Requirement; |
| 193 | + |
| 194 | + // kinematic cuts |
| 195 | + float mMinTrackPt{0.f}, mMaxTrackPt{1e10f}; // range in pT |
| 196 | + float mMinTrackEta{-1e10f}, mMaxTrackEta{1e10f}; // range in eta |
| 197 | + float mMinTrackPhi{0.f}, mMaxTrackPhi{6.3}; // range in phi |
| 198 | + |
| 199 | + // track quality cuts |
| 200 | + int mMinNClustersTPC{0}; // min number of TPC clusters |
| 201 | + int mMinNCrossedRowsTPC{0}; // min number of crossed rows in TPC |
| 202 | + float mMinChi2PerClusterTPC{0.f}, mMaxChi2PerClusterTPC{1e10f}; // max tpc fit chi2 per TPC cluster |
| 203 | + float mMinNCrossedRowsOverFindableClustersTPC{0.f}; // min ratio crossed rows / findable clusters |
| 204 | + float mMaxFracSharedClustersTPC{999.f}; // max ratio shared clusters / clusters in TPC |
| 205 | + int mMinNClustersITS{0}, mMaxNClustersITS{7}; // range in number of ITS clusters |
| 206 | + float mMinChi2PerClusterITS{0.f}, mMaxChi2PerClusterITS{1e10f}; // max its fit chi2 per ITS cluster |
| 207 | + bool mRequireITSibAny{true}; |
| 208 | + bool mRequireITSib1st{false}; |
| 209 | + |
| 210 | + float mMaxDcaXY{1.0f}; // max dca in xy plane |
| 211 | + float mMaxDcaZ{1.0f}; // max dca in z direction |
| 212 | + std::function<float(float)> mMaxDcaXYPtDep{}; // max dca in xy plane as function of pT |
| 213 | + |
| 214 | + ClassDef(EMTrackCut, 1); |
| 215 | +}; |
| 216 | + |
| 217 | +#endif // PWGEM_DILEPTON_CORE_EMTRACKCUT_H_ |
0 commit comments