Struct daggy::NodeIndex

pub struct NodeIndex<Ix = u32>(_);

Node identifier.

Methods

impl<Ix> NodeIndex<Ix> where
    Ix: IndexType, 

fn new(x: usize) -> NodeIndex<Ix>

fn index(self) -> usize

fn end() -> NodeIndex<Ix>

Trait Implementations

impl<Ix> Clone for NodeIndex<Ix> where
    Ix: Clone, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Ix> GraphIndex for NodeIndex<Ix> where
    Ix: IndexType, 

fn index(&self) -> usize

fn is_node_index() -> bool

impl<Ix> PartialOrd<NodeIndex<Ix>> for NodeIndex<Ix> where
    Ix: PartialOrd<Ix>, 

fn partial_cmp(&self, __arg_0: &NodeIndex<Ix>) -> Option<Ordering>

fn lt(&self, __arg_0: &NodeIndex<Ix>) -> bool

fn le(&self, __arg_0: &NodeIndex<Ix>) -> bool

fn gt(&self, __arg_0: &NodeIndex<Ix>) -> bool

fn ge(&self, __arg_0: &NodeIndex<Ix>) -> bool

impl<Ix> Copy for NodeIndex<Ix> where
    Ix: Copy, 

impl<Ix> Ord for NodeIndex<Ix> where
    Ix: Ord, 

fn cmp(&self, __arg_0: &NodeIndex<Ix>) -> Ordering

impl<Ix> PartialEq<NodeIndex<Ix>> for NodeIndex<Ix> where
    Ix: PartialEq<Ix>, 

fn eq(&self, __arg_0: &NodeIndex<Ix>) -> bool

fn ne(&self, __arg_0: &NodeIndex<Ix>) -> bool

impl<Ix> From<Ix> for NodeIndex<Ix> where
    Ix: IndexType, 

fn from(ix: Ix) -> NodeIndex<Ix>

impl<Ix> Eq for NodeIndex<Ix> where
    Ix: Eq, 

impl<Ix> Hash for NodeIndex<Ix> where
    Ix: Hash, 

fn hash<__HIx>(&self, __arg_0: &mut __HIx) where
    __HIx: Hasher, 

impl<Ix> Debug for NodeIndex<Ix> where
    Ix: Debug, 

fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.