Struct rustc_middle::ty::Const
source · Expand description
Use this rather than ConstS
, whenever possible.
Tuple Fields§
§0: Interned<'tcx, ConstS<'tcx>>
Implementations§
source§impl<'tcx> Const<'tcx>
impl<'tcx> Const<'tcx>
sourcepub fn walk(self) -> TypeWalker<'tcx> ⓘ
pub fn walk(self) -> TypeWalker<'tcx> ⓘ
Iterator that walks self
and any types reachable from
self
, in depth-first order. Note that just walks the types
that appear in self
, it does not descend into the fields of
structs or variants. For example:
isize => { isize }
Foo<Bar<isize>> => { Foo<Bar<isize>>, Bar<isize>, isize }
[isize] => { [isize], isize }
source§impl<'tcx> Const<'tcx>
impl<'tcx> Const<'tcx>
pub fn ty(self) -> Ty<'tcx>
pub fn kind(self) -> ConstKind<'tcx>
sourcepub fn from_anon_const(tcx: TyCtxt<'tcx>, def_id: LocalDefId) -> Self
pub fn from_anon_const(tcx: TyCtxt<'tcx>, def_id: LocalDefId) -> Self
Literals and const generic parameters are eagerly converted to a constant, everything else
becomes Unevaluated
.
pub fn from_opt_const_arg_anon_const(
tcx: TyCtxt<'tcx>,
def: WithOptConstParam<LocalDefId>
) -> Self
fn try_eval_lit_or_param(
tcx: TyCtxt<'tcx>,
ty: Ty<'tcx>,
expr: &'tcx Expr<'tcx>
) -> Option<Self>
sourcepub fn to_valtree(self) -> ValTree<'tcx>
pub fn to_valtree(self) -> ValTree<'tcx>
Panics if self.kind != ty::ConstKind::Value
sourcepub fn from_bits(
tcx: TyCtxt<'tcx>,
bits: u128,
ty: ParamEnvAnd<'tcx, Ty<'tcx>>
) -> Self
pub fn from_bits(
tcx: TyCtxt<'tcx>,
bits: u128,
ty: ParamEnvAnd<'tcx, Ty<'tcx>>
) -> Self
Creates a constant with the given integer value and interns it.
sourcepub fn zero_sized(tcx: TyCtxt<'tcx>, ty: Ty<'tcx>) -> Self
pub fn zero_sized(tcx: TyCtxt<'tcx>, ty: Ty<'tcx>) -> Self
Creates an interned zst constant.
sourcepub fn from_usize(tcx: TyCtxt<'tcx>, n: u64) -> Self
pub fn from_usize(tcx: TyCtxt<'tcx>, n: u64) -> Self
Creates an interned usize constant.
sourcepub fn try_eval_bits(
self,
tcx: TyCtxt<'tcx>,
param_env: ParamEnv<'tcx>,
ty: Ty<'tcx>
) -> Option<u128>
pub fn try_eval_bits(
self,
tcx: TyCtxt<'tcx>,
param_env: ParamEnv<'tcx>,
ty: Ty<'tcx>
) -> Option<u128>
Attempts to evaluate the given constant to bits. Can fail to evaluate in the presence of generics (or erroneous code) or if the value can’t be represented as bits (e.g. because it contains const generic parameters or pointers).
pub fn try_eval_bool(
self,
tcx: TyCtxt<'tcx>,
param_env: ParamEnv<'tcx>
) -> Option<bool>
pub fn try_eval_usize(
self,
tcx: TyCtxt<'tcx>,
param_env: ParamEnv<'tcx>
) -> Option<u64>
sourcepub fn eval(self, tcx: TyCtxt<'tcx>, param_env: ParamEnv<'tcx>) -> Const<'tcx>
pub fn eval(self, tcx: TyCtxt<'tcx>, param_env: ParamEnv<'tcx>) -> Const<'tcx>
Tries to evaluate the constant if it is Unevaluated
. If that doesn’t succeed, return the
unevaluated constant.
sourcepub fn eval_bits(
self,
tcx: TyCtxt<'tcx>,
param_env: ParamEnv<'tcx>,
ty: Ty<'tcx>
) -> u128
pub fn eval_bits(
self,
tcx: TyCtxt<'tcx>,
param_env: ParamEnv<'tcx>,
ty: Ty<'tcx>
) -> u128
Panics if the value cannot be evaluated or doesn’t contain a valid integer of the given type.
sourcepub fn eval_usize(self, tcx: TyCtxt<'tcx>, param_env: ParamEnv<'tcx>) -> u64
pub fn eval_usize(self, tcx: TyCtxt<'tcx>, param_env: ParamEnv<'tcx>) -> u64
Panics if the value cannot be evaluated or doesn’t contain a valid usize
.
pub fn is_ct_infer(self) -> bool
Trait Implementations§
source§impl<'tcx> From<Const<'tcx>> for GenericArg<'tcx>
impl<'tcx> From<Const<'tcx>> for GenericArg<'tcx>
source§fn from(c: Const<'tcx>) -> GenericArg<'tcx>
fn from(c: Const<'tcx>) -> GenericArg<'tcx>
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for Const<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for Const<'tcx>
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
source§impl<'tcx> Key for Const<'tcx>
impl<'tcx> Key for Const<'tcx>
source§fn query_crate_is_local(&self) -> bool
fn query_crate_is_local(&self) -> bool
source§fn default_span(&self, _: TyCtxt<'_>) -> Span
fn default_span(&self, _: TyCtxt<'_>) -> Span
self
, what span should we use? Read moretype CacheSelector = DefaultCacheSelector<Self>
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<'tcx> Ord for Const<'tcx>
impl<'tcx> Ord for Const<'tcx>
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
source§impl<'tcx> PartialEq<Const<'tcx>> for Const<'tcx>
impl<'tcx> PartialEq<Const<'tcx>> for Const<'tcx>
source§impl<'tcx> PartialOrd<Const<'tcx>> for Const<'tcx>
impl<'tcx> PartialOrd<Const<'tcx>> for Const<'tcx>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moresource§impl<'tcx> Relate<'tcx> for Const<'tcx>
impl<'tcx> Relate<'tcx> for Const<'tcx>
fn relate<R: TypeRelation<'tcx>>(
relation: &mut R,
a: Const<'tcx>,
b: Const<'tcx>
) -> RelateResult<'tcx, Const<'tcx>>
source§impl<'tcx> TypeFoldable<'tcx> for Const<'tcx>
impl<'tcx> TypeFoldable<'tcx> for Const<'tcx>
source§fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
fn try_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
source§impl<'tcx> TypeSuperFoldable<'tcx> for Const<'tcx>
impl<'tcx> TypeSuperFoldable<'tcx> for Const<'tcx>
source§fn try_super_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
fn try_super_fold_with<F: FallibleTypeFolder<'tcx>>(
self,
folder: &mut F
) -> Result<Self, F::Error>
TypeFolder
methods, when a non-custom traversal is
desired for the value of the type of interest passed to that method.
For example, in MyFolder::try_fold_ty(ty)
, it is valid to call
ty.try_super_fold_with(self)
, but any other folding should be done
with xyz.try_fold_with(self)
. Read moresource§fn super_fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
fn super_fold_with<F: TypeFolder<'tcx>>(self, folder: &mut F) -> Self
try_super_fold_with
for use with
infallible folders. Do not override this method, to ensure coherence
with try_super_fold_with
. Read moresource§impl<'tcx> TypeSuperVisitable<'tcx> for Const<'tcx>
impl<'tcx> TypeSuperVisitable<'tcx> for Const<'tcx>
source§fn super_visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
fn super_visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
TypeVisitor
methods, when a non-custom traversal is
desired for the value of the type of interest passed to that method.
For example, in MyVisitor::visit_ty(ty)
, it is valid to call
ty.super_visit_with(self)
, but any other visiting should be done
with xyz.visit_with(self)
. Read moresource§impl<'tcx> TypeVisitable<'tcx> for Const<'tcx>
impl<'tcx> TypeVisitable<'tcx> for Const<'tcx>
source§fn visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
fn visit_with<V: TypeVisitor<'tcx>>(
&self,
visitor: &mut V
) -> ControlFlow<V::BreakTy>
source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
true
if self
has any late-bound regions that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound regions that appear free. Read moresource§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this type has any regions that escape binder
(and
hence are not bound by it). Read moresource§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
true
if this type has regions that are not a part of the type.
For example, for<'a> fn(&'a i32)
return false
, while fn(&'a i32)
would return true
. The latter can occur when traversing through the
former. Read morefn has_type_flags(&self, flags: TypeFlags) -> bool
fn has_projections(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn error_reported(&self) -> Result<(), ErrorGuaranteed>
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn needs_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn needs_subst(&self) -> bool
source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
source§fn has_late_bound_regions(&self) -> bool
fn has_late_bound_regions(&self) -> bool
source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization. Read moreimpl<'tcx> Copy for Const<'tcx>
impl<'tcx> Eq for Const<'tcx>
impl<'tcx> StructuralEq for Const<'tcx>
impl<'tcx> StructuralPartialEq for Const<'tcx>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for Const<'tcx>
impl<'tcx> !Send for Const<'tcx>
impl<'tcx> !Sync for Const<'tcx>
impl<'tcx> Unpin for Const<'tcx>
impl<'tcx> !UnwindSafe for Const<'tcx>
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<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
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
default fn recover(
_: Tcx,
_: &DepNode<<Tcx as DepContext>::DepKind>
) -> Option<T>
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 moresource§impl<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,
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, _: &[QueryInfo]) -> 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: 8 bytes