Skip to content

Commit

Permalink
tweaks and examples
Browse files Browse the repository at this point in the history
  • Loading branch information
michaelficarra committed Aug 12, 2022
1 parent c91172f commit 7cce6c6
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions spec.html
Original file line number Diff line number Diff line change
Expand Up @@ -1024,7 +1024,7 @@ <h1>Mathematical Operations</h1>
<emu-note>
<p><emu-eqn>floor(_x_) = _x_ - (_x_ modulo 1)</emu-eqn>.</p>
</emu-note>
<p>An <dfn id="interval">interval</dfn> from lower bound _a_ to upper bound _b_ is a possibly-infinite, possibly-empty set of numeric values of the same numeric type. A numeric value _x_ is included in the interval if it satisfies both its <dfn>lower bound criteria</dfn> and its <dfn>upper bound criteria</dfn>. If an interval's lower bound is described as inclusive, its lower bound criteria is _a_ &le; _x_; otherwise it is _a_ &lt; _x_. If an interval's upper bound is described as inclusive, its upper bound criteria is _x_ &le; _b_; otherwise it is _x_ &lt; _b_. An <dfn id="inclusive-interval">inclusive interval</dfn> is an interval where both bounds are inclusive. It is an editorial error if a lower bound or upper bound is not described as either inclusive or exclusive. For the purpose of defining intervals, *-0*<sub>𝔽</sub> &lt; <!-- this comment here to avoid ecmarkup complaining about comparison to 0 --> *+0*<sub>𝔽</sub>. *NaN* is never included in an interval.</p>
<p>An <dfn id="interval">interval</dfn> from lower bound _a_ to upper bound _b_ is a possibly-infinite, possibly-empty set of numeric values of the same numeric type. A numeric value _x_ is included in the interval if it satisfies both its <em>lower bound condition</em> and its <em>upper bound condition</em>. If an interval's lower bound is described as inclusive, its lower bound condition is _a_ &le; _x_; otherwise it is _a_ &lt; _x_. If an interval's upper bound is described as inclusive, its upper bound condition is _x_ &le; _b_; otherwise it is _x_ &lt; _b_. For example, the interval from 1 (inclusive) to 2 (exclusive) consists of all mathematical values between 1 and 2, including 1 and not including 2. An <dfn id="inclusive-interval">inclusive interval</dfn> is an interval where both bounds are inclusive. It is an editorial error if any bound of an interval is not described as either inclusive or exclusive. For the purpose of defining intervals, *-0*<sub>𝔽</sub> &lt; <!-- this comment here to avoid ecmarkup complaining about comparison to 0 --> *+0*<sub>𝔽</sub>, so, for example, an inclusive interval with a lower bound of *+0*<sub>𝔽</sub> includes *+0*<sub>𝔽</sub> but not *-0*<sub>𝔽</sub>. *NaN* is never included in an interval.</p>
</emu-clause>

<emu-clause id="sec-value-notation">
Expand Down Expand Up @@ -3901,7 +3901,7 @@ <h1>Well-Known Intrinsic Objects</h1>
<h1>ECMAScript Specification Types</h1>
<p>A specification type corresponds to meta-values that are used within algorithms to describe the semantics of ECMAScript language constructs and ECMAScript language types. The specification types include Reference, List, Completion Record, Property Descriptor, Environment Record, Abstract Closure, and Data Block. Specification type values are specification artefacts that do not necessarily correspond to any specific entity within an ECMAScript implementation. Specification type values may be used to describe intermediate results of ECMAScript expression evaluation but such values cannot be stored as properties of objects or values of ECMAScript language variables.</p>

<emu-clause id="sec-list-and-record-specification-type">
<emu-clause id="sec-list-and-record-specification-type"
<h1>The List and Record Specification Types</h1>
<p>The <dfn variants="Lists">List</dfn> type is used to explain the evaluation of argument lists (see <emu-xref href="#sec-argument-lists"></emu-xref>) in `new` expressions, in function calls, and in other algorithms where a simple ordered list of values is needed. Values of the List type are simply ordered sequences of list elements containing the individual values. These sequences may be of any length. The elements of a list may be randomly accessed using 0-origin indices. For notational convenience an array-like syntax can be used to access List elements. For example, _arguments_[2] is shorthand for saying the 3<sup>rd</sup> element of the List _arguments_.</p>
<p>When an algorithm iterates over the elements of a List without specifying an order, the order used is the order of the elements in the List.</p>
Expand Down

0 comments on commit 7cce6c6

Please sign in to comment.