@@ -121,7 +121,7 @@ fn remove_all_parens(pat: &mut P<Pat>) {
121
121
struct Visitor ;
122
122
impl MutVisitor for Visitor {
123
123
fn visit_pat ( & mut self , pat : & mut P < Pat > ) {
124
- walk_pat ( pat , self ) ;
124
+ walk_pat ( self , pat ) ;
125
125
let inner = match & mut pat. kind {
126
126
Paren ( i) => mem:: replace ( & mut i. kind , Wild ) ,
127
127
_ => return ,
@@ -138,7 +138,7 @@ fn insert_necessary_parens(pat: &mut P<Pat>) {
138
138
impl MutVisitor for Visitor {
139
139
fn visit_pat ( & mut self , pat : & mut P < Pat > ) {
140
140
use ast:: BindingMode ;
141
- walk_pat ( pat , self ) ;
141
+ walk_pat ( self , pat ) ;
142
142
let target = match & mut pat. kind {
143
143
// `i @ a | b`, `box a | b`, and `& mut? a | b`.
144
144
Ident ( .., Some ( p) ) | Box ( p) | Ref ( p, _) if matches ! ( & p. kind, Or ( ps) if ps. len( ) > 1 ) => p,
@@ -160,7 +160,7 @@ fn unnest_or_patterns(pat: &mut P<Pat>) -> bool {
160
160
impl MutVisitor for Visitor {
161
161
fn visit_pat ( & mut self , p : & mut P < Pat > ) {
162
162
// This is a bottom up transformation, so recurse first.
163
- walk_pat ( p , self ) ;
163
+ walk_pat ( self , p ) ;
164
164
165
165
// Don't have an or-pattern? Just quit early on.
166
166
let Or ( alternatives) = & mut p. kind else { return } ;
@@ -189,7 +189,7 @@ fn unnest_or_patterns(pat: &mut P<Pat>) -> bool {
189
189
190
190
// Deal with `Some(Some(0)) | Some(Some(1))`.
191
191
if this_level_changed {
192
- walk_pat ( p , self ) ;
192
+ walk_pat ( self , p ) ;
193
193
}
194
194
}
195
195
}
0 commit comments