@johnhenry/math 0.0.0

package/dist/Numerical.js

@@ -0,0 +1,343 @@
+/**
+ * Numerical — numerical-methods toolkit: root finding (bisection, secant,
+ * Newton, Brent), quadrature (composite trapezoid/Simpson, adaptive Simpson,
+ * Gauss-Legendre), ODE integration (Euler, RK4 for systems), and nonlinear
+ * curve fitting (Levenberg-Marquardt). Complements the simpler
+ * `integrateN`/`differentiateN`/`solveN` in {@link RealMath}.
+ */
+import { MatrixMath } from "./MatrixMath.js";
+// 5-point Gauss-Legendre nodes/weights on [-1, 1].
+const GL5_NODES = [0, -0.5384693101056831, 0.5384693101056831, -0.906179845938664, 0.906179845938664];
+const GL5_WEIGHTS = [
+    0.5688888888888889, 0.4786286704993665, 0.4786286704993665, 0.2369268850561891, 0.2369268850561891,
+];
+export class Numerical {
+    // -- root finding --------------------------------------------------------
+    /** Find a root of `f` in `[a, b]` by bisection (requires a sign change). */
+    static bisection(f, a, b, tolerance = 1e-12, maxIterations = 200) {
+        let lo = a;
+        let hi = b;
+        let flo = f(lo);
+        if (flo * f(hi) > 0)
+            throw new Error("bisection requires f(a) and f(b) to have opposite signs.");
+        for (let i = 0; i < maxIterations; i++) {
+            const mid = (lo + hi) / 2;
+            const fmid = f(mid);
+            if (Math.abs(fmid) < tolerance || (hi - lo) / 2 < tolerance)
+                return mid;
+            if (flo * fmid < 0)
+                hi = mid;
+            else {
+                lo = mid;
+                flo = fmid;
+            }
+        }
+        return (lo + hi) / 2;
+    }
+    /** Find a root of `f` by the secant method from two starting guesses. */
+    static secant(f, x0, x1, tolerance = 1e-12, maxIterations = 200) {
+        let a = x0;
+        let b = x1;
+        let fa = f(a);
+        let fb = f(b);
+        for (let i = 0; i < maxIterations; i++) {
+            if (Math.abs(fb) < tolerance)
+                return b;
+            const denom = fb - fa;
+            if (denom === 0)
+                break;
+            const c = b - (fb * (b - a)) / denom;
+            a = b;
+            fa = fb;
+            b = c;
+            fb = f(b);
+        }
+        return b;
+    }
+    /** Newton's method; if `df` is omitted, a numeric derivative is used. */
+    static newton(f, x0, df, tolerance = 1e-12, maxIterations = 200) {
+        let x = x0;
+        const derivative = df ?? ((t) => (f(t + 1e-7) - f(t - 1e-7)) / 2e-7);
+        for (let i = 0; i < maxIterations; i++) {
+            const fx = f(x);
+            if (Math.abs(fx) < tolerance)
+                return x;
+            const d = derivative(x);
+            if (d === 0)
+                break;
+            x -= fx / d;
+        }
+        return x;
+    }
+    /** Brent's method: robust bracketing root finder combining bisection and interpolation. */
+    static brent(f, a, b, tolerance = 1e-12, maxIterations = 200) {
+        let fa = f(a);
+        let fb = f(b);
+        if (fa * fb > 0)
+            throw new Error("brent requires f(a) and f(b) to have opposite signs.");
+        if (Math.abs(fa) < Math.abs(fb)) {
+            [a, b] = [b, a];
+            [fa, fb] = [fb, fa];
+        }
+        let c = a;
+        let fc = fa;
+        let d = b - a;
+        let mflag = true;
+        for (let i = 0; i < maxIterations; i++) {
+            if (Math.abs(fb) < tolerance || Math.abs(b - a) < tolerance)
+                return b;
+            let s;
+            if (fa !== fc && fb !== fc) {
+                s =
+                    (a * fb * fc) / ((fa - fb) * (fa - fc)) +
+                        (b * fa * fc) / ((fb - fa) * (fb - fc)) +
+                        (c * fa * fb) / ((fc - fa) * (fc - fb));
+            }
+            else {
+                s = b - (fb * (b - a)) / (fb - fa);
+            }
+            const cond = s < (3 * a + b) / 4 ||
+                s > b ||
+                (mflag && Math.abs(s - b) >= Math.abs(b - c) / 2) ||
+                (!mflag && Math.abs(s - b) >= Math.abs(c - d) / 2);
+            if (cond) {
+                s = (a + b) / 2;
+                mflag = true;
+            }
+            else {
+                mflag = false;
+            }
+            const fs = f(s);
+            d = c;
+            c = b;
+            fc = fb;
+            if (fa * fs < 0) {
+                b = s;
+                fb = fs;
+            }
+            else {
+                a = s;
+                fa = fs;
+            }
+            if (Math.abs(fa) < Math.abs(fb)) {
+                [a, b] = [b, a];
+                [fa, fb] = [fb, fa];
+            }
+        }
+        return b;
+    }
+    // -- quadrature ----------------------------------------------------------
+    /** Composite trapezoidal rule with `n` subintervals. */
+    static trapezoid(f, a, b, n = 1000) {
+        const h = (b - a) / n;
+        let sum = (f(a) + f(b)) / 2;
+        for (let i = 1; i < n; i++)
+            sum += f(a + i * h);
+        return sum * h;
+    }
+    /** Composite Simpson's rule with `n` (rounded up to even) subintervals. */
+    static simpson(f, a, b, n = 1000) {
+        const m = n % 2 === 0 ? n : n + 1;
+        const h = (b - a) / m;
+        let sum = f(a) + f(b);
+        for (let i = 1; i < m; i++)
+            sum += (i % 2 === 0 ? 2 : 4) * f(a + i * h);
+        return (sum * h) / 3;
+    }
+    /** Adaptive Simpson quadrature to a target error tolerance. */
+    static adaptiveSimpson(f, a, b, tolerance = 1e-10, maxDepth = 50) {
+        const simpson = (lo, hi, flo, fmid, fhi) => ((hi - lo) / 6) * (flo + 4 * fmid + fhi);
+        const recurse = (lo, hi, flo, fmid, fhi, whole, tol, depth) => {
+            const mid = (lo + hi) / 2;
+            const lmid = (lo + mid) / 2;
+            const rmid = (mid + hi) / 2;
+            const flmid = f(lmid);
+            const frmid = f(rmid);
+            const left = simpson(lo, mid, flo, flmid, fmid);
+            const right = simpson(mid, hi, fmid, frmid, fhi);
+            if (depth <= 0 || Math.abs(left + right - whole) <= 15 * tol)
+                return left + right + (left + right - whole) / 15;
+            return (recurse(lo, mid, flo, flmid, fmid, left, tol / 2, depth - 1) +
+                recurse(mid, hi, fmid, frmid, fhi, right, tol / 2, depth - 1));
+        };
+        const mid = (a + b) / 2;
+        const fa = f(a);
+        const fmid = f(mid);
+        const fb = f(b);
+        return recurse(a, b, fa, fmid, fb, simpson(a, b, fa, fmid, fb), tolerance, maxDepth);
+    }
+    /** 5-point Gauss-Legendre quadrature on `[a, b]`. */
+    static gaussLegendre(f, a, b) {
+        const half = (b - a) / 2;
+        const mid = (a + b) / 2;
+        let sum = 0;
+        for (let i = 0; i < GL5_NODES.length; i++)
+            sum += GL5_WEIGHTS[i] * f(mid + half * GL5_NODES[i]);
+        return sum * half;
+    }
+    // -- ODE integration -----------------------------------------------------
+    /** Explicit Euler integration of a first-order system from `t0` to `t1`. */
+    static euler(f, y0, t0, t1, h = 0.01) {
+        const steps = [{ t: t0, y: [...y0] }];
+        let t = t0;
+        let y = [...y0];
+        while (t < t1 - 1e-12) {
+            const step = Math.min(h, t1 - t);
+            const dy = f(t, y);
+            y = y.map((yi, i) => yi + step * dy[i]);
+            t += step;
+            steps.push({ t, y: [...y] });
+        }
+        return steps;
+    }
+    /** Classical fourth-order Runge-Kutta integration of a first-order system. */
+    static rk4(f, y0, t0, t1, h = 0.01) {
+        const steps = [{ t: t0, y: [...y0] }];
+        let t = t0;
+        let y = [...y0];
+        while (t < t1 - 1e-12) {
+            const step = Math.min(h, t1 - t);
+            const k1 = f(t, y);
+            const k2 = f(t + step / 2, y.map((yi, i) => yi + (step / 2) * k1[i]));
+            const k3 = f(t + step / 2, y.map((yi, i) => yi + (step / 2) * k2[i]));
+            const k4 = f(t + step, y.map((yi, i) => yi + step * k3[i]));
+            y = y.map((yi, i) => yi + (step / 6) * (k1[i] + 2 * k2[i] + 2 * k3[i] + k4[i]));
+            t += step;
+            steps.push({ t, y: [...y] });
+        }
+        return steps;
+    }
+    // -- curve fitting ---------------------------------------------------------
+    /**
+     * Nonlinear least-squares curve fitting via Levenberg-Marquardt: finds
+     * `params` minimizing `sum((model(xs[i], params) - ys[i])^2)`, starting
+     * from `params0`. The Jacobian of `model` with respect to `params` is
+     * estimated by central finite differences (generalizes `newton`'s
+     * optional-df-else-numeric-derivative convention to a vector of
+     * parameters). `lambda` is the Marquardt damping factor -- scaled against
+     * each parameter's own row of `JᵀJ` (not a plain identity, the original
+     * Levenberg damping) so differently-scaled parameters damp comparably --
+     * grown 10x on a rejected step (safer, more like gradient descent) and
+     * shrunk 10x on an accepted one (faster, more like Gauss-Newton near the
+     * optimum).
+     *
+     * `converged` is true once *either* the sum of squared residuals itself
+     * drops below `tolerance` (a near-exact fit) *or* at least one step has
+     * improved it and further steps stop improving it meaningfully (no
+     * damped step improves it at all, or the relative improvement has
+     * dropped below 1e-12) -- deliberately not "the residual itself is near
+     * zero" as the only success criterion, since real (noisy) data's true
+     * best fit essentially never drives the residual anywhere near
+     * `tolerance`, even when the fit has genuinely converged to the best
+     * achievable parameters; requiring near-zero residual would wrongly
+     * report `converged: false` for every realistic (as opposed to
+     * synthetic/noiseless) dataset.
+     *
+     * NON-GOALS: no bounds/constraints on `params`; only ever finds one local
+     * minimum near `params0`, the same "no guarantee of the global optimum"
+     * caveat as `newton`. Returns `converged: false` (with the best `params`
+     * found, not a throw) when no step ever improved on `params0` at all --
+     * a model/data pairing that can't be fit usefully isn't a numerical error
+     * the way a divergent root-find is, but is still worth flagging distinctly
+     * from "converged to some local optimum, however good or mediocre."
+     */
+    static levenbergMarquardt(model, params0, xs, ys, options = {}) {
+        const { lambda0 = 1e-2, tolerance = 1e-10, maxIterations = 200 } = options;
+        const n = params0.length;
+        const m = xs.length;
+        let params = [...params0];
+        let lambda = lambda0;
+        function residuals(p) {
+            return xs.map((x, i) => model(x, p) - ys[i]);
+        }
+        function sumSq(r) {
+            return r.reduce((s, v) => s + v * v, 0);
+        }
+        function jacobian(p) {
+            const J = Array.from({ length: m }, () => new Array(n).fill(0));
+            for (let j = 0; j < n; j++) {
+                const step = 1e-6 * (Math.abs(p[j]) + 1e-6);
+                const pPlus = [...p];
+                const pMinus = [...p];
+                pPlus[j] += step;
+                pMinus[j] -= step;
+                const rPlus = residuals(pPlus);
+                const rMinus = residuals(pMinus);
+                for (let i = 0; i < m; i++)
+                    J[i][j] = (rPlus[i] - rMinus[i]) / (2 * step);
+            }
+            return J;
+        }
+        let r = residuals(params);
+        let currentSumSq = sumSq(r);
+        let iterations = 0;
+        let everImproved = false;
+        for (; iterations < maxIterations; iterations++) {
+            if (currentSumSq < tolerance)
+                break; // a near-exact fit -- stop early regardless of real data's usual nonzero floor below
+            const J = jacobian(params);
+            const JtJ = Array.from({ length: n }, () => new Array(n).fill(0));
+            const Jtr = new Array(n).fill(0);
+            for (let a = 0; a < n; a++) {
+                for (let b = 0; b < n; b++) {
+                    let s = 0;
+                    for (let i = 0; i < m; i++)
+                        s += J[i][a] * J[i][b];
+                    JtJ[a][b] = s;
+                }
+                let s2 = 0;
+                for (let i = 0; i < m; i++)
+                    s2 += J[i][a] * r[i];
+                Jtr[a] = s2;
+            }
+            const prevSumSq = currentSumSq;
+            let accepted = false;
+            for (let tries = 0; tries < 30 && !accepted; tries++) {
+                const A = JtJ.map((row, a) => row.map((v, b) => v + (a === b ? lambda * JtJ[a][a] : 0)));
+                let delta;
+                try {
+                    delta = [
+                        ...MatrixMath.solve(A, Jtr.map((v) => -v)),
+                    ];
+                }
+                catch {
+                    lambda *= 10;
+                    continue;
+                }
+                const candidate = params.map((p, i) => p + delta[i]);
+                const rCandidate = residuals(candidate);
+                const candidateSumSq = sumSq(rCandidate);
+                if (Number.isFinite(candidateSumSq) && candidateSumSq < currentSumSq) {
+                    params = candidate;
+                    r = rCandidate;
+                    currentSumSq = candidateSumSq;
+                    lambda = Math.max(lambda / 10, 1e-12);
+                    accepted = true;
+                    everImproved = true;
+                }
+                else {
+                    lambda *= 10;
+                }
+            }
+            // Either terminating condition below is a real local minimum, not a
+            // failure: no damped step improves further (`!accepted`), or the ones
+            // that do are only shaving off numerically-insignificant amounts
+            // (`relativeImprovement` near zero) -- real (noisy) data's best fit
+            // essentially never drives `currentSumSq` itself near zero the way
+            // `tolerance` alone would require, so treating only *that* as success
+            // would wrongly call every noisy-data fit unconverged.
+            if (!accepted)
+                break;
+            const relativeImprovement = (prevSumSq - currentSumSq) / Math.max(1, prevSumSq);
+            if (relativeImprovement < 1e-12)
+                break;
+        }
+        return {
+            params,
+            residualNorm: Math.sqrt(currentSumSq),
+            iterations,
+            converged: everImproved || currentSumSq < tolerance,
+        };
+    }
+}
+//# sourceMappingURL=Numerical.js.map

package/dist/Numerical.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Numerical.js","sourceRoot":"","sources":["../src/Numerical.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAQ7C,mDAAmD;AACnD,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;AACtG,MAAM,WAAW,GAAG;IAClB,kBAAkB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,kBAAkB;CACnG,CAAC;AAeF,MAAM,OAAO,SAAS;IACpB,2EAA2E;IAE3E,4EAA4E;IAC5E,MAAM,CAAC,SAAS,CAAC,CAAK,EAAE,CAAS,EAAE,CAAS,EAAE,SAAS,GAAG,KAAK,EAAE,aAAa,GAAG,GAAG;QAClF,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QAChB,IAAI,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;QACjG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACpB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,SAAS,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;gBAAE,OAAO,GAAG,CAAC;YACxE,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC;gBAAE,EAAE,GAAG,GAAG,CAAC;iBACxB,CAAC;gBACJ,EAAE,GAAG,GAAG,CAAC;gBACT,GAAG,GAAG,IAAI,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,yEAAyE;IACzE,MAAM,CAAC,MAAM,CAAC,CAAK,EAAE,EAAU,EAAE,EAAU,EAAE,SAAS,GAAG,KAAK,EAAE,aAAa,GAAG,GAAG;QACjF,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS;gBAAE,OAAO,CAAC,CAAC;YACvC,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,CAAC;YACtB,IAAI,KAAK,KAAK,CAAC;gBAAE,MAAM;YACvB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACrC,CAAC,GAAG,CAAC,CAAC;YACN,EAAE,GAAG,EAAE,CAAC;YACR,CAAC,GAAG,CAAC,CAAC;YACN,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACZ,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,yEAAyE;IACzE,MAAM,CAAC,MAAM,CAAC,CAAK,EAAE,EAAU,EAAE,EAAO,EAAE,SAAS,GAAG,KAAK,EAAE,aAAa,GAAG,GAAG;QAC9E,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,MAAM,UAAU,GAAG,EAAE,IAAI,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS;gBAAE,OAAO,CAAC,CAAC;YACvC,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC;gBAAE,MAAM;YACnB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACd,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,2FAA2F;IAC3F,MAAM,CAAC,KAAK,CAAC,CAAK,EAAE,CAAS,EAAE,CAAS,EAAE,SAAS,GAAG,KAAK,EAAE,aAAa,GAAG,GAAG;QAC9E,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;QACzF,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAChB,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,EAAE,GAAG,EAAE,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS;gBAAE,OAAO,CAAC,CAAC;YACtE,IAAI,CAAS,CAAC;YACd,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC3B,CAAC;oBACC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;wBACvC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;wBACvC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC5C,CAAC;iBAAM,CAAC;gBACN,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACrC,CAAC;YACD,MAAM,IAAI,GACR,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;gBACnB,CAAC,GAAG,CAAC;gBACL,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjD,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrD,IAAI,IAAI,EAAE,CAAC;gBACT,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBAChB,KAAK,GAAG,IAAI,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,KAAK,CAAC;YAChB,CAAC;YACD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,CAAC,CAAC;YACN,EAAE,GAAG,EAAE,CAAC;YACR,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAChB,CAAC,GAAG,CAAC,CAAC;gBACN,EAAE,GAAG,EAAE,CAAC;YACV,CAAC;iBAAM,CAAC;gBACN,CAAC,GAAG,CAAC,CAAC;gBACN,EAAE,GAAG,EAAE,CAAC;YACV,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAChB,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,2EAA2E;IAE3E,wDAAwD;IACxD,MAAM,CAAC,SAAS,CAAC,CAAK,EAAE,CAAS,EAAE,CAAS,EAAE,CAAC,GAAG,IAAI;QACpD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,OAAO,GAAG,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,2EAA2E;IAC3E,MAAM,CAAC,OAAO,CAAC,CAAK,EAAE,CAAS,EAAE,CAAS,EAAE,CAAC,GAAG,IAAI;QAClD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACxE,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,+DAA+D;IAC/D,MAAM,CAAC,eAAe,CAAC,CAAK,EAAE,CAAS,EAAE,CAAS,EAAE,SAAS,GAAG,KAAK,EAAE,QAAQ,GAAG,EAAE;QAClF,MAAM,OAAO,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,GAAW,EAAE,IAAY,EAAE,GAAW,EAAE,EAAE,CACjF,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,CACd,EAAU,EACV,EAAU,EACV,GAAW,EACX,IAAY,EACZ,GAAW,EACX,KAAa,EACb,GAAW,EACX,KAAa,EACL,EAAE;YACV,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAC5B,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAC5B,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAChD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YACjD,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,GAAG,GAAG;gBAAE,OAAO,IAAI,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAChH,OAAO,CACL,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;gBAC5D,OAAO,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAC9D,CAAC;QACJ,CAAC,CAAC;QACF,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,OAAO,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACvF,CAAC;IAED,qDAAqD;IACrD,MAAM,CAAC,aAAa,CAAC,CAAK,EAAE,CAAS,EAAE,CAAS;QAC9C,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,OAAO,GAAG,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,2EAA2E;IAE3E,4EAA4E;IAC5E,MAAM,CAAC,KAAK,CAAC,CAAM,EAAE,EAAY,EAAE,EAAU,EAAE,EAAU,EAAE,CAAC,GAAG,IAAI;QACjE,MAAM,KAAK,GAAc,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;QAChB,OAAO,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC,IAAI,IAAI,CAAC;YACV,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,8EAA8E;IAC9E,MAAM,CAAC,GAAG,CAAC,CAAM,EAAE,EAAY,EAAE,EAAU,EAAE,EAAU,EAAE,CAAC,GAAG,IAAI;QAC/D,MAAM,KAAK,GAAc,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;QAChB,OAAO,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,CAAC,CACV,CAAC,GAAG,IAAI,GAAG,CAAC,EACZ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAC1C,CAAC;YACF,MAAM,EAAE,GAAG,CAAC,CACV,CAAC,GAAG,IAAI,GAAG,CAAC,EACZ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAC1C,CAAC;YACF,MAAM,EAAE,GAAG,CAAC,CACV,CAAC,GAAG,IAAI,EACR,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CACpC,CAAC;YACF,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChF,CAAC,IAAI,IAAI,CAAC;YACV,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,6EAA6E;IAE7E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAgCG;IACH,MAAM,CAAC,kBAAkB,CACvB,KAAY,EACZ,OAAiB,EACjB,EAAY,EACZ,EAAY,EACZ,UAA4E,EAAE;QAE9E,MAAM,EAAE,OAAO,GAAG,IAAI,EAAE,SAAS,GAAG,KAAK,EAAE,aAAa,GAAG,GAAG,EAAE,GAAG,OAAO,CAAC;QAC3E,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC;QACpB,IAAI,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;QAC1B,IAAI,MAAM,GAAG,OAAO,CAAC;QAErB,SAAS,SAAS,CAAC,CAAW;YAC5B,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC;QACD,SAAS,KAAK,CAAC,CAAW;YACxB,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,SAAS,QAAQ,CAAC,CAAW;YAC3B,MAAM,CAAC,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;gBAC5C,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrB,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtB,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;gBACjB,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;gBAClB,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;gBAC/B,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;gBACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YAC5E,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;QAC1B,IAAI,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,YAAY,GAAG,KAAK,CAAC;QAEzB,OAAO,UAAU,GAAG,aAAa,EAAE,UAAU,EAAE,EAAE,CAAC;YAChD,IAAI,YAAY,GAAG,SAAS;gBAAE,MAAM,CAAC,qFAAqF;YAC1H,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC3B,MAAM,GAAG,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9E,MAAM,GAAG,GAAa,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;oBACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;wBAAE,CAAC,IAAK,CAAC,CAAC,CAAC,CAAc,CAAC,CAAC,CAAC,GAAI,CAAC,CAAC,CAAC,CAAc,CAAC,CAAC,CAAC,CAAC;oBAC9E,GAAG,CAAC,CAAC,CAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC9B,CAAC;gBACD,IAAI,EAAE,GAAG,CAAC,CAAC;gBACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAAE,EAAE,IAAK,CAAC,CAAC,CAAC,CAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/D,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACd,CAAC;YAED,MAAM,SAAS,GAAG,YAAY,CAAC;YAC/B,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC;gBACrD,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAI,GAAG,CAAC,CAAC,CAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvG,IAAI,KAAe,CAAC;gBACpB,IAAI,CAAC;oBACH,KAAK,GAAG;wBACN,GAAG,UAAU,CAAC,KAAK,CACjB,CAAC,EACD,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CACnB;qBACF,CAAC;gBACJ,CAAC;gBAAC,MAAM,CAAC;oBACP,MAAM,IAAI,EAAE,CAAC;oBACb,SAAS;gBACX,CAAC;gBACD,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAI,KAAK,CAAC,CAAC,CAAY,CAAC,CAAC;gBACjE,MAAM,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;gBACxC,MAAM,cAAc,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;gBACzC,IAAI,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,cAAc,GAAG,YAAY,EAAE,CAAC;oBACrE,MAAM,GAAG,SAAS,CAAC;oBACnB,CAAC,GAAG,UAAU,CAAC;oBACf,YAAY,GAAG,cAAc,CAAC;oBAC9B,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC;oBACtC,QAAQ,GAAG,IAAI,CAAC;oBAChB,YAAY,GAAG,IAAI,CAAC;gBACtB,CAAC;qBAAM,CAAC;oBACN,MAAM,IAAI,EAAE,CAAC;gBACf,CAAC;YACH,CAAC;YACD,oEAAoE;YACpE,sEAAsE;YACtE,iEAAiE;YACjE,oEAAoE;YACpE,mEAAmE;YACnE,sEAAsE;YACtE,uDAAuD;YACvD,IAAI,CAAC,QAAQ;gBAAE,MAAM;YACrB,MAAM,mBAAmB,GAAG,CAAC,SAAS,GAAG,YAAY,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAChF,IAAI,mBAAmB,GAAG,KAAK;gBAAE,MAAM;QACzC,CAAC;QAED,OAAO;YACL,MAAM;YACN,YAAY,EAAE,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC;YACrC,UAAU;YACV,SAAS,EAAE,YAAY,IAAI,YAAY,GAAG,SAAS;SACpD,CAAC;IACJ,CAAC;CACF"}

package/dist/Permutation.d.ts

@@ -0,0 +1,43 @@
+import { Cycle } from "./Cycle.ts";
+/**
+ * Permutation — a bijection described by a domain array and the codomain array
+ * it maps onto (element-wise). Ported from Mallory's ActionScript `Permutation`.
+ *
+ * Bug fixes from the AS3 original:
+ *  - the constructor silently ignored mismatched-length inputs; it now throws.
+ *  - `order` wrapped cycle lengths in `ComplexNumber` then read `.value` off an
+ *    `int` (yielding `undefined`); it now takes the LCM of the plain lengths and
+ *    returns 1 for the identity.
+ *  - `cycles` no longer mutates any shared state (it works on local copies).
+ */
+export declare class Permutation<T = unknown> {
+    private readonly _domain;
+    private readonly _coDomain;
+    private _lookup;
+    constructor(input: T[], output: T[]);
+    get domain(): T[];
+    get coDomain(): T[];
+    /** The domain -> codomain lookup map, built once (on first access) and reused thereafter. */
+    private get lookup();
+    /** Map an element through the permutation (identity outside the domain). */
+    apply(element: T): T;
+    /** The inverse permutation (swap domain and codomain). */
+    inverse(): Permutation<T>;
+    /** Raise the permutation to an integer power, via binary exponentiation (`O(log p)` compositions). */
+    power(pow: number): Permutation<T>;
+    toString(): string;
+    /** Decompose into disjoint cycles. */
+    cycles(): Array<Cycle<T>>;
+    /** The order of the permutation (LCM of its cycle lengths). */
+    order(): number;
+    static readonly Identity: Permutation<unknown>;
+    /** Compose two permutations: `(sigma ∘ tao)(x) = sigma(tao(x))`. */
+    static compose<T>(sigma: Permutation<T>, tao: Permutation<T>): Permutation<T>;
+    /** Compose a list of permutations left-to-right. */
+    static composeList<T>(list: Array<Permutation<T>>): Permutation<T>;
+    /** Structural equality (same action on every domain element of either). */
+    static equal<T>(sigma: Permutation<T>, tao: Permutation<T>): boolean;
+    /** Whether two permutations commute. */
+    static commute<T>(sigma: Permutation<T>, tao: Permutation<T>): boolean;
+}
+//# sourceMappingURL=Permutation.d.ts.map

package/dist/Permutation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Permutation.d.ts","sourceRoot":"","sources":["../src/Permutation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAGnC;;;;;;;;;;GAUG;AACH,qBAAa,WAAW,CAAC,CAAC,GAAG,OAAO;IAClC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAM;IAC9B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAM;IAIhC,OAAO,CAAC,OAAO,CAA0B;gBAE7B,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE;IAQnC,IAAI,MAAM,IAAI,CAAC,EAAE,CAEhB;IAED,IAAI,QAAQ,IAAI,CAAC,EAAE,CAElB;IAED,6FAA6F;IAC7F,OAAO,KAAK,MAAM,GAKjB;IAED,4EAA4E;IAC5E,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC;IAKpB,0DAA0D;IAC1D,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;IAIzB,sGAAsG;IACtG,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC;IAsBlC,QAAQ,IAAI,MAAM;IAKlB,sCAAsC;IACtC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAyBzB,+DAA+D;IAC/D,KAAK,IAAI,MAAM;IAMf,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,OAAO,CAAC,CAAoC;IAElF,oEAAoE;IACpE,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;IAQ7E,oDAAoD;IACpD,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;IAMlE,2EAA2E;IAC3E,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO;IAMpE,wCAAwC;IACxC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO;CAGvE"}

package/dist/Permutation.js

@@ -0,0 +1,142 @@
+import { Cycle } from "./Cycle.js";
+import { NumberTheory } from "./NumberTheory.js";
+/**
+ * Permutation — a bijection described by a domain array and the codomain array
+ * it maps onto (element-wise). Ported from Mallory's ActionScript `Permutation`.
+ *
+ * Bug fixes from the AS3 original:
+ *  - the constructor silently ignored mismatched-length inputs; it now throws.
+ *  - `order` wrapped cycle lengths in `ComplexNumber` then read `.value` off an
+ *    `int` (yielding `undefined`); it now takes the LCM of the plain lengths and
+ *    returns 1 for the identity.
+ *  - `cycles` no longer mutates any shared state (it works on local copies).
+ */
+export class Permutation {
+    _domain;
+    _coDomain;
+    // Lazily-built domain -> codomain lookup, cached on first use. The instance is otherwise
+    // immutable (domain/coDomain are never mutated after construction), so this is safe to cache
+    // for the lifetime of the object.
+    _lookup = null;
+    constructor(input, output) {
+        if (input.length !== output.length) {
+            throw new Error("Permutation domain and codomain must have equal length.");
+        }
+        this._domain = [...input];
+        this._coDomain = [...output];
+    }
+    get domain() {
+        return [...this._domain];
+    }
+    get coDomain() {
+        return [...this._coDomain];
+    }
+    /** The domain -> codomain lookup map, built once (on first access) and reused thereafter. */
+    get lookup() {
+        if (this._lookup === null) {
+            this._lookup = new Map(this._domain.map((d, i) => [d, this._coDomain[i]]));
+        }
+        return this._lookup;
+    }
+    /** Map an element through the permutation (identity outside the domain). */
+    apply(element) {
+        const map = this.lookup;
+        return map.has(element) ? map.get(element) : element;
+    }
+    /** The inverse permutation (swap domain and codomain). */
+    inverse() {
+        return new Permutation(this.coDomain, this.domain);
+    }
+    /** Raise the permutation to an integer power, via binary exponentiation (`O(log p)` compositions). */
+    power(pow) {
+        if (pow === 0)
+            return Permutation.Identity;
+        if (pow === 1)
+            return this;
+        if (pow === -1)
+            return this.inverse();
+        let base = this;
+        let p = pow;
+        if (pow < -1) {
+            base = this.inverse();
+            p = -pow;
+        }
+        // Repeated squaring: result accumulates the product of base^(2^i) for each set bit of p.
+        let result;
+        while (p > 0) {
+            if (p % 2 === 1)
+                result = result === undefined ? base : Permutation.compose(result, base);
+            p = Math.floor(p / 2);
+            if (p > 0)
+                base = Permutation.compose(base, base);
+        }
+        return result;
+    }
+    toString() {
+        const parts = this._domain.map((d, i) => `${d} -> ${this._coDomain[i]}`);
+        return `(${parts.join(",")})`;
+    }
+    /** Decompose into disjoint cycles. */
+    cycles() {
+        const domain = [...this._domain];
+        const coDomain = [...this._coDomain];
+        const result = [];
+        while (domain.length > 0) {
+            const start = domain[0];
+            let current = start;
+            const tempArray = [];
+            do {
+                tempArray.push(current);
+                current = this.apply(current);
+                for (let i = 0; i < coDomain.length; i++) {
+                    if (current === coDomain[i]) {
+                        domain.splice(i, 1);
+                        coDomain.splice(i, 1);
+                        break;
+                    }
+                }
+            } while (current !== start);
+            result.push(new Cycle(tempArray));
+        }
+        return result;
+    }
+    /** The order of the permutation (LCM of its cycle lengths). */
+    order() {
+        const lengths = this.cycles().map((c) => c.length);
+        if (lengths.length === 0)
+            return 1;
+        return Number(NumberTheory.lcmList(lengths));
+    }
+    static Identity = new Permutation([], []);
+    /** Compose two permutations: `(sigma ∘ tao)(x) = sigma(tao(x))`. */
+    static compose(sigma, tao) {
+        // Set preserves insertion order and dedupes in O(n), matching the old O(n^2)
+        // lastIndexOf/splice loop's "first occurrence wins" semantics exactly.
+        const newDomain = Array.from(new Set(sigma.domain.concat(tao.domain)));
+        const newCoDomain = newDomain.map((x) => sigma.apply(tao.apply(x)));
+        return new Permutation(newDomain, newCoDomain);
+    }
+    /** Compose a list of permutations left-to-right. */
+    static composeList(list) {
+        if (list.length === 0)
+            return Permutation.Identity;
+        if (list.length === 1)
+            return list[0];
+        return list.reduce((acc, p) => Permutation.compose(acc, p));
+    }
+    /** Structural equality (same action on every domain element of either). */
+    static equal(sigma, tao) {
+        for (const d of sigma.domain)
+            if (sigma.apply(d) !== tao.apply(d))
+                return false;
+        for (const d of tao.domain)
+            if (tao.apply(d) !== sigma.apply(d))
+                return false;
+        return true;
+    }
+    /** Whether two permutations commute. */
+    static commute(sigma, tao) {
+        return Permutation.equal(Permutation.compose(sigma, tao), Permutation.compose(tao, sigma));
+    }
+}
+//# sourceMappingURL=Permutation.js.map

package/dist/Permutation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Permutation.js","sourceRoot":"","sources":["../src/Permutation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEjD;;;;;;;;;;GAUG;AACH,MAAM,OAAO,WAAW;IACL,OAAO,CAAM;IACb,SAAS,CAAM;IAChC,yFAAyF;IACzF,6FAA6F;IAC7F,kCAAkC;IAC1B,OAAO,GAAqB,IAAI,CAAC;IAEzC,YAAY,KAAU,EAAE,MAAW;QACjC,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,IAAI,MAAM;QACR,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC;IAED,6FAA6F;IAC7F,IAAY,MAAM;QAChB,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAM,CAAC,CAAC,CAAC,CAAC;QAClF,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,4EAA4E;IAC5E,KAAK,CAAC,OAAU;QACd,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,OAAO,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,GAAG,CAAC,OAAO,CAAO,CAAC,CAAC,CAAC,OAAO,CAAC;IAC9D,CAAC;IAED,0DAA0D;IAC1D,OAAO;QACL,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACrD,CAAC;IAED,sGAAsG;IACtG,KAAK,CAAC,GAAW;QACf,IAAI,GAAG,KAAK,CAAC;YAAE,OAAO,WAAW,CAAC,QAA0B,CAAC;QAC7D,IAAI,GAAG,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3B,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;QAEtC,IAAI,IAAI,GAAmB,IAAI,CAAC;QAChC,IAAI,CAAC,GAAG,GAAG,CAAC;QACZ,IAAI,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;YACb,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACtB,CAAC,GAAG,CAAC,GAAG,CAAC;QACX,CAAC;QAED,yFAAyF;QACzF,IAAI,MAAkC,CAAC;QACvC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,MAAM,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC1F,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,GAAG,CAAC;gBAAE,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,MAAwB,CAAC;IAClC,CAAC;IAED,QAAQ;QACN,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzE,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAChC,CAAC;IAED,sCAAsC;IACtC,MAAM;QACJ,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QACrC,MAAM,MAAM,GAAoB,EAAE,CAAC;QAEnC,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAM,CAAC;YAC7B,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,MAAM,SAAS,GAAQ,EAAE,CAAC;YAC1B,GAAG,CAAC;gBACF,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxB,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,IAAI,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC5B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBACpB,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBACtB,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC,QAAQ,OAAO,KAAK,KAAK,EAAE;YAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,+DAA+D;IAC/D,KAAK;QACH,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,MAAM,CAAU,QAAQ,GAAyB,IAAI,WAAW,CAAU,EAAE,EAAE,EAAE,CAAC,CAAC;IAElF,oEAAoE;IACpE,MAAM,CAAC,OAAO,CAAI,KAAqB,EAAE,GAAmB;QAC1D,6EAA6E;QAC7E,uEAAuE;QACvE,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,IAAI,WAAW,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;IACjD,CAAC;IAED,oDAAoD;IACpD,MAAM,CAAC,WAAW,CAAI,IAA2B;QAC/C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,WAAW,CAAC,QAA0B,CAAC;QACrE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC,CAAmB,CAAC;QACxD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,2EAA2E;IAC3E,MAAM,CAAC,KAAK,CAAI,KAAqB,EAAE,GAAmB;QACxD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM;YAAE,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAChF,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM;YAAE,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC9E,OAAO,IAAI,CAAC;IACd,CAAC;IAED,wCAAwC;IACxC,MAAM,CAAC,OAAO,CAAI,KAAqB,EAAE,GAAmB;QAC1D,OAAO,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,WAAW,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7F,CAAC"}

package/dist/Polygon.d.ts

@@ -0,0 +1,64 @@
+import { Vector } from "./Vector.ts";
+/** A 2D point stored as a {@link Vector} `[x, y]`. */
+type Point = Vector<number>;
+/**
+ * Polygon — an ordered list of vertex points ({@link Vector} subclass). Ported
+ * from Mallory's ActionScript `Polygon`.
+ *
+ * Bug fixes from the AS3 original:
+ *  - `perimeter` accumulated into a `uint`, truncating the fractional length.
+ *  - `area` only summed two triangles, so it was wrong for pentagons and up; it
+ *    now uses the shoelace formula, correct for any simple polygon.
+ *  - `angle` was stubbed to `return 0` (with dead code calling classes that do
+ *    not exist); it now computes the interior angle via the law of cosines it
+ *    documented.
+ */
+export declare class Polygon extends Vector<Point> {
+    /** The vertex at `index`, wrapping around the polygon. */
+    vertex(index: number): Point;
+    get vertexCount(): number;
+    get edgeCount(): number;
+    /** The edge starting at `index` as a two-vertex polygon. */
+    edge(index: number): Polygon;
+    /** Total perimeter length (bug fix: no longer truncated to an integer). */
+    perimeter(): number;
+    /** Heron's-formula area of the triangle on the first three vertices. */
+    private triArea;
+    /**
+     * Area of the polygon via the shoelace formula (bug fix: the AS3 version only
+     * summed two triangles and was wrong for polygons with more than four sides).
+     */
+    area(): number;
+    /**
+     * The area centroid (center of mass) as an `[x, y]` point. Complements
+     * {@link perimeter} and {@link area}. Falls back to the vertex average for a
+     * degenerate (zero-area) polygon.
+     */
+    centroid(): Point;
+    /**
+     * Interior angle (radians) at vertex `i`, via the law of cosines
+     * (bug fix: the AS3 method always returned 0).
+     */
+    angle(i: number): number;
+    /** True when `point` lies inside the polygon (even-odd ray-casting rule). */
+    contains(point: Point): boolean;
+    /** True when the polygon is convex (all turns share the same orientation). */
+    isConvex(): boolean;
+    /** True when no two non-adjacent edges cross (the polygon is simple). */
+    isSimple(): boolean;
+    private static orient;
+    private static onSegment;
+    private static segmentsIntersect;
+    /**
+     * A regular n-gon: `n` vertices evenly spaced on a circle of `radius`
+     * around `center`, starting at `startAngle` (default `-pi/2`, i.e. the
+     * first vertex points straight up — the conventional orientation for a
+     * polygon drawn on a screen y-down or math y-up axis alike) and
+     * proceeding counterclockwise in standard math convention.
+     */
+    static regular(n: number, radius?: number, center?: Point, startAngle?: number): Polygon;
+    /** A clone of the polygon (deep-clones nested vertex vectors by default). */
+    clone(deep?: boolean): Polygon;
+}
+export {};
+//# sourceMappingURL=Polygon.d.ts.map

package/dist/Polygon.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Polygon.d.ts","sourceRoot":"","sources":["../src/Polygon.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,sDAAsD;AACtD,KAAK,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;AAE5B;;;;;;;;;;;GAWG;AACH,qBAAa,OAAQ,SAAQ,MAAM,CAAC,KAAK,CAAC;IACxC,0DAA0D;IAC1D,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK;IAI5B,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,IAAI,SAAS,IAAI,MAAM,CAGtB;IAED,4DAA4D;IAC5D,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAI5B,2EAA2E;IAC3E,SAAS,IAAI,MAAM;IAQnB,wEAAwE;IACxE,OAAO,CAAC,OAAO;IAQf;;;OAGG;IACH,IAAI,IAAI,MAAM;IAYd;;;;OAIG;IACH,QAAQ,IAAI,KAAK;IA0BjB;;;OAGG;IACH,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAOxB,6EAA6E;IAC7E,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO;IAiB/B,8EAA8E;IAC9E,QAAQ,IAAI,OAAO;IAoBnB,yEAAyE;IACzE,QAAQ,IAAI,OAAO;IAiBnB,OAAO,CAAC,MAAM,CAAC,MAAM;IAOrB,OAAO,CAAC,MAAM,CAAC,SAAS;IASxB,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAahC;;;;;;OAMG;IACH,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,SAAI,EAAE,MAAM,GAAE,KAAgC,EAAE,UAAU,SAAe,GAAG,OAAO;IAWnH,6EAA6E;IACpE,KAAK,CAAC,IAAI,UAAO,GAAG,OAAO;CAQrC"}