@faicad/cq-compat-compare 0.29.5

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/dist/assembly-compare.d.ts

@@ -0,0 +1,135 @@
+/**
+ * Assembly STEP equivalence comparison.
+ *
+ * Four-level comparison:
+ * 1. Assembly structure (leaf count, part names, hierarchy)
+ * 2. Part pose (center of mass / bbox center in assembly coords)
+ * 3. Part geometry (volume, topology — per-part, name-matched)
+ * 4. Overall geometry (fuse all parts → boolean difference)
+ *
+ * Part names must match exactly (port verification scenario).
+ */
+import type { BrepBoundingBox, BrepVec3 } from '@faicad/faijs';
+/** Tolerance options. */
+export interface AssemblyCompareOptions {
+    linearTolerance?: number;
+    volumeRelativeTolerance?: number;
+    booleanVolumeTolerance?: number;
+    strictTopology?: boolean;
+    /**
+     * Require part names to match between the two files (default true).
+     * Set to false for files whose PRODUCT names are not under our control
+     * (e.g. CadQuery/OCC references named "SOLID" vs our "shape_x") — parts are
+     * then paired by index in sorted order. Structure still requires the same
+     * leaf count, so the compound-vs-parts check remains intact.
+     */
+    matchNames?: boolean;
+    /**
+     * Part-pairing strategy for the per-part comparison (P0b):
+     * - `'names'` (default): exact PRODUCT-name match — faijs-vs-faijs.
+     * - `'order-index'`: pair leaves by index after sorting both lists by name
+     *   (legacy fallback for foreign PRODUCT names; safe only when leaf count
+     *   matches and parts line up in the same sorted order).
+     * - `'order-centroid'`: pair each A-leaf to the nearest B-leaf by assembly
+     *   centroid (greedy nearest-first); robust to arbitrary naming/ordering,
+     *   used for CadQuery-reference vs faijs-candidate cross-naming compare.
+     * When `pairing` is omitted it is derived from `matchNames`
+     * (`true` → `'names'`, `false` → `'order-index'`).
+     */
+    pairing?: 'names' | 'order-index' | 'order-centroid';
+    /**
+     * Skip the fused (A∪B → cut) boolean-difference computation entirely
+     * (default false). The fused cut is expensive on near-coincident B-spline
+     * faces and the occt-wasm kernel can return inverted/garbage solids for it
+     * (documented in faijs-gears analysis docs); per-part volume/CoM/bbox
+     * checks remain the verdict. When true, `booleanDiff` is reported as
+     * {aMinusB: NaN, bMinusA: NaN, match: true}.
+     */
+    skipFusedBoolean?: boolean;
+}
+/** Per-part comparison result. */
+export interface PartCompareResult {
+    name: string;
+    found: boolean;
+    volume?: {
+        a: number;
+        b: number;
+        match: boolean;
+        diffPct: number;
+    };
+    centerOfMass?: {
+        a: BrepVec3;
+        b: BrepVec3;
+        match: boolean;
+        maxDiff: number;
+    };
+    bbox?: {
+        a: BrepBoundingBox;
+        b: BrepBoundingBox;
+        match: boolean;
+        maxDiff: number;
+    };
+    topology?: {
+        a: {
+            faces: number;
+            edges: number;
+            vertices: number;
+        };
+        b: {
+            faces: number;
+            edges: number;
+            vertices: number;
+        };
+        match: boolean;
+    };
+    color?: {
+        a: [number, number, number] | null;
+        b: [number, number, number] | null;
+        match: boolean;
+    };
+}
+/** Full assembly comparison result. */
+export interface AssemblyCompareResult {
+    fileA: string;
+    fileB: string;
+    equivalent: boolean;
+    structure: {
+        leafCountA: number;
+        leafCountB: number;
+        namesA: string[];
+        namesB: string[];
+        match: boolean;
+        missingInB: string[];
+        missingInA: string[];
+    };
+    parts: PartCompareResult[];
+    overall: {
+        volumeA: number;
+        volumeB: number;
+        volumeMatch: boolean;
+        volumeDiffPct: number;
+        bboxMatch: boolean;
+        bboxMaxDiff: number;
+        booleanDiff: {
+            aMinusB: number;
+            bMinusA: number;
+            match: boolean;
+        };
+    };
+    details: string[];
+}
+/**
+ * Compare two assembly STEP files for equivalence.
+ *
+ * @param fileA - Path to reference STEP.
+ * @param fileB - Path to candidate STEP.
+ * @param options - Comparison tolerances.
+ * @returns Detailed per-level comparison result.
+ */
+export declare function compareAssemblyFiles(fileA: string, fileB: string, options?: AssemblyCompareOptions): Promise<AssemblyCompareResult>;
+/**
+ * Print a human-readable assembly comparison report.
+ * @param result - Comparison result from compareAssemblyFiles.
+ */
+export declare function printAssemblyReport(result: AssemblyCompareResult): void;
+//# sourceMappingURL=assembly-compare.d.ts.map

package/dist/assembly-compare.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"assembly-compare.d.ts","sourceRoot":"","sources":["../src/assembly-compare.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAQH,OAAO,KAAK,EAA2B,eAAe,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAGvF,yBAAyB;AACzB,MAAM,WAAW,sBAAsB;IACrC,eAAe,CAAC,EAAE,MAAM,CAAA;IACxB,uBAAuB,CAAC,EAAE,MAAM,CAAA;IAChC,sBAAsB,CAAC,EAAE,MAAM,CAAA;IAC/B,cAAc,CAAC,EAAE,OAAO,CAAA;IACxB;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,EAAE,OAAO,GAAG,aAAa,GAAG,gBAAgB,CAAA;IACpD;;;;;;;OAOG;IACH,gBAAgB,CAAC,EAAE,OAAO,CAAA;CAC3B;AAED,kCAAkC;AAClC,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAA;IACZ,KAAK,EAAE,OAAO,CAAA;IACd,MAAM,CAAC,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAA;IAClE,YAAY,CAAC,EAAE;QAAE,CAAC,EAAE,QAAQ,CAAC;QAAC,CAAC,EAAE,QAAQ,CAAC;QAAC,KAAK,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAA;IAC5E,IAAI,CAAC,EAAE;QAAE,CAAC,EAAE,eAAe,CAAC;QAAC,CAAC,EAAE,eAAe,CAAC;QAAC,KAAK,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAA;IAClF,QAAQ,CAAC,EAAE;QACT,CAAC,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,MAAM,CAAA;SAAE,CAAA;QACrD,CAAC,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,MAAM,CAAA;SAAE,CAAA;QACrD,KAAK,EAAE,OAAO,CAAA;KACf,CAAA;IACD,KAAK,CAAC,EAAE;QAAE,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;QAAC,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;QAAC,KAAK,EAAE,OAAO,CAAA;KAAE,CAAA;CACnG;AAED,uCAAuC;AACvC,MAAM,WAAW,qBAAqB;IACpC,KAAK,EAAE,MAAM,CAAA;IACb,KAAK,EAAE,MAAM,CAAA;IACb,UAAU,EAAE,OAAO,CAAA;IACnB,SAAS,EAAE;QACT,UAAU,EAAE,MAAM,CAAA;QAClB,UAAU,EAAE,MAAM,CAAA;QAClB,MAAM,EAAE,MAAM,EAAE,CAAA;QAChB,MAAM,EAAE,MAAM,EAAE,CAAA;QAChB,KAAK,EAAE,OAAO,CAAA;QACd,UAAU,EAAE,MAAM,EAAE,CAAA;QACpB,UAAU,EAAE,MAAM,EAAE,CAAA;KACrB,CAAA;IACD,KAAK,EAAE,iBAAiB,EAAE,CAAA;IAC1B,OAAO,EAAE;QACP,OAAO,EAAE,MAAM,CAAA;QACf,OAAO,EAAE,MAAM,CAAA;QACf,WAAW,EAAE,OAAO,CAAA;QACpB,aAAa,EAAE,MAAM,CAAA;QACrB,SAAS,EAAE,OAAO,CAAA;QAClB,WAAW,EAAE,MAAM,CAAA;QACnB,WAAW,EAAE;YAAE,OAAO,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,OAAO,CAAA;SAAE,CAAA;KAClE,CAAA;IACD,OAAO,EAAE,MAAM,EAAE,CAAA;CAClB;AA4CD;;;;;;;GAOG;AACH,wBAAsB,oBAAoB,CACxC,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,sBAA2B,GACnC,OAAO,CAAC,qBAAqB,CAAC,CA6LhC;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,qBAAqB,GAAG,IAAI,CA2BvE"}

package/dist/assembly-compare.js

@@ -0,0 +1,266 @@
+/**
+ * Assembly STEP equivalence comparison.
+ *
+ * Four-level comparison:
+ * 1. Assembly structure (leaf count, part names, hierarchy)
+ * 2. Part pose (center of mass / bbox center in assembly coords)
+ * 3. Part geometry (volume, topology — per-part, name-matched)
+ * 4. Overall geometry (fuse all parts → boolean difference)
+ *
+ * Part names must match exactly (port verification scenario).
+ */
+import { readFileSync } from 'node:fs';
+import { initOcctWasm, importAssemblyFromStep, collectLeafParts, } from '@faicad/faijs';
+// pairing 由 matchNames 推导（见 compareAssemblyFiles 内部），不进 DEFAULT_OPTS，
+// 否则会覆盖「matchNames:false 但缺 pairing」的推定语义。
+const DEFAULT_OPTS = {
+    linearTolerance: 1e-3,
+    volumeRelativeTolerance: 1e-3,
+    booleanVolumeTolerance: 1e-1,
+    strictTopology: false,
+    matchNames: true,
+    skipFusedBoolean: false,
+};
+function vmax(a, b) {
+    return Math.max(Math.abs(a.x - b.x), Math.abs(a.y - b.y), Math.abs(a.z - b.z));
+}
+function bbmax(a, b) {
+    return Math.max(Math.abs(a.xmin - b.xmin), Math.abs(a.xmax - b.xmax), Math.abs(a.ymin - b.ymin), Math.abs(a.ymax - b.ymax), Math.abs(a.zmin - b.zmin), Math.abs(a.zmax - b.zmax));
+}
+function topoStats(kernel, shape) {
+    return {
+        faces: kernel.getSubShapes(shape, 'face').length,
+        edges: kernel.getSubShapes(shape, 'edge').length,
+        vertices: kernel.getSubShapes(shape, 'vertex').length,
+    };
+}
+function fuseAll(kernel, shapes) {
+    if (shapes.length === 0)
+        return null;
+    let acc = shapes[0];
+    for (let i = 1; i < shapes.length; i++) {
+        const fused = kernel.fuse(acc, shapes[i]);
+        if (i > 1)
+            kernel.release(acc);
+        acc = fused;
+    }
+    return acc;
+}
+/**
+ * Compare two assembly STEP files for equivalence.
+ *
+ * @param fileA - Path to reference STEP.
+ * @param fileB - Path to candidate STEP.
+ * @param options - Comparison tolerances.
+ * @returns Detailed per-level comparison result.
+ */
+export async function compareAssemblyFiles(fileA, fileB, options = {}) {
+    const opts = { ...DEFAULT_OPTS, ...options };
+    const details = [];
+    const kernel = await initOcctWasm();
+    const bufA = readFileSync(fileA);
+    const bufB = readFileSync(fileB);
+    // readFileSync returns pooled Buffers for small files: buf.buffer is the
+    // whole pool with garbage beyond byteLength, which corrupts STEP imports
+    // of files < ~4KB. Pass exact copies.
+    const exact = (buf) => buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);
+    const nodesA = await importAssemblyFromStep(exact(bufA));
+    const nodesB = await importAssemblyFromStep(exact(bufB));
+    const leavesA = collectLeafParts(nodesA).filter(n => n.shapeHandle !== null);
+    const leavesB = collectLeafParts(nodesB).filter(n => n.shapeHandle !== null);
+    // ── Level 1: Structure ──
+    const namesA = leavesA.map(n => n.name).sort();
+    const namesB = leavesB.map(n => n.name).sort();
+    const missingInB = namesA.filter(n => !namesB.includes(n));
+    const missingInA = namesB.filter(n => !namesA.includes(n));
+    // P0b：pairing 模式（缺省由 matchNames 推导）
+    const pairing = opts.pairing ?? (opts.matchNames ? 'names' : 'order-index');
+    const namesMatch = pairing === 'names' && missingInB.length === 0 && missingInA.length === 0;
+    const structureMatch = leavesA.length === leavesB.length && (pairing !== 'names' || namesMatch);
+    details.push(`structure: ${leavesA.length} vs ${leavesB.length} leaves, names match=${structureMatch} (pairing=${pairing})`);
+    if (missingInB.length)
+        details.push(`  missing in B: ${missingInB.join(', ')}`);
+    if (missingInA.length)
+        details.push(`  missing in A: ${missingInA.join(', ')}`);
+    // ── Level 2 & 3: Per-part pose + geometry ──
+    const partResults = [];
+    // 配对：按 pairing 模式生成 (A-leaf, B-leaf) 对。
+    const byName = (a, b) => a.name < b.name ? -1 : a.name > b.name ? 1 : 0;
+    const centroidOf = (leaf) => kernel.getCenterOfMass(leaf.shapeHandle);
+    const pairs = [];
+    if (pairing === 'names') {
+        const mapB = new Map(leavesB.map(n => [n.name, n]));
+        for (const a of leavesA)
+            pairs.push([a, mapB.get(a.name) ?? null]);
+    }
+    else if (pairing === 'order-index') {
+        const sortedA = [...leavesA].sort(byName);
+        const sortedB = [...leavesB].sort(byName);
+        for (let i = 0; i < sortedA.length; i++)
+            pairs.push([sortedA[i], sortedB[i] ?? null]);
+    }
+    else {
+        // order-centroid：贪心最近质心配对（leaf 数相等由 structureMatch 保证）
+        const centB = leavesB.map(centroidOf);
+        const usedB = new Set();
+        for (const a of leavesA) {
+            const ca = centroidOf(a);
+            let best = -1;
+            let bestD = Infinity;
+            for (let j = 0; j < leavesB.length; j++) {
+                if (usedB.has(j))
+                    continue;
+                const d = vmax(ca, centB[j]);
+                if (d < bestD) {
+                    bestD = d;
+                    best = j;
+                }
+            }
+            if (best >= 0) {
+                usedB.add(best);
+                pairs.push([a, leavesB[best]]);
+            }
+            else
+                pairs.push([a, null]);
+        }
+    }
+    for (const [leafA, leafB] of pairs) {
+        if (!leafB) {
+            partResults.push({ name: leafA.name, found: false });
+            continue;
+        }
+        const shapeA = leafA.shapeHandle;
+        const shapeB = leafB.shapeHandle;
+        const volA = kernel.getVolume(shapeA);
+        const volB = kernel.getVolume(shapeB);
+        const volDiffPct = volA > 0 ? (Math.abs(volA - volB) / volA) * 100 : 0;
+        const volMatch = volDiffPct <= opts.volumeRelativeTolerance * 100;
+        const comA = kernel.getCenterOfMass(shapeA);
+        const comB = kernel.getCenterOfMass(shapeB);
+        const comDiff = vmax(comA, comB);
+        const comMatch = comDiff <= opts.linearTolerance;
+        const bbA = kernel.getBoundingBox(shapeA);
+        const bbB = kernel.getBoundingBox(shapeB);
+        const bbDiff = bbmax(bbA, bbB);
+        const bbMatch = bbDiff <= opts.linearTolerance;
+        const topA = topoStats(kernel, shapeA);
+        const topB = topoStats(kernel, shapeB);
+        const topoMatch = opts.strictTopology
+            ? topA.faces === topB.faces && topA.edges === topB.edges && topA.vertices === topB.vertices
+            : true;
+        const colA = leafA.color;
+        const colB = leafB.color;
+        const colMatch = Boolean((!colA && !colB) || (colA && colB &&
+            Math.abs(colA[0] - colB[0]) < 0.01 &&
+            Math.abs(colA[1] - colB[1]) < 0.01 &&
+            Math.abs(colA[2] - colB[2]) < 0.01));
+        partResults.push({
+            name: leafA.name,
+            found: true,
+            volume: { a: volA, b: volB, match: volMatch, diffPct: volDiffPct },
+            centerOfMass: { a: comA, b: comB, match: comMatch, maxDiff: comDiff },
+            bbox: { a: bbA, b: bbB, match: bbMatch, maxDiff: bbDiff },
+            topology: { a: topA, b: topB, match: topoMatch },
+            color: { a: colA, b: colB, match: colMatch },
+        });
+        details.push(`part "${leafA.name}": vol ${volA.toFixed(1)} vs ${volB.toFixed(1)} (${volDiffPct.toFixed(3)}%), com diff=${comDiff.toExponential(2)}, bbox diff=${bbDiff.toExponential(2)}, color=${colMatch}`);
+    }
+    // ── Level 4: Overall fused geometry ──
+    const shapesA = leavesA.map(n => n.shapeHandle);
+    const shapesB = leavesB.map(n => n.shapeHandle);
+    const fusedA = fuseAll(kernel, shapesA);
+    const fusedB = fuseAll(kernel, shapesB);
+    let overallVolumeA = 0, overallVolumeB = 0, overallVolMatch = false, overallVolDiffPct = 0;
+    let overallBboxMatch = false, overallBboxDiff = 0;
+    let boolAB = 0, boolBA = 0, boolMatch = false;
+    if (fusedA && fusedB) {
+        overallVolumeA = kernel.getVolume(fusedA);
+        overallVolumeB = kernel.getVolume(fusedB);
+        overallVolDiffPct = overallVolumeA > 0 ? (Math.abs(overallVolumeA - overallVolumeB) / overallVolumeA) * 100 : 0;
+        overallVolMatch = overallVolDiffPct <= opts.volumeRelativeTolerance * 100;
+        const fbbA = kernel.getBoundingBox(fusedA);
+        const fbbB = kernel.getBoundingBox(fusedB);
+        overallBboxDiff = bbmax(fbbA, fbbB);
+        overallBboxMatch = overallBboxDiff <= opts.linearTolerance;
+        if (opts.skipFusedBoolean) {
+            boolAB = NaN;
+            boolBA = NaN;
+            boolMatch = true;
+        }
+        else {
+            const cutAB = kernel.cut(fusedA, fusedB);
+            const cutBA = kernel.cut(fusedB, fusedA);
+            boolAB = kernel.getVolume(cutAB);
+            boolBA = kernel.getVolume(cutBA);
+            boolMatch = boolAB <= opts.booleanVolumeTolerance && boolBA <= opts.booleanVolumeTolerance;
+            kernel.release(cutAB);
+            kernel.release(cutBA);
+        }
+    }
+    details.push(`overall: vol ${overallVolumeA.toFixed(1)} vs ${overallVolumeB.toFixed(1)} (${overallVolDiffPct.toFixed(3)}%), bbox diff=${overallBboxDiff.toExponential(2)}, bool A-B=${boolAB.toExponential(2)}, B-A=${boolBA.toExponential(2)}`);
+    // Cleanup
+    if (fusedA)
+        kernel.release(fusedA);
+    if (fusedB)
+        kernel.release(fusedB);
+    // Note: leaf shapeHandles are owned by the assembly tree, not released here
+    const partsAllMatch = partResults.every(p => p.found && p.volume?.match && p.centerOfMass?.match && p.bbox?.match && p.topology?.match && p.color?.match);
+    const equivalent = structureMatch && partsAllMatch && overallVolMatch && overallBboxMatch && boolMatch;
+    return {
+        fileA,
+        fileB,
+        equivalent,
+        structure: {
+            leafCountA: leavesA.length,
+            leafCountB: leavesB.length,
+            namesA,
+            namesB,
+            match: structureMatch,
+            missingInB,
+            missingInA,
+        },
+        parts: partResults,
+        overall: {
+            volumeA: overallVolumeA,
+            volumeB: overallVolumeB,
+            volumeMatch: overallVolMatch,
+            volumeDiffPct: overallVolDiffPct,
+            bboxMatch: overallBboxMatch,
+            bboxMaxDiff: overallBboxDiff,
+            booleanDiff: { aMinusB: boolAB, bMinusA: boolBA, match: boolMatch },
+        },
+        details,
+    };
+}
+/**
+ * Print a human-readable assembly comparison report.
+ * @param result - Comparison result from compareAssemblyFiles.
+ */
+export function printAssemblyReport(result) {
+    console.log(`\n=== Assembly Comparison: ${result.fileA} vs ${result.fileB} ===`);
+    console.log(`Overall: ${result.equivalent ? '✓ EQUIVALENT' : '✗ DIFFERENT'}\n`);
+    console.log('── Level 1: Structure ──');
+    console.log(`  Leaves: ${result.structure.leafCountA} vs ${result.structure.leafCountB} — ${result.structure.match ? '✓' : '✗'}`);
+    console.log(`  Names A: [${result.structure.namesA.join(', ')}]`);
+    console.log(`  Names B: [${result.structure.namesB.join(', ')}]`);
+    if (result.structure.missingInB.length)
+        console.log(`  ✗ Missing in B: ${result.structure.missingInB.join(', ')}`);
+    if (result.structure.missingInA.length)
+        console.log(`  ✗ Missing in A: ${result.structure.missingInA.join(', ')}`);
+    console.log('\n── Level 2 & 3: Per-part pose + geometry ──');
+    for (const p of result.parts) {
+        if (!p.found) {
+            console.log(`  ✗ "${p.name}": not found in B`);
+            continue;
+        }
+        const ok = p.volume?.match && p.centerOfMass?.match && p.bbox?.match && p.color?.match;
+        console.log(`  ${ok ? '✓' : '✗'} "${p.name}": vol ${p.volume?.a.toFixed(1)} vs ${p.volume?.b.toFixed(1)} (${p.volume?.diffPct.toFixed(3)}%), com diff=${p.centerOfMass?.maxDiff.toExponential(2)}, bbox diff=${p.bbox?.maxDiff.toExponential(2)}, color=${p.color?.match ? '✓' : '✗'}`);
+    }
+    console.log('\n── Level 4: Overall fused geometry ──');
+    console.log(`  Volume: ${result.overall.volumeA.toFixed(1)} vs ${result.overall.volumeB.toFixed(1)} (${result.overall.volumeDiffPct.toFixed(3)}%) — ${result.overall.volumeMatch ? '✓' : '✗'}`);
+    console.log(`  BBox diff: ${result.overall.bboxMaxDiff.toExponential(2)} — ${result.overall.bboxMatch ? '✓' : '✗'}`);
+    console.log(`  Boolean A-B: ${result.overall.booleanDiff.aMinusB.toExponential(2)} mm³`);
+    console.log(`  Boolean B-A: ${result.overall.booleanDiff.bMinusA.toExponential(2)} mm³ — ${result.overall.booleanDiff.match ? '✓' : '✗'}`);
+    console.log('');
+}
+//# sourceMappingURL=assembly-compare.js.map

package/dist/assembly-compare.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"assembly-compare.js","sourceRoot":"","sources":["../src/assembly-compare.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AACtC,OAAO,EACL,YAAY,EACZ,sBAAsB,EACtB,gBAAgB,GACjB,MAAM,eAAe,CAAA;AAoFtB,sEAAsE;AACtE,2CAA2C;AAC3C,MAAM,YAAY,GAAG;IACnB,eAAe,EAAE,IAAI;IACrB,uBAAuB,EAAE,IAAI;IAC7B,sBAAsB,EAAE,IAAI;IAC5B,cAAc,EAAE,KAAK;IACrB,UAAU,EAAE,IAAI;IAChB,gBAAgB,EAAE,KAAK;CACxB,CAAA;AAED,SAAS,IAAI,CAAC,CAAW,EAAE,CAAW;IACpC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAChF,CAAC;AAED,SAAS,KAAK,CAAC,CAAkB,EAAE,CAAkB;IACnD,OAAO,IAAI,CAAC,GAAG,CACb,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EACpD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EACpD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CACrD,CAAA;AACH,CAAC;AAED,SAAS,SAAS,CAAC,MAAkB,EAAE,KAAkB;IACvD,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM;QAChD,KAAK,EAAE,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM;QAChD,QAAQ,EAAE,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,MAAM;KACtD,CAAA;AACH,CAAC;AAED,SAAS,OAAO,CAAC,MAAkB,EAAE,MAAqB;IACxD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACpC,IAAI,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QACzC,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;QAC9B,GAAG,GAAG,KAAK,CAAA;IACb,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,KAAa,EACb,KAAa,EACb,UAAkC,EAAE;IAEpC,MAAM,IAAI,GAAG,EAAE,GAAG,YAAY,EAAE,GAAG,OAAO,EAAE,CAAA;IAC5C,MAAM,OAAO,GAAa,EAAE,CAAA;IAE5B,MAAM,MAAM,GAAG,MAAM,YAAY,EAAE,CAAA;IAEnC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,CAAA;IAChC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,CAAA;IAChC,yEAAyE;IACzE,yEAAyE;IACzE,sCAAsC;IACtC,MAAM,KAAK,GAAG,CAAC,GAAW,EAAe,EAAE,CACzC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAgB,CAAA;IAClF,MAAM,MAAM,GAAG,MAAM,sBAAsB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;IACxD,MAAM,MAAM,GAAG,MAAM,sBAAsB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;IACxD,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,CAAA;IAC5E,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,CAAA;IAE5E,2BAA2B;IAC3B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAA;IAC9C,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAA;IAC9C,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1D,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1D,oCAAoC;IACpC,MAAM,OAAO,GACX,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAA;IAC7D,MAAM,UAAU,GAAG,OAAO,KAAK,OAAO,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,CAAA;IAC5F,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,KAAK,OAAO,IAAI,UAAU,CAAC,CAAA;IAC/F,OAAO,CAAC,IAAI,CAAC,cAAc,OAAO,CAAC,MAAM,OAAO,OAAO,CAAC,MAAM,wBAAwB,cAAc,aAAa,OAAO,GAAG,CAAC,CAAA;IAC5H,IAAI,UAAU,CAAC,MAAM;QAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC/E,IAAI,UAAU,CAAC,MAAM;QAAE,OAAO,CAAC,IAAI,CAAC,mBAAmB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAE/E,8CAA8C;IAC9C,MAAM,WAAW,GAAwB,EAAE,CAAA;IAE3C,wCAAwC;IACxC,MAAM,MAAM,GAAG,CAAC,CAAmB,EAAE,CAAmB,EAAU,EAAE,CAClE,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAChD,MAAM,UAAU,GAAG,CAAC,IAAsB,EAAY,EAAE,CACtD,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,WAAqC,CAAC,CAAA;IAEpE,MAAM,KAAK,GAAuD,EAAE,CAAA;IACpE,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QACnD,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAA;IACpE,CAAC;SAAM,IAAI,OAAO,KAAK,aAAa,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACzC,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAA;IACvF,CAAC;SAAM,CAAC;QACN,uDAAuD;QACvD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QACrC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;QAC/B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;YACxB,IAAI,IAAI,GAAG,CAAC,CAAC,CAAA;YACb,IAAI,KAAK,GAAG,QAAQ,CAAA;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAQ;gBAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC5B,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;oBAAC,KAAK,GAAG,CAAC,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAA;gBAAC,CAAC;YACxC,CAAC;YACD,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;gBAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YAAC,CAAC;;gBAC7D,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAA;QAC5B,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;QACnC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;YACpD,SAAQ;QACV,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,WAAsC,CAAA;QAC3D,MAAM,MAAM,GAAG,KAAK,CAAC,WAAsC,CAAA;QAE3D,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QACrC,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QACrC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACtE,MAAM,QAAQ,GAAG,UAAU,IAAI,IAAI,CAAC,uBAAuB,GAAG,GAAG,CAAA;QAEjE,MAAM,IAAI,GAAG,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAA;QAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAA;QAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAChC,MAAM,QAAQ,GAAG,OAAO,IAAI,IAAI,CAAC,eAAe,CAAA;QAEhD,MAAM,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;QACzC,MAAM,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;QACzC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;QAC9B,MAAM,OAAO,GAAG,MAAM,IAAI,IAAI,CAAC,eAAe,CAAA;QAE9C,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QACtC,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc;YACnC,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ;YAC3F,CAAC,CAAC,IAAI,CAAA;QAER,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAA;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAA;QACxB,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI;YACxD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;YAClC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;YAClC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;QAEtC,WAAW,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,KAAK,EAAE,IAAI;YACX,MAAM,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE;YAClE,YAAY,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE;YACrE,IAAI,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE;YACzD,QAAQ,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE;YAChD,KAAK,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE;SAC7C,CAAC,CAAA;QAEF,OAAO,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,eAAe,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,QAAQ,EAAE,CAAC,CAAA;IAC/M,CAAC;IAED,wCAAwC;IACxC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAsC,CAAC,CAAA;IAC1E,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAsC,CAAC,CAAA;IAC1E,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;IACvC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;IAEvC,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,CAAC,EAAE,eAAe,GAAG,KAAK,EAAE,iBAAiB,GAAG,CAAC,CAAA;IAC1F,IAAI,gBAAgB,GAAG,KAAK,EAAE,eAAe,GAAG,CAAC,CAAA;IACjD,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,SAAS,GAAG,KAAK,CAAA;IAE7C,IAAI,MAAM,IAAI,MAAM,EAAE,CAAC;QACrB,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QACzC,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QACzC,iBAAiB,GAAG,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,GAAG,cAAc,CAAC,GAAG,cAAc,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAC/G,eAAe,GAAG,iBAAiB,IAAI,IAAI,CAAC,uBAAuB,GAAG,GAAG,CAAA;QAEzE,MAAM,IAAI,GAAG,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;QAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;QAC1C,eAAe,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QACnC,gBAAgB,GAAG,eAAe,IAAI,IAAI,CAAC,eAAe,CAAA;QAE1D,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAG,CAAA;YACZ,MAAM,GAAG,GAAG,CAAA;YACZ,SAAS,GAAG,IAAI,CAAA;QAClB,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;YACxC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;YACxC,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;YAChC,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;YAChC,SAAS,GAAG,MAAM,IAAI,IAAI,CAAC,sBAAsB,IAAI,MAAM,IAAI,IAAI,CAAC,sBAAsB,CAAA;YAC1F,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;YACrB,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,gBAAgB,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IAEhP,UAAU;IACV,IAAI,MAAM;QAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAClC,IAAI,MAAM;QAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAClC,4EAA4E;IAE5E,MAAM,aAAa,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAC1C,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,CAAC,YAAY,EAAE,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,CAC5G,CAAA;IACD,MAAM,UAAU,GAAG,cAAc,IAAI,aAAa,IAAI,eAAe,IAAI,gBAAgB,IAAI,SAAS,CAAA;IAEtG,OAAO;QACL,KAAK;QACL,KAAK;QACL,UAAU;QACV,SAAS,EAAE;YACT,UAAU,EAAE,OAAO,CAAC,MAAM;YAC1B,UAAU,EAAE,OAAO,CAAC,MAAM;YAC1B,MAAM;YACN,MAAM;YACN,KAAK,EAAE,cAAc;YACrB,UAAU;YACV,UAAU;SACX;QACD,KAAK,EAAE,WAAW;QAClB,OAAO,EAAE;YACP,OAAO,EAAE,cAAc;YACvB,OAAO,EAAE,cAAc;YACvB,WAAW,EAAE,eAAe;YAC5B,aAAa,EAAE,iBAAiB;YAChC,SAAS,EAAE,gBAAgB;YAC3B,WAAW,EAAE,eAAe;YAC5B,WAAW,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE;SACpE;QACD,OAAO;KACR,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAA6B;IAC/D,OAAO,CAAC,GAAG,CAAC,8BAA8B,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,KAAK,MAAM,CAAC,CAAA;IAChF,OAAO,CAAC,GAAG,CAAC,YAAY,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,CAAA;IAE/E,OAAO,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAA;IACvC,OAAO,CAAC,GAAG,CAAC,aAAa,MAAM,CAAC,SAAS,CAAC,UAAU,OAAO,MAAM,CAAC,SAAS,CAAC,UAAU,MAAM,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAA;IACjI,OAAO,CAAC,GAAG,CAAC,eAAe,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACjE,OAAO,CAAC,GAAG,CAAC,eAAe,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACjE,IAAI,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM;QAAE,OAAO,CAAC,GAAG,CAAC,qBAAqB,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAClH,IAAI,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,MAAM;QAAE,OAAO,CAAC,GAAG,CAAC,qBAAqB,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAElH,OAAO,CAAC,GAAG,CAAC,+CAA+C,CAAC,CAAA;IAC5D,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YACb,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,IAAI,mBAAmB,CAAC,CAAA;YAC9C,SAAQ;QACV,CAAC;QACD,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,CAAC,YAAY,EAAE,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,CAAA;QACtF,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,YAAY,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAA;IACzR,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,yCAAyC,CAAC,CAAA;IACtD,OAAO,CAAC,GAAG,CAAC,aAAa,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAA;IAC/L,OAAO,CAAC,GAAG,CAAC,gBAAgB,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAA;IACpH,OAAO,CAAC,GAAG,CAAC,kBAAkB,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IACxF,OAAO,CAAC,GAAG,CAAC,kBAAkB,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAA;IAC1I,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;AACjB,CAAC","sourcesContent":["/**\n * Assembly STEP equivalence comparison.\n *\n * Four-level comparison:\n * 1. Assembly structure (leaf count, part names, hierarchy)\n * 2. Part pose (center of mass / bbox center in assembly coords)\n * 3. Part geometry (volume, topology — per-part, name-matched)\n * 4. Overall geometry (fuse all parts → boolean difference)\n *\n * Part names must match exactly (port verification scenario).\n */\n\nimport { readFileSync } from 'node:fs'\nimport {\n  initOcctWasm,\n  importAssemblyFromStep,\n  collectLeafParts,\n} from '@faicad/faijs'\nimport type { OcctKernel, ShapeHandle, BrepBoundingBox, BrepVec3 } from '@faicad/faijs'\nimport type { AssemblyPartNode } from '@faicad/faijs'\n\n/** Tolerance options. */\nexport interface AssemblyCompareOptions {\n  linearTolerance?: number\n  volumeRelativeTolerance?: number\n  booleanVolumeTolerance?: number\n  strictTopology?: boolean\n  /**\n   * Require part names to match between the two files (default true).\n   * Set to false for files whose PRODUCT names are not under our control\n   * (e.g. CadQuery/OCC references named \"SOLID\" vs our \"shape_x\") — parts are\n   * then paired by index in sorted order. Structure still requires the same\n   * leaf count, so the compound-vs-parts check remains intact.\n   */\n  matchNames?: boolean\n  /**\n   * Part-pairing strategy for the per-part comparison (P0b):\n   * - `'names'` (default): exact PRODUCT-name match — faijs-vs-faijs.\n   * - `'order-index'`: pair leaves by index after sorting both lists by name\n   *   (legacy fallback for foreign PRODUCT names; safe only when leaf count\n   *   matches and parts line up in the same sorted order).\n   * - `'order-centroid'`: pair each A-leaf to the nearest B-leaf by assembly\n   *   centroid (greedy nearest-first); robust to arbitrary naming/ordering,\n   *   used for CadQuery-reference vs faijs-candidate cross-naming compare.\n   * When `pairing` is omitted it is derived from `matchNames`\n   * (`true` → `'names'`, `false` → `'order-index'`).\n   */\n  pairing?: 'names' | 'order-index' | 'order-centroid'\n  /**\n   * Skip the fused (A∪B → cut) boolean-difference computation entirely\n   * (default false). The fused cut is expensive on near-coincident B-spline\n   * faces and the occt-wasm kernel can return inverted/garbage solids for it\n   * (documented in faijs-gears analysis docs); per-part volume/CoM/bbox\n   * checks remain the verdict. When true, `booleanDiff` is reported as\n   * {aMinusB: NaN, bMinusA: NaN, match: true}.\n   */\n  skipFusedBoolean?: boolean\n}\n\n/** Per-part comparison result. */\nexport interface PartCompareResult {\n  name: string\n  found: boolean\n  volume?: { a: number; b: number; match: boolean; diffPct: number }\n  centerOfMass?: { a: BrepVec3; b: BrepVec3; match: boolean; maxDiff: number }\n  bbox?: { a: BrepBoundingBox; b: BrepBoundingBox; match: boolean; maxDiff: number }\n  topology?: {\n    a: { faces: number; edges: number; vertices: number }\n    b: { faces: number; edges: number; vertices: number }\n    match: boolean\n  }\n  color?: { a: [number, number, number] | null; b: [number, number, number] | null; match: boolean }\n}\n\n/** Full assembly comparison result. */\nexport interface AssemblyCompareResult {\n  fileA: string\n  fileB: string\n  equivalent: boolean\n  structure: {\n    leafCountA: number\n    leafCountB: number\n    namesA: string[]\n    namesB: string[]\n    match: boolean\n    missingInB: string[]\n    missingInA: string[]\n  }\n  parts: PartCompareResult[]\n  overall: {\n    volumeA: number\n    volumeB: number\n    volumeMatch: boolean\n    volumeDiffPct: number\n    bboxMatch: boolean\n    bboxMaxDiff: number\n    booleanDiff: { aMinusB: number; bMinusA: number; match: boolean }\n  }\n  details: string[]\n}\n\n// pairing 由 matchNames 推导（见 compareAssemblyFiles 内部），不进 DEFAULT_OPTS，\n// 否则会覆盖「matchNames:false 但缺 pairing」的推定语义。\nconst DEFAULT_OPTS = {\n  linearTolerance: 1e-3,\n  volumeRelativeTolerance: 1e-3,\n  booleanVolumeTolerance: 1e-1,\n  strictTopology: false,\n  matchNames: true,\n  skipFusedBoolean: false,\n}\n\nfunction vmax(a: BrepVec3, b: BrepVec3): number {\n  return Math.max(Math.abs(a.x - b.x), Math.abs(a.y - b.y), Math.abs(a.z - b.z))\n}\n\nfunction bbmax(a: BrepBoundingBox, b: BrepBoundingBox): number {\n  return Math.max(\n    Math.abs(a.xmin - b.xmin), Math.abs(a.xmax - b.xmax),\n    Math.abs(a.ymin - b.ymin), Math.abs(a.ymax - b.ymax),\n    Math.abs(a.zmin - b.zmin), Math.abs(a.zmax - b.zmax),\n  )\n}\n\nfunction topoStats(kernel: OcctKernel, shape: ShapeHandle) {\n  return {\n    faces: kernel.getSubShapes(shape, 'face').length,\n    edges: kernel.getSubShapes(shape, 'edge').length,\n    vertices: kernel.getSubShapes(shape, 'vertex').length,\n  }\n}\n\nfunction fuseAll(kernel: OcctKernel, shapes: ShapeHandle[]): ShapeHandle | null {\n  if (shapes.length === 0) return null\n  let acc = shapes[0]\n  for (let i = 1; i < shapes.length; i++) {\n    const fused = kernel.fuse(acc, shapes[i])\n    if (i > 1) kernel.release(acc)\n    acc = fused\n  }\n  return acc\n}\n\n/**\n * Compare two assembly STEP files for equivalence.\n *\n * @param fileA - Path to reference STEP.\n * @param fileB - Path to candidate STEP.\n * @param options - Comparison tolerances.\n * @returns Detailed per-level comparison result.\n */\nexport async function compareAssemblyFiles(\n  fileA: string,\n  fileB: string,\n  options: AssemblyCompareOptions = {},\n): Promise<AssemblyCompareResult> {\n  const opts = { ...DEFAULT_OPTS, ...options }\n  const details: string[] = []\n\n  const kernel = await initOcctWasm()\n\n  const bufA = readFileSync(fileA)\n  const bufB = readFileSync(fileB)\n  // readFileSync returns pooled Buffers for small files: buf.buffer is the\n  // whole pool with garbage beyond byteLength, which corrupts STEP imports\n  // of files < ~4KB. Pass exact copies.\n  const exact = (buf: Buffer): ArrayBuffer =>\n    buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength) as ArrayBuffer\n  const nodesA = await importAssemblyFromStep(exact(bufA))\n  const nodesB = await importAssemblyFromStep(exact(bufB))\n  const leavesA = collectLeafParts(nodesA).filter(n => n.shapeHandle !== null)\n  const leavesB = collectLeafParts(nodesB).filter(n => n.shapeHandle !== null)\n\n  // ── Level 1: Structure ──\n  const namesA = leavesA.map(n => n.name).sort()\n  const namesB = leavesB.map(n => n.name).sort()\n  const missingInB = namesA.filter(n => !namesB.includes(n))\n  const missingInA = namesB.filter(n => !namesA.includes(n))\n  // P0b：pairing 模式（缺省由 matchNames 推导）\n  const pairing: 'names' | 'order-index' | 'order-centroid' =\n    opts.pairing ?? (opts.matchNames ? 'names' : 'order-index')\n  const namesMatch = pairing === 'names' && missingInB.length === 0 && missingInA.length === 0\n  const structureMatch = leavesA.length === leavesB.length && (pairing !== 'names' || namesMatch)\n  details.push(`structure: ${leavesA.length} vs ${leavesB.length} leaves, names match=${structureMatch} (pairing=${pairing})`)\n  if (missingInB.length) details.push(`  missing in B: ${missingInB.join(', ')}`)\n  if (missingInA.length) details.push(`  missing in A: ${missingInA.join(', ')}`)\n\n  // ── Level 2 & 3: Per-part pose + geometry ──\n  const partResults: PartCompareResult[] = []\n\n  // 配对：按 pairing 模式生成 (A-leaf, B-leaf) 对。\n  const byName = (a: AssemblyPartNode, b: AssemblyPartNode): number =>\n    a.name < b.name ? -1 : a.name > b.name ? 1 : 0\n  const centroidOf = (leaf: AssemblyPartNode): BrepVec3 =>\n    kernel.getCenterOfMass(leaf.shapeHandle as unknown as ShapeHandle)\n\n  const pairs: Array<[AssemblyPartNode, AssemblyPartNode | null]> = []\n  if (pairing === 'names') {\n    const mapB = new Map(leavesB.map(n => [n.name, n]))\n    for (const a of leavesA) pairs.push([a, mapB.get(a.name) ?? null])\n  } else if (pairing === 'order-index') {\n    const sortedA = [...leavesA].sort(byName)\n    const sortedB = [...leavesB].sort(byName)\n    for (let i = 0; i < sortedA.length; i++) pairs.push([sortedA[i], sortedB[i] ?? null])\n  } else {\n    // order-centroid：贪心最近质心配对（leaf 数相等由 structureMatch 保证）\n    const centB = leavesB.map(centroidOf)\n    const usedB = new Set<number>()\n    for (const a of leavesA) {\n      const ca = centroidOf(a)\n      let best = -1\n      let bestD = Infinity\n      for (let j = 0; j < leavesB.length; j++) {\n        if (usedB.has(j)) continue\n        const d = vmax(ca, centB[j])\n        if (d < bestD) { bestD = d; best = j }\n      }\n      if (best >= 0) { usedB.add(best); pairs.push([a, leavesB[best]]) }\n      else pairs.push([a, null])\n    }\n  }\n\n  for (const [leafA, leafB] of pairs) {\n    if (!leafB) {\n      partResults.push({ name: leafA.name, found: false })\n      continue\n    }\n    const shapeA = leafA.shapeHandle! as unknown as ShapeHandle\n    const shapeB = leafB.shapeHandle! as unknown as ShapeHandle\n\n    const volA = kernel.getVolume(shapeA)\n    const volB = kernel.getVolume(shapeB)\n    const volDiffPct = volA > 0 ? (Math.abs(volA - volB) / volA) * 100 : 0\n    const volMatch = volDiffPct <= opts.volumeRelativeTolerance * 100\n\n    const comA = kernel.getCenterOfMass(shapeA)\n    const comB = kernel.getCenterOfMass(shapeB)\n    const comDiff = vmax(comA, comB)\n    const comMatch = comDiff <= opts.linearTolerance\n\n    const bbA = kernel.getBoundingBox(shapeA)\n    const bbB = kernel.getBoundingBox(shapeB)\n    const bbDiff = bbmax(bbA, bbB)\n    const bbMatch = bbDiff <= opts.linearTolerance\n\n    const topA = topoStats(kernel, shapeA)\n    const topB = topoStats(kernel, shapeB)\n    const topoMatch = opts.strictTopology\n      ? topA.faces === topB.faces && topA.edges === topB.edges && topA.vertices === topB.vertices\n      : true\n\n    const colA = leafA.color\n    const colB = leafB.color\n    const colMatch = Boolean((!colA && !colB) || (colA && colB &&\n      Math.abs(colA[0] - colB[0]) < 0.01 &&\n      Math.abs(colA[1] - colB[1]) < 0.01 &&\n      Math.abs(colA[2] - colB[2]) < 0.01))\n\n    partResults.push({\n      name: leafA.name,\n      found: true,\n      volume: { a: volA, b: volB, match: volMatch, diffPct: volDiffPct },\n      centerOfMass: { a: comA, b: comB, match: comMatch, maxDiff: comDiff },\n      bbox: { a: bbA, b: bbB, match: bbMatch, maxDiff: bbDiff },\n      topology: { a: topA, b: topB, match: topoMatch },\n      color: { a: colA, b: colB, match: colMatch },\n    })\n\n    details.push(`part \"${leafA.name}\": vol ${volA.toFixed(1)} vs ${volB.toFixed(1)} (${volDiffPct.toFixed(3)}%), com diff=${comDiff.toExponential(2)}, bbox diff=${bbDiff.toExponential(2)}, color=${colMatch}`)\n  }\n\n  // ── Level 4: Overall fused geometry ──\n  const shapesA = leavesA.map(n => n.shapeHandle! as unknown as ShapeHandle)\n  const shapesB = leavesB.map(n => n.shapeHandle! as unknown as ShapeHandle)\n  const fusedA = fuseAll(kernel, shapesA)\n  const fusedB = fuseAll(kernel, shapesB)\n\n  let overallVolumeA = 0, overallVolumeB = 0, overallVolMatch = false, overallVolDiffPct = 0\n  let overallBboxMatch = false, overallBboxDiff = 0\n  let boolAB = 0, boolBA = 0, boolMatch = false\n\n  if (fusedA && fusedB) {\n    overallVolumeA = kernel.getVolume(fusedA)\n    overallVolumeB = kernel.getVolume(fusedB)\n    overallVolDiffPct = overallVolumeA > 0 ? (Math.abs(overallVolumeA - overallVolumeB) / overallVolumeA) * 100 : 0\n    overallVolMatch = overallVolDiffPct <= opts.volumeRelativeTolerance * 100\n\n    const fbbA = kernel.getBoundingBox(fusedA)\n    const fbbB = kernel.getBoundingBox(fusedB)\n    overallBboxDiff = bbmax(fbbA, fbbB)\n    overallBboxMatch = overallBboxDiff <= opts.linearTolerance\n\n    if (opts.skipFusedBoolean) {\n      boolAB = NaN\n      boolBA = NaN\n      boolMatch = true\n    } else {\n      const cutAB = kernel.cut(fusedA, fusedB)\n      const cutBA = kernel.cut(fusedB, fusedA)\n      boolAB = kernel.getVolume(cutAB)\n      boolBA = kernel.getVolume(cutBA)\n      boolMatch = boolAB <= opts.booleanVolumeTolerance && boolBA <= opts.booleanVolumeTolerance\n      kernel.release(cutAB)\n      kernel.release(cutBA)\n    }\n  }\n\n  details.push(`overall: vol ${overallVolumeA.toFixed(1)} vs ${overallVolumeB.toFixed(1)} (${overallVolDiffPct.toFixed(3)}%), bbox diff=${overallBboxDiff.toExponential(2)}, bool A-B=${boolAB.toExponential(2)}, B-A=${boolBA.toExponential(2)}`)\n\n  // Cleanup\n  if (fusedA) kernel.release(fusedA)\n  if (fusedB) kernel.release(fusedB)\n  // Note: leaf shapeHandles are owned by the assembly tree, not released here\n\n  const partsAllMatch = partResults.every(p =>\n    p.found && p.volume?.match && p.centerOfMass?.match && p.bbox?.match && p.topology?.match && p.color?.match\n  )\n  const equivalent = structureMatch && partsAllMatch && overallVolMatch && overallBboxMatch && boolMatch\n\n  return {\n    fileA,\n    fileB,\n    equivalent,\n    structure: {\n      leafCountA: leavesA.length,\n      leafCountB: leavesB.length,\n      namesA,\n      namesB,\n      match: structureMatch,\n      missingInB,\n      missingInA,\n    },\n    parts: partResults,\n    overall: {\n      volumeA: overallVolumeA,\n      volumeB: overallVolumeB,\n      volumeMatch: overallVolMatch,\n      volumeDiffPct: overallVolDiffPct,\n      bboxMatch: overallBboxMatch,\n      bboxMaxDiff: overallBboxDiff,\n      booleanDiff: { aMinusB: boolAB, bMinusA: boolBA, match: boolMatch },\n    },\n    details,\n  }\n}\n\n/**\n * Print a human-readable assembly comparison report.\n * @param result - Comparison result from compareAssemblyFiles.\n */\nexport function printAssemblyReport(result: AssemblyCompareResult): void {\n  console.log(`\\n=== Assembly Comparison: ${result.fileA} vs ${result.fileB} ===`)\n  console.log(`Overall: ${result.equivalent ? '✓ EQUIVALENT' : '✗ DIFFERENT'}\\n`)\n\n  console.log('── Level 1: Structure ──')\n  console.log(`  Leaves: ${result.structure.leafCountA} vs ${result.structure.leafCountB} — ${result.structure.match ? '✓' : '✗'}`)\n  console.log(`  Names A: [${result.structure.namesA.join(', ')}]`)\n  console.log(`  Names B: [${result.structure.namesB.join(', ')}]`)\n  if (result.structure.missingInB.length) console.log(`  ✗ Missing in B: ${result.structure.missingInB.join(', ')}`)\n  if (result.structure.missingInA.length) console.log(`  ✗ Missing in A: ${result.structure.missingInA.join(', ')}`)\n\n  console.log('\\n── Level 2 & 3: Per-part pose + geometry ──')\n  for (const p of result.parts) {\n    if (!p.found) {\n      console.log(`  ✗ \"${p.name}\": not found in B`)\n      continue\n    }\n    const ok = p.volume?.match && p.centerOfMass?.match && p.bbox?.match && p.color?.match\n    console.log(`  ${ok ? '✓' : '✗'} \"${p.name}\": vol ${p.volume?.a.toFixed(1)} vs ${p.volume?.b.toFixed(1)} (${p.volume?.diffPct.toFixed(3)}%), com diff=${p.centerOfMass?.maxDiff.toExponential(2)}, bbox diff=${p.bbox?.maxDiff.toExponential(2)}, color=${p.color?.match ? '✓' : '✗'}`)\n  }\n\n  console.log('\\n── Level 4: Overall fused geometry ──')\n  console.log(`  Volume: ${result.overall.volumeA.toFixed(1)} vs ${result.overall.volumeB.toFixed(1)} (${result.overall.volumeDiffPct.toFixed(3)}%) — ${result.overall.volumeMatch ? '✓' : '✗'}`)\n  console.log(`  BBox diff: ${result.overall.bboxMaxDiff.toExponential(2)} — ${result.overall.bboxMatch ? '✓' : '✗'}`)\n  console.log(`  Boolean A-B: ${result.overall.booleanDiff.aMinusB.toExponential(2)} mm³`)\n  console.log(`  Boolean B-A: ${result.overall.booleanDiff.bMinusA.toExponential(2)} mm³ — ${result.overall.booleanDiff.match ? '✓' : '✗'}`)\n  console.log('')\n}\n"]}

package/dist/index.d.ts

@@ -0,0 +1,14 @@
+/**
+ * @faicad/cq-compat-compare — STEP / assembly geometry equivalence comparers
+ * (dev-only tooling), split from @faicad/faijs-cadquery.
+ *
+ * This package is NOT part of any runtime dependency chain: it is consumed only
+ * by test harnesses, parity scripts and verification tooling. The CadQuery
+ * compatibility surface lives in @faicad/faijs-cadquery (workplane / 2D drawing /
+ * features / selectors) and @faicad/cq-compat-assembly (assembly solve API).
+ */
+export { compareStepFiles, printCompareReport } from './step-compare.js';
+export type { CompareOptions, StepCompareResult, MetricResult, TopologyStats, } from './step-compare.js';
+export { compareAssemblyFiles, printAssemblyReport } from './assembly-compare.js';
+export type { AssemblyCompareOptions, AssemblyCompareResult, PartCompareResult, } from './assembly-compare.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":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAA;AACrE,YAAY,EACV,cAAc,EACd,iBAAiB,EACjB,YAAY,EACZ,aAAa,GACd,MAAM,gBAAgB,CAAA;AAEvB,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAA;AAC9E,YAAY,EACV,sBAAsB,EACtB,qBAAqB,EACrB,iBAAiB,GAClB,MAAM,oBAAoB,CAAA"}

package/dist/index.js

@@ -0,0 +1,12 @@
+/**
+ * @faicad/cq-compat-compare — STEP / assembly geometry equivalence comparers
+ * (dev-only tooling), split from @faicad/faijs-cadquery.
+ *
+ * This package is NOT part of any runtime dependency chain: it is consumed only
+ * by test harnesses, parity scripts and verification tooling. The CadQuery
+ * compatibility surface lives in @faicad/faijs-cadquery (workplane / 2D drawing /
+ * features / selectors) and @faicad/cq-compat-assembly (assembly solve API).
+ */
+export { compareStepFiles, printCompareReport } from './step-compare.js';
+export { compareAssemblyFiles, printAssemblyReport } from './assembly-compare.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;;;;;;;;GAQG;AAEH,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAA;AAQrE,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAA","sourcesContent":["/**\n * @faicad/cq-compat-compare — STEP / assembly geometry equivalence comparers\n * (dev-only tooling), split from @faicad/faijs-cadquery.\n *\n * This package is NOT part of any runtime dependency chain: it is consumed only\n * by test harnesses, parity scripts and verification tooling. The CadQuery\n * compatibility surface lives in @faicad/faijs-cadquery (workplane / 2D drawing /\n * features / selectors) and @faicad/cq-compat-assembly (assembly solve API).\n */\n\nexport { compareStepFiles, printCompareReport } from './step-compare'\nexport type {\n  CompareOptions,\n  StepCompareResult,\n  MetricResult,\n  TopologyStats,\n} from './step-compare'\n\nexport { compareAssemblyFiles, printAssemblyReport } from './assembly-compare'\nexport type {\n  AssemblyCompareOptions,\n  AssemblyCompareResult,\n  PartCompareResult,\n} from './assembly-compare'\n"]}

package/dist/step-compare.d.ts

@@ -0,0 +1,83 @@
+/**
+ * STEP file equivalence comparison using BREP geometry.
+ *
+ * Compares two STEP files across five dimensions:
+ * 1. Bounding box
+ * 2. Volume
+ * 3. Center of mass
+ * 4. Topology statistics (face/edge/vertex/solid counts)
+ * 5. Boolean difference (A-B and B-A volumes)
+ *
+ * Usage:
+ *   const result = await compareStepFiles('a.step', 'b.step')
+ *   console.log(result.equivalent)
+ */
+import type { BrepBoundingBox, BrepVec3 } from '@faicad/faijs';
+/** Tolerance options for comparison. */
+export interface CompareOptions {
+    /** Absolute tolerance for bbox / center-of-mass coordinates (mm). Default 1e-4. */
+    linearTolerance?: number;
+    /** Relative tolerance for volume comparison (0.001 = 0.1%). Default 1e-4. */
+    volumeRelativeTolerance?: number;
+    /** Absolute tolerance for boolean difference volume (mm³). Default 1e-3. */
+    booleanVolumeTolerance?: number;
+    /** Whether to require topology counts to match exactly. Default true. */
+    strictTopology?: boolean;
+}
+/** Per-metric comparison result. */
+export interface MetricResult<T> {
+    a: T;
+    b: T;
+    match: boolean;
+}
+/** Topology statistics for a shape. */
+export interface TopologyStats {
+    faces: number;
+    edges: number;
+    vertices: number;
+    solids: number;
+}
+/** Full comparison result. */
+export interface StepCompareResult {
+    fileA: string;
+    fileB: string;
+    equivalent: boolean;
+    bbox: MetricResult<BrepBoundingBox> & {
+        maxDiff: number;
+    };
+    volume: MetricResult<number> & {
+        diff: number;
+        diffPct: number;
+    };
+    centerOfMass: MetricResult<BrepVec3> & {
+        maxDiff: number;
+    };
+    topology: MetricResult<TopologyStats>;
+    booleanDiff: {
+        aMinusB: {
+            volume: number;
+            nonEmpty: boolean;
+        };
+        bMinusA: {
+            volume: number;
+            nonEmpty: boolean;
+        };
+        match: boolean;
+    };
+    details: string[];
+}
+/**
+ * Compare two STEP files for geometric equivalence.
+ *
+ * @param fileA - Path to the first STEP file.
+ * @param fileB - Path to the second STEP file.
+ * @param options - Comparison tolerances.
+ * @returns Detailed comparison result with per-metric match status.
+ */
+export declare function compareStepFiles(fileA: string, fileB: string, options?: CompareOptions): Promise<StepCompareResult>;
+/**
+ * Print a human-readable comparison report to stdout.
+ * @param result - The comparison result from compareStepFiles.
+ */
+export declare function printCompareReport(result: StepCompareResult): void;
+//# sourceMappingURL=step-compare.d.ts.map

package/dist/step-compare.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"step-compare.d.ts","sourceRoot":"","sources":["../src/step-compare.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,OAAO,KAAK,EAA2B,eAAe,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAEvF,wCAAwC;AACxC,MAAM,WAAW,cAAc;IAC7B,mFAAmF;IACnF,eAAe,CAAC,EAAE,MAAM,CAAA;IACxB,6EAA6E;IAC7E,uBAAuB,CAAC,EAAE,MAAM,CAAA;IAChC,4EAA4E;IAC5E,sBAAsB,CAAC,EAAE,MAAM,CAAA;IAC/B,yEAAyE;IACzE,cAAc,CAAC,EAAE,OAAO,CAAA;CACzB;AAED,oCAAoC;AACpC,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,CAAC,EAAE,CAAC,CAAA;IACJ,CAAC,EAAE,CAAC,CAAA;IACJ,KAAK,EAAE,OAAO,CAAA;CACf;AAED,uCAAuC;AACvC,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAA;IACb,KAAK,EAAE,MAAM,CAAA;IACb,QAAQ,EAAE,MAAM,CAAA;IAChB,MAAM,EAAE,MAAM,CAAA;CACf;AAED,8BAA8B;AAC9B,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,MAAM,CAAA;IACb,KAAK,EAAE,MAAM,CAAA;IACb,UAAU,EAAE,OAAO,CAAA;IACnB,IAAI,EAAE,YAAY,CAAC,eAAe,CAAC,GAAG;QAAE,OAAO,EAAE,MAAM,CAAA;KAAE,CAAA;IACzD,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,GAAG;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAA;IAChE,YAAY,EAAE,YAAY,CAAC,QAAQ,CAAC,GAAG;QAAE,OAAO,EAAE,MAAM,CAAA;KAAE,CAAA;IAC1D,QAAQ,EAAE,YAAY,CAAC,aAAa,CAAC,CAAA;IACrC,WAAW,EAAE;QACX,OAAO,EAAE;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,OAAO,CAAA;SAAE,CAAA;QAC9C,OAAO,EAAE;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,OAAO,CAAA;SAAE,CAAA;QAC9C,KAAK,EAAE,OAAO,CAAA;KACf,CAAA;IACD,OAAO,EAAE,MAAM,EAAE,CAAA;CAClB;AAqCD;;;;;;;GAOG;AACH,wBAAsB,gBAAgB,CACpC,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,cAAmB,GAC3B,OAAO,CAAC,iBAAiB,CAAC,CA6F5B;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAclE"}

package/dist/step-compare.js

@@ -0,0 +1,158 @@
+/**
+ * STEP file equivalence comparison using BREP geometry.
+ *
+ * Compares two STEP files across five dimensions:
+ * 1. Bounding box
+ * 2. Volume
+ * 3. Center of mass
+ * 4. Topology statistics (face/edge/vertex/solid counts)
+ * 5. Boolean difference (A-B and B-A volumes)
+ *
+ * Usage:
+ *   const result = await compareStepFiles('a.step', 'b.step')
+ *   console.log(result.equivalent)
+ */
+import { readFileSync } from 'node:fs';
+import { initOcctWasm } from '@faicad/faijs';
+const DEFAULT_OPTIONS = {
+    linearTolerance: 1e-4,
+    volumeRelativeTolerance: 1e-4,
+    booleanVolumeTolerance: 1e-3,
+    strictTopology: true,
+};
+function bboxMaxDiff(a, b) {
+    return Math.max(Math.abs(a.xmin - b.xmin), Math.abs(a.xmax - b.xmax), Math.abs(a.ymin - b.ymin), Math.abs(a.ymax - b.ymax), Math.abs(a.zmin - b.zmin), Math.abs(a.zmax - b.zmax));
+}
+function comMaxDiff(a, b) {
+    return Math.max(Math.abs(a.x - b.x), Math.abs(a.y - b.y), Math.abs(a.z - b.z));
+}
+function getTopologyStats(kernel, shape) {
+    return {
+        faces: kernel.getSubShapes(shape, 'face').length,
+        edges: kernel.getSubShapes(shape, 'edge').length,
+        vertices: kernel.getSubShapes(shape, 'vertex').length,
+        solids: kernel.getSubShapes(shape, 'solid').length,
+    };
+}
+function topologyMatch(a, b, strict) {
+    if (strict) {
+        return a.faces === b.faces && a.edges === b.edges && a.vertices === b.vertices && a.solids === b.solids;
+    }
+    return a.solids === b.solids;
+}
+/**
+ * Compare two STEP files for geometric equivalence.
+ *
+ * @param fileA - Path to the first STEP file.
+ * @param fileB - Path to the second STEP file.
+ * @param options - Comparison tolerances.
+ * @returns Detailed comparison result with per-metric match status.
+ */
+export async function compareStepFiles(fileA, fileB, options = {}) {
+    const opts = { ...DEFAULT_OPTIONS, ...options };
+    const details = [];
+    const kernel = await initOcctWasm();
+    const bufA = readFileSync(fileA);
+    const bufB = readFileSync(fileB);
+    // readFileSync returns pooled Buffers for small files: buf.buffer is the
+    // whole 8KB pool (with garbage beyond byteLength), which makes importStep
+    // fail on every STEP < ~4KB (e.g. single-sphere files). Pass an exact copy.
+    const exact = (buf) => buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength);
+    const shapeA = kernel.importStep(exact(bufA));
+    const shapeB = kernel.importStep(exact(bufB));
+    // 1. Bounding box
+    const bboxA = kernel.getBoundingBox(shapeA);
+    const bboxB = kernel.getBoundingBox(shapeB);
+    const bboxDiff = bboxMaxDiff(bboxA, bboxB);
+    const bboxMatch = bboxDiff <= opts.linearTolerance;
+    details.push(`bbox diff: ${bboxDiff.toExponential(3)} mm (tol ${opts.linearTolerance})`);
+    // 2. Topology (needed to decide whether volume/COM/boolean are meaningful)
+    const topoA = getTopologyStats(kernel, shapeA);
+    const topoB = getTopologyStats(kernel, shapeB);
+    const topoMatch = topologyMatch(topoA, topoB, opts.strictTopology);
+    details.push(`topology: A(f=${topoA.faces},e=${topoA.edges},v=${topoA.vertices},s=${topoA.solids}) B(f=${topoB.faces},e=${topoB.edges},v=${topoB.vertices},s=${topoB.solids})`);
+    // 3. Volume / COM / boolean difference: only meaningful when BOTH shapes
+    // contain solids or faces (e.g. `siblings(..., "Vertex", ...)` yields a
+    // pure edges compound; BRepGProp volume / BRepAlgoAPI_Cut throw on those).
+    const hasMass = (topoA.solids > 0 || topoA.faces > 0) && (topoB.solids > 0 || topoB.faces > 0);
+    let volA = 0;
+    let volB = 0;
+    let volDiff = 0;
+    let volPct = 0;
+    let volMatch = true;
+    let comA = { x: 0, y: 0, z: 0 };
+    let comB = { x: 0, y: 0, z: 0 };
+    let comDiff = 0;
+    let comMatch = true;
+    let volAB = 0;
+    let volBA = 0;
+    let boolMatch = true;
+    if (hasMass) {
+        volA = kernel.getVolume(shapeA);
+        volB = kernel.getVolume(shapeB);
+        volDiff = Math.abs(volA - volB);
+        volPct = volA > 0 ? (volDiff / volA) * 100 : 0;
+        volMatch = volPct <= opts.volumeRelativeTolerance * 100;
+        details.push(`volume diff: ${volDiff.toExponential(3)} mm³ (${volPct.toFixed(4)}%, tol ${opts.volumeRelativeTolerance * 100}%)`);
+        comA = kernel.getCenterOfMass(shapeA);
+        comB = kernel.getCenterOfMass(shapeB);
+        comDiff = comMaxDiff(comA, comB);
+        comMatch = comDiff <= opts.linearTolerance;
+        details.push(`center-of-mass diff: ${comDiff.toExponential(3)} mm (tol ${opts.linearTolerance})`);
+        const aMinusB = kernel.cut(shapeA, shapeB);
+        const bMinusA = kernel.cut(shapeB, shapeA);
+        volAB = kernel.getVolume(aMinusB);
+        volBA = kernel.getVolume(bMinusA);
+        boolMatch = volAB <= opts.booleanVolumeTolerance && volBA <= opts.booleanVolumeTolerance;
+        details.push(`boolean diff: A-B=${volAB.toExponential(3)} mm³, B-A=${volBA.toExponential(3)} mm³ (tol ${opts.booleanVolumeTolerance})`);
+        kernel.release(aMinusB);
+        kernel.release(bMinusA);
+    }
+    else {
+        details.push('volume/COM/boolean: skipped (no solid or face topology in either shape)');
+    }
+    // Cleanup
+    kernel.release(shapeA);
+    kernel.release(shapeB);
+    const equivalent = bboxMatch && volMatch && comMatch && topoMatch && boolMatch;
+    return {
+        fileA,
+        fileB,
+        equivalent,
+        bbox: { a: bboxA, b: bboxB, match: bboxMatch, maxDiff: bboxDiff },
+        volume: { a: volA, b: volB, match: volMatch, diff: volDiff, diffPct: volPct },
+        centerOfMass: { a: comA, b: comB, match: comMatch, maxDiff: comDiff },
+        topology: { a: topoA, b: topoB, match: topoMatch },
+        booleanDiff: {
+            aMinusB: { volume: volAB, nonEmpty: volAB > opts.booleanVolumeTolerance },
+            bMinusA: { volume: volBA, nonEmpty: volBA > opts.booleanVolumeTolerance },
+            match: boolMatch,
+        },
+        details,
+    };
+}
+/**
+ * Print a human-readable comparison report to stdout.
+ * @param result - The comparison result from compareStepFiles.
+ */
+export function printCompareReport(result) {
+    console.log(`\n=== STEP Comparison: ${result.fileA} vs ${result.fileB} ===`);
+    console.log(`Overall: ${result.equivalent ? '✓ EQUIVALENT' : '✗ DIFFERENT'}\n`);
+    for (const d of result.details) {
+        console.log(`  ${d}`);
+    }
+    console.log('');
+    if (!result.equivalent) {
+        if (!result.bbox.match)
+            console.log('  ✗ Bounding box mismatch');
+        if (!result.volume.match)
+            console.log('  ✗ Volume mismatch');
+        if (!result.centerOfMass.match)
+            console.log('  ✗ Center of mass mismatch');
+        if (!result.topology.match)
+            console.log('  ✗ Topology mismatch');
+        if (!result.booleanDiff.match)
+            console.log('  ✗ Boolean difference non-empty');
+    }
+}
+//# sourceMappingURL=step-compare.js.map

package/dist/step-compare.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"step-compare.js","sourceRoot":"","sources":["../src/step-compare.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AACtC,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAA;AA+C5C,MAAM,eAAe,GAA6B;IAChD,eAAe,EAAE,IAAI;IACrB,uBAAuB,EAAE,IAAI;IAC7B,sBAAsB,EAAE,IAAI;IAC5B,cAAc,EAAE,IAAI;CACrB,CAAA;AAED,SAAS,WAAW,CAAC,CAAkB,EAAE,CAAkB;IACzD,OAAO,IAAI,CAAC,GAAG,CACb,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EACpD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EACpD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CACrD,CAAA;AACH,CAAC;AAED,SAAS,UAAU,CAAC,CAAW,EAAE,CAAW;IAC1C,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAChF,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAkB,EAAE,KAAkB;IAC9D,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM;QAChD,KAAK,EAAE,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM;QAChD,QAAQ,EAAE,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,MAAM;QACrD,MAAM,EAAE,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,MAAM;KACnD,CAAA;AACH,CAAC;AAED,SAAS,aAAa,CAAC,CAAgB,EAAE,CAAgB,EAAE,MAAe;IACxE,IAAI,MAAM,EAAE,CAAC;QACX,OAAO,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAA;IACzG,CAAC;IACD,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAA;AAC9B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,KAAa,EACb,KAAa,EACb,UAA0B,EAAE;IAE5B,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAA;IAC/C,MAAM,OAAO,GAAa,EAAE,CAAA;IAE5B,MAAM,MAAM,GAAG,MAAM,YAAY,EAAE,CAAA;IAEnC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,CAAA;IAChC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,CAAA;IAChC,yEAAyE;IACzE,0EAA0E;IAC1E,4EAA4E;IAC5E,MAAM,KAAK,GAAG,CAAC,GAAW,EAAe,EAAE,CACzC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAgB,CAAA;IAClF,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;IAC7C,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;IAE7C,kBAAkB;IAClB,MAAM,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;IAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;IAC3C,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;IAC1C,MAAM,SAAS,GAAG,QAAQ,IAAI,IAAI,CAAC,eAAe,CAAA;IAClD,OAAO,CAAC,IAAI,CAAC,cAAc,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,eAAe,GAAG,CAAC,CAAA;IAExF,2EAA2E;IAC3E,MAAM,KAAK,GAAG,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC9C,MAAM,KAAK,GAAG,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC9C,MAAM,SAAS,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,cAAc,CAAC,CAAA;IAClE,OAAO,CAAC,IAAI,CAAC,iBAAiB,KAAK,CAAC,KAAK,MAAM,KAAK,CAAC,KAAK,MAAM,KAAK,CAAC,QAAQ,MAAM,KAAK,CAAC,MAAM,SAAS,KAAK,CAAC,KAAK,MAAM,KAAK,CAAC,KAAK,MAAM,KAAK,CAAC,QAAQ,MAAM,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;IAE/K,yEAAyE;IACzE,wEAAwE;IACxE,2EAA2E;IAC3E,MAAM,OAAO,GACX,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;IAChF,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,IAAI,GAAG,CAAC,CAAA;IACZ,IAAI,OAAO,GAAG,CAAC,CAAA;IACf,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,IAAI,QAAQ,GAAG,IAAI,CAAA;IACnB,IAAI,IAAI,GAAa,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAA;IACzC,IAAI,IAAI,GAAa,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAA;IACzC,IAAI,OAAO,GAAG,CAAC,CAAA;IACf,IAAI,QAAQ,GAAG,IAAI,CAAA;IACnB,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,SAAS,GAAG,IAAI,CAAA;IACpB,IAAI,OAAO,EAAE,CAAC;QACZ,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QAC/B,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;QAC/B,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAA;QAC/B,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9C,QAAQ,GAAG,MAAM,IAAI,IAAI,CAAC,uBAAuB,GAAG,GAAG,CAAA;QACvD,OAAO,CAAC,IAAI,CAAC,gBAAgB,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,uBAAuB,GAAG,GAAG,IAAI,CAAC,CAAA;QAEhI,IAAI,GAAG,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAA;QACrC,IAAI,GAAG,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAA;QACrC,OAAO,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAChC,QAAQ,GAAG,OAAO,IAAI,IAAI,CAAC,eAAe,CAAA;QAC1C,OAAO,CAAC,IAAI,CAAC,wBAAwB,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,eAAe,GAAG,CAAC,CAAA;QAEjG,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QAC1C,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QAC1C,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;QACjC,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;QACjC,SAAS,GAAG,KAAK,IAAI,IAAI,CAAC,sBAAsB,IAAI,KAAK,IAAI,IAAI,CAAC,sBAAsB,CAAA;QACxF,OAAO,CAAC,IAAI,CAAC,qBAAqB,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,sBAAsB,GAAG,CAAC,CAAA;QACvI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;QACvB,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;IACzB,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAA;IACzF,CAAC;IAED,UAAU;IACV,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IACtB,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAEtB,MAAM,UAAU,GAAG,SAAS,IAAI,QAAQ,IAAI,QAAQ,IAAI,SAAS,IAAI,SAAS,CAAA;IAE9E,OAAO;QACL,KAAK;QACL,KAAK;QACL,UAAU;QACV,IAAI,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE;QACjE,MAAM,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE;QAC7E,YAAY,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE;QACrE,QAAQ,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE;QAClD,WAAW,EAAE;YACX,OAAO,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,GAAG,IAAI,CAAC,sBAAsB,EAAE;YACzE,OAAO,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,GAAG,IAAI,CAAC,sBAAsB,EAAE;YACzE,KAAK,EAAE,SAAS;SACjB;QACD,OAAO;KACR,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAyB;IAC1D,OAAO,CAAC,GAAG,CAAC,0BAA0B,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,KAAK,MAAM,CAAC,CAAA;IAC5E,OAAO,CAAC,GAAG,CAAC,YAAY,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,aAAa,IAAI,CAAC,CAAA;IAC/E,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QAC/B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IACf,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,2BAA2B,CAAC,CAAA;QAChE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAA;QAC5D,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,6BAA6B,CAAC,CAAA;QAC1E,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAA;QAChE,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,kCAAkC,CAAC,CAAA;IAChF,CAAC;AACH,CAAC","sourcesContent":["/**\n * STEP file equivalence comparison using BREP geometry.\n *\n * Compares two STEP files across five dimensions:\n * 1. Bounding box\n * 2. Volume\n * 3. Center of mass\n * 4. Topology statistics (face/edge/vertex/solid counts)\n * 5. Boolean difference (A-B and B-A volumes)\n *\n * Usage:\n *   const result = await compareStepFiles('a.step', 'b.step')\n *   console.log(result.equivalent)\n */\n\nimport { readFileSync } from 'node:fs'\nimport { initOcctWasm } from '@faicad/faijs'\nimport type { OcctKernel, ShapeHandle, BrepBoundingBox, BrepVec3 } from '@faicad/faijs'\n\n/** Tolerance options for comparison. */\nexport interface CompareOptions {\n  /** Absolute tolerance for bbox / center-of-mass coordinates (mm). Default 1e-4. */\n  linearTolerance?: number\n  /** Relative tolerance for volume comparison (0.001 = 0.1%). Default 1e-4. */\n  volumeRelativeTolerance?: number\n  /** Absolute tolerance for boolean difference volume (mm³). Default 1e-3. */\n  booleanVolumeTolerance?: number\n  /** Whether to require topology counts to match exactly. Default true. */\n  strictTopology?: boolean\n}\n\n/** Per-metric comparison result. */\nexport interface MetricResult<T> {\n  a: T\n  b: T\n  match: boolean\n}\n\n/** Topology statistics for a shape. */\nexport interface TopologyStats {\n  faces: number\n  edges: number\n  vertices: number\n  solids: number\n}\n\n/** Full comparison result. */\nexport interface StepCompareResult {\n  fileA: string\n  fileB: string\n  equivalent: boolean\n  bbox: MetricResult<BrepBoundingBox> & { maxDiff: number }\n  volume: MetricResult<number> & { diff: number; diffPct: number }\n  centerOfMass: MetricResult<BrepVec3> & { maxDiff: number }\n  topology: MetricResult<TopologyStats>\n  booleanDiff: {\n    aMinusB: { volume: number; nonEmpty: boolean }\n    bMinusA: { volume: number; nonEmpty: boolean }\n    match: boolean\n  }\n  details: string[]\n}\n\nconst DEFAULT_OPTIONS: Required<CompareOptions> = {\n  linearTolerance: 1e-4,\n  volumeRelativeTolerance: 1e-4,\n  booleanVolumeTolerance: 1e-3,\n  strictTopology: true,\n}\n\nfunction bboxMaxDiff(a: BrepBoundingBox, b: BrepBoundingBox): number {\n  return Math.max(\n    Math.abs(a.xmin - b.xmin), Math.abs(a.xmax - b.xmax),\n    Math.abs(a.ymin - b.ymin), Math.abs(a.ymax - b.ymax),\n    Math.abs(a.zmin - b.zmin), Math.abs(a.zmax - b.zmax),\n  )\n}\n\nfunction comMaxDiff(a: BrepVec3, b: BrepVec3): number {\n  return Math.max(Math.abs(a.x - b.x), Math.abs(a.y - b.y), Math.abs(a.z - b.z))\n}\n\nfunction getTopologyStats(kernel: OcctKernel, shape: ShapeHandle): TopologyStats {\n  return {\n    faces: kernel.getSubShapes(shape, 'face').length,\n    edges: kernel.getSubShapes(shape, 'edge').length,\n    vertices: kernel.getSubShapes(shape, 'vertex').length,\n    solids: kernel.getSubShapes(shape, 'solid').length,\n  }\n}\n\nfunction topologyMatch(a: TopologyStats, b: TopologyStats, strict: boolean): boolean {\n  if (strict) {\n    return a.faces === b.faces && a.edges === b.edges && a.vertices === b.vertices && a.solids === b.solids\n  }\n  return a.solids === b.solids\n}\n\n/**\n * Compare two STEP files for geometric equivalence.\n *\n * @param fileA - Path to the first STEP file.\n * @param fileB - Path to the second STEP file.\n * @param options - Comparison tolerances.\n * @returns Detailed comparison result with per-metric match status.\n */\nexport async function compareStepFiles(\n  fileA: string,\n  fileB: string,\n  options: CompareOptions = {},\n): Promise<StepCompareResult> {\n  const opts = { ...DEFAULT_OPTIONS, ...options }\n  const details: string[] = []\n\n  const kernel = await initOcctWasm()\n\n  const bufA = readFileSync(fileA)\n  const bufB = readFileSync(fileB)\n  // readFileSync returns pooled Buffers for small files: buf.buffer is the\n  // whole 8KB pool (with garbage beyond byteLength), which makes importStep\n  // fail on every STEP < ~4KB (e.g. single-sphere files). Pass an exact copy.\n  const exact = (buf: Buffer): ArrayBuffer =>\n    buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength) as ArrayBuffer\n  const shapeA = kernel.importStep(exact(bufA))\n  const shapeB = kernel.importStep(exact(bufB))\n\n  // 1. Bounding box\n  const bboxA = kernel.getBoundingBox(shapeA)\n  const bboxB = kernel.getBoundingBox(shapeB)\n  const bboxDiff = bboxMaxDiff(bboxA, bboxB)\n  const bboxMatch = bboxDiff <= opts.linearTolerance\n  details.push(`bbox diff: ${bboxDiff.toExponential(3)} mm (tol ${opts.linearTolerance})`)\n\n  // 2. Topology (needed to decide whether volume/COM/boolean are meaningful)\n  const topoA = getTopologyStats(kernel, shapeA)\n  const topoB = getTopologyStats(kernel, shapeB)\n  const topoMatch = topologyMatch(topoA, topoB, opts.strictTopology)\n  details.push(`topology: A(f=${topoA.faces},e=${topoA.edges},v=${topoA.vertices},s=${topoA.solids}) B(f=${topoB.faces},e=${topoB.edges},v=${topoB.vertices},s=${topoB.solids})`)\n\n  // 3. Volume / COM / boolean difference: only meaningful when BOTH shapes\n  // contain solids or faces (e.g. `siblings(..., \"Vertex\", ...)` yields a\n  // pure edges compound; BRepGProp volume / BRepAlgoAPI_Cut throw on those).\n  const hasMass =\n    (topoA.solids > 0 || topoA.faces > 0) && (topoB.solids > 0 || topoB.faces > 0)\n  let volA = 0\n  let volB = 0\n  let volDiff = 0\n  let volPct = 0\n  let volMatch = true\n  let comA: BrepVec3 = { x: 0, y: 0, z: 0 }\n  let comB: BrepVec3 = { x: 0, y: 0, z: 0 }\n  let comDiff = 0\n  let comMatch = true\n  let volAB = 0\n  let volBA = 0\n  let boolMatch = true\n  if (hasMass) {\n    volA = kernel.getVolume(shapeA)\n    volB = kernel.getVolume(shapeB)\n    volDiff = Math.abs(volA - volB)\n    volPct = volA > 0 ? (volDiff / volA) * 100 : 0\n    volMatch = volPct <= opts.volumeRelativeTolerance * 100\n    details.push(`volume diff: ${volDiff.toExponential(3)} mm³ (${volPct.toFixed(4)}%, tol ${opts.volumeRelativeTolerance * 100}%)`)\n\n    comA = kernel.getCenterOfMass(shapeA)\n    comB = kernel.getCenterOfMass(shapeB)\n    comDiff = comMaxDiff(comA, comB)\n    comMatch = comDiff <= opts.linearTolerance\n    details.push(`center-of-mass diff: ${comDiff.toExponential(3)} mm (tol ${opts.linearTolerance})`)\n\n    const aMinusB = kernel.cut(shapeA, shapeB)\n    const bMinusA = kernel.cut(shapeB, shapeA)\n    volAB = kernel.getVolume(aMinusB)\n    volBA = kernel.getVolume(bMinusA)\n    boolMatch = volAB <= opts.booleanVolumeTolerance && volBA <= opts.booleanVolumeTolerance\n    details.push(`boolean diff: A-B=${volAB.toExponential(3)} mm³, B-A=${volBA.toExponential(3)} mm³ (tol ${opts.booleanVolumeTolerance})`)\n    kernel.release(aMinusB)\n    kernel.release(bMinusA)\n  } else {\n    details.push('volume/COM/boolean: skipped (no solid or face topology in either shape)')\n  }\n\n  // Cleanup\n  kernel.release(shapeA)\n  kernel.release(shapeB)\n\n  const equivalent = bboxMatch && volMatch && comMatch && topoMatch && boolMatch\n\n  return {\n    fileA,\n    fileB,\n    equivalent,\n    bbox: { a: bboxA, b: bboxB, match: bboxMatch, maxDiff: bboxDiff },\n    volume: { a: volA, b: volB, match: volMatch, diff: volDiff, diffPct: volPct },\n    centerOfMass: { a: comA, b: comB, match: comMatch, maxDiff: comDiff },\n    topology: { a: topoA, b: topoB, match: topoMatch },\n    booleanDiff: {\n      aMinusB: { volume: volAB, nonEmpty: volAB > opts.booleanVolumeTolerance },\n      bMinusA: { volume: volBA, nonEmpty: volBA > opts.booleanVolumeTolerance },\n      match: boolMatch,\n    },\n    details,\n  }\n}\n\n/**\n * Print a human-readable comparison report to stdout.\n * @param result - The comparison result from compareStepFiles.\n */\nexport function printCompareReport(result: StepCompareResult): void {\n  console.log(`\\n=== STEP Comparison: ${result.fileA} vs ${result.fileB} ===`)\n  console.log(`Overall: ${result.equivalent ? '✓ EQUIVALENT' : '✗ DIFFERENT'}\\n`)\n  for (const d of result.details) {\n    console.log(`  ${d}`)\n  }\n  console.log('')\n  if (!result.equivalent) {\n    if (!result.bbox.match) console.log('  ✗ Bounding box mismatch')\n    if (!result.volume.match) console.log('  ✗ Volume mismatch')\n    if (!result.centerOfMass.match) console.log('  ✗ Center of mass mismatch')\n    if (!result.topology.match) console.log('  ✗ Topology mismatch')\n    if (!result.booleanDiff.match) console.log('  ✗ Boolean difference non-empty')\n  }\n}\n"]}

package/package.json

@@ -0,0 +1,50 @@
+{
+  "name": "@faicad/cq-compat-compare",
+  "version": "0.29.5",
+  "type": "module",
+  "license": "Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://gitcode.com/Faicad/faijs.git"
+  },
+  "description": "STEP / assembly geometry equivalence comparers (dev-only) - split from @faicad/faijs-cadquery",
+  "keywords": [
+    "cad",
+    "faijs",
+    "cadquery",
+    "step",
+    "compare",
+    "testing"
+  ],
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "faijs": {
+    "autoLift": false
+  },
+  "dependencies": {},
+  "peerDependencies": {
+    "@faicad/faijs": "^0.29.0",
+    "occt-wasm": "^5.6.0"
+  },
+  "devDependencies": {
+    "@faicad/faijs": "file:../core",
+    "typescript": "*",
+    "vitest": "*"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.build.json && node ../../scripts/fix-import-extensions.mjs dist",
+    "typecheck": "tsc --noEmit",
+    "pretest": "npm run build",
+    "test": "vitest run",
+    "lint": "eslint src"
+  }
+}