Rust Stable Skiplist

A skiplist provides a way of storing data with log(i) access, insertion and removal for an element in the ith position.

There are three kinds of collections defined here:

• SkipList This behaves like nearly any other double-ended list.
• OrderedSkipList Ensures that the elements are always sorted. Still allows for access nodes at a given index.
• SkipMap A map in which the keys are ordered.

Documentation here, crate here.

This was forked from https://github.com/JP-Ellis/rust-skiplist and modified to use its own version of Bound, so that its range methods are usable with stable Rust.