pub enum EdgeInfo {
Left,
Right,
Unary,
Unordered,
Ordered(usize),
}Expand description
Information about how one compiler graph node relates to another.
Variants§
Left
The source node is the left operand of the target.
Right
The source node is the right operand of the target.
Unary
The source node is the only unary operand of the target.
Unordered
The source node is one of N unordered operands.
Ordered(usize)
The source is node is i of N ordered operands.
Implementations§
Trait Implementations§
Source§impl<'de> Deserialize<'de> for EdgeInfo
impl<'de> Deserialize<'de> for EdgeInfo
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
impl Copy for EdgeInfo
impl Eq for EdgeInfo
impl StructuralPartialEq for EdgeInfo
Auto Trait Implementations§
impl Freeze for EdgeInfo
impl RefUnwindSafe for EdgeInfo
impl Send for EdgeInfo
impl Sync for EdgeInfo
impl Unpin for EdgeInfo
impl UnwindSafe for EdgeInfo
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<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.