@cortex-js/compute-engine 0.63.0 → 0.64.0

package/dist/numerics.umd.cjs

@@ -1,4 +1,4 @@
-/** Numerics 0.63.0 */
+/** Numerics 0.64.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.Numerics = {}));})(this, (function (exports) { 'use strict';
 "use strict";
 var Numerics = (() => {
@@ -134,6 +134,7 @@ var Numerics = (() => {
     machineNumerator: () => machineNumerator,
     mean: () => mean,
     median: () => median,
+    modPow: () => modPow,
     mode: () => mode,
     monteCarloEstimate: () => monteCarloEstimate,
     mul: () => mul,
@@ -2286,7 +2287,6 @@ var Numerics = (() => {
   }
 
   // src/compute-engine/numerics/primes.ts
-  var LARGE_PRIME = 1125899906842597;
   var SMALL_PRIMES = /* @__PURE__ */ new Set([
     2,
     3,
@@ -3334,101 +3334,63 @@ var Numerics = (() => {
     return result;
   }
   function isPrime(n) {
-    if (!Number.isInteger(n) || !Number.isFinite(n) || Number.isNaN(n) || n <= 1) {
-      return false;
-    }
-    if (n <= LARGEST_SMALL_PRIME) return SMALL_PRIMES.has(n);
-    for (const smallPrime of SMALL_PRIMES) {
-      if (n % smallPrime === 0) return false;
-    }
-    if (n < LARGE_PRIME) return n === leastFactor(n) || void 0;
-    return probablyPrime(n, 30) ? void 0 : false;
-  }
-  function leastFactor(n) {
-    if (n === 1) return 1;
-    if (n % 2 === 0) return 2;
-    if (n % 3 === 0) return 3;
-    if (n % 5 === 0) return 5;
-    const m = Math.floor(Math.sqrt(n));
-    let i = 7;
-    while (i <= m) {
-      if (n % i === 0) return i;
-      if (n % (i + 4) === 0) return i + 4;
-      if (n % (i + 6) === 0) return i + 6;
-      if (n % (i + 10) === 0) return i + 10;
-      if (n % (i + 12) === 0) return i + 12;
-      if (n % (i + 16) === 0) return i + 16;
-      if (n % (i + 22) === 0) return i + 22;
-      if (n % (i + 24) === 0) return i + 24;
-      i += 30;
-    }
-    return n;
-  }
+    if (!Number.isInteger(n) || !Number.isFinite(n) || n <= 1) return false;
+    return isPrimeBigint(BigInt(n));
+  }
+  var MILLER_RABIN_THRESHOLD = 1n << 32n;
+  var MILLER_RABIN_BASES = [
+    2n,
+    3n,
+    5n,
+    7n,
+    11n,
+    13n,
+    17n,
+    19n,
+    23n,
+    29n,
+    31n,
+    37n
+  ];
   function isPrimeBigint(n) {
-    if (n <= 1) return false;
-    if (n <= LARGEST_SMALL_PRIME) return isPrime(Number(n));
-    for (const smallPrime of SMALL_PRIMES) {
-      if (n % BigInt(smallPrime) === BigInt(0)) return false;
-    }
-    if (n < LARGE_PRIME) n = leastBigFactor(n);
-    return probablyPrimeBigint(n, 30) ? void 0 : false;
-  }
-  function leastBigFactor(n) {
-    if (n === BigInt(1)) return BigInt(1);
-    if (n % BigInt(2) === BigInt(0)) return BigInt(2);
-    if (n % BigInt(3) === BigInt(0)) return BigInt(3);
-    if (n % BigInt(5) === BigInt(0)) return BigInt(5);
-    const m = BigInt(Math.floor(Math.sqrt(Number(n))));
-    let i = BigInt(7);
-    while (i <= m) {
-      if (n % i === BigInt(0)) return i;
-      if (n % (i + BigInt(4)) === BigInt(0)) return i + BigInt(4);
-      if (n % (i + BigInt(6)) === BigInt(0)) return i + BigInt(6);
-      if (n % (i + BigInt(10)) === BigInt(0)) return i + BigInt(10);
-      if (n % (i + BigInt(12)) === BigInt(0)) return i + BigInt(12);
-      if (n % (i + BigInt(16)) === BigInt(0)) return i + BigInt(16);
-      if (n % (i + BigInt(22)) === BigInt(0)) return i + BigInt(22);
-      if (n % (i + BigInt(24)) === BigInt(0)) return i + BigInt(24);
-      i += BigInt(30);
+    if (n < 2n) return false;
+    if (n <= LARGEST_SMALL_PRIME) return SMALL_PRIMES.has(Number(n));
+    if (n < MILLER_RABIN_THRESHOLD) {
+      if (n % 2n === 0n || n % 3n === 0n) return false;
+      for (let i = 5n; i * i <= n; i += 6n)
+        if (n % i === 0n || n % (i + 2n) === 0n) return false;
+      return true;
     }
-    return n;
+    return millerRabin(n);
   }
-  function probablyPrime(n, k) {
-    let s = 0;
-    let d = n - 1;
-    while (d % 2 === 0) {
-      d /= 2;
-      ++s;
-    }
-    WitnessLoop: do {
-      let x = Math.pow(2 + Math.floor(Math.random() * (n - 3)), d) % n;
-      if (x === 1 || x === n - 1) continue;
-      for (let i = s - 1; i--; ) {
-        x = x * x % n;
-        if (x === 1) return false;
-        if (x === n - 1) continue WitnessLoop;
-      }
-      return false;
-    } while (--k);
-    return true;
+  function modPow(base, exp, mod) {
+    if (mod === 1n) return 0n;
+    let result = 1n;
+    base = (base % mod + mod) % mod;
+    while (exp > 0n) {
+      if (exp & 1n) result = result * base % mod;
+      base = base * base % mod;
+      exp >>= 1n;
+    }
+    return result;
   }
-  function probablyPrimeBigint(n, k) {
-    let s = 0;
-    let d = n - BigInt(1);
-    while (d % BigInt(2) === BigInt(0)) {
-      d = d / BigInt(2);
-      ++s;
-    }
-    WitnessLoop: do {
-      let x = BigInt(2 + Math.floor(Math.random() * (Number(n) - 3))) ** d % n;
-      if (x === BigInt(1) || x === n - BigInt(1)) continue;
-      for (let i = s - 1; i--; ) {
+  function millerRabin(n) {
+    for (const p of MILLER_RABIN_BASES) if (n % p === 0n) return n === p;
+    let d = n - 1n;
+    let s = 0n;
+    while (d % 2n === 0n) {
+      d /= 2n;
+      s += 1n;
+    }
+    WitnessLoop: for (const a of MILLER_RABIN_BASES) {
+      let x = modPow(a, d, n);
+      if (x === 1n || x === n - 1n) continue;
+      for (let r = 1n; r < s; r++) {
         x = x * x % n;
-        if (x === BigInt(1)) return false;
-        if (x === n - BigInt(1)) continue WitnessLoop;
+        if (x === n - 1n) continue WitnessLoop;
       }
       return false;
-    } while (--k);
+    }
     return true;
   }
   var PRIME_WHEEL_INC = [
@@ -10421,7 +10383,7 @@ var Numerics = (() => {
   var C_ZERO = new Complex(0, 0);
 
   // src/numerics.ts
-  var version = "0.63.0";
+  var version = "0.64.0";
   return __toCommonJS(numerics_exports);
 })();
 /*! Bundled license information:

package/dist/types/big-decimal/big-decimal.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
  * BigDecimal: an arbitrary-precision decimal type.
  *
  * Value = significand * 10^exponent

package/dist/types/big-decimal/index.d.ts

@@ -1,2 +1,2 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import './transcendentals';

package/dist/types/big-decimal/transcendentals.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
  * Transcendental / irrational operations for BigDecimal.
  *
  * This module attaches `sqrt()` and `cbrt()` to BigDecimal.prototype

package/dist/types/big-decimal/utils.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
  * Fixed-point BigInt utilities for internal use by transcendental functions.
  *
  * A "fixed-point BigInt" represents a real number as `value = n / 2^bits`

package/dist/types/common/ansi-codes.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export declare const DEFAULT_COLOR = "\u001B[39m";
 export declare const DEFAULT_BG = "\u001B[49m";
 export declare const WHITE_BG = "\u001B[47m";

package/dist/types/common/configuration-change.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
     private _listeners;
     private _registered;
     private _pending;

package/dist/types/common/fuzzy-string-match.d.ts

@@ -1,2 +1,2 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export declare function fuzzyStringMatch(invalidWord: string, validWords: string[]): string | null;

package/dist/types/common/grapheme-splitter.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /**
  * Return a string or an array of graphemes.
  *

package/dist/types/common/interruptible.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
     cause: unknown;
     value?: T;
     constructor({ message, value, cause, }?: {

package/dist/types/common/one-of.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
     infer Head,
     ...infer Rem
 ] ? MergeTypes<Rem, Res & Head> : Res;

package/dist/types/common/signals.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export type RuntimeSignalCode = 'timeout' | 'out-of-memory' | 'recursion-depth-exceeded' | 'iteration-limit-exceeded';
 /** @category Error Handling */
 export type SignalCode = RuntimeSignalCode | ('invalid-name' | 'expected-predicate' | 'expected-symbol' | 'operator-requires-one-operand' | 'postfix-operator-requires-one-operand' | 'prefix-operator-requires-one-operand' | 'unbalanced-symbols' | 'expected-argument' | 'unexpected-command' | 'cyclic-definition' | 'invalid-supersets' | 'expected-supersets' | 'unknown-domain' | 'duplicate-wikidata' | 'invalid-dictionary-entry' | 'syntax-error');

package/dist/types/common/type/ast-nodes.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
     kind: string;
     position: number;
     line: number;

package/dist/types/common/type/boxed-type.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /** @category Type */
 export declare class BoxedType {
     static unknown: BoxedType;

package/dist/types/common/type/lexer.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export interface Token {
     type: TokenType;
     value: string;

package/dist/types/common/type/parse.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export declare function parseType(s: undefined, typeResolver?: TypeResolver): undefined;
 export declare function parseType(s: TypeString | Type, typeResolver?: TypeResolver): Type;
 export declare function parseType(s: TypeString | Type | undefined, typeResolver?: TypeResolver): Type | undefined;

package/dist/types/common/type/parser.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { TypeNode } from './ast-nodes';
 import { TypeResolver } from './types';
 /**

package/dist/types/common/type/primitive.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /** All the types representing numeric values */
 export declare const NUMERIC_TYPES: NumericPrimitiveType[];
 export declare const INDEXED_COLLECTION_TYPES: PrimitiveType[];

package/dist/types/common/type/reduce.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /**
  * Reduce the input type
  *

package/dist/types/common/type/serialize.d.ts

@@ -1,2 +1,2 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export declare function typeToString(type: Type, precedence?: number): string;

package/dist/types/common/type/subtype.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /** Return true if lhs is a subtype of rhs */
 export declare function isPrimitiveSubtype(lhs: PrimitiveType, rhs: PrimitiveType): boolean;
 /**

package/dist/types/common/type/type-builder.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { Type, TypeResolver } from './types';
 export declare class TypeBuilder implements ASTVisitor<Type> {
     private typeResolver;

package/dist/types/common/type/types.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
  * A primitive type is a simple type that represents a concrete value.
  *
  * - `any`: the top type

package/dist/types/common/type/utils.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export { isValidType };
 export { widen, narrow } from './subtype';
 import type { Type, FunctionSignature, TypeString } from './types';

package/dist/types/common/utils.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
  *
  * <!--
  * !@consider?

package/dist/types/compile.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export { compile } from './compute-engine/compilation/compile-expression';
 export { JavaScriptTarget } from './compute-engine/compilation/javascript-target';
 export { GPUShaderTarget } from './compute-engine/compilation/gpu-target';

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { type Subject } from './boxed-expression/constraint-subject';
 /**
  * Add an assumption, in the form of a predicate, for example:

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import type { MathJsonExpression, MathJsonSymbol } from '../../math-json/types';
 import type { Type, TypeString } from '../../common/type/types';
 import { BoxedType } from '../../common/type/boxed-type';

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { BigDecimal } from '../../big-decimal';
 import type { Expression } from '../global-types';
 export declare function apply(expr: Expression, fn: (x: number) => number | Complex, bigFn?: (x: BigDecimal) => BigDecimal | Complex | number, complexFn?: (x: Complex) => number | Complex): Expression | undefined;

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { BoxedType } from '../../common/type/boxed-type';
 import type { Expression, IComputeEngine as ComputeEngine } from '../global-types';
 /**

package/dist/types/compute-engine/boxed-expression/arithmetic-mul-div.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { NumericValue } from '../numeric-value/types';
 import type { Rational } from '../numerics/types';
 /**

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import type { Rational } from '../numerics/types';
 export declare function asRadical(expr: Expression): Rational | null;
 /**

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export type AsciiMathSerializer = (expr: Expression, precedence?: number) => string;
 export type AsciiMathOptions = {
     symbols: Record<string, string>;

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import type { FormOption } from '../types-serialization';
 import type { MathJsonSymbol } from '../../math-json/types';
 import { NumericValue } from '../numeric-value/types';

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { _BoxedExpression } from './abstract-boxed-expression';
 import { BoxedType } from '../../common/type/boxed-type';
 import { DictionaryValue, MathJsonExpression } from '../../math-json/types';

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import type { SimplifyOptions, ReplaceOptions, PatternMatchOptions, Expression, BoxedBaseDefinition, BoxedOperatorDefinition, BoxedRuleSet, BoxedSubstitution, CanonicalOptions, EvaluateOptions, IComputeEngine as ComputeEngine, Metadata, Rule, Sign, Substitution, Scope, BoxedValueDefinition, ExpressionInput, FunctionInterface } from '../global-types';
 import { Type } from '../../common/type/types';
 import { BoxedType } from '../../common/type/boxed-type';

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { BigDecimal } from '../../big-decimal';
 import type { MathJsonExpression, MathJsonNumberObject } from '../../math-json';
 import type { Rational, SmallInteger } from '../numerics/types';

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { BoxedType } from '../../common/type/boxed-type';
 import type { OperatorDefinition, Expression, BoxedOperatorDefinition, CollectionHandlers, CompiledExpression, EvaluateOptions, IComputeEngine as ComputeEngine, Scope, Sign } from '../global-types';
 export declare class _BoxedOperatorDefinition implements BoxedOperatorDefinition {

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
  * # Pattern Matching Wildcards
  *
  * Patterns can contain wildcards that match parts of expressions. There are

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { _BoxedExpression } from './abstract-boxed-expression';
 import { BoxedType } from '../../common/type/boxed-type';
 /**

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import type { Type, TypeString } from '../../common/type/types';
 import type { OneOf } from '../../common/one-of';
 import { BoxedType } from '../../common/type/boxed-type';

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import type { IComputeEngine as ComputeEngine, TensorDataType, Metadata, BoxedBaseDefinition, BoxedOperatorDefinition, BoxedSubstitution, EvaluateOptions, Expression, SimplifyOptions, PatternMatchOptions, Tensor, TensorInterface } from '../global-types';
 import { BoxedType } from '../../common/type/boxed-type';
 import { NumericValue } from '../numeric-value/types';

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import type { Type, TypeString } from '../../common/type/types';
 import { BoxedType } from '../../common/type/boxed-type';
 import { ConfigurationChangeListener } from '../../common/configuration-change';

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
     value: T | null;
     generation: number | undefined;
 };

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /**
  * Ensure all expressions in the array are in canonical form
  */

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

@@ -1,2 +1,2 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export declare function canonicalForm(expr: Expression, forms: CanonicalOptions, scope?: Scope): Expression;

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 type ExpandFn = (expr: Expression) => Expression;
 /** @internal */
 export declare function _setExpand(fn: ExpandFn): void;

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
  * Leaf module for shared constants used across boxed-expression modules.
  * No imports from sibling modules to avoid circular dependencies.
  */

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /**
  * Constraint subjects (docs/fungrim/FUNGRIM-PLAN-3-ASSUMPTIONS.md §2).
  *

package/dist/types/compute-engine/boxed-expression/exp-to-trig.d.ts

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /**
  * Rewrite exponentials of an imaginary argument to trigonometric form via
  * Euler's formula, `e^{i theta} -> cos(theta) + i sin(theta)`, throughout the

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export declare function choose(n: number, k: number): number;
 /** Attempt to transform the expression (h, ops) into a sum */
 export declare function expandFunction(ce: ComputeEngine, h: string, ops: ReadonlyArray<Expression>): Expression | null;

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export declare class ExpressionMap<U> implements ExpressionMapInterface<U> {
     readonly _items: Map<Expression, U>;
     constructor(source?: ExpressionMapInterface<U> | readonly (readonly [Expression, U])[]);

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /** Combine rational expressions into a single fraction */
 export declare function together(op: Expression): Expression;
 /**

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /**
  *
  * Optionally make all the arguments canonical (default).

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /** Apply the function `f` to each operand of the expression `expr`,
  * account for the 'lazy' property of the operator definition:
  *

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 import { type Subject } from './constraint-subject';
 /**
  * Extract interval bounds for `symbol` from a condition expression.

package/dist/types/compute-engine/boxed-expression/init-lazy-refs.d.ts

@@ -1 +1 @@
-/* 0.63.0 */
+/* 0.64.0 */

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export declare function canonicalInvisibleOperator(ops: ReadonlyArray<Expression>, { engine: ce }: {
     engine: ComputeEngine;
 }): Expression | null;

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /**
  * The function attempts to match a subject expression to a
  * [pattern](/compute-engine/guides/patterns-and-rules/).

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /**
  * Multivariate polynomial GCD over ℤ via **Brown's dense modular algorithm**
  * (ROADMAP B11, Stage B).

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 /**
  * `MPoly` — a distributed, sparse **multivariate polynomial over ℤ**.
  *

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

@@ -1,4 +1,4 @@
-/* 0.63.0 */
+/* 0.64.0 */
 export declare function canonicalNegate(expr: Expression): Expression;
 /**
  * Distribute `Negate` (multiply by -1) if expr is a number literal, an