Re: [boost] Re: Proposal: Sorted Vector Container

From: David Abrahams (david.abrahams_at_[hidden])
Date: 2001-11-20 05:36:50

I'm really glad that someone is taking an active interest in this subject
again!

Please have a look at

http://groups.yahoo.com/group/boost/message/3226
http://groups.yahoo.com/group/boost/message/3777
http://groups.yahoo.com/group/boost/files/associative_vector/

Without having looked at your code, I'll surmise that iterator stability is
acheived by embedding a reference to the vector and an offset in the
iterator. I am not convinced that iterator stability is usually worth the
cost, and I'd rather not pay for it if I wasn't going to use it. My plan for
implementing stability was to provide pointer/reference stability via an
indirect_container adaptor which uses boost::indirect_iterator (In fact,
this is the work that spawned the Boost Iterator Adaptors Library). This
approach has several advantages, not least that reallocating the vector
becomes very cheap because it just has to copy POD data.

-Dave

----- Original Message -----
From: "Corwin Joy" <cjoy_at_[hidden]>
To: <boost_at_[hidden]>
Sent: Tuesday, November 20, 2001 3:14 AM
Subject: [boost] Re: Proposal: Sorted Vector Container

> --- In boost_at_y..., "Corwin Joy" <cjoy_at_h...> wrote:
> > Michael Gradman and myself have uploaded a new contaier to the
> > boost files area in a folder called vec_multiset.
> >
>
> One more comment.  So far, we have tested this with Visual C++ 6.0
> and GCC 2.96.
>
>
> 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/
>
>