Struct rustc_infer::infer::region_constraints::leak_check::MiniGraph
source · struct MiniGraph<'tcx> {
nodes: FxIndexMap<Region<'tcx>, LeakCheckNode>,
sccs: Sccs<LeakCheckNode, LeakCheckScc>,
}
Expand description
Represents the graph of constraints. For each R1: R2
constraint we create
an edge R1 -> R2
in the graph.
Fields§
§nodes: FxIndexMap<Region<'tcx>, LeakCheckNode>
Map from a region to the index of the node in the graph.
sccs: Sccs<LeakCheckNode, LeakCheckScc>
Map from node index to SCC, and stores the successors of each SCC. All
the regions in the same SCC are equal to one another, and if S1 -> S2
,
then S1: S2
.
Implementations§
source§impl<'tcx> MiniGraph<'tcx>
impl<'tcx> MiniGraph<'tcx>
fn new<'a>(
tcx: TyCtxt<'tcx>,
undo_log: impl Iterator<Item = &'a UndoLog<'tcx>>,
verifys: &[Verify<'tcx>]
) -> Selfwhere
'tcx: 'a,
sourcefn iterate_undo_log<'a>(
tcx: TyCtxt<'tcx>,
undo_log: impl Iterator<Item = &'a UndoLog<'tcx>>,
verifys: &[Verify<'tcx>],
each_edge: impl FnMut(Region<'tcx>, Region<'tcx>)
)where
'tcx: 'a,
fn iterate_undo_log<'a>(
tcx: TyCtxt<'tcx>,
undo_log: impl Iterator<Item = &'a UndoLog<'tcx>>,
verifys: &[Verify<'tcx>],
each_edge: impl FnMut(Region<'tcx>, Region<'tcx>)
)where
'tcx: 'a,
Invokes each_edge(R1, R2)
for each edge where R2: R1
fn add_node(
nodes: &mut FxIndexMap<Region<'tcx>, LeakCheckNode>,
r: Region<'tcx>
) -> LeakCheckNode
Auto Trait Implementations§
impl<'tcx> RefUnwindSafe for MiniGraph<'tcx>
impl<'tcx> !Send for MiniGraph<'tcx>
impl<'tcx> !Sync for MiniGraph<'tcx>
impl<'tcx> Unpin for MiniGraph<'tcx>
impl<'tcx> UnwindSafe for MiniGraph<'tcx>
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: 128 bytes