@@ -182,10 +182,9 @@ struct SpansRefiner {
182
182
/// dominance between the `BasicCoverageBlock`s of equal `Span`s.
183
183
sorted_spans_iter : std:: vec:: IntoIter < SpanFromMir > ,
184
184
185
- /// The current coverage span to compare to its `prev`, to possibly merge, discard, force the
186
- /// discard of the `prev` (and or `pending_dups`), or keep both (with `prev` moved to
187
- /// `pending_dups`). If `curr` is not discarded or merged, it becomes `prev` for the next
188
- /// iteration.
185
+ /// The current coverage span to compare to its `prev`, to possibly merge, discard,
186
+ /// or cause `prev` to be modified or discarded.
187
+ /// If `curr` is not discarded or merged, it becomes `prev` for the next iteration.
189
188
some_curr : Option < CurrCovspan > ,
190
189
191
190
/// The coverage span from a prior iteration; typically assigned from that iteration's `curr`.
@@ -332,8 +331,7 @@ impl SpansRefiner {
332
331
/// If `prev`s span extends left of the closure (`curr`), carve out the closure's span from
333
332
/// `prev`'s span. (The closure's coverage counters will be injected when processing the
334
333
/// closure's own MIR.) Add the portion of the span to the left of the closure; and if the span
335
- /// extends to the right of the closure, update `prev` to that portion of the span. For any
336
- /// `pending_dups`, repeat the same process.
334
+ /// extends to the right of the closure, update `prev` to that portion of the span.
337
335
fn carve_out_span_for_closure ( & mut self ) {
338
336
let prev = self . prev ( ) ;
339
337
let curr = self . curr ( ) ;
0 commit comments