catlog::one::graph

Struct ColumnarGraphMapping

Source 
pub struct ColumnarGraphMapping<ColV, ColE> { /* private fields */ }
Expand description

A graph mapping backed by columns.

That is, the data of the graph mapping is defined by two columns. The mapping can be between arbitrary graphs with compatible vertex and edge types.

Implementations§

Source§

impl<ColV, ColE> ColumnarGraphMapping<ColV, ColE>

Source

pub fn new(vertex_map: ColV, edge_map: ColE) -> Self

Constructs a new graph mapping from existing columns.

Trait Implementations§

Source§

impl<ColV: Clone, ColE: Clone> Clone for ColumnarGraphMapping<ColV, ColE>

Source§

fn clone(&self) -> ColumnarGraphMapping<ColV, ColE>

Returns a copy of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<ColV: Default, ColE: Default> Default for ColumnarGraphMapping<ColV, ColE>

Source§

fn default() -> ColumnarGraphMapping<ColV, ColE>

Returns the “default value” for a type. Read more
Source§

impl<ColV, ColE> GraphMapping for ColumnarGraphMapping<ColV, ColE>
where ColV: MutMapping, ColE: MutMapping,

Source§

type DomV = <ColV as Mapping>::Dom

Type of vertices in domain graph.
Source§

type DomE = <ColE as Mapping>::Dom

Type of edges in domain graph.
Source§

type CodV = <ColV as Mapping>::Cod

Type of vertices in codomain graph.
Source§

type CodE = <ColE as Mapping>::Cod

Type of edges in codomain graph.
Source§

fn apply_vertex(&self, v: &Self::DomV) -> Option<Self::CodV>

Applies the graph mapping at a vertex.
Source§

fn apply_edge(&self, e: &Self::DomE) -> Option<Self::CodE>

Applies the graph mapping at an edge.
Source§

fn is_vertex_assigned(&self, v: &Self::DomV) -> bool

Is the mapping defined at a vertex?
Source§

fn is_edge_assigned(&self, e: &Self::DomE) -> bool

Is the mapping defined at an edge?

Auto Trait Implementations§

§

impl<ColV, ColE> Freeze for ColumnarGraphMapping<ColV, ColE>
where ColV: Freeze, ColE: Freeze,

§

impl<ColV, ColE> RefUnwindSafe for ColumnarGraphMapping<ColV, ColE>
where ColV: RefUnwindSafe, ColE: RefUnwindSafe,

§

impl<ColV, ColE> Send for ColumnarGraphMapping<ColV, ColE>
where ColV: Send, ColE: Send,

§

impl<ColV, ColE> Sync for ColumnarGraphMapping<ColV, ColE>
where ColV: Sync, ColE: Sync,

§

impl<ColV, ColE> Unpin for ColumnarGraphMapping<ColV, ColE>
where ColV: Unpin, ColE: Unpin,

§

impl<ColV, ColE> UnwindSafe for ColumnarGraphMapping<ColV, ColE>
where ColV: UnwindSafe, ColE: 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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dst: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. 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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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.