From 412cd8bc880af8b1c8d73025c08f0eb8b08b210d Mon Sep 17 00:00:00 2001 From: Michael Dyck Date: Thu, 30 May 2024 21:50:43 -0400 Subject: [PATCH] Editorial: Change some `X is Y` to `SameValue(X, Y) is *true*` (apply editorial convention to recently-merged PR #3337) --- spec.html | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) diff --git a/spec.html b/spec.html index 10b2af570b..d27e17174a 100644 --- a/spec.html +++ b/spec.html @@ -41811,7 +41811,7 @@

Map.prototype.delete ( _key_ )

1. Perform ? RequireInternalSlot(_M_, [[MapData]]). 1. Set _key_ to CanonicalizeKeyedCollectionKey(_key_). 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[MapData]], do - 1. If _p_.[[Key]] is not ~empty~ and _p_.[[Key]] is _key_, then + 1. If _p_.[[Key]] is not ~empty~ and SameValue(_p_.[[Key]], _key_) is *true*, then 1. Set _p_.[[Key]] to ~empty~. 1. Set _p_.[[Value]] to ~empty~. 1. Return *true*. @@ -41866,7 +41866,7 @@

Map.prototype.get ( _key_ )

1. Perform ? RequireInternalSlot(_M_, [[MapData]]). 1. Set _key_ to CanonicalizeKeyedCollectionKey(_key_). 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[MapData]], do - 1. If _p_.[[Key]] is not ~empty~ and _p_.[[Key]] is _key_, return _p_.[[Value]]. + 1. If _p_.[[Key]] is not ~empty~ and SameValue(_p_.[[Key]], _key_) is *true*, return _p_.[[Value]]. 1. Return *undefined*. @@ -41879,7 +41879,7 @@

Map.prototype.has ( _key_ )

1. Perform ? RequireInternalSlot(_M_, [[MapData]]). 1. Set _key_ to CanonicalizeKeyedCollectionKey(_key_). 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[MapData]], do - 1. If _p_.[[Key]] is not ~empty~ and _p_.[[Key]] is _key_, return *true*. + 1. If _p_.[[Key]] is not ~empty~ and SameValue(_p_.[[Key]], _key_) is *true*, return *true*. 1. Return *false*. @@ -41901,7 +41901,7 @@

Map.prototype.set ( _key_, _value_ )

1. Perform ? RequireInternalSlot(_M_, [[MapData]]). 1. Set _key_ to CanonicalizeKeyedCollectionKey(_key_). 1. For each Record { [[Key]], [[Value]] } _p_ of _M_.[[MapData]], do - 1. If _p_.[[Key]] is not ~empty~ and _p_.[[Key]] is _key_, then + 1. If _p_.[[Key]] is not ~empty~ and SameValue(_p_.[[Key]], _key_) is *true*, then 1. Set _p_.[[Value]] to _value_. 1. Return _M_. 1. Let _p_ be the Record { [[Key]]: _key_, [[Value]]: _value_ }. @@ -42096,7 +42096,7 @@

Set.prototype.add ( _value_ )

1. Perform ? RequireInternalSlot(_S_, [[SetData]]). 1. Set _value_ to CanonicalizeKeyedCollectionKey(_value_). 1. For each element _e_ of _S_.[[SetData]], do - 1. If _e_ is not ~empty~ and _e_ is _value_, then + 1. If _e_ is not ~empty~ and SameValue(_e_, _value_) is *true*, then 1. Return _S_. 1. Append _value_ to _S_.[[SetData]]. 1. Return _S_. @@ -42131,7 +42131,7 @@

Set.prototype.delete ( _value_ )

1. Perform ? RequireInternalSlot(_S_, [[SetData]]). 1. Set _value_ to CanonicalizeKeyedCollectionKey(_value_). 1. For each element _e_ of _S_.[[SetData]], do - 1. If _e_ is not ~empty~ and _e_ is _value_, then + 1. If _e_ is not ~empty~ and SameValue(_e_, _value_) is *true*, then 1. Replace the element of _S_.[[SetData]] whose value is _e_ with an element whose value is ~empty~. 1. Return *true*. 1. Return *false*. @@ -42190,7 +42190,7 @@

Set.prototype.has ( _value_ )

1. Perform ? RequireInternalSlot(_S_, [[SetData]]). 1. Set _value_ to CanonicalizeKeyedCollectionKey(_value_). 1. For each element _e_ of _S_.[[SetData]], do - 1. If _e_ is not ~empty~ and _e_ is _value_, return *true*. + 1. If _e_ is not ~empty~ and SameValue(_e_, _value_) is *true*, return *true*. 1. Return *false*.