From: Sofus Mortensen (list_at_[hidden])
Date: 2001-11-05 16:54:52
I wonder what skip list's will bring us that we don't already have with
either set/multiset or map/multimap ?
Am I correct in thinking that skip list's is nothing but an (randomized)
alternative to the usual red-black tree implementation of STL set/map?
Comet - Grunge free COM programming in C++
> -----Original Message-----
> From: Gary Powell [mailto:powellg_at_[hidden]]
> Sent: Monday, November 05, 2001 10:38 PM
> To: boost_at_[hidden]
> Subject: RE: [boost] Re: Skip List
> > I think that given the initial response of confusion and so
> on, I am
> > probably fairly alone in having use for this odd-ball...so
> I will go
> > back to my corner.
> Don't give up so easily! I think people are responding that
> way because they are genuinely interested in having/learning
> about an additional associative container technology.
> Requests for clarification are one of the best things about
> boost: they help one clarify one's thinking and improve one's
> code. <<<<
> Here Here! There have been at least 2 articles in C/C++
> User's Journal with code for Skip Lists. I'm not sure that
> either of those were "standard conformant" and they did pique
> my interest. I haven't written one because I've been able to
> get by with other containers, but that doesn't mean I
> wouldn't like additional choices.
> Info: http://www.boost.org Unsubscribe:
> Your use of
> Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk