pub struct Const<I>(pub <I as Interner>::InternedConstKind)
where
I: Interner;Tuple Fields§
§0: <I as Interner>::InternedConstKindImplementations§
Source§impl<I> Const<I>where
I: Interner,
impl<I> Const<I>where
I: Interner,
pub fn kind(self) -> ConstKind<I>
pub fn new(interner: I, kind: ConstKind<I>) -> Const<I>
pub fn new_var(interner: I, infer: ConstVid) -> Const<I>
pub fn new_infer(interner: I, infer: InferConst) -> Const<I>
pub fn new_bound( interner: I, debruijn: DebruijnIndex, bound_const: BoundConst<I>, ) -> Const<I>
pub fn new_anon_bound( interner: I, debruijn: DebruijnIndex, var: BoundVar, ) -> Const<I>
pub fn new_canonical_bound(interner: I, var: BoundVar) -> Const<I>
pub fn new_placeholder( interner: I, placeholder: Placeholder<I, BoundConst<I>>, ) -> Const<I>
pub fn new_alias( interner: I, is_rigid: IsRigid, alias_const: Alias<I, AliasConstKind<I>>, ) -> Const<I>
pub fn new_expr(interner: I, expr: <I as Interner>::ExprConst) -> Const<I>
pub fn new_error(interner: I, e: <I as Interner>::ErrorGuaranteed) -> Const<I>
pub fn is_ct_var(self) -> bool
pub fn is_ct_error(self) -> bool
pub fn new_param(interner: I, param: <I as Interner>::ParamConst) -> Const<I>
pub fn new_fresh(interner: I, fresh: u32) -> Const<I>
pub fn new_misc_error(interner: I) -> Const<I>
pub fn new_error_with_message( interner: I, span: <I as Interner>::Span, msg: impl ToString, ) -> Const<I>
pub fn is_trivially_wf(self) -> bool
pub fn is_ct_infer(self) -> bool
pub fn ct_vid(self) -> Option<ConstVid>
Trait Implementations§
Source§impl<'tcx> ConstExt<'tcx> for Const<TyCtxt<'tcx>>
impl<'tcx> ConstExt<'tcx> for Const<TyCtxt<'tcx>>
Source§fn from_bits(
tcx: TyCtxt<'tcx>,
bits: u128,
typing_env: TypingEnv<'tcx>,
ty: Ty<'tcx>,
) -> Const<TyCtxt<'tcx>>
fn from_bits( tcx: TyCtxt<'tcx>, bits: u128, typing_env: TypingEnv<'tcx>, ty: Ty<'tcx>, ) -> Const<TyCtxt<'tcx>>
Creates a constant with the given integer value and interns it.
Source§fn zero_sized(tcx: TyCtxt<'tcx>, ty: Ty<'tcx>) -> Const<TyCtxt<'tcx>>
fn zero_sized(tcx: TyCtxt<'tcx>, ty: Ty<'tcx>) -> Const<TyCtxt<'tcx>>
Creates an interned zst constant.
Source§fn from_bool(tcx: TyCtxt<'tcx>, v: bool) -> Const<TyCtxt<'tcx>>
fn from_bool(tcx: TyCtxt<'tcx>, v: bool) -> Const<TyCtxt<'tcx>>
Creates an interned bool constant.
Source§fn from_target_usize(tcx: TyCtxt<'tcx>, n: u64) -> Const<TyCtxt<'tcx>>
fn from_target_usize(tcx: TyCtxt<'tcx>, n: u64) -> Const<TyCtxt<'tcx>>
Creates an interned usize constant.
Source§fn try_to_value(self) -> Option<Value<'tcx>>
fn try_to_value(self) -> Option<Value<'tcx>>
Attempts to convert to a value.
Note that this does not normalize the constant.
Source§fn to_leaf(self) -> ScalarInt
fn to_leaf(self) -> ScalarInt
Converts to a ValTreeKind::Leaf value, panic’ing
if this constant is some other kind.
Note that this does not normalize the constant.
Source§fn to_branch(self) -> &'tcx [Const<TyCtxt<'tcx>>]
fn to_branch(self) -> &'tcx [Const<TyCtxt<'tcx>>]
Converts to a ValTreeKind::Branch value, panic’ing
if this constant is some other kind.
Note that this does not normalize the constant.
Source§fn try_to_leaf(self) -> Option<ScalarInt>
fn try_to_leaf(self) -> Option<ScalarInt>
Attempts to convert to a ValTreeKind::Leaf value.
Note that this does not normalize the constant.
Source§fn try_to_scalar(self) -> Option<Scalar>
fn try_to_scalar(self) -> Option<Scalar>
Attempts to convert to a ValTreeKind::Leaf value.
Note that this does not normalize the constant.
Source§fn try_to_branch(self) -> Option<&'tcx [Const<TyCtxt<'tcx>>]>
fn try_to_branch(self) -> Option<&'tcx [Const<TyCtxt<'tcx>>]>
Attempts to convert to a ValTreeKind::Branch value.
Note that this does not normalize the constant.
Source§fn try_to_target_usize(self, tcx: TyCtxt<'tcx>) -> Option<u64>
fn try_to_target_usize(self, tcx: TyCtxt<'tcx>) -> Option<u64>
Convenience method to extract the value of a usize constant, useful to get the length of an array type.
Note that this does not evaluate the constant.
Source§fn walk(self) -> TypeWalker<TyCtxt<'tcx>> ⓘ
fn walk(self) -> TypeWalker<TyCtxt<'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 }fn new_value( tcx: TyCtxt<'tcx>, valtree: ValTree<'tcx>, ty: Ty<'tcx>, ) -> Const<TyCtxt<'tcx>>
impl<I> Copy for Const<I>where
I: Interner,
impl<I> Eq for Const<I>where
I: Interner,
Source§impl<I> Flags for Const<I>where
I: Interner,
impl<I> Flags for Const<I>where
I: Interner,
fn flags(&self) -> TypeFlags
fn outer_exclusive_binder(&self) -> DebruijnIndex
Source§impl<I, __V> GenericTypeVisitable<__V> for Const<I>
impl<I, __V> GenericTypeVisitable<__V> for Const<I>
fn generic_visit_with(&self, __visitor: &mut __V)
Source§impl<I> StableHash for Const<I>
impl<I> StableHash for Const<I>
fn stable_hash<__Hcx>(
&self,
__hcx: &mut __Hcx,
__hasher: &mut StableHasher<SipHasher128>,
)where
__Hcx: StableHashCtxt,
Source§impl<I> TypeFoldable<I> for Const<I>where
I: Interner,
impl<I> TypeFoldable<I> for Const<I>where
I: Interner,
Source§fn try_fold_with<F>(
self,
folder: &mut F,
) -> Result<Const<I>, <F as FallibleTypeFolder<I>>::Error>where
F: FallibleTypeFolder<I>,
fn try_fold_with<F>(
self,
folder: &mut F,
) -> Result<Const<I>, <F as FallibleTypeFolder<I>>::Error>where
F: FallibleTypeFolder<I>,
Source§impl<I> TypeSuperFoldable<I> for Const<I>where
I: Interner,
impl<I> TypeSuperFoldable<I> for Const<I>where
I: Interner,
Source§fn try_super_fold_with<F>(
self,
folder: &mut F,
) -> Result<Const<I>, <F as FallibleTypeFolder<I>>::Error>where
F: FallibleTypeFolder<I>,
fn try_super_fold_with<F>(
self,
folder: &mut F,
) -> Result<Const<I>, <F as FallibleTypeFolder<I>>::Error>where
F: FallibleTypeFolder<I>,
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).Source§fn super_fold_with<F>(self, folder: &mut F) -> Const<I>where
F: TypeFolder<I>,
fn super_fold_with<F>(self, folder: &mut F) -> Const<I>where
F: TypeFolder<I>,
try_super_fold_with for use with
infallible folders. Do not override this method, to ensure coherence
with try_super_fold_with.Source§impl<I> TypeSuperVisitable<I> for Const<I>where
I: Interner,
impl<I> TypeSuperVisitable<I> for Const<I>where
I: Interner,
Source§fn super_visit_with<V>(&self, visitor: &mut V) -> <V as TypeVisitor<I>>::Resultwhere
V: TypeVisitor<I>,
fn super_visit_with<V>(&self, visitor: &mut V) -> <V as TypeVisitor<I>>::Resultwhere
V: TypeVisitor<I>,
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).Source§impl<I> TypeVisitable<I> for Const<I>where
I: Interner,
impl<I> TypeVisitable<I> for Const<I>where
I: Interner,
Source§fn visit_with<V>(&self, visitor: &mut V) -> <V as TypeVisitor<I>>::Resultwhere
V: TypeVisitor<I>,
fn visit_with<V>(&self, visitor: &mut V) -> <V as TypeVisitor<I>>::Resultwhere
V: TypeVisitor<I>,
Auto Trait Implementations§
impl<I> DynSend for Const<I>
impl<I> DynSync for Const<I>
impl<I> Freeze for Const<I>
impl<I> RefUnwindSafe for Const<I>
impl<I> Send for Const<I>
impl<I> Sync for Const<I>
impl<I> Unpin for Const<I>
impl<I> UnsafeUnpin for Const<I>
impl<I> UnwindSafe for Const<I>
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(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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<'tcx, T> DepNodeKey<'tcx> for Twhere
T: StableHash + Debug,
impl<'tcx, T> DepNodeKey<'tcx> for Twhere
T: StableHash + Debug,
default fn key_fingerprint_style() -> KeyFingerprintStyle
Source§default fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint
default fn to_fingerprint(&self, tcx: TyCtxt<'tcx>) -> Fingerprint
Fingerprint to be used
in DepNode.Source§default fn try_recover_key(_: TyCtxt<'tcx>, _: &DepNode) -> Option<T>
default fn try_recover_key(_: TyCtxt<'tcx>, _: &DepNode) -> Option<T>
DepNode,
something which is needed when forcing DepNodes 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§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.impl<T> ErasedDestructor for Twhere
T: 'static,
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> ⓘ
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> ⓘ
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<K> IntoQueryKey<K> for K
impl<K> IntoQueryKey<K> for K
Source§fn into_query_key(self) -> K
fn into_query_key(self) -> K
Self to K.
This should always be a very cheap conversion, e.g. LocalDefId::to_def_id.Source§impl<'tcx, T> IsSuggestable<'tcx> for T
impl<'tcx, T> IsSuggestable<'tcx> for T
Source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
fn has_type_flags(&self, flags: TypeFlags) -> bool
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.fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>
fn non_region_error_reported( &self, ) -> Result<(), <I as Interner>::ErrorGuaranteed>
Source§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).Source§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, given a for<'a> fn(&'a i32) this function returns
false, while given a fn(&'a i32) it returns true. The latter can
occur when traversing through the former. Read morefn has_aliases(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_coroutines(&self) -> bool
fn references_error(&self) -> bool
fn has_non_region_param(&self) -> bool
fn has_regions(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&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_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
Source§fn has_non_region_bound_vars(&self) -> bool
fn has_non_region_bound_vars(&self) -> bool
Source§fn has_bound_vars(&self) -> bool
fn has_bound_vars(&self) -> bool
Source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.Source§fn has_non_region_error(&self) -> bool
fn has_non_region_error(&self) -> bool
Source§fn has_rigid_aliases(&self) -> bool
fn has_rigid_aliases(&self) -> bool
IsRigid::Yes. Used for skipping normalization.Source§fn has_non_rigid_aliases(&self) -> bool
fn has_non_rigid_aliases(&self) -> bool
IsRigid::No.Source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
Source§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<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> ⓘ
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.