@@ -58,7 +58,7 @@ pub struct RegionInferenceContext<'tcx> {
58
58
/// regions, these start out empty and steadily grow, though for
59
59
/// each universally quantified region R they start out containing
60
60
/// the entire CFG and `end(R)`.
61
- liveness_constraints : LivenessValues < RegionVid > ,
61
+ pub ( crate ) liveness_constraints : LivenessValues < RegionVid > ,
62
62
63
63
/// The outlives constraints computed by the type-check.
64
64
constraints : Frozen < OutlivesConstraintSet < ' tcx > > ,
@@ -71,15 +71,15 @@ pub struct RegionInferenceContext<'tcx> {
71
71
/// The SCC computed from `constraints` and the constraint
72
72
/// graph. We have an edge from SCC A to SCC B if `A: B`. Used to
73
73
/// compute the values of each region.
74
- constraint_sccs : Rc < Sccs < RegionVid , ConstraintSccIndex > > ,
74
+ pub ( crate ) constraint_sccs : Rc < Sccs < RegionVid , ConstraintSccIndex > > ,
75
75
76
76
/// Reverse of the SCC constraint graph -- i.e., an edge `A -> B` exists if
77
77
/// `B: A`. This is used to compute the universal regions that are required
78
78
/// to outlive a given SCC. Computed lazily.
79
79
rev_scc_graph : Option < ReverseSccGraph > ,
80
80
81
81
/// The "R0 member of [R1..Rn]" constraints, indexed by SCC.
82
- member_constraints : Rc < MemberConstraintSet < ' tcx , ConstraintSccIndex > > ,
82
+ pub ( crate ) member_constraints : Rc < MemberConstraintSet < ' tcx , ConstraintSccIndex > > ,
83
83
84
84
/// Records the member constraints that we applied to each scc.
85
85
/// This is useful for error reporting. Once constraint
0 commit comments