Struct rustc_borrowck::constraints::graph::RegionGraph

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

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

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

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.

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

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

type Node = RegionVid

fn num_nodes(&self) -> usize

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

fn successors(&self, node: Self::Node) -> impl Iterator<Item = Self::Node>

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