#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

#317 in Data structures

Download history 1219/week @ 2024-09-21 1054/week @ 2024-09-28 1076/week @ 2024-10-05 1031/week @ 2024-10-12 948/week @ 2024-10-19 698/week @ 2024-10-26 1271/week @ 2024-11-02 1117/week @ 2024-11-09 1047/week @ 2024-11-16 647/week @ 2024-11-23 612/week @ 2024-11-30 776/week @ 2024-12-07 597/week @ 2024-12-14 274/week @ 2024-12-21 187/week @ 2024-12-28 238/week @ 2025-01-04

1,359 downloads per month
Used in 25 crates (12 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

~320KB