142 lines
4.0 KiB
Rust
142 lines
4.0 KiB
Rust
mod dungeon;
|
|
mod themes;
|
|
mod tiletype;
|
|
|
|
use std::collections::HashSet;
|
|
|
|
use ::rltk::{Algorithm2D, BaseMap, Point, SmallVec};
|
|
use ::serde::{Deserialize, Serialize};
|
|
use ::specs::prelude::*;
|
|
pub use dungeon::*;
|
|
pub use themes::*;
|
|
pub use tiletype::{tile_opaque, tile_walkable, TileType};
|
|
|
|
use crate::map::tiletype::tile_cost;
|
|
|
|
#[derive(Default, Serialize, Deserialize, Clone)]
|
|
pub struct Map {
|
|
pub tiles: Vec<TileType>,
|
|
pub width: i32,
|
|
pub height: i32,
|
|
pub revealed_tiles: Vec<bool>,
|
|
pub visible_tiles: Vec<bool>,
|
|
pub blocked: Vec<bool>,
|
|
pub depth: i32,
|
|
pub bloodstains: HashSet<usize>,
|
|
pub view_blocked: HashSet<usize>,
|
|
pub name: String,
|
|
|
|
#[serde(skip_serializing)]
|
|
#[serde(skip_deserializing)]
|
|
pub tile_content: Vec<Vec<Entity>>,
|
|
}
|
|
|
|
impl Map {
|
|
pub fn xy_idx(&self, x: i32, y: i32) -> usize {
|
|
(y as usize * self.width as usize) + x as usize
|
|
}
|
|
|
|
fn is_exit_valid(&self, x: i32, y: i32) -> bool {
|
|
if x < 1 || x > self.width - 1 || y < 1 || y > self.height - 1 {
|
|
return false;
|
|
}
|
|
|
|
let idx = self.xy_idx(x, y);
|
|
|
|
!self.blocked[idx]
|
|
}
|
|
|
|
pub fn populate_blocked(&mut self) {
|
|
for (i, tile) in self.tiles.iter_mut().enumerate() {
|
|
self.blocked[i] = !tile_walkable(*tile);
|
|
}
|
|
}
|
|
|
|
pub fn clear_content_index(&mut self) {
|
|
for content in self.tile_content.iter_mut() {
|
|
content.clear();
|
|
}
|
|
}
|
|
|
|
/// Generates an empty map, consisting entirely of solid walls
|
|
pub fn new<S: ToString>(new_depth: i32, width: i32, height: i32, name: S) -> Map {
|
|
let map_tile_count = (width * height) as usize;
|
|
|
|
Map {
|
|
tiles: vec![TileType::Wall; map_tile_count],
|
|
width,
|
|
height,
|
|
revealed_tiles: vec![false; map_tile_count],
|
|
visible_tiles: vec![false; map_tile_count],
|
|
blocked: vec![false; map_tile_count],
|
|
tile_content: vec![Vec::new(); map_tile_count],
|
|
depth: new_depth,
|
|
bloodstains: HashSet::new(),
|
|
view_blocked: HashSet::new(),
|
|
name: name.to_string(),
|
|
}
|
|
}
|
|
}
|
|
|
|
impl BaseMap for Map {
|
|
fn is_opaque(&self, idx: usize) -> bool {
|
|
if idx > 0 && idx < self.tiles.len() {
|
|
tile_opaque(self.tiles[idx]) || self.view_blocked.contains(&idx)
|
|
} else {
|
|
true
|
|
}
|
|
}
|
|
|
|
fn get_available_exits(&self, idx: usize) -> SmallVec<[(usize, f32); 10]> {
|
|
let mut exits = rltk::SmallVec::new();
|
|
let x = idx as i32 % self.width;
|
|
let y = idx as i32 / self.width;
|
|
let w = self.width as usize;
|
|
let tt = self.tiles[idx];
|
|
|
|
// Cardinal directions
|
|
if self.is_exit_valid(x - 1, y) {
|
|
exits.push((idx - 1, tile_cost(tt)))
|
|
};
|
|
if self.is_exit_valid(x + 1, y) {
|
|
exits.push((idx + 1, tile_cost(tt)))
|
|
};
|
|
if self.is_exit_valid(x, y - 1) {
|
|
exits.push((idx - w, tile_cost(tt)))
|
|
};
|
|
if self.is_exit_valid(x, y + 1) {
|
|
exits.push((idx + w, tile_cost(tt)))
|
|
};
|
|
|
|
// Diagonals
|
|
if self.is_exit_valid(x - 1, y - 1) {
|
|
exits.push(((idx - w) - 1, tile_cost(tt) * 1.45));
|
|
}
|
|
if self.is_exit_valid(x + 1, y - 1) {
|
|
exits.push(((idx - w) + 1, tile_cost(tt) * 1.45));
|
|
}
|
|
if self.is_exit_valid(x - 1, y + 1) {
|
|
exits.push(((idx + w) - 1, tile_cost(tt) * 1.45));
|
|
}
|
|
if self.is_exit_valid(x + 1, y + 1) {
|
|
exits.push(((idx + w) + 1, tile_cost(tt) * 1.45));
|
|
}
|
|
|
|
exits
|
|
}
|
|
|
|
fn get_pathing_distance(&self, idx1: usize, idx2: usize) -> f32 {
|
|
let w = self.width as usize;
|
|
let p1 = Point::new(idx1 % w, idx1 / w);
|
|
let p2 = Point::new(idx2 % w, idx2 / w);
|
|
|
|
rltk::DistanceAlg::Pythagoras.distance2d(p1, p2)
|
|
}
|
|
}
|
|
|
|
impl Algorithm2D for Map {
|
|
fn dimensions(&self) -> Point {
|
|
Point::new(self.width, self.height)
|
|
}
|
|
}
|