X-Git-Url: http://git.uio.no/git/?a=blobdiff_plain;f=ANALYSIS%2FAliAODPairBaseCut.cxx;h=0963581737f1aead7b30ca32c68285b68afec295;hb=5d9e7bd7be1af09bf3fec1682a99d8a81a923d34;hp=1a9cc037a769588e693341f95e906d539d571386;hpb=073745bc69a0383edb16368d82e3a9010d8110b3;p=u%2Fmrichter%2FAliRoot.git diff --git a/ANALYSIS/AliAODPairBaseCut.cxx b/ANALYSIS/AliAODPairBaseCut.cxx index 1a9cc037a76..0963581737f 100644 --- a/ANALYSIS/AliAODPairBaseCut.cxx +++ b/ANALYSIS/AliAODPairBaseCut.cxx @@ -1,3 +1,31 @@ +// Base class AliAODPairBaseCut: +// This class defines the range of some property - pure virtual +// Property is coded by AliAODCutTypes type +// Derived classes: +// AliAODQInvCut +// AliAODKtCut +// AliAODKStarCut +// AliAODKStarOutCut +// AliAODKStarSideCut +// AliAODKStarLongCut +// AliAODQSideLCMSCut +// AliAODQOutLCMSCut +// AliAODQLongLCMSCut +// AliAODDeltaECut +// AliAODDeltaPCut +// AliAODDeltaPvectorCut +// AliAODDeltaPhiCut +// AliAODDeltaThetaCut +// AliAODCluterOverlapCut +// AliAODAvSeparationCut +// AliAODSeparationCut +// AliAODITSSeparationCut +// AliAODOutSideSameSignCut +// AliAODOutSideDiffSignCut +// AliAODLogicalOperPairCut +// AliAODOrPairCut +// AliAODAndPairCut +// Author: Piotr.Skowronski@cern.ch #include "AliAODPairBaseCut.h" #include "AliTrackPoints.h" @@ -10,6 +38,11 @@ ClassImp(AliAODKtCut) ClassImp(AliAODQSideLCMSCut) ClassImp(AliAODQOutLCMSCut) ClassImp(AliAODQLongLCMSCut) +ClassImp(AliAODDeltaECut) +ClassImp(AliAODDeltaPCut) +ClassImp(AliAODDeltaPvectorCut) +ClassImp(AliAODDeltaPhiCut) +ClassImp(AliAODDeltaThetaCut) /******************************************************************/ ClassImp(AliAODAvSeparationCut) @@ -256,7 +289,19 @@ Bool_t AliAODAndPairCut::Rejected(AliAODPair * p) const //OR operation is a little bit misleading but is correct //User wants to build logical cuts with natural (positive) logic //while ALIAN use inernally reverse (returns true when rejected) - if (fFirst->Rejected(p) || fSecond->Rejected(p)) return kTRUE;//rejected (any of two rejected(returned kTRUE) ) + if (fFirst->Rejected(p)) + {//first rejected - we reject + return kTRUE; + } + else + {//first accepted + if (fSecond->Rejected(p)) + {//second rejected - we reject + return kTRUE; + } + } +// if (fFirst->Rejected(p) || fSecond->Rejected(p)) return kTRUE;//rejected (any of two rejected(returned kTRUE) ) + return kFALSE;//accepted (both accepted (returned kFALSE)) } /******************************************************************/