@cortex-js/compute-engine 0.58.0 → 0.59.0

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.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.58.0 */
+/* 0.59.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.58.0 */
+/* 0.59.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.58.0 */
+/* 0.59.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.58.0 */
+/* 0.59.0 */
 export declare const DEFINITIONS_INEQUALITIES: LatexDictionaryEntry[];

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

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

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

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

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

@@ -1,3 +1,3 @@
-/* 0.58.0 */
+/* 0.59.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.58.0 */
+/* 0.59.0 */
 export declare const DEFINITIONS_TRIGONOMETRY: LatexDictionary;

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.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.58.0 */
+/* 0.59.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';

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
  * Type definitions for the indexed LaTeX dictionary.
  *
  * These are separated from definitions.ts to break a circular dependency:
@@ -88,4 +88,7 @@ export type IndexedLatexDictionary = {
     functionByTrigger: Map<string, IndexedFunctionEntry[]>;
     symbolByTrigger: Map<string, IndexedSymbolEntry[]>;
     expressionByTrigger: Map<string, IndexedExpressionEntry[]>;
+    operatorByTrigger: Map<string, (IndexedInfixEntry | IndexedPrefixEntry | IndexedPostfixEntry)[]>;
+    universalDefs: Map<string, IndexedLatexDictionaryEntry[]>;
+    symbolTriggerDefs: Map<string, Map<string, IndexedLatexDictionaryEntry[]>>;
 };

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
  * Standalone LaTeX <-> MathJSON parsing and serialization.
  *
  * This module provides a `LatexSyntax` class and free-standing `parse()` /

package/dist/types/compute-engine/latex-syntax/parse-number.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
  * Number parsing extracted from the _Parser class for modularity.
  *
  * All functions take a `Parser` interface and a `NumberFormatTokens` config

package/dist/types/compute-engine/latex-syntax/parse-symbol.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import { Parser } from './types';
 /** For error handling, if we have a symbol prefix, assume
  * the symbol is invalid (it would have been captured by

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import { ParseLatexOptions, LatexToken, Terminator, Parser, SymbolTable } from './types';
 import type { IndexedLatexDictionary, IndexedLatexDictionaryEntry, IndexedInfixEntry, IndexedPostfixEntry, IndexedPrefixEntry, IndexedSymbolEntry, IndexedExpressionEntry, IndexedFunctionEntry } from './dictionary/definitions';
 import { BoxedType } from '../../common/type/boxed-type';
@@ -67,6 +67,8 @@ export declare class _Parser implements Parser {
     private _boundaries;
     private _lastPeek;
     private _peekCounter;
+    private _lookAheadCache;
+    private _lookAheadIndex;
     constructor(tokens: LatexToken[], dictionary: IndexedLatexDictionary, options: Readonly<ParseLatexOptions>);
     private _numberFormatTokens;
     getSymbolType(id: MathJsonSymbol): BoxedType;
@@ -103,7 +105,6 @@ export declare class _Parser implements Parser {
      */
     private canSkipMatchfixReparsing;
     latex(start: number, end?: number): string;
-    private latexAhead;
     /**
      * Return at most `this._dictionary.lookahead` LaTeX tokens.
      *

package/dist/types/compute-engine/latex-syntax/serialize-dms.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
  * DMS (Degrees-Minutes-Seconds) serialization utilities.
  */
 export interface DMSComponents {

package/dist/types/compute-engine/latex-syntax/serialize-number.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import { NumberSerializationFormat } from './types';
 /**
  * @param expr - A number, can be represented as a string
@@ -17,13 +17,3 @@ export declare function serializeNumber(expr: MathJsonExpression | null, options
  * Does not handle integer and non-finite values.
  */
 export declare function serializeHexFloat(value: number): string;
-/**
- * Given a correctly formatted float hex, return the corresponding number.
- *
- * - "0xc.3p0" -> 12.1875
- * - "0x3.0Cp2" -> 12.1875
- * - "0x1.91eb851eb851fp+1" -> 3.14
- * - "0x3.23d70a3d70a3ep0" -> 3.14
- *
- */
-export declare function deserializeHexFloat(value: string): number;

package/dist/types/compute-engine/latex-syntax/serializer-style.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import { DelimiterScale } from './types';
 export declare function getApplyFunctionStyle(_expr: MathJsonExpression, _level: number): DelimiterScale;
 export declare function getGroupStyle(_expr: MathJsonExpression, _level: number): DelimiterScale;

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import { LatexString, SerializeLatexOptions, DelimiterScale } from './types';
 import type { IndexedLatexDictionary, IndexedLatexDictionaryEntry } from './dictionary/definitions';
 export declare class Serializer {

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
  * ## Reference
  * TeX source code:
  * {@link  http://tug.org/texlive/devsrc/Build/source/texk/web2c/tex.web | Tex.web}

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

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

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare function asLatexString(s: unknown): string | null;
 export declare function isRelationalOperator(name: string | undefined): boolean;
 export declare function isInequalityOperator(operator: string | undefined): boolean;

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

@@ -1,3 +1,3 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export type CanonicalArithmeticOperators = 'Add' | 'Negate' | 'Multiply' | 'Divide' | 'Power' | 'Sqrt' | 'Root' | 'Ln';
 export declare const ARITHMETIC_LIBRARY: SymbolDefinitions[];

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

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const CALCULUS_LIBRARY: SymbolDefinitions[];

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const DEFAULT_LINSPACE_COUNT = 50;
 export declare const COLLECTIONS_LIBRARY: SymbolDefinitions;
 /**

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

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const COLORS_LIBRARY: SymbolDefinitions;

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

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const COMBINATORICS_LIBRARY: SymbolDefinitions[];

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

@@ -1,2 +1,14 @@
-/* 0.58.0 */
+/* 0.59.0 */
+import { type SubjectPart } from '../boxed-expression/constraint-subject';
+/**
+ * Assumption-based sign fallback for the part extractors
+ * (`Real`, `Imaginary`, `Argument` — and `Abs` in the arithmetic library):
+ * when the operand is a symbol with no value, look up assumed bounds for the
+ * corresponding subject (e.g. `im:tau` after `assume(Im(tau) > 0)`) and
+ * derive the sign from them (FUNGRIM-PLAN-3-ASSUMPTIONS.md §5.1b).
+ *
+ * Reads the fact index directly (never `ask()`), so it works inside
+ * `verify()`. Returns `undefined` when the facts don't entail a sign.
+ */
+export declare function signFromAssumedPart(ce: ComputeEngine, op: Expression, part: SubjectPart): Sign | undefined;
 export declare const COMPLEX_LIBRARY: SymbolDefinitions[];

package/dist/types/compute-engine/library/control-structures.d.ts

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const CONTROL_STRUCTURES_LIBRARY: SymbolDefinitions[];

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

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const CORE_LIBRARY: SymbolDefinitions[];

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

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const FRACTALS_LIBRARY: SymbolDefinitions[];

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import type { SymbolDefinitions, IComputeEngine as ComputeEngine, LibraryDefinition } from '../global-types';
 /**
  * The standard libraries bundled with the Compute Engine.

package/dist/types/compute-engine/library/linear-algebra.d.ts

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const LINEAR_ALGEBRA_LIBRARY: SymbolDefinitions[];

package/dist/types/compute-engine/library/logic-analysis.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 /**
  * Quantifier domain helpers and boolean analysis functions.
  * Extracted from logic.ts for better code organization.

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

@@ -1,3 +1,3 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const LOGIC_LIBRARY: SymbolDefinitions;
 export declare const LOGIC_FUNCTION_LIBRARY: SymbolDefinitions;

package/dist/types/compute-engine/library/number-theory.d.ts

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const NUMBER_THEORY_LIBRARY: SymbolDefinitions[];

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

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const POLYNOMIALS_LIBRARY: SymbolDefinitions[];

package/dist/types/compute-engine/library/quantity-arithmetic.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
  * Arithmetic helpers for Quantity expressions.
  *
  * Extracted from arithmetic.ts to keep that file focused on scalar

package/dist/types/compute-engine/library/random-expression.d.ts

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare function randomExpression(level?: number): MathJsonExpression;

package/dist/types/compute-engine/library/relational-operator.d.ts

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const RELOP_LIBRARY: SymbolDefinitions;

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

@@ -1,2 +1,28 @@
-/* 0.58.0 */
+/* 0.59.0 */
+import type { Expression, SymbolDefinitions } from '../global-types';
+/**
+ * Three-valued type membership test used by the `contains` handlers of the
+ * mathematical number sets.
+ *
+ * - `true`: `x` is definitely of type `t` (its type is a subtype of `t`).
+ * - `false`: `x` is definitely *not* of type `t` — either its type is disjoint
+ *   from `t`, or it is a concrete number literal whose exact value (reflected
+ *   in its narrow type) does not match.
+ * - `undefined`: membership is indeterminate — e.g. `x` is a symbol of unknown
+ *   or broader type that could, but need not, be of type `t`.
+ *
+ * Returning `undefined` (rather than a spurious `false`) is what allows
+ * `Element(x, Integers)` and similar to stay unevaluated for symbols of
+ * indeterminate type, instead of collapsing to `False`.
+ *
+ * The `false` refutation relies on the type lattice computing a correct
+ * *meet* for intersections: overlapping numeric primitives intersect to
+ * their greatest lower bound (e.g. `integer ∩ finite_real` =
+ * `finite_integer`), so `'nothing'` genuinely means "disjoint types"
+ * (REVIEW.md G15; see `meetPrimitiveTypes` in `common/type/subtype.ts`).
+ * This is what makes the precise per-set types used by the `contains`
+ * handlers below (e.g. `finite_complex`, `imaginary`) sound: a symbol
+ * declared `finite_real` is *not* refuted as an integer.
+ */
+export declare function typeMembership(x: Expression, t: Type): boolean | undefined;
 export declare const SETS_LIBRARY: SymbolDefinitions;

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

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const STATISTICS_LIBRARY: SymbolDefinitions[];

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

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const TRIGONOMETRY_LIBRARY: SymbolDefinitions[];

package/dist/types/compute-engine/library/type-handlers.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import type { Type } from '../../common/type/types';
 /** Real inputs → finite_real, otherwise → finite_number. */
 export declare function numericTypeHandler(ops: ReadonlyArray<Expression>): Type;

package/dist/types/compute-engine/library/unit-data.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
  * Re-export the unit registry from its canonical location in numerics/.
  *
  * The unit registry lives in numerics/ so that lower layers (like

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import { type UnitExpression } from './unit-data';
 /**
  * Convert a boxed expression representing a unit into a plain

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 /**
  * EL-4: Convert known infinite integer sets to their equivalent Limits bounds.
  * Returns undefined if the set cannot be converted to a Limits form.

package/dist/types/compute-engine/numeric-value/big-numeric-value.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import type { SmallInteger } from '../numerics/types';
 import { NumericValue, NumericValueData } from './types';
 import { ExactNumericValue } from './exact-numeric-value';

package/dist/types/compute-engine/numeric-value/exact-numeric-value.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import { Rational, SmallInteger } from '../numerics/types';
 import { ExactNumericValueData, NumericValue, NumericValueFactory } from './types';
 import { MathJsonExpression } from '../../math-json/types';
@@ -62,6 +62,12 @@ export declare class ExactNumericValue extends NumericValue {
     abs(): NumericValue;
     ln(base?: number): NumericValue;
     exp(): NumericValue;
+    /**
+     * Floor/ceil/round of a pure rational (`radical === 1`) computed exactly with
+     * bigints. Routing through `this.re` (a float) would lose digits for
+     * integers/rationals larger than 2^53.
+     */
+    private _integerPart;
     floor(): NumericValue;
     ceil(): NumericValue;
     round(): NumericValue;

package/dist/types/compute-engine/numeric-value/machine-numeric-value.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 import type { SmallInteger } from '../numerics/types';
 import { NumericValue, NumericValueData } from './types';
 import type { MathJsonExpression } from '../../math-json/types';

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
  *
  * ## THEORY OF OPERATIONS
  *

package/dist/types/compute-engine/numerics/bernoulli.d.ts

@@ -0,0 +1,39 @@
+/* 0.59.0 */
+ * Exact Bernoulli numbers and exact values of the Riemann zeta function at
+ * integers, computed with bigint rationals.
+ *
+ * Used by the exact (non-numericApproximation) evaluation path of `Zeta`
+ * in `library/arithmetic.ts`:
+ *
+ * - ζ(2k)  = (−1)^{k+1} · B₂ₖ · (2π)^{2k} / (2·(2k)!)  →  rational · π^{2k}
+ * - ζ(−n)  = −Bₙ₊₁/(n+1)                               →  exact rational
+ *
+ * (The numeric approximation path uses the BigDecimal Bernoulli rationals in
+ * `numerics/special-functions.ts`; this module is self-contained so that the
+ * exact path has no dependency on the BigDecimal machinery.)
+ */
+/**
+ * Bernoulli number Bₙ (B₁ = −1/2 convention) as a reduced bigint rational
+ * `[numerator, denominator]`.
+ *
+ * Uses the defining recurrence Bₘ = −1/(m+1) · Σ_{k=0}^{m−1} C(m+1, k)·Bₖ
+ * with exact bigint rational arithmetic. Suitable for moderate n (the Zeta
+ * exact path caps |argument| at 100, i.e. at most B₁₀₁).
+ */
+export declare function bernoulliRational(n: number): [bigint, bigint];
+/**
+ * The exact rational c such that ζ(2k) = c·π^{2k}, for integer k ≥ 1.
+ *
+ * From ζ(2k) = (−1)^{k+1}·B₂ₖ·(2π)^{2k} / (2·(2k)!) and the sign alternation
+ * of B₂ₖ, the coefficient is |B₂ₖ|·2^{2k−1}/(2k)! (always positive).
+ *
+ * ζ(2) = π²/6, ζ(4) = π⁴/90, ζ(6) = π⁶/945, ζ(8) = π⁸/9450, …
+ */
+export declare function zetaEvenCoefficient(k: number): [bigint, bigint];
+/**
+ * ζ(−n) for integer n ≥ 1 as an exact reduced rational: ζ(−n) = −Bₙ₊₁/(n+1).
+ *
+ * ζ(−1) = −1/12, ζ(−3) = 1/120, and ζ(−2k) = 0 (the trivial zeros, since
+ * the odd Bernoulli numbers B₃, B₅, … vanish).
+ */
+export declare function zetaNegativeInteger(n: number): [bigint, bigint];

package/dist/types/compute-engine/numerics/bigint.d.ts

@@ -1,2 +1,2 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare function bigint(a: BigDecimal | number | bigint | string): bigint | null;

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare function bigintValue(expr: MathJsonExpression | null | undefined): bigint | null;
 /** Output a shorthand if possible */
 export declare function numberToExpression(num: number | bigint, fractionalDigits?: string | number): MathJsonExpression;

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 /** An interval is a continuous set of real numbers */
 export type Interval = {
     start: number;

package/dist/types/compute-engine/numerics/linear-algebra.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
  *  Test: determinant([[1,3,7],[2,-1,4],[5,0,2]]) === 81
  */
 export declare function determinant(matrix: number[][]): number;

package/dist/types/compute-engine/numerics/monte-carlo.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
     estimate: number;
     error: number;
 };

package/dist/types/compute-engine/numerics/numeric-bigint.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare function lcm(a: bigint, b: bigint): bigint;
 /** Return `[factor, root]` such that
  * pow(n, 1/exponent) = factor * pow(root, 1/exponent)

package/dist/types/compute-engine/numerics/numeric-bignum.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare function gcd(a: BigNum, b: BigNum): BigNum;
 export declare function lcm(a: BigNum, b: BigNum): BigNum;
 export declare function factorial2(n: BigNum): Generator<BigNum, BigNum>;

package/dist/types/compute-engine/numerics/numeric-complex.d.ts

@@ -1,3 +1,14 @@
-/* 0.58.0 */
+/* 0.59.0 */
+/**
+ * Gamma function for a complex argument, via the Lanczos approximation.
+ *
+ * Uses the reflection formula Γ(z)·Γ(1−z) = π / sin(πz) for Re(z) < 0.5 so the
+ * series converges on the whole complex plane (except at the non-positive
+ * integer poles, where the result is a (signed) infinity / NaN).
+ */
 export declare function gamma(c: Complex): Complex;
+/**
+ * Natural logarithm of the Gamma function for a complex argument (principal
+ * branch), via the Lanczos approximation.
+ */
 export declare function gammaln(c: Complex): Complex;

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

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare const MACHINE_PRECISION_BITS = 53;
 export declare const MACHINE_PRECISION: number;
 export declare const DEFAULT_TOLERANCE = 1e-10;

package/dist/types/compute-engine/numerics/primes.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare function primeFactors(n: number): {
     [factor: number]: number;
 };

package/dist/types/compute-engine/numerics/random.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
  * Shared deterministic-PRNG helpers for Random/Shuffle/Sample.
  *
  * The hash matches the GLSL/WGSL formula used by the GPU compile target:

package/dist/types/compute-engine/numerics/rationals.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 export declare function isRational(x: unknown | null): x is Rational;
 export declare function isMachineRational(x: unknown | null): x is [SmallInteger, SmallInteger];
 export declare function isBigRational(x: unknown | null): x is [bigint, bigint];

package/dist/types/compute-engine/numerics/richardson.d.ts

@@ -1,4 +1,4 @@
-/* 0.58.0 */
+/* 0.59.0 */
 
     Translated from https://github.com/JuliaMath/Richardson.jl/blob/master/src/Richardson.jl