@johnhenry/math 0.0.0

package/dist/Polygon.js

@@ -0,0 +1,221 @@
+import { NumberTheory } from "./NumberTheory.js";
+import { distanceVector } from "./RealMath.js";
+import { Vector } from "./Vector.js";
+/**
+ * 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 class Polygon extends Vector {
+    /** The vertex at `index`, wrapping around the polygon. */
+    vertex(index) {
+        return this[Number(NumberTheory.mod(index, this.length))];
+    }
+    get vertexCount() {
+        return this.length;
+    }
+    get edgeCount() {
+        if (this.vertexCount < 3)
+            return this.length - 1;
+        return this.vertexCount;
+    }
+    /** The edge starting at `index` as a two-vertex polygon. */
+    edge(index) {
+        return new Polygon(this.vertex(index), this.vertex(index + 1));
+    }
+    /** Total perimeter length (bug fix: no longer truncated to an integer). */
+    perimeter() {
+        let per = 0;
+        for (let i = 0; i < this.edgeCount; i++) {
+            per += distanceVector(this.vertex(i), this.vertex(i + 1));
+        }
+        return per;
+    }
+    /** Heron's-formula area of the triangle on the first three vertices. */
+    triArea() {
+        const a = distanceVector(this.vertex(0), this.vertex(1));
+        const b = distanceVector(this.vertex(1), this.vertex(2));
+        const c = distanceVector(this.vertex(2), this.vertex(0));
+        const s = (a + b + c) / 2;
+        return Math.sqrt(s * (s - a) * (s - b) * (s - c));
+    }
+    /**
+     * 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() {
+        if (this.vertexCount < 3)
+            return 0;
+        if (this.vertexCount === 3)
+            return this.triArea();
+        let sum = 0;
+        for (let i = 0; i < this.vertexCount; i++) {
+            const current = this.vertex(i);
+            const next = this.vertex(i + 1);
+            sum += current.x * next.y - next.x * current.y;
+        }
+        return Math.abs(sum) / 2;
+    }
+    /**
+     * 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() {
+        let signedArea = 0;
+        let cx = 0;
+        let cy = 0;
+        for (let i = 0; i < this.vertexCount; i++) {
+            const cur = this.vertex(i);
+            const next = this.vertex(i + 1);
+            const cross = cur.x * next.y - next.x * cur.y;
+            signedArea += cross;
+            cx += (cur.x + next.x) * cross;
+            cy += (cur.y + next.y) * cross;
+        }
+        if (signedArea === 0) {
+            // Degenerate: average the vertices.
+            let sx = 0;
+            let sy = 0;
+            for (let i = 0; i < this.vertexCount; i++) {
+                sx += this.vertex(i).x;
+                sy += this.vertex(i).y;
+            }
+            const n = this.vertexCount || 1;
+            return Vector.fromArray([sx / n, sy / n]);
+        }
+        return Vector.fromArray([cx / (3 * signedArea), cy / (3 * signedArea)]);
+    }
+    /**
+     * Interior angle (radians) at vertex `i`, via the law of cosines
+     * (bug fix: the AS3 method always returned 0).
+     */
+    angle(i) {
+        const ab = distanceVector(this.vertex(i), this.vertex(i + 1));
+        const bc = distanceVector(this.vertex(i), this.vertex(i - 1));
+        const ac = distanceVector(this.vertex(i + 1), this.vertex(i - 1));
+        return Math.acos((ab * ab + bc * bc - ac * ac) / (2 * ab * bc));
+    }
+    /** True when `point` lies inside the polygon (even-odd ray-casting rule). */
+    contains(point) {
+        const px = point.x;
+        const py = point.y;
+        let inside = false;
+        const n = this.vertexCount;
+        for (let i = 0, j = n - 1; i < n; j = i++) {
+            const vi = this.vertex(i);
+            const vj = this.vertex(j);
+            const xi = vi.x;
+            const yi = vi.y;
+            const xj = vj.x;
+            const yj = vj.y;
+            if (yi > py !== yj > py && px < ((xj - xi) * (py - yi)) / (yj - yi) + xi)
+                inside = !inside;
+        }
+        return inside;
+    }
+    /** True when the polygon is convex (all turns share the same orientation). */
+    isConvex() {
+        const n = this.vertexCount;
+        if (n < 3)
+            return false;
+        let sign = 0;
+        for (let i = 0; i < n; i++) {
+            const a = this.vertex(i);
+            const b = this.vertex(i + 1);
+            const c = this.vertex(i + 2);
+            const cross = (b.x - a.x) * (c.y - b.y) -
+                (b.y - a.y) * (c.x - b.x);
+            if (cross !== 0) {
+                const s = Math.sign(cross);
+                if (sign === 0)
+                    sign = s;
+                else if (s !== sign)
+                    return false;
+            }
+        }
+        return true;
+    }
+    /** True when no two non-adjacent edges cross (the polygon is simple). */
+    isSimple() {
+        const n = this.vertexCount;
+        if (n < 3)
+            return false;
+        for (let i = 0; i < n; i++) {
+            const a1 = this.vertex(i);
+            const a2 = this.vertex(i + 1);
+            for (let j = i + 1; j < n; j++) {
+                // Skip edges that share a vertex (adjacent, or the wrap-around pair).
+                if (j === i || j === i + 1 || (i === 0 && j === n - 1))
+                    continue;
+                const b1 = this.vertex(j);
+                const b2 = this.vertex(j + 1);
+                if (Polygon.segmentsIntersect(a1, a2, b1, b2))
+                    return false;
+            }
+        }
+        return true;
+    }
+    static orient(a, b, c) {
+        return ((b.x - a.x) * (c.y - a.y) -
+            (b.y - a.y) * (c.x - a.x));
+    }
+    static onSegment(a, b, p) {
+        return (Math.min(a.x, b.x) <= p.x &&
+            p.x <= Math.max(a.x, b.x) &&
+            Math.min(a.y, b.y) <= p.y &&
+            p.y <= Math.max(a.y, b.y));
+    }
+    static segmentsIntersect(p1, p2, p3, p4) {
+        const d1 = Polygon.orient(p3, p4, p1);
+        const d2 = Polygon.orient(p3, p4, p2);
+        const d3 = Polygon.orient(p1, p2, p3);
+        const d4 = Polygon.orient(p1, p2, p4);
+        if (((d1 > 0 && d2 < 0) || (d1 < 0 && d2 > 0)) && ((d3 > 0 && d4 < 0) || (d3 < 0 && d4 > 0)))
+            return true;
+        if (d1 === 0 && Polygon.onSegment(p3, p4, p1))
+            return true;
+        if (d2 === 0 && Polygon.onSegment(p3, p4, p2))
+            return true;
+        if (d3 === 0 && Polygon.onSegment(p1, p2, p3))
+            return true;
+        if (d4 === 0 && Polygon.onSegment(p1, p2, p4))
+            return true;
+        return false;
+    }
+    /**
+     * 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, radius = 1, center = Vector.fromArray([0, 0]), startAngle = -Math.PI / 2) {
+        if (n < 3)
+            throw new Error(`Polygon.regular: n must be at least 3, got ${n}`);
+        const cx = center.x;
+        const cy = center.y;
+        const vertices = Array.from({ length: n }, (_, i) => {
+            const theta = startAngle + (2 * Math.PI * i) / n;
+            return Vector.fromArray([cx + radius * Math.cos(theta), cy + radius * Math.sin(theta)]);
+        });
+        return new Polygon(...vertices);
+    }
+    /** A clone of the polygon (deep-clones nested vertex vectors by default). */
+    clone(deep = true) {
+        const out = new Polygon(this.length);
+        for (let i = 0; i < out.length; i++) {
+            const el = this[i];
+            out[i] = deep && el instanceof Vector ? el.clone() : el;
+        }
+        return out;
+    }
+}
+//# sourceMappingURL=Polygon.js.map

package/dist/Polygon.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Polygon.js","sourceRoot":"","sources":["../src/Polygon.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAKrC;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,OAAQ,SAAQ,MAAa;IACxC,0DAA0D;IAC1D,MAAM,CAAC,KAAa;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAU,CAAC;IACrE,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,SAAS;QACX,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,4DAA4D;IAC5D,IAAI,CAAC,KAAa;QAChB,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IAED,2EAA2E;IAC3E,SAAS;QACP,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,wEAAwE;IAChE,OAAO;QACb,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IAED;;;OAGG;IACH,IAAI;QACF,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC;QACnC,IAAI,IAAI,CAAC,WAAW,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;QAClD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChC,GAAG,IAAK,OAAO,CAAC,CAAY,GAAI,IAAI,CAAC,CAAY,GAAI,IAAI,CAAC,CAAY,GAAI,OAAO,CAAC,CAAY,CAAC;QACjG,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChC,MAAM,KAAK,GAAI,GAAG,CAAC,CAAY,GAAI,IAAI,CAAC,CAAY,GAAI,IAAI,CAAC,CAAY,GAAI,GAAG,CAAC,CAAY,CAAC;YAC9F,UAAU,IAAI,KAAK,CAAC;YACpB,EAAE,IAAI,CAAE,GAAG,CAAC,CAAY,GAAI,IAAI,CAAC,CAAY,CAAC,GAAG,KAAK,CAAC;YACvD,EAAE,IAAI,CAAE,GAAG,CAAC,CAAY,GAAI,IAAI,CAAC,CAAY,CAAC,GAAG,KAAK,CAAC;QACzD,CAAC;QACD,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;YACrB,oCAAoC;YACpC,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAW,CAAC;gBACjC,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAW,CAAC;YACnC,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;YAChC,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,CAAS;QACb,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,EAAE,GAAG,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,6EAA6E;IAC7E,QAAQ,CAAC,KAAY;QACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAW,CAAC;QAC7B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAW,CAAC;QAC7B,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAW,CAAC;YAC1B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAW,CAAC;YAC1B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAW,CAAC;YAC1B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAW,CAAC;YAC1B,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE;gBAAE,MAAM,GAAG,CAAC,MAAM,CAAC;QAC7F,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,8EAA8E;IAC9E,QAAQ;QACN,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACxB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,MAAM,KAAK,GACT,CAAE,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAY,CAAC,GAAG,CAAE,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAY,CAAC;gBACzE,CAAE,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAY,CAAC,GAAG,CAAE,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAY,CAAC,CAAC;YAC5E,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,KAAK,CAAC;oBAAE,IAAI,GAAG,CAAC,CAAC;qBACpB,IAAI,CAAC,KAAK,IAAI;oBAAE,OAAO,KAAK,CAAC;YACpC,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yEAAyE;IACzE,QAAQ;QACN,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,sEAAsE;gBACtE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;oBAAE,SAAS;gBACjE,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9B,IAAI,OAAO,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;oBAAE,OAAO,KAAK,CAAC;YAC9D,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,MAAM,CAAC,MAAM,CAAC,CAAQ,EAAE,CAAQ,EAAE,CAAQ;QAChD,OAAO,CACL,CAAE,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAY,CAAC,GAAG,CAAE,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAY,CAAC;YACzE,CAAE,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAY,CAAC,GAAG,CAAE,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAY,CAAC,CAC1E,CAAC;IACJ,CAAC;IAEO,MAAM,CAAC,SAAS,CAAC,CAAQ,EAAE,CAAQ,EAAE,CAAQ;QACnD,OAAO,CACL,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC,CAAW,CAAC,IAAK,CAAC,CAAC,CAAY;YACxD,CAAC,CAAC,CAAY,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC,CAAW,CAAC;YACzD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC,CAAW,CAAC,IAAK,CAAC,CAAC,CAAY;YACxD,CAAC,CAAC,CAAY,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC,CAAW,CAAC,CAC1D,CAAC;IACJ,CAAC;IAEO,MAAM,CAAC,iBAAiB,CAAC,EAAS,EAAE,EAAS,EAAE,EAAS,EAAE,EAAS;QACzE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1G,IAAI,EAAE,KAAK,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3D,IAAI,EAAE,KAAK,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3D,IAAI,EAAE,KAAK,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3D,IAAI,EAAE,KAAK,CAAC,IAAI,OAAO,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,IAAI,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,OAAO,CAAC,CAAS,EAAE,MAAM,GAAG,CAAC,EAAE,SAAgB,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC;QACvG,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,EAAE,CAAC,CAAC;QAC9E,MAAM,EAAE,GAAG,MAAM,CAAC,CAAW,CAAC;QAC9B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAW,CAAC;QAC9B,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAClD,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACjD,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAU,CAAC;QACnG,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC;IAClC,CAAC;IAED,6EAA6E;IACpE,KAAK,CAAC,IAAI,GAAG,IAAI;QACxB,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,EAAE,YAAY,MAAM,CAAC,CAAC,CAAE,EAAE,CAAC,KAAK,EAAY,CAAC,CAAC,CAAE,EAAY,CAAC;QAChF,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF"}

package/dist/PolynomialRing.d.ts

@@ -0,0 +1,74 @@
+import type { Structure } from "./Structure.ts";
+/**
+ * PolynomialRing — polynomials with coefficients in an arbitrary {@link Structure}
+ * (a finite field, the rationals, quaternions, whatever the structure supplies),
+ * following {@link GroupTheory}'s idiom of accepting the algebra as a constructor
+ * parameter rather than duplicating field logic. This generalizes long division,
+ * GCD, differentiation, and evaluation to any field — e.g. polynomials over
+ * `Structure.integersModulo(7)`, or plain real polynomials via
+ * `new PolynomialRing(Structure.realField())`.
+ *
+ * Coefficients are plain `T[]` arrays in ascending power (`p[i]` is the
+ * coefficient of `x^i`), trimmed of trailing zero coefficients. The zero
+ * polynomial is `[]`, with degree `-1`.
+ *
+ * {@link parsePolynomial}/{@link polynomialToString} below are real-number-only
+ * helpers for the common `"3*x^2-2*x+1"` string notation — parsing/formatting
+ * needs decimal syntax, which doesn't generalize to an arbitrary `Structure`.
+ */
+export declare class PolynomialRing<T> {
+    readonly structure: Structure<T>;
+    constructor(structure: Structure<T>);
+    /** Drop trailing coefficients equal to the structure's zero. */
+    private trim;
+    /** `-1` for the zero polynomial, else the index of the highest non-zero coefficient. */
+    degree(p: T[]): number;
+    zero(): T[];
+    one(): T[];
+    private pad;
+    add(a: T[], b: T[]): T[];
+    negate(p: T[]): T[];
+    subtract(a: T[], b: T[]): T[];
+    scale(p: T[], scalar: T): T[];
+    multiply(a: T[], b: T[]): T[];
+    /** Polynomial long division over the structure's field operations. */
+    divmod(a: T[], b: T[]): {
+        quotient: T[];
+        remainder: T[];
+    };
+    divide(a: T[], b: T[]): T[];
+    mod(a: T[], b: T[]): T[];
+    /** Rescale so the leading coefficient is the structure's one. No-op on the zero polynomial. */
+    private makeMonic;
+    /** Monic GCD via the Euclidean algorithm (repeated `divmod`). */
+    gcd(a: T[], b: T[]): T[];
+    /**
+     * The derivative polynomial (`i·c_i`, well-defined over any ring: `i` is
+     * built up as a running "`n` copies of the structure's `one`, added
+     * together" accumulator rather than being reconstructed from scratch for
+     * each coefficient — that would cost O(i) additions per coefficient, i.e.
+     * O(n²) additions overall for a degree-n polynomial).
+     */
+    derivative(p: T[]): T[];
+    /**
+     * An antiderivative with zero constant of integration (`c_i / (i+1)`, via the
+     * structure's `reciprocal`). `i+1` is built up as a running accumulator (see
+     * {@link derivative}) instead of being reconstructed from scratch per term.
+     */
+    antiderivative(p: T[]): T[];
+    /** Evaluate at `x` via Horner's method, using the structure's field operations. */
+    evaluate(p: T[], x: T): T;
+    equal(a: T[], b: T[]): boolean;
+    toString(p: T[], variable?: string): string;
+}
+/**
+ * Parse a real-coefficient polynomial string such as `"3*x^2-2*x+1"` into
+ * ascending-power coefficients (inverse of {@link polynomialToString}).
+ */
+export declare function parsePolynomial(str: string, variable?: string): number[];
+/**
+ * Render ascending-power real coefficients as a human-readable string such as
+ * `3*x^2+2*x+1` (inverse of {@link parsePolynomial}).
+ */
+export declare function polynomialToString(coeffs: number[], variable?: string, descending?: boolean): string;
+//# sourceMappingURL=PolynomialRing.d.ts.map

package/dist/PolynomialRing.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolynomialRing.d.ts","sourceRoot":"","sources":["../src/PolynomialRing.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAEhD;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,cAAc,CAAC,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;gBAErB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;IAInC,gEAAgE;IAChE,OAAO,CAAC,IAAI;IAMZ,wFAAwF;IACxF,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,MAAM;IAItB,IAAI,IAAI,CAAC,EAAE;IAIX,GAAG,IAAI,CAAC,EAAE;IAIV,OAAO,CAAC,GAAG;IAMX,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAOxB,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAInB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAI7B,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE;IAI7B,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAW7B,sEAAsE;IACtE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG;QAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;QAAC,SAAS,EAAE,CAAC,EAAE,CAAA;KAAE;IAsBzD,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAI3B,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAIxB,+FAA+F;IAC/F,OAAO,CAAC,SAAS;IAMjB,iEAAiE;IACjE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAWxB;;;;;;OAMG;IACH,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAWvB;;;;OAIG;IACH,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;IAW3B,mFAAmF;IACnF,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC;IAQzB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,OAAO;IAM9B,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,SAAM,GAAG,MAAM;CAazC;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,QAAQ,SAAM,GAAG,MAAM,EAAE,CAyBrE;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,QAAQ,SAAM,EAAE,UAAU,UAAO,GAAG,MAAM,CAU9F"}

package/dist/PolynomialRing.js

@@ -0,0 +1,231 @@
+/**
+ * PolynomialRing — polynomials with coefficients in an arbitrary {@link Structure}
+ * (a finite field, the rationals, quaternions, whatever the structure supplies),
+ * following {@link GroupTheory}'s idiom of accepting the algebra as a constructor
+ * parameter rather than duplicating field logic. This generalizes long division,
+ * GCD, differentiation, and evaluation to any field — e.g. polynomials over
+ * `Structure.integersModulo(7)`, or plain real polynomials via
+ * `new PolynomialRing(Structure.realField())`.
+ *
+ * Coefficients are plain `T[]` arrays in ascending power (`p[i]` is the
+ * coefficient of `x^i`), trimmed of trailing zero coefficients. The zero
+ * polynomial is `[]`, with degree `-1`.
+ *
+ * {@link parsePolynomial}/{@link polynomialToString} below are real-number-only
+ * helpers for the common `"3*x^2-2*x+1"` string notation — parsing/formatting
+ * needs decimal syntax, which doesn't generalize to an arbitrary `Structure`.
+ */
+export class PolynomialRing {
+    structure;
+    constructor(structure) {
+        this.structure = structure;
+    }
+    /** Drop trailing coefficients equal to the structure's zero. */
+    trim(p) {
+        let n = p.length;
+        while (n > 0 && this.structure.equality(p[n - 1], this.structure.zero))
+            n--;
+        return p.slice(0, n);
+    }
+    /** `-1` for the zero polynomial, else the index of the highest non-zero coefficient. */
+    degree(p) {
+        return this.trim(p).length - 1;
+    }
+    zero() {
+        return [];
+    }
+    one() {
+        return [this.structure.one];
+    }
+    pad(p, length) {
+        const result = p.slice();
+        while (result.length < length)
+            result.push(this.structure.zero);
+        return result;
+    }
+    add(a, b) {
+        const length = Math.max(a.length, b.length);
+        const pa = this.pad(a, length);
+        const pb = this.pad(b, length);
+        return this.trim(pa.map((x, i) => this.structure.add(x, pb[i])));
+    }
+    negate(p) {
+        return p.map((x) => this.structure.negative(x));
+    }
+    subtract(a, b) {
+        return this.add(a, this.negate(b));
+    }
+    scale(p, scalar) {
+        return this.trim(p.map((x) => this.structure.multiply(scalar, x)));
+    }
+    multiply(a, b) {
+        if (a.length === 0 || b.length === 0)
+            return [];
+        const result = new Array(a.length + b.length - 1).fill(this.structure.zero);
+        for (let i = 0; i < a.length; i++) {
+            for (let j = 0; j < b.length; j++) {
+                result[i + j] = this.structure.add(result[i + j], this.structure.multiply(a[i], b[j]));
+            }
+        }
+        return this.trim(result);
+    }
+    /** Polynomial long division over the structure's field operations. */
+    divmod(a, b) {
+        const bd = this.degree(b);
+        if (bd < 0)
+            throw new Error("PolynomialRing: division by the zero polynomial");
+        let remainder = this.trim(a);
+        const leadInv = this.structure.reciprocal(b[bd]);
+        const quotient = new Array(Math.max(this.degree(remainder) - bd + 1, 0)).fill(this.structure.zero);
+        while (this.degree(remainder) >= bd) {
+            const rd = this.degree(remainder);
+            const shift = rd - bd;
+            const coeff = this.structure.multiply(remainder[rd], leadInv);
+            quotient[shift] = coeff;
+            for (let i = 0; i <= bd; i++) {
+                remainder[i + shift] = this.structure.subtract(remainder[i + shift], this.structure.multiply(coeff, b[i]));
+            }
+            remainder = this.trim(remainder);
+        }
+        return { quotient: this.trim(quotient), remainder };
+    }
+    divide(a, b) {
+        return this.divmod(a, b).quotient;
+    }
+    mod(a, b) {
+        return this.divmod(a, b).remainder;
+    }
+    /** Rescale so the leading coefficient is the structure's one. No-op on the zero polynomial. */
+    makeMonic(p) {
+        const d = this.degree(p);
+        if (d < 0)
+            return p;
+        return this.scale(p, this.structure.reciprocal(p[d]));
+    }
+    /** Monic GCD via the Euclidean algorithm (repeated `divmod`). */
+    gcd(a, b) {
+        let x = this.trim(a);
+        let y = this.trim(b);
+        while (this.degree(y) >= 0) {
+            const { remainder } = this.divmod(x, y);
+            x = y;
+            y = remainder;
+        }
+        return this.makeMonic(x);
+    }
+    /**
+     * The derivative polynomial (`i·c_i`, well-defined over any ring: `i` is
+     * built up as a running "`n` copies of the structure's `one`, added
+     * together" accumulator rather than being reconstructed from scratch for
+     * each coefficient — that would cost O(i) additions per coefficient, i.e.
+     * O(n²) additions overall for a degree-n polynomial).
+     */
+    derivative(p) {
+        const trimmed = this.trim(p);
+        const out = [];
+        let n = this.structure.zero; // accumulates to `i` as an element of the structure
+        for (let i = 1; i < trimmed.length; i++) {
+            n = this.structure.add(n, this.structure.one);
+            out.push(this.structure.multiply(n, trimmed[i]));
+        }
+        return this.trim(out);
+    }
+    /**
+     * An antiderivative with zero constant of integration (`c_i / (i+1)`, via the
+     * structure's `reciprocal`). `i+1` is built up as a running accumulator (see
+     * {@link derivative}) instead of being reconstructed from scratch per term.
+     */
+    antiderivative(p) {
+        const trimmed = this.trim(p);
+        const out = [this.structure.zero];
+        let n = this.structure.zero; // accumulates to `i+1` as an element of the structure
+        for (let i = 0; i < trimmed.length; i++) {
+            n = this.structure.add(n, this.structure.one);
+            out.push(this.structure.multiply(trimmed[i], this.structure.reciprocal(n)));
+        }
+        return this.trim(out);
+    }
+    /** Evaluate at `x` via Horner's method, using the structure's field operations. */
+    evaluate(p, x) {
+        let result = this.structure.zero;
+        for (let i = p.length - 1; i >= 0; i--) {
+            result = this.structure.add(this.structure.multiply(result, x), p[i]);
+        }
+        return result;
+    }
+    equal(a, b) {
+        const ta = this.trim(a);
+        const tb = this.trim(b);
+        return ta.length === tb.length && ta.every((x, i) => this.structure.equality(x, tb[i]));
+    }
+    toString(p, variable = "x") {
+        const trimmed = this.trim(p);
+        if (trimmed.length === 0)
+            return "0";
+        const terms = [];
+        for (let i = trimmed.length - 1; i >= 0; i--) {
+            const c = trimmed[i];
+            if (this.structure.equality(c, this.structure.zero))
+                continue;
+            if (i === 0)
+                terms.push(`${c}`);
+            else if (i === 1)
+                terms.push(`${c}*${variable}`);
+            else
+                terms.push(`${c}*${variable}^${i}`);
+        }
+        return terms.join("+");
+    }
+}
+/**
+ * Parse a real-coefficient polynomial string such as `"3*x^2-2*x+1"` into
+ * ascending-power coefficients (inverse of {@link polynomialToString}).
+ */
+export function parsePolynomial(str, variable = "x") {
+    const s = str.replace(/\s+/g, "");
+    if (s === "")
+        return [0];
+    const terms = s
+        .replace(/-/g, "+-")
+        .split("+")
+        .filter((t) => t !== "");
+    const p = [];
+    for (const term of terms) {
+        let coef;
+        let exp;
+        const vi = term.indexOf(variable);
+        if (vi === -1) {
+            coef = Number(term);
+            exp = 0;
+        }
+        else {
+            const coefPart = term.slice(0, vi).replace(/\*$/, "");
+            coef = coefPart === "" || coefPart === "+" ? 1 : coefPart === "-" ? -1 : Number(coefPart);
+            const rest = term.slice(vi + variable.length);
+            exp = rest.startsWith("^") ? Number(rest.slice(1)) : 1;
+        }
+        p[exp] = (p[exp] ?? 0) + coef;
+    }
+    for (let i = 0; i < p.length; i++)
+        if (p[i] === undefined)
+            p[i] = 0;
+    return p;
+}
+/**
+ * Render ascending-power real coefficients as a human-readable string such as
+ * `3*x^2+2*x+1` (inverse of {@link parsePolynomial}).
+ */
+export function polynomialToString(coeffs, variable = "x", descending = true) {
+    const term = (coef, i) => {
+        if (i === 0)
+            return String(coef);
+        if (i === 1)
+            return `${coef}*${variable}`;
+        return `${coef}*${variable}^${i}`;
+    };
+    const indices = descending
+        ? Array.from({ length: coeffs.length }, (_, i) => coeffs.length - 1 - i)
+        : Array.from({ length: coeffs.length }, (_, i) => i);
+    return indices.map((i) => term(coeffs[i], i)).join("+");
+}
+//# sourceMappingURL=PolynomialRing.js.map

package/dist/PolynomialRing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolynomialRing.js","sourceRoot":"","sources":["../src/PolynomialRing.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,OAAO,cAAc;IAChB,SAAS,CAAe;IAEjC,YAAY,SAAuB;QACjC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,gEAAgE;IACxD,IAAI,CAAC,CAAM;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;QACjB,OAAO,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAM,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YAAE,CAAC,EAAE,CAAC;QACjF,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,wFAAwF;IACxF,MAAM,CAAC,CAAM;QACX,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,IAAI;QACF,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,GAAG;QACD,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAEO,GAAG,CAAC,CAAM,EAAE,MAAc;QAChC,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC,MAAM,GAAG,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,GAAG,CAAC,CAAM,EAAE,CAAM;QAChB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAM,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,MAAM,CAAC,CAAM;QACX,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,QAAQ,CAAC,CAAM,EAAE,CAAM;QACrB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,KAAK,CAAC,CAAM,EAAE,MAAS;QACrB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IAED,QAAQ,CAAC,CAAM,EAAE,CAAM;QACrB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAChD,MAAM,MAAM,GAAQ,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACjF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAM,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAM,EAAE,CAAC,CAAC,CAAC,CAAM,CAAC,CAAC,CAAC;YACxG,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3B,CAAC;IAED,sEAAsE;IACtE,MAAM,CAAC,CAAM,EAAE,CAAM;QACnB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,EAAE,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;QAC/E,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAM,CAAC,CAAC;QACtD,MAAM,QAAQ,GAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACxG,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;YACpC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAClC,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAM,EAAE,OAAO,CAAC,CAAC;YACnE,QAAQ,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,SAAS,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAC5C,SAAS,CAAC,CAAC,GAAG,KAAK,CAAM,EACzB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAM,CAAC,CAC1C,CAAC;YACJ,CAAC;YACD,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,SAAS,EAAE,CAAC;IACtD,CAAC;IAED,MAAM,CAAC,CAAM,EAAE,CAAM;QACnB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;IACpC,CAAC;IAED,GAAG,CAAC,CAAM,EAAE,CAAM;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IACrC,CAAC;IAED,+FAA+F;IACvF,SAAS,CAAC,CAAM;QACtB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAM,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,iEAAiE;IACjE,GAAG,CAAC,CAAM,EAAE,CAAM;QAChB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,MAAM,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxC,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,SAAS,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED;;;;;;OAMG;IACH,UAAU,CAAC,CAAM;QACf,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,oDAAoD;QACjF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAC9C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAM,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACH,cAAc,CAAC,CAAM;QACnB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,sDAAsD;QACnF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAC9C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAM,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;IAED,mFAAmF;IACnF,QAAQ,CAAC,CAAM,EAAE,CAAI;QACnB,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAM,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,CAAM,EAAE,CAAM;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,OAAO,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAM,CAAC,CAAC,CAAC;IAC/F,CAAC;IAED,QAAQ,CAAC,CAAM,EAAE,QAAQ,GAAG,GAAG;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QACrC,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAM,CAAC;YAC1B,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC9D,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;iBAC3B,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC,CAAC;;gBAC5C,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW,EAAE,QAAQ,GAAG,GAAG;IACzD,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAClC,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IACzB,MAAM,KAAK,GAAG,CAAC;SACZ,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC;SACnB,KAAK,CAAC,GAAG,CAAC;SACV,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IAC3B,MAAM,CAAC,GAAa,EAAE,CAAC;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAY,CAAC;QACjB,IAAI,GAAW,CAAC;QAChB,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAClC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;YACd,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACpB,GAAG,GAAG,CAAC,CAAC;QACV,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACtD,IAAI,GAAG,QAAQ,KAAK,EAAE,IAAI,QAAQ,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC1F,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC9C,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;QACD,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;IAChC,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS;YAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpE,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAgB,EAAE,QAAQ,GAAG,GAAG,EAAE,UAAU,GAAG,IAAI;IACpF,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,CAAS,EAAU,EAAE;QAC/C,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,GAAG,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC1C,OAAO,GAAG,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;IACpC,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,UAAU;QACxB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;QACxE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACvD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACpE,CAAC"}

package/dist/Quaternion.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Quaternion — a number of the form `w + x·i + y·j + z·k`, the four-dimensional
+ * division algebra. Extends the idea of {@link ComplexNumber} and is the
+ * standard tool for representing and composing 3D rotations.
+ */
+export declare class Quaternion {
+    readonly w: number;
+    readonly x: number;
+    readonly y: number;
+    readonly z: number;
+    static readonly Identity: Quaternion;
+    static readonly Zero: Quaternion;
+    constructor(w?: number, x?: number, y?: number, z?: number);
+    add(q: Quaternion): Quaternion;
+    subtract(q: Quaternion): Quaternion;
+    scale(s: number): Quaternion;
+    negate(): Quaternion;
+    /** The Hamilton product (non-commutative). */
+    multiply(q: Quaternion): Quaternion;
+    conjugate(): Quaternion;
+    dot(q: Quaternion): number;
+    get norm(): number;
+    normalize(): Quaternion;
+    /** Multiplicative inverse `q⁻¹ = conj(q) / |q|²`. */
+    inverse(): Quaternion;
+    equals(q: Quaternion): boolean;
+    /** A unit quaternion representing a rotation of `angle` radians about `axis`. */
+    static fromAxisAngle(axis: [number, number, number], angle: number): Quaternion;
+    /** Rotate a 3D vector by this (unit) quaternion, returning `[x, y, z]`. */
+    rotateVector(v: [number, number, number]): [number, number, number];
+    /** The 3×3 rotation matrix (as `number[][]`) for this quaternion. */
+    toRotationMatrix(): number[][];
+    /** Spherical linear interpolation between two unit quaternions. */
+    static slerp(a: Quaternion, b: Quaternion, t: number): Quaternion;
+    toString(): string;
+}
+//# sourceMappingURL=Quaternion.d.ts.map

package/dist/Quaternion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Quaternion.d.ts","sourceRoot":"","sources":["../src/Quaternion.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,qBAAa,UAAU;IACrB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IAEnB,MAAM,CAAC,QAAQ,CAAC,QAAQ,aAA8B;IACtD,MAAM,CAAC,QAAQ,CAAC,IAAI,aAA8B;gBAEtC,CAAC,SAAI,EAAE,CAAC,SAAI,EAAE,CAAC,SAAI,EAAE,CAAC,SAAI;IAOtC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAI9B,QAAQ,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IAInC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,UAAU;IAI5B,MAAM,IAAI,UAAU;IAIpB,8CAA8C;IAC9C,QAAQ,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU;IASnC,SAAS,IAAI,UAAU;IAIvB,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,MAAM;IAI1B,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,SAAS,IAAI,UAAU;IAMvB,qDAAqD;IACrD,OAAO,IAAI,UAAU;IAMrB,MAAM,CAAC,CAAC,EAAE,UAAU,GAAG,OAAO;IAI9B,iFAAiF;IACjF,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,UAAU;IAQ/E,2EAA2E;IAC3E,YAAY,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;IAOnE,qEAAqE;IACrE,gBAAgB,IAAI,MAAM,EAAE,EAAE;IAS9B,mEAAmE;IACnE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,GAAG,UAAU;IAiBjE,QAAQ,IAAI,MAAM;CAGnB"}