#collection #skiplist #sorted

skiplist

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

15 releases

0.4.0 Jun 29, 2021
0.3.0 Feb 10, 2020
0.2.10 Jan 29, 2016
0.2.9 Dec 12, 2015
0.2.2 Mar 5, 2015

#397 in Data structures

Download history 238/week @ 2022-11-27 222/week @ 2022-12-04 259/week @ 2022-12-11 234/week @ 2022-12-18 183/week @ 2022-12-25 243/week @ 2023-01-01 282/week @ 2023-01-08 264/week @ 2023-01-15 250/week @ 2023-01-22 322/week @ 2023-01-29 307/week @ 2023-02-05 264/week @ 2023-02-12 312/week @ 2023-02-19 231/week @ 2023-02-26 263/week @ 2023-03-05 247/week @ 2023-03-12

1,100 downloads per month
Used in 12 crates (6 directly)

MIT license

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