Struct rustc_query_system::dep_graph::DepNodeIndex

pub struct DepNodeIndex {
    private: u32,
}

Fields

private: u32

Implementations

impl DepNodeIndex

pub const MAX_AS_U32: u32 = 4_294_967_040u32

Maximum value the index can take, as a u32.

pub const MAX: Self = _

Maximum value the index can take.

pub const fn from_usize(value: usize) -> Self

Creates a new index from a given usize.

Panics

Will panic if value exceeds MAX.

pub const fn from_u32(value: u32) -> Self

Creates a new index from a given u32.

Panics

Will panic if value exceeds MAX.

pub const unsafe fn from_u32_unchecked(value: u32) -> Self

Creates a new index from a given u32.

Safety

The provided value must be less than or equal to the maximum value for the newtype. Providing a value outside this range is undefined due to layout restrictions.

Prefer using from_u32.

pub const fn index(self) -> usize

Extracts the value of this index as a usize.

pub const fn as_u32(self) -> u32

Extracts the value of this index as a u32.

pub const fn as_usize(self) -> usize

Extracts the value of this index as a usize.

impl DepNodeIndex

pub const INVALID: DepNodeIndex = DepNodeIndex::MAX

pub const SINGLETON_DEPENDENCYLESS_ANON_NODE: DepNodeIndex = _

pub const FOREVER_RED_NODE: DepNodeIndex = _

Trait Implementations

impl Add<usize> for DepNodeIndex

type Output = DepNodeIndex

The resulting type after applying the + operator.

fn add(self, other: usize) -> Self

Performs the + operation.

impl Clone for DepNodeIndex

fn clone(&self) -> DepNodeIndex

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DepNodeIndex

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

Formats the value using the given formatter.

impl<D: Decoder> Decodable<D> for DepNodeIndex

fn decode(d: &mut D) -> Self

impl<E: Encoder> Encodable<E> for DepNodeIndex

fn encode(&self, e: &mut E)

impl Extend<DepNodeIndex> for EdgesVec

fn extend<T>(&mut self, iter: T)where T: IntoIterator<Item = DepNodeIndex>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl From<DepNodeIndex> for QueryInvocationId

fn from(dep_node_index: DepNodeIndex) -> Self

Converts to this type from the input type.

impl From<DepNodeIndex> for u32

fn from(v: DepNodeIndex) -> u32

Converts to this type from the input type.

impl From<DepNodeIndex> for usize

fn from(v: DepNodeIndex) -> usize

Converts to this type from the input type.

impl From<u32> for DepNodeIndex

fn from(value: u32) -> Self

Converts to this type from the input type.

impl From<usize> for DepNodeIndex

fn from(value: usize) -> Self

Converts to this type from the input type.

impl FromIterator<DepNodeIndex> for EdgesVec

fn from_iter<T>(iter: T) -> Selfwhere T: IntoIterator<Item = DepNodeIndex>,

Creates a value from an iterator.

impl Hash for DepNodeIndex

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 Idx for DepNodeIndex

fn new(value: usize) -> Self

fn index(self) -> usize

fn increment_by(&mut self, amount: usize)

fn plus(self, amount: usize) -> Self

impl Ord for DepNodeIndex

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

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<DepNodeIndex> for DepNodeIndex

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

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

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

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

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

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

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

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

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

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

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

impl Step for DepNodeIndex

fn steps_between(start: &Self, end: &Self) -> Option<usize>

🔬This is a nightly-only experimental API. (step_trait)

Returns the number of successor steps required to get from start to end.

fn forward_checked(start: Self, u: usize) -> Option<Self>

🔬This is a nightly-only experimental API. (step_trait)

Returns the value that would be obtained by taking the successor of self count times.

fn backward_checked(start: Self, u: usize) -> Option<Self>

🔬This is a nightly-only experimental API. (step_trait)

Returns the value that would be obtained by taking the predecessor of self count times.

fn forward(start: Self, count: usize) -> Self

🔬This is a nightly-only experimental API. (step_trait)

Returns the value that would be obtained by taking the successor of self count times.

unsafe fn forward_unchecked(start: Self, count: usize) -> Self

🔬This is a nightly-only experimental API. (step_trait)

Returns the value that would be obtained by taking the successor of self count times.

fn backward(start: Self, count: usize) -> Self

🔬This is a nightly-only experimental API. (step_trait)

Returns the value that would be obtained by taking the predecessor of self count times.

unsafe fn backward_unchecked(start: Self, count: usize) -> Self

🔬This is a nightly-only experimental API. (step_trait)

Returns the value that would be obtained by taking the predecessor of self count times.

impl Copy for DepNodeIndex

impl Eq for DepNodeIndex

impl StructuralEq for DepNodeIndex

impl StructuralPartialEq for DepNodeIndex

impl TrustedStep for DepNodeIndex

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