amaze 0.3.0

A maze generator
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

use rand::{Rng, RngExt};

pub trait CellSelector {
    fn select<R: Rng>(&self, rng: &mut R, frontier_len: usize) -> usize;
}

#[derive(Debug, Copy, Clone, Default)]
pub struct NewestCell;

impl CellSelector for NewestCell {
    fn select<R: Rng>(&self, _rng: &mut R, frontier_len: usize) -> usize {
        frontier_len - 1
    }
}

#[derive(Debug, Copy, Clone, Default)]
pub struct OldestCell;

impl CellSelector for OldestCell {
    fn select<R: Rng>(&self, _rng: &mut R, _frontier_len: usize) -> usize {
        0
    }
}

#[derive(Debug, Copy, Clone, Default)]
pub struct RandomCell;

impl CellSelector for RandomCell {
    fn select<R: Rng>(&self, rng: &mut R, frontier_len: usize) -> usize {
        rng.random_range(0..frontier_len)
    }
}

#[derive(Debug, Copy, Clone)]
pub struct MixedCell {
    pub newest_probability: f64,
}

impl Default for MixedCell {
    fn default() -> Self {
        Self {
            newest_probability: 0.5,
        }
    }
}

impl CellSelector for MixedCell {
    fn select<R: Rng>(&self, rng: &mut R, frontier_len: usize) -> usize {
        if rng.random_bool(self.newest_probability.clamp(0.0, 1.0)) {
            frontier_len - 1
        } else {
            rng.random_range(0..frontier_len)
        }
    }
}