Struct rustc_middle::dep_graph::dep_node::DepKind

pub struct DepKind {
    variant: u16,
}

This serves as an index into arrays built by make_dep_kind_array.

Fields

variant: u16

Implementations

impl DepKind

pub const fn new(variant: u16) -> DepKind

pub const fn as_inner(&self) -> u16

pub const fn as_usize(&self) -> usize

Trait Implementations

impl Clone for DepKind

fn clone(&self) -> DepKind

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DepKind

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

Formats the value using the given formatter.

impl Hash for DepKind

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

where __H: Hasher,

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 PartialEq for DepKind

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

impl Eq for DepKind

impl StructuralPartialEq for DepKind

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: 2 bytes