@@ -27,8 +27,8 @@ module ts {
27
27
28
28
function visitEachNode < T > ( cbNode : ( node : Node ) => T , nodes : Node [ ] ) {
29
29
if ( nodes ) {
30
- for ( var i = 0 , len = nodes . length ; i < len ; i ++ ) {
31
- var result = cbNode ( nodes [ i ] ) ;
30
+ for ( let node of nodes ) {
31
+ var result = cbNode ( node ) ;
32
32
if ( result ) {
33
33
return result ;
34
34
}
@@ -436,8 +436,8 @@ module ts {
436
436
array . pos += delta ;
437
437
array . end += delta ;
438
438
439
- for ( var i = 0 , n = array . length ; i < n ; i ++ ) {
440
- visitNode ( array [ i ] ) ;
439
+ for ( let node of array ) {
440
+ visitNode ( node ) ;
441
441
}
442
442
}
443
443
}
@@ -589,8 +589,8 @@ module ts {
589
589
590
590
// Adjust the pos or end (or both) of the intersecting array accordingly.
591
591
adjustIntersectingElement ( array , changeStart , changeRangeOldEnd , changeRangeNewEnd , delta ) ;
592
- for ( var i = 0 , n = array . length ; i < n ; i ++ ) {
593
- visitNode ( array [ i ] ) ;
592
+ for ( let node of array ) {
593
+ visitNode ( node ) ;
594
594
}
595
595
return ;
596
596
}
@@ -948,7 +948,7 @@ module ts {
948
948
if ( position >= array . pos && position < array . end ) {
949
949
// position was in this array. Search through this array to see if we find a
950
950
// viable element.
951
- for ( var i = 0 , n = array . length ; i < n ; i ++ ) {
951
+ for ( let i = 0 , n = array . length ; i < n ; i ++ ) {
952
952
var child = array [ i ] ;
953
953
if ( child ) {
954
954
if ( child . pos === position ) {
0 commit comments