#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

#2279 in Data structures

Download history 52/week @ 2024-03-11 48/week @ 2024-03-18 64/week @ 2024-03-25 86/week @ 2024-04-01 26/week @ 2024-04-08 206/week @ 2024-04-15 57/week @ 2024-04-22 56/week @ 2024-04-29 76/week @ 2024-05-06 107/week @ 2024-05-13 168/week @ 2024-05-20 52/week @ 2024-05-27 21/week @ 2024-06-03 175/week @ 2024-06-10 21/week @ 2024-06-17 56/week @ 2024-06-24

278 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