KaliVeda  1.13/01
Heavy-Ion Analysis Toolkit
KVPartitionFromLeaf.cpp
Go to the documentation of this file.
1 //Created by KVClassFactory on Fri May 7 11:30:10 2010
2 //Author: bonnet
3 
4 #include "KVPartitionFromLeaf.h"
5 #include "TMath.h"
6 
8 
9 
10 
11 
12 
16 {
17  // Default constructor
18  linked_leaf = 0;
19  zmin = -1;
20  zmax = -1;
21  select_min = kFALSE;
22  select_max = kFALSE;
23 
24 }
25 
26 
27 
30 
32 {
33  // Destructor
34 }
35 
36 
37 
39 
41 {
42 
43  linked_leaf = lf;
44  Int_t cmax;
45  (lf->GetLeafCount() ? cmax = lf->GetLeafCount()->GetMaximum() : cmax = lf->GetNdata());
46 
47 }
48 
49 
50 
52 
54 {
55 
56  Clear();
57  if (entry != -1) linked_leaf->GetBranch()->GetEntry(entry);
58 
59  Int_t mult;
61 
62  for (Int_t mm = 0; mm < mult; mm += 1) {
64  if ((!select_min || (select_min && val >= zmin)) && (!select_max || (select_max && val <= zmax))) {
65  Add(val);
66  }
67  }
69 
70 }
71 
72 
73 
75 
77 {
78 
79  zmin = val;
80  select_min = ((zmin == -1) ? kFALSE : kTRUE);
81 
82 }
83 
84 
86 
88 {
89 
90  zmax = val;
91  select_max = ((zmax == -1) ? kFALSE : kTRUE);
92 
93 }
94 
95 
97 
99 {
100 
101  SetZmin(vmin);
102  SetZmax(vmax);
103 
104 }
105 
106 
int Int_t
ClassImp(KVPartitionList) void KVPartitionList
Initialisation.
const Bool_t kFALSE
const Bool_t kTRUE
void Add(TArrayI *tab)
void Fill(Double_t* tab,Int_t mult);
Derived form KVPartition to optimize filling from a tree.
void ReadEntry(Long64_t entry=-1)
virtual ~KVPartitionFromLeaf()
Destructor.
void SetZminZmax(Int_t vmin, Int_t vmax)
void ConnectToLeaf(TLeaf *lf)
void Clear(Option_t *option="")
Methode dérivée de KVIntegerList, Reinitialisation de l'object.
Definition: KVPartition.cpp:70
virtual Int_t GetEntry(Long64_t entry=0, Int_t getall=0)
virtual Double_t GetValue(Int_t i=0) const
virtual Int_t GetMaximum() const
TBranch * GetBranch() const
virtual TLeaf * GetLeafCount() const
virtual Int_t GetNdata() const
long long Long64_t
const long double mm
Definition: KVUnits.h:69
Int_t Nint(T x)