electosim 0.3.0

Library to compute electoral methods (as D'Hondt) and simulate elections
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

use crate::interface::{WithSeats, WithVotes};

#[derive(Debug)]
/// Represents a candidacy in an election.
pub struct Candidacy {
    votes: u32,
    seats: u16,
}

/// Represents a candidacy in an election.
///
/// A candidacy is defined by the number of votes received and the number of seats won.
/// Represents a candidacy in an election.
///
/// # Arguments
///
/// * `votes` - The number of votes received by the candidacy.
/// * `seats` - The number of seats won by the candidacy.
///
/// # Example
///
/// ```
/// use electosim::models::Candidacy;
///
/// let candidacy = Candidacy::new(1000, 3);
/// ```
impl Candidacy {
    pub fn new(votes: u32, seats: u16) -> Candidacy {
        Candidacy { votes, seats }
    }
}

impl WithVotes for Candidacy {
    fn get_votes(&self) -> u32 {
        self.votes
    }

    fn set_votes(&mut self, votes: u32) {
        self.votes = votes;
    }
}

impl WithSeats for Candidacy {
    fn get_seats(&self) -> u16 {
        self.seats
    }

    fn set_seats(&mut self, seats: u16) {
        self.seats = seats;
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_candidacy() {
        let mut candidacy = Candidacy::new(1000, 3);
        assert_eq!(candidacy.get_votes(), 1000);
        assert_eq!(candidacy.get_seats(), 3);

        candidacy.set_votes(2000);
        candidacy.set_seats(5);

        assert_eq!(candidacy.get_votes(), 2000);
        assert_eq!(candidacy.get_seats(), 5);
    }
}