pub struct GraphMorphism<'a, Map, Dom, Cod>(pub &'a Map, pub &'a Dom, pub &'a Cod);Expand description
A homomorphism between graphs defined by a mapping.
This struct borrows its data to perform validation. The domain and codomain are assumed to be valid graphs. If that is in question, the graphs should be validated before validating this object.
Tuple Fields§
§0: &'a Map§1: &'a Dom§2: &'a CodImplementations§
Source§impl<'a, Map, Dom, Cod> GraphMorphism<'a, Map, Dom, Cod>
impl<'a, Map, Dom, Cod> GraphMorphism<'a, Map, Dom, Cod>
Sourcepub fn iter_invalid(
&self,
) -> impl Iterator<Item = InvalidGraphMorphism<Map::DomV, Map::DomE>> + 'a + use<'a, Map, Dom, Cod>
pub fn iter_invalid( &self, ) -> impl Iterator<Item = InvalidGraphMorphism<Map::DomV, Map::DomE>> + 'a + use<'a, Map, Dom, Cod>
Iterates over failures of the mapping to be a graph homomorphism.
Trait Implementations§
Source§impl<Map, Dom, Cod> Validate for GraphMorphism<'_, Map, Dom, Cod>
impl<Map, Dom, Cod> Validate for GraphMorphism<'_, Map, Dom, Cod>
Source§type ValidationError = InvalidGraphMorphism<<Map as GraphMapping>::DomV, <Map as GraphMapping>::DomE>
type ValidationError = InvalidGraphMorphism<<Map as GraphMapping>::DomV, <Map as GraphMapping>::DomE>
The type of a validation error. Read more
Auto Trait Implementations§
impl<'a, Map, Dom, Cod> Freeze for GraphMorphism<'a, Map, Dom, Cod>
impl<'a, Map, Dom, Cod> RefUnwindSafe for GraphMorphism<'a, Map, Dom, Cod>
impl<'a, Map, Dom, Cod> Send for GraphMorphism<'a, Map, Dom, Cod>
impl<'a, Map, Dom, Cod> Sync for GraphMorphism<'a, Map, Dom, Cod>
impl<'a, Map, Dom, Cod> Unpin for GraphMorphism<'a, Map, Dom, Cod>
impl<'a, Map, Dom, Cod> UnwindSafe for GraphMorphism<'a, Map, Dom, Cod>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.