|
Boost : |
From: Jeremy Siek (jsiek_at_[hidden])
Date: 2001-07-11 13:57:14
Yes, iterator stability would be problematic.
The implementation approach suggested by Peter (using a linked list to
store the elements, and then store iterators into the linked list from a
vector) would provide iterator stability, however, this would be more
costly in terms of space and traversal speed than the approach I
suggested.
On Wed, 11 Jul 2001, John E. Potter wrote:
>
> On Wed, 11 Jul 2001, David Abrahams wrote:
>
> > Just for additional motivation, part of the reason for a stable container
> > adaptor is to allow people to make associative containers based on sorted
> > vectors, whose elements have pointer, reference, and iterator stability just
> > like the standard associative containers do.
>
> Stable pointer and reference, yes. Stable iterator, I don't see it.
>
> John
>
>
> Info: http://www.boost.org Unsubscribe: <mailto:boost-unsubscribe_at_[hidden]>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>
>
----------------------------------------------------------------------
Jeremy Siek www: http://www.lsc.nd.edu/~jsiek/
Ph.D. Candidate, IU B'ton email: jsiek_at_[hidden]
Summer Manager, AT&T Research phone: (973) 360-8185
----------------------------------------------------------------------
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk