Struct rustc_borrowck::constraints::graph::ConstraintGraph
source · pub(crate) struct ConstraintGraph<D: ConstraintGraphDirection> {
_direction: D,
first_constraints: IndexVec<RegionVid, Option<OutlivesConstraintIndex>>,
next_constraints: IndexVec<OutlivesConstraintIndex, Option<OutlivesConstraintIndex>>,
}
Expand description
The construct graph organizes the constraints by their end-points.
It can be used to view a R1: R2
constraint as either an edge R1 -> R2
or R2 -> R1
depending on the direction type D
.
Fields§
§_direction: D
§first_constraints: IndexVec<RegionVid, Option<OutlivesConstraintIndex>>
§next_constraints: IndexVec<OutlivesConstraintIndex, Option<OutlivesConstraintIndex>>
Implementations§
source§impl<D: ConstraintGraphDirection> ConstraintGraph<D>
impl<D: ConstraintGraphDirection> ConstraintGraph<D>
sourcepub(crate) fn new(
direction: D,
set: &OutlivesConstraintSet<'_>,
num_region_vars: usize
) -> Self
pub(crate) fn new( direction: D, set: &OutlivesConstraintSet<'_>, num_region_vars: usize ) -> 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 region_graph<'rg, 'tcx>(
&'rg self,
set: &'rg OutlivesConstraintSet<'tcx>,
static_region: RegionVid
) -> RegionGraph<'rg, 'tcx, D>
pub(crate) fn region_graph<'rg, 'tcx>( &'rg self, set: &'rg OutlivesConstraintSet<'tcx>, static_region: RegionVid ) -> RegionGraph<'rg, 'tcx, D>
Given the constraint set from which this graph was built creates a region graph so that you can iterate over regions and not constraints.
sourcepub(crate) fn outgoing_edges<'a, 'tcx>(
&'a self,
region_sup: RegionVid,
constraints: &'a OutlivesConstraintSet<'tcx>,
static_region: RegionVid
) -> Edges<'a, 'tcx, D> ⓘ
pub(crate) fn outgoing_edges<'a, 'tcx>( &'a self, region_sup: RegionVid, constraints: &'a OutlivesConstraintSet<'tcx>, static_region: RegionVid ) -> Edges<'a, 'tcx, D> ⓘ
Given a region R
, iterate over all constraints R: R1
.
Auto Trait Implementations§
impl<D> RefUnwindSafe for ConstraintGraph<D>where D: RefUnwindSafe,
impl<D> Send for ConstraintGraph<D>where D: Send,
impl<D> Sync for ConstraintGraph<D>where D: Sync,
impl<D> Unpin for ConstraintGraph<D>where D: Unpin,
impl<D> UnwindSafe for ConstraintGraph<D>where D: UnwindSafe,
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
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.