Generic Progpammimg Iterators

I am studying from C++ Primer Plus third edition and have reached the point that os trying to explain iterators and Generic Programming. This seems like the hardest point in the book and I was hoping for some input from the board. ie code examples further tutorials whatever you can post to help me understand iterators and generic programming would be much appreciated!

In my data structures and algo class we had to do this, make some iterators for a class we designed earlier in the year.
It was probably the hardest lab that we had to do, but that was becuase the handout we got was pretty vague, and was more like fill in the code blanks.
Im sorry to say i dont have that code anymore
If i find anythink ill post it here

As far as I know the STL uses interators to acesses generic containers because the implementation of the containers are different. For example, vectors are useful for random access and Lists are useful for deleting/adding members within the container. Each STL container has strength and weaknesses and the iterator is different for each container. I believe that the iterators are part of an inheritance hierarchy, not 100% sure of that though.

The following only pertains to the STL

STL iterators are not part of a hierarchy. While their implementation is all different, they can be classified into five distinct categories,

random access, most powerful, can access arbitrary points (100 ahead, 50 back) in constant time. Can be written to and read from. vector iterators are random access.

bidirectional. Can iterate one element at a time, forward or backward. A random access iterator has a superset of the abilities of a bidirectional iterator. list iterators are bidirectional.

single directional (forward?). Can iterate only forward through a forward iterator. Can read and write to it. slist (non-standard) singly linked list class iterators are forward iterators.

output iterator. Can only be written to. Used in output streams.

input iterator. Can only be read from, used in input streams.

They could be made into an inheritance hierarcy, but they are not. If you want to exploit their genericity, you need to use templates.

My book is in my truck, but it mentioned that something was part of a hierarchy. I'll look it up sometime.

C++ uses internal iterators, the iterator object controls the iteration rather than the client.

I have the whole design pattern literature, and my C++ book that said something about it, but I didn't find it yet.

I appreciate your posts.
I am still interested in how to implement iterators for container classes (user defined) and code examples using the Hierarchy mentioned above especially the lower level iterators(input, output etc.)

C++ primer plus just brushes over this area showing mostly how to use iterators not how to create them.

I have not looked at my book yet, however if you want a real reference with examples than get the Gang Of Four book called, Design Patterns. According to the Gang Of Four (PHD Doctors of CS), they list iterator as a behavioral pattern. To tell you the truth, at this time, it is over my head, but there are 14 pages just on the iterator pattern alone.

ISBN: 0201633612

BTW this book is the bible of design patterns.