On Wed, Apr 28, 2004 at 06:13:19AM +0100, Jon Harrop wrote:
> On Wednesday 28 April 2004 5:31 am, Brian Hurt wrote:
> > It's been too long since I've used the STL- what data structures and
> > algorithms does it provide?
> 
> The main thing is that it is iterator-centric, so you pass iterators around 
> instead of containers. For example, to represent a subarray without having to 
> copy it. These iterators are classified according to their abilities (e.g. 

That's not necessarily a good thing.  For one, it leads to complexity.
What if you modify the parent array?  Would the iterator show the new or
original values?  What if you truncate the parent?  Would the iterator
produce fewer results than it originally promised?  And of course, you
can't so nicely use iterators in match clauses like you can lists.

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners