Well, I really cannot say who said what, or who I'm answering to, but - 
In Celeste, this could make recovery after image crashes faster. With
SortedCollections re-adding the n logged actions done before the crash
takes n^2 time, with SkipLists, presumably, n*log(n).

Or we could tweak Celeste to not update this list during recovery, and
resort it once later.
Still nicer to just have nice behaving data structures...

Anyone know what this thing eats in memory usage?

Daniel

Karl Ramberg <karl.ramberg at chello.se> wrote:
> On Tue, 25 Sep 2001, Andreas Raab wrote:
> 
> > Folks,
> >
> > I noticed them coming into Squeak a while ago and always since I wanted to
> > ask this question: What the heck are they good for?! ;-) I don't see them
> Basically, Skiplists (and/or balanced tree implementations of
> SortedCollection) should be used anywhere where you have a lot of
> inserts/removals from a sorted collection, and profiling shows that that
> is a problem.
> 
> Scott