pub enum DefiningAnchor<'tcx> {
Bind(&'tcx List<LocalDefId>),
Bubble,
}
Expand description
Defines the treatment of opaque types in a given inference context.
This affects both what opaques are allowed to be defined, but also whether opaques are replaced with inference vars eagerly in the old solver (e.g. in projection, and in the signature during function type-checking).
Variants§
Bind(&'tcx List<LocalDefId>)
Define opaques which are in-scope of the current item being analyzed.
Also, eagerly replace these opaque types in replace_opaque_types_with_inference_vars
.
If the list is empty, do not allow any opaques to be defined. This is used to catch type mismatch
errors when handling opaque types, and also should be used when we would
otherwise reveal opaques (such as Reveal::All
reveal mode).
Bubble
In contexts where we don’t currently know what opaques are allowed to be defined, such as (old solver) canonical queries, we will simply allow opaques to be defined, but “bubble” them up in the canonical response or otherwise treat them to be handled later.
We do not eagerly replace opaque types in replace_opaque_types_with_inference_vars
,
which may affect what predicates pass and fail in the old trait solver.
Implementations§
source§impl<'tcx> DefiningAnchor<'tcx>
impl<'tcx> DefiningAnchor<'tcx>
pub fn bind(tcx: TyCtxt<'tcx>, item: LocalDefId) -> DefiningAnchor<'tcx>
Trait Implementations§
source§impl<'tcx> Clone for DefiningAnchor<'tcx>
impl<'tcx> Clone for DefiningAnchor<'tcx>
source§fn clone(&self) -> DefiningAnchor<'tcx>
fn clone(&self) -> DefiningAnchor<'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'tcx> Debug for DefiningAnchor<'tcx>
impl<'tcx> Debug for DefiningAnchor<'tcx>
source§impl<'tcx> Hash for DefiningAnchor<'tcx>
impl<'tcx> Hash for DefiningAnchor<'tcx>
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for DefiningAnchor<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for DefiningAnchor<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl<'tcx> PartialEq for DefiningAnchor<'tcx>
impl<'tcx> PartialEq for DefiningAnchor<'tcx>
source§fn eq(&self, other: &DefiningAnchor<'tcx>) -> bool
fn eq(&self, other: &DefiningAnchor<'tcx>) -> bool
self
and other
values to be equal, and is used
by ==
.source§impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for DefiningAnchor<'tcx>
impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for DefiningAnchor<'tcx>
source§fn try_fold_with<__F>(
self,
__folder: &mut __F
) -> Result<DefiningAnchor<'tcx>, <__F as FallibleTypeFolder<TyCtxt<'tcx>>>::Error>where
__F: FallibleTypeFolder<TyCtxt<'tcx>>,
fn try_fold_with<__F>(
self,
__folder: &mut __F
) -> Result<DefiningAnchor<'tcx>, <__F as FallibleTypeFolder<TyCtxt<'tcx>>>::Error>where
__F: FallibleTypeFolder<TyCtxt<'tcx>>,
source§fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
fn fold_with<F>(self, folder: &mut F) -> Selfwhere
F: TypeFolder<I>,
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
.source§impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for DefiningAnchor<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for DefiningAnchor<'tcx>
source§fn visit_with<__V>(
&self,
__visitor: &mut __V
) -> <__V as TypeVisitor<TyCtxt<'tcx>>>::Resultwhere
__V: TypeVisitor<TyCtxt<'tcx>>,
fn visit_with<__V>(
&self,
__visitor: &mut __V
) -> <__V as TypeVisitor<TyCtxt<'tcx>>>::Resultwhere
__V: TypeVisitor<TyCtxt<'tcx>>,
impl<'tcx> Copy for DefiningAnchor<'tcx>
impl<'tcx> Eq for DefiningAnchor<'tcx>
impl<'tcx> StructuralPartialEq for DefiningAnchor<'tcx>
Auto Trait Implementations§
impl<'tcx> DynSend for DefiningAnchor<'tcx>
impl<'tcx> DynSync for DefiningAnchor<'tcx>
impl<'tcx> Freeze for DefiningAnchor<'tcx>
impl<'tcx> !RefUnwindSafe for DefiningAnchor<'tcx>
impl<'tcx> Send for DefiningAnchor<'tcx>
impl<'tcx> Sync for DefiningAnchor<'tcx>
impl<'tcx> Unpin for DefiningAnchor<'tcx>
impl<'tcx> !UnwindSafe for DefiningAnchor<'tcx>
Blanket Implementations§
§impl<T> AnyEq for T
impl<T> AnyEq for T
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> 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
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
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
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> 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.source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<T> Filterable for T
impl<T> Filterable for T
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<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
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
§impl<T> Pointable for T
impl<T> Pointable 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<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>
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, 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_projections(&self) -> bool
fn has_inherent_projections(&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_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§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: 8 bytes
Size for each variant:
Bind
: 8 bytesBubble
: 0 bytes