Struct VisibleNodeIndex 

pub struct VisibleNodeIndex(pub NodeIndex<VisibleIx>);

Tuple Fields

0: NodeIndex<VisibleIx>

Trait Implementations

impl Clone for VisibleNodeIndex

fn clone(&self) -> VisibleNodeIndex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for VisibleNodeIndex

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

Formats the value using the given formatter.

impl Default for VisibleNodeIndex

fn default() -> VisibleNodeIndex

Returns the “default value” for a type.

impl From<VisibleNodeIndex> for usize

fn from(x: VisibleNodeIndex) -> Self

Converts to this type from the input type.

impl From<usize> for VisibleNodeIndex

fn from(x: usize) -> Self

Converts to this type from the input type.

impl Hash for VisibleNodeIndex

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 Index<VisibleNodeIndex> for VisibleInstGraph

type Output = VisibleNode

The returned type after indexing.

fn index(&self, idx: VisibleNodeIndex) -> &Self::Output

Performs the indexing (container[index]) operation.

impl IndexMut<VisibleNodeIndex> for VisibleInstGraph

fn index_mut(&mut self, idx: VisibleNodeIndex) -> &mut Self::Output

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

impl Ord for VisibleNodeIndex

fn cmp(&self, other: &VisibleNodeIndex) -> Ordering

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for VisibleNodeIndex

fn eq(&self, other: &VisibleNodeIndex) -> 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 PartialOrd for VisibleNodeIndex

fn partial_cmp(&self, other: &VisibleNodeIndex) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl Copy for VisibleNodeIndex

impl Eq for VisibleNodeIndex

impl StructuralPartialEq for VisibleNodeIndex