| library: libCore #include "TOrdCollection.h" |

| TOrdCollectionIter(const TOrdCollectionIter& iter) | |
| TOrdCollectionIter(const TOrdCollection* col, Bool_t dir = kIterForward) | |
| ~TOrdCollectionIter() | |
| static TClass* | Class() |
| virtual const TCollection* | GetCollection() const |
| virtual Option_t* | TIterator::GetOption() const |
| virtual TClass* | IsA() const |
| virtual TObject* | Next() |
| TObject* | TIterator::operator()() |
| 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) |
| TOrdCollectionIter() |
| const TOrdCollection* | fCol | collection being iterated |
| Int_t | fCursor | current position in collection |
| Bool_t | fDirection | iteration direction |
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 collection iterator. By default the iteration direction is kIterForward. To go backward use kIterBackward.