@@ -1089,7 +1089,7 @@ function complete(line, callback) {
1089
1089
var completions ;
1090
1090
// List of completion lists, one for each inheritance "level"
1091
1091
var completionGroups = [ ] ;
1092
- var completeOn , i , group , c ;
1092
+ var completeOn , group , c ;
1093
1093
1094
1094
// REPL commands (e.g. ".break").
1095
1095
var filter ;
@@ -1112,7 +1112,7 @@ function complete(line, callback) {
1112
1112
completeOn = match [ 1 ] ;
1113
1113
var subdir = match [ 2 ] || '' ;
1114
1114
filter = match [ 1 ] ;
1115
- var dir , files , f , name , base , ext , abs , subfiles , s , isDirectory ;
1115
+ var dir , files , name , base , ext , abs , subfiles , isDirectory ;
1116
1116
group = [ ] ;
1117
1117
let paths = [ ] ;
1118
1118
@@ -1126,14 +1126,14 @@ function complete(line, callback) {
1126
1126
paths = module . paths . concat ( CJSModule . globalPaths ) ;
1127
1127
}
1128
1128
1129
- for ( i = 0 ; i < paths . length ; i ++ ) {
1129
+ for ( let i = 0 ; i < paths . length ; i ++ ) {
1130
1130
dir = path . resolve ( paths [ i ] , subdir ) ;
1131
1131
try {
1132
1132
files = fs . readdirSync ( dir ) ;
1133
1133
} catch {
1134
1134
continue ;
1135
1135
}
1136
- for ( f = 0 ; f < files . length ; f ++ ) {
1136
+ for ( let f = 0 ; f < files . length ; f ++ ) {
1137
1137
name = files [ f ] ;
1138
1138
ext = path . extname ( name ) ;
1139
1139
base = name . slice ( 0 , - ext . length ) ;
@@ -1154,7 +1154,7 @@ function complete(line, callback) {
1154
1154
} catch {
1155
1155
continue ;
1156
1156
}
1157
- for ( s = 0 ; s < subfiles . length ; s ++ ) {
1157
+ for ( let s = 0 ; s < subfiles . length ; s ++ ) {
1158
1158
if ( indexRe . test ( subfiles [ s ] ) ) {
1159
1159
group . push ( subdir + name ) ;
1160
1160
}
@@ -1291,7 +1291,7 @@ function complete(line, callback) {
1291
1291
}
1292
1292
1293
1293
if ( memberGroups . length ) {
1294
- for ( i = 0 ; i < memberGroups . length ; i ++ ) {
1294
+ for ( let i = 0 ; i < memberGroups . length ; i ++ ) {
1295
1295
completionGroups . push (
1296
1296
memberGroups [ i ] . map ( ( member ) => `${ expr } .${ member } ` ) ) ;
1297
1297
}
@@ -1316,7 +1316,7 @@ function complete(line, callback) {
1316
1316
// Filter, sort (within each group), uniq and merge the completion groups.
1317
1317
if ( completionGroups . length && filter ) {
1318
1318
var newCompletionGroups = [ ] ;
1319
- for ( i = 0 ; i < completionGroups . length ; i ++ ) {
1319
+ for ( let i = 0 ; i < completionGroups . length ; i ++ ) {
1320
1320
group = completionGroups [ i ]
1321
1321
. filter ( ( elem ) => elem . indexOf ( filter ) === 0 ) ;
1322
1322
if ( group . length ) {
@@ -1332,7 +1332,7 @@ function complete(line, callback) {
1332
1332
// Completion group 0 is the "closest"
1333
1333
// (least far up the inheritance chain)
1334
1334
// so we put its completions last: to be closest in the REPL.
1335
- for ( i = 0 ; i < completionGroups . length ; i ++ ) {
1335
+ for ( let i = 0 ; i < completionGroups . length ; i ++ ) {
1336
1336
group = completionGroups [ i ] ;
1337
1337
group . sort ( ) ;
1338
1338
for ( var j = group . length - 1 ; j >= 0 ; j -- ) {
0 commit comments