On Wed, 2010-12-22 at 11:03 -0500, Eric Vander Weele wrote: > Hello, > > > Before I started working on this, I wanted to bounce the idea of > adding a skip list -- GSkipList. It shouldn't be that more > complicated than the balanced binary tree implementation and the test > driver for a skip list would almost be the same as the the one for the > balanced binary tree. What would be the advantage over GSequence (which internally uses a balanced binary tree)? Would you implement a deterministic (which of the many variants?) or probabilistic skip list (would you expose the level selection probability to allow slower but less memory hungry skiplists?)?
Attachment:
signature.asc
Description: This is a digitally signed message part