Skip to content
This repository has been archived by the owner on Jul 8, 2024. It is now read-only.

Update spec #36

Merged
merged 5 commits into from
Dec 19, 2018
Merged
Show file tree
Hide file tree
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
12 changes: 6 additions & 6 deletions docs/index.html

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion spec/set-prototype-difference.html
Original file line number Diff line number Diff line change
Expand Up @@ -13,6 +13,6 @@
1. Let _next_ be IteratorStep(_iter_).
2. If _next_ is *false*, return _newSet_.
3. Let _nextValue_ be ? IteratorValue(_next_).
4. Let _status_ be Call(_remover_, _newSet_, « _nextValue_.[[Value]] »)
4. Let _status_ be Call(_remover_, _newSet_, « _nextValue_ »)
5. If _status_ is an abrupt completion, return ? IteratorClose(_iter_, _status_)
</emu-alg>
4 changes: 2 additions & 2 deletions spec/set-prototype-intersection.html
Original file line number Diff line number Diff line change
Expand Up @@ -15,9 +15,9 @@
1. Let _next_ be IteratorStep(_iter_).
1. If _next_ is *false*, return _newSet_.
1. Let _nextValue_ be ? IteratorValue(_next_).
1. Let _has_ be Call(_hasCheck_, _set_, « _nextValue_.[[Value]] »)
1. Let _has_ be Call(_hasCheck_, _set_, « _nextValue_ »)
1. If _has_ is an abrupt completion, return ? IteratorClose(_iter_, _has_)
1. If _has_ is *true*,
1. Let _status_ be Call(_adder_, _newSet_, « _nextValue_.[[Value]] »)
1. Let _status_ be Call(_adder_, _newSet_, « _nextValue_ »)
1. If _status_ is an abrupt completion, return ? IteratorClose(_iter_, _status_)
</emu-alg>
20 changes: 9 additions & 11 deletions spec/set-prototype-is-disjoint-with.html
Original file line number Diff line number Diff line change
Expand Up @@ -3,17 +3,15 @@
<emu-alg>
1. Let _set_ be the *this* value.
1. If Type(_set_) is not Object, throw a *TypeError* exception.
1. If _set_ does not have a [[SetData]] internal slot, throw a *TypeError* exception.
1. Let _entries_ be the List that is _set_.[[SetData]].
1. If Type(_iterable_) is not Object, throw a *TypeError* exception.
1. If _iterable_ does not have [[SetData]] internal slot,
1. Let _otherSet_ be ? Construct(%Set%, _iterable_).
1. Else, let _otherSet_ be _iterable_.
1. Let _hasCheck_ be ? Get(_otherSet_, "has").
1. Let _hasCheck_ be ? Get(_set_, "has").
1. If IsCallable(_hasCheck_) is *false*, throw a *TypeError* exception.
1. For each _e_ that is an element of _entries_, do
1. Let _has_ be ? Call(_hasCheck_, _otherSet_, « e »)
1. Let _iter_ be ? GetIterator(_iterable_).
1. If _iter_ is undefined, throw a *TypeError* exception.
1. Repeat,
1. Let _next_ be IteratorStep(_iter_).
1. If _next_ is *false*, return *true*.
1. Let _nextValue_ be ? IteratorValue(_next_).
1. Let _has_ be ? Call(_hasCheck_, _set_, « _nextValue_ »).
1. If _has_ is an abrupt completion, return ? IteratorClose(_iter_, _has_).
1. If _has_ is *true*, return *false*.
1. return *true*.

</emu-alg>
4 changes: 1 addition & 3 deletions spec/set-prototype-is-superset-of.html
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,6 @@
<emu-alg>
1. Let _set_ be the *this* value.
1. If Type(_set_) is not Object, throw a *TypeError* exception.
1. If _set_ does not have a [[SetData]] internal slot, throw a *TypeError* exception.
1. Let _hasCheck_ be ? Get(_set_, "has").
1. If IsCallable(_hasCheck_) is *false*, throw a *TypeError* exception.
1. Let _iter_ be ? GetIterator(_iterable_).
Expand All @@ -12,8 +11,7 @@
1. Let _next_ be IteratorStep(_iter_).
1. If _next_ is *false*, return *true*.
1. Let _nextValue_ be ? IteratorValue(_next_).
1. Let _has_ be ? Call(_hasCheck_, _set_, « e »).
1. Let _has_ be ? Call(_hasCheck_, _set_, « _nextValue_ »).
1. If _has_ is an abrupt completion, return ? IteratorClose(_iter_, _has_).
1. If _has_ is *false*, return *false*.

</emu-alg>
4 changes: 2 additions & 2 deletions spec/set-prototype-symmetric-difference.html
Original file line number Diff line number Diff line change
Expand Up @@ -15,9 +15,9 @@
1. Let _next_ be IteratorStep(_iter_).
1. If _next_ is *false*, return _newSet_.
1. Let _nextValue_ be ? IteratorValue(_next_).
1. Let _removed_ be Call(_remover_, _newSet_, « _nextValue_.[[Value]] »).
1. Let _removed_ be Call(_remover_, _newSet_, « _nextValue_ »).
1. If _removed_ is an abrupt completion, return ? IteratorClose(_iter_, _removed_).
1. If _removed_ is *false*,
1. Let _status_ be Call(_adder_, _newSet_, « _nextValue_.[[Value]] »).
1. Let _status_ be Call(_adder_, _newSet_, « _nextValue_ »).
1. If _status_ is an abrupt completion, return ? IteratorClose(_iter_, _status_).
</emu-alg>
2 changes: 1 addition & 1 deletion spec/set-prototype-union.html
Original file line number Diff line number Diff line change
Expand Up @@ -13,6 +13,6 @@
1. Let _next_ be IteratorStep(_iter_).
2. If _next_ is *false*, return _newSet_.
3. Let _nextValue_ be ? IteratorValue(_next_).
4. Let _status_ be Call(_adder_, _newSet_, « _nextValue_.[[Value]] »)
4. Let _status_ be Call(_adder_, _newSet_, « _nextValue_ »)
5. If _status_ is an abrupt completion, return ? IteratorClose(_iter_, _status_)
</emu-alg>