pub(crate) struct ConstraintConversion<'a, 'tcx> {
infcx: &'a InferCtxt<'tcx>,
universal_regions: &'a UniversalRegions<'tcx>,
region_bound_pairs: &'a RegionBoundPairs<'tcx>,
param_env: ParamEnv<'tcx>,
known_type_outlives_obligations: &'a [PolyTypeOutlivesPredicate<'tcx>],
locations: Locations,
span: Span,
category: ConstraintCategory<'tcx>,
from_closure: bool,
constraints: &'a mut MirTypeckRegionConstraints<'tcx>,
}
Fields§
§infcx: &'a InferCtxt<'tcx>
§universal_regions: &'a UniversalRegions<'tcx>
§region_bound_pairs: &'a RegionBoundPairs<'tcx>
Each RBP GK: 'a
is assumed to be true. These encode
relationships like T: 'a
that are added via implicit bounds
or the param_env
.
Each region here is guaranteed to be a key in the indices
map. We use the “original” regions (i.e., the keys from the
map, and not the values) because the code in
process_registered_region_obligations
has some special-cased
logic expecting to see (e.g.) ReStatic
, and if we supplied
our special inference variable there, we would mess that up.
param_env: ParamEnv<'tcx>
§known_type_outlives_obligations: &'a [PolyTypeOutlivesPredicate<'tcx>]
§locations: Locations
§span: Span
§category: ConstraintCategory<'tcx>
§from_closure: bool
§constraints: &'a mut MirTypeckRegionConstraints<'tcx>
Implementations§
Source§impl<'a, 'tcx> ConstraintConversion<'a, 'tcx>
impl<'a, 'tcx> ConstraintConversion<'a, 'tcx>
pub(crate) fn new( infcx: &'a InferCtxt<'tcx>, universal_regions: &'a UniversalRegions<'tcx>, region_bound_pairs: &'a RegionBoundPairs<'tcx>, param_env: ParamEnv<'tcx>, known_type_outlives_obligations: &'a [PolyTypeOutlivesPredicate<'tcx>], locations: Locations, span: Span, category: ConstraintCategory<'tcx>, constraints: &'a mut MirTypeckRegionConstraints<'tcx>, ) -> Self
pub(super) fn convert_all( &mut self, query_constraints: &QueryRegionConstraints<'tcx>, )
Sourcepub(crate) fn apply_closure_requirements(
&mut self,
closure_requirements: &ClosureRegionRequirements<'tcx>,
closure_def_id: LocalDefId,
closure_args: GenericArgsRef<'tcx>,
)
pub(crate) fn apply_closure_requirements( &mut self, closure_requirements: &ClosureRegionRequirements<'tcx>, closure_def_id: LocalDefId, closure_args: GenericArgsRef<'tcx>, )
Given an instance of the closure type, this method instantiates the “extra” requirements
that we computed for the closure. This has the effect of adding new outlives obligations
to existing region variables in closure_args
.
fn convert( &mut self, predicate: OutlivesPredicate<'tcx, GenericArg<'tcx>>, constraint_category: ConstraintCategory<'tcx>, )
Sourcefn replace_placeholders_with_nll<T: TypeFoldable<TyCtxt<'tcx>>>(
&mut self,
value: T,
) -> T
fn replace_placeholders_with_nll<T: TypeFoldable<TyCtxt<'tcx>>>( &mut self, value: T, ) -> T
Placeholder regions need to be converted eagerly because it may create new region variables, which we must not do when verifying our region bounds.
FIXME: This should get removed once higher ranked region obligations are dealt with during trait solving.
fn verify_to_type_test( &mut self, generic_kind: GenericKind<'tcx>, region: Region<'tcx>, verify_bound: VerifyBound<'tcx>, ) -> TypeTest<'tcx>
fn to_region_vid(&mut self, r: Region<'tcx>) -> RegionVid
fn add_outlives( &mut self, sup: RegionVid, sub: RegionVid, category: ConstraintCategory<'tcx>, )
fn add_type_test(&mut self, type_test: TypeTest<'tcx>)
fn normalize_and_add_type_outlives_constraints( &self, ty: Ty<'tcx>, next_outlives_predicates: &mut Vec<(OutlivesPredicate<'tcx, GenericArg<'tcx>>, ConstraintCategory<'tcx>)>, ) -> Ty<'tcx>
Trait Implementations§
Source§impl<'a, 'b, 'tcx> TypeOutlivesDelegate<'tcx> for &'a mut ConstraintConversion<'b, 'tcx>
impl<'a, 'b, 'tcx> TypeOutlivesDelegate<'tcx> for &'a mut ConstraintConversion<'b, 'tcx>
fn push_sub_region_constraint( &mut self, _origin: SubregionOrigin<'tcx>, a: Region<'tcx>, b: Region<'tcx>, constraint_category: ConstraintCategory<'tcx>, )
fn push_verify( &mut self, _origin: SubregionOrigin<'tcx>, kind: GenericKind<'tcx>, a: Region<'tcx>, bound: VerifyBound<'tcx>, )
Auto Trait Implementations§
impl<'a, 'tcx> !DynSend for ConstraintConversion<'a, 'tcx>
impl<'a, 'tcx> !DynSync for ConstraintConversion<'a, 'tcx>
impl<'a, 'tcx> Freeze for ConstraintConversion<'a, 'tcx>
impl<'a, 'tcx> !RefUnwindSafe for ConstraintConversion<'a, 'tcx>
impl<'a, 'tcx> !Send for ConstraintConversion<'a, 'tcx>
impl<'a, 'tcx> !Sync for ConstraintConversion<'a, 'tcx>
impl<'a, 'tcx> Unpin for ConstraintConversion<'a, 'tcx>
impl<'a, 'tcx> !UnwindSafe for ConstraintConversion<'a, '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> 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<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: 104 bytes