18 releases

0.8.3 Sep 28, 2023
0.8.2 Jan 4, 2023
0.8.1 Nov 13, 2022
0.8.0 Apr 10, 2022
0.3.1 Mar 19, 2019

#91 in Data structures

Download history 1398/week @ 2023-11-01 1380/week @ 2023-11-08 1759/week @ 2023-11-15 1802/week @ 2023-11-22 1688/week @ 2023-11-29 1735/week @ 2023-12-06 1786/week @ 2023-12-13 1830/week @ 2023-12-20 1325/week @ 2023-12-27 2008/week @ 2024-01-03 1644/week @ 2024-01-10 2344/week @ 2024-01-17 2582/week @ 2024-01-24 3359/week @ 2024-01-31 4618/week @ 2024-02-07 3615/week @ 2024-02-14

14,524 downloads per month
Used in 38 crates (13 directly)

Apache-2.0

48KB
1K SLoC

sorted_vec

Create and maintain collections of sorted elements.

Documentation

let mut v = SortedVec::new();
assert_eq!(v.insert (5), 0);
assert_eq!(v.insert (3), 0);
assert_eq!(v.insert (4), 1);
assert_eq!(v.insert (4), 1);
assert_eq!(v.len(), 4);
v.dedup();
assert_eq!(v.len(), 3);
assert_eq!(v.binary_search (&3), Ok (0));
assert_eq!(*SortedVec::from_unsorted (
  vec![5, -10, 99, -11, 2, 17, 10]),
  vec![-11, -10, 2, 5, 10, 17, 99]);

Also provides sorted set containers only containing unique elements.

serde support

serde de/serialization is an optional feature.

By default, deserializing an unsorted container is an error.

To sort on deserialization, tag the field with #[serde(deserialize_with = "SortedVec::deserialize_unsorted")]:

#[derive(Debug, Eq, Ord, PartialEq, PartialOrd, Deserialize, Serialize)]
pub struct Foo {
  #[serde(deserialize_with = "SortedVec::deserialize_unsorted")]
  pub v : SortedVec <u64>
}

lib.rs:

Sorted vectors.

Repository

  • SortedVec -- sorted from least to greatest, may contain duplicates
  • SortedSet -- sorted from least to greatest, unique elements
  • ReverseSortedVec -- sorted from greatest to least, may contain duplicates
  • ReverseSortedSet -- sorted from greatest to least, unique elements

The partial module provides sorted vectors of types that only implement PartialOrd where comparison of incomparable elements results in runtime panic.

Dependencies

~175KB