@danielsimonjr/mathts-core 0.14.3 → 0.15.1

package/dist/number.d.ts

@@ -0,0 +1,314 @@
+/**
+ * Split value representation with sign, coefficients, and exponent
+ */
+export interface SplitValue {
+    sign: '+' | '-' | '';
+    coefficients: number[];
+    exponent: number;
+}
+/**
+ * Configuration for number type handling
+ */
+export interface NumberTypeConfig {
+    number: 'number' | 'BigNumber' | 'bigint' | 'Fraction';
+    numberFallback: 'number' | 'BigNumber';
+}
+/**
+ * Format options for number formatting
+ */
+export interface FormatOptions {
+    notation?: 'auto' | 'exponential' | 'fixed' | 'engineering' | 'bin' | 'oct' | 'hex';
+    precision?: number;
+    wordSize?: number;
+    lowerExp?: number;
+    upperExp?: number;
+}
+/**
+ * Normalized format options
+ */
+export interface NormalizedFormatOptions {
+    notation: 'auto' | 'exponential' | 'fixed' | 'engineering' | 'bin' | 'oct' | 'hex';
+    precision: number | undefined;
+    wordSize: number | undefined;
+}
+/**
+ * Check if a number is integer
+ * @param value The value to check
+ * @return true if value is an integer
+ */
+export declare function isInteger(value: number | boolean): boolean;
+/**
+ * Ensure the number type is compatible with the provided value.
+ * If not, return 'number' instead.
+ *
+ * For example:
+ *
+ *     safeNumberType('2.3', { number: 'bigint', numberFallback: 'number' })
+ *
+ * will return 'number' and not 'bigint' because trying to create a bigint with
+ * value 2.3 would throw an exception.
+ *
+ * @param numberStr The number as a string
+ * @param config    Configuration with number type preferences
+ * @returns The safe number type to use
+ */
+export declare function safeNumberType(numberStr: string, config: NumberTypeConfig): 'number' | 'BigNumber' | 'bigint' | 'Fraction';
+/**
+ * Calculate the sign of a number
+ * @param x The number
+ * @returns 1 for positive, -1 for negative, 0 for zero
+ */
+export declare const sign: (x: number) => number;
+/**
+ * Calculate the base-2 logarithm of a number
+ * @param x The number
+ * @returns The base-2 logarithm
+ */
+export declare const log2: (x: number) => number;
+/**
+ * Calculate the base-10 logarithm of a number
+ * @param x The number
+ * @returns The base-10 logarithm
+ */
+export declare const log10: (x: number) => number;
+/**
+ * Calculate the natural logarithm of a number + 1
+ * @param x The number
+ * @returns ln(x + 1)
+ */
+export declare const log1p: (x: number) => number;
+/**
+ * Calculate cubic root for a number
+ *
+ * Code from es6-shim.js:
+ *   https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577
+ *
+ * @param x The number
+ * @returns The cubic root of x
+ */
+export declare const cbrt: (x: number) => number;
+/**
+ * Calculates exponentiation minus 1
+ * @param x The exponent
+ * @return exp(x) - 1
+ */
+export declare const expm1: (x: number) => number;
+/**
+ * Convert a number to a formatted string representation.
+ *
+ * Syntax:
+ *
+ *    format(value)
+ *    format(value, options)
+ *    format(value, precision)
+ *    format(value, fn)
+ *
+ * Where:
+ *
+ *    {number} value   The value to be formatted
+ *    {Object} options An object with formatting options. Available options:
+ *                     {string} notation
+ *                         Number notation. Choose from:
+ *                         'fixed'          Always use regular number notation.
+ *                                          For example '123.40' and '14000000'
+ *                         'exponential'    Always use exponential notation.
+ *                                          For example '1.234e+2' and '1.4e+7'
+ *                         'engineering'    Always use engineering notation.
+ *                                          For example '123.4e+0' and '14.0e+6'
+ *                         'auto' (default) Regular number notation for numbers
+ *                                          having an absolute value between
+ *                                          `lowerExp` and `upperExp` bounds, and
+ *                                          uses exponential notation elsewhere.
+ *                                          Lower bound is included, upper bound
+ *                                          is excluded.
+ *                                          For example '123.4' and '1.4e7'.
+ *                         'bin', 'oct, or
+ *                         'hex'            Format the number using binary, octal,
+ *                                          or hexadecimal notation.
+ *                                          For example '0b1101' and '0x10fe'.
+ *                     {number} wordSize    The word size in bits to use for formatting
+ *                                          in binary, octal, or hexadecimal notation.
+ *                                          To be used only with 'bin', 'oct', or 'hex'
+ *                                          values for 'notation' option. When this option
+ *                                          is defined the value is formatted as a signed
+ *                                          twos complement integer of the given word size
+ *                                          and the size suffix is appended to the output.
+ *                                          For example
+ *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+ *                                          Default value is undefined.
+ *                     {number} precision   A number between 0 and 16 to round
+ *                                          the digits of the number.
+ *                                          In case of notations 'exponential',
+ *                                          'engineering', and 'auto',
+ *                                          `precision` defines the total
+ *                                          number of significant digits returned.
+ *                                          In case of notation 'fixed',
+ *                                          `precision` defines the number of
+ *                                          significant digits after the decimal
+ *                                          point.
+ *                                          `precision` is undefined by default,
+ *                                          not rounding any digits.
+ *                     {number} lowerExp    Exponent determining the lower boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `-3`.
+ *                     {number} upperExp    Exponent determining the upper boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `5`.
+ *    {Function} fn    A custom formatting function. Can be used to override the
+ *                     built-in notations. Function `fn` is called with `value` as
+ *                     parameter and must return a string. Is useful for example to
+ *                     format all values inside a matrix in a particular way.
+ *
+ * Examples:
+ *
+ *    format(6.4)                                        // '6.4'
+ *    format(1240000)                                    // '1.24e6'
+ *    format(1/3)                                        // '0.3333333333333333'
+ *    format(1/3, 3)                                     // '0.333'
+ *    format(21385, 2)                                   // '21000'
+ *    format(12.071, {notation: 'fixed'})                // '12'
+ *    format(2.3,    {notation: 'fixed', precision: 2})  // '2.30'
+ *    format(52.8,   {notation: 'exponential'})          // '5.28e+1'
+ *    format(12345678, {notation: 'engineering'})        // '12.345678e+6'
+ *
+ * @param value   The number to format
+ * @param options Optional formatting options or custom formatter function or precision
+ * @return The formatted value
+ */
+export declare function format(value: number, options?: FormatOptions | ((value: number) => string) | number): string;
+/**
+ * Normalize format options into an object:
+ *   {
+ *     notation: string,
+ *     precision: number | undefined,
+ *     wordSize: number | undefined
+ *   }
+ * @param options The input options
+ * @returns Normalized format options
+ */
+export declare function normalizeFormatOptions(options?: FormatOptions | number): NormalizedFormatOptions;
+/**
+ * Split a number into sign, coefficients, and exponent
+ * @param value The number or string to split
+ * @return Object containing sign, coefficients, and exponent
+ */
+export declare function splitNumber(value: number | string): SplitValue;
+/**
+ * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
+ * @param value     The number or string to format
+ * @param precision Optional number of significant figures to return
+ * @returns The formatted string
+ */
+export declare function toEngineering(value: number | string, precision?: number): string;
+/**
+ * Format a number with fixed notation.
+ * @param value     The number or string to format
+ * @param precision Optional number of decimals after the decimal point
+ * @returns The formatted string
+ */
+export declare function toFixed(value: number | string, precision?: number): string;
+/**
+ * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
+ * @param value     The number or string to format
+ * @param precision Number of digits in formatted output
+ * @returns The formatted string
+ */
+export declare function toExponential(value: number | string, precision?: number): string;
+/**
+ * Format a number with a certain precision
+ * @param value     The number or string to format
+ * @param precision Optional number of digits
+ * @param options   Optional formatting options (lowerExp, upperExp)
+ * @return The formatted string
+ */
+export declare function toPrecision(value: number | string, precision?: number, options?: FormatOptions): string;
+/**
+ * Round the number of digits of a number
+ * @param split     A value split with .splitNumber(value)
+ * @param precision A positive integer
+ * @return Object containing sign, coefficients, and exponent with rounded digits
+ */
+export declare function roundDigits(split: SplitValue, precision?: number): SplitValue;
+/**
+ * Count the number of significant digits of a number.
+ *
+ * For example:
+ *   2.34 returns 3
+ *   0.0034 returns 2
+ *   120.5e+30 returns 4
+ *
+ * @param value The number
+ * @return Number of significant digits
+ */
+export declare function digits(value: number): number;
+/**
+ * Compares two floating point numbers.
+ * @param a      First value to compare
+ * @param b      Second value to compare
+ * @param relTol The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.
+ * @param absTol The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.
+ * @return whether the two numbers are nearly equal
+ *
+ * @throws Error If `relTol` is less than or equal to 0.
+ * @throws Error If `absTol` is less than 0.
+ *
+ * @example
+ * nearlyEqual(1.000000001, 1.0, 1e-8);            // true
+ * nearlyEqual(1.000000002, 1.0, 0);               // false
+ * nearlyEqual(1.0, 1.009, undefined, 0.01);       // true
+ * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true
+ */
+export declare function nearlyEqual(a: number, b: number, relTol?: number, absTol?: number): boolean;
+/**
+ * Calculate the hyperbolic arccos of a number
+ * @param x The number
+ * @return The hyperbolic arccosine
+ */
+export declare const acosh: (x: number) => number;
+/**
+ * Calculate the hyperbolic arcsine of a number
+ * @param x The number
+ * @return The hyperbolic arcsine
+ */
+export declare const asinh: (x: number) => number;
+/**
+ * Calculate the hyperbolic arctangent of a number
+ * @param x The number
+ * @return The hyperbolic arctangent
+ */
+export declare const atanh: (x: number) => number;
+/**
+ * Calculate the hyperbolic cosine of a number
+ * @param x The number
+ * @returns The hyperbolic cosine
+ */
+export declare const cosh: (x: number) => number;
+/**
+ * Calculate the hyperbolic sine of a number
+ * @param x The number
+ * @returns The hyperbolic sine
+ */
+export declare const sinh: (x: number) => number;
+/**
+ * Calculate the hyperbolic tangent of a number
+ * @param x The number
+ * @returns The hyperbolic tangent
+ */
+export declare const tanh: (x: number) => number;
+/**
+ * Returns a value with the magnitude of x and the sign of y.
+ * @param x The value providing the magnitude
+ * @param y The value providing the sign
+ * @returns Value with magnitude of x and sign of y
+ */
+export declare function copysign(x: number, y: number): number;
+/**
+ * Check if x^y is 0 due to infinity
+ * @param x The base
+ * @param y The exponent
+ * @returns true if x^y is 0 due to infinity
+ */
+export declare function isPowZeroAtInfinity(x: number, y: number): boolean;
+//# sourceMappingURL=number.d.ts.map

package/dist/number.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"number.d.ts","sourceRoot":"","sources":["../src/number.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC;IACrB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,MAAM,EAAE,QAAQ,GAAG,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;IACvD,cAAc,EAAE,QAAQ,GAAG,WAAW,CAAC;CACxC;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,MAAM,GAAG,aAAa,GAAG,OAAO,GAAG,aAAa,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;IACpF,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,QAAQ,EAAE,MAAM,GAAG,aAAa,GAAG,OAAO,GAAG,aAAa,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;IACnF,SAAS,EAAE,MAAM,GAAG,SAAS,CAAC;IAC9B,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;CAC9B;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,GAAG,OAAO,CAM1D;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,cAAc,CAC5B,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,gBAAgB,GACvB,QAAQ,GAAG,WAAW,GAAG,QAAQ,GAAG,UAAU,CAUhD;AAED;;;;GAIG;AACH,eAAO,MAAM,IAAI,uBAUd,CAAC;AAEJ;;;;GAIG;AACH,eAAO,MAAM,IAAI,uBAId,CAAC;AAEJ;;;;GAIG;AACH,eAAO,MAAM,KAAK,uBAIf,CAAC;AAEJ;;;;GAIG;AACH,eAAO,MAAM,KAAK,uBAIf,CAAC;AAEJ;;;;;;;;GAQG;AACH,eAAO,MAAM,IAAI,uBAsBd,CAAC;AAEJ;;;;GAIG;AACH,eAAO,MAAM,KAAK,uBAIf,CAAC;AAuCJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmFG;AACH,wBAAgB,MAAM,CACpB,KAAK,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,aAAa,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC,GAAG,MAAM,GAC7D,MAAM,CAsDR;AAED;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,MAAM,GAAG,uBAAuB,CAiChG;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,UAAU,CAmC9D;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CA+ChF;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CA+B1E;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAqBhF;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,MAAM,GAAG,MAAM,EACtB,SAAS,CAAC,EAAE,MAAM,EAClB,OAAO,CAAC,EAAE,aAAa,GACtB,MAAM,CAoCR;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,UAAU,CAsC7E;AAeD;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAK5C;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,WAAW,CACzB,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,EACT,MAAM,GAAE,MAAa,EACrB,MAAM,GAAE,MAAU,GACjB,OAAO,CAwBT;AAED;;;;GAIG;AACH,eAAO,MAAM,KAAK,uBAIf,CAAC;AAEJ;;;;GAIG;AACH,eAAO,MAAM,KAAK,uBAIf,CAAC;AAEJ;;;;GAIG;AACH,eAAO,MAAM,KAAK,uBAIf,CAAC;AAEJ;;;;GAIG;AACH,eAAO,MAAM,IAAI,uBAId,CAAC;AAEJ;;;;GAIG;AACH,eAAO,MAAM,IAAI,uBAId,CAAC;AAEJ;;;;GAIG;AACH,eAAO,MAAM,IAAI,uBAKd,CAAC;AAEJ;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAIrD;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAEjE"}

package/dist/numeric/stable.d.ts

@@ -0,0 +1,130 @@
+/**
+ * Numerically stable reduction primitives.
+ *
+ * Floating-point addition is not associative, so *how* you accumulate decides how much error you
+ * carry. These are the algorithms the established numerical stack uses, and the reason it is
+ * trusted.
+ *
+ * Measured on this repo's own reductions before these existed — 1e6 copies of `0.1`, exact answer
+ * 100000:
+ *
+ * | accumulation                    | relative error |
+ * | ------------------------------- | -------------- |
+ * | naive `s += x`                  | **1.3e-11**    |
+ * | pairwise (this, = NumPy's algo) | **2.9e-16**    |
+ * | Neumaier compensated (`fsum`)   | **0** (exact)  |
+ *
+ * NumPy 2.3.4 reports 2.9e-16 on the same input — we are now at parity. Before this, we were
+ * ~46,000× worse than NumPy on a bog-standard `sum`, and `mean`, `std`, `var` and every statistic
+ * inherit that error.
+ *
+ * @packageDocumentation
+ */
+/**
+ * Sum with **pairwise (cascade) summation** — the algorithm behind `np.sum`.
+ *
+ * Naive accumulation lets the running total grow large while the addends stay small, so each
+ * addition rounds off a little more of the total: error grows as **O(n)·ε**. Pairwise summation
+ * adds numbers of *comparable magnitude* by recursively halving the range, so error grows as
+ * **O(log n)·ε** — for n = 10⁶ that is the difference between ~1e-11 and ~1e-16.
+ *
+ * It costs the same number of additions as the naive loop. There is no speed/accuracy trade here;
+ * the naive version is simply worse.
+ *
+ * Not exact: for that, use {@link neumaierSum}. Pairwise is the right default because it is free.
+ */
+export declare function pairwiseSum(xs: ArrayLike<number>, start?: number, end?: number): number;
+/**
+ * Sum with **Neumaier compensation** — correctly rounded for practical purposes, the equivalent
+ * of Python's `math.fsum`.
+ *
+ * Tracks the low-order bits that each addition throws away and folds them back in at the end. It
+ * recovers information that pairwise summation cannot: `[1e16, 1, -1e16]` sums to **1** here,
+ * while both naive and pairwise (and `np.sum`) give **0**, because the `1` is annihilated the
+ * moment it meets `1e16`.
+ *
+ * ~2-4× slower than {@link pairwiseSum}, so it is opt-in rather than the default. Reach for it
+ * when catastrophic cancellation is possible: near-zero results from large terms, long-running
+ * accumulators, conservation checks.
+ *
+ * (Neumaier's variant, not classic Kahan: Kahan loses the compensation when the *addend* is
+ * larger than the running sum, which is precisely the `1e16` case.)
+ */
+export declare function neumaierSum(xs: ArrayLike<number>): number;
+/**
+ * Euclidean (2-)norm that does **not** overflow or underflow — BLAS's `dnrm2` scaling.
+ *
+ * The obvious `sqrt(Σxᵢ²)` squares before it adds, so it dies well inside the representable
+ * range: `‖[1e200, 1e200, 1e200, 1e200]‖` overflows to `Infinity` (the true answer, 2e200, is
+ * perfectly representable), and `‖[1e-200] × 4‖` **flushes to 0** — a silent wrong answer, which
+ * is worse.
+ *
+ * NumPy has this bug too: `np.linalg.norm([1e200]*4)` returns `inf` with an overflow warning.
+ * LAPACK does not, and neither do we.
+ *
+ * The fix is to carry a running scale: keep the largest magnitude seen out of the sum of squares,
+ * so the accumulator only ever holds ratios in [0, 1].
+ */
+export declare function norm2(xs: ArrayLike<number>): number;
+/**
+ * Dot product `Σ aᵢ·bᵢ` with **pairwise (cascade) summation** of the products — the accuracy of
+ * {@link pairwiseSum} applied to a dot without materialising the product array.
+ *
+ * A naive `s += a[i]*b[i]` loop carries the same **O(n)·ε** error as a naive sum; measured against
+ * an exact reference on an ill-conditioned dot (large mean × small factor, n = 10⁶) it is ~18×
+ * worse than `np.dot`, which sums pairwise. This closes that gap — and, like {@link pairwiseSum},
+ * costs the same number of flops as the naive loop.
+ *
+ * The two ranges are assumed the same length; callers guard that. Reads only `[start, end)`.
+ */
+export declare function pairwiseDot(a: ArrayLike<number>, b: ArrayLike<number>, start?: number, end?: number): number;
+/**
+ * Euclidean distance `‖a − b‖₂` that does **not** overflow or underflow — {@link norm2}'s BLAS
+ * `dnrm2` scaling applied to the elementwise difference.
+ *
+ * `distance` is just a 2-norm, so the obvious `sqrt(Σ(aᵢ−bᵢ)²)` inherits norm's pathology: it
+ * squares before it adds, overflowing to `Infinity` and — the dangerous case — **flushing to a
+ * silent 0** for small differences well inside the representable range. NumPy's `linalg.norm` has
+ * the same bug; scaling on the largest *difference* seen avoids both. The scale tracks the residual
+ * `a − b`, not the inputs, so it stays accurate even when `a` and `b` are individually huge.
+ *
+ * The two ranges are assumed the same length; callers guard that.
+ */
+export declare function scaledDistance(a: ArrayLike<number>, b: ArrayLike<number>): number;
+/**
+ * Sum of squared deviations from the mean, `Σ(xᵢ − x̄)²` — the **corrected two-pass** form, the
+ * numerator of a numerically stable variance.
+ *
+ * Variance is where large means bite: the deviations `xᵢ − x̄` can be O(1) while the values sit on
+ * a huge pedestal, so any error in `x̄` rides straight into every deviation. Two things fix it:
+ *   1. compute the mean with {@link pairwiseSum}, not a naive running total; and
+ *   2. subtract the residual mean-bias term `(Σd)²/n` — `Σd` is zero in exact arithmetic but not in
+ *      floating point, and that leftover is exactly the systematic error a plain `Σd²` carries.
+ *
+ * Measured on 1e9-pedestal data: the plain naive two-pass (what shipped) lands ~1e-7 relative error;
+ * this lands ~1e-16 — better than `np.var`, which uses the uncorrected two-pass (~1e-13).
+ *
+ * The deviation vector is never materialised: both pairwise sums walk `xs` in
+ * registers, so variance/std no longer pay an extra n-long allocation.
+ *
+ * Divide the result by `n` (uncorrected), `n − 1` (unbiased/sample), or `n + 1` (biased) for the
+ * corresponding variance. Returns 0 for fewer than two elements.
+ */
+export declare function sumSquaredDeviations(xs: ArrayLike<number>): number;
+/**
+ * Cumulative sum with **Neumaier compensation** — each prefix total is written to `out[i]` carrying
+ * the low-order bits a naive running sum throws away.
+ *
+ * A cumulative sum is an inherently sequential prefix scan, so pairwise summation does not apply:
+ * you need every intermediate total, not just the final one. `np.cumsum` therefore accumulates
+ * naively and its tail drifts by **O(n)·ε** (relErr ~1.3e-11 over 10⁶ terms). Carrying a running
+ * compensation costs a few extra flops per element, no extra memory, and makes every prefix exact
+ * for practical purposes — a strict improvement over NumPy where accumulated drift matters (e.g.
+ * integrating a signal).
+ *
+ * Writes `out[i]` for `i` in `[0, xs.length)`; `out` may be a `number[]` or a `Float64Array`.
+ */
+export declare function neumaierCumsum(xs: ArrayLike<number>, out: {
+    [index: number]: number;
+}): void;
+//# sourceMappingURL=stable.d.ts.map

package/dist/numeric/stable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stable.d.ts","sourceRoot":"","sources":["../../src/numeric/stable.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAWH;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,KAAK,SAAI,EAAE,GAAG,SAAY,GAAG,MAAM,CAuCrF;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,WAAW,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAazD;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,KAAK,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAsBnD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CACzB,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,EACpB,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,EACpB,KAAK,SAAI,EACT,GAAG,SAAW,GACb,MAAM,CAoCR;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAqBjF;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,oBAAoB,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAelE;AAiFD;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE;IAAE,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,GAAG,IAAI,CAW5F"}

package/dist/object.d.ts

@@ -0,0 +1,119 @@
+import { hasOwnProperty } from './shared.js';
+/**
+ * Clone an object
+ *
+ *     clone(x)
+ *
+ * Can clone any primitive type, array, and object.
+ * If x has a function clone, this function will be invoked to clone the object.
+ *
+ * @param x
+ * @return {*} clone
+ */
+export declare function clone<T>(x: T): T;
+/**
+ * Apply map to all properties of an object
+ * @param object
+ * @param callback
+ * @return {Object} Returns a copy of the object with mapped properties
+ */
+export declare function mapObject<T, U>(object: Record<string, T>, callback: (value: T) => U): Record<string, U>;
+/**
+ * Extend object a with the properties of object b
+ * @param a
+ * @param b
+ * @return {Object} a
+ */
+export declare function extend<T extends Record<string, unknown>, U extends Record<string, unknown>>(a: T, b: U): T & U;
+/**
+ * Deep extend an object a with the properties of object b
+ * @param a
+ * @param b
+ * @returns {Object}
+ */
+export declare function deepExtend<T>(a: T, b: unknown): T;
+/**
+ * Deep test equality of all fields in two pairs of arrays or objects.
+ * Compares values and functions strictly (ie. 2 is not the same as '2').
+ * @param a
+ * @param b
+ * @returns {boolean}
+ */
+export declare function deepStrictEqual(a: unknown, b: unknown): boolean;
+/**
+ * Recursively flatten a nested object.
+ * @param nestedObject
+ * @return {Object} Returns the flattened object
+ */
+export declare function deepFlatten(nestedObject: Record<string, unknown>): Record<string, unknown>;
+/**
+ * Test whether the current JavaScript engine supports Object.defineProperty
+ * @returns {boolean} returns true if supported
+ */
+export declare function canDefineProperty(): boolean;
+/**
+ * Attach a lazy loading property to a constant.
+ * The given function `fn` is called once when the property is first requested.
+ *
+ * @param object - Object where to add the property
+ * @param prop - Property name
+ * @param valueResolver - Function returning the property value. Called
+ *                                without arguments.
+ */
+export declare function lazy<T>(object: Record<string, unknown>, prop: string, valueResolver: () => T): void;
+/**
+ * Traverse a path into an object.
+ * When a namespace is missing, it will be created
+ * @param object
+ * @param path - A dot separated string like 'name.space'
+ * @return {Object} Returns the object at the end of the path
+ */
+export declare function traverse(object: Record<string, unknown>, path: string | string[]): Record<string, unknown>;
+export { hasOwnProperty };
+/**
+ * Test whether an object is a factory. a factory has fields:
+ *
+ * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object])   (required)
+ * - name: string (optional)
+ * - path: string    A dot separated path (optional)
+ * - math: boolean   If true (false by default), the math namespace is passed
+ *                   as fifth argument of the factory function
+ *
+ * @param object
+ * @returns {boolean}
+ */
+export declare function isLegacyFactory(object: unknown): boolean;
+/**
+ * Get a nested property from an object
+ * @param object
+ * @param path
+ * @returns {Object}
+ */
+export declare function get(object: Record<string, unknown>, path: string | string[]): unknown;
+/**
+ * Set a nested property in an object
+ * Mutates the object itself
+ * If the path doesn't exist, it will be created
+ * @param object
+ * @param path
+ * @param value
+ * @returns {Object}
+ */
+export declare function set<T extends Record<string, unknown>>(object: T, path: string | string[], value: unknown): T;
+/**
+ * Create an object composed of the picked object properties
+ * @param object
+ * @param properties
+ * @param transform - Optional value to transform a value when picking it
+ * @return {Object}
+ */
+export declare function pick(object: Record<string, unknown>, properties: string[], transform?: (value: unknown, key: string) => unknown): Record<string, unknown>;
+/**
+ * Shallow version of pick, creating an object composed of the picked object properties
+ * but not for nested properties
+ * @param object
+ * @param properties
+ * @return {Object}
+ */
+export declare function pickShallow(object: Record<string, unknown>, properties: string[]): Record<string, unknown>;
+//# sourceMappingURL=object.d.ts.map

package/dist/object.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"object.d.ts","sourceRoot":"","sources":["../src/object.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAE7C;;;;;;;;;;GAUG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAwChC;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAC5B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EACzB,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GACxB,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAUnB;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACzF,CAAC,EAAE,CAAC,EACJ,CAAC,EAAE,CAAC,GACH,CAAC,GAAG,CAAC,CAQP;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,GAAG,CAAC,CA8DjD;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CA6C/D;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAM1F;AAmBD;;;GAGG;AACH,wBAAgB,iBAAiB,IAAI,OAAO,CAgB3C;AAED;;;;;;;;GAQG;AACH,wBAAgB,IAAI,CAAC,CAAC,EACpB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC/B,IAAI,EAAE,MAAM,EACZ,aAAa,EAAE,MAAM,CAAC,GACrB,IAAI,CAqBN;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CACtB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC/B,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GACtB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAkBzB;AAGD,OAAO,EAAE,cAAc,EAAE,CAAC;AAE1B;;;;;;;;;;;GAWG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO,CAExD;AAED;;;;;GAKG;AACH,wBAAgB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,CAiBrF;AAED;;;;;;;;GAQG;AACH,wBAAgB,GAAG,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACnD,MAAM,EAAE,CAAC,EACT,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,EACvB,KAAK,EAAE,OAAO,GACb,CAAC,CAyBH;AAED;;;;;;GAMG;AACH,wBAAgB,IAAI,CAClB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC/B,UAAU,EAAE,MAAM,EAAE,EACpB,SAAS,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,KAAK,OAAO,GACnD,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAYzB;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC/B,UAAU,EAAE,MAAM,EAAE,GACnB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAYzB"}

package/dist/shared.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Shared utility functions used across core utility modules.
+ * This file must have ZERO imports from other core utility files
+ * to serve as the base of the dependency graph and break circular imports.
+ */
+/**
+ * A safe hasOwnProperty
+ * @param object
+ * @param property
+ */
+export declare function hasOwnProperty(object: unknown, property: string): boolean;
+/**
+ * True when `text` ends with `search`. (Equivalent to `String.prototype.endsWith`;
+ * kept as a named helper so relocated modules read the same as their mathjs origin.)
+ */
+export declare function endsWith(text: string, search: string): boolean;
+/**
+ * Warn to the console at most once per distinct message, deduped for the process
+ * lifetime. Used for deprecation notices (e.g. `Unit.toNumber`).
+ */
+export declare const warnOnce: (...args: unknown[]) => void;
+/** A function whose results are cached; clear the cache with `delete fn.cache`. */
+export interface MemoizedFunction {
+    (...args: unknown[]): unknown;
+    cache?: Map<string, unknown>;
+}
+/**
+ * Memoize a pure function, caching results in a `Map` keyed by a string hash of the
+ * arguments (default `JSON.stringify`; override via `hasher`). Pass `limit` to bound
+ * the cache to N most-recently-used entries (LRU eviction via `Map` insertion order —
+ * on a hit the key is moved to the most-recent end; on overflow the oldest key is
+ * dropped); omit for an unbounded cache. The cache is exposed as `fn.cache` and can be
+ * reset with `delete fn.cache` — the next call lazily recreates it. (The relocated
+ * `Unit` relies on that reset when `createUnit`/`deleteUnit` invalidate the unit-name
+ * lookup cache, and passes `limit: 100` to bound the parse cache.)
+ */
+export declare function memoize(fn: (...args: unknown[]) => unknown, { hasher, limit }?: {
+    hasher?: (args: unknown[]) => string;
+    limit?: number;
+}): MemoizedFunction;
+//# sourceMappingURL=shared.d.ts.map

package/dist/shared.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared.d.ts","sourceRoot":"","sources":["../src/shared.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAEzE;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAG9D;AAED;;;GAGG;AACH,eAAO,MAAM,QAAQ,YAGe,OAAO,EAAE,KAAG,IAO5C,CAAC;AAEL,mFAAmF;AACnF,MAAM,WAAW,gBAAgB;IAC/B,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC;IAC9B,KAAK,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAC9B;AAED;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CACrB,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,EACnC,EAAE,MAAM,EAAE,KAAK,EAAE,GAAE;IAAE,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAO,GAC/E,gBAAgB,CA2BlB"}