🎉 Initial Commit

This is an implementation of the Hands On Rust book, the code might change from what is presented in the book
main
Pau Costa Ferrer 2023-11-05 20:11:55 +01:00
commit b427f52367
8 changed files with 2299 additions and 0 deletions

1
.gitignore vendored Normal file
View File

@ -0,0 +1 @@
/target

2068
Cargo.lock generated Normal file

File diff suppressed because it is too large Load Diff

9
Cargo.toml Normal file
View File

@ -0,0 +1,9 @@
[package]
name = "dungeoncrawl"
version = "0.1.0"
edition = "2021"
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
[dependencies]
bracket-lib = "~0.8.1"

BIN
resources/dungeonfont.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 75 KiB

49
src/main.rs Normal file
View File

@ -0,0 +1,49 @@
mod map;
mod map_builder;
mod player;
mod prelude {
pub use bracket_lib::prelude::*;
pub const SCREEN_WIDTH: i32 = 80;
pub const SCREEN_HEIGHT: i32 = 50;
pub use crate::map::*;
pub use crate::player::*;
}
use map_builder::MapBuilder;
use prelude::*;
struct State {
map: Map,
player: Player,
}
impl State {
fn new() -> Self {
let mut rng = RandomNumberGenerator::new();
let map_builder = MapBuilder::new(&mut rng);
Self {
map: map_builder.map,
player: Player::new(map_builder.player_start),
}
}
}
impl GameState for State {
fn tick(&mut self, ctx: &mut BTerm) {
ctx.cls();
self.player.update(ctx, &self.map);
self.map.render(ctx);
self.player.render(ctx);
}
}
fn main() -> BError {
println!("Hello, world!");
let context = BTermBuilder::simple80x50()
.with_title("Dungeon Crawler")
.with_fps_cap(30.0)
.build()?;
main_loop(context, State::new())
}

51
src/map.rs Normal file
View File

@ -0,0 +1,51 @@
use crate::prelude::*;
const NUM_TILES: usize = { SCREEN_WIDTH * SCREEN_HEIGHT } as usize;
#[derive(Copy, Clone, PartialEq)]
pub enum TileType {
Wall,
Floor,
}
pub struct Map {
pub tiles: Vec<TileType>,
}
pub fn map_idx(x: i32, y: i32) -> usize {
((y * SCREEN_WIDTH) + x) as usize
}
impl Map {
pub fn new() -> Self {
Self {
tiles: vec![TileType::Floor; NUM_TILES],
}
}
pub fn render(&self, ctx: &mut BTerm) {
for y in 0..SCREEN_HEIGHT {
for x in 0..SCREEN_WIDTH {
let idx = map_idx(x, y);
match self.tiles[idx] {
TileType::Floor => {
ctx.set(x, y, YELLOW, BLACK, to_cp437('.'));
}
TileType::Wall => ctx.set(x, y, YELLOW, GREEN, to_cp437('#')),
}
}
}
}
pub fn in_bounds(&self, point: Point) -> bool {
point.x >= 0 && point.x < SCREEN_WIDTH && point.y >= 0 && point.y < SCREEN_HEIGHT
}
pub fn can_enter_tile(&self, point: Point) -> bool {
self.in_bounds(point) && self.tiles[map_idx(point.x, point.y)] == TileType::Floor
}
pub fn try_idx(&self, point: Point) -> Option<usize> {
if !self.in_bounds(point) {
None
} else {
Some(map_idx(point.x, point.y))
}
}
}

85
src/map_builder.rs Normal file
View File

@ -0,0 +1,85 @@
use crate::prelude::*;
const NUM_ROOMS: usize = 20;
pub struct MapBuilder {
pub map: Map,
pub rooms: Vec<Rect>,
pub player_start: Point,
}
impl MapBuilder {
fn fill(&mut self, tile: TileType) {
self.map.tiles.iter_mut().for_each(|t| *t = tile);
}
fn build_random_rooms(&mut self, rng: &mut RandomNumberGenerator) {
while self.rooms.len() < NUM_ROOMS {
let room = Rect::with_size(
rng.range(1, SCREEN_WIDTH - 10),
rng.range(1, SCREEN_HEIGHT - 10),
rng.range(2, 10),
rng.range(2, 10),
);
let mut overlap = false;
for r in self.rooms.iter() {
if r.intersect(&room) {
overlap = true;
}
}
if !overlap {
room.for_each(|p| {
if p.x > 0 && p.x < SCREEN_WIDTH && p.y > 0 && p.y < SCREEN_HEIGHT {
let idx = map_idx(p.x, p.y);
self.map.tiles[idx] = TileType::Floor;
}
});
self.rooms.push(room)
}
}
}
fn apply_vertical_tunnel(&mut self, y1: i32, y2: i32, x: i32) {
use std::cmp::{max, min};
for y in min(y1, y2)..=max(y1, y2) {
if let Some(idx) = self.map.try_idx(Point::new(x, y)) {
self.map.tiles[idx as usize] = TileType::Floor;
}
}
}
fn apply_horizontal_tunnel(&mut self, x1: i32, x2: i32, y: i32) {
use std::cmp::{max, min};
for x in min(x1, x2)..=max(x1, x2) {
if let Some(idx) = self.map.try_idx(Point::new(x, y)) {
self.map.tiles[idx as usize] = TileType::Floor;
}
}
}
fn build_corridors(&mut self, rng: &mut RandomNumberGenerator) {
let mut rooms = self.rooms.clone();
rooms.sort_by(|a, b| a.center().x.cmp(&b.center().x));
for (i, room) in rooms.iter().enumerate().skip(1) {
let prev = rooms[i - 1].center();
let new = room.center();
if rng.range(0, 2) == 1 {
self.apply_horizontal_tunnel(prev.x, new.x, prev.y);
self.apply_vertical_tunnel(prev.y, new.y, new.x);
} else {
self.apply_vertical_tunnel(prev.y, new.y, prev.x);
self.apply_horizontal_tunnel(prev.x, new.x, new.y);
}
}
}
pub fn new(rng: &mut RandomNumberGenerator) -> Self {
let mut mb = MapBuilder {
map: Map::new(),
rooms: Vec::new(),
player_start: Point::zero(),
};
mb.fill(TileType::Wall);
mb.build_random_rooms(rng);
mb.build_corridors(rng);
mb.player_start = mb.rooms[0].center();
mb
}
}

36
src/player.rs Normal file
View File

@ -0,0 +1,36 @@
use crate::prelude::*;
pub struct Player {
pub position: Point,
}
impl Player {
pub fn new(position: Point) -> Self {
Self { position }
}
pub fn render(&self, ctx: &mut BTerm) {
ctx.set(
self.position.x,
self.position.y,
WHITE,
BLACK,
to_cp437('@'),
)
}
pub fn update(&mut self, ctx: &mut BTerm, map: &Map) {
if let Some(key) = ctx.key {
let delta = match key {
VirtualKeyCode::W => Point::new(0, -1),
VirtualKeyCode::A => Point::new(-1, 0),
VirtualKeyCode::S => Point::new(0, 1),
VirtualKeyCode::D => Point::new(1, 0),
_ => Point::zero(),
};
let new_position = self.position + delta;
if map.can_enter_tile(new_position) {
self.position = new_position;
}
}
}
}