pub(crate) struct RegionGraph<'s, 'tcx, D: ConstraintGraphDirection> {
    set: &'s OutlivesConstraintSet<'tcx>,
    constraint_graph: &'s ConstraintGraph<D>,
    static_region: RegionVid,
}
Expand description

This struct brings together a constraint set and a (normal, not reverse) constraint graph. It implements the graph traits and is usd for doing the SCC computation.

Fields§

§set: &'s OutlivesConstraintSet<'tcx>§constraint_graph: &'s ConstraintGraph<D>§static_region: RegionVid

Implementations§

source§

impl<'s, 'tcx, D: ConstraintGraphDirection> RegionGraph<'s, 'tcx, D>

source

pub(crate) fn new( set: &'s OutlivesConstraintSet<'tcx>, constraint_graph: &'s ConstraintGraph<D>, static_region: RegionVid ) -> Self

Creates a “dependency graph” where each region constraint R1: R2 is treated as an edge R1 -> R2. We use this graph to construct SCCs for region inference but also for error reporting.

source

pub(crate) fn outgoing_regions( &self, region_sup: RegionVid ) -> Successors<'s, 'tcx, D>

Given a region R, iterate over all regions R1 such that there exists a constraint R: R1.

Trait Implementations§

source§

impl<'s, 'tcx, D: ConstraintGraphDirection> DirectedGraph for RegionGraph<'s, 'tcx, D>

source§

impl<'s, 'tcx, D: ConstraintGraphDirection> GraphSuccessors<'_> for RegionGraph<'s, 'tcx, D>

§

type Item = RegionVid

§

type Iter = Successors<'s, 'tcx, D>

source§

impl<'s, 'tcx, D: ConstraintGraphDirection> WithNumNodes for RegionGraph<'s, 'tcx, D>

source§

impl<'s, 'tcx, D: ConstraintGraphDirection> WithSuccessors for RegionGraph<'s, 'tcx, D>

source§

fn successors(&self, node: Self::Node) -> <Self as GraphSuccessors<'_>>::Iter

Auto Trait Implementations§

§

impl<'s, 'tcx, D> !RefUnwindSafe for RegionGraph<'s, 'tcx, D>

§

impl<'s, 'tcx, D> !Send for RegionGraph<'s, 'tcx, D>

§

impl<'s, 'tcx, D> !Sync for RegionGraph<'s, 'tcx, D>

§

impl<'s, 'tcx, D> Unpin for RegionGraph<'s, 'tcx, D>

§

impl<'s, 'tcx, D> !UnwindSafe for RegionGraph<'s, 'tcx, D>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere 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, U> TryFrom<U> for Twhere U: Into<T>,

§

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 Twhere U: TryFrom<T>,

§

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.

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