TSeqCollection


class description - source file - inheritance tree

class TSeqCollection : public TCollection


    protected:
virtual void Changed() public:
virtual void ~TSeqCollection() virtual void Add(TObject* obj) virtual void AddAfter(TObject* after, TObject* obj) virtual void AddAt(TObject* obj, Int_t idx) virtual void AddBefore(TObject* before, TObject* obj) virtual void AddFirst(TObject* obj) virtual void AddLast(TObject* obj) virtual TObject* After(TObject* obj) virtual TObject* At(Int_t idx) virtual TObject* Before(TObject* obj) TClass* Class() virtual TObject* First() virtual Int_t IndexOf(TObject* obj) virtual TClass* IsA() Bool_t IsSorted() virtual TObject* Last() Int_t LastIndex() Int_t ObjCompare(TObject* a, TObject* b) void QSort(TObject** a, Int_t first, Int_t last) void QSort(TObject** a, TObject** b, Int_t first, Int_t last) virtual void RemoveAfter(TObject* after) virtual void RemoveAt(Int_t idx) virtual void RemoveBefore(TObject* before) virtual void RemoveFirst() virtual void RemoveLast() virtual void ShowMembers(TMemberInspector& insp, char* parent) virtual void Streamer(TBuffer& b)

Data Members

protected:
Bool_t fSorted


See also

TBtree, TList, TObjArray, TOrdCollection

Class Description

                                                                      
 TSeqCollection                                                       
                                                                      
 Sequenceable collection abstract base class. TSeqCollection's have   
 an ordering relation, i.e. there is a first and last element.        
                                                                      


Int_t IndexOf(TObject *obj) const
 Return index of object in collection. Returns -1 when object not found.
 Uses member IsEqual() to find object.

Int_t ObjCompare(TObject *a, TObject *b)
 Compare to objects in the collection. Use member Compare() of object a.

void QSort(TObject **a, Int_t first, Int_t last)
 Sort array of TObject pointers using a quicksort algorithm.
 Uses ObjCompare() to compare objects.

void QSort(TObject **a, TObject **b, Int_t first, Int_t last)
 Sort array a of TObject pointers using a quicksort algorithm.
 Array b will be sorted just like a (a determines the sort).
 Uses ObjCompare() to compare objects.



Inline Functions


               void Changed()
               void Add(TObject* obj)
               void AddFirst(TObject* obj)
               void AddLast(TObject* obj)
               void AddAt(TObject* obj, Int_t idx)
               void AddAfter(TObject* after, TObject* obj)
               void AddBefore(TObject* before, TObject* obj)
               void RemoveFirst()
               void RemoveLast()
               void RemoveAt(Int_t idx)
               void RemoveAfter(TObject* after)
               void RemoveBefore(TObject* before)
           TObject* At(Int_t idx)
           TObject* Before(TObject* obj)
           TObject* After(TObject* obj)
           TObject* First()
           TObject* Last()
              Int_t LastIndex()
             Bool_t IsSorted()
            TClass* Class()
            TClass* IsA()
               void ShowMembers(TMemberInspector& insp, char* parent)
               void Streamer(TBuffer& b)
               void ~TSeqCollection()


Author: Fons Rademakers 04/08/95
Last update: 1.03/09 03/12/97 02.18.06 by Fons Rademakers
Copyright (c) 1995-1999, The ROOT System, All rights reserved. *


ROOT page - Class index - Top of the page

This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.