class TObjArray: public TSeqCollection

 Create an object array. Using s one can set the array size (default is
 kInitCapacity=16) and lowerBound can be used to set the array lowerbound
 index (default is 0).

 Create a copy of TObjArray a. Note, does not copy the kIsOwner flag.

 Delete an array. Objects are not deleted unless the TObjArray is the
 owner (set via SetOwner()).

 Assignment operator. Note, unsets the kIsOwner flag.

 Return the object at position i. Returns address at position 0
 if i is out of bounds. Result may be used as an lvalue.

 Return the object at position at. Returns 0 if i is out of bounds.

 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.

 Add object in the next empty slot in the array. Expand the array
 if necessary.

 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.

 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.

 Add object at position idx. If idx is larger than the current size
 of the array, expand the array (double its size).

 Add object at position ids. Give an error when idx is out of bounds
 (i.e. the array is not expanded).

 Return the position of the new object.
 Find the first empty cell or AddLast if there is no empty cell

 Return the object after obj. Returns 0 if obj is last object.

 Return the object before obj. Returns 0 if obj is first object.

 Remove all objects from the array. Does not delete the objects
 unless the TObjArray is the owner (set via SetOwner()).

 Remove empty slots from array.

 Remove all objects from the array AND delete all heap based objects.

 Expand or shrink the array to newSize elements.

 Find an object in this collection using its name. Requires a sequential
 scan till the object has been found. Returns 0 if object with specified
 name is not found.

 Find an object in this collection using the object's IsEqual()
 member function. Requires a sequential scan till the object has
 been found. Returns 0 if object is not found.
 Typically this function is overridden by a more efficient version
 in concrete collection classes (e.g. THashTable).

 Stream all objects in the array to or from the I/O buffer.

 Return the object in the first slot.

 Return the object in the last filled slot. Returns 0 if no entries.

 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 GetEntriesFast() (only in case when there are no empty slots).

 Return absolute index to last object in array. Returns -1 in case
 array is empty.

 Return index of last object in array. Returns lowerBound-1 in case
 array is empty.

 Return address of pointer obj. If obj is 0 returns address of container.

 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.

 Initialize a TObjArray.

 Returns an array iterator.

 Generate an out-of-bounds error. Always returns false.

 Remove object from this collection and recursively remove the object
 from all other objects (and collections).

 Remove object at index idx.

 Remove object from array.

 Remove objects from index idx1 to idx2 included.

 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.
 If last is -1, this effectively truncate the array completely.

 Randomize objects inside the array, i.e. permute randomly objects.
 With fLast being the index of the last entry in the array, the following
 algorithm is applied to the array:
   - for each entry j between 0 and fLast, another entry k is chosen
     randomly between 0 and fLast.
   - the objects at j and k are swapped.
   - this process is repeated ntimes (ntimes = 1 by default).

 If objects in array are sortable (i.e. IsSortable() returns true
 for all objects) then sort array.

 Find object using a binary search. Array must first have been sorted.
 Search can be limited by setting upto to desired index.

 Return the object at position i. Returns 0 if i is out of bounds.