#[repr(transparent)]pub struct FreeVDblCategory<G: VDblGraph>(pub G);
Expand description
The VDC freely generated by a virtual double graph.
A virtual double graph freely generated a virtual double category, generalizing how a graph freely generates a category. This is not, however, the most general way to freely generate a VDC. A “virtual double computad” freely generates a VDC but allows the generating cells to have sources and targets that are paths of generating arrows.
Tuple Fields§
§0: G
Trait Implementations§
Source§impl<G: VDblGraph> From<G> for FreeVDblCategory<G>
impl<G: VDblGraph> From<G> for FreeVDblCategory<G>
Source§impl<G: VDblGraph> RefCast for FreeVDblCategory<G>
impl<G: VDblGraph> RefCast for FreeVDblCategory<G>
Source§impl<G: VDblGraph> VDblCategory for FreeVDblCategory<G>
impl<G: VDblGraph> VDblCategory for FreeVDblCategory<G>
Source§type Arr = Path<<G as VDblGraph>::V, <G as VDblGraph>::E>
type Arr = Path<<G as VDblGraph>::V, <G as VDblGraph>::E>
Type of arrows (tight morphisms) in the VDC.
Source§type Cell = DblTree<<G as VDblGraph>::E, <G as VDblGraph>::ProE, <G as VDblGraph>::Sq>
type Cell = DblTree<<G as VDblGraph>::E, <G as VDblGraph>::ProE, <G as VDblGraph>::Sq>
Type of cells in the VDC;
Source§fn has_proarrow(&self, pro: &Self::Pro) -> bool
fn has_proarrow(&self, pro: &Self::Pro) -> bool
Does the proarrow belong to the VDC?
Source§fn cell_dom(&self, tree: &Self::Cell) -> Path<Self::Ob, Self::Pro>
fn cell_dom(&self, tree: &Self::Cell) -> Path<Self::Ob, Self::Pro>
Gets the domain of a cell, a path of proarrows.
Source§fn cell_cod(&self, tree: &Self::Cell) -> Self::Pro
fn cell_cod(&self, tree: &Self::Cell) -> Self::Pro
Gets the codomain of a cell, a single proarrow.
Source§fn compose(&self, path: Path<Self::Ob, Self::Arr>) -> Self::Arr
fn compose(&self, path: Path<Self::Ob, Self::Arr>) -> Self::Arr
Composes a path of arrows in the VDC.
Source§fn compose_cells(
&self,
tree: DblTree<Self::Arr, Self::Pro, Self::Cell>,
) -> Self::Cell
fn compose_cells( &self, tree: DblTree<Self::Arr, Self::Pro, Self::Cell>, ) -> Self::Cell
Composes a tree of cells in the VDC.
Source§fn compose2(&self, f: Self::Arr, g: Self::Arr) -> Self::Arr
fn compose2(&self, f: Self::Arr, g: Self::Arr) -> Self::Arr
Composes a pair of arrows with compatible (co)domains.
Source§fn compose_cells2(
&self,
αs: impl IntoIterator<Item = Self::Cell>,
β: Self::Cell,
) -> Self::Cellwhere
Self: Sized,
fn compose_cells2(
&self,
αs: impl IntoIterator<Item = Self::Cell>,
β: Self::Cell,
) -> Self::Cellwhere
Self: Sized,
Composes a two-layer pasting of cells.
Auto Trait Implementations§
impl<G> Freeze for FreeVDblCategory<G>where
G: Freeze,
impl<G> RefUnwindSafe for FreeVDblCategory<G>where
G: RefUnwindSafe,
impl<G> Send for FreeVDblCategory<G>where
G: Send,
impl<G> Sync for FreeVDblCategory<G>where
G: Sync,
impl<G> Unpin for FreeVDblCategory<G>where
G: Unpin,
impl<G> UnwindSafe for FreeVDblCategory<G>where
G: UnwindSafe,
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.