pub enum TabEdge {
Basic(QualifiedName),
Square {
dom: Box<TabMor>,
cod: Box<TabMor>,
pre: Box<TabEdge>,
post: Box<TabEdge>,
},
}Expand description
“Edge” in a model of a discrete tabulator theory.
Morphisms of these two forms generate all the morphisms in the model.
Variants§
Basic(QualifiedName)
Basic morphism between any two objects.
Square
Generating morphism between tabulated morphisms, a commutative square.
Trait Implementations§
Source§impl From<QualifiedName> for TabEdge
impl From<QualifiedName> for TabEdge
Source§fn from(value: QualifiedName) -> Self
fn from(value: QualifiedName) -> Self
Converts to this type from the input type.
impl Eq for TabEdge
impl StructuralPartialEq for TabEdge
Auto Trait Implementations§
impl Freeze for TabEdge
impl RefUnwindSafe for TabEdge
impl Send for TabEdge
impl Sync for TabEdge
impl Unpin for TabEdge
impl UnwindSafe for TabEdge
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.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.