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
use rand::prelude::StdRng;
use crate::MapFilter;
use crate::{Map, TileType};
use crate::dijkstra::DijkstraMap;
pub struct CullUnreachable {}
impl MapFilter for CullUnreachable {
fn modify_map(&self, _: &mut StdRng, map: &Map) -> Map {
self.build(map)
}
}
impl CullUnreachable {
#[allow(dead_code)]
pub fn new() -> Box<CullUnreachable> {
Box::new(CullUnreachable{})
}
fn build(&self, map: &Map) -> Map {
let mut new_map = map.clone();
let dijkstra_map = DijkstraMap::new(map);
for (i, tile) in new_map.tiles.iter_mut().enumerate() {
if *tile == TileType::Floor {
let distance_to_start = dijkstra_map.tiles[i];
if distance_to_start == std::f32::MAX {
*tile = TileType::Wall;
}
}
}
new_map
}
}
#[cfg(test)]
mod tests {
use rand::prelude::*;
use super::*;
use super::MapFilter;
use crate::geometry::Point;
use crate::map::Map;
#[test]
fn test_culling() {
let map_str = "
##########
# # #
##########
";
let mut map = Map::from_string(map_str);
map.starting_point = Some(Point::new(9, 1));
let expected_map_str = "
##########
#### #
##########
";
let expected_map = Map::from_string(expected_map_str);
let modifier = CullUnreachable::new();
let mut rng = StdRng::seed_from_u64(0);
let new_map = modifier.modify_map(&mut rng, &map);
assert_eq!(new_map.tiles, expected_map.tiles);
}
}