From: Joaquín Mª López Muñoz (joaquin_at_[hidden])
Date: 2003-10-30 15:03:31
Eric Frias ha escrito:
> On Thu, 30 Oct 2003, Vladimir Prus wrote:
> >> I was recently looking for a beast similar, but not exactly the same as
> >> the numbered_set you describe. Basically, I wanted an "Sequence Set". I
> >> want Sequence-like iteration and insertion/removal behavior, but I want
> >> O(log n) search. I also want to maintain the invariant that a
> >> particular value appears only once in the set.
> > Looks very similiar to what I wanted.
> I just wanted to chime in with a big "me too!" We have a need for this
> "Sequence Set" object in many places in our code. We have a lot of
> intrusive lists, and we've written a wrapper that keeps the list in sync
> with a set. But we've been migrating slowly towards using non-intrusive
> containers, and we need a stl-compatible class to use.
Umm... I didn't expect this sequence set to be such a sought after thing.
As I said before, indexed_set is designed for future inclusion of alternative
types of indices. I can try to hack a proof-of-concept "list index" to
see how it fits, if there's interest in this.
Joaquín M López Muñoz
Telefónica, Investigación y Desarrollo
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk