digital-boardgame-framework 0.8.2 → 0.9.1

package/dist/core/geo.d.ts

@@ -0,0 +1,150 @@
+export interface Point {
+    x: number;
+    y: number;
+}
+/** A simple closed ring. First point need not repeat the last. */
+export type Polygon = Point[];
+export interface BBox {
+    minX: number;
+    minY: number;
+    maxX: number;
+    maxY: number;
+}
+export declare function boundingBox(polygon: Polygon): BBox;
+/** Signed area (shoelace). Positive for counter-clockwise rings. */
+export declare function signedArea(polygon: Polygon): number;
+export declare function area(polygon: Polygon): number;
+/** Area-weighted polygon centroid. NOTE: for a concave shape this can fall
+ *  outside the polygon — do not use it to anchor tokens. Use
+ *  poleOfInaccessibility instead. Kept for comparison / degenerate fallback. */
+export declare function centroid(polygon: Polygon): Point;
+export declare function pointInPolygon(point: Point, polygon: Polygon): boolean;
+/** Signed distance from a point to the polygon boundary: positive inside,
+ *  negative outside, magnitude = distance to the nearest edge. */
+export declare function signedDistanceToPolygon(point: Point, polygon: Polygon): number;
+export interface PoleResult {
+    /** The anchor point. */
+    point: Point;
+    /** Radius of the largest circle centred at `point` that fits inside the
+     *  polygon — the natural size budget for a token stack before it bleeds. */
+    clearance: number;
+}
+/** The interior point farthest from any edge — the "visual centre" used for map
+ *  labels — together with its clearance (the largest inscribed-circle radius at
+ *  that point). Always inside the polygon (for a valid simple polygon) and in
+ *  its thickest part. This is the correct anchor for a token cluster.
+ *
+ *  `precision` is in COORDINATE UNITS: smaller = more accurate, slower. The
+ *  default 1.0 assumes pixel-scale coordinates (≈ one pixel). For normalized
+ *  0..1 polygons, 1.0 is larger than the whole shape and the search won't
+ *  subdivide — pass ~1e-3 instead. */
+export declare function poleOfInaccessibilityWithClearance(polygon: Polygon, precision?: number): PoleResult;
+/** The anchor point only. See poleOfInaccessibilityWithClearance for the
+ *  clearance radius (and the `precision` note — for normalized 0..1 coordinates
+ *  pass ~1e-3, not the pixel-scale default of 1.0). */
+export declare function poleOfInaccessibility(polygon: Polygon, precision?: number): Point;
+export interface LayoutOptions {
+    /** Radius of one token, in coordinate units. */
+    tokenRadius: number;
+    /** Extra spacing between adjacent tokens (default tokenRadius * 0.3). */
+    gap?: number;
+    /** Smallest scale to shrink the cluster to before collapsing to a stack
+     *  (default 0.4). */
+    minScale?: number;
+    /** Precision passed to poleOfInaccessibility (default 1.0). For normalized
+     *  0..1 coordinates pass ~1e-3, not the pixel-scale default. */
+    precision?: number;
+    /** Precomputed anchor — skip the pole-of-inaccessibility pass. Board geometry
+     *  is static, so a renderer can compute the anchor once per region and pass it
+     *  on every re-layout instead of recomputing it each frame. */
+    anchor?: Point;
+}
+export interface TokenLayout {
+    /** The polygon's visual centre — the cluster anchor / stack location. */
+    anchor: Point;
+    /** One point per token, all inside the polygon. When `stacked` is true this
+     *  holds a single point (the anchor) and the renderer should draw a pile. */
+    points: Point[];
+    /** Scale applied to fit the cluster (1 = full size, smaller = shrunk). */
+    scale: number;
+    /** True when the cluster couldn't fit even at minScale — render a single
+     *  anchored pile with a count badge instead of N separate tokens. */
+    stacked: boolean;
+}
+/** Lay out `count` tokens inside `polygon`, clustered at its visual centre and
+ *  kept within the boundary. Shrinks the cluster to fit; if even the shrunk
+ *  cluster won't fit, returns a single anchored point with `stacked: true` so
+ *  the renderer can draw a pile + count badge. Deterministic. */
+export declare function layoutTokensInPolygon(polygon: Polygon, count: number, opts: LayoutOptions): TokenLayout;
+export declare function toPolygon(pairs: ReadonlyArray<readonly [number, number]>): Polygon;
+export declare function fromPolygon(polygon: Polygon): [number, number][];
+export declare function distance(a: Point, b: Point): number;
+export interface AuditEntry {
+    id: string;
+    polygon: Polygon;
+    count: number;
+}
+export interface AuditResult {
+    regions: number;
+    /** Region ids whose anchor fell outside the polygon (should be empty). */
+    anchorsOutside: string[];
+    /** Total tokens placed outside their polygon (should be 0). */
+    tokenBleed: number;
+    /** Region ids that collapsed to a stacked pile. */
+    stackedPiles: string[];
+    /** Smallest anchor clearance across all regions. */
+    minClearance: number;
+    /** Region id with the smallest clearance. */
+    tightestRegion: string | null;
+}
+/** Headless verification of a whole map's token layout — the CI-able core of the
+ *  per-game audit overlay (the visual page stays per-game; this is the math it
+ *  and CI both call). Lays out each region and checks containment. */
+export declare function auditLayout(entries: AuditEntry[], opts: LayoutOptions): AuditResult;
+/** Approximate intersection-over-union of two polygons via grid sampling over
+ *  the combined bounding box. Robust to concavity (no polygon clipping).
+ *  `samples` is the grid resolution per axis (default 64 → 4096 test points).
+ *  Deterministic. */
+export declare function polygonIoU(a: Polygon, b: Polygon, samples?: number): number;
+export type Edge = [string, string];
+/** Undirected adjacency derived from polygon geometry: two regions are adjacent
+ *  when their boundaries come within `tolerance`. Rough/hand-traced polygons
+ *  rarely share exact edges, so a tolerance is required. O(n²) with a bbox
+ *  pre-filter — fine for a few hundred regions run occasionally (validation, not
+ *  a hot path). Returns sorted, de-duplicated, normalized edges. */
+export declare function adjacencyFromPolygons(polygons: Record<string, Polygon>, tolerance: number): Edge[];
+export interface AdjacencyDiff {
+    shared: Edge[];
+    /** Edges in A but not B. */
+    onlyA: Edge[];
+    /** Edges in B but not A. */
+    onlyB: Edge[];
+}
+/** Set-diff two undirected edge lists (edge endpoint order is normalized). Use
+ *  to compare polygon-derived adjacency against the engine's known adjacency —
+ *  the strongest, roughness-immune validation signal. */
+export declare function diffAdjacency(a: Edge[], b: Edge[]): AdjacencyDiff;
+export interface RegionMatch {
+    a: string;
+    b: string;
+    iou: number;
+    anchorDistance: number;
+}
+export interface RegionMatchResult {
+    matches: RegionMatch[];
+    /** Region ids in A with no B match above minIoU (a split, or missing in B). */
+    unmatchedA: string[];
+    /** Region ids in B never matched (a merge, or extra in B). */
+    unmatchedB: string[];
+}
+/** Match two named polygon sets (e.g. extracted vs a human reference) by best
+ *  IoU. The roughness-tolerant comparison: use it to confirm a 1:1 region
+ *  correspondence and flag merges/splits — NOT to score vertex precision. Greedy
+ *  per A-region. `minIoU` is the matching threshold (default 0.5); keep it low,
+ *  because a rough reference legitimately overlaps a precise extraction at well
+ *  under 1.0. */
+export declare function matchRegions(a: Record<string, Polygon>, b: Record<string, Polygon>, opts?: {
+    minIoU?: number;
+    samples?: number;
+}): RegionMatchResult;
+//# sourceMappingURL=geo.d.ts.map

package/dist/core/geo.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"geo.d.ts","sourceRoot":"","sources":["../../src/core/geo.ts"],"names":[],"mappings":"AASA,MAAM,WAAW,KAAK;IACpB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,kEAAkE;AAClE,MAAM,MAAM,OAAO,GAAG,KAAK,EAAE,CAAC;AAE9B,MAAM,WAAW,IAAI;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd;AAED,wBAAgB,WAAW,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAUlD;AAED,oEAAoE;AACpE,wBAAgB,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAMnD;AAED,wBAAgB,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAE7C;AAED;;gFAEgF;AAChF,wBAAgB,QAAQ,CAAC,OAAO,EAAE,OAAO,GAAG,KAAK,CAkBhD;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAUtE;AAeD;kEACkE;AAClE,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAO9E;AAqDD,MAAM,WAAW,UAAU;IACzB,wBAAwB;IACxB,KAAK,EAAE,KAAK,CAAC;IACb;gFAC4E;IAC5E,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;;;sCAQsC;AACtC,wBAAgB,kCAAkC,CAChD,OAAO,EAAE,OAAO,EAChB,SAAS,SAAM,GACd,UAAU,CAgCZ;AAED;;uDAEuD;AACvD,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,SAAM,GAAG,KAAK,CAE9E;AAID,MAAM,WAAW,aAAa;IAC5B,gDAAgD;IAChD,WAAW,EAAE,MAAM,CAAC;IACpB,yEAAyE;IACzE,GAAG,CAAC,EAAE,MAAM,CAAC;IACb;yBACqB;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;oEACgE;IAChE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;mEAE+D;IAC/D,MAAM,CAAC,EAAE,KAAK,CAAC;CAChB;AAED,MAAM,WAAW,WAAW;IAC1B,yEAAyE;IACzE,MAAM,EAAE,KAAK,CAAC;IACd;iFAC6E;IAC7E,MAAM,EAAE,KAAK,EAAE,CAAC;IAChB,0EAA0E;IAC1E,KAAK,EAAE,MAAM,CAAC;IACd;yEACqE;IACrE,OAAO,EAAE,OAAO,CAAC;CAClB;AA0BD;;;iEAGiE;AACjE,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,OAAO,EAChB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,aAAa,GAClB,WAAW,CAqBb;AAOD,wBAAgB,SAAS,CAAC,KAAK,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,OAAO,CAElF;AAED,wBAAgB,WAAW,CAAC,OAAO,EAAE,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAEhE;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,GAAG,MAAM,CAEnD;AAID,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,CAAC;IAChB,0EAA0E;IAC1E,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,+DAA+D;IAC/D,UAAU,EAAE,MAAM,CAAC;IACnB,mDAAmD;IACnD,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,oDAAoD;IACpD,YAAY,EAAE,MAAM,CAAC;IACrB,6CAA6C;IAC7C,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;CAC/B;AAED;;sEAEsE;AACtE,wBAAgB,WAAW,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,IAAI,EAAE,aAAa,GAAG,WAAW,CAgCnF;AAgCD;;;qBAGqB;AACrB,wBAAgB,UAAU,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,SAAK,GAAG,MAAM,CAkBvE;AAED,MAAM,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEpC;;;;oEAIoE;AACpE,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACjC,SAAS,EAAE,MAAM,GAChB,IAAI,EAAE,CAkBR;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,IAAI,EAAE,CAAC;IACf,4BAA4B;IAC5B,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,4BAA4B;IAC5B,KAAK,EAAE,IAAI,EAAE,CAAC;CACf;AAED;;yDAEyD;AACzD,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,aAAa,CAQjE;AAED,MAAM,WAAW,WAAW;IAC1B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,GAAG,EAAE,MAAM,CAAC;IACZ,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,WAAW,EAAE,CAAC;IACvB,+EAA+E;IAC/E,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,8DAA8D;IAC9D,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED;;;;;iBAKiB;AACjB,wBAAgB,YAAY,CAC1B,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC1B,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC1B,IAAI,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAA;CAAO,GAC/C,iBAAiB,CAkCnB"}

package/dist/core/geo.js

@@ -0,0 +1,419 @@
+// Pure 2D polygon geometry for map games — no DOM, no rendering. Territory
+// polygons live per-game (the data); this module is the shared math that turns a
+// polygon + a token count into where the tokens go, anchored at the polygon's
+// visual centre and kept inside its boundary.
+//
+// Coordinates are in whatever space the caller uses (typically pixels in the map
+// image). Everything here is deterministic — no RNG — so the same state always
+// lays out identically. See docs/territory-polygons-design.md.
+export function boundingBox(polygon) {
+    if (polygon.length === 0)
+        throw new Error('boundingBox: empty polygon');
+    let minX = Infinity, minY = Infinity, maxX = -Infinity, maxY = -Infinity;
+    for (const p of polygon) {
+        if (p.x < minX)
+            minX = p.x;
+        if (p.y < minY)
+            minY = p.y;
+        if (p.x > maxX)
+            maxX = p.x;
+        if (p.y > maxY)
+            maxY = p.y;
+    }
+    return { minX, minY, maxX, maxY };
+}
+/** Signed area (shoelace). Positive for counter-clockwise rings. */
+export function signedArea(polygon) {
+    let sum = 0;
+    for (let i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {
+        sum += (polygon[j].x + polygon[i].x) * (polygon[j].y - polygon[i].y);
+    }
+    return sum / 2;
+}
+export function area(polygon) {
+    return Math.abs(signedArea(polygon));
+}
+/** Area-weighted polygon centroid. NOTE: for a concave shape this can fall
+ *  outside the polygon — do not use it to anchor tokens. Use
+ *  poleOfInaccessibility instead. Kept for comparison / degenerate fallback. */
+export function centroid(polygon) {
+    let cx = 0, cy = 0, a = 0;
+    for (let i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {
+        const cross = polygon[j].x * polygon[i].y - polygon[i].x * polygon[j].y;
+        cx += (polygon[j].x + polygon[i].x) * cross;
+        cy += (polygon[j].y + polygon[i].y) * cross;
+        a += cross;
+    }
+    if (a === 0) {
+        // Degenerate (zero area): fall back to the mean of vertices.
+        const n = polygon.length;
+        return {
+            x: polygon.reduce((s, p) => s + p.x, 0) / n,
+            y: polygon.reduce((s, p) => s + p.y, 0) / n,
+        };
+    }
+    a *= 3;
+    return { x: cx / a, y: cy / a };
+}
+export function pointInPolygon(point, polygon) {
+    let inside = false;
+    for (let i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {
+        const a = polygon[i], b = polygon[j];
+        if ((a.y > point.y) !== (b.y > point.y) &&
+            point.x < ((b.x - a.x) * (point.y - a.y)) / (b.y - a.y) + a.x) {
+            inside = !inside;
+        }
+    }
+    return inside;
+}
+function segmentDistSq(p, a, b) {
+    let x = a.x, y = a.y;
+    let dx = b.x - x, dy = b.y - y;
+    if (dx !== 0 || dy !== 0) {
+        const t = ((p.x - x) * dx + (p.y - y) * dy) / (dx * dx + dy * dy);
+        if (t > 1) {
+            x = b.x;
+            y = b.y;
+        }
+        else if (t > 0) {
+            x += dx * t;
+            y += dy * t;
+        }
+    }
+    dx = p.x - x;
+    dy = p.y - y;
+    return dx * dx + dy * dy;
+}
+/** Signed distance from a point to the polygon boundary: positive inside,
+ *  negative outside, magnitude = distance to the nearest edge. */
+export function signedDistanceToPolygon(point, polygon) {
+    let minSq = Infinity;
+    for (let i = 0, j = polygon.length - 1; i < polygon.length; j = i++) {
+        minSq = Math.min(minSq, segmentDistSq(point, polygon[i], polygon[j]));
+    }
+    const dist = Math.sqrt(minSq);
+    return pointInPolygon(point, polygon) ? dist : -dist;
+}
+function makeCell(x, y, h, polygon) {
+    const d = signedDistanceToPolygon({ x, y }, polygon);
+    return { x, y, h, d, max: d + h * Math.SQRT2 };
+}
+// Binary max-heap keyed on cell.max.
+class CellHeap {
+    items = [];
+    get size() { return this.items.length; }
+    push(c) {
+        const a = this.items;
+        a.push(c);
+        let i = a.length - 1;
+        while (i > 0) {
+            const parent = (i - 1) >> 1;
+            if (a[parent].max >= a[i].max)
+                break;
+            [a[parent], a[i]] = [a[i], a[parent]];
+            i = parent;
+        }
+    }
+    pop() {
+        const a = this.items;
+        const top = a[0];
+        const last = a.pop();
+        if (a.length > 0) {
+            a[0] = last;
+            let i = 0;
+            for (;;) {
+                const l = 2 * i + 1, r = 2 * i + 2;
+                let largest = i;
+                if (l < a.length && a[l].max > a[largest].max)
+                    largest = l;
+                if (r < a.length && a[r].max > a[largest].max)
+                    largest = r;
+                if (largest === i)
+                    break;
+                [a[largest], a[i]] = [a[i], a[largest]];
+                i = largest;
+            }
+        }
+        return top;
+    }
+}
+/** The interior point farthest from any edge — the "visual centre" used for map
+ *  labels — together with its clearance (the largest inscribed-circle radius at
+ *  that point). Always inside the polygon (for a valid simple polygon) and in
+ *  its thickest part. This is the correct anchor for a token cluster.
+ *
+ *  `precision` is in COORDINATE UNITS: smaller = more accurate, slower. The
+ *  default 1.0 assumes pixel-scale coordinates (≈ one pixel). For normalized
+ *  0..1 polygons, 1.0 is larger than the whole shape and the search won't
+ *  subdivide — pass ~1e-3 instead. */
+export function poleOfInaccessibilityWithClearance(polygon, precision = 1.0) {
+    const bb = boundingBox(polygon);
+    const width = bb.maxX - bb.minX;
+    const height = bb.maxY - bb.minY;
+    const cellSize = Math.min(width, height);
+    if (cellSize === 0)
+        return { point: { x: bb.minX, y: bb.minY }, clearance: 0 };
+    const heap = new CellHeap();
+    const h0 = cellSize / 2;
+    for (let x = bb.minX; x < bb.maxX; x += cellSize) {
+        for (let y = bb.minY; y < bb.maxY; y += cellSize) {
+            heap.push(makeCell(x + h0, y + h0, h0, polygon));
+        }
+    }
+    // Seed best with the centroid and the bbox centre.
+    const c = centroid(polygon);
+    let best = makeCell(c.x, c.y, 0, polygon);
+    const bboxCell = makeCell(bb.minX + width / 2, bb.minY + height / 2, 0, polygon);
+    if (bboxCell.d > best.d)
+        best = bboxCell;
+    while (heap.size > 0) {
+        const cell = heap.pop();
+        if (cell.d > best.d)
+            best = cell;
+        if (cell.max - best.d <= precision)
+            continue;
+        const h = cell.h / 2;
+        heap.push(makeCell(cell.x - h, cell.y - h, h, polygon));
+        heap.push(makeCell(cell.x + h, cell.y - h, h, polygon));
+        heap.push(makeCell(cell.x - h, cell.y + h, h, polygon));
+        heap.push(makeCell(cell.x + h, cell.y + h, h, polygon));
+    }
+    return { point: { x: best.x, y: best.y }, clearance: best.d };
+}
+/** The anchor point only. See poleOfInaccessibilityWithClearance for the
+ *  clearance radius (and the `precision` note — for normalized 0..1 coordinates
+ *  pass ~1e-3, not the pixel-scale default of 1.0). */
+export function poleOfInaccessibility(polygon, precision = 1.0) {
+    return poleOfInaccessibilityWithClearance(polygon, precision).point;
+}
+// Concentric-ring cluster positions around a centre. Ring k holds 6k points, so
+// the cluster grows outward roughly evenly. `spacing` is the ring-radius step.
+function clusterPositions(center, count, spacing) {
+    const pts = [{ x: center.x, y: center.y }];
+    for (let ring = 1; pts.length < count; ring++) {
+        const inRing = 6 * ring;
+        for (let i = 0; i < inRing && pts.length < count; i++) {
+            const angle = (2 * Math.PI * i) / inRing;
+            pts.push({
+                x: center.x + ring * spacing * Math.cos(angle),
+                y: center.y + ring * spacing * Math.sin(angle),
+            });
+        }
+    }
+    return pts;
+}
+function clusterFits(pts, polygon, clearance) {
+    for (const p of pts) {
+        if (signedDistanceToPolygon(p, polygon) < clearance)
+            return false;
+    }
+    return true;
+}
+/** Lay out `count` tokens inside `polygon`, clustered at its visual centre and
+ *  kept within the boundary. Shrinks the cluster to fit; if even the shrunk
+ *  cluster won't fit, returns a single anchored point with `stacked: true` so
+ *  the renderer can draw a pile + count badge. Deterministic. */
+export function layoutTokensInPolygon(polygon, count, opts) {
+    const anchor = opts.anchor ?? poleOfInaccessibility(polygon, opts.precision ?? 1.0);
+    const gap = opts.gap ?? opts.tokenRadius * 0.3;
+    const minScale = opts.minScale ?? 0.4;
+    if (count <= 0)
+        return { anchor, points: [], scale: 1, stacked: false };
+    if (count === 1) {
+        const fits = signedDistanceToPolygon(anchor, polygon) >= opts.tokenRadius;
+        return { anchor, points: [anchor], scale: fits ? 1 : minScale, stacked: !fits };
+    }
+    const step = 2 * opts.tokenRadius + gap;
+    // Try full size, then shrink in 0.1 increments down to minScale.
+    for (let scale = 1.0; scale >= minScale - 1e-9; scale -= 0.1) {
+        const pts = clusterPositions(anchor, count, step * scale);
+        if (clusterFits(pts, polygon, opts.tokenRadius * scale)) {
+            return { anchor, points: pts, scale: Math.max(scale, minScale), stacked: false };
+        }
+    }
+    // Won't fit even shrunk — collapse to a single anchored pile.
+    return { anchor, points: [anchor], scale: minScale, stacked: true };
+}
+// --- conversion helpers ---------------------------------------------------
+// On disk, polygons are [x,y] pairs (clip-path, GeoJSON-ish, VASSAL/SVG exports);
+// in memory the geo functions take {x,y}. These save every consumer re-writing
+// the same adapter.
+export function toPolygon(pairs) {
+    return pairs.map(([x, y]) => ({ x, y }));
+}
+export function fromPolygon(polygon) {
+    return polygon.map((p) => [p.x, p.y]);
+}
+export function distance(a, b) {
+    return Math.hypot(a.x - b.x, a.y - b.y);
+}
+/** Headless verification of a whole map's token layout — the CI-able core of the
+ *  per-game audit overlay (the visual page stays per-game; this is the math it
+ *  and CI both call). Lays out each region and checks containment. */
+export function auditLayout(entries, opts) {
+    const anchorsOutside = [];
+    const stackedPiles = [];
+    let tokenBleed = 0;
+    let minClearance = Infinity;
+    let tightestRegion = null;
+    for (const { id, polygon, count } of entries) {
+        const { point: anchor, clearance } = poleOfInaccessibilityWithClearance(polygon, opts.precision ?? 1.0);
+        if (clearance <= 0)
+            anchorsOutside.push(id);
+        if (clearance < minClearance) {
+            minClearance = clearance;
+            tightestRegion = id;
+        }
+        const layout = layoutTokensInPolygon(polygon, count, { ...opts, anchor });
+        if (layout.stacked) {
+            stackedPiles.push(id);
+        }
+        else {
+            for (const p of layout.points) {
+                if (signedDistanceToPolygon(p, polygon) < 0)
+                    tokenBleed++;
+            }
+        }
+    }
+    return {
+        regions: entries.length,
+        anchorsOutside,
+        tokenBleed,
+        stackedPiles,
+        minClearance: minClearance === Infinity ? 0 : minClearance,
+        tightestRegion,
+    };
+}
+// --- comparison / validation (extraction vs a reference) ------------------
+// Roughness-tolerant ways to validate auto-extracted polygons against a human
+// reference (or vice versa). Compare TOPOLOGY (count, 1:1 matching, adjacency,
+// anchor proximity), NOT vertex precision — a rough reference legitimately
+// overlaps a precise extraction at well under IoU 1.0.
+function segSegDistSq(a1, a2, b1, b2) {
+    // Min of the four endpoint-to-opposite-segment distances. (For the adjacency
+    // use-case we don't need the exact crossing test — touching boundaries give a
+    // near-zero distance either way.)
+    return Math.min(segmentDistSq(a1, b1, b2), segmentDistSq(a2, b1, b2), segmentDistSq(b1, a1, a2), segmentDistSq(b2, a1, a2));
+}
+function boundaryDistance(a, b) {
+    let minSq = Infinity;
+    for (let i = 0, ai = a.length - 1; i < a.length; ai = i++) {
+        for (let j = 0, bj = b.length - 1; j < b.length; bj = j++) {
+            const d = segSegDistSq(a[ai], a[i], b[bj], b[j]);
+            if (d < minSq)
+                minSq = d;
+            if (minSq === 0)
+                return 0;
+        }
+    }
+    return Math.sqrt(minSq);
+}
+/** Approximate intersection-over-union of two polygons via grid sampling over
+ *  the combined bounding box. Robust to concavity (no polygon clipping).
+ *  `samples` is the grid resolution per axis (default 64 → 4096 test points).
+ *  Deterministic. */
+export function polygonIoU(a, b, samples = 64) {
+    const ba = boundingBox(a), bb = boundingBox(b);
+    const minX = Math.min(ba.minX, bb.minX), minY = Math.min(ba.minY, bb.minY);
+    const maxX = Math.max(ba.maxX, bb.maxX), maxY = Math.max(ba.maxY, bb.maxY);
+    const w = maxX - minX, h = maxY - minY;
+    if (w <= 0 || h <= 0)
+        return 0;
+    let inter = 0, uni = 0;
+    for (let i = 0; i < samples; i++) {
+        const x = minX + ((i + 0.5) * w) / samples;
+        for (let j = 0; j < samples; j++) {
+            const y = minY + ((j + 0.5) * h) / samples;
+            const inA = pointInPolygon({ x, y }, a);
+            const inB = pointInPolygon({ x, y }, b);
+            if (inA || inB)
+                uni++;
+            if (inA && inB)
+                inter++;
+        }
+    }
+    return uni === 0 ? 0 : inter / uni;
+}
+/** Undirected adjacency derived from polygon geometry: two regions are adjacent
+ *  when their boundaries come within `tolerance`. Rough/hand-traced polygons
+ *  rarely share exact edges, so a tolerance is required. O(n²) with a bbox
+ *  pre-filter — fine for a few hundred regions run occasionally (validation, not
+ *  a hot path). Returns sorted, de-duplicated, normalized edges. */
+export function adjacencyFromPolygons(polygons, tolerance) {
+    const ids = Object.keys(polygons);
+    const bboxes = {};
+    for (const id of ids)
+        bboxes[id] = boundingBox(polygons[id]);
+    const edges = [];
+    for (let i = 0; i < ids.length; i++) {
+        for (let j = i + 1; j < ids.length; j++) {
+            const a = ids[i], b = ids[j];
+            const ba = bboxes[a], bb = bboxes[b];
+            if (ba.minX - tolerance > bb.maxX || bb.minX - tolerance > ba.maxX ||
+                ba.minY - tolerance > bb.maxY || bb.minY - tolerance > ba.maxY)
+                continue;
+            if (boundaryDistance(polygons[a], polygons[b]) <= tolerance) {
+                edges.push(a < b ? [a, b] : [b, a]);
+            }
+        }
+    }
+    edges.sort((e, f) => (e[0] === f[0] ? e[1].localeCompare(f[1]) : e[0].localeCompare(f[0])));
+    return edges;
+}
+/** Set-diff two undirected edge lists (edge endpoint order is normalized). Use
+ *  to compare polygon-derived adjacency against the engine's known adjacency —
+ *  the strongest, roughness-immune validation signal. */
+export function diffAdjacency(a, b) {
+    const key = (e) => (e[0] < e[1] ? `${e[0]}|${e[1]}` : `${e[1]}|${e[0]}`);
+    const setA = new Set(a.map(key));
+    const setB = new Set(b.map(key));
+    const shared = [], onlyA = [], onlyB = [];
+    for (const e of a)
+        (setB.has(key(e)) ? shared : onlyA).push(e);
+    for (const e of b)
+        if (!setA.has(key(e)))
+            onlyB.push(e);
+    return { shared, onlyA, onlyB };
+}
+/** Match two named polygon sets (e.g. extracted vs a human reference) by best
+ *  IoU. The roughness-tolerant comparison: use it to confirm a 1:1 region
+ *  correspondence and flag merges/splits — NOT to score vertex precision. Greedy
+ *  per A-region. `minIoU` is the matching threshold (default 0.5); keep it low,
+ *  because a rough reference legitimately overlaps a precise extraction at well
+ *  under 1.0. */
+export function matchRegions(a, b, opts = {}) {
+    const minIoU = opts.minIoU ?? 0.5;
+    const samples = opts.samples ?? 48;
+    const idsA = Object.keys(a), idsB = Object.keys(b);
+    const bboxesB = {};
+    for (const id of idsB)
+        bboxesB[id] = boundingBox(b[id]);
+    const matches = [];
+    const matchedB = new Set();
+    const unmatchedA = [];
+    for (const ia of idsA) {
+        const pa = a[ia];
+        const ba = boundingBox(pa);
+        let best = null;
+        for (const ib of idsB) {
+            const bbB = bboxesB[ib];
+            if (ba.minX > bbB.maxX || bbB.minX > ba.maxX ||
+                ba.minY > bbB.maxY || bbB.minY > ba.maxY)
+                continue; // bbox pre-filter
+            const iou = polygonIoU(pa, b[ib], samples);
+            if (!best || iou > best.iou)
+                best = { id: ib, iou };
+        }
+        if (best && best.iou >= minIoU) {
+            const anchorDistance = distance(poleOfInaccessibility(pa), poleOfInaccessibility(b[best.id]));
+            matches.push({ a: ia, b: best.id, iou: best.iou, anchorDistance });
+            matchedB.add(best.id);
+        }
+        else {
+            unmatchedA.push(ia);
+        }
+    }
+    const unmatchedB = idsB.filter((id) => !matchedB.has(id));
+    return { matches, unmatchedA, unmatchedB };
+}
+//# sourceMappingURL=geo.js.map

package/dist/core/geo.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"geo.js","sourceRoot":"","sources":["../../src/core/geo.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,iFAAiF;AACjF,8EAA8E;AAC9E,8CAA8C;AAC9C,EAAE;AACF,iFAAiF;AACjF,+EAA+E;AAC/E,+DAA+D;AAiB/D,MAAM,UAAU,WAAW,CAAC,OAAgB;IAC1C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;IACxE,IAAI,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC;IACzE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACpC,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,UAAU,CAAC,OAAgB;IACzC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACpE,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,GAAG,GAAG,CAAC,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,IAAI,CAAC,OAAgB;IACnC,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;AACvC,CAAC;AAED;;gFAEgF;AAChF,MAAM,UAAU,QAAQ,CAAC,OAAgB;IACvC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACpE,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;QAC5E,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAC9C,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAC9C,CAAC,IAAI,KAAK,CAAC;IACb,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,6DAA6D;QAC7D,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,OAAO;YACL,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;YAC3C,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;SAC5C,CAAC;IACJ,CAAC;IACD,CAAC,IAAI,CAAC,CAAC;IACP,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC;AAClC,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAY,EAAE,OAAgB;IAC3D,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACpE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;QACvC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YACnC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAClE,MAAM,GAAG,CAAC,MAAM,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,aAAa,CAAC,CAAQ,EAAE,CAAQ,EAAE,CAAQ;IACjD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACrB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAClE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;aAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAAC,CAAC;IAC/C,CAAC;IACD,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC3B,CAAC;AAED;kEACkE;AAClE,MAAM,UAAU,uBAAuB,CAAC,KAAY,EAAE,OAAgB;IACpE,IAAI,KAAK,GAAG,QAAQ,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACpE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,OAAO,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACvD,CAAC;AAYD,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,OAAgB;IACjE,MAAM,CAAC,GAAG,uBAAuB,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACrD,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;AACjD,CAAC;AAED,qCAAqC;AACrC,MAAM,QAAQ;IACJ,KAAK,GAAW,EAAE,CAAC;IAC3B,IAAI,IAAI,KAAa,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IAChD,IAAI,CAAC,CAAO;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;QACrB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC,MAAM,CAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,GAAG;gBAAE,MAAM;YACvC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,MAAM,CAAE,CAAC,CAAC;YACxC,CAAC,GAAG,MAAM,CAAC;QACb,CAAC;IACH,CAAC;IACD,GAAG;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QAClB,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,EAAG,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjB,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACZ,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,SAAS,CAAC;gBACR,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACnC,IAAI,OAAO,GAAG,CAAC,CAAC;gBAChB,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAE,CAAC,GAAG;oBAAE,OAAO,GAAG,CAAC,CAAC;gBAC7D,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAE,CAAC,GAAG;oBAAE,OAAO,GAAG,CAAC,CAAC;gBAC7D,IAAI,OAAO,KAAK,CAAC;oBAAE,MAAM;gBACzB,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,OAAO,CAAE,CAAC,CAAC;gBAC1C,CAAC,GAAG,OAAO,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAUD;;;;;;;;sCAQsC;AACtC,MAAM,UAAU,kCAAkC,CAChD,OAAgB,EAChB,SAAS,GAAG,GAAG;IAEf,MAAM,EAAE,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IAChC,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC;IAChC,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC;IACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACzC,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IAE/E,MAAM,IAAI,GAAG,IAAI,QAAQ,EAAE,CAAC;IAC5B,MAAM,EAAE,GAAG,QAAQ,GAAG,CAAC,CAAC;IACxB,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC;YACjD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,MAAM,CAAC,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC5B,IAAI,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,EAAE,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IACjF,IAAI,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QAAE,IAAI,GAAG,QAAQ,CAAC;IAEzC,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YAAE,IAAI,GAAG,IAAI,CAAC;QACjC,IAAI,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,IAAI,SAAS;YAAE,SAAS;QAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;AAChE,CAAC;AAED;;uDAEuD;AACvD,MAAM,UAAU,qBAAqB,CAAC,OAAgB,EAAE,SAAS,GAAG,GAAG;IACrE,OAAO,kCAAkC,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,KAAK,CAAC;AACtE,CAAC;AAkCD,gFAAgF;AAChF,+EAA+E;AAC/E,SAAS,gBAAgB,CAAC,MAAa,EAAE,KAAa,EAAE,OAAe;IACrE,MAAM,GAAG,GAAY,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IACpD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACtD,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;YACzC,GAAG,CAAC,IAAI,CAAC;gBACP,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;gBAC9C,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;aAC/C,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,WAAW,CAAC,GAAY,EAAE,OAAgB,EAAE,SAAiB;IACpE,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,uBAAuB,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,SAAS;YAAE,OAAO,KAAK,CAAC;IACpE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;iEAGiE;AACjE,MAAM,UAAU,qBAAqB,CACnC,OAAgB,EAChB,KAAa,EACb,IAAmB;IAEnB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,qBAAqB,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC,CAAC;IACpF,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;IAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,GAAG,CAAC;IAEtC,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACxE,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,MAAM,IAAI,GAAG,uBAAuB,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC;QAC1E,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;IAClF,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;IACxC,iEAAiE;IACjE,KAAK,IAAI,KAAK,GAAG,GAAG,EAAE,KAAK,IAAI,QAAQ,GAAG,IAAI,EAAE,KAAK,IAAI,GAAG,EAAE,CAAC;QAC7D,MAAM,GAAG,GAAG,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC;QAC1D,IAAI,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,EAAE,CAAC;YACxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;QACnF,CAAC;IACH,CAAC;IACD,8DAA8D;IAC9D,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AACtE,CAAC;AAED,6EAA6E;AAC7E,kFAAkF;AAClF,+EAA+E;AAC/E,oBAAoB;AAEpB,MAAM,UAAU,SAAS,CAAC,KAA+C;IACvE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,OAAgB;IAC1C,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,CAAQ,EAAE,CAAQ;IACzC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1C,CAAC;AAwBD;;sEAEsE;AACtE,MAAM,UAAU,WAAW,CAAC,OAAqB,EAAE,IAAmB;IACpE,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,YAAY,GAAG,QAAQ,CAAC;IAC5B,IAAI,cAAc,GAAkB,IAAI,CAAC;IAEzC,KAAK,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC;QAC7C,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,kCAAkC,CACrE,OAAO,EAAE,IAAI,CAAC,SAAS,IAAI,GAAG,CAC/B,CAAC;QACF,IAAI,SAAS,IAAI,CAAC;YAAE,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5C,IAAI,SAAS,GAAG,YAAY,EAAE,CAAC;YAAC,YAAY,GAAG,SAAS,CAAC;YAAC,cAAc,GAAG,EAAE,CAAC;QAAC,CAAC;QAEhF,MAAM,MAAM,GAAG,qBAAqB,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAC1E,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACnB,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC9B,IAAI,uBAAuB,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC;oBAAE,UAAU,EAAE,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO,EAAE,OAAO,CAAC,MAAM;QACvB,cAAc;QACd,UAAU;QACV,YAAY;QACZ,YAAY,EAAE,YAAY,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY;QAC1D,cAAc;KACf,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,8EAA8E;AAC9E,+EAA+E;AAC/E,2EAA2E;AAC3E,uDAAuD;AAEvD,SAAS,YAAY,CAAC,EAAS,EAAE,EAAS,EAAE,EAAS,EAAE,EAAS;IAC9D,6EAA6E;IAC7E,8EAA8E;IAC9E,kCAAkC;IAClC,OAAO,IAAI,CAAC,GAAG,CACb,aAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EACzB,aAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EACzB,aAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EACzB,aAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAC1B,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAU,EAAE,CAAU;IAC9C,IAAI,KAAK,GAAG,QAAQ,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC;YAC1D,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,CAAE,EAAE,CAAC,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,EAAE,CAAE,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;YACrD,IAAI,CAAC,GAAG,KAAK;gBAAE,KAAK,GAAG,CAAC,CAAC;YACzB,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC1B,CAAC;AAED;;;qBAGqB;AACrB,MAAM,UAAU,UAAU,CAAC,CAAU,EAAE,CAAU,EAAE,OAAO,GAAG,EAAE;IAC7D,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC3E,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;IAC3E,MAAM,CAAC,GAAG,IAAI,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;IACvC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/B,IAAI,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;YAC3C,MAAM,GAAG,GAAG,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACxC,MAAM,GAAG,GAAG,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACxC,IAAI,GAAG,IAAI,GAAG;gBAAE,GAAG,EAAE,CAAC;YACtB,IAAI,GAAG,IAAI,GAAG;gBAAE,KAAK,EAAE,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC;AACrC,CAAC;AAID;;;;oEAIoE;AACpE,MAAM,UAAU,qBAAqB,CACnC,QAAiC,EACjC,SAAiB;IAEjB,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClC,MAAM,MAAM,GAAyB,EAAE,CAAC;IACxC,KAAK,MAAM,EAAE,IAAI,GAAG;QAAE,MAAM,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAE,CAAC,CAAC;IAC9D,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAE,EAAE,EAAE,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YACvC,IAAI,EAAE,CAAC,IAAI,GAAG,SAAS,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,GAAG,SAAS,GAAG,EAAE,CAAC,IAAI;gBAC9D,EAAE,CAAC,IAAI,GAAG,SAAS,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,GAAG,SAAS,GAAG,EAAE,CAAC,IAAI;gBAAE,SAAS;YAC7E,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC9D,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,OAAO,KAAK,CAAC;AACf,CAAC;AAUD;;yDAEyD;AACzD,MAAM,UAAU,aAAa,CAAC,CAAS,EAAE,CAAS;IAChD,MAAM,GAAG,GAAG,CAAC,CAAO,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACvF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,MAAM,MAAM,GAAW,EAAE,EAAE,KAAK,GAAW,EAAE,EAAE,KAAK,GAAW,EAAE,CAAC;IAClE,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/D,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAClC,CAAC;AAiBD;;;;;iBAKiB;AACjB,MAAM,UAAU,YAAY,CAC1B,CAA0B,EAC1B,CAA0B,EAC1B,OAA8C,EAAE;IAEhD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC;IACnC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,OAAO,GAAyB,EAAE,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,IAAI;QAAE,OAAO,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC;IAEzD,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAE,CAAC;QAClB,MAAM,EAAE,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,IAAI,GAAuC,IAAI,CAAC;QACpD,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,CAAE,CAAC;YACzB,IAAI,EAAE,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI;gBACxC,EAAE,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI;gBAAE,SAAS,CAAC,kBAAkB;YAC1E,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAE,EAAE,OAAO,CAAC,CAAC;YAC5C,IAAI,CAAC,IAAI,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG;gBAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;QACtD,CAAC;QACD,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,IAAI,MAAM,EAAE,CAAC;YAC/B,MAAM,cAAc,GAAG,QAAQ,CAC7B,qBAAqB,CAAC,EAAE,CAAC,EAAE,qBAAqB,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,CAC9D,CAAC;YACF,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,cAAc,EAAE,CAAC,CAAC;YACnE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC;AAC7C,CAAC"}

package/dist/index.d.ts

@@ -4,4 +4,5 @@ export { StructuredLog, type LogEntry } from './core/log.js';
 export { EffectContext, type ChoiceRequest, type ChoiceResponse } from './core/effects.js';
 export { type GameAdapter, type GameResult } from './core/adapter.js';
 export { type PlayerController, type ControllerContext, RandomAI, ScriptedController, } from './core/controller.js';
+export { type Point, type Polygon, type BBox, type LayoutOptions, type TokenLayout, type PoleResult, type AuditEntry, type AuditResult, type Edge, type AdjacencyDiff, type RegionMatch, type RegionMatchResult, boundingBox, signedArea, area, centroid, pointInPolygon, signedDistanceToPolygon, poleOfInaccessibility, poleOfInaccessibilityWithClearance, layoutTokensInPolygon, toPolygon, fromPolygon, distance, auditLayout, polygonIoU, adjacencyFromPolygons, diffAdjacency, matchRegions, } from './core/geo.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AACpC,OAAO,EAAE,SAAS,EAAE,KAAK,KAAK,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,KAAK,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC7D,OAAO,EAAE,aAAa,EAAE,KAAK,aAAa,EAAE,KAAK,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAC3F,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACtE,OAAO,EACL,KAAK,gBAAgB,EACrB,KAAK,iBAAiB,EACtB,QAAQ,EACR,kBAAkB,GACnB,MAAM,sBAAsB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AACpC,OAAO,EAAE,SAAS,EAAE,KAAK,KAAK,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,KAAK,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC7D,OAAO,EAAE,aAAa,EAAE,KAAK,aAAa,EAAE,KAAK,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAC3F,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACtE,OAAO,EACL,KAAK,gBAAgB,EACrB,KAAK,iBAAiB,EACtB,QAAQ,EACR,kBAAkB,GACnB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,KAAK,KAAK,EACV,KAAK,OAAO,EACZ,KAAK,IAAI,EACT,KAAK,aAAa,EAClB,KAAK,WAAW,EAChB,KAAK,UAAU,EACf,KAAK,UAAU,EACf,KAAK,WAAW,EAChB,KAAK,IAAI,EACT,KAAK,aAAa,EAClB,KAAK,WAAW,EAChB,KAAK,iBAAiB,EACtB,WAAW,EACX,UAAU,EACV,IAAI,EACJ,QAAQ,EACR,cAAc,EACd,uBAAuB,EACvB,qBAAqB,EACrB,kCAAkC,EAClC,qBAAqB,EACrB,SAAS,EACT,WAAW,EACX,QAAQ,EACR,WAAW,EACX,UAAU,EACV,qBAAqB,EACrB,aAAa,EACb,YAAY,GACb,MAAM,eAAe,CAAC"}

package/dist/index.js

@@ -3,4 +3,5 @@ export { jsonCodec } from './core/codec.js';
 export { StructuredLog } from './core/log.js';
 export { EffectContext } from './core/effects.js';
 export { RandomAI, ScriptedController, } from './core/controller.js';
+export { boundingBox, signedArea, area, centroid, pointInPolygon, signedDistanceToPolygon, poleOfInaccessibility, poleOfInaccessibilityWithClearance, layoutTokensInPolygon, toPolygon, fromPolygon, distance, auditLayout, polygonIoU, adjacencyFromPolygons, diffAdjacency, matchRegions, } from './core/geo.js';
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AACpC,OAAO,EAAE,SAAS,EAAc,MAAM,iBAAiB,CAAC;AACxD,OAAO,EAAE,aAAa,EAAiB,MAAM,eAAe,CAAC;AAC7D,OAAO,EAAE,aAAa,EAA2C,MAAM,mBAAmB,CAAC;AAE3F,OAAO,EAGL,QAAQ,EACR,kBAAkB,GACnB,MAAM,sBAAsB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AACpC,OAAO,EAAE,SAAS,EAAc,MAAM,iBAAiB,CAAC;AACxD,OAAO,EAAE,aAAa,EAAiB,MAAM,eAAe,CAAC;AAC7D,OAAO,EAAE,aAAa,EAA2C,MAAM,mBAAmB,CAAC;AAE3F,OAAO,EAGL,QAAQ,EACR,kBAAkB,GACnB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAaL,WAAW,EACX,UAAU,EACV,IAAI,EACJ,QAAQ,EACR,cAAc,EACd,uBAAuB,EACvB,qBAAqB,EACrB,kCAAkC,EAClC,qBAAqB,EACrB,SAAS,EACT,WAAW,EACX,QAAQ,EACR,WAAW,EACX,UAAU,EACV,qBAAqB,EACrB,aAAa,EACb,YAAY,GACb,MAAM,eAAe,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "digital-boardgame-framework",
-  "version": "0.8.2",
+  "version": "0.9.1",
   "description": "Foundation library for turn-based digital boardgames: deterministic engine plumbing, async multiplayer, agent-friendly bug triage.",
   "keywords": ["boardgame", "board-game", "multiplayer", "async-multiplayer", "turn-based", "game-framework", "supabase", "cloudflare-pages"],
   "author": "John Champaign",