Struct stack_graphs::graph::Edge [−][src]
Expand description
Connects two nodes in a stack graph.
These edges provide the basic graph connectivity that allow us to search for name binding paths in a stack graph. (Though not all sequence of edges is a well-formed name binding: the nodes that you encounter along the path must also satisfy all of the rules for maintaining correct symbol and scope stacks.)
Fields
source: Handle<Node>sink: Handle<Node>precedence: i32Trait Implementations
This method returns an ordering between self and other values if one exists. Read more
This method tests less than (for self and other) and is used by the < operator. Read more
This method tests less than or equal to (for self and other) and is used by the <=
operator. Read more
This method tests greater than (for self and other) and is used by the > operator. Read more
Auto Trait Implementations
impl RefUnwindSafe for Edge
impl UnwindSafe for Edge
Blanket Implementations
Mutably borrows from an owned value. Read more