Re: Missing in Booch: range operations

[mheaney@on2.com (Matthew Heaney)]

porton@ex-code.com (Victor Porton) wrote in message news:<3dcccf4d$0$308$bed64819@news.gradwell.net>...
> 
> For some classes of containers e.g. for linked lists it is
> possible: throw an exception if te end of list reached
> (actually Ada compilers will throw these "automagically").

Yes, that's true, but the problem is that you don't always iterate to
the back of the container, ie

   I : Iterator_Type := Find_X (First (C), Back (C));
   J : Iterator_Type := Find_Not_X (I, Back (C));
begin
   while I /= J loop 

In this example iterator J probably does *not* designate the end of
the container.

 
> A good thing to have a debug version where iterators "know"
> about containers.

If there's interest, I could always supply checked versions, that
implement the iterators and the containers with whatever extra state
is necessary to check that the iterators are being used properly.


> See www.STLport.org for an C++ STL with extensive debugging.

Yes, I am familiar with this implementation.  Perhaps we could use
this as a model to build a debug version of Charles.