12 #ifndef ROOT_TSeqCollection
13 #define ROOT_TSeqCollection
25 #ifndef ROOT_TCollection
virtual TObject * Remove(TObject *obj)=0
virtual void Add(TObject *obj)
virtual Bool_t IsSorted() const
virtual void RemoveAfter(TObject *after)
virtual TObject * RemoveAt(Int_t idx)
Sequenceable collection abstract base class.
#define ClassDef(name, id)
virtual TObject * Before(const TObject *obj) const =0
virtual void AddBefore(const TObject *before, TObject *obj)=0
virtual void RemoveBefore(TObject *before)
virtual TObject * After(const TObject *obj) const =0
virtual void AddLast(TObject *obj)=0
virtual ~TSeqCollection()
virtual void AddAfter(const TObject *after, TObject *obj)=0
Collection abstract base class.
static void QSort(TObject **a, Int_t first, Int_t last)
Sort array of TObject pointers using a quicksort algorithm.
virtual Int_t GetLast() const
Returns index of last object in collection.
virtual Int_t GetSize() const
virtual void AddAt(TObject *obj, Int_t idx)=0
virtual void AddFirst(TObject *obj)=0
virtual TObject * At(Int_t idx) const =0
Mother of all ROOT objects.
virtual void RemoveLast()
static void QSort(TObject **a, TObject **b, Int_t first, Int_t last)
virtual Int_t IndexOf(const TObject *obj) const
static Int_t ObjCompare(TObject *a, TObject *b)
Compare to objects in the collection. Use member Compare() of object a.
Long64_t Merge(TCollection *list)
Merge this collection with all collections coming in the input list.
virtual TObject * First() const =0
virtual TObject * Last() const =0
virtual void RemoveFirst()