class TOrdCollection: public TSeqCollection
TOrdCollection Ordered collection. An ordered collection has TList insertion semantics but is implemented using an array of TObject*'s. It uses less space than a TList (since there is no need for the prev and next pointers), but it is more costly to insert objects (since it has to create a gap by copying object pointers). TOrdCollection is better than TList when objects are only added at the end of the collection since no copying needs to be done./*
*/
Function Members (Methods)
public:
protected:
| virtual void | TSeqCollection::Changed() |
| virtual void | TObject::DoError(int level, const char* location, const char* fmt, va_list va) const |
| virtual const char* | TCollection::GetCollectionEntryName(TObject* entry) const |
| void | TObject::MakeZombie() |
| virtual void | TCollection::PrintCollectionEntry(TObject* entry, Option_t* option, Int_t recurse) const |
| virtual void | TCollection::PrintCollectionHeader(Option_t* option) const |
private:
| TOrdCollection(const TOrdCollection&) | |
| Bool_t | IllegalIndex(const char* method, Int_t idx) const |
| void | Init(Int_t capacity) |
| Int_t | LogIndex(Int_t idx) const |
| Bool_t | LowWaterMark() const |
| void | MoveGapTo(Int_t newGapStart) |
| TOrdCollection& | operator=(const TOrdCollection&) |
| Int_t | PhysIndex(Int_t idx) const |
| void | SetCapacity(Int_t newCapacity) |
Data Members
public:
| enum { | kDefaultCapacity | |
| kMinExpand | ||
| kShrinkFactor | ||
| }; | ||
| enum TCollection::[unnamed] { | kIsOwner | |
| kInitCapacity | ||
| kInitHashTableCapacity | ||
| }; | ||
| enum TObject::EStatusBits { | kCanDelete | |
| kMustCleanup | ||
| kObjInCanvas | ||
| kIsReferenced | ||
| kHasUUID | ||
| kCannotPick | ||
| kNoContextMenu | ||
| kInvalidObject | ||
| }; | ||
| enum TObject::[unnamed] { | kIsOnHeap | |
| kNotDeleted | ||
| kZombie | ||
| kBitMask | ||
| kSingleKey | ||
| kOverwrite | ||
| kWriteDelete | ||
| }; |
protected:
| TString | TCollection::fName | name of the collection |
| Int_t | TCollection::fSize | number of elements in collection |
| Bool_t | TSeqCollection::fSorted | true if collection has been sorted |
Class Charts
Function documentation
~TOrdCollection()
Delete the collection. Objects are not deleted unless the TOrdCollection is the owner (set via SetOwner()).
void AddBefore(const TObject* before, TObject* obj)
Insert object before object before in the collection.
void AddAfter(const TObject* after, TObject* obj)
Insert object after object after in the collection.
TObject * After(const TObject* obj) const
Return the object after object obj. Returns 0 if obj is last in collection.
TObject * Before(const TObject* obj) const
Returns the object before object obj. Returns 0 if obj is first in collection.
void Clear(Option_t* option = "")
Remove all objects from the collection. Does not delete the objects unless the TOrdCollection is the owner (set via SetOwner()).
void Delete(Option_t* option = "")
Remove all objects from the collection AND delete all heap based objects.
TObject * First() const
Return the first object in the collection. Returns 0 when collection is empty.
TObject * Last() const
Return the last object in the collection. Returns 0 when collection is empty.
Bool_t IllegalIndex(const char* method, Int_t idx) const
Return true when index out of bounds and print error.
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.
void MoveGapTo(Int_t newGapStart)
Move gap to new position. Gap needs to be moved when objects are inserted not at the end.
void Sort()
If objects in collection are sortable (i.e. IsSortable() returns true for all objects) then sort collection.
Int_t BinarySearch(TObject* obj)
Find object using a binary search. Collection must first have been sorted.
Bool_t LowWaterMark() const
TOrdCollection(const TOrdCollection& )
TOrdCollection& operator=(const TOrdCollection& )