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