#sorting #node-key #collection

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

#459 in Data structures

Download history 574/week @ 2024-11-29 807/week @ 2024-12-06 570/week @ 2024-12-13 350/week @ 2024-12-20 175/week @ 2024-12-27 314/week @ 2025-01-03 481/week @ 2025-01-10 681/week @ 2025-01-17 347/week @ 2025-01-24 504/week @ 2025-01-31 786/week @ 2025-02-07 663/week @ 2025-02-14 412/week @ 2025-02-21 490/week @ 2025-02-28 431/week @ 2025-03-07 452/week @ 2025-03-14

1,846 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

~330KB