pub struct MazeGenerator {
pub width: usize,
pub height: usize,
}Fields§
§width: usize§height: usizeImplementations§
Source§impl MazeGenerator
impl MazeGenerator
pub fn new(width: usize, height: usize) -> Self
pub fn recursive_backtracker(&self, rng: &mut Rng) -> Vec<MazeCell>
pub fn ellers_algorithm(&self, rng: &mut Rng) -> Vec<MazeCell>
pub fn prims_algorithm(&self, rng: &mut Rng) -> Vec<MazeCell>
pub fn kruskals_algorithm(&self, rng: &mut Rng) -> Vec<MazeCell>
pub fn to_tiles(&self, cells: &[MazeCell]) -> Vec<Tile>
Auto Trait Implementations§
impl Freeze for MazeGenerator
impl RefUnwindSafe for MazeGenerator
impl Send for MazeGenerator
impl Sync for MazeGenerator
impl Unpin for MazeGenerator
impl UnsafeUnpin for MazeGenerator
impl UnwindSafe for MazeGenerator
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.