pub struct UnderlyingGraph<Cat: Category>(/* private fields */);Expand description
The underlying graph of a category.
The vertices and edges of the graph are the objects and morphisms of the category, respectively.
Trait Implementations§
Source§impl<Cat: Category> From<Cat> for UnderlyingGraph<Cat>
impl<Cat: Category> From<Cat> for UnderlyingGraph<Cat>
Auto Trait Implementations§
impl<Cat> Freeze for UnderlyingGraph<Cat>where
Cat: Freeze,
impl<Cat> RefUnwindSafe for UnderlyingGraph<Cat>where
Cat: RefUnwindSafe,
impl<Cat> Send for UnderlyingGraph<Cat>where
Cat: Send,
impl<Cat> Sync for UnderlyingGraph<Cat>where
Cat: Sync,
impl<Cat> Unpin for UnderlyingGraph<Cat>where
Cat: Unpin,
impl<Cat> UnwindSafe for UnderlyingGraph<Cat>where
Cat: 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.