Enum GraphIndex 

pub enum GraphIndex<Ix>
where
    Ix: IndexType,
{
    Cell(CellIndex<Ix>),
    Edge(EdgeIndex<Ix>),
    Node(NodeIndex<Ix>),
    None,
}

A wrapper enum to hold all

Variants

Cell(CellIndex<Ix>)

A super::Cell refference;

Edge(EdgeIndex<Ix>)

A super::Edge refference;

Node(NodeIndex<Ix>)

A super::Node refference;

None

None type for refference.

Trait Implementations

impl<Ix> Clone for GraphIndex<Ix>

where Ix: IndexType + Clone,

fn clone(&self) -> GraphIndex<Ix>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Ix> Debug for GraphIndex<Ix>

where Ix: IndexType + Debug,

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

Formats the value using the given formatter.

impl<Ix> Display for GraphIndex<Ix>

where Ix: IndexType,

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

Formats the value using the given formatter.

impl<Ix> Hash for GraphIndex<Ix>

where Ix: IndexType + Hash,

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<Ix> PartialEq for GraphIndex<Ix>

where Ix: IndexType + PartialEq,

fn eq(&self, other: &GraphIndex<Ix>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Ix> Copy for GraphIndex<Ix>

where Ix: IndexType + Copy,

impl<Ix> Eq for GraphIndex<Ix>

where Ix: IndexType + Eq,

impl<Ix> StructuralPartialEq for GraphIndex<Ix>

where Ix: IndexType,