@ifc-lite/clash 1.1.0

package/dist/engine.d.ts

@@ -0,0 +1,14 @@
+import { type ClashEngine } from './engine-ts/index.js';
+export type { ClashEngine };
+export type ClashBackend = 'ts' | 'wasm' | 'auto';
+export interface CreateClashEngineOptions {
+    /** `ts` reference engine (default for now). `wasm`/`auto` land in Phase 3. */
+    backend?: ClashBackend;
+}
+/**
+ * Create a clash engine. Phase 0 ships the TypeScript reference engine; the
+ * Rust→WASM backend and `auto` selection arrive in Phase 3 behind this same
+ * interface.
+ */
+export declare function createClashEngine(options?: CreateClashEngineOptions): ClashEngine;
+//# sourceMappingURL=engine.d.ts.map

package/dist/engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.d.ts","sourceRoot":"","sources":["../src/engine.ts"],"names":[],"mappings":"AAIA,OAAO,EAAiB,KAAK,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAEvE,YAAY,EAAE,WAAW,EAAE,CAAC;AAE5B,MAAM,MAAM,YAAY,GAAG,IAAI,GAAG,MAAM,GAAG,MAAM,CAAC;AAElD,MAAM,WAAW,wBAAwB;IACvC,8EAA8E;IAC9E,OAAO,CAAC,EAAE,YAAY,CAAC;CACxB;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,GAAE,wBAA6B,GAAG,WAAW,CAWrF"}

package/dist/engine.js

@@ -0,0 +1,20 @@
+/* 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 { TsClashEngine } from './engine-ts/index.js';
+/**
+ * Create a clash engine. Phase 0 ships the TypeScript reference engine; the
+ * Rust→WASM backend and `auto` selection arrive in Phase 3 behind this same
+ * interface.
+ */
+export function createClashEngine(options = {}) {
+    const backend = options.backend ?? 'auto';
+    if (backend === 'wasm') {
+        throw new Error('Import { WasmClashEngine } from "@ifc-lite/clash/wasm" instead — the WASM backend ' +
+            'needs async init and is kept off the core import graph (subpath-only).');
+    }
+    // 'auto' resolves to the in-process TS engine. The Rust/WASM backend is opt-in
+    // via @ifc-lite/clash/wasm (it requires an async module init before use).
+    return new TsClashEngine();
+}
+//# sourceMappingURL=engine.js.map

package/dist/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../src/engine.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D,OAAO,EAAE,aAAa,EAAoB,MAAM,sBAAsB,CAAC;AAWvE;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,UAAoC,EAAE;IACtE,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,MAAM,CAAC;IAC1C,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CACb,oFAAoF;YAClF,wEAAwE,CAC3E,CAAC;IACJ,CAAC;IACD,+EAA+E;IAC/E,0EAA0E;IAC1E,OAAO,IAAI,aAAa,EAAE,CAAC;AAC7B,CAAC"}

package/dist/exclude.d.ts

@@ -0,0 +1,15 @@
+import type { ExclusionSet } from './types.js';
+/**
+ * Federation-safe element identity: a model-qualified key. Element identity is
+ * `(model, key)` everywhere in the engine, so exclusions must be namespaced by
+ * model too — otherwise two models that both contain element "42" collide and
+ * can hide valid cross-model clashes.
+ */
+export declare function qualifiedKey(model: string, key: string): string;
+/** Order-independent key for a pair of (already model-qualified) element keys. */
+export declare function pairKey(a: string, b: string): string;
+/** Build an exclusion set from qualified-key pairs (voids/hosts/assemblies). */
+export declare function makeExclusionSet(pairs?: Iterable<[string, string]>): ExclusionSet;
+/** Whether the pair (a, b) — both model-qualified keys — is excluded. */
+export declare function isExcluded(set: ExclusionSet, a: string, b: string): boolean;
+//# sourceMappingURL=exclude.d.ts.map

package/dist/exclude.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"exclude.d.ts","sourceRoot":"","sources":["../src/exclude.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAW/C;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAE/D;AAED,kFAAkF;AAClF,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAGpD;AAED,gFAAgF;AAChF,wBAAgB,gBAAgB,CAAC,KAAK,GAAE,QAAQ,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAM,GAAG,YAAY,CAMrF;AAED,yEAAyE;AACzE,wBAAgB,UAAU,CAAC,GAAG,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAE3E"}

package/dist/exclude.js

@@ -0,0 +1,38 @@
+/* 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/. */
+/**
+ * Length-prefix encode a string so concatenations are unambiguous regardless of
+ * the content (model ids, IfcGUIDs and USD prim paths are all free-form). All
+ * output is printable ASCII — no separators to collide with, no control bytes.
+ */
+function encode(value) {
+    return `${value.length}:${value}`;
+}
+/**
+ * Federation-safe element identity: a model-qualified key. Element identity is
+ * `(model, key)` everywhere in the engine, so exclusions must be namespaced by
+ * model too — otherwise two models that both contain element "42" collide and
+ * can hide valid cross-model clashes.
+ */
+export function qualifiedKey(model, key) {
+    return encode(model) + encode(key);
+}
+/** Order-independent key for a pair of (already model-qualified) element keys. */
+export function pairKey(a, b) {
+    const [lo, hi] = a < b ? [a, b] : [b, a];
+    return encode(lo) + encode(hi);
+}
+/** Build an exclusion set from qualified-key pairs (voids/hosts/assemblies). */
+export function makeExclusionSet(pairs = []) {
+    const set = new Set();
+    for (const [a, b] of pairs) {
+        set.add(pairKey(a, b));
+    }
+    return set;
+}
+/** Whether the pair (a, b) — both model-qualified keys — is excluded. */
+export function isExcluded(set, a, b) {
+    return set.has(pairKey(a, b));
+}
+//# sourceMappingURL=exclude.js.map

package/dist/exclude.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"exclude.js","sourceRoot":"","sources":["../src/exclude.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAI/D;;;;GAIG;AACH,SAAS,MAAM,CAAC,KAAa;IAC3B,OAAO,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;AACpC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,GAAW;IACrD,OAAO,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;AACrC,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,OAAO,CAAC,CAAS,EAAE,CAAS;IAC1C,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;AACjC,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,gBAAgB,CAAC,QAAoC,EAAE;IACrE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,UAAU,CAAC,GAAiB,EAAE,CAAS,EAAE,CAAS;IAChE,OAAO,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAChC,CAAC"}

package/dist/grouping.d.ts

@@ -0,0 +1,16 @@
+import { center } from './math/aabb.js';
+import type { ClashGroup, ClashResult } from './types.js';
+/** How to partition a `ClashResult` into groups. */
+export interface GroupOptions {
+    by: 'cluster' | 'rule' | 'typePair' | 'element' | 'storey';
+    /** Cluster radius in metres for `by: 'cluster'`. Defaults to 1.5 m. */
+    epsilon?: number;
+}
+/**
+ * Group a clash result. `Clash` carries no storey, so `by: 'storey'` falls back
+ * to rule grouping (see module notes / report) rather than inventing a field.
+ */
+export declare function groupClashes(result: ClashResult, opts: GroupOptions): ClashGroup[];
+/** Re-exported for callers that want the cluster centre of a group's bounds. */
+export { center as groupCenter };
+//# sourceMappingURL=grouping.d.ts.map

package/dist/grouping.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"grouping.d.ts","sourceRoot":"","sources":["../src/grouping.ts"],"names":[],"mappings":"AAcA,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAIxC,OAAO,KAAK,EAGV,UAAU,EACV,WAAW,EAGZ,MAAM,YAAY,CAAC;AAEpB,oDAAoD;AACpD,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,SAAS,GAAG,MAAM,GAAG,UAAU,GAAG,SAAS,GAAG,QAAQ,CAAC;IAC3D,uEAAuE;IACvE,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AA6RD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,WAAW,EAAE,IAAI,EAAE,YAAY,GAAG,UAAU,EAAE,CAqClF;AAED,gFAAgF;AAChF,OAAO,EAAE,MAAM,IAAI,WAAW,EAAE,CAAC"}

package/dist/grouping.js

@@ -0,0 +1,311 @@
+/* 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 { center } from './math/aabb.js';
+import { distSq } from './math/vec3.js';
+import { CLASH_RULE_PRESETS, DISCIPLINES } from './disciplines.js';
+import { qualifiedKey } from './exclude.js';
+const DEFAULT_EPSILON = 1.5;
+const SEVERITY_RANK = {
+    critical: 0,
+    major: 1,
+    minor: 2,
+    info: 3,
+};
+/** Stable 32-bit FNV-1a hash of a string, hex-encoded. Purely input-derived. */
+function fnv1a(input) {
+    let hash = 0x811c9dc5;
+    for (let i = 0; i < input.length; i += 1) {
+        const code = input.charCodeAt(i);
+        // Fold both bytes of each UTF-16 code unit so non-ASCII ids cannot collide.
+        // 32-bit FNV prime multiply via shifts to stay in unsigned range.
+        hash ^= code & 0xff;
+        hash = (hash + ((hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) + (hash << 24))) >>> 0;
+        hash ^= (code >>> 8) & 0xff;
+        hash = (hash + ((hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) + (hash << 24))) >>> 0;
+    }
+    return hash.toString(16).padStart(8, '0');
+}
+/** Union of two axis-aligned boxes. */
+function unionBounds(a, b) {
+    return {
+        min: [
+            Math.min(a.min[0], b.min[0]),
+            Math.min(a.min[1], b.min[1]),
+            Math.min(a.min[2], b.min[2]),
+        ],
+        max: [
+            Math.max(a.max[0], b.max[0]),
+            Math.max(a.max[1], b.max[1]),
+            Math.max(a.max[2], b.max[2]),
+        ],
+    };
+}
+/** Union of all member bounds. `members` is assumed non-empty. */
+function unionOfBounds(members) {
+    let acc = members[0].bounds;
+    for (let i = 1; i < members.length; i += 1) {
+        acc = unionBounds(acc, members[i].bounds);
+    }
+    return acc;
+}
+/** Mean of member points. `members` is assumed non-empty. */
+function meanPoint(members) {
+    let x = 0;
+    let y = 0;
+    let z = 0;
+    for (const m of members) {
+        x += m.point[0];
+        y += m.point[1];
+        z += m.point[2];
+    }
+    const n = members.length;
+    return [x / n, y / n, z / n];
+}
+/** Most severe severity among members (critical wins). Assumes non-empty. */
+function maxSeverity(members) {
+    let best = members[0].severity;
+    for (let i = 1; i < members.length; i += 1) {
+        if (SEVERITY_RANK[members[i].severity] < SEVERITY_RANK[best]) {
+            best = members[i].severity;
+        }
+    }
+    return best;
+}
+/** Sorted, separator-joined member ids — the basis for the stable group id. */
+function memberIdSignature(members) {
+    const ids = members.map((m) => m.id).sort();
+    // Newline separates ids: it cannot occur inside an engine clash id (a single
+    // line of space-separated GUID/path tokens), so the join stays injective even
+    // if a model name or key contains spaces.
+    return ids.join('\n');
+}
+/**
+ * Stable group id. `discriminator` distinguishes groups that share a member set
+ * but mean different things — notably element-mode groups, where two elements
+ * that clash only with each other would otherwise collide on an identical id
+ * (and downstream produce duplicate BCF topic GUIDs).
+ */
+function groupId(members, discriminator = '') {
+    return `grp-${fnv1a(`${discriminator}\n${memberIdSignature(members)}`)}`;
+}
+/** Sorted type-pair key, order-independent: `IfcBeam|IfcPipeSegment`. */
+function typePairKey(clash) {
+    const [first, second] = clash.a.tag <= clash.b.tag ? [clash.a.tag, clash.b.tag] : [clash.b.tag, clash.a.tag];
+    return `${first}|${second}`;
+}
+/** Discipline label for a rule, via presets then the discipline table. */
+function disciplineForRule(rule) {
+    const preset = CLASH_RULE_PRESETS.find((p) => p.id === rule);
+    if (preset) {
+        return preset.name;
+    }
+    const upper = rule.toUpperCase();
+    for (const info of Object.values(DISCIPLINES)) {
+        if (upper === info.code) {
+            return info.label;
+        }
+    }
+    return undefined;
+}
+/** Human-readable title for a rule-based group. */
+function ruleTitle(rule) {
+    const label = disciplineForRule(rule);
+    return label ? `${label} (${rule})` : `Rule ${rule}`;
+}
+function makeGroup(members, title, discipline, discriminator = '') {
+    const group = {
+        id: groupId(members, discriminator),
+        title,
+        members,
+        bounds: unionOfBounds(members),
+        representativePoint: meanPoint(members),
+        severity: maxSeverity(members),
+    };
+    if (discipline !== undefined) {
+        group.discipline = discipline;
+    }
+    return group;
+}
+/**
+ * Spatial DBSCAN-style clustering: two clashes join iff they share the same
+ * `rule` AND the same sorted type-pair AND their `point`s are within `epsilon`
+ * (transitively). Partitioning by (rule, type-pair) first keeps unrelated
+ * conflicts apart even when co-located. O(n^2) within each partition.
+ */
+function clusterGroups(clashes, epsilon) {
+    const partitions = new Map();
+    for (const clash of clashes) {
+        const key = `${clash.rule}\n${typePairKey(clash)}`;
+        const bucket = partitions.get(key);
+        if (bucket) {
+            bucket.push(clash);
+        }
+        else {
+            partitions.set(key, [clash]);
+        }
+    }
+    const epsilonSq = epsilon * epsilon;
+    const groups = [];
+    for (const bucket of partitions.values()) {
+        const n = bucket.length;
+        const parent = new Array(n);
+        for (let i = 0; i < n; i += 1) {
+            parent[i] = i;
+        }
+        const find = (i) => {
+            let root = i;
+            while (parent[root] !== root) {
+                root = parent[root];
+            }
+            // Path compression keeps repeated lookups flat; deterministic.
+            let cur = i;
+            while (parent[cur] !== root) {
+                const next = parent[cur];
+                parent[cur] = root;
+                cur = next;
+            }
+            return root;
+        };
+        const union = (i, j) => {
+            const ri = find(i);
+            const rj = find(j);
+            if (ri !== rj) {
+                // Attach the higher-index root under the lower to keep ids stable.
+                if (ri < rj) {
+                    parent[rj] = ri;
+                }
+                else {
+                    parent[ri] = rj;
+                }
+            }
+        };
+        for (let i = 0; i < n; i += 1) {
+            for (let j = i + 1; j < n; j += 1) {
+                if (distSq(bucket[i].point, bucket[j].point) <= epsilonSq) {
+                    union(i, j);
+                }
+            }
+        }
+        const byRoot = new Map();
+        for (let i = 0; i < n; i += 1) {
+            const root = find(i);
+            const members = byRoot.get(root);
+            if (members) {
+                members.push(bucket[i]);
+            }
+            else {
+                byRoot.set(root, [bucket[i]]);
+            }
+        }
+        for (const members of byRoot.values()) {
+            const sample = members[0];
+            const discipline = disciplineForRule(sample.rule);
+            const title = `${typePairKey(sample).replaceAll('|', ' vs ')} (${sample.rule})`;
+            groups.push(makeGroup(members, title, discipline));
+        }
+    }
+    return groups;
+}
+function ruleGroups(clashes) {
+    const byRule = new Map();
+    for (const clash of clashes) {
+        const bucket = byRule.get(clash.rule);
+        if (bucket) {
+            bucket.push(clash);
+        }
+        else {
+            byRule.set(clash.rule, [clash]);
+        }
+    }
+    const groups = [];
+    for (const [rule, members] of byRule) {
+        groups.push(makeGroup(members, ruleTitle(rule), disciplineForRule(rule)));
+    }
+    return groups;
+}
+function typePairGroups(clashes) {
+    const byPair = new Map();
+    for (const clash of clashes) {
+        const key = typePairKey(clash);
+        const bucket = byPair.get(key);
+        if (bucket) {
+            bucket.push(clash);
+        }
+        else {
+            byPair.set(key, [clash]);
+        }
+    }
+    const groups = [];
+    for (const [key, members] of byPair) {
+        groups.push(makeGroup(members, key.replaceAll('|', ' vs '), undefined));
+    }
+    return groups;
+}
+function elementGroups(clashes) {
+    // Each clash contributes to BOTH participating elements, keyed by (model, key)
+    // so federated elements that share a key do not collide into one group.
+    const byElement = new Map();
+    for (const clash of clashes) {
+        for (const ref of [clash.a, clash.b]) {
+            const k = qualifiedKey(ref.model, ref.key);
+            const bucket = byElement.get(k);
+            if (bucket) {
+                bucket.members.push(clash);
+            }
+            else {
+                byElement.set(k, { ref, members: [clash] });
+            }
+        }
+    }
+    const groups = [];
+    for (const [k, { ref, members }] of byElement) {
+        const label = ref.name ?? ref.key;
+        groups.push(makeGroup(members, `Clashes on ${ref.tag} ${label}`, undefined, `elem:${k}`));
+    }
+    return groups;
+}
+/**
+ * Group a clash result. `Clash` carries no storey, so `by: 'storey'` falls back
+ * to rule grouping (see module notes / report) rather than inventing a field.
+ */
+export function groupClashes(result, opts) {
+    const clashes = result.clashes;
+    let groups;
+    switch (opts.by) {
+        case 'cluster':
+            groups = clusterGroups(clashes, opts.epsilon ?? DEFAULT_EPSILON);
+            break;
+        case 'rule':
+            groups = ruleGroups(clashes);
+            break;
+        case 'typePair':
+            groups = typePairGroups(clashes);
+            break;
+        case 'element':
+            groups = elementGroups(clashes);
+            break;
+        case 'storey':
+            // Clash carries no storey; degrade to rule grouping. See notes.
+            groups = ruleGroups(clashes);
+            break;
+        default: {
+            const exhaustive = opts.by;
+            throw new Error(`Unknown grouping mode: ${String(exhaustive)}`);
+        }
+    }
+    // Severity (critical first), then member count desc, tie-break by id asc.
+    groups.sort((a, b) => {
+        const sev = SEVERITY_RANK[a.severity] - SEVERITY_RANK[b.severity];
+        if (sev !== 0)
+            return sev;
+        const count = b.members.length - a.members.length;
+        if (count !== 0)
+            return count;
+        return a.id < b.id ? -1 : a.id > b.id ? 1 : 0;
+    });
+    return groups;
+}
+/** Re-exported for callers that want the cluster centre of a group's bounds. */
+export { center as groupCenter };
+//# sourceMappingURL=grouping.js.map

package/dist/grouping.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"grouping.js","sourceRoot":"","sources":["../src/grouping.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAY/D,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACxC,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACxC,OAAO,EAAE,kBAAkB,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACnE,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAiB5C,MAAM,eAAe,GAAG,GAAG,CAAC;AAE5B,MAAM,aAAa,GAAkC;IACnD,QAAQ,EAAE,CAAC;IACX,KAAK,EAAE,CAAC;IACR,KAAK,EAAE,CAAC;IACR,IAAI,EAAE,CAAC;CACR,CAAC;AAEF,gFAAgF;AAChF,SAAS,KAAK,CAAC,KAAa;IAC1B,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACjC,4EAA4E;QAC5E,kEAAkE;QAClE,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC;QACpB,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,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;QAC5B,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;IAC/F,CAAC;IACD,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC5C,CAAC;AAED,uCAAuC;AACvC,SAAS,WAAW,CAAC,CAAO,EAAE,CAAO;IACnC,OAAO;QACL,GAAG,EAAE;YACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC7B;QACD,GAAG,EAAE;YACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC7B;KACF,CAAC;AACJ,CAAC;AAED,kEAAkE;AAClE,SAAS,aAAa,CAAC,OAAgB;IACrC,IAAI,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,6DAA6D;AAC7D,SAAS,SAAS,CAAC,OAAgB;IACjC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED,6EAA6E;AAC7E,SAAS,WAAW,CAAC,OAAgB;IACnC,IAAI,IAAI,GAAkB,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7D,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+EAA+E;AAC/E,SAAS,iBAAiB,CAAC,OAAgB;IACzC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5C,6EAA6E;IAC7E,8EAA8E;IAC9E,0CAA0C;IAC1C,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED;;;;;GAKG;AACH,SAAS,OAAO,CAAC,OAAgB,EAAE,aAAa,GAAG,EAAE;IACnD,OAAO,OAAO,KAAK,CAAC,GAAG,aAAa,KAAK,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;AAC3E,CAAC;AAED,yEAAyE;AACzE,SAAS,WAAW,CAAC,KAAY;IAC/B,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GACnB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACvF,OAAO,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC;AAC9B,CAAC;AAED,0EAA0E;AAC1E,SAAS,iBAAiB,CAAC,IAAY;IACrC,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;IAC7D,IAAI,MAAM,EAAE,CAAC;QACX,OAAO,MAAM,CAAC,IAAI,CAAC;IACrB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;QAC9C,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,mDAAmD;AACnD,SAAS,SAAS,CAAC,IAAY;IAC7B,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACtC,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC;AACvD,CAAC;AAED,SAAS,SAAS,CAChB,OAAgB,EAChB,KAAa,EACb,UAA8B,EAC9B,aAAa,GAAG,EAAE;IAElB,MAAM,KAAK,GAAe;QACxB,EAAE,EAAE,OAAO,CAAC,OAAO,EAAE,aAAa,CAAC;QACnC,KAAK;QACL,OAAO;QACP,MAAM,EAAE,aAAa,CAAC,OAAO,CAAC;QAC9B,mBAAmB,EAAE,SAAS,CAAC,OAAO,CAAC;QACvC,QAAQ,EAAE,WAAW,CAAC,OAAO,CAAC;KAC/B,CAAC;IACF,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,KAAK,CAAC,UAAU,GAAG,UAAU,CAAC;IAChC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,OAAgB,EAAE,OAAe;IACtD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,IAAI,KAAK,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QACnD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,OAAO,GAAG,OAAO,CAAC;IACpC,MAAM,MAAM,GAAiB,EAAE,CAAC;IAEhC,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE;YACjC,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC7B,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;YACD,+DAA+D;YAC/D,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,OAAO,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;gBACzB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;gBACnB,GAAG,GAAG,IAAI,CAAC;YACb,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QACF,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAQ,EAAE;YAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;gBACd,mEAAmE;gBACnE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;gBAClB,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;oBAC1D,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAmB,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QAED,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,UAAU,GAAG,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAClD,MAAM,KAAK,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC;YAChF,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,UAAU,CAAC,OAAgB;IAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC1C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,EAAE,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,cAAc,CAAC,OAAgB;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC1C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,MAAM,EAAE,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,aAAa,CAAC,OAAgB;IACrC,+EAA+E;IAC/E,wEAAwE;IACxE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAsD,CAAC;IAChF,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YAC3C,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC;QAClC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,cAAc,GAAG,CAAC,GAAG,IAAI,KAAK,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5F,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,MAAmB,EAAE,IAAkB;IAClE,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAC/B,IAAI,MAAoB,CAAC;IAEzB,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QAChB,KAAK,SAAS;YACZ,MAAM,GAAG,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,eAAe,CAAC,CAAC;YACjE,MAAM;QACR,KAAK,MAAM;YACT,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7B,MAAM;QACR,KAAK,UAAU;YACb,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;YACjC,MAAM;QACR,KAAK,SAAS;YACZ,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;YAChC,MAAM;QACR,KAAK,QAAQ;YACX,gEAAgE;YAChE,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7B,MAAM;QACR,OAAO,CAAC,CAAC,CAAC;YACR,MAAM,UAAU,GAAU,IAAI,CAAC,EAAE,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnB,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAClE,IAAI,GAAG,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;QAClD,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAC9B,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gFAAgF;AAChF,OAAO,EAAE,MAAM,IAAI,WAAW,EAAE,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,18 @@
+/**
+ * @ifc-lite/clash — representation-agnostic clash detection core.
+ *
+ * This entry point depends only on `@ifc-lite/spatial` and geometry *types*.
+ * Source adapters (STEP, IFCx) and the BCF bridge live behind subpath exports
+ * (`@ifc-lite/clash/step`, …) so the core import graph stays free of
+ * version-specific dependencies — the boundary that keeps IFC5 a new adapter
+ * rather than a rewrite.
+ */
+export * from './types.js';
+export { matchesSelector } from './selectors.js';
+export { DISCIPLINES, CLASH_RULE_PRESETS, inferClashSeverity, disciplineMatrixRules, rulesFromPresets, type Discipline, type DisciplineInfo, type ClashRulePreset, } from './disciplines.js';
+export { createClashEngine, type ClashEngine, type ClashBackend, type CreateClashEngineOptions } from './engine.js';
+export { makeExclusionSet, isExcluded, pairKey } from './exclude.js';
+export { buildTriageSystemPrompt, buildTriageUserMessage, parseTriageResponse, type ClashTriageResult, } from './triage.js';
+export { groupClashes, type GroupOptions } from './grouping.js';
+export { compareClashRuns, type ClashRevisionDiff } from './lifecycle.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAIA;;;;;;;;GAQG;AAEH,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EACL,WAAW,EACX,kBAAkB,EAClB,kBAAkB,EAClB,qBAAqB,EACrB,gBAAgB,EAChB,KAAK,UAAU,EACf,KAAK,cAAc,EACnB,KAAK,eAAe,GACrB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,iBAAiB,EAAE,KAAK,WAAW,EAAE,KAAK,YAAY,EAAE,KAAK,wBAAwB,EAAE,MAAM,aAAa,CAAC;AACpH,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACrE,OAAO,EACL,uBAAuB,EACvB,sBAAsB,EACtB,mBAAmB,EACnB,KAAK,iBAAiB,GACvB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,YAAY,EAAE,KAAK,YAAY,EAAE,MAAM,eAAe,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,KAAK,iBAAiB,EAAE,MAAM,gBAAgB,CAAC"}

package/dist/index.js

@@ -0,0 +1,21 @@
+/* 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/. */
+/**
+ * @ifc-lite/clash — representation-agnostic clash detection core.
+ *
+ * This entry point depends only on `@ifc-lite/spatial` and geometry *types*.
+ * Source adapters (STEP, IFCx) and the BCF bridge live behind subpath exports
+ * (`@ifc-lite/clash/step`, …) so the core import graph stays free of
+ * version-specific dependencies — the boundary that keeps IFC5 a new adapter
+ * rather than a rewrite.
+ */
+export * from './types.js';
+export { matchesSelector } from './selectors.js';
+export { DISCIPLINES, CLASH_RULE_PRESETS, inferClashSeverity, disciplineMatrixRules, rulesFromPresets, } from './disciplines.js';
+export { createClashEngine } from './engine.js';
+export { makeExclusionSet, isExcluded, pairKey } from './exclude.js';
+export { buildTriageSystemPrompt, buildTriageUserMessage, parseTriageResponse, } from './triage.js';
+export { groupClashes } from './grouping.js';
+export { compareClashRuns } from './lifecycle.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;GAQG;AAEH,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EACL,WAAW,EACX,kBAAkB,EAClB,kBAAkB,EAClB,qBAAqB,EACrB,gBAAgB,GAIjB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,iBAAiB,EAAsE,MAAM,aAAa,CAAC;AACpH,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACrE,OAAO,EACL,uBAAuB,EACvB,sBAAsB,EACtB,mBAAmB,GAEpB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,YAAY,EAAqB,MAAM,eAAe,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAA0B,MAAM,gBAAgB,CAAC"}

package/dist/lifecycle.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Clash lifecycle across model revisions (Phase 5).
+ *
+ * Compares two clash runs and partitions their clashes into added / resolved /
+ * persistent buckets. Matching is by the stable `clash.id`, which is durable
+ * across revisions because it derives from the elements' durable keys
+ * (IfcGUID / USD prim path) plus the rule id — not from runtime refs that
+ * change between loads. This makes the diff stable: a clash that survives a
+ * revision keeps its id and is reported as `persistent` rather than as a
+ * resolve-plus-add churn.
+ */
+import type { Clash, ClashResult } from './types.js';
+/**
+ * The result of comparing a previous clash run to a later ("next") one.
+ *
+ * - `added`      clashes present in `next` but not in `previous` (new issues)
+ * - `persistent` clashes present in both runs (still open; the `next` Clash)
+ * - `resolved`   clashes present in `previous` but not in `next` (fixed/removed)
+ *
+ * Each array is sorted by `clash.id` for deterministic, diff-friendly output.
+ */
+export interface ClashRevisionDiff {
+    added: Clash[];
+    persistent: Clash[];
+    resolved: Clash[];
+    summary: {
+        added: number;
+        persistent: number;
+        resolved: number;
+    };
+}
+/**
+ * Compare two clash runs and partition their clashes by lifecycle state.
+ *
+ * Pure and deterministic: the output depends only on the two inputs, never on
+ * the clock or any randomness. The `persistent` bucket returns the `next` run's
+ * Clash (the current geometry/point/distance for a still-open issue), so a
+ * caller can render the up-to-date state. Each array is sorted by id.
+ */
+export declare function compareClashRuns(previous: ClashResult, next: ClashResult): ClashRevisionDiff;
+//# sourceMappingURL=lifecycle.d.ts.map

package/dist/lifecycle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle.d.ts","sourceRoot":"","sources":["../src/lifecycle.ts"],"names":[],"mappings":"AAIA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAErD;;;;;;;;GAQG;AACH,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,KAAK,EAAE,CAAC;IACf,UAAU,EAAE,KAAK,EAAE,CAAC;IACpB,QAAQ,EAAE,KAAK,EAAE,CAAC;IAClB,OAAO,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CAClE;AAyBD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,GAAG,iBAAiB,CAsC5F"}

package/dist/lifecycle.js

@@ -0,0 +1,70 @@
+/* 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/. */
+/** Stable string compare for ids (ASCII/Unicode code-point order). */
+function byId(a, b) {
+    if (a.id < b.id)
+        return -1;
+    if (a.id > b.id)
+        return 1;
+    return 0;
+}
+/**
+ * Index a run's clashes by their stable id for O(1) membership checks. The
+ * engine dedups clash ids within a run, so ids are unique here. If a caller
+ * passed a hand-built run with a repeated id, the map keeps the last occurrence
+ * for membership tests, while the added/persistent/resolved buckets below
+ * iterate the raw clash arrays — so a duplicate id would appear once per
+ * occurrence in its bucket and in the counts.
+ */
+function indexById(run) {
+    const byKey = new Map();
+    for (const clash of run.clashes) {
+        byKey.set(clash.id, clash);
+    }
+    return byKey;
+}
+/**
+ * Compare two clash runs and partition their clashes by lifecycle state.
+ *
+ * Pure and deterministic: the output depends only on the two inputs, never on
+ * the clock or any randomness. The `persistent` bucket returns the `next` run's
+ * Clash (the current geometry/point/distance for a still-open issue), so a
+ * caller can render the up-to-date state. Each array is sorted by id.
+ */
+export function compareClashRuns(previous, next) {
+    const prevById = indexById(previous);
+    const nextById = indexById(next);
+    const added = [];
+    const persistent = [];
+    const resolved = [];
+    for (const clash of next.clashes) {
+        if (prevById.has(clash.id)) {
+            // Present in both runs: still open. Report the next run's Clash so the
+            // caller sees current geometry, not the stale previous-revision copy.
+            persistent.push(clash);
+        }
+        else {
+            added.push(clash);
+        }
+    }
+    for (const clash of previous.clashes) {
+        if (!nextById.has(clash.id)) {
+            resolved.push(clash);
+        }
+    }
+    added.sort(byId);
+    persistent.sort(byId);
+    resolved.sort(byId);
+    return {
+        added,
+        persistent,
+        resolved,
+        summary: {
+            added: added.length,
+            persistent: persistent.length,
+            resolved: resolved.length,
+        },
+    };
+}
+//# sourceMappingURL=lifecycle.js.map

package/dist/lifecycle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle.js","sourceRoot":"","sources":["../src/lifecycle.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAgC/D,sEAAsE;AACtE,SAAS,IAAI,CAAC,CAAQ,EAAE,CAAQ;IAC9B,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC,CAAC;IAC3B,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,SAAS,CAAC,GAAgB;IACjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiB,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAChC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAAqB,EAAE,IAAiB;IACvE,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAEjC,MAAM,KAAK,GAAY,EAAE,CAAC;IAC1B,MAAM,UAAU,GAAY,EAAE,CAAC;IAC/B,MAAM,QAAQ,GAAY,EAAE,CAAC;IAE7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjC,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,uEAAuE;YACvE,sEAAsE;YACtE,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEpB,OAAO;QACL,KAAK;QACL,UAAU;QACV,QAAQ;QACR,OAAO,EAAE;YACP,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,UAAU,EAAE,UAAU,CAAC,MAAM;YAC7B,QAAQ,EAAE,QAAQ,CAAC,MAAM;SAC1B;KACF,CAAC;AACJ,CAAC"}