pub(crate) struct TypeRelating<'infcx, 'tcx> {
infcx: &'infcx InferCtxt<'tcx>,
trace: TypeTrace<'tcx>,
param_env: ParamEnv<'tcx>,
define_opaque_types: DefineOpaqueTypes,
ambient_variance: Variance,
obligations: PredicateObligations<'tcx>,
cache: DelayedSet<(Variance, Ty<'tcx>, Ty<'tcx>)>,
}Expand description
Enforce that a is equal to or a subtype of b.
Fields§
§infcx: &'infcx InferCtxt<'tcx>§trace: TypeTrace<'tcx>§param_env: ParamEnv<'tcx>§define_opaque_types: DefineOpaqueTypes§ambient_variance: Variance§obligations: PredicateObligations<'tcx>§cache: DelayedSet<(Variance, Ty<'tcx>, Ty<'tcx>)>The cache only tracks the ambient_variance as it’s the
only field which is mutable and which meaningfully changes
the result when relating types.
The cache does not track whether the state of the
InferCtxt has been changed or whether we’ve added any
obligations to self.goals. Whether a goal is added
once or multiple times is not really meaningful.
Changes in the inference state may delay some type inference to the next fulfillment loop. Given that this loop is already necessary, this is also not a meaningful change. Consider the following three relations:
Vec<?0> sub Vec<?1>
?0 eq u32
Vec<?0> sub Vec<?1>Without a cache, the second Vec<?0> sub Vec<?1> would eagerly
constrain ?1 to u32. When using the cache entry from the
first time we’ve related these types, this only happens when
later proving the Subtype(?0, ?1) goal from the first relation.
Implementations§
Source§impl<'infcx, 'tcx> TypeRelating<'infcx, 'tcx>
impl<'infcx, 'tcx> TypeRelating<'infcx, 'tcx>
pub(crate) fn new( infcx: &'infcx InferCtxt<'tcx>, trace: TypeTrace<'tcx>, param_env: ParamEnv<'tcx>, define_opaque_types: DefineOpaqueTypes, ambient_variance: Variance, ) -> TypeRelating<'infcx, 'tcx>
pub(crate) fn into_obligations(self) -> PredicateObligations<'tcx>
Trait Implementations§
Source§impl<'tcx> PredicateEmittingRelation<InferCtxt<'tcx>> for TypeRelating<'_, 'tcx>
impl<'tcx> PredicateEmittingRelation<InferCtxt<'tcx>> for TypeRelating<'_, 'tcx>
fn span(&self) -> Span
fn param_env(&self) -> ParamEnv<'tcx>
Source§fn structurally_relate_aliases(&self) -> StructurallyRelateAliases
fn structurally_relate_aliases(&self) -> StructurallyRelateAliases
No unless you’re equating in some specific locations of the
new solver. See the comments in these use-cases for more details.Source§fn register_predicates(
&mut self,
preds: impl IntoIterator<Item: Upcast<TyCtxt<'tcx>, Predicate<'tcx>>>,
)
fn register_predicates( &mut self, preds: impl IntoIterator<Item: Upcast<TyCtxt<'tcx>, Predicate<'tcx>>>, )
param_env of the obligation.Source§fn register_goals(
&mut self,
goals: impl IntoIterator<Item = Goal<'tcx, Predicate<'tcx>>>,
)
fn register_goals( &mut self, goals: impl IntoIterator<Item = Goal<'tcx, Predicate<'tcx>>>, )
Source§fn register_alias_relate_predicate(&mut self, a: Ty<'tcx>, b: Ty<'tcx>)
fn register_alias_relate_predicate(&mut self, a: Ty<'tcx>, b: Ty<'tcx>)
AliasRelate obligation(s) that both types must be related to each other.Source§impl<'tcx> TypeRelation<TyCtxt<'tcx>> for TypeRelating<'_, 'tcx>
impl<'tcx> TypeRelation<TyCtxt<'tcx>> for TypeRelating<'_, 'tcx>
fn cx(&self) -> TyCtxt<'tcx>
Source§fn relate_item_args(
&mut self,
item_def_id: DefId,
a_arg: GenericArgsRef<'tcx>,
b_arg: GenericArgsRef<'tcx>,
) -> RelateResult<'tcx, GenericArgsRef<'tcx>>
fn relate_item_args( &mut self, item_def_id: DefId, a_arg: GenericArgsRef<'tcx>, b_arg: GenericArgsRef<'tcx>, ) -> RelateResult<'tcx, GenericArgsRef<'tcx>>
Source§fn relate_with_variance<T: Relate<TyCtxt<'tcx>>>(
&mut self,
variance: Variance,
_info: VarianceDiagInfo<TyCtxt<'tcx>>,
a: T,
b: T,
) -> RelateResult<'tcx, T>
fn relate_with_variance<T: Relate<TyCtxt<'tcx>>>( &mut self, variance: Variance, _info: VarianceDiagInfo<TyCtxt<'tcx>>, a: T, b: T, ) -> RelateResult<'tcx, T>
a and b.fn tys(&mut self, a: Ty<'tcx>, b: Ty<'tcx>) -> RelateResult<'tcx, Ty<'tcx>>
fn regions( &mut self, a: Region<'tcx>, b: Region<'tcx>, ) -> RelateResult<'tcx, Region<'tcx>>
fn consts( &mut self, a: Const<'tcx>, b: Const<'tcx>, ) -> RelateResult<'tcx, Const<'tcx>>
fn binders<T>( &mut self, a: Binder<'tcx, T>, b: Binder<'tcx, T>, ) -> RelateResult<'tcx, Binder<'tcx, T>>
Auto Trait Implementations§
impl<'infcx, 'tcx> !DynSend for TypeRelating<'infcx, 'tcx>
impl<'infcx, 'tcx> !DynSync for TypeRelating<'infcx, 'tcx>
impl<'infcx, 'tcx> Freeze for TypeRelating<'infcx, 'tcx>
impl<'infcx, 'tcx> !RefUnwindSafe for TypeRelating<'infcx, 'tcx>
impl<'infcx, 'tcx> !Send for TypeRelating<'infcx, 'tcx>
impl<'infcx, 'tcx> !Sync for TypeRelating<'infcx, 'tcx>
impl<'infcx, 'tcx> Unpin for TypeRelating<'infcx, 'tcx>
impl<'infcx, 'tcx> !UnwindSafe for TypeRelating<'infcx, 'tcx>
Blanket Implementations§
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<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<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, 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<T> ErasedDestructor for Twhere
T: 'static,
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: 160 bytes