@cortex-js/compute-engine 0.56.0 → 0.57.0

package/dist/compile.esm.js

@@ -1,4 +1,4 @@
-/** Compute Engine 0.56.0 */
+/** Compute Engine 0.57.0 */
 
 // src/compute-engine/numerics/richardson.ts
 function extrapolate(f, x0, options = {}) {
@@ -5178,6 +5178,64 @@ function parseQuantifier(kind) {
 }
 
 // src/compute-engine/latex-syntax/dictionary/definitions-core.ts
+var COMPONENT_ACCESS_HEADS = {
+  x: "First",
+  y: "Second",
+  z: "Third",
+  real: "Real",
+  re: "Real",
+  imag: "Imaginary",
+  im: "Imaginary",
+  count: "Length",
+  total: "Sum",
+  max: "Max",
+  min: "Min"
+};
+function memberHead(name) {
+  return COMPONENT_ACCESS_HEADS[name] ?? null;
+}
+function parseComponentAccess(parser, lhs) {
+  parser.skipVisualSpace();
+  if (parser.match("\\operatorname")) {
+    const name = parser.parseStringGroup();
+    if (name === null) return null;
+    const head = memberHead(name.trim());
+    if (head === null) return null;
+    return [head, lhs];
+  }
+  const tok = parser.peek;
+  if (typeof tok === "string" && tok.startsWith("\\")) {
+    const bare = tok.slice(1);
+    const head = memberHead(bare);
+    if (head !== null) {
+      parser.nextToken();
+      return [head, lhs];
+    }
+    return null;
+  }
+  if (typeof tok === "string" && /^[a-zA-Z]$/.test(tok)) {
+    const head = memberHead(tok);
+    if (head === null) return null;
+    parser.nextToken();
+    return [head, lhs];
+  }
+  return null;
+}
+function parseWhenRestriction(parser, lhs, close) {
+  parser.addBoundary(close);
+  parser.skipVisualSpace();
+  const cond = parser.parseExpression({ minPrec: 0 });
+  if (cond === null) {
+    parser.removeBoundary();
+    return null;
+  }
+  parser.skipVisualSpace();
+  if (!parser.matchBoundary()) {
+    parser.removeBoundary();
+    return null;
+  }
+  return ["When", lhs, cond];
+}
 function parseSequence(parser, terminator, lhs, prec, sep) {
   if (terminator && terminator.minPrec >= prec) return null;
   const result = lhs ? [lhs] : ["Nothing"];
@@ -5649,6 +5707,15 @@ var DEFINITIONS_CORE = [
     }
   },
   { name: "LatexTokens", serialize: serializeLatexTokens },
+  // Component-access postfix: expr.member  (C3)
+  // The '.' trigger is consumed before the parse function is called.
+  // Precedence 850 > 810 (At/indexing) so .x chains tightly.
+  {
+    kind: "postfix",
+    precedence: 850,
+    latexTrigger: ["."],
+    parse: parseComponentAccess
+  },
   {
     name: "At",
     kind: "postfix",
@@ -5669,6 +5736,29 @@ var DEFINITIONS_CORE = [
     latexTrigger: ["\\left", "\\lbrack"],
     parse: parseAt("\\right", "\\rbrack")
   },
+  // When-restriction: `expr\left\{cond\right\}` → `When(expr, cond)` (D3)
+  {
+    name: "When",
+    kind: "postfix",
+    precedence: 800,
+    latexTrigger: ["\\left", "\\{"],
+    parse: (parser, lhs) => parseWhenRestriction(parser, lhs, ["\\right", "\\}"]),
+    serialize: (serializer, expr) => {
+      const e = operand(expr, 1);
+      const cond = operand(expr, 2);
+      if (!e || !cond) return "";
+      const clauses = operator(cond) === "And" ? operands(cond) ?? [] : [cond];
+      const inner = clauses.map((c) => `\\left\\{${serializer.serialize(c)}\\right\\}`).join("");
+      return `${serializer.serialize(e)}${inner}`;
+    }
+  },
+  // When-restriction: bare `expr\{cond\}` → `When(expr, cond)`
+  {
+    kind: "postfix",
+    precedence: 800,
+    latexTrigger: ["\\{"],
+    parse: (parser, lhs) => parseWhenRestriction(parser, lhs, ["\\}"])
+  },
   {
     kind: "postfix",
     latexTrigger: ["_"],
@@ -5751,6 +5841,29 @@ var DEFINITIONS_CORE = [
       return "";
     }
   },
+  // Additional triggers for Range: `...`, `\ldots`, and `\dots` are
+  // equivalent to `..` when used as infix operators (e.g. `[1...9]`).
+  // No `name` field here — names must be unique per the dictionary rules;
+  // the first Range entry owns the name. When there is no LHS the symbol
+  // entries near the top of the file still fire (ContinuationPlaceholder).
+  {
+    latexTrigger: [".", ".", "."],
+    kind: "infix",
+    precedence: 800,
+    parse: parseRange
+  },
+  {
+    latexTrigger: ["\\ldots"],
+    kind: "infix",
+    precedence: 800,
+    parse: parseRange
+  },
+  {
+    latexTrigger: ["\\dots"],
+    kind: "infix",
+    precedence: 800,
+    parse: parseRange
+  },
   {
     latexTrigger: [";"],
     kind: "infix",
@@ -5935,13 +6048,24 @@ var DEFINITIONS_CORE = [
       const args = operands(expr);
       if (!args || args.length < 2) return "";
       const body = args[0];
-      const indexing = args[1];
-      if (operator(indexing) === "Element") {
-        const index = operand(indexing, 1);
-        const range2 = operand(indexing, 2);
-        if (operator(range2) === "Range") {
-          const lo = operand(range2, 1);
-          const hi = operand(range2, 2);
+      const elements = args.slice(1);
+      const allElements = elements.every((e) => operator(e) === "Element");
+      if (!allElements) {
+        return joinLatex([
+          "\\operatorname{Loop}(",
+          serializer.serialize(body),
+          ", ",
+          serializer.serialize(elements[0]),
+          ")"
+        ]);
+      }
+      if (elements.length === 1) {
+        const elem = elements[0];
+        const index = operand(elem, 1);
+        const coll = operand(elem, 2);
+        if (operator(coll) === "Range") {
+          const lo = operand(coll, 1);
+          const hi = operand(coll, 2);
           return joinLatex([
             "\\text{for }",
             serializer.serialize(index),
@@ -5953,13 +6077,27 @@ var DEFINITIONS_CORE = [
             serializer.serialize(body)
           ]);
         }
+        return joinLatex([
+          serializer.serialize(body),
+          " \\operatorname{for} ",
+          serializer.serialize(index),
+          " = ",
+          serializer.serialize(coll)
+        ]);
       }
+      const bindings = elements.map((elem) => {
+        const name = operand(elem, 1);
+        const coll = operand(elem, 2);
+        return joinLatex([
+          serializer.serialize(name),
+          " = ",
+          serializer.serialize(coll)
+        ]);
+      }).join(", ");
       return joinLatex([
-        "\\operatorname{Loop}(",
         serializer.serialize(body),
-        ", ",
-        serializer.serialize(indexing),
-        ")"
+        " \\operatorname{for} ",
+        bindings
       ]);
     }
   },
@@ -5992,6 +6130,18 @@ var DEFINITIONS_CORE = [
     precedence: 245,
     parse: (parser, until) => parseForExpression(parser, until)
   },
+  // \operatorname{for} as postfix infix (list comprehension):
+  //   `body \operatorname{for} x = L_1, y = L_2`
+  // Precedence 19 — just below comma (20) so the body is allowed to use
+  // any operator (including comma sequencing) up to the keyword, and the
+  // bindings can be comma-separated below us.
+  {
+    symbolTrigger: "for",
+    kind: "infix",
+    associativity: "none",
+    precedence: 19,
+    parse: (parser, lhs, until) => parseForComprehension(parser, lhs, until)
+  },
   // \operatorname{break}
   {
     symbolTrigger: "break",
@@ -6196,7 +6346,10 @@ var DEFINITIONS_CORE = [
       if (!sym2 || !parser.getSymbolType(sym2).matches("function")) return null;
       parser.addBoundary([")"]);
       const expr = parser.parseExpression(until);
-      if (!parser.matchBoundary()) return null;
+      if (!parser.matchBoundary()) {
+        parser.removeBoundary();
+        return null;
+      }
       if (!parser.match("<}>")) return null;
       return ["Derivative", lhs, expr];
     }
@@ -6637,7 +6790,12 @@ function parseBrackets(parser, body) {
   if (isEmptySequence(body)) return ["List"];
   const h = operator(body);
   if (h === "Range" || h === "Linspace") return body;
-  if (h === "Sequence") return ["List", ...operands(body)];
+  if (h === "Sequence") {
+    const elems = operands(body);
+    const inferred = tryInferRangeFromElements(elems, parser);
+    if (inferred) return inferred;
+    return ["List", ...elems];
+  }
   if (h === "Delimiter") {
     const delim = stringValue(operand(body, 2)) ?? "...";
     if (delim === ";" || delim === ".;.") {
@@ -6650,12 +6808,37 @@ function parseBrackets(parser, body) {
     }
     if (delim === "," || delim === ".,.") {
       body = operand(body, 1);
-      if (operator(body) === "Sequence") return ["List", ...operands(body)];
+      if (operator(body) === "Sequence") {
+        const elems = operands(body);
+        const inferred = tryInferRangeFromElements(elems, parser);
+        if (inferred) return inferred;
+        return ["List", ...elems];
+      }
       return ["List", body ?? "Nothing"];
     }
   }
   return ["List", body];
 }
+function tryInferRangeFromElements(elems, parser) {
+  if (elems.length < 4) return null;
+  const penultimate = elems[elems.length - 2];
+  if (symbol(penultimate) !== "ContinuationPlaceholder") return null;
+  const samples = elems.slice(0, -2);
+  const endExpr = elems[elems.length - 1];
+  if (samples.length < 2) return null;
+  const sampleNums = samples.map(machineValue);
+  if (sampleNums.some((n) => n === null)) return null;
+  const nums = sampleNums;
+  const step = nums[nums.length - 1] - nums[nums.length - 2];
+  const tol = parser.options.tolerance;
+  if (Math.abs(step) < tol)
+    return parser.error("degenerate-range-step", parser.index);
+  for (let i = 1; i < nums.length; i++) {
+    if (Math.abs(nums[i] - nums[i - 1] - step) > tol)
+      return parser.error("inconsistent-range-samples", parser.index);
+  }
+  return ["Range", nums[0], endExpr, step];
+}
 function serializeList(serializer, expr) {
   if (nops(expr) > 1 && operands(expr).every((x) => {
     const op = operator(x);
@@ -6907,6 +7090,35 @@ function parseForExpression(parser, until) {
     ["Element", index, ["Range", lower, upper]]
   ];
 }
+function parseForComprehension(parser, lhs, until) {
+  const bindingTerminator = {
+    minPrec: 21,
+    // Above comma (20) and ; (19), so `x = L_1` is captured whole
+    condition: (p) => {
+      if (until?.condition?.(p)) return true;
+      const saved = p.index;
+      p.skipVisualSpace();
+      const isComma = p.peek === ",";
+      p.index = saved;
+      return isComma;
+    }
+  };
+  const elements = [];
+  do {
+    parser.skipVisualSpace();
+    const binding = parser.parseExpression(bindingTerminator);
+    if (binding === null) break;
+    const op = operator(binding);
+    if (op !== "Equal" && op !== "Assign") return null;
+    const name = operand(binding, 1);
+    const list = operand(binding, 2);
+    if (!name || !list) return null;
+    elements.push(["Element", name, list]);
+    parser.skipVisualSpace();
+  } while (parser.match(","));
+  if (elements.length === 0) return null;
+  return ["Loop", lhs, ...elements];
+}
 function parseWhereExpression(parser, lhs, until) {
   const bindingTerminator = {
     minPrec: 21,
@@ -12803,7 +13015,11 @@ var COLLECTIONS_LIBRARY = {
   //
   Range: {
     complexity: 8200,
-    signature: "(number, number?, step: number?) -> indexed_collection<integer>",
+    signature: "(number, number?, step: number?) -> indexed_collection<number>",
+    type: (ops) => {
+      const allInt = ops.every((op) => op.isInteger);
+      return allInt ? parseType("indexed_collection<integer>") : parseType("indexed_collection<number>");
+    },
     canonical: (ops, { engine: ce }) => {
       if (ops.length === 0) return null;
       if (ops.length === 1) return ce._fn("Range", [ce.One, ops[0].canonical]);
@@ -12827,19 +13043,26 @@ var COLLECTIONS_LIBRARY = {
         const [lower, upper, step] = range(expr);
         if (step === 0) return 0;
         if (!isFinite(lower) || !isFinite(upper)) return Infinity;
-        return 1 + Math.max(0, Math.floor((upper - lower) / step));
+        return Math.max(0, Math.floor((upper - lower) / step) + 1);
       },
       contains: (expr, target) => {
-        if (!target.type.matches("integer")) return false;
         const t = target.re;
+        if (!isFinite(t)) return false;
         const [lower, upper, step] = range(expr);
         if (step === 0) return false;
-        if (step > 0) return t >= lower && t <= upper;
-        return t <= lower && t >= upper;
+        if (step > 0) {
+          if (t < lower || t > upper) return false;
+        } else {
+          if (t > lower || t < upper) return false;
+        }
+        const k = (t - lower) / step;
+        const tol = expr.engine.tolerance;
+        const kRounded = Math.round(k);
+        return kRounded >= 0 && Math.abs(k - kRounded) < tol;
       },
       iterator: (expr) => {
         const [lower, upper, step] = range(expr);
-        const maxCount = step === 0 ? 0 : Math.floor((upper - lower) / step) + 1;
+        const maxCount = step === 0 ? 0 : Math.max(0, Math.floor((upper - lower) / step) + 1);
         let index = 1;
         return {
           next: () => {
@@ -12857,7 +13080,9 @@ var COLLECTIONS_LIBRARY = {
       at: (expr, index) => {
         if (typeof index !== "number") return void 0;
         const [lower, upper, step] = range(expr);
-        if (index < 1 || index > 1 + (upper - lower) / step) return void 0;
+        if (step === 0) return void 0;
+        const maxCount = Math.max(0, Math.floor((upper - lower) / step) + 1);
+        if (index < 1 || index > maxCount) return void 0;
         return expr.engine.number(lower + step * (index - 1));
       },
       indexWhere: void 0,
@@ -12882,7 +13107,13 @@ var COLLECTIONS_LIBRARY = {
         if (step > 0) return lower <= upper ? "positive" : "negative";
         return lower >= upper ? "positive" : "negative";
       },
-      elttype: (_expr) => "finite_integer"
+      elttype: (expr) => {
+        if (!isFunction2(expr)) return "finite_integer";
+        for (let i = 1; i <= expr.nops; i++) {
+          if (!expr[`op${i}`].isInteger) return "finite_real";
+        }
+        return "finite_integer";
+      }
     }
   },
   Interval: {
@@ -13480,15 +13711,45 @@ var COLLECTIONS_LIBRARY = {
   },
   First: {
     complexity: 8200,
-    signature: "(collection) -> any",
+    signature: "(any) -> any",
     type: ([xs]) => xs.operatorDefinition?.collection?.elttype?.(xs) ?? "any",
-    evaluate: ([xs], { engine: ce }) => xs.at(1) ?? ce.Nothing
+    evaluate: ([xs], { engine: ce }) => {
+      if (!xs.isCollection)
+        return ce.error([
+          "incompatible-type",
+          `'collection'`,
+          xs.type.toString()
+        ]);
+      return xs.at(1) ?? ce.Nothing;
+    }
   },
   Second: {
     complexity: 8200,
-    signature: "(collection) -> any",
+    signature: "(any) -> any",
     type: ([xs]) => xs.operatorDefinition?.collection?.elttype?.(xs) ?? "any",
-    evaluate: ([xs], { engine: ce }) => xs.at(2) ?? ce.Nothing
+    evaluate: ([xs], { engine: ce }) => {
+      if (!xs.isCollection)
+        return ce.error([
+          "incompatible-type",
+          `'collection'`,
+          xs.type.toString()
+        ]);
+      return xs.at(2) ?? ce.Nothing;
+    }
+  },
+  Third: {
+    complexity: 8200,
+    signature: "(any) -> any",
+    type: ([xs]) => xs.operatorDefinition?.collection?.elttype?.(xs) ?? "any",
+    evaluate: ([xs], { engine: ce }) => {
+      if (!xs.isCollection)
+        return ce.error([
+          "incompatible-type",
+          `'collection'`,
+          xs.type.toString()
+        ]);
+      return xs.at(3) ?? ce.Nothing;
+    }
   },
   Last: {
     complexity: 8200,
@@ -14467,17 +14728,14 @@ function range(expr) {
   if (!isFunction2(expr)) return [1, 0, 0];
   if (expr.nops === 0) return [1, 0, 0];
   let op1 = expr.op1.re;
-  if (!isFinite(op1)) op1 = 1;
-  else op1 = Math.round(op1);
+  if (!isFinite(op1) && !op1) op1 = 1;
   if (expr.nops === 1) return [1, op1, 1];
   let op2 = expr.op2.re;
   if (!isFinite(op2) && !op2) op2 = 1;
-  else if (isFinite(op2)) op2 = Math.round(op2);
-  if (expr.nops === 2) return [op1, op2, op2 > op1 ? 1 : -1];
+  if (expr.nops === 2) return [op1, op2, op2 >= op1 ? 1 : -1];
   let op3 = expr.op3.re;
-  if (!isFinite(op3)) op3 = 1;
-  else op3 = Math.abs(Math.round(op3));
-  return [op1, op2, op1 < op2 ? op3 : -op3];
+  if (!isFinite(op3) && !op3) op3 = 1;
+  return [op1, op2, op3];
 }
 function canonicalList(ops, { engine: ce }) {
   const op1 = ops[0];
@@ -14826,6 +15084,23 @@ var BaseCompiler = class _BaseCompiler {
       };
       return compilePair(0);
     }
+    if (h === "When") {
+      if (args.length !== 2)
+        throw new Error("When: expected exactly 2 arguments (expr, cond)");
+      const fn2 = target.functions?.(h);
+      if (fn2) {
+        if (typeof fn2 === "function") {
+          return fn2(args, (expr) => _BaseCompiler.compile(expr, target), target);
+        }
+        return `${fn2}(${args.map((x) => _BaseCompiler.compile(x, target)).join(", ")})`;
+      }
+      if (isSymbol2(args[1], "True"))
+        return `(${_BaseCompiler.compile(args[0], target)})`;
+      if (isSymbol2(args[1], "False")) return "NaN";
+      const val = _BaseCompiler.compile(args[0], target);
+      const cond = _BaseCompiler.compile(args[1], target);
+      return `((${cond}) ? (${val}) : NaN)`;
+    }
     if (h === "Block") {
       return _BaseCompiler.compileBlock(args, target);
     }
@@ -14900,17 +15175,91 @@ var BaseCompiler = class _BaseCompiler {
     )}${target.ws("\n")}})()`;
   }
   /**
-   * Compile a Loop expression with Element(index, Range(lo, hi)) indexing.
-   * Generates: (() => { for (let i = lo; i <= hi; i++) { body } })()
+   * Compile a Loop expression.
+   *
+   * Two forms are supported:
+   *
+   * 1. **Imperative / single-Element form** (existing behaviour):
+   *    `Loop(body, Element(i, Range(lo, hi)))`
+   *    Generates a raw `for (let i = lo; i <= hi; i++) { body }` loop wrapped
+   *    in an IIFE.  The loop counter is always a plain number.  For targets
+   *    that wrap numeric values (e.g. interval-js uses `_IA.point()`),
+   *    references to the loop index inside the body are re-wrapped via
+   *    `target.number`.  `break` / `continue` / `return` are preserved.
+   *
+   * 2. **Comprehension / variadic-Element form** (new):
+   *    `Loop(body, Element(x, coll1), Element(y, coll2), …)`
+   *    When two or more `Element` clauses are present — or when the single
+   *    Element's collection is not a `Range` — the loop is compiled as a
+   *    comprehension that collects results into an array.  Each clause
+   *    produces a `for (const name of collection)` loop, nested
+   *    outermost-to-innermost, and the innermost body pushes into `result`.
+   *
+   *    Example output (JS):
+   *    ```js
+   *    (() => { const result = [];
+   *      for (const x of [1,2]) { for (const y of [3,4]) { result.push(body); } }
+   *      return result; })()
+   *    ```
    *
-   * The loop counter is always a raw number. For targets that wrap numeric
-   * values (e.g. interval-js wraps with `_IA.point()`), references to the
-   * loop index inside the body are wrapped via `target.number`.
+   *    GLSL: multi-Element comprehension is not trivially representable in
+   *    GLSL (no dynamic arrays, no push).  A compile-time error is thrown.
+   *    TODO(E3-GLSL): support GLSL multi-Element via a pre-declared fixed-size
+   *    array or by unrolling when bounds are known at compile time.
    */
   static compileForLoop(args, target) {
     if (!args[0]) throw new Error("Loop: no body");
     if (!args[1]) throw new Error("Loop: no indexing set");
-    const indexing = args[1];
+    const body = args[0];
+    const elements = args.slice(1);
+    const useComprehension = elements.length > 1 || elements.length === 1 && isFunction2(elements[0], "Element") && !_BaseCompiler.isLegacyCompatibleRange(elements[0].ops[1]);
+    if (useComprehension) {
+      const lang = target.language ?? "";
+      if (lang === "glsl" || lang === "wgsl") {
+        throw new Error(
+          `${lang.toUpperCase()}: multi-Element Loop comprehension is not yet supported. TODO(E3-GLSL): unroll or use a fixed-size array.`
+        );
+      }
+      const narrowedElements = [];
+      for (let i = 0; i < elements.length; i++) {
+        const elem = elements[i];
+        if (!isFunction2(elem, "Element"))
+          throw new Error(
+            `Loop: argument ${i + 1} must be an Element clause, got ${elem.operator ?? "?"}`
+          );
+        if (!isSymbol2(elem.ops[0]))
+          throw new Error(
+            `Loop: Element index (argument ${i + 1}) must be a symbol`
+          );
+        narrowedElements.push(elem);
+      }
+      const loopVarSet = new Set(
+        narrowedElements.map(
+          (e) => e.ops[0].symbol
+        )
+      );
+      const needsWrap2 = target.number(0) !== "0";
+      const bodyTarget2 = needsWrap2 ? {
+        ...target,
+        var: (id) => loopVarSet.has(id) ? target.number(0).replace("0", id) : target.var(id)
+      } : target;
+      const bodyCode = _BaseCompiler.compile(body, bodyTarget2);
+      let inner = `result.push(${bodyCode});`;
+      for (let i = narrowedElements.length - 1; i >= 0; i--) {
+        const elem = narrowedElements[i];
+        const name = elem.ops[0].symbol;
+        const collExpr = elem.ops[1];
+        let collection;
+        if (isFunction2(collExpr, "Range")) {
+          collection = _BaseCompiler.compileRangeIterable(collExpr, bodyTarget2);
+        } else {
+          collection = _BaseCompiler.compile(collExpr, bodyTarget2);
+        }
+        inner = `for (const ${name} of ${collection}) { ${inner} }`;
+      }
+      return `(() => { const result = []; ${inner} return result; })()`;
+    }
+    const indexing = elements[0];
     if (!isFunction2(indexing, "Element"))
       throw new Error("Loop: expected Element(index, Range(lo, hi))");
     const indexExpr = indexing.ops[0];
@@ -14928,13 +15277,72 @@ var BaseCompiler = class _BaseCompiler {
       ...target,
       var: (id) => id === index ? needsWrap ? target.number(0).replace("0", index) : index : target.var(id)
     };
-    const bodyStmts = _BaseCompiler.compileLoopBody(args[0], bodyTarget);
+    const bodyStmts = _BaseCompiler.compileLoopBody(body, bodyTarget);
     return `(() => {${target.ws(
       "\n"
     )}for (let ${index} = ${lower}; ${index} <= ${upper}; ${index}++) {${target.ws(
       "\n"
     )}${bodyStmts}${target.ws("\n")}}${target.ws("\n")}})()`;
   }
+  /**
+   * Returns `true` when the given collection expression is a `Range` whose
+   * runtime semantics match the legacy imperative for-loop shape
+   * `for (let i = lo; i <= hi; i++)`.
+   *
+   * Concretely: integer-ascending bounds and step omitted-or-1. When bounds
+   * are not statically numeric we accept the Range (the historical
+   * behaviour) — runtime mismatch in the descending-unknown-bounds case is
+   * left as a known limitation; callers can force the iterable path by
+   * supplying an explicit step.
+   */
+  static isLegacyCompatibleRange(coll) {
+    if (!isFunction2(coll, "Range")) return false;
+    if (coll.ops.length >= 3) {
+      const stepExpr = coll.ops[2];
+      if (!isNumber(stepExpr) || stepExpr.re !== 1) return false;
+    }
+    const lo = coll.ops[0];
+    const hi = coll.ops[1];
+    if (isNumber(lo) && !Number.isInteger(lo.re)) return false;
+    if (isNumber(hi) && !Number.isInteger(hi.re)) return false;
+    if (isNumber(lo) && isNumber(hi) && lo.re > hi.re) return false;
+    return true;
+  }
+  /**
+   * Compile a `Range(lo, hi)` or `Range(lo, hi, step)` expression into a JS
+   * iterable expression. Mirrors the runtime semantics in
+   * `library/collections.ts` Range:
+   *     count    = step === 0 ? 0 : max(0, floor((hi - lo) / step) + 1)
+   *     element  = lo + step * k          (0-indexed)
+   * Default step is 1 when omitted. Bounds and step may be fractional.
+   *
+   * Only used from the comprehension path in `compileForLoop`.
+   * Caller must have already verified `isFunction(rangeExpr, 'Range')`.
+   */
+  static compileRangeIterable(rangeExpr, target) {
+    const loExpr = rangeExpr.ops[0];
+    const hiExpr = rangeExpr.ops[1];
+    const stepExpr = rangeExpr.ops[2];
+    if (isNumber(loExpr) && isNumber(hiExpr) && (stepExpr === void 0 || isNumber(stepExpr))) {
+      const lo2 = loExpr.re;
+      const hi2 = hiExpr.re;
+      const step2 = stepExpr === void 0 ? hi2 >= lo2 ? 1 : -1 : stepExpr.re;
+      if (step2 === 0) return "[]";
+      const len = Math.max(0, Math.floor((hi2 - lo2) / step2) + 1);
+      if (step2 === 1) {
+        if (lo2 === 0) return `Array.from({length:${len}},(_,k)=>k)`;
+        return `Array.from({length:${len}},(_,k)=>${lo2}+k)`;
+      }
+      return `Array.from({length:${len}},(_,k)=>${lo2}+(${step2})*k)`;
+    }
+    const lo = _BaseCompiler.compile(loExpr, target);
+    const hi = _BaseCompiler.compile(hiExpr, target);
+    if (stepExpr === void 0) {
+      return `((_lo,_hi)=>{const _st=_hi>=_lo?1:-1;return Array.from({length:Math.max(0,Math.floor((_hi-_lo)/_st)+1)},(_,k)=>_lo+_st*k);})(${lo},${hi})`;
+    }
+    const step = _BaseCompiler.compile(stepExpr, target);
+    return `((_lo,_hi,_st)=>_st===0?[]:Array.from({length:Math.max(0,Math.floor((_hi-_lo)/_st)+1)},(_,k)=>_lo+_st*k))(${lo},${hi},${step})`;
+  }
   /**
    * Compile a loop body expression as statements (not wrapped in IIFE).
    * Handles Break, Continue, Return as statements, and If as if-else when
@@ -25501,7 +25909,7 @@ function compileToIntervalTarget(expr, target) {
 }
 
 // src/compile.ts
-var version = "0.56.0";
+var version = "0.57.0";
 export {
   BaseCompiler,
   GLSLTarget,