pub(crate) struct OutlivesConstraintSet<'tcx> {
    outlives: IndexVec<OutlivesConstraintIndex, OutlivesConstraint<'tcx>>,
}
Expand description

A set of NLL region constraints. These include “outlives” constraints of the form R1: R2. Each constraint is identified by a unique OutlivesConstraintIndex and you can index into the set (constraint_set[i]) to access the constraint details.

Fields§

§outlives: IndexVec<OutlivesConstraintIndex, OutlivesConstraint<'tcx>>

Implementations§

source§

impl<'tcx> OutlivesConstraintSet<'tcx>

source

pub(crate) fn push(&mut self, constraint: OutlivesConstraint<'tcx>)

source

pub(crate) fn graph(&self, num_region_vars: usize) -> ConstraintGraph<Normal>

Constructs a “normal” graph from the constraint set; the graph makes it easy to find the constraints affecting a particular region.

N.B., this graph contains a “frozen” view of the current constraints. Any new constraints added to the OutlivesConstraintSet after the graph is built will not be present in the graph.

source

pub(crate) fn reverse_graph( &self, num_region_vars: usize, ) -> ConstraintGraph<Reverse>

Like graph, but constraints a reverse graph where R1: R2 represents an edge R2 -> R1.

source

pub(crate) fn outlives( &self, ) -> &IndexSlice<OutlivesConstraintIndex, OutlivesConstraint<'tcx>>

source

pub(crate) fn compute_sccs( &self, static_region: RegionVid, definitions: &IndexVec<RegionVid, RegionDefinition<'tcx>>, ) -> Sccs<RegionVid, ConstraintSccIndex, RegionTracker>

Computes cycles (SCCs) in the graph of regions. In particular, find all regions R1, R2 such that R1: R2 and R2: R1 and group them into an SCC, and find the relationships between SCCs.

source

pub(crate) fn add_outlives_static( &mut self, universal_regions: &UniversalRegions<'tcx>, definitions: &IndexVec<RegionVid, RegionDefinition<'tcx>>, ) -> Sccs<RegionVid, ConstraintSccIndex, RegionTracker>

This method handles Universe errors by rewriting the constraint graph. For each strongly connected component in the constraint graph such that there is a series of constraints A: B: C: … : X where A’s universe is smaller than X’s and A is a placeholder, add a constraint that A: ’static. This is a safe upper bound in the face of borrow checker/trait solver limitations that will eventually go away.

For a more precise definition, see the documentation for RegionTracker::has_incompatible_universes().

This edge case used to be handled during constraint propagation by iterating over the strongly connected components in the constraint graph while maintaining a set of bookkeeping mappings similar to what is stored in RegionTracker and manually adding ’sttaic as needed.

It was rewritten as part of the Polonius project with the goal of moving higher-kindedness concerns out of the path of the borrow checker, for two reasons:

  1. Implementing Polonius is difficult enough without also handling them.
  2. The long-term goal is to handle higher-kinded concerns in the trait solver, where they belong. This avoids logic duplication and allows future trait solvers to compute better bounds than for example our “must outlive ’static” here.

This code is a stop-gap measure in preparation for the future trait solver.

Every constraint added by this method is an internal IllegalUniverse constraint.

Trait Implementations§

source§

impl<'tcx> Clone for OutlivesConstraintSet<'tcx>

source§

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

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<'tcx> Debug for OutlivesConstraintSet<'tcx>

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl<'tcx> Default for OutlivesConstraintSet<'tcx>

source§

fn default() -> OutlivesConstraintSet<'tcx>

Returns the “default value” for a type. Read more
source§

impl<'tcx> Index<OutlivesConstraintIndex> for OutlivesConstraintSet<'tcx>

source§

type Output = OutlivesConstraint<'tcx>

The returned type after indexing.
source§

fn index(&self, i: OutlivesConstraintIndex) -> &Self::Output

Performs the indexing (container[index]) operation. Read more

Auto Trait Implementations§

§

impl<'tcx> Freeze for OutlivesConstraintSet<'tcx>

§

impl<'tcx> !RefUnwindSafe for OutlivesConstraintSet<'tcx>

§

impl<'tcx> !Send for OutlivesConstraintSet<'tcx>

§

impl<'tcx> !Sync for OutlivesConstraintSet<'tcx>

§

impl<'tcx> Unpin for OutlivesConstraintSet<'tcx>

§

impl<'tcx> !UnwindSafe for OutlivesConstraintSet<'tcx>

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

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

source§

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

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

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

source§

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

Equivalent to f(&iter.collect::<Vec<_>>()).

source§

type Output = R

source§

impl<T> Filterable for T

source§

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

Creates a filterable data provider with the given name for debugging. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

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

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

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

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

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 more
source§

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

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 more
source§

impl<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

source§

type Error = !

source§

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

source§

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

source§

impl<T> Same for T

source§

type Output = T

Should always be Self
source§

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

source§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

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

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

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

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

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

source§

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

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

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

source§

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

source§

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

source§

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

source§

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

source§

fn vzip(self) -> V

source§

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

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T

source§

impl<T> WithSubscriber for T

source§

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

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

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

source§

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

source§

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: 24 bytes