Struct daggy::NodeIndex

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

Node identifier.

Methods

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

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

pub fn index(self) -> usize

pub fn end() -> NodeIndex<Ix>

Trait Implementations

impl<N, E, Ty, Ix> IndexMut<NodeIndex<Ix>> for Graph<N, E, Ty, Ix> where
    Ix: IndexType,
    Ty: EdgeType, 

Index the Graph by NodeIndex to access node weights.

Panics if the node doesn't exist.

Important traits for &'a mut R

impl<'a, R> Read for &'a mut R where
    R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
    W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

fn index_mut(&mut self, index: NodeIndex<Ix>) -> &mut N

Performs the mutable indexing (container[index]) operation.

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

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

Performs the conversion.

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

impl<Ix> VisitMap<NodeIndex<Ix>> for FixedBitSet where
    Ix: IndexType, 

fn visit(&mut self, x: NodeIndex<Ix>) -> bool

Return true if the value is not already present.

fn is_visited(&self, x: &NodeIndex<Ix>) -> bool

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

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

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

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

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

This method tests for !=.

impl<N, E, Ty, Ix> Index<NodeIndex<Ix>> for Graph<N, E, Ty, Ix> where
    Ix: IndexType,
    Ty: EdgeType, 

Index the Graph by NodeIndex to access node weights.

Panics if the node doesn't exist.

type Output = N

The returned type after indexing.

Important traits for &'a mut R

impl<'a, R> Read for &'a mut R where
    R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
    W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

fn index(&self, index: NodeIndex<Ix>) -> &N

Performs the indexing (container[index]) operation.

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

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

Feeds this value into the given [Hasher].

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

Feeds a slice of this type into the given [Hasher].

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

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

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

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.

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> Ord for NodeIndex<Ix> where
    Ix: Ord, 

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

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

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

fn index(&self) -> usize

fn is_node_index() -> bool

impl<N, E, Ix> Index<NodeIndex<Ix>> for Dag<N, E, Ix> where
    Ix: IndexType, 

type Output = N

The returned type after indexing.

Important traits for &'a mut R

impl<'a, R> Read for &'a mut R where
    R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
    W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

fn index(&self, index: NodeIndex<Ix>) -> &N

Performs the indexing (container[index]) operation.

impl<N, E, Ix> IndexMut<NodeIndex<Ix>> for Dag<N, E, Ix> where
    Ix: IndexType, 

Important traits for &'a mut R

impl<'a, R> Read for &'a mut R where
    R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
    W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

fn index_mut(&mut self, index: NodeIndex<Ix>) -> &mut N

Performs the mutable indexing (container[index]) operation.