Struct PrecedenceGraph 

pub struct PrecedenceGraph<I> { /* private fields */ }

A validated finite precedence DAG over stable event ids.

Implementations

impl PrecedenceGraph<SerialEventId>

pub fn try_new( edges: impl IntoIterator<Item = (SerialEventId, SerialEventId)>, known_nodes: &BTreeSet<SerialEventId>, ) -> Result<Self, SerialPlanError>

Builds a graph from before -> after edges.

pub fn contains_edge( &self, before: &SerialEventId, after: &SerialEventId, ) -> bool

Returns whether one direct precedence edge exists.

pub fn successors( &self, event_id: &SerialEventId, ) -> Option<&BTreeSet<SerialEventId>>

Returns the outgoing precedence targets for one event.

pub fn edges(&self) -> impl Iterator<Item = (&SerialEventId, &SerialEventId)>

Returns every direct precedence edge in canonical order.

Trait Implementations

impl<I: Clone> Clone for PrecedenceGraph<I>

fn clone(&self) -> PrecedenceGraph<I>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Debug> Debug for PrecedenceGraph<I>

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

Formats the value using the given formatter.

impl<I: Ord> Default for PrecedenceGraph<I>

fn default() -> Self

Returns the “default value” for a type.

impl<I: Eq> Eq for PrecedenceGraph<I>

impl<I: PartialEq> PartialEq for PrecedenceGraph<I>

fn eq(&self, other: &PrecedenceGraph<I>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<I: PartialEq> StructuralPartialEq for PrecedenceGraph<I>