pub struct DepNode<K> {
    pub kind: K,
    pub hash: PackedFingerprint,
}

Fields§

§kind: K§hash: PackedFingerprint

Implementations§

source§

impl<K: DepKind> DepNode<K>

source

pub fn new_no_params<Tcx>(tcx: Tcx, kind: K) -> DepNode<K>where Tcx: DepContext<DepKind = K>,

Creates a new, parameterless DepNode. This method will assert that the DepNode corresponding to the given DepKind actually does not require any parameters.

source

pub fn construct<Tcx, Key>(tcx: Tcx, kind: K, arg: &Key) -> DepNode<K>where Tcx: DepContext<DepKind = K>, Key: DepNodeParams<Tcx>,

source

pub fn from_def_path_hash<Tcx>( tcx: Tcx, def_path_hash: DefPathHash, kind: K ) -> Selfwhere Tcx: DepContext<DepKind = K>,

Construct a DepNode from the given DepKind and DefPathHash. This method will assert that the given DepKind actually requires a single DefId/DefPathHash parameter.

Trait Implementations§

source§

impl<K: Clone> Clone for DepNode<K>

source§

fn clone(&self) -> DepNode<K>

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<K: DepKind> Debug for DepNode<K>

source§

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

Formats the value using the given formatter. Read more
source§

impl<K, __D: Decoder> Decodable<__D> for DepNode<K>where K: Decodable<__D>,

source§

fn decode(__decoder: &mut __D) -> Self

source§

impl<K, __E: Encoder> Encodable<__E> for DepNode<K>where K: Encodable<__E>,

source§

fn encode(&self, __encoder: &mut __E)

source§

impl<K: Hash> Hash for DepNode<K>

source§

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

Feeds this value into the given Hasher. Read more
1.3.0 · source§

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

Feeds a slice of this type into the given Hasher. Read more
source§

impl<K: Ord> Ord for DepNode<K>

source§

fn cmp(&self, other: &DepNode<K>) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

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

Compares and returns the maximum of two values. Read more
1.21.0 · source§

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

Compares and returns the minimum of two values. Read more
1.50.0 · source§

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

Restrict a value to a certain interval. Read more
source§

impl<K: PartialEq> PartialEq<DepNode<K>> for DepNode<K>

source§

fn eq(&self, other: &DepNode<K>) -> bool

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

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.
source§

impl<K: PartialOrd> PartialOrd<DepNode<K>> for DepNode<K>

source§

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

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

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

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

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

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · source§

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

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

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

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

impl<K: Copy> Copy for DepNode<K>

source§

impl<K: Eq> Eq for DepNode<K>

source§

impl<K> StructuralEq for DepNode<K>

source§

impl<K> StructuralPartialEq for DepNode<K>

Auto Trait Implementations§

§

impl<K> RefUnwindSafe for DepNode<K>where K: RefUnwindSafe,

§

impl<K> Send for DepNode<K>where K: Send,

§

impl<K> Sync for DepNode<K>where K: Sync,

§

impl<K> Unpin for DepNode<K>where K: Unpin,

§

impl<K> UnwindSafe for DepNode<K>where K: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<Tcx, T, D> Value<Tcx, D> for Twhere Tcx: DepContext, D: DepKind,

source§

default fn from_cycle_error(tcx: Tcx, cycle: &[QueryInfo<D>]) -> T

Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.