pub struct Canonical<I, V>where
I: Interner,{
pub value: V,
pub max_universe: UniverseIndex,
pub defining_opaque_types: <I as Interner>::DefiningOpaqueTypes,
pub variables: <I as Interner>::CanonicalVars,
}
Expand description
A “canonicalized” type V
is one where all free inference
variables have been rewritten to “canonical vars”. These are
numbered starting from 0 in order of first appearance.
Fields§
§value: V
§max_universe: UniverseIndex
§defining_opaque_types: <I as Interner>::DefiningOpaqueTypes
§variables: <I as Interner>::CanonicalVars
Implementations§
source§impl<I, V> Canonical<I, V>where
I: Interner,
impl<I, V> Canonical<I, V>where
I: Interner,
sourcepub fn unchecked_map<W>(self, map_op: impl FnOnce(V) -> W) -> Canonical<I, W>
pub fn unchecked_map<W>(self, map_op: impl FnOnce(V) -> W) -> Canonical<I, W>
Allows you to map the value
of a canonical while keeping the
same set of bound variables.
WARNING: This function is very easy to mis-use, hence the
name! In particular, the new value W
must use all the
same type/region variables in precisely the same order
as the original! (The ordering is defined by the
TypeFoldable
implementation of the type in question.)
An example of a correct use of this:
let a: Canonical<I, T> = ...;
let b: Canonical<I, (T,)> = a.unchecked_map(|v| (v, ));
An example of an incorrect use of this:
let a: Canonical<I, T> = ...;
let ty: Ty<I> = ...;
let b: Canonical<I, (T, Ty<I>)> = a.unchecked_map(|v| (v, ty));
sourcepub fn unchecked_rebind<W>(self, value: W) -> Canonical<I, W>
pub fn unchecked_rebind<W>(self, value: W) -> Canonical<I, W>
Allows you to map the value
of a canonical while keeping the same set of
bound variables.
WARNING: This function is very easy to mis-use, hence the name! See the comment of Canonical::unchecked_map for more details.
Trait Implementations§
source§impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, ()>>
impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, ()>>
fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, ()>>
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, ()>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, ()>>]
source§impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Binder<TyCtxt<'tcx>, FnSig<TyCtxt<'tcx>>>>>
impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Binder<TyCtxt<'tcx>, FnSig<TyCtxt<'tcx>>>>>
fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Binder<TyCtxt<'tcx>, FnSig<TyCtxt<'tcx>>>>>
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Binder<TyCtxt<'tcx>, FnSig<TyCtxt<'tcx>>>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Binder<TyCtxt<'tcx>, FnSig<TyCtxt<'tcx>>>>>]
source§impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Clause<'tcx>>>
impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Clause<'tcx>>>
fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Clause<'tcx>>>
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Clause<'tcx>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Clause<'tcx>>>]
source§impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>
impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>
fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, DropckOutlivesResult<'tcx>>>]
source§impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, FnSig<TyCtxt<'tcx>>>>
impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, FnSig<TyCtxt<'tcx>>>>
fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, FnSig<TyCtxt<'tcx>>>>
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, FnSig<TyCtxt<'tcx>>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, FnSig<TyCtxt<'tcx>>>>]
source§impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, NormalizationResult<'tcx>>>
impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, NormalizationResult<'tcx>>>
fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, NormalizationResult<'tcx>>>
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, NormalizationResult<'tcx>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, NormalizationResult<'tcx>>>]
source§impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>
impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>
fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Ty<'tcx>>>]
source§impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>
impl<'tcx> ArenaAllocatable<'tcx> for Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>
fn allocate_on<'a>( self, arena: &'a Arena<'tcx>, ) -> &'a mut Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>>, ) -> &'a mut [Canonical<TyCtxt<'tcx>, QueryResponse<'tcx, Vec<OutlivesBound<'tcx>>>>]
source§impl<'tcx, V> CanonicalExt<'tcx, V> for Canonical<TyCtxt<'tcx>, V>
impl<'tcx, V> CanonicalExt<'tcx, V> for Canonical<TyCtxt<'tcx>, V>
source§fn instantiate(
&self,
tcx: TyCtxt<'tcx>,
var_values: &CanonicalVarValues<TyCtxt<'tcx>>,
) -> Vwhere
V: TypeFoldable<TyCtxt<'tcx>>,
fn instantiate(
&self,
tcx: TyCtxt<'tcx>,
var_values: &CanonicalVarValues<TyCtxt<'tcx>>,
) -> Vwhere
V: TypeFoldable<TyCtxt<'tcx>>,
Instantiate the wrapped value, replacing each canonical value
with the value given in var_values
.
source§fn instantiate_projected<T>(
&self,
tcx: TyCtxt<'tcx>,
var_values: &CanonicalVarValues<TyCtxt<'tcx>>,
projection_fn: impl FnOnce(&V) -> T,
) -> Twhere
T: TypeFoldable<TyCtxt<'tcx>>,
fn instantiate_projected<T>(
&self,
tcx: TyCtxt<'tcx>,
var_values: &CanonicalVarValues<TyCtxt<'tcx>>,
projection_fn: impl FnOnce(&V) -> T,
) -> Twhere
T: TypeFoldable<TyCtxt<'tcx>>,
Allows one to apply a instantiation to some subset of
self.value
. Invoke projection_fn
with self.value
to get
a value V that is expressed in terms of the same canonical
variables bound in self
(usually this extracts from subset
of self
). Apply the instantiation var_values
to this value
V, replacing each of the canonical variables.
source§impl<I, V, __D> Decodable<__D> for Canonical<I, V>where
I: Interner,
__D: TyDecoder<I = I>,
V: Decodable<__D>,
<I as Interner>::DefiningOpaqueTypes: Decodable<__D>,
<I as Interner>::CanonicalVars: Decodable<__D>,
impl<I, V, __D> Decodable<__D> for Canonical<I, V>where
I: Interner,
__D: TyDecoder<I = I>,
V: Decodable<__D>,
<I as Interner>::DefiningOpaqueTypes: Decodable<__D>,
<I as Interner>::CanonicalVars: Decodable<__D>,
source§impl<I, V, __E> Encodable<__E> for Canonical<I, V>where
I: Interner,
__E: TyEncoder<I = I>,
V: Encodable<__E>,
<I as Interner>::DefiningOpaqueTypes: Encodable<__E>,
<I as Interner>::CanonicalVars: Encodable<__E>,
impl<I, V, __E> Encodable<__E> for Canonical<I, V>where
I: Interner,
__E: TyEncoder<I = I>,
V: Encodable<__E>,
<I as Interner>::DefiningOpaqueTypes: Encodable<__E>,
<I as Interner>::CanonicalVars: Encodable<__E>,
source§impl<I, V, __CTX> HashStable<__CTX> for Canonical<I, V>where
I: Interner,
V: HashStable<__CTX>,
<I as Interner>::DefiningOpaqueTypes: HashStable<__CTX>,
<I as Interner>::CanonicalVars: HashStable<__CTX>,
impl<I, V, __CTX> HashStable<__CTX> for Canonical<I, V>where
I: Interner,
V: HashStable<__CTX>,
<I as Interner>::DefiningOpaqueTypes: HashStable<__CTX>,
<I as Interner>::CanonicalVars: HashStable<__CTX>,
fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )
source§impl<'tcx> IsIdentity for Canonical<TyCtxt<'tcx>, UserType<'tcx>>
impl<'tcx> IsIdentity for Canonical<TyCtxt<'tcx>, UserType<'tcx>>
source§fn is_identity(&self) -> bool
fn is_identity(&self) -> bool
Returns true
if this represents the generic parameters of the form [?0, ?1, ?2]
,
i.e., each thing is mapped to a canonical variable with the same index.
source§impl<'tcx, T> Key for Canonical<TyCtxt<'tcx>, T>where
T: Clone,
impl<'tcx, T> Key for Canonical<TyCtxt<'tcx>, T>where
T: Clone,
Canonical query goals correspond to abstract trait operations that are not tied to any crate in particular.
type Cache<V> = DefaultCache<Canonical<TyCtxt<'tcx>, T>, V>
source§fn default_span(&self, _tcx: TyCtxt<'_>) -> Span
fn default_span(&self, _tcx: TyCtxt<'_>) -> Span
self
, what span should we use?source§fn key_as_def_id(&self) -> Option<DefId>
fn key_as_def_id(&self) -> Option<DefId>
fn ty_def_id(&self) -> Option<DefId>
source§impl<I, V> PartialEq for Canonical<I, V>
impl<I, V> PartialEq for Canonical<I, V>
source§impl<I, V> TypeFoldable<I> for Canonical<I, V>where
I: Interner,
V: TypeFoldable<I>,
<I as Interner>::DefiningOpaqueTypes: TypeFoldable<I>,
<I as Interner>::CanonicalVars: TypeFoldable<I>,
impl<I, V> TypeFoldable<I> for Canonical<I, V>where
I: Interner,
V: TypeFoldable<I>,
<I as Interner>::DefiningOpaqueTypes: TypeFoldable<I>,
<I as Interner>::CanonicalVars: TypeFoldable<I>,
source§fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<Canonical<I, V>, <__F as FallibleTypeFolder<I>>::Error>where
__F: FallibleTypeFolder<I>,
fn try_fold_with<__F>(
self,
__folder: &mut __F,
) -> Result<Canonical<I, V>, <__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, V> TypeVisitable<I> for Canonical<I, V>where
I: Interner,
V: TypeVisitable<I>,
<I as Interner>::DefiningOpaqueTypes: TypeVisitable<I>,
<I as Interner>::CanonicalVars: TypeVisitable<I>,
impl<I, V> TypeVisitable<I> for Canonical<I, V>where
I: Interner,
V: TypeVisitable<I>,
<I as Interner>::DefiningOpaqueTypes: TypeVisitable<I>,
<I as Interner>::CanonicalVars: TypeVisitable<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, V> Copy for Canonical<I, V>
impl<I, V> Eq for Canonical<I, V>
Auto Trait Implementations§
impl<I, V> Freeze for Canonical<I, V>where
V: Freeze,
<I as Interner>::DefiningOpaqueTypes: Freeze,
<I as Interner>::CanonicalVars: Freeze,
impl<I, V> RefUnwindSafe for Canonical<I, V>where
V: RefUnwindSafe,
<I as Interner>::DefiningOpaqueTypes: RefUnwindSafe,
<I as Interner>::CanonicalVars: RefUnwindSafe,
impl<I, V> Send for Canonical<I, V>
impl<I, V> Sync for Canonical<I, V>
impl<I, V> Unpin for Canonical<I, V>
impl<I, V> UnwindSafe for Canonical<I, V>where
V: UnwindSafe,
<I as Interner>::DefiningOpaqueTypes: UnwindSafe,
<I as Interner>::CanonicalVars: UnwindSafe,
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> 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> CloneToUninit for Twhere
T: Copy,
impl<T> CloneToUninit for Twhere
T: Copy,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)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
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<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_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<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.