@faicad/faijs 0.13.0

package/dist/boolean/cross-section.js

@@ -0,0 +1,301 @@
+/**
+ * 截面求解器（无 CSG / 无 Manifold.simplify）
+ *
+ * 给定源网格（THREE.BufferGeometry）和一个局部空间平面，直接求「平面与网格的
+ * 交线」，缝合成闭合环（外环 + 孔环），并三角化出截面 cap。这是「拉伸预览无
+ * split 方案」的唯一 CPU 几何成本。
+ *
+ * 为什么不用 Manifold.split：
+ *   - split 是整模型布尔运算（焊接 + 全分辨率 CSG），168 万三角面 4~8s/次；
+ *   - 本方案只做三角形–平面求交（纯算术），O(n)，且后续可叠加 BVH 降到 O(log n + k)。
+ *
+ * 设计契约（与 ExtrudeRenderer 现有代码对齐）：
+ *   - 输入平面为「局部空间」THREE.Plane（调用方负责把世界平面经 matrixWorld 逆变换得到）。
+ *   - computeSection 直接读 geometry.attributes，不拷贝整份顶点缓冲。
+ *   - 输出的 cap 顶点为局部空间，预览期经 matrixWorld 渲染到世界空间。
+ */
+import * as THREE from 'three';
+const EPS_SURFACE = 1e-6;
+/** 线段端点量化容差（平面 2D 坐标），用于缝合相邻线段。 */
+const STITCH_TOL = 1e-4;
+/** 平面正交基 (u, v)，用于把 3D 截面点投影到 2D 以做缝合/面积/三角化。 */
+function planeBasis(normal) {
+    const n = normal.clone().normalize();
+    const t = Math.abs(n.x) < 0.9 ? new THREE.Vector3(1, 0, 0) : new THREE.Vector3(0, 1, 0);
+    const u = new THREE.Vector3().crossVectors(t, n).normalize();
+    const v = new THREE.Vector3().crossVectors(n, u).normalize();
+    return { u, v };
+}
+function project2D(p, u, v) {
+    return new THREE.Vector2(p.dot(u), p.dot(v));
+}
+/**
+ * 端点量化到 STITCH_TOL 网格上作为缝合 key。
+ * 用 Math.round 而非 toFixed：避免 -0.00001 → "-0.0000" 与 0 → "0.0000" 被当成两个点。
+ */
+function key2D(p) {
+    return `${Math.round(p.x / STITCH_TOL)},${Math.round(p.y / STITCH_TOL)}`;
+}
+/**
+ * Compute the section of a mesh cut by a plane.
+ * @param geometry Source mesh (local space), supports indexed and non-indexed.
+ * @param plane    Local-space cutting plane (THREE.Plane semantics: normal·p + constant = 0).
+ * @returns The stitched section rings, outers, holes, and diagnostic counters.
+ */
+export function computeSection(geometry, plane) {
+    const posAttr = geometry.attributes.position;
+    if (!posAttr) {
+        return { rings: [], outers: [], holesOf: [], hitTriangleCount: 0, segmentCount: 0 };
+    }
+    const pos = posAttr.array;
+    const index = geometry.index;
+    const triCount = index ? index.count / 3 : pos.length / 9;
+    const refs = [];
+    if (index) {
+        for (let t = 0; t < triCount; t++) {
+            refs.push({ a: index.getX(t * 3), b: index.getX(t * 3 + 1), c: index.getX(t * 3 + 2) });
+        }
+    }
+    else {
+        for (let t = 0; t < triCount; t++) {
+            refs.push({ a: t * 3, b: t * 3 + 1, c: t * 3 + 2 });
+        }
+    }
+    const at = (i, out) => out.set(pos[i * 3], pos[i * 3 + 1], pos[i * 3 + 2]);
+    const n = plane.normal;
+    const va = new THREE.Vector3();
+    const vb = new THREE.Vector3();
+    const vc = new THREE.Vector3();
+    // 收集交线段（每条 2 个 3D 端点，均在截面上）
+    const segments = [];
+    let hitTriangleCount = 0;
+    for (const r of refs) {
+        at(r.a, va);
+        at(r.b, vb);
+        at(r.c, vc);
+        const da = n.dot(va) + plane.constant;
+        const db = n.dot(vb) + plane.constant;
+        const dc = n.dot(vc) + plane.constant;
+        const above = (d) => d > EPS_SURFACE;
+        const below = (d) => d < -EPS_SURFACE;
+        const onSurf = (d) => !above(d) && !below(d);
+        // 交点插值：在 a、b 边上按距离比例
+        const lerp = (ia, ib, daa, dbb) => {
+            const pa = ia === r.a ? va : ia === r.b ? vb : vc;
+            const pb = ib === r.a ? va : ib === r.b ? vb : vc;
+            const t = daa / (daa - dbb);
+            return new THREE.Vector3().lerpVectors(pa, pb, t);
+        };
+        const crossings = [];
+        if (onSurf(da) && (above(db) !== above(dc) || below(db) !== below(dc))) {
+            crossings.push(va.clone());
+        }
+        if (onSurf(db) && (above(da) !== above(dc) || below(da) !== below(dc))) {
+            crossings.push(vb.clone());
+        }
+        if (onSurf(dc) && (above(da) !== above(db) || below(da) !== below(db))) {
+            crossings.push(vc.clone());
+        }
+        // 纯跨越：异侧顶点两两组合产生 2 个交点
+        const verts = [
+            { i: r.a, d: da, p: va },
+            { i: r.b, d: db, p: vb },
+            { i: r.c, d: dc, p: vc },
+        ];
+        const pos_ = verts.filter((x) => above(x.d) || onSurf(x.d));
+        const neg_ = verts.filter((x) => below(x.d) || onSurf(x.d));
+        // 标准 straddle：恰好 1 顶点在一侧、2 在另一侧 → 两条跨边各一个交点
+        if (pos_.length === 1 && neg_.length === 2) {
+            const p = pos_[0];
+            const [q1, q2] = neg_;
+            crossings.push(lerp(p.i, q1.i, p.d, q1.d));
+            crossings.push(lerp(p.i, q2.i, p.d, q2.d));
+        }
+        else if (neg_.length === 1 && pos_.length === 2) {
+            const p = neg_[0];
+            const [q1, q2] = pos_;
+            crossings.push(lerp(p.i, q1.i, p.d, q1.d));
+            crossings.push(lerp(p.i, q2.i, p.d, q2.d));
+        }
+        // 去重（同一三角形内重复端点）
+        const uniq = [];
+        for (const c of crossings) {
+            if (!uniq.some((u) => u.distanceToSquared(c) < 1e-12))
+                uniq.push(c);
+        }
+        if (uniq.length >= 2) {
+            hitTriangleCount++;
+            for (let k = 0; k + 1 < uniq.length; k += 2) {
+                segments.push([uniq[k], uniq[k + 1]]);
+            }
+        }
+    }
+    const { u, v } = planeBasis(n);
+    // 缝合：按量化端点建邻接，沿共享端点 walk 出闭合环
+    const endpoints = new Map();
+    segments.forEach((seg, si) => {
+        const ka = key2D(project2D(seg[0], u, v));
+        const kb = key2D(project2D(seg[1], u, v));
+        if (!endpoints.has(ka))
+            endpoints.set(ka, []);
+        if (!endpoints.has(kb))
+            endpoints.set(kb, []);
+        endpoints.get(ka).push({ seg: si, end: 0 });
+        endpoints.get(kb).push({ seg: si, end: 1 });
+    });
+    const visited = new Set();
+    const loops = [];
+    for (let si = 0; si < segments.length; si++) {
+        if (visited.has(si))
+            continue;
+        const loop = [];
+        const start = segments[si][0];
+        loop.push(start);
+        visited.add(si);
+        let curKey = key2D(project2D(segments[si][1], u, v));
+        const startKey = key2D(project2D(start, u, v));
+        // 防止无限循环
+        let guard = 0;
+        const maxSteps = segments.length * 2 + 4;
+        while (guard++ < maxSteps) {
+            const cands = endpoints.get(curKey)?.filter((c) => !visited.has(c.seg)) ?? [];
+            if (cands.length === 0)
+                break;
+            const c = cands[0];
+            const otherEnd = c.end === 0 ? segments[c.seg][1] : segments[c.seg][0];
+            loop.push(otherEnd);
+            visited.add(c.seg);
+            const nk = key2D(project2D(otherEnd, u, v));
+            if (nk === startKey)
+                break;
+            curKey = nk;
+        }
+        loops.push(loop);
+    }
+    // 分类外环/孔环。
+    // 关键：不能单纯按「面积<0 即孔」判断，因为缝合出的环绕序不固定（可能整体 CW）。
+    // 正确做法：以「绝对面积最大的环」为外环基准，其有向面积符号 outerSign 定义外环方向；
+    // 与之同号者为外环、异号者为孔环。这样即使所有环都 CW，最大面积环仍被正确认作外环。
+    const signedArea = (loop) => {
+        let area = 0;
+        for (let i = 0; i < loop.length; i++) {
+            const p = project2D(loop[i], u, v);
+            const q = project2D(loop[(i + 1) % loop.length], u, v);
+            area += p.x * q.y - q.x * p.y;
+        }
+        return area / 2;
+    };
+    const areas = loops.map((pts) => signedArea(pts));
+    let maxIdx = 0;
+    for (let i = 1; i < areas.length; i++) {
+        if (Math.abs(areas[i]) > Math.abs(areas[maxIdx]))
+            maxIdx = i;
+    }
+    const outerSign = areas.length > 0 ? Math.sign(areas[maxIdx]) || 1 : 1;
+    const rings = loops.map((pts, i) => {
+        const isHole = Math.sign(areas[i]) !== outerSign;
+        // 统一：外环取 outerSign（CCW），孔环取 -outerSign（CW）
+        const wantSign = isHole ? -outerSign : outerSign;
+        const oriented = Math.sign(areas[i]) !== wantSign ? [...pts].reverse() : pts;
+        return { points: oriented, isHole };
+    });
+    const outers = rings.filter((r) => !r.isHole).map((r) => r.points);
+    const holes = rings.filter((r) => r.isHole).map((r) => r.points);
+    // 把孔分给包含其重心的外环
+    const holesOf = outers.map(() => []);
+    const centroid = (loop) => {
+        const c = new THREE.Vector2();
+        for (const p of loop)
+            c.add(project2D(p, u, v));
+        return c.multiplyScalar(1 / Math.max(1, loop.length));
+    };
+    const pointInLoop = (pt, loop) => {
+        let inside = false;
+        for (let i = 0, j = loop.length - 1; i < loop.length; j = i++) {
+            const a = project2D(loop[i], u, v);
+            const b = project2D(loop[j], u, v);
+            if (a.y > pt.y !== b.y > pt.y && pt.x < ((b.x - a.x) * (pt.y - a.y)) / (b.y - a.y) + a.x) {
+                inside = !inside;
+            }
+        }
+        return inside;
+    };
+    holes.forEach((h) => {
+        const hc = centroid(h);
+        let assigned = -1;
+        for (let oi = 0; oi < outers.length; oi++) {
+            if (pointInLoop(hc, outers[oi])) {
+                assigned = oi;
+                break;
+            }
+        }
+        if (assigned < 0)
+            assigned = 0;
+        holesOf[assigned].push(h);
+    });
+    return { rings, outers, holesOf, hitTriangleCount, segmentCount: segments.length };
+}
+/**
+ * Build a prism geometry by extruding the section rings along the normal for
+ * `length`, starting at `start` (in local space). The output contains the cap
+ * triangulation (top/bottom faces) plus the side walls of every boundary loop.
+ * It can be fed directly to a THREE.BufferGeometry or converted to ManifoldMeshData.
+ *
+ * @param section    computeSection result
+ * @param normal     Extrusion direction (local space, unit vector)
+ * @param length     Extrusion length
+ * @param start      Start offset along the normal (centered mode passes offsetBack so the prism spans [offsetBack, offsetFront])
+ * @returns Filled position and index buffers describing the extruded prism.
+ */
+export function buildExtrudedProfile(section, normal, length, start = 0) {
+    const positions = [];
+    const indices = [];
+    const dx = normal.x * length;
+    const dy = normal.y * length;
+    const dz = normal.z * length;
+    const sx = normal.x * start;
+    const sy = normal.y * start;
+    const sz = normal.z * start;
+    section.outers.forEach((outer, oi) => {
+        const holeLoops = section.holesOf[oi];
+        // 本组所有边界环（外环在前，孔环随后），顺序即 pts3D 顺序，也是 triangulateShape 的顶点顺序
+        const allLoops = [outer, ...holeLoops];
+        const offsets = [];
+        const pts3D = [];
+        for (const loop of allLoops) {
+            offsets.push(pts3D.length);
+            pts3D.push(...loop);
+        }
+        const basis = planeBasis(normal);
+        const to2D = (p) => project2D(p, basis.u, basis.v);
+        const tris = THREE.ShapeUtils.triangulateShape(outer.map(to2D), holeLoops.map((h) => h.map(to2D)));
+        if (!tris || tris.length === 0)
+            return;
+        const base = positions.length / 3;
+        const vCount = pts3D.length;
+        // bottom cap（含 start 偏移）
+        for (const p of pts3D)
+            positions.push(p.x + sx, p.y + sy, p.z + sz);
+        for (const t of tris)
+            indices.push(base + t[0], base + t[1], base + t[2]);
+        // top cap（reversed winding）
+        const topBase = base + vCount;
+        for (const p of pts3D)
+            positions.push(p.x + sx + dx, p.y + sy + dy, p.z + sz + dz);
+        for (const t of tris)
+            indices.push(topBase + t[0], topBase + t[2], topBase + t[1]);
+        // 侧壁：每个边界环的相邻顶点构成竖直 quad（用环内偏移，避免引用查找）
+        allLoops.forEach((loop, li) => {
+            const off = offsets[li];
+            const len = loop.length;
+            for (let k = 0; k < len; k++) {
+                const a = off + k;
+                const b = off + ((k + 1) % len);
+                indices.push(base + a, base + b, topBase + b);
+                indices.push(base + a, topBase + b, topBase + a);
+            }
+        });
+    });
+    return { positions: new Float32Array(positions), indices: new Uint32Array(indices) };
+}
+//# sourceMappingURL=cross-section.js.map

package/dist/boolean/cross-section.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-section.js","sourceRoot":"","sources":["../../src/boolean/cross-section.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,KAAK,KAAK,MAAM,OAAO,CAAA;AA2B9B,MAAM,WAAW,GAAG,IAAI,CAAA;AACxB,mCAAmC;AACnC,MAAM,UAAU,GAAG,IAAI,CAAA;AAEvB,iDAAiD;AACjD,SAAS,UAAU,CAAC,MAAqB;IACvC,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,SAAS,EAAE,CAAA;IACpC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACvF,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IAC5D,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAA;IAC5D,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAA;AACjB,CAAC;AAED,SAAS,SAAS,CAAC,CAAgB,EAAE,CAAgB,EAAE,CAAgB;IACrE,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;AAC9C,CAAC;AAED;;;GAGG;AACH,SAAS,KAAK,CAAC,CAAgB;IAC7B,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,EAAE,CAAA;AAC1E,CAAC;AASD;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,QAA8B,EAAE,KAAkB;IAC/E,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAiC,CAAA;IACrE,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAA;IACrF,CAAC;IACD,MAAM,GAAG,GAAG,OAAO,CAAC,KAAqB,CAAA;IACzC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;IAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAA;IAEzD,MAAM,IAAI,GAAa,EAAE,CAAA;IACzB,IAAI,KAAK,EAAE,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAA;QACzF,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACrD,CAAC;IACH,CAAC;IAED,MAAM,EAAE,GAAG,CAAC,CAAS,EAAE,GAAkB,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAEjG,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAA;IACtB,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAA;IAC9B,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAA;IAC9B,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAA;IAE9B,4BAA4B;IAC5B,MAAM,QAAQ,GAAqC,EAAE,CAAA;IACrD,IAAI,gBAAgB,GAAG,CAAC,CAAA;IAExB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAA;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAA;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAA;QAErC,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,WAAW,CAAA;QAC5C,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,CAAA;QAC7C,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAEpD,qBAAqB;QACrB,MAAM,IAAI,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,GAAW,EAAE,GAAW,EAAiB,EAAE;YAC/E,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;YACjD,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;YACjD,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;YAC3B,OAAO,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;QACnD,CAAC,CAAA;QAED,MAAM,SAAS,GAAoB,EAAE,CAAA;QACrC,IAAI,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACvE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAA;QAC5B,CAAC;QACD,IAAI,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACvE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAA;QAC5B,CAAC;QACD,IAAI,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACvE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAA;QAC5B,CAAC;QACD,uBAAuB;QACvB,MAAM,KAAK,GAAG;YACZ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE;YACxB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE;YACxB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE;SACzB,CAAA;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3D,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC3D,4CAA4C;QAC5C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACjB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAA;YACrB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAC1C,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAC5C,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACjB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAA;YACrB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAC1C,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAC5C,CAAC;QACD,iBAAiB;QACjB,MAAM,IAAI,GAAoB,EAAE,CAAA;QAChC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrE,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACrB,gBAAgB,EAAE,CAAA;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5C,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACvC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;IAE9B,8BAA8B;IAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAA8C,CAAA;IACvE,QAAQ,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE;QAC3B,MAAM,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACzC,MAAM,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACzC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QAC7C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QAC7C,SAAS,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAA;QAC5C,SAAS,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAA;IAC9C,CAAC,CAAC,CAAA;IAEF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,KAAK,GAAsB,EAAE,CAAA;IACnC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QAC5C,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAQ;QAC7B,MAAM,IAAI,GAAoB,EAAE,CAAA;QAChC,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAC7B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAChB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACf,IAAI,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QACpD,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAC9C,SAAS;QACT,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAA;QACxC,OAAO,KAAK,EAAE,GAAG,QAAQ,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAA;YAC7E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAK;YAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;YAClB,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACtE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YACnB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;YAClB,MAAM,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;YAC3C,IAAI,EAAE,KAAK,QAAQ;gBAAE,MAAK;YAC1B,MAAM,GAAG,EAAE,CAAA;QACb,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAClB,CAAC;IAED,WAAW;IACX,6CAA6C;IAC7C,kDAAkD;IAClD,6CAA6C;IAC7C,MAAM,UAAU,GAAG,CAAC,IAAqB,EAAU,EAAE;QACnD,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YAClC,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YACtD,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAC/B,CAAC;QACD,OAAO,IAAI,GAAG,CAAC,CAAA;IACjB,CAAC,CAAA;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAA;IACjD,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAAE,MAAM,GAAG,CAAC,CAAA;IAC9D,CAAC;IACD,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAEtE,MAAM,KAAK,GAAkB,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAA;QAChD,2CAA2C;QAC3C,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAA;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,GAAG,CAAA;QAC5E,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAA;IACrC,CAAC,CAAC,CAAA;IAEF,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IAClE,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;IAEhE,eAAe;IACf,MAAM,OAAO,GAAwB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAA;IACzD,MAAM,QAAQ,GAAG,CAAC,IAAqB,EAAiB,EAAE;QACxD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAA;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;QAC/C,OAAO,CAAC,CAAC,cAAc,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAA;IACvD,CAAC,CAAA;IACD,MAAM,WAAW,GAAG,CAAC,EAAiB,EAAE,IAAqB,EAAW,EAAE;QACxE,IAAI,MAAM,GAAG,KAAK,CAAA;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;YAC9D,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YAClC,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YAClC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzF,MAAM,GAAG,CAAC,MAAM,CAAA;YAClB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC,CAAA;IACD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAClB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;QACtB,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAA;QACjB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC1C,IAAI,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAAC,QAAQ,GAAG,EAAE,CAAC;gBAAC,MAAK;YAAC,CAAC;QAC3D,CAAC;QACD,IAAI,QAAQ,GAAG,CAAC;YAAE,QAAQ,GAAG,CAAC,CAAA;QAC9B,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAC3B,CAAC,CAAC,CAAA;IAEF,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAA;AACpF,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAAsB,EACtB,MAAqB,EACrB,MAAc,EACd,KAAK,GAAG,CAAC;IAET,MAAM,SAAS,GAAa,EAAE,CAAA;IAC9B,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAA;IAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAA;IAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,MAAM,CAAA;IAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAA;IAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAA;IAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAA;IAE3B,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;QACnC,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;QACrC,4DAA4D;QAC5D,MAAM,QAAQ,GAAsB,CAAC,KAAK,EAAE,GAAG,SAAS,CAAC,CAAA;QACzD,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,MAAM,KAAK,GAAoB,EAAE,CAAA;QACjC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;YAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;QACrB,CAAC;QACD,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAA;QAChC,MAAM,IAAI,GAAG,CAAC,CAAgB,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAA;QACjE,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,gBAAgB,CAC5C,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EACf,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAClC,CAAA;QACD,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAM;QAEtC,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;QACjC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAA;QAC3B,yBAAyB;QACzB,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAA;QACnE,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACzE,4BAA4B;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,MAAM,CAAA;QAC7B,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;QAClF,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,OAAO,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAElF,uCAAuC;QACvC,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE;YAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;YACvB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAA;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAA;gBACjB,MAAM,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;gBAC/B,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAA;gBAC7C,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAA;YAClD,CAAC;QACH,CAAC,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IAEF,OAAO,EAAE,SAAS,EAAE,IAAI,YAAY,CAAC,SAAS,CAAC,EAAE,OAAO,EAAE,IAAI,WAAW,CAAC,OAAO,CAAC,EAAE,CAAA;AACtF,CAAC","sourcesContent":["/**\n * 截面求解器（无 CSG / 无 Manifold.simplify）\n *\n * 给定源网格（THREE.BufferGeometry）和一个局部空间平面，直接求「平面与网格的\n * 交线」，缝合成闭合环（外环 + 孔环），并三角化出截面 cap。这是「拉伸预览无\n * split 方案」的唯一 CPU 几何成本。\n *\n * 为什么不用 Manifold.split：\n *   - split 是整模型布尔运算（焊接 + 全分辨率 CSG），168 万三角面 4~8s/次；\n *   - 本方案只做三角形–平面求交（纯算术），O(n)，且后续可叠加 BVH 降到 O(log n + k)。\n *\n * 设计契约（与 ExtrudeRenderer 现有代码对齐）：\n *   - 输入平面为「局部空间」THREE.Plane（调用方负责把世界平面经 matrixWorld 逆变换得到）。\n *   - computeSection 直接读 geometry.attributes，不拷贝整份顶点缓冲。\n *   - 输出的 cap 顶点为局部空间，预览期经 matrixWorld 渲染到世界空间。\n */\nimport * as THREE from 'three'\n\n/**\n * A single closed loop (3D, local space, lying on the section plane).\n * `isHole=false` marks the outer boundary, `true` marks a hole.\n */\nexport interface SectionRing {\n  points: THREE.Vector3[]\n  isHole: boolean\n}\n\n/**\n * Result of computing a section: the stitched loops and diagnostic counters.\n */\nexport interface SectionResult {\n  /** All stitched loops (already classified by area into isHole). */\n  rings: SectionRing[]\n  /** 外环列表（3D 点）。 */\n  outers: THREE.Vector3[][]\n  /** 每个外环对应的孔环列表（与 outers 同序）。 */\n  holesOf: THREE.Vector3[][][]\n  /** 实际参与求交、跨越/贴合平面的三角形数（诊断用）。 */\n  hitTriangleCount: number\n  /** 收集到的交线段数。 */\n  segmentCount: number\n}\n\nconst EPS_SURFACE = 1e-6\n/** 线段端点量化容差（平面 2D 坐标），用于缝合相邻线段。 */\nconst STITCH_TOL = 1e-4\n\n/** 平面正交基 (u, v)，用于把 3D 截面点投影到 2D 以做缝合/面积/三角化。 */\nfunction planeBasis(normal: THREE.Vector3): { u: THREE.Vector3; v: THREE.Vector3 } {\n  const n = normal.clone().normalize()\n  const t = Math.abs(n.x) < 0.9 ? new THREE.Vector3(1, 0, 0) : new THREE.Vector3(0, 1, 0)\n  const u = new THREE.Vector3().crossVectors(t, n).normalize()\n  const v = new THREE.Vector3().crossVectors(n, u).normalize()\n  return { u, v }\n}\n\nfunction project2D(p: THREE.Vector3, u: THREE.Vector3, v: THREE.Vector3): THREE.Vector2 {\n  return new THREE.Vector2(p.dot(u), p.dot(v))\n}\n\n/**\n * 端点量化到 STITCH_TOL 网格上作为缝合 key。\n * 用 Math.round 而非 toFixed：避免 -0.00001 → \"-0.0000\" 与 0 → \"0.0000\" 被当成两个点。\n */\nfunction key2D(p: THREE.Vector2): string {\n  return `${Math.round(p.x / STITCH_TOL)},${Math.round(p.y / STITCH_TOL)}`\n}\n\n/** 三角形三个顶点索引（索引几何）或顺次顶点（非索引几何）。 */\ninterface TriRef {\n  a: number\n  b: number\n  c: number\n}\n\n/**\n * Compute the section of a mesh cut by a plane.\n * @param geometry Source mesh (local space), supports indexed and non-indexed.\n * @param plane    Local-space cutting plane (THREE.Plane semantics: normal·p + constant = 0).\n * @returns The stitched section rings, outers, holes, and diagnostic counters.\n */\nexport function computeSection(geometry: THREE.BufferGeometry, plane: THREE.Plane): SectionResult {\n  const posAttr = geometry.attributes.position as THREE.BufferAttribute\n  if (!posAttr) {\n    return { rings: [], outers: [], holesOf: [], hitTriangleCount: 0, segmentCount: 0 }\n  }\n  const pos = posAttr.array as Float32Array\n  const index = geometry.index\n  const triCount = index ? index.count / 3 : pos.length / 9\n\n  const refs: TriRef[] = []\n  if (index) {\n    for (let t = 0; t < triCount; t++) {\n      refs.push({ a: index.getX(t * 3), b: index.getX(t * 3 + 1), c: index.getX(t * 3 + 2) })\n    }\n  } else {\n    for (let t = 0; t < triCount; t++) {\n      refs.push({ a: t * 3, b: t * 3 + 1, c: t * 3 + 2 })\n    }\n  }\n\n  const at = (i: number, out: THREE.Vector3) => out.set(pos[i * 3], pos[i * 3 + 1], pos[i * 3 + 2])\n\n  const n = plane.normal\n  const va = new THREE.Vector3()\n  const vb = new THREE.Vector3()\n  const vc = new THREE.Vector3()\n\n  // 收集交线段（每条 2 个 3D 端点，均在截面上）\n  const segments: [THREE.Vector3, THREE.Vector3][] = []\n  let hitTriangleCount = 0\n\n  for (const r of refs) {\n    at(r.a, va); at(r.b, vb); at(r.c, vc)\n    const da = n.dot(va) + plane.constant\n    const db = n.dot(vb) + plane.constant\n    const dc = n.dot(vc) + plane.constant\n\n    const above = (d: number) => d > EPS_SURFACE\n    const below = (d: number) => d < -EPS_SURFACE\n    const onSurf = (d: number) => !above(d) && !below(d)\n\n    // 交点插值：在 a、b 边上按距离比例\n    const lerp = (ia: number, ib: number, daa: number, dbb: number): THREE.Vector3 => {\n      const pa = ia === r.a ? va : ia === r.b ? vb : vc\n      const pb = ib === r.a ? va : ib === r.b ? vb : vc\n      const t = daa / (daa - dbb)\n      return new THREE.Vector3().lerpVectors(pa, pb, t)\n    }\n\n    const crossings: THREE.Vector3[] = []\n    if (onSurf(da) && (above(db) !== above(dc) || below(db) !== below(dc))) {\n      crossings.push(va.clone())\n    }\n    if (onSurf(db) && (above(da) !== above(dc) || below(da) !== below(dc))) {\n      crossings.push(vb.clone())\n    }\n    if (onSurf(dc) && (above(da) !== above(db) || below(da) !== below(db))) {\n      crossings.push(vc.clone())\n    }\n    // 纯跨越：异侧顶点两两组合产生 2 个交点\n    const verts = [\n      { i: r.a, d: da, p: va },\n      { i: r.b, d: db, p: vb },\n      { i: r.c, d: dc, p: vc },\n    ]\n    const pos_ = verts.filter((x) => above(x.d) || onSurf(x.d))\n    const neg_ = verts.filter((x) => below(x.d) || onSurf(x.d))\n    // 标准 straddle：恰好 1 顶点在一侧、2 在另一侧 → 两条跨边各一个交点\n    if (pos_.length === 1 && neg_.length === 2) {\n      const p = pos_[0]\n      const [q1, q2] = neg_\n      crossings.push(lerp(p.i, q1.i, p.d, q1.d))\n      crossings.push(lerp(p.i, q2.i, p.d, q2.d))\n    } else if (neg_.length === 1 && pos_.length === 2) {\n      const p = neg_[0]\n      const [q1, q2] = pos_\n      crossings.push(lerp(p.i, q1.i, p.d, q1.d))\n      crossings.push(lerp(p.i, q2.i, p.d, q2.d))\n    }\n    // 去重（同一三角形内重复端点）\n    const uniq: THREE.Vector3[] = []\n    for (const c of crossings) {\n      if (!uniq.some((u) => u.distanceToSquared(c) < 1e-12)) uniq.push(c)\n    }\n    if (uniq.length >= 2) {\n      hitTriangleCount++\n      for (let k = 0; k + 1 < uniq.length; k += 2) {\n        segments.push([uniq[k], uniq[k + 1]])\n      }\n    }\n  }\n\n  const { u, v } = planeBasis(n)\n\n  // 缝合：按量化端点建邻接，沿共享端点 walk 出闭合环\n  const endpoints = new Map<string, Array<{ seg: number; end: 0 | 1 }>>()\n  segments.forEach((seg, si) => {\n    const ka = key2D(project2D(seg[0], u, v))\n    const kb = key2D(project2D(seg[1], u, v))\n    if (!endpoints.has(ka)) endpoints.set(ka, [])\n    if (!endpoints.has(kb)) endpoints.set(kb, [])\n    endpoints.get(ka)!.push({ seg: si, end: 0 })\n    endpoints.get(kb)!.push({ seg: si, end: 1 })\n  })\n\n  const visited = new Set<number>()\n  const loops: THREE.Vector3[][] = []\n  for (let si = 0; si < segments.length; si++) {\n    if (visited.has(si)) continue\n    const loop: THREE.Vector3[] = []\n    const start = segments[si][0]\n    loop.push(start)\n    visited.add(si)\n    let curKey = key2D(project2D(segments[si][1], u, v))\n    const startKey = key2D(project2D(start, u, v))\n    // 防止无限循环\n    let guard = 0\n    const maxSteps = segments.length * 2 + 4\n    while (guard++ < maxSteps) {\n      const cands = endpoints.get(curKey)?.filter((c) => !visited.has(c.seg)) ?? []\n      if (cands.length === 0) break\n      const c = cands[0]\n      const otherEnd = c.end === 0 ? segments[c.seg][1] : segments[c.seg][0]\n      loop.push(otherEnd)\n      visited.add(c.seg)\n      const nk = key2D(project2D(otherEnd, u, v))\n      if (nk === startKey) break\n      curKey = nk\n    }\n    loops.push(loop)\n  }\n\n  // 分类外环/孔环。\n  // 关键：不能单纯按「面积<0 即孔」判断，因为缝合出的环绕序不固定（可能整体 CW）。\n  // 正确做法：以「绝对面积最大的环」为外环基准，其有向面积符号 outerSign 定义外环方向；\n  // 与之同号者为外环、异号者为孔环。这样即使所有环都 CW，最大面积环仍被正确认作外环。\n  const signedArea = (loop: THREE.Vector3[]): number => {\n    let area = 0\n    for (let i = 0; i < loop.length; i++) {\n      const p = project2D(loop[i], u, v)\n      const q = project2D(loop[(i + 1) % loop.length], u, v)\n      area += p.x * q.y - q.x * p.y\n    }\n    return area / 2\n  }\n\n  const areas = loops.map((pts) => signedArea(pts))\n  let maxIdx = 0\n  for (let i = 1; i < areas.length; i++) {\n    if (Math.abs(areas[i]) > Math.abs(areas[maxIdx])) maxIdx = i\n  }\n  const outerSign = areas.length > 0 ? Math.sign(areas[maxIdx]) || 1 : 1\n\n  const rings: SectionRing[] = loops.map((pts, i) => {\n    const isHole = Math.sign(areas[i]) !== outerSign\n    // 统一：外环取 outerSign（CCW），孔环取 -outerSign（CW）\n    const wantSign = isHole ? -outerSign : outerSign\n    const oriented = Math.sign(areas[i]) !== wantSign ? [...pts].reverse() : pts\n    return { points: oriented, isHole }\n  })\n\n  const outers = rings.filter((r) => !r.isHole).map((r) => r.points)\n  const holes = rings.filter((r) => r.isHole).map((r) => r.points)\n\n  // 把孔分给包含其重心的外环\n  const holesOf: THREE.Vector3[][][] = outers.map(() => [])\n  const centroid = (loop: THREE.Vector3[]): THREE.Vector2 => {\n    const c = new THREE.Vector2()\n    for (const p of loop) c.add(project2D(p, u, v))\n    return c.multiplyScalar(1 / Math.max(1, loop.length))\n  }\n  const pointInLoop = (pt: THREE.Vector2, loop: THREE.Vector3[]): boolean => {\n    let inside = false\n    for (let i = 0, j = loop.length - 1; i < loop.length; j = i++) {\n      const a = project2D(loop[i], u, v)\n      const b = project2D(loop[j], u, v)\n      if (a.y > pt.y !== b.y > pt.y && pt.x < ((b.x - a.x) * (pt.y - a.y)) / (b.y - a.y) + a.x) {\n        inside = !inside\n      }\n    }\n    return inside\n  }\n  holes.forEach((h) => {\n    const hc = centroid(h)\n    let assigned = -1\n    for (let oi = 0; oi < outers.length; oi++) {\n      if (pointInLoop(hc, outers[oi])) { assigned = oi; break }\n    }\n    if (assigned < 0) assigned = 0\n    holesOf[assigned].push(h)\n  })\n\n  return { rings, outers, holesOf, hitTriangleCount, segmentCount: segments.length }\n}\n\n/**\n * Build a prism geometry by extruding the section rings along the normal for\n * `length`, starting at `start` (in local space). The output contains the cap\n * triangulation (top/bottom faces) plus the side walls of every boundary loop.\n * It can be fed directly to a THREE.BufferGeometry or converted to ManifoldMeshData.\n *\n * @param section    computeSection result\n * @param normal     Extrusion direction (local space, unit vector)\n * @param length     Extrusion length\n * @param start      Start offset along the normal (centered mode passes offsetBack so the prism spans [offsetBack, offsetFront])\n * @returns Filled position and index buffers describing the extruded prism.\n */\nexport function buildExtrudedProfile(\n  section: SectionResult,\n  normal: THREE.Vector3,\n  length: number,\n  start = 0,\n): { positions: Float32Array; indices: Uint32Array } {\n  const positions: number[] = []\n  const indices: number[] = []\n  const dx = normal.x * length\n  const dy = normal.y * length\n  const dz = normal.z * length\n  const sx = normal.x * start\n  const sy = normal.y * start\n  const sz = normal.z * start\n\n  section.outers.forEach((outer, oi) => {\n    const holeLoops = section.holesOf[oi]\n    // 本组所有边界环（外环在前，孔环随后），顺序即 pts3D 顺序，也是 triangulateShape 的顶点顺序\n    const allLoops: THREE.Vector3[][] = [outer, ...holeLoops]\n    const offsets: number[] = []\n    const pts3D: THREE.Vector3[] = []\n    for (const loop of allLoops) {\n      offsets.push(pts3D.length)\n      pts3D.push(...loop)\n    }\n    const basis = planeBasis(normal)\n    const to2D = (p: THREE.Vector3) => project2D(p, basis.u, basis.v)\n    const tris = THREE.ShapeUtils.triangulateShape(\n      outer.map(to2D),\n      holeLoops.map((h) => h.map(to2D)),\n    )\n    if (!tris || tris.length === 0) return\n\n    const base = positions.length / 3\n    const vCount = pts3D.length\n    // bottom cap（含 start 偏移）\n    for (const p of pts3D) positions.push(p.x + sx, p.y + sy, p.z + sz)\n    for (const t of tris) indices.push(base + t[0], base + t[1], base + t[2])\n    // top cap（reversed winding）\n    const topBase = base + vCount\n    for (const p of pts3D) positions.push(p.x + sx + dx, p.y + sy + dy, p.z + sz + dz)\n    for (const t of tris) indices.push(topBase + t[0], topBase + t[2], topBase + t[1])\n\n    // 侧壁：每个边界环的相邻顶点构成竖直 quad（用环内偏移，避免引用查找）\n    allLoops.forEach((loop, li) => {\n      const off = offsets[li]\n      const len = loop.length\n      for (let k = 0; k < len; k++) {\n        const a = off + k\n        const b = off + ((k + 1) % len)\n        indices.push(base + a, base + b, topBase + b)\n        indices.push(base + a, topBase + b, topBase + a)\n      }\n    })\n  })\n\n  return { positions: new Float32Array(positions), indices: new Uint32Array(indices) }\n}\n"]}

package/dist/boolean/csg-backend.d.ts

@@ -0,0 +1,94 @@
+/**
+ * csg-backend — 可注入的 CSG 后端
+ *
+ * 提供 computeBoolean / computeSplit / computeDovetailSplit / computeDowelSplit / computeStraightTenonSplit
+ * 等异步函数，与 csg.ts 的 API 一致。
+ *
+ * Node 环境：默认使用 InlineCsgBackend（主线程直跑 manifold-3d）。
+ * 浏览器环境：通过 setCsgBackend() 注入 WorkerCsgBackend。
+ *
+ * F1 修复：不静态 import browser-host/inline-csg-backend（L1 不依赖 L3）。
+ * 改为延迟动态 import，仅在未注入后端时按需加载。
+ */
+import type { CsgBackend } from '../cad-runtime/ports.js';
+import type { ManifoldMeshData, BooleanOperation, DovetailGrooveParams, DowelSplitParams, StraightTenonSplitParams } from './geo-convert.js';
+/**
+ * Inject the CSG backend used by the browser host (e.g. WorkerCsgBackend).
+ * @param backend The backend instance to install as the current CSG backend.
+ */
+export declare function setCsgBackend(backend: CsgBackend): void;
+/**
+ * Apply a boolean operation across several meshes via the current backend.
+ * @param meshes    The input meshes to combine.
+ * @param operation The boolean operation to perform (union/subtract/intersect).
+ * @returns The resulting mesh of the boolean operation.
+ */
+export declare function computeBoolean(meshes: ManifoldMeshData[], operation: BooleanOperation): Promise<ManifoldMeshData>;
+/**
+ * Split a mesh by a plane via the current backend.
+ * @param mesh   The mesh to split.
+ * @param normal The plane normal (unit vector).
+ * @param offset The plane offset along the normal.
+ * @returns The front and back halves of the split.
+ */
+export declare function computeSplit(mesh: ManifoldMeshData, normal: [number, number, number], offset: number): Promise<{
+    front: ManifoldMeshData;
+    back: ManifoldMeshData;
+}>;
+/**
+ * Split a mesh by a plane and cut a dovetail groove via the current backend.
+ * @param mesh                The mesh to split.
+ * @param planeNormal         The cutting plane normal (unit vector).
+ * @param planeOriginOffset   The cutting plane offset along the normal.
+ * @param planeCenter         A point on the cutting plane.
+ * @param widthDir            The width direction within the cutting plane (unit vector).
+ * @param bboxWidthOnWidthDir The model bounding-box width along the width direction.
+ * @param groove              The dovetail groove parameters.
+ * @returns The front/back halves plus the wedge mesh (or null when no wedge).
+ */
+export declare function computeDovetailSplit(mesh: ManifoldMeshData, planeNormal: [number, number, number], planeOriginOffset: number, planeCenter: [number, number, number], widthDir: [number, number, number], bboxWidthOnWidthDir: number, groove: DovetailGrooveParams): Promise<{
+    front: ManifoldMeshData;
+    back: ManifoldMeshData;
+    wedge: ManifoldMeshData | null;
+}>;
+/**
+ * Split a mesh by a plane and cut dowel tenons via the current backend.
+ * @param mesh                The mesh to split.
+ * @param planeNormal         The cutting plane normal (unit vector).
+ * @param planeOriginOffset   The cutting plane offset along the normal.
+ * @param planeCenter         A point on the cutting plane.
+ * @param widthDir            The width direction within the cutting plane (unit vector).
+ * @param dowel               The dowel split parameters.
+ * @param selectedSections    Optional list of section indices to place tenons on.
+ * @returns The front/back halves plus the wedge mesh (or null when no wedge).
+ */
+export declare function computeDowelSplit(mesh: ManifoldMeshData, planeNormal: [number, number, number], planeOriginOffset: number, planeCenter: [number, number, number], widthDir: [number, number, number], dowel: DowelSplitParams, selectedSections?: number[] | null): Promise<{
+    front: ManifoldMeshData;
+    back: ManifoldMeshData;
+    wedge: ManifoldMeshData | null;
+}>;
+/**
+ * Split a mesh by a plane and cut straight tenons via the current backend.
+ * @param mesh                The mesh to split.
+ * @param planeNormal         The cutting plane normal (unit vector).
+ * @param planeOriginOffset   The cutting plane offset along the normal.
+ * @param planeCenter         A point on the cutting plane.
+ * @param widthDir            The width direction within the cutting plane (unit vector).
+ * @param tenon               The straight-tenon split parameters.
+ * @param selectedSections    Optional list of section indices to place tenons on.
+ * @returns The front/back halves plus the wedge mesh (or null when no wedge).
+ */
+export declare function computeStraightTenonSplit(mesh: ManifoldMeshData, planeNormal: [number, number, number], planeOriginOffset: number, planeCenter: [number, number, number], widthDir: [number, number, number], tenon: StraightTenonSplitParams, selectedSections?: number[] | null): Promise<{
+    front: ManifoldMeshData;
+    back: ManifoldMeshData;
+    wedge: ManifoldMeshData | null;
+}>;
+/**
+ * Terminate the worker held by the backend, if any.
+ * The InlineCsgBackend owns no worker to terminate; the WorkerCsgBackend
+ * termination logic is managed by the browser host.
+ */
+export declare function terminateWorker(): void;
+export { geoToManifoldMesh, manifoldMeshToGeo } from './geo-convert.js';
+export type { ManifoldMeshData, BooleanOperation, DovetailGrooveParams, DowelSplitParams, StraightTenonSplitParams, } from './geo-convert.js';
+//# sourceMappingURL=csg-backend.d.ts.map

package/dist/boolean/csg-backend.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"csg-backend.d.ts","sourceRoot":"","sources":["../../src/boolean/csg-backend.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAA;AACtD,OAAO,KAAK,EACV,gBAAgB,EAChB,gBAAgB,EAChB,oBAAoB,EACpB,gBAAgB,EAChB,wBAAwB,EACzB,MAAM,eAAe,CAAA;AAMtB;;;GAGG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,UAAU,GAAG,IAAI,CAEvD;AAgBD;;;;;GAKG;AACH,wBAAsB,cAAc,CAClC,MAAM,EAAE,gBAAgB,EAAE,EAC1B,SAAS,EAAE,gBAAgB,GAC1B,OAAO,CAAC,gBAAgB,CAAC,CAG3B;AAED;;;;;;GAMG;AACH,wBAAsB,YAAY,CAChC,IAAI,EAAE,gBAAgB,EACtB,MAAM,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAChC,MAAM,EAAE,MAAM,GACb,OAAO,CAAC;IAAE,KAAK,EAAE,gBAAgB,CAAC;IAAC,IAAI,EAAE,gBAAgB,CAAA;CAAE,CAAC,CAI9D;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,oBAAoB,CACxC,IAAI,EAAE,gBAAgB,EACtB,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EACrC,iBAAiB,EAAE,MAAM,EACzB,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EACrC,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAClC,mBAAmB,EAAE,MAAM,EAC3B,MAAM,EAAE,oBAAoB,GAC3B,OAAO,CAAC;IAAE,KAAK,EAAE,gBAAgB,CAAC;IAAC,IAAI,EAAE,gBAAgB,CAAC;IAAC,KAAK,EAAE,gBAAgB,GAAG,IAAI,CAAA;CAAE,CAAC,CAW9F;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,iBAAiB,CACrC,IAAI,EAAE,gBAAgB,EACtB,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EACrC,iBAAiB,EAAE,MAAM,EACzB,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EACrC,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAClC,KAAK,EAAE,gBAAgB,EACvB,gBAAgB,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,GACjC,OAAO,CAAC;IAAE,KAAK,EAAE,gBAAgB,CAAC;IAAC,IAAI,EAAE,gBAAgB,CAAC;IAAC,KAAK,EAAE,gBAAgB,GAAG,IAAI,CAAA;CAAE,CAAC,CAW9F;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,yBAAyB,CAC7C,IAAI,EAAE,gBAAgB,EACtB,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EACrC,iBAAiB,EAAE,MAAM,EACzB,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EACrC,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAClC,KAAK,EAAE,wBAAwB,EAC/B,gBAAgB,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,GACjC,OAAO,CAAC;IAAE,KAAK,EAAE,gBAAgB,CAAC;IAAC,IAAI,EAAE,gBAAgB,CAAC;IAAC,KAAK,EAAE,gBAAgB,GAAG,IAAI,CAAA;CAAE,CAAC,CAW9F;AAED;;;;GAIG;AACH,wBAAgB,eAAe,IAAI,IAAI,CAGtC;AAID,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAA;AAIpE,YAAY,EACV,gBAAgB,EAChB,gBAAgB,EAChB,oBAAoB,EACpB,gBAAgB,EAChB,wBAAwB,GACzB,MAAM,eAAe,CAAA"}

package/dist/boolean/csg-backend.js

@@ -0,0 +1,137 @@
+/**
+ * csg-backend — 可注入的 CSG 后端
+ *
+ * 提供 computeBoolean / computeSplit / computeDovetailSplit / computeDowelSplit / computeStraightTenonSplit
+ * 等异步函数，与 csg.ts 的 API 一致。
+ *
+ * Node 环境：默认使用 InlineCsgBackend（主线程直跑 manifold-3d）。
+ * 浏览器环境：通过 setCsgBackend() 注入 WorkerCsgBackend。
+ *
+ * F1 修复：不静态 import browser-host/inline-csg-backend（L1 不依赖 L3）。
+ * 改为延迟动态 import，仅在未注入后端时按需加载。
+ */
+// ── 后端实例管理 ──
+let _backend = null;
+/**
+ * Inject the CSG backend used by the browser host (e.g. WorkerCsgBackend).
+ * @param backend The backend instance to install as the current CSG backend.
+ */
+export function setCsgBackend(backend) {
+    _backend = backend;
+}
+/**
+ * 获取当前 CSG 后端。
+ * F1 修复：延迟动态 import InlineCsgBackend，避免 L1 静态依赖 L3。
+ */
+async function getBackend() {
+    if (_backend)
+        return _backend;
+    // 延迟加载——仅在实际需要时才拉入 L3 代码
+    const { InlineCsgBackend } = await import('../browser-host/inline-csg-backend.js');
+    _backend = new InlineCsgBackend();
+    return _backend;
+}
+// ── CSG 操作 API（与 csg.ts 签名一致）──
+/**
+ * Apply a boolean operation across several meshes via the current backend.
+ * @param meshes    The input meshes to combine.
+ * @param operation The boolean operation to perform (union/subtract/intersect).
+ * @returns The resulting mesh of the boolean operation.
+ */
+export async function computeBoolean(meshes, operation) {
+    const backend = await getBackend();
+    return backend.boolean(operation, meshes);
+}
+/**
+ * Split a mesh by a plane via the current backend.
+ * @param mesh   The mesh to split.
+ * @param normal The plane normal (unit vector).
+ * @param offset The plane offset along the normal.
+ * @returns The front and back halves of the split.
+ */
+export async function computeSplit(mesh, normal, offset) {
+    const backend = await getBackend();
+    const result = await backend.splitPlane(mesh, { normal, offset });
+    return { front: result.front, back: result.back };
+}
+/**
+ * Split a mesh by a plane and cut a dovetail groove via the current backend.
+ * @param mesh                The mesh to split.
+ * @param planeNormal         The cutting plane normal (unit vector).
+ * @param planeOriginOffset   The cutting plane offset along the normal.
+ * @param planeCenter         A point on the cutting plane.
+ * @param widthDir            The width direction within the cutting plane (unit vector).
+ * @param bboxWidthOnWidthDir The model bounding-box width along the width direction.
+ * @param groove              The dovetail groove parameters.
+ * @returns The front/back halves plus the wedge mesh (or null when no wedge).
+ */
+export async function computeDovetailSplit(mesh, planeNormal, planeOriginOffset, planeCenter, widthDir, bboxWidthOnWidthDir, groove) {
+    const backend = await getBackend();
+    const result = await backend.splitDovetail(mesh, {
+        planeNormal,
+        planeOriginOffset,
+        planeCenter,
+        widthDir,
+        bboxWidthOnWidthDir,
+        groove,
+    });
+    return { front: result.front, back: result.back, wedge: result.wedge };
+}
+/**
+ * Split a mesh by a plane and cut dowel tenons via the current backend.
+ * @param mesh                The mesh to split.
+ * @param planeNormal         The cutting plane normal (unit vector).
+ * @param planeOriginOffset   The cutting plane offset along the normal.
+ * @param planeCenter         A point on the cutting plane.
+ * @param widthDir            The width direction within the cutting plane (unit vector).
+ * @param dowel               The dowel split parameters.
+ * @param selectedSections    Optional list of section indices to place tenons on.
+ * @returns The front/back halves plus the wedge mesh (or null when no wedge).
+ */
+export async function computeDowelSplit(mesh, planeNormal, planeOriginOffset, planeCenter, widthDir, dowel, selectedSections) {
+    const backend = await getBackend();
+    const result = await backend.splitDowel(mesh, {
+        planeNormal,
+        planeOriginOffset,
+        planeCenter,
+        widthDir,
+        dowel,
+        selectedSections,
+    });
+    return { front: result.front, back: result.back, wedge: result.wedge };
+}
+/**
+ * Split a mesh by a plane and cut straight tenons via the current backend.
+ * @param mesh                The mesh to split.
+ * @param planeNormal         The cutting plane normal (unit vector).
+ * @param planeOriginOffset   The cutting plane offset along the normal.
+ * @param planeCenter         A point on the cutting plane.
+ * @param widthDir            The width direction within the cutting plane (unit vector).
+ * @param tenon               The straight-tenon split parameters.
+ * @param selectedSections    Optional list of section indices to place tenons on.
+ * @returns The front/back halves plus the wedge mesh (or null when no wedge).
+ */
+export async function computeStraightTenonSplit(mesh, planeNormal, planeOriginOffset, planeCenter, widthDir, tenon, selectedSections) {
+    const backend = await getBackend();
+    const result = await backend.splitStraightTenon(mesh, {
+        planeNormal,
+        planeOriginOffset,
+        planeCenter,
+        widthDir,
+        tenon,
+        selectedSections,
+    });
+    return { front: result.front, back: result.back, wedge: result.wedge };
+}
+/**
+ * Terminate the worker held by the backend, if any.
+ * The InlineCsgBackend owns no worker to terminate; the WorkerCsgBackend
+ * termination logic is managed by the browser host.
+ */
+export function terminateWorker() {
+    // InlineCsgBackend has no worker to terminate
+    // WorkerCsgBackend termination is managed by the browser host
+}
+// ── 纯函数重导出（从 geo-convert）──
+export { geoToManifoldMesh, manifoldMeshToGeo } from './geo-convert.js';
+//# sourceMappingURL=csg-backend.js.map

package/dist/boolean/csg-backend.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"csg-backend.js","sourceRoot":"","sources":["../../src/boolean/csg-backend.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAWH,eAAe;AAEf,IAAI,QAAQ,GAAsB,IAAI,CAAA;AAEtC;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,OAAmB;IAC/C,QAAQ,GAAG,OAAO,CAAA;AACpB,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,UAAU;IACvB,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAA;IAC7B,yBAAyB;IACzB,MAAM,EAAE,gBAAgB,EAAE,GAAG,MAAM,MAAM,CAAC,oCAAoC,CAAC,CAAA;IAC/E,QAAQ,GAAG,IAAI,gBAAgB,EAAE,CAAA;IACjC,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED,iCAAiC;AAEjC;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,MAA0B,EAC1B,SAA2B;IAE3B,MAAM,OAAO,GAAG,MAAM,UAAU,EAAE,CAAA;IAClC,OAAO,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,CAAA;AAC3C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,IAAsB,EACtB,MAAgC,EAChC,MAAc;IAEd,MAAM,OAAO,GAAG,MAAM,UAAU,EAAE,CAAA;IAClC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;IACjE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAA;AACnD,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,IAAsB,EACtB,WAAqC,EACrC,iBAAyB,EACzB,WAAqC,EACrC,QAAkC,EAClC,mBAA2B,EAC3B,MAA4B;IAE5B,MAAM,OAAO,GAAG,MAAM,UAAU,EAAE,CAAA;IAClC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,aAAa,CAAC,IAAI,EAAE;QAC/C,WAAW;QACX,iBAAiB;QACjB,WAAW;QACX,QAAQ;QACR,mBAAmB;QACnB,MAAM;KACP,CAAC,CAAA;IACF,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAA;AACxE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,IAAsB,EACtB,WAAqC,EACrC,iBAAyB,EACzB,WAAqC,EACrC,QAAkC,EAClC,KAAuB,EACvB,gBAAkC;IAElC,MAAM,OAAO,GAAG,MAAM,UAAU,EAAE,CAAA;IAClC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE;QAC5C,WAAW;QACX,iBAAiB;QACjB,WAAW;QACX,QAAQ;QACR,KAAK;QACL,gBAAgB;KACjB,CAAC,CAAA;IACF,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAA;AACxE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAC7C,IAAsB,EACtB,WAAqC,EACrC,iBAAyB,EACzB,WAAqC,EACrC,QAAkC,EAClC,KAA+B,EAC/B,gBAAkC;IAElC,MAAM,OAAO,GAAG,MAAM,UAAU,EAAE,CAAA;IAClC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,kBAAkB,CAAC,IAAI,EAAE;QACpD,WAAW;QACX,iBAAiB;QACjB,WAAW;QACX,QAAQ;QACR,KAAK;QACL,gBAAgB;KACjB,CAAC,CAAA;IACF,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAA;AACxE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe;IAC7B,8CAA8C;IAC9C,8DAA8D;AAChE,CAAC;AAED,6BAA6B;AAE7B,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAA","sourcesContent":["/**\n * csg-backend — 可注入的 CSG 后端\n *\n * 提供 computeBoolean / computeSplit / computeDovetailSplit / computeDowelSplit / computeStraightTenonSplit\n * 等异步函数，与 csg.ts 的 API 一致。\n *\n * Node 环境：默认使用 InlineCsgBackend（主线程直跑 manifold-3d）。\n * 浏览器环境：通过 setCsgBackend() 注入 WorkerCsgBackend。\n *\n * F1 修复：不静态 import browser-host/inline-csg-backend（L1 不依赖 L3）。\n * 改为延迟动态 import，仅在未注入后端时按需加载。\n */\n\nimport type { CsgBackend } from '../cad-runtime/ports'\nimport type {\n  ManifoldMeshData,\n  BooleanOperation,\n  DovetailGrooveParams,\n  DowelSplitParams,\n  StraightTenonSplitParams,\n} from './geo-convert'\n\n// ── 后端实例管理 ──\n\nlet _backend: CsgBackend | null = null\n\n/**\n * Inject the CSG backend used by the browser host (e.g. WorkerCsgBackend).\n * @param backend The backend instance to install as the current CSG backend.\n */\nexport function setCsgBackend(backend: CsgBackend): void {\n  _backend = backend\n}\n\n/**\n * 获取当前 CSG 后端。\n * F1 修复：延迟动态 import InlineCsgBackend，避免 L1 静态依赖 L3。\n */\nasync function getBackend(): Promise<CsgBackend> {\n  if (_backend) return _backend\n  // 延迟加载——仅在实际需要时才拉入 L3 代码\n  const { InlineCsgBackend } = await import('../browser-host/inline-csg-backend')\n  _backend = new InlineCsgBackend()\n  return _backend\n}\n\n// ── CSG 操作 API（与 csg.ts 签名一致）──\n\n/**\n * Apply a boolean operation across several meshes via the current backend.\n * @param meshes    The input meshes to combine.\n * @param operation The boolean operation to perform (union/subtract/intersect).\n * @returns The resulting mesh of the boolean operation.\n */\nexport async function computeBoolean(\n  meshes: ManifoldMeshData[],\n  operation: BooleanOperation,\n): Promise<ManifoldMeshData> {\n  const backend = await getBackend()\n  return backend.boolean(operation, meshes)\n}\n\n/**\n * Split a mesh by a plane via the current backend.\n * @param mesh   The mesh to split.\n * @param normal The plane normal (unit vector).\n * @param offset The plane offset along the normal.\n * @returns The front and back halves of the split.\n */\nexport async function computeSplit(\n  mesh: ManifoldMeshData,\n  normal: [number, number, number],\n  offset: number,\n): Promise<{ front: ManifoldMeshData; back: ManifoldMeshData }> {\n  const backend = await getBackend()\n  const result = await backend.splitPlane(mesh, { normal, offset })\n  return { front: result.front, back: result.back }\n}\n\n/**\n * Split a mesh by a plane and cut a dovetail groove via the current backend.\n * @param mesh                The mesh to split.\n * @param planeNormal         The cutting plane normal (unit vector).\n * @param planeOriginOffset   The cutting plane offset along the normal.\n * @param planeCenter         A point on the cutting plane.\n * @param widthDir            The width direction within the cutting plane (unit vector).\n * @param bboxWidthOnWidthDir The model bounding-box width along the width direction.\n * @param groove              The dovetail groove parameters.\n * @returns The front/back halves plus the wedge mesh (or null when no wedge).\n */\nexport async function computeDovetailSplit(\n  mesh: ManifoldMeshData,\n  planeNormal: [number, number, number],\n  planeOriginOffset: number,\n  planeCenter: [number, number, number],\n  widthDir: [number, number, number],\n  bboxWidthOnWidthDir: number,\n  groove: DovetailGrooveParams,\n): Promise<{ front: ManifoldMeshData; back: ManifoldMeshData; wedge: ManifoldMeshData | null }> {\n  const backend = await getBackend()\n  const result = await backend.splitDovetail(mesh, {\n    planeNormal,\n    planeOriginOffset,\n    planeCenter,\n    widthDir,\n    bboxWidthOnWidthDir,\n    groove,\n  })\n  return { front: result.front, back: result.back, wedge: result.wedge }\n}\n\n/**\n * Split a mesh by a plane and cut dowel tenons via the current backend.\n * @param mesh                The mesh to split.\n * @param planeNormal         The cutting plane normal (unit vector).\n * @param planeOriginOffset   The cutting plane offset along the normal.\n * @param planeCenter         A point on the cutting plane.\n * @param widthDir            The width direction within the cutting plane (unit vector).\n * @param dowel               The dowel split parameters.\n * @param selectedSections    Optional list of section indices to place tenons on.\n * @returns The front/back halves plus the wedge mesh (or null when no wedge).\n */\nexport async function computeDowelSplit(\n  mesh: ManifoldMeshData,\n  planeNormal: [number, number, number],\n  planeOriginOffset: number,\n  planeCenter: [number, number, number],\n  widthDir: [number, number, number],\n  dowel: DowelSplitParams,\n  selectedSections?: number[] | null,\n): Promise<{ front: ManifoldMeshData; back: ManifoldMeshData; wedge: ManifoldMeshData | null }> {\n  const backend = await getBackend()\n  const result = await backend.splitDowel(mesh, {\n    planeNormal,\n    planeOriginOffset,\n    planeCenter,\n    widthDir,\n    dowel,\n    selectedSections,\n  })\n  return { front: result.front, back: result.back, wedge: result.wedge }\n}\n\n/**\n * Split a mesh by a plane and cut straight tenons via the current backend.\n * @param mesh                The mesh to split.\n * @param planeNormal         The cutting plane normal (unit vector).\n * @param planeOriginOffset   The cutting plane offset along the normal.\n * @param planeCenter         A point on the cutting plane.\n * @param widthDir            The width direction within the cutting plane (unit vector).\n * @param tenon               The straight-tenon split parameters.\n * @param selectedSections    Optional list of section indices to place tenons on.\n * @returns The front/back halves plus the wedge mesh (or null when no wedge).\n */\nexport async function computeStraightTenonSplit(\n  mesh: ManifoldMeshData,\n  planeNormal: [number, number, number],\n  planeOriginOffset: number,\n  planeCenter: [number, number, number],\n  widthDir: [number, number, number],\n  tenon: StraightTenonSplitParams,\n  selectedSections?: number[] | null,\n): Promise<{ front: ManifoldMeshData; back: ManifoldMeshData; wedge: ManifoldMeshData | null }> {\n  const backend = await getBackend()\n  const result = await backend.splitStraightTenon(mesh, {\n    planeNormal,\n    planeOriginOffset,\n    planeCenter,\n    widthDir,\n    tenon,\n    selectedSections,\n  })\n  return { front: result.front, back: result.back, wedge: result.wedge }\n}\n\n/**\n * Terminate the worker held by the backend, if any.\n * The InlineCsgBackend owns no worker to terminate; the WorkerCsgBackend\n * termination logic is managed by the browser host.\n */\nexport function terminateWorker(): void {\n  // InlineCsgBackend has no worker to terminate\n  // WorkerCsgBackend termination is managed by the browser host\n}\n\n// ── 纯函数重导出（从 geo-convert）──\n\nexport { geoToManifoldMesh, manifoldMeshToGeo } from './geo-convert'\n\n// ── 类型重导出 ──\n\nexport type {\n  ManifoldMeshData,\n  BooleanOperation,\n  DovetailGrooveParams,\n  DowelSplitParams,\n  StraightTenonSplitParams,\n} from './geo-convert'\n"]}