@@ -33,10 +33,8 @@ function __TS__ArraySplice<T>(list: T[], start: number, deleteCount: number, ...
3333 const out : T [ ] = [ ] ;
3434
3535 // 10.
36- let k = 0 ;
37-
3836 // 11.
39- for ( k = 0 ; k < actualDeleteCount ; k ++ ) {
37+ for ( let k = 0 ; k < actualDeleteCount ; k ++ ) {
4038 const from = actualStart + k ;
4139
4240 if ( list [ from ] ) {
@@ -47,7 +45,7 @@ function __TS__ArraySplice<T>(list: T[], start: number, deleteCount: number, ...
4745 // 15.
4846 if ( itemCount < actualDeleteCount ) {
4947 // a. b.
50- for ( k = actualStart ; k < len - actualDeleteCount ; k ++ ) {
48+ for ( let k = actualStart ; k < len - actualDeleteCount ; k ++ ) {
5149 const from = k + actualDeleteCount ;
5250 const to = k + itemCount ;
5351
@@ -58,13 +56,13 @@ function __TS__ArraySplice<T>(list: T[], start: number, deleteCount: number, ...
5856 }
5957 }
6058 // c. d.
61- for ( k = len ; k > len - actualDeleteCount + itemCount ; k -- ) {
59+ for ( let k = len ; k > len - actualDeleteCount + itemCount ; k -- ) {
6260 list [ k ] = undefined ;
6361 }
6462 // 16.
6563 } else if ( itemCount > actualDeleteCount ) {
6664
67- for ( k = len - actualDeleteCount ; k > actualStart ; k -- ) {
65+ for ( let k = len - actualDeleteCount ; k > actualStart ; k -- ) {
6866 const from = k + actualDeleteCount - 1 ;
6967 const to = k + itemCount - 1 ;
7068
@@ -79,13 +77,13 @@ function __TS__ArraySplice<T>(list: T[], start: number, deleteCount: number, ...
7977
8078 // 17.
8179 // 18.
82- for ( k = actualStart ; k < items . length ; k ++ ) {
80+ for ( let k = actualStart ; k < items . length ; k ++ ) {
8381 const e = items [ k ] ;
8482 list [ k ] = e ;
8583 }
8684
8785 // 19.
88- for ( k = list . length ; k > len - actualDeleteCount + itemCount ; k -- ) {
86+ for ( let k = list . length ; k > len - actualDeleteCount + itemCount ; k -- ) {
8987 list [ k ] = undefined ;
9088 }
9189
0 commit comments