@@ -104,7 +104,7 @@ struct DivergenceVisitor<'a, 'tcx: 'a> {
104
104
impl < ' a , ' tcx > DivergenceVisitor < ' a , ' tcx > {
105
105
fn maybe_walk_expr ( & mut self , e : & ' tcx Expr ) {
106
106
match e. node {
107
- ExprClosure ( ..) => { } ,
107
+ ExprClosure ( .., _ ) => { } ,
108
108
ExprMatch ( ref e, ref arms, _) => {
109
109
self . visit_expr ( e) ;
110
110
for arm in arms {
@@ -239,7 +239,7 @@ fn check_expr<'a, 'tcx>(vis: &mut ReadVisitor<'a, 'tcx>, expr: &'tcx Expr) -> St
239
239
walk_expr ( vis, expr) ;
240
240
}
241
241
} ,
242
- ExprClosure ( _, _, _, _) => {
242
+ ExprClosure ( _, _, _, _, _ ) => {
243
243
// Either
244
244
//
245
245
// * `var` is defined in the closure body, in which case we've
@@ -323,7 +323,7 @@ impl<'a, 'tcx> Visitor<'tcx> for ReadVisitor<'a, 'tcx> {
323
323
// We're about to descend a closure. Since we don't know when (or
324
324
// if) the closure will be evaluated, any reads in it might not
325
325
// occur here (or ever). Like above, bail to avoid false positives.
326
- ExprClosure ( _, _, _, _) |
326
+ ExprClosure ( _, _, _, _, _ ) |
327
327
328
328
// We want to avoid a false positive when a variable name occurs
329
329
// only to have its address taken, so we stop here. Technically,
0 commit comments