#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

#249 in Data structures

Download history 2691/week @ 2024-08-07 1169/week @ 2024-08-14 1298/week @ 2024-08-21 1621/week @ 2024-08-28 1388/week @ 2024-09-04 1055/week @ 2024-09-11 1063/week @ 2024-09-18 1119/week @ 2024-09-25 974/week @ 2024-10-02 1070/week @ 2024-10-09 1000/week @ 2024-10-16 883/week @ 2024-10-23 872/week @ 2024-10-30 1325/week @ 2024-11-06 1043/week @ 2024-11-13 876/week @ 2024-11-20

4,303 downloads per month
Used in 23 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

~320KB