Struct stack_graphs::partial::PartialPathEdgeList[][src]

#[repr(C)]
pub struct PartialPathEdgeList { /* fields omitted */ }
Expand description

The edges in a path keep track of precedence information so that we can correctly handle shadowed definitions.

Implementations

Returns whether this edge list is empty.

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

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

Performs the conversion.

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Performs the conversion.

Performs the conversion.

The resulting type after obtaining ownership.

Creates owned data from borrowed data, usually by cloning. Read more

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.