Add nearest neighbor corridor builder

This commit is contained in:
Timothy Warren 2021-12-17 10:44:35 -05:00
parent f281a8be7a
commit ac8b70af2b
2 changed files with 68 additions and 0 deletions

View File

@ -18,6 +18,7 @@ mod room_exploder;
mod room_sorter; mod room_sorter;
mod rooms_corridors_bsp; mod rooms_corridors_bsp;
mod rooms_corridors_dogleg; mod rooms_corridors_dogleg;
mod rooms_corridors_nearest;
mod simple_map; mod simple_map;
mod voronoi; mod voronoi;
mod voronoi_spawning; mod voronoi_spawning;
@ -43,6 +44,7 @@ use room_exploder::RoomExploder;
use room_sorter::{RoomSort, RoomSorter}; use room_sorter::{RoomSort, RoomSorter};
use rooms_corridors_bsp::BspCorridors; use rooms_corridors_bsp::BspCorridors;
use rooms_corridors_dogleg::DoglegCorridors; use rooms_corridors_dogleg::DoglegCorridors;
use rooms_corridors_nearest::NearestCorridors;
use simple_map::SimpleMapBuilder; use simple_map::SimpleMapBuilder;
use specs::prelude::*; use specs::prelude::*;
use voronoi::VoronoiCellBuilder; use voronoi::VoronoiCellBuilder;

View File

@ -0,0 +1,66 @@
use std::collections::HashSet;
use rltk::RandomNumberGenerator;
use super::common::draw_corridor;
use super::{BuilderMap, MetaMapBuilder};
use crate::Rect;
pub struct NearestCorridors {}
impl MetaMapBuilder for NearestCorridors {
#[allow(dead_code)]
fn build_map(&mut self, rng: &mut RandomNumberGenerator, build_data: &mut BuilderMap) {
self.corridors(rng, build_data);
}
}
impl NearestCorridors {
#[allow(dead_code)]
pub fn new() -> Box<NearestCorridors> {
Box::new(NearestCorridors {})
}
fn corridors(&mut self, _rng: &mut RandomNumberGenerator, build_data: &mut BuilderMap) {
let rooms: Vec<Rect>;
if let Some(rooms_builder) = &build_data.rooms {
rooms = rooms_builder.clone();
} else {
panic!("Nearest Corridors requires a builder with room structures");
}
let mut connected: HashSet<usize> = HashSet::new();
for (i, room) in rooms.iter().enumerate() {
let mut room_distance: Vec<(usize, f32)> = Vec::new();
let room_center = room.center();
let room_center_pt = rltk::Point::new(room_center.0, room_center.1);
for (j, other_room) in rooms.iter().enumerate() {
if i != j && !connected.contains(&j) {
let other_center = other_room.center();
let other_center_pt = rltk::Point::new(other_center.0, other_center.1);
let distance =
rltk::DistanceAlg::Pythagoras.distance2d(room_center_pt, other_center_pt);
room_distance.push((j, distance));
}
}
if !room_distance.is_empty() {
room_distance.sort_by(|a, b| a.1.partial_cmp(&b.1).unwrap());
let dest_center = rooms[room_distance[0].0].center();
draw_corridor(
&mut build_data.map,
room_center.0,
room_center.1,
dest_center.0,
dest_center.1,
);
connected.insert(i);
build_data.take_snapshot();
}
}
}
}