Logo ROOT  
Reference Guide
TTreeReader.h
Go to the documentation of this file.
1 // @(#)root/tree:$Id$
2 // Author: Axel Naumann, 2010-08-02
3 
4 /*************************************************************************
5  * Copyright (C) 1995-2013, 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  *************************************************************************/
11 
12 #ifndef ROOT_TTreeReader
13 #define ROOT_TTreeReader
14 
15 
16 ////////////////////////////////////////////////////////////////////////////
17 // //
18 // TTreeReader //
19 // //
20 // A simple interface for reading trees or chains. //
21 // //
22 // //
23 ////////////////////////////////////////////////////////////////////////////
24 
25 #include "TTree.h"
26 #include "TTreeReaderUtils.h"
27 #include "TNotifyLink.h"
28 
29 #include <deque>
30 #include <iterator>
31 #include <unordered_map>
32 #include <string>
33 
34 class TDictionary;
35 class TDirectory;
36 class TFileCollection;
37 
38 namespace ROOT {
39 namespace Internal {
40  class TBranchProxyDirector;
41 }
42 }
43 
44 class TTreeReader: public TObject {
45 public:
46 
47  ///\class TTreeReader::Iterator_t
48  /// Iterate through the entries of a TTree.
49  ///
50  /// This iterator drives the associated TTreeReader; its
51  /// dereferencing (and actually even the iteration) will
52  /// set the entry number represented by this iterator.
53  /// It does not really represent a data element; it simply
54  /// returns the entry number (or -1 once the end of the tree
55  /// is reached).
56  class Iterator_t:
57  public std::iterator<std::input_iterator_tag, const Long64_t, Long64_t> {
58  private:
59  Long64_t fEntry; ///< Entry number of the tree referenced by this iterator; -1 is invalid.
60  TTreeReader* fReader; ///< The reader we select the entries on.
61 
62  /// Whether the iterator points to a valid entry.
63  bool IsValid() const { return fEntry >= 0; }
64 
65  public:
66  /// Default-initialize the iterator as "past the end".
67  Iterator_t(): fEntry(-1), fReader() {}
68 
69  /// Initialize the iterator with the reader it steers and a
70  /// tree entry number; -1 is invalid.
71  Iterator_t(TTreeReader& reader, Long64_t entry):
72  fEntry(entry), fReader(&reader) {}
73 
74  /// Compare two iterators for equality.
75  bool operator==(const Iterator_t& lhs) const {
76  // From C++14: value initialized (past-end) it compare equal.
77  if (!IsValid() && !lhs.IsValid()) return true;
78  return fEntry == lhs.fEntry && fReader == lhs.fReader;
79  }
80 
81  /// Compare two iterators for inequality.
82  bool operator!=(const Iterator_t& lhs) const {
83  return !(*this == lhs);
84  }
85 
86  /// Increment the iterator (postfix i++).
88  Iterator_t ret = *this;
89  this->operator++();
90  return ret;
91  }
92 
93  /// Increment the iterator (prefix ++i).
95  if (IsValid()) {
96  ++fEntry;
97  // Force validity check of new fEntry.
98  this->operator*();
99  // Don't set the old entry: op* will if needed, and
100  // in most cases it just adds a lot of spinning back
101  // and forth: in most cases teh sequence is ++i; *i.
102  }
103  return *this;
104  }
105 
106  /// Set the entry number in the reader and return it.
107  const Long64_t& operator*() {
108  if (IsValid()) {
109  // If we cannot access that entry, mark the iterator invalid.
110  if (fReader->SetEntry(fEntry) != kEntryValid) {
111  fEntry = -1;
112  }
113  }
114  // There really is no data in this iterator; return the number.
115  return fEntry;
116  }
117 
118  const Long64_t& operator*() const {
119  return **const_cast<Iterator_t*>(this);
120  }
121  };
122 
124 
126  kEntryValid = 0, ///< data read okay
127  kEntryNotLoaded, ///< no entry has been loaded yet
128  kEntryNoTree, ///< the tree does not exist
129  kEntryNotFound, ///< the tree entry number does not exist
130  kEntryChainSetupError, ///< problem in accessing a chain element, e.g. file without the tree
131  kEntryChainFileError, ///< problem in opening a chain's file
132  kEntryDictionaryError, ///< problem reading dictionary info from tree
133  kEntryBeyondEnd, ///< last entry loop has reached its end
134  kEntryBadReader, ///< One of the readers was not successfully initialized.
135  kEntryUnknownError ///< LoadTree return less than -4, likely a 'newer' error code.
136  };
137 
139  kNoTree = 0, ///< default state, no TTree is connected (formerly 'Zombie' state)
140  kLoadTreeNone, ///< Notify has not been called yet.
141  kInternalLoadTree, ///< Notify/LoadTree was last called from SetEntryBase
142  kExternalLoadTree ///< User code called LoadTree directly.
143  };
144 
145  static constexpr const char * const fgEntryStatusText[kEntryBeyondEnd + 1] = {
146  "valid entry",
147  "the tree does not exist",
148  "the tree entry number does not exist",
149  "cannot access chain element",
150  "problem in opening a chain's file",
151  "problem reading dictionary info from tree",
152  "last entry loop has reached its end"
153  };
154 
155  TTreeReader();
156 
157  TTreeReader(TTree* tree, TEntryList* entryList = nullptr);
158  TTreeReader(const char* keyname, TDirectory* dir, TEntryList* entryList = nullptr);
159  TTreeReader(const char *keyname, TEntryList *entryList = nullptr) : TTreeReader(keyname, nullptr, entryList) {}
160 
161  ~TTreeReader();
162 
163  void SetTree(TTree* tree, TEntryList* entryList = nullptr);
164  void SetTree(const char* keyname, TEntryList* entryList = nullptr) {
165  SetTree(keyname, nullptr, entryList);
166  }
167  void SetTree(const char* keyname, TDirectory* dir, TEntryList* entryList = nullptr);
168 
169  Bool_t IsChain() const { return TestBit(kBitIsChain); }
170 
171  Bool_t IsInvalid() const { return fLoadTreeStatus == kNoTree; }
172 
173  TTree* GetTree() const { return fTree; }
174  TEntryList* GetEntryList() const { return fEntryList; }
175 
176  ///\{ \name Entry setters
177 
178  /// Move to the next entry (or index of the TEntryList if that is set).
179  ///
180  /// \return false if the previous entry was already the last entry. This allows
181  /// the function to be used in `while (reader.Next()) { ... }`
183  return SetEntry(GetCurrentEntry() + 1) == kEntryValid;
184  }
185 
186  /// Set the next entry (or index of the TEntryList if that is set).
187  ///
188  /// \param entry If not TEntryList is set, the entry is a global entry (i.e.
189  /// not the entry number local to the chain's current tree).
190  /// \returns the `entry`'s read status, i.e. whether the entry is available.
191  EEntryStatus SetEntry(Long64_t entry) { return SetEntryBase(entry, kFALSE); }
192 
193  /// Set the next local tree entry. If a TEntryList is set, this function is
194  /// equivalent to `SetEntry()`.
195  ///
196  /// \param entry Entry number of the TChain's current TTree. This is the
197  /// entry number passed for instance by `TSelector::Process(entry)`, i.e.
198  /// within `TSelector::Process()` always use `SetLocalEntry()` and not
199  /// `SetEntry()`!
200  /// \return the `entry`'s read status, i.e. whether the entry is available.
202 
203  /// Set the begin and end entry numbers
204  ///
205  /// \param beginEntry The first entry that `Next()` will load.
206  /// \param endEntry The entry that `Next()` will return `kFALSE` on (i.e. not
207  /// load anymore).
208  EEntryStatus SetEntriesRange(Long64_t beginEntry, Long64_t endEntry);
209 
210  /// Get the begin and end entry numbers
211  ///
212  /// \return a pair contained the begin and end entry numbers.
213  std::pair<Long64_t, Long64_t> GetEntriesRange() const { return std::make_pair(fBeginEntry, fEndEntry); }
214 
215  /// Restart a Next() loop from entry 0 (of TEntryList index 0 of fEntryList is set).
216  void Restart();
217 
218  ///\}
219 
221 
222  Long64_t GetEntries() const;
223  Long64_t GetEntries(Bool_t force);
224 
225  /// Returns the index of the current entry being read.
226  ///
227  /// If `IsChain()`, the returned index corresponds to the global entry number
228  /// (i.e. not the entry number local to the chain's current tree).
229  /// If `fEntryList`, the returned index corresponds to an index in the
230  /// TEntryList; to translate to the TChain's / TTree's entry number pass it
231  /// through `reader.GetEntryList()->GetEntry(reader.GetCurrentEntry())`.
232  Long64_t GetCurrentEntry() const { return fEntry; }
233 
234  Bool_t Notify();
235 
236  /// Return an iterator to the 0th TTree entry.
238  return Iterator_t(*this, 0);
239  }
240  /// Return an iterator beyond the last TTree entry.
241  Iterator_t end() const { return Iterator_t(); }
242 
243 protected:
244  using NamedProxies_t = std::unordered_map<std::string, std::unique_ptr<ROOT::Internal::TNamedBranchProxy>>;
245  void Initialize();
246  ROOT::Internal::TNamedBranchProxy* FindProxy(const char* branchname) const
247  {
248  const auto proxyIt = fProxies.find(branchname);
249  return fProxies.end() != proxyIt ? proxyIt->second.get() : nullptr;
250  }
251 
253  {
254  auto bpName = p->GetName();
255 #ifndef NDEBUG
256  if (fProxies.end() != fProxies.find(bpName)) {
257  std::string err = "A proxy with key " + std::string(bpName) + " was already stored!";
258  throw std::runtime_error(err);
259  }
260 #endif
261 
262  fProxies[bpName].reset(p);
263  }
264 
267 
269 
270  Bool_t SetProxies();
271 
272 private:
273 
274  std::string GetProxyKey(const char *branchname)
275  {
276  std::string key(branchname);
277  //key += reinterpret_cast<std::uintptr_t>(fTree);
278  return key;
279  }
280 
281  enum EStatusBits {
282  kBitIsChain = BIT(14), ///< our tree is a chain
283  kBitHaveWarnedAboutEntryListAttachedToTTree = BIT(15), ///< the tree had a TEntryList and we have warned about that
284  kBitSetEntryBaseCallingLoadTree = BIT(16) ///< SetEntryBase is in the process of calling TChain/TTree::LoadTree.
285  };
286 
287  TTree* fTree = nullptr; ///< tree that's read
288  TEntryList* fEntryList = nullptr; ///< entry list to be used
289  EEntryStatus fEntryStatus = kEntryNotLoaded; ///< status of most recent read request
290  ELoadTreeStatus fLoadTreeStatus = kNoTree; ///< Indicator on how LoadTree was called 'last' time.
291  TNotifyLink<TTreeReader> fNotify; // Callback object used by the TChain to update this proxy
292  ROOT::Internal::TBranchProxyDirector* fDirector = nullptr; ///< proxying director, owned
293  std::deque<ROOT::Internal::TFriendProxy*> fFriendProxies; ///< proxying for friend TTrees, owned
294  std::deque<ROOT::Internal::TTreeReaderValueBase*> fValues; ///< readers that use our director
295  NamedProxies_t fProxies; ///< attached ROOT::TNamedBranchProxies; owned
296 
297  Long64_t fEntry = -1; ///< Current (non-local) entry of fTree or of fEntryList if set.
298 
299  /// The end of the entry loop. When set (i.e. >= 0), it provides a way
300  /// to stop looping over the TTree when we reach a certain entry: Next()
301  /// returns kFALSE when GetCurrentEntry() reaches fEndEntry.
303  Long64_t fBeginEntry = 0LL; ///< This allows us to propagate the range to the TTreeCache
304  Bool_t fProxiesSet = kFALSE; ///< True if the proxies have been set, false otherwise
305  Bool_t fSetEntryBaseCallingLoadTree = kFALSE; ///< True if during the LoadTree execution triggered by SetEntryBase.
306 
309 
310  ClassDef(TTreeReader, 0); // A simple interface to read trees
311 };
312 
313 #endif // defined TTreeReader
TTreeReader::Iterator_t::operator==
bool operator==(const Iterator_t &lhs) const
Compare two iterators for equality.
Definition: TTreeReader.h:75
TTreeReader::SetTree
void SetTree(const char *keyname, TEntryList *entryList=nullptr)
Definition: TTreeReader.h:164
ROOT::Internal::TBranchProxyDirector
Definition: TBranchProxyDirector.h:35
TTreeReader::SetTree
void SetTree(TTree *tree, TEntryList *entryList=nullptr)
Set (or update) the which tree to read from.
Definition: TTreeReader.cxx:628
TTreeReader::FindProxy
ROOT::Internal::TNamedBranchProxy * FindProxy(const char *branchname) const
Definition: TTreeReader.h:246
TTreeReader::GetCurrentEntry
Long64_t GetCurrentEntry() const
Returns the index of the current entry being read.
Definition: TTreeReader.h:232
kTRUE
const Bool_t kTRUE
Definition: RtypesCore.h:91
TObject::TestBit
R__ALWAYS_INLINE Bool_t TestBit(UInt_t f) const
Definition: TObject.h:172
TTreeReader::fNotify
TNotifyLink< TTreeReader > fNotify
Definition: TTreeReader.h:291
TTreeReader::fSetEntryBaseCallingLoadTree
Bool_t fSetEntryBaseCallingLoadTree
True if during the LoadTree execution triggered by SetEntryBase.
Definition: TTreeReader.h:305
TTreeReader::kNoTree
@ kNoTree
default state, no TTree is connected (formerly 'Zombie' state)
Definition: TTreeReader.h:139
TTreeReader::NamedProxies_t
std::unordered_map< std::string, std::unique_ptr< ROOT::Internal::TNamedBranchProxy > > NamedProxies_t
Definition: TTreeReader.h:244
tree
Definition: tree.py:1
TTreeReader::SetProxies
Bool_t SetProxies()
Tell readers we now have a tree.
Definition: TTreeReader.cxx:352
TTreeReader::kEntryValid
@ kEntryValid
data read okay
Definition: TTreeReader.h:126
TTreeReader::RegisterValueReader
Bool_t RegisterValueReader(ROOT::Internal::TTreeReaderValueBase *reader)
Add a value reader for this tree.
Definition: TTreeReader.cxx:670
TTreeReader::kExternalLoadTree
@ kExternalLoadTree
User code called LoadTree directly.
Definition: TTreeReader.h:142
Long64_t
long long Long64_t
Definition: RtypesCore.h:73
TTreeReader::kBitSetEntryBaseCallingLoadTree
@ kBitSetEntryBaseCallingLoadTree
SetEntryBase is in the process of calling TChain/TTree::LoadTree.
Definition: TTreeReader.h:284
TTree
Definition: TTree.h:79
TTreeReader::fValues
std::deque< ROOT::Internal::TTreeReaderValueBase * > fValues
readers that use our director
Definition: TTreeReader.h:294
ROOT::Internal::TNamedBranchProxy::GetName
const char * GetName() const
Definition: TTreeReaderUtils.h:54
TTreeReader::GetEntriesRange
std::pair< Long64_t, Long64_t > GetEntriesRange() const
Get the begin and end entry numbers.
Definition: TTreeReader.h:213
ROOT::Internal::TTreeReaderArrayBase
Definition: TTreeReaderArray.h:41
TTreeReader::kLoadTreeNone
@ kLoadTreeNone
Notify has not been called yet.
Definition: TTreeReader.h:140
TTreeReader::GetProxyKey
std::string GetProxyKey(const char *branchname)
Definition: TTreeReader.h:274
TTreeReader::SetEntryBase
EEntryStatus SetEntryBase(Long64_t entry, Bool_t local)
Load an entry into the tree, return the status of the read.
Definition: TTreeReader.cxx:507
TTreeReader::Iterator_t::operator!=
bool operator!=(const Iterator_t &lhs) const
Compare two iterators for inequality.
Definition: TTreeReader.h:82
TTreeReader::fLoadTreeStatus
ELoadTreeStatus fLoadTreeStatus
Indicator on how LoadTree was called 'last' time.
Definition: TTreeReader.h:290
TTreeReader::fEntryList
TEntryList * fEntryList
entry list to be used
Definition: TTreeReader.h:288
TTree.h
Bool_t
bool Bool_t
Definition: RtypesCore.h:63
TTreeReader::Iterator_t::fEntry
Long64_t fEntry
Entry number of the tree referenced by this iterator; -1 is invalid.
Definition: TTreeReader.h:59
TTreeReader::end
Iterator_t end() const
Return an iterator beyond the last TTree entry.
Definition: TTreeReader.h:241
TTreeReader::Iterator_t::Iterator_t
Iterator_t()
Default-initialize the iterator as "past the end".
Definition: TTreeReader.h:67
bool
TTreeReader::fDirector
ROOT::Internal::TBranchProxyDirector * fDirector
proxying director, owned
Definition: TTreeReader.h:292
TTreeReader::Iterator_t
Definition: TTreeReader.h:56
TTreeReader::fEntryStatus
EEntryStatus fEntryStatus
status of most recent read request
Definition: TTreeReader.h:289
TTreeReader::fEndEntry
Long64_t fEndEntry
The end of the entry loop.
Definition: TTreeReader.h:302
TTreeReader::IsInvalid
Bool_t IsInvalid() const
Definition: TTreeReader.h:171
TTreeReader::Iterator_t::operator++
Iterator_t operator++(int)
Increment the iterator (postfix i++).
Definition: TTreeReader.h:87
TTreeReader::SetEntry
EEntryStatus SetEntry(Long64_t entry)
Set the next entry (or index of the TEntryList if that is set).
Definition: TTreeReader.h:191
TTreeReaderUtils.h
TTreeReader::begin
Iterator_t begin()
Return an iterator to the 0th TTree entry.
Definition: TTreeReader.h:237
TTreeReader::GetTree
TTree * GetTree() const
Definition: TTreeReader.h:173
TTreeReader::kEntryBadReader
@ kEntryBadReader
One of the readers was not successfully initialized.
Definition: TTreeReader.h:134
TTreeReader::Notify
Bool_t Notify()
Callback from TChain and TTree's LoadTree.
Definition: TTreeReader.cxx:306
TTreeReader::Iterator_t::IsValid
bool IsValid() const
Whether the iterator points to a valid entry.
Definition: TTreeReader.h:63
TTreeReader::EEntryStatus
EEntryStatus
Definition: TTreeReader.h:125
TTreeReader::~TTreeReader
~TTreeReader()
Tell all value readers that the tree reader does not exist anymore.
Definition: TTreeReader.cxx:245
kFALSE
const Bool_t kFALSE
Definition: RtypesCore.h:92
TTreeReader::kEntryUnknownError
@ kEntryUnknownError
LoadTree return less than -4, likely a 'newer' error code.
Definition: TTreeReader.h:135
TTreeReader
A simple, robust and fast interface to read values from ROOT columnar datasets such as TTree,...
Definition: TTreeReader.h:44
TTreeReader::fTree
TTree * fTree
tree that's read
Definition: TTreeReader.h:287
TTreeReader::GetEntries
Long64_t GetEntries() const
Returns the number of entries of the TEntryList if one is provided, else of the TTree / TChain,...
Definition: TTreeReader.cxx:466
BIT
#define BIT(n)
Definition: Rtypes.h:85
TTreeReader::DeregisterValueReader
void DeregisterValueReader(ROOT::Internal::TTreeReaderValueBase *reader)
Remove a value reader for this tree.
Definition: TTreeReader.cxx:685
TTreeReader::Iterator_t::operator*
const Long64_t & operator*()
Set the entry number in the reader and return it.
Definition: TTreeReader.h:107
TTreeReader::SetEntriesRange
EEntryStatus SetEntriesRange(Long64_t beginEntry, Long64_t endEntry)
Set the begin and end entry numbers.
Definition: TTreeReader.cxx:411
TTreeReader::GetEntryStatus
EEntryStatus GetEntryStatus() const
Definition: TTreeReader.h:220
TTreeReader::iterator
Iterator_t iterator
Definition: TTreeReader.h:123
TTreeReader::fBeginEntry
Long64_t fBeginEntry
This allows us to propagate the range to the TTreeCache.
Definition: TTreeReader.h:303
TTreeReader::fProxies
NamedProxies_t fProxies
attached ROOT::TNamedBranchProxies; owned
Definition: TTreeReader.h:295
TTreeReader::GetEntryList
TEntryList * GetEntryList() const
Definition: TTreeReader.h:174
TTreeReader::kEntryNotFound
@ kEntryNotFound
the tree entry number does not exist
Definition: TTreeReader.h:129
TTreeReader::TTreeReader
TTreeReader()
Default constructor. Call SetTree to connect to a TTree.
Definition: TTreeReader.cxx:190
TTreeReader::kBitIsChain
@ kBitIsChain
our tree is a chain
Definition: TTreeReader.h:282
TDictionary
Definition: TDictionary.h:162
TTreeReader::Iterator_t::operator++
Iterator_t & operator++()
Increment the iterator (prefix ++i).
Definition: TTreeReader.h:94
TTreeReader::fEntry
Long64_t fEntry
Current (non-local) entry of fTree or of fEntryList if set.
Definition: TTreeReader.h:297
TTreeReader::Iterator_t::operator*
const Long64_t & operator*() const
Definition: TTreeReader.h:118
TEntryList
Definition: TEntryList.h:25
TTreeReader::fProxiesSet
Bool_t fProxiesSet
True if the proxies have been set, false otherwise.
Definition: TTreeReader.h:304
TTreeReader::AddProxy
void AddProxy(ROOT::Internal::TNamedBranchProxy *p)
Definition: TTreeReader.h:252
TTreeReader::Restart
void Restart()
Restart a Next() loop from entry 0 (of TEntryList index 0 of fEntryList is set).
Definition: TTreeReader.cxx:448
TTreeReader::Iterator_t::Iterator_t
Iterator_t(TTreeReader &reader, Long64_t entry)
Initialize the iterator with the reader it steers and a tree entry number; -1 is invalid.
Definition: TTreeReader.h:71
TTreeReader::kEntryDictionaryError
@ kEntryDictionaryError
problem reading dictionary info from tree
Definition: TTreeReader.h:132
TTreeReader::SetLocalEntry
EEntryStatus SetLocalEntry(Long64_t entry)
Set the next local tree entry.
Definition: TTreeReader.h:201
TTreeReader::kBitHaveWarnedAboutEntryListAttachedToTTree
@ kBitHaveWarnedAboutEntryListAttachedToTTree
the tree had a TEntryList and we have warned about that
Definition: TTreeReader.h:283
TTreeReader::fFriendProxies
std::deque< ROOT::Internal::TFriendProxy * > fFriendProxies
proxying for friend TTrees, owned
Definition: TTreeReader.h:293
TObject
Definition: TObject.h:37
TTreeReader::Iterator_t::fReader
TTreeReader * fReader
The reader we select the entries on.
Definition: TTreeReader.h:60
ClassDef
#define ClassDef(name, id)
Definition: Rtypes.h:325
TTreeReader::kInternalLoadTree
@ kInternalLoadTree
Notify/LoadTree was last called from SetEntryBase.
Definition: TTreeReader.h:141
TDirectory
Definition: TDirectory.h:40
TTreeReader::kEntryBeyondEnd
@ kEntryBeyondEnd
last entry loop has reached its end
Definition: TTreeReader.h:133
TTreeReader::kEntryNotLoaded
@ kEntryNotLoaded
no entry has been loaded yet
Definition: TTreeReader.h:127
ROOT::Internal::TTreeReaderValueBase
Definition: TTreeReaderValue.h:44
ROOT::Internal::TNamedBranchProxy
Definition: TTreeReaderUtils.h:43
TTreeReader::Next
Bool_t Next()
Move to the next entry (or index of the TEntryList if that is set).
Definition: TTreeReader.h:182
TTreeReader::kEntryNoTree
@ kEntryNoTree
the tree does not exist
Definition: TTreeReader.h:128
TTreeReader::Initialize
void Initialize()
Initialization of the director.
Definition: TTreeReader.cxx:269
TTreeReader::kEntryChainFileError
@ kEntryChainFileError
problem in opening a chain's file
Definition: TTreeReader.h:131
TTreeReader::kEntryChainSetupError
@ kEntryChainSetupError
problem in accessing a chain element, e.g. file without the tree
Definition: TTreeReader.h:130
TTreeReader::IsChain
Bool_t IsChain() const
Definition: TTreeReader.h:169
ROOT
VSD Structures.
Definition: StringConv.hxx:21
TTreeReader::ELoadTreeStatus
ELoadTreeStatus
Definition: TTreeReader.h:138
TObject::EStatusBits
EStatusBits
Definition: TObject.h:57
TTreeReader::TTreeReader
TTreeReader(const char *keyname, TEntryList *entryList=nullptr)
Definition: TTreeReader.h:159
TFileCollection
Definition: TFileCollection.h:39
TTreeReader::fgEntryStatusText
static constexpr const char *const fgEntryStatusText[kEntryBeyondEnd+1]
Definition: TTreeReader.h:145