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
use std::f32;
use rand::prelude::StdRng;
use crate::geometry::Point;
use crate::MapFilter;
use crate::Map;
use crate::dijkstra::DijkstraMap;
pub struct DistantExit {}
impl MapFilter for DistantExit {
fn modify_map(&self, _: &mut StdRng, map: &Map) -> Map {
self.build(map)
}
}
impl DistantExit {
#[allow(dead_code)]
pub fn new() -> Box<DistantExit> {
Box::new(DistantExit{})
}
fn build(&self, map: &Map) -> Map {
let mut new_map = map.clone();
let mut best_idx = 0;
let mut best_value = 0.0;
let dijkstra_map = DijkstraMap::new(map);
for (i, &value) in dijkstra_map.tiles.iter().enumerate() {
if value < f32::MAX && value > best_value {
best_value = value;
best_idx = i;
}
}
let x = best_idx % map.width;
let y = best_idx / map.width;
new_map.exit_point = Some(Point::new(x, y));
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_exit() {
let map_str = "
##########
# #
# # #
##########
";
let mut map = Map::from_string(map_str);
map.starting_point = Some(Point::new(9, 2));
let modifier = DistantExit::new();
let mut rng = StdRng::seed_from_u64(0);
let new_map = modifier.modify_map(&mut rng, &map);
assert_eq!(new_map.exit_point, Some(Point::new(1, 2)));
}
}