enforces api usage

This commit is contained in:
Llywelwyn 2023-07-15 12:27:50 +01:00
parent 7e4953f096
commit 325c5af52f
4 changed files with 77 additions and 55 deletions

View file

@ -5,73 +5,98 @@ use super::{
use rltk::RandomNumberGenerator;
use specs::prelude::*;
pub struct SimpleMapBuilder {}
pub struct SimpleMapBuilder {
map: Map,
starting_position: Position,
depth: i32,
rooms: Vec<Rect>,
}
impl MapBuilder for SimpleMapBuilder {
fn build(rng: &mut RandomNumberGenerator, new_depth: i32) -> (Map, Position) {
let mut map = Map::new(new_depth);
let player_pos = SimpleMapBuilder::rooms_and_corridors(rng, &mut map);
fn get_map(&mut self) -> Map {
return self.map.clone();
}
return (map, player_pos);
fn get_starting_pos(&mut self) -> Position {
return self.starting_position.clone();
}
fn build_map(&mut self, rng: &mut RandomNumberGenerator) {
return self.rooms_and_corridors(rng);
}
fn spawn_entities(&mut self, ecs: &mut World) {
for room in self.rooms.iter().skip(1) {
return spawner::spawn_room(ecs, room, self.depth);
}
}
}
impl SimpleMapBuilder {
fn rooms_and_corridors(rng: &mut RandomNumberGenerator, map: &mut Map) -> Position {
pub fn new(new_depth: i32) -> SimpleMapBuilder {
SimpleMapBuilder {
map: Map::new(new_depth),
starting_position: Position { x: 0, y: 0 },
depth: new_depth,
rooms: Vec::new(),
}
}
fn rooms_and_corridors(&mut self, rng: &mut RandomNumberGenerator) {
const MAX_ROOMS: i32 = 30;
const MIN_SIZE: i32 = 6;
const MAX_SIZE: i32 = 10;
const MAX_OFFSET: u8 = 32;
for idx in 0..map.red_offset.len() {
for idx in 0..self.map.red_offset.len() {
let roll = rng.roll_dice(1, MAX_OFFSET as i32);
map.red_offset[idx] = roll as u8;
self.map.red_offset[idx] = roll as u8;
}
for idx in 0..map.green_offset.len() {
for idx in 0..self.map.green_offset.len() {
let roll = rng.roll_dice(1, MAX_OFFSET as i32);
map.green_offset[idx] = roll as u8;
self.map.green_offset[idx] = roll as u8;
}
for idx in 0..map.blue_offset.len() {
for idx in 0..self.map.blue_offset.len() {
let roll = rng.roll_dice(1, MAX_OFFSET as i32);
map.blue_offset[idx] = roll as u8;
self.map.blue_offset[idx] = roll as u8;
}
for _i in 0..MAX_ROOMS {
let w = rng.range(MIN_SIZE, MAX_SIZE);
let h = rng.range(MIN_SIZE, MAX_SIZE);
let x = rng.roll_dice(1, map.width - w - 1) - 1;
let y = rng.roll_dice(1, map.height - h - 1) - 1;
let x = rng.roll_dice(1, self.map.width - w - 1) - 1;
let y = rng.roll_dice(1, self.map.height - h - 1) - 1;
let new_room = Rect::new(x, y, w, h);
let mut ok = true;
for other_room in map.rooms.iter() {
for other_room in self.rooms.iter() {
if new_room.intersect(other_room) {
ok = false
}
}
if ok {
apply_room_to_map(map, &new_room);
apply_room_to_map(&mut self.map, &new_room);
if !map.rooms.is_empty() {
if !self.rooms.is_empty() {
let (new_x, new_y) = new_room.centre();
let (prev_x, prev_y) = map.rooms[map.rooms.len() - 1].centre();
let (prev_x, prev_y) = self.rooms[self.rooms.len() - 1].centre();
if rng.range(0, 2) == 1 {
apply_horizontal_tunnel(map, prev_x, new_x, prev_y);
apply_vertical_tunnel(map, prev_y, new_y, new_x);
apply_horizontal_tunnel(&mut self.map, prev_x, new_x, prev_y);
apply_vertical_tunnel(&mut self.map, prev_y, new_y, new_x);
} else {
apply_vertical_tunnel(map, prev_y, new_y, prev_x);
apply_horizontal_tunnel(map, prev_x, new_x, new_y);
apply_vertical_tunnel(&mut self.map, prev_y, new_y, prev_x);
apply_horizontal_tunnel(&mut self.map, prev_x, new_x, new_y);
}
}
map.rooms.push(new_room);
self.rooms.push(new_room);
}
}
let stairs_position = map.rooms[map.rooms.len() - 1].centre();
let stairs_idx = map.xy_idx(stairs_position.0, stairs_position.1);
map.tiles[stairs_idx] = TileType::DownStair;
let stairs_position = self.rooms[self.rooms.len() - 1].centre();
let stairs_idx = self.map.xy_idx(stairs_position.0, stairs_position.1);
self.map.tiles[stairs_idx] = TileType::DownStair;
let start_pos = map.rooms[0].centre();
return Position { x: start_pos.0, y: start_pos.1 };
let start_pos = self.rooms[0].centre();
self.starting_position = Position { x: start_pos.0, y: start_pos.1 };
}
}