Struct plexus::graph::EdgeView

source · [−]

pub struct EdgeView<B> where
    B: Reborrow,
    B::Target: AsStorage<Edge<<B::Target as Parametric>::Data>> + Parametric,  { /* private fields */ }

Expand description

View of an edge entity.

An edge connecting a vertex $A$ and a vertex $B$ is notated $\overleftrightarrow{AB}$ or $\overleftrightarrow{BA}$.

See the graph module documentation for more information about views.

Implementations

source

impl<B, M> EdgeView where
B: Reborrow<Target = M>,
M: AsStorage<Edge<::Data>> + Parametric,

source

pub fn to_ref(&self) -> EdgeView<&M>

source

impl<'a, B, M, G> EdgeView where
 B: ReborrowInto<'a, Target = M>,
 M: AsStorage<Edge<G>> + Parametric<Data = G>,
 G: GraphData,

source

pub fn into_ref(self) -> EdgeView<&'a M>

source

impl<B, M, G> EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Edge<G>> + Parametric<Data = G>,
 G: GraphData,

source

pub fn get<'a>(&'a self) -> &'a G::Edge where
G: 'a,

source

impl<B, M, G> EdgeView where
 B: ReborrowMut<Target = M>,
 M: AsStorageMut<Edge<G>> + Parametric<Data = G>,
 G: GraphData,

source

pub fn get_mut<'a>(&'a mut self) -> &'a mut G::Edge where
G: 'a,

source

impl<B, M, G> EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + Parametric<Data = G>,
 G: GraphData,

This impl block contains no items.

Reachable API.

source

impl<B, M, G> EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + Consistent + Parametric<Data = G>,
 G: GraphData,

source

impl<B, M, G> EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + AsStorage<Vertex<G>> + Consistent + Parametric<Data = G>,
 G: GraphData,

source

pub fn midpoint(&self) -> VertexPosition<G> where
G: EdgeMidpoint,
G::Vertex: AsPosition,

Trait Implementations

source

impl Borrow<EdgeKey> for EdgeView where
B: Reborrow,
B::Target: AsStorage<Edge<::Data>> + Parametric,

source

fn borrow(&self) -> &EdgeKey

Immutably borrows from an owned value. Read more

source

impl<B, M, G> Clone for EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Edge<G>> + Parametric<Data = G>,
 G: GraphData,
 View<B, Edge<G>>: Clone,

source

fn clone(&self) -> Self

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<B, M, G> ClosedView for EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Edge<G>> + Parametric<Data = G>,
 G: GraphData,

source

fn key(&self) -> Self::Key

Gets the key for the edge.

type Key = EdgeKey

type Entity = Edge<G>

source

impl<B, M, G> Deref for EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Edge<G>> + Parametric<Data = G>,
 G: GraphData,

type Target = Edge<G>

The resulting type after dereferencing.

source

fn deref(&self) -> &Self::Target

Dereferences the value.

source

impl<B, M, G> DerefMut for EdgeView where
 B: ReborrowMut<Target = M>,
 M: AsStorageMut<Edge<G>> + Parametric<Data = G>,
 G: GraphData,

source

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

source

impl<'a, M, G> From<EdgeView<&'a mut M>> for EdgeOrphan<'a, G> where
M: AsStorageMut<Edge<G>> + Parametric<Data = G>,
G: 'a + GraphData,

source

fn from(edge: EdgeView<&'a mut M>) -> Self

Converts to this type from the input type.

source

impl<B, M, G> Hash for EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Edge<G>> + Parametric<Data = G>,
 G: GraphData,

source

fn hash<H>(&self, state: &mut H) where
H: Hasher,

Feeds this value into the given Hasher. Read more

1.3.0 · source

fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,

Feeds a slice of this type into the given Hasher. Read more

source

impl<B, M, G> PartialEq<EdgeView> for EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Edge<G>> + Parametric<Data = G>,
 G: GraphData,

source

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

source

impl<B, M, G> ToArc for EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + Consistent + Parametric<Data = G>,
 G: GraphData,

source

fn into_arc(self) -> ArcView

source

fn arc(&self) -> ArcView<&M>

source

impl<B, M, G> Copy for EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Edge<G>> + Parametric<Data = G>,
 G: GraphData,
 View<B, Edge<G>>: Copy,

source

impl<B, M, G> Eq for EdgeView where
 B: Reborrow<Target = M>,
 M: AsStorage<Edge<G>> + Parametric<Data = G>,
 G: GraphData,

Auto Trait Implementations

impl RefUnwindSafe for EdgeView where
B: RefUnwindSafe,

impl Send for EdgeView where
B: Send,

impl Sync for EdgeView where
B: Sync,

impl Unpin for EdgeView where
B: Unpin,

impl UnwindSafe for EdgeView where
B: 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,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

impl<T> CallHasher for T where
T: Hash + ?Sized,

default fn get_hash<H>(value: &T, hasher: H) -> u64 where
H: Hasher,

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T> FromGeometry<T> for T

source

fn from_geometry(other: T) -> T

source

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

const: unstable · 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, U> IntoGeometry for T where
U: FromGeometry<T>,

source

fn into_geometry(self) -> U

source

impl<T> Same<T> for T

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,

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 for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

Struct plexus::graph::EdgeView

Implementations

impl<B, M> EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Edge<<B as Parametric>::Data>> + Parametric,

pub fn to_ref(&self) -> EdgeView<&M>

impl<'a, B, M, G> EdgeView<B> where B: ReborrowInto<'a, Target = M>, M: AsStorage<Edge<G>> + Parametric<Data = G>, G: GraphData,

pub fn into_ref(self) -> EdgeView<&'a M>

impl<B, M, G> EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Edge<G>> + Parametric<Data = G>, G: GraphData,

pub fn get<'a>(&'a self) -> &'a G::Edge where G: 'a,

impl<B, M, G> EdgeView<B> where B: ReborrowMut<Target = M>, M: AsStorageMut<Edge<G>> + Parametric<Data = G>, G: GraphData,

pub fn get_mut<'a>(&'a mut self) -> &'a mut G::Edge where G: 'a,

impl<B, M, G> EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + Parametric<Data = G>, G: GraphData,

impl<B, M, G> EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + Consistent + Parametric<Data = G>, G: GraphData,

pub fn into_arc(self) -> ArcView<B>

pub fn arc(&self) -> ArcView<&M>

pub fn is_boundary_edge(&self) -> bool

impl<B, M, G> EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + AsStorage<Vertex<G>> + Consistent + Parametric<Data = G>, G: GraphData,

pub fn midpoint(&self) -> VertexPosition<G> where G: EdgeMidpoint, G::Vertex: AsPosition,

Trait Implementations

impl<B> Borrow<EdgeKey> for EdgeView<B> where B: Reborrow, B::Target: AsStorage<Edge<<B as Parametric>::Data>> + Parametric,

fn borrow(&self) -> &EdgeKey

impl<B, M, G> Clone for EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Edge<G>> + Parametric<Data = G>, G: GraphData, View<B, Edge<G>>: Clone,

fn clone(&self) -> Self

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

impl<B, M, G> ClosedView for EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Edge<G>> + Parametric<Data = G>, G: GraphData,

fn key(&self) -> Self::Key

type Key = EdgeKey

type Entity = Edge<G>

impl<B, M, G> Deref for EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Edge<G>> + Parametric<Data = G>, G: GraphData,

type Target = Edge<G>

fn deref(&self) -> &Self::Target

impl<B, M, G> DerefMut for EdgeView<B> where B: ReborrowMut<Target = M>, M: AsStorageMut<Edge<G>> + Parametric<Data = G>, G: GraphData,

fn deref_mut(&mut self) -> &mut Self::Target

impl<'a, M, G> From<EdgeView<&'a mut M>> for EdgeOrphan<'a, G> where M: AsStorageMut<Edge<G>> + Parametric<Data = G>, G: 'a + GraphData,

fn from(edge: EdgeView<&'a mut M>) -> Self

impl<B, M, G> Hash for EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Edge<G>> + Parametric<Data = G>, G: GraphData,

fn hash<H>(&self, state: &mut H) where H: Hasher,

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher,

impl<B, M, G> PartialEq<EdgeView<B>> for EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Edge<G>> + Parametric<Data = G>, G: GraphData,

fn eq(&self, other: &Self) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<B, M, G> ToArc<B> for EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + Consistent + Parametric<Data = G>, G: GraphData,

fn into_arc(self) -> ArcView<B>

fn arc(&self) -> ArcView<&M>

impl<B, M, G> Copy for EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Edge<G>> + Parametric<Data = G>, G: GraphData, View<B, Edge<G>>: Copy,

impl<B, M, G> Eq for EdgeView<B> where B: Reborrow<Target = M>, M: AsStorage<Edge<G>> + Parametric<Data = G>, G: GraphData,

Auto Trait Implementations

impl<B> RefUnwindSafe for EdgeView<B> where B: RefUnwindSafe,

impl<B> Send for EdgeView<B> where B: Send,

impl<B> Sync for EdgeView<B> where B: Sync,

impl<B> Unpin for EdgeView<B> where B: Unpin,

impl<B> UnwindSafe for EdgeView<B> where B: UnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> CallHasher for T where T: Hash + ?Sized,

default fn get_hash<H>(value: &T, hasher: H) -> u64 where H: Hasher,

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> FromGeometry<T> for T

fn from_geometry(other: T) -> T

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

fn into(self) -> U

impl<T, U> IntoGeometry<U> for T where U: FromGeometry<T>,

fn into_geometry(self) -> U

impl<T> Same<T> for T

type Output = T

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

fn to_subset(&self) -> Option<SS>

fn is_in_subset(&self) -> bool

fn to_subset_unchecked(&self) -> SS

fn from_subset(element: &SS) -> SP

impl<T> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

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

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

impl<B, M> EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Edge<<B as Parametric>::Data>> + Parametric,

impl<'a, B, M, G> EdgeView<B> where
B: ReborrowInto<'a, Target = M>,
M: AsStorage<Edge<G>> + Parametric<Data = G>,
G: GraphData,

impl<B, M, G> EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Edge<G>> + Parametric<Data = G>,
G: GraphData,

pub fn get<'a>(&'a self) -> &'a G::Edge where
G: 'a,

impl<B, M, G> EdgeView<B> where
B: ReborrowMut<Target = M>,
M: AsStorageMut<Edge<G>> + Parametric<Data = G>,
G: GraphData,

pub fn get_mut<'a>(&'a mut self) -> &'a mut G::Edge where
G: 'a,

impl<B, M, G> EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + Parametric<Data = G>,
G: GraphData,

impl<B, M, G> EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + Consistent + Parametric<Data = G>,
G: GraphData,

impl<B, M, G> EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + AsStorage<Vertex<G>> + Consistent + Parametric<Data = G>,
G: GraphData,

pub fn midpoint(&self) -> VertexPosition<G> where
G: EdgeMidpoint,
G::Vertex: AsPosition,

impl<B> Borrow<EdgeKey> for EdgeView<B> where
B: Reborrow,
B::Target: AsStorage<Edge<<B as Parametric>::Data>> + Parametric,

impl<B, M, G> Clone for EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Edge<G>> + Parametric<Data = G>,
G: GraphData,
View<B, Edge<G>>: Clone,

impl<B, M, G> ClosedView for EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Edge<G>> + Parametric<Data = G>,
G: GraphData,

impl<B, M, G> Deref for EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Edge<G>> + Parametric<Data = G>,
G: GraphData,

impl<B, M, G> DerefMut for EdgeView<B> where
B: ReborrowMut<Target = M>,
M: AsStorageMut<Edge<G>> + Parametric<Data = G>,
G: GraphData,

impl<'a, M, G> From<EdgeView<&'a mut M>> for EdgeOrphan<'a, G> where
M: AsStorageMut<Edge<G>> + Parametric<Data = G>,
G: 'a + GraphData,

impl<B, M, G> Hash for EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Edge<G>> + Parametric<Data = G>,
G: GraphData,

fn hash<H>(&self, state: &mut H) where
H: Hasher,

fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,

impl<B, M, G> PartialEq<EdgeView<B>> for EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Edge<G>> + Parametric<Data = G>,
G: GraphData,

impl<B, M, G> ToArc<B> for EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Arc<G>> + AsStorage<Edge<G>> + Consistent + Parametric<Data = G>,
G: GraphData,

impl<B, M, G> Copy for EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Edge<G>> + Parametric<Data = G>,
G: GraphData,
View<B, Edge<G>>: Copy,

impl<B, M, G> Eq for EdgeView<B> where
B: Reborrow<Target = M>,
M: AsStorage<Edge<G>> + Parametric<Data = G>,
G: GraphData,

impl<B> RefUnwindSafe for EdgeView<B> where
B: RefUnwindSafe,

impl<B> Send for EdgeView<B> where
B: Send,

impl<B> Sync for EdgeView<B> where
B: Sync,

impl<B> Unpin for EdgeView<B> where
B: Unpin,

impl<B> UnwindSafe for EdgeView<B> where
B: UnwindSafe,

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

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

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

impl<T> CallHasher for T where
T: Hash + ?Sized,

default fn get_hash<H>(value: &T, hasher: H) -> u64 where
H: Hasher,

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

impl<T, U> IntoGeometry<U> for T where
U: FromGeometry<T>,

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

impl<T> ToOwned for T where
T: Clone,

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

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

impl<V, T> VZip<V> for T where
V: MultiLane<T>,