amazeing 0.8.0

Amazeing is a maze generator/solver application with simulation/visualization.
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

use crate::core::tiled::node::Node;
use crate::core::tiled::{MazeData, UnitShape, VOID};
use std::ops::{Index, IndexMut};

#[derive(Default, Debug, Clone)]
pub struct Maze {
    pub unit_shape: UnitShape,
    pub data: MazeData,
}

impl Maze {
    pub fn new(unit_shape: UnitShape, rows: usize, cols: usize, default: i8) -> Self {
        Self {
            unit_shape,
            data: vec![vec![default; cols]; rows],
        }
    }
    pub fn new_void(unit_shape: UnitShape, rows: usize, cols: usize) -> Self {
        Maze::new(unit_shape, rows, cols, VOID)
    }

    pub fn from(unit_shape: UnitShape, data: MazeData) -> Self {
        Self { unit_shape, data }
    }

    pub fn rows(&self) -> usize {
        self.data.iter().len()
    }

    pub fn cols(&self) -> usize {
        self.data.first().unwrap().iter().len()
    }
}

impl Index<Node> for Maze {
    type Output = i8;

    fn index(&self, index: Node) -> &Self::Output {
        &self.data[index.row][index.col]
    }
}

impl IndexMut<Node> for Maze {
    fn index_mut(&mut self, index: Node) -> &mut Self::Output {
        &mut self.data[index.row][index.col]
    }
}