1 #ifndef ALIMUONVSTORE_H
2 #define ALIMUONVSTORE_H
29 virtual Bool_t
Add(TObject*
object) = 0;
32 virtual void Clear(Option_t* opt=
"") = 0;
47 virtual Bool_t
Connect(TTree& tree, Bool_t alone=kTRUE)
const;
50 virtual TObject*
FindObject(
const char* name)
const;
53 virtual TObject*
FindObject(
const TObject*
object)
const;
56 virtual TObject*
FindObject(UInt_t uniqueID)
const;
59 virtual TObject*
FindObject(Int_t i, Int_t j)
const;
62 virtual Int_t
GetSize()
const = 0;
65 virtual Int_t
GetSize(Int_t i)
const;
71 virtual void Print(Option_t* wildcard=
"")
const;
74 virtual void Print(Option_t* wildcard, Option_t* opt)
const;
virtual TIterator * CreateIterator() const =0
Return an iterator to loop over the whole store.
virtual void Print(Option_t *wildcard="") const
Print all objects whose name matches wildcard.
virtual Bool_t CanConnect() const =0
Whether the Connect(TTree&) method is implemented.
virtual Int_t GetSize() const =0
The number of objects stored.
virtual AliMUONVStore * Create() const =0
Create an empty copy of this.
virtual Bool_t IsEmpty() const
Whether we are empty or not.
virtual Bool_t Add(TObject *object)=0
Add an object to the store.
virtual void Clear(Option_t *opt="")=0
Clear ourselves (i.e. Reset)
Base class for MUON data stores.
virtual Bool_t Connect(TTree &tree, Bool_t alone=kTRUE) const
Connect us to a TTree (only valid if CanConnect()==kTRUE)
virtual TObject * FindObject(const char *name) const
Find an object by name.