Logo ROOT   6.30.04
Reference Guide
 All Namespaces Files Pages
TChainIndex.h
Go to the documentation of this file.
1 // @(#)root/treeplayer:$Id$
2 // Author: Marek Biskup 07/06/2005
3 
4 /*************************************************************************
5  * Copyright (C) 1995-2004, 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_TChainIndex
13 #define ROOT_TChainIndex
14 
15 
16 //////////////////////////////////////////////////////////////////////////
17 //
18 // TChainIndex
19 //
20 // A Chain Index with majorname and minorname.
21 // It uses tree indices of all the trees in the chain instead of building
22 // a new index.
23 // The index values from the first tree should be less then
24 // all the index values from the second tree, and so on.
25 // If a tree in the chain doesn't have an index the index will be created
26 // and kept inside this chain index.
27 //
28 //////////////////////////////////////////////////////////////////////////
29 
30 
31 #include "TVirtualIndex.h"
32 
33 #include <vector>
34 
35 class TTreeFormula;
36 class TTreeIndex;
37 class TChain;
38 
39 class TChainIndex : public TVirtualIndex {
40 
41 public:
42  class TChainIndexEntry {
43  // holds a description of indices of trees in the chain.
44  public:
45  TChainIndexEntry() : fMinIndexValue(0), fMinIndexValMinor(0),
46  fMaxIndexValue(0), fMaxIndexValMinor(0),
47  fTreeIndex(0) {}
48 
49  typedef std::pair<Long64_t, Long64_t> IndexValPair_t;
50 
51  IndexValPair_t GetMinIndexValPair() const { return IndexValPair_t(fMinIndexValue, fMinIndexValMinor); }
52  IndexValPair_t GetMaxIndexValPair() const { return IndexValPair_t(fMaxIndexValue, fMaxIndexValMinor); }
53  void SetMinMaxFrom(const TTreeIndex *index );
54 
55  Long64_t fMinIndexValue; // the minimum value of the index (upper bits)
56  Long64_t fMinIndexValMinor; // the minimum value of the index (lower bits)
57  Long64_t fMaxIndexValue; // the maximum value of the index (upper bits)
58  Long64_t fMaxIndexValMinor; // the maximum value of the index (lower bits)
59  TVirtualIndex* fTreeIndex; // the tree index in case it was created in the constructor,
60  // otherwise 0
61  };
62 protected:
63 
64  TString fMajorName; // Index major name
65  TString fMinorName; // Index minor name
66  TTreeFormula *fMajorFormulaParent; //! Pointer to major TreeFormula in Parent tree (if any)
67  TTreeFormula *fMinorFormulaParent; //! Pointer to minor TreeFormula in Parent tree (if any)
68  std::vector<TChainIndexEntry> fEntries; // descriptions of indices of trees in the chain.
69 
70  std::pair<TVirtualIndex*, Int_t> GetSubTreeIndex(Long64_t major, Long64_t minor) const;
71  void ReleaseSubTreeIndex(TVirtualIndex* index, Int_t treeNo) const;
72  void DeleteIndices();
73 
74 public:
75  TChainIndex();
76  TChainIndex(const TTree *T, const char *majorname, const char *minorname);
77  virtual ~TChainIndex();
78  virtual void Append(const TVirtualIndex *, Bool_t delaySort = kFALSE);
79  virtual Long64_t GetEntryNumberFriend(const TTree *parent);
80  virtual Long64_t GetEntryNumberWithIndex(Long64_t major, Long64_t minor) const;
81  virtual Long64_t GetEntryNumberWithBestIndex(Long64_t major, Long64_t minor) const;
82  const char *GetMajorName() const {return fMajorName.Data();}
83  const char *GetMinorName() const {return fMinorName.Data();}
84  virtual Long64_t GetN() const {return fEntries.size();}
85  virtual TTreeFormula *GetMajorFormulaParent(const TTree *parent);
86  virtual TTreeFormula *GetMinorFormulaParent(const TTree *parent);
87  virtual Bool_t IsValidFor(const TTree *parent);
88  virtual void UpdateFormulaLeaves(const TTree *parent);
89  virtual void SetTree(const TTree *T);
90 
91  ClassDef(TChainIndex,1) //A Tree Index with majorname and minorname.
92 };
93 
94 #endif
95