Struct rustc_middle::mir::interpret::allocation::ProvenanceMap
source · Expand description
Stores the provenance information of pointers stored in memory.
Tuple Fields
0: SortedMap<Size, Prov>
Implementations
sourceimpl<Prov> ProvenanceMap<Prov>
impl<Prov> ProvenanceMap<Prov>
Trait Implementations
sourceimpl<Prov: Clone> Clone for ProvenanceMap<Prov>
impl<Prov: Clone> Clone for ProvenanceMap<Prov>
sourcefn clone(&self) -> ProvenanceMap<Prov>
fn clone(&self) -> ProvenanceMap<Prov>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresourceimpl<Prov: Debug> Debug for ProvenanceMap<Prov>
impl<Prov: Debug> Debug for ProvenanceMap<Prov>
sourceimpl<'tcx, Prov, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for ProvenanceMap<Prov>where
Prov: Decodable<__D>,
impl<'tcx, Prov, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for ProvenanceMap<Prov>where
Prov: Decodable<__D>,
sourceimpl<Prov> Deref for ProvenanceMap<Prov>
impl<Prov> Deref for ProvenanceMap<Prov>
sourceimpl<'tcx, Prov, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for ProvenanceMap<Prov>where
Prov: Encodable<__E>,
impl<'tcx, Prov, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for ProvenanceMap<Prov>where
Prov: Encodable<__E>,
sourceimpl<Prov: Hash> Hash for ProvenanceMap<Prov>
impl<Prov: Hash> Hash for ProvenanceMap<Prov>
sourceimpl<'a, Prov> HashStable<StableHashingContext<'a>> for ProvenanceMap<Prov>where
Prov: HashStable<StableHashingContext<'a>>,
impl<'a, Prov> HashStable<StableHashingContext<'a>> for ProvenanceMap<Prov>where
Prov: HashStable<StableHashingContext<'a>>,
fn hash_stable(
&self,
hcx: &mut StableHashingContext<'a>,
hasher: &mut StableHasher
)
sourceimpl<Prov: Ord> Ord for ProvenanceMap<Prov>
impl<Prov: Ord> Ord for ProvenanceMap<Prov>
sourcefn cmp(&self, other: &ProvenanceMap<Prov>) -> Ordering
fn cmp(&self, other: &ProvenanceMap<Prov>) -> Ordering
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
Restrict a value to a certain interval. Read more
sourceimpl<Prov: PartialEq> PartialEq<ProvenanceMap<Prov>> for ProvenanceMap<Prov>
impl<Prov: PartialEq> PartialEq<ProvenanceMap<Prov>> for ProvenanceMap<Prov>
sourcefn eq(&self, other: &ProvenanceMap<Prov>) -> bool
fn eq(&self, other: &ProvenanceMap<Prov>) -> bool
sourceimpl<Prov: PartialOrd> PartialOrd<ProvenanceMap<Prov>> for ProvenanceMap<Prov>
impl<Prov: PartialOrd> PartialOrd<ProvenanceMap<Prov>> for ProvenanceMap<Prov>
sourcefn partial_cmp(&self, other: &ProvenanceMap<Prov>) -> Option<Ordering>
fn partial_cmp(&self, other: &ProvenanceMap<Prov>) -> Option<Ordering>
1.0.0 · sourcefn 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 moreimpl<Prov: Eq> Eq for ProvenanceMap<Prov>
impl<Prov> StructuralEq for ProvenanceMap<Prov>
impl<Prov> StructuralPartialEq for ProvenanceMap<Prov>
Auto Trait Implementations
impl<Prov> RefUnwindSafe for ProvenanceMap<Prov>where
Prov: RefUnwindSafe,
impl<Prov> Send for ProvenanceMap<Prov>where
Prov: Send,
impl<Prov> Sync for ProvenanceMap<Prov>where
Prov: Sync,
impl<Prov> Unpin for ProvenanceMap<Prov>where
Prov: Unpin,
impl<Prov> UnwindSafe for ProvenanceMap<Prov>where
Prov: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> 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). Read more
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> 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. Read moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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: 24 bytes