Struct rs_graph::linkedlistgraph::Edge [−][src]
Edge of a linked list graph.
This is basically a newtype of the arc index. Note that
e == g.reverse(e)
.
Trait Implementations
impl<ID: Eq> Eq for Edge<ID> where
ID: PrimInt + Unsigned,
[src]
impl<ID: Eq> Eq for Edge<ID> where
ID: PrimInt + Unsigned,
impl<ID: Clone> Clone for Edge<ID> where
ID: PrimInt + Unsigned,
[src]
impl<ID: Clone> Clone for Edge<ID> where
ID: PrimInt + Unsigned,
fn clone(&self) -> Edge<ID>
[src]
fn clone(&self) -> Edge<ID>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0
[src]Performs copy-assignment from source
. Read more
impl<ID: Copy> Copy for Edge<ID> where
ID: PrimInt + Unsigned,
[src]
impl<ID: Copy> Copy for Edge<ID> where
ID: PrimInt + Unsigned,
impl<ID: Debug> Debug for Edge<ID> where
ID: PrimInt + Unsigned,
[src]
impl<ID: Debug> Debug for Edge<ID> where
ID: PrimInt + Unsigned,
fn fmt(&self, f: &mut Formatter) -> Result
[src]
fn fmt(&self, f: &mut Formatter) -> Result
Formats the value using the given formatter. Read more
impl<ID> PartialEq for Edge<ID> where
ID: PrimInt + Unsigned,
[src]
impl<ID> PartialEq for Edge<ID> where
ID: PrimInt + Unsigned,
fn eq(&self, other: &Self) -> bool
[src]
fn eq(&self, other: &Self) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
fn ne(&self, other: &Rhs) -> bool
1.0.0
[src]This method tests for !=
.
impl<ID> Edge for Edge<ID> where
ID: PrimInt + Unsigned,
[src]
impl<ID> Edge for Edge<ID> where
ID: PrimInt + Unsigned,
impl<ID> Display for Edge<ID> where
ID: PrimInt + Unsigned + Display,
[src]
impl<ID> Display for Edge<ID> where
ID: PrimInt + Unsigned + Display,
fn fmt(&self, f: &mut Formatter) -> Result<(), Error>
[src]
fn fmt(&self, f: &mut Formatter) -> Result<(), Error>
Formats the value using the given formatter. Read more
impl<ID> Hash for Edge<ID> where
ID: PrimInt + Unsigned + Hash,
[src]
impl<ID> Hash for Edge<ID> where
ID: PrimInt + Unsigned + Hash,
fn hash<H: Hasher>(&self, state: &mut H)
[src]
fn hash<H: Hasher>(&self, state: &mut H)
Feeds this value into the given [Hasher
]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0
[src]Feeds a slice of this type into the given [Hasher
]. Read more
impl<ID> NumberedEdge for Edge<ID> where
ID: PrimInt + Unsigned,
[src]
impl<ID> NumberedEdge for Edge<ID> where
ID: PrimInt + Unsigned,
impl<ID> BiNumberedEdge for Edge<ID> where
ID: PrimInt + Unsigned,
[src]
impl<ID> BiNumberedEdge for Edge<ID> where
ID: PrimInt + Unsigned,