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

use alloc::vec::Vec;

use super::Interval;

// Consider: should there be a count_overlaps? How would counts work?

/// does not merge
pub fn remove_overlaps<T>(_input: &mut Vec<Interval<T>>)
where
    T: Copy + Ord,
{
    todo!()
}

pub fn has_overlaps<T>(_input: &Vec<Interval<T>>) -> bool
where
    T: Copy + Ord,
{
    todo!()
}
pub fn has_overlaps_interval_iters<T>(_input: &Vec<Interval<T>>) -> bool
where
    T: Copy + Ord,
{
    todo!()
}

pub fn max_overlaps<T>(_input: &Vec<Interval<T>>) -> u32
where
    T: Copy + Ord,
{
    todo!()
}

pub fn max_overlaps_interval_iters<T>(_input: &Vec<Vec<Interval<T>>>) -> u32
where
    T: Copy + Ord,
{
    todo!()
}