Struct stack_graphs::graph::Edge

pub struct Edge {
    pub source: Handle<Node>,
    pub sink: Handle<Node>,
    pub precedence: i32,
}

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: i32

Trait Implementations

impl Appendable for Edge

fn append_to( &self, graph: &StackGraph, partials: &mut PartialPaths, path: &mut PartialPath ) -> Result<(), PathResolutionError>

Append this appendable to the given path. Resolving jump nodes and renaming unused_variables is part of the responsibility of this method.

fn start_node(&self) -> Handle<Node>

Return the start node.

fn end_node(&self) -> Handle<Node>

Return the end node.

fn display<'a>( &'a self, graph: &'a StackGraph, _partials: &'a mut PartialPaths ) -> Box<dyn Display + 'a>

Return a Display implementation.

impl Candidates<Edge> for GraphEdges

fn find_candidates<R>( &mut self, graph: &StackGraph, _partials: &mut PartialPaths, path: &PartialPath, result: &mut R )where R: Extend<Edge>,

impl Clone for Edge

fn clone(&self) -> Edge

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Edge

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for Edge

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for Edge

fn cmp(&self, other: &Edge) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<Edge> for Edge

fn eq(&self, other: &Edge) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd<Edge> for Edge

fn partial_cmp(&self, other: &Edge) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl ToAppendable<Edge, Edge> for GraphEdges

fn get_appendable<'a>(&'a self, value: &'a Edge) -> &'a Edge

impl Copy for Edge

impl Eq for Edge

impl StructuralEq for Edge

impl StructuralPartialEq for Edge