TOrdCollection

class TOrdCollection : public TSeqCollection

    private:

      Bool_t IllegalIndex(char* method, Int_t idx)
        void Init(Int_t capacity)
       Int_t LogIndex(Int_t idx)
      Bool_t LowWaterMark()
        void MoveGapTo(Int_t newGapStart)
       Int_t PhysIndex(Int_t idx)
        void SetCapacity(Int_t newCapacity)

    public:

          TOrdCollection TOrdCollection(Int_t capacity = kDefaultCapacity)
            virtual void ~TOrdCollection()
            virtual void AddAfter(TObject* after, TObject* obj)
            virtual void AddAt(TObject* obj, Int_t idx)
            virtual void AddBefore(TObject* before, TObject* obj)
            virtual void AddFirst(TObject* obj)
            virtual void AddLast(TObject* obj)
        virtual TObject* After(TObject* obj)
        virtual TObject* At(Int_t idx)
        virtual TObject* Before(TObject* obj)
                   Int_t BinarySearch(TObject* obj)
                 TClass* Class()
            virtual void Clear(Option_t* option)
            virtual void Delete(Option_t* option)
        virtual TObject* First()
           virtual Int_t IndexOf(TObject* obj)
         virtual TClass* IsA()
        virtual TObject* Last()
      virtual TIterator* MakeIterator(Bool_t dir = kIterForward)
                    void PutAt(TObject* obj, Int_t idx)
        virtual TObject* Remove(TObject* obj)
            virtual void RemoveAt(Int_t idx)
            virtual void ShowMembers(TMemberInspector& insp, char* parent)
                    void Sort()
            virtual void Streamer(TBuffer& b)

  Data Members
    private:

      TObject** fCont      
          Int_t fCapacity  
          Int_t fGapStart  
          Int_t fGapSize   

    public:

      static const enum TObject:: kDefaultCapacity  
      static const enum TObject:: kMinExpand        
      static const enum TObject:: kShrinkFactor     

Class Description

                                                                      
 TOrdCollection                                                       
                                                                      
 Ordered collection. An ordered collection has TList insertion        
 semantics but is implemented using an array of TObject*'s. It uses   
 less space than a TList (since there is no need for the prev and     
 next pointers), but it is more costly to insert objects (since it    
 has to create a gap by copying object pointers). TOrdCollection      
 is better than TList when objects are only added at the end of the   
 collection since no copying needs to be done.                        

/*

*/

                                                                      

 Create an ordered collection.

 Delete the collection. Objects are not deleted.

 Insert object at position idx in the collection.

 Insert object at beginning of collection.

 Add object at the end of the collection.

 Insert object before object before in the collection.

 Insert object after object after in the collection.

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

 Returns the object at position idx. Returns 0 if idx is out of range.

 Returns the object before object obj. Returns 0 if obj is first
 in collection.

 Remove all objects from the collection. Does not delete the objects.

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

 Return the first object in the collection. Returns 0 when collection
 is empty.

 Return the last object in the collection. Returns 0 when collection
 is empty.

 Return true when index out of bounds and print error.

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

 Initialize ordered collection.

 Return an ordered collection iterator.

 Move gap to new position. Gap needs to be moved when objects are
 inserted not at the end.

 Put object at index idx. Overwrites what was at idx before.

 Remove object at index idx.

 Remove object from collection.

 Set/change ordered collection capacity.

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

 Find object using a binary search. Collection must first have been
 sorted.

Inline Functions

              Int_t PhysIndex(Int_t idx)
              Int_t LogIndex(Int_t idx)
             Bool_t LowWaterMark()
            TClass* Class()
            TClass* IsA()
               void ShowMembers(TMemberInspector& insp, char* parent)
               void Streamer(TBuffer& b)