build-dxf 0.0.20-25 → 0.0.20-26

package/src/build.js

@@ -207,8 +207,8 @@ class f {
    * @param angle 旋转角度，单位为弧度
    */
   rotate(t, e) {
-    const n = this.x - t.x, i = this.y - t.y, s = Math.cos(e), o = Math.sin(e), r = n * s - i * o, c = n * o + i * s;
-    return this.x = r + t.x, this.y = c + t.y, this;
+    const n = this.x - t.x, i = this.y - t.y, s = Math.cos(e), o = Math.sin(e), r = n * s - i * o, a = n * o + i * s;
+    return this.x = r + t.x, this.y = a + t.y, this;
   }
   /**
    * 保留小数位数
@@ -279,8 +279,8 @@ class f {
   angleBetween(t, e = "radian", n = "180") {
     const i = this.dot(t), s = this.magnitude(), o = t.magnitude();
     if (s === 0 || o === 0) return 0;
-    const r = i / (s * o), c = Math.max(-1, Math.min(1, r));
-    return e === "radian" ? Math.acos(c) : e === "cos" ? c : n === "180" || this.cross(t) < 0 ? Math.acos(c) / (Math.PI / 180) : 360 - Math.acos(c) / (Math.PI / 180);
+    const r = i / (s * o), a = Math.max(-1, Math.min(1, r));
+    return e === "radian" ? Math.acos(a) : e === "cos" ? a : n === "180" || this.cross(t) < 0 ? Math.acos(a) / (Math.PI / 180) : 360 - Math.acos(a) / (Math.PI / 180);
   }
   /** 获取向量长度
    */
@@ -376,13 +376,13 @@ class v {
       return this.minX <= e.x && e.x <= this.maxX && this.minY <= e.y && e.y <= this.maxY;
     let o = Number.NEGATIVE_INFINITY, r = Number.POSITIVE_INFINITY;
     if (i !== 0) {
-      const c = (this.minX - e.x) / i, a = (this.maxX - e.x) / i;
-      o = Math.max(o, Math.min(c, a)), r = Math.min(r, Math.max(c, a));
+      const a = (this.minX - e.x) / i, c = (this.maxX - e.x) / i;
+      o = Math.max(o, Math.min(a, c)), r = Math.min(r, Math.max(a, c));
     } else if (e.x < this.minX || e.x > this.maxX)
       return !1;
     if (s !== 0) {
-      const c = (this.minY - e.y) / s, a = (this.maxY - e.y) / s;
-      o = Math.max(o, Math.min(c, a)), r = Math.min(r, Math.max(c, a));
+      const a = (this.minY - e.y) / s, c = (this.maxY - e.y) / s;
+      o = Math.max(o, Math.min(a, c)), r = Math.min(r, Math.max(a, c));
     } else if (e.y < this.minY || e.y > this.maxY)
       return !1;
     return o <= r && o <= 1 && r >= 0;
@@ -402,10 +402,10 @@ class v {
   intersectRectangle(t) {
     const e = (o) => this.minX <= o.x && o.x <= this.maxX && this.minY <= o.y && o.y <= this.maxY, n = (o) => {
       let r = 0;
-      for (let c = 0; c < 4; c++) {
-        const a = t.points[c], h = t.points[(c + 1) % 4], l = { x: h.x - a.x, y: h.y - a.y }, d = { x: o.x - a.x, y: o.y - a.y }, p = l.x * d.y - l.y * d.x;
+      for (let a = 0; a < 4; a++) {
+        const c = t.points[a], h = t.points[(a + 1) % 4], l = { x: h.x - c.x, y: h.y - c.y }, d = { x: o.x - c.x, y: o.y - c.y }, p = l.x * d.y - l.y * d.x;
         if (p === 0) {
-          const m = l.x !== 0 ? (o.x - a.x) / l.x : (o.y - a.y) / l.y;
+          const m = l.x !== 0 ? (o.x - c.x) / l.x : (o.y - c.y) / l.y;
           if (m >= 0 && m <= 1) return !0;
         } else {
           const m = p > 0 ? 1 : -1;
@@ -413,18 +413,18 @@ class v {
         }
       }
       return !0;
-    }, i = (o, r, c, a) => {
+    }, i = (o, r, a, c) => {
       const h = (u, x, w) => {
         const S = (x.y - u.y) * (w.x - x.x) - (x.x - u.x) * (w.y - x.y);
         return S === 0 ? 0 : S > 0 ? 1 : 2;
-      }, l = (u, x, w) => Math.min(u.x, w.x) <= x.x && x.x <= Math.max(u.x, w.x) && Math.min(u.y, w.y) <= x.y && x.y <= Math.max(u.y, w.y), d = h(o, r, c), p = h(o, r, a), m = h(c, a, o), g = h(c, a, r);
-      return !!(d !== p && m !== g || d === 0 && l(o, c, r) || p === 0 && l(o, a, r) || m === 0 && l(c, o, a) || g === 0 && l(c, r, a));
+      }, l = (u, x, w) => Math.min(u.x, w.x) <= x.x && x.x <= Math.max(u.x, w.x) && Math.min(u.y, w.y) <= x.y && x.y <= Math.max(u.y, w.y), d = h(o, r, a), p = h(o, r, c), m = h(a, c, o), g = h(a, c, r);
+      return !!(d !== p && m !== g || d === 0 && l(o, a, r) || p === 0 && l(o, c, r) || m === 0 && l(a, o, c) || g === 0 && l(a, r, c));
     }, s = this.points;
     for (let o = 0; o < 4; o++) {
-      const r = s[o], c = s[(o + 1) % 4];
-      for (let a = 0; a < 4; a++) {
-        const h = t.points[a], l = t.points[(a + 1) % 4];
-        if (i(r, c, h, l)) return !0;
+      const r = s[o], a = s[(o + 1) % 4];
+      for (let c = 0; c < 4; c++) {
+        const h = t.points[c], l = t.points[(c + 1) % 4];
+        if (i(r, a, h, l)) return !0;
       }
     }
     for (let o of t.points)
@@ -519,13 +519,13 @@ class v {
     );
   }
 }
-function z(y) {
+function V(y) {
   if (y === null || typeof y != "object") return y;
   if (y instanceof Date) return new Date(y.getTime());
-  if (Array.isArray(y)) return y.map(z);
+  if (Array.isArray(y)) return y.map(V);
   const t = {};
   for (const e in y)
-    Object.prototype.hasOwnProperty.call(y, e) && (t[e] = z(y[e]));
+    Object.prototype.hasOwnProperty.call(y, e) && (t[e] = V(y[e]));
   return t;
 }
 class O {
@@ -577,12 +577,12 @@ class O {
   intersectLineSegment(t) {
     if (t.points.length !== 2)
       throw new Error("LineSegment must have exactly 2 points");
-    const [e, n] = t.points, i = (s, o, r, c) => {
-      const a = (g, u, x) => {
+    const [e, n] = t.points, i = (s, o, r, a) => {
+      const c = (g, u, x) => {
         const w = (u.y - g.y) * (x.x - u.x) - (u.x - g.x) * (x.y - u.y);
         return w === 0 ? 0 : w > 0 ? 1 : 2;
-      }, h = (g, u, x) => Math.min(g.x, x.x) <= u.x && u.x <= Math.max(g.x, x.x) && Math.min(g.y, x.y) <= u.y && u.y <= Math.max(g.y, x.y), l = a(s, o, r), d = a(s, o, c), p = a(r, c, s), m = a(r, c, o);
-      return !!(l !== d && p !== m || l === 0 && h(s, r, o) || d === 0 && h(s, c, o) || p === 0 && h(r, s, c) || m === 0 && h(r, o, c));
+      }, h = (g, u, x) => Math.min(g.x, x.x) <= u.x && u.x <= Math.max(g.x, x.x) && Math.min(g.y, x.y) <= u.y && u.y <= Math.max(g.y, x.y), l = c(s, o, r), d = c(s, o, a), p = c(r, a, s), m = c(r, a, o);
+      return !!(l !== d && p !== m || l === 0 && h(s, r, o) || d === 0 && h(s, a, o) || p === 0 && h(r, s, a) || m === 0 && h(r, o, a));
     };
     for (let s = 0; s < 4; s++) {
       const o = this.points[s], r = this.points[(s + 1) % 4];
@@ -602,9 +602,9 @@ class O {
     const e = (n) => {
       let i = 0;
       for (let s = 0; s < 4; s++) {
-        const o = this.points[s], r = this.points[(s + 1) % 4], c = { x: r.x - o.x, y: r.y - o.y }, a = { x: n.x - o.x, y: n.y - o.y }, h = c.x * a.y - c.y * a.x;
+        const o = this.points[s], r = this.points[(s + 1) % 4], a = { x: r.x - o.x, y: r.y - o.y }, c = { x: n.x - o.x, y: n.y - o.y }, h = a.x * c.y - a.y * c.x;
         if (h === 0) {
-          const l = c.x !== 0 ? (n.x - o.x) / c.x : (n.y - o.y) / c.y;
+          const l = a.x !== 0 ? (n.x - o.x) / a.x : (n.y - o.y) / a.y;
           if (l >= 0 && l <= 1) return !0;
         } else {
           const l = h > 0 ? 1 : -1;
@@ -632,7 +632,7 @@ class O {
       e.push(o.normal(r));
     }
     function n(s, o) {
-      const r = s.points.map((c) => c.dot(o));
+      const r = s.points.map((a) => a.dot(o));
       return [Math.min(...r), Math.max(...r)];
     }
     function i(s, o) {
@@ -676,16 +676,16 @@ class O {
    * @returns 
    */
   static fromByLineSegment(t, e = 0.1, n = !1, i = 0.5) {
-    const s = t.points[0], o = t.points[1], r = o.normal(s), c = n ? o.direction(s).mutiplyScalar(e * i) : f.zero(), a = n ? s.direction(o).mutiplyScalar(e * i) : f.zero(), h = r.x * e * 0.5, l = r.y * e * 0.5;
+    const s = t.points[0], o = t.points[1], r = o.normal(s), a = n ? o.direction(s).mutiplyScalar(e * i) : f.zero(), c = n ? s.direction(o).mutiplyScalar(e * i) : f.zero(), h = r.x * e * 0.5, l = r.y * e * 0.5;
     return new O([
-      new f(s.x + h, s.y + l).add(a),
-      new f(o.x + h, o.y + l).add(c),
-      new f(o.x - h, o.y - l).add(c),
-      new f(s.x - h, s.y - l).add(a)
+      new f(s.x + h, s.y + l).add(c),
+      new f(o.x + h, o.y + l).add(a),
+      new f(o.x - h, o.y - l).add(a),
+      new f(s.x - h, s.y - l).add(c)
     ]);
   }
 }
-class b {
+class L {
   points = [new f(), new f()];
   userData = {};
   line;
@@ -770,13 +770,13 @@ class b {
    * @returns {Rectangle}
    */
   expandToRectangle(t = 0.1, e = "all") {
-    const n = this.start, i = this.end, s = i.normal(n), o = e === "bothSides" ? f.zero() : i.direction(n).mutiplyScalar(t * 0.5), r = e === "bothSides" ? f.zero() : n.direction(i).mutiplyScalar(t * 0.5), c = s.x * t * 0.5, a = s.y * t * 0.5, h = [
+    const n = this.start, i = this.end, s = i.normal(n), o = e === "bothSides" ? f.zero() : i.direction(n).mutiplyScalar(t * 0.5), r = e === "bothSides" ? f.zero() : n.direction(i).mutiplyScalar(t * 0.5), a = s.x * t * 0.5, c = s.y * t * 0.5, h = [
       // 第一条线
-      new f(n.x + c, n.y + a).add(r),
-      new f(i.x + c, i.y + a).add(o),
+      new f(n.x + a, n.y + c).add(r),
+      new f(i.x + a, i.y + c).add(o),
       // 第二条线
-      new f(n.x - c, n.y - a).add(r),
-      new f(i.x - c, i.y - a).add(o)
+      new f(n.x - a, n.y - c).add(r),
+      new f(i.x - a, i.y - c).add(o)
     ];
     return new O([0, 1, 3, 2].map((l) => h[l]));
   }
@@ -819,20 +819,20 @@ class b {
     if (o.x === 0 && o.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     const r = (m) => {
-      const g = new f(m.x - i.x, m.y - i.y), u = o.x * o.x + o.y * o.y, w = (g.x * o.x + g.y * o.y) / u, S = i.x + w * o.x, L = i.y + w * o.y;
-      return new f(S, L);
+      const g = new f(m.x - i.x, m.y - i.y), u = o.x * o.x + o.y * o.y, w = (g.x * o.x + g.y * o.y) / u, S = i.x + w * o.x, b = i.y + w * o.y;
+      return new f(S, b);
     };
-    let c = r(e), a = r(n);
+    let a = r(e), c = r(n);
     const h = (m) => {
       const g = new f(m.x - i.x, m.y - i.y), u = o.x * o.x + o.y * o.y;
       return (g.x * o.x + g.y * o.y) / u;
     };
-    let l = h(c), d = h(a);
+    let l = h(a), d = h(c);
     const p = (m) => {
       const g = Math.max(0, Math.min(1, m)), u = i.x + g * o.x, x = i.y + g * o.y;
       return new f(u, x);
     };
-    return (l < 0 || l > 1) && (c = p(l)), (d < 0 || d > 1) && (a = p(d)), c.x === a.x && c.y === a.y ? new b(c, c) : new b(c, a);
+    return (l < 0 || l > 1) && (a = p(l)), (d < 0 || d > 1) && (c = p(d)), a.x === c.x && a.y === c.y ? new L(a, a) : new L(a, c);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -849,11 +849,11 @@ class b {
       return new f(g, u);
     })(t);
     if (!e) return r;
-    let a = ((h) => {
+    let c = ((h) => {
       const l = new f(h.x - n.x, h.y - n.y), d = s.x * s.x + s.y * s.y;
       return (l.x * s.x + l.y * s.y) / d;
     })(r);
-    return a < 0 || a > 1 ? null : r;
+    return c < 0 || c > 1 ? null : r;
   }
   /**
    * 判断线段是否与另一条线段相交（包含共用端点或部分重合的情况）
@@ -867,8 +867,8 @@ class b {
     function r(d, p, m) {
       return Math.min(p.x, m.x) - 1e-10 <= d.x && d.x <= Math.max(p.x, m.x) + 1e-10 && Math.min(p.y, m.y) - 1e-10 <= d.y && d.y <= Math.max(p.y, m.y) + 1e-10;
     }
-    const c = o(e, n, i), a = o(e, n, s), h = o(i, s, e), l = o(i, s, n);
-    return !!(c * a < 0 && h * l < 0 || Math.abs(c) < 1e-10 && r(i, e, n) || Math.abs(a) < 1e-10 && r(s, e, n) || Math.abs(h) < 1e-10 && r(e, i, s) || Math.abs(l) < 1e-10 && r(n, i, s));
+    const a = o(e, n, i), c = o(e, n, s), h = o(i, s, e), l = o(i, s, n);
+    return !!(a * c < 0 && h * l < 0 || Math.abs(a) < 1e-10 && r(i, e, n) || Math.abs(c) < 1e-10 && r(s, e, n) || Math.abs(h) < 1e-10 && r(e, i, s) || Math.abs(l) < 1e-10 && r(n, i, s));
   }
   /**
    * 获取交点
@@ -879,8 +879,8 @@ class b {
     const e = this.start, n = this.end, i = t.start, s = t.end, o = (e.x - n.x) * (i.y - s.y) - (e.y - n.y) * (i.x - s.x);
     if (Math.abs(o) < 1e-10)
       return null;
-    const r = ((e.x - i.x) * (i.y - s.y) - (e.y - i.y) * (i.x - s.x)) / o, c = e.x + r * (n.x - e.x), a = e.y + r * (n.y - e.y);
-    return new f(c, a);
+    const r = ((e.x - i.x) * (i.y - s.y) - (e.y - i.y) * (i.x - s.x)) / o, a = e.x + r * (n.x - e.x), c = e.y + r * (n.y - e.y);
+    return new f(a, c);
   }
   /**
    * 获取两条线段夹角
@@ -918,11 +918,11 @@ class b {
    * @returns 
    */
   areLinesCoincident(t) {
-    const e = this.start, n = this.end, i = t.start, s = t.end, o = (n.y - e.y) / (n.x - e.x), r = e.y - o * e.x, c = (s.y - i.y) / (s.x - i.x), a = i.y - c * i.x;
-    return !isFinite(o) && !isFinite(c) ? e.x === i.x && n.x === i.x : Math.abs(o - c) < 1e-3 && Math.abs(r - a) < 1e-3;
+    const e = this.start, n = this.end, i = t.start, s = t.end, o = (n.y - e.y) / (n.x - e.x), r = e.y - o * e.x, a = (s.y - i.y) / (s.x - i.x), c = i.y - a * i.x;
+    return !isFinite(o) && !isFinite(a) ? e.x === i.x && n.x === i.x : Math.abs(o - a) < 1e-3 && Math.abs(r - c) < 1e-3;
   }
   clone() {
-    const t = new b(
+    const t = new L(
       this.points[0].clone(),
       this.points[1].clone()
     );
@@ -987,7 +987,7 @@ const st = {
 function k(y) {
   const t = [];
   for (let e = 0; e < y.length; e++)
-    t.push(new b(
+    t.push(new L(
       y[e].clone(),
       y[(e + 1) % y.length].clone()
     ));
@@ -1048,23 +1048,23 @@ class X extends j {
         const { default: o } = await import(
           /* @vite-ignore */
           "fs"
-        ), r = o.readFileSync(t), c = JSON.parse(r.toString("utf-8"));
-        return this.set(c, e, n);
+        ), r = o.readFileSync(t), a = JSON.parse(r.toString("utf-8"));
+        return this.set(a, e, n);
       } else
         throw new Error("非node环境不允许使用路径");
     this.scale = n, this.width = e, this.originalData = t, this.lineSegments.length = 0;
     const i = [];
-    this.data = t.map(({ start: s, end: o, insetionArr: r, isDoor: c = !1, ...a }, h) => {
+    this.data = t.map(({ start: s, end: o, insetionArr: r, isDoor: a = !1, ...c }, h) => {
       i.push(s.z ?? 0, o.z ?? 0);
-      const l = new b(
+      const l = new L(
         f.from(s).mutiplyScalar(n),
         f.from(o).mutiplyScalar(n)
       );
-      return l.userData = { isDoor: c, ...a }, this.lineSegments.push(l), [
+      return l.userData = { isDoor: a, ...c }, this.lineSegments.push(l), [
         l.points[0],
         l.points[1],
         (r ?? []).map((d) => d.index),
-        c,
+        a,
         h
       ];
     }), this.originalZAverage = i.reduce((s, o) => s + o, 0) / i.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
@@ -1081,18 +1081,18 @@ class X extends j {
    * @returns 
    */
   createGroups() {
-    const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Map(), s = (o, r, c = -1) => {
-      const [a, h, l, d] = this.data[o];
+    const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Map(), s = (o, r, a = -1) => {
+      const [c, h, l, d] = this.data[o];
       if (e.add(o), d)
-        return i.has(o) || i.set(o, []), i.get(o)?.push(c), n.add(this.data[o]);
-      r.push([a, h]), l.forEach((p) => {
+        return i.has(o) || i.set(o, []), i.get(o)?.push(a), n.add(this.data[o]);
+      r.push([c, h]), l.forEach((p) => {
         e.has(p) || s(p, r, o);
       });
     };
     return this.data.forEach((o, r) => {
       if (!e.has(r)) {
-        const c = [];
-        s(r, c), t.push(c);
+        const a = [];
+        s(r, a), t.push(a);
       }
     }), this.doors = [...n], this.pointsGroups = t, t;
   }
@@ -1102,7 +1102,7 @@ class X extends j {
    * @returns 
    */
   computedSize() {
-    const t = this.pointsGroups.flatMap((r) => r.flatMap((c) => [c[0].x, c[1].x])), e = this.pointsGroups.flatMap((r) => r.flatMap((c) => [c[0].y, c[1].y])), n = Math.min(...t), i = Math.min(...e), s = Math.max(...t), o = Math.max(...e);
+    const t = this.pointsGroups.flatMap((r) => r.flatMap((a) => [a[0].x, a[1].x])), e = this.pointsGroups.flatMap((r) => r.flatMap((a) => [a[0].y, a[1].y])), n = Math.min(...t), i = Math.min(...e), s = Math.max(...t), o = Math.max(...e);
     return this.box.set(n, i, s, o), this.box;
   }
   /** 线路拓扑
@@ -1112,12 +1112,12 @@ class X extends j {
   lineTopology(t) {
     const e = [];
     function n(s, o) {
-      const [r, c] = t[s];
-      e[s] = !0, o.push(c);
-      for (let a = 0; a < t.length; a++) {
-        const [h, l] = t[a];
-        if (!e[a] && Math.abs(c.x - h.x) < 1e-6 && Math.abs(c.y - h.y) < 1e-6)
-          return n(a, o);
+      const [r, a] = t[s];
+      e[s] = !0, o.push(a);
+      for (let c = 0; c < t.length; c++) {
+        const [h, l] = t[c];
+        if (!e[c] && Math.abs(a.x - h.x) < 1e-6 && Math.abs(a.y - h.y) < 1e-6)
+          return n(c, o);
       }
     }
     const i = [];
@@ -1154,9 +1154,9 @@ class X extends j {
       const i = t[n - 1], s = t[n];
       if (i.distance(s) < this.width * 0.5) {
         let r = 0;
-        for (let c = n + 1; c < t.length; c++) {
-          const a = t[c - 1], h = t[c];
-          if (a.distance(h) < this.width * 0.8) r++;
+        for (let a = n + 1; a < t.length; a++) {
+          const c = t[a - 1], h = t[a];
+          if (c.distance(h) < this.width * 0.8) r++;
           else break;
         }
         r === 0 && n + r === t.length - 1 || n == 1 && r === 1 || (r === 3 ? (e.push(t[n + 1]), n += r) : r === 5 ? (e.push(t[n + 2]), n += r) : e.push(s));
@@ -1190,8 +1190,8 @@ class X extends j {
         n.push(s), n.push(r), i = i + 1;
         continue;
       }
-      const c = e[i + 2];
-      c && o.includedAngle(c) < 2 ? (i = i + 2, n.push(c)) : n.push(s);
+      const a = e[i + 2];
+      a && o.includedAngle(a) < 2 ? (i = i + 2, n.push(a)) : n.push(s);
     }
     return n.length > 3 ? J(this.mergeSameDirectionLine(n)) : [];
   }
@@ -1203,8 +1203,8 @@ class X extends j {
   removeShortLine(t, e = this.shortLine) {
     const n = k(t), i = [], s = Math.PI / 180;
     for (let o = 0; o < n.length; o++) {
-      const r = n[o], c = r.length(), a = o;
-      if (c > e || i.length === 0) {
+      const r = n[o], a = r.length(), c = o;
+      if (a > e || i.length === 0) {
         i.push(r);
         continue;
       }
@@ -1227,7 +1227,7 @@ class X extends j {
           l.points[1].copy(h.points[0]);
         i.push(h);
       } else
-        o = a;
+        o = c;
     }
     return i.length > 3 ? J(i) : [];
   }
@@ -1238,10 +1238,10 @@ class X extends j {
     let i = new F.Paths();
     const s = new F.ClipperOffset(20, 0.25);
     return this.pointsGroups.forEach((o) => {
-      const r = this.lineTopology(o).map((c) => c.map((a) => a.clone().mutiplyScalar(n)));
+      const r = this.lineTopology(o).map((a) => a.map((c) => c.clone().mutiplyScalar(n)));
       s.AddPaths(r, e, t);
     }), s.Execute(i, this.width / 2 * n), this.wallsGroup = i.map((o) => {
-      let r = o.map((c) => f.from(c).divisionScalar(n));
+      let r = o.map((a) => f.from(a).divisionScalar(n));
       return r = this.lineSegmentStraightening(r), t == X.EndType.etOpenSquare && (r = this.squareRemoveBurr(r)), r = this.removeShortLine(r), r;
     }), this.dispatchEvent({
       type: "lineOffset",
@@ -1255,8 +1255,8 @@ class X extends j {
     const n = [];
     return this.wallsGroup.forEach((i) => {
       for (let s = 0; s < i.length; s++) {
-        const o = i[s], r = s === i.length - 1 ? 0 : s + 1, c = i[r];
-        n.push(o.X * t, o.Y * t, e, c.X * t, c.Y * t, e);
+        const o = i[s], r = s === i.length - 1 ? 0 : s + 1, a = i[r];
+        n.push(o.X * t, o.Y * t, e, a.X * t, a.Y * t, e);
       }
     }), new Float32Array(n);
   }
@@ -1268,10 +1268,10 @@ class X extends j {
    */
   getArcAngleRange(t, e, n) {
     const i = e.x - t.x, s = e.y - t.y, o = n.x - t.x, r = n.y - t.y;
-    let c = Math.atan2(s, i), a = Math.atan2(r, o);
-    c = c < 0 ? c + 2 * Math.PI : c, a = a < 0 ? a + 2 * Math.PI : a;
+    let a = Math.atan2(s, i), c = Math.atan2(r, o);
+    a = a < 0 ? a + 2 * Math.PI : a, c = c < 0 ? c + 2 * Math.PI : c;
     let h, l;
-    return Math.abs(a - c) <= Math.PI ? (h = Math.min(c, a), l = Math.max(c, a)) : (h = Math.max(c, a), l = Math.min(c, a) + 2 * Math.PI), [h / (Math.PI / 180), l / (Math.PI / 180)];
+    return Math.abs(c - a) <= Math.PI ? (h = Math.min(a, c), l = Math.max(a, c)) : (h = Math.max(a, c), l = Math.min(a, c) + 2 * Math.PI), [h / (Math.PI / 180), l / (Math.PI / 180)];
   }
   /**
    * 转为绘制数据
@@ -1288,61 +1288,61 @@ class X extends j {
       scale: e
     };
     let i = "white";
-    function s(a, h) {
-      n.line.push([a.X * e, a.Y * e, h.X * e, h.Y * e, i]);
+    function s(c, h) {
+      n.line.push([c.X * e, c.Y * e, h.X * e, h.Y * e, i]);
     }
-    function o(a, h, l, d) {
+    function o(c, h, l, d) {
       n.arc.push([
-        a.x * e,
-        a.y * e,
+        c.x * e,
+        c.y * e,
         h * e,
         l,
         d,
         i
       ]);
     }
-    for (let a = 0; a < this.originalData.length; a++) {
-      const h = this.originalData[a];
+    for (let c = 0; c < this.originalData.length; c++) {
+      const h = this.originalData[c];
       if (h.isVerticalReferenceLine) {
         n.dimensionLine.push([h.start.x * e, h.start.y * e, h.end.x * e, h.end.y * e]);
         break;
       }
     }
-    this.wallsGroup.forEach((a) => {
-      for (let h = 0; h < a.length; h++) {
-        const l = a[h], d = h === a.length - 1 ? 0 : h + 1, p = a[d];
+    this.wallsGroup.forEach((c) => {
+      for (let h = 0; h < c.length; h++) {
+        const l = c[h], d = h === c.length - 1 ? 0 : h + 1, p = c[d];
         s(l, p);
       }
     });
-    const r = this.width * 0.2, c = [];
-    return this.doorLineSegment.forEach((a) => {
-      if (a.length() < 0.4) return;
-      const h = a.clone().expansion(-this.width * 0.5);
+    const r = this.width * 0.2, a = [];
+    return this.doorLineSegment.forEach((c) => {
+      if (c.length() < 0.4) return;
+      const h = c.clone().expansion(-this.width * 0.5);
       if (i = "cyan", h.length() < 1.2) {
         h.expansion(-r * 0.5);
-        const l = a.normal();
-        let d = new b(
+        const l = c.normal();
+        let d = new L(
           h.start.clone(),
           h.start.clone().add(l.clone().multiplyScalar(h.length()))
         );
         const p = d.clone().directionMove(d.normal(), h.length() * -0.5).expandToRectangle(h.length(), "bothSides");
-        for (let L = 0; L < c.length; L++)
-          if (c[L].intersectRectangle(p)) {
-            d = new b(
+        for (let b = 0; b < a.length; b++)
+          if (a[b].intersectRectangle(p)) {
+            d = new L(
               h.start.clone(),
               h.start.clone().add(l.clone().multiplyScalar(-h.length()))
             );
             break;
           }
-        d.expansion(-r * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((L, P) => s(L, P));
+        d.expansion(-r * 0.5).expandToRectangle(this.width * 0.2, "bothSides").path2D((b, P) => s(b, P));
         const m = h.length(), g = d.length(), u = (m ** 2 + g ** 2) / (2 * g), x = d.end.clone().add(d.direction().multiplyScalar(-u)), [w, S] = this.getArcAngleRange(x, h.end, d.end);
-        o(x, u, Math.min(w, S), Math.max(w, S)), c.push(p);
+        o(x, u, Math.min(w, S), Math.max(w, S)), a.push(p);
       } else
         h.clone().expansion(-this.width * 0.5).expandToRectangle(this.width).path2D((l, d) => s(l, d)), h.clone().directionMove(h.normal(), r * 0.5).directionMove(h.direction(), r * 0.5).expansion(-h.length() * 0.45, "end").forward(r * 0.5).expandToRectangle(r).path2D((l, d) => s(l, d)), h.clone().directionMove(h.normal(), -r * 0.5).directionMove(h.direction(), -r * 0.5).expansion(-h.length() * 0.45, "start").forward(-r * 0.5).expandToRectangle(r).path2D((l, d) => s(l, d));
-    }), i = "yellow", this.lineSegments.forEach((a) => {
-      if (!a.userData.isWindow) return !1;
-      Array.isArray(a.userData.drawWindow) && a.userData.drawWindow.forEach((h) => {
-        const { p: l, width: d } = h, p = f.from(l), m = p.clone().add(a.direction().multiplyScalar(d * 0.5)), g = p.clone().add(a.direction().multiplyScalar(-d * 0.5)), u = new b(m, g);
+    }), i = "yellow", this.lineSegments.forEach((c) => {
+      if (!c.userData.isWindow) return !1;
+      Array.isArray(c.userData.drawWindow) && c.userData.drawWindow.forEach((h) => {
+        const { p: l, width: d } = h, p = f.from(l), m = p.clone().add(c.direction().multiplyScalar(d * 0.5)), g = p.clone().add(c.direction().multiplyScalar(-d * 0.5)), u = new L(m, g);
         s(u.start, u.end), u.expandToRectangle(this.width, "bothSides").path2D((x, w) => s(x, w));
       });
     }), n;
@@ -1357,8 +1357,8 @@ class X extends j {
     if (typeof window < "u")
       s = document.createElement("canvas");
     else if (typeof global < "u") {
-      const { createCanvas: a } = await G("canvas");
-      s = a();
+      const { createCanvas: c } = await G("canvas");
+      s = c();
     } else
       throw new Error("创建画布失败");
     const o = 2 * i.scale, r = {
@@ -1367,18 +1367,18 @@ class X extends j {
       white: "white"
     };
     s.width = i.width + o * 2, s.height = i.height + o * 2;
-    const c = s.getContext("2d");
-    return n && (c.fillStyle = n, c.fillRect(0, 0, s.width, s.height)), c.translate(i.width * 0.5 + o, i.height * 0.5 + o), i.line.forEach(([a, h, l, d, p]) => {
-      c.strokeStyle = r[p], c.beginPath(), c.moveTo(a, h), c.lineTo(l, d), c.closePath(), c.stroke();
-    }), i.arc.forEach(([a, h, l, d, p, m]) => {
-      c.strokeStyle = r[m], c.beginPath(), c.arc(a, h, l, d * (Math.PI / 180), p * (Math.PI / 180)), c.stroke();
-    }), c.beginPath(), i.dimensionLine.forEach((a) => {
-      let [h, l, d, p] = a;
+    const a = s.getContext("2d");
+    return n && (a.fillStyle = n, a.fillRect(0, 0, s.width, s.height)), a.translate(i.width * 0.5 + o, i.height * 0.5 + o), i.line.forEach(([c, h, l, d, p]) => {
+      a.strokeStyle = r[p], a.beginPath(), a.moveTo(c, h), a.lineTo(l, d), a.closePath(), a.stroke();
+    }), i.arc.forEach(([c, h, l, d, p, m]) => {
+      a.strokeStyle = r[m], a.beginPath(), a.arc(c, h, l, d * (Math.PI / 180), p * (Math.PI / 180)), a.stroke();
+    }), a.beginPath(), i.dimensionLine.forEach((c) => {
+      let [h, l, d, p] = c;
       const m = Math.min(l, p), g = Math.max(l, p), u = (s.width * 0.5 - 0.4 * i.scale) * (h < 0 ? -1 : 1), x = (g - m) * 0.45;
-      c.fillStyle = "#fff", c.font = `${0.15 * i.scale}px Arial`, c.textAlign = "center", c.textBaseline = "middle", c.fillText((g - m).toFixed(2) + "cm", u, m + (g - m) * 0.5), c.moveTo(u - 0.1 * i.scale, m), c.lineTo(u + 0.1 * i.scale, m), c.moveTo(u, m), c.lineTo(u, x + m), c.moveTo(u, g), c.lineTo(u, g - x), c.moveTo(u - 0.1 * i.scale, g), c.lineTo(u + 0.1 * i.scale, g);
-    }), c.closePath(), c.strokeStyle = "#fff", c.stroke(), "toBlob" in s ? new Promise((a) => {
+      a.fillStyle = "#fff", a.font = `${0.15 * i.scale}px Arial`, a.textAlign = "center", a.textBaseline = "middle", a.fillText((g - m).toFixed(2) + "cm", u, m + (g - m) * 0.5), a.moveTo(u - 0.1 * i.scale, m), a.lineTo(u + 0.1 * i.scale, m), a.moveTo(u, m), a.lineTo(u, x + m), a.moveTo(u, g), a.lineTo(u, g - x), a.moveTo(u - 0.1 * i.scale, g), a.lineTo(u + 0.1 * i.scale, g);
+    }), a.closePath(), a.strokeStyle = "#fff", a.stroke(), "toBlob" in s ? new Promise((c) => {
       s.toBlob((h) => {
-        a(h);
+        c(h);
       }, e, 1);
     }) : s.toBuffer(e, { quality: 1 });
   }
@@ -1390,11 +1390,11 @@ class X extends j {
     e.setUnits(t), e.addLayer("cyan", R.ACI.CYAN, "DOTTED"), e.addLayer("yellow", R.ACI.YELLOW, "DOTTED"), e.addLayer("white", R.ACI.WHITE, "DOTTED");
     const n = this.toDrawDataJson();
     return n.line.forEach((i) => {
-      let [s, o, r, c, a] = i;
-      e.setActiveLayer(a), e.drawLine(s, o, r, c);
+      let [s, o, r, a, c] = i;
+      e.setActiveLayer(c), e.drawLine(s, o, r, a);
     }), n.arc.forEach((i) => {
-      const [s, o, r, c, a, h] = i;
-      e.setActiveLayer(h), e.drawArc(s, o, r, c, a);
+      const [s, o, r, a, c, h] = i;
+      e.setActiveLayer(h), e.drawArc(s, o, r, a, c);
     }), e.toDxfString();
   }
   /**
@@ -1433,8 +1433,8 @@ class X extends j {
    * @returns 
    */
   computedOriginalSize(t, e = new v(0, 0, 0, 0)) {
-    const n = t.flatMap((a) => [a.start.x, a.end.x]), i = t.flatMap((a) => [a.start.y, a.end.y]), s = Math.min(...n), o = Math.min(...i), r = Math.max(...n), c = Math.max(...i);
-    return e.set(s, o, r, c), e;
+    const n = t.flatMap((c) => [c.start.x, c.end.x]), i = t.flatMap((c) => [c.start.y, c.end.y]), s = Math.min(...n), o = Math.min(...i), r = Math.max(...n), a = Math.max(...i);
+    return e.set(s, o, r, a), e;
   }
   /**
    * 创建数据
@@ -1444,14 +1444,14 @@ class X extends j {
   static createData(t, e = !0) {
     let n = 0;
     return t.flatMap((s) => {
-      const o = s.map((r, c) => {
-        const a = c === s.length - 1 ? 0 : c + 1, h = s[a];
+      const o = s.map((r, a) => {
+        const c = a === s.length - 1 ? 0 : a + 1, h = s[c];
         return {
           start: { x: r.x, y: r.y },
           end: { x: h.x, y: h.y },
           insetionArr: [
             {
-              index: a + n
+              index: c + n
             }
           ]
         };
@@ -1460,7 +1460,7 @@ class X extends j {
     });
   }
 }
-const I = new b();
+const I = new L();
 class ot extends X {
   static name = "AngleCorrectionDxf";
   onAddFromParent(t) {
@@ -1469,38 +1469,38 @@ class ot extends X {
   async update() {
     const t = this.parent, e = t.findComponentByName("Dxf"), n = t.findComponentByName("LineAnalysis");
     let i = 0, s = null;
-    for (let a = 0; a < e.originalData.length; a++) {
-      const h = e.originalData[a];
+    for (let c = 0; c < e.originalData.length; c++) {
+      const h = e.originalData[c];
       if (I.start.copy(h.start), I.end.copy(h.end), h.isVerticalReferenceLine) {
         const [l, d] = h.start.y < h.end.y ? [I.start, I.end] : [I.end, I.start];
-        i = -new b(l, d).direction().angleBetween(new f(0, 1), "angle", "360"), s = null;
+        i = -new L(l, d).direction().angleBetween(new f(0, 1), "angle", "360"), s = null;
         break;
       }
-      (!s || I.length() > s.length()) && (s = I.clone(), s.userData.index = a);
+      (!s || I.length() > s.length()) && (s = I.clone(), s.userData.index = c);
     }
     if (s) {
       e.originalData[s.userData.index].isVerticalReferenceLine = !0;
-      const [a, h] = s.start.y < s.end.y ? [s.start, s.end] : [s.end, s.start];
-      i = -new b(a, h).direction().angleBetween(new f(0, 1), "angle", "360");
+      const [c, h] = s.start.y < s.end.y ? [s.start, s.end] : [s.end, s.start];
+      i = -new L(c, h).direction().angleBetween(new f(0, 1), "angle", "360");
     }
-    const o = e.originalBox.center, r = f.zero(), c = e.originalData.map((a) => {
-      const h = r.copy(a.start).division(o).rotate(f.zero(), i * (Math.PI / 180)).toJson(a.start.z), l = r.copy(a.end).division(o).rotate(f.zero(), i * (Math.PI / 180)).toJson(a.end.z), d = Object.assign(z(a), { start: h, end: l });
+    const o = e.originalBox.center, r = f.zero(), a = e.originalData.map((c) => {
+      const h = r.copy(c.start).division(o).rotate(f.zero(), i * (Math.PI / 180)).toJson(c.start.z), l = r.copy(c.end).division(o).rotate(f.zero(), i * (Math.PI / 180)).toJson(c.end.z), d = Object.assign(V(c), { start: h, end: l });
       return d.drawWindow && d.drawWindow.forEach((p) => {
         p.p = r.copy(p.p).division(o).rotate(f.zero(), i * (Math.PI / 180)).toJson(p.p.z), p.p.y = -p.p.y;
       }), d;
     });
-    n.appendLineSegmentList.forEach((a) => {
-      const h = a.clone();
-      h.start.division(o).rotate(f.zero(), i * (Math.PI / 180)), h.end.division(o).rotate(f.zero(), i * (Math.PI / 180)), c.push({
+    n.appendLineSegmentList.forEach((c) => {
+      const h = c.clone();
+      h.start.division(o).rotate(f.zero(), i * (Math.PI / 180)), h.end.division(o).rotate(f.zero(), i * (Math.PI / 180)), a.push({
         start: h.start.toJson(e.originalZAverage),
         end: h.end.toJson(e.originalZAverage),
         insetionArr: [],
         length: h.length()
       });
-    }), c.forEach((a) => {
-      a.start.y = -a.start.y, a.end.y = -a.end.y;
-    }), await this.set(c, e.width, e.scale), this.lineOffset(), this.doorLineSegment = e.doorLineSegment.map((a) => {
-      const h = a.clone();
+    }), a.forEach((c) => {
+      c.start.y = -c.start.y, c.end.y = -c.end.y;
+    }), await this.set(a, e.width, e.scale), this.lineOffset(), this.doorLineSegment = e.doorLineSegment.map((c) => {
+      const h = c.clone();
       return h.start.division(o).rotate(f.zero(), i * (Math.PI / 180)), h.end.division(o).rotate(f.zero(), i * (Math.PI / 180)), h.start.y = -h.start.y, h.end.y = -h.end.y, h;
     });
   }
@@ -1652,16 +1652,16 @@ class q {
     if (!this.bounds.intersectBox(i))
       return n;
     for (const s of this.nodes) {
-      const [o, r] = s.line.points, c = r.x - o.x, a = r.y - o.y, h = c * c + a * a;
-      let l = ((t.x - o.x) * c + (t.y - o.y) * a) / h;
+      const [o, r] = s.line.points, a = r.x - o.x, c = r.y - o.y, h = a * a + c * c;
+      let l = ((t.x - o.x) * a + (t.y - o.y) * c) / h;
       l = Math.max(0, Math.min(1, l));
-      const d = o.x + l * c, p = o.y + l * a;
+      const d = o.x + l * a, p = o.y + l * c;
       t.distance(new f(d, p)) <= e && n.push(s);
     }
     if (!this.isLeaf)
       for (const s of this.children)
         n.push(...s.queryCircle(t, e));
-    return n;
+    return n.sort((s) => s.line.length()), n;
   }
   /**
    * 查询与矩形相交的线段节点
@@ -1768,10 +1768,10 @@ class U {
   queryRect(t) {
     const e = t.toBox(), n = Math.ceil(e.minX / this.gridSize), i = Math.ceil(e.maxX / this.gridSize), s = Math.ceil(e.minY / this.gridSize), o = Math.ceil(e.maxY / this.gridSize);
     for (let r = n; r <= i; r++)
-      for (let c = s; c <= o; c++) {
-        const a = `${r}.${c}`;
-        if (!this.map.has(a)) continue;
-        this.map.get(a)?.forEach((l) => {
+      for (let a = s; a <= o; a++) {
+        const c = `${r}.${a}`;
+        if (!this.map.has(c)) continue;
+        this.map.get(c)?.forEach((l) => {
           t.containsPoint(l.point);
         });
       }
@@ -1783,16 +1783,16 @@ class U {
    * @returns 相交的节点数组
    */
   queryCircle(t, e) {
-    const n = new v(t.x - e, t.x + e, t.y - e, t.y + e), i = Math.ceil(n.minX / this.gridSize), s = Math.ceil(n.maxX / this.gridSize), o = Math.ceil(n.minY / this.gridSize), r = Math.ceil(n.maxY / this.gridSize), c = [];
-    for (let a = i; a <= s; a++)
+    const n = new v(t.x - e, t.x + e, t.y - e, t.y + e), i = Math.ceil(n.minX / this.gridSize), s = Math.ceil(n.maxX / this.gridSize), o = Math.ceil(n.minY / this.gridSize), r = Math.ceil(n.maxY / this.gridSize), a = [];
+    for (let c = i; c <= s; c++)
       for (let h = o; h <= r; h++) {
-        const l = `${a}.${h}`;
+        const l = `${c}.${h}`;
         if (!this.map.has(l)) continue;
         this.map.get(l)?.forEach((p) => {
-          t.distance(p.point) <= e && c.push(p);
+          t.distance(p.point) <= e && a.push(p);
         });
       }
-    return c;
+    return a;
   }
   /**
    * 查询与包围盒相交的点
@@ -1802,10 +1802,10 @@ class U {
   queryBox(t) {
     const e = Math.ceil(t.minX / this.gridSize), n = Math.ceil(t.maxX / this.gridSize), i = Math.ceil(t.minY / this.gridSize), s = Math.ceil(t.maxY / this.gridSize), o = [];
     for (let r = e; r <= n; r++)
-      for (let c = i; c <= s; c++) {
-        const a = `${r}.${c}`;
-        if (!this.map.has(a)) continue;
-        this.map.get(a)?.forEach((l) => {
+      for (let a = i; a <= s; a++) {
+        const c = `${r}.${a}`;
+        if (!this.map.has(c)) continue;
+        this.map.get(c)?.forEach((l) => {
           t.containsPoint(l.point) && o.push(l);
         });
       }
@@ -1821,6 +1821,13 @@ class U {
       t.equal(s.point) && n.push(s);
     }), n;
   }
+  /**
+   * 查找点自己
+   * @param point 
+   */
+  queryPointSelf(t) {
+    return t.userData.pointVirtualGrid && t.userData.pointVirtualGrid.target ? t.userData.pointVirtualGrid.target : null;
+  }
 }
 class rt {
   // 所有可查找的点位
@@ -1856,33 +1863,33 @@ class rt {
   search(t, e = [], n = 0.6, i = this.doorSearchDistance, s = this.doorSearchNearAngle) {
     const o = this.dxf, r = this.searchNearby(t, e, i, s);
     r.push(
-      ...t.map((a) => {
-        const h = this.searchAlongDirection(a, i);
+      ...t.map((c) => {
+        const h = this.searchAlongDirection(c, i);
         if (h) return {
-          start: a.point,
+          start: c.point,
           end: h.point
         };
-        const l = this.searchAlongNormalDirection(a, i);
+        const l = this.searchAlongNormalDirection(c, i);
         if (l) return {
-          start: a.point,
+          start: c.point,
           end: l.point
         };
-      }).filter((a) => !!a && a.start.distance(a.end) < i)
+      }).filter((c) => !!c && c.start.distance(c.end) < i)
     );
-    const c = [];
-    return r.forEach((a) => {
-      const h = new b(a?.start, a?.end), l = h.length();
+    const a = [];
+    return r.forEach((c) => {
+      const h = new L(c?.start, c?.end), l = h.length();
       if (l < n) return;
       const d = h.normal(), p = h.direction(), m = (l - o.width * 2) / 2;
       for (let g = 0; g < 3; g++) {
-        const u = h.start.clone().add(p.clone().multiplyScalar(o.width + m * g)), x = new b(
+        const u = h.start.clone().add(p.clone().multiplyScalar(o.width + m * g)), x = new L(
           u,
           u.clone().add(d.clone().multiplyScalar(1))
         );
         if (x.directionMove(d, -0.5), this.quadtree.queryLineSegment(x).length) return;
       }
-      c.push(h);
-    }), c;
+      a.push(h);
+    }), a;
   }
   /** 添加可查找点的过滤规则
    * @param rule 
@@ -1911,21 +1918,21 @@ class rt {
     return e.doors.forEach((i) => {
       const s = e.lineSegments[i[4]], o = e.originalData[i[4]];
       if (o.drawDoorData) {
-        const r = f.from(o.drawDoorData.start), c = f.from(o.drawDoorData.n), a = n.queryPoint(r).filter((h) => {
+        const r = f.from(o.drawDoorData.start), a = f.from(o.drawDoorData.n), c = n.queryPoint(r).filter((h) => {
           if (h.userData === s) return !1;
           const l = h.userData, d = l.direction();
           l.start.equal(r) && d.multiplyScalar(-1);
-          const p = c.angleBetween(d, "angle");
+          const p = a.angleBetween(d, "angle");
           return p > 80 || p < 10;
         });
-        a.length && t.push({
-          line: a[0].userData,
+        c.length && t.push({
+          line: c[0].userData,
           point: r,
           uuid: N()
         });
       } else if (o.doorDirectConnection) {
         this.continueFind = !1;
-        const r = new b(f.from(o.start), f.from(o.end));
+        const r = new L(f.from(o.start), f.from(o.end));
         r.userData = {
           doorDirectConnection: !0,
           isDoor: !0
@@ -1941,8 +1948,8 @@ class rt {
   searchDoubleLinePoint() {
     const t = /* @__PURE__ */ new Map();
     return this.resultList.flatMap((e) => {
-      const n = this.lineSegments[e.sourceIndex], i = this.lineSegments[e.targetIndex], s = i.projectPoint(n.start), o = i.projectPoint(n.end), r = n.projectPoint(i.start), c = n.projectPoint(i.end), a = s && o ? -1 : s ? 0 : o ? 1 : -1, h = r && c ? -1 : r ? 0 : c ? 1 : -1;
-      t.has(e.sourceIndex) ? t.get(e.sourceIndex) != a && t.set(e.sourceIndex, -1) : t.set(e.sourceIndex, a), t.has(e.targetIndex) ? t.get(e.targetIndex) != h && t.set(e.targetIndex, -1) : t.set(e.targetIndex, h);
+      const n = this.lineSegments[e.sourceIndex], i = this.lineSegments[e.targetIndex], s = i.projectPoint(n.start), o = i.projectPoint(n.end), r = n.projectPoint(i.start), a = n.projectPoint(i.end), c = s && o ? -1 : s ? 0 : o ? 1 : -1, h = r && a ? -1 : r ? 0 : a ? 1 : -1;
+      t.has(e.sourceIndex) ? t.get(e.sourceIndex) != c && t.set(e.sourceIndex, -1) : t.set(e.sourceIndex, c), t.has(e.targetIndex) ? t.get(e.targetIndex) != h && t.set(e.targetIndex, -1) : t.set(e.targetIndex, h);
     }), t;
   }
   /** 查找方案一：最近点查找
@@ -1956,15 +1963,15 @@ class rt {
   searchNearby(t, e = [], n = this.doorSearchDistance, i = this.doorSearchNearAngle) {
     const s = this.findPointVirtualGrid, o = this.quadtree;
     function r({ point: u, line: x }, w, S) {
-      const L = x.direction();
-      x.start === u && L.multiplyScalar(-1);
+      const b = x.direction();
+      x.start === u && b.multiplyScalar(-1);
       const P = s.queryCircle(u, n).filter((D) => D.userData !== x).sort((D, E) => D.point.distance(u) - E.point.distance(u)), A = [];
       for (let D = 0; D < P.length; D++) {
         const E = e.findIndex((T) => T.point === P[D].point), B = t[w].uuid, Y = e[E].uuid;
         if (S.has(`${B}.${Y}`)) continue;
         S.add(`${B}.${Y}`), S.add(`${Y}.${B}`);
-        const Q = P[D].point, C = new b(u.clone(), Q.clone());
-        if (C.direction().angleBetween(L, "angle") < i) {
+        const Q = P[D].point, C = new L(u.clone(), Q.clone());
+        if (C.direction().angleBetween(b, "angle") < i) {
           const T = t[E].line.direction();
           P[D].userData.start.equal(P[D].point) && T.multiplyScalar(-1), C.direction().multiplyScalar(-1).angleBetween(T, "angle") < i && (o.queryLineSegment(C).length || A.push({
             findData: P[D],
@@ -1976,27 +1983,27 @@ class rt {
       }
       return A;
     }
-    function c(u, x, w, S, L) {
+    function a(u, x, w, S, b) {
       S.add(u);
       const P = [];
-      L && P.push(L);
+      b && P.push(b);
       for (let A = 0; A < w.length; A++) {
         const D = w[A];
         if (x.has(D.findUuid)) {
           const E = x.get(D.findUuid);
-          c(D.findUuid, x, E, S, D) && P.push(D);
+          a(D.findUuid, x, E, S, D) && P.push(D);
         } else P.push(D);
       }
-      return P.sort((A, D) => A.doorLine.length() - D.doorLine.length()), L && P[0] === L ? (w.splice(0), !0) : (w.splice(1), !1);
+      return P.sort((A, D) => A.doorLine.length() - D.doorLine.length()), b && P[0] === b ? (w.splice(0), !0) : (w.splice(1), !1);
     }
-    const a = /* @__PURE__ */ new Set(), h = /* @__PURE__ */ new Map();
+    const c = /* @__PURE__ */ new Set(), h = /* @__PURE__ */ new Map();
     t.map((u, x) => {
-      const w = r(u, x, a);
+      const w = r(u, x, c);
       w.length && h.set(u.uuid, w);
-    }), a.clear();
+    }), c.clear();
     const l = /* @__PURE__ */ new Map();
     h.forEach((u, x) => {
-      if (!a.has(x) && u.length && c(x, h, u, a), u.length) {
+      if (!c.has(x) && u.length && a(x, h, u, c), u.length) {
         const w = u[0];
         l.has(w.doorUuid) || l.set(w.doorUuid, []), l.get(w.doorUuid)?.push(w), l.has(w.findUuid) || l.set(w.findUuid, []), l.get(w.findUuid)?.push(w);
       }
@@ -2017,21 +2024,21 @@ class rt {
     });
     const g = [];
     return p.forEach((u) => {
-      const x = t.findIndex((E) => E.uuid === u.doorUuid), w = e.findIndex((E) => E.uuid === u.findUuid), S = t[x].point.clone(), L = e[w].point.clone(), P = this.findLongLineSegment(t[x].line), A = this.findLongLineSegment(e[w].line), D = P.projectPoint(L);
+      const x = t.findIndex((E) => E.uuid === u.doorUuid), w = e.findIndex((E) => E.uuid === u.findUuid), S = t[x].point.clone(), b = e[w].point.clone(), P = this.findLongLineSegment(t[x].line), A = this.findLongLineSegment(e[w].line), D = P.projectPoint(b);
       if (D) {
         S.copy(D);
-        const E = new b(S, L), B = A.includedAngle(E);
+        const E = new L(S, b), B = A.includedAngle(E);
         (B < 10 || B > 170 || Math.abs(90 - B) < 10) && g.push({
           start: S,
-          end: L
+          end: b
         });
       } else {
         const E = A.projectPoint(S);
-        E && L.copy(E);
-        const B = new b(S, L), Y = P.includedAngle(B);
+        E && b.copy(E);
+        const B = new L(S, b), Y = P.includedAngle(B);
         (Y < 10 || Y > 170 || Math.abs(90 - Y) < 10) && g.push({
           start: S,
-          end: L
+          end: b
         });
       }
     }), e.splice(
@@ -2052,14 +2059,14 @@ class rt {
   searchAlongDirection({ point: t, line: e }, n = this.doorSearchDistance) {
     const i = this.quadtree, s = e.direction();
     e.start === t && s.multiplyScalar(-1);
-    const o = t.clone().add(s.clone().multiplyScalar(n)), r = new b(t.clone(), o), c = i.queryLineSegment(r).map((a) => ({
-      point: a.line.getIntersection(r),
-      line: a.line
-    })).filter((a) => a.point).sort((a, h) => t.distance(a.point) - t.distance(h.point));
-    if (c.length) {
-      const a = c[0];
-      if (Math.abs(90 - a.line.direction().angleBetween(s, "angle")) < 5)
-        return a;
+    const o = t.clone().add(s.clone().multiplyScalar(n)), r = new L(t.clone(), o), a = i.queryLineSegment(r).map((c) => ({
+      point: c.line.getIntersection(r),
+      line: c.line
+    })).filter((c) => c.point).sort((c, h) => t.distance(c.point) - t.distance(h.point));
+    if (a.length) {
+      const c = a[0];
+      if (Math.abs(90 - c.line.direction().angleBetween(s, "angle")) < 5)
+        return c;
     }
   }
   /** 方案三： 沿法线方向查找
@@ -2069,17 +2076,17 @@ class rt {
    * @returns 
    */
   searchAlongNormalDirection({ point: t, line: e }, n = this.doorSearchDistance) {
-    const i = this.pointVirtualGrid, s = this.quadtree, o = e.direction(), r = e.start.normal(e.end), c = e.start.clone();
-    e.start === t && o.multiplyScalar(-1), e.start === t && c.copy(e.end);
-    const a = i.queryPoint(c).filter((d) => d.userData !== e);
-    for (let d = 0; d < a.length; d++) {
-      const p = a[d], m = p.userData, g = m.direction();
+    const i = this.pointVirtualGrid, s = this.quadtree, o = e.direction(), r = e.start.normal(e.end), a = e.start.clone();
+    e.start === t && o.multiplyScalar(-1), e.start === t && a.copy(e.end);
+    const c = i.queryPoint(a).filter((d) => d.userData !== e);
+    for (let d = 0; d < c.length; d++) {
+      const p = c[d], m = p.userData, g = m.direction();
       if (m.start === p.point && o.multiplyScalar(-1), g.angleBetween(r) / (Math.PI / 180) > 90) {
         r.multiplyScalar(-1);
         break;
       }
     }
-    const h = new b(t.clone(), t.clone().add(r.multiplyScalar(n))), l = s.queryLineSegment(h).map((d) => ({
+    const h = new L(t.clone(), t.clone().add(r.multiplyScalar(n))), l = s.queryLineSegment(h).map((d) => ({
       point: d.line.getIntersection(h),
       line: d.line
     })).filter((d) => d.point).sort((d, p) => t.distance(d.point) - t.distance(p.point));
@@ -2137,15 +2144,15 @@ class at extends j {
    * @returns 
    */
   expandLineSegment(t, e, n = 0.1) {
-    const i = e.normal(t), s = e.direction(t).mutiplyScalar(n * 0.5), o = t.direction(e).mutiplyScalar(n * 0.5), r = i.x * n * 0.5, c = i.y * n * 0.5;
+    const i = e.normal(t), s = e.direction(t).mutiplyScalar(n * 0.5), o = t.direction(e).mutiplyScalar(n * 0.5), r = i.x * n * 0.5, a = i.y * n * 0.5;
     return {
       points: [
         // 第一条线
-        new f(t.x + r, t.y + c).add(o),
-        new f(e.x + r, e.y + c).add(s),
+        new f(t.x + r, t.y + a).add(o),
+        new f(e.x + r, e.y + a).add(s),
         // 第二条线
-        new f(t.x - r, t.y - c).add(o),
-        new f(e.x - r, e.y - c).add(s)
+        new f(t.x - r, t.y - a).add(o),
+        new f(e.x - r, e.y - a).add(s)
       ],
       indices: [0, 1, 1, 3, 3, 2, 2, 0],
       rectIndices: [0, 1, 3, 2, 0]
@@ -2159,7 +2166,7 @@ class at extends j {
    */
   addData(t, e) {
     const n = this.Dxf;
-    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new b(t.clone(), e.clone()));
+    n.data.push([t.clone(), e.clone(), [], !1, n.data.length]), this.appendLineSegmentList.push(new L(t.clone(), e.clone()));
   }
   /** 结果分析创建矩形
    * @param result 
@@ -2167,13 +2174,13 @@ class at extends j {
   createRectangle(t) {
     const e = this.Dxf, n = t.project, i = t.project2;
     n.includedAngle(i) > 135 && (i.points = [i.points[1], i.points[0]]), this.addData(n.points[0], i.points[0]), this.addData(n.points[1], i.points[1]);
-    const s = n.points[0].distance(i.points[0]), o = n.points[1].distance(i.points[1]), r = Math.ceil(Math.max(s, o) / e.width), c = s / r, a = o / r, h = i.points[0].direction(n.points[0]), l = i.points[1].direction(n.points[1]), d = n.points[0].clone(), p = n.points[1].clone(), m = p.direction(d);
+    const s = n.points[0].distance(i.points[0]), o = n.points[1].distance(i.points[1]), r = Math.ceil(Math.max(s, o) / e.width), a = s / r, c = o / r, h = i.points[0].direction(n.points[0]), l = i.points[1].direction(n.points[1]), d = n.points[0].clone(), p = n.points[1].clone(), m = p.direction(d);
     m.multiplyScalar(e.width * 0.5);
     const g = d.clone().add(m), u = p.clone().add(m.multiplyScalar(-1)), x = d.direction(p), w = g.direction(u);
     if (!(x.x > 0 && w.x < 0 || x.x < 0 && w.x > 0 || x.y > 0 && w.y < 0 || x.y < 0 && w.y > 0)) {
       d.set(g.x, g.y), p.set(u.x, u.y);
       for (let S = 1; S < r; S++) {
-        const L = h.clone().multiplyScalar(c * S), P = l.clone().multiplyScalar(a * S), A = d.clone().add(L), D = p.clone().add(P);
+        const b = h.clone().multiplyScalar(a * S), P = l.clone().multiplyScalar(c * S), A = d.clone().add(b), D = p.clone().add(P);
         this.addData(A, D);
       }
     }
@@ -2201,8 +2208,8 @@ class at extends j {
     this.buildQuadtree();
     const t = this.quadtree, e = this.lineSegmentList, n = /* @__PURE__ */ new Set(), i = [];
     e.forEach((s, o) => {
-      const r = e[o], c = O.fromByLineSegment(r, this.width * 2, !1, -0.01);
-      t.queryRect(c).map((h) => h.userData).filter((h) => h !== o).forEach((h) => {
+      const r = e[o], a = O.fromByLineSegment(r, this.width * 2, !1, -0.01);
+      t.queryRect(a).map((h) => h.userData).filter((h) => h !== o).forEach((h) => {
         try {
           if (n.has(`${o}-${h}`) || n.has(`${h}-${o}`)) return;
           const l = this.projectionAnalysis(h, o, r, e);
@@ -2219,25 +2226,25 @@ class at extends j {
    * @returns 
    */
   projectionAnalysis(t, e, n, i) {
-    const s = i[t], o = n.direction(), r = s.direction(), c = o.angleBetween(r) / (Math.PI / 180);
-    if (c < this.errorAngle || c > 180 - this.errorAngle) {
-      let a;
+    const s = i[t], o = n.direction(), r = s.direction(), a = o.angleBetween(r) / (Math.PI / 180);
+    if (a < this.errorAngle || a > 180 - this.errorAngle) {
+      let c;
       const h = s.projectLineSegment(n), l = n.projectLineSegment(s);
-      return h.getLength() > l.getLength() ? a = {
+      return h.getLength() > l.getLength() ? c = {
         target: s,
         targetIndex: t,
         source: n,
         sourceIndex: e,
         project: h,
         project2: l
-      } : a = {
+      } : c = {
         target: n,
         targetIndex: e,
         source: s,
         sourceIndex: t,
         project: l,
         project2: h
-      }, !a || a.project.getLength() < 0.2 || a.project2.getLength() < 0.2 ? void 0 : a;
+      }, !c || c.project.getLength() < 0.2 || c.project2.getLength() < 0.2 ? void 0 : c;
     }
   }
   doorSearchNearAngle = 110;
@@ -2310,7 +2317,7 @@ class H extends j {
     const t = this.Dxf;
     this.originalWhiteMode.clear(), this.whiteModelGroup.clear(), this.whiteModelLineGroup.clear(), this.whiteModelGroup.add(this.whiteModelLineGroup), this.whiteModelGroup.position.z = t.originalZAverage, this.originalWhiteMode.position.z = t.originalZAverage, t.wallsGroup.forEach((n) => {
       const i = new M.Shape();
-      n.forEach((r, c) => c === 0 ? i.moveTo(r.x / t.scale, r.y / t.scale) : i.lineTo(r.x / t.scale, r.y / t.scale));
+      n.forEach((r, a) => a === 0 ? i.moveTo(r.x / t.scale, r.y / t.scale) : i.lineTo(r.x / t.scale, r.y / t.scale));
       const s = new M.ExtrudeGeometry(i, {
         depth: 2.8,
         bevelSize: 0
@@ -2319,18 +2326,18 @@ class H extends j {
         new M.LineSegments(new M.EdgesGeometry(s), new M.LineBasicMaterial({ color: 0 }))
       );
     }), t.originalData.map(({ start: n, end: i, insetionArr: s }) => {
-      const o = new f(n.x, n.y).mutiplyScalar(t.scale), r = new f(i.x, i.y).mutiplyScalar(t.scale), { points: c, indices: a, rectIndices: h } = dt(o, r, t.width);
+      const o = new f(n.x, n.y).mutiplyScalar(t.scale), r = new f(i.x, i.y).mutiplyScalar(t.scale), { points: a, indices: c, rectIndices: h } = dt(o, r, t.width);
       return {
-        points: c,
-        indices: a,
+        points: a,
+        indices: c,
         rectIndices: h,
         insetions: (s ?? []).map((l) => l.index)
       };
     }).forEach((n) => {
       const i = new M.Shape();
-      n.rectIndices.forEach((r, c) => {
-        const a = n.points[r];
-        c === 0 ? i.moveTo(a.x, a.y) : i.lineTo(a.x, a.y);
+      n.rectIndices.forEach((r, a) => {
+        const c = n.points[r];
+        a === 0 ? i.moveTo(c.x, c.y) : i.lineTo(c.x, c.y);
       });
       const s = new M.ExtrudeGeometry(i, {
         depth: 2.8,
@@ -2500,11 +2507,11 @@ class Z extends j {
         this.racasterHelper(n, i, s), i.z = 0;
         const r = new M.Raycaster(n, i, 0, s).intersectObject(t.originalWhiteMode);
         if (r.length) {
-          const { point: c } = r[0];
+          const { point: a } = r[0];
           this.desPoints.push({
             message: e.desc,
             position: n,
-            intersection: c
+            intersection: a
           });
         }
       }), this.dispatchEvent({
@@ -2566,7 +2573,7 @@ function mt() {
 function xt() {
   return import("./index3.js");
 }
-let V = null;
+let z = null;
 async function Et(y, t, e = !1, n) {
   const i = await Promise.resolve().then(() => pt), s = await mt(), o = await xt(), r = new ct().usePlugin(i.ModelDataPlugin.create({
     detailsPoint: !1,
@@ -2577,32 +2584,33 @@ async function Et(y, t, e = !1, n) {
     detailsPoint: !1,
     orbitControls: e,
     camera: t
-  })).usePlugin(o.Editor.create({ viewPermission: n })), c = r.findComponentByType(s.components.DomContainer);
-  return c && y.appendChild(c.domElement), V = r, {
+  })).usePlugin(o.Editor.create({ viewPermission: n })), a = r.findComponentByType(s.components.DomContainer);
+  return a && y.appendChild(a.domElement), z = r, {
     dxfSystem: r,
     getFileAll: () => yt(r)
   };
 }
-async function yt(y = V) {
-  const t = y.findComponentByName("WhiteModel"), e = new File([await y.AngleCorrectionDxf.toDxfImageBlob()], "img.jpg", { type: "image/jpeg" }), n = new File([y.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), i = new File([await t.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), s = new File([await t.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), o = new File([await t.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), r = new File([JSON.stringify(y.Dxf.originalData)], "json.json", { type: "application/json" });
+async function yt(y = z) {
+  const t = y.findComponentByName("WhiteModel"), e = new File([await y.AngleCorrectionDxf.toDxfImageBlob()], "img.jpg", { type: "image/jpeg" }), n = new File([y.Dxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), i = new File([y.AngleCorrectionDxf.toDxfBlob()], "dxf.dxf", { type: "application/dxf" }), s = new File([await t.toOBJBlob()], "model.obj", { type: "application/octet-stream" }), o = new File([await t.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), r = new File([await t.toGltfBlob(!1)], "model.gltf", { type: "application/json" }), a = new File([JSON.stringify(y.Dxf.originalData)], "json.json", { type: "application/json" });
   return {
     dxf: n,
-    obj: i,
-    glb: s,
-    gltf: o,
-    json: r,
-    jpg: e
+    obj: s,
+    glb: o,
+    gltf: r,
+    json: a,
+    jpg: e,
+    correctionDxf: i
   };
 }
 function At() {
-  return V;
+  return z;
 }
 export {
   v as B,
   j as C,
   ct as D,
   $ as E,
-  b as L,
+  L,
   ft as M,
   f as P,
   q as Q,
@@ -2613,5 +2621,6 @@ export {
   Et as c,
   At as d,
   yt as g,
-  ut as i
+  ut as i,
+  N as u
 };