/usr/include/root/TDataSetIter.h is in libroot-misc-table-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 | // @(#)root/table:$Id$
// Author: Valery Fine(fine@mail.cern.ch) 03/07/98
/*************************************************************************
* Copyright (C) 1995-2006, 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_TDataSetIter
#define ROOT_TDataSetIter
//////////////////////////////////////////////////////////////////////////
// //
// //
// TDataSetIter //
// //
// Iterator of TDataSet lists. //
// //
// Provides "standard" features of the TIter class for TDataSet object //
// and //
// allows navigating TDataSet structure using the custom "directory" //
// notation (see TDataSet::Find(const Char *path) method) //
// //
//////////////////////////////////////////////////////////////////////////
#include "TList.h"
#include "TNamed.h"
#include "TDataSet.h"
class TDataSetIter : public TObject{
protected:
TIter *fNext; // "standard" ROOT iterator for containers
TIter *fNextSet[100]; // the list of the TList iterators to bypass the whole dataset
Int_t fDepth; // the current depth of the passing
Int_t fMaxDepth; // the max depth of the passing (=1 by default)
TDataSet *fDataSet; // Pointer to the last selected TDataSet
TDataSet *fRootDataSet; // Pointer to the root TDataSet
TDataSet *fWorkingDataSet; // Pointer to the working TDataSet
TDataSet *NextDataSet(TIter &next);
TDataSet *NextDataSet(Int_t nDataSet);
TDataSet *GetNullSet(); // return a fake pointer == -1 casted to (TDataSet *)
static TDataSet *fgNullDataSet;
private:
TDataSetIter(const TDataSetIter&); // Not implemented.
TDataSetIter &operator=(const TDataSetIter&); // Not implemented.
public:
TDataSetIter(TDataSet *l=0, Int_t depth=1, Bool_t dir=kIterForward);
TDataSetIter(TDataSet *l, Bool_t dir);
virtual ~TDataSetIter();
virtual TDataSet *Add(TDataSet *set){return Add(set,(TDataSet *)0);}
virtual TDataSet *Add(TDataSet *set, const Char_t *path);
virtual TDataSet *Add(TDataSet *set, TDataSet *dataset);
virtual TDataSet *Cd(const Char_t *dirname);
virtual TDataSet *Cd(TDataSet *ds);
virtual TDataSet *operator()( TDataSet::EDataSetPass mode=TDataSet::kContinue ) {return Next(mode);}
virtual TDataSet *operator()(const Char_t *path) { return Find(path); }
virtual TDataSet *operator[](const Char_t *path);
virtual Int_t GetDepth() const {return fDepth;}
virtual TDataSet *Cwd() const {return fWorkingDataSet;}
virtual TDataSet *Dir(Char_t *dirname);
virtual Int_t Du() const; // summarize dataset usage
virtual Int_t Df() const {return 0;} // report number of free "table" blocks.
virtual TDataSet *Find(const Char_t *path, TDataSet *rootset=0,Bool_t mkdir=kFALSE,Bool_t titleFlag=kFALSE);
virtual TDataSet *FindByPath(const Char_t *path, TDataSet *rootset=0,Bool_t mkdir=kFALSE);
virtual TDataSet *FindDataSet(const Char_t *name,const Char_t *path="",Option_t *opt="");
virtual TDataSet *FindByName(const Char_t *name,const Char_t *path="",Option_t *opt="");
virtual TDataSet *FindByTitle(const Char_t *title,const Char_t *path="",Option_t *opt="");
virtual TDataSet *FindDataSet(TDataSet *set,const Char_t *path,Option_t *opt="");
virtual TDataSet *FindByPointer(TDataSet *set,const Char_t *path=0,Option_t *opt="");
virtual TObject *FindObject(const Char_t *name) const;
virtual TObject *FindObject(const TObject *obj) const;
virtual Int_t Flag(UInt_t flag=TDataSet::kMark,TDataSet::EBitOpt reset=TDataSet::kSet){return Flag((TDataSet *)0,flag,reset);}
virtual Int_t Flag(const Char_t *path,UInt_t flag=TDataSet::kMark,TDataSet::EBitOpt reset=TDataSet::kSet);
virtual Int_t Flag(TDataSet *dataset,UInt_t flag=TDataSet::kMark,TDataSet::EBitOpt reset=TDataSet::kSet);
virtual TDataSet *Ls(const Char_t *dirname="",Option_t *opt="") const;
virtual TDataSet *Ls(const Char_t *dirname,Int_t depth) const;
virtual void ls(Option_t *dirname="") const { Ls(dirname,"");}
virtual TDataSet *ls(TString dirname,Option_t *opt="") const {return Ls(dirname.Data(),opt);}
virtual TDataSet *ls(const Char_t *dirname,Int_t depth) const {return Ls(dirname,depth);}
virtual TDataSet *Mkdir(const Char_t *dirname);
virtual TDataSet *Md(const Char_t *dirname) {return Mkdir(dirname);}
virtual TString Path(const Char_t *path) {TDataSet *set = Find(path); return set ? set->Path():TString ("");}
virtual TString Path() {return fWorkingDataSet ? fWorkingDataSet->Path() : TString ("");}
virtual TDataSet *Pwd(Option_t *opt="") const {if (Cwd()) Cwd()->ls(opt); return Cwd();}
virtual TDataSet *Rmdir(TDataSet *dataset,Option_t *option="");
virtual TDataSet *Rmdir(const Char_t *dirname,Option_t *option=""){return Rmdir(Find(dirname),option);}
virtual TDataSet *Rd(const Char_t *dirname,Option_t *option="") {return Rmdir(Find(dirname),option);}
virtual TDataSet *Shunt(TDataSet *set){return Shunt(set,(TDataSet *)0);}
virtual TDataSet *Shunt(TDataSet *set, const Char_t *path);
virtual TDataSet *Shunt(TDataSet *set, TDataSet *dataset);
virtual TDataSet *Next( TDataSet::EDataSetPass mode=TDataSet::kContinue);
virtual TDataSet *Next(const Char_t *path, TDataSet *rootset=0,Bool_t mkdir=kFALSE){return Find(path,rootset,mkdir);}
virtual Bool_t Notify() { return TObject::Notify();}
virtual void Notify(TDataSet *dataset);
const Option_t *GetOption() const { return fNext ? fNext->GetOption():0; }
virtual void Reset(TDataSet *l=0,Int_t depth=0);
virtual TDataSet *operator *() const ;
ClassDef(TDataSetIter,0) // class-iterator to navigate TDataSet structure
};
#endif
|