@@ -110,12 +110,12 @@ impl<'a> TokenTreesReader<'a> {
110
110
err
111
111
}
112
112
113
- fn parse_token_tree_open_delim ( & mut self , delim : Delimiter ) -> TokenTree {
113
+ fn parse_token_tree_open_delim ( & mut self , open_delim : Delimiter ) -> TokenTree {
114
114
// The span for beginning of the delimited section
115
115
let pre_span = self . token . span ;
116
116
117
117
// Move past the open delimiter.
118
- self . open_braces . push ( ( delim , self . token . span ) ) ;
118
+ self . open_braces . push ( ( open_delim , self . token . span ) ) ;
119
119
self . token = self . string_reader . next_token ( ) . 0 ;
120
120
121
121
// Parse the token trees within the delimiters.
@@ -128,7 +128,7 @@ impl<'a> TokenTreesReader<'a> {
128
128
129
129
match self . token . kind {
130
130
// Correct delimiter.
131
- token:: CloseDelim ( d ) if d == delim => {
131
+ token:: CloseDelim ( close_delim ) if close_delim == open_delim => {
132
132
let ( open_brace, open_brace_span) = self . open_braces . pop ( ) . unwrap ( ) ;
133
133
let close_brace_span = self . token . span ;
134
134
@@ -138,12 +138,12 @@ impl<'a> TokenTreesReader<'a> {
138
138
if !sm. is_multiline ( empty_block_span) {
139
139
// Only track if the block is in the form of `{}`, otherwise it is
140
140
// likely that it was written on purpose.
141
- self . last_delim_empty_block_spans . insert ( delim , empty_block_span) ;
141
+ self . last_delim_empty_block_spans . insert ( open_delim , empty_block_span) ;
142
142
}
143
143
}
144
144
145
145
//only add braces
146
- if let ( Delimiter :: Brace , Delimiter :: Brace ) = ( open_brace, delim ) {
146
+ if let ( Delimiter :: Brace , Delimiter :: Brace ) = ( open_brace, open_delim ) {
147
147
self . matching_block_spans . push ( ( open_brace_span, close_brace_span) ) ;
148
148
}
149
149
@@ -158,7 +158,7 @@ impl<'a> TokenTreesReader<'a> {
158
158
self . token = self . string_reader . next_token ( ) . 0 ;
159
159
}
160
160
// Incorrect delimiter.
161
- token:: CloseDelim ( other ) => {
161
+ token:: CloseDelim ( close_delim ) => {
162
162
let mut unclosed_delimiter = None ;
163
163
let mut candidate = None ;
164
164
@@ -176,7 +176,7 @@ impl<'a> TokenTreesReader<'a> {
176
176
for ( brace, brace_span) in & self . open_braces {
177
177
if let Some ( padding) = sm. span_to_margin ( * brace_span) {
178
178
// high likelihood of these two corresponding
179
- if current_padding == padding && brace == & other {
179
+ if current_padding == padding && brace == & close_delim {
180
180
candidate = Some ( * brace_span) ;
181
181
}
182
182
}
@@ -185,7 +185,7 @@ impl<'a> TokenTreesReader<'a> {
185
185
let ( tok, _) = self . open_braces . pop ( ) . unwrap ( ) ;
186
186
self . unmatched_braces . push ( UnmatchedBrace {
187
187
expected_delim : tok,
188
- found_delim : Some ( other ) ,
188
+ found_delim : Some ( close_delim ) ,
189
189
found_span : self . token . span ,
190
190
unclosed_span : unclosed_delimiter,
191
191
candidate_span : candidate,
@@ -201,7 +201,7 @@ impl<'a> TokenTreesReader<'a> {
201
201
// fn foo() {
202
202
// bar(baz(
203
203
// } // Incorrect delimiter but matches the earlier `{`
204
- if !self . open_braces . iter ( ) . any ( |& ( b, _) | b == other ) {
204
+ if !self . open_braces . iter ( ) . any ( |& ( b, _) | b == close_delim ) {
205
205
self . token = self . string_reader . next_token ( ) . 0 ;
206
206
}
207
207
}
@@ -213,7 +213,7 @@ impl<'a> TokenTreesReader<'a> {
213
213
_ => unreachable ! ( ) ,
214
214
}
215
215
216
- TokenTree :: Delimited ( delim_span, delim , tts)
216
+ TokenTree :: Delimited ( delim_span, open_delim , tts)
217
217
}
218
218
219
219
fn close_delim_err ( & mut self , delim : Delimiter ) -> PErr < ' a > {
0 commit comments