pub enum ScheduledGraphNode {
BlockStart,
InstructionIndex(usize),
BlockEnd,
}
Variants§
Trait Implementations§
Source§impl Clone for ScheduledGraphNode
impl Clone for ScheduledGraphNode
Source§fn clone(&self) -> ScheduledGraphNode
fn clone(&self) -> ScheduledGraphNode
Returns a copy 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 moreSource§impl Debug for ScheduledGraphNode
impl Debug for ScheduledGraphNode
Source§impl Hash for ScheduledGraphNode
impl Hash for ScheduledGraphNode
Source§impl Ord for ScheduledGraphNode
impl Ord for ScheduledGraphNode
Source§fn cmp(&self, other: &ScheduledGraphNode) -> Ordering
fn cmp(&self, other: &ScheduledGraphNode) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialEq for ScheduledGraphNode
impl PartialEq for ScheduledGraphNode
Source§impl PartialOrd for ScheduledGraphNode
impl PartialOrd for ScheduledGraphNode
impl Copy for ScheduledGraphNode
impl Eq for ScheduledGraphNode
impl StructuralPartialEq for ScheduledGraphNode
Auto Trait Implementations§
impl Freeze for ScheduledGraphNode
impl RefUnwindSafe for ScheduledGraphNode
impl Send for ScheduledGraphNode
impl Sync for ScheduledGraphNode
impl Unpin for ScheduledGraphNode
impl UnwindSafe for ScheduledGraphNode
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§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
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<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.