catlog::dbl::category

Struct UnderlyingDblGraph

Source 
#[repr(transparent)]
pub struct UnderlyingDblGraph<VDC: VDblCategory>(pub VDC);
Expand description

The underlying virtual double graph of a VDC.

Tuple Fields§

§0: VDC

Trait Implementations§

Source§

impl<VDC: VDblCategory> From<VDC> for UnderlyingDblGraph<VDC>

Source§

fn from(value: VDC) -> Self

Converts to this type from the input type.
Source§

impl<VDC: VDblCategory> RefCast for UnderlyingDblGraph<VDC>

Source§

type From = VDC

Source§

fn ref_cast(_from: &Self::From) -> &Self

Source§

fn ref_cast_mut(_from: &mut Self::From) -> &mut Self

Source§

impl<VDC: VDblCategory> VDblGraph for UnderlyingDblGraph<VDC>

Source§

type V = <VDC as VDblCategory>::Ob

Type of vertices.
Source§

type E = <VDC as VDblCategory>::Arr

Type of edges, in tight direction.
Source§

type ProE = <VDC as VDblCategory>::Pro

Type of “pro-edges”, or edges in the loose direction.
Source§

type Sq = <VDC as VDblCategory>::Cell

Type of squares with multi-ary domain.
Source§

fn has_vertex(&self, v: &Self::V) -> bool

Does the vertex belong to the double graph?
Source§

fn has_edge(&self, e: &Self::E) -> bool

Does the edge belong to the double graph?
Source§

fn has_proedge(&self, p: &Self::ProE) -> bool

Does the proedge belong to the double graph?
Source§

fn has_square(&self, sq: &Self::Sq) -> bool

Does the square belong to the double graph?
Source§

fn dom(&self, e: &Self::E) -> Self::V

Gets the domain of an edge.
Source§

fn cod(&self, e: &Self::E) -> Self::V

Gets the codomain of an edge.
Source§

fn src(&self, p: &Self::ProE) -> Self::V

Gets the source of a proedge.
Source§

fn tgt(&self, p: &Self::ProE) -> Self::V

Gets the target of a proedge.
Source§

fn square_dom(&self, sq: &Self::Sq) -> Path<Self::V, Self::ProE>

Gets the domain of a square, a path of proedges.
Source§

fn square_cod(&self, sq: &Self::Sq) -> Self::ProE

Gets the codomain of a square, a single proedge.
Source§

fn square_src(&self, sq: &Self::Sq) -> Self::E

Gets the source of a square, an edge.
Source§

fn square_tgt(&self, sq: &Self::Sq) -> Self::E

Gets the target of a square, an edge.
Source§

fn arity(&self, sq: &Self::Sq) -> usize

Gets the arity of a square. Read more

Auto Trait Implementations§

§

impl<VDC> Freeze for UnderlyingDblGraph<VDC>
where VDC: Freeze,

§

impl<VDC> RefUnwindSafe for UnderlyingDblGraph<VDC>
where VDC: RefUnwindSafe,

§

impl<VDC> Send for UnderlyingDblGraph<VDC>
where VDC: Send,

§

impl<VDC> Sync for UnderlyingDblGraph<VDC>
where VDC: Sync,

§

impl<VDC> Unpin for UnderlyingDblGraph<VDC>
where VDC: Unpin,

§

impl<VDC> UnwindSafe for UnderlyingDblGraph<VDC>
where VDC: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.