@johnhenry/math 0.0.0

package/dist/Geometry.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Geometry — computational geometry on 2D points (`[x, y]` tuples): convex hull,
+ * orientation and intersection predicates, point-in-polygon, distances, polygon
+ * area/centroid, and 2D affine transforms via homogeneous matrices. Complements
+ * the {@link Polygon} class with lower-level, allocation-free primitives.
+ */
+export type Point = [number, number];
+export declare class Geometry {
+    /** The signed area of the triangle `(a, b, c)` (>0 CCW, <0 CW, 0 collinear). */
+    static orientation(a: Point, b: Point, c: Point): number;
+    static distance(a: Point, b: Point): number;
+    /** Distance from point `p` to the segment `a–b`. */
+    static distancePointToSegment(p: Point, a: Point, b: Point): number;
+    /** The convex hull (counter-clockwise) via Andrew's monotone chain. */
+    static convexHull(points: readonly Point[]): Point[];
+    /** Whether segments `p1–p2` and `p3–p4` intersect (endpoints/collinear included). */
+    static segmentsIntersect(p1: Point, p2: Point, p3: Point, p4: Point): boolean;
+    /** The shoelace area of a polygon given by its vertices. */
+    static polygonArea(polygon: readonly Point[]): number;
+    /** The centroid of a set of points (the simple average). */
+    static centroid(points: readonly Point[]): Point;
+    /** Point-in-polygon by the even-odd ray-casting rule. */
+    static pointInPolygon(point: Point, polygon: readonly Point[]): boolean;
+}
+/**
+ * Transform2D — 2D affine transforms as 3×3 homogeneous matrices. Compose them
+ * with {@link Transform2D.multiply} and apply them with {@link Transform2D.apply}.
+ */
+export declare class Transform2D {
+    readonly m: number[][];
+    constructor(m: number[][]);
+    static identity(): Transform2D;
+    static translation(tx: number, ty: number): Transform2D;
+    static scaling(sx: number, sy?: number): Transform2D;
+    static rotation(theta: number): Transform2D;
+    /** Matrix product `this · other` (apply `other` first, then `this`). */
+    multiply(other: Transform2D): Transform2D;
+    /** Apply the transform to a point. */
+    apply(p: Point): Point;
+}
+//# sourceMappingURL=Geometry.d.ts.map

package/dist/Geometry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Geometry.d.ts","sourceRoot":"","sources":["../src/Geometry.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,MAAM,KAAK,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAErC,qBAAa,QAAQ;IACnB,gFAAgF;IAChF,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM;IAIxD,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM;IAI3C,oDAAoD;IACpD,MAAM,CAAC,sBAAsB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM;IAUnE,uEAAuE;IACvE,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,GAAG,KAAK,EAAE;IAqBpD,qFAAqF;IACrF,MAAM,CAAC,iBAAiB,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,GAAG,OAAO;IAkB7E,4DAA4D;IAC5D,MAAM,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,KAAK,EAAE,GAAG,MAAM;IAUrD,4DAA4D;IAC5D,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,GAAG,KAAK;IAWhD,yDAAyD;IACzD,MAAM,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,KAAK,EAAE,GAAG,OAAO;CAWxE;AAED;;;GAGG;AACH,qBAAa,WAAW;IACtB,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;gBAEX,CAAC,EAAE,MAAM,EAAE,EAAE;IAIzB,MAAM,CAAC,QAAQ,IAAI,WAAW;IAQ9B,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,WAAW;IAQvD,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,GAAE,MAAW,GAAG,WAAW;IAQxD,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW;IAU3C,wEAAwE;IACxE,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,WAAW;IAYzC,sCAAsC;IACtC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK;CAKvB"}

package/dist/Geometry.js

@@ -0,0 +1,167 @@
+/**
+ * Geometry — computational geometry on 2D points (`[x, y]` tuples): convex hull,
+ * orientation and intersection predicates, point-in-polygon, distances, polygon
+ * area/centroid, and 2D affine transforms via homogeneous matrices. Complements
+ * the {@link Polygon} class with lower-level, allocation-free primitives.
+ */
+export class Geometry {
+    /** The signed area of the triangle `(a, b, c)` (>0 CCW, <0 CW, 0 collinear). */
+    static orientation(a, b, c) {
+        return (b[0] - a[0]) * (c[1] - a[1]) - (b[1] - a[1]) * (c[0] - a[0]);
+    }
+    static distance(a, b) {
+        return Math.hypot(a[0] - b[0], a[1] - b[1]);
+    }
+    /** Distance from point `p` to the segment `a–b`. */
+    static distancePointToSegment(p, a, b) {
+        const dx = b[0] - a[0];
+        const dy = b[1] - a[1];
+        const len2 = dx * dx + dy * dy;
+        if (len2 === 0)
+            return Geometry.distance(p, a);
+        let t = ((p[0] - a[0]) * dx + (p[1] - a[1]) * dy) / len2;
+        t = Math.max(0, Math.min(1, t));
+        return Geometry.distance(p, [a[0] + t * dx, a[1] + t * dy]);
+    }
+    /** The convex hull (counter-clockwise) via Andrew's monotone chain. */
+    static convexHull(points) {
+        const pts = [...points].sort((p, q) => p[0] - q[0] || p[1] - q[1]);
+        if (pts.length <= 2)
+            return pts;
+        const cross = (o, a, b) => Geometry.orientation(o, a, b);
+        const lower = [];
+        for (const p of pts) {
+            while (lower.length >= 2 && cross(lower[lower.length - 2], lower[lower.length - 1], p) <= 0)
+                lower.pop();
+            lower.push(p);
+        }
+        const upper = [];
+        for (let i = pts.length - 1; i >= 0; i--) {
+            const p = pts[i];
+            while (upper.length >= 2 && cross(upper[upper.length - 2], upper[upper.length - 1], p) <= 0)
+                upper.pop();
+            upper.push(p);
+        }
+        lower.pop();
+        upper.pop();
+        return lower.concat(upper);
+    }
+    /** Whether segments `p1–p2` and `p3–p4` intersect (endpoints/collinear included). */
+    static segmentsIntersect(p1, p2, p3, p4) {
+        const d1 = Geometry.orientation(p3, p4, p1);
+        const d2 = Geometry.orientation(p3, p4, p2);
+        const d3 = Geometry.orientation(p1, p2, p3);
+        const d4 = Geometry.orientation(p1, p2, p4);
+        const onSeg = (a, b, p) => Math.min(a[0], b[0]) <= p[0] &&
+            p[0] <= Math.max(a[0], b[0]) &&
+            Math.min(a[1], b[1]) <= p[1] &&
+            p[1] <= Math.max(a[1], b[1]);
+        if (((d1 > 0 && d2 < 0) || (d1 < 0 && d2 > 0)) && ((d3 > 0 && d4 < 0) || (d3 < 0 && d4 > 0)))
+            return true;
+        if (d1 === 0 && onSeg(p3, p4, p1))
+            return true;
+        if (d2 === 0 && onSeg(p3, p4, p2))
+            return true;
+        if (d3 === 0 && onSeg(p1, p2, p3))
+            return true;
+        if (d4 === 0 && onSeg(p1, p2, p4))
+            return true;
+        return false;
+    }
+    /** The shoelace area of a polygon given by its vertices. */
+    static polygonArea(polygon) {
+        let sum = 0;
+        for (let i = 0; i < polygon.length; i++) {
+            const a = polygon[i];
+            const b = polygon[(i + 1) % polygon.length];
+            sum += a[0] * b[1] - b[0] * a[1];
+        }
+        return Math.abs(sum) / 2;
+    }
+    /** The centroid of a set of points (the simple average). */
+    static centroid(points) {
+        const n = points.length || 1;
+        let sx = 0;
+        let sy = 0;
+        for (const [x, y] of points) {
+            sx += x;
+            sy += y;
+        }
+        return [sx / n, sy / n];
+    }
+    /** Point-in-polygon by the even-odd ray-casting rule. */
+    static pointInPolygon(point, polygon) {
+        const [px, py] = point;
+        let inside = false;
+        const n = polygon.length;
+        for (let i = 0, j = n - 1; i < n; j = i++) {
+            const [xi, yi] = polygon[i];
+            const [xj, yj] = polygon[j];
+            if (yi > py !== yj > py && px < ((xj - xi) * (py - yi)) / (yj - yi) + xi)
+                inside = !inside;
+        }
+        return inside;
+    }
+}
+/**
+ * Transform2D — 2D affine transforms as 3×3 homogeneous matrices. Compose them
+ * with {@link Transform2D.multiply} and apply them with {@link Transform2D.apply}.
+ */
+export class Transform2D {
+    m;
+    constructor(m) {
+        this.m = m;
+    }
+    static identity() {
+        return new Transform2D([
+            [1, 0, 0],
+            [0, 1, 0],
+            [0, 0, 1],
+        ]);
+    }
+    static translation(tx, ty) {
+        return new Transform2D([
+            [1, 0, tx],
+            [0, 1, ty],
+            [0, 0, 1],
+        ]);
+    }
+    static scaling(sx, sy = sx) {
+        return new Transform2D([
+            [sx, 0, 0],
+            [0, sy, 0],
+            [0, 0, 1],
+        ]);
+    }
+    static rotation(theta) {
+        const c = Math.cos(theta);
+        const s = Math.sin(theta);
+        return new Transform2D([
+            [c, -s, 0],
+            [s, c, 0],
+            [0, 0, 1],
+        ]);
+    }
+    /** Matrix product `this · other` (apply `other` first, then `this`). */
+    multiply(other) {
+        const a = this.m;
+        const b = other.m;
+        const out = [
+            [0, 0, 0],
+            [0, 0, 0],
+            [0, 0, 0],
+        ];
+        for (let i = 0; i < 3; i++)
+            for (let j = 0; j < 3; j++)
+                for (let k = 0; k < 3; k++)
+                    out[i][j] += a[i][k] * b[k][j];
+        return new Transform2D(out);
+    }
+    /** Apply the transform to a point. */
+    apply(p) {
+        const [x, y] = p;
+        const m = this.m;
+        return [m[0][0] * x + m[0][1] * y + m[0][2], m[1][0] * x + m[1][1] * y + m[1][2]];
+    }
+}
+//# sourceMappingURL=Geometry.js.map

package/dist/Geometry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Geometry.js","sourceRoot":"","sources":["../src/Geometry.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,MAAM,OAAO,QAAQ;IACnB,gFAAgF;IAChF,MAAM,CAAC,WAAW,CAAC,CAAQ,EAAE,CAAQ,EAAE,CAAQ;QAC7C,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,CAAQ,EAAE,CAAQ;QAChC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,oDAAoD;IACpD,MAAM,CAAC,sBAAsB,CAAC,CAAQ,EAAE,CAAQ,EAAE,CAAQ;QACxD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAC/B,IAAI,IAAI,KAAK,CAAC;YAAE,OAAO,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;QACzD,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChC,OAAO,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,uEAAuE;IACvE,MAAM,CAAC,UAAU,CAAC,MAAwB;QACxC,MAAM,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,GAAG,CAAC;QAChC,MAAM,KAAK,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAE,CAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAE9E,MAAM,KAAK,GAAY,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,OAAO,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;gBAAE,KAAK,CAAC,GAAG,EAAE,CAAC;YACzG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,MAAM,KAAK,GAAY,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,OAAO,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;gBAAE,KAAK,CAAC,GAAG,EAAE,CAAC;YACzG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QACD,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAED,qFAAqF;IACrF,MAAM,CAAC,iBAAiB,CAAC,EAAS,EAAE,EAAS,EAAE,EAAS,EAAE,EAAS;QACjE,MAAM,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,CAAC,CAAQ,EAAE,CAAQ,EAAE,CAAQ,EAAE,EAAE,CAC7C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,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,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/C,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/C,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/C,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,4DAA4D;IAC5D,MAAM,CAAC,WAAW,CAAC,OAAyB;QAC1C,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;YAC5C,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,4DAA4D;IAC5D,MAAM,CAAC,QAAQ,CAAC,MAAwB;QACtC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;QAC7B,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC;YAC5B,EAAE,IAAI,CAAC,CAAC;YACR,EAAE,IAAI,CAAC,CAAC;QACV,CAAC;QACD,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAC1B,CAAC;IAED,yDAAyD;IACzD,MAAM,CAAC,cAAc,CAAC,KAAY,EAAE,OAAyB;QAC3D,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC;QACvB,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5B,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;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,WAAW;IACb,CAAC,CAAa;IAEvB,YAAY,CAAa;QACvB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IAED,MAAM,CAAC,QAAQ;QACb,OAAO,IAAI,WAAW,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACV,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU;QACvC,OAAO,IAAI,WAAW,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACV,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACV,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACV,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,EAAU,EAAE,KAAa,EAAE;QACxC,OAAO,IAAI,WAAW,CAAC;YACrB,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YACV,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACV,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACV,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,KAAa;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,IAAI,WAAW,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACV,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACV,CAAC,CAAC;IACL,CAAC;IAED,wEAAwE;IACxE,QAAQ,CAAC,KAAkB;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAClB,MAAM,GAAG,GAAG;YACV,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACT,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACV,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnH,OAAO,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,sCAAsC;IACtC,KAAK,CAAC,CAAQ;QACZ,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC;CACF"}

package/dist/Graph.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Graph — a weighted (optionally directed) graph with the standard algorithms:
+ * breadth/depth-first traversal, Dijkstra shortest paths, minimum spanning tree
+ * (Kruskal), topological sort, connected components, cycle detection, and
+ * conversion to an adjacency matrix (feeding {@link MatrixMath}) with
+ * Floyd-Warshall all-pairs distances.
+ */
+export interface Edge<T> {
+    from: T;
+    to: T;
+    weight: number;
+}
+export declare class Graph<T = string | number> {
+    readonly directed: boolean;
+    private readonly adjacency;
+    constructor(directed?: boolean);
+    addVertex(v: T): this;
+    addEdge(u: T, v: T, weight?: number): this;
+    vertices(): T[];
+    neighbors(v: T): T[];
+    edges(): Array<Edge<T>>;
+    /** Breadth-first traversal order from `start`. */
+    bfs(start: T): T[];
+    /** Depth-first traversal order from `start`. */
+    dfs(start: T): T[];
+    /**
+     * Shared Dijkstra core used by {@link dijkstra} and {@link shortestPath}:
+     * a binary min-heap keyed on tentative distance replaces the O(V) linear
+     * scan for "closest unvisited vertex", bringing the algorithm from
+     * O(V²) down to the standard O((V+E) log V). Stale heap entries (pushed
+     * when a shorter distance was later found) are skipped lazily instead of
+     * removed, which is cheaper than a decrease-key operation.
+     */
+    private runDijkstra;
+    /** Dijkstra shortest-path distances from `start` (non-negative weights). */
+    dijkstra(start: T): Map<T, number>;
+    /** The shortest path from `start` to `end` as `{ distance, path }`. */
+    shortestPath(start: T, end: T): {
+        distance: number;
+        path: T[];
+    };
+    /** Connected components (undirected graphs). */
+    connectedComponents(): T[][];
+    /** Topological order for a DAG, or `null` if the graph has a cycle. */
+    topologicalSort(): T[] | null;
+    /** True when the graph contains a cycle. */
+    hasCycle(): boolean;
+    /** Minimum spanning tree (Kruskal) of an undirected graph, as a list of edges. */
+    minimumSpanningTree(): Array<Edge<T>>;
+    /** Adjacency matrix (rows/cols follow the returned `order`; `Infinity` = no edge). */
+    toAdjacencyMatrix(): {
+        matrix: number[][];
+        order: T[];
+    };
+    /**
+     * Strongly connected components (Tarjan's algorithm, single DFS pass,
+     * O(V+E)) — maximal vertex sets where every vertex can reach every
+     * other via directed edges. On an undirected graph this always reduces
+     * to {@link connectedComponents} (every edge is bidirectional, so
+     * "strongly connected" and "connected" coincide) — `connectedComponents`
+     * is the more direct choice there; this method exists for directed
+     * graphs, e.g. pruning a compatibility digraph down to the vertices
+     * that can actually participate in a cycle.
+     */
+    stronglyConnectedComponents(): T[][];
+    /** All-pairs shortest distances by Floyd-Warshall. */
+    floydWarshall(): {
+        distances: number[][];
+        order: T[];
+    };
+}
+//# sourceMappingURL=Graph.d.ts.map

package/dist/Graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../src/Graph.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,WAAW,IAAI,CAAC,CAAC;IACrB,IAAI,EAAE,CAAC,CAAC;IACR,EAAE,EAAE,CAAC,CAAC;IACN,MAAM,EAAE,MAAM,CAAC;CAChB;AAoDD,qBAAa,KAAK,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM;IACpC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAgC;gBAE9C,QAAQ,UAAQ;IAI5B,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI;IAKrB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,SAAI,GAAG,IAAI;IAOrC,QAAQ,IAAI,CAAC,EAAE;IAIf,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;IAIpB,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAgBvB,kDAAkD;IAClD,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE;IAgBlB,gDAAgD;IAChD,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE;IAYlB;;;;;;;OAOG;IACH,OAAO,CAAC,WAAW;IA2BnB,4EAA4E;IAC5E,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC;IAIlC,uEAAuE;IACvE,YAAY,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,CAAC,EAAE,CAAA;KAAE;IAY/D,gDAAgD;IAChD,mBAAmB,IAAI,CAAC,EAAE,EAAE;IAY5B,uEAAuE;IACvE,eAAe,IAAI,CAAC,EAAE,GAAG,IAAI;IAiB7B,4CAA4C;IAC5C,QAAQ,IAAI,OAAO;IAgBnB,kFAAkF;IAClF,mBAAmB,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAsBrC,sFAAsF;IACtF,iBAAiB,IAAI;QAAE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;QAAC,KAAK,EAAE,CAAC,EAAE,CAAA;KAAE;IAavD;;;;;;;;;OASG;IACH,2BAA2B,IAAI,CAAC,EAAE,EAAE;IAwCpC,sDAAsD;IACtD,aAAa,IAAI;QAAE,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;QAAC,KAAK,EAAE,CAAC,EAAE,CAAA;KAAE;CASvD"}

package/dist/Graph.js

@@ -0,0 +1,337 @@
+/**
+ * Graph — a weighted (optionally directed) graph with the standard algorithms:
+ * breadth/depth-first traversal, Dijkstra shortest paths, minimum spanning tree
+ * (Kruskal), topological sort, connected components, cycle detection, and
+ * conversion to an adjacency matrix (feeding {@link MatrixMath}) with
+ * Floyd-Warshall all-pairs distances.
+ */
+/**
+ * Minimal binary min-heap keyed by a numeric priority, used by
+ * {@link Graph.dijkstra} / {@link Graph.shortestPath} to pick the next
+ * closest unvisited vertex in O(log n) instead of a linear scan. Supports
+ * duplicate/stale entries (an item can be pushed more than once when its
+ * distance improves); the caller is expected to skip entries whose stored
+ * priority no longer matches the current best-known distance ("lazy
+ * deletion"), which is cheaper than a decrease-key operation.
+ */
+class MinHeap {
+    items = [];
+    get size() {
+        return this.items.length;
+    }
+    push(value, priority) {
+        this.items.push({ priority, value });
+        let i = this.items.length - 1;
+        while (i > 0) {
+            const parent = (i - 1) >> 1;
+            if (this.items[parent].priority <= this.items[i].priority)
+                break;
+            [this.items[parent], this.items[i]] = [this.items[i], this.items[parent]];
+            i = parent;
+        }
+    }
+    pop() {
+        const top = this.items[0];
+        if (top === undefined)
+            return undefined;
+        const last = this.items.pop();
+        if (this.items.length) {
+            this.items[0] = last;
+            let i = 0;
+            const n = this.items.length;
+            for (;;) {
+                const left = 2 * i + 1;
+                const right = 2 * i + 2;
+                let smallest = i;
+                if (left < n && this.items[left].priority < this.items[smallest].priority)
+                    smallest = left;
+                if (right < n && this.items[right].priority < this.items[smallest].priority)
+                    smallest = right;
+                if (smallest === i)
+                    break;
+                [this.items[smallest], this.items[i]] = [this.items[i], this.items[smallest]];
+                i = smallest;
+            }
+        }
+        return top;
+    }
+}
+export class Graph {
+    directed;
+    adjacency = new Map();
+    constructor(directed = false) {
+        this.directed = directed;
+    }
+    addVertex(v) {
+        if (!this.adjacency.has(v))
+            this.adjacency.set(v, new Map());
+        return this;
+    }
+    addEdge(u, v, weight = 1) {
+        this.addVertex(u).addVertex(v);
+        this.adjacency.get(u).set(v, weight);
+        if (!this.directed)
+            this.adjacency.get(v).set(u, weight);
+        return this;
+    }
+    vertices() {
+        return [...this.adjacency.keys()];
+    }
+    neighbors(v) {
+        return [...(this.adjacency.get(v)?.keys() ?? [])];
+    }
+    edges() {
+        const out = [];
+        const seen = new Set();
+        for (const [from, nbrs] of this.adjacency) {
+            for (const [to, weight] of nbrs) {
+                if (!this.directed) {
+                    const key = JSON.stringify([from, to].map(String).sort());
+                    if (seen.has(key))
+                        continue;
+                    seen.add(key);
+                }
+                out.push({ from, to, weight });
+            }
+        }
+        return out;
+    }
+    /** Breadth-first traversal order from `start`. */
+    bfs(start) {
+        const visited = new Set([start]);
+        const order = [];
+        const queue = [start];
+        while (queue.length) {
+            const v = queue.shift();
+            order.push(v);
+            for (const n of this.neighbors(v))
+                if (!visited.has(n)) {
+                    visited.add(n);
+                    queue.push(n);
+                }
+        }
+        return order;
+    }
+    /** Depth-first traversal order from `start`. */
+    dfs(start) {
+        const visited = new Set();
+        const order = [];
+        const visit = (v) => {
+            visited.add(v);
+            order.push(v);
+            for (const n of this.neighbors(v))
+                if (!visited.has(n))
+                    visit(n);
+        };
+        visit(start);
+        return order;
+    }
+    /**
+     * Shared Dijkstra core used by {@link dijkstra} and {@link shortestPath}:
+     * a binary min-heap keyed on tentative distance replaces the O(V) linear
+     * scan for "closest unvisited vertex", bringing the algorithm from
+     * O(V²) down to the standard O((V+E) log V). Stale heap entries (pushed
+     * when a shorter distance was later found) are skipped lazily instead of
+     * removed, which is cheaper than a decrease-key operation.
+     */
+    runDijkstra(start) {
+        const dist = new Map();
+        const prev = new Map();
+        for (const v of this.vertices())
+            dist.set(v, Number.POSITIVE_INFINITY);
+        dist.set(start, 0);
+        const visited = new Set();
+        const heap = new MinHeap();
+        heap.push(start, 0);
+        while (heap.size) {
+            const top = heap.pop();
+            const u = top.value;
+            if (visited.has(u))
+                continue;
+            if (top.priority > dist.get(u))
+                continue; // stale entry
+            visited.add(u);
+            for (const [n, w] of this.adjacency.get(u) ?? []) {
+                if (visited.has(n))
+                    continue;
+                const nd = dist.get(u) + w;
+                if (nd < dist.get(n)) {
+                    dist.set(n, nd);
+                    prev.set(n, u);
+                    heap.push(n, nd);
+                }
+            }
+        }
+        return { dist, prev };
+    }
+    /** Dijkstra shortest-path distances from `start` (non-negative weights). */
+    dijkstra(start) {
+        return this.runDijkstra(start).dist;
+    }
+    /** The shortest path from `start` to `end` as `{ distance, path }`. */
+    shortestPath(start, end) {
+        const { dist, prev } = this.runDijkstra(start);
+        if (dist.get(end) === Number.POSITIVE_INFINITY)
+            return { distance: Number.POSITIVE_INFINITY, path: [] };
+        const path = [];
+        let cur = end;
+        while (cur !== undefined) {
+            path.unshift(cur);
+            cur = cur === start ? undefined : prev.get(cur);
+        }
+        return { distance: dist.get(end), path };
+    }
+    /** Connected components (undirected graphs). */
+    connectedComponents() {
+        const seen = new Set();
+        const components = [];
+        for (const v of this.vertices()) {
+            if (seen.has(v))
+                continue;
+            const comp = this.bfs(v);
+            for (const c of comp)
+                seen.add(c);
+            components.push(comp);
+        }
+        return components;
+    }
+    /** Topological order for a DAG, or `null` if the graph has a cycle. */
+    topologicalSort() {
+        const inDegree = new Map();
+        for (const v of this.vertices())
+            inDegree.set(v, 0);
+        for (const [, nbrs] of this.adjacency)
+            for (const [to] of nbrs)
+                inDegree.set(to, inDegree.get(to) + 1);
+        const queue = this.vertices().filter((v) => inDegree.get(v) === 0);
+        const order = [];
+        while (queue.length) {
+            const v = queue.shift();
+            order.push(v);
+            for (const n of this.neighbors(v)) {
+                inDegree.set(n, inDegree.get(n) - 1);
+                if (inDegree.get(n) === 0)
+                    queue.push(n);
+            }
+        }
+        return order.length === this.vertices().length ? order : null;
+    }
+    /** True when the graph contains a cycle. */
+    hasCycle() {
+        if (this.directed)
+            return this.topologicalSort() === null;
+        const seen = new Set();
+        const visit = (v, parent) => {
+            seen.add(v);
+            for (const n of this.neighbors(v)) {
+                if (!seen.has(n)) {
+                    if (visit(n, v))
+                        return true;
+                }
+                else if (n !== parent)
+                    return true;
+            }
+            return false;
+        };
+        for (const v of this.vertices())
+            if (!seen.has(v) && visit(v, null))
+                return true;
+        return false;
+    }
+    /** Minimum spanning tree (Kruskal) of an undirected graph, as a list of edges. */
+    minimumSpanningTree() {
+        const parent = new Map();
+        const find = (x) => {
+            while (parent.get(x) !== x) {
+                parent.set(x, parent.get(parent.get(x)));
+                x = parent.get(x);
+            }
+            return x;
+        };
+        for (const v of this.vertices())
+            parent.set(v, v);
+        const mst = [];
+        for (const e of this.edges().sort((a, b) => a.weight - b.weight)) {
+            const ra = find(e.from);
+            const rb = find(e.to);
+            if (ra !== rb) {
+                parent.set(ra, rb);
+                mst.push(e);
+            }
+        }
+        return mst;
+    }
+    /** Adjacency matrix (rows/cols follow the returned `order`; `Infinity` = no edge). */
+    toAdjacencyMatrix() {
+        const order = this.vertices();
+        const index = new Map(order.map((v, i) => [v, i]));
+        const n = order.length;
+        const matrix = Array.from({ length: n }, (_, i) => Array.from({ length: n }, (_, j) => (i === j ? 0 : Number.POSITIVE_INFINITY)));
+        for (const [from, nbrs] of this.adjacency) {
+            for (const [to, w] of nbrs)
+                matrix[index.get(from)][index.get(to)] = w;
+        }
+        return { matrix, order };
+    }
+    /**
+     * Strongly connected components (Tarjan's algorithm, single DFS pass,
+     * O(V+E)) — maximal vertex sets where every vertex can reach every
+     * other via directed edges. On an undirected graph this always reduces
+     * to {@link connectedComponents} (every edge is bidirectional, so
+     * "strongly connected" and "connected" coincide) — `connectedComponents`
+     * is the more direct choice there; this method exists for directed
+     * graphs, e.g. pruning a compatibility digraph down to the vertices
+     * that can actually participate in a cycle.
+     */
+    stronglyConnectedComponents() {
+        let index = 0;
+        const indices = new Map();
+        const lowlink = new Map();
+        const onStack = new Set();
+        const stack = [];
+        const components = [];
+        const strongconnect = (v) => {
+            indices.set(v, index);
+            lowlink.set(v, index);
+            index++;
+            stack.push(v);
+            onStack.add(v);
+            for (const w of this.neighbors(v)) {
+                if (!indices.has(w)) {
+                    strongconnect(w);
+                    lowlink.set(v, Math.min(lowlink.get(v), lowlink.get(w)));
+                }
+                else if (onStack.has(w)) {
+                    lowlink.set(v, Math.min(lowlink.get(v), indices.get(w)));
+                }
+            }
+            if (lowlink.get(v) === indices.get(v)) {
+                const component = [];
+                let w;
+                do {
+                    w = stack.pop();
+                    onStack.delete(w);
+                    component.push(w);
+                } while (w !== v);
+                components.push(component);
+            }
+        };
+        for (const v of this.vertices())
+            if (!indices.has(v))
+                strongconnect(v);
+        return components;
+    }
+    /** All-pairs shortest distances by Floyd-Warshall. */
+    floydWarshall() {
+        const { matrix, order } = this.toAdjacencyMatrix();
+        const n = order.length;
+        const d = matrix.map((row) => [...row]);
+        for (let k = 0; k < n; k++)
+            for (let i = 0; i < n; i++)
+                for (let j = 0; j < n; j++)
+                    if (d[i][k] + d[k][j] < d[i][j])
+                        d[i][j] = d[i][k] + d[k][j];
+        return { distances: d, order };
+    }
+}
+//# sourceMappingURL=Graph.js.map

package/dist/Graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Graph.js","sourceRoot":"","sources":["../src/Graph.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAQH;;;;;;;;GAQG;AACH,MAAM,OAAO;IACM,KAAK,GAA0C,EAAE,CAAC;IAEnE,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,IAAI,CAAC,KAAQ,EAAE,QAAgB;QAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ;gBAAE,MAAM;YACjE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1E,CAAC,GAAG,MAAM,CAAC;QACb,CAAC;IACH,CAAC;IAED,GAAG;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAoC,CAAC;QAChE,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAC5B,SAAS,CAAC;gBACR,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACvB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACxB,IAAI,QAAQ,GAAG,CAAC,CAAC;gBACjB,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,QAAQ;oBAAE,QAAQ,GAAG,IAAI,CAAC;gBAC3F,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,QAAQ;oBAAE,QAAQ,GAAG,KAAK,CAAC;gBAC9F,IAAI,QAAQ,KAAK,CAAC;oBAAE,MAAM;gBAC1B,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC9E,CAAC,GAAG,QAAQ,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAED,MAAM,OAAO,KAAK;IACP,QAAQ,CAAU;IACV,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;IAE1D,YAAY,QAAQ,GAAG,KAAK;QAC1B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,SAAS,CAAC,CAAI;QACZ,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,CAAI,EAAE,CAAI,EAAE,MAAM,GAAG,CAAC;QAC5B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAoB,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACzD,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAoB,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC7E,OAAO,IAAI,CAAC;IACd,CAAC;IAED,QAAQ;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,SAAS,CAAC,CAAI;QACZ,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,KAAK;QACH,MAAM,GAAG,GAAmB,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBAChC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACnB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC1D,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;wBAAE,SAAS;oBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,CAAC;gBACD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,kDAAkD;IAClD,GAAG,CAAC,KAAQ;QACV,MAAM,OAAO,GAAG,IAAI,GAAG,CAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACpC,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,MAAM,KAAK,GAAQ,CAAC,KAAK,CAAC,CAAC;QAC3B,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAO,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChB,CAAC;QACL,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,gDAAgD;IAChD,GAAG,CAAC,KAAQ;QACV,MAAM,OAAO,GAAG,IAAI,GAAG,EAAK,CAAC;QAC7B,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,CAAC,CAAI,EAAE,EAAE;YACrB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;gBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC,CAAC;QACF,KAAK,CAAC,KAAK,CAAC,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACK,WAAW,CAAC,KAAQ;QAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAQ,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACvE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACnB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAK,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,OAAO,EAAK,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;YACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAoC,CAAC;YACzD,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;YACpB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC7B,IAAI,GAAG,CAAC,QAAQ,GAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAY;gBAAE,SAAS,CAAC,cAAc;YACpE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACf,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;gBACjD,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC7B,MAAM,EAAE,GAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAY,GAAG,CAAC,CAAC;gBACvC,IAAI,EAAE,GAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAY,EAAE,CAAC;oBACjC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBAChB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACf,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACxB,CAAC;IAED,4EAA4E;IAC5E,QAAQ,CAAC,KAAQ;QACf,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;IACtC,CAAC;IAED,uEAAuE;IACvE,YAAY,CAAC,KAAQ,EAAE,GAAM;QAC3B,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,MAAM,CAAC,iBAAiB;YAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,iBAAiB,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;QACxG,MAAM,IAAI,GAAQ,EAAE,CAAC;QACrB,IAAI,GAAG,GAAkB,GAAG,CAAC;QAC7B,OAAO,GAAG,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAClB,GAAG,GAAG,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAW,EAAE,IAAI,EAAE,CAAC;IACrD,CAAC;IAED,gDAAgD;IAChD,mBAAmB;QACjB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;QAC1B,MAAM,UAAU,GAAU,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC;YAChC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,uEAAuE;IACvE,eAAe;QACb,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAa,CAAC;QACtC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpD,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS;YAAE,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,IAAI;gBAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAY,GAAG,CAAC,CAAC,CAAC;QACnH,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACnE,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAO,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAY,GAAG,CAAC,CAAC,CAAC;gBACjD,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IAChE,CAAC;IAED,4CAA4C;IAC5C,QAAQ;QACN,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,IAAI,CAAC;QAC1D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,CAAI,EAAE,MAAgB,EAAW,EAAE;YAChD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjB,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;wBAAE,OAAO,IAAI,CAAC;gBAC/B,CAAC;qBAAM,IAAI,CAAC,KAAK,MAAM;oBAAE,OAAO,IAAI,CAAC;YACvC,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;QACjF,OAAO,KAAK,CAAC;IACf,CAAC;IAED,kFAAkF;IAClF,mBAAmB;QACjB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAQ,CAAC;QAC/B,MAAM,IAAI,GAAG,CAAC,CAAI,EAAK,EAAE;YACvB,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAM,CAAM,CAAC,CAAC;gBACnD,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAM,CAAC;YACzB,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,GAAG,GAAmB,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACjE,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtB,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;gBACd,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACnB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,sFAAsF;IACtF,iBAAiB;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAChD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAC9E,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI;gBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAW,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAW,CAAC,GAAG,CAAC,CAAC;QAC7F,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED;;;;;;;;;OASG;IACH,2BAA2B;QACzB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,OAAO,GAAG,IAAI,GAAG,EAAa,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAa,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAK,CAAC;QAC7B,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,MAAM,UAAU,GAAU,EAAE,CAAC;QAE7B,MAAM,aAAa,GAAG,CAAC,CAAI,EAAQ,EAAE;YACnC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACtB,KAAK,EAAE,CAAC;YACR,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAEf,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACpB,aAAa,CAAC,CAAC,CAAC,CAAC;oBACjB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAW,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAW,CAAC,CAAC,CAAC;gBAC/E,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAW,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAW,CAAC,CAAC,CAAC;gBAC/E,CAAC;YACH,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtC,MAAM,SAAS,GAAQ,EAAE,CAAC;gBAC1B,IAAI,CAAI,CAAC;gBACT,GAAG,CAAC;oBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAO,CAAC;oBACrB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAClB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;gBAClB,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QACvE,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,sDAAsD;IACtD,aAAa;QACX,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACnD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7F,OAAO,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;IACjC,CAAC;CACF"}