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§

Invokes each_edge(R1, R2) for each edge where R2: R1

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.

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