@@ -190,7 +190,7 @@ impl<'s, 'tcx, D: ConstraintGraphDirecton> RegionGraph<'s, 'tcx, D> {
190190
191191 /// Given a region `R`, iterate over all regions `R1` such that
192192 /// there exists a constraint `R: R1`.
193- crate fn outgoing_regions ( & self , region_sup : RegionVid ) -> Successors < ' _ , ' tcx , D > {
193+ crate fn outgoing_regions ( & self , region_sup : RegionVid ) -> Successors < ' s , ' tcx , D > {
194194 Successors {
195195 edges : self . constraint_graph . outgoing_edges ( region_sup, self . set , self . static_region ) ,
196196 }
@@ -225,10 +225,7 @@ impl<'s, 'tcx, D: ConstraintGraphDirecton> graph::WithSuccessors for RegionGraph
225225 }
226226}
227227
228- impl < ' s , ' graph , ' tcx , D : ConstraintGraphDirecton > graph:: GraphSuccessors < ' graph >
229- for RegionGraph < ' s , ' tcx , D >
230- {
228+ impl < ' s , ' tcx , D : ConstraintGraphDirecton > graph:: GraphSuccessors < ' _ > for RegionGraph < ' s , ' tcx , D > {
231229 type Item = RegionVid ;
232- // FIXME - why can't this be `'graph, 'tcx`
233- type Iter = Successors < ' graph , ' graph , D > ;
230+ type Iter = Successors < ' s , ' tcx , D > ;
234231}
0 commit comments