From dea69cf23dc0d209157d98fb3c706d1b65becff4 Mon Sep 17 00:00:00 2001 From: Jack Works <5390719+Jack-Works@users.noreply.github.com> Date: Thu, 29 Oct 2026 11:15:07 +0800 Subject: [PATCH 1/2] Fix compare with -0 --- spec.emu | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/spec.emu b/spec.emu index 00fa962..e335486 100644 --- a/spec.emu +++ b/spec.emu @@ -59,7 +59,7 @@ contributors: Jack Works 1. Let _one_ be *1*𝔽. 1. Else, 1. Assert: _start_ is a BigInt. - Allowing all kinds of number (bigint, decimals, ...) to range from a finite number to infinity. + Allowing all kinds of numbers (bigint, decimals, ...) to range from a finite number to infinity. 1. If _end_ is not *+∞*𝔽 or *-∞*𝔽 and _end_ is not a BigInt, throw a *TypeError* exception. 1. Let _zero_ be *0*ℤ. 1. Let _one_ be *1*ℤ. @@ -86,7 +86,7 @@ contributors: Jack Works 1. If _type_ is ~number-range~ and _step_ is not a Number, throw a *TypeError* exception. 1. Else if _type_ is ~bigint-range~ and _step_ is not a BigInt, throw a *TypeError* exception. 1. If _step_ is *+∞*𝔽 or *-∞*𝔽, throw a *RangeError* exception. - 1. If _step_ is _zero_ and _start_ is not _end_, throw a *RangeError* exception. + 1. If SameValueZero(_step_, _zero_) is *true* and _start_ is not _end_, throw a *RangeError* exception. 1. Let _closure_ be a new Abstract Closure with no parameters that captures _start_, _end_, _step_, _inclusiveEnd_, _zero_, _one_ and performs the following steps when called: 1. If _end_ is *+∞*𝔽, let _ifIncrease_ be *true*. 1. Else if _end_ is *-∞*𝔽, let _ifIncrease_ be *false*. From d9f32c492abccfdc62f54a4fc5737f5135f5f927 Mon Sep 17 00:00:00 2001 From: Jack-Works Date: Thu, 29 Oct 2026 03:15:38 +0000 Subject: [PATCH 2/2] fixup: [spec] `npm run build` --- index.html | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/index.html b/index.html index 94afdf7..514eef0 100644 --- a/index.html +++ b/index.html @@ -3265,12 +3265,12 @@ @media print { @page :left { @bottom-right { - content: '© Ecma International 2025'; + content: '© Ecma International 2026'; } } @page :right { @bottom-left { - content: '© Ecma International 2025'; + content: '© Ecma International 2026'; } } @page :first { @@ -3301,7 +3301,7 @@

Stage 1 Draft / February 5, 2025

Range proposal

+

Stage 1 Draft / October 29, 2026

Range proposal

27 Control Abstraction Objects

@@ -3330,7 +3330,7 @@

27.1.4 The NumericRangeIterat

27.1.4.1 CreateNumericRangeIterator ( start, end, optionOrStep, type )

The abstract operation CreateNumericRangeIterator takes arguments start (a Number or a BigInt), end (an ECMAScript language value), optionOrStep (an ECMAScript language value), and type (number-range or bigint-range) and returns either a normal completion containing an ECMAScript language value or a throw completion. It performs the following steps when called:

  1. If start is NaN, throw a RangeError exception.
  2. If end is NaN, throw a RangeError exception.
  3. If type is number-range, then
    1. Assert: start is a Number.
    2. If end is not a Number, throw a TypeError exception.
    3. Let zero be +0𝔽.
    4. Let one be 1𝔽.
  4. Else,
    1. Assert: start is a BigInt. - Editor's Note
      Allowing all kinds of number (bigint, decimals, ...) to range from a finite number to infinity.
    2. If end is not +∞𝔽 or -∞𝔽 and end is not a BigInt, throw a TypeError exception.
    3. Let zero be 0ℤ.
    4. Let one be 1ℤ.
  5. If start is +∞𝔽 or -∞𝔽, throw a RangeError exception.
  6. Let inclusiveEnd be false.
  7. If optionOrStep is undefined or null, then
    1. Let step be undefined.
  8. Else if optionOrStep is an Object, then
    1. Let step be ? Get(optionOrStep, "step").
    2. Set inclusiveEnd to ToBoolean(? Get(optionOrStep, "inclusive")).
  9. Else if type is number-range and optionOrStep is a Number, then
    1. Let step be optionOrStep.
  10. Else if type is bigint-range and optionOrStep is a BigInt, then
    1. Let step be optionOrStep.
  11. Else,
    1. Throw a TypeError exception.
  12. If step is undefined or null, then
    1. If end is +∞𝔽, let step be one.
    2. Else if end is -∞𝔽, let step be -one.
    3. Assert: In the next branch, end is a BigInt and start is a BigInt, or end is a Number and start is a Number.
    4. Else if end > start, let step be one.
    5. Else let step be -one.
  13. If step is NaN, throw a RangeError exception.
  14. If type is number-range and step is not a Number, throw a TypeError exception.
  15. Else if type is bigint-range and step is not a BigInt, throw a TypeError exception.
  16. If step is +∞𝔽 or -∞𝔽, throw a RangeError exception.
  17. If step is zero and start is not end, throw a RangeError exception.
  18. Let closure be a new Abstract Closure with no parameters that captures start, end, step, inclusiveEnd, zero, one and performs the following steps when called:
    1. If end is +∞𝔽, let ifIncrease be true.
    2. Else if end is -∞𝔽, let ifIncrease be false.
    3. Assert: In the next branch, end is a BigInt and start is a BigInt, or end is a Number and start is a Number.
    4. Else if end > start, let ifIncrease be true.
    5. Else let ifIncrease be false.
    6. If step > zero, let ifStepIncrease be true.
    7. Else let ifStepIncrease be false.
    8. If ifIncrease is not ifStepIncrease, return undefined.
    9. Let hitsEnd be false.
    10. Let currentCount be zero.
    11. NOTE: You can debug these steps at https://tc39.es/proposal-Number.range/playground.html .
    12. Repeat, while hitsEnd is false,
      1. Let currentYieldingValue be start + (step * currentCount).
      2. If currentYieldingValue is end, Set hitsEnd to true.
      3. Set currentCount to currentCount + one.
      4. If ifIncrease is true, then
        1. Assert: end is a BigInt or +∞𝔽 and currentYieldingValue is a BigInt, or end is a Number and + Editor's Note
          Allowing all kinds of numbers (bigint, decimals, ...) to range from a finite number to infinity.
        2. If end is not +∞𝔽 or -∞𝔽 and end is not a BigInt, throw a TypeError exception.
        3. Let zero be 0ℤ.
        4. Let one be 1ℤ.
      5. If start is +∞𝔽 or -∞𝔽, throw a RangeError exception.
      6. Let inclusiveEnd be false.
      7. If optionOrStep is undefined or null, then
        1. Let step be undefined.
      8. Else if optionOrStep is an Object, then
        1. Let step be ? Get(optionOrStep, "step").
        2. Set inclusiveEnd to ToBoolean(? Get(optionOrStep, "inclusive")).
      9. Else if type is number-range and optionOrStep is a Number, then
        1. Let step be optionOrStep.
      10. Else if type is bigint-range and optionOrStep is a BigInt, then
        1. Let step be optionOrStep.
      11. Else,
        1. Throw a TypeError exception.
      12. If step is undefined or null, then
        1. If end is +∞𝔽, let step be one.
        2. Else if end is -∞𝔽, let step be -one.
        3. Assert: In the next branch, end is a BigInt and start is a BigInt, or end is a Number and start is a Number.
        4. Else if end > start, let step be one.
        5. Else let step be -one.
      13. If step is NaN, throw a RangeError exception.
      14. If type is number-range and step is not a Number, throw a TypeError exception.
      15. Else if type is bigint-range and step is not a BigInt, throw a TypeError exception.
      16. If step is +∞𝔽 or -∞𝔽, throw a RangeError exception.
      17. If SameValueZero(step, zero) is true and start is not end, throw a RangeError exception.
      18. Let closure be a new Abstract Closure with no parameters that captures start, end, step, inclusiveEnd, zero, one and performs the following steps when called:
        1. If end is +∞𝔽, let ifIncrease be true.
        2. Else if end is -∞𝔽, let ifIncrease be false.
        3. Assert: In the next branch, end is a BigInt and start is a BigInt, or end is a Number and start is a Number.
        4. Else if end > start, let ifIncrease be true.
        5. Else let ifIncrease be false.
        6. If step > zero, let ifStepIncrease be true.
        7. Else let ifStepIncrease be false.
        8. If ifIncrease is not ifStepIncrease, return undefined.
        9. Let hitsEnd be false.
        10. Let currentCount be zero.
        11. NOTE: You can debug these steps at https://tc39.es/proposal-Number.range/playground.html .
        12. Repeat, while hitsEnd is false,
          1. Let currentYieldingValue be start + (step * currentCount).
          2. If currentYieldingValue is end, Set hitsEnd to true.
          3. Set currentCount to currentCount + one.
          4. If ifIncrease is true, then
            1. Assert: end is a BigInt or +∞𝔽 and currentYieldingValue is a BigInt, or end is a Number and currentYieldingValue is a Number.
            2. If end is not +∞𝔽, then
              1. If inclusiveEnd is true, then
                1. If currentYieldingValue > end, return undefined.
              2. Else,
                1. If currentYieldingValue ≥ end, return undefined.
          5. Else,
            1. Assert: end is a BigInt or -∞𝔽 and currentYieldingValue is a BigInt, or end is a Number and currentYieldingValue is a Number.
            2. If end is not -∞𝔽, then
              1. If inclusiveEnd is true, then
                1. If end > currentYieldingValue, return undefined.
              2. Else,
                1. If end ≥ currentYieldingValue, return undefined.
          6. Perform ? Yield(currentYieldingValue).
        13. Return undefined.
      19. Return CreateIteratorFromClosure(closure, "%NumericRangeIteratorPrototype%", %NumericRangeIteratorPrototype%).