pub struct FreeCategory<G: Graph>(/* private fields */);Expand description
The free category on a graph.
The objects and morphisms of the free category are the vertices and paths in the graph, respectively. Paths compose by concatenation.
Trait Implementations§
Source§impl<G: Graph> Category for FreeCategory<G>
impl<G: Graph> Category for FreeCategory<G>
Source§fn has_mor(&self, path: &Path<G::V, G::E>) -> bool
fn has_mor(&self, path: &Path<G::V, G::E>) -> bool
Does the category contain the value as a morphism?
Source§fn cod(&self, path: &Path<G::V, G::E>) -> G::V
fn cod(&self, path: &Path<G::V, G::E>) -> G::V
Gets the codomain of a morphism in the category.
Source§fn compose(&self, path: Path<G::V, Path<G::V, G::E>>) -> Path<G::V, G::E>
fn compose(&self, path: Path<G::V, Path<G::V, G::E>>) -> Path<G::V, G::E>
Composes a path of morphisms in the category.
Source§impl<G: FinGraph> FgCategory for FreeCategory<G>
impl<G: FinGraph> FgCategory for FreeCategory<G>
Source§fn ob_generators(&self) -> impl Iterator<Item = Self::ObGen>
fn ob_generators(&self) -> impl Iterator<Item = Self::ObGen>
Iterates over object generators.
Source§fn mor_generators(&self) -> impl Iterator<Item = Self::MorGen>
fn mor_generators(&self) -> impl Iterator<Item = Self::MorGen>
Iterates over morphism generators.
Source§fn mor_generator_dom(&self, f: &Self::MorGen) -> Self::Ob
fn mor_generator_dom(&self, f: &Self::MorGen) -> Self::Ob
The domain of a morphism generator
Source§fn mor_generator_cod(&self, f: &Self::MorGen) -> Self::Ob
fn mor_generator_cod(&self, f: &Self::MorGen) -> Self::Ob
The codomain of a morphism generator
Source§impl<G: Graph> From<G> for FreeCategory<G>
impl<G: Graph> From<G> for FreeCategory<G>
Auto Trait Implementations§
impl<G> Freeze for FreeCategory<G>where
G: Freeze,
impl<G> RefUnwindSafe for FreeCategory<G>where
G: RefUnwindSafe,
impl<G> Send for FreeCategory<G>where
G: Send,
impl<G> Sync for FreeCategory<G>where
G: Sync,
impl<G> Unpin for FreeCategory<G>where
G: Unpin,
impl<G> UnwindSafe for FreeCategory<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.