12#ifndef ROOT_TSortedList
13#define ROOT_TSortedList
#define ClassDef(name, id)
const Bool_t kSortAscending
Bool_t fAscending
cache to speedup sequential calling of Before() and After() functions
Wrapper around a TObject so it can be stored in a TList.
Mother of all ROOT objects.
A sorted doubly linked list.
void AddFirst(TObject *obj)
Add object at the beginning of the list.
void AddFirst(TObject *obj, Option_t *opt)
Add object at the beginning of the list and also store option.
void AddBefore(TObjLink *, TObject *obj)
Insert object before the specified ObjLink object.
void Add(TObject *obj)
Add object in sorted list.
void AddLast(TObject *obj, Option_t *opt)
Add object at the end of the list and also store option.
void AddAfter(const TObject *, TObject *obj)
Insert object after object after in the list.
TSortedList(Bool_t order=kSortAscending)
void AddAt(TObject *obj, Int_t)
Insert object at position idx in the list.
void AddBefore(const TObject *, TObject *obj)
Insert object before object before in the list.
void AddAfter(TObjLink *, TObject *obj)
Insert object after the specified ObjLink object.
void AddLast(TObject *obj)
Add object at the end of the list.
void Sort(Bool_t=kSortAscending)
Sort linked list.