pub struct DiscreteDblModelMapping(pub FpFunctorData<HashColumn<QualifiedName, QualifiedName>, HashColumn<QualifiedName, QualifiedPath>>);Expand description
A mapping between models of a discrete double theory.
Because a discrete double theory has only trivial operations, the naturality axioms for a model morphism are also trivial.
Tuple Fields§
§0: FpFunctorData<HashColumn<QualifiedName, QualifiedName>, HashColumn<QualifiedName, QualifiedPath>>Implementations§
Source§impl DiscreteDblModelMapping
impl DiscreteDblModelMapping
Sourcepub fn new(
ob_map: HashMap<QualifiedName, QualifiedName>,
mor_map: HashMap<QualifiedName, QualifiedPath>,
) -> Self
pub fn new( ob_map: HashMap<QualifiedName, QualifiedName>, mor_map: HashMap<QualifiedName, QualifiedPath>, ) -> Self
Constructs a model mapping from a pair of hash maps.
Sourcepub fn assign_ob(
&mut self,
x: QualifiedName,
y: QualifiedName,
) -> Option<QualifiedName>
pub fn assign_ob( &mut self, x: QualifiedName, y: QualifiedName, ) -> Option<QualifiedName>
Assigns an object generator, returning the previous assignment.
Sourcepub fn assign_mor(
&mut self,
e: QualifiedName,
n: QualifiedPath,
) -> Option<QualifiedPath>
pub fn assign_mor( &mut self, e: QualifiedName, n: QualifiedPath, ) -> Option<QualifiedPath>
Assigns a morphism generator, returning the previous assignment.
Sourcepub fn unassign_ob(&mut self, x: &QualifiedName) -> Option<QualifiedName>
pub fn unassign_ob(&mut self, x: &QualifiedName) -> Option<QualifiedName>
Unassigns an object generator, returning the previous assignment.
Sourcepub fn unassign_mor(&mut self, e: &QualifiedName) -> Option<QualifiedPath>
pub fn unassign_mor(&mut self, e: &QualifiedName) -> Option<QualifiedPath>
Unassigns a morphism generator, returning the previous assignment.
Sourcepub fn functor_into<'a>(
&'a self,
cod: &'a DiscreteDblModel,
) -> FpFunctor<'a, FpFunctorData<HashColumn<QualifiedName, QualifiedName>, HashColumn<QualifiedName, QualifiedPath>>, QualifiedFpCategory>
pub fn functor_into<'a>( &'a self, cod: &'a DiscreteDblModel, ) -> FpFunctor<'a, FpFunctorData<HashColumn<QualifiedName, QualifiedName>, HashColumn<QualifiedName, QualifiedPath>>, QualifiedFpCategory>
Interprets the data as a functor into the given model.
Sourcepub fn morphisms<'a>(
dom: &'a DiscreteDblModel,
cod: &'a DiscreteDblModel,
) -> DiscreteDblModelMorphismFinder<'a>
pub fn morphisms<'a>( dom: &'a DiscreteDblModel, cod: &'a DiscreteDblModel, ) -> DiscreteDblModelMorphismFinder<'a>
Finder of morphisms between two models of a discrete double theory.
Trait Implementations§
Source§impl Clone for DiscreteDblModelMapping
impl Clone for DiscreteDblModelMapping
Source§fn clone(&self) -> DiscreteDblModelMapping
fn clone(&self) -> DiscreteDblModelMapping
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for DiscreteDblModelMapping
impl Debug for DiscreteDblModelMapping
Source§impl Default for DiscreteDblModelMapping
impl Default for DiscreteDblModelMapping
Source§fn default() -> DiscreteDblModelMapping
fn default() -> DiscreteDblModelMapping
Returns the “default value” for a type. Read more
Source§impl PartialEq for DiscreteDblModelMapping
impl PartialEq for DiscreteDblModelMapping
impl Eq for DiscreteDblModelMapping
impl StructuralPartialEq for DiscreteDblModelMapping
Auto Trait Implementations§
impl Freeze for DiscreteDblModelMapping
impl RefUnwindSafe for DiscreteDblModelMapping
impl Send for DiscreteDblModelMapping
impl Sync for DiscreteDblModelMapping
impl Unpin for DiscreteDblModelMapping
impl UnwindSafe for DiscreteDblModelMapping
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.