Struct skeletal_model::skeleton::solver::PoppedNode
source · [−]struct PoppedNode(pub NodeIndex);Expand description
Argument to do_fk. Represents the node that was just popped off of the traversal
queue. This node is already solved.
Tuple Fields
0: NodeIndexTrait Implementations
sourceimpl From<NodeIndex<u32>> for PoppedNode
impl From<NodeIndex<u32>> for PoppedNode
sourcefn from(original: NodeIndex) -> PoppedNode
fn from(original: NodeIndex) -> PoppedNode
Converts to this type from the input type.
Auto Trait Implementations
impl RefUnwindSafe for PoppedNode
impl Send for PoppedNode
impl Sync for PoppedNode
impl Unpin for PoppedNode
impl UnwindSafe for PoppedNode
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
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 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 morefn 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.