Struct stack_graphs::partial::PartialPathEdgeList

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

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

Implementations

impl PartialPathEdgeList

pub fn is_empty(&self) -> bool

Returns whether this edge list is empty.

pub fn len(&self) -> usize

pub fn have_reversal(&self, partials: &PartialPaths) -> bool

Returns whether this edge list is iterable in both directions without needing mutable access to the arena.

pub fn empty() -> PartialPathEdgeList

Returns an empty edge list.

pub fn push_front(&mut self, partials: &mut PartialPaths, edge: PartialPathEdge)

Pushes a new edge onto the front of this edge list.

pub fn push_back(&mut self, partials: &mut PartialPaths, edge: PartialPathEdge)

Pushes a new edge onto the back of this edge list.

pub fn pop_front(
    &mut self,
    partials: &mut PartialPaths
) -> Option<PartialPathEdge>

Removes and returns the edge at the front of this edge list. If the list is empty, returns None.

pub fn pop_back(
    &mut self,
    partials: &mut PartialPaths
) -> Option<PartialPathEdge>

Removes and returns the edge at the back of this edge list. If the list is empty, returns None.

pub fn display<'a>(
    self,
    graph: &'a StackGraph,
    partials: &'a mut PartialPaths
) -> impl Display + 'a

pub fn shadows(
    self,
    partials: &mut PartialPaths,
    other: PartialPathEdgeList
) -> bool

Returns whether one edge list shadows another. Note that shadowing is not commutative — if path A shadows path B, the reverse is not true.

pub fn equals(
    self,
    partials: &mut PartialPaths,
    other: PartialPathEdgeList
) -> bool

pub fn cmp(
    self,
    partials: &mut PartialPaths,
    other: PartialPathEdgeList
) -> Ordering

pub fn iter<'a>(
    &self,
    partials: &'a mut PartialPaths
) -> impl Iterator<Item = PartialPathEdge> + 'a

Returns an iterator over the contents of this edge list.

pub fn iter_unordered<'a>(
    &self,
    partials: &'a PartialPaths
) -> impl Iterator<Item = PartialPathEdge> + 'a

Returns an iterator over the contents of this edge list, with no guarantee about the ordering of the elements.

Trait Implementations

impl Clone for PartialPathEdgeList

fn clone(&self) -> PartialPathEdgeList

Returns a copy of the value.

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

Performs copy-assignment from source.

impl From<PartialPathEdgeList> for sg_partial_path_edge_list

fn from(edges: PartialPathEdgeList) -> sg_partial_path_edge_list

Performs the conversion.

impl Niche for PartialPathEdgeList where
    Deque<PartialPathEdge>: Niche, 

type Output = MaybeUninit<Self>

The type that is used to store values of Self inside of a ControlledOption. This might be Self itself, if your niche is a valid instance of the type, but which violates some runtime constraint. But if you cannot easily create your niche as an instance of Self, you can use some other type, you can use some other type instead.

fn none() -> Self::Output

Returns the niche value for this type that should be used to represent None for a ControlledOption.

fn is_none(value: &Self::Output) -> bool

Returns whether value is the niche value for this type.

fn into_some(value: Self) -> Self::Output

Transforms a non-niche value of this type into its Output type. When Output is Self, this will be the identity function.

fn from_some(value: Self::Output) -> Self

Transforms a non-niche value of this type from its Output type. When Output is Self, this will be the identity function.

impl Copy for PartialPathEdgeList