fFilterMap(0),
fTPCClusterMap(),
fTPCSharedMap(),
+ fTPCnclsF(0),
fID(-999),
fCharge(-99),
fType(kUndef),
fFilterMap(selectInfo),
fTPCClusterMap(),
fTPCSharedMap(),
+ fTPCnclsF(0),
fID(id),
fCharge(charge),
fType(ttype),
fFilterMap(selectInfo),
fTPCClusterMap(),
fTPCSharedMap(),
+ fTPCnclsF(0),
fID(id),
fCharge(charge),
fType(ttype),
fFilterMap(trk.fFilterMap),
fTPCClusterMap(trk.fTPCClusterMap),
fTPCSharedMap(trk.fTPCSharedMap),
+ fTPCnclsF(trk.fTPCnclsF),
fID(trk.fID),
fCharge(trk.fCharge),
fType(trk.fType),
// Returns the most probable PID array element.
Int_t nPID = 10;
- if (fPID) {
- AODTrkPID_t loc = kUnknown;
- Double_t max = 0.;
- Bool_t allTheSame = kTRUE;
-
- for (Int_t iPID = 0; iPID < nPID; iPID++) {
- if (fPID[iPID] >= max) {
- if (fPID[iPID] > max) {
- allTheSame = kFALSE;
- max = fPID[iPID];
- loc = (AODTrkPID_t)iPID;
- } else {
- allTheSame = kTRUE;
- }
+ AODTrkPID_t loc = kUnknown;
+ Double_t max = 0.;
+ Bool_t allTheSame = kTRUE;
+
+ for (Int_t iPID = 0; iPID < nPID; iPID++) {
+ if (fPID[iPID] >= max) {
+ if (fPID[iPID] > max) {
+ allTheSame = kFALSE;
+ max = fPID[iPID];
+ loc = (AODTrkPID_t)iPID;
+ } else {
+ allTheSame = kTRUE;
}
}
-
- return allTheSame ? kUnknown : loc;
- } else {
- return kUnknown;
}
+ return allTheSame ? kUnknown : loc;
}
//______________________________________________________________________________