Add a simple implementation of skiplists for efficient numerical range based operations. They are currently implemented naively for the numerical key value with an exponential segmented array. Unlike a heap, they do not have any cascading cost.
Add a simple implementation of skiplists for efficient numerical range based operations. They are currently implemented naively for the numerical key value with an exponential segmented array. Unlike a heap, they do not have any cascading cost.