Struct PathEq

pub struct PathEq<V, E> {
    pub lhs: Path<V, E>,
    pub rhs: Path<V, E>,
}

Assertion of an equation between the composites of two paths in a category.

Fields

lhs: Path<V, E>

Left hand side of equation.

rhs: Path<V, E>

Right hand side of equation.

Implementations

impl<V, E> PathEq<V, E>

pub fn new(lhs: Path<V, E>, rhs: Path<V, E>) -> PathEq<V, E>

Constructs a path equation with the given left- and right-hand sides.

pub fn src(&self, graph: &impl Graph<V = V, E = E>) -> V

where V: Clone,

Source of the path equation in the given graph.

Only well defined when the path equation is valid.

pub fn tgt(&self, graph: &impl Graph<V = V, E = E>) -> V

where V: Clone,

Target of the path equation in the given graph.

Only well defined when the path equation is valid.

pub fn validate_in<G>(&self, graph: &G) -> Result<(), NonEmpty<InvalidPathEq>>

where V: Eq + Clone, G: Graph<V = V, E = E>,

Validates that the path equation is well defined in the given graph.

pub fn iter_invalid_in<G>( &self, graph: &G, ) -> impl Iterator<Item = InvalidPathEq> + use<G, V, E>

where V: Eq + Clone, G: Graph<V = V, E = E>,

Iterators over failures of the path equation to be well defined.

Trait Implementations

impl<V: Clone, E: Clone> Clone for PathEq<V, E>

fn clone(&self) -> PathEq<V, E>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<V: Debug, E: Debug> Debug for PathEq<V, E>

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

Formats the value using the given formatter.

impl<V: PartialEq, E: PartialEq> PartialEq for PathEq<V, E>

fn eq(&self, other: &PathEq<V, E>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<V: Eq, E: Eq> Eq for PathEq<V, E>

impl<V, E> StructuralPartialEq for PathEq<V, E>