stable-skiplist
| Crates.io | stable-skiplist |
| lib.rs | stable-skiplist |
| version | 0.1.1 |
| source | src |
| created_at | 2016-07-07 02:10:09.890089 |
| updated_at | 2016-07-07 02:13:03.186046 |
| description | Skiplist implementation in rust, providing fast insertion and removal. A normal skiplist is implemented, as well as an ordered skiplist and a skipmap. This is modified to work on stable Rust 1.9.0. |
| homepage | |
| repository | https://github.com/rocallahan/rust-stable-skiplist |
| max_upload_size | |
| id | 5599 |
| size | 201,512 |
Robert O'Callahan (rocallahan)
documentation
https://rocallahan.github.io/rust-stable-skiplist/doc/stable_skiplist/
README
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.
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.