ga-scheduler 0.1.1

A Genetic Algorithm optimizer designed for scheduling and similar tasks
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

use super::Mutation;
use crate::chromosone::Gene;

#[mockall_double::double]
use crate::rando::Rando;

#[cfg(test)]
use mockall::*;

/**
*  This mutator randomly changes `n` locuses in the chromosone.
**/
pub struct Mutate<const N: usize, const NSYMS: usize> {
    pub n: usize,
}

impl<const N: usize, const NSYMS: usize> Mutate<N, NSYMS> {
    pub const fn new(n: usize) -> Self {
        Mutate { n }
    }
}

impl<const N: usize, const NSYMS: usize> Mutation<N, NSYMS> for Mutate<N, NSYMS> {
    fn run(&self, chromosone: &[Gene; N], rng: &mut Rando) -> [Gene; N] {
        let mut mutated = chromosone.clone();
        for _ in 0..self.n {
            let pos = rng.gen_range(0..N);
            let mut new;
            loop {
                new = rng.gen_range(0..NSYMS) as Gene;
                if new != chromosone[pos] {
                    break;
                }
            }
            mutated[pos] = new;
        }
        mutated
    }
}

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

    #[test]
    fn test_mutate() {
        let mut r = Rando::default();
        let m = Mutate::<5, 3>::new(1);
        r.expect_gen_range()
            .with(predicate::eq(0..5))
            .times(1)
            .return_const(1usize);
        r.expect_gen_range()
            .with(predicate::eq(0..3))
            .times(1)
            .return_const(2usize);
        assert_eq!(m.run(&[0, 1, 2, 0, 1], &mut r), [0, 2, 2, 0, 1])
    }
}