@danielsimonjr/mathts-functions 0.41.0 → 0.43.0

package/dist/numeric/bspline.d.ts

@@ -0,0 +1,47 @@
+type f64 = number;
+type i32 = number;
+/** Options for {@link bsplineFit}. */
+export interface BSplineFitOptions {
+    /** Spline degree (default 3, cubic). */
+    k?: i32;
+    /** Smoothing factor. `0` (default) fits an interpolating spline that
+     * passes through every data point exactly. `s > 0` requests a
+     * least-squares smoothing spline with fewer basis functions than data
+     * points — the number of interior knots shrinks roughly in proportion to
+     * `s`. Use `nknots` to control the knot count directly instead. */
+    s?: f64;
+    /** Explicit number of interior knots for a smoothing fit (used whenever
+     * `s > 0`, or set this directly with `s` left at 0). Overrides the
+     * `s`-derived heuristic. */
+    nknots?: i32;
+}
+/** A fitted B-spline in scipy's `tck` tuple shape: knot vector `t`,
+ * coefficients `c`, and degree `k`. */
+export interface BSplineTuple {
+    t: f64[];
+    c: f64[];
+    k: i32;
+}
+/**
+ * Fit a B-spline of degree `k` (default cubic) to data `(x, y)`, returned
+ * in scipy's `tck` tuple shape `{ t, c, k }`.
+ *
+ * @example
+ * const xs = Array.from({ length: 15 }, (_, i) => (i * 2 * Math.PI) / 14);
+ * const ys = xs.map(Math.sin);
+ * const tck = bsplineFit(xs, ys); // cubic interpolating spline (s=0)
+ * bsplineEval(tck, xs[3]); // === ys[3] exactly (interpolation)
+ */
+export declare function bsplineFit(x: readonly f64[], y: readonly f64[], opts?: BSplineFitOptions): BSplineTuple;
+/**
+ * Evaluate a fitted B-spline (de Boor's algorithm) at one point or an array
+ * of points.
+ *
+ * @example
+ * bsplineEval(bsplineFit(xs, ys), 1.0); // spline value at x=1
+ * bsplineEval(bsplineFit(xs, ys), [1, 2, 3]); // vectorized
+ */
+export declare function bsplineEval(spline: BSplineTuple, xnew: f64): f64;
+export declare function bsplineEval(spline: BSplineTuple, xnew: readonly f64[]): f64[];
+export {};
+//# sourceMappingURL=bspline.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bspline.d.ts","sourceRoot":"","sources":["../../src/numeric/bspline.ts"],"names":[],"mappings":"AAgCA,KAAK,GAAG,GAAG,MAAM,CAAC;AAClB,KAAK,GAAG,GAAG,MAAM,CAAC;AAElB,sCAAsC;AACtC,MAAM,WAAW,iBAAiB;IAChC,wCAAwC;IACxC,CAAC,CAAC,EAAE,GAAG,CAAC;IACR;;;;uEAImE;IACnE,CAAC,CAAC,EAAE,GAAG,CAAC;IACR;;gCAE4B;IAC5B,MAAM,CAAC,EAAE,GAAG,CAAC;CACd;AAED;uCACuC;AACvC,MAAM,WAAW,YAAY;IAC3B,CAAC,EAAE,GAAG,EAAE,CAAC;IACT,CAAC,EAAE,GAAG,EAAE,CAAC;IACT,CAAC,EAAE,GAAG,CAAC;CACR;AAmED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CACxB,CAAC,EAAE,SAAS,GAAG,EAAE,EACjB,CAAC,EAAE,SAAS,GAAG,EAAE,EACjB,IAAI,GAAE,iBAAsB,GAC3B,YAAY,CAgDd;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC;AAClE,wBAAgB,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC"}

package/dist/numeric/monte-carlo.d.ts

@@ -0,0 +1,40 @@
+type f64 = number;
+type i32 = number;
+/** An axis-aligned integration bound `[lo, hi]`. */
+export type Bound = readonly [f64, f64];
+/** Options for {@link monteCarloIntegrate}. */
+export interface MonteCarloOptions {
+    /** Number of sample points (default 1e5). */
+    n?: i32;
+    /** Sampling method (default `'uniform'`). */
+    method?: 'uniform' | 'halton' | 'sobol';
+    /** Seed for the deterministic RNG, `method: 'uniform'` only (reproducible
+     * draws). Omit for a time-seeded, non-reproducible generator. */
+    seed?: string | number;
+}
+/** Result of {@link monteCarloIntegrate}. */
+export interface MonteCarloResult {
+    /** The estimated integral. */
+    estimate: f64;
+    /** Standard error of `estimate` (uniform MC only; 0 for QMC methods —
+     * see the module doc). */
+    stderr: f64;
+}
+/**
+ * Estimate `∫ f` over the axis-aligned box `bounds` (one `[lo, hi]` pair
+ * per dimension) by Monte-Carlo or quasi-Monte-Carlo sampling.
+ *
+ * @example
+ * monteCarloIntegrate((x) => x[0] ** 2, [[0, 1]], { n: 1e5, seed: 42 });
+ * // estimate ~ 1/3, stderr ~ 6e-4
+ *
+ * @example
+ * // unit-disk area via the indicator function, ~ pi
+ * monteCarloIntegrate((x) => (x[0] ** 2 + x[1] ** 2 <= 1 ? 1 : 0), [
+ *   [-1, 1],
+ *   [-1, 1],
+ * ]);
+ */
+export declare function monteCarloIntegrate(f: (x: f64[]) => f64, bounds: readonly Bound[], opts?: MonteCarloOptions): MonteCarloResult;
+export {};
+//# sourceMappingURL=monte-carlo.d.ts.map

package/dist/numeric/monte-carlo.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"monte-carlo.d.ts","sourceRoot":"","sources":["../../src/numeric/monte-carlo.ts"],"names":[],"mappings":"AAqCA,KAAK,GAAG,GAAG,MAAM,CAAC;AAClB,KAAK,GAAG,GAAG,MAAM,CAAC;AAElB,oDAAoD;AACpD,MAAM,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAExC,+CAA+C;AAC/C,MAAM,WAAW,iBAAiB;IAChC,6CAA6C;IAC7C,CAAC,CAAC,EAAE,GAAG,CAAC;IACR,6CAA6C;IAC7C,MAAM,CAAC,EAAE,SAAS,GAAG,QAAQ,GAAG,OAAO,CAAC;IACxC;qEACiE;IACjE,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;CACxB;AAED,6CAA6C;AAC7C,MAAM,WAAW,gBAAgB;IAC/B,8BAA8B;IAC9B,QAAQ,EAAE,GAAG,CAAC;IACd;8BAC0B;IAC1B,MAAM,EAAE,GAAG,CAAC;CACb;AA2GD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,GAAG,EACpB,MAAM,EAAE,SAAS,KAAK,EAAE,EACxB,IAAI,GAAE,iBAAsB,GAC3B,gBAAgB,CA0ClB"}

package/dist/special/niche.d.ts

@@ -0,0 +1,139 @@
+/**
+ * Niche special functions: polylogarithm, Struve H/L, Kelvin ber/bei (order
+ * 0), and the Barnes G-function.
+ *
+ * These are lower-traffic special functions with narrower validity domains
+ * than the Bessel/Airy/elliptic families in `typed/special.ts`. They follow
+ * the same plain-exported-function pattern as `hypergeometric.ts` and
+ * `polygamma-orthopoly.ts` — pure `number -> number` (or `number, number ->
+ * number`) math, no typed-function array/WASM dispatch overloads.
+ *
+ * @packageDocumentation
+ */
+/** 64-bit float (default for decimals) */
+type f64 = number;
+/**
+ * Polylogarithm Li_s(z), computed via its defining series (DLMF 25.12.10):
+ *
+ *   Li_s(z) = sum_{k=1}^inf z^k / k^s
+ *
+ * which converges for `|z| < 1` (any real `s`). Analytic continuation to
+ * `|z| >= 1` (needed for e.g. the dilogarithm's reflection formulas) is
+ * **out of scope** — this throws rather than silently returning a wrong or
+ * divergent value.
+ *
+ * Special value: `Li_1(z) = -ln(1 - z)`.
+ *
+ * @param s - Order (any real number)
+ * @param z - Argument, must satisfy `|z| < 1`
+ * @returns Li_s(z)
+ * @throws {Error} If `|z| >= 1`
+ *
+ * @example
+ * polylog(2, 0.5) // ~0.5822405265 (dilogarithm)
+ * polylog(1, 0.5) // ~0.6931471806 (= -ln(0.5) = ln 2)
+ */
+export declare function polylog(s: f64, z: f64): f64;
+/**
+ * Struve function H_v(z), via its power series (DLMF 11.2.1):
+ *
+ *   H_v(z) = sum_{k=0}^inf (-1)^k / (Gamma(k+3/2) Gamma(k+v+3/2)) * (z/2)^(2k+v+1)
+ *
+ * Evaluated by the standard term-recurrence ratio
+ * `term_{k+1}/term_k = -(z/2)^2 / ((k+3/2)(k+v+3/2))`, seeded by a single
+ * pair of `lgamma` evaluations (avoids recomputing Gamma at every order and
+ * avoids overflow from large individual Gamma values).
+ *
+ * Valid for `z >= 0` and `v > -3/2` (so that `Gamma(v+3/2)` has no pole).
+ *
+ * @param v - Order (real, `v > -3/2`)
+ * @param z - Argument (real, `z >= 0`)
+ * @returns H_v(z)
+ *
+ * @example
+ * struveH(0, 1) // ~0.5686566270
+ * struveH(1, 2) // ~0.6467637283
+ */
+export declare function struveH(v: f64, z: f64): f64;
+/**
+ * Modified Struve function L_v(z), via its power series (DLMF 11.2.1):
+ *
+ *   L_v(z) = sum_{k=0}^inf 1 / (Gamma(k+3/2) Gamma(k+v+3/2)) * (z/2)^(2k+v+1)
+ *
+ * Same as `struveH` but without the alternating `(-1)^k` sign, so every term
+ * is positive and the series grows monotonically for `z > 0` (like a
+ * modified Bessel function).
+ *
+ * Valid for `z >= 0` and `v > -3/2`.
+ *
+ * @param v - Order (real, `v > -3/2`)
+ * @param z - Argument (real, `z >= 0`)
+ * @returns L_v(z)
+ *
+ * @example
+ * struveL(0, 1) // ~0.7102431859
+ */
+export declare function struveL(v: f64, z: f64): f64;
+/**
+ * Kelvin function ber(x) (order 0), via its power series (DLMF 10.65.1):
+ *
+ *   ber(x) = sum_{k=0}^inf (-1)^k (x/2)^(4k) / ((2k)!)^2
+ *
+ * Evaluated by the term-recurrence ratio
+ * `term_{k+1}/term_k = -(x/2)^4 / ((2k+1)(2k+2))^2`.
+ *
+ * @param x - Argument (real)
+ * @returns ber(x)
+ *
+ * @example
+ * kelvinBer(0) // 1
+ * kelvinBer(2) // ~0.7517341827
+ */
+export declare function kelvinBer(x: f64): f64;
+/**
+ * Kelvin function bei(x) (order 0), via its power series (DLMF 10.65.1):
+ *
+ *   bei(x) = sum_{k=0}^inf (-1)^k (x/2)^(4k+2) / ((2k+1)!)^2
+ *
+ * Evaluated by the term-recurrence ratio
+ * `term_{k+1}/term_k = -(x/2)^4 / ((2k+2)(2k+3))^2`.
+ *
+ * @param x - Argument (real)
+ * @returns bei(x)
+ *
+ * @example
+ * kelvinBei(0) // 0
+ * kelvinBei(2) // ~0.9722916273
+ */
+export declare function kelvinBei(x: f64): f64;
+/**
+ * Barnes G-function G(z), for real `z > 0`.
+ *
+ * Uses the functional equation `G(z+1) = Gamma(z) * G(z)` to shift `z` up
+ * until it is large enough for the asymptotic expansion of `ln G` (DLMF
+ * 5.17.5) to converge to machine precision, then unwinds the shift:
+ *
+ *   ln G(z) = ln G(z + n) - sum_{k=0}^{n-1} lgamma(z + k)
+ *
+ * Verified against `mpmath.barnesg` (dps=25) to relative error ~1e-14 across
+ * the anchored integer/half-integer test values. Not extended to `z <= 0`
+ * (Barnes G has zeros/sign changes on the non-positive real axis that this
+ * shift-and-asymptotic approach does not handle) — that domain is out of
+ * scope.
+ *
+ * Known integer values: `G(1) = G(2) = 1`, and in general
+ * `G(n+3) = prod_{k=1}^{n} k!` for nonnegative integers `n`
+ * (e.g. `G(4) = 2`, `G(5) = 12`, `G(6) = 288`).
+ *
+ * @param z - Argument (real, `z > 0`)
+ * @returns G(z)
+ * @throws {Error} If `z <= 0`
+ *
+ * @example
+ * barnesG(4) // 2 (= 1!)
+ * barnesG(5) // 12 (= 1! * 2!)
+ * barnesG(4.5) // ~4.1862532590
+ */
+export declare function barnesG(z: f64): f64;
+export {};
+//# sourceMappingURL=niche.d.ts.map

package/dist/special/niche.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"niche.d.ts","sourceRoot":"","sources":["../../src/special/niche.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;GAWG;AAIH,0CAA0C;AAC1C,KAAK,GAAG,GAAG,MAAM,CAAC;AAYlB;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAe3C;AAMD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAiB3C;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAiB3C;AAMD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAYrC;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAYrC;AAsCD;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAcnC"}

package/dist/typed/arithmetic.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"arithmetic.d.ts","sourceRoot":"","sources":["../../src/typed/arithmetic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAeH,OAAO,EAAe,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAU1E,4BAA4B;AAC5B,KAAK,GAAG,GAAG,MAAM,CAAC;AAkIlB;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,GAAG,wCAgEd,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,QAAQ,wCAiCnB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,QAAQ,wCA8FnB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,MAAM,wCAkCjB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,UAAU,wCAYrB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,SAAS,wCAOpB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAgBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAqBf,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,wCA2Cd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAgBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,MAAM,wCAajB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAkBf,CAAC;AAaH;;GAEG;AACH,eAAO,MAAM,IAAI,wCA4Bf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,OAAO,wCAIlB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAad,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAcd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,wCAiBhB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAiBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,wCAehB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,wCAehB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,KAAK,wCAoBhB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,wCAgBhB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAgBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAgBd,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAKd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCA+Bd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAgBd,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,IAAI,wCA6Bf,CAAC;AAwEH,eAAO,MAAM,IAAI,wCAmCf,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAiBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAef,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAiBf,CAAC;AAMH;;GAEG;AAIH,eAAO,MAAM,KAAK,wCAQhB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,OAAO,wCAMlB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,MAAM,wCAMjB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,SAAS,wCAMpB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,QAAQ,wCAMnB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,OAAO,wCAMlB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAmBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAkBd,CAAC;AAMH;;GAEG;AACH;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,IAAI,wCAGf,CAAC;AAEH,eAAO,MAAM,GAAG,wCAuBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAWf,CAAC;AAEH;;;;;GAKG;AACH,MAAM,MAAM,gBAAgB,GAAG,UAAU,GAAG,aAAa,GAAG,QAAQ,CAAC;AAwBrE;;;;;;GAMG;AACH,eAAO,MAAM,QAAQ,wCAenB,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,GAAG,wCAiBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAad,CAAC;AAMH;;;;;;;GAOG;AACH,wBAAsB,MAAM,CAC1B,CAAC,EAAE,YAAY,EACf,KAAK,EAAE,GAAG,EACV,KAAK,EAAE,GAAG,EACV,CAAC,EAAE,YAAY,EACf,KAAK,EAAE,GAAG,GACT,OAAO,CAAC,YAAY,CAAC,CAGvB;AAED;;GAEG;AACH,wBAAsB,SAAS,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO,CAAC,YAAY,CAAC,CAG/F;AAED;;GAEG;AACH,wBAAsB,MAAM,CAC1B,MAAM,EAAE,YAAY,EACpB,IAAI,EAAE,GAAG,EACT,IAAI,EAAE,GAAG,EACT,MAAM,EAAE,YAAY,GACnB,OAAO,CAAC,YAAY,CAAC,CAGvB;AAED;;GAEG;AACH,wBAAsB,KAAK,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC,CAGnF;AAMD;;GAEG;AACH,wBAAsB,cAAc,IAAI,OAAO,CAAC,IAAI,CAAC,CAEpD;AAED;;GAEG;AACH,wBAAsB,aAAa,IAAI,OAAO,CAAC,IAAI,CAAC,CAEnD;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,YAAY,EAAE,GAAG,GAAG,OAAO,CAE5D;AAED;;GAEG;AACH,wBAAgB,cAAc,IAAI,WAAW,CAE5C;AAMD,eAAO,MAAM,eAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA+E3B,CAAC"}
+{"version":3,"file":"arithmetic.d.ts","sourceRoot":"","sources":["../../src/typed/arithmetic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AA0BH,OAAO,EAAe,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAU1E,4BAA4B;AAC5B,KAAK,GAAG,GAAG,MAAM,CAAC;AAkIlB;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,GAAG,wCAgEd,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,QAAQ,wCAiCnB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,QAAQ,wCA8FnB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,MAAM,wCAkCjB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,UAAU,wCAYrB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,SAAS,wCAOpB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAgBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAqBf,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAmDd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAgBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,MAAM,wCAajB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAkBf,CAAC;AAaH;;GAEG;AACH,eAAO,MAAM,IAAI,wCA4Bf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,OAAO,wCAIlB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAad,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAcd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,wCAiBhB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAiBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,wCAehB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,wCAehB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,KAAK,wCAuBhB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,wCAgBhB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAgBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAkBd,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAKd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCA+Bd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAgBd,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,IAAI,wCA6Bf,CAAC;AAwEH,eAAO,MAAM,IAAI,wCAmCf,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAiBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAef,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAiBf,CAAC;AAMH;;GAEG;AAIH,eAAO,MAAM,KAAK,wCAchB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,OAAO,wCAMlB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,MAAM,wCAMjB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,SAAS,wCAMpB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,QAAQ,wCAMnB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,OAAO,wCAMlB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAmBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAkBd,CAAC;AAMH;;GAEG;AACH;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,IAAI,wCAGf,CAAC;AAEH,eAAO,MAAM,GAAG,wCAuBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,wCAWf,CAAC;AAEH;;;;;GAKG;AACH,MAAM,MAAM,gBAAgB,GAAG,UAAU,GAAG,aAAa,GAAG,QAAQ,CAAC;AAwBrE;;;;;;GAMG;AACH,eAAO,MAAM,QAAQ,wCAenB,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,GAAG,wCAiBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,wCAad,CAAC;AAMH;;;;;;;GAOG;AACH,wBAAsB,MAAM,CAC1B,CAAC,EAAE,YAAY,EACf,KAAK,EAAE,GAAG,EACV,KAAK,EAAE,GAAG,EACV,CAAC,EAAE,YAAY,EACf,KAAK,EAAE,GAAG,GACT,OAAO,CAAC,YAAY,CAAC,CAGvB;AAED;;GAEG;AACH,wBAAsB,SAAS,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO,CAAC,YAAY,CAAC,CAG/F;AAED;;GAEG;AACH,wBAAsB,MAAM,CAC1B,MAAM,EAAE,YAAY,EACpB,IAAI,EAAE,GAAG,EACT,IAAI,EAAE,GAAG,EACT,MAAM,EAAE,YAAY,GACnB,OAAO,CAAC,YAAY,CAAC,CAGvB;AAED;;GAEG;AACH,wBAAsB,KAAK,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC,CAGnF;AAMD;;GAEG;AACH,wBAAsB,cAAc,IAAI,OAAO,CAAC,IAAI,CAAC,CAEpD;AAED;;GAEG;AACH,wBAAsB,aAAa,IAAI,OAAO,CAAC,IAAI,CAAC,CAEnD;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,YAAY,EAAE,GAAG,GAAG,OAAO,CAE5D;AAED;;GAEG;AACH,wBAAgB,cAAc,IAAI,WAAW,CAE5C;AAMD,eAAO,MAAM,eAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA+E3B,CAAC"}

package/dist/typed/bitwise.d.ts

@@ -8,7 +8,7 @@
  * - Use the `ComputePool` for ALL `Int32Array` transformations.
  * - Use native ops on scalar inputs (no worker dispatch overhead).
  *
- * BigNumber bitwise semantics: the mathjs-synced helpers in
+ * BigNumber bitwise semantics: the mathjs-derived helpers in
  * `functions/src/utils/bignumber/bitwise.ts` operate on the
  * `decimal.js`-internal coefficient layout (`x.d` / `x.e` / `x.s`),
  * which `@danielsimonjr/mathts-core`'s `BigNumber` does not expose.

package/dist/typed/probability.d.ts

@@ -1,13 +1,13 @@
 /**
  * Typed Probability & Combinatorics Functions
  *
- * Promotes genuinely-missing exports from the synced `probability/` layer that
+ * Promotes genuinely-missing exports from the activated `probability/` layer that
  * are not already surfaced by `typed/distributions.ts` (PDF/PMF/CDF/entropy) or
  * `typed/special.ts` (erf, beta, bessel, …).
  *
  * After dedup audit (2026-05-24):
  *
- * | Synced name        | Promote? | Existing surface (if any)                      | Rationale                                        |
+ * | mathjs name        | Promote? | Existing surface (if any)                      | Rationale                                        |
  * | ------------------ | -------- | ---------------------------------------------- | ------------------------------------------------ |
  * | bernoulli          | YES      | —                                              | genuinely missing (bernoulliPMF ≠ Bernoulli number) |
  * | combinations       | YES      | —                                              | genuinely missing                                |

package/dist/typed/relational.d.ts

@@ -4,9 +4,9 @@
  * Polymorphic relational operations using typed-function for runtime dispatch.
  * Supports number, BigNumber, Fraction, Complex, bigint, boolean, string, and Array types.
  *
- * These are clean implementations using mathTyped dispatch — the dormant synced
- * layer under functions/src/relational/ is left untouched and used only as an
- * algorithm reference.
+ * These are clean implementations using mathTyped dispatch — the activated
+ * mathjs-derived layer under functions/src/relational/ is left untouched here
+ * and used only as an algorithm reference.
  *
  * Semantics follow the mathjs convention:
  *   - nearlyEqual tolerance uses DEFAULT_CONFIG.relTol / absTol.

package/dist/typed/string.d.ts

@@ -4,9 +4,9 @@
  * Polymorphic string-formatting operations using typed-function for runtime dispatch.
  * Supports `number`, `BigNumber`, and `string` types as appropriate for each op.
  *
- * These are clean implementations using mathTyped dispatch — the dormant synced
- * layer under functions/src/string/ is left untouched and used only as an
- * algorithm reference.
+ * These are clean implementations using mathTyped dispatch — the activated
+ * mathjs-derived layer under functions/src/string/ is left untouched here
+ * and used only as an algorithm reference.
  *
  * Semantics follow the mathjs convention:
  *   - bin/hex/oct: sign-magnitude representation for negative numbers (NOT two's-complement),

package/dist/typed/typed-bridge.d.ts

@@ -1,6 +1,6 @@
 /**
  * Initialize the type bridge for mathjs factory compatibility.
- * Call once before using any synced mathjs factories.
+ * Call once before using any activated mathjs-derived factories.
  */
 export declare function initTypeBridge(): void;
 //# sourceMappingURL=typed-bridge.d.ts.map

package/dist/utils/array.d.ts

@@ -1,242 +1,25 @@
-import { Index, Matrix } from './is.js';
-export type NestedArray<T> = T | NestedArray<T>[];
-export interface IdentifiedValue<T> {
-    value: T;
-    identifier: number;
-}
 /**
- * Calculate the size of a multi dimensional array.
- * This function checks the size of the first entry, it does not validate
- * whether all dimensions match. (use function `validate` for that)
- * @param {Array} x
- * @return {number[]} size
- */
-export declare function arraySize<T>(x: NestedArray<T>): number[];
-/**
- * Validate whether each element in a multi dimensional array has
- * a size corresponding to the provided size array.
- * @param {Array} array    Array to be validated
- * @param {number[]} size  Array with the size of each dimension
- * @throws DimensionError
- */
-export declare function validate<T>(array: NestedArray<T>, size: number[]): void;
-/**
- * Validate whether the source of the index matches the size of the Array
- * @param {Array | Matrix} value    Array to be validated
- * @param {Index} index  Index with the source information to validate
- * @throws DimensionError
- */
-export declare function validateIndexSourceSize(value: unknown[] | Matrix, index: Index): void;
-/**
- * Test whether index is an integer number with index >= 0 and index < length
- * when length is provided
- * @param {number} index    Zero-based index
- * @param {number} [length] Length of the array
- */
-export declare function validateIndex(index: number | undefined, length?: number): void;
-/**
- * Test if an index has empty values
- * @param {Index} index    Zero-based index
- */
-export declare function isEmptyIndex(index: Index): boolean;
-/**
- * Resize a multi dimensional array. The resized array is returned.
- * @param {Array | number} array         Array to be resized
- * @param {number[]} size Array with the size of each dimension
- * @param {*} [defaultValue=0]  Value to be filled in new entries,
- *                              zero by default. Specify for example `null`,
- *                              to clearly see entries that are not explicitly
- *                              set.
- * @return {Array} array         The resized array
- */
-export declare function resize<T = unknown>(array: T | T[] | NestedArray<T>, size: number[], defaultValue?: T): NestedArray<T>;
-/**
- * Re-shape a multi dimensional array to fit the specified dimensions
- * @param {Array} array           Array to be reshaped
- * @param {number[]} sizes        List of sizes for each dimension
- * @returns {Array}               Array whose data has been formatted to fit the
- *                                specified dimensions
+ * Cold array utilities (size/validate/reshape/resize/squeeze/broadcast/deepMap/
+ * deepForEach/clone/...).
  *
- * @throws {DimensionError}       If the product of the new dimension sizes does
- *                                not equal that of the old ones
- */
-export declare function reshape<T = unknown>(array: NestedArray<T>, sizes: number[]): NestedArray<T>;
-/**
- * Replaces the wildcard -1 in the sizes array.
- * @param {number[]} sizes  List of sizes for each dimension. At most one wildcard.
- * @param {number} currentLength  Number of elements in the array.
- * @throws {Error}                If more than one wildcard or unable to replace it.
- * @returns {number[]}      The sizes array with wildcard replaced.
- */
-export declare function processSizesWildcard(sizes: number[], currentLength: number): number[];
-/**
- * Squeeze a multi dimensional array
- * @param {Array} array
- * @param {Array} [size]
- * @returns {Array} returns the array itself
- */
-export declare function squeeze<T>(array: NestedArray<T>, size?: number[]): T | NestedArray<T>;
-/**
- * Unsqueeze a multi dimensional array: add dimensions when missing
+ * Consolidated onto core: the implementation lives once in
+ * `@danielsimonjr/mathts-core/internal` (see `core/src/array.ts` and the
+ * `project-all-libraries-build-on-core` principle). Thin re-export so existing
+ * `../utils/array.js` imports keep working while the single source of truth lives
+ * in core. Proven equivalent to the prior local copy (and to `expression`'s copy)
+ * via a fast-check property harness before the redirect — see
+ * `functions/tests/dedup-bucketB-equivalence.test.ts`.
  *
- * Parameter `size` will be mutated to match the new, unsqueezed matrix size.
+ * This package never had `initial` (unlike `expression`'s prior copy, where it was
+ * dead code even there), so it is intentionally not re-exported here — this shim
+ * preserves exactly the original export surface.
  *
- * @param {Array} array
- * @param {number} dims       Desired number of dimensions of the array
- * @param {number} [outer]    Number of outer dimensions to be added
- * @param {Array} [size] Current size of array.
- * @returns {Array} returns the array itself
- * @private
- */
-export declare function unsqueeze<T>(array: NestedArray<T>, dims: number, outer?: number, size?: number[]): NestedArray<T>;
-/**
- * Flatten a multi dimensional array, put all elements in a one dimensional
- * array
- * @param {Array} array   A multi dimensional array
- * @param {boolean} isRectangular Optional. If the array is rectangular (not jagged)
- * @return {Array}        The flattened array (1 dimensional)
- */
-export declare function flatten<T>(array: NestedArray<T>, isRectangular?: boolean): T[];
-/**
- * A safe map
- * @param {Array} array
- * @param {function} callback
- */
-export declare function map<T, U>(array: T[], callback: (value: T, index: number, array: T[]) => U): U[];
-/**
- * A safe forEach
- * @param {Array} array
- * @param {function} callback
- */
-export declare function forEach<T>(array: T[], callback: (value: T, index: number, array: T[]) => void): void;
-/**
- * A safe filter
- * @param {Array} array
- * @param {function} callback
- */
-export declare function filter<T>(array: T[], callback: (value: T, index: number, array: T[]) => boolean): T[];
-/**
- * Filter values in an array given a regular expression
- * @param {Array} array
- * @param {RegExp} regexp
- * @return {Array} Returns the filtered array
- * @private
- */
-export declare function filterRegExp(array: string[], regexp: RegExp): string[];
-/**
- * A safe join
- * @param {Array} array
- * @param {string} separator
- */
-export declare function join<T>(array: T[], separator: string): string;
-/**
- * Assign a numeric identifier to every element of a sorted array
- * @param {Array} a  An array
- * @return {Array} An array of objects containing the original value and its identifier
- */
-export declare function identify<T>(a: T[]): IdentifiedValue<T>[];
-/**
- * Remove the numeric identifier from the elements
- * @param {array} a  An array
- * @return {array} An array of values without identifiers
- */
-export declare function generalize<T>(a: IdentifiedValue<T>[]): T[];
-/**
- * Check the datatype of a given object
- * This is a low level implementation that should only be used by
- * parent Matrix classes such as SparseMatrix or DenseMatrix
- * This method does not validate Array Matrix shape
- * @param {Array} array
- * @param {function} typeOf   Callback function to use to determine the type of a value
- * @return {string}
- */
-export declare function getArrayDataType(array: unknown[], typeOf: (value: unknown) => string): string | undefined;
-/**
- * Return the last item from an array
- * @param {Array} array
- * @returns {*}
- */
-export declare function last<T>(array: T[]): T;
-/**
- * Concatenates many arrays in the specified direction
- * @param {...Array} arrays All the arrays to concatenate
- * @param {number} concatDim The dimension on which to concatenate (zero-based)
- * @returns {Array}
- */
-export declare function concat<T>(...args: [...NestedArray<T>[], number]): NestedArray<T>[];
-/**
- * Receives two or more sizes and gets the broadcasted size for both.
- * @param  {...number[]} sizes Sizes to broadcast together
- * @returns {number[]} The broadcasted size
- */
-export declare function broadcastSizes(...sizes: number[][]): number[];
-/**
- * Checks if it's possible to broadcast a size to another size
- * @param {number[]} size The size of the array to check
- * @param {number[]} toSize The size of the array to validate if it can be broadcasted to
- */
-export declare function checkBroadcastingRules(size: number[], toSize: number[]): void;
-/**
- * Broadcasts a single array to a certain size
- * @param {Array} array Array to be broadcasted
- * @param {number[]} toSize Size to broadcast the array
- * @returns {Array} The broadcasted array
- */
-export declare function broadcastTo<T>(array: NestedArray<T>, toSize: number[]): NestedArray<T>;
-/**
- * Broadcasts arrays and returns the broadcasted arrays in an array
- * @param  {...Array | any} arrays
- * @returns {Array[]} The broadcasted arrays
- */
-export declare function broadcastArrays<T>(...arrays: NestedArray<T>[]): NestedArray<T>[];
-/**
- * Stretches a matrix up to a certain size in a certain dimension
- * @param {Array} arrayToStretch
- * @param {number[]} sizeToStretch
- * @param {number} dimToStretch
- * @returns {Array} The stretched array
- */
-export declare function stretch<T>(arrayToStretch: NestedArray<T>, sizeToStretch: number, dimToStretch: number): NestedArray<T>;
-/**
- * Retrieves a single element from an array given an index.
- *
- * @param {Array} array - The array from which to retrieve the value.
- * @param {Array<number>} index - An array of indices specifying the position of the desired element in each dimension.
- * @returns {*} - The value at the specified position in the array.
- *
- * @example
- * const arr = [[[1, 2], [3, 4]], [[5, 6], [7, 8]]];
- * const index = [1, 0, 1];
- * console.log(get(arr, index)); // 6
- */
-export declare function get<T>(array: NestedArray<T>, index: number[]): T;
-/**
- * Recursively maps over each element of nested array using a provided callback function.
- *
- * @param {Array} array - The array to be mapped.
- * @param {Function} callback - The function to execute on each element, taking three arguments:
- *   - `value` (any): The current element being processed in the array.
- *   - `index` (Array<number>): The index of the current element being processed in the array.
- *   - `array` (Array): The array `deepMap` was called upon.
- * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.
- * @returns {Array} A new array with each element being the result of the callback function.
- */
-export declare function deepMap<T, U>(array: NestedArray<T>, callback: ((value: T, index: number[], array: NestedArray<T>) => U) | ((value: T) => U), skipIndex?: boolean): NestedArray<U>;
-/**
- * Recursively iterates over each element in a multi-dimensional array and applies a callback function.
- *
- * @param {Array} array - The multi-dimensional array to iterate over.
- * @param {Function} callback - The function to execute for each element. It receives three arguments:
- *   - {any} value: The current element being processed in the array.
- *   - {Array<number>} index: The index of the current element in each dimension.
- *   - {Array} array: The original array being processed.
- * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.
- */
-export declare function deepForEach<T>(array: NestedArray<T>, callback: ((value: T, index: number[], array: NestedArray<T>) => void) | ((value: T) => void), skipIndex?: boolean): void;
-/**
- * Deep clones a multidimensional array
- * @param {Array} array
- * @returns {Array} cloned array
- */
-export declare function clone<T>(array: T[]): T[];
+ * core re-exports this file's `clone`/`get`/`deepMap`/`deepForEach` under aliased
+ * names (`cloneArray`/`getArrayElement`/`deepMapArray`/`deepForEachArray`) to avoid
+ * collisions with `object.ts`'s generic `clone`/`get` and `collection.ts`'s
+ * Matrix-aware `deepMap`/`deepForEach` in its own barrel — re-imported here under
+ * THIS file's original local names.
+ */
+export type { NestedArray, IdentifiedValue } from '@danielsimonjr/mathts-core/internal';
+export { arraySize, validate, validateIndexSourceSize, validateIndex, isEmptyIndex, resize, reshape, processSizesWildcard, squeeze, unsqueeze, flatten, map, forEach, filter, filterRegExp, join, identify, generalize, getArrayDataType, last, concat, broadcastSizes, checkBroadcastingRules, broadcastTo, broadcastArrays, stretch, getArrayElement as get, deepMapArray as deepMap, deepForEachArray as deepForEach, cloneArray as clone, } from '@danielsimonjr/mathts-core/internal';
 //# sourceMappingURL=array.d.ts.map

package/dist/utils/array.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/utils/array.ts"],"names":[],"mappings":"AACA,OAAO,EAA4C,KAAK,EAAE,MAAM,EAAkB,MAAM,SAAS,CAAC;AAOlG,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;AAGlD,MAAM,WAAW,eAAe,CAAC,CAAC;IAChC,KAAK,EAAE,CAAC,CAAC;IACT,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAUxD;AAuCD;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAWvE;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,IAAI,CASrF;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAS9E;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAqBlD;AAED;;;;;;;;;GASG;AACH,wBAAgB,MAAM,CAAC,CAAC,GAAG,OAAO,EAChC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,EAC/B,IAAI,EAAE,MAAM,EAAE,EACd,YAAY,CAAC,EAAE,CAAC,GACf,WAAW,CAAC,CAAC,CAAC,CA6BhB;AAgED;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,CAAC,GAAG,OAAO,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CA0B3F;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM,EAAE,CAwBrF;AAyCD;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAwBrF;AA2BD;;;;;;;;;;;GAWG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACzB,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EACrB,IAAI,EAAE,MAAM,EACZ,KAAK,CAAC,EAAE,MAAM,EACd,IAAI,CAAC,EAAE,MAAM,EAAE,GACd,WAAW,CAAC,CAAC,CAAC,CAoBhB;AA2BD;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,aAAa,GAAE,OAAe,GAAG,CAAC,EAAE,CAwCrF;AAED;;;;GAIG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAI/F;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,CAAC,EACvB,KAAK,EAAE,CAAC,EAAE,EACV,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,IAAI,GACtD,IAAI,CAEN;AAED;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,CAAC,EACtB,KAAK,EAAE,CAAC,EAAE,EACV,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,OAAO,GACzD,CAAC,EAAE,CAML;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAMtE;AAED;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAE7D;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,EAAE,CAqBxD;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAc1D;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,OAAO,EAAE,EAChB,MAAM,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,MAAM,GACjC,MAAM,GAAG,SAAS,CAgCpB;AAED;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAErC;AAwCD;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,CAclF;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,GAAG,KAAK,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,CAmB7D;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAW7E;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAyBtF;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,CAgBhF;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,CAAC,EACvB,cAAc,EAAE,WAAW,CAAC,CAAC,CAAC,EAC9B,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GACnB,WAAW,CAAC,CAAC,CAAC,CAEhB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,CAYhE;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAC1B,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EACrB,QAAQ,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EACvF,SAAS,GAAE,OAAe,GACzB,WAAW,CAAC,CAAC,CAAC,CA0ChB;AAED;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAC3B,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EACrB,QAAQ,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,CAAC,EAC7F,SAAS,GAAE,OAAe,GACzB,IAAI,CAsCN;AAED;;;;GAIG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAExC"}
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/utils/array.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,YAAY,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,qCAAqC,CAAC;AACxF,OAAO,EACL,SAAS,EACT,QAAQ,EACR,uBAAuB,EACvB,aAAa,EACb,YAAY,EACZ,MAAM,EACN,OAAO,EACP,oBAAoB,EACpB,OAAO,EACP,SAAS,EACT,OAAO,EACP,GAAG,EACH,OAAO,EACP,MAAM,EACN,YAAY,EACZ,IAAI,EACJ,QAAQ,EACR,UAAU,EACV,gBAAgB,EAChB,IAAI,EACJ,MAAM,EACN,cAAc,EACd,sBAAsB,EACtB,WAAW,EACX,eAAe,EACf,OAAO,EACP,eAAe,IAAI,GAAG,EACtB,YAAY,IAAI,OAAO,EACvB,gBAAgB,IAAI,WAAW,EAC/B,UAAU,IAAI,KAAK,GACpB,MAAM,qCAAqC,CAAC"}