Struct RegionConstraintStorage

source

pub struct RegionConstraintStorage<'tcx> {
    pub(super) var_infos: IndexVec<RegionVid, RegionVariableInfo>,
    pub(super) 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

Struct RegionConstraintStorageCopy item path

Fields§

Implementations§

impl<'tcx> RegionConstraintStorage<'tcx>

pub(crate) fn with_log<'a>( &'a mut self, undo_log: &'a mut InferCtxtUndoLogs<'tcx>, ) -> RegionConstraintCollector<'a, 'tcx>

Trait Implementations§

impl<'tcx> Clone for RegionConstraintStorage<'tcx>

fn clone(&self) -> RegionConstraintStorage<'tcx>

fn clone_from(&mut self, source: &Self)

impl<'tcx> Default for RegionConstraintStorage<'tcx>

fn default() -> RegionConstraintStorage<'tcx>

impl<'tcx> Rollback<UndoLog<'tcx>> for RegionConstraintStorage<'tcx>

fn reverse(&mut self, undo: UndoLog<'tcx>)

Auto Trait Implementations§

impl<'tcx> DynSend for RegionConstraintStorage<'tcx>

impl<'tcx> DynSync for RegionConstraintStorage<'tcx>

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§

impl<T> Aligned for T

const ALIGN: Alignment = _

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CloneToUninit for Twhere T: Clone,

unsafe fn clone_to_uninit(&self, dst: *mut T)

impl<T, R> CollectAndApply<T, R> for T

fn collect_and_apply<I, F>(iter: I, f: F) -> Rwhere I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

type Output = R

impl<T> Filterable for T

fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where F: FnOnce(&Self) -> bool,

impl<P> IntoQueryParam<P> for P

fn into_query_param(self) -> P

impl<T> MaybeResult<T> for T

type Error = !

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

impl<T> Pointable for T

const ALIGN: usize = _

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> Same for T

type Output = T

impl<T> ToOwned for Twhere T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<I, T, U> Upcast<I, U> for Twhere U: UpcastFrom<I, T>,

fn upcast(self, interner: I) -> U

impl<I, T> UpcastFrom<I, T> for T

fn upcast_from(from: T, _tcx: I) -> T

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

fn vzip(self) -> V

impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,

Struct RegionConstraintStorage

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T> CloneToUninit for T
where T: Clone,

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

impl<T, U> Into<U> for T
where U: From<T>,

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

impl<T> ToOwned for T
where T: Clone,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

impl<'a, T> Captures<'a> for T
where T: ?Sized,

impl<T> ErasedDestructor for T
where T: 'static,

impl<T> MaybeSendSync for T
where T: Send + Sync,