From: Beman Dawes (bdawes_at_[hidden])
Date: 2001-11-05 11:59:10
At 09:46 PM 11/4/2001, Michael wrote:
>To correct something here, the URL is
>This is a rather naive implementation of the skip list data structure.
Always hard to tell without docs, but it looks like whatever you
implemented is quite a bit different from Bill Pugh's original June, 1990,
CACM description of this data structure. The node structure looks way
different, or am I just misreading your code?
Do you have a reference to a description of your data structure and how it
differs from Pugh's?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk