pub struct RrtStarSearchStep {
pub sample: [f64; 2],
pub nearest: usize,
pub candidate: Option<[f64; 2]>,
pub accepted: bool,
pub updates: Vec<RrtStarNodeUpdate>,
pub path: Vec<[f64; 2]>,
}Expand description
State observed after one real planner iteration, including rejected samples.
Fields§
§sample: [f64; 2]§nearest: usize§candidate: Option<[f64; 2]>§accepted: bool§updates: Vec<RrtStarNodeUpdate>§path: Vec<[f64; 2]>Current cheapest collision-free goal connection, in goal-to-start order.
Trait Implementations§
Source§impl Clone for RrtStarSearchStep
impl Clone for RrtStarSearchStep
Source§impl Debug for RrtStarSearchStep
impl Debug for RrtStarSearchStep
Source§impl PartialEq for RrtStarSearchStep
impl PartialEq for RrtStarSearchStep
impl StructuralPartialEq for RrtStarSearchStep
Auto Trait Implementations§
impl Freeze for RrtStarSearchStep
impl RefUnwindSafe for RrtStarSearchStep
impl Send for RrtStarSearchStep
impl Sync for RrtStarSearchStep
impl Unpin for RrtStarSearchStep
impl UnsafeUnpin for RrtStarSearchStep
impl UnwindSafe for RrtStarSearchStep
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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 moreimpl<T> Scalar for T
§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.