/usr/include/root/TTree.h is in libroot-tree-dev 5.34.19+dfsg-1.2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 | // @(#)root/tree:$Id$
// Author: Rene Brun 12/01/96
/*************************************************************************
* Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *
* All rights reserved. *
* *
* For the licensing terms see $ROOTSYS/LICENSE. *
* For the list of contributors see $ROOTSYS/README/CREDITS. *
*************************************************************************/
#ifndef ROOT_TTree
#define ROOT_TTree
//////////////////////////////////////////////////////////////////////////
// //
// TTree //
// //
// A TTree object is a list of TBranch. //
// To Create a TTree object one must: //
// - Create the TTree header via the TTree constructor //
// - Call the TBranch constructor for every branch. //
// //
// To Fill this object, use member function Fill with no parameters. //
// The Fill function loops on all defined TBranch. //
// //
//////////////////////////////////////////////////////////////////////////
#ifndef ROOT_TBranch
#include "TBranch.h"
#endif
#ifndef ROOT_TObjArray
#include "TObjArray.h"
#endif
#ifndef ROOT_TAttLine
#include "TAttLine.h"
#endif
#ifndef ROOT_TAttFill
#include "TAttFill.h"
#endif
#ifndef ROOT_TAttMarker
#include "TAttMarker.h"
#endif
#ifndef ROOT_TArrayD
#include "TArrayD.h"
#endif
#ifndef ROOT_TArrayI
#include "TArrayI.h"
#endif
#ifndef ROOT_TDataType
#include "TDataType.h"
#endif
#ifndef ROOT_TClass
#include "TClass.h"
#endif
#ifndef ROOT_TVirtualTreePlayer
#include "TVirtualTreePlayer.h"
#endif
class TBranch;
class TBrowser;
class TFile;
class TDirectory;
class TLeaf;
class TH1;
class TTreeFormula;
class TPolyMarker;
class TEventList;
class TEntryList;
class TList;
class TSQLResult;
class TSelector;
class TPrincipal;
class TFriendElement;
class TCut;
class TVirtualIndex;
class TBranchRef;
class TBasket;
class TStreamerInfo;
class TTreeCloner;
class TFileMergeInfo;
class TTree : public TNamed, public TAttLine, public TAttFill, public TAttMarker {
protected:
Long64_t fEntries; // Number of entries
Long64_t fTotBytes; // Total number of bytes in all branches before compression
Long64_t fZipBytes; // Total number of bytes in all branches after compression
Long64_t fSavedBytes; // Number of autosaved bytes
Long64_t fFlushedBytes; // Number of autoflushed bytes
Double_t fWeight; // Tree weight (see TTree::SetWeight)
Int_t fTimerInterval; // Timer interval in milliseconds
Int_t fScanField; // Number of runs before prompting in Scan
Int_t fUpdate; // Update frequency for EntryLoop
Int_t fDefaultEntryOffsetLen; // Initial Length of fEntryOffset table in the basket buffers
Int_t fNClusterRange; // Number of Cluster range in addition to the one defined by 'AutoFlush'
Int_t fMaxClusterRange; //! Memory allocated for the cluster range.
Long64_t fMaxEntries; // Maximum number of entries in case of circular buffers
Long64_t fMaxEntryLoop; // Maximum number of entries to process
Long64_t fMaxVirtualSize; // Maximum total size of buffers kept in memory
Long64_t fAutoSave; // Autosave tree when fAutoSave bytes produced
Long64_t fAutoFlush; // Autoflush tree when fAutoFlush entries written
Long64_t fEstimate; // Number of entries to estimate histogram limits
Long64_t *fClusterRangeEnd; //[fNClusterRange] Last entry of a cluster range.
Long64_t *fClusterSize; //[fNClusterRange] Number of entries in each cluster for a given range.
Long64_t fCacheSize; //! Maximum size of file buffers
Long64_t fChainOffset; //! Offset of 1st entry of this Tree in a TChain
Long64_t fReadEntry; //! Number of the entry being processed
Long64_t fTotalBuffers; //! Total number of bytes in branch buffers
Int_t fPacketSize; //! Number of entries in one packet for parallel root
Int_t fNfill; //! Local for EntryLoop
Int_t fDebug; //! Debug level
Long64_t fDebugMin; //! First entry number to debug
Long64_t fDebugMax; //! Last entry number to debug
Int_t fMakeClass; //! not zero when processing code generated by MakeClass
Int_t fFileNumber; //! current file number (if file extensions)
TObject *fNotify; //! Object to be notified when loading a Tree
TDirectory *fDirectory; //! Pointer to directory holding this tree
TObjArray fBranches; // List of Branches
TObjArray fLeaves; // Direct pointers to individual branch leaves
TList *fAliases; // List of aliases for expressions based on the tree branches.
TEventList *fEventList; //! Pointer to event selection list (if one)
TEntryList *fEntryList; //! Pointer to event selection list (if one)
TArrayD fIndexValues; // Sorted index values
TArrayI fIndex; // Index of sorted values
TVirtualIndex *fTreeIndex; // Pointer to the tree Index (if any)
TList *fFriends; // pointer to list of friend elements
TList *fUserInfo; // pointer to a list of user objects associated to this Tree
TVirtualTreePlayer *fPlayer; //! Pointer to current Tree player
TList *fClones; //! List of cloned trees which share our addresses
TBranchRef *fBranchRef; // Branch supporting the TRefTable (if any)
UInt_t fFriendLockStatus; //! Record which method is locking the friend recursion
TBuffer *fTransientBuffer; //! Pointer to the current transient buffer.
static Int_t fgBranchStyle; // Old/New branch style
static Long64_t fgMaxTreeSize; // Maximum size of a file containg a Tree
private:
TTree(const TTree& tt); // not implemented
TTree& operator=(const TTree& tt); // not implemented
protected:
void AddClone(TTree*);
virtual void KeepCircular();
virtual TBranch *BranchImp(const char* branchname, const char* classname, TClass* ptrClass, void* addobj, Int_t bufsize, Int_t splitlevel);
virtual TBranch *BranchImp(const char* branchname, TClass* ptrClass, void* addobj, Int_t bufsize, Int_t splitlevel);
virtual TBranch *BranchImpRef(const char* branchname, const char* classname, TClass* ptrClass, void* addobj, Int_t bufsize, Int_t splitlevel);
virtual TBranch *BranchImpRef(const char* branchname, TClass* ptrClass, EDataType datatype, void* addobj, Int_t bufsize, Int_t splitlevel);
virtual Int_t CheckBranchAddressType(TBranch* branch, TClass* ptrClass, EDataType datatype, Bool_t ptr);
virtual TBranch *BronchExec(const char* name, const char* classname, void* addobj, Bool_t isptrptr, Int_t bufsize, Int_t splitlevel);
friend TBranch *TTreeBranchImpRef(TTree *tree, const char* branchname, TClass* ptrClass, EDataType datatype, void* addobj, Int_t bufsize, Int_t splitlevel);
Int_t SetBranchAddressImp(TBranch *branch, void* addr, TBranch** ptr);
virtual TLeaf *GetLeafImpl(const char* branchname, const char* leafname);
char GetNewlineValue(istream &inputStream);
void ImportClusterRanges(TTree *fromtree);
class TFriendLock {
// Helper class to prevent infinite recursion in the
// usage of TTree Friends. Implemented in TTree.cxx.
TTree *fTree; // Pointer to the locked tree
UInt_t fMethodBit; // BIT for the locked method
Bool_t fPrevious; // Previous value of the BIT.
protected:
TFriendLock(const TFriendLock&);
TFriendLock& operator=(const TFriendLock&);
public:
TFriendLock(TTree* tree, UInt_t methodbit);
~TFriendLock();
};
friend class TFriendLock;
// So that the index class can use TFriendLock:
friend class TTreeIndex;
friend class TChainIndex;
// So that the TTreeCloner can access the protected interfaces
friend class TTreeCloner;
// use to update fFriendLockStatus
enum ELockStatusBits {
kFindBranch = BIT(0),
kFindLeaf = BIT(1),
kGetAlias = BIT(2),
kGetBranch = BIT(3),
kGetEntry = BIT(4),
kGetEntryWithIndex = BIT(5),
kGetFriend = BIT(6),
kGetFriendAlias = BIT(7),
kGetLeaf = BIT(8),
kLoadTree = BIT(9),
kPrint = BIT(10),
kRemoveFriend = BIT(11),
kSetBranchStatus = BIT(12)
};
public:
// SetBranchAddress return values
enum ESetBranchAddressStatus {
kMissingBranch = -5,
kInternalError = -4,
kMissingCompiledCollectionProxy = -3,
kMismatch = -2,
kClassMismatch = -1,
kMatch = 0,
kMatchConversion = 1,
kMatchConversionCollection = 2,
kMakeClass = 3,
kVoidPtr = 4,
kNoCheck = 5
};
// TTree status bits
enum {
kForceRead = BIT(11),
kCircular = BIT(12)
};
// Split level modifier
enum {
kSplitCollectionOfPointers = 100
};
class TClusterIterator
{
private:
TTree *fTree; // TTree upon which we are iterating.
Int_t fClusterRange; // Which cluster range are we looking at.
Long64_t fStartEntry; // Where does the cluster start.
Long64_t fNextEntry; // Where does the cluster end (exclusive).
Long64_t GetEstimatedClusterSize();
protected:
friend class TTree;
TClusterIterator(TTree *tree, Long64_t firstEntry);
public:
// Intentionally used the default copy constructor and default destructor
// as the TClusterIterator does not own the TTree.
// TClusterIterator(const TClusterIterator&);
// ~TClusterIterator();
// No public constructors, the iterator must be
// created via TTree::GetClusterIterator
// Move on to the next cluster and return the starting entry
// of this next cluster
Long64_t Next();
// Return the start entry of the current cluster.
Long64_t GetStartEntry() {
return fStartEntry;
}
// Return the first entry of the next cluster.
Long64_t GetNextEntry() {
return fNextEntry;
}
Long64_t operator()() { return Next(); }
};
TTree();
TTree(const char* name, const char* title, Int_t splitlevel = 99);
virtual ~TTree();
virtual void AddBranchToCache(const char *bname, Bool_t subbranches = kFALSE);
virtual void AddBranchToCache(TBranch *branch, Bool_t subbranches = kFALSE);
virtual void DropBranchFromCache(const char *bname, Bool_t subbranches = kFALSE);
virtual void DropBranchFromCache(TBranch *branch, Bool_t subbranches = kFALSE);
virtual TFriendElement *AddFriend(const char* treename, const char* filename = "");
virtual TFriendElement *AddFriend(const char* treename, TFile* file);
virtual TFriendElement *AddFriend(TTree* tree, const char* alias = "", Bool_t warn = kFALSE);
virtual void AddTotBytes(Int_t tot) { fTotBytes += tot; }
virtual void AddZipBytes(Int_t zip) { fZipBytes += zip; }
virtual Long64_t AutoSave(Option_t* option = "");
virtual Int_t Branch(TCollection* list, Int_t bufsize = 32000, Int_t splitlevel = 99, const char* name = "");
virtual Int_t Branch(TList* list, Int_t bufsize = 32000, Int_t splitlevel = 99);
virtual Int_t Branch(const char* folder, Int_t bufsize = 32000, Int_t splitlevel = 99);
virtual TBranch *Branch(const char* name, void* address, const char* leaflist, Int_t bufsize = 32000);
TBranch *Branch(const char* name, char* address, const char* leaflist, Int_t bufsize = 32000)
{
// Overload to avoid confusion between this signature and the template instance.
return Branch(name,(void*)address,leaflist,bufsize);
}
TBranch *Branch(const char* name, Long_t address, const char* leaflist, Int_t bufsize = 32000)
{
// Overload to avoid confusion between this signature and the template instance.
return Branch(name,(void*)address,leaflist,bufsize);
}
TBranch *Branch(const char* name, int address, const char* leaflist, Int_t bufsize = 32000)
{
// Overload to avoid confusion between this signature and the template instance.
return Branch(name,(void*)(Long_t)address,leaflist,bufsize);
}
#if !defined(__CINT__)
virtual TBranch *Branch(const char* name, const char* classname, void* addobj, Int_t bufsize = 32000, Int_t splitlevel = 99);
#endif
template <class T> TBranch *Branch(const char* name, const char* classname, T* obj, Int_t bufsize = 32000, Int_t splitlevel = 99)
{
// See BranchImpRed for details. Here we __ignore
return BranchImpRef(name, classname, TBuffer::GetClass(typeid(T)), obj, bufsize, splitlevel);
}
template <class T> TBranch *Branch(const char* name, const char* classname, T** addobj, Int_t bufsize = 32000, Int_t splitlevel = 99)
{
// See BranchImp for details
return BranchImp(name, classname, TBuffer::GetClass(typeid(T)), addobj, bufsize, splitlevel);
}
template <class T> TBranch *Branch(const char* name, T** addobj, Int_t bufsize = 32000, Int_t splitlevel = 99)
{
// See BranchImp for details
return BranchImp(name, TBuffer::GetClass(typeid(T)), addobj, bufsize, splitlevel);
}
template <class T> TBranch *Branch(const char* name, T* obj, Int_t bufsize = 32000, Int_t splitlevel = 99)
{
// See BranchImp for details
return BranchImpRef(name, TBuffer::GetClass(typeid(T)), TDataType::GetType(typeid(T)), obj, bufsize, splitlevel);
}
virtual TBranch *Bronch(const char* name, const char* classname, void* addobj, Int_t bufsize = 32000, Int_t splitlevel = 99);
virtual TBranch *BranchOld(const char* name, const char* classname, void* addobj, Int_t bufsize = 32000, Int_t splitlevel = 1);
virtual TBranch *BranchRef();
virtual void Browse(TBrowser*);
virtual Int_t BuildIndex(const char* majorname, const char* minorname = "0");
TStreamerInfo *BuildStreamerInfo(TClass* cl, void* pointer = 0, Bool_t canOptimize = kTRUE);
virtual TFile *ChangeFile(TFile* file);
virtual TTree *CloneTree(Long64_t nentries = -1, Option_t* option = "");
virtual void CopyAddresses(TTree*,Bool_t undo = kFALSE);
virtual Long64_t CopyEntries(TTree* tree, Long64_t nentries = -1, Option_t *option = "");
virtual TTree *CopyTree(const char* selection, Option_t* option = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0);
virtual TBasket *CreateBasket(TBranch*);
virtual void DirectoryAutoAdd(TDirectory *);
Int_t Debug() const { return fDebug; }
virtual void Delete(Option_t* option = ""); // *MENU*
virtual void Draw(Option_t* opt) { Draw(opt, "", "", 1000000000, 0); }
virtual Long64_t Draw(const char* varexp, const TCut& selection, Option_t* option = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0);
virtual Long64_t Draw(const char* varexp, const char* selection, Option_t* option = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0); // *MENU*
virtual void DropBaskets();
virtual void DropBuffers(Int_t nbytes);
virtual Int_t Fill();
virtual TBranch *FindBranch(const char* name);
virtual TLeaf *FindLeaf(const char* name);
virtual Int_t Fit(const char* funcname, const char* varexp, const char* selection = "", Option_t* option = "", Option_t* goption = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0); // *MENU*
virtual Int_t FlushBaskets() const;
virtual const char *GetAlias(const char* aliasName) const;
virtual Long64_t GetAutoFlush() const {return fAutoFlush;}
virtual Long64_t GetAutoSave() const {return fAutoSave;}
virtual TBranch *GetBranch(const char* name);
virtual TBranchRef *GetBranchRef() const { return fBranchRef; };
virtual Bool_t GetBranchStatus(const char* branchname) const;
static Int_t GetBranchStyle();
virtual Long64_t GetCacheSize() const { return fCacheSize; }
virtual TClusterIterator GetClusterIterator(Long64_t firstentry);
virtual Long64_t GetChainEntryNumber(Long64_t entry) const { return entry; }
virtual Long64_t GetChainOffset() const { return fChainOffset; }
TFile *GetCurrentFile() const;
Int_t GetDefaultEntryOffsetLen() const {return fDefaultEntryOffsetLen;}
Long64_t GetDebugMax() const { return fDebugMax; }
Long64_t GetDebugMin() const { return fDebugMin; }
TDirectory *GetDirectory() const { return fDirectory; }
virtual Long64_t GetEntries() const { return fEntries; }
virtual Long64_t GetEntries(const char *selection);
virtual Long64_t GetEntriesFast() const { return fEntries; }
virtual Long64_t GetEntriesFriend() const;
virtual Long64_t GetEstimate() const { return fEstimate; }
virtual Int_t GetEntry(Long64_t entry = 0, Int_t getall = 0);
Int_t GetEvent(Long64_t entry = 0, Int_t getall = 0) { return GetEntry(entry, getall); }
virtual Int_t GetEntryWithIndex(Int_t major, Int_t minor = 0);
virtual Long64_t GetEntryNumberWithBestIndex(Long64_t major, Long64_t minor = 0) const;
virtual Long64_t GetEntryNumberWithIndex(Long64_t major, Long64_t minor = 0) const;
TEventList *GetEventList() const { return fEventList; }
virtual TEntryList *GetEntryList();
virtual Long64_t GetEntryNumber(Long64_t entry) const;
virtual Int_t GetFileNumber() const { return fFileNumber; }
virtual TTree *GetFriend(const char*) const;
virtual const char *GetFriendAlias(TTree*) const;
TH1 *GetHistogram() { return GetPlayer()->GetHistogram(); }
virtual Int_t *GetIndex() { return &fIndex.fArray[0]; }
virtual Double_t *GetIndexValues() { return &fIndexValues.fArray[0]; }
virtual TIterator *GetIteratorOnAllLeaves(Bool_t dir = kIterForward);
virtual TLeaf *GetLeaf(const char* branchname, const char* leafname);
virtual TLeaf *GetLeaf(const char* name);
virtual TList *GetListOfClones() { return fClones; }
virtual TObjArray *GetListOfBranches() { return &fBranches; }
virtual TObjArray *GetListOfLeaves() { return &fLeaves; }
virtual TList *GetListOfFriends() const { return fFriends; }
virtual TList *GetListOfAliases() const { return fAliases; }
// GetMakeClass is left non-virtual for efficiency reason.
// Making it virtual affects the performance of the I/O
Int_t GetMakeClass() const { return fMakeClass; }
virtual Long64_t GetMaxEntryLoop() const { return fMaxEntryLoop; }
virtual Double_t GetMaximum(const char* columname);
static Long64_t GetMaxTreeSize();
virtual Long64_t GetMaxVirtualSize() const { return fMaxVirtualSize; }
virtual Double_t GetMinimum(const char* columname);
virtual Int_t GetNbranches() { return fBranches.GetEntriesFast(); }
TObject *GetNotify() const { return fNotify; }
TVirtualTreePlayer *GetPlayer();
virtual Int_t GetPacketSize() const { return fPacketSize; }
virtual Long64_t GetReadEntry() const { return fReadEntry; }
virtual Long64_t GetReadEvent() const { return fReadEntry; }
virtual Int_t GetScanField() const { return fScanField; }
TTreeFormula *GetSelect() { return GetPlayer()->GetSelect(); }
virtual Long64_t GetSelectedRows() { return GetPlayer()->GetSelectedRows(); }
virtual Int_t GetTimerInterval() const { return fTimerInterval; }
TBuffer* GetTransientBuffer(Int_t size);
virtual Long64_t GetTotBytes() const { return fTotBytes; }
virtual TTree *GetTree() const { return const_cast<TTree*>(this); }
virtual TVirtualIndex *GetTreeIndex() const { return fTreeIndex; }
virtual Int_t GetTreeNumber() const { return 0; }
virtual Int_t GetUpdate() const { return fUpdate; }
virtual TList *GetUserInfo();
// See TSelectorDraw::GetVar
TTreeFormula *GetVar(Int_t i) { return GetPlayer()->GetVar(i); }
// See TSelectorDraw::GetVar
TTreeFormula *GetVar1() { return GetPlayer()->GetVar1(); }
// See TSelectorDraw::GetVar
TTreeFormula *GetVar2() { return GetPlayer()->GetVar2(); }
// See TSelectorDraw::GetVar
TTreeFormula *GetVar3() { return GetPlayer()->GetVar3(); }
// See TSelectorDraw::GetVar
TTreeFormula *GetVar4() { return GetPlayer()->GetVar4(); }
// See TSelectorDraw::GetVal
virtual Double_t *GetVal(Int_t i) { return GetPlayer()->GetVal(i); }
// See TSelectorDraw::GetVal
virtual Double_t *GetV1() { return GetPlayer()->GetV1(); }
// See TSelectorDraw::GetVal
virtual Double_t *GetV2() { return GetPlayer()->GetV2(); }
// See TSelectorDraw::GetVal
virtual Double_t *GetV3() { return GetPlayer()->GetV3(); }
// See TSelectorDraw::GetVal
virtual Double_t *GetV4() { return GetPlayer()->GetV4(); }
virtual Double_t *GetW() { return GetPlayer()->GetW(); }
virtual Double_t GetWeight() const { return fWeight; }
virtual Long64_t GetZipBytes() const { return fZipBytes; }
virtual void IncrementTotalBuffers(Int_t nbytes) { fTotalBuffers += nbytes; }
Bool_t IsFolder() const { return kTRUE; }
virtual Int_t LoadBaskets(Long64_t maxmemory = 2000000000);
virtual Long64_t LoadTree(Long64_t entry);
virtual Long64_t LoadTreeFriend(Long64_t entry, TTree* T);
virtual Int_t MakeClass(const char* classname = 0, Option_t* option = "");
virtual Int_t MakeCode(const char* filename = 0);
virtual Int_t MakeProxy(const char* classname, const char* macrofilename = 0, const char* cutfilename = 0, const char* option = 0, Int_t maxUnrolling = 3);
virtual Int_t MakeSelector(const char* selector = 0);
Bool_t MemoryFull(Int_t nbytes);
virtual Long64_t Merge(TCollection* list, Option_t* option = "");
virtual Long64_t Merge(TCollection* list, TFileMergeInfo *info);
static TTree *MergeTrees(TList* list, Option_t* option = "");
virtual Bool_t Notify();
virtual void OptimizeBaskets(ULong64_t maxMemory=10000000, Float_t minComp=1.1, Option_t *option="");
TPrincipal *Principal(const char* varexp = "", const char* selection = "", Option_t* option = "np", Long64_t nentries = 1000000000, Long64_t firstentry = 0);
virtual void Print(Option_t* option = "") const; // *MENU*
virtual void PrintCacheStats(Option_t* option = "") const;
virtual Long64_t Process(const char* filename, Option_t* option = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0); // *MENU*
#if defined(__CINT__)
#if defined(R__MANUAL_DICT)
virtual Long64_t Process(void* selector, Option_t* option = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0);
#endif
#else
virtual Long64_t Process(TSelector* selector, Option_t* option = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0);
#endif
virtual Long64_t Project(const char* hname, const char* varexp, const char* selection = "", Option_t* option = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0);
virtual TSQLResult *Query(const char* varexp = "", const char* selection = "", Option_t* option = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0);
virtual Long64_t ReadFile(const char* filename, const char* branchDescriptor = "", char delimiter = ' ');
virtual Long64_t ReadStream(istream& inputStream, const char* branchDescriptor = "", char delimiter = ' ');
virtual void Refresh();
virtual void RecursiveRemove(TObject *obj);
virtual void RemoveFriend(TTree*);
virtual void Reset(Option_t* option = "");
virtual void ResetAfterMerge(TFileMergeInfo *);
virtual void ResetBranchAddress(TBranch *);
virtual void ResetBranchAddresses();
virtual Long64_t Scan(const char* varexp = "", const char* selection = "", Option_t* option = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0); // *MENU*
virtual Bool_t SetAlias(const char* aliasName, const char* aliasFormula);
virtual void SetAutoSave(Long64_t autos = 300000000);
virtual void SetAutoFlush(Long64_t autof = -30000000);
virtual void SetBasketSize(const char* bname, Int_t buffsize = 16000);
#if !defined(__CINT__)
virtual Int_t SetBranchAddress(const char *bname,void *add, TBranch **ptr = 0);
#endif
virtual Int_t SetBranchAddress(const char *bname,void *add, TClass *realClass, EDataType datatype, Bool_t isptr);
virtual Int_t SetBranchAddress(const char *bname,void *add, TBranch **ptr, TClass *realClass, EDataType datatype, Bool_t isptr);
template <class T> Int_t SetBranchAddress(const char *bname, T **add, TBranch **ptr = 0) {
TClass *cl = TClass::GetClass(typeid(T));
EDataType type = kOther_t;
if (cl==0) type = TDataType::GetType(typeid(T));
return SetBranchAddress(bname,add,ptr,cl,type,true);
}
#ifndef R__NO_CLASS_TEMPLATE_SPECIALIZATION
// This can only be used when the template overload resolution can distringuish between
// T* and T**
template <class T> Int_t SetBranchAddress(const char *bname, T *add, TBranch **ptr = 0) {
TClass *cl = TClass::GetClass(typeid(T));
EDataType type = kOther_t;
if (cl==0) type = TDataType::GetType(typeid(T));
return SetBranchAddress(bname,add,ptr,cl,type,false);
}
#endif
virtual void SetBranchStatus(const char* bname, Bool_t status = 1, UInt_t* found = 0);
static void SetBranchStyle(Int_t style = 1); //style=0 for old branch, =1 for new branch style
virtual void SetCacheSize(Long64_t cachesize = -1);
virtual void SetCacheEntryRange(Long64_t first, Long64_t last);
virtual void SetCacheLearnEntries(Int_t n=10);
virtual void SetChainOffset(Long64_t offset = 0) { fChainOffset=offset; }
virtual void SetCircular(Long64_t maxEntries);
virtual void SetDebug(Int_t level = 1, Long64_t min = 0, Long64_t max = 9999999); // *MENU*
virtual void SetDefaultEntryOffsetLen(Int_t newdefault, Bool_t updateExisting = kFALSE);
virtual void SetDirectory(TDirectory* dir);
virtual Long64_t SetEntries(Long64_t n = -1);
virtual void SetEstimate(Long64_t nentries = 1000000);
virtual void SetFileNumber(Int_t number = 0);
virtual void SetEventList(TEventList* list);
virtual void SetEntryList(TEntryList* list, Option_t *opt="");
virtual void SetMakeClass(Int_t make);
virtual void SetMaxEntryLoop(Long64_t maxev = 1000000000) { fMaxEntryLoop = maxev; } // *MENU*
static void SetMaxTreeSize(Long64_t maxsize = 1900000000);
virtual void SetMaxVirtualSize(Long64_t size = 0) { fMaxVirtualSize = size; } // *MENU*
virtual void SetName(const char* name); // *MENU*
virtual void SetNotify(TObject* obj) { fNotify = obj; }
virtual void SetObject(const char* name, const char* title);
virtual void SetParallelUnzip(Bool_t opt=kTRUE, Float_t RelSize=-1);
virtual void SetScanField(Int_t n = 50) { fScanField = n; } // *MENU*
virtual void SetTimerInterval(Int_t msec = 333) { fTimerInterval=msec; }
virtual void SetTreeIndex(TVirtualIndex*index);
virtual void SetWeight(Double_t w = 1, Option_t* option = "");
virtual void SetUpdate(Int_t freq = 0) { fUpdate = freq; }
virtual void Show(Long64_t entry = -1, Int_t lenmax = 20);
virtual void StartViewer(); // *MENU*
virtual void StopCacheLearningPhase();
virtual Int_t UnbinnedFit(const char* funcname, const char* varexp, const char* selection = "", Option_t* option = "", Long64_t nentries = 1000000000, Long64_t firstentry = 0);
void UseCurrentStyle();
virtual Int_t Write(const char *name=0, Int_t option=0, Int_t bufsize=0);
virtual Int_t Write(const char *name=0, Int_t option=0, Int_t bufsize=0) const;
ClassDef(TTree,19) //Tree descriptor (the main ROOT I/O class)
};
//////////////////////////////////////////////////////////////////////////
// //
// TTreeFriendLeafIter //
// //
// Iterator on all the leaves in a TTree and its friend //
// //
//////////////////////////////////////////////////////////////////////////
class TTreeFriendLeafIter : public TIterator {
protected:
TTree *fTree; //tree being iterated
TIterator *fLeafIter; //current leaf sub-iterator.
TIterator *fTreeIter; //current tree sub-iterator.
Bool_t fDirection; //iteration direction
TTreeFriendLeafIter() : fTree(0), fLeafIter(0), fTreeIter(0),
fDirection(0) { }
public:
TTreeFriendLeafIter(const TTree* t, Bool_t dir = kIterForward);
TTreeFriendLeafIter(const TTreeFriendLeafIter &iter);
~TTreeFriendLeafIter() { SafeDelete(fLeafIter); SafeDelete(fTreeIter); }
TIterator &operator=(const TIterator &rhs);
TTreeFriendLeafIter &operator=(const TTreeFriendLeafIter &rhs);
const TCollection *GetCollection() const { return 0; }
Option_t *GetOption() const;
TObject *Next();
void Reset() { SafeDelete(fLeafIter); SafeDelete(fTreeIter); }
Bool_t operator !=(const TIterator&) const {
// TODO: Implement me
return false;
}
Bool_t operator !=(const TTreeFriendLeafIter&) const {
// TODO: Implement me
return false;
}
TObject *operator*() const {
// TODO: Implement me
return nullptr;
}
ClassDef(TTreeFriendLeafIter,0) //Linked list iterator
};
#endif
|