(ref.doc)JOOP 9/6

October 96
Volume 9, No. 6

New Thinking on Education & Training

p 38 C++
Arithmetic sequence iterators
by Andrew Koenig
  A small class that acts as an iterator, but generates the elements
  as needed, to which it grants access.
  Example of non initializing useless data, and using an empty
  sequence produced by the default constructor, as the end iterator.
  Uses for initializing other containers or in place of explicit loops.

p 76 Ada
Ada Pointers: Access to information
by Richard Riehle
  Without pointers, it is nearly impossible to design recursive data
  types for structural patterns such as linked lists, trees, graphs
  and spare matrices.