pub struct Edge<X, T, const N: usize>where
T: Trajectory<X, N>,{ /* private fields */ }Expand description
An edge in the Rrtx graph. Stores information about what type of connection this is between two nodes (directed) All information is from the perspective of node a, assuming this edge represents the directed edge a -> b. An outgoing edge of a in the directed edge a -> b An incoming edge of a in the directed edge b -> a
Implementations§
Source§impl<X, T, const N: usize> Edge<X, T, N>where
T: Trajectory<X, N>,
impl<X, T, const N: usize> Edge<X, T, N>where
T: Trajectory<X, N>,
pub fn bits(&self) -> u8
pub fn outgoing_neighbor_type(&self) -> Option<NeighborType>
pub fn incoming_neighbor_type(&self) -> Option<NeighborType>
Sourcepub fn is_parent(&self) -> bool
pub fn is_parent(&self) -> bool
Returns true if along the directed edge a -> b, b is the parent of a
Sourcepub fn trajectory(&self) -> Option<&T>
pub fn trajectory(&self) -> Option<&T>
The if the trajectory to get from a to b is valid
Trait Implementations§
Source§impl<'de, X, T, const N: usize> Deserialize<'de> for Edge<X, T, N>where
T: Trajectory<X, N> + Deserialize<'de>,
impl<'de, X, T, const N: usize> Deserialize<'de> for Edge<X, T, N>where
T: Trajectory<X, N> + Deserialize<'de>,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<X: PartialEq, T, const N: usize> PartialEq for Edge<X, T, N>where
T: Trajectory<X, N> + PartialEq,
impl<X: PartialEq, T, const N: usize> PartialEq for Edge<X, T, N>where
T: Trajectory<X, N> + PartialEq,
impl<X: Copy, T, const N: usize> Copy for Edge<X, T, N>where
T: Trajectory<X, N> + Copy,
impl<X: Eq, T, const N: usize> Eq for Edge<X, T, N>where
T: Trajectory<X, N> + Eq,
impl<X, T, const N: usize> StructuralPartialEq for Edge<X, T, N>where
T: Trajectory<X, N>,
Auto Trait Implementations§
impl<X, T, const N: usize> Freeze for Edge<X, T, N>where
T: Freeze,
impl<X, T, const N: usize> RefUnwindSafe for Edge<X, T, N>where
T: RefUnwindSafe,
X: RefUnwindSafe,
impl<X, T, const N: usize> Send for Edge<X, T, N>
impl<X, T, const N: usize> Sync for Edge<X, T, N>
impl<X, T, const N: usize> Unpin for Edge<X, T, N>
impl<X, T, const N: usize> UnwindSafe for Edge<X, T, N>where
T: UnwindSafe,
X: UnwindSafe,
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> 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.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.