#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

#247 in Data structures

Download history 796/week @ 2024-07-21 991/week @ 2024-07-28 2537/week @ 2024-08-04 1431/week @ 2024-08-11 1267/week @ 2024-08-18 1383/week @ 2024-08-25 1535/week @ 2024-09-01 1441/week @ 2024-09-08 697/week @ 2024-09-15 1270/week @ 2024-09-22 973/week @ 2024-09-29 1111/week @ 2024-10-06 981/week @ 2024-10-13 933/week @ 2024-10-20 783/week @ 2024-10-27 1395/week @ 2024-11-03

4,208 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

~315KB