@@ -88,22 +88,24 @@ <h1>Array.prototype.toSpliced ( _start_, _deleteCount_, ..._items_ )</h1>
88
88
1. Let _newLen_ be _len_ + _insertCount_ - _actualDeleteCount_ .
89
89
1. If _newLen_ > ; 2<sup >53</sup > - 1, throw a *TypeError* exception.
90
90
1. Let _A_ be ? ArrayCreate(𝔽(_newLen_ )).
91
- 1. Let _k_ be 0.
91
+ 1. Let _i_ be 0.
92
+ 1. Let _r_ be _actualStart_ + _actualDeleteCount_ .
92
93
1. Repeat, while _k_ < ; _actualStart_ ,
93
- 1. Let _Pk_ be ! ToString(𝔽(_k_ )).
94
- 1. Let _kValue_ be ? Get(_O_ , _Pk_ ).
95
- 1. Perform ! CreateDataPropertyOrThrow(_A_ , _Pk_ , _kValue_ ).
96
- 1. Set _k_ to _k_ + 1.
94
+ 1. Let _Pi_ be ! ToString(𝔽(_i_ )).
95
+ 1. Let _iValue_ be ? Get(_O_ , _Pi_ ).
96
+ 1. Perform ! CreateDataPropertyOrThrow(_A_ , _Pi_ , _iValue_ ).
97
+ 1. Set _i_ to _i_ + 1.
97
98
1. For each element _E_ of _items_ , do
98
- 1. Let _Pk_ be ! ToString(𝔽(_k_ )).
99
- 1. Perform ! CreateDataPropertyOrThrow(_A_ , _Pk_ , _E_ ).
100
- 1. Set _k_ to _k_ + 1.
101
- 1. Repeat, while _k_ < ; _newLen_ ,
102
- 1. Let _Pk_ be ! ToString(𝔽(_k_ )).
103
- 1. Let _from_ be ! ToString(𝔽(_k_ + _actualDeleteCount_ - _insertCount_ )).
99
+ 1. Let _Pi_ be ! ToString(𝔽(_i_ )).
100
+ 1. Perform ! CreateDataPropertyOrThrow(_A_ , _Pi_ , _E_ ).
101
+ 1. Set _i_ to _i_ + 1.
102
+ 1. Repeat, while _i_ < ; _newLen_ ,
103
+ 1. Let _Pi_ be ! ToString(𝔽(_i_ )).
104
+ 1. Let _from_ be ! ToString(𝔽(_r_ )).
104
105
1. Let _fromValue_ be ? Get(_O_ , _from_ ).
105
- 1. Perform ! CreateDataPropertyOrThrow(_A_ , _Pk_ , _fromValue_ ).
106
- 1. Set _k_ to _k_ + 1.
106
+ 1. Perform ! CreateDataPropertyOrThrow(_A_ , _Pi_ , _fromValue_ ).
107
+ 1. Set _i_ to _i_ + 1.
108
+ 1. Set _r_ to _r_ + 1.
107
109
1. Return _A_ .
108
110
</emu-alg >
109
111
</emu-clause >
@@ -284,22 +286,24 @@ <h1>%TypedArray%.prototype.toSpliced ( _start_, _deleteCount_, ..._items_ )</h1>
284
286
1. Let _actualDeleteCount_ be the result of clamping _dc_ between 0 and _len_ - _actualStart_ .
285
287
1. Let _newLen_ be _len_ + _insert_ Count_ - _actualDeleteCount_ .
286
288
1. Let _A_ be ? TypedArrayCreateSameType(_O_ , « ; 𝔽(_newLen_ ) » ; ).
287
- 1. Let _k_ be 0.
288
- 1. Repeat, while _k_ < ; _actualStart_ ,
289
- 1. Let _Pk_ be ! ToString(𝔽(_k_ )).
290
- 1. Let _kValue_ be ! Get(_src_ , _Pk_ ).
291
- 1. Perform ! Set(_target_ , _Pk_ , _kValue_ , *true* ).
292
- 1. Set _k_ to _k_ + 1.
289
+ 1. Let _i_ be 0.
290
+ 1. Let _r_ be _actualStart_ + _actualDeleteCount_ .
291
+ 1. Repeat, while _i_ < ; _actualStart_ ,
292
+ 1. Let _Pi_ be ! ToString(𝔽(_i_ )).
293
+ 1. Let _iValue_ be ! Get(_src_ , _Pi_ ).
294
+ 1. Perform ! Set(_target_ , _Pi_ , _iValue_ , *true* ).
295
+ 1. Set _i_ to _i_ + 1.
293
296
1. For each element _E_ of _items_ , do
294
- 1. Let _Pk_ be ! ToString(𝔽(_k_ )).
295
- 1. Perform ? Set(_A_ , _Pk_ , _E_ , *true* ).
296
- 1. Set _k_ to _k_ + 1.
297
- 1. Repeat, while _k_ < ; _newLen_ ,
298
- 1. Let _Pk_ be ! ToString(𝔽(_k_ )).
299
- 1. Let _from_ be ! ToString(𝔽(_k_ + _actualDeleteCount_ - _insertCount_ )).
297
+ 1. Let _Pi_ be ! ToString(𝔽(_i_ )).
298
+ 1. Perform ? Set(_A_ , _Pi_ , _E_ , *true* ).
299
+ 1. Set _i_ to _i_ + 1.
300
+ 1. Repeat, while _r_ < ; _newLen_ ,
301
+ 1. Let _Pi_ be ! ToString(𝔽(_i_ )).
302
+ 1. Let _from_ be ! ToString(𝔽(_r_ )).
300
303
1. Let _fromValue_ be ! Get(_O_ , _from_ ).
301
- 1. Perform ! Set(_A_ , _Pk_ , _fromValue_ , *true* ).
302
- 1. Set _k_ to _k_ + 1.
304
+ 1. Perform ! Set(_A_ , _Pi_ , _fromValue_ , *true* ).
305
+ 1. Set _i_ to _i_ + 1.
306
+ 1. Set _r_ to _r_ + 1.
303
307
1. Return _A_ .
304
308
</emu-alg >
305
309
</emu-clause >
0 commit comments