Struct plexus::graph::EdgeOrphan

source · [−]

pub struct EdgeOrphan<'a, G> where
    G: GraphData,  { /* private fields */ }

Expand description

Orphan view of an edge entity.

Implementations

source

impl<'a, G> EdgeOrphan<'a, G> where
G: 'a + GraphData,

source

pub fn get(&self) -> &G::Edge

source

pub fn get_mut(&mut self) -> &mut G::Edge

Trait Implementations

source

impl<'a, G> Borrow<EdgeKey> for EdgeOrphan<'a, G> where
G: GraphData,

source

fn borrow(&self) -> &EdgeKey

Immutably borrows from an owned value. Read more

source

impl<'a, G> ClosedView for EdgeOrphan<'a, G> where
G: GraphData,

type Key = EdgeKey

type Entity = Edge<G>

source

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

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<'a, G> Hash for EdgeOrphan<'a, G> where
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<'a, G> PartialEq<EdgeOrphan<'a, G>> for EdgeOrphan<'a, G> where
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<'a, G> Eq for EdgeOrphan<'a, G> where
G: GraphData,

Auto Trait Implementations

impl<'a, G> RefUnwindSafe for EdgeOrphan<'a, G> where
<G as GraphData>::Edge: RefUnwindSafe,

impl<'a, G> Send for EdgeOrphan<'a, G> where
<G as GraphData>::Edge: Send,

impl<'a, G> Sync for EdgeOrphan<'a, G> where
<G as GraphData>::Edge: Sync,

impl<'a, G> Unpin for EdgeOrphan<'a, G>

impl<'a, G> !UnwindSafe for EdgeOrphan<'a, G>

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

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, 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::EdgeOrphan

Implementations

impl<'a, G> EdgeOrphan<'a, G> where G: 'a + GraphData,

pub fn get(&self) -> &G::Edge

pub fn get_mut(&mut self) -> &mut G::Edge

Trait Implementations

impl<'a, G> Borrow<EdgeKey> for EdgeOrphan<'a, G> where G: GraphData,

fn borrow(&self) -> &EdgeKey

impl<'a, G> ClosedView for EdgeOrphan<'a, G> where G: GraphData,

type Key = EdgeKey

type Entity = Edge<G>

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

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<'a, G> Hash for EdgeOrphan<'a, G> where 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<'a, G> PartialEq<EdgeOrphan<'a, G>> for EdgeOrphan<'a, G> where G: GraphData,

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

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

impl<'a, G> Eq for EdgeOrphan<'a, G> where G: GraphData,

Auto Trait Implementations

impl<'a, G> RefUnwindSafe for EdgeOrphan<'a, G> where <G as GraphData>::Edge: RefUnwindSafe,

impl<'a, G> Send for EdgeOrphan<'a, G> where <G as GraphData>::Edge: Send,

impl<'a, G> Sync for EdgeOrphan<'a, G> where <G as GraphData>::Edge: Sync,

impl<'a, G> Unpin for EdgeOrphan<'a, G>

impl<'a, G> !UnwindSafe for EdgeOrphan<'a, G>

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

type Error = Infallible

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

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

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

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

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

fn vzip(self) -> V

impl<'a, G> EdgeOrphan<'a, G> where
G: 'a + GraphData,

impl<'a, G> Borrow<EdgeKey> for EdgeOrphan<'a, G> where
G: GraphData,

impl<'a, G> ClosedView for EdgeOrphan<'a, G> where
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<'a, G> Hash for EdgeOrphan<'a, G> where
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<'a, G> PartialEq<EdgeOrphan<'a, G>> for EdgeOrphan<'a, G> where
G: GraphData,

impl<'a, G> Eq for EdgeOrphan<'a, G> where
G: GraphData,

impl<'a, G> RefUnwindSafe for EdgeOrphan<'a, G> where
<G as GraphData>::Edge: RefUnwindSafe,

impl<'a, G> Send for EdgeOrphan<'a, G> where
<G as GraphData>::Edge: Send,

impl<'a, G> Sync for EdgeOrphan<'a, G> where
<G as GraphData>::Edge: Sync,

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, 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>,