Re: [boost] Offering sorted_vector for Boost, any interest?

Subject: Re: [boost] Offering sorted_vector for Boost, any interest?
From: Robert Ramey (ramey_at_[hidden])
Date: 2012-02-15 15:22:55

Frank Birbacher wrote:
>
> I've come across lots of code that uses std::set where I think a
> sorted vector would perform better. Those places a characterized by:
> 1. fills the set only once,
> 2. just wants to drop duplicates or
> 3. calls set::find very often.
> Facing such code I often wished there was a ready to use sorted_vector
> implementation.

how would this be different than just

a) using std::vector
b) use std::sort to sort it
c) use std::bsearch to find the element you're looking for

I see no library here.

Robert Ramey