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

From: Greg Colvin (gcolvin_at_[hidden])
Date: 2002-01-07 18:40:22

From: "David Abrahams" <david.abrahams_at_[hidden]>
> From: "Greg Colvin" <gcolvin_at_[hidden]>
> > From: "dave_abrahams" <david.abrahams_at_[hidden]>
> > > Reviving an old thread:
> >
> > I'd forgotten about this thread, so remind me please, in
> > what way does std::multimap fail to meet your needs for
> > an associative container.
> 
> Too big (both code and data), too slow (no locality of reference,
> complicated iterators) and generally inferior to a sorted vector for almost
> all applications I've tried.

Makes sense.

At what point do you think the expense of frequent
insertions and deletions would start to make multimap
or some other tree-based design a contender?

Perhaps an in-memory BTree would be a good compromise?