Skip to content

Commit

Permalink
refactor: use an alias for iters[i]
Browse files Browse the repository at this point in the history
  • Loading branch information
ljharb committed Oct 10, 2024
1 parent 76e8f1f commit 858a45a
Showing 1 changed file with 5 additions and 4 deletions.
9 changes: 5 additions & 4 deletions spec.emu
Original file line number Diff line number Diff line change
Expand Up @@ -135,17 +135,18 @@ copyright: false
1. Let _results_ be a new empty List.
1. Assert: _openIters_ is not empty.
1. For each integer _i_ such that 0 ≤ _i_ < _iterCount_, in ascending order, do
1. If _iters_[_i_] is *null*, then
1. Let _iter_ be _iters_[_i_];
1. If _iter_ is *null*, then
1. Assert: _mode_ is *"longest"*.
1. Let _result_ be _padding_[_i_].
1. Else,
1. Let _result_ be Completion(IteratorStepValue(_iters_[_i_])).
1. Let _result_ be Completion(IteratorStepValue(_iter_)).
1. If _result_ is an abrupt completion, then
1. Remove _iters_[_i_] from _openIters_.
1. Remove _iter_ from _openIters_.
1. Return ? IteratorCloseAll(_openIters_, _result_).
1. Set _result_ to ! _result_.
1. If _result_ is ~done~, then
1. Remove _iters_[_i_] from _openIters_.
1. Remove _iter_ from _openIters_.
1. If _mode_ is *"shortest"*, then
1. Return ? IteratorCloseAll(_openIters_, ReturnCompletion(*undefined*)).
1. Else if _mode_ is *"strict"*, then
Expand Down

0 comments on commit 858a45a

Please sign in to comment.