use ::rltk::prelude::*; use super::{BuilderMap, MetaMapBuilder}; use crate::{map, TileType}; #[allow(dead_code)] pub enum XEnd { Left, Center, Right, } #[allow(dead_code)] pub enum YEnd { Top, Center, Bottom, } pub struct AreaEndingPosition { x: XEnd, y: YEnd, } impl MetaMapBuilder for AreaEndingPosition { fn build_map(&mut self, build_data: &mut BuilderMap) { self.build(build_data); } } impl AreaEndingPosition { #[allow(dead_code)] pub fn new(x: XEnd, y: YEnd) -> Box { Box::new(AreaEndingPosition { x, y }) } fn build(&mut self, build_data: &mut BuilderMap) { let seed_x = match self.x { XEnd::Left => 1, XEnd::Center => build_data.map.width / 2, XEnd::Right => build_data.map.width - 2, }; let seed_y = match self.y { YEnd::Top => 1, YEnd::Center => build_data.map.height / 2, YEnd::Bottom => build_data.map.height - 2, }; let mut available_floors: Vec<(usize, f32)> = Vec::new(); for (idx, tiletype) in build_data.map.tiles.iter().enumerate() { if map::tile_walkable(*tiletype) { available_floors.push(( idx, DistanceAlg::PythagorasSquared.distance2d( Point::new( idx as i32 % build_data.map.width, idx as i32 / build_data.map.width, ), Point::new(seed_x, seed_y), ), )); } } if available_floors.is_empty() { panic!("No valid floors to start on"); } available_floors.sort_by(|a, b| a.1.partial_cmp(&b.1).unwrap()); build_data.map.tiles[available_floors[0].0] = TileType::DownStairs; } }