Struct rustc_query_system::dep_graph::dep_node::DepNode

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

Fields

kind: K

hash: PackedFingerprint

Implementations

impl<K: DepKind> DepNode<K>

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.

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

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

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

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

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

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

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

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<K: Ord> Ord for DepNode<K>

fn cmp(&self, other: &DepNode<K>) -> 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<K: PartialEq> PartialEq<DepNode<K>> for DepNode<K>

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

fn partial_cmp(&self, other: &DepNode<K>) -> 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<K: Copy> Copy for DepNode<K>

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

impl<K> StructuralEq for DepNode<K>

impl<K> StructuralPartialEq for DepNode<K>

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.