#skip-list #sorting #collection

xskiplist

Skiplist implementation in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap.

1 unstable release

0.1.0 Feb 7, 2025

#742 in Data structures

MIT license

200KB
4K SLoC

Rust Skiplist

crates.io crates.io Codecov branch Build Status

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 on docs.rs and the cargo crate can be found on crates.io.

Dependencies

~1MB
~17K SLoC