library: libCore #include "TOrdCollection.h"

# TOrdCollectionIter

class description - source file - inheritance tree (.pdf)

## class TOrdCollectionIter : public TIterator

| Inheritance Chart:
`TIterator`
| <- | `TOrdCollectionIter` |

        private:

                             TOrdCollectionIter()

        public:

                                     TOrdCollectionIter(const TOrdCollection* col, Bool_t dir = kIterForward)
                                     TOrdCollectionIter(const TOrdCollectionIter& iter)
                                     ~TOrdCollectionIter()
                      static TClass* Class()
          virtual const TCollection* GetCollection() const
                     virtual TClass* IsA() const
                    virtual TObject* Next()
                  virtual TIterator& operator=(const TIterator& rhs)
                 TOrdCollectionIter& operator=(const TOrdCollectionIter& rhs)
                        virtual void Reset()
                        virtual void ShowMembers(TMemberInspector& insp, char* parent)
                        virtual void Streamer(TBuffer& b)
                                void StreamerNVirtual(TBuffer& b)

### Data Members

        private:

          const TOrdCollection* fCol        collection being iterated
                          Int_t fCursor     current position in collection
                         Bool_t fDirection  iteration direction

## 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.

/* */

TOrdCollectionIter(const TOrdCollection *col, Bool_t dir)

     Create collection iterator. By default the iteration direction
     is kIterForward. To go backward use kIterBackward.

TOrdCollectionIter(const TOrdCollectionIter &iter) : TIterator(iter)

     Copy ctor.

TObject* Next()

     Return next object in collection. Returns 0 when no more objects in
     collection.

void Reset()

     Reset collection iterator.

### Inline Functions

                           void ~TOrdCollectionIter()
             TOrdCollectionIter TOrdCollectionIter(const TOrdCollectionIter& iter)
                     TIterator& operator=(const TIterator& rhs)
            TOrdCollectionIter& operator=(const TOrdCollectionIter& rhs)
             const TCollection* GetCollection() const
                        TClass* Class()
                        TClass* IsA() const
                           void ShowMembers(TMemberInspector& insp, char* parent)
                           void Streamer(TBuffer& b)
                           void StreamerNVirtual(TBuffer& b)

Author: Fons Rademakers 13/09/95
Last update: root/cont:$Name: $:$Id: TOrdCollection.cxx,v 1.12 2004/11/12 21:51:18 brun Exp $
Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *