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

From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-01-08 09:26:33

----- Original Message -----
From: "Greg Colvin" <gcolvin_at_[hidden]>

> 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?

Get ahold of Matt Austern's article "Why You Shouldn't Use set - and What
You Should Use Instead", C++ Report 12:4, April 2000. You might ask him for
it.

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

I haven't seen a BTree implementation in years, but I'm guessing it
generates lots of code and has complicated iterators, too. I'm sure it's
sometimes useful, but it doesn't have many of the attractive qualities of a
sorted vector.

-Dave