Struct pi_path_finding::FNode
source · [−]pub struct FNode<N: PartialOrd + Zero + Copy + Debug> {
pub f: N,
pub node: NodeIndex,
}Expand description
排序节点
Fields
f: Nnode: NodeIndexTrait Implementations
sourceimpl<N: PartialOrd + Zero + Copy + Debug> Ord for FNode<N>
impl<N: PartialOrd + Zero + Copy + Debug> Ord for FNode<N>
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Self where
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Self where
Self: PartialOrd<Self>,
Restrict a value to a certain interval. Read more
sourceimpl<N: PartialOrd + Zero + Copy + Debug> PartialEq<FNode<N>> for FNode<N>
impl<N: PartialOrd + Zero + Copy + Debug> PartialEq<FNode<N>> for FNode<N>
sourceimpl<N: PartialOrd + Zero + Copy + Debug> PartialOrd<FNode<N>> for FNode<N>
impl<N: PartialOrd + Zero + Copy + Debug> PartialOrd<FNode<N>> for FNode<N>
sourcefn partial_cmp(&self, other: &Self) -> Option<Ordering>
fn partial_cmp(&self, other: &Self) -> Option<Ordering>
This method returns an ordering between self and other values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self and other) and is used by the <=
operator. Read more
impl<N: PartialOrd + Zero + Copy + Debug> Eq for FNode<N>
Auto Trait Implementations
impl<N> RefUnwindSafe for FNode<N> where
N: RefUnwindSafe,
impl<N> Send for FNode<N> where
N: Send,
impl<N> Sync for FNode<N> where
N: Sync,
impl<N> Unpin for FNode<N> where
N: Unpin,
impl<N> UnwindSafe for FNode<N> where
N: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
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.