Enum rustc_middle::ty::fast_reject::SimplifiedType
source · pub enum SimplifiedType {
}
Expand description
See simplify_type
.
Variants§
Bool
Char
Int(IntTy)
Uint(UintTy)
Float(FloatTy)
Adt(DefId)
Foreign(DefId)
Str
Array
Slice
Ref(Mutability)
Ptr(Mutability)
Never
Tuple(usize)
MarkerTraitObject
A trait object, all of whose components are markers
(e.g., dyn Send + Sync
).
Trait(DefId)
Closure(DefId)
Generator(DefId)
GeneratorWitness(DefId)
Function(usize)
Placeholder
Implementations§
Trait Implementations§
source§impl Clone for SimplifiedType
impl Clone for SimplifiedType
source§fn clone(&self) -> SimplifiedType
fn clone(&self) -> SimplifiedType
Returns a copy of the value. Read more
1.0.0 · 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 SimplifiedType
impl Debug for SimplifiedType
source§impl Hash for SimplifiedType
impl Hash for SimplifiedType
source§impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for SimplifiedType
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for SimplifiedType
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl Key for SimplifiedType
impl Key for SimplifiedType
type CacheSelector = DefaultCacheSelector<SimplifiedType>
source§fn default_span(&self, _: TyCtxt<'_>) -> Span
fn default_span(&self, _: TyCtxt<'_>) -> Span
In the event that a cycle occurs, if no explicit span has been
given for a query with key
self
, what span should we use?source§fn key_as_def_id(&self) -> Option<DefId>
fn key_as_def_id(&self) -> Option<DefId>
fn ty_adt_id(&self) -> Option<DefId>
source§impl ParameterizedOverTcx for SimplifiedType
impl ParameterizedOverTcx for SimplifiedType
type Value<'tcx> = SimplifiedType
source§impl PartialEq<SimplifiedType> for SimplifiedType
impl PartialEq<SimplifiedType> for SimplifiedType
source§fn eq(&self, other: &SimplifiedType) -> bool
fn eq(&self, other: &SimplifiedType) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<'a> ToStableHashKey<StableHashingContext<'a>> for SimplifiedType
impl<'a> ToStableHashKey<StableHashingContext<'a>> for SimplifiedType
type KeyType = Fingerprint
fn to_stable_hash_key(&self, hcx: &StableHashingContext<'a>) -> Fingerprint
impl Copy for SimplifiedType
impl Eq for SimplifiedType
impl StructuralEq for SimplifiedType
impl StructuralPartialEq for SimplifiedType
Auto Trait Implementations§
impl RefUnwindSafe for SimplifiedType
impl Send for SimplifiedType
impl Sync for SimplifiedType
impl Unpin for SimplifiedType
impl UnwindSafe for SimplifiedType
Blanket Implementations§
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<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
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<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> 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: &[QueryInfo], _guar: ErrorGuaranteed ) -> 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
Size for each variant:
Bool
: 0 bytesChar
: 0 bytesInt
: 1 byteUint
: 1 byteFloat
: 1 byteAdt
: 11 bytesForeign
: 11 bytesStr
: 0 bytesArray
: 0 bytesSlice
: 0 bytesRef
: 1 bytePtr
: 1 byteNever
: 0 bytesTuple
: 15 bytesMarkerTraitObject
: 0 bytesTrait
: 11 bytesClosure
: 11 bytesGenerator
: 11 bytesGeneratorWitness
: 11 bytesFunction
: 15 bytesPlaceholder
: 0 bytes