pub struct UnsafeBinderInner<I>(Binder<I, <I as Interner>::Ty>)
where
I: Interner;Tuple Fields§
§0: Binder<I, <I as Interner>::Ty>Methods from Deref<Target = Binder<I, <I as Interner>::Ty>>§
pub fn bound_vars(&self) -> <I as Interner>::BoundVarKinds
pub fn as_ref(&self) -> Binder<I, &T>
pub fn as_deref(&self) -> Binder<I, &<T as Deref>::Target>where
T: Deref,
pub fn map_bound_ref<F, U>(&self, f: F) -> Binder<I, U>
Sourcepub fn rebind<U>(&self, value: U) -> Binder<I, U>where
U: TypeVisitable<I>,
pub fn rebind<U>(&self, value: U) -> Binder<I, U>where
U: TypeVisitable<I>,
Wraps a value in a binder, using the same bound variables as the
current Binder. This should not be used if the new value changes
the bound variables. Note: the (old or new) value itself does not
necessarily need to name all the bound variables.
This currently doesn’t do anything different than bind, because we
don’t actually track bound vars. However, semantically, it is different
because bound vars aren’t allowed to change here, whereas they are
in bind. This may be (debug) asserted in the future.
pub fn self_ty(&self) -> Binder<I, <I as Interner>::Ty>
pub fn def_id(&self) -> <I as Interner>::DefId
Sourcepub fn with_self_ty(
&self,
cx: I,
self_ty: <I as Interner>::Ty,
) -> <I as Interner>::Clause
pub fn with_self_ty( &self, cx: I, self_ty: <I as Interner>::Ty, ) -> <I as Interner>::Clause
Given an existential predicate like ?Self: PartialEq<u32> (e.g., derived from dyn PartialEq<u32>),
and a concrete type self_ty, returns a full predicate where the existentially quantified variable ?Self
has been replaced with self_ty (e.g., self_ty: PartialEq<u32>, in our example).
pub fn def_id(&self) -> <I as Interner>::DefId
Sourcepub fn with_self_ty(
&self,
cx: I,
self_ty: <I as Interner>::Ty,
) -> Binder<I, TraitRef<I>>
pub fn with_self_ty( &self, cx: I, self_ty: <I as Interner>::Ty, ) -> Binder<I, TraitRef<I>>
Object types don’t have a self type specified. Therefore, when
we convert the principal trait-ref into a normal trait-ref,
you must give some self type. A common choice is mk_err()
or some placeholder type.
pub fn with_self_ty( &self, cx: I, self_ty: <I as Interner>::Ty, ) -> Binder<I, ProjectionPredicate<I>>
pub fn item_def_id(&self) -> <I as Interner>::DefId
Sourcepub fn trait_def_id(&self, cx: I) -> <I as Interner>::DefId
pub fn trait_def_id(&self, cx: I) -> <I as Interner>::DefId
Returns the DefId of the trait of the associated item being projected.
pub fn term(&self) -> Binder<I, <I as Interner>::Term>
Sourcepub fn item_def_id(&self) -> <I as Interner>::DefId
pub fn item_def_id(&self) -> <I as Interner>::DefId
The DefId of the TraitItem for the associated type.
Note that this is not the DefId of the TraitRef containing this
associated type, which is in tcx.associated_item(projection_def_id()).container.
pub fn is_fn_trait_compatible(&self) -> bool
Trait Implementations§
Source§impl<I> Clone for UnsafeBinderInner<I>where
I: Interner,
impl<I> Clone for UnsafeBinderInner<I>where
I: Interner,
Source§fn clone(&self) -> UnsafeBinderInner<I>
fn clone(&self) -> UnsafeBinderInner<I>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<I> Debug for UnsafeBinderInner<I>where
I: Interner,
impl<I> Debug for UnsafeBinderInner<I>where
I: Interner,
Source§impl<I, D> Decodable<D> for UnsafeBinderInner<I>where
I: Interner,
D: TyDecoder<I = I>,
<I as Interner>::Ty: TypeVisitable<I> + Decodable<D>,
<I as Interner>::BoundVarKinds: Decodable<D>,
impl<I, D> Decodable<D> for UnsafeBinderInner<I>where
I: Interner,
D: TyDecoder<I = I>,
<I as Interner>::Ty: TypeVisitable<I> + Decodable<D>,
<I as Interner>::BoundVarKinds: Decodable<D>,
fn decode(decoder: &mut D) -> UnsafeBinderInner<I>
Source§impl<I> Deref for UnsafeBinderInner<I>where
I: Interner,
impl<I> Deref for UnsafeBinderInner<I>where
I: Interner,
Source§impl<I, E> Encodable<E> for UnsafeBinderInner<I>
impl<I, E> Encodable<E> for UnsafeBinderInner<I>
Source§impl<I> Hash for UnsafeBinderInner<I>where
I: Interner,
impl<I> Hash for UnsafeBinderInner<I>where
I: Interner,
Source§impl<I, __CTX> HashStable<__CTX> for UnsafeBinderInner<I>
impl<I, __CTX> HashStable<__CTX> for UnsafeBinderInner<I>
fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )
Source§impl<I, J> Lift<J> for UnsafeBinderInner<I>
impl<I, J> Lift<J> for UnsafeBinderInner<I>
type Lifted = UnsafeBinderInner<J>
fn lift_to_interner(self, interner: J) -> Option<UnsafeBinderInner<J>>
Source§impl<I> PartialEq for UnsafeBinderInner<I>where
I: Interner,
impl<I> PartialEq for UnsafeBinderInner<I>where
I: Interner,
Source§impl<I> TypeFoldable<I> for UnsafeBinderInner<I>
impl<I> TypeFoldable<I> for UnsafeBinderInner<I>
Source§fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<UnsafeBinderInner<I>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<UnsafeBinderInner<I>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
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<I> TypeVisitable<I> for UnsafeBinderInner<I>
impl<I> TypeVisitable<I> for UnsafeBinderInner<I>
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>,
impl<I> Copy for UnsafeBinderInner<I>where
I: Interner,
impl<I> Eq for UnsafeBinderInner<I>where
I: Interner,
Auto Trait Implementations§
impl<I> DynSend for UnsafeBinderInner<I>
impl<I> DynSync for UnsafeBinderInner<I>
impl<I> Freeze for UnsafeBinderInner<I>
impl<I> RefUnwindSafe for UnsafeBinderInner<I>
impl<I> Send for UnsafeBinderInner<I>
impl<I> Sync for UnsafeBinderInner<I>
impl<I> Unpin for UnsafeBinderInner<I>
impl<I> UnwindSafe for UnsafeBinderInner<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<'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> 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 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§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.Source§impl<T> Filterable for T
impl<T> Filterable for T
Source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
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<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
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>
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_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_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<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<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: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.