Struct rustc_borrowck::constraints::graph::RegionGraph
source · 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>
impl<'s, 'tcx, D: ConstraintGraphDirection> RegionGraph<'s, 'tcx, D>
sourcepub(crate) fn new(
set: &'s OutlivesConstraintSet<'tcx>,
constraint_graph: &'s ConstraintGraph<D>,
static_region: RegionVid,
) -> Self
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.
sourcepub(crate) fn outgoing_regions(
&self,
region_sup: RegionVid,
) -> Successors<'s, 'tcx, D> ⓘ
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>
impl<'s, 'tcx, D: ConstraintGraphDirection> DirectedGraph for RegionGraph<'s, 'tcx, D>
source§impl<'s, 'tcx, D: ConstraintGraphDirection> Successors for RegionGraph<'s, 'tcx, D>
impl<'s, 'tcx, D: ConstraintGraphDirection> Successors for RegionGraph<'s, 'tcx, D>
Auto Trait Implementations§
impl<'s, 'tcx, D> Freeze for RegionGraph<'s, 'tcx, D>
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> 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
Mutably borrows from an owned value. Read more
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>
Creates a filterable data provider with the given name for debugging. Read more
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>
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 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>
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 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: 24 bytes