Struct plexus::graph::EdgeKey

source · [−]

pub struct EdgeKey(_);

Expand description

Edge key.

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<'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 Clone for EdgeKey

source

fn clone(&self) -> EdgeKey

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 Debug for EdgeKey

source

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

source

impl Default for EdgeKey

source

fn default() -> EdgeKey

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

source

impl From<EdgeKey> for GraphKey

source

fn from(key: EdgeKey) -> Self

Converts to this type from the input type.

source

impl Hash for EdgeKey

source

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

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 PartialEq<EdgeKey> for EdgeKey

source

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

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

source

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

This method tests for !=.

source

impl StructuralPartialEq for EdgeKey

Auto Trait Implementations

impl RefUnwindSafe for EdgeKey

impl Send for EdgeKey

impl Sync for EdgeKey

impl Unpin for EdgeKey

impl UnwindSafe for EdgeKey

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

source

impl<T> Scalar for T where
T: Copy + PartialEq<T> + Debug + Any,

source

fn inlined_clone(&self) -> T

Performance hack: Clone doesn’t get inlined for Copy types in debug mode, so make it inline anyway.

source

fn is<T>() -> bool where
T: Scalar,

Tests if Self the same as the type T Read more

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::EdgeKey

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

fn borrow(&self) -> &EdgeKey

impl Clone for EdgeKey

fn clone(&self) -> EdgeKey

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

impl Debug for EdgeKey

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl Default for EdgeKey

fn default() -> EdgeKey

impl From<EdgeKey> for GraphKey

fn from(key: EdgeKey) -> Self

impl Hash for EdgeKey

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

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

impl PartialEq<EdgeKey> for EdgeKey

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

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

impl Copy for EdgeKey

impl Eq for EdgeKey

impl StructuralEq for EdgeKey

impl StructuralPartialEq for EdgeKey

Auto Trait Implementations

impl RefUnwindSafe for EdgeKey

impl Send for EdgeKey

impl Sync for EdgeKey

impl Unpin for EdgeKey

impl UnwindSafe for EdgeKey

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<T> Scalar for T where T: Copy + PartialEq<T> + Debug + Any,

fn inlined_clone(&self) -> T

fn is<T>() -> bool where T: Scalar,

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

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<B> Borrow<EdgeKey> for EdgeView<B> where
B: Reborrow,
B::Target: AsStorage<Edge<<B as Parametric>::Data>> + Parametric,

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

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

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

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<T> Scalar for T where
T: Copy + PartialEq<T> + Debug + Any,

fn is<T>() -> bool where
T: Scalar,

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