Logo ROOT  
Reference Guide
No Matches
Go to the documentation of this file.
1// @(#)root/tree:$Id$
2// Author: Rene Brun 12/01/96
5 * Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *
6 * All rights reserved. *
7 * *
8 * For the licensing terms see $ROOTSYS/LICENSE. *
9 * For the list of contributors see $ROOTSYS/README/CREDITS. *
10 *************************************************************************/
12#ifndef ROOT_TLeaf
13#define ROOT_TLeaf
17// //
18// TLeaf //
19// //
20// A TTree object is a list of TBranch. //
21// A TBranch object is a list of TLeaf. In most cases, the TBranch //
22// will have one TLeaf. //
23// A TLeaf describes the branch data types and holds the data. //
24// //
25// A few notes about the data held by the leaf. It can contain: //
26// 1 a single object or primitive (e.g., one float), //
27// 2 a fixed-number of objects (e.g., each entry has two floats). //
28// The number of elements per entry is saved in `fLen`. //
29// 3 a dynamic number of primitives. The number of objects in each //
30// entry is saved in the `fLeafCount` branch. //
31// //
32// Note options (2) and (3) can combined - if fLeafCount says an entry //
33// has 3 elements and fLen is 2, then there will be 6 objects in that //
34// entry. //
35// //
36// Additionally, `fNdata` is transient and generated on read to //
37// determine the necessary size of a buffer to hold event data; //
38// depending on the call-site, it may be sized larger than the number //
39// of elements //
40// //
44#include "TNamed.h"
46#include <vector>
49class TBranch;
51#include "TBranch.h"
54class TClonesArray;
55class TBrowser;
57class TLeaf : public TNamed {
61 virtual Int_t GetOffsetHeaderSize() const {return 0;}
65 using Counts_t = std::vector<Int_t>;
68 Long64_t fStartEntry{-1}; ///<! entry number of corresponding to element 0 of the vector.
69 };
71 Int_t fNdata; ///<! Number of elements in fAddress data buffer.
72 Int_t fLen; ///< Number of fixed length elements in the leaf's data.
73 Int_t fLenType; ///< Number of bytes for this data type
74 Int_t fOffset; ///< Offset in ClonesArray object (if one)
75 Bool_t fIsRange; ///< (=kTRUE if leaf has a range, kFALSE otherwise). This is equivalent to being a 'leafcount'. For a TLeafElement the range information is actually store in the TBranchElement.
76 Bool_t fIsUnsigned; ///< (=kTRUE if unsigned, kFALSE otherwise)
77 TLeaf *fLeafCount; ///< Pointer to Leaf count if variable length (we do not own the counter)
78 TBranch *fBranch; ///<! Pointer to supporting branch (we do not own the branch)
79 LeafCountValues *fLeafCountValues; ///<! Cache of collection/array sizes
81 TLeaf(const TLeaf&);
82 TLeaf& operator=(const TLeaf&);
84 template <typename T> struct GetValueHelper {
85 static T Exec(const TLeaf *leaf, Int_t i = 0) { return leaf->GetValue(i); }
86 };
88 Int_t *GenerateOffsetArrayBase(Int_t base, Int_t events) const; // For leaves containing fixed-size objects (no
89 // polymorphism!), this will generate an appropriate
90 // offset array.
95 kIndirectAddress = BIT(11), ///< Data member is a pointer to an array of basic types.
96 kNewValue = BIT(12) ///< Set if we own the value buffer and so must delete it ourselves.
97 };
99 enum class DeserializeType {
100 kInvalid = 0, // Invalid deserialization information.
101 kExternal, // Deserialization of this Leaf requires a separate output buffer, i.e. the on-disk and in-memory representation are likely to be different sizes.
102 kDestructive = kExternal, // For backward compatibility
103 kInPlace, // Deserialization can be done directly in the input buffer.
104 kZeroCopy, // In-memory and on-disk representation of this object are identical.
105 };
107 TLeaf();
108 TLeaf(TBranch *parent, const char *name, const char *type);
109 virtual ~TLeaf();
111 virtual void Browse(TBrowser *b);
112 virtual Bool_t CanGenerateOffsetArray() {return fLeafCount;} // overload and return true if this leaf can generate its own offset array.
113 virtual void Export(TClonesArray *, Int_t) {}
114 virtual void FillBasket(TBuffer &b);
115 virtual Int_t *GenerateOffsetArray(Int_t base, Int_t events) { return GenerateOffsetArrayBase(base, events); }
116 TBranch *GetBranch() const { return fBranch; }
118 virtual TString GetFullName() const;
119 /// If this leaf stores a variable-sized array or a multi-dimensional array whose last dimension has variable size,
120 /// return a pointer to the TLeaf that stores such size. Return a nullptr otherwise.
121 virtual TLeaf *GetLeafCount() const { return fLeafCount; }
122 virtual TLeaf *GetLeafCounter(Int_t &countval) const;
124 virtual const Counts_t *GetLeafCountValues(Long64_t start, Long64_t len);
126 virtual Int_t GetLen() const;
127 /// Return the fixed length of this leaf.
128 /// If the leaf stores a fixed-length array, this is the size of the array.
129 /// If the leaf stores a non-array or a variable-sized array, this method returns 1.
130 /// If the leaf stores an array with 2 or more dimensions, this method returns the total number of elements in the
131 /// dimensions with static length: for example for float[3][2][] it would return 6.
132 virtual Int_t GetLenStatic() const { return fLen; }
133 virtual Int_t GetLenType() const { return fLenType; }
134 virtual Int_t GetMaximum() const { return 0; }
135 virtual Int_t GetMinimum() const { return 0; }
136 virtual Int_t GetNdata() const { return fNdata; }
137 virtual Int_t GetOffset() const { return fOffset; }
138 virtual void *GetValuePointer() const { return 0; }
139 virtual const char *GetTypeName() const { return ""; }
141 virtual Double_t GetValue(Int_t i = 0) const;
142 virtual Long64_t GetValueLong64(Int_t i = 0) const { return GetValue(i); } // overload only when it matters.
143 virtual LongDouble_t GetValueLongDouble(Int_t i = 0) const { return GetValue(i); } // overload only when it matters.
144 template <typename T> T GetTypedValue(Int_t i = 0) const { return GetValueHelper<T>::Exec(this, i); }
146 virtual Bool_t IncludeRange(TLeaf *) { return kFALSE; } // overload to copy/set fMinimum and fMaximum to include/be wide than those of the parameter
147 virtual void Import(TClonesArray *, Int_t) {}
148 virtual Bool_t IsOnTerminalBranch() const { return kTRUE; }
149 virtual Bool_t IsRange() const { return fIsRange; }
150 virtual Bool_t IsUnsigned() const { return fIsUnsigned; }
151 virtual void PrintValue(Int_t i = 0) const;
152 virtual void ReadBasket(TBuffer &) {}
154 virtual bool ReadBasketFast(TBuffer&, Long64_t) { return false; } // Read contents of leaf into a user-provided buffer.
155 virtual bool ReadBasketSerialized(TBuffer&, Long64_t) { return true; }
156 virtual void ReadValue(std::istream & /*s*/, Char_t /*delim*/ = ' ') {
157 Error("ReadValue", "Not implemented!");
158 }
159 Int_t ResetAddress(void *add, Bool_t calledFromDestructor = kFALSE);
160 virtual void SetAddress(void *add = 0);
161 virtual void SetBranch(TBranch *branch) { fBranch = branch; }
162 virtual void SetLeafCount(TLeaf *leaf);
163 virtual void SetLen(Int_t len = 1) { fLen = len; }
164 virtual void SetOffset(Int_t offset = 0) { fOffset = offset; }
165 virtual void SetRange(Bool_t range = kTRUE) { fIsRange = range; }
166 virtual void SetUnsigned() { fIsUnsigned = kTRUE; }
168 ClassDef(TLeaf, 2); // Leaf: description of a Branch data type
172template <> struct TLeaf::GetValueHelper<Long64_t> {
173 static Long64_t Exec(const TLeaf *leaf, Int_t i = 0) { return leaf->GetValueLong64(i); }
175template <> struct TLeaf::GetValueHelper<ULong64_t> {
176 static ULong64_t Exec(const TLeaf *leaf, Int_t i = 0) { return (ULong64_t)leaf->GetValueLong64(i); }
179 static LongDouble_t Exec(const TLeaf *leaf, Int_t i = 0) { return leaf->GetValueLongDouble(i); }
183inline Double_t TLeaf::GetValue(Int_t /*i = 0*/) const { return 0.0; }
184inline void TLeaf::PrintValue(Int_t /* i = 0*/) const {}
185inline void TLeaf::SetAddress(void* /* add = 0 */) {}
#define b(i)
Definition RSha256.hxx:100
int Int_t
Definition RtypesCore.h:45
char Char_t
Definition RtypesCore.h:37
const Bool_t kFALSE
Definition RtypesCore.h:92
bool Bool_t
Definition RtypesCore.h:63
double Double_t
Definition RtypesCore.h:59
long double LongDouble_t
Definition RtypesCore.h:61
long long Long64_t
Definition RtypesCore.h:73
unsigned long long ULong64_t
Definition RtypesCore.h:74
const Bool_t kTRUE
Definition RtypesCore.h:91
#define ClassDef(name, id)
Definition Rtypes.h:325
#define BIT(n)
Definition Rtypes.h:85
char name[80]
Definition TGX11.cxx:110
int type
Definition TGX11.cxx:121
A TTree is a list of TBranches.
Definition TBranch.h:89
Using a TBrowser one can browse all ROOT objects.
Definition TBrowser.h:37
Buffer base class used for serializing objects.
Definition TBuffer.h:43
An array of clone (identical) objects.
A TLeaf describes individual elements of a TBranch See TBranch structure in TTree.
Definition TLeaf.h:57
virtual Double_t GetValue(Int_t i=0) const
Definition TLeaf.h:183
virtual void * GetValuePointer() const
Definition TLeaf.h:138
virtual Bool_t IsRange() const
Definition TLeaf.h:149
Int_t fLenType
Number of bytes for this data type.
Definition TLeaf.h:73
virtual bool ReadBasketSerialized(TBuffer &, Long64_t)
Definition TLeaf.h:155
virtual void SetLen(Int_t len=1)
Definition TLeaf.h:163
virtual const Counts_t * GetLeafCountValues(Long64_t start, Long64_t len)
If this branch is a branch count, return the set of collection size for the entry range requested sta...
Definition TLeaf.cxx:364
virtual Bool_t IsOnTerminalBranch() const
Definition TLeaf.h:148
virtual Int_t GetLenType() const
Definition TLeaf.h:133
T GetTypedValue(Int_t i=0) const
Definition TLeaf.h:144
virtual void ReadValue(std::istream &, Char_t=' ')
Definition TLeaf.h:156
virtual Int_t GetMaximum() const
Definition TLeaf.h:134
virtual const char * GetTypeName() const
Definition TLeaf.h:139
virtual LongDouble_t GetValueLongDouble(Int_t i=0) const
Definition TLeaf.h:143
virtual void Browse(TBrowser *b)
Browse the content of this leaf.
Definition TLeaf.cxx:157
Int_t fLen
Number of fixed length elements in the leaf's data.
Definition TLeaf.h:72
Int_t fNdata
! Number of elements in fAddress data buffer.
Definition TLeaf.h:71
virtual Int_t GetLen() const
Return the number of effective elements of this leaf, for the current entry.
Definition TLeaf.cxx:404
virtual TLeaf * GetLeafCount() const
If this leaf stores a variable-sized array or a multi-dimensional array whose last dimension has vari...
Definition TLeaf.h:121
virtual Bool_t IncludeRange(TLeaf *)
Definition TLeaf.h:146
virtual void Export(TClonesArray *, Int_t)
Definition TLeaf.h:113
virtual DeserializeType GetDeserializeType() const
Definition TLeaf.h:117
virtual void ReadBasketExport(TBuffer &, TClonesArray *, Int_t)
Definition TLeaf.h:153
Bool_t fIsUnsigned
(=kTRUE if unsigned, kFALSE otherwise)
Definition TLeaf.h:76
virtual ~TLeaf()
Definition TLeaf.cxx:140
TLeaf & operator=(const TLeaf &)
Assignment operator.
Definition TLeaf.cxx:117
virtual void SetAddress(void *add=0)
Definition TLeaf.h:185
virtual TLeaf * GetLeafCounter(Int_t &countval) const
Return a pointer to the counter of this leaf (if any) or store the number of elements that the leaf c...
Definition TLeaf.cxx:249
Definition TLeaf.h:99
virtual Long64_t GetValueLong64(Int_t i=0) const
Definition TLeaf.h:142
virtual void SetRange(Bool_t range=kTRUE)
Definition TLeaf.h:165
Int_t * GenerateOffsetArrayBase(Int_t base, Int_t events) const
If the class supports it, generate an offset array base.
Definition TLeaf.cxx:188
virtual Int_t GetNdata() const
Definition TLeaf.h:136
virtual void FillBasket(TBuffer &b)
Pack leaf elements in Basket output buffer.
Definition TLeaf.cxx:180
Definition TLeaf.cxx:55
TBranch * GetBranch() const
Definition TLeaf.h:116
virtual void SetOffset(Int_t offset=0)
Definition TLeaf.h:164
Int_t fOffset
Offset in ClonesArray object (if one)
Definition TLeaf.h:74
virtual bool ReadBasketFast(TBuffer &, Long64_t)
Definition TLeaf.h:154
virtual Int_t GetOffsetHeaderSize() const
Definition TLeaf.h:61
virtual Int_t GetMinimum() const
Definition TLeaf.h:135
Int_t ResetAddress(void *add, Bool_t calledFromDestructor=kFALSE)
Helper routine for TLeafX::SetAddress.
Definition TLeaf.cxx:429
TBranch * fBranch
! Pointer to supporting branch (we do not own the branch)
Definition TLeaf.h:78
TLeaf * fLeafCount
Pointer to Leaf count if variable length (we do not own the counter)
Definition TLeaf.h:77
virtual void SetBranch(TBranch *branch)
Definition TLeaf.h:161
Bool_t fIsRange
(=kTRUE if leaf has a range, kFALSE otherwise). This is equivalent to being a 'leafcount'....
Definition TLeaf.h:75
Definition TLeaf.h:94
@ kNewValue
Set if we own the value buffer and so must delete it ourselves.
Definition TLeaf.h:96
@ kIndirectAddress
Data member is a pointer to an array of basic types.
Definition TLeaf.h:95
virtual void SetLeafCount(TLeaf *leaf)
Set the leaf count of this leaf.
Definition TLeaf.cxx:465
virtual void SetUnsigned()
Definition TLeaf.h:166
virtual TString GetFullName() const
Return the full name (including the parent's branch names) of the leaf.
Definition TLeaf.cxx:224
virtual Int_t GetLenStatic() const
Return the fixed length of this leaf.
Definition TLeaf.h:132
virtual Bool_t CanGenerateOffsetArray()
Definition TLeaf.h:112
virtual Int_t GetOffset() const
Definition TLeaf.h:137
virtual Bool_t IsUnsigned() const
Definition TLeaf.h:150
virtual void ReadBasket(TBuffer &)
Definition TLeaf.h:152
LeafCountValues * fLeafCountValues
! Cache of collection/array sizes
Definition TLeaf.h:79
virtual Int_t * GenerateOffsetArray(Int_t base, Int_t events)
Definition TLeaf.h:115
std::vector< Int_t > Counts_t
Definition TLeaf.h:65
virtual void Import(TClonesArray *, Int_t)
Definition TLeaf.h:147
virtual void PrintValue(Int_t i=0) const
Definition TLeaf.h:184
The TNamed class is the base class for all named ROOT classes.
Definition TNamed.h:29
virtual void Error(const char *method, const char *msgfmt,...) const
Issue error message.
Definition TObject.cxx:893
Basic string class.
Definition TString.h:136
static Long64_t Exec(const TLeaf *leaf, Int_t i=0)
Definition TLeaf.h:173
static LongDouble_t Exec(const TLeaf *leaf, Int_t i=0)
Definition TLeaf.h:179
static ULong64_t Exec(const TLeaf *leaf, Int_t i=0)
Definition TLeaf.h:176
static T Exec(const TLeaf *leaf, Int_t i=0)
Definition TLeaf.h:85
Long64_t fStartEntry
! entry number of corresponding to element 0 of the vector.
Definition TLeaf.h:68