pub struct RRTDubinsNode {
pub x: f64,
pub y: f64,
pub yaw: f64,
pub path_x: Vec<f64>,
pub path_y: Vec<f64>,
pub path_yaw: Vec<f64>,
pub cost: f64,
pub parent: Option<usize>,
}Expand description
A node in the RRT-Dubins tree, carrying position and heading.
Fields§
§x: f64§y: f64§yaw: f64§path_x: Vec<f64>§path_y: Vec<f64>§path_yaw: Vec<f64>§cost: f64§parent: Option<usize>Implementations§
Trait Implementations§
Source§impl Clone for RRTDubinsNode
impl Clone for RRTDubinsNode
Source§fn clone(&self) -> RRTDubinsNode
fn clone(&self) -> RRTDubinsNode
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for RRTDubinsNode
impl RefUnwindSafe for RRTDubinsNode
impl Send for RRTDubinsNode
impl Sync for RRTDubinsNode
impl Unpin for RRTDubinsNode
impl UnsafeUnpin for RRTDubinsNode
impl UnwindSafe for RRTDubinsNode
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 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.