From: Dave Abrahams (abrahams_at_[hidden])
Date: 1999-07-07 07:59:40
> The way STL algorithms access containers is through
> iterators; but since you cannot modify the layout of a
> container without access to the container itself, some
> of these algorithms have weird interfaces. This library
> provides algorithms which directly manipulate the
> containers.
It's a good concept. I agree with Nico that the node_based part is
distasteful. Why not just call the algorithm erase_and_return_count or
something? It could give different efficiency guarantees for non-node-based
containers That would be analogous to the other STL components which have
different performance depending on iterator category.
-Dave
------------------------------------------------------------------------
eGroups.com home: http://www.egroups.com/group/boost
http://www.egroups.com - Simplifying group communications