pub struct WavefrontGrid {
pub rows: usize,
pub cols: usize,
/* private fields */
}Expand description
2D grid for wavefront planning. true = obstacle, false = free.
Fields§
§rows: usizeNumber of rows.
cols: usizeNumber of columns.
Implementations§
Source§impl WavefrontGrid
impl WavefrontGrid
Sourcepub fn from_vec(rows: usize, cols: usize, cells: Vec<bool>) -> Self
pub fn from_vec(rows: usize, cols: usize, cells: Vec<bool>) -> Self
Creates a grid from a row-major boolean vector.
true = obstacle, false = free.
Sourcepub fn is_obstacle(&self, row: usize, col: usize) -> bool
pub fn is_obstacle(&self, row: usize, col: usize) -> bool
Returns whether the cell is an obstacle.
Sourcepub fn set_obstacle(&mut self, row: usize, col: usize, val: bool)
pub fn set_obstacle(&mut self, row: usize, col: usize, val: bool)
Sets a cell as obstacle or free.
Auto Trait Implementations§
impl Freeze for WavefrontGrid
impl RefUnwindSafe for WavefrontGrid
impl Send for WavefrontGrid
impl Sync for WavefrontGrid
impl Unpin for WavefrontGrid
impl UnsafeUnpin for WavefrontGrid
impl UnwindSafe for WavefrontGrid
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> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.