@ifc-lite/data 3.5.1 → 4.0.0

package/dist/color.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Colour-space helpers shared by every glTF/GLB reader in this repo.
+ *
+ * glTF's `baseColorFactor`/`emissiveFactor` are defined in linear-light space
+ * (per the glTF 2.0 spec), while IFC colours (and the mesh colours the viewer
+ * consumes) are sRGB-encoded (IEC 61966-2-1). The Rust GLB exporter and the
+ * TypeScript `@ifc-lite/export` GLTFExporter both decode sRGB into linear on
+ * write; every GLB reader in this repo must apply the exact inverse on read
+ * so an export -> re-import round-trip is lossless and any spec-conformant
+ * external GLB is interpreted correctly.
+ */
+/**
+ * Encode a single linear-light channel value to sRGB, clamped to [0, 1].
+ * Inverse of the exporters' sRGB-to-linear conversion.
+ */
+export declare function linearToSrgb(c: number): number;
+//# sourceMappingURL=color.d.ts.map

package/dist/color.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"color.d.ts","sourceRoot":"","sources":["../src/color.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;GAUG;AAEH;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAI9C"}

package/dist/color.js

@@ -0,0 +1,24 @@
+/* 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/. */
+/**
+ * Colour-space helpers shared by every glTF/GLB reader in this repo.
+ *
+ * glTF's `baseColorFactor`/`emissiveFactor` are defined in linear-light space
+ * (per the glTF 2.0 spec), while IFC colours (and the mesh colours the viewer
+ * consumes) are sRGB-encoded (IEC 61966-2-1). The Rust GLB exporter and the
+ * TypeScript `@ifc-lite/export` GLTFExporter both decode sRGB into linear on
+ * write; every GLB reader in this repo must apply the exact inverse on read
+ * so an export -> re-import round-trip is lossless and any spec-conformant
+ * external GLB is interpreted correctly.
+ */
+/**
+ * Encode a single linear-light channel value to sRGB, clamped to [0, 1].
+ * Inverse of the exporters' sRGB-to-linear conversion.
+ */
+export function linearToSrgb(c) {
+    const x = c <= 0 ? 0 : c >= 1 ? 1 : c;
+    const encoded = x <= 0.0031308 ? x * 12.92 : 1.055 * Math.pow(x, 1 / 2.4) - 0.055;
+    return encoded < 0 ? 0 : encoded > 1 ? 1 : encoded;
+}
+//# sourceMappingURL=color.js.map

package/dist/color.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"color.js","sourceRoot":"","sources":["../src/color.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;GAUG;AAEH;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS;IACpC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;IAClF,OAAO,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;AACrD,CAAC"}

package/dist/decomposition.d.ts

@@ -0,0 +1,32 @@
+/**
+ * `IfcRelAggregates` decomposition traversal.
+ *
+ * An assembly — `IfcElementAssembly`, an `IfcStair`/`IfcRoof`/`IfcRamp` used
+ * as a container, a wall with `IfcBuildingElementPart`s — often carries no
+ * mesh of its own; its parts (stair flights, railings, landing slabs, …)
+ * hang off it via `IfcRelAggregates`. Any consumer that resolves a selector
+ * to a container id and hands that straight to a mesh-keyed sink (a
+ * highlight set, a visibility override, a bounding-box lookup) sees nothing,
+ * because the container itself is never a key in that sink. This module is
+ * the single traversal both `apps/viewer` (which additionally knows which
+ * ids actually rendered, and filters to those) and `packages/mcp` (which
+ * does not have that live rendering information and instead passes the full
+ * decomposition closure through, safe because the mesh-keyed sinks already
+ * no-op on ids they never rendered) build their own expansion on top of.
+ */
+import { RelationshipType } from './types.js';
+/** Structural view of the relationship graph — both the parser's
+ *  `RelationshipGraph` and a cache-rebuilt or test-double graph satisfy it. */
+export interface DecompositionRelationships {
+    getRelated(entityId: number, relType: RelationshipType, direction: 'forward' | 'inverse'): number[];
+}
+/** Direct `IfcRelAggregates` children of `expressId` (one level down). */
+export declare function getAggregatedChildren(relationships: DecompositionRelationships | undefined, expressId: number): number[];
+/**
+ * All decomposition descendants of `rootId` via `IfcRelAggregates`, depth-first
+ * and excluding `rootId` itself. Cycle-guarded against malformed files
+ * (A aggregates B, B aggregates A) so it always terminates. Order is a stable
+ * pre-order so callers can rely on it for display.
+ */
+export declare function collectAggregatedDescendants(relationships: DecompositionRelationships | undefined, rootId: number): number[];
+//# sourceMappingURL=decomposition.d.ts.map

package/dist/decomposition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decomposition.d.ts","sourceRoot":"","sources":["../src/decomposition.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAE9C;+EAC+E;AAC/E,MAAM,WAAW,0BAA0B;IACzC,UAAU,CACR,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,gBAAgB,EACzB,SAAS,EAAE,SAAS,GAAG,SAAS,GAC/B,MAAM,EAAE,CAAC;CACb;AAED,0EAA0E;AAC1E,wBAAgB,qBAAqB,CACnC,aAAa,EAAE,0BAA0B,GAAG,SAAS,EACrD,SAAS,EAAE,MAAM,GAChB,MAAM,EAAE,CAGV;AAED;;;;;GAKG;AACH,wBAAgB,4BAA4B,CAC1C,aAAa,EAAE,0BAA0B,GAAG,SAAS,EACrD,MAAM,EAAE,MAAM,GACb,MAAM,EAAE,CAoBV"}

package/dist/decomposition.js

@@ -0,0 +1,57 @@
+/* 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/. */
+/**
+ * `IfcRelAggregates` decomposition traversal.
+ *
+ * An assembly — `IfcElementAssembly`, an `IfcStair`/`IfcRoof`/`IfcRamp` used
+ * as a container, a wall with `IfcBuildingElementPart`s — often carries no
+ * mesh of its own; its parts (stair flights, railings, landing slabs, …)
+ * hang off it via `IfcRelAggregates`. Any consumer that resolves a selector
+ * to a container id and hands that straight to a mesh-keyed sink (a
+ * highlight set, a visibility override, a bounding-box lookup) sees nothing,
+ * because the container itself is never a key in that sink. This module is
+ * the single traversal both `apps/viewer` (which additionally knows which
+ * ids actually rendered, and filters to those) and `packages/mcp` (which
+ * does not have that live rendering information and instead passes the full
+ * decomposition closure through, safe because the mesh-keyed sinks already
+ * no-op on ids they never rendered) build their own expansion on top of.
+ */
+import { RelationshipType } from './types.js';
+/** Direct `IfcRelAggregates` children of `expressId` (one level down). */
+export function getAggregatedChildren(relationships, expressId) {
+    if (!relationships)
+        return [];
+    return relationships.getRelated(expressId, RelationshipType.Aggregates, 'forward');
+}
+/**
+ * All decomposition descendants of `rootId` via `IfcRelAggregates`, depth-first
+ * and excluding `rootId` itself. Cycle-guarded against malformed files
+ * (A aggregates B, B aggregates A) so it always terminates. Order is a stable
+ * pre-order so callers can rely on it for display.
+ */
+export function collectAggregatedDescendants(relationships, rootId) {
+    if (!relationships)
+        return [];
+    const out = [];
+    const seen = new Set([rootId]);
+    // DFS with an explicit stack; push children in reverse so siblings keep
+    // their authored order in the pre-order output.
+    const stack = [];
+    const pushChildren = (parentId) => {
+        const kids = relationships.getRelated(parentId, RelationshipType.Aggregates, 'forward');
+        for (let i = kids.length - 1; i >= 0; i--)
+            stack.push(kids[i]);
+    };
+    pushChildren(rootId);
+    while (stack.length > 0) {
+        const id = stack.pop();
+        if (seen.has(id))
+            continue;
+        seen.add(id);
+        out.push(id);
+        pushChildren(id);
+    }
+    return out;
+}
+//# sourceMappingURL=decomposition.js.map

package/dist/decomposition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decomposition.js","sourceRoot":"","sources":["../src/decomposition.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAY9C,0EAA0E;AAC1E,MAAM,UAAU,qBAAqB,CACnC,aAAqD,EACrD,SAAiB;IAEjB,IAAI,CAAC,aAAa;QAAE,OAAO,EAAE,CAAC;IAC9B,OAAO,aAAa,CAAC,UAAU,CAAC,SAAS,EAAE,gBAAgB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;AACrF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,4BAA4B,CAC1C,aAAqD,EACrD,MAAc;IAEd,IAAI,CAAC,aAAa;QAAE,OAAO,EAAE,CAAC;IAC9B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IACvC,wEAAwE;IACxE,gDAAgD;IAChD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,YAAY,GAAG,CAAC,QAAgB,EAAE,EAAE;QACxC,MAAM,IAAI,GAAG,aAAa,CAAC,UAAU,CAAC,QAAQ,EAAE,gBAAgB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QACxF,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC;IACF,YAAY,CAAC,MAAM,CAAC,CAAC;IACrB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAC3B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACb,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/group-property-sets.d.ts

@@ -0,0 +1,15 @@
+import type { StringTable } from './string-table.js';
+import type { PropertySet, PropertyValue } from './property-table.js';
+/**
+ * Group a row-index list into `PropertySet`s keyed on `(psetName, psetGlobalId)`,
+ * not name alone -- two `IfcPropertySet` instances that share a literal name
+ * (a federated merge, or an exporter emitting the same Pset_ twice on one
+ * element) must stay distinct, or the second instance's properties come back
+ * attributed to the first instance's GlobalId. Shared by the live
+ * `PropertyTable.getForEntity` (in `property-table.ts`) and by
+ * `@ifc-lite/cache`'s cache-rehydrated `readProperties`, which reads the same
+ * columnar arrays back from the binary cache -- a single grouping algorithm
+ * keeps the two paths from re-diverging.
+ */
+export declare function groupPropertySetsByInstance(rowIndices: readonly number[], psetName: Uint32Array, psetGlobalId: Uint32Array, propName: Uint32Array, propType: Uint8Array, strings: StringTable, getValue: (idx: number) => PropertyValue): PropertySet[];
+//# sourceMappingURL=group-property-sets.d.ts.map

package/dist/group-property-sets.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"group-property-sets.d.ts","sourceRoot":"","sources":["../src/group-property-sets.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEtE;;;;;;;;;;GAUG;AACH,wBAAgB,2BAA2B,CACzC,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,QAAQ,EAAE,WAAW,EACrB,YAAY,EAAE,WAAW,EACzB,QAAQ,EAAE,WAAW,EACrB,QAAQ,EAAE,UAAU,EACpB,OAAO,EAAE,WAAW,EACpB,QAAQ,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,aAAa,GACvC,WAAW,EAAE,CAiBf"}

package/dist/group-property-sets.js

@@ -0,0 +1,33 @@
+/* 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/. */
+/**
+ * Group a row-index list into `PropertySet`s keyed on `(psetName, psetGlobalId)`,
+ * not name alone -- two `IfcPropertySet` instances that share a literal name
+ * (a federated merge, or an exporter emitting the same Pset_ twice on one
+ * element) must stay distinct, or the second instance's properties come back
+ * attributed to the first instance's GlobalId. Shared by the live
+ * `PropertyTable.getForEntity` (in `property-table.ts`) and by
+ * `@ifc-lite/cache`'s cache-rehydrated `readProperties`, which reads the same
+ * columnar arrays back from the binary cache -- a single grouping algorithm
+ * keeps the two paths from re-diverging.
+ */
+export function groupPropertySetsByInstance(rowIndices, psetName, psetGlobalId, propName, propType, strings, getValue) {
+    const psets = new Map();
+    for (const idx of rowIndices) {
+        const psetNameStr = strings.get(psetName[idx]), psetGlobalIdStr = strings.get(psetGlobalId[idx]);
+        const key = psetNameStr + '\u0000' + psetGlobalIdStr;
+        if (!psets.has(key)) {
+            psets.set(key, { name: psetNameStr, globalId: psetGlobalIdStr, properties: [] });
+        }
+        const pset = psets.get(key);
+        const propNameStr = strings.get(propName[idx]);
+        pset.properties.push({
+            name: propNameStr,
+            type: propType[idx],
+            value: getValue(idx),
+        });
+    }
+    return Array.from(psets.values());
+}
+//# sourceMappingURL=group-property-sets.js.map

package/dist/group-property-sets.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"group-property-sets.js","sourceRoot":"","sources":["../src/group-property-sets.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAK/D;;;;;;;;;;GAUG;AACH,MAAM,UAAU,2BAA2B,CACzC,UAA6B,EAC7B,QAAqB,EACrB,YAAyB,EACzB,QAAqB,EACrB,QAAoB,EACpB,OAAoB,EACpB,QAAwC;IAExC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC7C,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;QACjG,MAAM,GAAG,GAAG,WAAW,GAAG,QAAQ,GAAG,eAAe,CAAC;QACrD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;QACnF,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;YACnB,IAAI,EAAE,WAAW;YACjB,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC;YACnB,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC;SACrB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;AACpC,CAAC"}

package/dist/group-quantity-sets.d.ts

@@ -0,0 +1,17 @@
+import type { StringTable } from './string-table.js';
+import type { QuantitySet } from './quantity-table.js';
+/**
+ * Group a row-index list into `QuantitySet`s keyed on `(qsetName, qsetGlobalId)`,
+ * not name alone -- two `IfcElementQuantity` instances that share a literal
+ * name (a federated merge, or an exporter emitting the same Qto_ set twice on
+ * one element) must stay distinct, or the second instance's quantities come
+ * back attributed to the first instance's GlobalId. Mirrors
+ * `groupPropertySetsByInstance` (same defect, same fix, on the property
+ * side). Shared by the live `QuantityTable.getForEntity` (in
+ * `quantity-table.ts`) and by `@ifc-lite/cache`'s cache-rehydrated
+ * `readQuantities`, which reads the same columnar arrays back from the
+ * binary cache -- a single grouping algorithm keeps the two paths from
+ * diverging.
+ */
+export declare function groupQuantitySetsByInstance(rowIndices: readonly number[], qsetName: Uint32Array, qsetGlobalId: Uint32Array, quantityName: Uint32Array, quantityType: Uint8Array, value: Float64Array, formula: Uint32Array, strings: StringTable): QuantitySet[];
+//# sourceMappingURL=group-quantity-sets.d.ts.map

package/dist/group-quantity-sets.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"group-quantity-sets.d.ts","sourceRoot":"","sources":["../src/group-quantity-sets.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,WAAW,EAAY,MAAM,qBAAqB,CAAC;AAGjE;;;;;;;;;;;;GAYG;AACH,wBAAgB,2BAA2B,CACzC,UAAU,EAAE,SAAS,MAAM,EAAE,EAC7B,QAAQ,EAAE,WAAW,EACrB,YAAY,EAAE,WAAW,EACzB,YAAY,EAAE,WAAW,EACzB,YAAY,EAAE,UAAU,EACxB,KAAK,EAAE,YAAY,EACnB,OAAO,EAAE,WAAW,EACpB,OAAO,EAAE,WAAW,GACnB,WAAW,EAAE,CAmBf"}

package/dist/group-quantity-sets.js

@@ -0,0 +1,37 @@
+/* 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/. */
+/**
+ * Group a row-index list into `QuantitySet`s keyed on `(qsetName, qsetGlobalId)`,
+ * not name alone -- two `IfcElementQuantity` instances that share a literal
+ * name (a federated merge, or an exporter emitting the same Qto_ set twice on
+ * one element) must stay distinct, or the second instance's quantities come
+ * back attributed to the first instance's GlobalId. Mirrors
+ * `groupPropertySetsByInstance` (same defect, same fix, on the property
+ * side). Shared by the live `QuantityTable.getForEntity` (in
+ * `quantity-table.ts`) and by `@ifc-lite/cache`'s cache-rehydrated
+ * `readQuantities`, which reads the same columnar arrays back from the
+ * binary cache -- a single grouping algorithm keeps the two paths from
+ * diverging.
+ */
+export function groupQuantitySetsByInstance(rowIndices, qsetName, qsetGlobalId, quantityName, quantityType, value, formula, strings) {
+    const qsets = new Map();
+    for (const idx of rowIndices) {
+        const qsetNameStr = strings.get(qsetName[idx]);
+        const qsetGlobalIdStr = strings.get(qsetGlobalId[idx]);
+        const key = qsetNameStr + '\u0000' + qsetGlobalIdStr;
+        if (!qsets.has(key)) {
+            qsets.set(key, { name: qsetNameStr, globalId: qsetGlobalIdStr, quantities: [] });
+        }
+        const qset = qsets.get(key);
+        const quant = {
+            name: strings.get(quantityName[idx]),
+            type: quantityType[idx],
+            value: value[idx],
+            formula: formula[idx] > 0 ? strings.get(formula[idx]) : undefined,
+        };
+        qset.quantities.push(quant);
+    }
+    return Array.from(qsets.values());
+}
+//# sourceMappingURL=group-quantity-sets.js.map

package/dist/group-quantity-sets.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"group-quantity-sets.js","sourceRoot":"","sources":["../src/group-quantity-sets.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAM/D;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,2BAA2B,CACzC,UAA6B,EAC7B,QAAqB,EACrB,YAAyB,EACzB,YAAyB,EACzB,YAAwB,EACxB,KAAmB,EACnB,OAAoB,EACpB,OAAoB;IAEpB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC7C,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,GAAG,GAAG,WAAW,GAAG,QAAQ,GAAG,eAAe,CAAC;QACrD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,eAAe,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;QACnF,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC7B,MAAM,KAAK,GAAa;YACtB,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,EAAE,YAAY,CAAC,GAAG,CAAiB;YACvC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;YACjB,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;SAClE,CAAC;QACF,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;AACpC,CAAC"}

package/dist/ifc-schema/descendants.d.ts

@@ -0,0 +1,20 @@
+import type { IfcSchemaVersion } from './types.js';
+/**
+ * Expand a caller's type list to every descendant each type has for a file
+ * written in `schemaVersion` — see the module doc for what that admits.
+ * Case-insensitive input; UPPERCASE output, deduplicated across the whole
+ * list, each requested type immediately ahead of its own sorted descendants.
+ *
+ * `schemaVersion` is required and should be the queried model's own
+ * `store.schemaVersion`. It is what keeps a re-parented entity out of the
+ * answer, so there is no sensible default: an omitted version would silently
+ * mean "IFC4", and on an IFC2X3 model that answer is wrong rather than
+ * approximate. Values with no bundled table fall back as documented on
+ * `resolveSchemaVersion`.
+ *
+ * A type unknown to every bundled table (a typo, a vendor extension) comes
+ * back as itself, so the caller's list keeps its shape rather than silently
+ * losing an entry.
+ */
+export declare function expandTypeNamesToDescendants(types: readonly string[], schemaVersion: IfcSchemaVersion | string | undefined): string[];
+//# sourceMappingURL=descendants.d.ts.map

package/dist/ifc-schema/descendants.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"descendants.d.ts","sourceRoot":"","sources":["../../src/ifc-schema/descendants.ts"],"names":[],"mappings":"AAsDA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAwOnD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,4BAA4B,CAC1C,KAAK,EAAE,SAAS,MAAM,EAAE,EACxB,aAAa,EAAE,gBAAgB,GAAG,MAAM,GAAG,SAAS,GACnD,MAAM,EAAE,CAYV"}

package/dist/ifc-schema/descendants.js

@@ -0,0 +1,279 @@
+/* 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/. */
+/**
+ * Descendant-closure resolution for entity-type queries.
+ *
+ * `getInheritanceChain`/`isEntitySubtypeOf` in `./index.ts` walk the EXPRESS
+ * hierarchy leaf → root (a type plus its ancestors). Every `BimBackend`'s
+ * `byType()` query needs the opposite direction: given a type name, every
+ * type that HAS it as an ancestor, so that asking for an abstract supertype
+ * (`IfcBuildingElement`, `IfcElement`) — never a literal STEP entity type —
+ * finds the concrete leaves a real file actually contains, instead of
+ * silently answering zero.
+ *
+ * Neither one schema table alone nor a plain union across the three is the
+ * right authority, and the two failure modes are opposite:
+ *
+ *   - One table alone NARROWS. `entityIndex.byType` is keyed by the names the
+ *     FILE contains, and those need not belong to the version its
+ *     `FILE_SCHEMA` header claims: converters and hand-edits produce
+ *     IFC4X3-headered files still carrying `IFCSLABSTANDARDCASE`, a name only
+ *     the IFC4 table declares. Resolving per header made the header, not the
+ *     content, decide what a query found.
+ *   - A plain union MISFILES. buildingSMART re-parented entities between
+ *     versions, so a name can sit under a different base in a schema the file
+ *     is not written in: `IfcReinforcingBar` is an `IfcBuildingElement` in
+ *     IFC2X3 and an `IfcElementComponent` in IFC4, `IfcProject` is an
+ *     `IfcObject` in IFC2X3 and an `IfcContext` from IFC4 on, `IfcZone` is an
+ *     `IfcSystem` in IFC4 and an `IfcGroup` in IFC2X3. Unioning made
+ *     `byType('IfcBuildingElement')` on an IFC4 file answer with reinforcing
+ *     bars — 45 such (supertype, schema) pairs.
+ *
+ * So the closure for a file is:
+ *
+ *   (a) the descendants of the requested type in the file's OWN schema table;
+ *   (b) plus names from the other tables that the file's schema does not
+ *       define AT ALL and that are descendants of the requested type in the
+ *       table that does define them — the legacy and newer leaf spellings
+ *       (`IFCSLABSTANDARDCASE` on an IFC4X3 file, `IFCFURNITURE` on an IFC2X3
+ *       one). A name the file's own schema defines is never added, and if it
+ *       defines that name under a DIFFERENT parent the walk does not descend
+ *       through it either — both halves are what keep (b) from re-opening the
+ *       union's misfiling;
+ *   (c) plus the two alias relations in `./entity-aliases.js`: the
+ *       cross-schema rename equality, and the narrowing for leaves no bundled
+ *       table declares.
+ */
+import { ENTITY_NAME_ALIASES, CROSS_SCHEMA_RENAMES } from './entity-aliases.js';
+// The same per-version map `getEntities` answers from. Shared rather than
+// re-declared here: a second copy would let a future schema version reach one
+// of the two and give `getEntities` and this resolver different worlds.
+import { ENTITIES_BY_VERSION } from './index.js';
+const ALL_VERSIONS = ['IFC2X3', 'IFC4', 'IFC4X3'];
+const tableCache = new Map();
+function tableFor(v) {
+    const cached = tableCache.get(v);
+    if (cached)
+        return cached;
+    const children = new Map();
+    const names = new Set();
+    for (const entity of ENTITIES_BY_VERSION[v]) {
+        const name = entity.name.toUpperCase();
+        names.add(name);
+        if (!entity.parent)
+            continue;
+        const parent = entity.parent.toUpperCase();
+        const bucket = children.get(parent);
+        if (bucket)
+            bucket.push(name);
+        else
+            children.set(parent, [name]);
+    }
+    const table = { children, names };
+    tableCache.set(v, table);
+    return table;
+}
+/**
+ * Narrow a raw schema-version string (a store's `schemaVersion`, which
+ * carries values like `'IFC5'` these tables do not cover) to a version with a
+ * bundled table.
+ *
+ * Deliberately the same mapping as `narrowSchemaVersion` in
+ * `packages/ids/src/bridge/schema-version.ts` — IFC5 has no published EXPRESS
+ * schema, and IFC4X3 is its nearest — pinned from that side in
+ * `schema-version.test.ts`, since `@ifc-lite/ids` depends on this package and
+ * not the other way round. Two resolvers that disagreed about IFC5 is what
+ * this replaces.
+ */
+function resolveSchemaVersion(schemaVersion) {
+    switch (schemaVersion?.toUpperCase()) {
+        case 'IFC2X3':
+            return 'IFC2X3';
+        case 'IFC4X3':
+        case 'IFC4X3_ADD2':
+        case 'IFC5':
+            return 'IFC4X3';
+        default:
+            return 'IFC4';
+    }
+}
+/**
+ * The names a query for `type` also means, before any schema is consulted:
+ * the type itself plus the other spelling of a cross-schema rename.
+ *
+ * The rename is an equality, not a subtype relation, so both spellings are
+ * kept in the answer: a file written under either schema may hold records
+ * under either name, and a name the file does not contain matches an empty
+ * bucket.
+ */
+function renameGroup(upper) {
+    const group = [upper];
+    for (const pair of CROSS_SCHEMA_RENAMES) {
+        if (!pair.includes(upper))
+            continue;
+        for (const name of pair)
+            if (!group.includes(name))
+                group.push(name);
+    }
+    return group;
+}
+/**
+ * `ENTITY_NAME_ALIASES` as UPPERCASE `[leaf, supertype]` rows, uppercased once
+ * at module load rather than on every call. The table is read-only.
+ */
+const ALIAS_ROWS = Object.entries(ENTITY_NAME_ALIASES).map(([leaf, supertype]) => [leaf.toUpperCase(), supertype.toUpperCase()]);
+/**
+ * Transitive descendants of `seeds` within one schema table, seeds excluded.
+ *
+ * `own` is the file's own schema's verdict, passed when `table` is a foreign
+ * one; it is what implements rule (b). When the own table has an opinion about
+ * this subtree, a name it declares is never returned — that table is the
+ * authority on where it sits — and when it puts that name OUTSIDE the requested
+ * subtree, the walk does not descend through it either. When `own.active` is
+ * false the own table has no opinion at all, so neither half applies and the
+ * foreign table's answer is kept whole: `IfcSpatialElement` on IFC2X3 must
+ * still find `IFCBUILDING` and `IFCSPACE`, names IFC2X3 declares but places
+ * under a supertype it has no equivalent of.
+ *
+ * That second half is not decoration. `IfcTendonConduit` is IFC4X3-only and
+ * sits under `IfcReinforcingElement` there; IFC2X3 declares
+ * `IfcReinforcingElement` under `IfcBuildingElement`, nowhere near
+ * `IfcElementComponent`. Skipping the re-parented node but still walking
+ * through it put `IFCTENDONCONDUIT` in `byType('IfcElementComponent')` on an
+ * IFC2X3 file — the union's misfiling, one level down.
+ *
+ * The test is subtree membership, not same-parent: the IFC4X3 rename moved
+ * every element from `IfcBuildingElement` to `IfcBuiltElement`, so comparing
+ * declared parents reads the whole hierarchy as re-parented and drops
+ * `IFCSLABSTANDARDCASE` from `byType('IfcBuiltElement')` on IFC4X3 — the
+ * headline case this resolver exists for. `IfcSlab` sits under both spellings,
+ * so it is inside the subtree and the walk continues through it.
+ */
+function descendantsInTable(table, seeds, own) {
+    const found = new Set();
+    const stack = [...seeds];
+    const visited = new Set(seeds);
+    while (stack.length > 0) {
+        for (const child of table.children.get(stack.pop()) ?? []) {
+            if (visited.has(child))
+                continue;
+            visited.add(child);
+            if (own?.active && own.table.names.has(child)) {
+                // Own declares it AND has an opinion about this subtree, so it is
+                // never added here: own's own walk already returned it if own agrees
+                // it belongs. Descend only if own agrees.
+                if (own.subtree.has(child))
+                    stack.push(child);
+                continue;
+            }
+            found.add(child);
+            stack.push(child);
+        }
+    }
+    return found;
+}
+/**
+ * One type's descendant set for a file written in `v`: itself, plus every
+ * type the rule in the module doc admits, UPPERCASE and deduplicated.
+ *
+ * Order: the requested type first, then the rest sorted. Callers page results
+ * with `offset`/`limit`, so a traversal-dependent order would shift a caller's
+ * page whenever the schema tables were regenerated. Depth-first pop order did
+ * exactly that; sorted does not.
+ *
+ * Memoized per (version, type). Three table walks plus a sort of the result is
+ * 0.3 ms for `IfcRoot` on IFC4, and `expandTypeNamesToDescendants` is public
+ * API, so a consumer outside `@ifc-lite/parser` — whose own memo is keyed on
+ * the whole ordered list, and so misses whenever that list is reordered —
+ * would otherwise pay that on every call. The cached array never leaves this
+ * module: the only caller copies names out of it into a fresh list.
+ */
+const descendantCache = new Map();
+/**
+ * Bound on every memo in this resolver's path. The keys are caller-supplied
+ * type names, and the MCP server and the viewer are long-lived processes where
+ * those come from an agent or an SDK script, so an unbounded map grows on
+ * typos and vendor namespaces forever. Clearing wholesale rather than evicting
+ * one entry costs a recompute on the next call and needs no bookkeeping; the
+ * bundled schemas declare ~1160 names, so a real workload never reaches it.
+ */
+const CACHE_LIMIT = 4096;
+function descendantsOf(type, v) {
+    const upper = type.toUpperCase();
+    const key = `${v}\u0000${upper}`;
+    const cached = descendantCache.get(key);
+    if (cached)
+        return cached;
+    const computed = computeDescendantsOf(upper, v);
+    if (descendantCache.size >= CACHE_LIMIT)
+        descendantCache.clear();
+    descendantCache.set(key, computed);
+    return computed;
+}
+function computeDescendantsOf(upper, v) {
+    const seeds = renameGroup(upper);
+    const own = tableFor(v);
+    const ownDescendants = descendantsInTable(own, seeds);
+    const found = new Set(seeds.slice(1));
+    for (const name of ownDescendants)
+        found.add(name);
+    // (b) A leaf spelling this schema has no opinion about at all. The own
+    // table's verdict is handed to the walk, which is what keeps a name this
+    // schema declares out of the answer, and what stops the walk from descending
+    // through one this schema places outside the requested subtree. See
+    // `descendantsInTable`.
+    const verdict = {
+        table: own,
+        subtree: new Set([...seeds, ...ownDescendants]),
+        active: seeds.some((seed) => own.names.has(seed)),
+    };
+    for (const other of ALL_VERSIONS) {
+        const table = tableFor(other);
+        if (table === own)
+            continue;
+        for (const name of descendantsInTable(table, seeds, verdict))
+            found.add(name);
+    }
+    // (c) The narrowing: a leaf no bundled table declares hangs off its nearest
+    // schema-known supertype. One direction only, so `IfcGeotechnicalStratum`
+    // gains `IfcSolidStratum` while `IfcSolidStratum` does not gain its siblings.
+    for (const [leaf, parent] of ALIAS_ROWS) {
+        if (parent === upper || found.has(parent))
+            found.add(leaf);
+    }
+    found.delete(upper);
+    return [upper, ...[...found].sort()];
+}
+/**
+ * Expand a caller's type list to every descendant each type has for a file
+ * written in `schemaVersion` — see the module doc for what that admits.
+ * Case-insensitive input; UPPERCASE output, deduplicated across the whole
+ * list, each requested type immediately ahead of its own sorted descendants.
+ *
+ * `schemaVersion` is required and should be the queried model's own
+ * `store.schemaVersion`. It is what keeps a re-parented entity out of the
+ * answer, so there is no sensible default: an omitted version would silently
+ * mean "IFC4", and on an IFC2X3 model that answer is wrong rather than
+ * approximate. Values with no bundled table fall back as documented on
+ * `resolveSchemaVersion`.
+ *
+ * A type unknown to every bundled table (a typo, a vendor extension) comes
+ * back as itself, so the caller's list keeps its shape rather than silently
+ * losing an entry.
+ */
+export function expandTypeNamesToDescendants(types, schemaVersion) {
+    const v = resolveSchemaVersion(schemaVersion);
+    const out = [];
+    const seen = new Set();
+    for (const type of types) {
+        for (const name of descendantsOf(type, v)) {
+            if (seen.has(name))
+                continue;
+            seen.add(name);
+            out.push(name);
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=descendants.js.map

package/dist/ifc-schema/descendants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"descendants.js","sourceRoot":"","sources":["../../src/ifc-schema/descendants.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AAEH,OAAO,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAC;AAChF,0EAA0E;AAC1E,8EAA8E;AAC9E,wEAAwE;AACxE,OAAO,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAGjD,MAAM,YAAY,GAAgC,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;AAU/E,MAAM,UAAU,GAAG,IAAI,GAAG,EAAiC,CAAC;AAE5D,SAAS,QAAQ,CAAC,CAAmB;IACnC,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAC1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,MAAM,IAAI,mBAAmB,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QACvC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,SAAS;QAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACzB,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,MAAM,KAAK,GAAgB,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC/C,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACzB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,oBAAoB,CAAC,aAAiC;IAC7D,QAAQ,aAAa,EAAE,WAAW,EAAE,EAAE,CAAC;QACrC,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,QAAQ,CAAC;QACd,KAAK,aAAa,CAAC;QACnB,KAAK,MAAM;YACT,OAAO,QAAQ,CAAC;QAClB;YACE,OAAO,MAAM,CAAC;IAClB,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,WAAW,CAAC,KAAa;IAChC,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,KAAK,MAAM,IAAI,IAAI,oBAAoB,EAAE,CAAC;QACxC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,SAAS;QACpC,KAAK,MAAM,IAAI,IAAI,IAAI;YAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,GAA2C,MAAM,CAAC,OAAO,CACvE,mBAAmB,CACpB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,SAAS,CAAC,WAAW,EAAE,CAAU,CAAC,CAAC;AAuBrF;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,SAAS,kBAAkB,CACzB,KAAkB,EAClB,KAAwB,EACxB,GAAgB;IAEhB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IACzB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAY,CAAC,IAAI,EAAE,EAAE,CAAC;YACpE,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YACjC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACnB,IAAI,GAAG,EAAE,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9C,kEAAkE;gBAClE,qEAAqE;gBACrE,0CAA0C;gBAC1C,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9C,SAAS;YACX,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,eAAe,GAAG,IAAI,GAAG,EAA6B,CAAC;AAE7D;;;;;;;GAOG;AACH,MAAM,WAAW,GAAG,IAAI,CAAC;AAEzB,SAAS,aAAa,CAAC,IAAY,EAAE,CAAmB;IACtD,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,MAAM,GAAG,GAAG,GAAG,CAAC,SAAS,KAAK,EAAE,CAAC;IACjC,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACxC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAC1B,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAChD,IAAI,eAAe,CAAC,IAAI,IAAI,WAAW;QAAE,eAAe,CAAC,KAAK,EAAE,CAAC;IACjE,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACnC,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAa,EAAE,CAAmB;IAC9D,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IAExB,MAAM,cAAc,GAAG,kBAAkB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACtD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,cAAc;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAEnD,uEAAuE;IACvE,yEAAyE;IACzE,6EAA6E;IAC7E,oEAAoE;IACpE,wBAAwB;IACxB,MAAM,OAAO,GAAe;QAC1B,KAAK,EAAE,GAAG;QACV,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,cAAc,CAAC,CAAC;QAC/C,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;KAClD,CAAC;IACF,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,KAAK,KAAK,GAAG;YAAE,SAAS;QAC5B,KAAK,MAAM,IAAI,IAAI,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChF,CAAC;IAED,4EAA4E;IAC5E,0EAA0E;IAC1E,8EAA8E;IAC9E,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QACxC,IAAI,MAAM,KAAK,KAAK,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACpB,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,4BAA4B,CAC1C,KAAwB,EACxB,aAAoD;IAEpD,MAAM,CAAC,GAAG,oBAAoB,CAAC,aAAa,CAAC,CAAC;IAC9C,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,IAAI,IAAI,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACf,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}