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 can be found here and the cargo crate can be found here.
The various range methods only work on the nightly version of Rust and
consequently are only enabled with the unstable feature.