Struct rustc_borrowck::constraints::graph::RegionGraph
source · pub(crate) struct RegionGraph<'s, 'tcx, D: ConstraintGraphDirecton> {
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: RegionVidImplementations§
source§impl<'s, 'tcx, D: ConstraintGraphDirecton> RegionGraph<'s, 'tcx, D>
impl<'s, 'tcx, D: ConstraintGraphDirecton> 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: ConstraintGraphDirecton> DirectedGraph for RegionGraph<'s, 'tcx, D>
impl<'s, 'tcx, D: ConstraintGraphDirecton> DirectedGraph for RegionGraph<'s, 'tcx, D>
source§impl<'s, 'tcx, D: ConstraintGraphDirecton> GraphSuccessors<'_> for RegionGraph<'s, 'tcx, D>
impl<'s, 'tcx, D: ConstraintGraphDirecton> GraphSuccessors<'_> for RegionGraph<'s, 'tcx, D>
source§impl<'s, 'tcx, D: ConstraintGraphDirecton> WithNumNodes for RegionGraph<'s, 'tcx, D>
impl<'s, 'tcx, D: ConstraintGraphDirecton> WithNumNodes for RegionGraph<'s, 'tcx, D>
source§impl<'s, 'tcx, D: ConstraintGraphDirecton> WithSuccessors for RegionGraph<'s, 'tcx, D>
impl<'s, 'tcx, D: ConstraintGraphDirecton> WithSuccessors for RegionGraph<'s, 'tcx, D>
fn successors(&self, node: Self::Node) -> <Self as GraphSuccessors<'_>>::Iter
fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self>where
Self: WithNumNodes,
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>where
'tcx: 's,
impl<'s, 'tcx, D> !UnwindSafe for RegionGraph<'s, 'tcx, D>
Blanket Implementations§
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