Skiplist implementation in rust
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
gh-pages @ b381e8e
pages @ b273ebe Add gh-pages and pages as submodules. Jan 29, 2016
src Use rustfmt. Jan 29, 2016
.gitignore Initial commit. Mar 3, 2015
.gitmodules Fix submodules. Jan 29, 2016
.travis.yml Fix travis.yml to test with unstable features. Dec 12, 2015
Cargo.toml Bump version to 0.2.10. Jan 29, 2016
LICENSE Initial commit. Mar 3, 2015
README.md

README.md

Rust Skiplist crates.io crates.io 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 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.