@pascal-app/core 1.0.0-beta.5 → 1.0.1

package/dist/lib/slab-polygon.js

@@ -1,5 +1,5 @@
-import { isCurvedWall, sampleWallCenterline } from '../systems/wall/wall-curve';
-import { getWallThickness } from '../systems/wall/wall-footprint';
+import { isCurvedWall, sampleWallCenterline } from '../systems/wall/wall-curve.js';
+import { getWallThickness } from '../systems/wall/wall-footprint.js';
 /**
  * Render-time slab polygon rules.
  *
@@ -114,16 +114,24 @@ function polygonWindingSign(polygon) {
 export function slabPolygonContextFromGeometry(ctx) {
     if (!ctx)
         return { walls: [], siblingSlabs: [] };
-    const siblingSlabs = ctx.siblings.filter((node) => node.type === 'slab');
+    return {
+        ...slabPolygonContextForLevel(ctx.parent, ctx.resolve),
+        siblingSlabs: ctx.siblings.filter((node) => node.type === 'slab'),
+    };
+}
+export function slabPolygonContextForLevel(parent, resolve, fallbackSlabs = []) {
     const walls = [];
-    const parentChildIds = ctx.parent?.children;
-    if (Array.isArray(parentChildIds)) {
-        for (const childId of parentChildIds) {
-            const child = ctx.resolve(childId);
-            if (child?.type === 'wall') {
-                walls.push(child);
-            }
-        }
+    const siblingSlabs = [];
+    const childIds = parent?.children;
+    if (!Array.isArray(childIds)) {
+        return { walls, siblingSlabs: parent ? fallbackSlabs : [] };
+    }
+    for (const id of childIds) {
+        const child = resolve(id);
+        if (child?.type === 'wall')
+            walls.push(child);
+        else if (child?.type === 'slab')
+            siblingSlabs.push(child);
     }
     return { walls, siblingSlabs };
 }
@@ -132,7 +140,7 @@ export function getRenderableSlabPolygon(slabNode, context) {
     if (polygon.length < 3 || isFloatingSlab(slabNode)) {
         return polygon.map(([x, z]) => [x, z]);
     }
-    const subSpans = computeEdgeSubSpans(polygon, slabNode.elevation ?? DEFAULT_SLAB_ELEVATION, context);
+    const subSpans = computeEdgeSubSpans(polygon, slabNode.elevation ?? DEFAULT_SLAB_ELEVATION, 'wallCandidates' in context ? context : prepareSlabPolygonContext(context), slabNode.id);
     if (subSpans.every((spans) => spans.length === 1 && spans[0].offset === 0)) {
         return polygon.map(([x, z]) => [x, z]);
     }
@@ -254,17 +262,71 @@ export function snapSlabEdgeToWallBand(a, b, walls, options) {
         ],
     };
 }
-/**
- * Split every polygon edge at candidate span boundaries and classify
- * each sub-span independently. Returns one non-empty span list per
- * edge, covering [0, edgeLength] without gaps.
- */
-function computeEdgeSubSpans(polygon, selfElevation, context) {
-    const n = polygon.length;
-    // Winding sign: the outward normal of an edge with direction `dir` is
-    // `s * (dirZ, -dirX)`, so a target lateral `L` measured along
-    // `(dirZ, -dirX)` is `s * L` along the outward normal.
-    const s = polygonWindingSign(polygon);
+function polygonBounds(polygon) {
+    const bounds = [Infinity, Infinity, -Infinity, -Infinity];
+    for (const [x, z] of polygon) {
+        bounds[0] = Math.min(bounds[0], x);
+        bounds[1] = Math.min(bounds[1], z);
+        bounds[2] = Math.max(bounds[2], x);
+        bounds[3] = Math.max(bounds[3], z);
+    }
+    return bounds;
+}
+function boundsOverlap(a, b, padding) {
+    return (a[0] <= b[2] + padding &&
+        a[2] >= b[0] - padding &&
+        a[1] <= b[3] + padding &&
+        a[3] >= b[1] - padding);
+}
+export function scopeSlabPolygonContext(slab, context) {
+    const bounds = polygonBounds(slab.polygon);
+    const wallCandidates = context.wallCandidates.filter((candidate) => boundsOverlap(bounds, candidate.bounds, candidate.halfThickness + WALL_ADOPTION_TOLERANCE));
+    // Keep the level-wide tolerance: even an unadopted wall can widen sibling
+    // breakpoint collection, which may affect short-span fusion.
+    const neighborSegments = context.neighborSegments.filter((neighbor) => neighbor.slab.id !== slab.id &&
+        boundsOverlap(bounds, neighbor.bounds, context.siblingBreakTolerance));
+    return {
+        ...context,
+        walls: wallCandidates.map((candidate) => candidate.wall),
+        siblingSlabs: [...new Set(neighborSegments.map((neighbor) => neighbor.slab))],
+        wallCandidates,
+        neighborSegments,
+        siblingBreakTolerance: context.siblingBreakTolerance,
+    };
+}
+export function slabPolygonContextChanges(before, after) {
+    if (before.siblingBreakTolerance !== after.siblingBreakTolerance)
+        return () => true;
+    const changedWalls = new Set();
+    const changedSlabs = new Set();
+    for (let i = 0; i < Math.max(before.walls.length, after.walls.length); i++) {
+        if (before.walls[i] === after.walls[i])
+            continue;
+        if (before.walls[i])
+            changedWalls.add(before.walls[i]);
+        if (after.walls[i])
+            changedWalls.add(after.walls[i]);
+    }
+    for (let i = 0; i < Math.max(before.siblingSlabs.length, after.siblingSlabs.length); i++) {
+        if (before.siblingSlabs[i] === after.siblingSlabs[i])
+            continue;
+        if (before.siblingSlabs[i])
+            changedSlabs.add(before.siblingSlabs[i]);
+        if (after.siblingSlabs[i])
+            changedSlabs.add(after.siblingSlabs[i]);
+    }
+    const walls = [...before.wallCandidates, ...after.wallCandidates].filter((candidate) => changedWalls.has(candidate.wall));
+    const neighbors = [...before.neighborSegments, ...after.neighborSegments].filter((neighbor) => changedSlabs.has(neighbor.slab));
+    return (slab) => {
+        const bounds = polygonBounds(slab.polygon);
+        return (walls.some((candidate) => boundsOverlap(bounds, candidate.bounds, candidate.halfThickness + WALL_ADOPTION_TOLERANCE)) ||
+            neighbors.some((neighbor) => neighbor.slab.id !== slab.id &&
+                boundsOverlap(bounds, neighbor.bounds, after.siblingBreakTolerance)));
+    };
+}
+export function prepareSlabPolygonContext(context, previous) {
+    const wallCache = previous?.wallCache ?? new WeakMap();
+    const neighborCache = previous?.neighborCache ?? new WeakMap();
     const neighborSegments = [];
     for (const sibling of context.siblingSlabs) {
         // A floating deck keeps its drawn polygon, so it can't be a seam
@@ -273,6 +335,12 @@ function computeEdgeSubSpans(polygon, selfElevation, context) {
         // only describe room floors meeting under a wall.
         if (isFloatingSlab(sibling))
             continue;
+        const cached = neighborCache.get(sibling);
+        if (cached) {
+            neighborSegments.push(...cached);
+            continue;
+        }
+        const segments = [];
         const siblingPolygon = sibling.polygon;
         if (siblingPolygon.length < 2)
             continue;
@@ -286,19 +354,35 @@ function computeEdgeSubSpans(polygon, selfElevation, context) {
             const length = Math.hypot(dx, dz);
             if (length < 1e-9)
                 continue;
-            neighborSegments.push({
+            segments.push({
+                slab: sibling,
+                bounds: polygonBounds([from, to]),
                 segment: [from[0], from[1], to[0], to[1]],
                 elevation,
                 inwardX: (-siblingWinding * dz) / length,
                 inwardZ: (siblingWinding * dx) / length,
             });
         }
+        neighborCache.set(sibling, segments);
+        neighborSegments.push(...segments);
     }
-    const wallCandidates = context.walls.map((wall) => ({
-        wall,
-        segments: wallCenterlineSegments(wall),
-        halfThickness: getWallThickness(wall) / 2,
-    }));
+    const wallCandidates = context.walls.map((wall) => {
+        const cached = wallCache.get(wall);
+        if (cached)
+            return cached;
+        const segments = wallCenterlineSegments(wall);
+        const candidate = {
+            wall,
+            segments,
+            halfThickness: getWallThickness(wall) / 2,
+            bounds: polygonBounds(segments.flatMap(([ax, az, bx, bz]) => [
+                [ax, az],
+                [bx, bz],
+            ])),
+        };
+        wallCache.set(wall, candidate);
+        return candidate;
+    });
     // Sibling breakpoints also matter for legacy face-aligned polygons up
     // to a full wall band away from the edge (the band-sibling interior
     // rule in classifySpan), so clip them with the widest band reach any
@@ -308,6 +392,28 @@ function computeEdgeSubSpans(polygon, selfElevation, context) {
     for (const candidate of wallCandidates) {
         siblingBreakTolerance = Math.max(siblingBreakTolerance, 2 * (candidate.halfThickness + WALL_ADOPTION_TOLERANCE));
     }
+    return {
+        ...context,
+        wallCache,
+        neighborCache,
+        wallCandidates,
+        neighborSegments,
+        siblingBreakTolerance,
+    };
+}
+/**
+ * Split every polygon edge at candidate span boundaries and classify
+ * each sub-span independently. Returns one non-empty span list per
+ * edge, covering [0, edgeLength] without gaps.
+ */
+function computeEdgeSubSpans(polygon, selfElevation, context, slabId) {
+    const n = polygon.length;
+    // Winding sign: the outward normal of an edge with direction `dir` is
+    // `s * (dirZ, -dirX)`, so a target lateral `L` measured along
+    // `(dirZ, -dirX)` is `s * L` along the outward normal.
+    const s = polygonWindingSign(polygon);
+    const { wallCandidates, siblingBreakTolerance } = context;
+    const neighborSegments = context.neighborSegments.filter((segment) => segment.slab.id !== slabId);
     const subSpans = [];
     for (let index = 0; index < n; index += 1) {
         const a = polygon[index];

package/dist/lib/space-detection.d.ts

@@ -1,4 +1,4 @@
-import { type AnyNodeId, type CeilingNode as CeilingNodeType, type SlabNode as SlabNodeType, type WallNode, type ZoneNode as ZoneNodeType } from '../schema';
+import { type AnyNodeId, type CeilingNode as CeilingNodeType, type SlabNode as SlabNodeType, type WallNode, type ZoneNode as ZoneNodeType } from '../schema/index.js';
 type Point2D = {
     x: number;
     y: number;
@@ -80,6 +80,12 @@ export type AutoCeilingPlanningContext = {
     previousHeightForRoom?: (polygon: Array<[number, number]>) => number | undefined;
     childPosition?: (childId: AnyNodeId) => [number, number] | undefined;
 };
+declare function bboxOf(points: Point2D[]): {
+    minX: number;
+    minY: number;
+    maxX: number;
+    maxY: number;
+};
 /**
  * True when `wall` lies on the boundary of a room enclosed by `walls`, using the
  * same planar room graph the auto slab/ceiling sync uses. The wall builder's
@@ -90,6 +96,11 @@ export type AutoCeilingPlanningContext = {
  */
 export declare function wallClosesRoom(walls: WallNode[], wall: WallNode): boolean;
 export declare function resolveWallSurfaceSides(wall: Pick<WallNode, 'start' | 'end' | 'thickness' | 'frontSide' | 'backSide'>, roomPolygons: Point2D[][]): Pick<WallSideUpdate, 'frontSide' | 'backSide'>;
+type BoundedPolygon = {
+    polygon: Point2D[];
+    bbox: ReturnType<typeof bboxOf>;
+};
+export declare function surfaceTouchesRooms(surface: BoundedPolygon, rooms: BoundedPolygon[]): boolean;
 export declare function planAutoZonesForLevel(spaces: readonly Space[], existingZones: readonly ZoneNodeType[]): AutoZoneSyncPlan;
 export declare function resolveAutoZonePolygon(zone: Pick<ZoneNodeType, 'autoFromWalls' | 'boundaryWallIds' | 'polygon'>, resolve: (id: AnyNodeId) => unknown): ZoneNodeType['polygon'];
 export declare function planAutoSlabsForLevel(roomPolygons: Point2D[][], existingSlabs: SlabNodeType[], context?: AutoSlabPlanningContext, namingSlabs?: Array<{

package/dist/lib/space-detection.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"space-detection.d.ts","sourceRoot":"","sources":["../../src/lib/space-detection.ts"],"names":[],"mappings":"AACA,OAAO,EACL,KAAK,SAAS,EAEd,KAAK,WAAW,IAAI,eAAe,EAGnC,KAAK,QAAQ,IAAI,YAAY,EAC7B,KAAK,QAAQ,EAEb,KAAK,QAAQ,IAAI,YAAY,EAC9B,MAAM,WAAW,CAAA;AAgClB,KAAK,OAAO,GAAG;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CAAA;AAEvC,MAAM,MAAM,iBAAiB,GAAG;IAC9B,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAA;IACtB,IAAI,EAAE,OAAO,GAAG,MAAM,CAAA;IACtB,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CAChC,CAAA;AAED,MAAM,MAAM,KAAK,GAAG;IAClB,EAAE,EAAE,MAAM,CAAA;IACV,OAAO,EAAE,MAAM,CAAA;IACf,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;IAChC,OAAO,EAAE,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;IAC9B,aAAa,EAAE,iBAAiB,EAAE,CAAA;IAClC,UAAU,EAAE,OAAO,CAAA;CACpB,CAAA;AAED,MAAM,MAAM,2BAA2B,GAAG;IACxC,OAAO,EAAE,MAAM,CAAA;IACf,QAAQ,EAAE,SAAS,GAAG,UAAU,CAAA;IAChC,eAAe,EAAE,MAAM,EAAE,CAAA;IACzB,uBAAuB,EAAE,MAAM,CAAA;IAC/B,wBAAwB,EAAE,MAAM,CAAA;CACjC,CAAA;AAED,MAAM,MAAM,yBAAyB,GAAG;IACtC,mBAAmB,CAAC,EAAE,CAAC,KAAK,EAAE,2BAA2B,KAAK,IAAI,CAAA;CACnE,CAAA;AAED,KAAK,aAAa,GAAG;IACnB,OAAO,EAAE,OAAO,EAAE,CAAA;IAClB,aAAa,EAAE,iBAAiB,EAAE,CAAA;CACnC,CAAA;AAED,KAAK,cAAc,GAAG;IACpB,MAAM,EAAE,MAAM,CAAA;IACd,SAAS,EAAE,UAAU,GAAG,UAAU,GAAG,SAAS,CAAA;IAC9C,QAAQ,EAAE,UAAU,GAAG,UAAU,GAAG,SAAS,CAAA;CAC9C,CAAA;AAUD,MAAM,MAAM,gBAAgB,GAAG;IAC7B,MAAM,EAAE,YAAY,EAAE,CAAA;IACtB,MAAM,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;KAAE,CAAC,CAAA;IACtE,MAAM,EAAE,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAA;CAClC,CAAA;AAED,MAAM,MAAM,uBAAuB,GAAG;IACpC,gBAAgB,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,GAAG,SAAS,CAAA;IAC3E,wBAAwB,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,GAAG,SAAS,CAAA;CACpF,CAAA;AAED,MAAM,MAAM,mBAAmB,GAAG;IAChC,MAAM,EAAE,eAAe,EAAE,CAAA;IACzB,MAAM,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC,eAAe,CAAC,CAAA;KAAE,CAAC,CAAA;IAC5E,MAAM,EAAE,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAA;IACpC,QAAQ,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,SAAS,CAAC;QAAC,QAAQ,EAAE,eAAe,CAAC,IAAI,CAAC,CAAA;KAAE,CAAC,CAAA;CACpE,CAAA;AAED,MAAM,MAAM,gBAAgB,GAAG;IAC7B,MAAM,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;KAAE,CAAC,CAAA;CACvE,CAAA;AAyBD,MAAM,MAAM,0BAA0B,GAAG;IACvC,wEAAwE;IACxE,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB;;;;;;OAMG;IACH,iBAAiB,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,CAAA;IAChE,aAAa,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,GAAG,SAAS,CAAA;IACxE,qBAAqB,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,GAAG,SAAS,CAAA;IAChF,aAAa,CAAC,EAAE,CAAC,OAAO,EAAE,SAAS,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAAA;CACrE,CAAA;AAopBD;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,GAAG,OAAO,CAIzE;AAED,wBAAgB,uBAAuB,CACrC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,GAAG,KAAK,GAAG,WAAW,GAAG,WAAW,GAAG,UAAU,CAAC,EAC9E,YAAY,EAAE,OAAO,EAAE,EAAE,GACxB,IAAI,CAAC,cAAc,EAAE,WAAW,GAAG,UAAU,CAAC,CA4ChD;AA4xBD,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,SAAS,KAAK,EAAE,EACxB,aAAa,EAAE,SAAS,YAAY,EAAE,GACrC,gBAAgB,CAyBlB;AAED,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,IAAI,CAAC,YAAY,EAAE,eAAe,GAAG,iBAAiB,GAAG,SAAS,CAAC,EACzE,OAAO,EAAE,CAAC,EAAE,EAAE,SAAS,KAAK,OAAO,GAClC,YAAY,CAAC,SAAS,CAAC,CAgBzB;AAED,wBAAgB,qBAAqB,CACnC,YAAY,EAAE,OAAO,EAAE,EAAE,EACzB,aAAa,EAAE,YAAY,EAAE,EAC7B,OAAO,GAAE,uBAA4B,EACrC,WAAW,GAAE,KAAK,CAAC;IAAE,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAiB,GACpD,gBAAgB,CAiHlB;AA2BD,wBAAgB,wBAAwB,CACtC,YAAY,EAAE,OAAO,EAAE,EAAE,EACzB,gBAAgB,EAAE,eAAe,EAAE,EACnC,OAAO,GAAE,0BAA+B,EACxC,cAAc,GAAE,KAAK,CAAC;IAAE,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAoB,GAC1D,mBAAmB,CAkKrB;AAkDD,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE;;;;;EAEtE;AAiSD,mGAAmG;AACnG,wBAAgB,mBAAmB,IAAI,IAAI,CAE1C;AAED,oFAAoF;AACpF,wBAAgB,oBAAoB,IAAI,IAAI,CAG3C;AAED,2EAA2E;AAC3E,wBAAgB,sBAAsB,IAAI,OAAO,CAEhD;AAED,wBAAgB,sBAAsB,CACpC,UAAU,EAAE,GAAG,EACf,WAAW,EAAE,GAAG,EAChB,OAAO,GAAE,yBAA8B,GACtC,MAAM,IAAI,CA8JZ;AAED,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,OAAO,CAiBjF"}
+{"version":3,"file":"space-detection.d.ts","sourceRoot":"","sources":["../../src/lib/space-detection.ts"],"names":[],"mappings":"AACA,OAAO,EACL,KAAK,SAAS,EAEd,KAAK,WAAW,IAAI,eAAe,EAGnC,KAAK,QAAQ,IAAI,YAAY,EAC7B,KAAK,QAAQ,EAEb,KAAK,QAAQ,IAAI,YAAY,EAC9B,MAAM,WAAW,CAAA;AAgClB,KAAK,OAAO,GAAG;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAA;CAAE,CAAA;AAEvC,MAAM,MAAM,iBAAiB,GAAG;IAC9B,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAA;IACtB,IAAI,EAAE,OAAO,GAAG,MAAM,CAAA;IACtB,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CAChC,CAAA;AAED,MAAM,MAAM,KAAK,GAAG;IAClB,EAAE,EAAE,MAAM,CAAA;IACV,OAAO,EAAE,MAAM,CAAA;IACf,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;IAChC,OAAO,EAAE,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;IAC9B,aAAa,EAAE,iBAAiB,EAAE,CAAA;IAClC,UAAU,EAAE,OAAO,CAAA;CACpB,CAAA;AAED,MAAM,MAAM,2BAA2B,GAAG;IACxC,OAAO,EAAE,MAAM,CAAA;IACf,QAAQ,EAAE,SAAS,GAAG,UAAU,CAAA;IAChC,eAAe,EAAE,MAAM,EAAE,CAAA;IACzB,uBAAuB,EAAE,MAAM,CAAA;IAC/B,wBAAwB,EAAE,MAAM,CAAA;CACjC,CAAA;AAED,MAAM,MAAM,yBAAyB,GAAG;IACtC,mBAAmB,CAAC,EAAE,CAAC,KAAK,EAAE,2BAA2B,KAAK,IAAI,CAAA;CACnE,CAAA;AAED,KAAK,aAAa,GAAG;IACnB,OAAO,EAAE,OAAO,EAAE,CAAA;IAClB,aAAa,EAAE,iBAAiB,EAAE,CAAA;CACnC,CAAA;AAED,KAAK,cAAc,GAAG;IACpB,MAAM,EAAE,MAAM,CAAA;IACd,SAAS,EAAE,UAAU,GAAG,UAAU,GAAG,SAAS,CAAA;IAC9C,QAAQ,EAAE,UAAU,GAAG,UAAU,GAAG,SAAS,CAAA;CAC9C,CAAA;AAUD,MAAM,MAAM,gBAAgB,GAAG;IAC7B,MAAM,EAAE,YAAY,EAAE,CAAA;IACtB,MAAM,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;KAAE,CAAC,CAAA;IACtE,MAAM,EAAE,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAA;CAClC,CAAA;AAED,MAAM,MAAM,uBAAuB,GAAG;IACpC,gBAAgB,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,GAAG,SAAS,CAAA;IAC3E,wBAAwB,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,GAAG,SAAS,CAAA;CACpF,CAAA;AAED,MAAM,MAAM,mBAAmB,GAAG;IAChC,MAAM,EAAE,eAAe,EAAE,CAAA;IACzB,MAAM,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC,eAAe,CAAC,CAAA;KAAE,CAAC,CAAA;IAC5E,MAAM,EAAE,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAA;IACpC,QAAQ,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,SAAS,CAAC;QAAC,QAAQ,EAAE,eAAe,CAAC,IAAI,CAAC,CAAA;KAAE,CAAC,CAAA;CACpE,CAAA;AAED,MAAM,MAAM,gBAAgB,GAAG;IAC7B,MAAM,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;KAAE,CAAC,CAAA;CACvE,CAAA;AAyBD,MAAM,MAAM,0BAA0B,GAAG;IACvC,wEAAwE;IACxE,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB;;;;;;OAMG;IACH,iBAAiB,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,CAAA;IAChE,aAAa,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,GAAG,SAAS,CAAA;IACxE,qBAAqB,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,MAAM,GAAG,SAAS,CAAA;IAChF,aAAa,CAAC,EAAE,CAAC,OAAO,EAAE,SAAS,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAAA;CACrE,CAAA;AA2GD,iBAAS,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;;;;;EAchC;AA+hBD;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,GAAG,OAAO,CAIzE;AAED,wBAAgB,uBAAuB,CACrC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,GAAG,KAAK,GAAG,WAAW,GAAG,WAAW,GAAG,UAAU,CAAC,EAC9E,YAAY,EAAE,OAAO,EAAE,EAAE,GACxB,IAAI,CAAC,cAAc,EAAE,WAAW,GAAG,UAAU,CAAC,CA4ChD;AA6dD,KAAK,cAAc,GAAG;IACpB,OAAO,EAAE,OAAO,EAAE,CAAA;IAClB,IAAI,EAAE,UAAU,CAAC,OAAO,MAAM,CAAC,CAAA;CAChC,CAAA;AAED,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,cAAc,EAAE,KAAK,EAAE,cAAc,EAAE,WAgBnF;AAoUD,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,SAAS,KAAK,EAAE,EACxB,aAAa,EAAE,SAAS,YAAY,EAAE,GACrC,gBAAgB,CAyBlB;AAED,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,IAAI,CAAC,YAAY,EAAE,eAAe,GAAG,iBAAiB,GAAG,SAAS,CAAC,EACzE,OAAO,EAAE,CAAC,EAAE,EAAE,SAAS,KAAK,OAAO,GAClC,YAAY,CAAC,SAAS,CAAC,CAgBzB;AAED,wBAAgB,qBAAqB,CACnC,YAAY,EAAE,OAAO,EAAE,EAAE,EACzB,aAAa,EAAE,YAAY,EAAE,EAC7B,OAAO,GAAE,uBAA4B,EACrC,WAAW,GAAE,KAAK,CAAC;IAAE,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAiB,GACpD,gBAAgB,CAiHlB;AA2BD,wBAAgB,wBAAwB,CACtC,YAAY,EAAE,OAAO,EAAE,EAAE,EACzB,gBAAgB,EAAE,eAAe,EAAE,EACnC,OAAO,GAAE,0BAA+B,EACxC,cAAc,GAAE,KAAK,CAAC;IAAE,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAoB,GAC1D,mBAAmB,CAmKrB;AAkDD,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE;;;;;EAEtE;AAoSD,mGAAmG;AACnG,wBAAgB,mBAAmB,IAAI,IAAI,CAE1C;AAED,oFAAoF;AACpF,wBAAgB,oBAAoB,IAAI,IAAI,CAG3C;AAED,2EAA2E;AAC3E,wBAAgB,sBAAsB,IAAI,OAAO,CAEhD;AAED,wBAAgB,sBAAsB,CACpC,UAAU,EAAE,GAAG,EACf,WAAW,EAAE,GAAG,EAChB,OAAO,GAAE,yBAA8B,GACtC,MAAM,IAAI,CAmKZ;AAED,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,OAAO,CAiBjF"}

package/dist/lib/space-detection.js

@@ -1,14 +1,14 @@
-import { GROUND_SUPPORT_ID } from '../hooks/spatial-grid/support-host-id';
-import { CeilingNode, SlabNode, ZoneNode, } from '../schema';
-import { DEFAULT_LEVEL_HEIGHT } from '../services/level-height';
-import { CEILING_CLAMP_MARGIN, findLevelAboveId, getCeilingClampBound, getLevelBelow, getLevelElevations, getStoredLevelHeight, } from '../services/storey';
-import { activeSceneCommitNodeIds, getSceneHistoryPauseDepth, pauseSceneHistory, resumeSceneHistory, subscribeSceneCommits, } from '../store/history-control';
-import { computeWallSlabSupport } from '../systems/slab/slab-support';
-import { getClampedWallCurveOffset, getWallCurveFrameAt, isCurvedWall, } from '../systems/wall/wall-curve';
-import { resolveWallTop } from '../systems/wall/wall-top';
-import { simplifyClosedPolygon } from './polygon-geometry';
-import { distanceToSegment, RoomTopologyIndex, } from './room-topology-index';
-import { levelBaseElevationAt } from './terrain-support';
+import { GROUND_SUPPORT_ID } from '../hooks/spatial-grid/support-host-id.js';
+import { CeilingNode, SlabNode, ZoneNode, } from '../schema/index.js';
+import { DEFAULT_LEVEL_HEIGHT } from '../services/level-height.js';
+import { CEILING_CLAMP_MARGIN, findLevelAboveId, getCeilingClampBound, getLevelBelow, getLevelElevations, getStoredLevelHeight, } from '../services/storey.js';
+import { activeSceneCommitNodeIds, getSceneHistoryPauseDepth, pauseSceneHistory, resumeSceneHistory, subscribeSceneCommits, } from '../store/history-control.js';
+import { computeWallSlabSupport } from '../systems/slab/slab-support.js';
+import { getClampedWallCurveOffset, getWallCurveFrameAt, isCurvedWall, } from '../systems/wall/wall-curve.js';
+import { resolveWallTop } from '../systems/wall/wall-top.js';
+import { simplifyClosedPolygon } from './polygon-geometry.js';
+import { distanceToSegment, RoomTopologyIndex, } from './room-topology-index.js';
+import { levelBaseElevationAt } from './terrain-support.js';
 const DEFAULT_AUTO_SLAB_ELEVATION = 0.05;
 const CEILING_HEIGHT_EPSILON = 1e-6;
 const ROOM_CURVE_TOLERANCE = 0.04;
@@ -139,10 +139,10 @@ function bboxOverlapArea(a, b) {
 // sampling a grid of cell centers over the subject's bbox. Cheap and robust
 // enough for the merge-vs-demote decision; exact polygon clipping would be a
 // heavy dependency for a 60% threshold.
-function polygonCoverageRatio(subject, covers) {
+function polygonCoverageRatio(subject, covers, subjectBounds) {
     if (subject.length < 3 || covers.length === 0)
         return 0;
-    const bbox = bboxOf(subject);
+    const bbox = subjectBounds ?? bboxOf(subject);
     const width = bbox.maxX - bbox.minX;
     const height = bbox.maxY - bbox.minY;
     let inside = 0;
@@ -646,6 +646,17 @@ function sameTuplePolygon(current, next) {
     return (current.length === next.length &&
         current.every((point, index) => point[0] === next[index]?.[0] && point[1] === next[index]?.[1]));
 }
+function sameTuplePolygonRotation(current, next) {
+    if (sameTuplePolygon(current, next))
+        return true;
+    if (current.length !== next.length)
+        return false;
+    // Preserve the stored ring when extraction only changes its starting vertex.
+    return next.some((_, offset) => current.every((point, index) => {
+        const candidate = next[(index + offset) % next.length];
+        return point[0] === candidate[0] && point[1] === candidate[1];
+    }));
+}
 function sameTuplePolygons(current, next) {
     return (current.length === next.length &&
         current.every((polygon, index) => {
@@ -1000,10 +1011,18 @@ function buildSpace(levelId, room) {
         isExterior: false,
     };
 }
-function surfaceTouchesRooms(surface, rooms) {
-    const polygon = surface.polygon.map(pointFromTuple);
-    return rooms.some((room) => polygonCoverageRatio(polygon, [room.polygon]) > 0 ||
-        polygonCoverageRatio(room.polygon, [polygon]) > 0);
+export function surfaceTouchesRooms(surface, rooms) {
+    const { polygon, bbox } = surface;
+    return rooms.some((room) => {
+        if (bbox.maxX < room.bbox.minX ||
+            room.bbox.maxX < bbox.minX ||
+            bbox.maxY < room.bbox.minY ||
+            room.bbox.maxY < bbox.minY) {
+            return false;
+        }
+        return (polygonCoverageRatio(polygon, [room.polygon], bbox) > 0 ||
+            polygonCoverageRatio(room.polygon, [polygon], room.bbox) > 0);
+    });
 }
 function roomsAreRelated(beforeRoom, currentRoom) {
     const beforeIds = new Set(beforeRoom.boundaryFaces.map((boundary) => boundary.wallId));
@@ -1365,7 +1384,7 @@ export function planAutoSlabsForLevel(roomPolygons, existingSlabs, context = {},
                         holeMetadata: [],
                     });
             const data = {};
-            if (!sameTuplePolygon(slab.polygon, update.polygon))
+            if (!sameTuplePolygonRotation(slab.polygon, update.polygon))
                 data.polygon = update.polygon;
             if (!sameTuplePolygons(slab.holes, openings.holes))
                 data.holes = openings.holes;
@@ -1496,7 +1515,7 @@ export function planAutoCeilingsForLevel(roomPolygons, existingCeilings, context
                         holeMetadata: [],
                     });
             const data = {};
-            if (!sameTuplePolygon(ceiling.polygon, update.polygon))
+            if (!sameTuplePolygonRotation(ceiling.polygon, update.polygon))
                 data.polygon = update.polygon;
             if (!sameTuplePolygons(ceiling.holes, openings.holes))
                 data.holes = openings.holes;
@@ -1707,9 +1726,14 @@ function runIndexedSpaceDetection(levelId, topologyDelta, sceneStore, editorStor
             data: { frontSide: update.frontSide, backSide: update.backSide },
         })));
     }
-    const scopedRooms = [...topologyDelta.beforeRooms, ...topologyDelta.currentRooms];
+    const scopedRooms = [...topologyDelta.beforeRooms, ...topologyDelta.currentRooms].map((room) => ({
+        polygon: room.polygon,
+        bbox: bboxOf(room.polygon),
+    }));
     if (scopedRooms.length > 0) {
-        const unaffectedRooms = topologyDelta.allCurrentRooms.filter((room) => !topologyDelta.currentRooms.includes(room));
+        const unaffectedRooms = topologyDelta.allCurrentRooms
+            .filter((room) => !topologyDelta.currentRooms.includes(room))
+            .map((room) => ({ polygon: room.polygon, bbox: bboxOf(room.polygon) }));
         const currentChildren = levelChildren(nodes, levelId);
         const allSlabs = currentChildren
             .filter((node) => node.type === 'slab')
@@ -1717,10 +1741,14 @@ function runIndexedSpaceDetection(levelId, topologyDelta, sceneStore, editorStor
         const allCeilings = currentChildren
             .filter((node) => node.type === 'ceiling')
             .map((ceiling) => CeilingNode.parse(ceiling));
-        const slabs = allSlabs.filter((slab) => surfaceTouchesRooms(slab, scopedRooms) &&
-            (!slab.autoFromWalls || !surfaceTouchesRooms(slab, unaffectedRooms)));
-        const ceilings = allCeilings.filter((ceiling) => surfaceTouchesRooms(ceiling, scopedRooms) &&
-            (!ceiling.autoFromWalls || !surfaceTouchesRooms(ceiling, unaffectedRooms)));
+        const touchesScopedRooms = (surface) => {
+            const polygon = surface.polygon.map(pointFromTuple);
+            const bounded = { polygon, bbox: bboxOf(polygon) };
+            return (surfaceTouchesRooms(bounded, scopedRooms) &&
+                (!surface.autoFromWalls || !surfaceTouchesRooms(bounded, unaffectedRooms)));
+        };
+        const slabs = allSlabs.filter(touchesScopedRooms);
+        const ceilings = allCeilings.filter(touchesScopedRooms);
         const slabRooms = roomsEligibleForAutoSurface(topologyDelta.beforeRooms, topologyDelta.currentRooms, slabs);
         const ceilingRooms = roomsEligibleForAutoSurface(topologyDelta.beforeRooms, topologyDelta.currentRooms, ceilings);
         const levelNode = nodes[levelId];
@@ -1830,6 +1858,11 @@ export function initSpaceDetectionSync(sceneStore, editorStore, options = {}) {
             return;
         adoptSceneBaseline(commit.current.nodes);
     });
+    // Keep reconciliation in this synchronous store subscription. Zundo emits
+    // the originating local SceneCommit only after subscribers return, so the
+    // history-paused derived writes below join that commit's current snapshot
+    // and undo step. Running from subscribeSceneCommits would cross the snapshot
+    // boundary, and the paused writes would emit no replacement commit.
     const unsubscribe = sceneStore.subscribe((state) => {
         if (isProcessing)
             return;

package/dist/lib/terrain-brush.d.ts

@@ -30,7 +30,7 @@
  * one in-flight gesture and dies with it, which is cheaper and clearer than
  * rebuilding a coverage map per pointer-move.
  */
-import { type HeightPatch, type TerrainField } from './terrain-field';
+import { type HeightPatch, type TerrainField } from './terrain-field.js';
 export type BrushShape = 'round' | 'square';
 /**
  * `raise`/`lower` are one verb with an inverted sign at the call site, matching

package/dist/lib/terrain-brush.js

@@ -30,7 +30,7 @@
  * one in-flight gesture and dies with it, which is cheaper and clearer than
  * rebuilding a coverage map per pointer-move.
  */
-import { heightAt, heightAtSample, quantize, } from './terrain-field';
+import { heightAt, heightAtSample, quantize, } from './terrain-field.js';
 export const DEFAULT_BRUSH_SETTINGS = {
     radius: 2,
     strength: 0.6,

package/dist/lib/terrain-codec.d.ts

@@ -24,8 +24,8 @@
  * the wire format must not depend on that being true of the machine that saved
  * the scene.
  */
-import { type TerrainData } from '../schema/terrain';
-import type { HeightPatch, TerrainField } from './terrain-field';
+import { type TerrainData } from '../schema/terrain.js';
+import type { HeightPatch, TerrainField } from './terrain-field.js';
 export type EncodedHeightPatch = Omit<HeightPatch, 'heights'> & {
     heights: string;
 };

package/dist/lib/terrain-codec.js

@@ -24,7 +24,7 @@
  * the wire format must not depend on that being true of the machine that saved
  * the scene.
  */
-import { MAX_TERRAIN_SIDE } from '../schema/terrain';
+import { MAX_TERRAIN_SIDE } from '../schema/terrain.js';
 const BASE64_ALPHABET = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
 function encodeBase64(bytes) {
     let out = '';

package/dist/lib/terrain-raycast.d.ts

@@ -20,7 +20,7 @@
  * ladder, so the returned point is on the same rendered triangle plane
  * `heightAt` reports.
  */
-import { type TerrainField } from './terrain-field';
+import { type TerrainField } from './terrain-field.js';
 export type TerrainHit = {
     /** Distance along the (unnormalized) direction vector. */
     readonly t: number;

package/dist/lib/terrain-raycast.js

@@ -20,7 +20,7 @@
  * ladder, so the returned point is on the same rendered triangle plane
  * `heightAt` reports.
  */
-import { heightAt } from './terrain-field';
+import { heightAt } from './terrain-field.js';
 /** Bisection depth. 20 halvings of one cell is sub-micrometre at any sane spacing. */
 const REFINE_ITERATIONS = 20;
 /**

package/dist/lib/terrain-source.d.ts

@@ -17,9 +17,9 @@
  * the commit, the next read is a cache hit, so a stroke never decodes base64 even
  * once, let alone per dab.
  */
-import type { SiteNode } from '../schema/nodes/site';
-import type { TerrainData } from '../schema/terrain';
-import { createTerrainField, type TerrainField } from './terrain-field';
+import type { SiteNode } from '../schema/nodes/site.js';
+import type { TerrainData } from '../schema/terrain.js';
+import { createTerrainField, type TerrainField } from './terrain-field.js';
 /**
  * The terrain field for a site, or `null` when the site has no sculpted terrain.
  *

package/dist/lib/terrain-source.js

@@ -17,9 +17,9 @@
  * the commit, the next read is a cache hit, so a stroke never decodes base64 even
  * once, let alone per dab.
  */
-import useLiveTerrain from '../store/use-live-terrain';
-import { decodeTerrainField, encodeTerrainField } from './terrain-codec';
-import { createTerrainField } from './terrain-field';
+import useLiveTerrain from '../store/use-live-terrain.js';
+import { decodeTerrainField, encodeTerrainField } from './terrain-codec.js';
+import { createTerrainField } from './terrain-field.js';
 const fieldCache = new WeakMap();
 /**
  * Sites whose `terrain` failed to decode. Prevents re-attempting a doomed decode

package/dist/lib/terrain-support.d.ts

@@ -11,7 +11,7 @@
  * The whole file is pure — nodes in, metres out — which is what lets the stacking
  * matrix be tested per kind without a canvas.
  */
-import type { AnyNode } from '../schema';
+import type { AnyNode } from '../schema/index.js';
 /**
  * World Y of the site datum — the plane terrain heights are measured from.
  *

package/dist/lib/terrain-support.js

@@ -11,9 +11,9 @@
  * The whole file is pure — nodes in, metres out — which is what lets the stacking
  * matrix be tested per kind without a canvas.
  */
-import { getLevelElevations } from '../services/storey';
-import { heightAt } from './terrain-field';
-import { terrainFieldOf } from './terrain-source';
+import { getLevelElevations } from '../services/storey.js';
+import { heightAt } from './terrain-field.js';
+import { terrainFieldOf } from './terrain-source.js';
 /**
  * World Y of the site datum — the plane terrain heights are measured from.
  *

package/dist/lib/unit-containment.d.ts

@@ -0,0 +1,19 @@
+import type { AnyNode, AnyNodeId, BuildingNode, LevelNode, UnitNode, WallNode, ZoneNode } from '../schema/index.js';
+export type UnitDerivation = {
+    unitId: UnitNode['id'];
+    memberZoneIds: ZoneNode['id'][];
+    levelIds: LevelNode['id'][];
+    containedNodeIds: AnyNodeId[];
+    boundaryWallIds: WallNode['id'][];
+    supportIds: AnyNodeId[];
+    visibleNodeIds: AnyNodeId[];
+};
+type Nodes = Readonly<Record<AnyNodeId, AnyNode>>;
+export declare function deriveUnit(unit: UnitNode, nodes: Nodes): UnitDerivation;
+export declare function unitsForZone(zoneId: ZoneNode['id'], nodes: Nodes): UnitNode[];
+export declare function unassignedZoneIds(buildingId: BuildingNode['id'], nodes: Nodes): ZoneNode['id'][];
+export declare function unitWarnings(unit: UnitNode, nodes: Nodes): Array<{
+    code: 'empty' | 'non-adjacent-levels';
+}>;
+export {};
+//# sourceMappingURL=unit-containment.d.ts.map

package/dist/lib/unit-containment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unit-containment.d.ts","sourceRoot":"","sources":["../../src/lib/unit-containment.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,OAAO,EACP,SAAS,EACT,YAAY,EACZ,SAAS,EACT,QAAQ,EACR,QAAQ,EACR,QAAQ,EACT,MAAM,WAAW,CAAA;AAMlB,MAAM,MAAM,cAAc,GAAG;IAC3B,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAA;IACtB,aAAa,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAA;IAC/B,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAA;IAC3B,gBAAgB,EAAE,SAAS,EAAE,CAAA;IAC7B,eAAe,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAA;IACjC,UAAU,EAAE,SAAS,EAAE,CAAA;IACvB,cAAc,EAAE,SAAS,EAAE,CAAA;CAC5B,CAAA;AAED,KAAK,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAA;AA8CjD,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,cAAc,CAuFvE;AAED,wBAAgB,YAAY,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,GAAG,QAAQ,EAAE,CAI7E;AAED,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,EAAE,CAqBhG;AAED,wBAAgB,YAAY,CAC1B,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,KAAK,GACX,KAAK,CAAC;IACP,IAAI,EAAE,OAAO,GAAG,qBAAqB,CAAA;CACtC,CAAC,CAiBD"}