Struct rustc_mir::borrow_check::constraints::graph::RegionGraph

pub(crate) struct RegionGraph<'s, D: ConstraintGraphDirecton> {
    set: &'s OutlivesConstraintSet,
    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

constraint_graph: &'s ConstraintGraph<D>

static_region: RegionVid

Implementations

impl<'s, D: ConstraintGraphDirecton> RegionGraph<'s, D>

pub(crate) fn new(
    set: &'s OutlivesConstraintSet,
    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<'_, D>

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

Trait Implementations

impl<'s, D: ConstraintGraphDirecton> DirectedGraph for RegionGraph<'s, D>

type Node = RegionVid

impl<'s, 'graph, D: ConstraintGraphDirecton> GraphSuccessors<'graph> for RegionGraph<'s, D>

type Item = RegionVid

type Iter = Successors<'graph, D>

impl<'s, D: ConstraintGraphDirecton> WithNumNodes for RegionGraph<'s, D>

fn num_nodes(&self) -> usize

impl<'s, D: ConstraintGraphDirecton> WithSuccessors for RegionGraph<'s, D>

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

fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self> where
    Self: WithNumNodes,