struct NllTypeRelating<'a, 'b, 'tcx> {
type_checker: &'a mut TypeChecker<'b, 'tcx>,
locations: Locations,
category: ConstraintCategory<'tcx>,
universe_info: UniverseInfo<'tcx>,
ambient_variance: Variance,
ambient_variance_info: VarianceDiagInfo<TyCtxt<'tcx>>,
}Fields§
§type_checker: &'a mut TypeChecker<'b, 'tcx>§locations: LocationsWhere (and why) is this relation taking place?
category: ConstraintCategory<'tcx>What category do we assign the resulting 'a: 'b relationships?
universe_info: UniverseInfo<'tcx>Information so that error reporting knows what types we are relating when reporting a bound region error.
ambient_variance: VarianceHow are we relating a and b?
- Covariant means
a <: b. - Contravariant means
b <: a. - Invariant means
a == b. - Bivariant means that it doesn’t matter.
ambient_variance_info: VarianceDiagInfo<TyCtxt<'tcx>>Implementations§
Source§impl<'a, 'b, 'tcx> NllTypeRelating<'a, 'b, 'tcx>
impl<'a, 'b, 'tcx> NllTypeRelating<'a, 'b, 'tcx>
fn new( type_checker: &'a mut TypeChecker<'b, 'tcx>, locations: Locations, category: ConstraintCategory<'tcx>, universe_info: UniverseInfo<'tcx>, ambient_variance: Variance, ) -> Self
fn ambient_covariance(&self) -> bool
fn ambient_contravariance(&self) -> bool
fn relate_opaques(&mut self, a: Ty<'tcx>, b: Ty<'tcx>) -> RelateResult<'tcx, ()>
fn enter_forall<T, U>( &mut self, binder: Binder<'tcx, T>, f: impl FnOnce(&mut Self, T) -> U, ) -> U
fn instantiate_binder_with_existentials<T>( &mut self, binder: Binder<'tcx, T>, ) -> T
fn create_next_universe(&mut self) -> UniverseIndex
fn next_existential_region_var(&mut self, name: Option<Symbol>) -> Region<'tcx>
fn next_placeholder_region( &mut self, placeholder: PlaceholderRegion<'tcx>, ) -> Region<'tcx>
fn push_outlives( &mut self, sup: Region<'tcx>, sub: Region<'tcx>, info: VarianceDiagInfo<TyCtxt<'tcx>>, )
Trait Implementations§
Source§impl<'b, 'tcx> PredicateEmittingRelation<InferCtxt<'tcx>> for NllTypeRelating<'_, 'b, 'tcx>
impl<'b, 'tcx> PredicateEmittingRelation<InferCtxt<'tcx>> for NllTypeRelating<'_, 'b, 'tcx>
fn span(&self) -> Span
Source§fn structurally_relate_aliases(&self) -> StructurallyRelateAliases
fn structurally_relate_aliases(&self) -> StructurallyRelateAliases
Whether aliases should be related structurally. This is pretty much
always
No unless you’re equating in some specific locations of the
new solver. See the comments in these use-cases for more details.fn param_env(&self) -> ParamEnv<'tcx>
Source§fn register_predicates(
&mut self,
obligations: impl IntoIterator<Item: Upcast<TyCtxt<'tcx>, Predicate<'tcx>>>,
)
fn register_predicates( &mut self, obligations: impl IntoIterator<Item: Upcast<TyCtxt<'tcx>, Predicate<'tcx>>>, )
Register predicates that must hold in order for this relation to hold.
This uses the default
param_env of the obligation.Source§fn register_goals(
&mut self,
obligations: impl IntoIterator<Item = Goal<'tcx, Predicate<'tcx>>>,
)
fn register_goals( &mut self, obligations: impl IntoIterator<Item = Goal<'tcx, Predicate<'tcx>>>, )
Register obligations that must hold in order for this relation to hold
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>)
Register
AliasRelate obligation(s) that both types must be related to each other.Source§impl<'b, 'tcx> TypeRelation<TyCtxt<'tcx>> for NllTypeRelating<'_, 'b, 'tcx>
impl<'b, 'tcx> TypeRelation<TyCtxt<'tcx>> for NllTypeRelating<'_, 'b, 'tcx>
fn cx(&self) -> TyCtxt<'tcx>
fn relate_ty_args( &mut self, a_ty: Ty<'tcx>, b_ty: Ty<'tcx>, def_id: DefId, a_args: GenericArgsRef<'tcx>, b_args: GenericArgsRef<'tcx>, _: impl FnOnce(GenericArgsRef<'tcx>) -> Ty<'tcx>, ) -> RelateResult<'tcx, Ty<'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>
Switch variance for the purpose of relating
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<'a, 'b, 'tcx> !DynSend for NllTypeRelating<'a, 'b, 'tcx>
impl<'a, 'b, 'tcx> !DynSync for NllTypeRelating<'a, 'b, 'tcx>
impl<'a, 'b, 'tcx> Freeze for NllTypeRelating<'a, 'b, 'tcx>
impl<'a, 'b, 'tcx> !RefUnwindSafe for NllTypeRelating<'a, 'b, 'tcx>
impl<'a, 'b, 'tcx> !Send for NllTypeRelating<'a, 'b, 'tcx>
impl<'a, 'b, 'tcx> !Sync for NllTypeRelating<'a, 'b, 'tcx>
impl<'a, 'b, 'tcx> Unpin for NllTypeRelating<'a, 'b, 'tcx>
impl<'a, 'b, 'tcx> UnsafeUnpin for NllTypeRelating<'a, 'b, 'tcx>
impl<'a, 'b, 'tcx> !UnwindSafe for NllTypeRelating<'a, 'b, '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
Mutably borrows from an owned value. Read more
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>
Converts
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>
Converts
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<K> IntoQueryKey<K> for K
impl<K> IntoQueryKey<K> for K
Source§fn into_query_key(self) -> K
fn into_query_key(self) -> K
Argument conversion from
Self to K.
This should always be a very cheap conversion, e.g. LocalDefId::to_def_id.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<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: 88 bytes