#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

#2400 in Data structures

Download history 69/week @ 2024-07-21 110/week @ 2024-07-28 64/week @ 2024-08-04 180/week @ 2024-08-11 123/week @ 2024-08-18 149/week @ 2024-08-25 167/week @ 2024-09-01 106/week @ 2024-09-08 71/week @ 2024-09-15 159/week @ 2024-09-22 121/week @ 2024-09-29 58/week @ 2024-10-06 165/week @ 2024-10-13 86/week @ 2024-10-20 76/week @ 2024-10-27 82/week @ 2024-11-03

414 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