Struct DiscreteDblModelMorphismFinder

pub struct DiscreteDblModelMorphismFinder<'a, DomId, CodId, Cat: FgCategory> { /* private fields */ }

Finds morphisms between two models of a discrete double theory.

Morphisms are found using backtracking search. In general, there can be infinitely many morphisms between two models, so not all of them can be reported. The search is restricted to morphisms that send each basic morphism in the domain to a simple path of basic morphisms in the codomain.

Implementations

impl<'a, DomId, CodId, Cat> DiscreteDblModelMorphismFinder<'a, DomId, CodId, Cat>

where DomId: Clone + Eq + Hash, CodId: Clone + Eq + Hash, Cat: FgCategory, Cat::Ob: Hash, Cat::Mor: Hash,

pub fn max_path_len(&mut self, n: usize) -> &mut Self

Restrict the maximum length of the image of a generator.

pub fn monic(&mut self) -> &mut Self

Restrict the search to monomorphisms between models.

pub fn injective_ob(&mut self) -> &mut Self

Restrict the search to model morphisms that are injective on objects.

pub fn faithful(&mut self) -> &mut Self

Restrict the search to model morphisms that are faithful.

A faithful morphism is an injective map on morphisms when restricted to any domain/codomain pair of objects in the domain.

In future work, this will be efficiently checked for early search tree pruning; however, this is currently enforced by filtering with is_free_simple_faithful.

pub fn initialize_ob(&mut self, ob: DomId, val: CodId) -> &mut Self

Require morphisms to send object ob in domain to val in codomain.

pub fn initialize_mor(&mut self, m: DomId, val: Path<CodId, CodId>) -> &mut Self

Require morphisms to send morphism m in domain to val in codomain.

pub fn find_all(&mut self) -> Vec<DiscreteDblModelMapping<DomId, CodId>>

Finds all morphisms.