library: libCore #include "TRefArray.h" |
TRefArray
class description - header file - source file - inheritance tree (.pdf)
protected:
Bool_t BoundsOk(const char* where, Int_t at) const
Int_t GetAbsLast() const
TObject* GetFromTable(Int_t idx) const
void Init(Int_t s, Int_t lowerBound)
Bool_t OutOfBoundsError(const char* where, Int_t i) const
public:
TRefArray()
TRefArray(Int_t s, Int_t lowerBound = 0)
TRefArray(const TRefArray& a)
virtual ~TRefArray()
virtual void Add(TObject* obj)
virtual void AddAfter(const TObject* after, TObject* obj)
virtual void AddAt(TObject* obj, Int_t idx)
virtual void AddAtAndExpand(TObject* obj, Int_t idx)
virtual Int_t AddAtFree(TObject* obj)
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 at) const
virtual TObject* Before(const TObject* obj) const
virtual Int_t BinarySearch(TObject* obj, Int_t upto = kMaxInt)
static TClass* Class()
virtual void Clear(Option_t* option = "")
virtual void Compress()
virtual void Delete(Option_t* option = "")
virtual void Expand(Int_t newSize)
virtual TObject* First() const
virtual Int_t GetEntries() const
Int_t GetEntriesFast() const
Int_t GetLast() const
virtual TObject** GetObjectRef(const TObject* obj) const
TProcessID* GetPID() const
UInt_t GetUID(Int_t at) const
virtual Int_t IndexOf(const TObject* obj) const
virtual TClass* IsA() const
virtual Bool_t IsEmpty() const
virtual TObject* Last() const
Int_t LowerBound() const
virtual TIterator* MakeIterator(Bool_t dir = kIterForward) const
virtual TObject* operator[](Int_t at) const
virtual TObject* Remove(TObject* obj)
virtual TObject* RemoveAt(Int_t idx)
void SetLast(Int_t last)
virtual void ShowMembers(TMemberInspector& insp, char* parent)
virtual void Sort(Int_t upto = kMaxInt)
virtual void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
protected:
TProcessID* fPID Pointer to Process Unique Identifier
UInt_t* fUIDs [fSize] To store uids of referenced objects
Int_t fLowerBound Lower bound of the array
Int_t fLast Last element in array containing an object
TRefArray
An array of references to TObjects. The array expands automatically
when objects are added (shrinking can be done by hand using Expand()
The TRefArray can be filled with:
array.Add(obj)
array.AddAt(obj,i)
but not array[i] = obj !!!
The array elements can be retrieved with:
TObject *obj = array.At(i);
When a TRefArray is Streamed, only the pointer unique id is written,
not the referenced object. TRefArray may be assigned to different
branches of one Tree or several Trees.
The branch containing the TRefArray can be read before or after the
array (eg TClonesArray, STL vector,..) of the referenced objects.
See an example in $ROOTSYS/test/Event.h
RESTRICTIONS when using TRefArray
---------------------------------
- Elements in a TRefArray cannot point to a TFile or TDirectory.
- All elements of a TRefArray must be set in the same process,
In particular, one cannot modify some elements of the array in
a different process.
Use an array of TRef when one of the above restrictions is met.
TRefArray(Int_t s, Int_t lowerBound)
Create an object array. Using s one can set the array size
and lowerBound can be used to set the array lowerbound
index (default is 0).
void AddFirst(TObject *obj)
Add object in the first slot of the array. This will overwrite the
first element that might have been there. To have insertion semantics
use either a TList or a TOrdCollection.
void AddBefore(const TObject *before, TObject *obj)
Add object in the slot before object before. If before=0 add object
in the first slot. Note that this will overwrite any object that
might have already been in this slot. For insertion semantics use
either a TList or a TOrdCollection.
void AddAfter(const TObject *after, TObject *obj)
Add object in the slot after object after. If after=0 add object in
the last empty slot. Note that this will overwrite any object that
might have already been in this slot. For insertion semantics use
either a TList or a TOrdCollection.
void AddAt(TObject *obj, Int_t idx)
Add object at position ids. Give an error when idx is out of bounds
(i.e. the array is not expanded).
TObject * After(const TObject *obj)
Return the object after obj. Returns 0 if obj is last object.
TObject * Before(const TObject *obj)
Return the object before obj. Returns 0 if obj is first object.
void Streamer(TBuffer &R__b)
Stream all objects in the array to or from the I/O buffer.
TObject * Last()
Return the object in the last filled slot. Returns 0 if no entries.
Int_t GetEntries()
Return the number of objects in array (i.e. number of non-empty slots).
Attention: use this method ONLY if you want to know the number of
non-empty slots. This function loops over the complete array and
is therefore very slow when applied in a loop. Most of the time you
better use GetLast()+1.
Int_t GetAbsLast()
Return absolute index to last object in array. Returns -1 in case
array is empty.
Int_t GetLast()
Return index of last object in array. Returns lowerBound-1 in case
array is empty.
Int_t IndexOf(const TObject *obj)
obj != 0 Return index of object in array.
Returns lowerBound-1 in case array doesn't contain the obj.
obj == 0 Return the index of the first empty slot.
Returns lowerBound-1 in case array doesn't contain any empty slot.
void SetLast(Int_t last)
Set index of last object in array, effectively truncating the
array. Use carefully since whenever last position has to be
recalculated, e.g. after a Remove() or Sort() it will be reset
to the last non-empty slot. If last is -2 this will force the
recalculation of the last used slot.
void Sort(Int_t)
If objects in array are sortable (i.e. IsSortable() returns true
for all objects) then sort array.
Int_t BinarySearch(TObject *, Int_t)
Find object using a binary search. Array must first have been sorted.
Search can be limited by setting upto to desired index.
Author: Rene Brun 02/10/2001
Last update: root/cont:$Name: $:$Id: TRefArray.cxx,v 1.24 2006/02/17 05:16:38 pcanal Exp $
Copyright (C) 1995-2001, 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.