Struct BSPMap 

pub struct BSPMap { /* private fields */ }

Map generated with binary search partitioning. The map must have a size of atleast (20,20).

Credit to https://gamedevelopment.tutsplus.com/tutorials/how-to-use-bsp-trees-to-generate-game-maps–gamedev-12268 and https://github.com/whostolemyhat/dungeon for algorithm and rust implementation help.

Implementations

impl BSPMap

pub fn new( size: Point, seed: StdRng, min_room_size: Point, max_room_size: Point, ) -> Result<Self, Error>

Examples found in repository

examples/bsp-map.rs (line 4)

fn main() {
    let map = BSPMap::new(Point::new(30,50), SeedableRng::seed_from_u64(1), Point::new(3,5), Point::new(10,15)).unwrap();
    println!("{}", map);
}

pub fn get_tiles(&self) -> &HashMap<Point, Tile>

pub fn get_size(&self) -> &Point

pub fn get_rooms(&self) -> &Vec<Room>

pub fn add_room(&mut self, room: &Room)

Trait Implementations

impl Display for BSPMap

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.