#sorting #multiple #key #values #multiple-values #list #structure

sorted-list

Simple SortedList data structure which allows mapping an Ord key to multiple distinct PartialEq values

2 unstable releases

Uses old Rust 2015

0.2.0 Mar 29, 2017
0.1.0 Mar 29, 2017

#2163 in Data structures

Download history 68/week @ 2023-12-14 15/week @ 2023-12-21 3/week @ 2023-12-28 6/week @ 2024-01-04 16/week @ 2024-01-11 113/week @ 2024-01-18 131/week @ 2024-01-25 20/week @ 2024-02-01 53/week @ 2024-02-08 45/week @ 2024-02-15 33/week @ 2024-02-22 45/week @ 2024-02-29 53/week @ 2024-03-07 47/week @ 2024-03-14 66/week @ 2024-03-21 37/week @ 2024-03-28

210 downloads per month

MIT license

27KB
659 lines

SortedList

Build Status Docs

Data structure similar to SortedList found in .NET for rust. Naive implementation based on Vec<K> and Vec<V>. Same key can be mapped to multiple values, and the values are stored in insertion order.

Unsupported:

  • deletion
  • range queries (requires feature = "nightly" and a nightly compiler)

Cargo.toml

[dependencies]
sorted-list = "0.1"

or:

[dependencies]
sorted-list = { git = "https://github.com/koivunej/sorted-list.git" }

License

MIT.


lib.rs:

Simple sorted list collection like the one found in the .NET collections library.

No runtime deps

Features