@ifc-lite/parser 5.1.0 → 6.1.0

package/dist/spatial-hierarchy-builder.js

@@ -1,10 +1,11 @@
 /* This Source Code Form is subject to the terms of the Mozilla Public
  * License, v. 2.0. If a copy of the MPL was not distributed with this
  * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
-import { IfcTypeEnum, RelationshipType, createLogger, isBuildingLikeSpatialType, isSpaceLikeSpatialType, isSpatialStructureType, isStoreyLikeSpatialType, IFC_BUILDING_STOREY_ELEVATION_INDEX, IFC_BUILDING_STOREY_PLACEMENT_INDEX, findStoreyByElevation, } from '@ifc-lite/data';
+import { IfcTypeEnum, RelationshipType, isBuildingLikeSpatialType, isSpaceLikeSpatialType, isSpatialStructureType, isStoreyLikeSpatialType, findStoreyByElevation, spatialLookups, } from '@ifc-lite/data';
 import { EntityExtractor } from './entity-extractor.js';
-import { getAttributeNamesAcrossSchemas } from './ifc-schema.js';
-const log = createLogger('SpatialHierarchy');
+import { computeCanonicalParent, computeReachableSpatialNodes } from './spatial-hierarchy-canonical-parent.js';
+import { extractLongName, extractElevation, extractPlacementElevation, } from './spatial-hierarchy-attributes.js';
+import { computeAmbiguousStorey } from './spatial-hierarchy-ambiguity.js';
 export class SpatialHierarchyBuilder {
     /**
      * Fresh-parse build. Extracts storey elevations from the source buffer.
@@ -36,6 +37,8 @@ export class SpatialHierarchyBuilder {
             elementToStorey: new Map(),
             elementToContainer: new Map(),
             visited: new Set(),
+            canonicalParent: computeCanonicalParent(entities, relationships),
+            reachableSpatialNodes: new Set(), // filled in below once IfcProject is known
             attrSource,
             attrExtractor: attrSource ? new EntityExtractor(attrSource.source) : undefined,
         };
@@ -47,6 +50,10 @@ export class SpatialHierarchyBuilder {
             }
             return undefined;
         }
+        // Which storeys buildNode will actually recurse into, computed up front
+        // so ContainsElements resolution below never depends on this node's own
+        // position in the traversal (#4310) - see computeReachableSpatialNodes.
+        ctx.reachableSpatialNodes = computeReachableSpatialNodes(projectIds[0], ctx.canonicalParent);
         const projectNode = this.buildNode(projectIds[0], ctx);
         if (ctx.byStorey.size === 0) {
             console.warn('[SpatialHierarchyBuilder] No storeys found in spatial hierarchy');
@@ -55,13 +62,6 @@ export class SpatialHierarchyBuilder {
             console.warn('[SpatialHierarchyBuilder] No buildings found in spatial hierarchy');
         }
         const { byStorey, byBuilding, bySite, bySpace, storeyElevations, elementToStorey, elementToContainer } = ctx;
-        // Pre-build the element -> space lookup for O(1) getContainingSpace.
-        const elementToSpace = new Map();
-        for (const [spaceId, elementIds] of bySpace) {
-            for (const elementId of elementIds) {
-                elementToSpace.set(elementId, spaceId);
-            }
-        }
         return {
             project: projectNode,
             byStorey,
@@ -73,6 +73,7 @@ export class SpatialHierarchyBuilder {
             storeyHeights: new Map(),
             elementToStorey,
             elementToContainer,
+            ambiguousStorey: computeAmbiguousStorey(byStorey), // #4311
             getStoreyElements(storeyId) {
                 return byStorey.get(storeyId) ?? [];
             },
@@ -82,29 +83,7 @@ export class SpatialHierarchyBuilder {
                 // Z can never resolve to a different storey depending on entry path.
                 return findStoreyByElevation(storeyElevations, z);
             },
-            getContainingSpace(elementId) {
-                return elementToSpace.get(elementId) ?? null;
-            },
-            getPath(elementId) {
-                const path = [];
-                const findPath = (node, targetId) => {
-                    path.push(node);
-                    // Match the node itself (so a promoted space/zone resolves) or one of
-                    // its contained elements.
-                    if (node.expressId === targetId || node.elements.includes(targetId)) {
-                        return true;
-                    }
-                    for (const child of node.children) {
-                        if (findPath(child, targetId)) {
-                            return true;
-                        }
-                    }
-                    path.pop();
-                    return false;
-                };
-                findPath(projectNode, elementId);
-                return path;
-            },
+            ...spatialLookups(projectNode, bySpace, elementToContainer),
         };
     }
     buildNode(expressId, ctx) {
@@ -116,17 +95,23 @@ export class SpatialHierarchyBuilder {
         // show both (issue #1634). It lives only in the raw record, so it needs the
         // source bytes; the source-less buildFromCache fallback leaves it undefined,
         // exactly like storey elevation.
-        const rawLongName = this.extractLongName(expressId, ctx);
+        const rawLongName = extractLongName(expressId, ctx.attrSource, ctx.attrExtractor);
         // Fall back to LongName when Name is empty (common for IfcSpace). Left
         // empty, not a fabricated `Entity #<id>` — it flows into the export layer.
         const name = rawName || rawLongName || '';
         // Only keep LongName as a distinct descriptor when it adds something beyond
         // the primary label (never duplicate it into the secondary slot).
         const longName = rawLongName && rawLongName !== name ? rawLongName : undefined;
-        // Guard against cyclic IfcRelAggregates chains (A aggregates B, B aggregates
-        // A), which would otherwise recurse unbounded and overflow the stack. A
-        // revisited node is returned as a leaf so the rest of the hierarchy still
-        // builds.
+        // This is NOT what actually prevents unbounded recursion on a cyclic
+        // IfcRelAggregates chain (A aggregates B, B aggregates A) - it never
+        // fires today. Recursion here only ever follows a node's ONE canonical
+        // parent (computeCanonicalParent in spatial-hierarchy-canonical-parent.ts
+        // picks exactly one, and skips any candidate that would close a cycle
+        // back through the child, #4246), so a cycle can supply at most one
+        // recursion edge into any node - which structurally cannot loop. Kept as
+        // defence in depth in case that single-parent invariant is ever
+        // weakened; if it does fire, a revisited node is returned as a leaf so
+        // the rest of the hierarchy still builds.
         if (ctx.visited.has(expressId)) {
             return { expressId, type: typeEnum, name, longName, elevation: undefined, children: [], elements: [] };
         }
@@ -135,12 +120,12 @@ export class SpatialHierarchyBuilder {
         let elevation;
         if (typeEnum === IfcTypeEnum.IfcBuildingStorey && ctx.attrSource) {
             const { source, entityIndex, lengthUnitScale } = ctx.attrSource;
-            let rawElevation = this.extractElevation(expressId, source, entityIndex);
+            let rawElevation = extractElevation(expressId, source, entityIndex);
             if (rawElevation === undefined) {
                 // Elevation is optional and frequently null (Revit / ArchiCAD). Fall back
                 // to the storey's Z from its ObjectPlacement so it still orders + lifts in
                 // Exploded mode instead of collapsing to a single floor (#1289).
-                rawElevation = this.extractPlacementElevation(expressId, source, entityIndex);
+                rawElevation = extractPlacementElevation(expressId, source, entityIndex);
             }
             if (rawElevation !== undefined) {
                 elevation = rawElevation * lengthUnitScale;
@@ -177,6 +162,8 @@ export class SpatialHierarchyBuilder {
                 return;
             const childType = entities.getTypeEnum(childId);
             if (isSpatialStructureType(childType) && childType !== IfcTypeEnum.IfcProject) {
+                if (ctx.canonicalParent.get(childId) !== expressId)
+                    return; // canonical parent only, no phantom stub (#4095)
                 spatialChildIds.add(childId);
                 childNodes.push(this.buildNode(childId, ctx));
             }
@@ -201,6 +188,27 @@ export class SpatialHierarchyBuilder {
         }
         if (isStoreyLikeSpatialType(typeEnum)) {
             for (const elementId of containedElements) {
+                // First-declared wins on duplicate containment, matching containedIn()
+                // (#4248) - but only among storeys buildNode actually visits. A
+                // first-declared edge naming an unreachable storey (no path back to
+                // IfcProject, e.g. missing its own IfcRelAggregates edge) is not a
+                // real competing answer: buildNode never runs that storey's own
+                // branch, so nothing would ever claim the element there, and the
+                // element must not be dropped just because a later-declared but
+                // VIABLE storey lost a tie to a candidate that can't win (#4310).
+                // Only storey-like containers compete: a reachable IfcSpace edge
+                // declared first is not a storey answer, and letting it win here
+                // would leave the element with no elementToStorey entry at all
+                // (spaces never run this branch).
+                const containerEdges = relationships.inverse.getEdges(elementId, RelationshipType.ContainsElements);
+                const firstViableContainer = containerEdges.find((edge) => ctx.reachableSpatialNodes.has(edge.target) && isStoreyLikeSpatialType(entities.getTypeEnum(edge.target)));
+                // expressId is always reachable here (buildNode only runs on reachable
+                // nodes) and always has an edge to elementId (elementId came from THIS
+                // storey's own containedElements), so firstViableContainer is always
+                // defined - it can never fall through to the pre-#4310 "assign
+                // unconditionally" behavior by surprise.
+                if (firstViableContainer && firstViableContainer.target !== expressId)
+                    continue; // a viable earlier-declared storey wins instead
                 ctx.elementToStorey.set(elementId, expressId);
                 // Propagate the storey assignment to aggregated descendants (e.g. an
                 // IfcBuildingElementPart child of an IfcWall). Without this, parts have no
@@ -262,131 +270,5 @@ export class SpatialHierarchyBuilder {
         }
         return { expressId, type: typeEnum, name, longName, elevation, children: childNodes, elements: containedElements };
     }
-    /**
-     * Read an entity's LongName by schema attribute *name*. IfcSite / IfcBuilding /
-     * IfcBuildingStorey / IfcSpace (and the IFC4.3 facility/infra containers)
-     * declare LongName at index 7, but IfcProject carries it at a different slot,
-     * so resolving by name (not a fixed index) stays correct across the IfcRoot
-     * family. The lookup spans every bundled schema, so IFC4.3 leaves outside the
-     * parser's IFC4 codegen pin resolve too. Returns the trimmed value, or
-     * undefined when the type declares no LongName, it is empty, or no source
-     * buffer is available (the buildFromCache path).
-     */
-    extractLongName(expressId, ctx) {
-        if (!ctx.attrSource || !ctx.attrExtractor)
-            return undefined;
-        const ref = ctx.attrSource.entityIndex.byId.get(expressId);
-        if (!ref)
-            return undefined;
-        try {
-            const entity = ctx.attrExtractor.extractEntity(ref);
-            if (!entity)
-                return undefined;
-            const idx = getAttributeNamesAcrossSchemas(entity.type).indexOf('LongName');
-            if (idx < 0)
-                return undefined;
-            const raw = (entity.attributes || [])[idx];
-            const value = typeof raw === 'string' ? raw.trim() : '';
-            return value.length > 0 ? value : undefined;
-        }
-        catch (error) {
-            log.caught('Failed to extract LongName', error, {
-                operation: 'extractLongName',
-                entityId: expressId,
-            });
-            return undefined;
-        }
-    }
-    /**
-     * Extract elevation from an IfcBuildingStorey. Elevation is attribute index 9
-     * in both IFC2x3 and IFC4 (GlobalId, OwnerHistory, Name, Description,
-     * ObjectType, ObjectPlacement, Representation, LongName, CompositionType,
-     * Elevation).
-     */
-    extractElevation(expressId, source, entityIndex) {
-        const ref = entityIndex.byId.get(expressId);
-        if (!ref)
-            return undefined;
-        try {
-            const extractor = new EntityExtractor(source);
-            const entity = extractor.extractEntity(ref);
-            if (!entity)
-                return undefined;
-            const attrs = entity.attributes || [];
-            // Number from a raw value or a typed value like ['IFCLENGTHMEASURE', 3.0].
-            const extractNumber = (val) => {
-                if (typeof val === 'number')
-                    return val;
-                if (Array.isArray(val) && val.length === 2 && typeof val[1] === 'number') {
-                    return val[1];
-                }
-                return undefined;
-            };
-            // Read ONLY the Elevation slot: a previous "scan every attribute for a
-            // number < 10000" fallback wrongly treated reference attributes (parsed as
-            // bare express-id numbers, e.g. OwnerHistory #3628 -> 3628) as elevations,
-            // so a storey with a null Elevation got a garbage value instead of falling
-            // through to the ObjectPlacement-Z fallback below (#1289).
-            if (attrs.length > IFC_BUILDING_STOREY_ELEVATION_INDEX) {
-                return extractNumber(attrs[IFC_BUILDING_STOREY_ELEVATION_INDEX]);
-            }
-        }
-        catch (error) {
-            log.caught('Failed to extract elevation', error, {
-                operation: 'extractElevation',
-                entityId: expressId,
-                entityType: 'IfcBuildingStorey',
-            });
-        }
-        return undefined;
-    }
-    /**
-     * Resolve a storey's elevation from its ObjectPlacement, used as a fallback when
-     * the Elevation attribute is null. Walks
-     *   IfcBuildingStorey.ObjectPlacement (IfcLocalPlacement)
-     *     -> RelativePlacement (IfcAxis2Placement3D)
-     *       -> Location (IfcCartesianPoint).Coordinates[2]
-     * i.e. the storey's Z relative to its parent spatial container, which matches
-     * the semantics of the Elevation attribute and avoids folding in any site-level
-     * georeferencing Z. Returns the raw (unscaled) Z, or undefined when the chain
-     * can't be resolved.
-     */
-    extractPlacementElevation(expressId, source, entityIndex) {
-        try {
-            const extractor = new EntityExtractor(source);
-            const readAttrs = (id) => {
-                const ref = entityIndex.byId.get(id);
-                if (!ref)
-                    return undefined;
-                return extractor.extractEntity(ref)?.attributes ?? undefined;
-            };
-            const placementId = readAttrs(expressId)?.[IFC_BUILDING_STOREY_PLACEMENT_INDEX];
-            if (typeof placementId !== 'number')
-                return undefined;
-            // IfcLocalPlacement(PlacementRelTo, RelativePlacement) - RelativePlacement
-            // (index 1) is the IfcAxis2Placement3D carrying this storey's own offset.
-            const axisId = readAttrs(placementId)?.[1];
-            if (typeof axisId !== 'number')
-                return undefined;
-            // IfcAxis2Placement3D(Location, Axis, RefDirection) - Location (index 0) is
-            // an IfcCartesianPoint.
-            const locationId = readAttrs(axisId)?.[0];
-            if (typeof locationId !== 'number')
-                return undefined;
-            // IfcCartesianPoint.Coordinates (index 0) is a list [x, y, z].
-            const coords = readAttrs(locationId)?.[0];
-            if (Array.isArray(coords) && coords.length >= 3 && typeof coords[2] === 'number') {
-                return coords[2];
-            }
-        }
-        catch (error) {
-            log.caught('Failed to extract placement elevation', error, {
-                operation: 'extractPlacementElevation',
-                entityId: expressId,
-                entityType: 'IfcBuildingStorey',
-            });
-        }
-        return undefined;
-    }
 }
 //# sourceMappingURL=spatial-hierarchy-builder.js.map

package/dist/spatial-hierarchy-builder.js.map

@@ -1 +1 @@
-{"version":3,"file":"spatial-hierarchy-builder.js","sourceRoot":"","sources":["../src/spatial-hierarchy-builder.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAgB/D,OAAO,EACL,WAAW,EACX,gBAAgB,EAChB,YAAY,EACZ,yBAAyB,EACzB,sBAAsB,EACtB,sBAAsB,EACtB,uBAAuB,EACvB,mCAAmC,EACnC,mCAAmC,EACnC,qBAAqB,GACtB,MAAM,gBAAgB,CAAC;AAExB,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAExD,OAAO,EAAE,8BAA8B,EAAE,MAAM,iBAAiB,CAAC;AAEjE,MAAM,GAAG,GAAG,YAAY,CAAC,kBAAkB,CAAC,CAAC;AAgC7C,MAAM,OAAO,uBAAuB;IAClC;;;;;OAKG;IACH,KAAK,CACH,QAAqB,EACrB,aAAgC,EAChC,QAAqB,EACrB,MAAmC,EACnC,WAAwE,EACxE,kBAA0B,GAAG;QAE7B,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,aAAa,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,EAAE,IAAI,CAAC,CAAC;QACzG,kEAAkE;QAClE,OAAO,SAA6B,CAAC;IACvC,CAAC;IAED;;;OAGG;IACH,cAAc,CACZ,QAAqB,EACrB,aAAgC;QAEhC,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,aAAa,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAClE,CAAC;IAEO,QAAQ,CACd,QAAqB,EACrB,aAAgC,EAChC,UAAuC,EACvC,gBAAyB;QAEzB,MAAM,GAAG,GAAiB;YACxB,QAAQ;YACR,aAAa;YACb,QAAQ,EAAE,IAAI,GAAG,EAAE;YACnB,UAAU,EAAE,IAAI,GAAG,EAAE;YACrB,MAAM,EAAE,IAAI,GAAG,EAAE;YACjB,OAAO,EAAE,IAAI,GAAG,EAAE;YAClB,gBAAgB,EAAE,IAAI,GAAG,EAAE;YAC3B,eAAe,EAAE,IAAI,GAAG,EAAE;YAC1B,kBAAkB,EAAE,IAAI,GAAG,EAAE;YAC7B,OAAO,EAAE,IAAI,GAAG,EAAE;YAClB,UAAU;YACV,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS;SAC/E,CAAC;QAEF,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAC9D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;YAC1E,IAAI,gBAAgB,EAAE,CAAC;gBACrB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;YACrD,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAEvD,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,iEAAiE,CAAC,CAAC;QAClF,CAAC;QACD,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,mEAAmE,CAAC,CAAC;QACpF,CAAC;QAED,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,kBAAkB,EAAE,GAAG,GAAG,CAAC;QAE7G,qEAAqE;QACrE,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;QACjD,KAAK,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,IAAI,OAAO,EAAE,CAAC;YAC5C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACnC,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAED,OAAO;YACL,OAAO,EAAE,WAAW;YACpB,QAAQ;YACR,UAAU;YACV,MAAM;YACN,OAAO;YACP,gBAAgB;YAChB,2EAA2E;YAC3E,aAAa,EAAE,IAAI,GAAG,EAAkB;YACxC,eAAe;YACf,kBAAkB;YAElB,iBAAiB,CAAC,QAAgB;gBAChC,OAAO,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACtC,CAAC;YAED,oBAAoB,CAAC,CAAS;gBAC5B,qEAAqE;gBACrE,uEAAuE;gBACvE,qEAAqE;gBACrE,OAAO,qBAAqB,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;YACpD,CAAC;YAED,kBAAkB,CAAC,SAAiB;gBAClC,OAAO,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC;YAC/C,CAAC;YAED,OAAO,CAAC,SAAiB;gBACvB,MAAM,IAAI,GAAkB,EAAE,CAAC;gBAC/B,MAAM,QAAQ,GAAG,CAAC,IAAiB,EAAE,QAAgB,EAAW,EAAE;oBAChE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAChB,sEAAsE;oBACtE,0BAA0B;oBAC1B,IAAI,IAAI,CAAC,SAAS,KAAK,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACpE,OAAO,IAAI,CAAC;oBACd,CAAC;oBACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;wBAClC,IAAI,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;4BAC9B,OAAO,IAAI,CAAC;wBACd,CAAC;oBACH,CAAC;oBACD,IAAI,CAAC,GAAG,EAAE,CAAC;oBACX,OAAO,KAAK,CAAC;gBACf,CAAC,CAAC;gBACF,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;gBACjC,OAAO,IAAI,CAAC;YACd,CAAC;SACF,CAAC;IACJ,CAAC;IAEO,SAAS,CAAC,SAAiB,EAAE,GAAiB;QACpD,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,GAAG,CAAC;QACxC,MAAM,QAAQ,GAAG,QAAQ,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC5C,4EAA4E;QAC5E,8EAA8E;QAC9E,4EAA4E;QAC5E,6EAA6E;QAC7E,iCAAiC;QACjC,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACzD,uEAAuE;QACvE,2EAA2E;QAC3E,MAAM,IAAI,GAAG,OAAO,IAAI,WAAW,IAAI,EAAE,CAAC;QAC1C,4EAA4E;QAC5E,kEAAkE;QAClE,MAAM,QAAQ,GAAG,WAAW,IAAI,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QAE/E,6EAA6E;QAC7E,wEAAwE;QACxE,0EAA0E;QAC1E,UAAU;QACV,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QACzG,CAAC;QACD,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAE3B,6EAA6E;QAC7E,IAAI,SAA6B,CAAC;QAClC,IAAI,QAAQ,KAAK,WAAW,CAAC,iBAAiB,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;YACjE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC;YAChE,IAAI,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;YACzE,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC/B,0EAA0E;gBAC1E,2EAA2E;gBAC3E,iEAAiE;gBACjE,YAAY,GAAG,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;YAChF,CAAC;YACD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC/B,SAAS,GAAG,YAAY,GAAG,eAAe,CAAC;gBAC3C,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,MAAM,oBAAoB,GAAG,aAAa,CAAC,UAAU,CAAC,SAAS,EAAE,gBAAgB,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;QAE/G,6EAA6E;QAC7E,8EAA8E;QAC9E,4EAA4E;QAC5E,4EAA4E;QAC5E,8EAA8E;QAC9E,mEAAmE;QACnE,MAAM,iBAAiB,GAAa,EAAE,CAAC;QACvC,MAAM,wBAAwB,GAAa,EAAE,CAAC;QAC9C,KAAK,MAAM,EAAE,IAAI,oBAAoB,EAAE,CAAC;YACtC,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YAC3C,IAAI,sBAAsB,CAAC,SAAS,CAAC,IAAI,SAAS,KAAK,WAAW,CAAC,UAAU,EAAE,CAAC;gBAC9E,wBAAwB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpC,CAAC;iBAAM,CAAC;gBACN,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,MAAM,kBAAkB,GAAG,aAAa,CAAC,UAAU,CAAC,SAAS,EAAE,gBAAgB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAEvG,8EAA8E;QAC9E,4DAA4D;QAC5D,MAAM,UAAU,GAAkB,EAAE,CAAC;QACrC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,MAAM,eAAe,GAAG,CAAC,OAAe,EAAE,EAAE;YAC1C,IAAI,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,OAAO;YACzC,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,sBAAsB,CAAC,SAAS,CAAC,IAAI,SAAS,KAAK,WAAW,CAAC,UAAU,EAAE,CAAC;gBAC9E,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC7B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;QACH,CAAC,CAAC;QACF,KAAK,MAAM,OAAO,IAAI,kBAAkB;YAAE,eAAe,CAAC,OAAO,CAAC,CAAC;QACnE,KAAK,MAAM,OAAO,IAAI,wBAAwB;YAAE,eAAe,CAAC,OAAO,CAAC,CAAC;QAEzE,qDAAqD;QACrD,IAAI,uBAAuB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QACjD,CAAC;aAAM,IAAI,yBAAyB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC/C,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QACnD,CAAC;aAAM,IAAI,QAAQ,KAAK,WAAW,CAAC,OAAO,EAAE,CAAC;YAC5C,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QAC/C,CAAC;aAAM,IAAI,sBAAsB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5C,0EAA0E;YAC1E,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QAChD,CAAC;QAED,IAAI,uBAAuB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtC,KAAK,MAAM,SAAS,IAAI,iBAAiB,EAAE,CAAC;gBAC1C,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBAC9C,qEAAqE;gBACrE,2EAA2E;gBAC3E,yEAAyE;gBACzE,2EAA2E;gBAC3E,0CAA0C;gBAC1C,MAAM,KAAK,GAAa,CAAC,SAAS,CAAC,CAAC;gBACpC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC1C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;oBACtC,MAAM,cAAc,GAAG,aAAa,CAAC,UAAU,CAAC,OAAO,EAAE,gBAAgB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBACjG,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;wBACjC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;4BAAE,SAAS;wBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACd,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;4BAClC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;wBAC1C,CAAC;wBACD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,8EAA8E;YAC9E,0EAA0E;YAC1E,0CAA0C;YAC1C,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;gBACtC,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBACtC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;QACH,CAAC;QAED,4EAA4E;QAC5E,2EAA2E;QAC3E,yEAAyE;QACzE,4EAA4E;QAC5E,qEAAqE;QACrE,4EAA4E;QAC5E,wEAAwE;QACxE,0DAA0D;QAC1D,IAAI,QAAQ,KAAK,WAAW,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,MAAM,SAAS,IAAI,iBAAiB,EAAE,CAAC;gBAC1C,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAa,CAAC,SAAS,CAAC,CAAC;gBACpC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC1C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;oBACtC,MAAM,cAAc,GAAG,aAAa,CAAC,UAAU,CAAC,OAAO,EAAE,gBAAgB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBACjG,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;wBACjC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;4BAAE,SAAS;wBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACd,IAAI,CAAC,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;4BACrC,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;wBAC7C,CAAC;wBACD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IACrH,CAAC;IAED;;;;;;;;;OASG;IACK,eAAe,CAAC,SAAiB,EAAE,GAAiB;QAC1D,IAAI,CAAC,GAAG,CAAC,UAAU,IAAI,CAAC,GAAG,CAAC,aAAa;YAAE,OAAO,SAAS,CAAC;QAC5D,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3D,IAAI,CAAC,GAAG;YAAE,OAAO,SAAS,CAAC;QAC3B,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,GAAG,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;YACpD,IAAI,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YAC9B,MAAM,GAAG,GAAG,8BAA8B,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAC5E,IAAI,GAAG,GAAG,CAAC;gBAAE,OAAO,SAAS,CAAC;YAC9B,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;QAC9C,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,GAAG,CAAC,MAAM,CAAC,4BAA4B,EAAE,KAAK,EAAE;gBAC9C,SAAS,EAAE,iBAAiB;gBAC5B,QAAQ,EAAE,SAAS;aACpB,CAAC,CAAC;YACH,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,gBAAgB,CACtB,SAAiB,EACjB,MAAmC,EACnC,WAAwE;QAExE,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,CAAC,GAAG;YAAE,OAAO,SAAS,CAAC;QAE3B,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC;YAC9C,MAAM,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;YAC5C,IAAI,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YAE9B,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,IAAI,EAAE,CAAC;YAEtC,2EAA2E;YAC3E,MAAM,aAAa,GAAG,CAAC,GAAQ,EAAsB,EAAE;gBACrD,IAAI,OAAO,GAAG,KAAK,QAAQ;oBAAE,OAAO,GAAG,CAAC;gBACxC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;oBACzE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChB,CAAC;gBACD,OAAO,SAAS,CAAC;YACnB,CAAC,CAAC;YAEF,uEAAuE;YACvE,2EAA2E;YAC3E,2EAA2E;YAC3E,2EAA2E;YAC3E,2DAA2D;YAC3D,IAAI,KAAK,CAAC,MAAM,GAAG,mCAAmC,EAAE,CAAC;gBACvD,OAAO,aAAa,CAAC,KAAK,CAAC,mCAAmC,CAAC,CAAC,CAAC;YACnE,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,GAAG,CAAC,MAAM,CAAC,6BAA6B,EAAE,KAAK,EAAE;gBAC/C,SAAS,EAAE,kBAAkB;gBAC7B,QAAQ,EAAE,SAAS;gBACnB,UAAU,EAAE,mBAAmB;aAChC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;OAUG;IACK,yBAAyB,CAC/B,SAAiB,EACjB,MAAmC,EACnC,WAAwE;QAExE,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC;YAC9C,MAAM,SAAS,GAAG,CAAC,EAAU,EAAyB,EAAE;gBACtD,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACrC,IAAI,CAAC,GAAG;oBAAE,OAAO,SAAS,CAAC;gBAC3B,OAAO,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,UAAU,IAAI,SAAS,CAAC;YAC/D,CAAC,CAAC;YAEF,MAAM,WAAW,GAAG,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC,mCAAmC,CAAC,CAAC;YAChF,IAAI,OAAO,WAAW,KAAK,QAAQ;gBAAE,OAAO,SAAS,CAAC;YAEtD,2EAA2E;YAC3E,0EAA0E;YAC1E,MAAM,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,OAAO,MAAM,KAAK,QAAQ;gBAAE,OAAO,SAAS,CAAC;YAEjD,4EAA4E;YAC5E,wBAAwB;YACxB,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,OAAO,UAAU,KAAK,QAAQ;gBAAE,OAAO,SAAS,CAAC;YAErD,+DAA+D;YAC/D,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;gBACjF,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,GAAG,CAAC,MAAM,CAAC,uCAAuC,EAAE,KAAK,EAAE;gBACzD,SAAS,EAAE,2BAA2B;gBACtC,QAAQ,EAAE,SAAS;gBACnB,UAAU,EAAE,mBAAmB;aAChC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;CACF"}
+{"version":3,"file":"spatial-hierarchy-builder.js","sourceRoot":"","sources":["../src/spatial-hierarchy-builder.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAc/D,OAAO,EACL,WAAW,EACX,gBAAgB,EAChB,yBAAyB,EACzB,sBAAsB,EACtB,sBAAsB,EACtB,uBAAuB,EACvB,qBAAqB,EACrB,cAAc,GACf,MAAM,gBAAgB,CAAC;AAExB,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAExD,OAAO,EAAE,sBAAsB,EAAE,4BAA4B,EAAE,MAAM,yCAAyC,CAAC;AAC/G,OAAO,EAEL,eAAe,EACf,gBAAgB,EAChB,yBAAyB,GAC1B,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAAE,sBAAsB,EAAE,MAAM,kCAAkC,CAAC;AAyB1E,MAAM,OAAO,uBAAuB;IAClC;;;;;OAKG;IACH,KAAK,CACH,QAAqB,EACrB,aAAgC,EAChC,QAAqB,EACrB,MAAmC,EACnC,WAAwE,EACxE,kBAA0B,GAAG;QAE7B,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,aAAa,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,EAAE,IAAI,CAAC,CAAC;QACzG,kEAAkE;QAClE,OAAO,SAA6B,CAAC;IACvC,CAAC;IAED;;;OAGG;IACH,cAAc,CACZ,QAAqB,EACrB,aAAgC;QAEhC,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,aAAa,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAClE,CAAC;IAEO,QAAQ,CACd,QAAqB,EACrB,aAAgC,EAChC,UAAuC,EACvC,gBAAyB;QAEzB,MAAM,GAAG,GAAiB;YACxB,QAAQ;YACR,aAAa;YACb,QAAQ,EAAE,IAAI,GAAG,EAAE;YACnB,UAAU,EAAE,IAAI,GAAG,EAAE;YACrB,MAAM,EAAE,IAAI,GAAG,EAAE;YACjB,OAAO,EAAE,IAAI,GAAG,EAAE;YAClB,gBAAgB,EAAE,IAAI,GAAG,EAAE;YAC3B,eAAe,EAAE,IAAI,GAAG,EAAE;YAC1B,kBAAkB,EAAE,IAAI,GAAG,EAAE;YAC7B,OAAO,EAAE,IAAI,GAAG,EAAE;YAClB,eAAe,EAAE,sBAAsB,CAAC,QAAQ,EAAE,aAAa,CAAC;YAChE,qBAAqB,EAAE,IAAI,GAAG,EAAE,EAAE,2CAA2C;YAC7E,UAAU;YACV,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS;SAC/E,CAAC;QAEF,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAC9D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,2DAA2D,CAAC,CAAC;YAC1E,IAAI,gBAAgB,EAAE,CAAC;gBACrB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;YACrD,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,wEAAwE;QACxE,wEAAwE;QACxE,wEAAwE;QACxE,GAAG,CAAC,qBAAqB,GAAG,4BAA4B,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,eAAe,CAAC,CAAC;QAE7F,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAEvD,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,iEAAiE,CAAC,CAAC;QAClF,CAAC;QACD,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,mEAAmE,CAAC,CAAC;QACpF,CAAC;QAED,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,kBAAkB,EAAE,GAAG,GAAG,CAAC;QAG7G,OAAO;YACL,OAAO,EAAE,WAAW;YACpB,QAAQ;YACR,UAAU;YACV,MAAM;YACN,OAAO;YACP,gBAAgB;YAChB,2EAA2E;YAC3E,aAAa,EAAE,IAAI,GAAG,EAAkB;YACxC,eAAe;YACf,kBAAkB;YAClB,eAAe,EAAE,sBAAsB,CAAC,QAAQ,CAAC,EAAE,QAAQ;YAE3D,iBAAiB,CAAC,QAAgB;gBAChC,OAAO,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACtC,CAAC;YAED,oBAAoB,CAAC,CAAS;gBAC5B,qEAAqE;gBACrE,uEAAuE;gBACvE,qEAAqE;gBACrE,OAAO,qBAAqB,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;YACpD,CAAC;YAED,GAAG,cAAc,CAAC,WAAW,EAAE,OAAO,EAAE,kBAAkB,CAAC;SAC5D,CAAC;IACJ,CAAC;IAEO,SAAS,CAAC,SAAiB,EAAE,GAAiB;QACpD,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,GAAG,CAAC;QACxC,MAAM,QAAQ,GAAG,QAAQ,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC5C,4EAA4E;QAC5E,8EAA8E;QAC9E,4EAA4E;QAC5E,6EAA6E;QAC7E,iCAAiC;QACjC,MAAM,WAAW,GAAG,eAAe,CAAC,SAAS,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;QAClF,uEAAuE;QACvE,2EAA2E;QAC3E,MAAM,IAAI,GAAG,OAAO,IAAI,WAAW,IAAI,EAAE,CAAC;QAC1C,4EAA4E;QAC5E,kEAAkE;QAClE,MAAM,QAAQ,GAAG,WAAW,IAAI,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QAE/E,qEAAqE;QACrE,qEAAqE;QACrE,uEAAuE;QACvE,0EAA0E;QAC1E,sEAAsE;QACtE,oEAAoE;QACpE,yEAAyE;QACzE,gEAAgE;QAChE,uEAAuE;QACvE,0CAA0C;QAC1C,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QACzG,CAAC;QACD,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAE3B,6EAA6E;QAC7E,IAAI,SAA6B,CAAC;QAClC,IAAI,QAAQ,KAAK,WAAW,CAAC,iBAAiB,IAAI,GAAG,CAAC,UAAU,EAAE,CAAC;YACjE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC;YAChE,IAAI,YAAY,GAAG,gBAAgB,CAAC,SAAS,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;YACpE,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC/B,0EAA0E;gBAC1E,2EAA2E;gBAC3E,iEAAiE;gBACjE,YAAY,GAAG,yBAAyB,CAAC,SAAS,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;YAC3E,CAAC;YACD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC/B,SAAS,GAAG,YAAY,GAAG,eAAe,CAAC;gBAC3C,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,MAAM,oBAAoB,GAAG,aAAa,CAAC,UAAU,CAAC,SAAS,EAAE,gBAAgB,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;QAE/G,6EAA6E;QAC7E,8EAA8E;QAC9E,4EAA4E;QAC5E,4EAA4E;QAC5E,8EAA8E;QAC9E,mEAAmE;QACnE,MAAM,iBAAiB,GAAa,EAAE,CAAC;QACvC,MAAM,wBAAwB,GAAa,EAAE,CAAC;QAC9C,KAAK,MAAM,EAAE,IAAI,oBAAoB,EAAE,CAAC;YACtC,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YAC3C,IAAI,sBAAsB,CAAC,SAAS,CAAC,IAAI,SAAS,KAAK,WAAW,CAAC,UAAU,EAAE,CAAC;gBAC9E,wBAAwB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpC,CAAC;iBAAM,CAAC;gBACN,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,MAAM,kBAAkB,GAAG,aAAa,CAAC,UAAU,CAAC,SAAS,EAAE,gBAAgB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAEvG,8EAA8E;QAC9E,4DAA4D;QAC5D,MAAM,UAAU,GAAkB,EAAE,CAAC;QACrC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,MAAM,eAAe,GAAG,CAAC,OAAe,EAAE,EAAE;YAC1C,IAAI,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,OAAO;YACzC,MAAM,SAAS,GAAG,QAAQ,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,sBAAsB,CAAC,SAAS,CAAC,IAAI,SAAS,KAAK,WAAW,CAAC,UAAU,EAAE,CAAC;gBAC9E,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,SAAS;oBAAE,OAAO,CAAC,iDAAiD;gBAC7G,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC7B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;QACH,CAAC,CAAC;QACF,KAAK,MAAM,OAAO,IAAI,kBAAkB;YAAE,eAAe,CAAC,OAAO,CAAC,CAAC;QACnE,KAAK,MAAM,OAAO,IAAI,wBAAwB;YAAE,eAAe,CAAC,OAAO,CAAC,CAAC;QAEzE,qDAAqD;QACrD,IAAI,uBAAuB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QACjD,CAAC;aAAM,IAAI,yBAAyB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC/C,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QACnD,CAAC;aAAM,IAAI,QAAQ,KAAK,WAAW,CAAC,OAAO,EAAE,CAAC;YAC5C,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QAC/C,CAAC;aAAM,IAAI,sBAAsB,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5C,0EAA0E;YAC1E,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QAChD,CAAC;QAED,IAAI,uBAAuB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtC,KAAK,MAAM,SAAS,IAAI,iBAAiB,EAAE,CAAC;gBAC1C,uEAAuE;gBACvE,gEAAgE;gBAChE,oEAAoE;gBACpE,mEAAmE;gBACnE,gEAAgE;gBAChE,iEAAiE;gBACjE,gEAAgE;gBAChE,kEAAkE;gBAClE,iEAAiE;gBACjE,iEAAiE;gBACjE,+DAA+D;gBAC/D,kCAAkC;gBAClC,MAAM,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,EAAE,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;gBACpG,MAAM,oBAAoB,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CACxD,GAAG,CAAC,qBAAqB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,uBAAuB,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC5G,uEAAuE;gBACvE,uEAAuE;gBACvE,qEAAqE;gBACrE,+DAA+D;gBAC/D,yCAAyC;gBACzC,IAAI,oBAAoB,IAAI,oBAAoB,CAAC,MAAM,KAAK,SAAS;oBAAE,SAAS,CAAC,gDAAgD;gBACjI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBAC9C,qEAAqE;gBACrE,2EAA2E;gBAC3E,yEAAyE;gBACzE,2EAA2E;gBAC3E,0CAA0C;gBAC1C,MAAM,KAAK,GAAa,CAAC,SAAS,CAAC,CAAC;gBACpC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC1C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;oBACtC,MAAM,cAAc,GAAG,aAAa,CAAC,UAAU,CAAC,OAAO,EAAE,gBAAgB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBACjG,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;wBACjC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;4BAAE,SAAS;wBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACd,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;4BAClC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;wBAC1C,CAAC;wBACD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,8EAA8E;YAC9E,0EAA0E;YAC1E,0CAA0C;YAC1C,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;gBACtC,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBACtC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;QACH,CAAC;QAED,4EAA4E;QAC5E,2EAA2E;QAC3E,yEAAyE;QACzE,4EAA4E;QAC5E,qEAAqE;QACrE,4EAA4E;QAC5E,wEAAwE;QACxE,0DAA0D;QAC1D,IAAI,QAAQ,KAAK,WAAW,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,MAAM,SAAS,IAAI,iBAAiB,EAAE,CAAC;gBAC1C,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAa,CAAC,SAAS,CAAC,CAAC;gBACpC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC1C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;oBACtC,MAAM,cAAc,GAAG,aAAa,CAAC,UAAU,CAAC,OAAO,EAAE,gBAAgB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBACjG,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;wBACjC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;4BAAE,SAAS;wBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACd,IAAI,CAAC,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;4BACrC,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;wBAC7C,CAAC;wBACD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IACrH,CAAC;CACF"}

package/dist/spatial-hierarchy-canonical-parent.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Canonical-parent resolution for `SpatialHierarchyBuilder` (split out to stay
+ * under the module-size budget, #4095).
+ */
+import type { EntityTable, RelationshipGraph } from '@ifc-lite/data';
+/**
+ * Is `candidateParent` reachable from `childId` by walking forward
+ * `IfcRelAggregates` edges (i.e. is `childId` an ANCESTOR of `candidateParent`
+ * in the raw, unresolved aggregation graph)? Used only to disqualify a tied
+ * candidate parent that would close a cycle back through the child itself -
+ * see the doc comment on `computeCanonicalParent` for why that specific shape
+ * needs a check at all. Bounded to `childId`'s own (raw) aggregation
+ * subtree, so it only costs anything on an already-malformed file where a
+ * child has more than one candidate Aggregates parent - the common case
+ * (one candidate) never calls this.
+ */
+/**
+ * Upper bound on aggregate-graph node visits spent on back-edge cycle checks
+ * for one file. The check only runs for children named by MORE THAN ONE
+ * IfcRelAggregates (already malformed), and costs one descendant walk per
+ * such child - O(V+E) each - so a crafted file with thousands of contested
+ * children could otherwise burn O(C·(V+E)). Past the budget the resolver
+ * falls back to plain first-declared-wins (the pre-#4285 behaviour) and says
+ * so once, instead of stalling the parse.
+ */
+export declare const CYCLE_CHECK_VISIT_BUDGET = 2000000;
+/**
+ * Resolve each spatial-structure entity's ONE canonical parent, globally,
+ * before any recursion starts - so the result cannot depend on traversal
+ * order. Mirrors apps/server's `canonical_parent` (`spatial.rs`, #3973):
+ *
+ *  1. IfcRelAggregates always wins over mere containment. A child aggregated
+ *     by more than one parent (a malformed file) resolves to the parent
+ *     whose `IfcRelAggregates` was declared FIRST in the file - STEP does
+ *     not require express ids to ascend with declaration position, so a
+ *     lowest-express-id tie-break can disagree with declaration order (a
+ *     legally-valid file can declare a high-id relationship before a
+ *     low-id one). `relationships.inverse.getEdges` returns edges in
+ *     declaration order: `RelationshipGraphBuilder.addEdge` is called by
+ *     the parser while it scans `IfcRel*` records in file/byte order (see
+ *     `columnar-parser.ts`'s relationship loop), and `buildCSR`'s counting
+ *     sort is stable per key (`relationship-graph.ts`) - it scatters edges
+ *     for the same child in the order they were appended, never
+ *     reordering by id. So `edges[0]` for a given child is the
+ *     first-declared parent edge; no id comparison is needed or correct -
+ *     EXCEPT that a candidate closing a cycle back through the child is
+ *     skipped first (see `aggregatedDescendants`, #4246): a mutual or
+ *     longer aggregation back-edge cannot win a tie against a candidate that
+ *     doesn't orphan the child's own subtree from itself. Each time that
+ *     happens, a warning is logged (always-visible, like the existing
+ *     "No storeys/buildings found" warnings below) naming the child and the
+ *     disqualified candidate - the only signal a caller gets that a
+ *     malformed back-edge was found and repaired, short of building a
+ *     dedicated report (out of scope here; see the #4208 semantic drop
+ *     census for that shape of reporting - a different layer: per-STEP-class
+ *     scan/retain counts collected during columnar categorization, not a
+ *     graph-repair event like this one).
+ *  2. Only when a child has NO aggregates edge at all does a containment edge
+ *     (IfcRelContainedInSpatialStructure targeting a spatial-structure type -
+ *     the Revit Family/Dynamo `IfcSpace`/`IfcSpatialZone` pattern, #1075)
+ *     get to claim it, with the same first-declared tie-break.
+ *
+ * `SpatialHierarchyBuilder.buildNode`'s `addSpatialChild` then only recurses
+ * into a child from its canonical parent - every other parent that also
+ * names the child drops the edge instead of adding an empty-stub duplicate
+ * (#4095).
+ */
+export declare function computeCanonicalParent(entities: EntityTable, relationships: RelationshipGraph, options?: {
+    cycleCheckVisitBudget?: number;
+}): Map<number, number>;
+/**
+ * Which spatial-structure nodes will `SpatialHierarchyBuilder.buildNode`
+ * actually visit, starting from `projectId`? Mirrors `addSpatialChild`
+ * exactly: a node is visited iff it is `projectId` itself, or its
+ * `canonicalParent` entry points to an already-visited node - the same
+ * check `addSpatialChild` makes before recursing (`canonicalParent.get
+ * (childId) === expressId`). Computed as one forward walk over
+ * `canonicalParent` (childId -> parentId) up front, so a storey's
+ * reachability never depends on where in the traversal it happens to sit
+ * (#4310): a node named only by an unreachable storey - one with no path
+ * back to `projectId`, e.g. a malformed file where a storey has no
+ * `IfcRelAggregates` edge at all - is never in this set, exactly as
+ * `buildNode` would never recurse into it.
+ */
+export declare function computeReachableSpatialNodes(projectId: number, canonicalParent: Map<number, number>): Set<number>;
+//# sourceMappingURL=spatial-hierarchy-canonical-parent.d.ts.map

package/dist/spatial-hierarchy-canonical-parent.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spatial-hierarchy-canonical-parent.d.ts","sourceRoot":"","sources":["../src/spatial-hierarchy-canonical-parent.ts"],"names":[],"mappings":"AAIA;;;GAGG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAKrE;;;;;;;;;;GAUG;AACH;;;;;;;;GAQG;AACH,eAAO,MAAM,wBAAwB,UAAY,CAAC;AA4BlD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,WAAW,EACrB,aAAa,EAAE,iBAAiB,EAChC,OAAO,GAAE;IAAE,qBAAqB,CAAC,EAAE,MAAM,CAAA;CAAO,GAC/C,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA6FrB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,4BAA4B,CAC1C,SAAS,EAAE,MAAM,EACjB,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GACnC,GAAG,CAAC,MAAM,CAAC,CAsBb"}

package/dist/spatial-hierarchy-canonical-parent.js

@@ -0,0 +1,212 @@
+/* This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at https://mozilla.org/MPL/2.0/. */
+import { IfcTypeEnum, RelationshipType, createLogger, isSpatialStructureType } from '@ifc-lite/data';
+const log = createLogger('SpatialHierarchy');
+/**
+ * Is `candidateParent` reachable from `childId` by walking forward
+ * `IfcRelAggregates` edges (i.e. is `childId` an ANCESTOR of `candidateParent`
+ * in the raw, unresolved aggregation graph)? Used only to disqualify a tied
+ * candidate parent that would close a cycle back through the child itself -
+ * see the doc comment on `computeCanonicalParent` for why that specific shape
+ * needs a check at all. Bounded to `childId`'s own (raw) aggregation
+ * subtree, so it only costs anything on an already-malformed file where a
+ * child has more than one candidate Aggregates parent - the common case
+ * (one candidate) never calls this.
+ */
+/**
+ * Upper bound on aggregate-graph node visits spent on back-edge cycle checks
+ * for one file. The check only runs for children named by MORE THAN ONE
+ * IfcRelAggregates (already malformed), and costs one descendant walk per
+ * such child - O(V+E) each - so a crafted file with thousands of contested
+ * children could otherwise burn O(C·(V+E)). Past the budget the resolver
+ * falls back to plain first-declared-wins (the pre-#4285 behaviour) and says
+ * so once, instead of stalling the parse.
+ */
+export const CYCLE_CHECK_VISIT_BUDGET = 2_000_000;
+/**
+ * Aggregated descendants of `childId` (transitive, forward `Aggregates`),
+ * charged against `budget`. Returns null when the budget ran out mid-walk
+ * (the partial set must not be used - a missing descendant reads as "no
+ * cycle", which is the wrong side to err on).
+ */
+function aggregatedDescendants(childId, relationships, budget) {
+    const visited = new Set([childId]);
+    const stack = [childId];
+    while (stack.length > 0) {
+        const current = stack.pop();
+        for (const kid of relationships.getRelated(current, RelationshipType.Aggregates, 'forward')) {
+            if (--budget.visits < 0)
+                return null;
+            if (!visited.has(kid)) {
+                visited.add(kid);
+                stack.push(kid);
+            }
+        }
+    }
+    return visited;
+}
+/**
+ * Resolve each spatial-structure entity's ONE canonical parent, globally,
+ * before any recursion starts - so the result cannot depend on traversal
+ * order. Mirrors apps/server's `canonical_parent` (`spatial.rs`, #3973):
+ *
+ *  1. IfcRelAggregates always wins over mere containment. A child aggregated
+ *     by more than one parent (a malformed file) resolves to the parent
+ *     whose `IfcRelAggregates` was declared FIRST in the file - STEP does
+ *     not require express ids to ascend with declaration position, so a
+ *     lowest-express-id tie-break can disagree with declaration order (a
+ *     legally-valid file can declare a high-id relationship before a
+ *     low-id one). `relationships.inverse.getEdges` returns edges in
+ *     declaration order: `RelationshipGraphBuilder.addEdge` is called by
+ *     the parser while it scans `IfcRel*` records in file/byte order (see
+ *     `columnar-parser.ts`'s relationship loop), and `buildCSR`'s counting
+ *     sort is stable per key (`relationship-graph.ts`) - it scatters edges
+ *     for the same child in the order they were appended, never
+ *     reordering by id. So `edges[0]` for a given child is the
+ *     first-declared parent edge; no id comparison is needed or correct -
+ *     EXCEPT that a candidate closing a cycle back through the child is
+ *     skipped first (see `aggregatedDescendants`, #4246): a mutual or
+ *     longer aggregation back-edge cannot win a tie against a candidate that
+ *     doesn't orphan the child's own subtree from itself. Each time that
+ *     happens, a warning is logged (always-visible, like the existing
+ *     "No storeys/buildings found" warnings below) naming the child and the
+ *     disqualified candidate - the only signal a caller gets that a
+ *     malformed back-edge was found and repaired, short of building a
+ *     dedicated report (out of scope here; see the #4208 semantic drop
+ *     census for that shape of reporting - a different layer: per-STEP-class
+ *     scan/retain counts collected during columnar categorization, not a
+ *     graph-repair event like this one).
+ *  2. Only when a child has NO aggregates edge at all does a containment edge
+ *     (IfcRelContainedInSpatialStructure targeting a spatial-structure type -
+ *     the Revit Family/Dynamo `IfcSpace`/`IfcSpatialZone` pattern, #1075)
+ *     get to claim it, with the same first-declared tie-break.
+ *
+ * `SpatialHierarchyBuilder.buildNode`'s `addSpatialChild` then only recurses
+ * into a child from its canonical parent - every other parent that also
+ * names the child drops the edge instead of adding an empty-stub duplicate
+ * (#4095).
+ */
+export function computeCanonicalParent(entities, relationships, options = {}) {
+    const canonicalParent = new Map();
+    const visitBudget = options.cycleCheckVisitBudget ?? CYCLE_CHECK_VISIT_BUDGET;
+    const cycleBudget = { visits: visitBudget };
+    let cycleBudgetExhausted = false;
+    const claimFirstDeclaredParent = (predicate, relType) => {
+        for (const childId of relationships.inverse.offsets.keys()) {
+            if (canonicalParent.has(childId) || !predicate(childId))
+                continue;
+            const edges = relationships.inverse.getEdges(childId, relType);
+            if (edges.length === 0)
+                continue;
+            // `edges[0]` is the first-declared edge of this type for this child -
+            // see the doc comment above for why the CSR preserves declaration
+            // order here. This mirrors apps/server's `canonical_parent`
+            // (`spatial.rs`), which does `entry(...).or_insert(...)` while
+            // iterating relationships in file-scan order: first occurrence wins.
+            let winner = edges[0];
+            if (relType === RelationshipType.Aggregates && edges.length > 1) {
+                // A child named as the target of more than one IfcRelAggregates is
+                // already a malformed file, but one shape needs a special rule: a
+                // BACK-EDGE, where a candidate parent P is itself a (possibly
+                // indirect) AGGREGATED DESCENDANT of this very child - i.e. taking P
+                // as childId's parent would close a cycle back through childId. That
+                // is the STEP-authoring-tool mistake of declaring an aggregation
+                // pair in both directions (#4246, the direct 2-node case; the same
+                // shape generalizes to a longer A->B->C->A chain). If the back-edge
+                // is declared before the real parent edge, plain first-declared-wins
+                // picks P as childId's canonical parent; P's own resolution (walking
+                // the SAME cycle) then independently lands back on a node inside the
+                // cycle too, so the whole cycle points at itself and none of it is
+                // reachable from IfcProject - orphaning whatever real subtree hung
+                // off any node in the cycle.
+                //
+                // Skip any candidate edge that closes a cycle through childId and
+                // take the first REMAINING candidate, still by declaration order -
+                // this changes nothing when a child has only one candidate (the
+                // overwhelmingly common case) or when none of its candidates close a
+                // cycle (the genuine multiple-real-parents case, #4095, which this
+                // loop never even sees more than one Aggregates edge for - #4095's
+                // contested child has exactly one Aggregates edge naming it; its
+                // OTHER "parent" only contains it). If EVERY candidate closes a
+                // cycle (a more degenerate file than anything observed), fall
+                // through to plain first-declared so the child is never left
+                // without a parent.
+                //
+                // One descendant walk per contested child (not per candidate), under a
+                // file-wide visit budget - see CYCLE_CHECK_VISIT_BUDGET.
+                const descendants = cycleBudgetExhausted ? null : aggregatedDescendants(childId, relationships, cycleBudget);
+                if (descendants === null) {
+                    if (!cycleBudgetExhausted) {
+                        cycleBudgetExhausted = true;
+                        log.warn(`Aggregation back-edge cycle checks stopped after ${visitBudget} graph visits; ` +
+                            'remaining multi-parent children resolve to their first-declared IfcRelAggregates edge');
+                    }
+                }
+                else {
+                    const rejected = [];
+                    const nonCyclic = edges.find((edge) => {
+                        const cyclic = descendants.has(edge.target);
+                        if (cyclic)
+                            rejected.push(edge.target);
+                        return !cyclic;
+                    });
+                    if (nonCyclic && nonCyclic !== winner) {
+                        log.warn(`Ignored ${rejected.length} aggregation back-edge cycle(s): #${childId} kept parent #${nonCyclic.target}, ` +
+                            `not ${rejected.map((id) => `#${id}`).join(', ')} (each would have closed a cycle back through #${childId})`);
+                        winner = nonCyclic;
+                    }
+                }
+            }
+            // Inverse edges flip source/target, so `target` here is the original
+            // relationship's `relating_id` (the parent).
+            canonicalParent.set(childId, winner.target);
+        }
+    };
+    // Pass 1: aggregation, unconditionally - it always wins.
+    claimFirstDeclaredParent(() => true, RelationshipType.Aggregates);
+    // Pass 2: promotion-by-containment, only for children aggregation left unclaimed.
+    claimFirstDeclaredParent((childId) => {
+        const childType = entities.getTypeEnum(childId);
+        return isSpatialStructureType(childType) && childType !== IfcTypeEnum.IfcProject;
+    }, RelationshipType.ContainsElements);
+    return canonicalParent;
+}
+/**
+ * Which spatial-structure nodes will `SpatialHierarchyBuilder.buildNode`
+ * actually visit, starting from `projectId`? Mirrors `addSpatialChild`
+ * exactly: a node is visited iff it is `projectId` itself, or its
+ * `canonicalParent` entry points to an already-visited node - the same
+ * check `addSpatialChild` makes before recursing (`canonicalParent.get
+ * (childId) === expressId`). Computed as one forward walk over
+ * `canonicalParent` (childId -> parentId) up front, so a storey's
+ * reachability never depends on where in the traversal it happens to sit
+ * (#4310): a node named only by an unreachable storey - one with no path
+ * back to `projectId`, e.g. a malformed file where a storey has no
+ * `IfcRelAggregates` edge at all - is never in this set, exactly as
+ * `buildNode` would never recurse into it.
+ */
+export function computeReachableSpatialNodes(projectId, canonicalParent) {
+    const childrenOf = new Map();
+    for (const [childId, parentId] of canonicalParent) {
+        let siblings = childrenOf.get(parentId);
+        if (!siblings) {
+            siblings = [];
+            childrenOf.set(parentId, siblings);
+        }
+        siblings.push(childId);
+    }
+    const reachable = new Set([projectId]);
+    const stack = [projectId];
+    while (stack.length > 0) {
+        const current = stack.pop();
+        for (const childId of childrenOf.get(current) ?? []) {
+            if (reachable.has(childId))
+                continue; // also guards a canonicalParent cycle from looping forever
+            reachable.add(childId);
+            stack.push(childId);
+        }
+    }
+    return reachable;
+}
+//# sourceMappingURL=spatial-hierarchy-canonical-parent.js.map