Heavy ion Analysis Libriares
|
#include <Cut.h>
Public Member Functions | |
Cut (const Int_t size=1, ECutUpdate update=ECutUpdate::kNo, TString groupFlag="") | |
Cut (const Cut &cut) | |
Cut & | operator= (const Cut &other) |
void | SetLabel (Int_t label) |
void | Finish () |
void | Reset () |
void | SetMinAndMax (Double_t val, Int_t i=0) |
void | SetMinMax (Double_t min, Double_t max, Int_t i=0) |
TString | GetGroupFlag () const |
ECutUpdate | GetUpdateRatio () const |
Cut ** | MultiClone (Int_t no, Bool_t increment_collections=kFALSE) |
void | SetMinimum (Double_t min, Int_t i=0) |
void | SetMaximum (Double_t max, Int_t i=0) |
void | SetValue (Double_t val, Int_t i=0) |
void | SetUnitName (TString name, Int_t i=0) |
void | SetCollectionID (Int_t i) |
Int_t | GetCutSize () const |
Int_t | GetCollectionID () const |
Bool_t | HasPassed () const |
Bool_t | IsCloned () const |
Double_t | GetMin (Int_t i=0) const |
Double_t | GetMax (Int_t i=0) const |
Double_t | GetValue (Int_t i=0) const |
Double_t | GetWeight () |
ULong64_t | GetPassed () const |
ULong64_t | GetTotal () const |
ULong64_t | GetFailed () const |
TString | GetUnit (Int_t i) const |
virtual Cut * | MakeCopy () const |
virtual Package * | Report () const |
virtual void | Print (Option_t *option="") const |
TObjArray * | Split (Int_t n, Int_t i=0, Double_t shift=0) const |
virtual Bool_t | Init (Int_t=0) |
virtual TString | CutName (Option_t *opt="") const |
virtual std::vector< std::pair< TString, Double_t > > | GetBinLabels (Int_t par=0) const |
Protected Member Functions | |
Bool_t | Validate () |
Bool_t | AntiValidate () |
Bool_t | ValidateAbs () |
Bool_t | ForcedUpdate (Bool_t state) |
Bool_t | FormatEquals (TString format, Int_t format_id, EFormatDepth depth=EFormatDepth::kAll) const |
Bool_t | FormatInhertis (TString format, Int_t format_id, EFormatDepth depth=EFormatDepth::kAll) const |
Bool_t | InLimits (Int_t par) const |
Bool_t | OutLimits (Int_t par) const |
Protected Attributes | |
const Int_t | fCutSize |
Bool_t | fInit |
Int_t | fIsCloned |
Int_t | fState |
Int_t | fCollectionID |
Int_t | fLabel |
const ECutUpdate | fUpdateRatio |
Double_t | fWeight |
const TString | fGroupFlag |
Friends | |
class | EventComplexCut |
class | EventImaginaryCut |
class | EventRealCut |
class | TrackComplexCut |
class | TrackImaginaryCut |
class | TrackRealCut |
class | TwoTrackComplexCut |
class | TwoTrackImaginaryCut |
class | TwoTrackRealCut |
Hal::Cut::Cut | ( | const Int_t | size = 1, |
ECutUpdate | update = ECutUpdate::kNo, | ||
TString | groupFlag = "" ) |
Hal::Cut::Cut | ( | const Cut & | cut | ) |
|
protected |
|
virtual |
opt | additional option, if you add this cut directly then not used, however if you create pure real /imaginary cut then you can get obtain complex cut name by set option "re" or "im" |
Reimplemented in Hal::EventBinningCut, Hal::EventComplexCut, Hal::EventImaginaryCut, Hal::EventRealCut, Hal::TrackComplexCut, Hal::TrackImaginaryCut, Hal::TrackRealCut, Hal::TwoTrackComplexCut, Hal::TwoTrackImaginaryCut, and Hal::TwoTrackRealCut.
|
protected |
|
protected |
|
protected |
|
virtual |
optional function used to set names of bin in non-standard histograms, labels are set to report histogram.
paremeter | number |
Reimplemented in Hal::PdgBinPairCut.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inlinevirtual |
initialize object
format_id | id of format used in current task |
Reimplemented in Hal::EventBinningCut, Hal::EventComplexCut, Hal::EventExpCut, Hal::EventImaginaryCut, Hal::EventImpactCentralityCut, Hal::EventMcCut, Hal::EventMultiChargedCut, Hal::EventPtMaxCut, Hal::EventRealCut, Hal::EventRunCut, Hal::EventVertexCut, Hal::PairDeltaQinvCut, Hal::TrackBasicToFCut, Hal::TrackBoostedDeltaPCut, Hal::TrackBoostedKinematcisCut, Hal::TrackComplexCut, Hal::TrackDCACut, Hal::TrackDCAPipeCut, Hal::TrackDeltaMomentumCut, Hal::TrackEtaAbsCut, Hal::TrackExpCut, Hal::TrackImaginaryCut, Hal::TrackMCCut, Hal::TrackMtCut, Hal::TrackNullCut, Hal::TrackPhiCut, Hal::TrackRealCut, Hal::TrackToFMass2Cut, Hal::TrackTpcCut, Hal::TrackTpcHitCut, Hal::TrackTpcToFCut, Hal::TrackV0MinvCut, Hal::TrackYAssumedCut, Hal::TwoTrack3DCFCut, Hal::TwoTrackComplexCut, Hal::TwoTrackDphistarDetaCut, Hal::TwoTrackFemtoPRFCut, Hal::TwoTrackImaginaryCut, Hal::TwoTrackRadialDistanceCut, Hal::TwoTrackRealCut, Hal::TwoTrackSailorCowboyCut, MyHal::EventCutTemplate, MyHal::TrackCutTemplate, and MyHal::TwoTrackCutTemplate.
|
protected |
|
inline |
|
inlinevirtual |
copy of this cut, can be implemented by CutDef macro (if cut don't have dynamically allocated objects or have copy ctor
Reimplemented in Hal::EventBinningCut, and Hal::TwoTrack3DCFCut.
Cut ** Hal::Cut::MultiClone | ( | Int_t | no, |
Bool_t | increment_collections = kFALSE ) |
|
inlineprotected |
|
virtual |
print information about this cut
Reimplemented in Hal::EventBinningCut, and Hal::EventRunCut.
|
virtual |
Reimplemented in Hal::EventBinningCut, Hal::EventComplexCut, Hal::EventCut, Hal::EventImaginaryCut, Hal::EventModuloCut, Hal::EventMultiChargedCut, Hal::EventRealCut, Hal::EventRunCut, Hal::EventVertexXYZCut, Hal::TrackComplexCut, Hal::TrackCut, Hal::TrackImaginaryCut, Hal::TrackMtCut, Hal::TrackRealCut, Hal::TrackToFMass2Cut, Hal::TrackTpcCut, Hal::TrackTpcToFCut, Hal::TrackYAssumedCut, Hal::TwoTrack3DCFCut, Hal::TwoTrackComplexCut, Hal::TwoTrackCut, Hal::TwoTrackDeltaEtaCut, Hal::TwoTrackDphistarDetaCut, Hal::TwoTrackFemtoQinvCut, Hal::TwoTrackImaginaryCut, Hal::TwoTrackRealCut, Hal::TwoTrackSailorCowboyCut, MyHal::EventCutTemplate, MyHal::TrackCutTemplate, and MyHal::TwoTrackCutTemplate.
|
inline |
|
inline |
|
inline |
void Hal::Cut::SetMinAndMax | ( | Double_t | val, |
Int_t | i = 0 ) |
|
inline |
void Hal::Cut::SetMinMax | ( | Double_t | min, |
Double_t | max, | ||
Int_t | i = 0 ) |
|
inline |
|
inline |
TObjArray * Hal::Cut::Split | ( | Int_t | n, |
Int_t | i = 0, | ||
Double_t | shift = 0 ) const |
create many cuts with acceptations of this_cut/n. For example if we have "AB" cut with A:<-10;10> and B<0;5> AB->Split(2,0) create two cuts: (A<-10;0> B<0;5>) and (A<0;10> B<0;5>) whereas AB->Split(2,1) creates (A<-10;10> B<0,2.5>) and (A<-10;10> B<2.5;5>);
n | number of cuts |
i | paramter of cut that will be used for splitiing |
shift | shift parameter - used if you want to avoid "overlapping of cuts. This shifts boundary of cuts. If shift is positive then lower boundary is increased, if shift is negative then upper boundary is decreased. For example if cuts is <0,10> Split(2,0,-1) makes cuts <0.4> <5,10>) Split(2,0,0.5) makes <0,5> <5.5,10> |
|
protected |
|
protected |
|
friend |
|
friend |
|
friend |
|
friend |
|
friend |
|
friend |
|
friend |
|
friend |
|
friend |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |