Struct rustc_data_structures::graph::implementation::NodeIndex

pub struct NodeIndex(pub usize);

Tuple Fields

0: usize

Implementations

impl NodeIndex

pub fn node_id(self) -> usize

Returns unique ID (unique with respect to the graph holding associated node).

Trait Implementations

impl Clone for NodeIndex

fn clone(&self) -> NodeIndex

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NodeIndex

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

Formats the value using the given formatter.

impl PartialEq<NodeIndex> for NodeIndex

fn eq(&self, other: &NodeIndex) -> bool

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

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

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

impl Copy for NodeIndex

impl StructuralPartialEq for NodeIndex

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.

Size: 8 bytes