This repository was archived by the owner on Jul 5, 2023. It is now read-only.
File tree Expand file treeCollapse file tree 2 files changed+4
-2
lines changedFilter options
+4
-2
lines changed Original file line number Diff line number Diff line change
@@ -290,12 +290,13 @@ parsetok(struct tok_state *tok, grammar *g, int start, perrdetail *err_ret,
290 290
/* Put type_ignore nodes in the ENDMARKER of file_input. */
291 291
int num;
292 292
node *ch;
293 +
size_t i;
293 294 294 295
num = NCH(n);
295 296
ch = CHILD(n, num - 1);
296 297
REQ(ch, ENDMARKER);
297 298 298 -
for (size_t i = 0; i < type_ignores.num_items; i++) {
299 +
for (i = 0; i < type_ignores.num_items; i++) {
299 300
Ta27Node_AddChild(ch, TYPE_IGNORE, NULL, type_ignores.items[i], 0);
300 301
}
301 302
}
@@ -326,12 +326,13 @@ parsetok(struct tok_state *tok, grammar *g, int start, perrdetail *err_ret,
326 326
/* Put type_ignore nodes in the ENDMARKER of file_input. */
327 327
int num;
328 328
node *ch;
329 +
size_t i;
329 330 330 331
num = NCH(n);
331 332
ch = CHILD(n, num - 1);
332 333
REQ(ch, ENDMARKER);
333 334 334 -
for (size_t i = 0; i < type_ignores.num_items; i++) {
335 +
for (i = 0; i < type_ignores.num_items; i++) {
335 336
Ta35Node_AddChild(ch, TYPE_IGNORE, NULL, type_ignores.items[i], 0);
336 337
}
337 338
}
You can’t perform that action at this time.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4