Struct CoroutineClosureSignature
pub struct CoroutineClosureSignature<I>where
I: Interner,{
pub interior: <I as Interner>::Ty,
pub tupled_inputs_ty: <I as Interner>::Ty,
pub resume_ty: <I as Interner>::Ty,
pub yield_ty: <I as Interner>::Ty,
pub return_ty: <I as Interner>::Ty,
pub c_variadic: bool,
pub safety: <I as Interner>::Safety,
pub abi: <I as Interner>::Abi,
}
Fields§
§interior: <I as Interner>::Ty
§tupled_inputs_ty: <I as Interner>::Ty
§resume_ty: <I as Interner>::Ty
§yield_ty: <I as Interner>::Ty
§return_ty: <I as Interner>::Ty
§c_variadic: bool
Always false
safety: <I as Interner>::Safety
Always Normal
(safe)
abi: <I as Interner>::Abi
Always RustCall
Implementations§
§impl<I> CoroutineClosureSignature<I>where
I: Interner,
impl<I> CoroutineClosureSignature<I>where
I: Interner,
pub fn to_coroutine(
self,
cx: I,
parent_args: <I as Interner>::GenericArgsSlice,
coroutine_kind_ty: <I as Interner>::Ty,
coroutine_def_id: <I as Interner>::DefId,
tupled_upvars_ty: <I as Interner>::Ty,
) -> <I as Interner>::Ty
pub fn to_coroutine( self, cx: I, parent_args: <I as Interner>::GenericArgsSlice, coroutine_kind_ty: <I as Interner>::Ty, coroutine_def_id: <I as Interner>::DefId, tupled_upvars_ty: <I as Interner>::Ty, ) -> <I as Interner>::Ty
Construct a coroutine from the closure signature. Since a coroutine signature is agnostic to the type of generator that is returned (by-ref/by-move), the caller must specify what “flavor” of generator that they’d like to create. Additionally, they must manually compute the upvars of the closure.
This helper is not really meant to be used directly except for early on during typeck, when we want to put inference vars into the kind and upvars tys. When the kind and upvars are known, use the other helper functions.
pub fn to_coroutine_given_kind_and_upvars(
self,
cx: I,
parent_args: <I as Interner>::GenericArgsSlice,
coroutine_def_id: <I as Interner>::DefId,
goal_kind: ClosureKind,
env_region: <I as Interner>::Region,
closure_tupled_upvars_ty: <I as Interner>::Ty,
coroutine_captures_by_ref_ty: <I as Interner>::Ty,
) -> <I as Interner>::Ty
pub fn to_coroutine_given_kind_and_upvars( self, cx: I, parent_args: <I as Interner>::GenericArgsSlice, coroutine_def_id: <I as Interner>::DefId, goal_kind: ClosureKind, env_region: <I as Interner>::Region, closure_tupled_upvars_ty: <I as Interner>::Ty, coroutine_captures_by_ref_ty: <I as Interner>::Ty, ) -> <I as Interner>::Ty
Given known upvars and a ClosureKind
, compute the coroutine
returned by that corresponding async fn trait.
This function expects the upvars to have been computed already, and doesn’t check
that the ClosureKind
is actually supported by the coroutine-closure.
pub fn tupled_upvars_by_closure_kind(
cx: I,
kind: ClosureKind,
tupled_inputs_ty: <I as Interner>::Ty,
closure_tupled_upvars_ty: <I as Interner>::Ty,
coroutine_captures_by_ref_ty: <I as Interner>::Ty,
env_region: <I as Interner>::Region,
) -> <I as Interner>::Ty
pub fn tupled_upvars_by_closure_kind( cx: I, kind: ClosureKind, tupled_inputs_ty: <I as Interner>::Ty, closure_tupled_upvars_ty: <I as Interner>::Ty, coroutine_captures_by_ref_ty: <I as Interner>::Ty, env_region: <I as Interner>::Region, ) -> <I as Interner>::Ty
Compute the tupled upvars that a coroutine-closure’s output coroutine
would return for the given ClosureKind
.
When ClosureKind
is FnMut
/Fn
, then this will use the “captures by ref”
to return a set of upvars which are borrowed with the given env_region
.
This ensures that the AsyncFn::call
will return a coroutine whose upvars’
lifetimes are related to the lifetime of the borrow on the closure made for
the call. This allows borrowck to enforce the self-borrows correctly.
Trait Implementations§
§impl<I> Clone for CoroutineClosureSignature<I>where
I: Interner,
impl<I> Clone for CoroutineClosureSignature<I>where
I: Interner,
§fn clone(&self) -> CoroutineClosureSignature<I>
fn clone(&self) -> CoroutineClosureSignature<I>
Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more§impl<I> Debug for CoroutineClosureSignature<I>where
I: Interner,
impl<I> Debug for CoroutineClosureSignature<I>where
I: Interner,
§impl<I> Hash for CoroutineClosureSignature<I>where
I: Interner,
impl<I> Hash for CoroutineClosureSignature<I>where
I: Interner,
§impl<I> PartialEq for CoroutineClosureSignature<I>where
I: Interner,
impl<I> PartialEq for CoroutineClosureSignature<I>where
I: Interner,
§impl<I> TypeFoldable<I> for CoroutineClosureSignature<I>
impl<I> TypeFoldable<I> for CoroutineClosureSignature<I>
§fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<CoroutineClosureSignature<I>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<CoroutineClosureSignature<I>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
§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
.§impl<I> TypeVisitable<I> for CoroutineClosureSignature<I>
impl<I> TypeVisitable<I> for CoroutineClosureSignature<I>
§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 CoroutineClosureSignature<I>where
I: Interner,
impl<I> Eq for CoroutineClosureSignature<I>where
I: Interner,
Auto Trait Implementations§
impl<I> DynSend for CoroutineClosureSignature<I>
impl<I> DynSync for CoroutineClosureSignature<I>
impl<I> Freeze for CoroutineClosureSignature<I>
impl<I> RefUnwindSafe for CoroutineClosureSignature<I>where
<I as Interner>::Ty: RefUnwindSafe,
<I as Interner>::Safety: RefUnwindSafe,
<I as Interner>::Abi: RefUnwindSafe,
impl<I> Send for CoroutineClosureSignature<I>
impl<I> Sync for CoroutineClosureSignature<I>
impl<I> Unpin for CoroutineClosureSignature<I>
impl<I> UnwindSafe for CoroutineClosureSignature<I>where
<I as Interner>::Ty: UnwindSafe,
<I as Interner>::Safety: UnwindSafe,
<I as Interner>::Abi: UnwindSafe,
Blanket Implementations§
§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§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
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
§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
§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 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).§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
§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
§fn is_global(&self) -> bool
fn is_global(&self) -> bool
§fn has_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
§fn has_non_region_bound_vars(&self) -> bool
fn has_non_region_bound_vars(&self) -> bool
§fn has_bound_vars(&self) -> bool
fn has_bound_vars(&self) -> bool
§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.§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>,
§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
§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.