@ifc-lite/clash 1.1.0

package/LICENSE

@@ -0,0 +1,373 @@
+Mozilla Public License Version 2.0
+==================================
+
+1. Definitions
+--------------
+
+1.1. "Contributor"
+    means each individual or legal entity that creates, contributes to
+    the creation of, or owns Covered Software.
+
+1.2. "Contributor Version"
+    means the combination of the Contributions of others (if any) used
+    by a Contributor and that particular Contributor's Contribution.
+
+1.3. "Contribution"
+    means Covered Software of a particular Contributor.
+
+1.4. "Covered Software"
+    means Source Code Form to which the initial Contributor has attached
+    the notice in Exhibit A, the Executable Form of such Source Code
+    Form, and Modifications of such Source Code Form, in each case
+    including portions thereof.
+
+1.5. "Incompatible With Secondary Licenses"
+    means
+
+    (a) that the initial Contributor has attached the notice described
+        in Exhibit B to the Covered Software; or
+
+    (b) that the Covered Software was made available under the terms of
+        version 1.1 or earlier of the License, but not also under the
+        terms of a Secondary License.
+
+1.6. "Executable Form"
+    means any form of the work other than Source Code Form.
+
+1.7. "Larger Work"
+    means a work that combines Covered Software with other material, in
+    a separate file or files, that is not Covered Software.
+
+1.8. "License"
+    means this document.
+
+1.9. "Licensable"
+    means having the right to grant, to the maximum extent possible,
+    whether at the time of the initial grant or subsequently, any and
+    all of the rights conveyed by this License.
+
+1.10. "Modifications"
+    means any of the following:
+
+    (a) any file in Source Code Form that results from an addition to,
+        deletion from, or modification of the contents of Covered
+        Software; or
+
+    (b) any new file in Source Code Form that contains any Covered
+        Software.
+
+1.11. "Patent Claims" of a Contributor
+    means any patent claim(s), including without limitation, method,
+    process, and apparatus claims, in any patent Licensable by such
+    Contributor that would be infringed, but for the grant of the
+    License, by the making, using, selling, offering for sale, having
+    made, import, or transfer of either its Contributions or its
+    Contributor Version.
+
+1.12. "Secondary License"
+    means either the GNU General Public License, Version 2.0, the GNU
+    Lesser General Public License, Version 2.1, the GNU Affero General
+    Public License, Version 3.0, or any later versions of those
+    licenses.
+
+1.13. "Source Code Form"
+    means the form of the work preferred for making modifications.
+
+1.14. "You" (or "Your")
+    means an individual or a legal entity exercising rights under this
+    License. For legal entities, "You" includes any entity that
+    controls, is controlled by, or is under common control with You. For
+    purposes of this definition, "control" means (a) the power, direct
+    or indirect, to cause the direction or management of such entity,
+    whether by contract or otherwise, or (b) ownership of more than
+    fifty percent (50%) of the outstanding shares or beneficial
+    ownership of such entity.
+
+2. License Grants and Conditions
+--------------------------------
+
+2.1. Grants
+
+Each Contributor hereby grants You a world-wide, royalty-free,
+non-exclusive license:
+
+(a) under intellectual property rights (other than patent or trademark)
+    Licensable by such Contributor to use, reproduce, make available,
+    modify, display, perform, distribute, and otherwise exploit its
+    Contributions, either on an unmodified basis, with Modifications, or
+    as part of a Larger Work; and
+
+(b) under Patent Claims of such Contributor to make, use, sell, offer
+    for sale, have made, import, and otherwise transfer either its
+    Contributions or its Contributor Version.
+
+2.2. Effective Date
+
+The licenses granted in Section 2.1 with respect to any Contribution
+become effective for each Contribution on the date the Contributor first
+distributes such Contribution.
+
+2.3. Limitations on Grant Scope
+
+The licenses granted in this Section 2 are the only rights granted under
+this License. No additional rights or licenses will be implied from the
+distribution or licensing of Covered Software under this License.
+Notwithstanding Section 2.1(b) above, no patent license is granted by a
+Contributor:
+
+(a) for any code that a Contributor has removed from Covered Software;
+    or
+
+(b) for infringements caused by: (i) Your and any other third party's
+    modifications of Covered Software, or (ii) the combination of its
+    Contributions with other software (except as part of its Contributor
+    Version); or
+
+(c) under Patent Claims infringed by Covered Software in the absence of
+    its Contributions.
+
+This License does not grant any rights in the trademarks, service marks,
+or logos of any Contributor (except as may be necessary to comply with
+the notice requirements in Section 3.4).
+
+2.4. Subsequent Licenses
+
+No Contributor makes additional grants as a result of Your choice to
+distribute the Covered Software under a subsequent version of this
+License (see Section 10.2) or under the terms of a Secondary License (if
+permitted under the terms of Section 3.3).
+
+2.5. Representation
+
+Each Contributor represents that the Contributor believes its
+Contributions are its original creation(s) or it has sufficient rights
+to grant the rights to its Contributions conveyed by this License.
+
+2.6. Fair Use
+
+This License is not intended to limit any rights You have under
+applicable copyright doctrines of fair use, fair dealing, or other
+equivalents.
+
+2.7. Conditions
+
+Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+in Section 2.1.
+
+3. Responsibilities
+-------------------
+
+3.1. Distribution of Source Form
+
+All distribution of Covered Software in Source Code Form, including any
+Modifications that You create or to which You contribute, must be under
+the terms of this License. You must inform recipients that the Source
+Code Form of the Covered Software is governed by the terms of this
+License, and how they can obtain a copy of this License. You may not
+attempt to alter or restrict the recipients' rights in the Source Code
+Form.
+
+3.2. Distribution of Executable Form
+
+If You distribute Covered Software in Executable Form then:
+
+(a) such Covered Software must also be made available in Source Code
+    Form, as described in Section 3.1, and You must inform recipients of
+    the Executable Form how they can obtain a copy of such Source Code
+    Form by reasonable means in a timely manner, at a charge no more
+    than the cost of distribution to the recipient; and
+
+(b) You may distribute such Executable Form under the terms of this
+    License, or sublicense it under different terms, provided that the
+    license for the Executable Form does not attempt to limit or alter
+    the recipients' rights in the Source Code Form under this License.
+
+3.3. Distribution of a Larger Work
+
+You may create and distribute a Larger Work under terms of Your choice,
+provided that You also comply with the requirements of this License for
+the Covered Software. If the Larger Work is a combination of Covered
+Software with a work governed by one or more Secondary Licenses, and the
+Covered Software is not Incompatible With Secondary Licenses, this
+License permits You to additionally distribute such Covered Software
+under the terms of such Secondary License(s), so that the recipient of
+the Larger Work may, at their option, further distribute the Covered
+Software under the terms of either this License or such Secondary
+License(s).
+
+3.4. Notices
+
+You may not remove or alter the substance of any license notices
+(including copyright notices, patent notices, disclaimers of warranty,
+or limitations of liability) contained within the Source Code Form of
+the Covered Software, except that You may alter any license notices to
+the extent required to remedy known factual inaccuracies.
+
+3.5. Application of Additional Terms
+
+You may choose to offer, and to charge a fee for, warranty, support,
+indemnity or liability obligations to one or more recipients of Covered
+Software. However, You may do so only on Your own behalf, and not on
+behalf of any Contributor. You must make it absolutely clear that any
+such warranty, support, indemnity, or liability obligation is offered by
+You alone, and You hereby agree to indemnify every Contributor for any
+liability incurred by such Contributor as a result of warranty, support,
+indemnity or liability terms You offer. You may include additional
+disclaimers of warranty and limitations of liability specific to any
+jurisdiction.
+
+4. Inability to Comply Due to Statute or Regulation
+---------------------------------------------------
+
+If it is impossible for You to comply with any of the terms of this
+License with respect to some or all of the Covered Software due to
+statute, judicial order, or regulation then You must: (a) comply with
+the terms of this License to the maximum extent possible; and (b)
+describe the limitations and the code they affect. Such description must
+be placed in a text file included with all distributions of the Covered
+Software under this License. Except to the extent prohibited by statute
+or regulation, such description must be sufficiently detailed for a
+recipient of ordinary skill to be able to understand it.
+
+5. Termination
+--------------
+
+5.1. The rights granted under this License will terminate automatically
+if You fail to comply with any of its terms. However, if You become
+compliant, then the rights granted under this License from a particular
+Contributor are reinstated (a) provisionally, unless and until such
+Contributor explicitly and finally terminates Your grants, and (b) on an
+ongoing basis, if such Contributor fails to notify You of the
+non-compliance by some reasonable means prior to 60 days after You have
+come back into compliance. Moreover, Your grants from a particular
+Contributor are reinstated on an ongoing basis if such Contributor
+notifies You of the non-compliance by some reasonable means, this is the
+first time You have received notice of non-compliance with this License
+from such Contributor, and You become compliant prior to 30 days after
+Your receipt of the notice.
+
+5.2. If You initiate litigation against any entity by asserting a patent
+infringement claim (excluding declaratory judgment actions,
+counter-claims, and cross-claims) alleging that a Contributor Version
+directly or indirectly infringes any patent, then the rights granted to
+You by any and all Contributors for the Covered Software under Section
+2.1 of this License shall terminate.
+
+5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+end user license agreements (excluding distributors and resellers) which
+have been validly granted by You or Your distributors under this License
+prior to termination shall survive termination.
+
+************************************************************************
+*                                                                      *
+*  6. Disclaimer of Warranty                                           *
+*  -------------------------                                           *
+*                                                                      *
+*  Covered Software is provided under this License on an "as is"       *
+*  basis, without warranty of any kind, either expressed, implied, or  *
+*  statutory, including, without limitation, warranties that the       *
+*  Covered Software is free of defects, merchantable, fit for a        *
+*  particular purpose or non-infringing. The entire risk as to the     *
+*  quality and performance of the Covered Software is with You.        *
+*  Should any Covered Software prove defective in any respect, You     *
+*  (not any Contributor) assume the cost of any necessary servicing,   *
+*  repair, or correction. This disclaimer of warranty constitutes an   *
+*  essential part of this License. No use of any Covered Software is   *
+*  authorized under this License except under this disclaimer.         *
+*                                                                      *
+************************************************************************
+
+************************************************************************
+*                                                                      *
+*  7. Limitation of Liability                                          *
+*  --------------------------                                          *
+*                                                                      *
+*  Under no circumstances and under no legal theory, whether tort      *
+*  (including negligence), contract, or otherwise, shall any           *
+*  Contributor, or anyone who distributes Covered Software as          *
+*  permitted above, be liable to You for any direct, indirect,         *
+*  special, incidental, or consequential damages of any character      *
+*  including, without limitation, damages for lost profits, loss of    *
+*  goodwill, work stoppage, computer failure or malfunction, or any    *
+*  and all other commercial damages or losses, even if such party      *
+*  shall have been informed of the possibility of such damages. This   *
+*  limitation of liability shall not apply to liability for death or   *
+*  personal injury resulting from such party's negligence to the       *
+*  extent applicable law prohibits such limitation. Some               *
+*  jurisdictions do not allow the exclusion or limitation of           *
+*  incidental or consequential damages, so this exclusion and          *
+*  limitation may not apply to You.                                    *
+*                                                                      *
+************************************************************************
+
+8. Litigation
+-------------
+
+Any litigation relating to this License may be brought only in the
+courts of a jurisdiction where the defendant maintains its principal
+place of business and such litigation shall be governed by laws of that
+jurisdiction, without reference to its conflict-of-law provisions.
+Nothing in this Section shall prevent a party's ability to bring
+cross-claims or counter-claims.
+
+9. Miscellaneous
+----------------
+
+This License represents the complete agreement concerning the subject
+matter hereof. If any provision of this License is held to be
+unenforceable, such provision shall be reformed only to the extent
+necessary to make it enforceable. Any law or regulation which provides
+that the language of a contract shall be construed against the drafter
+shall not be used to construe this License against a Contributor.
+
+10. Versions of the License
+---------------------------
+
+10.1. New Versions
+
+Mozilla Foundation is the license steward. Except as provided in Section
+10.3, no one other than the license steward has the right to modify or
+publish new versions of this License. Each version will be given a
+distinguishing version number.
+
+10.2. Effect of New Versions
+
+You may distribute the Covered Software under the terms of the version
+of the License under which You originally received the Covered Software,
+or under the terms of any subsequent version published by the license
+steward.
+
+10.3. Modified Versions
+
+If you create software not governed by this License, and you want to
+create a new license for such software, you may create and use a
+modified version of this License if you rename the license and remove
+any references to the name of the license steward (except to note that
+such modified license differs from this License).
+
+10.4. Distributing Source Code Form that is Incompatible With Secondary
+Licenses
+
+If You choose to distribute Source Code Form that is Incompatible With
+Secondary Licenses under the terms of this version of the License, the
+notice described in Exhibit B of this License must be attached.
+
+Exhibit A - Source Code Form License Notice
+-------------------------------------------
+
+  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/.
+
+If it is not possible or desirable to put the notice in a particular
+file, then You may include the notice in a location (such as a LICENSE
+file in a relevant directory) where a recipient would be likely to look
+for such a notice.
+
+You may add additional accurate notices of copyright ownership.
+
+Exhibit B - "Incompatible With Secondary Licenses" Notice
+---------------------------------------------------------
+
+  This Source Code Form is "Incompatible With Secondary Licenses", as
+  defined by the Mozilla Public License, v. 2.0.

package/README.md

@@ -0,0 +1,32 @@
+# @ifc-lite/clash
+
+Clash detection for IFC-Lite. A **representation-agnostic** core engine plus thin,
+version-specific **source adapters**.
+
+- The core (`@ifc-lite/clash`) operates on `ClashElement[]` — `{ key, ref, tag, bounds, positions, indices }` —
+  and never imports `@ifc-lite/parser`/`@ifc-lite/query`. STEP/IFC4 and IFC5/USD are
+  just adapters that produce those elements.
+- Broad phase: BVH (`@ifc-lite/spatial`). Narrow phase: exact triangle–triangle
+  intersection and exact triangle–triangle minimum distance — no decimation.
+- Results classify as `hard` (interpenetration), `clearance` (within a gap), or `touch`
+  (within tolerance, suppressed by default).
+
+```ts
+import { createClashEngine, CLASH_RULE_PRESETS } from '@ifc-lite/clash';
+import { elementsFromStep } from '@ifc-lite/clash/step';
+
+const { elements, exclusions } = elementsFromStep({ store, meshes, modelId: 'm1' });
+const engine = createClashEngine({ backend: 'auto' });
+const result = await engine.run(elements, [
+  { id: 'mep-str', name: 'MEP vs Structure', a: 'IfcPipe*|IfcDuct*', b: 'IfcBeam|IfcColumn|IfcSlab', mode: 'hard' },
+], { exclusions });
+
+console.log(result.summary.total, 'clashes');
+```
+
+Includes the TypeScript reference engine, a Rust→WASM kernel kept in lockstep by a
+differential test (`backend: 'auto'` picks WASM when available, else TS), STEP and
+IFC5/USD source adapters, spatial grouping, and a *sensible* BCF bridge (grouped
+topics, deterministic GUIDs, optional snapshots). Surfaced through the viewer's
+clash panel, the `ifc-lite clash` CLI, the MCP `clash_check` / `clash_matrix` tools,
+and the SDK `clash` namespace. Design rationale: `docs/architecture/clash-detection-plan.md`.

package/dist/adapters/ifcx.d.ts

@@ -0,0 +1,44 @@
+import type { ClashElement, ExclusionSet } from '../types.js';
+/**
+ * Minimal structural view of `@ifc-lite/data`'s `RelationshipGraph`. We type it
+ * locally (rather than importing `@ifc-lite/data`, which is not a direct
+ * dependency of this package) and only touch the two directional halves. The
+ * IFCX parser emits exclusively parent->child composition edges
+ * (`ContainsElements` + `Aggregates`), so reading every edge — with no type
+ * filter — is precisely the set of composition parent/child links.
+ */
+interface CompositionEdges {
+    getTargets(entityId: number): number[];
+}
+interface CompositionGraph {
+    forward: CompositionEdges;
+    inverse: CompositionEdges;
+}
+export interface IfcxAdapterOptions {
+    /** Raw IFCX (IFC5 JSON) bytes. */
+    buffer: ArrayBuffer;
+    /** Model/file id (federation). */
+    modelId: string;
+    /** Precompute parent/child composition exclusions. Default true. */
+    buildExclusions?: boolean;
+}
+export interface IfcxAdapterResult {
+    elements: ClashElement[];
+    exclusions: ExclusionSet;
+}
+/**
+ * Parse an IFCX buffer and project its pre-tessellated meshes into
+ * `ClashElement`s. Async because `parseIfcx` is async.
+ */
+export declare function elementsFromIfcx(options: IfcxAdapterOptions): Promise<IfcxAdapterResult>;
+/**
+ * Pair-exclusions from the IFCX composition hierarchy. For every meshed
+ * entity we exclude its composition parents and children (the
+ * `ContainsElements` spatial-containment and `Aggregates` decomposition edges
+ * the parser derives from USD `children`). These are exactly the
+ * host/assembly relationships the STEP adapter excludes, expressed in IFCX
+ * terms; no relationship is invented.
+ */
+export declare function buildIfcxExclusions(relationships: CompositionGraph, byExpressId: Map<number, ClashElement>): ExclusionSet;
+export {};
+//# sourceMappingURL=ifcx.d.ts.map

package/dist/adapters/ifcx.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ifcx.d.ts","sourceRoot":"","sources":["../../src/adapters/ifcx.ts"],"names":[],"mappings":"AAuCA,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE9D;;;;;;;GAOG;AACH,UAAU,gBAAgB;IACxB,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;CACxC;AACD,UAAU,gBAAgB;IACxB,OAAO,EAAE,gBAAgB,CAAC;IAC1B,OAAO,EAAE,gBAAgB,CAAC;CAC3B;AAED,MAAM,WAAW,kBAAkB;IACjC,kCAAkC;IAClC,MAAM,EAAE,WAAW,CAAC;IACpB,kCAAkC;IAClC,OAAO,EAAE,MAAM,CAAC;IAChB,oEAAoE;IACpE,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,YAAY,EAAE,CAAC;IACzB,UAAU,EAAE,YAAY,CAAC;CAC1B;AAED;;;GAGG;AACH,wBAAsB,gBAAgB,CAAC,OAAO,EAAE,kBAAkB,GAAG,OAAO,CAAC,iBAAiB,CAAC,CA4D9F;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CACjC,aAAa,EAAE,gBAAgB,EAC/B,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,GACrC,YAAY,CAoBd"}

package/dist/adapters/ifcx.js

@@ -0,0 +1,198 @@
+/* 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/. */
+/**
+ * IFCX / USD source adapter: turn a parsed IFCX (IFC5) file into
+ * representation-agnostic `ClashElement`s, proving the clash core is
+ * representation-agnostic (it runs equally on STEP and on USD/IFCX).
+ *
+ * Unlike the STEP adapter, IFCX geometry is pre-tessellated: `parseIfcx`
+ * already returns world-space, Y-up triangle `meshes` (see ifcx's
+ * `geometry-extractor`), so this adapter does no geometry math of its own.
+ *
+ * Identity mapping:
+ * - `key`   = the USD prim PATH (the durable identity in IFCX; the parser
+ *             stores it as the entity GlobalId and exposes it via `idToPath`).
+ * - `ref`   = a deterministic, non-negative 31-bit FNV-1a hash of the prim
+ *             path. We hash the PATH (not the synthetic auto-incrementing
+ *             expressId) so the runtime ref is stable across re-parses and
+ *             across federated layer reorderings, which is the whole point of
+ *             a durable id. Collisions are astronomically unlikely for the
+ *             path counts in a model and never affect correctness (clash
+ *             identity is derived from `key`, not `ref`).
+ * - `model` = `options.modelId`.
+ * - `tag`   = the IFC class code when present (USD `bsi::ifc::class`),
+ *             otherwise `'IfcProduct'`.
+ *
+ * Exclusions are derived purely from the file's own composition hierarchy
+ * (parent/child `ContainsElements` + `Aggregates` edges that `parseIfcx`
+ * builds from the USD `children` structure). This is the IFCX analogue of the
+ * STEP void/host/assembly exclusions; it fabricates no relationships.
+ *
+ * This module is reached via the `@ifc-lite/clash/ifcx` subpath so the core
+ * stays representation- and parser-neutral.
+ */
+import { parseIfcx } from '@ifc-lite/ifcx';
+import { makeExclusionSet, qualifiedKey } from '../exclude.js';
+import { fromPositions } from '../math/aabb.js';
+/**
+ * Parse an IFCX buffer and project its pre-tessellated meshes into
+ * `ClashElement`s. Async because `parseIfcx` is async.
+ */
+export async function elementsFromIfcx(options) {
+    const { buffer, modelId, buildExclusions = true } = options;
+    const parsed = await parseIfcx(buffer);
+    const { meshes, idToPath, entities, relationships } = parsed;
+    // The IFCX geometry extractor associates each `UsdMesh` with the nearest
+    // ancestor entity that has an expressId, so a single entity (one durable
+    // prim path) can yield several `MeshData` (e.g. separate `Body`/`Axis`
+    // representations or multiple sub-meshes). Group those meshes by their
+    // owning entity first, then concatenate each group into one geometry, so a
+    // given durable key produces exactly ONE `ClashElement` over all of it
+    // rather than several aliasing elements that share a key/ref.
+    const groups = new Map();
+    for (const mesh of meshes) {
+        if (!mesh.positions || mesh.positions.length === 0)
+            continue;
+        if (!mesh.indices || mesh.indices.length === 0)
+            continue;
+        const expressId = mesh.expressId;
+        // The prim path is the durable USD identity; skip meshes we cannot key.
+        if (!idToPath.has(expressId))
+            continue;
+        const group = groups.get(expressId);
+        if (group) {
+            group.push(mesh);
+        }
+        else {
+            groups.set(expressId, [mesh]);
+        }
+    }
+    const elements = [];
+    const byExpressId = new Map();
+    for (const [expressId, group] of groups) {
+        // The prim path is the durable USD identity; skip entities we cannot key.
+        // (It was present at grouping time; re-check to narrow without a cast.)
+        const key = idToPath.get(expressId);
+        if (!key)
+            continue;
+        const merged = mergeMeshes(group);
+        const element = {
+            key,
+            ref: refFromPath(key),
+            model: modelId,
+            tag: resolveTag(group[0], entities, expressId),
+            name: resolveName(entities, expressId),
+            bounds: fromPositions(merged.positions),
+            positions: merged.positions,
+            indices: merged.indices,
+        };
+        elements.push(element);
+        byExpressId.set(expressId, element);
+    }
+    const exclusions = buildExclusions
+        ? buildIfcxExclusions(relationships, byExpressId)
+        : makeExclusionSet();
+    return { elements, exclusions };
+}
+/**
+ * Pair-exclusions from the IFCX composition hierarchy. For every meshed
+ * entity we exclude its composition parents and children (the
+ * `ContainsElements` spatial-containment and `Aggregates` decomposition edges
+ * the parser derives from USD `children`). These are exactly the
+ * host/assembly relationships the STEP adapter excludes, expressed in IFCX
+ * terms; no relationship is invented.
+ */
+export function buildIfcxExclusions(relationships, byExpressId) {
+    const pairs = [];
+    for (const [expressId, element] of byExpressId) {
+        // Children (this entity contains/aggregates them) and parents (inverse).
+        // All IFCX edges are composition edges, so no type filter is needed.
+        const ek = qualifiedKey(element.model, element.key);
+        const children = relationships.forward.getTargets(expressId);
+        const parents = relationships.inverse.getTargets(expressId);
+        for (const relatedId of children) {
+            const related = byExpressId.get(relatedId);
+            if (related)
+                pairs.push([ek, qualifiedKey(related.model, related.key)]);
+        }
+        for (const relatedId of parents) {
+            const related = byExpressId.get(relatedId);
+            if (related)
+                pairs.push([ek, qualifiedKey(related.model, related.key)]);
+        }
+    }
+    return makeExclusionSet(pairs);
+}
+/**
+ * IFC class for the element's `tag`. The IFCX geometry extractor stores the
+ * `bsi::ifc::class.code` on `mesh.ifcType`; we fall back to the entity table's
+ * resolved type name, then to a neutral `IfcProduct`.
+ */
+function resolveTag(mesh, entities, expressId) {
+    if (mesh.ifcType && mesh.ifcType.length > 0)
+        return mesh.ifcType;
+    const typeName = entities.getTypeName(expressId);
+    if (typeName && typeName.length > 0 && typeName !== 'Unknown')
+        return typeName;
+    return 'IfcProduct';
+}
+function resolveName(entities, expressId) {
+    const name = entities.getName(expressId);
+    return name && name.length > 0 ? name : undefined;
+}
+/**
+ * Concatenate a group of meshes (all belonging to the same entity) into a
+ * single position/index buffer. Each subsequent mesh's indices are offset by
+ * the running vertex count so the merged index buffer addresses the combined
+ * vertex array. A single mesh is returned as-is (no copy) for the common case.
+ */
+function mergeMeshes(group) {
+    if (group.length === 1) {
+        return { positions: group[0].positions, indices: group[0].indices };
+    }
+    let totalPositions = 0;
+    let totalIndices = 0;
+    for (const mesh of group) {
+        totalPositions += mesh.positions.length;
+        totalIndices += mesh.indices.length;
+    }
+    const positions = new Float32Array(totalPositions);
+    const indices = new Uint32Array(totalIndices);
+    let positionOffset = 0;
+    let indexOffset = 0;
+    let vertexBase = 0;
+    for (const mesh of group) {
+        positions.set(mesh.positions, positionOffset);
+        for (let i = 0; i < mesh.indices.length; i++) {
+            indices[indexOffset + i] = mesh.indices[i] + vertexBase;
+        }
+        positionOffset += mesh.positions.length;
+        indexOffset += mesh.indices.length;
+        // 3 floats per vertex; the next mesh's indices start after these vertices.
+        vertexBase += mesh.positions.length / 3;
+    }
+    return { positions, indices };
+}
+/**
+ * Deterministic non-negative 31-bit ref derived purely from the prim path via
+ * FNV-1a over the UTF-16 code units. No clock, no randomness: the same path
+ * always yields the same ref.
+ */
+function refFromPath(path) {
+    let hash = 0x811c9dc5; // FNV-1a 32-bit offset basis
+    for (let i = 0; i < path.length; i++) {
+        hash ^= path.charCodeAt(i) & 0xff;
+        // 32-bit FNV prime multiply via shifts, kept in unsigned 32-bit space.
+        hash = (hash + ((hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) + (hash << 24))) >>> 0;
+        // Mix the high byte of multi-byte code units so non-ASCII paths differ.
+        const high = (path.charCodeAt(i) >> 8) & 0xff;
+        if (high !== 0) {
+            hash ^= high;
+            hash = (hash + ((hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) + (hash << 24))) >>> 0;
+        }
+    }
+    // Mask to 31 bits so the result is always a non-negative safe integer.
+    return hash & 0x7fffffff;
+}
+//# sourceMappingURL=ifcx.js.map

package/dist/adapters/ifcx.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ifcx.js","sourceRoot":"","sources":["../../src/adapters/ifcx.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,OAAO,EAAE,SAAS,EAAiB,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAC/D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAiChD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,OAA2B;IAChE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,GAAG,IAAI,EAAE,GAAG,OAAO,CAAC;IAE5D,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,MAAM,CAAC;IAE7D,yEAAyE;IACzE,yEAAyE;IACzE,uEAAuE;IACvE,uEAAuE;IACvE,2EAA2E;IAC3E,uEAAuE;IACvE,8DAA8D;IAC9D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC7D,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEzD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,wEAAwE;QACxE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,SAAS;QAEvC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;IAEpD,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACxC,0EAA0E;QAC1E,wEAAwE;QACxE,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QAElC,MAAM,OAAO,GAAiB;YAC5B,GAAG;YACH,GAAG,EAAE,WAAW,CAAC,GAAG,CAAC;YACrB,KAAK,EAAE,OAAO;YACd,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC;YAC9C,IAAI,EAAE,WAAW,CAAC,QAAQ,EAAE,SAAS,CAAC;YACtC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,SAAS,CAAC;YACvC,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,OAAO,EAAE,MAAM,CAAC,OAAO;SACxB,CAAC;QAEF,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,UAAU,GAAG,eAAe;QAChC,CAAC,CAAC,mBAAmB,CAAC,aAAa,EAAE,WAAW,CAAC;QACjD,CAAC,CAAC,gBAAgB,EAAE,CAAC;IAEvB,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;AAClC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,aAA+B,EAC/B,WAAsC;IAEtC,MAAM,KAAK,GAA4B,EAAE,CAAC;IAE1C,KAAK,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,WAAW,EAAE,CAAC;QAC/C,yEAAyE;QACzE,qEAAqE;QACrE,MAAM,EAAE,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,aAAa,CAAC,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC7D,MAAM,OAAO,GAAG,aAAa,CAAC,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC5D,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,IAAI,OAAO;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC;QACD,KAAK,MAAM,SAAS,IAAI,OAAO,EAAE,CAAC;YAChC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,IAAI,OAAO;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IAED,OAAO,gBAAgB,CAAC,KAAK,CAAC,CAAC;AACjC,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CACjB,IAAc,EACd,QAA6C,EAC7C,SAAiB;IAEjB,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC,OAAO,CAAC;IACjE,MAAM,QAAQ,GAAG,QAAQ,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;IACjD,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAC;IAC/E,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,SAAS,WAAW,CAClB,QAAyC,EACzC,SAAiB;IAEjB,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACzC,OAAO,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;AACpD,CAAC;AAED;;;;;GAKG;AACH,SAAS,WAAW,CAAC,KAAiB;IACpC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACtE,CAAC;IAED,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,cAAc,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;QACxC,YAAY,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IACtC,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,YAAY,CAAC,CAAC;IAC9C,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,OAAO,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;QAC1D,CAAC;QACD,cAAc,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;QACxC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QACnC,2EAA2E;QAC3E,UAAU,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AAChC,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,IAAY;IAC/B,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,6BAA6B;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAClC,uEAAuE;QACvE,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7F,wEAAwE;QACxE,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;QAC9C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,IAAI,IAAI,CAAC;YACb,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/F,CAAC;IACH,CAAC;IACD,uEAAuE;IACvE,OAAO,IAAI,GAAG,UAAU,CAAC;AAC3B,CAAC"}