class TSeqCollection: public TCollection

 Return index of object in collection. Returns -1 when object not found.
 Uses member IsEqual() to find object.

 Returns index of last object in collection. Returns -1 when no
 objects in collection.

 Compare to objects in the collection. Use member Compare() of object a.

 Sort array of TObject pointers using a quicksort algorithm.
 The algorithm used is a non stable sort (i.e. already sorted
 elements might switch/change places).
 Uses ObjCompare() to compare objects.

 Sort array a of TObject pointers using a quicksort algorithm.
 Arrays b will be sorted just like a (a determines the sort).
 Argument nBs is the number of TObject** arrays in b.
 The algorithm used is a non stable sort (i.e. already sorted
 elements might switch/change places).
 Uses ObjCompare() to compare objects.

 Merge this collection with all collections coming in the input list. The
 input list must contain other collections of objects compatible with the
 ones in this collection and ordered in the same manner. For example, if this
 collection contains a TH1 object and a tree, all collections in the input
 list have to contain a histogram and a tree. In case the list contains
 collections, the objects in the input lists must also be collections with
 the same structure and number of objects.
 If some objects inside the collection are instances of a class that do not
 have a Merge function (like TObjString), rather than merging, a copy of each
 instance (via a call to Clone) is appended to the output.

 Example

   this                          list
 ____________                  ---------------------|
 | A (TH1F) |  __________      | L1 (TSeqCollection)|- [A1, B1(C1,D1,E1)]
 | B (TList)|-| C (TTree)|     | L1 (TSeqCollection)|- [A2, B2(C2,D2,E2)]
 |__________| | D (TH1F) |     | ...                |- [...]
              | E (TH1F) |     |____________________|
              |__________|