wybr 0.0.6

Collection of preferential voting methods
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
65
66
67
68
69
70
71
72
73
74
75

#[derive(Clone, Copy)]
pub struct CandPair {
    pub runner: u32,
    pub opponent: u32,
    score: u64,
    opposition: u64,
}

impl CandPair {
    pub fn new(runner: u32, opponent: u32, score: u64, opposition: u64) -> CandPair {
        CandPair {
            runner,
            opponent,
            score,
            opposition,
        }
    }
}

use std::cmp::{Eq, Ordering, PartialEq, PartialOrd};
impl PartialOrd for CandPair {
    fn partial_cmp(&self, other: &CandPair) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}
//Note that this order is reverse in opposition
impl Ord for CandPair {
    fn cmp(&self, other: &CandPair) -> Ordering {
        match self.score.cmp(&other.score) {
            Ordering::Equal => other.opposition.cmp(&self.opposition),
            x => x,
        }
    }
}
impl PartialEq for CandPair {
    fn eq(&self, other: &CandPair) -> bool {
        self.score == other.score && self.opposition == other.opposition
    }
}
impl Eq for CandPair {}

#[cfg(test)]
mod tests {
    use super::*;
    #[test]
    fn cand_pair() {
        let a = CandPair {
            runner: 1,
            opponent: 2,
            score: 11,
            opposition: 7,
        };
        let b = CandPair {
            runner: 3,
            opponent: 4,
            score: 11,
            opposition: 9,
        };
        let c = CandPair {
            runner: 5,
            opponent: 6,
            score: 11,
            opposition: 7,
        };
        let d = CandPair {
            runner: 7,
            opponent: 8,
            score: 21,
            opposition: 7,
        };
        assert!(a == c);
        assert!(a > b);
        assert!(d > a);
    }
}