Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Editorial: Declare iteration aliases as close to iterations as practical #2768

Merged
merged 1 commit into from
Jul 30, 2022
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 7 additions & 7 deletions spec.html
Original file line number Diff line number Diff line change
Expand Up @@ -33955,8 +33955,8 @@ <h1>
<emu-alg>
1. Let _stringLength_ be the length of _str_.
1. Assert: _position_ &le; _stringLength_.
1. Let _templateRemainder_ be _replacementTemplate_.
1. Let _result_ be the empty String.
1. Let _templateRemainder_ be _replacementTemplate_.
1. Repeat, while _templateRemainder_ is not the empty String,
1. NOTE: The following steps isolate _ref_ (a prefix of _templateRemainder_), determine _refReplacement_ (its replacement), and then append that replacement to _result_.
1. If _templateRemainder_ starts with *"$$"*, then
Expand Down Expand Up @@ -34338,8 +34338,8 @@ <h1>String.prototype [ @@iterator ] ( )</h1>
1. Let _O_ be ? RequireObjectCoercible(*this* value).
1. Let _s_ be ? ToString(_O_).
1. Let _closure_ be a new Abstract Closure with no parameters that captures _s_ and performs the following steps when called:
1. Let _position_ be 0.
1. Let _len_ be the length of _s_.
1. Let _position_ be 0.
1. Repeat, while _position_ &lt; _len_,
1. Let _cp_ be CodePointAt(_s_, _position_).
1. Let _nextIndex_ be _position_ + _cp_.[[CodeUnitCount]].
Expand Down Expand Up @@ -36647,8 +36647,8 @@ <h1>RegExp.prototype [ @@replace ] ( _string_, _replaceValue_ )</h1>
1. Let _matchLength_ be the length of _matched_.
1. Let _position_ be ? ToIntegerOrInfinity(? Get(_result_, *"index"*)).
1. Set _position_ to the result of clamping _position_ between 0 and _lengthS_.
1. Let _n_ be 1.
1. Let _captures_ be a new empty List.
1. Let _n_ be 1.
1. Repeat, while _n_ &le; _nCaptures_,
1. Let _capN_ be ? Get(_result_, ! ToString(𝔽(_n_))).
1. If _capN_ is not *undefined*, then
Expand Down Expand Up @@ -37123,9 +37123,9 @@ <h1>Array.prototype.concat ( ..._items_ )</h1>
1. For each element _E_ of _items_, do
1. Let _spreadable_ be ? IsConcatSpreadable(_E_).
1. If _spreadable_ is *true*, then
1. Let _k_ be 0.
1. Let _len_ be ? LengthOfArrayLike(_E_).
1. If _n_ + _len_ &gt; 2<sup>53</sup> - 1, throw a *TypeError* exception.
1. Let _k_ be 0.
1. Repeat, while _k_ &lt; _len_,
1. Let _P_ be ! ToString(𝔽(_k_)).
1. Let _exists_ be ? HasProperty(_E_, _P_).
Expand Down Expand Up @@ -38872,8 +38872,8 @@ <h1>%TypedArray%.prototype.filter ( _callbackfn_ [ , _thisArg_ ] )</h1>
1. Let _len_ be _O_.[[ArrayLength]].
1. If IsCallable(_callbackfn_) is *false*, throw a *TypeError* exception.
1. Let _kept_ be a new empty List.
1. Let _k_ be 0.
1. Let _captured_ be 0.
1. Let _k_ be 0.
1. Repeat, while _k_ &lt; _len_,
1. Let _Pk_ be ! ToString(𝔽(_k_)).
1. Let _kValue_ be ! Get(_O_, _Pk_).
Expand Down Expand Up @@ -39372,8 +39372,8 @@ <h1>%TypedArray%.prototype.slice ( _start_, _end_ )</h1>
1. Let _elementSize_ be TypedArrayElementSize(_O_).
1. NOTE: If _srcType_ and _targetType_ are the same, the transfer must be performed in a manner that preserves the bit-level encoding of the source data.
1. Let _srcByteOffset_ be _O_.[[ByteOffset]].
1. Let _targetByteIndex_ be _A_.[[ByteOffset]].
1. Let _srcByteIndex_ be (_k_ &times; _elementSize_) + _srcByteOffset_.
1. Let _targetByteIndex_ be _A_.[[ByteOffset]].
1. Let _limit_ be _targetByteIndex_ + _count_ &times; _elementSize_.
1. Repeat, while _targetByteIndex_ &lt; _limit_,
1. Let _value_ be GetValueFromBuffer(_srcBuffer_, _srcByteIndex_, ~Uint8~, *true*, ~Unordered~).
Expand Down Expand Up @@ -42399,8 +42399,8 @@ <h1>
1. If Type(_val_) is Object, then
1. Let _isArray_ be ? IsArray(_val_).
1. If _isArray_ is *true*, then
1. Let _I_ be 0.
1. Let _len_ be ? LengthOfArrayLike(_val_).
1. Let _I_ be 0.
1. Repeat, while _I_ &lt; _len_,
1. Let _prop_ be ! ToString(𝔽(_I_)).
1. Let _newElement_ be ? InternalizeJSONProperty(_val_, _prop_, _reviver_).
Expand Down