pub struct ColumnarGraphMapping<VMap, EMap> { /* 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<VMap, EMap> ColumnarGraphMapping<VMap, EMap>
impl<VMap, EMap> ColumnarGraphMapping<VMap, EMap>
pub const fn new( vertex_map: VMap, edge_map: EMap, ) -> ColumnarGraphMapping<VMap, EMap>
Trait Implementations§
Source§impl<VMap: Clone, EMap: Clone> Clone for ColumnarGraphMapping<VMap, EMap>
impl<VMap: Clone, EMap: Clone> Clone for ColumnarGraphMapping<VMap, EMap>
Source§fn clone(&self) -> ColumnarGraphMapping<VMap, EMap>
fn clone(&self) -> ColumnarGraphMapping<VMap, EMap>
Returns a copy of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl<VMap: Default, EMap: Default> Default for ColumnarGraphMapping<VMap, EMap>
impl<VMap: Default, EMap: Default> Default for ColumnarGraphMapping<VMap, EMap>
Source§fn default() -> ColumnarGraphMapping<VMap, EMap>
fn default() -> ColumnarGraphMapping<VMap, EMap>
Returns the “default value” for a type. Read more
Source§impl<VMap, EMap> GraphMapping for ColumnarGraphMapping<VMap, EMap>
impl<VMap, EMap> GraphMapping for ColumnarGraphMapping<VMap, EMap>
Source§fn vertex_map(&self) -> &Self::VertexMap
fn vertex_map(&self) -> &Self::VertexMap
Gets the underlying mapping on vertices.
Source§fn apply_vertex(&self, v: Self::DomV) -> Option<Self::CodV>
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>
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
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
fn is_edge_assigned(&self, e: &Self::DomE) -> bool
Is the mapping defined at an edge?
Source§impl<VMap: PartialEq, EMap: PartialEq> PartialEq for ColumnarGraphMapping<VMap, EMap>
impl<VMap: PartialEq, EMap: PartialEq> PartialEq for ColumnarGraphMapping<VMap, EMap>
Source§fn eq(&self, other: &ColumnarGraphMapping<VMap, EMap>) -> bool
fn eq(&self, other: &ColumnarGraphMapping<VMap, EMap>) -> bool
Tests for
self
and other
values to be equal, and is used by ==
.impl<VMap: Eq, EMap: Eq> Eq for ColumnarGraphMapping<VMap, EMap>
impl<VMap, EMap> StructuralPartialEq for ColumnarGraphMapping<VMap, EMap>
Auto Trait Implementations§
impl<VMap, EMap> Freeze for ColumnarGraphMapping<VMap, EMap>
impl<VMap, EMap> RefUnwindSafe for ColumnarGraphMapping<VMap, EMap>where
VMap: RefUnwindSafe,
EMap: RefUnwindSafe,
impl<VMap, EMap> Send for ColumnarGraphMapping<VMap, EMap>
impl<VMap, EMap> Sync for ColumnarGraphMapping<VMap, EMap>
impl<VMap, EMap> Unpin for ColumnarGraphMapping<VMap, EMap>
impl<VMap, EMap> UnwindSafe for ColumnarGraphMapping<VMap, EMap>where
VMap: UnwindSafe,
EMap: 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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.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.