.

Author: Platane

packages/solver-r/src/_test_grid_samples.rs

@@ -8,7 +8,7 @@ fn grid_from_ascii(ascii: &str) -> Grid<Color> {
     let width = rows.iter().fold(0, |max_len, r| max_len.max(r.len()));
     let height = rows.len();
 
-    let mut grid = Grid::create(width as u8, height as u8, Color::Empty);
+    let mut grid = Grid::<Color>::create(width as u8, height as u8);
 
     for x in 0..width {
         for y in 0..height {
@@ -118,7 +118,7 @@ pub fn get_grid_sample(g: SampleGrid) -> Grid<Color> {
         ),
 
         SampleGrid::RandomPack => {
-            let mut grid = Grid::create(52, 7, Color::Empty);
+            let mut grid = Grid::<Color>::create(52, 7);
             randomly_fill_grid(
                 &mut grid,
                 &[Color::Empty, Color::Empty, Color::Color1, Color::Color4],

packages/solver-r/src/exit_cost_grid.rs

@@ -0,0 +1,7 @@
+use crate::grid::{Color, Grid};
+
+pub fn get_exit_cost_grid(color_grid: &Grid<Color>) -> Grid<u8> {
+    let mut exit_cost_grid = Grid::<u8>::create(color_grid.width, color_grid.height);
+
+    exit_cost_grid
+}

packages/solver-r/src/exit_cost_map.rs

@@ -30,16 +30,22 @@ pub enum Color {
     Color4 = 4,
 }
 
+impl Default for Color {
+    fn default() -> Self {
+        Color::Empty
+    }
+}
+
 #[derive(Clone)]
 pub struct Grid<T: Copy> {
     pub width: u8,
     pub height: u8,
     pub cells: Vec<T>,
 }
-impl<T: Copy> Grid<T> {
-    pub fn create(width: u8, height: u8, item: T) -> Grid<T> {
+impl<T: Copy + Default> Grid<T> {
+    pub fn create(width: u8, height: u8) -> Grid<T> {
         let n = (width as usize) * (height as usize);
-        let cells = (0..n).map(|_| item).collect();
+        let cells = (0..n).map(|_| T::default()).collect();
 
         Grid {
             width,
@@ -51,6 +57,13 @@ impl<T: Copy> Grid<T> {
     fn get_index(&self, x: i8, y: i8) -> usize {
         return (x as usize) * (self.height as usize) + (y as usize);
     }
+
+    pub fn fill(&mut self, value: T) -> () {
+        let n = (self.width as usize) * (self.height as usize);
+        for i in (0..n) {
+            self.cells[i] = value;
+        }
+    }
     pub fn get(&self, p: &Point) -> T {
         let i = self.get_index(p.x, p.y);
         return self.cells[i];
@@ -95,23 +108,23 @@ fn it_should_sort_cell() {
 }
 #[test]
 fn it_should_grid_create() {
-    let grid = Grid::create(30, 10, Color::Empty);
+    let grid = Grid::<Color>::create(30, 10);
 
     assert_eq!(grid.width, 30);
     assert_eq!(grid.height, 10);
     assert_eq!(grid.get(&Point { x: 2, y: 3 }), Color::Empty);
 }
 #[test]
 fn it_should_grid_setter() {
-    let mut grid = Grid::create(20, 10, Color::Empty);
+    let mut grid = Grid::<Color>::create(20, 10);
 
     grid.set(&Point { x: 12, y: 3 }, Color::Color1);
 
     assert_eq!(grid.get(&Point { x: 12, y: 3 }), Color::Color1);
 }
 #[test]
 fn it_should_iterate() {
-    let grid = Grid::create(2, 2, Color::Empty);
+    let grid = Grid::<Color>::create(2, 2);
 
     assert_eq!(
         grid.iter().collect::<HashSet<_>>(),

packages/solver-r/src/grid.rs

@@ -1,6 +1,7 @@
 mod _test_grid_samples;
 mod astar;
 mod astar_snake;
+mod exit_cost_grid;
 mod exitable;
 mod grid;
 mod snake;