cervo-runtime 0.9.2

Multi-model multi-agent RL runtime for games.
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

use std::cmp::Ordering;

use crate::BrainId;

/// A ticket for the ML in the queue for execution.
#[derive(Debug)]
pub(super) struct Ticket(pub(super) u64, pub(super) BrainId);

impl PartialEq for Ticket {
    fn eq(&self, other: &Self) -> bool {
        self.0 == other.0
    }
}

impl Eq for Ticket {}

impl PartialOrd for Ticket {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl Ord for Ticket {
    fn cmp(&self, other: &Ticket) -> Ordering {
        other.0.cmp(&self.0)
    }
}

#[cfg(test)]
mod tests {
    use std::cmp::Ordering;

    use super::{BrainId, Ticket};
    #[test]
    fn ticket_cmp_is_inversed() {
        let a = Ticket(0, BrainId(0));
        let b = Ticket(1, BrainId(1));

        // a has lower sequence number = higher sorting power
        assert_eq!(a.cmp(&b), Ordering::Greater);
    }

    #[test]
    fn ticket_cmp_ignore_brain() {
        let a = Ticket(0, BrainId(1));
        let b = Ticket(1, BrainId(0));

        // a has lower sequence number = higher sorting power
        assert_eq!(a.cmp(&b), Ordering::Greater);
    }

    #[test]
    fn ticket_cmp_is_inversed_reverse_cmp() {
        let a = Ticket(0, BrainId(0));
        let b = Ticket(1, BrainId(1));

        // a has lower sequence number = higher sorting power, so b is less.
        assert_eq!(b.cmp(&a), Ordering::Less);
    }
}