| 26 |
|
void SetPFCandidatesName(const char *n) { fPFCandidatesName = n; } |
| 27 |
|
void SetPFPileUpName(const char *n) { fPFPileUpName = n; } |
| 28 |
|
void SetPFNoPileUpName(const char *n) { fPFNoPileUpName = n; } |
| 29 |
+ |
void SetAllVertexName(const char *n) { fAllVertexName = n; } |
| 30 |
|
void SetVertexName(const char *n) { fVertexName = n; } |
| 31 |
|
void SetCheckClosestZVertex(Bool_t b) { fCheckClosestZVertex = b;} |
| 32 |
+ |
void SetUseAllVerteces(Bool_t b) { fUseAllVertices = b; } |
| 33 |
|
|
| 34 |
|
protected: |
| 35 |
|
void Process(); |
| 38 |
|
TString fPFCandidatesName; //name of PF collection (input) |
| 39 |
|
TString fPFPileUpName; //name of exported PFPileUp collection (output) |
| 40 |
|
TString fPFNoPileUpName; //name of exported PFNoPileUp collection (output) |
| 41 |
< |
TString fVertexName; //name of vertex collection |
| 41 |
> |
TString fAllVertexName; //name of all vertex collection |
| 42 |
> |
TString fVertexName; //name of good vertex collection |
| 43 |
|
const PFCandidateCol *fPFCandidates; //!pfcandidate branch |
| 44 |
< |
const VertexCol *fVertices; //!vertices branches |
| 44 |
> |
const VertexCol *fAllVertices; //!all vertices branches |
| 45 |
> |
const VertexCol *fVertices; //!good vertices branches |
| 46 |
|
Bool_t fCheckClosestZVertex; //boolean to use the closest vertex approach |
| 47 |
+ |
Bool_t fUseAllVertices; //boolean to use all vertices |
| 48 |
|
|
| 49 |
< |
ClassDef(SeparatePileUpMod, 1) // Tau identification module |
| 49 |
> |
ClassDef(SeparatePileUpMod, 1) // PFNoPU identification module |
| 50 |
|
}; |
| 51 |
|
} |
| 52 |
|
#endif |
