# Struct rustc_query_system::dep_graph::dep_node::DepNode

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

## Fields§

§`kind: K`

§`hash: PackedFingerprint`

## Implementations§

source§### impl<K: DepKind> DepNode<K>

### impl<K: DepKind> DepNode<K>

source#### pub fn new_no_params<Tcx>(tcx: Tcx, kind: K) -> DepNode<K>where
Tcx: DepContext<DepKind = 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>,

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

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

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

1.21.0 · source§#### fn max(self, other: Self) -> Selfwhere
Self: Sized,

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

Compares and returns the maximum of two values. Read more

source§### impl<K: PartialEq> PartialEq<DepNode<K>> for DepNode<K>

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

source§### impl<K: PartialOrd> PartialOrd<DepNode<K>> for DepNode<K>

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

1.0.0 · source§#### fn le(&self, other: &Rhs) -> bool

#### 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### 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>

## 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§

## 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.