@ifc-lite/clash 1.6.8 → 1.8.0

package/dist/duplicates.js

@@ -1,12 +1,47 @@
 /* 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/. */
+/**
+ * Duplicate / fully-overlapping element detection (#1280).
+ *
+ * The first thing people do when reviewing a single discipline model is hunt for
+ * accidentally duplicated or coincident objects — re-imported geometry, a wall
+ * pasted twice, a column modelled on top of another. That is *not* a discipline
+ * clash, so it gets its own lightweight pass: AABB proximity decides *what* is
+ * reported, and a tessellation-invariant shape signature (surface area +
+ * enclosed volume) decides only whether a reported pair is labelled an exact
+ * duplicate. No narrow-phase triangle-vs-triangle work. The broad phase is a
+ * one-axis sort-and-sweep, which handles mixed-scale models correctly (no grid
+ * cell size to mis-tune), so it is cheap enough to run on every load; the
+ * signature is computed lazily, only for pairs that already coincide. Matching
+ * on AABBs has a known limit for nested solids — see the "nested-solids limit"
+ * section on {@link findDuplicates} for exactly what it can and cannot tell
+ * apart.
+ *
+ * "Same object" is decided by {@link boxDistance} against `positionTolerance`, a
+ * plain distance in metres. It used to be AABB intersection-over-union ≥ 0.9,
+ * which is a ratio and so carried no physical tolerance at all: the same setting
+ * allowed 5 mm across a DN100 pipe and 421 mm across an 8 m slab (see
+ * `DuplicateOptions.iouThreshold`).
+ *
+ * Output is a normal {@link ClashResult} (rule id `duplicates`) so the existing
+ * panel, grouping and BCF export render it with no special-casing. It is
+ * *pairwise*: N coincident copies of one object yield N(N−1)/2 clashes. For a
+ * reader-facing list use `groupDuplicateSets`, which collapses those pairs into
+ * one finding per coincident set.
+ */
 import { center, overlapBounds } from './math/aabb.js';
+import { boxDistance, boxesTouch, minExtent, similarity } from './duplicate-metric.js';
+import { sameShape, shapeSignature } from './shape-signature.js';
 import { isExcluded, qualifiedKey } from './exclude.js';
+import { summarizeClashes } from './analysis.js';
 const DEFAULTS = {
+    positionTolerance: 0.01,
+    exactTolerance: 0.001,
+    /** Legacy IoU mode only. */
     iouThreshold: 0.9,
+    /** Legacy IoU mode only. */
     exactThreshold: 0.99,
-    positionTolerance: 0.01,
 };
 export const DUPLICATES_RULE = {
     id: 'duplicates',
@@ -14,103 +49,229 @@ export const DUPLICATES_RULE = {
     a: '*',
     mode: 'hard',
 };
-function aabbVolume(b) {
-    const dx = Math.max(0, b.max[0] - b.min[0]);
-    const dy = Math.max(0, b.max[1] - b.min[1]);
-    const dz = Math.max(0, b.max[2] - b.min[2]);
-    return dx * dy * dz;
-}
-/** Intersection-over-union of two AABBs (0 when disjoint). */
-function aabbIoU(a, b) {
-    const ox = Math.min(a.max[0], b.max[0]) - Math.max(a.min[0], b.min[0]);
-    const oy = Math.min(a.max[1], b.max[1]) - Math.max(a.min[1], b.min[1]);
-    const oz = Math.min(a.max[2], b.max[2]) - Math.max(a.min[2], b.min[2]);
-    if (ox <= 0 || oy <= 0 || oz <= 0)
-        return 0;
-    const inter = ox * oy * oz;
-    const union = aabbVolume(a) + aabbVolume(b) - inter;
-    return union > 0 ? inter / union : 0;
-}
-function aabbApproxEqual(a, b, tol) {
-    for (let i = 0; i < 3; i += 1) {
-        if (Math.abs(a.min[i] - b.min[i]) > tol)
-            return false;
-        if (Math.abs(a.max[i] - b.max[i]) > tol)
-            return false;
-    }
-    return true;
-}
-/** Similarity in `[0,1]`: AABB IoU, falling back to box-equality for degenerate
- *  (zero-volume / planar) elements where IoU is undefined. */
-function similarity(a, b, tol) {
-    const iou = aabbIoU(a, b);
-    if (iou > 0)
-        return iou;
-    // Both (near) degenerate: an exact box match still means "same place".
-    if (aabbVolume(a) <= 0 || aabbVolume(b) <= 0) {
-        return aabbApproxEqual(a, b, tol) ? 1 : 0;
-    }
-    return 0;
-}
-/** Shortest dimension of a box — the depth one element is embedded in another. */
-function minExtent(b) {
-    return Math.min(b.max[0] - b.min[0], b.max[1] - b.min[1], b.max[2] - b.min[2]);
-}
-function triCount(el) {
-    return Math.floor(el.indices.length / 3);
-}
 function toRef(el) {
     return { key: el.key, ref: el.ref, model: el.model, tag: el.tag, name: el.name };
 }
-function buildSummary(clashes) {
-    const byRule = {};
-    const byTypePair = {};
-    const bySeverity = { critical: 0, major: 0, minor: 0, info: 0 };
-    for (const c of clashes) {
-        byRule[c.rule] = (byRule[c.rule] ?? 0) + 1;
-        const pair = [c.a.tag, c.b.tag].sort().join(' vs ');
-        byTypePair[pair] = (byTypePair[pair] ?? 0) + 1;
-        bySeverity[c.severity] += 1;
-    }
-    return { total: clashes.length, byRule, byTypePair, bySeverity };
-}
 /**
  * Find duplicate / fully-overlapping elements. Returns a {@link ClashResult}
- * where each clash is a near-coincident pair: severity `major` for an exact
- * duplicate (same triangle count + near-identical box), `minor` for a looser
- * overlap candidate.
+ * where each clash is a near-coincident pair. `settings.tolerance` is
+ * `positionTolerance`, the value that actually decided the matches.
+ *
+ * Severity says exactly this much:
+ * - `major` — some pair of the two elements' boxes coincides within
+ *   `exactTolerance` **and** the two elements' meshes — summed over the
+ *   several parts a multi-material / CSG element emits — agree to within 5% on
+ *   both surface area and enclosed volume. Read it as "the same object, in the
+ *   same place"; it survives one copy being re-tessellated, and it does not
+ *   depend on which of a multi-part element's part pairings the sweep visited
+ *   first.
+ * - `minor` — near-coincident, but something differs: the boxes are further
+ *   apart than `exactTolerance`, the shapes disagree, or one element carries no
+ *   measurable geometry.
+ *
+ * What `major` still cannot tell you: the signature is two scalars over the
+ * surface, so two genuinely different solids that happen to agree in both area
+ * and volume to within 5% are indistinguishable here, as are an element and its
+ * mirror image.
+ *
+ * ## The nested-solids limit
+ *
+ * Matching remains AABB-only, so an element nested inside another — a pipe in a
+ * sleeve, a duct in a shaft, an assembly and the envelope drawn round it — is,
+ * in principle, something this pass cannot tell from a duplicate. Two gates
+ * already narrow that to a documented residual, and `duplicates.test.ts` pins
+ * each case:
+ *
+ * - Nesting has clearance, and {@link boxDistance} measures clearance. Anything
+ *   looser than ~7 mm of annulus is more than `positionTolerance` away and is
+ *   never reported at all: a DN100 pipe in a DN125 sleeve is 17.7 mm away, a
+ *   400×300 duct in a 500×400 shaft is 70.7 mm.
+ * - Tighter nesting *is* reported, but only ever as `minor`. Reaching `major`
+ *   additionally requires the two meshes to agree on surface area and enclosed
+ *   volume within 5%, which distinct solids sharing a box do not: a 50 mm and a
+ *   55 mm tube are 9.1% / 17.4% apart, a railing and its envelope box 73.2% /
+ *   88.4%.
+ *
+ * So the residual is exactly this: a pair nested within a few millimetres is
+ * listed as a `minor` candidate overlap. That is the intended reading of
+ * `minor` — "these two coincide, and this pass will not claim they are the same
+ * object" — and a reviewer still sees it, which for a coincidence hunt is the
+ * safe direction.
+ *
+ * Measured across five public models (duplex, AC20-FZK-Haus, Office_A_20110811,
+ * dental_clinic, Infra-Bridge), *no* reported pair was a nested one: all 33
+ * findings are same-type pairs of equal bounds, and the count of nested or
+ * cross-type pairs stays 0 even at a 250 mm tolerance, 25× the default. Note
+ * what that does not cover — none of the five carries pipe or duct segments, so
+ * the pipe-in-sleeve case is evidenced only by the constructed fixtures above.
+ *
+ * Closing the residual would need a narrow phase, which this pass deliberately
+ * does not run, and the cheap substitutes are worse rather than merely weaker.
+ * An area-weighted centroid plus surface inertia — the obvious candidate, and
+ * the same O(triangles) cost as the signature (3.6 ms vs 2.6 ms over
+ * dental_clinic's 236,795 triangles) — discriminates *less* on every nested
+ * case measured, contributes nothing at all when the nesting is concentric
+ * (identical centroids for pipe-in-sleeve and pipe-plus-insulation), and is not
+ * tessellation-invariant: it reads 39.6% apart on one box against a finer
+ * triangulation of the same box, which would break the exact-duplicate case
+ * this signature exists to keep together. A voxel occupancy sample would
+ * separate nested from coincident, but it needs a cell size — reintroducing the
+ * scale-dependent knob that replacing the IoU gate removed.
  */
 export function findDuplicates(elements, options = {}) {
+    // A caller that passes an IoU threshold is asking for IoU semantics; honour
+    // them (deprecated) rather than reinterpreting the number under a metric where
+    // it means nothing. Everyone else — the viewer, the CLI, every caller that
+    // passes no thresholds — gets the distance gate.
+    const legacyIoU = options.iouThreshold != null || options.exactThreshold != null;
     const iouThreshold = options.iouThreshold ?? DEFAULTS.iouThreshold;
     const exactThreshold = options.exactThreshold ?? DEFAULTS.exactThreshold;
     const positionTolerance = options.positionTolerance ?? DEFAULTS.positionTolerance;
+    const exactTolerance = options.exactTolerance ?? DEFAULTS.exactTolerance;
     const exclusions = options.exclusions;
     const clashes = [];
-    const seen = new Set();
+    /** clash id → index into `clashes`, for the cross-part dedup + upgrade below. */
+    const seen = new Map();
+    // Shape signatures are only needed for pairs that already coincide within
+    // `exactTolerance`, and each element's is O(its triangles). Compute them
+    // lazily and keep them, so a model with no coincident pairs never touches a
+    // vertex and a duplicated element is measured once however many partners it
+    // has.
+    //
+    // The signature is aggregated over ALL the meshes one element emitted (one
+    // per material / CSG part, sharing `(model, ref)`): area and volume both sum
+    // over parts. The exact-duplicate label is a statement about the ELEMENT
+    // pair, and the several cross-part pairs of one element pair collapse to a
+    // single clash id below — so comparing per-part signatures would let
+    // whichever part pairing the sweep reached first decide the label. Summing
+    // per-part |volume|s counts any overlap between parts twice, but it does so
+    // identically on both copies, so the comparison is unaffected.
+    const partsOf = new Map();
+    for (let i = 0; i < elements.length; i += 1) {
+        const k = `${elements[i].model} ${elements[i].ref}`;
+        const list = partsOf.get(k);
+        if (list)
+            list.push(i);
+        else
+            partsOf.set(k, [i]);
+    }
+    const signatures = new Map();
+    const signatureOf = (i) => {
+        const k = `${elements[i].model} ${elements[i].ref}`;
+        const cached = signatures.get(k);
+        if (cached)
+            return cached;
+        let area = 0;
+        let volume = 0;
+        for (const part of partsOf.get(k) ?? [i]) {
+            const s = shapeSignature(elements[part]);
+            area += s.area;
+            volume += s.volume;
+        }
+        const computed = { area, volume };
+        signatures.set(k, computed);
+        return computed;
+    };
+    // A key repeated inside one model across *different* elements is a defect in
+    // the file (`ifc-lite validate` reports duplicated GlobalIds), not proof of
+    // one element — and "the same object exported twice" is exactly what a
+    // duplicate hunt is for. So identity is (model, ref): `key` is the GlobalId,
+    // which a broken exporter can repeat, while `ref` is the express id (or its
+    // federated remap), which is unique by construction.
+    //
+    // A key does legitimately repeat across the several meshes one element emits
+    // (one per material / CSG part) — but those share the element's `ref` too, so
+    // they are still skipped as self-pairs. Only keys carried by two *distinct*
+    // refs are ambiguous, and only those get the ref folded into the clash id, so
+    // every id a well-formed file produced before is unchanged.
+    const ambiguousKeys = new Set();
+    {
+        const refOfKey = new Map();
+        for (const el of elements) {
+            const k = `${el.model} ${el.key}`;
+            const first = refOfKey.get(k);
+            if (first === undefined)
+                refOfKey.set(k, el.ref);
+            else if (first !== el.ref)
+                ambiguousKeys.add(k);
+        }
+    }
+    const pairKey = (el) => {
+        const k = `${el.model} ${el.key}`;
+        return ambiguousKeys.has(k) ? `${k}#${el.ref}` : k;
+    };
     const consider = (i, j) => {
         if (i >= j)
             return; // unordered pairs once
         const elA = elements[i];
         const elB = elements[j];
-        if (elA.key === elB.key && elA.model === elB.model)
+        if (elA.ref === elB.ref && elA.model === elB.model)
             return;
         if (exclusions &&
             isExcluded(exclusions, qualifiedKey(elA.model, elA.key), qualifiedKey(elB.model, elB.key))) {
             return;
         }
-        const sim = similarity(elA.bounds, elB.bounds, positionTolerance);
-        if (sim < iouThreshold)
-            return;
-        const sameTris = triCount(elA) > 0 && triCount(elA) === triCount(elB);
-        const exact = sim >= exactThreshold && sameTris;
+        let exact;
+        if (legacyIoU) {
+            const sim = similarity(elA.bounds, elB.bounds, positionTolerance);
+            if (sim < iouThreshold)
+                return;
+            exact = sim >= exactThreshold;
+        }
+        else {
+            if (!boxesTouch(elA.bounds, elB.bounds))
+                return;
+            const dist = boxDistance(elA.bounds, elB.bounds);
+            // Written as an acceptance (`!(dist <= tol)`), not a rejection
+            // (`dist > tol`), so a non-comparable distance abstains instead of
+            // asserting a pair. NaN fails every comparison, so bounds carrying NaN
+            // pass `boxesTouch` (its own comparisons are false too) and would fall
+            // through a `>` rejection and be reported as coincident with elements
+            // hundreds of metres away.
+            //
+            // The deprecated `iouThreshold` branch above is NOT a model for this: it
+            // is a rejection (`sim < iouThreshold`), and it happens to abstain on two
+            // NaN boxes only because `similarity` clamps them to 0 rather than
+            // returning NaN. It does not abstain in general — against a degenerate
+            // (zero-volume) element it takes the `aabbApproxEqual` fallback, whose
+            // per-axis comparisons are all false against NaN, so it returns 1 and
+            // reports the pair even at the default 0.9; and at `iouThreshold` 0 the
+            // rejection is false for every pair. That branch is deprecated and
+            // unchanged here; the two gates do not agree on non-finite bounds.
+            if (!(dist <= positionTolerance))
+                return;
+            exact = dist <= exactTolerance;
+        }
+        // Only now, on a pair that already coincides, is the shape worth measuring.
+        if (exact)
+            exact = sameShape(signatureOf(i), signatureOf(j));
         const severity = exact ? 'major' : 'minor';
-        const ka = `${elA.model} ${elA.key}`;
-        const kb = `${elB.model} ${elB.key}`;
+        const ka = pairKey(elA);
+        const kb = pairKey(elB);
         const [lo, hi] = ka < kb ? [ka, kb] : [kb, ka];
         const id = `duplicates ${lo} ${hi}`;
-        if (seen.has(id))
+        const existing = seen.get(id);
+        if (existing !== undefined) {
+            // Multi-part elements: every cross-part pair of one element pair carries
+            // this id, and which pair arrives first is an artefact of the sweep
+            // order. The label must not be: if a later pair shows the copies
+            // actually coincide within `exactTolerance` (the shape term is already
+            // per-element), upgrade the recorded finding — and carry this pair's
+            // geometry, so the record describes the coincident parts rather than
+            // the loose cross pairing that happened to be swept first.
+            if (severity === 'major' && clashes[existing].severity === 'minor') {
+                const bounds = overlapBounds(elA.bounds, elB.bounds);
+                clashes[existing] = {
+                    ...clashes[existing],
+                    severity,
+                    distance: -Math.max(0, minExtent(bounds)),
+                    point: center(bounds),
+                    bounds,
+                };
+            }
             return;
-        seen.add(id);
+        }
+        seen.set(id, clashes.length);
         const bounds = overlapBounds(elA.bounds, elB.bounds);
         clashes.push({
             id,
@@ -120,7 +281,10 @@ export function findDuplicates(elements, options = {}) {
             status: 'hard',
             // Coincident solids fully embed each other; report the embedded depth so
             // they read as real overlaps (not zero-distance contacts) and sort first.
+            // This is a box dimension, not a mesh measurement, so it is labelled the
+            // same as the narrow-phase AABB fallback.
             distance: -Math.max(0, minExtent(bounds)),
+            distanceKind: 'estimate',
             point: center(bounds),
             bounds,
             severity,
@@ -128,10 +292,18 @@ export function findDuplicates(elements, options = {}) {
     };
     // Broad phase: one-axis sort-and-sweep over the AABBs. Unlike a fixed-size
     // hash grid, this makes NO assumption about element scale — so two large
-    // objects offset by a few metres (still well above the IoU threshold) are
+    // objects offset by a few metres (still inside a metre-scale tolerance) are
     // never skipped just because many small elements shrank an average cell size.
     // Sweep along the axis with the widest spread of box minima so the active set
-    // (and thus the comparison count) stays small.
+    // (and thus the comparison count) stays small. Eviction drops only boxes that
+    // no longer touch on `axis`, which is lossless for the DEFAULT gate — a pair
+    // that does not touch is rejected by `boxesTouch` anyway. It is NOT lossless
+    // for the deprecated `iouThreshold` branch: `similarity`'s degenerate fallback
+    // matches disjoint boxes that are within `tol` per axis, so in legacy mode the
+    // sweep can evict a pair that gate would have reported, and whether it does
+    // depends on which axis has the widest spread of minima — i.e. on the rest of
+    // the model. That axis-dependence predates the distance gate (the sweep is
+    // unchanged), so `iouThreshold` still restores the pre-1.7 gate as documented.
     let axis = 0;
     let bestSpread = -Infinity;
     for (let a = 0; a < 3; a += 1) {
@@ -150,7 +322,28 @@ export function findDuplicates(elements, options = {}) {
             axis = a;
         }
     }
-    const order = elements.map((_, i) => i).sort((x, y) => elements[x].bounds.min[axis] - elements[y].bounds.min[axis]);
+    // The sweep key must be a TOTAL order, so it is compared, never subtracted.
+    // `a - b` returns NaN for any pair involving a non-finite minimum — NaN bounds
+    // from a direct SDK caller, and `+Infinity` from `fromPositions` when no vertex
+    // on an axis was finite (it returns the box inverted). A comparator that
+    // answers NaN violates the contract `Array.prototype.sort` requires, and V8's
+    // TimSort then merges runs against that answer and emits an arbitrary
+    // permutation of the WHOLE array: the sweep's eviction sees minima going
+    // backwards, drops boxes that are still live, and real duplicates elsewhere in
+    // the model silently disappear. One unjudgeable element must cost only itself.
+    // Non-finite minima sort last, after every finite one, which is what the gate
+    // already does with them — `consider` abstains on a distance it cannot
+    // compare, so they contribute nothing wherever they sit, and putting them at
+    // the end keeps them out of the active set for the whole finite sweep.
+    const sweepKey = (i) => {
+        const v = elements[i].bounds.min[axis];
+        return Number.isFinite(v) ? v : Number.POSITIVE_INFINITY;
+    };
+    const order = elements.map((_, i) => i).sort((x, y) => {
+        const kx = sweepKey(x);
+        const ky = sweepKey(y);
+        return kx < ky ? -1 : kx > ky ? 1 : 0;
+    });
     // `active` holds indices whose box still extends past the current box's start
     // on `axis`; only those can overlap, so we compare against just them.
     const active = [];
@@ -170,8 +363,9 @@ export function findDuplicates(elements, options = {}) {
     clashes.sort((x, y) => (x.id < y.id ? -1 : x.id > y.id ? 1 : 0));
     return {
         clashes,
-        summary: buildSummary(clashes),
+        summary: summarizeClashes(clashes),
         rulesRun: [DUPLICATES_RULE],
+        ruleCoverage: [{ rule: DUPLICATES_RULE.id, matchedA: elements.length, matchedB: null }],
         settings: { tolerance: positionTolerance, excludeVoidsAndHosts: exclusions != null },
     };
 }

package/dist/duplicates.js.map

@@ -1 +1 @@
-{"version":3,"file":"duplicates.js","sourceRoot":"","sources":["../src/duplicates.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAkB/D,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AA6BxD,MAAM,QAAQ,GAAmD;IAC/D,YAAY,EAAE,GAAG;IACjB,cAAc,EAAE,IAAI;IACpB,iBAAiB,EAAE,IAAI;CACxB,CAAC;AAEF,MAAM,CAAC,MAAM,eAAe,GAAc;IACxC,EAAE,EAAE,YAAY;IAChB,IAAI,EAAE,yBAAyB;IAC/B,CAAC,EAAE,GAAG;IACN,IAAI,EAAE,MAAM;CACb,CAAC;AAEF,SAAS,UAAU,CAAC,CAAO;IACzB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACtB,CAAC;AAED,8DAA8D;AAC9D,SAAS,OAAO,CAAC,CAAO,EAAE,CAAO;IAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACpD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,eAAe,CAAC,CAAO,EAAE,CAAO,EAAE,GAAW;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;QACtD,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;IACxD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;8DAC8D;AAC9D,SAAS,UAAU,CAAC,CAAO,EAAE,CAAO,EAAE,GAAW;IAC/C,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,IAAI,GAAG,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IACxB,uEAAuE;IACvE,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7C,OAAO,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,kFAAkF;AAClF,SAAS,SAAS,CAAC,CAAO;IACxB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACjF,CAAC;AAED,SAAS,QAAQ,CAAC,EAAgB;IAChC,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED,SAAS,KAAK,CAAC,EAAgB;IAC7B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;AACnF,CAAC;AAED,SAAS,YAAY,CAAC,OAAgB;IACpC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,UAAU,GAA2B,EAAE,CAAC;IAC9C,MAAM,UAAU,GAAkC,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IAC/F,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpD,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC;AACnE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,QAAwB,EAAE,UAA4B,EAAE;IACrF,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,CAAC;IACnE,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,QAAQ,CAAC,cAAc,CAAC;IACzE,MAAM,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,IAAI,QAAQ,CAAC,iBAAiB,CAAC;IAClF,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;IAEtC,MAAM,OAAO,GAAY,EAAE,CAAC;IAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAQ,EAAE;QAC9C,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,uBAAuB;QAC3C,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK;YAAE,OAAO;QAC3D,IACE,UAAU;YACV,UAAU,CAAC,UAAU,EAAE,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAC1F,CAAC;YACD,OAAO;QACT,CAAC;QACD,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;QAClE,IAAI,GAAG,GAAG,YAAY;YAAE,OAAO;QAE/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtE,MAAM,KAAK,GAAG,GAAG,IAAI,cAAc,IAAI,QAAQ,CAAC;QAChD,MAAM,QAAQ,GAAkB,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QAE1D,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;QACrC,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;QACrC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/C,MAAM,EAAE,GAAG,cAAc,EAAE,IAAI,EAAE,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO;QACzB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEb,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QACrD,OAAO,CAAC,IAAI,CAAC;YACX,EAAE;YACF,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC;YACb,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC;YACb,IAAI,EAAE,eAAe,CAAC,EAAE;YACxB,MAAM,EAAE,MAAM;YACd,yEAAyE;YACzE,0EAA0E;YAC1E,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;YACzC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC;YACrB,MAAM;YACN,QAAQ;SACT,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,2EAA2E;IAC3E,yEAAyE;IACzE,0EAA0E;IAC1E,8EAA8E;IAC9E,8EAA8E;IAC9E,+CAA+C;IAC/C,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,UAAU,GAAG,CAAC,QAAQ,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,IAAI,EAAE,GAAG,QAAQ,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC;QACnB,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,EAAE;gBAAE,EAAE,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,GAAG,EAAE;gBAAE,EAAE,GAAG,CAAC,CAAC;QACrB,CAAC;QACD,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC;QACvB,IAAI,MAAM,GAAG,UAAU,EAAE,CAAC;YACxB,UAAU,GAAG,MAAM,CAAC;YACpB,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAC1C,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CACtE,CAAC;IACF,8EAA8E;IAC9E,sEAAsE;IACtE,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;gBAChD,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,GAAG,EAAE,CAAC;YACf,CAAC;QACH,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QACvD,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,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,CAAC,CAAC;IAEjE,OAAO;QACL,OAAO;QACP,OAAO,EAAE,YAAY,CAAC,OAAO,CAAC;QAC9B,QAAQ,EAAE,CAAC,eAAe,CAAC;QAC3B,QAAQ,EAAE,EAAE,SAAS,EAAE,iBAAiB,EAAE,oBAAoB,EAAE,UAAU,IAAI,IAAI,EAAE;KACrF,CAAC;AACJ,CAAC"}
+{"version":3,"file":"duplicates.js","sourceRoot":"","sources":["../src/duplicates.ts"],"names":[],"mappings":"AAAA;;+DAE+D;AAE/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACvF,OAAO,EAAE,SAAS,EAAE,cAAc,EAAuB,MAAM,sBAAsB,CAAC;AACtF,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AA2DjD,MAAM,QAAQ,GAAG;IACf,iBAAiB,EAAE,IAAI;IACvB,cAAc,EAAE,KAAK;IACrB,4BAA4B;IAC5B,YAAY,EAAE,GAAG;IACjB,4BAA4B;IAC5B,cAAc,EAAE,IAAI;CAC6C,CAAC;AAEpE,MAAM,CAAC,MAAM,eAAe,GAAc;IACxC,EAAE,EAAE,YAAY;IAChB,IAAI,EAAE,yBAAyB;IAC/B,CAAC,EAAE,GAAG;IACN,IAAI,EAAE,MAAM;CACb,CAAC;AAEF,SAAS,KAAK,CAAC,EAAgB;IAC7B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;AACnF,CAAC;AAGD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiEG;AACH,MAAM,UAAU,cAAc,CAAC,QAAwB,EAAE,UAA4B,EAAE;IACrF,4EAA4E;IAC5E,+EAA+E;IAC/E,2EAA2E;IAC3E,iDAAiD;IACjD,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,IAAI,IAAI,IAAI,OAAO,CAAC,cAAc,IAAI,IAAI,CAAC;IACjF,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,CAAC;IACnE,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,QAAQ,CAAC,cAAc,CAAC;IACzE,MAAM,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,IAAI,QAAQ,CAAC,iBAAiB,CAAC;IAClF,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,QAAQ,CAAC,cAAc,CAAC;IACzE,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;IAEtC,MAAM,OAAO,GAAY,EAAE,CAAC;IAC5B,iFAAiF;IACjF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEvC,0EAA0E;IAC1E,yEAAyE;IACzE,4EAA4E;IAC5E,4EAA4E;IAC5E,OAAO;IACP,EAAE;IACF,2EAA2E;IAC3E,6EAA6E;IAC7E,yEAAyE;IACzE,2EAA2E;IAC3E,qEAAqE;IACrE,2EAA2E;IAC3E,4EAA4E;IAC5E,+DAA+D;IAC/D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACpD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAClB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,GAAG,EAA0B,CAAC;IACrD,MAAM,WAAW,GAAG,CAAC,CAAS,EAAkB,EAAE;QAChD,MAAM,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACpD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACzC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC;YACf,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC;QACrB,CAAC;QACD,MAAM,QAAQ,GAAmB,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QAClD,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC5B,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC;IAEF,6EAA6E;IAC7E,4EAA4E;IAC5E,uEAAuE;IACvE,6EAA6E;IAC7E,4EAA4E;IAC5E,qDAAqD;IACrD,EAAE;IACF,6EAA6E;IAC7E,8EAA8E;IAC9E,4EAA4E;IAC5E,8EAA8E;IAC9E,4DAA4D;IAC5D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IACxC,CAAC;QACC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,KAAK,KAAK,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;iBAC5C,IAAI,KAAK,KAAK,EAAE,CAAC,GAAG;gBAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,EAAgB,EAAU,EAAE;QAC3C,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;QAClC,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAQ,EAAE;QAC9C,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,uBAAuB;QAC3C,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK;YAAE,OAAO;QAC3D,IACE,UAAU;YACV,UAAU,CAAC,UAAU,EAAE,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAC1F,CAAC;YACD,OAAO;QACT,CAAC;QACD,IAAI,KAAc,CAAC;QACnB,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;YAClE,IAAI,GAAG,GAAG,YAAY;gBAAE,OAAO;YAC/B,KAAK,GAAG,GAAG,IAAI,cAAc,CAAC;QAChC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO;YAChD,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;YACjD,+DAA+D;YAC/D,mEAAmE;YACnE,uEAAuE;YACvE,uEAAuE;YACvE,sEAAsE;YACtE,2BAA2B;YAC3B,EAAE;YACF,yEAAyE;YACzE,0EAA0E;YAC1E,mEAAmE;YACnE,uEAAuE;YACvE,uEAAuE;YACvE,sEAAsE;YACtE,wEAAwE;YACxE,mEAAmE;YACnE,mEAAmE;YACnE,IAAI,CAAC,CAAC,IAAI,IAAI,iBAAiB,CAAC;gBAAE,OAAO;YACzC,KAAK,GAAG,IAAI,IAAI,cAAc,CAAC;QACjC,CAAC;QACD,4EAA4E;QAC5E,IAAI,KAAK;YAAE,KAAK,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,QAAQ,GAAkB,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QAE1D,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QACxB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/C,MAAM,EAAE,GAAG,cAAc,EAAE,IAAI,EAAE,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,yEAAyE;YACzE,oEAAoE;YACpE,iEAAiE;YACjE,uEAAuE;YACvE,qEAAqE;YACrE,qEAAqE;YACrE,2DAA2D;YAC3D,IAAI,QAAQ,KAAK,OAAO,IAAI,OAAO,CAAC,QAAQ,CAAC,CAAC,QAAQ,KAAK,OAAO,EAAE,CAAC;gBACnE,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;gBACrD,OAAO,CAAC,QAAQ,CAAC,GAAG;oBAClB,GAAG,OAAO,CAAC,QAAQ,CAAC;oBACpB,QAAQ;oBACR,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;oBACzC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC;oBACrB,MAAM;iBACP,CAAC;YACJ,CAAC;YACD,OAAO;QACT,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QAE7B,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QACrD,OAAO,CAAC,IAAI,CAAC;YACX,EAAE;YACF,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC;YACb,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC;YACb,IAAI,EAAE,eAAe,CAAC,EAAE;YACxB,MAAM,EAAE,MAAM;YACd,yEAAyE;YACzE,0EAA0E;YAC1E,yEAAyE;YACzE,0CAA0C;YAC1C,QAAQ,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;YACzC,YAAY,EAAE,UAAU;YACxB,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC;YACrB,MAAM;YACN,QAAQ;SACT,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,2EAA2E;IAC3E,yEAAyE;IACzE,4EAA4E;IAC5E,8EAA8E;IAC9E,8EAA8E;IAC9E,8EAA8E;IAC9E,6EAA6E;IAC7E,6EAA6E;IAC7E,+EAA+E;IAC/E,+EAA+E;IAC/E,4EAA4E;IAC5E,8EAA8E;IAC9E,2EAA2E;IAC3E,+EAA+E;IAC/E,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,UAAU,GAAG,CAAC,QAAQ,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9B,IAAI,EAAE,GAAG,QAAQ,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC;QACnB,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,EAAE;gBAAE,EAAE,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,GAAG,EAAE;gBAAE,EAAE,GAAG,CAAC,CAAC;QACrB,CAAC;QACD,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC;QACvB,IAAI,MAAM,GAAG,UAAU,EAAE,CAAC;YACxB,UAAU,GAAG,MAAM,CAAC;YACpB,IAAI,GAAG,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,+EAA+E;IAC/E,gFAAgF;IAChF,yEAAyE;IACzE,8EAA8E;IAC9E,sEAAsE;IACtE,yEAAyE;IACzE,+EAA+E;IAC/E,+EAA+E;IAC/E,8EAA8E;IAC9E,uEAAuE;IACvE,6EAA6E;IAC7E,uEAAuE;IACvE,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAU,EAAE;QACrC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC;IAC3D,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpD,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvB,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IACH,8EAA8E;IAC9E,sEAAsE;IACtE,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;gBAChD,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,GAAG,EAAE,CAAC;YACf,CAAC;QACH,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QACvD,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,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,CAAC,CAAC;IAEjE,OAAO;QACL,OAAO;QACP,OAAO,EAAE,gBAAgB,CAAC,OAAO,CAAC;QAClC,QAAQ,EAAE,CAAC,eAAe,CAAC;QAC3B,YAAY,EAAE,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,EAAE,EAAE,QAAQ,EAAE,QAAQ,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;QACvF,QAAQ,EAAE,EAAE,SAAS,EAAE,iBAAiB,EAAE,oBAAoB,EAAE,UAAU,IAAI,IAAI,EAAE;KACrF,CAAC;AACJ,CAAC"}

package/dist/engine-ts/depth.d.ts

@@ -0,0 +1,99 @@
+/**
+ * Depth measurement and the f32-precision floor for the narrow phase
+ * (`narrow.ts`). Split out to keep `narrow.ts` under the ~400-line module
+ * rule; mirrors `rust/clash/src/depth.rs` structurally so the two kernels
+ * stay easy to diff.
+ */
+import type { AABB, ClashElement, ClashRule, Vec3 } from '../types.js';
+import type { TriMesh } from './tri-mesh.js';
+import type { NarrowResult } from './narrow.js';
+/**
+ * Exact box-box penetration when BOTH meshes are (within tolerance)
+ * rectangular boxes, else `null`. `mtd` is the only source of a `'mesh'`
+ * label for a distance that used to come from `TriMesh.maxPenetrationInto` —
+ * a nearest-crossing-vertex sampling probe that converges to 0 under
+ * retessellation instead of to the true depth (see `obb.ts`, `obb.test.ts`).
+ *
+ * `through` flags a THROUGH-PENETRATION pair — a thin member piercing clean
+ * through the other, e.g. a duct through a wall. There, the minimum-
+ * translation-distance `obb.ts` computes is dominated by the piercing
+ * member's own extent along the shared axis, not by the material actually
+ * crossed (review: #2536, reproduced a 5.5x inflation on exactly this
+ * shape), so `depthClashResult` reports the caller's AABB estimate for that
+ * shape — matching what `main` did before the box-exact metric existed, and
+ * honest about not being a measurement. The MTD is still returned (not
+ * discarded here) because the f32 floor must see it: which number gets
+ * REPORTED is a separate, later decision from whether the pair is
+ * measurable at all (see `depthClashResult`).
+ */
+export interface BoxPenetration {
+    /** Exact box-box minimum-translation depth (Gottschalk 15-axis SAT). */
+    mtd: number;
+    /** The MTD is inflated by the piercing member's own extent; report the
+     * AABB estimate instead (see `isThroughPenetration`). */
+    through: boolean;
+}
+export declare function boxPenetration(small: TriMesh, large: TriMesh): BoxPenetration | null;
+/**
+ * Deepest penetration of `mesh`'s crossing-triangle VERTICES into `other`:
+ * the maximum distance-to-surface of `other` over the vertices of the
+ * triangles flagged in `crossFlags` (the pairs the narrow phase saw
+ * genuinely crossing `other`) that lie inside `other`. Each vertex is
+ * visited once (deduped by vertex index, in index order — bit-identical to
+ * the Rust `crossing_vertex_penetration`). Returns 0 when no flagged vertex
+ * is inside.
+ *
+ * This is NOT a depth metric and must never be reported as one — it is the
+ * sampling probe PR #2536 was held over (`maxPenetrationInto`): its value is
+ * an O(edge length) artifact that converges to 0 under retessellation
+ * instead of to the true depth. It survives with exactly one client: the
+ * f32 noise-floor gate for a CONTAINED pair (`depthClashResult`), where the
+ * question is not "how deep?" but "is any mesh-level penetration measurably
+ * above the floor at all?" — sub-floor here means every crossing vertex sits
+ * within f32 rounding noise of the other surface, i.e. surfaces authored
+ * flush, which no amount of retessellation turns into a real overlap. For
+ * that yes/no question the probe's underestimation is harmless:
+ * underestimating can only keep a pair BELOW the floor, and the floor is
+ * the very thing being tested.
+ */
+export declare function crossingVertexPenetration(mesh: TriMesh, other: TriMesh, crossFlags: Uint8Array): number;
+/**
+ * Turns the candidate penetration depths into the final `(status,
+ * distanceKind, distance)` triple. This is the ONLY place in the narrow
+ * phase allowed to build a `'mesh'`- or `'estimate'`-labelled `hard` result
+ * off a depth number — every branch in `narrow.ts` that can label a result
+ * `'mesh'` off `boxPenetration` (or its AABB-estimate fallback) MUST route
+ * through here rather than building the `NarrowResult` literal itself. That
+ * is what makes the f32 floor apply to all of them, and what enforces its
+ * precedence.
+ *
+ * THE FLOOR WINS (#2536 rebase decision): a pair below the f32 noise floor
+ * is `touch` regardless of how its depth was derived — at that magnitude the
+ * number is not measurable either way — so the floor is tested against EVERY
+ * candidate depth the pair has, not against whichever one the estimate-vs-
+ * mesh selection would report. Three candidates exist:
+ *
+ * - the AABB `estimate` (always present);
+ * - the box MTD, when both elements are certified boxes (`box`);
+ * - the crossing-vertex penetration, for a CONTAINED pair with a crossing
+ *   vertex inside the other solid (`meshEvidence`) — evidence for this gate
+ *   only, never a reported depth (see `crossingVertexPenetration`).
+ *
+ * The pair is `hard` only when the SMALLEST available candidate clears the
+ * floor. That is what makes the floor unreachable by depth-source selection:
+ * a sub-floor box MTD cannot be promoted by the through-penetration guard
+ * swapping in a larger AABB estimate; a sub-floor crossing-vertex
+ * penetration on a contained pair (surfaces authored flush — the eight
+ * Infra-Bridge pairs that moved #2594's 50-hard-clash pin to 58 when this
+ * PR's depth rework replaced their noise-scale mesh depth with the
+ * fabricated 4 m AABB estimate) cannot be promoted by that estimate; and a
+ * sub-floor AABB estimate cannot be promoted by a larger MTD (a through-
+ * penetration far from the origin, where the MTD is inflated by the
+ * piercing member's own extent). Only a pair already above the floor
+ * reaches the selection below, which then merely picks WHICH above-floor
+ * reportable number is used and how it is labelled — so a `hard` result's
+ * distance clears the floor by construction, whichever quantity it came
+ * from.
+ */
+export declare function depthClashResult(box: BoxPenetration | null, estimate: number, meshEvidence: number | null, elA: ClashElement, elB: ClashElement, rule: ClashRule, point: Vec3, bounds: AABB): NarrowResult | null;
+//# sourceMappingURL=depth.d.ts.map

package/dist/engine-ts/depth.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"depth.d.ts","sourceRoot":"","sources":["../../src/engine-ts/depth.ts"],"names":[],"mappings":"AAIA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AACvE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAGhD;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,WAAW,cAAc;IAC7B,wEAAwE;IACxE,GAAG,EAAE,MAAM,CAAC;IACZ;6DACyD;IACzD,OAAO,EAAE,OAAO,CAAC;CAClB;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,cAAc,GAAG,IAAI,CAOpF;AAsDD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,GAAG,MAAM,CAevG;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,wBAAgB,gBAAgB,CAC9B,GAAG,EAAE,cAAc,GAAG,IAAI,EAC1B,QAAQ,EAAE,MAAM,EAChB,YAAY,EAAE,MAAM,GAAG,IAAI,EAC3B,GAAG,EAAE,YAAY,EACjB,GAAG,EAAE,YAAY,EACjB,IAAI,EAAE,SAAS,EACf,KAAK,EAAE,IAAI,EACX,MAAM,EAAE,IAAI,GACX,YAAY,GAAG,IAAI,CAsBrB"}