1 unstable release
0.1.0 | Sep 28, 2023 |
---|
#2109 in Parser implementations
Used in corretto
53KB
1K
SLoC
sorted_vec2
Maintained alternative to sorted-vec
.
Create and maintain collections of sorted elements.
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>
}
Dependencies
~0.3–1MB
~22K SLoC