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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

mod insert;
mod intersection;
mod merge_iters;
mod merge_overlapping;
mod overlaps;
mod sizes;
mod sort;
mod vec;

pub use insert::*;
pub use intersection::*;
pub use merge_iters::*;
pub use merge_overlapping::*;
pub use overlaps::*;
pub use sizes::*;
pub use sort::*;
pub use vec::*;

#[derive(Clone, Copy, PartialEq, Eq, Debug)]
pub struct Interval<T>
where
    T: Copy + Ord,
{
    pub start: T,
    pub end: T,
}

impl<T> Interval<T>
where
    T: Copy + Ord,
{
    // not sure what to return when T is a timestamp
    pub fn duration(&self) -> T {
        todo!()
    }
}

impl<T> From<(T, T)> for Interval<T>
where
    T: Copy + Ord,
{
    fn from(value: (T, T)) -> Self {
        Self {
            start: value.0,
            end: value.1,
        }
    }
}

impl<T> From<Interval<T>> for (T, T)
where
    T: Copy + Ord,
{
    fn from(value: Interval<T>) -> (T, T) {
        (value.start, value.end)
    }
}

#[derive(Clone, Copy, PartialEq, Eq, Debug, Default)]
pub enum NeighborStrategy {
    #[default]
    Same,
    Separate,
}