scors 0.2.3

Scores for binary classifier evaluation
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

pub mod combine {
    use std::cmp::PartialOrd;
    use std::iter::Peekable;
    use std::marker::PhantomData;

    #[derive(Clone)]
    pub struct CombineIterDescending<T: PartialOrd, I1: Iterator<Item = T>, I2: Iterator<Item = T>>
    where T: PartialOrd, I1: Iterator<Item = T> + Clone, I2: Iterator<Item = T>
    {
        p1: Peekable<I1>,
        p2: Peekable<I2>,
        _phantom: PhantomData<T>,
    }

    impl <T, I1, I2> CombineIterDescending<T, I1, I2> 
    where T: PartialOrd, I1: Iterator<Item = T> + Clone, I2: Iterator<Item = T>
    {
        pub fn new(i1: I1, i2: I2) -> Self {
            return CombineIterDescending {
                p1: i1.peekable(),
                p2: i2.peekable(),
                _phantom: Default::default(),
            }
        }
    }

    impl <T, I1, I2> Iterator for CombineIterDescending<T, I1, I2> 
    where T: PartialOrd, I1: Iterator<Item = T> + Clone, I2: Iterator<Item = T>
    {
        type Item = T;

        fn next(&mut self) -> Option<T> {
            return match self.p1.peek() {
                Some(v1) => {
                    match self.p2.peek() {
                        Some(v2) => {
                            if v1.gt(v2) {
                                self.p1.next()
                            } else {
                                self.p2.next()
                            }
                        }
                        None => self.p1.next()
                    }
                }
                None => self.p2.next()
            }
        }
    }
 
}