library: libCore
#include "TSeqCollection.h" |
TSeqCollection
class description - source file - inheritance tree (.pdf)
This is an abstract class, constructors will not be documented.
Look at the header to check for available constructors.
protected:
virtual void Changed()
public:
virtual ~TSeqCollection()
virtual void Add(TObject* obj)
virtual void AddAfter(const TObject* after, TObject* obj)
virtual void AddAt(TObject* obj, Int_t idx)
virtual void AddBefore(const TObject* before, TObject* obj)
virtual void AddFirst(TObject* obj)
virtual void AddLast(TObject* obj)
virtual TObject* After(const TObject* obj) const
virtual TObject* At(Int_t idx) const
virtual TObject* Before(const TObject* obj) const
static TClass* Class()
virtual TObject* First() const
virtual Int_t IndexOf(const TObject* obj) const
virtual TClass* IsA() const
virtual Bool_t IsSorted() const
virtual TObject* Last() const
Int_t LastIndex() const
static Int_t ObjCompare(TObject* a, TObject* b)
static void QSort(TObject** a, Int_t first, Int_t last)
static void QSort(TObject** a, TObject** b, Int_t first, Int_t last)
virtual void RemoveAfter(TObject* after)
virtual TObject* 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)
void StreamerNVirtual(TBuffer& b)
void UnSort()
protected:
Bool_t fSorted true if collection has been sorted
TSeqCollection
Sequenceable collection abstract base class. TSeqCollection's have
an ordering relation, i.e. there is a first and last element.
Int_t IndexOf(const 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 ~TSeqCollection()
void Changed()
void Add(TObject* obj)
void AddFirst(TObject* obj)
void AddLast(TObject* obj)
void AddAt(TObject* obj, Int_t idx)
void AddAfter(const TObject* after, TObject* obj)
void AddBefore(const TObject* before, TObject* obj)
void RemoveFirst()
void RemoveLast()
TObject* RemoveAt(Int_t idx)
void RemoveAfter(TObject* after)
void RemoveBefore(TObject* before)
TObject* At(Int_t idx) const
TObject* Before(const TObject* obj) const
TObject* After(const TObject* obj) const
TObject* First() const
TObject* Last() const
Int_t LastIndex() const
Bool_t IsSorted() const
void UnSort()
TClass* Class()
TClass* IsA() const
void ShowMembers(TMemberInspector& insp, char* parent)
void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
Author: Fons Rademakers 04/08/95
Last update: root/cont:$Name: $:$Id: TSeqCollection.cxx,v 1.5 2005/06/23 06:24:27 brun Exp $
Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *
ROOT page - Class index - Class Hierarchy - 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.