Expand description
A graph element.
A sequence of Elements, for example an iterator, is laid out as follows: Nodes are implicitly given the index of their appearance in the sequence. The edges’ source and target fields refer to these indices.
Variants§
Trait Implementations§
source§impl<N: PartialEq, E: PartialEq> PartialEq<Element<N, E>> for Element<N, E>
impl<N: PartialEq, E: PartialEq> PartialEq<Element<N, E>> for Element<N, E>
impl<N: Eq, E: Eq> Eq for Element<N, E>
impl<N, E> StructuralEq for Element<N, E>
impl<N, E> StructuralPartialEq for Element<N, E>
Auto Trait Implementations§
impl<N, E> RefUnwindSafe for Element<N, E>where
E: RefUnwindSafe,
N: RefUnwindSafe,
impl<N, E> Send for Element<N, E>where
E: Send,
N: Send,
impl<N, E> Sync for Element<N, E>where
E: Sync,
N: Sync,
impl<N, E> Unpin for Element<N, E>where
E: Unpin,
N: Unpin,
impl<N, E> UnwindSafe for Element<N, E>where
E: UnwindSafe,
N: UnwindSafe,
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.