12 #ifndef ROOT_TOrdCollection 13 #define ROOT_TOrdCollection 24 #ifndef ROOT_TSeqCollection 99 public std::iterator<std::bidirectional_iterator_tag,
100 TObject*, std::ptrdiff_t,
101 const TObject**, const TObject*&> {
void Init(Int_t capacity)
Initialize ordered collection.
void Delete(Option_t *option="")
Remove all objects from the collection AND delete all heap based objects.
TObject * After(const TObject *obj) const
Return the object after object obj.
void AddLast(TObject *obj)
Add object at the end of the collection.
TIterator * MakeIterator(Bool_t dir=kIterForward) const
Return an ordered collection iterator.
TObject * First() const
Return the first object in the collection.
void AddBefore(const TObject *before, TObject *obj)
Insert object before object before in the collection.
Int_t PhysIndex(Int_t idx) const
const TCollection * GetCollection() const
Iterator abstract base class.
Sequenceable collection abstract base class.
#define ClassDef(name, id)
TObject ** GetObjectRef(const TObject *obj) const
return address of pointer obj
void PutAt(TObject *obj, Int_t idx)
Put object at index idx. Overwrites what was at idx before.
const Bool_t kIterForward
Bool_t operator!=(const TDatime &d1, const TDatime &d2)
TOrdCollection(const TOrdCollection &)
~TOrdCollection()
Delete the collection.
TObject * Before(const TObject *obj) const
Returns the object before object obj.
Int_t LogIndex(Int_t idx) const
TObject * Last() const
Return the last object in the collection.
void SetCapacity(Int_t newCapacity)
Set/change ordered collection capacity.
TTime operator*(const TTime &t1, const TTime &t2)
Collection abstract base class.
Int_t IndexOf(const TObject *obj) const
Return index of object in collection.
TObject * RemoveAt(Int_t idx)
Remove object at index idx.
void AddFirst(TObject *obj)
Insert object at beginning of collection.
TOrdCollection & operator=(const TOrdCollection &)
void Reset(Detail::TBranchProxy *x)
TObject * Remove(TObject *obj)
Remove object from collection.
void MoveGapTo(Int_t newGapStart)
Move gap to new position.
void Sort()
If objects in collection are sortable (i.e.
Bool_t LowWaterMark() const
Int_t BinarySearch(TObject *obj)
Find object using a binary search.
Mother of all ROOT objects.
const TOrdCollection * fCol
TOrdCollectionIter Iterator_t
void Clear(Option_t *option="")
Remove all objects from the collection.
Iterator of ordered collection.
void AddAfter(const TObject *after, TObject *obj)
Insert object after object after in the collection.
void AddAt(TObject *obj, Int_t idx)
Insert object at position idx in the collection.
TObject * At(Int_t idx) const
Returns the object at position idx. Returns 0 if idx is out of range.
Bool_t IllegalIndex(const char *method, Int_t idx) const
Return true when index out of bounds and print error.
friend class TOrdCollectionIter