build-dxf 0.0.20-24 → 0.0.20-26

package/src/build.js

@@ -4,19 +4,19 @@ import F from "clipper-lib";
 import R from "dxf-writer";
 import { OBJExporter as et } from "three/examples/jsm/exporters/OBJExporter.js";
 import { GLTFExporter as nt } from "three/examples/jsm/exporters/GLTFExporter.js";
-function z() {
+function N() {
   return "xxxx-xxxx-4xxx-yxxx-xxxx".replace(/[xy]/g, function(y) {
     var t = Math.random() * 16 | 0, e = y == "x" ? t : t & 3 | 8;
     return e.toString(16);
   });
 }
 class $ extends tt {
-  uuid = z();
+  uuid = N();
   addEventListener(t, e, n) {
-    const { once: i = !1 } = n ?? {}, o = (r) => {
-      e(r), i && s();
-    }, s = () => this.removeEventListener(t, o);
-    return super.addEventListener(t, o), s;
+    const { once: i = !1 } = n ?? {}, s = (r) => {
+      e(r), i && o();
+    }, o = () => this.removeEventListener(t, s);
+    return super.addEventListener(t, s), o;
   }
   eventRecordStack = /* @__PURE__ */ new Map();
   addEventRecord(t, ...e) {
@@ -117,7 +117,7 @@ class it extends $ {
     return e || null;
   }
 }
-class p {
+class f {
   x;
   y;
   get X() {
@@ -207,8 +207,8 @@ class p {
    * @param angle 旋转角度，单位为弧度
    */
   rotate(t, e) {
-    const n = this.x - t.x, i = this.y - t.y, o = Math.cos(e), s = Math.sin(e), r = n * o - i * s, c = n * s + i * o;
-    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;
   }
   /**
    * 保留小数位数
@@ -233,8 +233,8 @@ class p {
    * @returns 
    */
   normal(t) {
-    const e = this.x - t.x, n = this.y - t.y, i = Math.sqrt(e * e + n * n), o = -n / i, s = e / i;
-    return new p(o, s);
+    const e = this.x - t.x, n = this.y - t.y, i = Math.sqrt(e * e + n * n), s = -n / i, o = e / i;
+    return new f(s, o);
   }
   /**
    * 获取由传入的点到该点的单位方向向量
@@ -244,7 +244,7 @@ class p {
    */
   direction(t) {
     const e = this.x - t.x, n = this.y - t.y, i = Math.sqrt(e * e + n * n);
-    return i === 0 ? new p(0, 0) : new p(e / i, n / i);
+    return i === 0 ? new f(0, 0) : new f(e / i, n / i);
   }
   /**
    * 计算模长
@@ -277,10 +277,10 @@ class p {
    * @returns 
    */
   angleBetween(t, e = "radian", n = "180") {
-    const i = this.dot(t), o = this.magnitude(), s = t.magnitude();
-    if (o === 0 || s === 0) return 0;
-    const r = i / (o * s), 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 i = this.dot(t), s = this.magnitude(), o = t.magnitude();
+    if (s === 0 || o === 0) return 0;
+    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);
   }
   /** 获取向量长度
    */
@@ -302,7 +302,7 @@ class p {
    * @returns 
    */
   clone() {
-    return new p(this.x, this.y);
+    return new f(this.x, this.y);
   }
   /**
    * 克隆
@@ -319,10 +319,10 @@ class p {
     };
   }
   static from(t) {
-    return Array.isArray(t) ? new p(t[0], t[1]) : "x" in t && "y" in t ? new p(t.x, t.y) : "X" in t && "Y" in t ? new p(t.X, t.Y) : this.zero();
+    return Array.isArray(t) ? new f(t[0], t[1]) : "x" in t && "y" in t ? new f(t.x, t.y) : "X" in t && "Y" in t ? new f(t.X, t.Y) : this.zero();
   }
   static zero() {
-    return new p(0, 0);
+    return new f(0, 0);
   }
 }
 class v {
@@ -332,10 +332,10 @@ class v {
   maxY = 0;
   get points() {
     return [
-      new p(this.minX, this.minY),
-      new p(this.maxX, this.minY),
-      new p(this.maxX, this.maxY),
-      new p(this.minX, this.maxY)
+      new f(this.minX, this.minY),
+      new f(this.maxX, this.minY),
+      new f(this.maxX, this.maxY),
+      new f(this.minX, this.maxY)
     ];
   }
   get width() {
@@ -345,7 +345,7 @@ class v {
     return this.maxY - this.minY;
   }
   get center() {
-    return new p(
+    return new f(
       this.minX + (this.maxX - this.minX) * 0.5,
       this.minY + (this.maxY - this.minY) * 0.5
     );
@@ -360,9 +360,9 @@ class v {
    */
   getPaths3D(t = 0) {
     const e = this.points, n = [];
-    return e.forEach((i, o) => {
-      const s = e[(o + 1) % e.length];
-      n.push(i.x, i.y, t), n.push(s.x, s.y, t);
+    return e.forEach((i, s) => {
+      const o = e[(s + 1) % e.length];
+      n.push(i.x, i.y, t), n.push(o.x, o.y, t);
     }), n;
   }
   /**
@@ -371,21 +371,21 @@ class v {
    * @param line 
    */
   intersectLineSegment(t) {
-    const e = t.points[0], n = t.points[1], i = n.x - e.x, o = n.y - e.y;
-    if (i === 0 && o === 0)
+    const e = t.points[0], n = t.points[1], i = n.x - e.x, s = n.y - e.y;
+    if (i === 0 && s === 0)
       return this.minX <= e.x && e.x <= this.maxX && this.minY <= e.y && e.y <= this.maxY;
-    let s = Number.NEGATIVE_INFINITY, r = Number.POSITIVE_INFINITY;
+    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;
-      s = Math.max(s, 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 (o !== 0) {
-      const c = (this.minY - e.y) / o, a = (this.maxY - e.y) / o;
-      s = Math.max(s, Math.min(c, a)), r = Math.min(r, Math.max(c, a));
+    if (s !== 0) {
+      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 s <= r && s <= 1 && r >= 0;
+    return o <= r && o <= 1 && r >= 0;
   }
   /**
    * 判断线段是在包围盒内
@@ -400,37 +400,37 @@ class v {
    * @param rectangle 
    */
   intersectRectangle(t) {
-    const e = (s) => this.minX <= s.x && s.x <= this.maxX && this.minY <= s.y && s.y <= this.maxY, n = (s) => {
+    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: s.x - a.x, y: s.y - a.y }, f = l.x * d.y - l.y * d.x;
-        if (f === 0) {
-          const m = l.x !== 0 ? (s.x - a.x) / l.x : (s.y - a.y) / l.y;
+      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 - c.x) / l.x : (o.y - c.y) / l.y;
           if (m >= 0 && m <= 1) return !0;
         } else {
-          const m = f > 0 ? 1 : -1;
+          const m = p > 0 ? 1 : -1;
           if (r === 0 && (r = m), r !== m) return !1;
         }
       }
       return !0;
-    }, i = (s, 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(s, r, c), f = h(s, r, a), m = h(c, a, s), g = h(c, a, r);
-      return !!(d !== f && m !== g || d === 0 && l(s, c, r) || f === 0 && l(s, a, r) || m === 0 && l(c, s, a) || g === 0 && l(c, r, a));
-    }, o = this.points;
-    for (let s = 0; s < 4; s++) {
-      const r = o[s], c = o[(s + 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;
+      }, 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], 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 s of t.points)
-      if (e(s)) return !0;
-    for (let s of o)
-      if (n(s)) return !0;
+    for (let o of t.points)
+      if (e(o)) return !0;
+    for (let o of s)
+      if (n(o)) return !0;
     return !1;
   }
   /**
@@ -481,8 +481,8 @@ class v {
    * @returns 
    */
   scaleSize(t, e, n = "min") {
-    const i = t / this.width, o = e / this.height;
-    return Math[n](i, o);
+    const i = t / this.width, s = e / this.height;
+    return Math[n](i, s);
   }
   /**
    * 
@@ -519,16 +519,16 @@ class v {
     );
   }
 }
-function O(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(O);
+  if (Array.isArray(y)) return y.map(V);
   const t = {};
   for (const e in y)
-    Object.prototype.hasOwnProperty.call(y, e) && (t[e] = O(y[e]));
+    Object.prototype.hasOwnProperty.call(y, e) && (t[e] = V(y[e]));
   return t;
 }
-class N {
+class O {
   points;
   get p0() {
     return this.points[0];
@@ -551,7 +551,7 @@ class N {
   path2D(t) {
     return this.points.flatMap((e, n) => {
       const i = this.points[(n + 1) % this.points.length];
-      return t && t(new p(e.x, e.y), new p(i.x, i.y)), [e.x, e.y, i.x, i.y];
+      return t && t(new f(e.x, e.y), new f(i.x, i.y)), [e.x, e.y, i.x, i.y];
     });
   }
   createGeometry() {
@@ -577,16 +577,16 @@ class N {
   intersectLineSegment(t) {
     if (t.points.length !== 2)
       throw new Error("LineSegment must have exactly 2 points");
-    const [e, n] = t.points, i = (o, s, 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(o, s, r), d = a(o, s, c), f = a(r, c, o), m = a(r, c, s);
-      return !!(l !== d && f !== m || l === 0 && h(o, r, s) || d === 0 && h(o, c, s) || f === 0 && h(r, o, c) || m === 0 && h(r, s, 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 o = 0; o < 4; o++) {
-      const s = this.points[o], r = this.points[(o + 1) % 4];
-      if (i(e, n, s, r))
+    for (let s = 0; s < 4; s++) {
+      const o = this.points[s], r = this.points[(s + 1) % 4];
+      if (i(e, n, o, r))
         return !0;
     }
     return !!this.containsLineSegment(t);
@@ -601,10 +601,10 @@ class N {
       throw new Error("LineSegment must have exactly 2 points");
     const e = (n) => {
       let i = 0;
-      for (let o = 0; o < 4; o++) {
-        const s = this.points[o], r = this.points[(o + 1) % 4], c = { x: r.x - s.x, y: r.y - s.y }, a = { x: n.x - s.x, y: n.y - s.y }, h = c.x * a.y - c.y * a.x;
+      for (let s = 0; s < 4; s++) {
+        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 - s.x) / c.x : (n.y - s.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;
@@ -623,24 +623,24 @@ class N {
    */
   intersectRectangle(t) {
     const e = [];
-    for (let o = 0; o < 4; o++) {
-      const s = this.points[o], r = this.points[(o + 1) % 4];
-      e.push(s.normal(r));
+    for (let s = 0; s < 4; s++) {
+      const o = this.points[s], r = this.points[(s + 1) % 4];
+      e.push(o.normal(r));
     }
-    for (let o = 0; o < 4; o++) {
-      const s = t.points[o], r = t.points[(o + 1) % 4];
-      e.push(s.normal(r));
+    for (let s = 0; s < 4; s++) {
+      const o = t.points[s], r = t.points[(s + 1) % 4];
+      e.push(o.normal(r));
     }
-    function n(o, s) {
-      const r = o.points.map((c) => c.dot(s));
+    function n(s, o) {
+      const r = s.points.map((a) => a.dot(o));
       return [Math.min(...r), Math.max(...r)];
     }
-    function i(o, s) {
-      return o[0] < s[1] && s[0] < o[1];
+    function i(s, o) {
+      return s[0] < o[1] && o[0] < s[1];
     }
-    for (const o of e) {
-      const s = n(this, o), r = n(t, o);
-      if (!i(s, r))
+    for (const s of e) {
+      const o = n(this, s), r = n(t, s);
+      if (!i(o, r))
         return !1;
     }
     return !0;
@@ -652,7 +652,7 @@ class N {
   containsPoint(t) {
     let e = 0, n = 0;
     for (let i = 0; i < 4; i++) {
-      const o = this.points[i], s = this.points[(i + 1) % 4], r = (s.x - o.x) * (t.y - o.y) - (s.y - o.y) * (t.x - o.x);
+      const s = this.points[i], o = this.points[(i + 1) % 4], r = (o.x - s.x) * (t.y - s.y) - (o.y - s.y) * (t.x - s.x);
       if (r > 0) e++;
       else if (r < 0) n++;
       else return !1;
@@ -665,8 +665,8 @@ class N {
    */
   toBox() {
     let t = 1 / 0, e = -1 / 0, n = 1 / 0, i = -1 / 0;
-    return this.points.forEach((o) => {
-      e = Math.max(o.x, e), t = Math.min(o.x, t), i = Math.max(o.x, i), n = Math.min(o.x, n);
+    return this.points.forEach((s) => {
+      e = Math.max(s.x, e), t = Math.min(s.x, t), i = Math.max(s.x, i), n = Math.min(s.x, n);
     }), new v(t, e, n, i);
   }
   /**
@@ -676,21 +676,21 @@ class N {
    * @returns 
    */
   static fromByLineSegment(t, e = 0.1, n = !1, i = 0.5) {
-    const o = t.points[0], s = t.points[1], r = s.normal(o), c = n ? s.direction(o).mutiplyScalar(e * i) : p.zero(), a = n ? o.direction(s).mutiplyScalar(e * i) : p.zero(), h = r.x * e * 0.5, l = r.y * e * 0.5;
-    return new N([
-      new p(o.x + h, o.y + l).add(a),
-      new p(s.x + h, s.y + l).add(c),
-      new p(s.x - h, s.y - l).add(c),
-      new p(o.x - h, o.y - l).add(a)
+    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(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 L {
-  points = [new p(), new p()];
+  points = [new f(), new f()];
   userData = {};
   line;
   get center() {
-    return new p(
+    return new f(
       this.points[0].x + (this.points[1].x - this.points[0].x) * 0.5,
       this.points[0].y + (this.points[1].y - this.points[0].y) * 0.5
     );
@@ -701,7 +701,7 @@ class L {
   get end() {
     return this.points[1];
   }
-  constructor(t = new p(), e = new p()) {
+  constructor(t = new f(), e = new f()) {
     this.points = [t, e];
   }
   set(t, e) {
@@ -770,15 +770,15 @@ class L {
    * @returns {Rectangle}
    */
   expandToRectangle(t = 0.1, e = "all") {
-    const n = this.start, i = this.end, o = i.normal(n), s = e === "bothSides" ? p.zero() : i.direction(n).mutiplyScalar(t * 0.5), r = e === "bothSides" ? p.zero() : n.direction(i).mutiplyScalar(t * 0.5), c = o.x * t * 0.5, a = o.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 p(n.x + c, n.y + a).add(r),
-      new p(i.x + c, i.y + a).add(s),
+      new f(n.x + a, n.y + c).add(r),
+      new f(i.x + a, i.y + c).add(o),
       // 第二条线
-      new p(n.x - c, n.y - a).add(r),
-      new p(i.x - c, i.y - a).add(s)
+      new f(n.x - a, n.y - c).add(r),
+      new f(i.x - a, i.y - c).add(o)
     ];
-    return new N([0, 1, 3, 2].map((l) => h[l]));
+    return new O([0, 1, 3, 2].map((l) => h[l]));
   }
   /**
    * 计算线段的长度
@@ -815,24 +815,24 @@ class L {
   projectLineSegment(t) {
     if (t.points.length !== 2 || this.points.length !== 2)
       throw new Error("每条线段必须由两个点定义");
-    const [e, n] = t.points, [i, o] = this.points, s = new p(o.x - i.x, o.y - i.y);
-    if (s.x === 0 && s.y === 0)
+    const [e, n] = t.points, [i, s] = this.points, o = new f(s.x - i.x, s.y - i.y);
+    if (o.x === 0 && o.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     const r = (m) => {
-      const g = new p(m.x - i.x, m.y - i.y), u = s.x * s.x + s.y * s.y, w = (g.x * s.x + g.y * s.y) / u, S = i.x + w * s.x, b = i.y + w * s.y;
-      return new p(S, b);
+      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 p(m.x - i.x, m.y - i.y), u = s.x * s.x + s.y * s.y;
-      return (g.x * s.x + g.y * s.y) / u;
+      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);
-    const f = (m) => {
-      const g = Math.max(0, Math.min(1, m)), u = i.x + g * s.x, x = i.y + g * s.y;
-      return new p(u, x);
+    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 = f(l)), (d < 0 || d > 1) && (a = f(d)), c.x === a.x && c.y === a.y ? new L(c, c) : new L(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);
   }
   /**
    * 计算一条线段在另一条直线上的投影
@@ -841,34 +841,34 @@ class L {
    * @returns 投影并裁剪后的线段
    */
   projectPoint(t, e = !0) {
-    const [n, i] = this.points, o = new p(i.x - n.x, i.y - n.y);
-    if (o.x === 0 && o.y === 0)
+    const [n, i] = this.points, s = new f(i.x - n.x, i.y - n.y);
+    if (s.x === 0 && s.y === 0)
       throw new Error("投影目标线段的两个点不能重合");
     let r = ((h) => {
-      const l = new p(h.x - n.x, h.y - n.y), d = o.x * o.x + o.y * o.y, m = (l.x * o.x + l.y * o.y) / d, g = n.x + m * o.x, u = n.y + m * o.y;
-      return new p(g, u);
+      const l = new f(h.x - n.x, h.y - n.y), d = s.x * s.x + s.y * s.y, m = (l.x * s.x + l.y * s.y) / d, g = n.x + m * s.x, u = n.y + m * s.y;
+      return new f(g, u);
     })(t);
     if (!e) return r;
-    let a = ((h) => {
-      const l = new p(h.x - n.x, h.y - n.y), d = o.x * o.x + o.y * o.y;
-      return (l.x * o.x + l.y * o.y) / d;
+    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;
   }
   /**
    * 判断线段是否与另一条线段相交（包含共用端点或部分重合的情况）
    * @param line 
    */
   intersectLineSegment(t) {
-    const e = this.start, n = this.end, i = t.start, o = t.end;
-    function s(d, f, m) {
-      return (f.x - d.x) * (m.y - d.y) - (f.y - d.y) * (m.x - d.x);
+    const e = this.start, n = this.end, i = t.start, s = t.end;
+    function o(d, p, m) {
+      return (p.x - d.x) * (m.y - d.y) - (p.y - d.y) * (m.x - d.x);
     }
-    function r(d, f, m) {
-      return Math.min(f.x, m.x) - 1e-10 <= d.x && d.x <= Math.max(f.x, m.x) + 1e-10 && Math.min(f.y, m.y) - 1e-10 <= d.y && d.y <= Math.max(f.y, m.y) + 1e-10;
+    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 = s(e, n, i), a = s(e, n, o), h = s(i, o, e), l = s(i, o, n);
-    return !!(c * a < 0 && h * l < 0 || Math.abs(c) < 1e-10 && r(i, e, n) || Math.abs(a) < 1e-10 && r(o, e, n) || Math.abs(h) < 1e-10 && r(e, i, o) || Math.abs(l) < 1e-10 && r(n, i, o));
+    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));
   }
   /**
    * 获取交点
@@ -876,11 +876,11 @@ class L {
    * @returns 
    */
   getIntersection(t) {
-    const e = this.start, n = this.end, i = t.start, o = t.end, s = (e.x - n.x) * (i.y - o.y) - (e.y - n.y) * (i.x - o.x);
-    if (Math.abs(s) < 1e-10)
+    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 - o.y) - (e.y - i.y) * (i.x - o.x)) / s, c = e.x + r * (n.x - e.x), a = e.y + r * (n.y - e.y);
-    return new p(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,15 +918,15 @@ class L {
    * @returns 
    */
   areLinesCoincident(t) {
-    const e = this.start, n = this.end, i = t.start, o = t.end, s = (n.y - e.y) / (n.x - e.x), r = e.y - s * e.x, c = (o.y - i.y) / (o.x - i.x), a = i.y - c * i.x;
-    return !isFinite(s) && !isFinite(c) ? e.x === i.x && n.x === i.x : Math.abs(s - 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 L(
       this.points[0].clone(),
       this.points[1].clone()
     );
-    return t.userData = O(this.userData), t;
+    return t.userData = { ...this.userData }, t;
   }
 }
 async function G(y, t = !0) {
@@ -1045,29 +1045,29 @@ class X extends j {
   async set(t, e = this.width, n = this.scale) {
     if (typeof t == "string")
       if (typeof global < "u") {
-        const { default: s } = await import(
+        const { default: o } = await import(
           /* @vite-ignore */
           "fs"
-        ), r = s.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: o, end: s, insetionArr: r, isDoor: c = !1, ...a }, h) => {
-      i.push(o.z ?? 0, s.z ?? 0);
+    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 L(
-        p.from(o).mutiplyScalar(n),
-        p.from(s).mutiplyScalar(n)
+        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((o, s) => o + s, 0) / i.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
+    }), this.originalZAverage = i.reduce((s, o) => s + o, 0) / i.length, this.computedOriginalSize(t, this.originalBox), this.dispatchEvent({
       type: "setDta",
       originalData: this.originalData,
       data: this.data
@@ -1081,18 +1081,18 @@ class X extends j {
    * @returns 
    */
   createGroups() {
-    const t = [], e = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Map(), o = (s, r, c = -1) => {
-      const [a, h, l, d] = this.data[s];
-      if (e.add(s), d)
-        return i.has(s) || i.set(s, []), i.get(s)?.push(c), n.add(this.data[s]);
-      r.push([a, h]), l.forEach((f) => {
-        e.has(f) || o(f, r, s);
+    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(a), n.add(this.data[o]);
+      r.push([c, h]), l.forEach((p) => {
+        e.has(p) || s(p, r, o);
       });
     };
-    return this.data.forEach((s, r) => {
+    return this.data.forEach((o, r) => {
       if (!e.has(r)) {
-        const c = [];
-        o(r, c), t.push(c);
+        const a = [];
+        s(r, a), t.push(a);
       }
     }), this.doors = [...n], this.pointsGroups = t, t;
   }
@@ -1102,8 +1102,8 @@ 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), o = Math.max(...t), s = Math.max(...e);
-    return this.box.set(n, i, o, s), this.box;
+    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;
   }
   /** 线路拓扑
    * @description 处理线路拓扑，使线路有序链接，形成长路径
@@ -1111,20 +1111,20 @@ class X extends j {
    */
   lineTopology(t) {
     const e = [];
-    function n(o, s) {
-      const [r, c] = t[o];
-      e[o] = !0, s.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, s);
+    function n(s, 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 = [];
-    for (let o = 0; o < t.length; o++)
-      if (!e[o]) {
-        const s = [t[o][0]];
-        n(o, s), i.push(s);
+    for (let s = 0; s < t.length; s++)
+      if (!e[s]) {
+        const o = [t[s][0]];
+        n(s, o), i.push(o);
       }
     return i;
   }
@@ -1139,8 +1139,8 @@ class X extends j {
     }
     const n = [t[0]];
     for (let i = 1; i < t.length; i++) {
-      const o = t[i], s = t[i - 1];
-      s.includedAngle(o) < e ? s.end.copy(o.end) : n.push(o);
+      const s = t[i], o = t[i - 1];
+      o.includedAngle(s) < e ? o.end.copy(s.end) : n.push(s);
     }
     return n;
   }
@@ -1151,17 +1151,17 @@ class X extends j {
     if (t.length < 3) return t;
     const e = [t[0]];
     for (let n = 1; n < t.length; n++) {
-      const i = t[n - 1], o = t[n];
-      if (i.distance(o) < this.width * 0.5) {
+      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(o));
+        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));
       } else
-        e.push(o);
+        e.push(s);
     }
     return e;
   }
@@ -1172,26 +1172,26 @@ class X extends j {
    */
   lineSegmentStraightening(t) {
     for (let i = 0; i < t.length; i++) {
-      const o = t[i], s = t[(i + 1) % t.length];
-      if (o.distance(s) > this.shortLine) {
+      const s = t[i], o = t[(i + 1) % t.length];
+      if (s.distance(o) > this.shortLine) {
         t.push(...t.slice(0, i + 1)), t.splice(0, i + 1);
         break;
       }
     }
     const e = this.mergeSameDirectionLine(k(t)), n = [e[0]];
     for (let i = 1; i < e.length; i++) {
-      const o = e[i], s = e[(e.length + i - 1) % e.length];
-      if (o.length() > this.width * 0.9) {
-        n.push(o);
+      const s = e[i], o = e[(e.length + i - 1) % e.length];
+      if (s.length() > this.width * 0.9) {
+        n.push(s);
         continue;
       }
       const r = e[i + 1];
       if (r && r.length() > this.width * 0.9) {
-        n.push(o), n.push(r), i = i + 1;
+        n.push(s), n.push(r), i = i + 1;
         continue;
       }
-      const c = e[i + 2];
-      c && s.includedAngle(c) < 2 ? (i = i + 2, n.push(c)) : n.push(o);
+      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)) : [];
   }
@@ -1201,24 +1201,24 @@ class X extends j {
    * @param path 
    */
   removeShortLine(t, e = this.shortLine) {
-    const n = k(t), i = [], o = Math.PI / 180;
-    for (let s = 0; s < n.length; s++) {
-      const r = n[s], c = r.length(), a = s;
-      if (c > e || i.length === 0) {
+    const n = k(t), i = [], s = Math.PI / 180;
+    for (let o = 0; o < n.length; o++) {
+      const r = n[o], a = r.length(), c = o;
+      if (a > e || i.length === 0) {
         i.push(r);
         continue;
       }
-      let h = n[++s];
+      let h = n[++o];
       const l = i[i.length - 1], d = l.direction();
-      for (; s < n.length; ) {
-        const m = d.angleBetween(h.direction()) / o;
+      for (; o < n.length; ) {
+        const m = d.angleBetween(h.direction()) / s;
         if (h.length() <= e || m < 4 || m > 176)
-          h = n[++s];
+          h = n[++o];
         else break;
       }
       if (!h) continue;
-      const f = n[s - 1];
-      if (l.length() > f.length()) {
+      const p = n[o - 1];
+      if (l.length() > p.length()) {
         const m = l.getIntersection(h);
         if (m) {
           const g = l.points[1].clone(), u = h.points[0].clone();
@@ -1227,7 +1227,7 @@ class X extends j {
           l.points[1].copy(h.points[0]);
         i.push(h);
       } else
-        s = a;
+        o = c;
     }
     return i.length > 3 ? J(i) : [];
   }
@@ -1236,12 +1236,12 @@ class X extends j {
    */
   lineOffset(t = X.EndType.etOpenSquare, e = X.JoinType.jtMiter, n = 1e4) {
     let i = new F.Paths();
-    const o = new F.ClipperOffset(20, 0.25);
-    return this.pointsGroups.forEach((s) => {
-      const r = this.lineTopology(s).map((c) => c.map((a) => a.clone().mutiplyScalar(n)));
-      o.AddPaths(r, e, t);
-    }), o.Execute(i, this.width / 2 * n), this.wallsGroup = i.map((s) => {
-      let r = s.map((c) => p.from(c).divisionScalar(n));
+    const s = new F.ClipperOffset(20, 0.25);
+    return this.pointsGroups.forEach((o) => {
+      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((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",
@@ -1254,9 +1254,9 @@ class X extends j {
   to3DArray(t, e = this.originalZAverage) {
     const n = [];
     return this.wallsGroup.forEach((i) => {
-      for (let o = 0; o < i.length; o++) {
-        const s = i[o], r = o === i.length - 1 ? 0 : o + 1, c = i[r];
-        n.push(s.X * t, s.Y * t, e, c.X * t, c.Y * t, e);
+      for (let s = 0; s < i.length; s++) {
+        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);
   }
@@ -1267,11 +1267,11 @@ class X extends j {
    * @returns 
    */
   getArcAngleRange(t, e, n) {
-    const i = e.x - t.x, o = e.y - t.y, s = n.x - t.x, r = n.y - t.y;
-    let c = Math.atan2(o, i), a = Math.atan2(r, s);
-    c = c < 0 ? c + 2 * Math.PI : c, a = a < 0 ? a + 2 * Math.PI : a;
+    const i = e.x - t.x, s = e.y - t.y, o = n.x - t.x, r = n.y - t.y;
+    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,62 +1288,62 @@ class X extends j {
       scale: e
     };
     let i = "white";
-    function o(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 s(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, f = a[d];
-        o(l, f);
+    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();
+        const l = c.normal();
         let d = new L(
           h.start.clone(),
           h.start.clone().add(l.clone().multiplyScalar(h.length()))
         );
-        const f = d.clone().directionMove(d.normal(), h.length() * -0.5).expandToRectangle(h.length(), "bothSides");
-        for (let b = 0; b < c.length; b++)
-          if (c[b].intersectRectangle(f)) {
+        const p = d.clone().directionMove(d.normal(), h.length() * -0.5).expandToRectangle(h.length(), "bothSides");
+        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((b, P) => o(b, 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);
-        s(x, u, Math.min(w, S), Math.max(w, S)), c.push(f);
+        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) => o(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) => o(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) => o(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, f = p.from(l), m = f.clone().add(a.direction().multiplyScalar(d * 0.5)), g = f.clone().add(a.direction().multiplyScalar(-d * 0.5)), u = new L(m, g);
-        o(u.start, u.end), u.expandToRectangle(this.width, "bothSides").path2D((x, w) => o(x, w));
+        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((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;
   }
@@ -1351,36 +1351,36 @@ class X extends j {
    * 
    * @param type 
    */
-  async toDxfImageBlob(t = "Centimeters", e = "image/jpeg") {
-    const n = this.toDrawDataJson(t);
-    let i;
+  async toDxfImageBlob(t = "Centimeters", e = "image/jpeg", n = "#000") {
+    const i = this.toDrawDataJson(t);
+    let s;
     if (typeof window < "u")
-      i = document.createElement("canvas");
+      s = document.createElement("canvas");
     else if (typeof global < "u") {
       const { createCanvas: c } = await G("canvas");
-      i = c();
+      s = c();
     } else
       throw new Error("创建画布失败");
-    const o = 2 * n.scale, s = {
+    const o = 2 * i.scale, r = {
       cyan: "cyan",
       yellow: "yellow",
       white: "white"
     };
-    i.width = n.width + o * 2, i.height = n.height + o * 2;
-    const r = i.getContext("2d");
-    return r.fillRect(0, 0, i.width, i.height), r.translate(n.width * 0.5 + o, n.height * 0.5 + o), n.line.forEach(([c, a, h, l, d]) => {
-      r.strokeStyle = s[d], r.beginPath(), r.moveTo(c, a), r.lineTo(h, l), r.closePath(), r.stroke();
-    }), n.arc.forEach(([c, a, h, l, d, f]) => {
-      r.strokeStyle = s[f], r.beginPath(), r.arc(c, a, h, l * (Math.PI / 180), d * (Math.PI / 180)), r.stroke();
-    }), r.beginPath(), n.dimensionLine.forEach((c) => {
-      let [a, h, l, d] = c;
-      const f = Math.min(h, d), m = Math.max(h, d), g = (i.width * 0.5 - 0.4 * n.scale) * (a < 0 ? -1 : 1), u = (m - f) * 0.45;
-      r.fillStyle = "#fff", r.font = `${0.15 * n.scale}px Arial`, r.textAlign = "center", r.textBaseline = "middle", r.fillText((m - f).toFixed(2) + "cm", g, f + (m - f) * 0.5), r.moveTo(g - 0.1 * n.scale, f), r.lineTo(g + 0.1 * n.scale, f), r.moveTo(g, f), r.lineTo(g, u + f), r.moveTo(g, m), r.lineTo(g, m - u), r.moveTo(g - 0.1 * n.scale, m), r.lineTo(g + 0.1 * n.scale, m);
-    }), r.closePath(), r.strokeStyle = "#fff", r.stroke(), "toBlob" in i ? new Promise((c) => {
-      i.toBlob((a) => {
-        c(a);
+    s.width = i.width + o * 2, s.height = i.height + o * 2;
+    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;
+      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) => {
+        c(h);
       }, e, 1);
-    }) : i.toBuffer(e, { quality: 1 });
+    }) : s.toBuffer(e, { quality: 1 });
   }
   /**
    * 将点json结构转换为Dxf string
@@ -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 [o, s, r, c, a] = i;
-      e.setActiveLayer(a), e.drawLine(o, s, r, c);
+      let [s, o, r, a, c] = i;
+      e.setActiveLayer(c), e.drawLine(s, o, r, a);
     }), n.arc.forEach((i) => {
-      const [o, s, r, c, a, h] = i;
-      e.setActiveLayer(h), e.drawArc(o, s, r, c, a);
+      const [s, o, r, a, c, h] = i;
+      e.setActiveLayer(h), e.drawArc(s, o, r, a, c);
     }), e.toDxfString();
   }
   /**
@@ -1422,8 +1422,8 @@ class X extends j {
     const i = await this.toDxfImageBlob(e, n);
     if (!i) return !1;
     if (typeof window < "u") {
-      const o = document.createElement("a");
-      o.href = URL.createObjectURL(i), o.download = t, o.click();
+      const s = document.createElement("a");
+      s.href = URL.createObjectURL(i), s.download = t, s.click();
     } else typeof global < "u" ? (await G("fs", !1)).writeFileSync(t, i) : console.error("图片下载失败");
     return !0;
   }
@@ -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]), o = Math.min(...n), s = Math.min(...i), r = Math.max(...n), c = Math.max(...i);
-    return e.set(o, s, 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;
   }
   /**
    * 创建数据
@@ -1443,20 +1443,20 @@ class X extends j {
    */
   static createData(t, e = !0) {
     let n = 0;
-    return t.flatMap((o) => {
-      const s = o.map((r, c) => {
-        const a = c === o.length - 1 ? 0 : c + 1, h = o[a];
+    return t.flatMap((s) => {
+      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
             }
           ]
         };
       });
-      return n += o.length, e || (s.pop(), s[s.length - 1].insetionArr.length = 0, n--), s;
+      return n += s.length, e || (o.pop(), o[o.length - 1].insetionArr.length = 0, n--), o;
     });
   }
 }
@@ -1464,43 +1464,44 @@ const I = new L();
 class ot extends X {
   static name = "AngleCorrectionDxf";
   onAddFromParent(t) {
-    const e = t.findComponentByName("Dxf"), n = t.findComponentByName("LineAnalysis");
-    n.addEventListener("analysisCompleted", async () => {
-      let i = 0, o = null;
-      for (let a = 0; a < e.originalData.length; a++) {
-        const h = e.originalData[a];
-        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 L(l, d).direction().angleBetween(new p(0, 1), "angle", "360"), o = null;
-          break;
-        }
-        (!o || I.length() > o.length()) && (o = I.clone(), o.userData.index = a);
-      }
-      if (o) {
-        e.originalData[o.userData.index].isVerticalReferenceLine = !0;
-        const [a, h] = o.start.y < o.end.y ? [o.start, o.end] : [o.end, o.start];
-        i = -new L(a, h).direction().angleBetween(new p(0, 1), "angle", "360");
+    t.findComponentByName("LineAnalysis").addEventListener("analysisCompleted", async () => this.update());
+  }
+  async update() {
+    const t = this.parent, e = t.findComponentByName("Dxf"), n = t.findComponentByName("LineAnalysis");
+    let i = 0, s = null;
+    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 L(l, d).direction().angleBetween(new f(0, 1), "angle", "360"), s = null;
+        break;
       }
-      const s = e.originalBox.center, r = p.zero(), c = e.originalData.map((a) => {
-        const h = r.copy(a.start).division(s).rotate(p.zero(), i * (Math.PI / 180)).toJson(a.start.z), l = r.copy(a.end).division(s).rotate(p.zero(), i * (Math.PI / 180)).toJson(a.end.z), d = Object.assign(O(a), { start: h, end: l });
-        return d.drawWindow && d.drawWindow.forEach((f) => {
-          f.p = r.copy(f.p).division(s).rotate(p.zero(), i * (Math.PI / 180)).toJson(f.p.z), f.p.y = -f.p.y;
-        }), d;
-      });
-      n.appendLineSegmentList.forEach((a) => {
-        const h = a.clone();
-        h.start.division(s).rotate(p.zero(), i * (Math.PI / 180)), h.end.division(s).rotate(p.zero(), i * (Math.PI / 180)), c.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();
-        return h.start.division(s).rotate(p.zero(), i * (Math.PI / 180)), h.end.division(s).rotate(p.zero(), i * (Math.PI / 180)), h.start.y = -h.start.y, h.end.y = -h.end.y, h;
+      (!s || I.length() > s.length()) && (s = I.clone(), s.userData.index = c);
+    }
+    if (s) {
+      e.originalData[s.userData.index].isVerticalReferenceLine = !0;
+      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(), 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((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()
       });
+    }), 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;
     });
   }
 }
@@ -1586,9 +1587,9 @@ class q {
    * @returns 象限索引（0:西北,1:东北,2:西南,3:东南）或-1（跨多个象限）
    */
   getQuadrant(t) {
-    const e = this.children[0].bounds.intersectLineSegment(t), n = this.children[1].bounds.intersectLineSegment(t), i = this.children[2].bounds.intersectLineSegment(t), o = this.children[3].bounds.intersectLineSegment(t);
-    let s = 0, r = -1;
-    return e && (s++, r = 0), n && (s++, r = 1), i && (s++, r = 2), o && (s++, r = 3), s === 1 ? r : -1;
+    const e = this.children[0].bounds.intersectLineSegment(t), n = this.children[1].bounds.intersectLineSegment(t), i = this.children[2].bounds.intersectLineSegment(t), s = this.children[3].bounds.intersectLineSegment(t);
+    let o = 0, r = -1;
+    return e && (o++, r = 0), n && (o++, r = 1), i && (o++, r = 2), s && (o++, r = 3), o === 1 ? r : -1;
   }
   /**
    * 细分当前节点为四个子节点
@@ -1650,17 +1651,17 @@ class q {
     );
     if (!this.bounds.intersectBox(i))
       return n;
-    for (const o of this.nodes) {
-      const [s, r] = o.line.points, c = r.x - s.x, a = r.y - s.y, h = c * c + a * a;
-      let l = ((t.x - s.x) * c + (t.y - s.y) * a) / h;
+    for (const s of this.nodes) {
+      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 = s.x + l * c, f = s.y + l * a;
-      t.distance(new p(d, f)) <= e && n.push(o);
+      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 o of this.children)
-        n.push(...o.queryCircle(t, e));
-    return n;
+      for (const s of this.children)
+        n.push(...s.queryCircle(t, e));
+    return n.sort((s) => s.line.length()), n;
   }
   /**
    * 查询与矩形相交的线段节点
@@ -1701,8 +1702,8 @@ class q {
    * @returns 
    */
   boundsToArray(t = [], e, n = !0) {
-    return !this.isLeaf && n && this.children?.forEach((i) => i.boundsToArray(t, e)), t.push(...this.bounds.points.flatMap((i, o, s) => {
-      const r = s[(o + 1) % s.length];
+    return !this.isLeaf && n && this.children?.forEach((i) => i.boundsToArray(t, e)), t.push(...this.bounds.points.flatMap((i, s, o) => {
+      const r = o[(s + 1) % o.length];
       return e?.push(...this.color), e?.push(...this.color), [i.x, i.y, 0, r.x, r.y, 0];
     })), t;
   }
@@ -1723,8 +1724,8 @@ class U {
       throw new Error("无效的点坐标");
     const n = this.getGridId(t);
     this.map.has(n) || this.map.set(n, /* @__PURE__ */ new Set());
-    const i = this.map.get(n), o = { point: t, userData: e };
-    i.add(o), t.userData.pointVirtualGrid = { set: i, target: o };
+    const i = this.map.get(n), s = { point: t, userData: e };
+    i.add(s), t.userData.pointVirtualGrid = { set: i, target: s };
   }
   /**
    * 批量加入
@@ -1757,7 +1758,7 @@ class U {
    */
   decodeGridId(t) {
     const [e, n] = t.split(".").map(Number);
-    return new p(e, n);
+    return new f(e, n);
   }
   /**
    * 查询与矩形相交的点
@@ -1765,12 +1766,12 @@ class U {
    * @returns 相交的节点数组
    */
   queryRect(t) {
-    const e = t.toBox(), n = Math.ceil(e.minX / this.gridSize), i = Math.ceil(e.maxX / this.gridSize), o = Math.ceil(e.minY / this.gridSize), s = Math.ceil(e.maxY / this.gridSize);
+    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 = o; c <= s; 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);
         });
       }
@@ -1782,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), o = Math.ceil(n.maxX / this.gridSize), s = Math.ceil(n.minY / this.gridSize), r = Math.ceil(n.maxY / this.gridSize), c = [];
-    for (let a = i; a <= o; a++)
-      for (let h = s; h <= r; h++) {
-        const l = `${a}.${h}`;
+    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 = `${c}.${h}`;
         if (!this.map.has(l)) continue;
-        this.map.get(l)?.forEach((f) => {
-          t.distance(f.point) <= e && c.push(f);
+        this.map.get(l)?.forEach((p) => {
+          t.distance(p.point) <= e && a.push(p);
         });
       }
-    return c;
+    return a;
   }
   /**
    * 查询与包围盒相交的点
@@ -1799,16 +1800,16 @@ class U {
    * @returns 相交的节点数组
    */
   queryBox(t) {
-    const e = Math.ceil(t.minX / this.gridSize), n = Math.ceil(t.maxX / this.gridSize), i = Math.ceil(t.minY / this.gridSize), o = Math.ceil(t.maxY / this.gridSize), s = [];
+    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 <= o; c++) {
-        const a = `${r}.${c}`;
-        if (!this.map.has(a)) continue;
-        this.map.get(a)?.forEach((l) => {
-          t.containsPoint(l.point) && s.push(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);
         });
       }
-    return s;
+    return o;
   }
   /**
    * 查找相同点
@@ -1816,10 +1817,17 @@ class U {
    */
   queryPoint(t) {
     const e = this.getGridId(t), n = [];
-    return this.map.has(e) && this.map.get(e)?.forEach((o) => {
-      t.equal(o.point) && n.push(o);
+    return this.map.has(e) && this.map.get(e)?.forEach((s) => {
+      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 {
   // 所有可查找的点位
@@ -1844,44 +1852,44 @@ class rt {
       this.pointVirtualGrid.insert(n.start, n), this.pointVirtualGrid.insert(n.end, n);
     }), this.doorPoint = this.getDoorPoint(), !this.continueFind) return;
     const e = this.searchDoubleLinePoint();
-    this.addPointsExcludeRule((n, i, o) => {
-      const s = this.lineSegments.indexOf(n), r = e.get(s);
-      return typeof r == "number" ? r === -1 || r === o : !1;
-    }), this.addPointsExcludeRule((n, i) => !!this.doorPoint.find((o) => o.point.equal(i))), this.possibleDoorPoints = this.getPossiblePoints(), this.possibleDoorPoints.forEach((n) => this.findPointVirtualGrid.insert(n.point, n.line)), this.handle();
+    this.addPointsExcludeRule((n, i, s) => {
+      const o = this.lineSegments.indexOf(n), r = e.get(o);
+      return typeof r == "number" ? r === -1 || r === s : !1;
+    }), this.addPointsExcludeRule((n, i) => !!this.doorPoint.find((s) => s.point.equal(i))), this.possibleDoorPoints = this.getPossiblePoints(), this.possibleDoorPoints.forEach((n) => this.findPointVirtualGrid.insert(n.point, n.line)), this.handle();
   }
   handle() {
     this.dxf.doorLineSegment.push(...this.search(this.doorPoint, this.possibleDoorPoints, 0.5)), this.doorPoint.length < 2 && this.dxf.doorLineSegment.push(...this.search(this.possibleDoorPoints, this.possibleDoorPoints, 0.6));
   }
-  search(t, e = [], n = 0.6, i = this.doorSearchDistance, o = this.doorSearchNearAngle) {
-    const s = this.dxf, r = this.searchNearby(t, e, i, o);
+  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 L(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(), f = h.direction(), m = (l - s.width * 2) / 2;
+      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(f.clone().multiplyScalar(s.width + m * g)), x = new L(
+        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 
@@ -1897,8 +1905,8 @@ class rt {
     const t = [];
     return this.lineSegments.forEach((e) => {
       e.points.forEach((n, i) => {
-        for (let s = 0; s < this._pointsExcludeRule.length; s++) if (this._pointsExcludeRule[s](e, n, i)) return;
-        this.pointVirtualGrid.queryPoint(n).filter((s) => s.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: z() });
+        for (let o = 0; o < this._pointsExcludeRule.length; o++) if (this._pointsExcludeRule[o](e, n, i)) return;
+        this.pointVirtualGrid.queryPoint(n).filter((o) => o.userData !== e).length === 0 && t.push({ line: e, point: n, uuid: N() });
       });
     }), t;
   }
@@ -1908,23 +1916,23 @@ class rt {
   getDoorPoint() {
     const t = [], e = this.dxf, n = this.pointVirtualGrid;
     return e.doors.forEach((i) => {
-      const o = e.lineSegments[i[4]], s = e.originalData[i[4]];
-      if (s.drawDoorData) {
-        const r = p.from(s.drawDoorData.start), c = p.from(s.drawDoorData.n), a = n.queryPoint(r).filter((h) => {
-          if (h.userData === o) return !1;
+      const s = e.lineSegments[i[4]], o = e.originalData[i[4]];
+      if (o.drawDoorData) {
+        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 f = c.angleBetween(d, "angle");
-          return f > 80 || f < 10;
+          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: z()
+          uuid: N()
         });
-      } else if (s.doorDirectConnection) {
+      } else if (o.doorDirectConnection) {
         this.continueFind = !1;
-        const r = new L(p.from(s.start), p.from(s.end));
+        const r = new L(f.from(o.start), f.from(o.end));
         r.userData = {
           doorDirectConnection: !0,
           isDoor: !0
@@ -1940,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], o = i.projectPoint(n.start), s = i.projectPoint(n.end), r = n.projectPoint(i.start), c = n.projectPoint(i.end), a = o && s ? -1 : o ? 0 : s ? 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;
   }
   /** 查找方案一：最近点查找
@@ -1953,11 +1961,11 @@ class rt {
    * @returns 
    */
   searchNearby(t, e = [], n = this.doorSearchDistance, i = this.doorSearchNearAngle) {
-    const o = this.findPointVirtualGrid, s = this.quadtree;
+    const s = this.findPointVirtualGrid, o = this.quadtree;
     function r({ point: u, line: x }, w, S) {
       const b = x.direction();
       x.start === u && b.multiplyScalar(-1);
-      const P = o.queryCircle(u, n).filter((D) => D.userData !== x).sort((D, E) => D.point.distance(u) - E.point.distance(u)), A = [];
+      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;
@@ -1965,7 +1973,7 @@ class rt {
         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 && (s.queryLineSegment(C).length || A.push({
+          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],
             findUuid: Y,
             doorLine: C,
@@ -1975,7 +1983,7 @@ class rt {
       }
       return A;
     }
-    function c(u, x, w, S, b) {
+    function a(u, x, w, S, b) {
       S.add(u);
       const P = [];
       b && P.push(b);
@@ -1983,19 +1991,19 @@ class rt {
         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()), 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);
       }
@@ -2007,15 +2015,15 @@ class rt {
         for (let x = 1; x < u.length; x++) d.add(u[x]);
       }
     });
-    const f = [], m = [];
+    const p = [], m = [];
     h.forEach((u) => {
       if (u.length) {
         const x = u[0];
-        d.has(x) || (f.push(x), m.push(x.doorUuid, x.findUuid));
+        d.has(x) || (p.push(x), m.push(x.doorUuid, x.findUuid));
       }
     });
     const g = [];
-    return f.forEach((u) => {
+    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(), 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);
@@ -2049,16 +2057,16 @@ class rt {
    * @returns 
    */
   searchAlongDirection({ point: t, line: e }, n = this.doorSearchDistance) {
-    const i = this.quadtree, o = e.direction();
-    e.start === t && o.multiplyScalar(-1);
-    const s = t.clone().add(o.clone().multiplyScalar(n)), r = new L(t.clone(), s), 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(o, "angle")) < 5)
-        return a;
+    const i = this.quadtree, s = e.direction();
+    e.start === t && s.multiplyScalar(-1);
+    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;
     }
   }
   /** 方案三： 沿法线方向查找
@@ -2068,20 +2076,20 @@ class rt {
    * @returns 
    */
   searchAlongNormalDirection({ point: t, line: e }, n = this.doorSearchDistance) {
-    const i = this.pointVirtualGrid, o = this.quadtree, s = e.direction(), r = e.start.normal(e.end), c = e.start.clone();
-    e.start === t && s.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 f = a[d], m = f.userData, g = m.direction();
-      if (m.start === f.point && s.multiplyScalar(-1), g.angleBetween(r) / (Math.PI / 180) > 90) {
+    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 L(t.clone(), t.clone().add(r.multiplyScalar(n))), l = o.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, f) => t.distance(d.point) - t.distance(f.point));
+    })).filter((d) => d.point).sort((d, p) => t.distance(d.point) - t.distance(p.point));
     if (l.length) {
       const d = l[0];
       if (Math.abs(90 - d.line.direction().angleBetween(r, "angle")) < 5)
@@ -2095,17 +2103,17 @@ class rt {
    */
   findLongLineSegment(t) {
     const e = t.clone(), n = this.pointVirtualGrid.queryPoint(t.start), i = this.pointVirtualGrid.queryPoint(t.end);
-    for (let o = 0; o < n.length; o++) {
-      const { userData: s } = n[o];
-      if (s !== t && s && s.directionEqual(t)) {
-        s.start.equal(t.start) ? e.start.copy(s.end) : e.start.copy(s.start);
+    for (let s = 0; s < n.length; s++) {
+      const { userData: o } = n[s];
+      if (o !== t && o && o.directionEqual(t)) {
+        o.start.equal(t.start) ? e.start.copy(o.end) : e.start.copy(o.start);
         break;
       }
     }
-    for (let o = 0; o < i.length; o++) {
-      const { userData: s } = i[o];
-      if (s !== t && s && s.directionEqual(t)) {
-        s.end.equal(t.end) ? e.end.copy(s.start) : e.end.copy(s.end);
+    for (let s = 0; s < i.length; s++) {
+      const { userData: o } = i[s];
+      if (o !== t && o && o.directionEqual(t)) {
+        o.end.equal(t.end) ? e.end.copy(o.start) : e.end.copy(o.end);
         break;
       }
     }
@@ -2136,15 +2144,15 @@ class at extends j {
    * @returns 
    */
   expandLineSegment(t, e, n = 0.1) {
-    const i = e.normal(t), o = e.direction(t).mutiplyScalar(n * 0.5), s = 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 p(t.x + r, t.y + c).add(s),
-        new p(e.x + r, e.y + c).add(o),
+        new f(t.x + r, t.y + a).add(o),
+        new f(e.x + r, e.y + a).add(s),
         // 第二条线
-        new p(t.x - r, t.y - c).add(s),
-        new p(e.x - r, e.y - c).add(o)
+        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]
@@ -2166,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 o = n.points[0].distance(i.points[0]), s = n.points[1].distance(i.points[1]), r = Math.ceil(Math.max(o, s) / e.width), c = o / r, a = s / r, h = i.points[0].direction(n.points[0]), l = i.points[1].direction(n.points[1]), d = n.points[0].clone(), f = n.points[1].clone(), m = f.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 = f.clone().add(m.multiplyScalar(-1)), x = d.direction(f), w = g.direction(u);
+    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), f.set(u.x, u.y);
+      d.set(g.x, g.y), p.set(u.x, u.y);
       for (let S = 1; S < r; S++) {
-        const b = h.clone().multiplyScalar(c * S), P = l.clone().multiplyScalar(a * S), A = d.clone().add(b), D = f.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);
       }
     }
@@ -2199,13 +2207,13 @@ class at extends j {
   lineAnalysis() {
     this.buildQuadtree();
     const t = this.quadtree, e = this.lineSegmentList, n = /* @__PURE__ */ new Set(), i = [];
-    e.forEach((o, s) => {
-      const r = e[s], c = N.fromByLineSegment(r, this.width * 2, !1, -0.01);
-      t.queryRect(c).map((h) => h.userData).filter((h) => h !== s).forEach((h) => {
+    e.forEach((s, o) => {
+      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(`${s}-${h}`) || n.has(`${h}-${s}`)) return;
-          const l = this.projectionAnalysis(h, s, r, e);
-          l && i.push(l), n.add(`${s}-${h}`);
+          if (n.has(`${o}-${h}`) || n.has(`${h}-${o}`)) return;
+          const l = this.projectionAnalysis(h, o, r, e);
+          l && i.push(l), n.add(`${o}-${h}`);
         } catch {
         }
       });
@@ -2218,25 +2226,25 @@ class at extends j {
    * @returns 
    */
   projectionAnalysis(t, e, n, i) {
-    const o = i[t], s = n.direction(), r = o.direction(), c = s.angleBetween(r) / (Math.PI / 180);
-    if (c < this.errorAngle || c > 180 - this.errorAngle) {
-      let a;
-      const h = o.projectLineSegment(n), l = n.projectLineSegment(o);
-      return h.getLength() > l.getLength() ? a = {
-        target: o,
+    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() ? c = {
+        target: s,
         targetIndex: t,
         source: n,
         sourceIndex: e,
         project: h,
         project2: l
-      } : a = {
+      } : c = {
         target: n,
         targetIndex: e,
-        source: o,
+        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;
@@ -2274,15 +2282,15 @@ class ct extends it {
 }
 const ht = new et(), lt = new nt();
 function dt(y, t, e = 0.1) {
-  const n = t.normal(y), i = t.direction(y).mutiplyScalar(e * 0.5), o = y.direction(t).mutiplyScalar(e * 0.5), s = n.x * e * 0.5, r = n.y * e * 0.5;
+  const n = t.normal(y), i = t.direction(y).mutiplyScalar(e * 0.5), s = y.direction(t).mutiplyScalar(e * 0.5), o = n.x * e * 0.5, r = n.y * e * 0.5;
   return {
     points: [
       // 第一条线
-      new p(y.x + s, y.y + r).add(o),
-      new p(t.x + s, t.y + r).add(i),
+      new f(y.x + o, y.y + r).add(s),
+      new f(t.x + o, t.y + r).add(i),
       // 第二条线
-      new p(y.x - s, y.y - r).add(o),
-      new p(t.x - s, t.y - r).add(i)
+      new f(y.x - o, y.y - r).add(s),
+      new f(t.x - o, t.y - r).add(i)
     ],
     indices: [0, 1, 1, 3, 3, 2, 2, 0],
     rectIndices: [0, 1, 3, 2, 0]
@@ -2309,35 +2317,35 @@ 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));
-      const o = new M.ExtrudeGeometry(i, {
+      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
-      }), s = new M.Mesh(o, this.material);
-      this.whiteModelGroup.add(s), this.whiteModelLineGroup.add(
-        new M.LineSegments(new M.EdgesGeometry(o), new M.LineBasicMaterial({ color: 0 }))
+      }), o = new M.Mesh(s, this.material);
+      this.whiteModelGroup.add(o), this.whiteModelLineGroup.add(
+        new M.LineSegments(new M.EdgesGeometry(s), new M.LineBasicMaterial({ color: 0 }))
       );
-    }), t.originalData.map(({ start: n, end: i, insetionArr: o }) => {
-      const s = new p(n.x, n.y).mutiplyScalar(t.scale), r = new p(i.x, i.y).mutiplyScalar(t.scale), { points: c, indices: a, rectIndices: h } = dt(s, r, t.width);
+    }), 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: a, indices: c, rectIndices: h } = dt(o, r, t.width);
       return {
-        points: c,
-        indices: a,
+        points: a,
+        indices: c,
         rectIndices: h,
-        insetions: (o ?? []).map((l) => l.index)
+        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 o = new M.ExtrudeGeometry(i, {
+      const s = new M.ExtrudeGeometry(i, {
         depth: 2.8,
         bevelSize: 0
       });
-      if (o.attributes.position.array.filter((r) => Number.isNaN(r)).length) return;
-      const s = new M.Mesh(o);
-      this.originalWhiteMode?.add(s);
+      if (s.attributes.position.array.filter((r) => Number.isNaN(r)).length) return;
+      const o = new M.Mesh(s);
+      this.originalWhiteMode?.add(o);
     }), this.dispatchEvent({
       type: "updateModel",
       originalWhiteMode: this.originalWhiteMode,
@@ -2373,12 +2381,12 @@ class H extends j {
           });
         else if (typeof global != "function")
           try {
-            const n = await G("obj2gltf", !0), i = await G("fs", !1), o = await this.toOBJ();
-            i.writeFileSync(this.uuid, o);
-            const s = await n(this.uuid, {
+            const n = await G("obj2gltf", !0), i = await G("fs", !1), s = await this.toOBJ();
+            i.writeFileSync(this.uuid, s);
+            const o = await n(this.uuid, {
               binary: t
             });
-            i.unlinkSync(this.uuid), e(t ? s : JSON.stringify(s));
+            i.unlinkSync(this.uuid), e(t ? o : JSON.stringify(o));
           } catch (n) {
             e(void 0), console.log(n);
           }
@@ -2459,8 +2467,8 @@ class Z extends j {
         const { default: n } = await import(
           /* @vite-ignore */
           "fs"
-        ), i = n.readFileSync(t), o = JSON.parse(i.toString("utf-8"));
-        this.set(o);
+        ), i = n.readFileSync(t), s = JSON.parse(i.toString("utf-8"));
+        this.set(s);
         return;
       } else
         throw new Error("非node环境不允许使用路径");
@@ -2495,15 +2503,15 @@ class Z extends j {
           e.direction.x,
           e.direction.y,
           e.direction.z
-        ), o = 100;
-        this.racasterHelper(n, i, o), i.z = 0;
-        const r = new M.Raycaster(n, i, 0, o).intersectObject(t.originalWhiteMode);
+        ), s = 100;
+        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({
@@ -2528,8 +2536,8 @@ class K extends j {
     const e = t.to3DArray(1 / t.scale, 0);
     this.dxfLineModel.geometry = new M.BufferGeometry().setAttribute("position", new M.BufferAttribute(e, 3, !0));
     const n = new Float32Array(
-      t.doorLineSegment.flatMap(({ start: o, end: s }) => [o.x, o.y, 0, s.x, s.y, 0])
-    ).map((o) => o / t.scale), i = new Float32Array(t.doorLineSegment.flatMap(() => [1, 0, 0, 0, 1, 0]));
+      t.doorLineSegment.flatMap(({ start: s, end: o }) => [s.x, s.y, 0, o.x, o.y, 0])
+    ).map((s) => s / t.scale), i = new Float32Array(t.doorLineSegment.flatMap(() => [1, 0, 0, 0, 1, 0]));
     this.dxfDoorsLineModel.geometry = new M.BufferGeometry().setAttribute("position", new M.BufferAttribute(n, 3, !0)).setAttribute("color", new M.BufferAttribute(i, 3)), this.dxfModelGroup.position.z = t.originalZAverage, this.dispatchEvent({
       type: "modelUpdate",
       model: this.dxfModelGroup
@@ -2565,36 +2573,37 @@ 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), o = await mt(), s = await xt(), r = new ct().usePlugin(i.ModelDataPlugin.create({
+  const i = await Promise.resolve().then(() => pt), s = await mt(), o = await xt(), r = new ct().usePlugin(i.ModelDataPlugin.create({
     detailsPoint: !1,
     whiteModel: !0
-  })).usePlugin(o.RenderPlugin.create({
+  })).usePlugin(s.RenderPlugin.create({
     originalLine: !1,
     modelData: !1,
     detailsPoint: !1,
     orbitControls: e,
     camera: t
-  })).usePlugin(s.Editor.create({ viewPermission: n })), c = r.findComponentByType(o.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" }), o = new File([await t.toGltfBlob(!0)], "model.glb", { type: "application/octet-stream" }), s = 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,
+    obj: s,
     glb: o,
-    gltf: s,
-    json: r,
-    jpg: e
+    gltf: r,
+    json: a,
+    jpg: e,
+    correctionDxf: i
   };
 }
 function At() {
-  return V;
+  return z;
 }
 export {
   v as B,
@@ -2603,7 +2612,7 @@ export {
   $ as E,
   L,
   ft as M,
-  p as P,
+  f as P,
   q as Q,
   _ as V,
   H as W,
@@ -2612,5 +2621,6 @@ export {
   Et as c,
   At as d,
   yt as g,
-  ut as i
+  ut as i,
+  N as u
 };