123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187 |
- extern crate rltk;
- use rltk::{ RGB, Rltk, Console, BaseMap, Algorithm2D, Point };
- extern crate specs;
- use specs::prelude::*;
- use serde::{Serialize, Deserialize};
- use std::collections::HashSet;
- pub const MAPWIDTH : usize = 80;
- pub const MAPHEIGHT : usize = 43;
- pub const MAPCOUNT : usize = MAPHEIGHT * MAPWIDTH;
- #[derive(PartialEq, Copy, Clone, Serialize, Deserialize)]
- pub enum TileType {
- Wall, Floor, DownStairs
- }
- #[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>,
- #[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 = (y * self.width) + x;
- !self.blocked[idx as usize]
- }
- pub fn populate_blocked(&mut self) {
- for (i,tile) in self.tiles.iter_mut().enumerate() {
- self.blocked[i] = *tile == TileType::Wall;
- }
- }
- 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(new_depth : i32) -> Map {
- Map{
- tiles : vec![TileType::Wall; MAPCOUNT],
- width : MAPWIDTH as i32,
- height: MAPHEIGHT as i32,
- revealed_tiles : vec![false; MAPCOUNT],
- visible_tiles : vec![false; MAPCOUNT],
- blocked : vec![false; MAPCOUNT],
- tile_content : vec![Vec::new(); MAPCOUNT],
- depth: new_depth,
- bloodstains: HashSet::new()
- }
- }
- }
- impl BaseMap for Map {
- fn is_opaque(&self, idx:i32) -> bool {
- self.tiles[idx as usize] == TileType::Wall
- }
- fn get_available_exits(&self, idx:i32) -> Vec<(i32, f32)> {
- let mut exits : Vec<(i32, f32)> = Vec::new();
- let x = idx % self.width;
- let y = idx / self.width;
- // Cardinal directions
- if self.is_exit_valid(x-1, y) { exits.push((idx-1, 1.0)) };
- if self.is_exit_valid(x+1, y) { exits.push((idx+1, 1.0)) };
- if self.is_exit_valid(x, y-1) { exits.push((idx-self.width, 1.0)) };
- if self.is_exit_valid(x, y+1) { exits.push((idx+self.width, 1.0)) };
- // Diagonals
- if self.is_exit_valid(x-1, y-1) { exits.push(((idx-self.width)-1, 1.45)); }
- if self.is_exit_valid(x+1, y-1) { exits.push(((idx-self.width)+1, 1.45)); }
- if self.is_exit_valid(x-1, y+1) { exits.push(((idx+self.width)-1, 1.45)); }
- if self.is_exit_valid(x+1, y+1) { exits.push(((idx+self.width)+1, 1.45)); }
- exits
- }
- fn get_pathing_distance(&self, idx1:i32, idx2:i32) -> f32 {
- let p1 = Point::new(idx1 % self.width, idx1 / self.width);
- let p2 = Point::new(idx2 % self.width, idx2 / self.width);
- rltk::DistanceAlg::Pythagoras.distance2d(p1, p2)
- }
- }
- impl Algorithm2D for Map {
- fn point2d_to_index(&self, pt: Point) -> i32 {
- (pt.y * self.width) + pt.x
- }
- fn index_to_point2d(&self, idx:i32) -> Point {
- Point{ x: idx % self.width, y: idx / self.width }
- }
- }
- fn is_revealed_and_wall(map: &Map, x: i32, y: i32) -> bool {
- let idx = map.xy_idx(x, y);
- map.tiles[idx] == TileType::Wall && map.revealed_tiles[idx]
- }
- fn wall_glyph(map : &Map, x: i32, y:i32) -> u8 {
- if x < 1 || x > map.width-2 || y < 1 || y > map.height-2 as i32 { return 35; }
- let mut mask : u8 = 0;
- if is_revealed_and_wall(map, x, y - 1) { mask +=1; }
- if is_revealed_and_wall(map, x, y + 1) { mask +=2; }
- if is_revealed_and_wall(map, x - 1, y) { mask +=4; }
- if is_revealed_and_wall(map, x + 1, y) { mask +=8; }
- match mask {
- 0 => { 9 } // Pillar because we can't see neighbors
- 1 => { 186 } // Wall only to the north
- 2 => { 186 } // Wall only to the south
- 3 => { 186 } // Wall to the north and south
- 4 => { 205 } // Wall only to the west
- 5 => { 188 } // Wall to the north and west
- 6 => { 187 } // Wall to the south and west
- 7 => { 185 } // Wall to the north, south and west
- 8 => { 205 } // Wall only to the east
- 9 => { 200 } // Wall to the north and east
- 10 => { 201 } // Wall to the south and east
- 11 => { 204 } // Wall to the north, south and east
- 12 => { 205 } // Wall to the east and west
- 13 => { 202 } // Wall to the east, west, and south
- 14 => { 203 } // Wall to the east, west, and north
- _ => { 35 } // We missed one?
- }
- }
- pub fn draw_map(map : &Map, ctx : &mut Rltk) {
- let mut y = 0;
- let mut x = 0;
- for (idx,tile) in map.tiles.iter().enumerate() {
- // Render a tile depending upon the tile type
- if map.revealed_tiles[idx] {
- let glyph;
- let mut fg;
- let mut bg = RGB::from_f32(0., 0., 0.);
- match tile {
- TileType::Floor => {
- glyph = rltk::to_cp437('.');
- fg = RGB::from_f32(0.0, 0.5, 0.5);
- }
- TileType::Wall => {
- glyph = wall_glyph(&*map, x, y);
- fg = RGB::from_f32(0., 1.0, 0.);
- }
- TileType::DownStairs => {
- glyph = rltk::to_cp437('>');
- fg = RGB::from_f32(0., 1.0, 1.0);
- }
- }
- if map.bloodstains.contains(&idx) { bg = RGB::from_f32(0.75, 0., 0.); }
- if !map.visible_tiles[idx] {
- fg = fg.to_greyscale();
- bg = RGB::from_f32(0., 0., 0.); // Don't show stains out of visual range
- }
- ctx.set(x, y, fg, bg, glyph);
- }
- // Move the coordinates
- x += 1;
- if x > MAPWIDTH as i32-1 {
- x = 0;
- y += 1;
- }
- }
- }
|