Struct rustc_query_system::dep_graph::dep_node::DepNode
source · pub struct DepNode {
pub kind: DepKind,
pub hash: PackedFingerprint,
}
Fields§
§kind: DepKind
§hash: PackedFingerprint
Implementations§
source§impl DepNode
impl DepNode
sourcepub fn new_no_params<Tcx>(tcx: Tcx, kind: DepKind) -> DepNodewhere
Tcx: DepContext,
pub fn new_no_params<Tcx>(tcx: Tcx, kind: DepKind) -> DepNodewhere
Tcx: DepContext,
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: DepKind, arg: &Key) -> DepNodewhere
Tcx: DepContext,
Key: DepNodeParams<Tcx>,
sourcepub fn from_def_path_hash<Tcx>(
tcx: Tcx,
def_path_hash: DefPathHash,
kind: DepKind
) -> Selfwhere
Tcx: DepContext,
pub fn from_def_path_hash<Tcx>(
tcx: Tcx,
def_path_hash: DefPathHash,
kind: DepKind
) -> Selfwhere
Tcx: DepContext,
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 PartialEq for DepNode
impl PartialEq for DepNode
impl Copy for DepNode
impl Eq for DepNode
impl StructuralPartialEq for DepNode
Auto Trait Implementations§
impl DynSend for DepNode
impl DynSync for DepNode
impl Freeze for DepNode
impl RefUnwindSafe for DepNode
impl Send for DepNode
impl Sync for DepNode
impl Unpin for DepNode
impl UnwindSafe for DepNode
Blanket Implementations§
§impl<T> AnyEq for T
impl<T> AnyEq for T
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T> ) -> &'a mut [T]
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<T> Filterable for T
impl<T> Filterable for T
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed ) -> T
source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
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: 18 bytes