#sorting #collection #node-index

skiplist

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

17 releases

0.5.1 Apr 4, 2023
0.5.0 Mar 31, 2023
0.4.0 Jun 29, 2021
0.3.0 Feb 10, 2020
0.2.2 Mar 5, 2015

#211 in Data structures

Download history 1151/week @ 2024-06-14 1521/week @ 2024-06-21 896/week @ 2024-06-28 707/week @ 2024-07-05 871/week @ 2024-07-12 782/week @ 2024-07-19 988/week @ 2024-07-26 2400/week @ 2024-08-02 1575/week @ 2024-08-09 1292/week @ 2024-08-16 1203/week @ 2024-08-23 1614/week @ 2024-08-30 1432/week @ 2024-09-06 779/week @ 2024-09-13 1196/week @ 2024-09-20 957/week @ 2024-09-27

4,607 downloads per month
Used in 21 crates (11 directly)

MIT license

195KB
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

~310KB