pub struct WorkProductId {
hash: Fingerprint,
}
Expand description
A “work product” corresponds to a .o
(or other) file that we
save in between runs. These IDs do not have a DefId
but rather
some independent path or string that persists between runs without
the need to be mapped or unmapped. (This ensures we can serialize
them even in the absence of a tcx.)
Fields§
§hash: Fingerprint
Implementations§
Source§impl WorkProductId
impl WorkProductId
pub fn from_cgu_name(cgu_name: &str) -> WorkProductId
Trait Implementations§
Source§impl Clone for WorkProductId
impl Clone for WorkProductId
Source§fn clone(&self) -> WorkProductId
fn clone(&self) -> WorkProductId
Returns a copy of the value. Read more
Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Debug for WorkProductId
impl Debug for WorkProductId
Source§impl<__D: SpanDecoder> Decodable<__D> for WorkProductId
impl<__D: SpanDecoder> Decodable<__D> for WorkProductId
Source§impl<__E: SpanEncoder> Encodable<__E> for WorkProductId
impl<__E: SpanEncoder> Encodable<__E> for WorkProductId
Source§impl Hash for WorkProductId
impl Hash for WorkProductId
Source§impl<HCX> HashStable<HCX> for WorkProductId
impl<HCX> HashStable<HCX> for WorkProductId
fn hash_stable(&self, hcx: &mut HCX, hasher: &mut StableHasher)
Source§impl Ord for WorkProductId
impl Ord for WorkProductId
Source§impl PartialEq for WorkProductId
impl PartialEq for WorkProductId
Source§impl PartialOrd for WorkProductId
impl PartialOrd for WorkProductId
Source§impl StableOrd for WorkProductId
impl StableOrd for WorkProductId
const CAN_USE_UNSTABLE_SORT: bool = true
Source§const THIS_IMPLEMENTATION_HAS_BEEN_TRIPLE_CHECKED: () = ()
const THIS_IMPLEMENTATION_HAS_BEEN_TRIPLE_CHECKED: () = ()
Marker to ensure that implementors have carefully considered
whether their
Ord
implementation obeys this trait’s contract.Source§impl<HCX> ToStableHashKey<HCX> for WorkProductId
impl<HCX> ToStableHashKey<HCX> for WorkProductId
type KeyType = Fingerprint
fn to_stable_hash_key(&self, _: &HCX) -> Self::KeyType
impl Copy for WorkProductId
impl Eq for WorkProductId
impl StructuralPartialEq for WorkProductId
Auto Trait Implementations§
impl DynSend for WorkProductId
impl DynSync for WorkProductId
impl Freeze for WorkProductId
impl RefUnwindSafe for WorkProductId
impl Send for WorkProductId
impl Sync for WorkProductId
impl Unpin for WorkProductId
impl UnwindSafe for WorkProductId
Blanket Implementations§
§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx 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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
Source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
This method turns the parameters of a DepNodeConstructor into an opaque
Fingerprint to be used in DepNode.
Not all DepNodeParams support being turned into a Fingerprint (they
don’t need to if the corresponding DepNode is anonymous).
default fn to_debug_str(&self, _: Tcx) -> String
Source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
This method tries to recover the query key from the given
DepNode
,
something which is needed when forcing DepNode
s during red-green
evaluation. The query system will only call this method if
fingerprint_style()
is not FingerprintStyle::Opaque
.
It is always valid to return None
here, in which case incremental
compilation will treat the query as having changed instead of forcing it.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.Source§impl<T> Filterable for T
impl<T> Filterable for T
Source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
Creates a filterable data provider with the given name for debugging. Read more
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>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> StableCompare for Twhere
T: StableOrd,
impl<T> StableCompare for Twhere
T: StableOrd,
const CAN_USE_UNSTABLE_SORT: bool = T::CAN_USE_UNSTABLE_SORT
fn stable_cmp(&self, other: &T) -> Ordering
§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> 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: 16 bytes