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
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143

use crate::filtermodifier::FilterModifier;
use rand_core::RngCore;
use std::num::NonZeroU64;

#[derive(Debug, Clone)]
pub struct Roll {
    pub vals: Vec<u64>,
    pub total: i64,
    pub sides: NonZeroU64,
}

pub fn roll_die(
    times: u64,
    sides: NonZeroU64,
    fm: FilterModifier<u64>,
    mut rng: impl RngCore,
) -> Roll {
    let mut rolls = Vec::new();
    let range = sides.get();
    for _ in 0..times {
        let roll = (rng.next_u64() % range) + 1;
        rolls.push(roll);
    }

    rolls.sort_unstable();

    match fm {
        FilterModifier::KeepLowest(i) => {
            rolls.truncate(i as usize);
        }
        FilterModifier::KeepHighest(i) => {
            rolls.reverse();
            rolls.truncate(i as usize);
        }
        FilterModifier::DropLowest(i) => {
            rolls.reverse();
            rolls.truncate(rolls.len() - i.min(rolls.len() as u64) as usize)
        }
        FilterModifier::DropHighest(i) => {
            rolls.truncate(rolls.len() - i.min(rolls.len() as u64) as usize)
        }
        FilterModifier::None => {}
    }

    // Shuffle order of results again
    if !rolls.is_empty() {
        let range = rolls.len() as u64;
        for _ in 0..rolls.len() + 1 {
            let a = rng.next_u64() % range + 1;
            let b = rng.next_u64() % range + 1;
            rolls.swap(a as usize - 1, b as usize - 1);
        }
    }

    Roll {
        total: rolls.iter().sum::<u64>() as i64,
        vals: rolls,
        sides,
    }
}

const DIR: &[&str] = &[
    "North",
    "North East",
    "East",
    "South East",
    "South",
    "South West",
    "West",
    "North West",
    "Stay",
];

pub fn roll_direction(rng: impl RngCore) -> String {
    let value = roll_die(
        1,
        NonZeroU64::new(DIR.len() as u64).unwrap(),
        FilterModifier::None,
        rng,
    );
    DIR[value.total as usize - 1].to_string()
}

#[cfg(test)]
mod tests {
    use super::*;
    use rand_core::{Error, RngCore};

    struct DeterministicRng {
        value: i64,
    }

    impl DeterministicRng {
        pub fn new() -> Self {
            Self { value: -1 }
        }
    }

    impl RngCore for DeterministicRng {
        fn next_u32(&mut self) -> u32 {
            self.value += 1;
            self.value as u32
        }

        fn next_u64(&mut self) -> u64 {
            self.value += 1;
            self.value as u64
        }

        fn fill_bytes(&mut self, _: &mut [u8]) {
            unimplemented!()
        }

        fn try_fill_bytes(&mut self, _: &mut [u8]) -> Result<(), Error> {
            unimplemented!()
        }
    }

    #[test]
    fn test_kl() {
        let roll = roll_die(
            6,
            NonZeroU64::new(6).unwrap(),
            FilterModifier::KeepLowest(3),
            DeterministicRng::new(),
        );

        assert_eq!(roll.vals.len(), 3);
        assert_eq!(roll.total, 6);
    }

    #[test]
    fn test_dl_overflow() {
        let roll = roll_die(
            100,
            NonZeroU64::new(6).unwrap(),
            FilterModifier::DropLowest(300),
            DeterministicRng::new(),
        );
        assert_eq!(roll.vals.len(), 0);
        assert_eq!(roll.total, 0);
    }
}