no-std sorted-insert

This crate provides traits to insert elements to a sorted collection and keep the order

5 releases

0.2.3 Mar 19, 2022
0.2.2 Apr 22, 2021
0.2.1 Aug 9, 2020
0.2.0 Aug 9, 2020
0.1.0 Aug 9, 2020

#1311 in Algorithms

Download history 498/week @ 2024-06-15 459/week @ 2024-06-22 774/week @ 2024-06-29 1148/week @ 2024-07-06 327/week @ 2024-07-13 504/week @ 2024-07-20 457/week @ 2024-07-27 945/week @ 2024-08-03 1060/week @ 2024-08-10 1004/week @ 2024-08-17 982/week @ 2024-08-24 1022/week @ 2024-08-31 1210/week @ 2024-09-07 651/week @ 2024-09-14 517/week @ 2024-09-21 421/week @ 2024-09-28

2,949 downloads per month
Used in 8 crates (2 directly)

MIT license

11KB
156 lines

Sorted Insert

CI

This crate provides traits to insert elements to a sorted collection and keep the order.

Examples

use sorted_insert::SortedInsert;

let mut v = vec![1, 5];

v.sorted_insert_asc(2);

assert_eq!([1, 2, 5], v.as_slice());
use sorted_insert::SortedInsertBinary;

let mut v = vec![5, 1];

v.sorted_insert_desc_binary(2);

assert_eq!([5, 2, 1], v.as_slice());
use sorted_insert::SortedInsertByKey;

#[derive(Debug, Copy, Clone, Eq, PartialEq)]
struct A(i32, i32);

let mut v = vec![A(1, 10), A(2, 20)];

v.sorted_insert_asc_by_key(A(1, 15), |e| &e.1);

assert_eq!([A(1, 10), A(1, 15), A(2, 20)], v.as_slice());

No Std

Disable the default features to compile this crate without std.

[dependencies.sorted-insert]
version = "*"
default-features = false

Crates.io

https://crates.io/crates/sorted-insert

Documentation

https://docs.rs/sorted-insert

License

MIT

No runtime deps

Features