Skip to content

Commit

Permalink
start changing phrasing
Browse files Browse the repository at this point in the history
  • Loading branch information
@michaelficarra
michaelficarra committed Aug 22, 2022
1 parent 8586b4e commit bdf6f83
Showing 1 changed file with 21 additions and 21 deletions.
42 changes: 21 additions & 21 deletions spec.html
View file
Original file line number Diff line number Diff line change
Expand Up @@ -1105,11 +1105,11 @@ <h1>
1. Let _searchLen_ be the length of _searchValue_.
1. For each integer _i_ starting with _fromIndex_ such that _i_ &le; _len_ - _searchLen_, in ascending order, do
1. Let _candidate_ be the substring of _string_ from _i_ to _i_ + _searchLen_.
1. If _candidate_ is the same sequence of code units as _searchValue_, return _i_.
1. If _candidate_ is _searchValue_, return _i_.
1. Return -1.
</emu-alg>
<emu-note>
<p>If _searchValue_ is the empty String and _fromIndex_ is less than or equal to the length of _string_, this algorithm returns _fromIndex_. The empty String is effectively found at every position within a string, including after the last code unit.</p>
<p>If _searchValue_ is the empty String and _fromIndex_ &le; the length of _string_, this algorithm returns _fromIndex_. The empty String is effectively found at every position within a string, including after the last code unit.</p>
</emu-note>
<emu-note>
<p>This algorithm always returns -1 if _fromIndex_ &gt; the length of _string_.</p>
Expand Down Expand Up @@ -1841,11 +1841,11 @@ <h1>
1. Assert: _base_ is finite and is neither *+0*<sub>𝔽</sub> nor *-0*<sub>𝔽</sub>.
1. If _exponent_ is *+&infin;*<sub>𝔽</sub>, then
1. If abs(ℝ(_base_)) &gt; 1, return *+&infin;*<sub>𝔽</sub>.
1. If abs(ℝ(_base_)) is 1, return *NaN*.
1. If abs(ℝ(_base_)) = 1, return *NaN*.
1. If abs(ℝ(_base_)) &lt; 1, return *+0*<sub>𝔽</sub>.
1. If _exponent_ is *-&infin;*<sub>𝔽</sub>, then
1. If abs(ℝ(_base_)) &gt; 1, return *+0*<sub>𝔽</sub>.
1. If abs(ℝ(_base_)) is 1, return *NaN*.
1. If abs(ℝ(_base_)) = 1, return *NaN*.
1. If abs(ℝ(_base_)) &lt; 1, return *+&infin;*<sub>𝔽</sub>.
1. Assert: _exponent_ is finite and is neither *+0*<sub>𝔽</sub> nor *-0*<sub>𝔽</sub>.
1. If _base_ &lt; *-0*<sub>𝔽</sub> and _exponent_ is not an integral Number, return *NaN*.
Expand Down Expand Up @@ -1942,7 +1942,7 @@ <h1>
1. If _n_ is *+0*<sub>𝔽</sub> or _n_ is *-0*<sub>𝔽</sub>, return _n_.
1. Assert: _n_ and _d_ are finite and non-zero.
1. Let _r_ be ℝ(_n_) - (ℝ(_d_) &times; _q_) where _q_ is an integer that is negative if and only if _n_ and _d_ have opposite sign, and whose magnitude is as large as possible without exceeding the magnitude of ℝ(_n_) / ℝ(_d_).
1. If _r_ is 0 and _n_ &lt; *-0*<sub>𝔽</sub>, return *-0*<sub>𝔽</sub>.
1. If _r_ = 0 and _n_ &lt; *-0*<sub>𝔽</sub>, return *-0*<sub>𝔽</sub>.
1. Return 𝔽(_r_).
</emu-alg>
<emu-note>
Expand Down Expand Up @@ -2059,7 +2059,7 @@ <h1>
<emu-alg>
1. If _x_ is *NaN*, return *undefined*.
1. If _y_ is *NaN*, return *undefined*.
1. If _x_ and _y_ are the same Number value, return *false*.
1. If _x_ is _y_, return *false*.
1. If _x_ is *+0*<sub>𝔽</sub> and _y_ is *-0*<sub>𝔽</sub>, return *false*.
1. If _x_ is *-0*<sub>𝔽</sub> and _y_ is *+0*<sub>𝔽</sub>, return *false*.
1. If _x_ is *+&infin;*<sub>𝔽</sub>, return *false*.
Expand All @@ -2083,7 +2083,7 @@ <h1>
<emu-alg>
1. If _x_ is *NaN*, return *false*.
1. If _y_ is *NaN*, return *false*.
1. If _x_ is the same Number value as _y_, return *true*.
1. If _x_ is _y_, return *true*.
1. If _x_ is *+0*<sub>𝔽</sub> and _y_ is *-0*<sub>𝔽</sub>, return *true*.
1. If _x_ is *-0*<sub>𝔽</sub> and _y_ is *+0*<sub>𝔽</sub>, return *true*.
1. Return *false*.
Expand All @@ -2103,7 +2103,7 @@ <h1>
1. If _x_ is *NaN* and _y_ is *NaN*, return *true*.
1. If _x_ is *+0*<sub>𝔽</sub> and _y_ is *-0*<sub>𝔽</sub>, return *false*.
1. If _x_ is *-0*<sub>𝔽</sub> and _y_ is *+0*<sub>𝔽</sub>, return *false*.
1. If _x_ is the same Number value as _y_, return *true*.
1. If _x_ is _y_, return *true*.
1. Return *false*.
</emu-alg>
</emu-clause>
Expand All @@ -2121,7 +2121,7 @@ <h1>
1. If _x_ is *NaN* and _y_ is *NaN*, return *true*.
1. If _x_ is *+0*<sub>𝔽</sub> and _y_ is *-0*<sub>𝔽</sub>, return *true*.
1. If _x_ is *-0*<sub>𝔽</sub> and _y_ is *+0*<sub>𝔽</sub>, return *true*.
1. If _x_ is the same Number value as _y_, return *true*.
1. If _x_ is _y_, return *true*.
1. Return *false*.
</emu-alg>
</emu-clause>
Expand Down Expand Up @@ -2230,7 +2230,7 @@ <h1>
1. Let _exponentSign_ be the code unit 0x002D (HYPHEN-MINUS).
1. Else,
1. Let _exponentSign_ be the code unit 0x002B (PLUS SIGN).
1. If _k_ is 1, then
1. If _k_ = 1, then
1. Return the string-concatenation of:
* the code unit of the single digit of _s_
* the code unit 0x0065 (LATIN SMALL LETTER E)
Expand All @@ -2248,7 +2248,7 @@ <h1>
<p>The following observations may be useful as guidelines for implementations, but are not part of the normative requirements of this Standard:</p>
<ul>
<li>
If x is any Number value other than *-0*<sub>𝔽</sub>, then ToNumber(ToString(x)) is exactly the same Number value as x.
If x is any Number value other than *-0*<sub>𝔽</sub>, then ToNumber(ToString(x)) is x.
</li>
<li>
The least significant digit of s is not always uniquely determined by the requirements listed in step <emu-xref href="#step-number-tostring-intermediate-values"></emu-xref>.
Expand Down Expand Up @@ -2368,7 +2368,7 @@ <h1>
1. Let _r_ be the BigInt defined by the mathematical relation _r_ = _n_ - (_d_ &times; _q_) where _q_ is a BigInt that is negative only if _n_/_d_ is negative and positive only if _n_/_d_ is positive, and whose magnitude is as large as possible without exceeding the magnitude of the true mathematical quotient of _n_ and _d_.
1. Return _r_.
</emu-alg>
<emu-note>The sign of the result equals the sign of the dividend.</emu-note>
<emu-note>The sign of the result is the sign of the dividend.</emu-note>
</emu-clause>

<emu-clause id="sec-numeric-types-bigint-add" type="numeric method">
Expand Down Expand Up @@ -2510,7 +2510,7 @@ <h1>
<dl class="header">
</dl>
<emu-alg>
1. If _x_ is 1 and _y_ is 1, return 1.
1. If _x_ = 1 and _y_ = 1, return 1.
1. Else, return 0.
</emu-alg>
</emu-clause>
Expand All @@ -2525,7 +2525,7 @@ <h1>
<dl class="header">
</dl>
<emu-alg>
1. If _x_ is 1 or _y_ is 1, return 1.
1. If _x_ = 1 or _y_ = 1, return 1.
1. Else, return 0.
</emu-alg>
</emu-clause>
Expand All @@ -2540,8 +2540,8 @@ <h1>
<dl class="header">
</dl>
<emu-alg>
1. If _x_ is 1 and _y_ is 0, return 1.
1. Else if _x_ is 0 and _y_ is 1, return 1.
1. If _x_ = 1 and _y_ = 0, return 1.
1. Else if _x_ = 0 and _y_ = 1, return 1.
1. Else, return 0.
</emu-alg>
</emu-clause>
Expand Down Expand Up @@ -3961,7 +3961,7 @@ <h1>The Set and Relation Specification Types</h1>
<li>
<p>For all _a_, _b_, and _c_ in _R_'s domain:</p>
<ul>
<li>_a_ is identical to _b_ or _a_ _R_ _b_ or _b_ _R_ _a_, and</li>
<li>_a_ is _b_ or _a_ _R_ _b_ or _b_ _R_ _a_, and</li>
<li>It is not the case that _a_ _R_ _a_, and</li>
<li>If _a_ _R_ _b_ and _b_ _R_ _c_, then _a_ _R_ _c_.</li>
</ul>
Expand Down Expand Up @@ -4899,7 +4899,7 @@ <h1>
BigInt
</td>
<td>
If _argument_ is *0*<sub>ℤ</sub>, return *false*; otherwise return *true*.
If _argument_ = *0*<sub>ℤ</sub>, return *false*; otherwise return *true*.
</td>
</tr>
<tr>
Expand Down Expand Up @@ -5776,7 +5776,7 @@ <h1>
<emu-alg>
1. If _argument_ is *"-0"*, return *-0*<sub>𝔽</sub>.
1. Let _n_ be ! ToNumber(_argument_).
1. If SameValue(! ToString(_n_), _argument_) is *true*, return _n_.
1. If ! ToString(_n_) is _argument_, return _n_.
1. Return *undefined*.
</emu-alg>
<p>A <dfn variants="canonical numeric strings">canonical numeric string</dfn> is any String value for which the CanonicalNumericIndexString abstract operation does not return *undefined*.</p>
Expand Down Expand Up @@ -5977,8 +5977,8 @@ <h1>
<emu-alg>
1. If Type(_argument_) is not Number, return *false*.
1. If _argument_ is *NaN*, *+&infin;*<sub>𝔽</sub>, or *-&infin;*<sub>𝔽</sub>, return *false*.
1. If floor(abs(ℝ(_argument_))) &ne; abs(ℝ(_argument_)), return *false*.
1. Return *true*.
1. If floor(abs(ℝ(_argument_))) = abs(ℝ(_argument_)), return *true*.
1. Return *false*.
</emu-alg>
</emu-clause>

Expand Down

0 comments on commit bdf6f83

Please sign in to comment.