kupsy 0.1.0

Some data-structures and algorithms that might be useful
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

// TODO:
// - testing.
// - proper docs.

use alloc::vec::Vec;

use core::cmp::Ordering;

use super::Interval;

/// Complexity:
/// O(n * log n) Runtime
/// O(?) space
/// Where n = ...
///
/// example...
///
// TODO: take an iterator, not a vec.
pub fn sort_by_start<T>(v: &mut Vec<Interval<T>>)
where
    T: Copy + Ord,
{
    // consider: should sort_unstable_by be used instead?
    v.sort_by(|a, b| {
        let mut result = a.start.cmp(&b.start);
        if let Ordering::Equal = result {
            result = a.end.cmp(&b.end);
        }
        result
    })
}
pub fn sort_by_end<T>(v: &mut Vec<Interval<T>>)
where
    T: Copy + Ord,
{
    // consider: should sort_unstable_by be used instead?
    v.sort_by(|a, b| {
        let mut result = a.end.cmp(&b.end);
        if let Ordering::Equal = result {
            result = a.end.cmp(&b.end);
        }
        result
    })
}