Struct stack_graphs::paths::PathEdgeList [−][src]
#[repr(C)]pub struct PathEdgeList { /* fields omitted */ }
Expand description
The edges in a path keep track of precedence information so that we can correctly handle shadowed definitions.
Implementations
Returns an empty edge list.
Pushes a new edge onto the front of this edge list.
Pushes a new edge onto the back of this edge list.
Removes and returns the edge at the front of this edge list. If the list is empty, returns
None
.
Removes and returns the edge at the back of this edge list. If the list is empty, returns
None
.
Returns whether one edge list shadows another. Note that shadowing is not commutative — if path A shadows path B, the reverse is not true.
Returns an iterator over the contents of this edge list.
Returns an iterator over the contents of this edge list, with no guarantee about the ordering of the elements.
Trait Implementations
Performs the conversion.
Auto Trait Implementations
impl !RefUnwindSafe for PathEdgeList
impl Send for PathEdgeList
impl Sync for PathEdgeList
impl Unpin for PathEdgeList
impl UnwindSafe for PathEdgeList
Blanket Implementations
Mutably borrows from an owned value. Read more