@cortex-js/compute-engine 0.56.0 → 0.58.0

package/dist/types/compute-engine/boxed-expression/stochastic-equal.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 type ComplexResult = {
     re: number;
     im: number;

package/dist/types/compute-engine/boxed-expression/trigonometry.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 /** Assuming x in an expression in radians, convert to current angular unit. */
 export declare function radiansToAngle(x: Expression | undefined): Expression | undefined;
 export declare function evalTrig(name: string, op: Expression | undefined): Expression | undefined;

package/dist/types/compute-engine/boxed-expression/type-guards.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { NumericValue } from '../numeric-value/types';
 /** Preferred guard for runtime expressions. */
 export declare function isExpression(x: unknown): x is Expression;

package/dist/types/compute-engine/boxed-expression/utils.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import { Type } from '../../common/type/types';
 import { NumericValue } from '../numeric-value/types';
 /**

package/dist/types/compute-engine/boxed-expression/validate.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { Expression, IComputeEngine as ComputeEngine } from '../global-types';
 /**
  * Check that the number of arguments is as expected.

package/dist/types/compute-engine/collection-utils.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 /** If a collection has fewer than this many elements, eagerly evaluate it.
  *
  * For example, evaluate the Union of two sets with 10 elements each will

package/dist/types/compute-engine/compilation/base-compiler.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { CompileTarget, TargetSource } from './types';
 /**
  * Base compiler class containing language-agnostic compilation logic
@@ -17,14 +17,70 @@ export declare class BaseCompiler {
      */
     private static compileBlock;
     /**
-     * Compile a Loop expression with Element(index, Range(lo, hi)) indexing.
-     * Generates: (() => { for (let i = lo; i <= hi; i++) { body } })()
+     * Compile a Loop expression.
      *
-     * 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`.
+     * 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; })()
+     *    ```
+     *
+     *    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.
      */
     private static compileForLoop;
+    /**
+     * 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.
+     */
+    private static isLegacyCompatibleRange;
+    /**
+     * 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')`.
+     */
+    private static compileRangeIterable;
     /**
      * Compile a loop body expression as statements (not wrapped in IIFE).
      * Handles Break, Continue, Return as statements, and If as if-else when

package/dist/types/compute-engine/compilation/compile-expression.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { Expression, JSSource } from '../global-types';
 import type { CompileTarget, CompilationResult } from './types';
 type CompileExpressionOptions<T extends string = string> = {

package/dist/types/compute-engine/compilation/constant-folding.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * Constant folding utilities for GPU compilation.
  *
  * These helpers allow compilation handlers to detect compile-time constants,

package/dist/types/compute-engine/compilation/glsl-target.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { CompiledFunctions } from './types';
 import { GPUShaderTarget } from './gpu-target';
 /**

package/dist/types/compute-engine/compilation/gpu-target.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { CompileTarget, CompiledOperators, CompiledFunctions, LanguageTarget, CompilationOptions, CompilationResult } from './types';
 /**
  * GPU shader operators shared by GLSL and WGSL.
@@ -120,6 +120,49 @@ export declare const GPU_FRACTAL_PREAMBLE_GLSL = "\nfloat _fractal_mandelbrot(ve
  * Fractal preamble (WGSL syntax).
  */
 export declare const GPU_FRACTAL_PREAMBLE_WGSL = "\nfn _fractal_mandelbrot(c: vec2f, maxIter: i32) -> f32 {\n  var z = vec2f(0.0, 0.0);\n  for (var i: i32 = 0; i < maxIter; i++) {\n    z = vec2f(z.x*z.x - z.y*z.y + c.x, 2.0*z.x*z.y + c.y);\n    if (dot(z, z) > 4.0) {\n      return clamp((f32(i) - log2(log2(dot(z, z))) + 4.0) / f32(maxIter), 0.0, 1.0);\n    }\n  }\n  return 1.0;\n}\n\nfn _fractal_julia(z_in: vec2f, c: vec2f, maxIter: i32) -> f32 {\n  var z = z_in;\n  for (var i: i32 = 0; i < maxIter; i++) {\n    z = vec2f(z.x*z.x - z.y*z.y + c.x, 2.0*z.x*z.y + c.y);\n    if (dot(z, z) > 4.0) {\n      return clamp((f32(i) - log2(log2(dot(z, z))) + 4.0) / f32(maxIter), 0.0, 1.0);\n    }\n  }\n  return 1.0;\n}\n";
+/**
+ * GPU GCD preamble (GLSL syntax).
+ * Euclidean algorithm over floats; works for integer-valued inputs.
+ */
+export declare const GPU_GCD_PREAMBLE_GLSL = "\nfloat _gpu_gcd(float a, float b) {\n  a = abs(a); b = abs(b);\n  for (int i = 0; i < 32; i++) {\n    if (b < 0.5) break;\n    float t = mod(a, b);\n    a = b;\n    b = t;\n  }\n  return a;\n}\n";
+/**
+ * GPU GCD preamble (WGSL syntax).
+ */
+export declare const GPU_GCD_PREAMBLE_WGSL = "\nfn _gpu_gcd(a_in: f32, b_in: f32) -> f32 {\n  var a = abs(a_in); var b = abs(b_in);\n  for (var i: i32 = 0; i < 32; i++) {\n    if (b < 0.5) { break; }\n    let t = a % b;\n    a = b;\n    b = t;\n  }\n  return a;\n}\n";
+/**
+ * GPU Random preamble (GLSL syntax).
+ *
+ * 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 ≈ kπ 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.
+ */
+export declare const GPU_RANDOM_PREAMBLE_GLSL = "\n// Deterministic pseudorandom in [0, 1) from a float seed.\n// Standard fract-sin hash; reproducible across runs for the same seed.\n// Note: this hash exhibits visible banding near seed \u2248 k\u03C0 for integer k.\n// For high-quality shader random, callers should use a more robust hash\n// (e.g. PCG or xxHash) and pre-seed it appropriately.\nfloat _gpu_random(float seed) {\n  return fract(sin(seed * 12.9898) * 43758.5453);\n}\n";
+/**
+ * GPU Random preamble (WGSL syntax).
+ *
+ * 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 ≈ kπ 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.
+ */
+export declare const GPU_RANDOM_PREAMBLE_WGSL = "\n// Deterministic pseudorandom in [0, 1) from a float seed.\n// Standard fract-sin hash; reproducible across runs for the same seed.\n// Note: this hash exhibits visible banding near seed \u2248 k\u03C0 for integer k.\n// For high-quality shader random, callers should use a more robust hash\n// (e.g. PCG or xxHash) and pre-seed it appropriately.\nfn _gpu_random(seed: f32) -> f32 {\n  return fract(sin(seed * 12.9898) * 43758.5453);\n}\n";
+/**
+ * GPU Median preamble (GLSL syntax).
+ *
+ * One function per supported list size (2..8) using sorting networks.
+ * Each function takes N float arguments and returns the median via a
+ * Batcher odd-even merge sort encoded entirely as min/max calls.
+ */
+export declare const GPU_MEDIAN_PREAMBLE_GLSL = "\nfloat _gpu_median_2(float a, float b) {\n  return (a + b) * 0.5;\n}\nfloat _gpu_median_3(float a, float b, float c) {\n  return max(min(a, b), min(max(a, b), c));\n}\nfloat _gpu_median_4(float a, float b, float c, float d) {\n  float lo = max(min(a, b), min(c, d));\n  float hi = min(max(a, b), max(c, d));\n  return (lo + hi) * 0.5;\n}\nfloat _gpu_median_5(float a, float b, float c, float d, float e) {\n  // 9-comparator Bose-Nelson sort; v2 holds the median.\n  float t; float v0=a,v1=b,v2=c,v3=d,v4=e;\n  t=min(v0,v1); v1=max(v0,v1); v0=t;\n  t=min(v3,v4); v4=max(v3,v4); v3=t;\n  t=min(v2,v4); v4=max(v2,v4); v2=t;\n  t=min(v2,v3); v3=max(v2,v3); v2=t;\n  t=min(v0,v3); v3=max(v0,v3); v0=t;\n  t=min(v0,v2); v2=max(v0,v2); v0=t;\n  t=min(v1,v4); v4=max(v1,v4); v1=t;\n  t=min(v1,v3); v3=max(v1,v3); v1=t;\n  t=min(v1,v2); v2=max(v1,v2); v1=t;\n  return v2;\n}\nfloat _gpu_median_6(float a, float b, float c, float d, float e, float f) {\n  float t; float v0=a,v1=b,v2=c,v3=d,v4=e,v5=f;\n  t=min(v0,v1); v1=max(v0,v1); v0=t;\n  t=min(v2,v3); v3=max(v2,v3); v2=t;\n  t=min(v4,v5); v5=max(v4,v5); v4=t;\n  t=min(v0,v2); v2=max(v0,v2); v0=t;\n  t=min(v1,v3); v3=max(v1,v3); v1=t;\n  t=min(v0,v4); v4=max(v0,v4); v0=t;\n  t=min(v1,v5); v5=max(v1,v5); v1=t;\n  t=min(v2,v4); v4=max(v2,v4); v2=t;\n  t=min(v1,v2); v2=max(v1,v2); v1=t;\n  t=min(v3,v5); v5=max(v3,v5); v3=t;\n  t=min(v3,v4); v4=max(v3,v4); v3=t;\n  return (v2 + v3) * 0.5;\n}\nfloat _gpu_median_7(float a, float b, float c, float d, float e, float f, float g) {\n  float t; float v0=a,v1=b,v2=c,v3=d,v4=e,v5=f,v6=g;\n  t=min(v0,v1); v1=max(v0,v1); v0=t;\n  t=min(v2,v3); v3=max(v2,v3); v2=t;\n  t=min(v4,v5); v5=max(v4,v5); v4=t;\n  t=min(v0,v2); v2=max(v0,v2); v0=t;\n  t=min(v1,v3); v3=max(v1,v3); v1=t;\n  t=min(v4,v6); v6=max(v4,v6); v4=t;\n  t=min(v0,v4); v4=max(v0,v4); v0=t;\n  t=min(v1,v5); v5=max(v1,v5); v1=t;\n  t=min(v2,v6); v6=max(v2,v6); v2=t;\n  t=min(v1,v2); v2=max(v1,v2); v1=t;\n  t=min(v3,v5); v5=max(v3,v5); v3=t;\n  t=min(v2,v4); v4=max(v2,v4); v2=t;\n  t=min(v3,v4); v4=max(v3,v4); v3=t;\n  return v3;\n}\nfloat _gpu_median_8(float a, float b, float c, float d, float e, float f, float g, float h) {\n  float t; float v0=a,v1=b,v2=c,v3=d,v4=e,v5=f,v6=g,v7=h;\n  t=min(v0,v1); v1=max(v0,v1); v0=t;\n  t=min(v2,v3); v3=max(v2,v3); v2=t;\n  t=min(v4,v5); v5=max(v4,v5); v4=t;\n  t=min(v6,v7); v7=max(v6,v7); v6=t;\n  t=min(v0,v2); v2=max(v0,v2); v0=t;\n  t=min(v1,v3); v3=max(v1,v3); v1=t;\n  t=min(v4,v6); v6=max(v4,v6); v4=t;\n  t=min(v5,v7); v7=max(v5,v7); v5=t;\n  t=min(v0,v4); v4=max(v0,v4); v0=t;\n  t=min(v1,v5); v5=max(v1,v5); v1=t;\n  t=min(v2,v6); v6=max(v2,v6); v2=t;\n  t=min(v3,v7); v7=max(v3,v7); v3=t;\n  t=min(v1,v2); v2=max(v1,v2); v1=t;\n  t=min(v3,v4); v4=max(v3,v4); v3=t;\n  t=min(v5,v6); v6=max(v5,v6); v5=t;\n  t=min(v3,v5); v5=max(v3,v5); v3=t;\n  t=min(v2,v4); v4=max(v2,v4); v2=t;\n  t=min(v3,v4); v4=max(v3,v4); v3=t;\n  return (v3 + v4) * 0.5;\n}\n";
+/**
+ * GPU Median preamble (WGSL syntax).
+ *
+ * Same sorting-network logic as the GLSL version with WGSL syntax.
+ */
+export declare const GPU_MEDIAN_PREAMBLE_WGSL = "\nfn _gpu_median_2(a: f32, b: f32) -> f32 {\n  return (a + b) * 0.5;\n}\nfn _gpu_median_3(a: f32, b: f32, c: f32) -> f32 {\n  return max(min(a, b), min(max(a, b), c));\n}\nfn _gpu_median_4(a: f32, b: f32, c: f32, d: f32) -> f32 {\n  let lo = max(min(a, b), min(c, d));\n  let hi = min(max(a, b), max(c, d));\n  return (lo + hi) * 0.5;\n}\nfn _gpu_median_5(a: f32, b: f32, c: f32, d: f32, e: f32) -> f32 {\n  // 9-comparator Bose-Nelson sort; v2 holds the median.\n  var v0=a; var v1=b; var v2=c; var v3=d; var v4=e; var t: f32;\n  t=min(v0,v1); v1=max(v0,v1); v0=t;\n  t=min(v3,v4); v4=max(v3,v4); v3=t;\n  t=min(v2,v4); v4=max(v2,v4); v2=t;\n  t=min(v2,v3); v3=max(v2,v3); v2=t;\n  t=min(v0,v3); v3=max(v0,v3); v0=t;\n  t=min(v0,v2); v2=max(v0,v2); v0=t;\n  t=min(v1,v4); v4=max(v1,v4); v1=t;\n  t=min(v1,v3); v3=max(v1,v3); v1=t;\n  t=min(v1,v2); v2=max(v1,v2); v1=t;\n  return v2;\n}\nfn _gpu_median_6(a: f32, b: f32, c: f32, d: f32, e: f32, f: f32) -> f32 {\n  var v0=a; var v1=b; var v2=c; var v3=d; var v4=e; var v5=f; var t: f32;\n  t=min(v0,v1); v1=max(v0,v1); v0=t;\n  t=min(v2,v3); v3=max(v2,v3); v2=t;\n  t=min(v4,v5); v5=max(v4,v5); v4=t;\n  t=min(v0,v2); v2=max(v0,v2); v0=t;\n  t=min(v1,v3); v3=max(v1,v3); v1=t;\n  t=min(v0,v4); v4=max(v0,v4); v0=t;\n  t=min(v1,v5); v5=max(v1,v5); v1=t;\n  t=min(v2,v4); v4=max(v2,v4); v2=t;\n  t=min(v1,v2); v2=max(v1,v2); v1=t;\n  t=min(v3,v5); v5=max(v3,v5); v3=t;\n  t=min(v3,v4); v4=max(v3,v4); v3=t;\n  return (v2 + v3) * 0.5;\n}\nfn _gpu_median_7(a: f32, b: f32, c: f32, d: f32, e: f32, f: f32, g: f32) -> f32 {\n  var v0=a; var v1=b; var v2=c; var v3=d; var v4=e; var v5=f; var v6=g; var t: f32;\n  t=min(v0,v1); v1=max(v0,v1); v0=t;\n  t=min(v2,v3); v3=max(v2,v3); v2=t;\n  t=min(v4,v5); v5=max(v4,v5); v4=t;\n  t=min(v0,v2); v2=max(v0,v2); v0=t;\n  t=min(v1,v3); v3=max(v1,v3); v1=t;\n  t=min(v4,v6); v6=max(v4,v6); v4=t;\n  t=min(v0,v4); v4=max(v0,v4); v0=t;\n  t=min(v1,v5); v5=max(v1,v5); v1=t;\n  t=min(v2,v6); v6=max(v2,v6); v2=t;\n  t=min(v1,v2); v2=max(v1,v2); v1=t;\n  t=min(v3,v5); v5=max(v3,v5); v3=t;\n  t=min(v2,v4); v4=max(v2,v4); v2=t;\n  t=min(v3,v4); v4=max(v3,v4); v3=t;\n  return v3;\n}\nfn _gpu_median_8(a: f32, b: f32, c: f32, d: f32, e: f32, f: f32, g: f32, h: f32) -> f32 {\n  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;\n  t=min(v0,v1); v1=max(v0,v1); v0=t;\n  t=min(v2,v3); v3=max(v2,v3); v2=t;\n  t=min(v4,v5); v5=max(v4,v5); v4=t;\n  t=min(v6,v7); v7=max(v6,v7); v6=t;\n  t=min(v0,v2); v2=max(v0,v2); v0=t;\n  t=min(v1,v3); v3=max(v1,v3); v1=t;\n  t=min(v4,v6); v6=max(v4,v6); v4=t;\n  t=min(v5,v7); v7=max(v5,v7); v5=t;\n  t=min(v0,v4); v4=max(v0,v4); v0=t;\n  t=min(v1,v5); v5=max(v1,v5); v1=t;\n  t=min(v2,v6); v6=max(v2,v6); v2=t;\n  t=min(v3,v7); v7=max(v3,v7); v3=t;\n  t=min(v1,v2); v2=max(v1,v2); v1=t;\n  t=min(v3,v4); v4=max(v3,v4); v3=t;\n  t=min(v5,v6); v6=max(v5,v6); v5=t;\n  t=min(v3,v5); v5=max(v3,v5); v3=t;\n  t=min(v2,v4); v4=max(v2,v4); v2=t;\n  t=min(v3,v4); v4=max(v3,v4); v3=t;\n  return (v3 + v4) * 0.5;\n}\n";
 /**
  * GPU color space conversion preamble (GLSL syntax).
  *

package/dist/types/compute-engine/compilation/interval-javascript-target.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * JavaScript interval arithmetic compilation target
  *
  * Compiles mathematical expressions to JavaScript code using interval arithmetic

package/dist/types/compute-engine/compilation/javascript-target.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import { chop, factorial, factorial2, gcd, lcm, limit } from '../numerics/numeric';
 import { gamma, gammaln, erf, erfc, erfInv, beta, digamma, trigamma, polygamma, zeta, lambertW, besselJ, besselY, besselI, besselK, airyAi, airyBi, fresnelS, fresnelC, sinc } from '../numerics/special-functions';
 import { choose } from '../boxed-expression/expand';

package/dist/types/compute-engine/compilation/python-target.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { CompileTarget, CompiledOperators, CompiledFunctions, LanguageTarget, CompilationOptions, CompilationResult } from './types';
 /**
  * Python/NumPy language target implementation

package/dist/types/compute-engine/compilation/types.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 /**
  * Source code in the target language
  */

package/dist/types/compute-engine/compilation/wgsl-target.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { CompiledFunctions } from './types';
 import { GPUShaderTarget } from './gpu-target';
 /**

package/dist/types/compute-engine/cost-function.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 /**
  * The default cost function, used to determine if a new expression is simpler
  * than the old one.

package/dist/types/compute-engine/engine-assumptions.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { MathJsonSymbol } from '../math-json/types';
 export declare function ask(ce: IComputeEngine, pattern: Expression): BoxedSubstitution[];
 export declare function verify(ce: IComputeEngine, query: Expression): boolean | undefined;

package/dist/types/compute-engine/engine-cache.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
     private _entries;
     getOrBuild<T>(cacheName: string, build: () => T, purge?: (t: T) => T | undefined): T;
     invalidate(cacheName: string): void;

package/dist/types/compute-engine/engine-common-symbols.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export type CommonSymbolTable = {
     [symbol: string]: null | Expression;
 };

package/dist/types/compute-engine/engine-compilation-targets.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { LanguageTarget } from './compilation/types';
 /**
  * Internal registry for compilation targets.

package/dist/types/compute-engine/engine-configuration-lifecycle.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 type ResetHooks = {
     refreshNumericConstants: () => void;
     resetCommonSymbols: () => void;

package/dist/types/compute-engine/engine-declarations.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import { BoxedType } from '../common/type/boxed-type';
 import type { MathJsonSymbol } from '../math-json/types';
 import type { ValueDefinition, OperatorDefinition, AssignValue, Expression, BoxedDefinition, SymbolDefinition, IComputeEngine, Scope } from './global-types';

package/dist/types/compute-engine/engine-expression-entrypoints.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import { BigDecimal } from '../big-decimal';
 import type { MathJsonNumberObject, MathJsonSymbol } from '../math-json/types';
 import { NumericValue } from './numeric-value/types';

package/dist/types/compute-engine/engine-extension-contracts.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { LanguageTarget, CompilationOptions } from './compilation/types';
 export declare function assertCompilationTargetName(name: unknown): string;
 export declare function assertLibraryName(name: unknown): string;

package/dist/types/compute-engine/engine-library-bootstrap.d.ts

@@ -1,3 +1,3 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare function resolveBootstrapLibraries(libraries?: readonly (string | LibraryDefinition)[]): LibraryDefinition[];
 export declare function loadLibraryDefinitions(engine: ComputeEngine, libraries: readonly LibraryDefinition[]): void;

package/dist/types/compute-engine/engine-numeric-configuration.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { AngularUnit } from './types-definitions';
 export declare class EngineNumericConfiguration {
     private _precision;

package/dist/types/compute-engine/engine-runtime-state.d.ts

@@ -1,7 +1,8 @@
-/* 0.56.0 */
+/* 0.58.0 */
     private _timeLimit;
     private _iterationLimit;
     private _recursionLimit;
+    private _maxCollectionSize;
     private _deadline;
     private _isVerifying;
     get timeLimit(): number;
@@ -10,6 +11,8 @@
     set iterationLimit(value: number);
     get recursionLimit(): number;
     set recursionLimit(value: number);
+    get maxCollectionSize(): number;
+    set maxCollectionSize(value: number);
     get deadline(): number | undefined;
     set deadline(value: number | undefined);
     get timeRemaining(): number;

package/dist/types/compute-engine/engine-scope.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare function pushScope(ce: IComputeEngine, scope?: Scope, name?: string): void;
 export declare function popScope(ce: IComputeEngine): void;
 export declare function pushEvalContext(ce: IComputeEngine, scope: Scope, name?: string): void;

package/dist/types/compute-engine/engine-sequences.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare function declareSequence(ce: IComputeEngine, name: string, def: SequenceDefinition): IComputeEngine;
 export declare function getSequenceStatus(ce: IComputeEngine, name: string): SequenceStatus;
 export declare function getSequence(ce: IComputeEngine, name: string): SequenceInfo | undefined;

package/dist/types/compute-engine/engine-simplification-rules.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 /**
  * Internal holder for simplification rules and their cache-staleness marker.
  *

package/dist/types/compute-engine/engine-startup-coordinator.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { Expression, IComputeEngine as ComputeEngine, LibraryDefinition } from './global-types';
 export type CommonNumberBindings = {
     Zero: Expression;

package/dist/types/compute-engine/engine-type-resolver.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 type ResolverScope = {
     parent: ResolverScope | null;
     types?: Record<string, TypeReference>;

package/dist/types/compute-engine/engine-validation-entrypoints.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import { BoxedType } from '../common/type/boxed-type';
 import type { Expression, Metadata, ExpressionInput } from './global-types';
 type ValidationHost = {

package/dist/types/compute-engine/free-functions.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { Type, TypeString } from '../common/type/types';
 import type { LatexString, ParseLatexOptions } from './latex-syntax/types';
 import { compile as compileExpr } from './compilation/compile-expression';

package/dist/types/compute-engine/function-utils.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { BoxedDefinition, Expression, IComputeEngine as ComputeEngine, Scope } from './global-types';
 /***
  * ### THEORY OF OPERATIONS

package/dist/types/compute-engine/global-types.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export type * from './types-serialization';
 export type { ValueDefinition, SequenceDefinition, SequenceStatus, SequenceInfo, OEISSequenceInfo, OEISOptions, OperatorDefinition, BaseDefinition, SimplifyOptions, SymbolDefinition, SymbolDefinitions, LibraryDefinition, AngularUnit, Sign, BaseCollectionHandlers, IndexedCollectionHandlers, CollectionHandlers, TaggedValueDefinition, TaggedOperatorDefinition, BoxedDefinition, BoxedBaseDefinition, BoxedValueDefinition, OperatorDefinitionFlags, BoxedOperatorDefinition, } from './types-definitions';
 export type * from './types-evaluation';

package/dist/types/compute-engine/index.d.ts

@@ -1,11 +1,11 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import { BigDecimal } from '../big-decimal';
 import { Type, TypeResolver, TypeString } from '../common/type/types';
 import { BoxedType } from '../common/type/boxed-type';
 import type { OneOf } from '../common/one-of';
 import type { ConfigurationChangeListener } from '../common/configuration-change';
 import type { MathJsonExpression, MathJsonSymbol, MathJsonNumberObject } from '../math-json/types';
-import type { ValueDefinition, OperatorDefinition, AngularUnit, AssignValue, AssumeResult, Expression, BoxedRule, BoxedRuleSet, BoxedSubstitution, CanonicalOptions, Metadata, Rule, Scope, EvalContext, ExpressionInput, IComputeEngine, ILatexSyntax, BoxedDefinition, SymbolDefinition, SequenceDefinition, SequenceStatus, SequenceInfo, OEISSequenceInfo, OEISOptions, LibraryDefinition } from './global-types';
+import type { ValueDefinition, OperatorDefinition, AngularUnit, AssignValue, AssumeResult, Expression, BoxedRule, BoxedRuleSet, BoxedSubstitution, CanonicalOptions, Metadata, Rule, Scope, EvalContext, ExpressionInput, IComputeEngine, ILatexSyntax, BoxedDefinition, SymbolDefinition, SequenceDefinition, SequenceStatus, SequenceInfo, OEISSequenceInfo, OEISOptions, LibraryDefinition, OperatorInfo, SymbolInfo } from './global-types';
 import type { LibraryCategory, ParseLatexOptions, SerializeLatexOptions } from './latex-syntax/types';
 import type { BigNum, Rational } from './numerics/types';
 import { ExactNumericValueData, NumericValue, NumericValueData } from './numeric-value/types';
@@ -259,6 +259,19 @@ export declare class ComputeEngine implements IComputeEngine {
      */
     get recursionLimit(): number;
     set recursionLimit(t: number);
+    /** Maximum number of elements a collection may have when materialized
+     * (converted from a lazy form to a `List`). Default: 10,000.
+     *
+     * When a materialization would exceed this size, the operation leaves
+     * the expression in its lazy form. Consumers can detect oversize
+     * collections via the symbolic form's `count`.
+     *
+     * Set to `Infinity` (or `0` / a negative number) to disable the cap.
+     *
+     * @experimental
+     */
+    get maxCollectionSize(): number;
+    set maxCollectionSize(t: number);
     /**
      * Flag to prevent infinite recursion in the verify/ask/equality checking cycle.
      *
@@ -437,6 +450,9 @@ export declare class ComputeEngine implements IComputeEngine {
      * lexical scope and going up the scope chain.
      */
     lookupDefinition(id: MathJsonSymbol): undefined | BoxedDefinition;
+    normalizeIdentifier(latex: string): string;
+    operatorInfo(head: string): OperatorInfo | undefined;
+    symbolInfo(name: string): SymbolInfo | undefined;
     /**
      * Associate a new definition to a symbol in the current context.
      *

package/dist/types/compute-engine/interval/arithmetic.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * Basic interval arithmetic operations
  *
  * @module interval/arithmetic

package/dist/types/compute-engine/interval/comparison.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * Comparison and conditional interval operations
  *
  * @module interval/comparison

package/dist/types/compute-engine/interval/elementary.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * Elementary interval functions (sqrt, pow, exp, ln, abs, floor, ceil, min, max, mod)
  *
  * @module interval/elementary

package/dist/types/compute-engine/interval/index.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * Interval arithmetic library for reliable function evaluation
  *
  * This module provides interval versions of mathematical operations

package/dist/types/compute-engine/interval/trigonometric.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * Trigonometric interval functions
  *
  * @module interval/trigonometric

package/dist/types/compute-engine/interval/types.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * Interval arithmetic types for reliable function evaluation
  *
  * @module interval/types

package/dist/types/compute-engine/interval/util.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * Utility functions for interval arithmetic
  *
  * @module interval/util

package/dist/types/compute-engine/latex-syntax/dictionary/default-dictionary.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * Default LaTeX dictionary assembly.
  *
  * This file imports all individual domain dictionaries and assembles them

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-algebra.d.ts

@@ -1,2 +1,2 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_ALGEBRA: LatexDictionary;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-arithmetic.d.ts

@@ -1,2 +1,2 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_ARITHMETIC: LatexDictionary;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-calculus.d.ts

@@ -1,2 +1,2 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_CALCULUS: LatexDictionary;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-colors.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 /**
  * LaTeX dictionary for color constructors and conversions.
  *

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-complex.d.ts

@@ -1,2 +1,2 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_COMPLEX: LatexDictionary;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-core.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_CORE: LatexDictionary;
 export declare const DELIMITERS_SHORTHAND: {
     '(': string;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-linear-algebra.d.ts

@@ -1,2 +1,2 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_LINEAR_ALGEBRA: LatexDictionary;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-logic.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import type { MathJsonExpression } from '../../../math-json';
 export declare const DEFINITIONS_LOGIC: LatexDictionary;
 export declare function parseQuantifier(kind: 'NotForAll' | 'NotExists' | 'ForAll' | 'Exists' | 'ExistsUnique'): (parser: Parser, terminator: Readonly<Terminator>) => MathJsonExpression | null;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-other.d.ts

@@ -1,2 +1,2 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_OTHERS: LatexDictionary;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-relational-operators.d.ts

@@ -1,2 +1,2 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_INEQUALITIES: LatexDictionaryEntry[];

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-sets.d.ts

@@ -1,2 +1,2 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_SETS: LatexDictionary;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-statistics.d.ts

@@ -1,2 +1,2 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_STATISTICS: LatexDictionary;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-symbols.d.ts

@@ -1,3 +1,3 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const SYMBOLS: [string, string, number][];
 export declare const DEFINITIONS_SYMBOLS: LatexDictionary;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-trigonometry.d.ts

@@ -1,2 +1,2 @@
-/* 0.56.0 */
+/* 0.58.0 */
 export declare const DEFINITIONS_TRIGONOMETRY: LatexDictionary;

package/dist/types/compute-engine/latex-syntax/dictionary/definitions-units.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
  * LaTeX dictionary entries for parsing and serializing physical quantities
  * with units.
  *

package/dist/types/compute-engine/latex-syntax/dictionary/definitions.d.ts

@@ -1,4 +1,4 @@
-/* 0.56.0 */
+/* 0.58.0 */
 import { LatexDictionaryEntry } from '../types';
 export type { CommonEntry, IndexedSymbolEntry, IndexedExpressionEntry, IndexedFunctionEntry, IndexedMatchfixEntry, IndexedInfixEntry, IndexedPrefixEntry, IndexedPostfixEntry, IndexedEnvironmentEntry, IndexedLatexDictionaryEntry, IndexedLatexDictionary, } from './indexed-types';
 import type { IndexedSymbolEntry, IndexedExpressionEntry, IndexedFunctionEntry, IndexedMatchfixEntry, IndexedInfixEntry, IndexedPostfixEntry, IndexedEnvironmentEntry, IndexedLatexDictionaryEntry, IndexedLatexDictionary } from './indexed-types';