@cortex-js/compute-engine 0.56.0 → 0.58.0

package/dist/compile.umd.cjs

@@ -1,4 +1,4 @@
-/** Compile 0.56.0 */
+/** Compile 0.58.0 */
     (function(global,factory){typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : typeof define === 'function' && define.amd ? define(['exports'],factory):(global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.Compile = {}));})(this, (function (exports) { 'use strict';
 var Compile = (() => {
   var __defProp = Object.defineProperty;
@@ -3568,7 +3568,42 @@ var Compile = (() => {
     if (b === "nothing") return a;
     if (isSubtype(a, b)) return b;
     if (isSubtype(b, a)) return a;
-    return superType(a, b);
+    const sup = superType(a, b);
+    if (LOSSY_SUPERTYPE.has(sup)) return unionTypes(a, b);
+    return sup;
+  }
+  var LOSSY_SUPERTYPE = /* @__PURE__ */ new Set([
+    "scalar",
+    "value",
+    "function",
+    "expression",
+    "collection",
+    "indexed_collection",
+    "list",
+    "set",
+    "tuple",
+    "record",
+    "dictionary",
+    "map",
+    "any"
+  ]);
+  function unionTypes(a, b) {
+    const members = [];
+    const push = (t) => {
+      if (typeof t === "object" && t.kind === "union") {
+        for (const m of t.types) push(m);
+        return;
+      }
+      const key = typeof t === "string" ? t : JSON.stringify(t);
+      if (!members.some(
+        (m) => (typeof m === "string" ? m : JSON.stringify(m)) === key
+      ))
+        members.push(t);
+    };
+    push(a);
+    push(b);
+    if (members.length === 1) return members[0];
+    return { kind: "union", types: members };
   }
   function narrow(...types) {
     if (types.length === 0) return "nothing";
@@ -3642,7 +3677,7 @@ var Compile = (() => {
     if (type.kind === "set") return type.elements;
     if (type.kind === "tuple") return widen(...type.elements.map((x) => x.type));
     if (type.kind === "dictionary")
-      return parseType(`tuple<string, ${type.values}>`);
+      return parseType(`tuple<string, ${typeToString(type.values)}>`);
     if (type.kind === "record") {
       return parseType(
         `tuple<string, ${typeToString(widen(...Object.values(type.elements)))}>`
@@ -5211,6 +5246,64 @@ var Compile = (() => {
   }
 
   // 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"];
@@ -5486,15 +5579,16 @@ var Compile = (() => {
       precedence: ASSIGNMENT_PRECEDENCE,
       parse: parseAssign
     },
-    // General colon operator (type annotation, mapping notation)
-    // Precedence below assignment (260) so `:=` takes priority,
-    // and below arrows (270) so `f: A \to B` parses as `Colon(f, To(A, B))`
+    // General colon operator (type annotation, mapping notation, Desmos piecewise)
+    // Precedence below comparisons (245) so `cond : val` (Desmos compact piecewise)
+    // parses as `Colon(cond, val)`, and below arrows (270) so
+    // `f: A \to B` parses as `Colon(f, To(A, B))`.
     {
       name: "Colon",
       latexTrigger: ":",
       kind: "infix",
       associativity: "right",
-      precedence: 250,
+      precedence: 240,
       serialize: (serializer, expr) => joinLatex([
         serializer.serialize(operand(expr, 1)),
         "\\colon",
@@ -5505,7 +5599,7 @@ var Compile = (() => {
       latexTrigger: "\\colon",
       kind: "infix",
       associativity: "right",
-      precedence: 250,
+      precedence: 240,
       parse: "Colon"
     },
     {
@@ -5682,6 +5776,15 @@ var Compile = (() => {
       }
     },
     { 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",
@@ -5702,6 +5805,29 @@ var Compile = (() => {
       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: ["_"],
@@ -5784,6 +5910,29 @@ var Compile = (() => {
         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",
@@ -5968,13 +6117,24 @@ var Compile = (() => {
         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),
@@ -5986,13 +6146,27 @@ var Compile = (() => {
               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
         ]);
       }
     },
@@ -6025,6 +6199,18 @@ var Compile = (() => {
       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",
@@ -6229,7 +6415,10 @@ var Compile = (() => {
         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];
       }
@@ -6670,7 +6859,12 @@ var Compile = (() => {
     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 === ".;.") {
@@ -6683,12 +6877,37 @@ var Compile = (() => {
       }
       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);
@@ -6940,6 +7159,38 @@ var Compile = (() => {
       ["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;
+        if (isComma) return true;
+        if (peekKeyword(p, "where")) return true;
+        if (peekKeyword(p, "with")) return true;
+        return false;
+      }
+    };
+    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,
@@ -6962,6 +7213,25 @@ var Compile = (() => {
       parser.skipVisualSpace();
     } while (parser.match(","));
     if (bindings.length === 0) return null;
+    const forStart = parser.index;
+    if (matchKeyword(parser, "for")) {
+      const loop = parseForComprehension(parser, lhs, until);
+      if (loop) {
+        const block2 = [];
+        for (const b of bindings) {
+          const normalized = normalizeLocalAssign(b);
+          if (operator(normalized) === "Assign") {
+            block2.push(["Declare", operand(normalized, 1)]);
+            block2.push(normalized);
+          } else {
+            block2.push(normalized);
+          }
+        }
+        block2.push(loop);
+        return ["Block", ...block2];
+      }
+      parser.index = forStart;
+    }
     const block = [];
     for (const b of bindings) {
       const normalized = normalizeLocalAssign(b);
@@ -7175,6 +7445,17 @@ var Compile = (() => {
     const upperExpr = openRight ? ["Open", upper] : upper;
     return ["Interval", lowerExpr, upperExpr];
   }
+  var COMPARISON_HEADS = /* @__PURE__ */ new Set([
+    "Less",
+    "LessEqual",
+    "Greater",
+    "GreaterEqual",
+    "Equal",
+    "NotEqual",
+    "And",
+    "Or",
+    "Not"
+  ]);
   var DEFINITIONS_SETS = [
     //
     // Constants
@@ -7433,18 +7714,58 @@ var Compile = (() => {
       closeTrigger: "}",
       parse: (_parser, body) => {
         if (isEmptySequence(body)) return "EmptySet";
+        if (operator(body) == "Delimiter" && stringValue(operand(body, 2)) === ",") {
+          body = operand(body, 1);
+        }
         const h = operator(body);
-        if (h === "Divides" || h === "Colon") {
+        if (h === "Divides") {
           const expr = operand(body, 1);
           const condition = operand(body, 2);
           if (expr !== null && condition !== null)
             return ["Set", expr, ["Condition", condition]];
         }
-        if (operator(body) == "Delimiter" && stringValue(operand(body, 2)) === ",") {
-          body = operand(body, 1);
+        if (h === "Colon") {
+          const lhs = operand(body, 1);
+          const rhs = operand(body, 2);
+          if (lhs !== null && rhs !== null) {
+            const lhsOp = operator(lhs);
+            if (lhsOp !== null && COMPARISON_HEADS.has(lhsOp)) {
+              return ["Which", lhs, rhs];
+            }
+            return ["Set", lhs, ["Condition", rhs]];
+          }
         }
-        if (operator(body) !== "Sequence") return ["Set", body];
-        return ["Set", ...operands(body)];
+        if (h === "Sequence") {
+          const elements = operands(body);
+          const colonElements = elements.filter((el) => operator(el) === "Colon");
+          const allPiecewise = colonElements.length > 0 && colonElements.every((el) => {
+            const lhs = operand(el, 1);
+            const lhsOp = lhs !== null ? operator(lhs) : null;
+            return lhsOp !== null && COMPARISON_HEADS.has(lhsOp);
+          });
+          if (allPiecewise) {
+            const whichOps = [];
+            for (let i = 0; i < elements.length; i++) {
+              const el = elements[i];
+              if (operator(el) === "Colon") {
+                const cond = operand(el, 1);
+                const val = operand(el, 2);
+                if (cond === null || val === null) {
+                  return ["Set", ...elements];
+                }
+                whichOps.push(cond, val);
+              } else {
+                if (i !== elements.length - 1) {
+                  return ["Set", ...elements];
+                }
+                whichOps.push("True", el);
+              }
+            }
+            return ["Which", ...whichOps];
+          }
+          return ["Set", ...elements];
+        }
+        return ["Set", body];
       },
       serialize: (serializer, expr) => {
         if (nops(expr) === 2 && operator(operand(expr, 2)) === "Condition") {
@@ -9418,7 +9739,8 @@ var Compile = (() => {
         minPrec: MULTIPLICATION_PRECEDENCE,
         condition: (parser2) => trigCommands[parser2.peek] || (until?.condition?.(parser2) ?? false)
       });
-      const appliedFn = args === null ? fn : typeof fn === "string" ? [fn, ...args] : ["Apply", fn, ...args];
+      const head = fn === "Arctan" && args?.length === 2 ? "Arctan2" : fn;
+      const appliedFn = args === null ? fn : typeof head === "string" ? [head, ...args] : ["Apply", head, ...args];
       return sup === null ? appliedFn : ["Power", appliedFn, sup];
     };
   }
@@ -11541,10 +11863,17 @@ var Compile = (() => {
     // The capitalized library entries already exist; these are pure parse
     // aliases so the lowercase names don't land in `unsupported-operator`.
     // ---------------------------------------------------------------------------
+    { latexTrigger: "\\operatorname{count}", parse: "Length" },
     { latexTrigger: "\\operatorname{random}", parse: "Random" },
     { latexTrigger: "\\operatorname{shuffle}", parse: "Shuffle" },
     { latexTrigger: "\\operatorname{repeat}", parse: "Repeat" },
     { latexTrigger: "\\operatorname{join}", parse: "Join" },
+    { latexTrigger: "\\operatorname{range}", parse: "Range" },
+    // Note: `\operatorname{with}` (Desmos's local-binding clause) is intentionally
+    // NOT registered here. Use the math-notation equivalent `\operatorname{where}`
+    // (with `\coloneq` for bindings), or register `with` as a custom dictionary
+    // entry at the integration layer — see the "Desmos-Specific Syntax — Prefer
+    // Custom LaTeX Dictionary" section in COMPUTE_ENGINE.md for a worked example.
     // ---------------------------------------------------------------------------
     // Geometric primitive heads. Registered as known typed heads so consumers
     // can branch on the operator name; CE itself doesn't render them. The
@@ -12735,6 +13064,15 @@ ${lines.join("\n")}`;
     return void 0;
   }
 
+  // src/compute-engine/numerics/random.ts
+  function deterministicRandom(seed) {
+    const v = Math.sin(seed * 12.9898) * 43758.5453;
+    return v - Math.floor(v);
+  }
+  function nextSeed(seed) {
+    return seed + 0.6180339887498949;
+  }
+
   // src/compute-engine/boxed-expression/canonical-utils.ts
   function canonical(ce, xs, scope) {
     if (xs.every((x) => x.isCanonical)) return xs;
@@ -12784,6 +13122,19 @@ ${lines.join("\n")}`;
         indexWhere: void 0
       }
     },
+    Length: {
+      description: "Number of elements in a collection. Returns undefined for non-collections and for infinite collections.",
+      complexity: 4e3,
+      signature: "(any) -> integer",
+      type: () => "integer",
+      evaluate: ([xs], { engine }) => {
+        if (!xs.isCollection) return void 0;
+        if (xs.isEmptyCollection) return engine.Zero;
+        const n = xs.count;
+        if (n === void 0 || !isFinite(n)) return void 0;
+        return engine.number(n);
+      }
+    },
     Tuple: {
       description: "A fixed number of heterogeneous elements",
       complexity: 8200,
@@ -12836,7 +13187,11 @@ ${lines.join("\n")}`;
     //
     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]);
@@ -12860,19 +13215,26 @@ ${lines.join("\n")}`;
           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: () => {
@@ -12890,7 +13252,9 @@ ${lines.join("\n")}`;
         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,
@@ -12915,7 +13279,13 @@ ${lines.join("\n")}`;
           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: {
@@ -13018,10 +13388,12 @@ ${lines.join("\n")}`;
           const upper = expr.op2.re;
           let count = expr.op3.re;
           if (!isFinite(count)) count = DEFAULT_LINSPACE_COUNT;
+          count = Math.floor(count);
           if (!isFinite(lower) || !isFinite(upper)) return void 0;
           if (index < 1 || index > count) return void 0;
+          if (count === 1) return expr.engine.number(lower);
           return expr.engine.number(
-            lower + (upper - lower) * (index - 1) / count
+            lower + (upper - lower) * (index - 1) / (count - 1)
           );
         },
         iterator: (expr) => {
@@ -13040,6 +13412,8 @@ ${lines.join("\n")}`;
               !isFinite(expr.op3.re) ? DEFAULT_LINSPACE_COUNT : expr.op3.re
             );
           }
+          totalCount = Math.floor(totalCount);
+          const denom = totalCount > 1 ? totalCount - 1 : 1;
           let index = 1;
           return {
             next: () => {
@@ -13048,7 +13422,7 @@ ${lines.join("\n")}`;
               index += 1;
               return {
                 value: expr.engine.number(
-                  lower + (upper - lower) * (index - 1 - 1) / totalCount
+                  lower + (upper - lower) * (index - 1 - 1) / denom
                 ),
                 done: false
               };
@@ -13064,9 +13438,14 @@ ${lines.join("\n")}`;
           if (t < lower || t > upper) return false;
           let count = expr.op3.re;
           if (!isFinite(count)) count = DEFAULT_LINSPACE_COUNT;
+          count = Math.floor(count);
           if (count === 0) return false;
-          const step = (upper - lower) / count;
-          return (t - lower) % step === 0;
+          if (count === 1) return t === lower;
+          const step = (upper - lower) / (count - 1);
+          const k = (t - lower) / step;
+          const tol = expr.engine.tolerance;
+          const kRounded = Math.round(k);
+          return kRounded >= 0 && kRounded <= count - 1 && Math.abs(k - kRounded) < tol;
         }
       }
     },
@@ -13391,10 +13770,12 @@ ${lines.join("\n")}`;
       description: [
         "Access an element of an indexed collection.",
         "If the index is negative, it is counted from the end.",
-        "Multiple indices can be provided to access nested collections (e.g., matrices)."
+        "Multiple indices can be provided to access nested collections (e.g., matrices).",
+        "If the index is a finite collection of booleans, returns the elements where the mask is True.",
+        "If the index is a finite collection of integers, returns the elements at those indices."
       ],
       complexity: 8200,
-      signature: "(value: indexed_collection, index: (number|string)+) -> unknown",
+      signature: "(value: indexed_collection, index: (number|string|indexed_collection)+) -> unknown",
       type: ([xs]) => xs.operatorDefinition?.collection?.elttype?.(xs) ?? collectionElementType(xs.type.type) ?? "any",
       evaluate: (ops, { engine: ce }) => {
         let expr = ops[0];
@@ -13405,12 +13786,39 @@ ${lines.join("\n")}`;
           if (!at) return void 0;
           const opAtIndex = ops[index];
           const s = isString(opAtIndex) ? opAtIndex.string : void 0;
-          if (s !== void 0) expr = at(expr, s) ?? ce.Nothing;
-          else {
-            const i = ops[index].re;
-            if (!Number.isInteger(i)) return void 0;
-            expr = at(expr, i) ?? ce.Nothing;
+          if (s !== void 0) {
+            expr = at(expr, s) ?? ce.Nothing;
+            index += 1;
+            continue;
           }
+          if (opAtIndex.isCollection && opAtIndex.isFiniteCollection) {
+            const indices = Array.from(opAtIndex.each());
+            const isMask = indices.every((m) => {
+              const name = sym(m);
+              return name === "True" || name === "False";
+            });
+            const picked = [];
+            if (isMask) {
+              indices.forEach((m, i2) => {
+                if (sym(m) !== "True") return;
+                const v = at(expr, i2 + 1);
+                if (v !== void 0) picked.push(v);
+              });
+            } else {
+              for (const m of indices) {
+                const k = m.re;
+                if (!Number.isInteger(k)) return void 0;
+                const v = at(expr, k);
+                if (v !== void 0) picked.push(v);
+              }
+            }
+            expr = ce._fn("List", picked);
+            index += 1;
+            continue;
+          }
+          const i = opAtIndex.re;
+          if (!Number.isInteger(i)) return void 0;
+          expr = at(expr, i) ?? ce.Nothing;
           index += 1;
         }
         return expr;
@@ -13421,7 +13829,7 @@ ${lines.join("\n")}`;
       description: ["Return `n` elements from a collection."],
       complexity: 8200,
       signature: "(xs: indexed_collection, count: number) -> indexed_collection",
-      type: ([xs]) => `list<${collectionElementType(xs.type.type)}>`,
+      type: ([xs]) => `list<${typeToString(collectionElementType(xs.type.type) ?? "any")}>`,
       evaluate: (ops, { engine, materialization: eager }) => {
         if (!eager) return void 0;
         const takeExpr = engine._fn("Take", ops);
@@ -13468,7 +13876,7 @@ ${lines.join("\n")}`;
       description: ["Return the collection without the first n elements."],
       complexity: 8200,
       signature: "(xs: indexed_collection, count: number) -> indexed_collection",
-      type: ([xs]) => `list<${collectionElementType(xs.type.type)}>`,
+      type: ([xs]) => `list<${typeToString(collectionElementType(xs.type.type) ?? "any")}>`,
       collection: {
         isLazy: (_expr) => true,
         count: (expr) => {
@@ -13513,15 +13921,45 @@ ${lines.join("\n")}`;
     },
     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,
@@ -13634,7 +14072,9 @@ ${lines.join("\n")}`;
       ],
       complexity: 8200,
       signature: "(value: indexed_collection, start: number, end: number) -> list",
-      type: ([xs]) => parseType(`list<${collectionElementType(xs.type.type)}>`),
+      type: ([xs]) => parseType(
+        `list<${typeToString(collectionElementType(xs.type.type) ?? "any")}>`
+      ),
       collection: {
         isLazy: (_expr) => true,
         count: (expr) => {
@@ -13966,16 +14406,26 @@ ${lines.join("\n")}`;
     },
     // Randomize the order of the elements in the collection.
     Shuffle: {
-      description: "Randomize the order of the elements in the collection.",
+      description: "Randomize the order of the elements in the collection. With an optional `seed` argument, the shuffle is deterministic.",
       complexity: 8200,
-      signature: "(indexed_collection) -> indexed_collection",
+      signature: "(indexed_collection, real?) -> indexed_collection",
       type: (ops) => ops[0].type,
-      evaluate: ([xs], { engine: ce }) => {
+      evaluate: ([xs, seedOp], { engine: ce }) => {
         if (!xs.isFiniteCollection) return void 0;
         const data = Array.from(xs.each());
-        for (let i = data.length - 1; i > 0; i--) {
-          const j = Math.floor(Math.random() * (i + 1));
-          [data[i], data[j]] = [data[j], data[i]];
+        const seed = seedOp?.re;
+        if (seed !== void 0 && !Number.isNaN(seed)) {
+          let s = seed;
+          for (let i = data.length - 1; i > 0; i--) {
+            const j = Math.floor(deterministicRandom(s) * (i + 1));
+            [data[i], data[j]] = [data[j], data[i]];
+            s = nextSeed(s);
+          }
+        } else {
+          for (let i = data.length - 1; i > 0; i--) {
+            const j = Math.floor(Math.random() * (i + 1));
+            [data[i], data[j]] = [data[j], data[i]];
+          }
         }
         return ce.function(xs.operator, data);
       }
@@ -14042,7 +14492,9 @@ ${lines.join("\n")}`;
         if (t === "string")
           return parseType(`tuple<list<string>, list<integer>>`);
         return parseType(
-          `tuple<list<${collectionElementType(t)}>, list<integer>>`
+          `tuple<list<${typeToString(
+            collectionElementType(t) ?? "any"
+          )}>, list<integer>>`
         );
       },
       evaluate: (ops, { engine: ce }) => {
@@ -14058,7 +14510,7 @@ ${lines.join("\n")}`;
       description: "Return a list of the unique elements of the collection.",
       complexity: 8200,
       signature: "(collection) -> list",
-      type: ([xs]) => `list<${collectionElementType(xs.type.type)}>`,
+      type: ([xs]) => `list<${typeToString(collectionElementType(xs.type.type) ?? "any")}>`,
       evaluate: (ops, { engine: ce }) => {
         if (!ops[0].isFiniteCollection) return void 0;
         const [values, _counts] = tally(ops[0]);
@@ -14070,7 +14522,7 @@ ${lines.join("\n")}`;
       wikidata: "Q381060",
       complexity: 8200,
       signature: "(collection, integer | function) -> list",
-      type: ([xs]) => `list<${collectionElementType(xs.type.type)}>`,
+      type: ([xs]) => `list<${typeToString(collectionElementType(xs.type.type) ?? "any")}>`,
       evaluate: ([xs, arg], { engine: ce }) => {
         if (!xs.isFiniteCollection) return void 0;
         const k = toInteger(arg);
@@ -14244,32 +14696,74 @@ ${lines.join("\n")}`;
         }
       }
     },
-    // Repeat(x) -> [x, x, ...]
-    // This is an infinite series. Can use Take(Repeat(x), n) to get a finite series
-    // x is evaluated once. Although could use Hold()?
-    // So that First(Repeat(Hold(Random(5))), 10) would return 10 random numbers...
+    // Repeat(x) -> [x, x, ...]        — infinite sequence
+    // Repeat(x, n) -> [x, x, ..., x]  — finite list of n copies
     Repeat: {
-      description: "Produce an infinite sequence by repeating a single value.",
+      description: "Produce a sequence by repeating a single value. With 1 argument, returns an infinite sequence; with 2 arguments (value, count), returns a finite list of `count` copies.",
       complexity: 8200,
-      signature: "(value: any) -> list",
+      signature: "(value: any, count: integer?) -> list",
+      evaluate: (ops, { engine }) => {
+        if (ops.length !== 2) return void 0;
+        const raw = toInteger(ops[1]);
+        if (raw === null) return void 0;
+        const n = Math.max(0, raw);
+        if (n > engine.maxCollectionSize) return void 0;
+        return engine._fn("List", Array(n).fill(ops[0]));
+      },
       collection: {
-        isLazy: (_expr) => true,
-        count: () => Infinity,
-        isEmpty: (_expr) => false,
-        // Never empty
-        isFinite: () => false,
-        // Infinite collection
+        isLazy: (expr) => isFunction2(expr) && expr.ops?.length === 1,
+        count: (expr) => {
+          if (!isFunction2(expr)) return void 0;
+          if (expr.ops?.length === 2) {
+            const n = toInteger(expr.op2);
+            return n !== null ? Math.max(0, n) : void 0;
+          }
+          return Infinity;
+        },
+        isEmpty: (expr) => {
+          if (!isFunction2(expr)) return void 0;
+          if (expr.ops?.length === 2) {
+            const n = toInteger(expr.op2);
+            return n !== null ? n <= 0 : void 0;
+          }
+          return false;
+        },
+        isFinite: (expr) => isFunction2(expr) && expr.ops?.length === 2,
         contains: (expr, target) => {
           if (!isFunction2(expr)) return false;
+          if (expr.ops?.length === 2) {
+            const n = toInteger(expr.op2);
+            if (n !== null && n <= 0) return false;
+          }
           return expr.op1.isSame(target);
         },
         iterator: (expr) => {
           if (!isFunction2(expr))
             return { next: () => ({ value: void 0, done: true }) };
+          if (expr.ops?.length === 2) {
+            const n = toInteger(expr.op2);
+            if (n === null) {
+              return { next: () => ({ value: void 0, done: true }) };
+            }
+            const count = Math.max(0, n);
+            let i = 0;
+            return {
+              next: () => i++ < count ? { value: expr.op1, done: false } : { value: void 0, done: true }
+            };
+          }
           return { next: () => ({ value: expr.op1, done: false }) };
         },
-        at: (expr, _index) => {
+        // at is 1-based (consistent with Range, Take, and other collection handlers)
+        at: (expr, index) => {
           if (!isFunction2(expr)) return void 0;
+          if (typeof index !== "number") return void 0;
+          if (expr.ops?.length === 2) {
+            const n = toInteger(expr.op2);
+            const count = n !== null ? Math.max(0, n) : 0;
+            if (index < 1 || index > count) return void 0;
+          } else {
+            if (index < 1) return void 0;
+          }
           return expr.op1;
         }
       }
@@ -14500,17 +14994,14 @@ ${lines.join("\n")}`;
     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];
@@ -14859,6 +15350,23 @@ ${lines.join("\n")}`;
         };
         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);
       }
@@ -14933,17 +15441,98 @@ ${lines.join("\n")}`;
       )}${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.
+     *
+     * Known issue (imperative form): the IIFE generated by form (1) has no
+     * `return` statement, so `Loop(body, Element(i, Range(lo, hi)))` compiled
+     * to JS evaluates to `undefined` at runtime, while CE evaluation returns a
+     * `List` of body values. See `test/compute-engine/a1-c1-compile-parity.test.ts`
+     * ("Loop compiles in JS") for the verify-only test that locks in the
+     * current behavior.
      */
     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];
@@ -14961,13 +15550,72 @@ ${lines.join("\n")}`;
         ...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
@@ -19918,6 +20566,7 @@ ${lines.join("\n")}`;
         return `_SYS.cexp(${compile2(args[0])})`;
       return `Math.exp(${compile2(args[0])})`;
     },
+    First: (args, compile2) => `${compile2(args[0])}[0]`,
     Floor: (args, compile2) => {
       if (BaseCompiler.isIntegerValued(args[0])) return compile2(args[0]);
       return `Math.floor(${compile2(args[0])})`;
@@ -20076,7 +20725,20 @@ ${lines.join("\n")}`;
       if (nConst !== void 0) return `Math.pow(${compile2(arg)}, ${1 / nConst})`;
       return `Math.pow(${compile2(arg)}, 1 / (${compile2(exp3)}))`;
     },
-    Random: "Math.random",
+    Random: (args, compile2) => {
+      if (args.length === 0) return "Math.random()";
+      if (args.length === 2) {
+        const m = compile2(args[0]);
+        const n = compile2(args[1]);
+        return `((${m}) + Math.floor(Math.random() * ((${n}) - (${m}))))`;
+      }
+      const arg = args[0];
+      if (BaseCompiler.isIntegerValued(arg)) {
+        return `Math.floor(Math.random() * (${compile2(arg)}))`;
+      }
+      const a = compile2(arg);
+      return `(() => { const _s = (${a}) * 12.9898; const _v = Math.sin(_s) * 43758.5453; return _v - Math.floor(_v); })()`;
+    },
     Round: (args, compile2) => {
       if (BaseCompiler.isIntegerValued(args[0])) return compile2(args[0]);
       return `Math.round(${compile2(args[0])})`;
@@ -20104,6 +20766,7 @@ ${lines.join("\n")}`;
       if (BaseCompiler.isComplexValued(arg)) return `_SYS.csech(${compile2(arg)})`;
       return `1 / Math.cosh(${compile2(arg)})`;
     },
+    Second: (args, compile2) => `${compile2(args[0])}[1]`,
     Heaviside: "_SYS.heaviside",
     Sign: "Math.sign",
     Sinc: "_SYS.sinc",
@@ -20136,6 +20799,7 @@ ${lines.join("\n")}`;
         return `_SYS.ctanh(${compile2(args[0])})`;
       return `Math.tanh(${compile2(args[0])})`;
     },
+    Third: (args, compile2) => `${compile2(args[0])}[2]`,
     Mod: ([a, b], compile2) => {
       if (a === null || b === null) throw new Error("Mod: missing argument");
       const ca = compile2(a);
@@ -21415,6 +22079,14 @@ ${lines.join("\n")}`;
       return `exp(${compile2(args[0])})`;
     },
     Exp2: "exp2",
+    // Component access — assumes the argument compiles to a vec2/vec3/vec4
+    // (the common case for 2D/3D points). For 5+-element tuples that compile
+    // to `float[N]` arrays, swizzle access is invalid GLSL and the shader
+    // will fail to compile; that's an edge case `First`/`Second`/`Third`
+    // aren't designed for. Vec swizzles are identical between GLSL and WGSL.
+    First: (args, compile2) => `${compile2(args[0])}.x`,
+    Second: (args, compile2) => `${compile2(args[0])}.y`,
+    Third: (args, compile2) => `${compile2(args[0])}.z`,
     Floor: (args, compile2) => {
       if (BaseCompiler.isIntegerValued(args[0])) return compile2(args[0]);
       return `floor(${compile2(args[0])})`;
@@ -21892,6 +22564,39 @@ ${lines.join("\n")}`;
     // Sum/Product — unrolled or for-loop
     Sum: (args, compile2, target) => compileGPUSumProduct("Sum", args, compile2, target),
     Product: (args, compile2, target) => compileGPUSumProduct("Product", args, compile2, target),
+    // Range — inline constant array literal (bounds must be compile-time constants)
+    Range: (args, _compile, target) => {
+      if (args.length < 2 || args.length > 3) {
+        throw new Error(
+          "Range: GPU compile expects 2 or 3 arguments (lo, hi, step?)"
+        );
+      }
+      const lo = args[0].re;
+      const hi = args[1].re;
+      const step = args.length === 3 ? args[2].re : 1;
+      if (!Number.isFinite(lo) || !Number.isFinite(hi) || !Number.isFinite(step)) {
+        throw new Error(
+          "Range: GPU compile requires constant numeric bounds (non-constant ranges must be materialized at JS host then uploaded as a uniform)"
+        );
+      }
+      if (step === 0) throw new Error("Range: step cannot be zero");
+      const count = Math.max(0, Math.floor((hi - lo) / step) + 1);
+      if (count === 0) {
+        throw new Error(
+          "Range: empty range (lo > hi for positive step, or lo < hi for negative step)"
+        );
+      }
+      if (count > 256) {
+        throw new Error(
+          `Range: GPU compile inlines ranges up to 256 elements (got ${count})`
+        );
+      }
+      const values = [];
+      for (let i = 0; i < count; i++) values.push(lo + i * step);
+      const isWGSL = target.language === "wgsl";
+      const arrayType = isWGSL ? `array<f32, ${count}>` : `float[${count}]`;
+      return `${arrayType}(${values.map(formatGPUNumber).join(", ")})`;
+    },
     // Loop — GPU for-loop (no IIFE, no let)
     Loop: (args, _compile, target) => {
       if (!args[0]) throw new Error("Loop: no body");
@@ -21920,6 +22625,134 @@ ${lines.join("\n")}`;
   ${bodyCode};
 }`;
     },
+    // Statistical functions
+    /**
+     * GCD of two scalar arguments.
+     *
+     * Uses a preamble helper `_gpu_gcd` (Euclidean algorithm via `mod`).
+     * Only two-argument form is supported in GPU targets.
+     */
+    GCD: (args, compile2) => {
+      if (args.length < 2) throw new Error("GCD: need at least two arguments");
+      if (args.length > 2)
+        throw new Error("GCD: GPU target supports only two-argument GCD");
+      const a = args[0];
+      const b = args[1];
+      if (a === null || b === null) throw new Error("GCD: missing argument");
+      return `_gpu_gcd(${compile2(a)}, ${compile2(b)})`;
+    },
+    /**
+     * Variance of a compile-time-known list.
+     *
+     * Accepts either a single `List(...)` argument or N scalar arguments.
+     * Generates fully inline code: computes mean then sum of squared deviations,
+     * divided by (N-1) for sample variance (matches JS `_SYS.variance`).
+     */
+    Variance: (args, compile2) => {
+      let elems;
+      if (args.length === 1 && isFunction2(args[0], "List")) {
+        elems = args[0].ops;
+      } else if (args.length >= 2) {
+        elems = args;
+      } else {
+        throw new Error(
+          "Variance: GPU target requires a List argument or at least 2 scalar arguments"
+        );
+      }
+      const n = elems.length;
+      if (n < 2) throw new Error("Variance: need at least 2 elements");
+      const compiled = elems.map((e) => compile2(e));
+      const sum = compiled.join(" + ");
+      const mean2 = `((${sum}) / ${formatGPUNumber(n)})`;
+      const sqDiffs = compiled.map((c) => `(${c} - ${mean2}) * (${c} - ${mean2})`).join(" + ");
+      return `((${sqDiffs}) / ${formatGPUNumber(n - 1)})`;
+    },
+    /**
+     * Median of a compile-time-known list.
+     *
+     * Accepts either a single `List(...)` argument or N scalar arguments.
+     * For N ≤ 8: generates a fully unrolled inline sorting network followed by
+     * a middle-element pick. For larger N, throws (too large to inline cleanly).
+     *
+     * The sorting network uses the "odd-even merge sort" comparator pattern
+     * inlined as `min`/`max` calls — no GPU statements required.
+     */
+    Median: (args, compile2) => {
+      let elems;
+      if (args.length === 1 && isFunction2(args[0], "List")) {
+        elems = args[0].ops;
+      } else if (args.length >= 1) {
+        elems = args;
+      } else {
+        throw new Error(
+          "Median: GPU target requires a List argument or at least 1 scalar argument"
+        );
+      }
+      const n = elems.length;
+      if (n === 0) throw new Error("Median: empty list");
+      if (n > 8) {
+        throw new Error(
+          `Median: GPU target supports up to 8 elements via inline sorting network (got ${n}). For larger lists, compute on the CPU and pass the result as a uniform.`
+        );
+      }
+      const compiled = elems.map((e) => compile2(e));
+      if (n === 1) return compiled[0];
+      return `_gpu_median_${n}(${compiled.join(", ")})`;
+    },
+    /**
+     * Deterministic pseudorandom for GPU.
+     *
+     * All emitted forms return a GLSL `float` (or WGSL `f32`) so the result
+     * composes with surrounding float arithmetic without explicit casts. The
+     * "integer-bound" forms return an integer-valued float (the result of
+     * `floor`), matching the convention used by `Floor` and other ostensibly
+     * integer-returning operators in this target.
+     *
+     * - 0 args (GLSL only): fall back to a fragment-coord-derived seed.
+     *   Only meaningful in fragment shaders (gl_FragCoord is FS-only).
+     * - 0 args (WGSL): throws — WGSL has no built-in fragment coordinate;
+     *   caller must provide an explicit seed.
+     * - 1 arg, real-typed: `_gpu_random(seed)` — deterministic float in [0, 1)
+     * - 1 arg, integer-typed: `floor(_gpu_random(float(n)) * float(n))` —
+     *   integer-valued float in {0, 1, ..., n-1}. The seed is derived from
+     *   `n` itself, so the result is per-pixel-and-n deterministic in GLSL.
+     * - 2 args (integer m, n): float in [m, n), seeded from gl_FragCoord.
+     *
+     * JS-side `Random` has matching semantics (see `library/core.ts`'s
+     * polymorphic dispatch). JS↔GLSL parity is approximate — same seed yields
+     * a similar value, not bit-identical, due to fp64 vs fp32 and platform
+     * `sin` differences.
+     */
+    Random: (args, compile2, target) => {
+      if (args.length === 0) {
+        if (target.language === "wgsl") {
+          throw new Error(
+            "Random(): WGSL compile requires an explicit seed argument. WGSL has no gl_FragCoord built-in outside fragment entry points, so the no-arg fallback used in GLSL is unavailable. Use Random(seed) where seed is a deterministic per-invocation value."
+          );
+        }
+        return "_gpu_random(gl_FragCoord.x + gl_FragCoord.y * 1024.0)";
+      }
+      if (args.length === 1) {
+        const arg = args[0];
+        if (BaseCompiler.isIntegerValued(arg)) {
+          const compiled = compile2(arg);
+          return `floor(_gpu_random(float(${compiled})) * float(${compiled}))`;
+        }
+        return `_gpu_random(${compile2(arg)})`;
+      }
+      if (args.length === 2) {
+        if (target.language === "wgsl") {
+          throw new Error(
+            "Random(m, n): WGSL compile requires explicit seeding. Use a seeded variant or compute the integer range manually."
+          );
+        }
+        const m = compile2(args[0]);
+        const n = compile2(args[1]);
+        const seed = "_gpu_random(gl_FragCoord.x + gl_FragCoord.y * 1024.0)";
+        return `(float(${m}) + floor(${seed} * float((${n}) - (${m}))))`;
+      }
+      throw new Error("Random: GPU compile expects 0, 1, or 2 arguments");
+    },
     // Function (lambda) — not supported in GPU
     Function: () => {
       throw new Error(
@@ -22518,6 +23351,212 @@ fn _fractal_julia(z_in: vec2f, c: vec2f, maxIter: i32) -> f32 {
   }
   return 1.0;
 }
+`;
+  var GPU_GCD_PREAMBLE_GLSL = `
+float _gpu_gcd(float a, float b) {
+  a = abs(a); b = abs(b);
+  for (int i = 0; i < 32; i++) {
+    if (b < 0.5) break;
+    float t = mod(a, b);
+    a = b;
+    b = t;
+  }
+  return a;
+}
+`;
+  var GPU_GCD_PREAMBLE_WGSL = `
+fn _gpu_gcd(a_in: f32, b_in: f32) -> f32 {
+  var a = abs(a_in); var b = abs(b_in);
+  for (var i: i32 = 0; i < 32; i++) {
+    if (b < 0.5) { break; }
+    let t = a % b;
+    a = b;
+    b = t;
+  }
+  return a;
+}
+`;
+  var GPU_RANDOM_PREAMBLE_GLSL = `
+// Deterministic pseudorandom in [0, 1) from a float seed.
+// Standard fract-sin hash; reproducible across runs for the same seed.
+// Note: this hash exhibits visible banding near seed \u2248 k\u03C0 for integer k.
+// For high-quality shader random, callers should use a more robust hash
+// (e.g. PCG or xxHash) and pre-seed it appropriately.
+float _gpu_random(float seed) {
+  return fract(sin(seed * 12.9898) * 43758.5453);
+}
+`;
+  var GPU_RANDOM_PREAMBLE_WGSL = `
+// Deterministic pseudorandom in [0, 1) from a float seed.
+// Standard fract-sin hash; reproducible across runs for the same seed.
+// Note: this hash exhibits visible banding near seed \u2248 k\u03C0 for integer k.
+// For high-quality shader random, callers should use a more robust hash
+// (e.g. PCG or xxHash) and pre-seed it appropriately.
+fn _gpu_random(seed: f32) -> f32 {
+  return fract(sin(seed * 12.9898) * 43758.5453);
+}
+`;
+  var GPU_MEDIAN_PREAMBLE_GLSL = `
+float _gpu_median_2(float a, float b) {
+  return (a + b) * 0.5;
+}
+float _gpu_median_3(float a, float b, float c) {
+  return max(min(a, b), min(max(a, b), c));
+}
+float _gpu_median_4(float a, float b, float c, float d) {
+  float lo = max(min(a, b), min(c, d));
+  float hi = min(max(a, b), max(c, d));
+  return (lo + hi) * 0.5;
+}
+float _gpu_median_5(float a, float b, float c, float d, float e) {
+  // 9-comparator Bose-Nelson sort; v2 holds the median.
+  float t; float v0=a,v1=b,v2=c,v3=d,v4=e;
+  t=min(v0,v1); v1=max(v0,v1); v0=t;
+  t=min(v3,v4); v4=max(v3,v4); v3=t;
+  t=min(v2,v4); v4=max(v2,v4); v2=t;
+  t=min(v2,v3); v3=max(v2,v3); v2=t;
+  t=min(v0,v3); v3=max(v0,v3); v0=t;
+  t=min(v0,v2); v2=max(v0,v2); v0=t;
+  t=min(v1,v4); v4=max(v1,v4); v1=t;
+  t=min(v1,v3); v3=max(v1,v3); v1=t;
+  t=min(v1,v2); v2=max(v1,v2); v1=t;
+  return v2;
+}
+float _gpu_median_6(float a, float b, float c, float d, float e, float f) {
+  float t; float v0=a,v1=b,v2=c,v3=d,v4=e,v5=f;
+  t=min(v0,v1); v1=max(v0,v1); v0=t;
+  t=min(v2,v3); v3=max(v2,v3); v2=t;
+  t=min(v4,v5); v5=max(v4,v5); v4=t;
+  t=min(v0,v2); v2=max(v0,v2); v0=t;
+  t=min(v1,v3); v3=max(v1,v3); v1=t;
+  t=min(v0,v4); v4=max(v0,v4); v0=t;
+  t=min(v1,v5); v5=max(v1,v5); v1=t;
+  t=min(v2,v4); v4=max(v2,v4); v2=t;
+  t=min(v1,v2); v2=max(v1,v2); v1=t;
+  t=min(v3,v5); v5=max(v3,v5); v3=t;
+  t=min(v3,v4); v4=max(v3,v4); v3=t;
+  return (v2 + v3) * 0.5;
+}
+float _gpu_median_7(float a, float b, float c, float d, float e, float f, float g) {
+  float t; float v0=a,v1=b,v2=c,v3=d,v4=e,v5=f,v6=g;
+  t=min(v0,v1); v1=max(v0,v1); v0=t;
+  t=min(v2,v3); v3=max(v2,v3); v2=t;
+  t=min(v4,v5); v5=max(v4,v5); v4=t;
+  t=min(v0,v2); v2=max(v0,v2); v0=t;
+  t=min(v1,v3); v3=max(v1,v3); v1=t;
+  t=min(v4,v6); v6=max(v4,v6); v4=t;
+  t=min(v0,v4); v4=max(v0,v4); v0=t;
+  t=min(v1,v5); v5=max(v1,v5); v1=t;
+  t=min(v2,v6); v6=max(v2,v6); v2=t;
+  t=min(v1,v2); v2=max(v1,v2); v1=t;
+  t=min(v3,v5); v5=max(v3,v5); v3=t;
+  t=min(v2,v4); v4=max(v2,v4); v2=t;
+  t=min(v3,v4); v4=max(v3,v4); v3=t;
+  return v3;
+}
+float _gpu_median_8(float a, float b, float c, float d, float e, float f, float g, float h) {
+  float t; float v0=a,v1=b,v2=c,v3=d,v4=e,v5=f,v6=g,v7=h;
+  t=min(v0,v1); v1=max(v0,v1); v0=t;
+  t=min(v2,v3); v3=max(v2,v3); v2=t;
+  t=min(v4,v5); v5=max(v4,v5); v4=t;
+  t=min(v6,v7); v7=max(v6,v7); v6=t;
+  t=min(v0,v2); v2=max(v0,v2); v0=t;
+  t=min(v1,v3); v3=max(v1,v3); v1=t;
+  t=min(v4,v6); v6=max(v4,v6); v4=t;
+  t=min(v5,v7); v7=max(v5,v7); v5=t;
+  t=min(v0,v4); v4=max(v0,v4); v0=t;
+  t=min(v1,v5); v5=max(v1,v5); v1=t;
+  t=min(v2,v6); v6=max(v2,v6); v2=t;
+  t=min(v3,v7); v7=max(v3,v7); v3=t;
+  t=min(v1,v2); v2=max(v1,v2); v1=t;
+  t=min(v3,v4); v4=max(v3,v4); v3=t;
+  t=min(v5,v6); v6=max(v5,v6); v5=t;
+  t=min(v3,v5); v5=max(v3,v5); v3=t;
+  t=min(v2,v4); v4=max(v2,v4); v2=t;
+  t=min(v3,v4); v4=max(v3,v4); v3=t;
+  return (v3 + v4) * 0.5;
+}
+`;
+  var GPU_MEDIAN_PREAMBLE_WGSL = `
+fn _gpu_median_2(a: f32, b: f32) -> f32 {
+  return (a + b) * 0.5;
+}
+fn _gpu_median_3(a: f32, b: f32, c: f32) -> f32 {
+  return max(min(a, b), min(max(a, b), c));
+}
+fn _gpu_median_4(a: f32, b: f32, c: f32, d: f32) -> f32 {
+  let lo = max(min(a, b), min(c, d));
+  let hi = min(max(a, b), max(c, d));
+  return (lo + hi) * 0.5;
+}
+fn _gpu_median_5(a: f32, b: f32, c: f32, d: f32, e: f32) -> f32 {
+  // 9-comparator Bose-Nelson sort; v2 holds the median.
+  var v0=a; var v1=b; var v2=c; var v3=d; var v4=e; var t: f32;
+  t=min(v0,v1); v1=max(v0,v1); v0=t;
+  t=min(v3,v4); v4=max(v3,v4); v3=t;
+  t=min(v2,v4); v4=max(v2,v4); v2=t;
+  t=min(v2,v3); v3=max(v2,v3); v2=t;
+  t=min(v0,v3); v3=max(v0,v3); v0=t;
+  t=min(v0,v2); v2=max(v0,v2); v0=t;
+  t=min(v1,v4); v4=max(v1,v4); v1=t;
+  t=min(v1,v3); v3=max(v1,v3); v1=t;
+  t=min(v1,v2); v2=max(v1,v2); v1=t;
+  return v2;
+}
+fn _gpu_median_6(a: f32, b: f32, c: f32, d: f32, e: f32, f: f32) -> f32 {
+  var v0=a; var v1=b; var v2=c; var v3=d; var v4=e; var v5=f; var t: f32;
+  t=min(v0,v1); v1=max(v0,v1); v0=t;
+  t=min(v2,v3); v3=max(v2,v3); v2=t;
+  t=min(v4,v5); v5=max(v4,v5); v4=t;
+  t=min(v0,v2); v2=max(v0,v2); v0=t;
+  t=min(v1,v3); v3=max(v1,v3); v1=t;
+  t=min(v0,v4); v4=max(v0,v4); v0=t;
+  t=min(v1,v5); v5=max(v1,v5); v1=t;
+  t=min(v2,v4); v4=max(v2,v4); v2=t;
+  t=min(v1,v2); v2=max(v1,v2); v1=t;
+  t=min(v3,v5); v5=max(v3,v5); v3=t;
+  t=min(v3,v4); v4=max(v3,v4); v3=t;
+  return (v2 + v3) * 0.5;
+}
+fn _gpu_median_7(a: f32, b: f32, c: f32, d: f32, e: f32, f: f32, g: f32) -> f32 {
+  var v0=a; var v1=b; var v2=c; var v3=d; var v4=e; var v5=f; var v6=g; var t: f32;
+  t=min(v0,v1); v1=max(v0,v1); v0=t;
+  t=min(v2,v3); v3=max(v2,v3); v2=t;
+  t=min(v4,v5); v5=max(v4,v5); v4=t;
+  t=min(v0,v2); v2=max(v0,v2); v0=t;
+  t=min(v1,v3); v3=max(v1,v3); v1=t;
+  t=min(v4,v6); v6=max(v4,v6); v4=t;
+  t=min(v0,v4); v4=max(v0,v4); v0=t;
+  t=min(v1,v5); v5=max(v1,v5); v1=t;
+  t=min(v2,v6); v6=max(v2,v6); v2=t;
+  t=min(v1,v2); v2=max(v1,v2); v1=t;
+  t=min(v3,v5); v5=max(v3,v5); v3=t;
+  t=min(v2,v4); v4=max(v2,v4); v2=t;
+  t=min(v3,v4); v4=max(v3,v4); v3=t;
+  return v3;
+}
+fn _gpu_median_8(a: f32, b: f32, c: f32, d: f32, e: f32, f: f32, g: f32, h: f32) -> f32 {
+  var v0=a; var v1=b; var v2=c; var v3=d; var v4=e; var v5=f; var v6=g; var v7=h; var t: f32;
+  t=min(v0,v1); v1=max(v0,v1); v0=t;
+  t=min(v2,v3); v3=max(v2,v3); v2=t;
+  t=min(v4,v5); v5=max(v4,v5); v4=t;
+  t=min(v6,v7); v7=max(v6,v7); v6=t;
+  t=min(v0,v2); v2=max(v0,v2); v0=t;
+  t=min(v1,v3); v3=max(v1,v3); v1=t;
+  t=min(v4,v6); v6=max(v4,v6); v4=t;
+  t=min(v5,v7); v7=max(v5,v7); v5=t;
+  t=min(v0,v4); v4=max(v0,v4); v0=t;
+  t=min(v1,v5); v5=max(v1,v5); v1=t;
+  t=min(v2,v6); v6=max(v2,v6); v2=t;
+  t=min(v3,v7); v7=max(v3,v7); v3=t;
+  t=min(v1,v2); v2=max(v1,v2); v1=t;
+  t=min(v3,v4); v4=max(v3,v4); v3=t;
+  t=min(v5,v6); v6=max(v5,v6); v5=t;
+  t=min(v3,v5); v5=max(v3,v5); v3=t;
+  t=min(v2,v4); v4=max(v2,v4); v2=t;
+  t=min(v3,v4); v4=max(v3,v4); v3=t;
+  return (v3 + v4) * 0.5;
+}
 `;
   var GPU_COLOR_PREAMBLE_GLSL = `
 float _gpu_srgb_to_linear(float c) {
@@ -23196,6 +24235,12 @@ fn _gpu_apca(lch_bg: vec3f, lch_fg: vec3f) -> f32 {
       if (code.includes("_fractal_")) {
         preamble += this.languageId === "wgsl" ? GPU_FRACTAL_PREAMBLE_WGSL : GPU_FRACTAL_PREAMBLE_GLSL;
       }
+      if (code.includes("_gpu_random"))
+        preamble += this.languageId === "wgsl" ? GPU_RANDOM_PREAMBLE_WGSL : GPU_RANDOM_PREAMBLE_GLSL;
+      if (code.includes("_gpu_gcd"))
+        preamble += this.languageId === "wgsl" ? GPU_GCD_PREAMBLE_WGSL : GPU_GCD_PREAMBLE_GLSL;
+      if (code.includes("_gpu_median_"))
+        preamble += this.languageId === "wgsl" ? GPU_MEDIAN_PREAMBLE_WGSL : GPU_MEDIAN_PREAMBLE_GLSL;
       if (code.includes("_gpu_srgb_to") || code.includes("_gpu_oklab") || code.includes("_gpu_oklch") || code.includes("_gpu_color_mix") || code.includes("_gpu_apca")) {
         preamble += this.languageId === "wgsl" ? GPU_COLOR_PREAMBLE_WGSL : GPU_COLOR_PREAMBLE_GLSL;
       }
@@ -25534,7 +26579,7 @@ ${code}`;
   }
 
   // src/compile.ts
-  var version = "0.56.0";
+  var version = "0.58.0";
   return __toCommonJS(compile_exports);
 })();
 /*! Bundled license information: