@mlightcad/cad-simple-viewer 1.0.20 → 1.0.21

package/dist/index.js

@@ -245,10 +245,10 @@ const z = class z {
     i || (i = t);
     let s = this._defaultCommandGroup;
     if (e) {
-      const o = this._commandsByGroup.find(
-        (r) => r.groupName == e
+      const r = this._commandsByGroup.find(
+        (o) => o.groupName == e
       );
-      o ? s = o : s = {
+      r ? s = r : s = {
         groupName: e,
         commandsByGlobalName: /* @__PURE__ */ new Map(),
         commandsByLocalName: /* @__PURE__ */ new Map()
@@ -427,7 +427,7 @@ class ri {
    * @returns Return svg string of the icon
    */
   createRectCrossIcon(e, t, i = "white") {
-    const n = e / 2, s = e + 2 * t, o = `
+    const n = e / 2, s = e + 2 * t, r = `
       <svg xmlns="http://www.w3.org/2000/svg" width="${s}" height="${s}" viewBox="0 0 ${s} ${s}">
         <rect x="${t}" y="${t}" width="${e}" height="${e}" fill="none" stroke="${i}" />
         <line x1="${n + t}" y1="0" x2="${n + t}" y2="${t}" stroke="${i}" />
@@ -437,7 +437,7 @@ class ri {
       </svg>
     `;
     return this.encodeSvgToCursor(
-      o,
+      r,
       n + t,
       n + t
     );
@@ -701,11 +701,11 @@ class li extends Oe {
         const s = new S(
           Math.min(this.mouseDownPositionX, i.x),
           Math.min(this.mouseDownPositionY, i.y)
-        ), o = new S(
+        ), r = new S(
           Math.max(this.mouseDownPositionX, i.x),
           Math.max(this.mouseDownPositionY, i.y)
         );
-        this.drawRect(s, o);
+        this.drawRect(s, r);
       }
     }, this.mouseup = (t) => {
       if (this.mouseDown && this.mouseMove) {
@@ -715,8 +715,8 @@ class li extends Oe {
         ), s = new S(
           Math.max(this.mouseDownPositionX, i.x),
           Math.max(this.mouseDownPositionY, i.y)
-        ), o = new L(n, s);
-        this.resolve(this.toWcs(o));
+        ), r = new L(n, s);
+        this.resolve(this.toWcs(r));
       }
       this.mouseDown = !1, this.mouseMove = !1, this.mouseDownPositionX = -1, this.mouseDownPositionY = -1;
     }, this.container = e.canvas, this.color = ci;
@@ -1238,14 +1238,14 @@ class pi {
     let n = !0;
     this._fileName = e;
     try {
-      const o = (s = e.split(".").pop()) == null ? void 0 : s.toLocaleLowerCase();
+      const r = (s = e.split(".").pop()) == null ? void 0 : s.toLocaleLowerCase();
       await this._database.read(
         t,
         i,
-        o == "dwg" ? ve.DWG : ve.DXF
+        r == "dwg" ? ve.DWG : ve.DXF
       ), this.docTitle = this._fileName;
-    } catch (o) {
-      n = !1, V.emit("failed-to-open-file", { fileName: e }), console.error(o);
+    } catch (r) {
+      n = !1, V.emit("failed-to-open-file", { fileName: e }), console.error(r);
     }
     return n;
   }
@@ -1423,9 +1423,9 @@ class fi extends Me {
     else {
       const i = e.startPoint, n = e.endPoint, s = re.radToDeg(
         e.majorAxis.angleTo(be.X_AXIS)
-      ), o = e.clockwise ? 0 : 1;
+      ), r = e.clockwise ? 0 : 1;
       this.svg = `
-<path d="M${i.x},${i.y} A${e.majorAxisRadius},${e.minorAxisRadius} ${s} ${e.isLargeArc},${o} ${n.x},${n.y}"/>`;
+<path d="M${i.x},${i.y} A${e.majorAxisRadius},${e.minorAxisRadius} ${s} ${e.isLargeArc},${r} ${n.x},${n.y}"/>`;
     }
     const t = e.box;
     this._box.min.copy(t.min), this._box.max.copy(t.max);
@@ -1708,14 +1708,14 @@ class yt extends Li {
     super(), this.epsilon = e;
   }
   pointAboveOrOnLine(e, t, i) {
-    const n = t[0], s = t[1], o = i[0], r = i[1], a = e[0], h = e[1];
-    return (o - n) * (h - s) - (r - s) * (a - n) >= -this.epsilon;
+    const n = t[0], s = t[1], r = i[0], o = i[1], a = e[0], h = e[1];
+    return (r - n) * (h - s) - (o - s) * (a - n) >= -this.epsilon;
   }
   pointBetween(e, t, i) {
-    const n = e[1] - t[1], s = i[0] - t[0], o = e[0] - t[0], r = i[1] - t[1], a = o * s + n * r;
+    const n = e[1] - t[1], s = i[0] - t[0], r = e[0] - t[0], o = i[1] - t[1], a = r * s + n * o;
     if (a < this.epsilon)
       return !1;
-    const h = s * s + r * r;
+    const h = s * s + o * o;
     return !(a - h > -this.epsilon);
   }
   pointsSameX(e, t) {
@@ -1725,14 +1725,14 @@ class yt extends Li {
     return Math.abs(e[1] - t[1]) < this.epsilon;
   }
   pointsCollinear(e, t, i) {
-    const n = e[0] - t[0], s = e[1] - t[1], o = t[0] - i[0], r = t[1] - i[1];
-    return Math.abs(n * r - o * s) < this.epsilon;
+    const n = e[0] - t[0], s = e[1] - t[1], r = t[0] - i[0], o = t[1] - i[1];
+    return Math.abs(n * o - r * s) < this.epsilon;
   }
   linesIntersect(e, t, i, n) {
-    const s = t[0] - e[0], o = t[1] - e[1], r = n[0] - i[0], a = n[1] - i[1], h = s * a - o * r;
+    const s = t[0] - e[0], r = t[1] - e[1], o = n[0] - i[0], a = n[1] - i[1], h = s * a - r * o;
     if (Math.abs(h) < this.epsilon)
       return null;
-    const l = e[0] - i[0], m = e[1] - i[1], u = (r * m - a * l) / h, p = (s * m - o * l) / h, g = (f) => f <= -this.epsilon ? B.BeforeStart : f < this.epsilon ? B.EqualStart : f - 1 <= -this.epsilon ? B.BetweenStartAndEnd : f - 1 < this.epsilon ? B.EqualEnd : B.AfterEnd, y = [e[0] + u * s, e[1] + u * o];
+    const l = e[0] - i[0], m = e[1] - i[1], u = (o * m - a * l) / h, p = (s * m - r * l) / h, g = (f) => f <= -this.epsilon ? B.BeforeStart : f < this.epsilon ? B.EqualStart : f - 1 <= -this.epsilon ? B.BetweenStartAndEnd : f - 1 < this.epsilon ? B.EqualEnd : B.AfterEnd, y = [e[0] + u * s, e[1] + u * r];
     return {
       alongA: g(u),
       alongB: g(p),
@@ -1766,15 +1766,15 @@ class Ue {
   findTransition(e, t) {
     var i, n;
     const s = (a, h) => t(h) - t(a);
-    let o = 0, r = this.nodes.length;
-    for (; o < r; ) {
-      const a = o + r >> 1;
-      s(this.nodes[a], e) > 0 ? r = a : o = a + 1;
+    let r = 0, o = this.nodes.length;
+    for (; r < o; ) {
+      const a = r + o >> 1;
+      s(this.nodes[a], e) > 0 ? o = a : r = a + 1;
     }
     return {
-      before: o <= 0 ? null : (i = this.nodes[o - 1]) !== null && i !== void 0 ? i : null,
-      after: (n = this.nodes[o]) !== null && n !== void 0 ? n : null,
-      insert: (a) => (this.nodes.splice(o, 0, a), a)
+      before: r <= 0 ? null : (i = this.nodes[r - 1]) !== null && i !== void 0 ? i : null,
+      after: (n = this.nodes[r]) !== null && n !== void 0 ? n : null,
+      insert: (a) => (this.nodes.splice(r, 0, a), a)
     };
   }
 }
@@ -1796,13 +1796,13 @@ class Xe {
   constructor(e, t, i = null) {
     this.events = new Ue(), this.status = new Ue(), this.selfIntersection = e, this.geo = t, this.log = i;
   }
-  compareEvents(e, t, i, n, s, o) {
-    const r = this.geo.pointsCompare(t, s);
-    return r !== 0 ? r : this.geo.pointsSame(i, o) ? 0 : e !== n ? e ? 1 : -1 : this.geo.pointAboveOrOnLine(
+  compareEvents(e, t, i, n, s, r) {
+    const o = this.geo.pointsCompare(t, s);
+    return o !== 0 ? o : this.geo.pointsSame(i, r) ? 0 : e !== n ? e ? 1 : -1 : this.geo.pointAboveOrOnLine(
       i,
-      n ? s : o,
+      n ? s : r,
       // order matters
-      n ? o : s
+      n ? r : s
     ) ? 1 : -1;
   }
   addEvent(e) {
@@ -1830,33 +1830,33 @@ class Xe {
     }
   }
   compareStatus(e, t) {
-    const i = e.seg.start, n = e.seg.end, s = t.seg.start, o = t.seg.end;
-    return this.geo.pointsCollinear(i, s, o) ? this.geo.pointsCollinear(n, s, o) || this.geo.pointAboveOrOnLine(n, s, o) ? 1 : -1 : this.geo.pointAboveOrOnLine(i, s, o) ? 1 : -1;
+    const i = e.seg.start, n = e.seg.end, s = t.seg.start, r = t.seg.end;
+    return this.geo.pointsCollinear(i, s, r) ? this.geo.pointsCollinear(n, s, r) || this.geo.pointAboveOrOnLine(n, s, r) ? 1 : -1 : this.geo.pointAboveOrOnLine(i, s, r) ? 1 : -1;
   }
   statusFindSurrounding(e) {
     return this.status.findTransition(e, (t) => t === e ? 0 : -this.compareStatus(e, t));
   }
   checkIntersection(e, t) {
     var i;
-    const n = e.seg, s = t.seg, o = n.start, r = n.end, a = s.start, h = s.end;
+    const n = e.seg, s = t.seg, r = n.start, o = n.end, a = s.start, h = s.end;
     (i = this.log) === null || i === void 0 || i.checkIntersection(n, s);
-    const l = this.geo.linesIntersect(o, r, a, h);
+    const l = this.geo.linesIntersect(r, o, a, h);
     if (l === null) {
-      if (!this.geo.pointsCollinear(o, r, a) || this.geo.pointsSame(o, h) || this.geo.pointsSame(r, a))
+      if (!this.geo.pointsCollinear(r, o, a) || this.geo.pointsSame(r, h) || this.geo.pointsSame(o, a))
         return null;
-      const m = this.geo.pointsSame(o, a), u = this.geo.pointsSame(r, h);
+      const m = this.geo.pointsSame(r, a), u = this.geo.pointsSame(o, h);
       if (m && u)
         return t;
-      const p = !m && this.geo.pointBetween(o, a, h), g = !u && this.geo.pointBetween(r, a, h);
+      const p = !m && this.geo.pointBetween(r, a, h), g = !u && this.geo.pointBetween(o, a, h);
       if (m)
-        return g ? this.divideEvent(t, r) : this.divideEvent(e, h), t;
-      p && (u || (g ? this.divideEvent(t, r) : this.divideEvent(e, h)), this.divideEvent(t, o));
+        return g ? this.divideEvent(t, o) : this.divideEvent(e, h), t;
+      p && (u || (g ? this.divideEvent(t, o) : this.divideEvent(e, h)), this.divideEvent(t, r));
     } else
-      l.alongA === B.BetweenStartAndEnd && (l.alongB === B.EqualStart ? this.divideEvent(e, a) : l.alongB === B.BetweenStartAndEnd ? this.divideEvent(e, l.p) : l.alongB === B.EqualEnd && this.divideEvent(e, h)), l.alongB === B.BetweenStartAndEnd && (l.alongA === B.EqualStart ? this.divideEvent(t, o) : l.alongA === B.BetweenStartAndEnd ? this.divideEvent(t, l.p) : l.alongA === B.EqualEnd && this.divideEvent(t, r));
+      l.alongA === B.BetweenStartAndEnd && (l.alongB === B.EqualStart ? this.divideEvent(e, a) : l.alongB === B.BetweenStartAndEnd ? this.divideEvent(e, l.p) : l.alongB === B.EqualEnd && this.divideEvent(e, h)), l.alongB === B.BetweenStartAndEnd && (l.alongA === B.EqualStart ? this.divideEvent(t, r) : l.alongA === B.BetweenStartAndEnd ? this.divideEvent(t, l.p) : l.alongA === B.EqualEnd && this.divideEvent(t, o));
     return null;
   }
   calculate(e, t) {
-    var i, n, s, o, r, a, h, l;
+    var i, n, s, r, o, a, h, l;
     const m = [];
     for (; !this.events.isEmpty(); ) {
       const u = this.events.getHead();
@@ -1878,10 +1878,10 @@ class Xe {
             u.seg.myFill.below === null ? x = !0 : x = u.seg.myFill.above !== u.seg.myFill.below, x && (_.seg.myFill.above = !_.seg.myFill.above);
           } else
             _.seg.otherFill = u.seg.myFill;
-          (o = this.log) === null || o === void 0 || o.segmentUpdate(_.seg), this.events.remove(u.other), this.events.remove(u);
+          (r = this.log) === null || r === void 0 || r.segmentUpdate(_.seg), this.events.remove(u.other), this.events.remove(u);
         }
         if (this.events.getHead() !== u) {
-          (r = this.log) === null || r === void 0 || r.rewind(u.seg);
+          (o = this.log) === null || o === void 0 || o.rewind(u.seg);
           continue;
         }
         if (this.selfIntersection) {
@@ -1930,8 +1930,8 @@ function te(c, e, t) {
   for (const n of c) {
     const s = (n.myFill.above ? 8 : 0) + (n.myFill.below ? 4 : 0) + (n.otherFill && n.otherFill.above ? 2 : 0) + (n.otherFill && n.otherFill.below ? 1 : 0);
     if (e[s] !== 0) {
-      const o = new Z(n.start, n.end, null, t);
-      o.myFill.above = e[s] === 1, o.myFill.below = e[s] === 2, i.push(o);
+      const r = new Z(n.start, n.end, null, t);
+      r.myFill.above = e[s] === 1, r.myFill.below = e[s] === 2, i.push(r);
     }
   }
   return t == null || t.selected(i), i;
@@ -1966,8 +1966,8 @@ function Ei(c, e, t) {
       const P = w[w.length - 2], v = b[0], G = b[1];
       e.pointsCollinear(P, I, v) && (t == null || t.chainRemoveTail(_, I), w.pop(), I = P), e.pointsCollinear(I, v, G) && (t == null || t.chainRemoveHead(x, v), b.shift()), t == null || t.chainJoin(_, x), i[_] = w.concat(b), i.splice(x, 1);
     };
-    const o = s.start, r = s.end;
-    if (e.pointsSame(o, r)) {
+    const r = s.start, o = s.end;
+    if (e.pointsSame(r, o)) {
       console.warn("PolyBool: Warning: Zero-length segment detected; your epsilon is probably too small or too large");
       continue;
     }
@@ -1984,25 +1984,25 @@ function Ei(c, e, t) {
     let l = a;
     for (let _ = 0; _ < i.length; _++) {
       const x = i[_], w = x[0], b = x[x.length - 1];
-      if (e.pointsSame(w, o)) {
+      if (e.pointsSame(w, r)) {
         if (m(_, !0, !0))
           break;
-      } else if (e.pointsSame(w, r)) {
+      } else if (e.pointsSame(w, o)) {
         if (m(_, !0, !1))
           break;
-      } else if (e.pointsSame(b, o)) {
+      } else if (e.pointsSame(b, r)) {
         if (m(_, !1, !0))
           break;
-      } else if (e.pointsSame(b, r) && m(_, !1, !1))
+      } else if (e.pointsSame(b, o) && m(_, !1, !1))
         break;
     }
     if (l === a) {
-      i.push([o, r]), t == null || t.chainNew(o, r);
+      i.push([r, o]), t == null || t.chainNew(r, o);
       continue;
     }
     if (l === h) {
       t == null || t.chainMatch(a.index);
-      const _ = a.index, x = a.matches_pt1 ? r : o, w = a.matches_head, b = i[_];
+      const _ = a.index, x = a.matches_pt1 ? o : r, w = a.matches_head, b = i[_];
       let I = w ? b[0] : b[b.length - 1];
       const P = w ? b[1] : b[b.length - 2], v = w ? b[b.length - 1] : b[0], G = w ? b[b.length - 2] : b[1];
       if (e.pointsCollinear(P, I, x) && (w ? (t == null || t.chainRemoveHead(a.index, x), b.shift()) : (t == null || t.chainRemoveTail(a.index, x), b.pop()), I = P), e.pointsSame(v, x)) {
@@ -2166,24 +2166,24 @@ class ft {
   }
   // helper functions for common operations
   union(e, t) {
-    const i = this.segments(e), n = this.segments(t), s = this.combine(i, n), o = this.selectUnion(s);
-    return this.polygon(o);
+    const i = this.segments(e), n = this.segments(t), s = this.combine(i, n), r = this.selectUnion(s);
+    return this.polygon(r);
   }
   intersect(e, t) {
-    const i = this.segments(e), n = this.segments(t), s = this.combine(i, n), o = this.selectIntersect(s);
-    return this.polygon(o);
+    const i = this.segments(e), n = this.segments(t), s = this.combine(i, n), r = this.selectIntersect(s);
+    return this.polygon(r);
   }
   difference(e, t) {
-    const i = this.segments(e), n = this.segments(t), s = this.combine(i, n), o = this.selectDifference(s);
-    return this.polygon(o);
+    const i = this.segments(e), n = this.segments(t), s = this.combine(i, n), r = this.selectDifference(s);
+    return this.polygon(r);
   }
   differenceRev(e, t) {
-    const i = this.segments(e), n = this.segments(t), s = this.combine(i, n), o = this.selectDifferenceRev(s);
-    return this.polygon(o);
+    const i = this.segments(e), n = this.segments(t), s = this.combine(i, n), r = this.selectDifferenceRev(s);
+    return this.polygon(r);
   }
   xor(e, t) {
-    const i = this.segments(e), n = this.segments(t), s = this.combine(i, n), o = this.selectXor(s);
-    return this.polygon(o);
+    const i = this.segments(e), n = this.segments(t), s = this.combine(i, n), r = this.selectXor(s);
+    return this.polygon(r);
   }
 }
 new ft(new yt());
@@ -2199,10 +2199,10 @@ class Se extends d.Object3D {
     function i(s) {
       s.position.set(0, 0, 0), s.rotation.set(0, 0, 0), s.scale.set(1, 1, 1), s.matrix.identity();
     }
-    function n(s, o) {
-      const r = [...s.children];
-      for (const a of r)
-        a.applyMatrix4(o), i(a), a.children.length > 0 ? n(a, a.matrixWorld) : t.push(a);
+    function n(s, r) {
+      const o = [...s.children];
+      for (const a of o)
+        a.applyMatrix4(r), i(a), a.children.length > 0 ? n(a, a.matrixWorld) : t.push(a);
       s.children = [];
     }
     e.updateMatrixWorld(!0), n(e, e.matrixWorld);
@@ -2217,8 +2217,8 @@ class Se extends d.Object3D {
    */
   static disposeObject(e, t = !0) {
     t && e.removeFromParent(), (e instanceof d.Mesh || e instanceof d.Line || e instanceof d.Points) && e.geometry && e.geometry.dispose(), (e instanceof d.Mesh || e instanceof d.Line || e instanceof d.Points) && (Array.isArray(e.material) ? e.material : [e.material]).forEach((i) => {
-      var n, s, o, r, a, h, l, m;
-      i.dispose(), (n = i.map) == null || n.dispose(), (s = i.envMap) == null || s.dispose(), (o = i.lightMap) == null || o.dispose(), (r = i.bumpMap) == null || r.dispose(), (a = i.normalMap) == null || a.dispose(), (h = i.roughnessMap) == null || h.dispose(), (l = i.metalnessMap) == null || l.dispose(), (m = i.alphaMap) == null || m.dispose();
+      var n, s, r, o, a, h, l, m;
+      i.dispose(), (n = i.map) == null || n.dispose(), (s = i.envMap) == null || s.dispose(), (r = i.lightMap) == null || r.dispose(), (o = i.bumpMap) == null || o.dispose(), (a = i.normalMap) == null || a.dispose(), (h = i.roughnessMap) == null || h.dispose(), (l = i.metalnessMap) == null || l.dispose(), (m = i.alphaMap) == null || m.dispose();
     }), e.children.forEach((i) => this.disposeObject(i)), "geometry" in e && (e.geometry = null), "material" in e && (e.material = null), e.children = [];
   }
   /**
@@ -2901,12 +2901,12 @@ class ue {
       if (s === "string") return n.length * 2;
       if (s === "symbol" || s === "function" || t.has(n)) return 0;
       if (t.add(n), Array.isArray(n))
-        return n.map(i).reduce((o, r) => o + r, 0);
+        return n.map(i).reduce((r, o) => r + o, 0);
       if (s === "object") {
-        let o = 0;
-        for (const r in n)
-          Object.prototype.hasOwnProperty.call(n, r) && (o += r.length * 2, o += i(n[r]));
-        return o;
+        let r = 0;
+        for (const o in n)
+          Object.prototype.hasOwnProperty.call(n, o) && (r += o.length * 2, r += i(n[o]));
+        return r;
       }
       return 0;
     }
@@ -2932,8 +2932,8 @@ function je(c, e, t = 0) {
   if (c.isInterleavedBufferAttribute || c.array.constructor !== e.array.constructor) {
     const n = c.count;
     for (let s = 0; s < n; s++)
-      for (let o = 0; o < i; o++)
-        e.setComponent(s + t, o, c.getComponent(s, o));
+      for (let r = 0; r < i; r++)
+        e.setComponent(s + t, r, c.getComponent(s, r));
   } else
     e.array.set(c.array, t * i);
   e.needsUpdate = !0;
@@ -2974,7 +2974,7 @@ class Pi extends d.LineSegments {
     const t = this.geometry, i = this._maxVertexCount, n = this._maxIndexCount;
     if (this._geometryInitialized === !1) {
       for (const s in e.attributes) {
-        const o = e.getAttribute(s), { array: r, itemSize: a, normalized: h } = o, l = new r.constructor(i * a), m = new d.BufferAttribute(
+        const r = e.getAttribute(s), { array: o, itemSize: a, normalized: h } = r, l = new o.constructor(i * a), m = new d.BufferAttribute(
           l,
           a,
           h
@@ -3012,8 +3012,8 @@ class Pi extends d.LineSegments {
     let n = this._maxIndexCount;
     i && this.unusedIndexCount < t.count && (n = (this._maxIndexCount + t.count) * 1.5);
     const s = e.getAttribute("position");
-    let o = this._maxVertexCount;
-    s && this.unusedVertexCount < s.count && (o = (this._maxVertexCount + s.count) * 1.5), (n > this._maxIndexCount || o > this._maxVertexCount) && this.setGeometrySize(o, n);
+    let r = this._maxVertexCount;
+    s && this.unusedVertexCount < s.count && (r = (this._maxVertexCount + s.count) * 1.5), (n > this._maxIndexCount || r > this._maxVertexCount) && this.setGeometrySize(r, n);
   }
   validateGeometryId(e) {
     const t = this._geometryInfo;
@@ -3043,8 +3043,8 @@ class Pi extends d.LineSegments {
       if (n.position) {
         const s = i.create(e, n.position);
         if (s.line) {
-          const o = this.addGeometry(s.line);
-          this.setGeometryInfo(o, n);
+          const r = this.addGeometry(s.line);
+          this.setGeometryInfo(r, n);
         }
       }
     });
@@ -3087,13 +3087,13 @@ class Pi extends d.LineSegments {
       visible: !0
     }, s = this._geometryInfo;
     n.vertexStart = this._nextVertexStart, n.reservedVertexCount = t === -1 ? e.getAttribute("position").count : t;
-    const o = e.getIndex();
-    if (o !== null && (n.indexStart = this._nextIndexStart, n.reservedIndexCount = i === -1 ? o.count : i), n.indexStart !== -1 && n.indexStart + n.reservedIndexCount > this._maxIndexCount || n.vertexStart + n.reservedVertexCount > this._maxVertexCount)
+    const r = e.getIndex();
+    if (r !== null && (n.indexStart = this._nextIndexStart, n.reservedIndexCount = i === -1 ? r.count : i), n.indexStart !== -1 && n.indexStart + n.reservedIndexCount > this._maxIndexCount || n.vertexStart + n.reservedVertexCount > this._maxVertexCount)
       throw new Error(
         "AcTrBatchedLine: Reserved space request exceeds the maximum buffer size."
       );
-    let r;
-    return this._availableGeometryIds.length > 0 ? (this._availableGeometryIds.sort(Ve), r = this._availableGeometryIds.shift(), s[r] = n) : (r = this._geometryCount, this._geometryCount++, s.push(n)), this.setGeometryAt(r, e), this._nextIndexStart = n.indexStart + n.reservedIndexCount, this._nextVertexStart = n.vertexStart + n.reservedVertexCount, r;
+    let o;
+    return this._availableGeometryIds.length > 0 ? (this._availableGeometryIds.sort(Ve), o = this._availableGeometryIds.shift(), s[o] = n) : (o = this._geometryCount, this._geometryCount++, s.push(n)), this.setGeometryAt(o, e), this._nextIndexStart = n.indexStart + n.reservedIndexCount, this._nextVertexStart = n.vertexStart + n.reservedVertexCount, o;
   }
   setGeometryInfo(e, t) {
     if (e >= this._geometryCount)
@@ -3105,13 +3105,13 @@ class Pi extends d.LineSegments {
     if (e >= this._geometryCount)
       throw new Error("AcTrBatchedLine: Maximum geometry count reached.");
     this._validateGeometry(t);
-    const i = this.geometry, n = i.getIndex() !== null, s = i.getIndex(), o = t.getIndex(), r = this._geometryInfo[e];
-    if (n && o.count > r.reservedIndexCount || t.attributes.position.count > r.reservedVertexCount)
+    const i = this.geometry, n = i.getIndex() !== null, s = i.getIndex(), r = t.getIndex(), o = this._geometryInfo[e];
+    if (n && r.count > o.reservedIndexCount || t.attributes.position.count > o.reservedVertexCount)
       throw new Error(
         "AcTrBatchedLine: Reserved space not large enough for provided geometry."
       );
-    const a = r.vertexStart, h = r.reservedVertexCount;
-    r.vertexCount = t.getAttribute("position").count;
+    const a = o.vertexStart, h = o.reservedVertexCount;
+    o.vertexCount = t.getAttribute("position").count;
     for (const l in i.attributes) {
       const m = t.getAttribute(l), u = i.getAttribute(
         l
@@ -3129,15 +3129,15 @@ class Pi extends d.LineSegments {
       );
     }
     if (n && s) {
-      const l = r.indexStart, m = r.reservedIndexCount;
-      r.indexCount = t.getIndex().count;
-      for (let u = 0; u < o.count; u++)
-        s.setX(l + u, a + o.getX(u));
-      for (let u = o.count, p = m; u < p; u++)
+      const l = o.indexStart, m = o.reservedIndexCount;
+      o.indexCount = t.getIndex().count;
+      for (let u = 0; u < r.count; u++)
+        s.setX(l + u, a + r.getX(u));
+      for (let u = r.count, p = m; u < p; u++)
         s.setX(l + u, a);
-      s.needsUpdate = !0, s.addUpdateRange(l, r.reservedIndexCount);
+      s.needsUpdate = !0, s.addUpdateRange(l, o.reservedIndexCount);
     }
-    return r.start = n ? r.indexStart : r.vertexStart, r.count = n ? r.indexCount : r.vertexCount, r.boundingBox = null, t.boundingBox !== null && (r.boundingBox = t.boundingBox.clone()), r.boundingSphere = null, t.boundingSphere !== null && (r.boundingSphere = t.boundingSphere.clone()), e;
+    return o.start = n ? o.indexStart : o.vertexStart, o.count = n ? o.indexCount : o.vertexCount, o.boundingBox = null, t.boundingBox !== null && (o.boundingBox = t.boundingBox.clone()), o.boundingSphere = null, t.boundingSphere !== null && (o.boundingSphere = t.boundingSphere.clone()), e;
   }
   deleteGeometry(e) {
     const t = this._geometryInfo;
@@ -3145,9 +3145,9 @@ class Pi extends d.LineSegments {
   }
   optimize() {
     let e = 0, t = 0;
-    const i = this._geometryInfo, n = i.map((o, r) => r).sort((o, r) => i[o].vertexStart - i[r].vertexStart), s = this.geometry;
-    for (let o = 0, r = i.length; o < r; o++) {
-      const a = n[o], h = i[a];
+    const i = this._geometryInfo, n = i.map((r, o) => o).sort((r, o) => i[r].vertexStart - i[o].vertexStart), s = this.geometry;
+    for (let r = 0, o = i.length; r < o; r++) {
+      const a = n[r], h = i[a];
       if (h.active !== !1) {
         if (s.index !== null) {
           if (h.indexStart !== t) {
@@ -3188,10 +3188,10 @@ class Pi extends d.LineSegments {
       return null;
     const i = this.geometry, n = this._geometryInfo[e];
     if (n.boundingBox === null) {
-      const s = new d.Box3(), o = i.index, r = i.attributes.position;
+      const s = new d.Box3(), r = i.index, o = i.attributes.position;
       for (let a = n.start, h = n.start + n.count; a < h; a++) {
         let l = a;
-        o && (l = o.getX(l)), s.expandByPoint(F.fromBufferAttribute(r, l));
+        r && (l = r.getX(l)), s.expandByPoint(F.fromBufferAttribute(o, l));
       }
       n.boundingBox = s;
     }
@@ -3205,11 +3205,11 @@ class Pi extends d.LineSegments {
     if (n.boundingSphere === null) {
       const s = new d.Sphere();
       this.getBoundingBoxAt(e, Ye), Ye.getCenter(s.center);
-      const o = i.index, r = i.attributes.position;
+      const r = i.index, o = i.attributes.position;
       let a = 0;
       for (let h = n.start, l = n.start + n.count; h < l; h++) {
         let m = h;
-        o && (m = o.getX(m)), F.fromBufferAttribute(r, m), a = Math.max(
+        r && (m = r.getX(m)), F.fromBufferAttribute(o, m), a = Math.max(
           a,
           s.center.distanceToSquared(F)
         );
@@ -3268,9 +3268,9 @@ class Pi extends d.LineSegments {
       if (n.bboxIntersectionCheck) {
         const s = n.boundingBox;
         if (t.ray.intersectBox(s, F)) {
-          const o = t.ray.origin.distanceTo(F);
+          const r = t.ray.origin.distanceTo(F);
           i.push({
-            distance: o,
+            distance: r,
             point: F.clone(),
             object: this,
             face: null,
@@ -3288,9 +3288,9 @@ class Pi extends d.LineSegments {
           n.start,
           n.count
         ), N.raycast(t, me);
-        for (let s = 0, o = me.length; s < o; s++) {
-          const r = me[s];
-          r.object = this, r.batchId = e, r.objectId = n.objectId, i.push(r);
+        for (let s = 0, r = me.length; s < r; s++) {
+          const o = me[s];
+          o.object = this, o.batchId = e, o.objectId = n.objectId, i.push(o);
         }
         me.length = 0;
       }
@@ -3336,7 +3336,7 @@ class Ri extends d.Mesh {
     const t = this.geometry, i = this._maxVertexCount, n = this._maxIndexCount;
     if (this._geometryInitialized === !1) {
       for (const s in e.attributes) {
-        const o = e.getAttribute(s), { array: r, itemSize: a, normalized: h } = o, l = new r.constructor(i * a), m = new d.BufferAttribute(
+        const r = e.getAttribute(s), { array: o, itemSize: a, normalized: h } = r, l = new o.constructor(i * a), m = new d.BufferAttribute(
           l,
           a,
           h
@@ -3374,8 +3374,8 @@ class Ri extends d.Mesh {
     let n = this._maxIndexCount;
     i && this.unusedIndexCount < t.count && (n = (this._maxIndexCount + t.count) * 1.5);
     const s = e.getAttribute("position");
-    let o = this._maxVertexCount;
-    s && this.unusedVertexCount < s.count && (o = (this._maxVertexCount + s.count) * 1.5), (n > this._maxIndexCount || o > this._maxVertexCount) && this.setGeometrySize(o, n);
+    let r = this._maxVertexCount;
+    s && this.unusedVertexCount < s.count && (r = (this._maxVertexCount + s.count) * 1.5), (n > this._maxIndexCount || r > this._maxVertexCount) && this.setGeometrySize(r, n);
   }
   validateGeometryId(e) {
     const t = this._geometryInfo;
@@ -3422,13 +3422,13 @@ class Ri extends d.Mesh {
       visible: !0
     }, s = this._geometryInfo;
     n.vertexStart = this._nextVertexStart, n.reservedVertexCount = t === -1 ? e.getAttribute("position").count : t;
-    const o = e.getIndex();
-    if (o !== null && (n.indexStart = this._nextIndexStart, n.reservedIndexCount = i === -1 ? o.count : i), n.indexStart !== -1 && n.indexStart + n.reservedIndexCount > this._maxIndexCount || n.vertexStart + n.reservedVertexCount > this._maxVertexCount)
+    const r = e.getIndex();
+    if (r !== null && (n.indexStart = this._nextIndexStart, n.reservedIndexCount = i === -1 ? r.count : i), n.indexStart !== -1 && n.indexStart + n.reservedIndexCount > this._maxIndexCount || n.vertexStart + n.reservedVertexCount > this._maxVertexCount)
       throw new Error(
         "AcTrBatchedMesh: Reserved space request exceeds the maximum buffer size."
       );
-    let r;
-    return this._availableGeometryIds.length > 0 ? (this._availableGeometryIds.sort(Ve), r = this._availableGeometryIds.shift(), s[r] = n) : (r = this._geometryCount, this._geometryCount++, s.push(n)), this.setGeometryAt(r, e), this._nextIndexStart = n.indexStart + n.reservedIndexCount, this._nextVertexStart = n.vertexStart + n.reservedVertexCount, r;
+    let o;
+    return this._availableGeometryIds.length > 0 ? (this._availableGeometryIds.sort(Ve), o = this._availableGeometryIds.shift(), s[o] = n) : (o = this._geometryCount, this._geometryCount++, s.push(n)), this.setGeometryAt(o, e), this._nextIndexStart = n.indexStart + n.reservedIndexCount, this._nextVertexStart = n.vertexStart + n.reservedVertexCount, o;
   }
   setGeometryInfo(e, t) {
     if (e >= this._geometryCount)
@@ -3440,13 +3440,13 @@ class Ri extends d.Mesh {
     if (e >= this._geometryCount)
       throw new Error("AcTrBatchedMesh: Maximum geometry count reached.");
     this._validateGeometry(t);
-    const i = this.geometry, n = i.getIndex() !== null, s = i.getIndex(), o = t.getIndex(), r = this._geometryInfo[e];
-    if (n && o.count > r.reservedIndexCount || t.attributes.position.count > r.reservedVertexCount)
+    const i = this.geometry, n = i.getIndex() !== null, s = i.getIndex(), r = t.getIndex(), o = this._geometryInfo[e];
+    if (n && r.count > o.reservedIndexCount || t.attributes.position.count > o.reservedVertexCount)
       throw new Error(
         "AcTrBatchedMesh: Reserved space not large enough for provided geometry."
       );
-    const a = r.vertexStart, h = r.reservedVertexCount;
-    r.vertexCount = t.getAttribute("position").count;
+    const a = o.vertexStart, h = o.reservedVertexCount;
+    o.vertexCount = t.getAttribute("position").count;
     for (const l in i.attributes) {
       const m = t.getAttribute(l), u = i.getAttribute(
         l
@@ -3464,15 +3464,15 @@ class Ri extends d.Mesh {
       );
     }
     if (n && s) {
-      const l = r.indexStart, m = r.reservedIndexCount;
-      r.indexCount = t.getIndex().count;
-      for (let u = 0; u < o.count; u++)
-        s.setX(l + u, a + o.getX(u));
-      for (let u = o.count, p = m; u < p; u++)
+      const l = o.indexStart, m = o.reservedIndexCount;
+      o.indexCount = t.getIndex().count;
+      for (let u = 0; u < r.count; u++)
+        s.setX(l + u, a + r.getX(u));
+      for (let u = r.count, p = m; u < p; u++)
         s.setX(l + u, a);
-      s.needsUpdate = !0, s.addUpdateRange(l, r.reservedIndexCount);
+      s.needsUpdate = !0, s.addUpdateRange(l, o.reservedIndexCount);
     }
-    return r.start = n ? r.indexStart : r.vertexStart, r.count = n ? r.indexCount : r.vertexCount, r.boundingBox = null, t.boundingBox !== null && (r.boundingBox = t.boundingBox.clone()), r.boundingSphere = null, t.boundingSphere !== null && (r.boundingSphere = t.boundingSphere.clone()), e;
+    return o.start = n ? o.indexStart : o.vertexStart, o.count = n ? o.indexCount : o.vertexCount, o.boundingBox = null, t.boundingBox !== null && (o.boundingBox = t.boundingBox.clone()), o.boundingSphere = null, t.boundingSphere !== null && (o.boundingSphere = t.boundingSphere.clone()), e;
   }
   deleteGeometry(e) {
     const t = this._geometryInfo;
@@ -3480,9 +3480,9 @@ class Ri extends d.Mesh {
   }
   optimize() {
     let e = 0, t = 0;
-    const i = this._geometryInfo, n = i.map((o, r) => r).sort((o, r) => i[o].vertexStart - i[r].vertexStart), s = this.geometry;
-    for (let o = 0, r = i.length; o < r; o++) {
-      const a = n[o], h = i[a];
+    const i = this._geometryInfo, n = i.map((r, o) => o).sort((r, o) => i[r].vertexStart - i[o].vertexStart), s = this.geometry;
+    for (let r = 0, o = i.length; r < o; r++) {
+      const a = n[r], h = i[a];
       if (h.active !== !1) {
         if (s.index !== null) {
           if (h.indexStart !== t) {
@@ -3523,10 +3523,10 @@ class Ri extends d.Mesh {
       return null;
     const i = this.geometry, n = this._geometryInfo[e];
     if (n.boundingBox === null) {
-      const s = new d.Box3(), o = i.index, r = i.attributes.position;
+      const s = new d.Box3(), r = i.index, o = i.attributes.position;
       for (let a = n.start, h = n.start + n.count; a < h; a++) {
         let l = a;
-        o && (l = o.getX(l)), s.expandByPoint(U.fromBufferAttribute(r, l));
+        r && (l = r.getX(l)), s.expandByPoint(U.fromBufferAttribute(o, l));
       }
       n.boundingBox = s;
     }
@@ -3540,11 +3540,11 @@ class Ri extends d.Mesh {
     if (n.boundingSphere === null) {
       const s = new d.Sphere();
       this.getBoundingBoxAt(e, He), He.getCenter(s.center);
-      const o = i.index, r = i.attributes.position;
+      const r = i.index, o = i.attributes.position;
       let a = 0;
       for (let h = n.start, l = n.start + n.count; h < l; h++) {
         let m = h;
-        o && (m = o.getX(m)), U.fromBufferAttribute(r, m), a = Math.max(
+        r && (m = r.getX(m)), U.fromBufferAttribute(o, m), a = Math.max(
           a,
           s.center.distanceToSquared(U)
         );
@@ -3603,9 +3603,9 @@ class Ri extends d.Mesh {
       if (n.bboxIntersectionCheck) {
         const s = n.boundingBox;
         if (t.ray.intersectBox(s, U)) {
-          const o = t.ray.origin.distanceTo(U);
+          const r = t.ray.origin.distanceTo(U);
           i.push({
-            distance: o,
+            distance: r,
             point: U.clone(),
             object: this,
             face: null,
@@ -3623,9 +3623,9 @@ class Ri extends d.Mesh {
           n.start,
           n.count
         ), W.raycast(t, ge);
-        for (let s = 0, o = ge.length; s < o; s++) {
-          const r = ge[s];
-          r.object = this, r.batchId = e, r.objectId = n.objectId, i.push(r);
+        for (let s = 0, r = ge.length; s < r; s++) {
+          const o = ge[s];
+          o.object = this, o.batchId = e, o.objectId = n.objectId, i.push(o);
         }
         ge.length = 0;
       }
@@ -3671,9 +3671,9 @@ class Oi extends d.Points {
     const t = this.geometry, i = this._maxVertexCount;
     if (this._geometryInitialized === !1) {
       for (const n in e.attributes) {
-        const s = e.getAttribute(n), { array: o, itemSize: r, normalized: a } = s, h = new o.constructor(i * r), l = new d.BufferAttribute(
+        const s = e.getAttribute(n), { array: r, itemSize: o, normalized: a } = s, h = new r.constructor(i * o), l = new d.BufferAttribute(
           h,
-          r,
+          o,
           a
         );
         t.setAttribute(n, l);
@@ -3756,22 +3756,22 @@ class Oi extends d.Points {
     if (e >= this._geometryCount)
       throw new Error("AcTrBatchedLine: Maximum geometry count reached.");
     this._validateGeometry(t);
-    const i = this.geometry, n = this._geometryInfo[e], s = n.vertexStart, o = n.reservedVertexCount;
+    const i = this.geometry, n = this._geometryInfo[e], s = n.vertexStart, r = n.reservedVertexCount;
     n.vertexCount = t.getAttribute("position").count;
-    for (const r in i.attributes) {
-      const a = t.getAttribute(r), h = i.getAttribute(
-        r
+    for (const o in i.attributes) {
+      const a = t.getAttribute(o), h = i.getAttribute(
+        o
       );
       je(a, h, s);
       const l = a.itemSize;
-      for (let m = a.count, u = o; m < u; m++) {
+      for (let m = a.count, u = r; m < u; m++) {
         const p = s + m;
         for (let g = 0; g < l; g++)
           h.setComponent(p, g, 0);
       }
       h.needsUpdate = !0, h.addUpdateRange(
         s * l,
-        o * l
+        r * l
       );
     }
     return n.boundingBox = null, t.boundingBox !== null && (n.boundingBox = t.boundingBox.clone()), n.boundingSphere = null, t.boundingSphere !== null && (n.boundingSphere = t.boundingSphere.clone()), e;
@@ -3782,9 +3782,9 @@ class Oi extends d.Points {
   }
   optimize() {
     let e = 0;
-    const t = this._geometryInfo, i = t.map((s, o) => o).sort((s, o) => t[s].vertexStart - t[o].vertexStart), n = this.geometry;
-    for (let s = 0, o = t.length; s < o; s++) {
-      const r = i[s], a = t[r];
+    const t = this._geometryInfo, i = t.map((s, r) => r).sort((s, r) => t[s].vertexStart - t[r].vertexStart), n = this.geometry;
+    for (let s = 0, r = t.length; s < r; s++) {
+      const o = i[s], a = t[o];
       if (a.active !== !1) {
         if (a.vertexStart !== e) {
           const { vertexStart: h, reservedVertexCount: l } = a, m = n.attributes;
@@ -3812,10 +3812,10 @@ class Oi extends d.Points {
       return null;
     const i = this.geometry, n = this._geometryInfo[e];
     if (n.boundingBox === null) {
-      const s = new d.Box3(), o = i.index, r = i.attributes.position;
+      const s = new d.Box3(), r = i.index, o = i.attributes.position;
       for (let a = n.vertexStart, h = n.vertexStart + n.vertexCount; a < h; a++) {
         let l = a;
-        o && (l = o.getX(l)), s.expandByPoint(X.fromBufferAttribute(r, l));
+        r && (l = r.getX(l)), s.expandByPoint(X.fromBufferAttribute(o, l));
       }
       n.boundingBox = s;
     }
@@ -3829,11 +3829,11 @@ class Oi extends d.Points {
     if (n.boundingSphere === null) {
       const s = new d.Sphere();
       this.getBoundingBoxAt(e, qe), qe.getCenter(s.center);
-      const o = i.index, r = i.attributes.position;
+      const r = i.index, o = i.attributes.position;
       let a = 0;
       for (let h = n.vertexStart, l = n.vertexStart + n.vertexCount; h < l; h++) {
         let m = h;
-        o && (m = o.getX(m)), X.fromBufferAttribute(r, m), a = Math.max(
+        r && (m = r.getX(m)), X.fromBufferAttribute(o, m), a = Math.max(
           a,
           s.center.distanceToSquared(X)
         );
@@ -3892,9 +3892,9 @@ class Oi extends d.Points {
       if (n.bboxIntersectionCheck) {
         const s = n.boundingBox;
         if (t.ray.intersectBox(s, X)) {
-          const o = t.ray.origin.distanceTo(X);
+          const r = t.ray.origin.distanceTo(X);
           i.push({
-            distance: o,
+            distance: r,
             point: X.clone(),
             object: this,
             face: null,
@@ -3912,9 +3912,9 @@ class Oi extends d.Points {
           n.vertexStart,
           n.vertexCount
         ), $.raycast(t, pe);
-        for (let s = 0, o = pe.length; s < o; s++) {
-          const r = pe[s];
-          r.object = this, r.batchId = e, r.objectId = n.objectId, i.push(r);
+        for (let s = 0, r = pe.length; s < r; s++) {
+          const o = pe[s];
+          o.object = this, o.batchId = e, o.objectId = n.objectId, i.push(o);
         }
         pe.length = 0;
       }
@@ -4065,11 +4065,11 @@ class Vi extends d.Group {
     const i = this._entitiesMap.get(e);
     if (i) {
       const n = [];
-      for (let s = 0, o = i.length; s < o; s++) {
-        const r = i[s];
+      for (let s = 0, r = i.length; s < r; s++) {
+        const o = i[s];
         if (this.getObjectById(
-          r.batchedObjectId
-        ).intersectWith(r.batchId, t, n), n.length > 0) return !0;
+          o.batchedObjectId
+        ).intersectWith(o.batchId, t, n), n.length > 0) return !0;
       }
     }
     return !1;
@@ -4091,8 +4091,8 @@ class Vi extends d.Group {
     i && i.forEach((n) => {
       const s = this.getObjectById(
         n.batchedObjectId
-      ).getObjectAt(n.batchId), o = Ie.cloneMaterial(s.material);
-      Ie.setMaterialColor(o), s.material = o, s.userData.objectId = e, t.add(s);
+      ).getObjectAt(n.batchId), r = Ie.cloneMaterial(s.material);
+      Ie.setMaterialColor(r), s.material = r, s.userData.objectId = e, t.add(s);
     });
   }
   unhighlight(e, t) {
@@ -4105,20 +4105,20 @@ class Vi extends d.Group {
     const i = e.material, n = this.getMatchedLineBatches(e);
     let s = n.get(i.id);
     s == null && (s = new Pi(1e3, 2e3, i), n.set(i.id, s), this.add(s)), e.geometry.applyMatrix4(e.matrixWorld);
-    const o = s.addGeometry(e.geometry);
-    return s.setGeometryInfo(o, t), {
+    const r = s.addGeometry(e.geometry);
+    return s.setGeometryInfo(r, t), {
       batchedObjectId: s.id,
-      batchId: o
+      batchId: r
     };
   }
   addMesh(e, t) {
     const i = e.material, n = this.getMatchedMeshBatches(e);
     let s = n.get(i.id);
     s == null && (s = new Ri(1e3, 2e3, i), n.set(i.id, s), this.add(s)), e.geometry.applyMatrix4(e.matrixWorld);
-    const o = s.addGeometry(e.geometry);
-    return s.setGeometryInfo(o, t), {
+    const r = s.addGeometry(e.geometry);
+    return s.setGeometryInfo(r, t), {
       batchedObjectId: s.id,
-      batchId: o
+      batchId: r
     };
   }
   addPoint(e, t) {
@@ -4315,10 +4315,10 @@ class E extends xt {
     });
   }
   createColorArray(e, t) {
-    const i = (e >> 16 & 255) / 256, n = (e >> 8 & 255) / 256, s = (e & 255) / 256, o = new Float32Array(t * 3);
-    for (let r = 0, a = 0; r < t; r++)
-      o[a] = i, o[a + 1] = n, o[a + 2] = s, a += 3;
-    return o;
+    const i = (e >> 16 & 255) / 256, n = (e >> 8 & 255) / 256, s = (e & 255) / 256, r = new Float32Array(t * 3);
+    for (let o = 0, a = 0; o < t; o++)
+      r[a] = i, r[a + 1] = n, r[a + 2] = s, a += 3;
+    return r;
   }
 }
 const _t = class H {
@@ -4377,12 +4377,12 @@ class Gi extends E {
     super(i);
     const n = URL.createObjectURL(e), s = new d.TextureLoader().load(n);
     s.colorSpace = d.SRGBColorSpace;
-    const o = new d.MeshBasicMaterial({
+    const r = new d.MeshBasicMaterial({
       side: d.DoubleSide,
       map: s
-    }), r = new d.Shape(t.boundary), a = new d.ShapeGeometry(r);
+    }), o = new d.Shape(t.boundary), a = new d.ShapeGeometry(o);
     this.generateUVs(a);
-    const h = new d.Mesh(a, o);
+    const h = new d.Mesh(a, r);
     this.add(h);
   }
   /**
@@ -4391,10 +4391,10 @@ class Gi extends E {
    * @param geometry Input geometry to generate UVs
    */
   generateUVs(e) {
-    const t = e.attributes.position.array, i = new Float32Array(t.length / 3 * 2), n = Math.min(...t.filter((l, m) => m % 3 === 0)), s = Math.max(...t.filter((l, m) => m % 3 === 0)), o = Math.min(...t.filter((l, m) => m % 3 === 1)), r = Math.max(...t.filter((l, m) => m % 3 === 1)), a = s - n, h = r - o;
+    const t = e.attributes.position.array, i = new Float32Array(t.length / 3 * 2), n = Math.min(...t.filter((l, m) => m % 3 === 0)), s = Math.max(...t.filter((l, m) => m % 3 === 0)), r = Math.min(...t.filter((l, m) => m % 3 === 1)), o = Math.max(...t.filter((l, m) => m % 3 === 1)), a = s - n, h = o - r;
     for (let l = 0; l < t.length; l += 3) {
       const m = t[l], u = t[l + 1];
-      i[l / 3 * 2] = (m - n) / a, i[l / 3 * 2 + 1] = (u - o) / h;
+      i[l / 3 * 2] = (m - n) / a, i[l / 3 * 2 + 1] = (u - r) / h;
     }
     e.setAttribute("uv", new d.BufferAttribute(i, 2));
   }
@@ -4426,13 +4426,13 @@ class le {
     return t;
   }
   static createGeometryAttributeByIndex(e, t) {
-    const i = t.count, n = e.itemSize, s = e.array.constructor, o = new s(i * n);
-    for (let r = 0; r < i; r++) {
-      const a = t.getX(r) * n;
+    const i = t.count, n = e.itemSize, s = e.array.constructor, r = new s(i * n);
+    for (let o = 0; o < i; o++) {
+      const a = t.getX(o) * n;
       for (let h = 0; h < n; h++)
-        o[r * n + h] = e.array[a + h];
+        r[o * n + h] = e.array[a + h];
     }
-    return new d.BufferAttribute(o, n, e.normalized);
+    return new d.BufferAttribute(r, n, e.normalized);
   }
   /**
    * Converts InterleavedBufferAttribute to BufferAttribute, because mergeGeometries doesn't support InterleavedBufferAttribute.
@@ -4449,9 +4449,9 @@ class le {
   }
   static createBufferGeometryByPoints(e) {
     const t = new d.BufferGeometry(), i = new Float32Array(e.length * 3), n = new Uint16Array((e.length - 1) * 2);
-    return e.forEach((s, o) => {
-      let r = o * 3;
-      i[r] = s.x, i[r + 1] = s.y, i[r + 2] = s.z, o > 0 && (r = (o - 1) * 2, n[r] = o - 1, n[r + 1] = o);
+    return e.forEach((s, r) => {
+      let o = r * 3;
+      i[o] = s.x, i[o + 1] = s.y, i[o + 2] = s.z, r > 0 && (o = (r - 1) * 2, n[o] = r - 1, n[o + 1] = r);
     }), t.setAttribute(
       "position",
       new d.Float32BufferAttribute(i, 3)
@@ -4466,18 +4466,18 @@ class le {
       const s = i.attributes.position;
       if (!s || s.count === 0)
         return;
-      const o = [];
+      const r = [];
       if (t)
-        for (let r = 0, a = s.count; r < a; r += 2)
-          ye.fromBufferAttribute(s, r).applyMatrix4(n), fe.fromBufferAttribute(s, r + 1).applyMatrix4(n), o[r] = r === 0 ? 0 : o[r - 1], o[r + 1] = o[r] + ye.distanceTo(fe);
+        for (let o = 0, a = s.count; o < a; o += 2)
+          ye.fromBufferAttribute(s, o).applyMatrix4(n), fe.fromBufferAttribute(s, o + 1).applyMatrix4(n), r[o] = o === 0 ? 0 : r[o - 1], r[o + 1] = r[o] + ye.distanceTo(fe);
       else {
-        o[0] = 0;
-        for (let r = 1, a = s.count; r < a; r++)
-          ye.fromBufferAttribute(s, r - 1).applyMatrix4(n), fe.fromBufferAttribute(s, r).applyMatrix4(n), o[r] = o[r - 1], o[r] += ye.distanceTo(fe);
+        r[0] = 0;
+        for (let o = 1, a = s.count; o < a; o++)
+          ye.fromBufferAttribute(s, o - 1).applyMatrix4(n), fe.fromBufferAttribute(s, o).applyMatrix4(n), r[o] = r[o - 1], r[o] += ye.distanceTo(fe);
       }
       i.setAttribute(
         "lineDistance",
-        new d.Float32BufferAttribute(o, 1)
+        new d.Float32BufferAttribute(r, 1)
       ), e.geometry.dispose(), e.geometry = i;
     }
   }
@@ -4495,16 +4495,16 @@ class le {
    * @param scale Input scale factor
    */
   static apply2dTransform(e, t, i = 0, n = 1) {
-    const s = e.attributes.position, o = s.itemSize, r = s.array;
+    const s = e.attributes.position, r = s.itemSize, o = s.array;
     if (i != 0) {
       const a = Math.cos(i), h = Math.sin(i);
-      for (let l = 0; l < r.length; l += o) {
-        const m = r[l], u = r[l + 1], p = m * a - u * h, g = m * h + u * a;
-        r[l] = p * n + t.x, r[l + 1] = g * n + t.y;
+      for (let l = 0; l < o.length; l += r) {
+        const m = o[l], u = o[l + 1], p = m * a - u * h, g = m * h + u * a;
+        o[l] = p * n + t.x, o[l + 1] = g * n + t.y;
       }
     } else
-      for (let a = 0; a < r.length; a += o)
-        r[a] = r[a] * n + t.x, r[a + 1] += r[a + 1] * n + t.y;
+      for (let a = 0; a < o.length; a += r)
+        o[a] = o[a] * n + t.x, o[a + 1] += o[a + 1] * n + t.y;
     return s.needsUpdate = !0, e;
   }
   /**
@@ -4514,12 +4514,12 @@ class le {
    * @param rotation Input roatation (in radians) around x-axis, y-axis, and z-axis
    */
   static apply3dTransform(e, t, i) {
-    const n = e.attributes.position, s = n.itemSize, o = n.array, r = Math.cos(i.x), a = Math.sin(i.x), h = Math.cos(i.y), l = Math.sin(i.y), m = Math.cos(i.z), u = Math.sin(i.z);
-    for (let p = 0; p < o.length; p += s) {
-      let g = o[p], y = o[p + 1], f = o[p + 2], _ = y * r - f * a, x = y * a + f * r;
+    const n = e.attributes.position, s = n.itemSize, r = n.array, o = Math.cos(i.x), a = Math.sin(i.x), h = Math.cos(i.y), l = Math.sin(i.y), m = Math.cos(i.z), u = Math.sin(i.z);
+    for (let p = 0; p < r.length; p += s) {
+      let g = r[p], y = r[p + 1], f = r[p + 2], _ = y * o - f * a, x = y * a + f * o;
       y = _, f = x;
       let w = g * h + f * l;
-      x = -g * l + f * h, g = w, f = x, w = g * m - y * u, _ = g * u + y * m, g = w, y = _, o[p] = g + t.x, o[p + 1] = y + t.y, o[p + 2] = f + t.z;
+      x = -g * l + f * h, g = w, f = x, w = g * m - y * u, _ = g * u + y * m, g = w, y = _, r[p] = g + t.x, r[p + 1] = y + t.y, r[p + 2] = f + t.z;
     }
     return n.needsUpdate = !0, e;
   }
@@ -4530,15 +4530,15 @@ class ki extends E {
     let n;
     const s = t ? t.color : 16777215;
     t ? n = this.styleManager.getLineShaderMaterial(t, 1) : n = new d.LineBasicMaterial({ color: s });
-    const o = e.length, r = new Float32Array(o * 3), a = o * 2 > 65535 ? new Uint32Array(o * 2) : new Uint16Array(o * 2);
-    for (let m = 0, u = 0; m < o; m++) {
+    const r = e.length, o = new Float32Array(r * 3), a = r * 2 > 65535 ? new Uint32Array(r * 2) : new Uint16Array(r * 2);
+    for (let m = 0, u = 0; m < r; m++) {
       const p = e[m];
-      r[u++] = p.x, r[u++] = p.y, r[u++] = p.z ?? 0;
+      o[u++] = p.x, o[u++] = p.y, o[u++] = p.z ?? 0;
     }
-    for (let m = 0, u = 0; m < o - 1; m++)
+    for (let m = 0, u = 0; m < r - 1; m++)
       a[u++] = m, a[u++] = m + 1;
     const h = new d.BufferGeometry();
-    h.setAttribute("position", new d.BufferAttribute(r, 3)), h.setIndex(new d.BufferAttribute(a, 1)), this.setBoundingBox(h), this.geometry = h;
+    h.setAttribute("position", new d.BufferAttribute(o, 3)), h.setIndex(new d.BufferAttribute(a, 1)), this.setBoundingBox(h), this.geometry = h;
     const l = new d.LineSegments(h, n);
     le.computeLineDistances(l), this.add(l);
   }
@@ -4549,14 +4549,14 @@ class ki extends E {
 class Fi extends E {
   constructor(e, t, i, n, s) {
     super(s);
-    let o;
-    n ? o = this.styleManager.getLineShaderMaterial(n, 1) : o = new d.LineBasicMaterial({ color: 16777215 });
-    const r = new d.BufferGeometry();
-    r.setAttribute(
+    let r;
+    n ? r = this.styleManager.getLineShaderMaterial(n, 1) : r = new d.LineBasicMaterial({ color: 16777215 });
+    const o = new d.BufferGeometry();
+    o.setAttribute(
       "position",
       new d.BufferAttribute(e, t)
-    ), r.setIndex(new d.BufferAttribute(i, 1)), r.computeBoundingBox(), this.box = r.boundingBox;
-    const a = new d.LineSegments(r, o);
+    ), o.setIndex(new d.BufferAttribute(i, 1)), o.computeBoundingBox(), this.box = o.boundingBox;
+    const a = new d.LineSegments(o, r);
     le.computeLineDistances(a), this.add(a);
   }
 }
@@ -4606,8 +4606,8 @@ class Wi extends E {
     this.isShowPoint = n.point != null;
     const s = n.point ?? new d.BufferGeometry().setFromPoints([Ui.copy(e)]);
     s.computeBoundingBox(), s.boundingBox && this.box.union(s.boundingBox);
-    const o = this.styleManager.getPointsMaterial(t.color), r = new d.Points(s, o);
-    if (r.userData.bboxIntersectionCheck = !0, r.visible = this.isShowPoint, this.add(r), n.line) {
+    const r = this.styleManager.getPointsMaterial(t.color), o = new d.Points(s, r);
+    if (o.userData.bboxIntersectionCheck = !0, o.visible = this.isShowPoint, this.add(o), n.line) {
       const a = n.line;
       a.computeBoundingBox(), a.boundingBox && this.box.union(a.boundingBox);
       const h = this.styleManager.getLineBasicMaterial(t.color), l = new d.LineSegments(a, h);
@@ -4619,10 +4619,10 @@ class Xi extends E {
   constructor(e, t, i) {
     var n;
     super(i);
-    const s = e.getPoints(100), o = e.buildHierarchy(), r = [];
-    this.buildHatchGeometry(s, o, r);
+    const s = e.getPoints(100), r = e.buildHierarchy(), o = [];
+    this.buildHatchGeometry(s, r, o);
     let a;
-    if (r.length > 0 && (a = Qt(r)), !a || !a.getIndex() || ((n = a.getIndex()) == null ? void 0 : n.count) === 0)
+    if (o.length > 0 && (a = Qt(o)), !a || !a.getIndex() || ((n = a.getIndex()) == null ? void 0 : n.count) === 0)
       console.warn("Failed to convert hatch boundaries!");
     else {
       a.computeBoundingBox(), this.box = a.boundingBox;
@@ -4643,7 +4643,7 @@ class Xi extends E {
         a.children.map((h) => h.index)
       );
     });
-    const o = (a) => {
+    const r = (a) => {
       try {
         const h = new d.ShapeGeometry(a);
         h.hasAttribute("uv") && h.deleteAttribute("uv"), h.hasAttribute("normal") && h.deleteAttribute("normal"), i.push(h);
@@ -4658,9 +4658,9 @@ class Xi extends E {
       if (h.length === 0)
         return;
       const l = new d.Shape(h);
-      o(l);
+      r(l);
     });
-    const r = (a) => a.map((h) => h.toArray());
+    const o = (a) => a.map((h) => h.toArray());
     for (const a of s) {
       const h = new d.Shape(
         e[a[0]]
@@ -4681,12 +4681,12 @@ class Xi extends E {
             const x = new ft(new yt(y));
             if (_ === 0)
               g = x.segments({
-                regions: [r(e[f])],
+                regions: [o(e[f])],
                 inverted: !1
               });
             else {
               const w = x.segments({
-                regions: [r(e[f])],
+                regions: [o(e[f])],
                 inverted: !1
               }), b = x.combine(g, w);
               l = x.polygon(x.selectUnion(b)), l.regions.length > 0 ? l.regions.forEach((I) => {
@@ -4710,7 +4710,7 @@ class Xi extends E {
           new d.Path(e[g])
         );
       }
-      o(h);
+      r(h);
     }
     t.children.forEach((a) => {
       a.children.forEach((h) => {
@@ -4721,17 +4721,17 @@ class Xi extends E {
   findIntersectHole(e, t) {
     const i = t.length, n = [];
     for (let s = 0; s < i; s++) {
-      const o = e[t[s]];
-      let r = !1;
+      const r = e[t[s]];
+      let o = !1;
       const a = [];
       for (let h = s + 1; h < i; h++) {
         const l = e[t[h]];
         St.isPolygonIntersect(
-          o,
+          r,
           l
-        ) && (r = !0, a.push(t[h]));
+        ) && (o = !0, a.push(t[h]));
       }
-      r && (a.push(t[s]), n.push(a));
+      o && (a.push(t[s]), n.push(a));
     }
     return n;
   }
@@ -4742,7 +4742,7 @@ function $i(c, e, t, i, n = 0) {
     u_patternLines: { value: c },
     u_patternAngle: { value: e },
     u_color: { value: i }
-  }, o = (
+  }, r = (
     /*glsl*/
     `
         varying vec3 v_pos;
@@ -4756,7 +4756,7 @@ function $i(c, e, t, i, n = 0) {
             #include <project_vertex>
             #include <clipping_planes_vertex>
         }`
-  ), r = (
+  ), o = (
     /*glsl*/
     `
         uniform mat4 modelMatrix;
@@ -4951,8 +4951,8 @@ function $i(c, e, t, i, n = 0) {
   );
   return new d.ShaderMaterial({
     uniforms: s,
-    vertexShader: o,
-    fragmentShader: r,
+    vertexShader: r,
+    fragmentShader: o,
     clipping: !0
   });
 }
@@ -4962,17 +4962,17 @@ class Yi {
    * Note: remember to call line.computeLineDistances() in order to make it work!
    */
   static createLineShaderMaterial(e, t, i, n, s) {
-    let o = 0;
-    const r = [];
+    let r = 0;
+    const o = [];
     for (let m = 0; m < e.length; m++)
-      r[m] = e[m].elementLength * i, o += Math.abs(r[m]);
-    for (let m = 0; m < r.length; m++)
-      r[m] === 0 && (r[m] = o * 0.01 * i, o += r[m]);
+      o[m] = e[m].elementLength * i, r += Math.abs(o[m]);
+    for (let m = 0; m < o.length; m++)
+      o[m] === 0 && (o[m] = r * 0.01 * i, r += o[m]);
     const a = d.UniformsUtils.merge([
       d.UniformsLib.common,
       {
-        pattern: { value: r },
-        patternLength: { value: o },
+        pattern: { value: o },
+        patternLength: { value: r },
         u_color: { value: new d.Color(t) }
       }
     ]);
@@ -5091,12 +5091,12 @@ const we = class oe {
     const n = this.findMatchedHatchShaderMaterial(e);
     if (n)
       return n;
-    const s = 5e-3, o = 0.05;
-    let r = 2;
+    const s = 5e-3, r = 0.05;
+    let o = 2;
     e.patternLines.forEach((u) => {
-      r = Math.max(
+      o = Math.max(
         u.dashPattern.length,
-        r
+        o
       );
     });
     let a = 0;
@@ -5122,14 +5122,14 @@ const we = class oe {
         const G = u.dashPattern[v];
         G > 0 && (f = !1), _ += Math.abs(G);
       }
-      const x = f ? o : s, w = [], b = [];
+      const x = f ? r : s, w = [], b = [];
       let I = 0;
       b[0] = I;
       for (let v = 0; v < y; ++v)
         w[v] = u.dashPattern[v], w[v] === 0 && (w[v] = x * _), I += Math.abs(w[v]), b[v + 1] = I;
-      for (let v = y; v < r; ++v)
+      for (let v = y; v < o; ++v)
         w[v] = 0;
-      for (let v = b.length; v < r + 1; ++v)
+      for (let v = b.length; v < o + 1; ++v)
         b[v] = I;
       const P = {
         origin: p,
@@ -5139,7 +5139,7 @@ const we = class oe {
         patternSum: b,
         patternLength: I
       };
-      if (a += 4, a += r, a += r + 1, a > oe.MaxFragmentUniforms) {
+      if (a += 4, a += o, a += o + 1, a > oe.MaxFragmentUniforms) {
         console.warn(
           "There will be warning in fragment shader when number of uniforms exceeds 1024, so extra hatch line patterns are ignored here!"
         );
@@ -5154,7 +5154,7 @@ const we = class oe {
       new d.Color(e.color)
     );
     return m.defines = {
-      MAX_PATTERN_SEGMENT_COUNT: r
+      MAX_PATTERN_SEGMENT_COUNT: o
     }, this.hatchShaderMaterials.push({
       patternLines: e.patternLines,
       patternAngle: e.patternAngle,
@@ -5173,15 +5173,15 @@ const we = class oe {
         if (!i(a[l], h[l]))
           return !1;
       return !0;
-    }, s = (a, h) => i(a.angle, h.angle) && i(a.delta.x, h.delta.x) && i(a.delta.y, h.delta.y) && i(a.origin.x, h.origin.x) && i(a.origin.y, h.origin.y) && n(a.dashPattern, h.dashPattern), o = (a, h) => {
+    }, s = (a, h) => i(a.angle, h.angle) && i(a.delta.x, h.delta.x) && i(a.delta.y, h.delta.y) && i(a.origin.x, h.origin.x) && i(a.origin.y, h.origin.y) && n(a.dashPattern, h.dashPattern), r = (a, h) => {
       if (a.length !== h.length)
         return !1;
       for (let l = 0; l < a.length; ++l)
         if (!s(a[l], h[l]))
           return !1;
       return !0;
-    }, r = this.hatchShaderMaterials.find((a) => a.color === e.color && a.patternAngle === e.patternAngle && o(a.patternLines, t));
-    return r == null ? void 0 : r.material;
+    }, o = this.hatchShaderMaterials.find((a) => a.color === e.color && a.patternAngle === e.patternAngle && r(a.patternLines, t));
+    return o == null ? void 0 : o.material;
   }
 };
 we.CameraZoomUniform = { value: 1 }, we.ViewportScaleUniform = { value: 1 }, we.MaxFragmentUniforms = 1024;
@@ -5565,7 +5565,7 @@ class bt {
     e.getCenter(n);
     const s = new d.Vector3(n.x, n.y, 0);
     this._camera.position.set(n.x, n.y, this._camera.position.z), this._camera.lookAt(s), this._camera.setRotationFromEuler(new d.Euler(0, 0, 0));
-    const o = i.x * t, r = i.y * t, a = this._width / o, h = this._height / r;
+    const r = i.x * t, o = i.y * t, a = this._width / r, h = this._height / o;
     this._camera.zoom = Math.min(a, h), this._cameraControls.target = s, this.updateCameraFrustum();
   }
   updateCameraFrustum(e, t) {
@@ -5725,53 +5725,53 @@ class on extends d.Object3D {
   }
   calculateViewportPos() {
     const e = this.renderer.domElement, t = e.offsetWidth, i = e.offsetHeight, n = this.gizmoPos, s = this.gizmoDim;
-    let o = t - s, r = i - s;
+    let r = t - s, o = i - s;
     switch (n) {
       case 0:
-        o = 0, r = 0;
+        r = 0, o = 0;
         break;
       case 1:
-        o = 0;
+        r = 0;
         break;
       case 4:
-        r = 0;
+        o = 0;
         break;
     }
-    return { x: o, y: r };
+    return { x: r, y: o };
   }
   calculateViewportBbox() {
-    const e = this.renderer.domElement, t = e.offsetWidth, i = e.offsetHeight, n = this.gizmoPos, s = this.gizmoDim, o = new d.Box2(
+    const e = this.renderer.domElement, t = e.offsetWidth, i = e.offsetHeight, n = this.gizmoPos, s = this.gizmoDim, r = new d.Box2(
       new d.Vector2(t - s, 0),
       new d.Vector2(t, s)
     );
     switch (n) {
       case 0:
-        o.set(
+        r.set(
           new d.Vector2(0, i - s),
           new d.Vector2(s, i)
         );
         break;
       case 1:
-        o.set(new d.Vector2(0, 0), new d.Vector2(s, s));
+        r.set(new d.Vector2(0, 0), new d.Vector2(s, s));
         break;
       case 4:
-        o.set(
+        r.set(
           new d.Vector2(t - s, i - s),
           new d.Vector2(t, i)
         );
         break;
     }
-    return o;
+    return r;
   }
 }
 function an(c, e) {
-  const t = e.font || "Helvetica", i = e.fontSize || 30, n = e.width || 200, s = e.height || 200, o = e.bgColor ? e.bgColor.join(", ") : "255, 255, 255, 1.0", r = e.color ? e.color.join(", ") : "0, 0, 0, 1.0", a = document.createElement("canvas");
+  const t = e.font || "Helvetica", i = e.fontSize || 30, n = e.width || 200, s = e.height || 200, r = e.bgColor ? e.bgColor.join(", ") : "255, 255, 255, 1.0", o = e.color ? e.color.join(", ") : "0, 0, 0, 1.0", a = document.createElement("canvas");
   a.width = n, a.height = s;
   const h = a.getContext("2d");
   if (h) {
-    h.font = `bold ${i}px ${t}`, h.fillStyle = `rgba(${o})`, h.fillRect(0, 0, n, s);
+    h.font = `bold ${i}px ${t}`, h.fillStyle = `rgba(${r})`, h.fillRect(0, 0, n, s);
     const u = h.measureText(c).width;
-    h.fillStyle = `rgba(${r})`, h.fillText(
+    h.fillStyle = `rgba(${o})`, h.fillText(
       c,
       n / 2 - u / 2,
       s / 2 + i / 2 - 2
@@ -5802,18 +5802,18 @@ class hn extends on {
       ...i
     };
     super(e, t, n.size, i.pos), this.hasZAxis = n.hasZAxis;
-    const s = [0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 0], o = [1, 0, 0, 1, 0.6, 0, 0, 1, 0, 0.6, 1, 0];
-    this.hasZAxis && (s.push(0, 0, 0, 0, 0, 2), o.push(0, 0, 1, 0, 0.6, 1));
-    const r = new d.BufferGeometry();
-    r.setAttribute(
+    const s = [0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 0], r = [1, 0, 0, 1, 0.6, 0, 0, 1, 0, 0.6, 1, 0];
+    this.hasZAxis && (s.push(0, 0, 0, 0, 0, 2), r.push(0, 0, 1, 0, 0.6, 1));
+    const o = new d.BufferGeometry();
+    o.setAttribute(
       "position",
       new d.Float32BufferAttribute(s, 3)
-    ), r.setAttribute("color", new d.Float32BufferAttribute(o, 3));
+    ), o.setAttribute("color", new d.Float32BufferAttribute(r, 3));
     const a = new d.LineBasicMaterial({
       vertexColors: !0,
       toneMapped: !1
     });
-    this.axes = new d.LineSegments(r, a), this.axes.position.set(-1, -1, -1), this.add(this.axes), this.xText = Ce("X"), this.xText.position.set(1.5, -1, -1), this.add(this.xText), this.yText = Ce("Y"), this.yText.position.set(-1, 1.5, -1), this.add(this.yText), this.hasZAxis && (this.zText = Ce("Z"), this.zText.position.set(-1, -1, 1.5), this.add(this.zText));
+    this.axes = new d.LineSegments(o, a), this.axes.position.set(-1, -1, -1), this.add(this.axes), this.xText = Ce("X"), this.xText.position.set(1.5, -1, -1), this.add(this.xText), this.yText = Ce("Y"), this.yText.position.set(-1, 1.5, -1), this.add(this.yText), this.hasZAxis && (this.zText = Ce("Z"), this.zText.position.set(-1, -1, 1.5), this.add(this.zText));
   }
   /**
    * Set color of x-axis and y-axis
@@ -6055,12 +6055,12 @@ function wt(c, e, t = 0, i = c.length - 1, n = un) {
       wt(c, e, p, g, n);
     }
     const s = c[e];
-    let o = t, r = i;
-    for (se(c, t, e), n(c[i], s) > 0 && se(c, t, i); o < r; ) {
-      for (se(c, o, r), o++, r--; n(c[o], s) < 0; ) o++;
-      for (; n(c[r], s) > 0; ) r--;
+    let r = t, o = i;
+    for (se(c, t, e), n(c[i], s) > 0 && se(c, t, i); r < o; ) {
+      for (se(c, r, o), r++, o--; n(c[r], s) < 0; ) r++;
+      for (; n(c[o], s) > 0; ) o--;
     }
-    n(c[t], s) === 0 ? se(c, t, r) : (r++, se(c, r, i)), r <= e && (t = r + 1), e <= r && (i = r - 1);
+    n(c[t], s) === 0 ? se(c, t, o) : (o++, se(c, o, i)), o <= e && (t = o + 1), e <= o && (i = o - 1);
   }
 }
 function se(c, e, t) {
@@ -6083,9 +6083,9 @@ class mn {
     if (!_e(e, t)) return i;
     const n = this.toBBox, s = [];
     for (; t; ) {
-      for (let o = 0; o < t.children.length; o++) {
-        const r = t.children[o], a = t.leaf ? n(r) : r;
-        _e(e, a) && (t.leaf ? i.push(r) : Ee(e, a) ? this._all(r, i) : s.push(r));
+      for (let r = 0; r < t.children.length; r++) {
+        const o = t.children[r], a = t.leaf ? n(o) : o;
+        _e(e, a) && (t.leaf ? i.push(o) : Ee(e, a) ? this._all(o, i) : s.push(o));
       }
       t = s.pop();
     }
@@ -6097,9 +6097,9 @@ class mn {
     const i = [];
     for (; t; ) {
       for (let n = 0; n < t.children.length; n++) {
-        const s = t.children[n], o = t.leaf ? this.toBBox(s) : s;
-        if (_e(e, o)) {
-          if (t.leaf || Ee(e, o)) return !0;
+        const s = t.children[n], r = t.leaf ? this.toBBox(s) : s;
+        if (_e(e, r)) {
+          if (t.leaf || Ee(e, r)) return !0;
           i.push(s);
         }
       }
@@ -6137,15 +6137,15 @@ class mn {
   remove(e, t) {
     if (!e) return this;
     let i = this.data;
-    const n = this.toBBox(e), s = [], o = [];
-    let r, a, h;
+    const n = this.toBBox(e), s = [], r = [];
+    let o, a, h;
     for (; i || s.length; ) {
-      if (i || (i = s.pop(), a = s[s.length - 1], r = o.pop(), h = !0), i.leaf) {
+      if (i || (i = s.pop(), a = s[s.length - 1], o = r.pop(), h = !0), i.leaf) {
         const l = gn(e, i.children, t);
         if (l !== -1)
           return i.children.splice(l, 1), s.push(i), this._condense(s), this;
       }
-      !h && !i.leaf && Ee(i, n) ? (s.push(i), o.push(r), r = 0, a = i, i = i.children[0]) : a ? (r++, i = a.children[r], h = !1) : i = null;
+      !h && !i.leaf && Ee(i, n) ? (s.push(i), r.push(o), o = 0, a = i, i = i.children[0]) : a ? (o++, i = a.children[o], h = !1) : i = null;
     }
     return this;
   }
@@ -6172,36 +6172,36 @@ class mn {
   }
   _build(e, t, i, n) {
     const s = i - t + 1;
-    let o = this._maxEntries, r;
-    if (s <= o)
-      return r = q(e.slice(t, i + 1)), Y(r, this.toBBox), r;
-    n || (n = Math.ceil(Math.log(s) / Math.log(o)), o = Math.ceil(s / Math.pow(o, n - 1))), r = q([]), r.leaf = !1, r.height = n;
-    const a = Math.ceil(s / o), h = a * Math.ceil(Math.sqrt(o));
+    let r = this._maxEntries, o;
+    if (s <= r)
+      return o = q(e.slice(t, i + 1)), Y(o, this.toBBox), o;
+    n || (n = Math.ceil(Math.log(s) / Math.log(r)), r = Math.ceil(s / Math.pow(r, n - 1))), o = q([]), o.leaf = !1, o.height = n;
+    const a = Math.ceil(s / r), h = a * Math.ceil(Math.sqrt(r));
     Qe(e, t, i, h, this.compareMinX);
     for (let l = t; l <= i; l += h) {
       const m = Math.min(l + h - 1, i);
       Qe(e, l, m, a, this.compareMinY);
       for (let u = l; u <= m; u += a) {
         const p = Math.min(u + a - 1, m);
-        r.children.push(this._build(e, u, p, n - 1));
+        o.children.push(this._build(e, u, p, n - 1));
       }
     }
-    return Y(r, this.toBBox), r;
+    return Y(o, this.toBBox), o;
   }
   _chooseSubtree(e, t, i, n) {
     for (; n.push(t), !(t.leaf || n.length - 1 === i); ) {
-      let s = 1 / 0, o = 1 / 0, r;
+      let s = 1 / 0, r = 1 / 0, o;
       for (let a = 0; a < t.children.length; a++) {
         const h = t.children[a], l = Le(h), m = fn(e, h) - l;
-        m < o ? (o = m, s = l < s ? l : s, r = h) : m === o && l < s && (s = l, r = h);
+        m < r ? (r = m, s = l < s ? l : s, o = h) : m === r && l < s && (s = l, o = h);
       }
-      t = r || t.children[0];
+      t = o || t.children[0];
     }
     return t;
   }
   _insert(e, t, i) {
-    const n = i ? e : this.toBBox(e), s = [], o = this._chooseSubtree(n, this.data, t, s);
-    for (o.children.push(e), ce(o, n); t >= 0 && s[t].children.length > this._maxEntries; )
+    const n = i ? e : this.toBBox(e), s = [], r = this._chooseSubtree(n, this.data, t, s);
+    for (r.children.push(e), ce(r, n); t >= 0 && s[t].children.length > this._maxEntries; )
       this._split(s, t), t--;
     this._adjustParentBBoxes(n, s, t);
   }
@@ -6209,37 +6209,37 @@ class mn {
   _split(e, t) {
     const i = e[t], n = i.children.length, s = this._minEntries;
     this._chooseSplitAxis(i, s, n);
-    const o = this._chooseSplitIndex(i, s, n), r = q(i.children.splice(o, i.children.length - o));
-    r.height = i.height, r.leaf = i.leaf, Y(i, this.toBBox), Y(r, this.toBBox), t ? e[t - 1].children.push(r) : this._splitRoot(i, r);
+    const r = this._chooseSplitIndex(i, s, n), o = q(i.children.splice(r, i.children.length - r));
+    o.height = i.height, o.leaf = i.leaf, Y(i, this.toBBox), Y(o, this.toBBox), t ? e[t - 1].children.push(o) : this._splitRoot(i, o);
   }
   _splitRoot(e, t) {
     this.data = q([e, t]), this.data.height = e.height + 1, this.data.leaf = !1, Y(this.data, this.toBBox);
   }
   _chooseSplitIndex(e, t, i) {
-    let n, s = 1 / 0, o = 1 / 0;
-    for (let r = t; r <= i - t; r++) {
-      const a = ae(e, 0, r, this.toBBox), h = ae(e, r, i, this.toBBox), l = xn(a, h), m = Le(a) + Le(h);
-      l < s ? (s = l, n = r, o = m < o ? m : o) : l === s && m < o && (o = m, n = r);
+    let n, s = 1 / 0, r = 1 / 0;
+    for (let o = t; o <= i - t; o++) {
+      const a = ae(e, 0, o, this.toBBox), h = ae(e, o, i, this.toBBox), l = xn(a, h), m = Le(a) + Le(h);
+      l < s ? (s = l, n = o, r = m < r ? m : r) : l === s && m < r && (r = m, n = o);
     }
     return n || i - t;
   }
   // sorts node children by the best axis for split
   _chooseSplitAxis(e, t, i) {
-    const n = e.leaf ? this.compareMinX : pn, s = e.leaf ? this.compareMinY : yn, o = this._allDistMargin(e, t, i, n), r = this._allDistMargin(e, t, i, s);
-    o < r && e.children.sort(n);
+    const n = e.leaf ? this.compareMinX : pn, s = e.leaf ? this.compareMinY : yn, r = this._allDistMargin(e, t, i, n), o = this._allDistMargin(e, t, i, s);
+    r < o && e.children.sort(n);
   }
   // total margin of all possible split distributions where each node is at least m full
   _allDistMargin(e, t, i, n) {
     e.children.sort(n);
-    const s = this.toBBox, o = ae(e, 0, t, s), r = ae(e, i - t, i, s);
-    let a = xe(o) + xe(r);
+    const s = this.toBBox, r = ae(e, 0, t, s), o = ae(e, i - t, i, s);
+    let a = xe(r) + xe(o);
     for (let h = t; h < i - t; h++) {
       const l = e.children[h];
-      ce(o, e.leaf ? s(l) : l), a += xe(o);
+      ce(r, e.leaf ? s(l) : l), a += xe(r);
     }
     for (let h = i - t - 1; h >= t; h--) {
       const l = e.children[h];
-      ce(r, e.leaf ? s(l) : l), a += xe(r);
+      ce(o, e.leaf ? s(l) : l), a += xe(o);
     }
     return a;
   }
@@ -6264,8 +6264,8 @@ function Y(c, e) {
 function ae(c, e, t, i, n) {
   n || (n = q(null)), n.minX = 1 / 0, n.minY = 1 / 0, n.maxX = -1 / 0, n.maxY = -1 / 0;
   for (let s = e; s < t; s++) {
-    const o = c.children[s];
-    ce(n, c.leaf ? i(o) : o);
+    const r = c.children[s];
+    ce(n, c.leaf ? i(r) : r);
   }
   return n;
 }
@@ -6312,8 +6312,8 @@ function Qe(c, e, t, i, n) {
   const s = [e, t];
   for (; s.length; ) {
     if (t = s.pop(), e = s.pop(), t - e <= i) continue;
-    const o = e + Math.ceil((t - e) / i / 2) * i;
-    wt(c, o, e, t, n), s.push(e, o, o, t);
+    const r = e + Math.ceil((t - e) / i / 2) * i;
+    wt(c, r, e, t, n), s.push(e, r, r, t);
   }
 }
 class _n {
@@ -6493,10 +6493,10 @@ class bn {
    */
   get stats() {
     const e = [];
-    let t = 0, i = 0, n = 0, s = 0, o = 0;
-    return this._layers.forEach((r) => {
-      const a = r.stats;
-      e.push(a), n += a.line.indexed.geometrySize + a.line.nonIndexed.geometrySize, s += a.mesh.indexed.geometrySize + a.mesh.nonIndexed.geometrySize, o += a.point.indexed.geometrySize + a.point.nonIndexed.geometrySize, t += a.summary.totalGeometrySize, i += a.summary.totalMappingSize;
+    let t = 0, i = 0, n = 0, s = 0, r = 0;
+    return this._layers.forEach((o) => {
+      const a = o.stats;
+      e.push(a), n += a.line.indexed.geometrySize + a.line.nonIndexed.geometrySize, s += a.mesh.indexed.geometrySize + a.mesh.nonIndexed.geometrySize, r += a.point.indexed.geometrySize + a.point.nonIndexed.geometrySize, t += a.summary.totalGeometrySize, i += a.summary.totalMappingSize;
     }), {
       layers: e,
       summary: {
@@ -6504,7 +6504,7 @@ class bn {
         totalSize: {
           line: n,
           mesh: s,
-          point: o,
+          point: r,
           geometry: t,
           mapping: i
         }
@@ -7076,8 +7076,8 @@ class vn extends gi {
     e == null && (e = this.curPos);
     const t = [], i = this._scene.activeLayout;
     if (i) {
-      const n = this.activeLayoutView, s = n.pointToBox(e, this.selectionBoxSize), o = this._scene.search(s), r = Math.max(s.size.width / 2, s.size.height / 2), a = n.resetRaycaster(e, r);
-      o.forEach((h) => {
+      const n = this.activeLayoutView, s = n.pointToBox(e, this.selectionBoxSize), r = this._scene.search(s), o = Math.max(s.size.width / 2, s.size.height / 2), a = n.resetRaycaster(e, o);
+      r.forEach((h) => {
         const l = h.id;
         i.isIntersectWith(l, a) && t.push(l);
       });
@@ -7109,7 +7109,9 @@ class vn extends gi {
    */
   addEntity(e) {
     const t = Array.isArray(e) ? e : [e];
-    this.batchConvert(t);
+    setTimeout(async () => {
+      await this.batchConvert(t);
+    });
   }
   /**
    * Remove the specified entity from this view.
@@ -7217,36 +7219,34 @@ class vn extends gi {
    * @param entities - The database entities
    * @returns The converted three entities
    */
-  batchConvert(e) {
-    const t = [];
-    for (let i = 0; i < e.length; ++i) {
-      const n = e[i], s = n.draw(
+  async batchConvert(e) {
+    for (let t = 0; t < e.length; ++t) {
+      const i = e[t], n = i.draw(
         this._renderer
       );
-      if (s) {
-        s.objectId = n.objectId, s.ownerId = n.ownerId, s.layerName = n.layer, s.visible = n.visibility;
-        const o = !(n instanceof ot || n instanceof at);
-        if (s.draw().then(() => {
-          this._scene.addEntity(s, o), s.dispose(), this._isDirty = !0;
-        }), n instanceof st) {
-          if (n.number > 1) {
-            const r = this._layoutViewManager.getAt(n.ownerId);
+      if (n) {
+        n.objectId = i.objectId, n.ownerId = i.ownerId, n.layerName = i.layer, n.visible = i.visibility;
+        const s = !(i instanceof ot || i instanceof at);
+        if (await n.draw().then(() => {
+          this._scene.addEntity(n, s), n.dispose(), this._isDirty = !0;
+        }), i instanceof st) {
+          if (i.number > 1) {
+            const r = this._layoutViewManager.getAt(i.ownerId);
             if (r) {
-              const a = new Be(
+              const o = new Be(
                 r,
-                n.toGiViewport(),
+                i.toGiViewport(),
                 this._renderer
               );
-              r.addViewport(a);
+              r.addViewport(o);
             }
           }
-        } else if (n instanceof rt) {
-          const r = n.imageFileName;
-          r && this._missedImages.set(n.objectId, r);
+        } else if (i instanceof rt) {
+          const r = i.imageFileName;
+          r && this._missedImages.set(i.objectId, r);
         }
       }
     }
-    return t;
   }
 }
 const Je = "simsun";
@@ -7278,8 +7278,8 @@ class Q {
   createExampleDoc1(e) {
     for (let n = 0; n < 2; ++n)
       for (let s = 0; s < 2; ++s) {
-        const o = new De(), r = new ct();
-        r.addVertexAt(0, { x: s * 100, y: n * 100, bulge: 1 }), r.addVertexAt(1, { x: s * 100 + 100, y: n * 100, bulge: 1 }), r.closed = !0, o.add(r), e.tables.blockTable.modelSpace.appendEntity(o);
+        const r = new De(), o = new ct();
+        o.addVertexAt(0, { x: s * 100, y: n * 100, bulge: 1 }), o.addVertexAt(1, { x: s * 100 + 100, y: n * 100, bulge: 1 }), o.closed = !0, r.add(o), e.tables.blockTable.modelSpace.appendEntity(r);
       }
   }
   /**
@@ -7466,8 +7466,8 @@ class Sn {
     await this.getAvaiableFonts();
     const t = [];
     e.forEach((n) => {
-      const s = n.toLowerCase(), o = Jt(this._avaiableFonts, (r) => Kt(r.name, (a) => a.toLowerCase() == s) >= 0);
-      o && t.push(o.url);
+      const s = n.toLowerCase(), r = Jt(this._avaiableFonts, (o) => Kt(o.name, (a) => a.toLowerCase() == s) >= 0);
+      r && t.push(r.url);
     }), (await this._cadRenderer.loadFonts(t)).forEach((n) => {
       n.status || V.emit("font-not-loaded", {
         fontName: n.fontName,
@@ -7931,23 +7931,23 @@ class Ke {
       });
     }), i.hatchStyle = e.hatchStyle, i.patternName = e.patternName, i.patternType = e.patternType, i.patternAngle = e.patternAngle == null ? 0 : e.patternAngle, i.patternScale = e.patternScale == null ? 0 : e.patternScale, e.boundaryPaths.forEach((n) => {
       if (n.boundaryPathTypeFlag & 2) {
-        const s = n, o = new ct();
-        o.closed = s.isClosed, s.vertices.forEach((r, a) => {
-          o.addVertexAt(a, {
-            x: r.x,
-            y: r.y,
-            bulge: r.bulge
+        const s = n, r = new ct();
+        r.closed = s.isClosed, s.vertices.forEach((o, a) => {
+          r.addVertexAt(a, {
+            x: o.x,
+            y: o.y,
+            bulge: o.bulge
           });
-        }), i.add(o);
+        }), i.add(r);
       } else {
-        const s = n, o = new ut();
-        s.edges.forEach((r) => {
-          if (r.type == 1) {
-            const a = r;
-            o.add(new gt(a.start, a.end));
-          } else if (r.type == 2) {
-            const a = r;
-            o.add(
+        const s = n, r = new ut();
+        s.edges.forEach((o) => {
+          if (o.type == 1) {
+            const a = o;
+            r.add(new gt(a.start, a.end));
+          } else if (o.type == 2) {
+            const a = o;
+            r.add(
               new mt(
                 a.center,
                 a.radius,
@@ -7956,15 +7956,15 @@ class Ke {
                 !a.isCCW
               )
             );
-          } else if (r.type == 3) {
-            const a = r;
+          } else if (o.type == 3) {
+            const a = o;
             new Te().subVectors(a.end, a.center);
             const h = Math.sqrt(
               Math.pow(a.end.x, 2) + Math.pow(a.end.y, 2)
             ), l = h * a.lengthOfMinorAxis;
             let m = a.startAngle, u = a.endAngle;
             const p = Math.atan2(a.end.y, a.end.x);
-            a.isCCW || (m = Math.PI * 2 - m, u = Math.PI * 2 - u), o.add(
+            a.isCCW || (m = Math.PI * 2 - m, u = Math.PI * 2 - u), r.add(
               new jt(
                 { ...a.center, z: 0 },
                 h,
@@ -7975,8 +7975,8 @@ class Ke {
                 p
               )
             );
-          } else if (r.type == 4) {
-            const a = r;
+          } else if (o.type == 4) {
+            const a = o;
             if (a.numberOfControlPoints > 0 && a.numberOfKnots > 0) {
               const h = a.controlPoints.map(
                 (u) => ({
@@ -7987,7 +7987,7 @@ class Ke {
               );
               let l = !0;
               const m = a.controlPoints.map((u) => (u.weight == null && (l = !1), u.weight || 1));
-              o.add(
+              r.add(
                 new Fe(
                   h,
                   a.knots,
@@ -8000,10 +8000,10 @@ class Ke {
                 y: l.y,
                 z: 0
               }));
-              o.add(new Fe(h, "Uniform"));
+              r.add(new Fe(h, "Uniform"));
             }
           }
-        }), i.add(o);
+        }), i.add(r);
       }
     }), i;
   }
@@ -8137,19 +8137,19 @@ class In extends Bt {
    */
   getFonts(e) {
     const t = /* @__PURE__ */ new Map();
-    e.tables.BLOCK_RECORD.entries.forEach((o) => {
-      t.set(o.name, o);
+    e.tables.BLOCK_RECORD.entries.forEach((r) => {
+      t.set(r.name, r);
     });
-    const i = /* @__PURE__ */ new Map(), n = (o) => {
-      if (o) {
-        const r = o.lastIndexOf(".");
-        return r >= 0 ? o.substring(0, r).toLowerCase() : o.toLowerCase();
+    const i = /* @__PURE__ */ new Map(), n = (r) => {
+      if (r) {
+        const o = r.lastIndexOf(".");
+        return o >= 0 ? r.substring(0, o).toLowerCase() : r.toLowerCase();
       }
     };
-    e.tables.STYLE.entries.forEach((o) => {
-      const r = [];
-      let a = n(o.font);
-      a && r.push(a), a = n(o.bigFont), a && r.push(a), i.set(o.name, r);
+    e.tables.STYLE.entries.forEach((r) => {
+      const o = [];
+      let a = n(r.font);
+      a && o.push(a), a = n(r.bigFont), a && o.push(a), i.set(r.name, o);
     });
     const s = /* @__PURE__ */ new Set();
     return this.getFontsInBlock(e.entities, t, i, s), Array.from(s);
@@ -8159,19 +8159,19 @@ class In extends Bt {
    */
   getFontsInBlock(e, t, i, n) {
     const s = /\\f(.*?)\|/g;
-    e.forEach((o) => {
-      if (o.type == "MTEXT") {
-        const r = o;
-        [...r.text.matchAll(s)].forEach((h) => {
+    e.forEach((r) => {
+      if (r.type == "MTEXT") {
+        const o = r;
+        [...o.text.matchAll(s)].forEach((h) => {
           n.add(h[1].toLowerCase());
         });
-        const a = i.get(r.styleName);
+        const a = i.get(o.styleName);
         a == null || a.forEach((h) => n.add(h));
-      } else if (o.type == "TEXT") {
-        const r = o, a = i.get(r.styleName);
+      } else if (r.type == "TEXT") {
+        const o = r, a = i.get(o.styleName);
         a == null || a.forEach((h) => n.add(h));
-      } else if (o.type == "INSERT") {
-        const r = o, a = t.get(r.name);
+      } else if (r.type == "INSERT") {
+        const o = r, a = t.get(o.name);
         a && this.getFontsInBlock(a.entities, t, i, n);
       }
     });
@@ -8306,8 +8306,8 @@ class In extends Bt {
   }
   async processEntitiesInBlock(e, t) {
     const i = new Ke(), n = e.length, s = [];
-    for (let o = 0; o < n; o++) {
-      const r = e[o], a = i.convert(r);
+    for (let r = 0; r < n; r++) {
+      const o = e[r], a = i.convert(o);
       a && s.push(a);
     }
     t.appendEntity(s);
@@ -8318,19 +8318,19 @@ class In extends Bt {
    * smaller pieces and executed in small intervals to allow the UI to remain responsive.
    */
   async processEntities(e, t, i, n, s) {
-    const o = new Ke();
-    let r = e.entities;
-    const a = r.length, h = new Dt(
+    const r = new Ke();
+    let o = e.entities;
+    const a = o.length, h = new Dt(
       a,
       100 - n.value,
       i
     );
-    this.config.convertByEntityType && (r = this.groupAndFlattenByType(r));
+    this.config.convertByEntityType && (o = this.groupAndFlattenByType(o));
     const l = t.tables.blockTable.modelSpace;
     await h.processChunk(async (m, u) => {
       const p = [];
       for (let g = m; g < u; g++) {
-        const y = r[g], f = o.convert(y);
+        const y = o[g], f = r.convert(y);
         f && p.push(f);
       }
       if (l.appendEntity(p), s) {
@@ -8354,11 +8354,11 @@ class In extends Bt {
     e.objects.LAYOUT.forEach((n) => {
       const s = new tt();
       s.layoutName = n.layoutName, s.tabOrder = n.tabOrder;
-      const o = t.tables.blockTable.newIterator();
+      const r = t.tables.blockTable.newIterator();
       s.objectId = n.handle.toString();
-      for (const r of o)
-        if (r.layoutId === s.objectId) {
-          s.blockTableRecordId = r.objectId;
+      for (const o of r)
+        if (o.layoutId === s.objectId) {
+          s.blockTableRecordId = o.objectId;
           break;
         }
       s.limits.min.copy(n.minLimit), s.limits.max.copy(n.maxLimit), s.extents.min.copy(n.minExtent), s.extents.max.copy(n.maxExtent), this.processCommonObjectAttrs(n, s), i.setAt(s.layoutName, s);