simple_map.rs 3.0 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495
  1. use super::{MapBuilder, Map, Rect, apply_room_to_map,
  2. apply_horizontal_tunnel, apply_vertical_tunnel, TileType,
  3. Position, spawner};
  4. use rltk::RandomNumberGenerator;
  5. use specs::prelude::*;
  6. pub struct SimpleMapBuilder {
  7. map : Map,
  8. starting_position : Position,
  9. depth: i32,
  10. rooms: Vec<Rect>,
  11. history: Vec<Map>
  12. }
  13. impl MapBuilder for SimpleMapBuilder {
  14. fn get_map(&self) -> Map {
  15. self.map.clone()
  16. }
  17. fn get_starting_position(&self) -> Position {
  18. self.starting_position.clone()
  19. }
  20. fn get_snapshot_history(&self) -> Vec<Map> {
  21. self.history.clone()
  22. }
  23. fn build_map(&mut self) {
  24. self.rooms_and_corridors();
  25. }
  26. fn spawn_entities(&mut self, ecs : &mut World) {
  27. for room in self.rooms.iter().skip(1) {
  28. spawner::spawn_room(ecs, room, self.depth);
  29. }
  30. }
  31. }
  32. impl SimpleMapBuilder {
  33. pub fn new(new_depth : i32) -> SimpleMapBuilder {
  34. SimpleMapBuilder{
  35. map : Map::new(new_depth),
  36. starting_position : Position{ x: 0, y : 0 },
  37. depth : new_depth,
  38. rooms: Vec::new(),
  39. history: Vec::new()
  40. }
  41. }
  42. fn rooms_and_corridors(&mut self) {
  43. const MAX_ROOMS : i32 = 30;
  44. const MIN_SIZE : i32 = 6;
  45. const MAX_SIZE : i32 = 10;
  46. let mut rng = RandomNumberGenerator::new();
  47. for _i in 0..MAX_ROOMS {
  48. let w = rng.range(MIN_SIZE, MAX_SIZE);
  49. let h = rng.range(MIN_SIZE, MAX_SIZE);
  50. let x = rng.roll_dice(1, self.map.width - w - 1) - 1;
  51. let y = rng.roll_dice(1, self.map.height - h - 1) - 1;
  52. let new_room = Rect::new(x, y, w, h);
  53. let mut ok = true;
  54. for other_room in self.rooms.iter() {
  55. if new_room.intersect(other_room) { ok = false }
  56. }
  57. if ok {
  58. apply_room_to_map(&mut self.map, &new_room);
  59. self.history.push(self.map.clone());
  60. if !self.rooms.is_empty() {
  61. let (new_x, new_y) = new_room.center();
  62. let (prev_x, prev_y) = self.rooms[self.rooms.len()-1].center();
  63. if rng.range(0,1) == 1 {
  64. apply_horizontal_tunnel(&mut self.map, prev_x, new_x, prev_y);
  65. apply_vertical_tunnel(&mut self.map, prev_y, new_y, new_x);
  66. } else {
  67. apply_vertical_tunnel(&mut self.map, prev_y, new_y, prev_x);
  68. apply_horizontal_tunnel(&mut self.map, prev_x, new_x, new_y);
  69. }
  70. }
  71. self.rooms.push(new_room);
  72. self.history.push(self.map.clone());
  73. }
  74. }
  75. let stairs_position = self.rooms[self.rooms.len()-1].center();
  76. let stairs_idx = self.map.xy_idx(stairs_position.0, stairs_position.1);
  77. self.map.tiles[stairs_idx] = TileType::DownStairs;
  78. let start_pos = self.rooms[0].center();
  79. self.starting_position = Position{ x: start_pos.0, y: start_pos.1 };
  80. }
  81. }