pub struct RegionConstraintStorage<'tcx> {
var_infos: IndexVec<RegionVid, RegionVariableInfo>,
data: RegionConstraintData<'tcx>,
lubs: FxHashMap<TwoRegions<'tcx>, RegionVid>,
glbs: FxHashMap<TwoRegions<'tcx>, RegionVid>,
pub(super) unification_table: UnificationTableStorage<RegionVidKey<'tcx>>,
any_unifications: bool,
}
Fields§
§var_infos: IndexVec<RegionVid, RegionVariableInfo>
For each RegionVid
, the corresponding RegionVariableOrigin
.
data: RegionConstraintData<'tcx>
§lubs: FxHashMap<TwoRegions<'tcx>, RegionVid>
For a given pair of regions (R1, R2), maps to a region R3 that is designated as their LUB (edges R1 <= R3 and R2 <= R3 exist). This prevents us from making many such regions.
glbs: FxHashMap<TwoRegions<'tcx>, RegionVid>
For a given pair of regions (R1, R2), maps to a region R3 that is designated as their GLB (edges R3 <= R1 and R3 <= R2 exist). This prevents us from making many such regions.
unification_table: UnificationTableStorage<RegionVidKey<'tcx>>
When we add a R1 == R2 constraint, we currently add (a) edges
R1 <= R2 and R2 <= R1 and (b) we unify the two regions in this
table. You can then call opportunistic_resolve_var
early
which will map R1 and R2 to some common region (i.e., either
R1 or R2). This is important when fulfillment, dropck and other such
code is iterating to a fixed point, because otherwise we sometimes
would wind up with a fresh stream of region variables that have been
equated but appear distinct.
any_unifications: bool
a flag set to true when we perform any unifications; this is used
to micro-optimize take_and_reset_data
Implementations§
source§impl<'tcx> RegionConstraintStorage<'tcx>
impl<'tcx> RegionConstraintStorage<'tcx>
pub fn new() -> Self
pub(crate) fn with_log<'a>( &'a mut self, undo_log: &'a mut InferCtxtUndoLogs<'tcx>, ) -> RegionConstraintCollector<'a, 'tcx>
fn rollback_undo_entry(&mut self, undo_entry: UndoLog<'tcx>)
Trait Implementations§
source§impl<'tcx> Clone for RegionConstraintStorage<'tcx>
impl<'tcx> Clone for RegionConstraintStorage<'tcx>
source§fn clone(&self) -> RegionConstraintStorage<'tcx>
fn clone(&self) -> RegionConstraintStorage<'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'tcx> Default for RegionConstraintStorage<'tcx>
impl<'tcx> Default for RegionConstraintStorage<'tcx>
source§fn default() -> RegionConstraintStorage<'tcx>
fn default() -> RegionConstraintStorage<'tcx>
Auto Trait Implementations§
impl<'tcx> Freeze for RegionConstraintStorage<'tcx>
impl<'tcx> !RefUnwindSafe for RegionConstraintStorage<'tcx>
impl<'tcx> !Send for RegionConstraintStorage<'tcx>
impl<'tcx> !Sync for RegionConstraintStorage<'tcx>
impl<'tcx> Unpin for RegionConstraintStorage<'tcx>
impl<'tcx> !UnwindSafe for RegionConstraintStorage<'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> 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
)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<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: 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: 192 bytes