@mlightcad/mtext-renderer 0.10.13 → 0.10.15

package/dist/mtext-renderer-worker.js

@@ -646,13 +646,13 @@ var P1 = Fc((L) => {
                       const l = f[0];
                       this.scanner.consume(l.length);
                       const p = parseInt(l, 16);
-                      let g = "";
+                      let d = "";
                       try {
-                        g = String.fromCodePoint(p);
+                        d = String.fromCodePoint(p);
                       } catch {
-                        g = "▯";
+                        d = "▯";
                       }
-                      return a ? [e, a] : [e, g];
+                      return a ? [e, a] : [e, d];
                     }
                     this.scanner.consume(-1);
                   }
@@ -1222,7 +1222,7 @@ var P1 = Fc((L) => {
         throw new Error("Invalid component type.");
     }
   }
-  function ke(n, e) {
+  function Ee(n, e) {
     switch (e.constructor) {
       case Float32Array:
         return n;
@@ -1495,8 +1495,8 @@ var P1 = Fc((L) => {
       return this.multiplyMatrices(e, this);
     }
     multiplyMatrices(e, t) {
-      const r = e.elements, i = t.elements, s = this.elements, a = r[0], o = r[3], h = r[6], c = r[1], u = r[4], f = r[7], l = r[2], p = r[5], g = r[8], m = i[0], x = i[3], v = i[6], w = i[1], b = i[4], S = i[7], T = i[2], B = i[5], M = i[8];
-      return s[0] = a * m + o * w + h * T, s[3] = a * x + o * b + h * B, s[6] = a * v + o * S + h * M, s[1] = c * m + u * w + f * T, s[4] = c * x + u * b + f * B, s[7] = c * v + u * S + f * M, s[2] = l * m + p * w + g * T, s[5] = l * x + p * b + g * B, s[8] = l * v + p * S + g * M, this;
+      const r = e.elements, i = t.elements, s = this.elements, a = r[0], o = r[3], h = r[6], c = r[1], u = r[4], f = r[7], l = r[2], p = r[5], d = r[8], m = i[0], x = i[3], v = i[6], w = i[1], b = i[4], S = i[7], T = i[2], B = i[5], M = i[8];
+      return s[0] = a * m + o * w + h * T, s[3] = a * x + o * b + h * B, s[6] = a * v + o * S + h * M, s[1] = c * m + u * w + f * T, s[4] = c * x + u * b + f * B, s[7] = c * v + u * S + f * M, s[2] = l * m + p * w + d * T, s[5] = l * x + p * b + d * B, s[8] = l * v + p * S + d * M, this;
     }
     multiplyScalar(e) {
       const t = this.elements;
@@ -1507,9 +1507,9 @@ var P1 = Fc((L) => {
       return t * a * u - t * o * c - r * s * u + r * o * h + i * s * c - i * a * h;
     }
     invert() {
-      const e = this.elements, t = e[0], r = e[1], i = e[2], s = e[3], a = e[4], o = e[5], h = e[6], c = e[7], u = e[8], f = u * a - o * c, l = o * h - u * s, p = c * s - a * h, g = t * f + r * l + i * p;
-      if (g === 0) return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0);
-      const m = 1 / g;
+      const e = this.elements, t = e[0], r = e[1], i = e[2], s = e[3], a = e[4], o = e[5], h = e[6], c = e[7], u = e[8], f = u * a - o * c, l = o * h - u * s, p = c * s - a * h, d = t * f + r * l + i * p;
+      if (d === 0) return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0);
+      const m = 1 / d;
       return e[0] = f * m, e[1] = (i * c - u * r) * m, e[2] = (o * r - i * a) * m, e[3] = l * m, e[4] = (u * t - i * h) * m, e[5] = (i * s - o * t) * m, e[6] = p * m, e[7] = (r * h - c * t) * m, e[8] = (a * t - r * s) * m, this;
     }
     transpose() {
@@ -2020,16 +2020,16 @@ var P1 = Fc((L) => {
     }
     setAxisAngleFromRotationMatrix(e) {
       let t, r, i, s;
-      const h = e.elements, c = h[0], u = h[4], f = h[8], l = h[1], p = h[5], g = h[9], m = h[2], x = h[6], v = h[10];
-      if (Math.abs(u - l) < 0.01 && Math.abs(f - m) < 0.01 && Math.abs(g - x) < 0.01) {
-        if (Math.abs(u + l) < 0.1 && Math.abs(f + m) < 0.1 && Math.abs(g + x) < 0.1 && Math.abs(c + p + v - 3) < 0.1)
+      const h = e.elements, c = h[0], u = h[4], f = h[8], l = h[1], p = h[5], d = h[9], m = h[2], x = h[6], v = h[10];
+      if (Math.abs(u - l) < 0.01 && Math.abs(f - m) < 0.01 && Math.abs(d - x) < 0.01) {
+        if (Math.abs(u + l) < 0.1 && Math.abs(f + m) < 0.1 && Math.abs(d + x) < 0.1 && Math.abs(c + p + v - 3) < 0.1)
           return this.set(1, 0, 0, 0), this;
         t = Math.PI;
-        const b = (c + 1) / 2, S = (p + 1) / 2, T = (v + 1) / 2, B = (u + l) / 4, M = (f + m) / 4, _ = (g + x) / 4;
+        const b = (c + 1) / 2, S = (p + 1) / 2, T = (v + 1) / 2, B = (u + l) / 4, M = (f + m) / 4, _ = (d + x) / 4;
         return b > S && b > T ? b < 0.01 ? (r = 0, i = 0.707106781, s = 0.707106781) : (r = Math.sqrt(b), i = B / r, s = M / r) : S > T ? S < 0.01 ? (r = 0.707106781, i = 0, s = 0.707106781) : (i = Math.sqrt(S), r = B / i, s = _ / i) : T < 0.01 ? (r = 0.707106781, i = 0.707106781, s = 0) : (s = Math.sqrt(T), r = M / s, i = _ / s), this.set(r, i, s, t), this;
       }
-      let w = Math.sqrt((x - g) * (x - g) + (f - m) * (f - m) + (l - u) * (l - u));
-      return Math.abs(w) < 1e-3 && (w = 1), this.x = (x - g) / w, this.y = (f - m) / w, this.z = (l - u) / w, this.w = Math.acos((c + p + v - 1) / 2), this;
+      let w = Math.sqrt((x - d) * (x - d) + (f - m) * (f - m) + (l - u) * (l - u));
+      return Math.abs(w) < 1e-3 && (w = 1), this.x = (x - d) / w, this.y = (f - m) / w, this.z = (l - u) / w, this.w = Math.acos((c + p + v - 1) / 2), this;
     }
     setFromMatrixPosition(e) {
       const t = e.elements;
@@ -2115,24 +2115,24 @@ var P1 = Fc((L) => {
     }
     static slerpFlat(e, t, r, i, s, a, o) {
       let h = r[i + 0], c = r[i + 1], u = r[i + 2], f = r[i + 3];
-      const l = s[a + 0], p = s[a + 1], g = s[a + 2], m = s[a + 3];
+      const l = s[a + 0], p = s[a + 1], d = s[a + 2], m = s[a + 3];
       if (o === 0) {
         e[t + 0] = h, e[t + 1] = c, e[t + 2] = u, e[t + 3] = f;
         return;
       }
       if (o === 1) {
-        e[t + 0] = l, e[t + 1] = p, e[t + 2] = g, e[t + 3] = m;
+        e[t + 0] = l, e[t + 1] = p, e[t + 2] = d, e[t + 3] = m;
         return;
       }
-      if (f !== m || h !== l || c !== p || u !== g) {
+      if (f !== m || h !== l || c !== p || u !== d) {
         let x = 1 - o;
-        const v = h * l + c * p + u * g + f * m, w = v >= 0 ? 1 : -1, b = 1 - v * v;
+        const v = h * l + c * p + u * d + f * m, w = v >= 0 ? 1 : -1, b = 1 - v * v;
         if (b > Number.EPSILON) {
           const T = Math.sqrt(b), B = Math.atan2(T, v * w);
           x = Math.sin(x * B) / T, o = Math.sin(o * B) / T;
         }
         const S = o * w;
-        if (h = h * x + l * S, c = c * x + p * S, u = u * x + g * S, f = f * x + m * S, x === 1 - o) {
+        if (h = h * x + l * S, c = c * x + p * S, u = u * x + d * S, f = f * x + m * S, x === 1 - o) {
           const T = 1 / Math.sqrt(h * h + c * c + u * u + f * f);
           h *= T, c *= T, u *= T, f *= T;
         }
@@ -2140,8 +2140,8 @@ var P1 = Fc((L) => {
       e[t] = h, e[t + 1] = c, e[t + 2] = u, e[t + 3] = f;
     }
     static multiplyQuaternionsFlat(e, t, r, i, s, a) {
-      const o = r[i], h = r[i + 1], c = r[i + 2], u = r[i + 3], f = s[a], l = s[a + 1], p = s[a + 2], g = s[a + 3];
-      return e[t] = o * g + u * f + h * p - c * l, e[t + 1] = h * g + u * l + c * f - o * p, e[t + 2] = c * g + u * p + o * l - h * f, e[t + 3] = u * g - o * f - h * l - c * p, e;
+      const o = r[i], h = r[i + 1], c = r[i + 2], u = r[i + 3], f = s[a], l = s[a + 1], p = s[a + 2], d = s[a + 3];
+      return e[t] = o * d + u * f + h * p - c * l, e[t + 1] = h * d + u * l + c * f - o * p, e[t + 2] = c * d + u * p + o * l - h * f, e[t + 3] = u * d - o * f - h * l - c * p, e;
     }
     get x() {
       return this._x;
@@ -2177,25 +2177,25 @@ var P1 = Fc((L) => {
       return this._x = e.x, this._y = e.y, this._z = e.z, this._w = e.w, this._onChangeCallback(), this;
     }
     setFromEuler(e, t = !0) {
-      const r = e._x, i = e._y, s = e._z, a = e._order, o = Math.cos, h = Math.sin, c = o(r / 2), u = o(i / 2), f = o(s / 2), l = h(r / 2), p = h(i / 2), g = h(s / 2);
+      const r = e._x, i = e._y, s = e._z, a = e._order, o = Math.cos, h = Math.sin, c = o(r / 2), u = o(i / 2), f = o(s / 2), l = h(r / 2), p = h(i / 2), d = h(s / 2);
       switch (a) {
         case "XYZ":
-          this._x = l * u * f + c * p * g, this._y = c * p * f - l * u * g, this._z = c * u * g + l * p * f, this._w = c * u * f - l * p * g;
+          this._x = l * u * f + c * p * d, this._y = c * p * f - l * u * d, this._z = c * u * d + l * p * f, this._w = c * u * f - l * p * d;
           break;
         case "YXZ":
-          this._x = l * u * f + c * p * g, this._y = c * p * f - l * u * g, this._z = c * u * g - l * p * f, this._w = c * u * f + l * p * g;
+          this._x = l * u * f + c * p * d, this._y = c * p * f - l * u * d, this._z = c * u * d - l * p * f, this._w = c * u * f + l * p * d;
           break;
         case "ZXY":
-          this._x = l * u * f - c * p * g, this._y = c * p * f + l * u * g, this._z = c * u * g + l * p * f, this._w = c * u * f - l * p * g;
+          this._x = l * u * f - c * p * d, this._y = c * p * f + l * u * d, this._z = c * u * d + l * p * f, this._w = c * u * f - l * p * d;
           break;
         case "ZYX":
-          this._x = l * u * f - c * p * g, this._y = c * p * f + l * u * g, this._z = c * u * g - l * p * f, this._w = c * u * f + l * p * g;
+          this._x = l * u * f - c * p * d, this._y = c * p * f + l * u * d, this._z = c * u * d - l * p * f, this._w = c * u * f + l * p * d;
           break;
         case "YZX":
-          this._x = l * u * f + c * p * g, this._y = c * p * f + l * u * g, this._z = c * u * g - l * p * f, this._w = c * u * f - l * p * g;
+          this._x = l * u * f + c * p * d, this._y = c * p * f + l * u * d, this._z = c * u * d - l * p * f, this._w = c * u * f - l * p * d;
           break;
         case "XZY":
-          this._x = l * u * f - c * p * g, this._y = c * p * f - l * u * g, this._z = c * u * g + l * p * f, this._w = c * u * f + l * p * g;
+          this._x = l * u * f - c * p * d, this._y = c * p * f - l * u * d, this._z = c * u * d + l * p * f, this._w = c * u * f + l * p * d;
           break;
         default:
           console.warn("THREE.Quaternion: .setFromEuler() encountered an unknown order: " + a);
@@ -2587,7 +2587,7 @@ var P1 = Fc((L) => {
     }
   }
   const xi = /* @__PURE__ */ new E(), ma = /* @__PURE__ */ new zt();
-  class Ee {
+  class ke {
     constructor(e = new E(1 / 0, 1 / 0, 1 / 0), t = new E(-1 / 0, -1 / 0, -1 / 0)) {
       this.isBox3 = !0, this.min = e, this.max = t;
     }
@@ -2754,7 +2754,7 @@ var P1 = Fc((L) => {
     /* @__PURE__ */ new E(),
     /* @__PURE__ */ new E(),
     /* @__PURE__ */ new E()
-  ], He = /* @__PURE__ */ new E(), dn = /* @__PURE__ */ new Ee(), nr = /* @__PURE__ */ new E(), ir = /* @__PURE__ */ new E(), sr = /* @__PURE__ */ new E(), bt = /* @__PURE__ */ new E(), wt = /* @__PURE__ */ new E(), Gt = /* @__PURE__ */ new E(), Ar = /* @__PURE__ */ new E(), gn = /* @__PURE__ */ new E(), yn = /* @__PURE__ */ new E(), Ht = /* @__PURE__ */ new E();
+  ], He = /* @__PURE__ */ new E(), dn = /* @__PURE__ */ new ke(), nr = /* @__PURE__ */ new E(), ir = /* @__PURE__ */ new E(), sr = /* @__PURE__ */ new E(), bt = /* @__PURE__ */ new E(), wt = /* @__PURE__ */ new E(), Gt = /* @__PURE__ */ new E(), Ar = /* @__PURE__ */ new E(), gn = /* @__PURE__ */ new E(), yn = /* @__PURE__ */ new E(), Ht = /* @__PURE__ */ new E();
   function bi(n, e, t, r, i) {
     for (let s = 0, a = n.length - 3; s <= a; s += 3) {
       Ht.fromArray(n, s);
@@ -2764,7 +2764,7 @@ var P1 = Fc((L) => {
     }
     return !0;
   }
-  const Yc = /* @__PURE__ */ new Ee(), Mr = /* @__PURE__ */ new E(), wi = /* @__PURE__ */ new E();
+  const Yc = /* @__PURE__ */ new ke(), Mr = /* @__PURE__ */ new E(), wi = /* @__PURE__ */ new E();
   class Bs {
     constructor(e = new E(), t = -1) {
       this.isSphere = !0, this.center = e, this.radius = t;
@@ -2874,11 +2874,11 @@ var P1 = Fc((L) => {
     distanceSqToSegment(e, t, r, i) {
       Si.copy(e).add(t).multiplyScalar(0.5), mn.copy(t).sub(e).normalize(), St.copy(this.origin).sub(Si);
       const s = e.distanceTo(t) * 0.5, a = -this.direction.dot(mn), o = St.dot(this.direction), h = -St.dot(mn), c = St.lengthSq(), u = Math.abs(1 - a * a);
-      let f, l, p, g;
+      let f, l, p, d;
       if (u > 0)
-        if (f = a * h - o, l = a * o - h, g = s * u, f >= 0)
-          if (l >= -g)
-            if (l <= g) {
+        if (f = a * h - o, l = a * o - h, d = s * u, f >= 0)
+          if (l >= -d)
+            if (l <= d) {
               const m = 1 / u;
               f *= m, l *= m, p = f * (f + a * l + 2 * o) + l * (a * f + l + 2 * h) + c;
             } else
@@ -2886,7 +2886,7 @@ var P1 = Fc((L) => {
           else
             l = -s, f = Math.max(0, -(a * l + o)), p = -f * f + l * (l + 2 * h) + c;
         else
-          l <= -g ? (f = Math.max(0, -(-a * s + o)), l = f > 0 ? -s : Math.min(Math.max(-s, -h), s), p = -f * f + l * (l + 2 * h) + c) : l <= g ? (f = 0, l = Math.min(Math.max(-s, -h), s), p = l * (l + 2 * h) + c) : (f = Math.max(0, -(a * s + o)), l = f > 0 ? s : Math.min(Math.max(-s, -h), s), p = -f * f + l * (l + 2 * h) + c);
+          l <= -d ? (f = Math.max(0, -(-a * s + o)), l = f > 0 ? -s : Math.min(Math.max(-s, -h), s), p = -f * f + l * (l + 2 * h) + c) : l <= d ? (f = 0, l = Math.min(Math.max(-s, -h), s), p = l * (l + 2 * h) + c) : (f = Math.max(0, -(a * s + o)), l = f > 0 ? s : Math.min(Math.max(-s, -h), s), p = -f * f + l * (l + 2 * h) + c);
       else
         l = a > 0 ? -s : s, f = Math.max(0, -(a * l + o)), p = -f * f + l * (l + 2 * h) + c;
       return r && r.copy(this.origin).addScaledVector(this.direction, f), i && i.copy(Si).addScaledVector(mn, l), p;
@@ -2955,7 +2955,7 @@ var P1 = Fc((L) => {
     }
   }
   class Fe {
-    constructor(e, t, r, i, s, a, o, h, c, u, f, l, p, g, m, x) {
+    constructor(e, t, r, i, s, a, o, h, c, u, f, l, p, d, m, x) {
       Fe.prototype.isMatrix4 = !0, this.elements = [
         1,
         0,
@@ -2973,11 +2973,11 @@ var P1 = Fc((L) => {
         0,
         0,
         1
-      ], e !== void 0 && this.set(e, t, r, i, s, a, o, h, c, u, f, l, p, g, m, x);
+      ], e !== void 0 && this.set(e, t, r, i, s, a, o, h, c, u, f, l, p, d, m, x);
     }
-    set(e, t, r, i, s, a, o, h, c, u, f, l, p, g, m, x) {
+    set(e, t, r, i, s, a, o, h, c, u, f, l, p, d, m, x) {
       const v = this.elements;
-      return v[0] = e, v[4] = t, v[8] = r, v[12] = i, v[1] = s, v[5] = a, v[9] = o, v[13] = h, v[2] = c, v[6] = u, v[10] = f, v[14] = l, v[3] = p, v[7] = g, v[11] = m, v[15] = x, this;
+      return v[0] = e, v[4] = t, v[8] = r, v[12] = i, v[1] = s, v[5] = a, v[9] = o, v[13] = h, v[2] = c, v[6] = u, v[10] = f, v[14] = l, v[3] = p, v[7] = d, v[11] = m, v[15] = x, this;
     }
     identity() {
       return this.set(
@@ -3061,23 +3061,23 @@ var P1 = Fc((L) => {
     makeRotationFromEuler(e) {
       const t = this.elements, r = e.x, i = e.y, s = e.z, a = Math.cos(r), o = Math.sin(r), h = Math.cos(i), c = Math.sin(i), u = Math.cos(s), f = Math.sin(s);
       if (e.order === "XYZ") {
-        const l = a * u, p = a * f, g = o * u, m = o * f;
-        t[0] = h * u, t[4] = -h * f, t[8] = c, t[1] = p + g * c, t[5] = l - m * c, t[9] = -o * h, t[2] = m - l * c, t[6] = g + p * c, t[10] = a * h;
+        const l = a * u, p = a * f, d = o * u, m = o * f;
+        t[0] = h * u, t[4] = -h * f, t[8] = c, t[1] = p + d * c, t[5] = l - m * c, t[9] = -o * h, t[2] = m - l * c, t[6] = d + p * c, t[10] = a * h;
       } else if (e.order === "YXZ") {
-        const l = h * u, p = h * f, g = c * u, m = c * f;
-        t[0] = l + m * o, t[4] = g * o - p, t[8] = a * c, t[1] = a * f, t[5] = a * u, t[9] = -o, t[2] = p * o - g, t[6] = m + l * o, t[10] = a * h;
+        const l = h * u, p = h * f, d = c * u, m = c * f;
+        t[0] = l + m * o, t[4] = d * o - p, t[8] = a * c, t[1] = a * f, t[5] = a * u, t[9] = -o, t[2] = p * o - d, t[6] = m + l * o, t[10] = a * h;
       } else if (e.order === "ZXY") {
-        const l = h * u, p = h * f, g = c * u, m = c * f;
-        t[0] = l - m * o, t[4] = -a * f, t[8] = g + p * o, t[1] = p + g * o, t[5] = a * u, t[9] = m - l * o, t[2] = -a * c, t[6] = o, t[10] = a * h;
+        const l = h * u, p = h * f, d = c * u, m = c * f;
+        t[0] = l - m * o, t[4] = -a * f, t[8] = d + p * o, t[1] = p + d * o, t[5] = a * u, t[9] = m - l * o, t[2] = -a * c, t[6] = o, t[10] = a * h;
       } else if (e.order === "ZYX") {
-        const l = a * u, p = a * f, g = o * u, m = o * f;
-        t[0] = h * u, t[4] = g * c - p, t[8] = l * c + m, t[1] = h * f, t[5] = m * c + l, t[9] = p * c - g, t[2] = -c, t[6] = o * h, t[10] = a * h;
+        const l = a * u, p = a * f, d = o * u, m = o * f;
+        t[0] = h * u, t[4] = d * c - p, t[8] = l * c + m, t[1] = h * f, t[5] = m * c + l, t[9] = p * c - d, t[2] = -c, t[6] = o * h, t[10] = a * h;
       } else if (e.order === "YZX") {
-        const l = a * h, p = a * c, g = o * h, m = o * c;
-        t[0] = h * u, t[4] = m - l * f, t[8] = g * f + p, t[1] = f, t[5] = a * u, t[9] = -o * u, t[2] = -c * u, t[6] = p * f + g, t[10] = l - m * f;
+        const l = a * h, p = a * c, d = o * h, m = o * c;
+        t[0] = h * u, t[4] = m - l * f, t[8] = d * f + p, t[1] = f, t[5] = a * u, t[9] = -o * u, t[2] = -c * u, t[6] = p * f + d, t[10] = l - m * f;
       } else if (e.order === "XZY") {
-        const l = a * h, p = a * c, g = o * h, m = o * c;
-        t[0] = h * u, t[4] = -f, t[8] = c * u, t[1] = l * f + m, t[5] = a * u, t[9] = p * f - g, t[2] = g * f - p, t[6] = o * u, t[10] = m * f + l;
+        const l = a * h, p = a * c, d = o * h, m = o * c;
+        t[0] = h * u, t[4] = -f, t[8] = c * u, t[1] = l * f + m, t[5] = a * u, t[9] = p * f - d, t[2] = d * f - p, t[6] = o * u, t[10] = m * f + l;
       }
       return t[3] = 0, t[7] = 0, t[11] = 0, t[12] = 0, t[13] = 0, t[14] = 0, t[15] = 1, this;
     }
@@ -3095,16 +3095,16 @@ var P1 = Fc((L) => {
       return this.multiplyMatrices(e, this);
     }
     multiplyMatrices(e, t) {
-      const r = e.elements, i = t.elements, s = this.elements, a = r[0], o = r[4], h = r[8], c = r[12], u = r[1], f = r[5], l = r[9], p = r[13], g = r[2], m = r[6], x = r[10], v = r[14], w = r[3], b = r[7], S = r[11], T = r[15], B = i[0], M = i[4], _ = i[8], D = i[12], N = i[1], G = i[5], ee = i[9], Y = i[13], Z = i[2], Q = i[6], K = i[10], ne = i[14], ae = i[3], ie = i[7], he = i[11], W = i[15];
-      return s[0] = a * B + o * N + h * Z + c * ae, s[4] = a * M + o * G + h * Q + c * ie, s[8] = a * _ + o * ee + h * K + c * he, s[12] = a * D + o * Y + h * ne + c * W, s[1] = u * B + f * N + l * Z + p * ae, s[5] = u * M + f * G + l * Q + p * ie, s[9] = u * _ + f * ee + l * K + p * he, s[13] = u * D + f * Y + l * ne + p * W, s[2] = g * B + m * N + x * Z + v * ae, s[6] = g * M + m * G + x * Q + v * ie, s[10] = g * _ + m * ee + x * K + v * he, s[14] = g * D + m * Y + x * ne + v * W, s[3] = w * B + b * N + S * Z + T * ae, s[7] = w * M + b * G + S * Q + T * ie, s[11] = w * _ + b * ee + S * K + T * he, s[15] = w * D + b * Y + S * ne + T * W, this;
+      const r = e.elements, i = t.elements, s = this.elements, a = r[0], o = r[4], h = r[8], c = r[12], u = r[1], f = r[5], l = r[9], p = r[13], d = r[2], m = r[6], x = r[10], v = r[14], w = r[3], b = r[7], S = r[11], T = r[15], B = i[0], M = i[4], _ = i[8], D = i[12], N = i[1], G = i[5], ee = i[9], Y = i[13], Z = i[2], Q = i[6], K = i[10], ne = i[14], ae = i[3], ie = i[7], he = i[11], W = i[15];
+      return s[0] = a * B + o * N + h * Z + c * ae, s[4] = a * M + o * G + h * Q + c * ie, s[8] = a * _ + o * ee + h * K + c * he, s[12] = a * D + o * Y + h * ne + c * W, s[1] = u * B + f * N + l * Z + p * ae, s[5] = u * M + f * G + l * Q + p * ie, s[9] = u * _ + f * ee + l * K + p * he, s[13] = u * D + f * Y + l * ne + p * W, s[2] = d * B + m * N + x * Z + v * ae, s[6] = d * M + m * G + x * Q + v * ie, s[10] = d * _ + m * ee + x * K + v * he, s[14] = d * D + m * Y + x * ne + v * W, s[3] = w * B + b * N + S * Z + T * ae, s[7] = w * M + b * G + S * Q + T * ie, s[11] = w * _ + b * ee + S * K + T * he, s[15] = w * D + b * Y + S * ne + T * W, this;
     }
     multiplyScalar(e) {
       const t = this.elements;
       return t[0] *= e, t[4] *= e, t[8] *= e, t[12] *= e, t[1] *= e, t[5] *= e, t[9] *= e, t[13] *= e, t[2] *= e, t[6] *= e, t[10] *= e, t[14] *= e, t[3] *= e, t[7] *= e, t[11] *= e, t[15] *= e, this;
     }
     determinant() {
-      const e = this.elements, t = e[0], r = e[4], i = e[8], s = e[12], a = e[1], o = e[5], h = e[9], c = e[13], u = e[2], f = e[6], l = e[10], p = e[14], g = e[3], m = e[7], x = e[11], v = e[15];
-      return g * (+s * h * f - i * c * f - s * o * l + r * c * l + i * o * p - r * h * p) + m * (+t * h * p - t * c * l + s * a * l - i * a * p + i * c * u - s * h * u) + x * (+t * c * f - t * o * p - s * a * f + r * a * p + s * o * u - r * c * u) + v * (-i * o * u - t * h * f + t * o * l + i * a * f - r * a * l + r * h * u);
+      const e = this.elements, t = e[0], r = e[4], i = e[8], s = e[12], a = e[1], o = e[5], h = e[9], c = e[13], u = e[2], f = e[6], l = e[10], p = e[14], d = e[3], m = e[7], x = e[11], v = e[15];
+      return d * (+s * h * f - i * c * f - s * o * l + r * c * l + i * o * p - r * h * p) + m * (+t * h * p - t * c * l + s * a * l - i * a * p + i * c * u - s * h * u) + x * (+t * c * f - t * o * p - s * a * f + r * a * p + s * o * u - r * c * u) + v * (-i * o * u - t * h * f + t * o * l + i * a * f - r * a * l + r * h * u);
     }
     transpose() {
       const e = this.elements;
@@ -3116,10 +3116,10 @@ var P1 = Fc((L) => {
       return e.isVector3 ? (i[12] = e.x, i[13] = e.y, i[14] = e.z) : (i[12] = e, i[13] = t, i[14] = r), this;
     }
     invert() {
-      const e = this.elements, t = e[0], r = e[1], i = e[2], s = e[3], a = e[4], o = e[5], h = e[6], c = e[7], u = e[8], f = e[9], l = e[10], p = e[11], g = e[12], m = e[13], x = e[14], v = e[15], w = f * x * c - m * l * c + m * h * p - o * x * p - f * h * v + o * l * v, b = g * l * c - u * x * c - g * h * p + a * x * p + u * h * v - a * l * v, S = u * m * c - g * f * c + g * o * p - a * m * p - u * o * v + a * f * v, T = g * f * h - u * m * h - g * o * l + a * m * l + u * o * x - a * f * x, B = t * w + r * b + i * S + s * T;
+      const e = this.elements, t = e[0], r = e[1], i = e[2], s = e[3], a = e[4], o = e[5], h = e[6], c = e[7], u = e[8], f = e[9], l = e[10], p = e[11], d = e[12], m = e[13], x = e[14], v = e[15], w = f * x * c - m * l * c + m * h * p - o * x * p - f * h * v + o * l * v, b = d * l * c - u * x * c - d * h * p + a * x * p + u * h * v - a * l * v, S = u * m * c - d * f * c + d * o * p - a * m * p - u * o * v + a * f * v, T = d * f * h - u * m * h - d * o * l + a * m * l + u * o * x - a * f * x, B = t * w + r * b + i * S + s * T;
       if (B === 0) return this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
       const M = 1 / B;
-      return e[0] = w * M, e[1] = (m * l * s - f * x * s - m * i * p + r * x * p + f * i * v - r * l * v) * M, e[2] = (o * x * s - m * h * s + m * i * c - r * x * c - o * i * v + r * h * v) * M, e[3] = (f * h * s - o * l * s - f * i * c + r * l * c + o * i * p - r * h * p) * M, e[4] = b * M, e[5] = (u * x * s - g * l * s + g * i * p - t * x * p - u * i * v + t * l * v) * M, e[6] = (g * h * s - a * x * s - g * i * c + t * x * c + a * i * v - t * h * v) * M, e[7] = (a * l * s - u * h * s + u * i * c - t * l * c - a * i * p + t * h * p) * M, e[8] = S * M, e[9] = (g * f * s - u * m * s - g * r * p + t * m * p + u * r * v - t * f * v) * M, e[10] = (a * m * s - g * o * s + g * r * c - t * m * c - a * r * v + t * o * v) * M, e[11] = (u * o * s - a * f * s - u * r * c + t * f * c + a * r * p - t * o * p) * M, e[12] = T * M, e[13] = (u * m * i - g * f * i + g * r * l - t * m * l - u * r * x + t * f * x) * M, e[14] = (g * o * i - a * m * i - g * r * h + t * m * h + a * r * x - t * o * x) * M, e[15] = (a * f * i - u * o * i + u * r * h - t * f * h - a * r * l + t * o * l) * M, this;
+      return e[0] = w * M, e[1] = (m * l * s - f * x * s - m * i * p + r * x * p + f * i * v - r * l * v) * M, e[2] = (o * x * s - m * h * s + m * i * c - r * x * c - o * i * v + r * h * v) * M, e[3] = (f * h * s - o * l * s - f * i * c + r * l * c + o * i * p - r * h * p) * M, e[4] = b * M, e[5] = (u * x * s - d * l * s + d * i * p - t * x * p - u * i * v + t * l * v) * M, e[6] = (d * h * s - a * x * s - d * i * c + t * x * c + a * i * v - t * h * v) * M, e[7] = (a * l * s - u * h * s + u * i * c - t * l * c - a * i * p + t * h * p) * M, e[8] = S * M, e[9] = (d * f * s - u * m * s - d * r * p + t * m * p + u * r * v - t * f * v) * M, e[10] = (a * m * s - d * o * s + d * r * c - t * m * c - a * r * v + t * o * v) * M, e[11] = (u * o * s - a * f * s - u * r * c + t * f * c + a * r * p - t * o * p) * M, e[12] = T * M, e[13] = (u * m * i - d * f * i + d * r * l - t * m * l - u * r * x + t * f * x) * M, e[14] = (d * o * i - a * m * i - d * r * h + t * m * h + a * r * x - t * o * x) * M, e[15] = (a * f * i - u * o * i + u * r * h - t * f * h - a * r * l + t * o * l) * M, this;
     }
     scale(e) {
       const t = this.elements, r = e.x, i = e.y, s = e.z;
@@ -3291,8 +3291,8 @@ var P1 = Fc((L) => {
       ), this;
     }
     compose(e, t, r) {
-      const i = this.elements, s = t._x, a = t._y, o = t._z, h = t._w, c = s + s, u = a + a, f = o + o, l = s * c, p = s * u, g = s * f, m = a * u, x = a * f, v = o * f, w = h * c, b = h * u, S = h * f, T = r.x, B = r.y, M = r.z;
-      return i[0] = (1 - (m + v)) * T, i[1] = (p + S) * T, i[2] = (g - b) * T, i[3] = 0, i[4] = (p - S) * B, i[5] = (1 - (l + v)) * B, i[6] = (x + w) * B, i[7] = 0, i[8] = (g + b) * M, i[9] = (x - w) * M, i[10] = (1 - (l + m)) * M, i[11] = 0, i[12] = e.x, i[13] = e.y, i[14] = e.z, i[15] = 1, this;
+      const i = this.elements, s = t._x, a = t._y, o = t._z, h = t._w, c = s + s, u = a + a, f = o + o, l = s * c, p = s * u, d = s * f, m = a * u, x = a * f, v = o * f, w = h * c, b = h * u, S = h * f, T = r.x, B = r.y, M = r.z;
+      return i[0] = (1 - (m + v)) * T, i[1] = (p + S) * T, i[2] = (d - b) * T, i[3] = 0, i[4] = (p - S) * B, i[5] = (1 - (l + v)) * B, i[6] = (x + w) * B, i[7] = 0, i[8] = (d + b) * M, i[9] = (x - w) * M, i[10] = (1 - (l + m)) * M, i[11] = 0, i[12] = e.x, i[13] = e.y, i[14] = e.z, i[15] = 1, this;
     }
     decompose(e, t, r) {
       const i = this.elements;
@@ -3304,25 +3304,25 @@ var P1 = Fc((L) => {
     }
     makePerspective(e, t, r, i, s, a, o = pn) {
       const h = this.elements, c = 2 * s / (t - e), u = 2 * s / (r - i), f = (t + e) / (t - e), l = (r + i) / (r - i);
-      let p, g;
+      let p, d;
       if (o === pn)
-        p = -(a + s) / (a - s), g = -2 * a * s / (a - s);
+        p = -(a + s) / (a - s), d = -2 * a * s / (a - s);
       else if (o === pa)
-        p = -a / (a - s), g = -a * s / (a - s);
+        p = -a / (a - s), d = -a * s / (a - s);
       else
         throw new Error("THREE.Matrix4.makePerspective(): Invalid coordinate system: " + o);
-      return h[0] = c, h[4] = 0, h[8] = f, h[12] = 0, h[1] = 0, h[5] = u, h[9] = l, h[13] = 0, h[2] = 0, h[6] = 0, h[10] = p, h[14] = g, h[3] = 0, h[7] = 0, h[11] = -1, h[15] = 0, this;
+      return h[0] = c, h[4] = 0, h[8] = f, h[12] = 0, h[1] = 0, h[5] = u, h[9] = l, h[13] = 0, h[2] = 0, h[6] = 0, h[10] = p, h[14] = d, h[3] = 0, h[7] = 0, h[11] = -1, h[15] = 0, this;
     }
     makeOrthographic(e, t, r, i, s, a, o = pn) {
       const h = this.elements, c = 1 / (t - e), u = 1 / (r - i), f = 1 / (a - s), l = (t + e) * c, p = (r + i) * u;
-      let g, m;
+      let d, m;
       if (o === pn)
-        g = (a + s) * f, m = -2 * f;
+        d = (a + s) * f, m = -2 * f;
       else if (o === pa)
-        g = s * f, m = -1 * f;
+        d = s * f, m = -1 * f;
       else
         throw new Error("THREE.Matrix4.makeOrthographic(): Invalid coordinate system: " + o);
-      return h[0] = 2 * c, h[4] = 0, h[8] = 0, h[12] = -l, h[1] = 0, h[5] = 2 * u, h[9] = 0, h[13] = -p, h[2] = 0, h[6] = 0, h[10] = m, h[14] = -g, h[3] = 0, h[7] = 0, h[11] = 0, h[15] = 1, this;
+      return h[0] = 2 * c, h[4] = 0, h[8] = 0, h[12] = -l, h[1] = 0, h[5] = 2 * u, h[9] = 0, h[13] = -p, h[2] = 0, h[6] = 0, h[10] = m, h[14] = -d, h[3] = 0, h[7] = 0, h[11] = 0, h[15] = 1, this;
     }
     equals(e) {
       const t = this.elements, r = e.elements;
@@ -3735,8 +3735,8 @@ var P1 = Fc((L) => {
         }
       }
       if (t) {
-        const o = a(e.geometries), h = a(e.materials), c = a(e.textures), u = a(e.images), f = a(e.shapes), l = a(e.skeletons), p = a(e.animations), g = a(e.nodes);
-        o.length > 0 && (r.geometries = o), h.length > 0 && (r.materials = h), c.length > 0 && (r.textures = c), u.length > 0 && (r.images = u), f.length > 0 && (r.shapes = f), l.length > 0 && (r.skeletons = l), p.length > 0 && (r.animations = p), g.length > 0 && (r.nodes = g);
+        const o = a(e.geometries), h = a(e.materials), c = a(e.textures), u = a(e.images), f = a(e.shapes), l = a(e.skeletons), p = a(e.animations), d = a(e.nodes);
+        o.length > 0 && (r.geometries = o), h.length > 0 && (r.materials = h), c.length > 0 && (r.textures = c), u.length > 0 && (r.images = u), f.length > 0 && (r.shapes = f), l.length > 0 && (r.skeletons = l), p.length > 0 && (r.animations = p), d.length > 0 && (r.nodes = d);
       }
       return r.object = i, r;
       function a(o) {
@@ -3780,8 +3780,8 @@ var P1 = Fc((L) => {
       const a = Ve.dot(Ve), o = Ve.dot(ct), h = Ve.dot(ki), c = ct.dot(ct), u = ct.dot(ki), f = a * c - o * o;
       if (f === 0)
         return s.set(0, 0, 0), null;
-      const l = 1 / f, p = (c * h - o * u) * l, g = (a * u - o * h) * l;
-      return s.set(1 - p - g, g, p);
+      const l = 1 / f, p = (c * h - o * u) * l, d = (a * u - o * h) * l;
+      return s.set(1 - p - d, d, p);
     }
     static containsPoint(e, t, r, i) {
       return this.getBarycoord(e, t, r, i, ut) === null ? !1 : ut.x >= 0 && ut.y >= 0 && ut.x + ut.y <= 1;
@@ -3852,15 +3852,15 @@ var P1 = Fc((L) => {
       if (l <= 0 && h >= 0 && u <= 0)
         return a = h / (h - u), t.copy(r).addScaledVector(cr, a);
       Mi.subVectors(e, s);
-      const p = cr.dot(Mi), g = ur.dot(Mi);
-      if (g >= 0 && p <= g)
+      const p = cr.dot(Mi), d = ur.dot(Mi);
+      if (d >= 0 && p <= d)
         return t.copy(s);
-      const m = p * c - h * g;
-      if (m <= 0 && c >= 0 && g <= 0)
-        return o = c / (c - g), t.copy(r).addScaledVector(ur, o);
-      const x = u * g - p * f;
-      if (x <= 0 && f - u >= 0 && p - g >= 0)
-        return Ta.subVectors(s, i), o = (f - u) / (f - u + (p - g)), t.copy(i).addScaledVector(Ta, o);
+      const m = p * c - h * d;
+      if (m <= 0 && c >= 0 && d <= 0)
+        return o = c / (c - d), t.copy(r).addScaledVector(ur, o);
+      const x = u * d - p * f;
+      if (x <= 0 && f - u >= 0 && p - d >= 0)
+        return Ta.subVectors(s, i), o = (f - u) / (f - u + (p - d)), t.copy(i).addScaledVector(Ta, o);
       const v = 1 / (x + m + l);
       return a = m * v, o = l * v, t.copy(r).addScaledVector(cr, a).addScaledVector(ur, o);
     }
@@ -4387,44 +4387,44 @@ var P1 = Fc((L) => {
       return this.normalized && (r = Er(r, this.array)), r;
     }
     setComponent(e, t, r) {
-      return this.normalized && (r = ke(r, this.array)), this.array[e * this.itemSize + t] = r, this;
+      return this.normalized && (r = Ee(r, this.array)), this.array[e * this.itemSize + t] = r, this;
     }
     getX(e) {
       let t = this.array[e * this.itemSize];
       return this.normalized && (t = Er(t, this.array)), t;
     }
     setX(e, t) {
-      return this.normalized && (t = ke(t, this.array)), this.array[e * this.itemSize] = t, this;
+      return this.normalized && (t = Ee(t, this.array)), this.array[e * this.itemSize] = t, this;
     }
     getY(e) {
       let t = this.array[e * this.itemSize + 1];
       return this.normalized && (t = Er(t, this.array)), t;
     }
     setY(e, t) {
-      return this.normalized && (t = ke(t, this.array)), this.array[e * this.itemSize + 1] = t, this;
+      return this.normalized && (t = Ee(t, this.array)), this.array[e * this.itemSize + 1] = t, this;
     }
     getZ(e) {
       let t = this.array[e * this.itemSize + 2];
       return this.normalized && (t = Er(t, this.array)), t;
     }
     setZ(e, t) {
-      return this.normalized && (t = ke(t, this.array)), this.array[e * this.itemSize + 2] = t, this;
+      return this.normalized && (t = Ee(t, this.array)), this.array[e * this.itemSize + 2] = t, this;
     }
     getW(e) {
       let t = this.array[e * this.itemSize + 3];
       return this.normalized && (t = Er(t, this.array)), t;
     }
     setW(e, t) {
-      return this.normalized && (t = ke(t, this.array)), this.array[e * this.itemSize + 3] = t, this;
+      return this.normalized && (t = Ee(t, this.array)), this.array[e * this.itemSize + 3] = t, this;
     }
     setXY(e, t, r) {
-      return e *= this.itemSize, this.normalized && (t = ke(t, this.array), r = ke(r, this.array)), this.array[e + 0] = t, this.array[e + 1] = r, this;
+      return e *= this.itemSize, this.normalized && (t = Ee(t, this.array), r = Ee(r, this.array)), this.array[e + 0] = t, this.array[e + 1] = r, this;
     }
     setXYZ(e, t, r, i) {
-      return e *= this.itemSize, this.normalized && (t = ke(t, this.array), r = ke(r, this.array), i = ke(i, this.array)), this.array[e + 0] = t, this.array[e + 1] = r, this.array[e + 2] = i, this;
+      return e *= this.itemSize, this.normalized && (t = Ee(t, this.array), r = Ee(r, this.array), i = Ee(i, this.array)), this.array[e + 0] = t, this.array[e + 1] = r, this.array[e + 2] = i, this;
     }
     setXYZW(e, t, r, i, s) {
-      return e *= this.itemSize, this.normalized && (t = ke(t, this.array), r = ke(r, this.array), i = ke(i, this.array), s = ke(s, this.array)), this.array[e + 0] = t, this.array[e + 1] = r, this.array[e + 2] = i, this.array[e + 3] = s, this;
+      return e *= this.itemSize, this.normalized && (t = Ee(t, this.array), r = Ee(r, this.array), i = Ee(i, this.array), s = Ee(s, this.array)), this.array[e + 0] = t, this.array[e + 1] = r, this.array[e + 2] = i, this.array[e + 3] = s, this;
     }
     onUpload(e) {
       return this.onUploadCallback = e, this;
@@ -4458,7 +4458,7 @@ var P1 = Fc((L) => {
     }
   }
   let iu = 0;
-  const Re = /* @__PURE__ */ new Fe(), Ri = /* @__PURE__ */ new Be(), lr = /* @__PURE__ */ new E(), Me = /* @__PURE__ */ new Ee(), Br = /* @__PURE__ */ new Ee(), ve = /* @__PURE__ */ new E();
+  const Re = /* @__PURE__ */ new Fe(), Ri = /* @__PURE__ */ new Be(), lr = /* @__PURE__ */ new E(), Me = /* @__PURE__ */ new ke(), Br = /* @__PURE__ */ new ke(), ve = /* @__PURE__ */ new E();
   class ze extends ai {
     constructor() {
       super(), this.isBufferGeometry = !0, Object.defineProperty(this, "id", { value: iu++ }), this.uuid = Sr(), this.name = "", this.type = "BufferGeometry", this.index = null, this.indirect = null, this.attributes = {}, this.morphAttributes = {}, this.morphTargetsRelative = !1, this.groups = [], this.boundingBox = null, this.boundingSphere = null, this.drawRange = { start: 0, count: 1 / 0 }, this.userData = {};
@@ -4555,7 +4555,7 @@ var P1 = Fc((L) => {
       return this;
     }
     computeBoundingBox() {
-      this.boundingBox === null && (this.boundingBox = new Ee());
+      this.boundingBox === null && (this.boundingBox = new ke());
       const e = this.attributes.position, t = this.morphAttributes.position;
       if (e && e.isGLBufferAttribute) {
         console.error("THREE.BufferGeometry.computeBoundingBox(): GLBufferAttribute requires a manual bounding box.", this), this.boundingBox.set(
@@ -4612,11 +4612,11 @@ var P1 = Fc((L) => {
       const a = this.getAttribute("tangent"), o = [], h = [];
       for (let _ = 0; _ < r.count; _++)
         o[_] = new E(), h[_] = new E();
-      const c = new E(), u = new E(), f = new E(), l = new q(), p = new q(), g = new q(), m = new E(), x = new E();
+      const c = new E(), u = new E(), f = new E(), l = new q(), p = new q(), d = new q(), m = new E(), x = new E();
       function v(_, D, N) {
-        c.fromBufferAttribute(r, _), u.fromBufferAttribute(r, D), f.fromBufferAttribute(r, N), l.fromBufferAttribute(s, _), p.fromBufferAttribute(s, D), g.fromBufferAttribute(s, N), u.sub(c), f.sub(c), p.sub(l), g.sub(l);
-        const G = 1 / (p.x * g.y - g.x * p.y);
-        isFinite(G) && (m.copy(u).multiplyScalar(g.y).addScaledVector(f, -p.y).multiplyScalar(G), x.copy(f).multiplyScalar(p.x).addScaledVector(u, -g.x).multiplyScalar(G), o[_].add(m), o[D].add(m), o[N].add(m), h[_].add(x), h[D].add(x), h[N].add(x));
+        c.fromBufferAttribute(r, _), u.fromBufferAttribute(r, D), f.fromBufferAttribute(r, N), l.fromBufferAttribute(s, _), p.fromBufferAttribute(s, D), d.fromBufferAttribute(s, N), u.sub(c), f.sub(c), p.sub(l), d.sub(l);
+        const G = 1 / (p.x * d.y - d.x * p.y);
+        isFinite(G) && (m.copy(u).multiplyScalar(d.y).addScaledVector(f, -p.y).multiplyScalar(G), x.copy(f).multiplyScalar(p.x).addScaledVector(u, -d.x).multiplyScalar(G), o[_].add(m), o[D].add(m), o[N].add(m), h[_].add(x), h[D].add(x), h[N].add(x));
       }
       let w = this.groups;
       w.length === 0 && (w = [{
@@ -4658,8 +4658,8 @@ var P1 = Fc((L) => {
         const i = new E(), s = new E(), a = new E(), o = new E(), h = new E(), c = new E(), u = new E(), f = new E();
         if (e)
           for (let l = 0, p = e.count; l < p; l += 3) {
-            const g = e.getX(l + 0), m = e.getX(l + 1), x = e.getX(l + 2);
-            i.fromBufferAttribute(t, g), s.fromBufferAttribute(t, m), a.fromBufferAttribute(t, x), u.subVectors(a, s), f.subVectors(i, s), u.cross(f), o.fromBufferAttribute(r, g), h.fromBufferAttribute(r, m), c.fromBufferAttribute(r, x), o.add(u), h.add(u), c.add(u), r.setXYZ(g, o.x, o.y, o.z), r.setXYZ(m, h.x, h.y, h.z), r.setXYZ(x, c.x, c.y, c.z);
+            const d = e.getX(l + 0), m = e.getX(l + 1), x = e.getX(l + 2);
+            i.fromBufferAttribute(t, d), s.fromBufferAttribute(t, m), a.fromBufferAttribute(t, x), u.subVectors(a, s), f.subVectors(i, s), u.cross(f), o.fromBufferAttribute(r, d), h.fromBufferAttribute(r, m), c.fromBufferAttribute(r, x), o.add(u), h.add(u), c.add(u), r.setXYZ(d, o.x, o.y, o.z), r.setXYZ(m, h.x, h.y, h.z), r.setXYZ(x, c.x, c.y, c.z);
           }
         else
           for (let l = 0, p = t.count; l < p; l += 3)
@@ -4675,11 +4675,11 @@ var P1 = Fc((L) => {
     toNonIndexed() {
       function e(o, h) {
         const c = o.array, u = o.itemSize, f = o.normalized, l = new c.constructor(h.length * u);
-        let p = 0, g = 0;
+        let p = 0, d = 0;
         for (let m = 0, x = h.length; m < x; m++) {
           o.isInterleavedBufferAttribute ? p = h[m] * o.data.stride + o.offset : p = h[m] * u;
           for (let v = 0; v < u; v++)
-            l[g++] = c[p++];
+            l[d++] = c[p++];
         }
         return new Ye(l, u, f);
       }
@@ -4831,32 +4831,32 @@ var P1 = Fc((L) => {
       const s = this.geometry, a = this.material, o = s.index, h = s.attributes.position, c = s.attributes.uv, u = s.attributes.uv1, f = s.attributes.normal, l = s.groups, p = s.drawRange;
       if (o !== null)
         if (Array.isArray(a))
-          for (let g = 0, m = l.length; g < m; g++) {
-            const x = l[g], v = a[x.materialIndex], w = Math.max(x.start, p.start), b = Math.min(o.count, Math.min(x.start + x.count, p.start + p.count));
+          for (let d = 0, m = l.length; d < m; d++) {
+            const x = l[d], v = a[x.materialIndex], w = Math.max(x.start, p.start), b = Math.min(o.count, Math.min(x.start + x.count, p.start + p.count));
             for (let S = w, T = b; S < T; S += 3) {
               const B = o.getX(S), M = o.getX(S + 1), _ = o.getX(S + 2);
               i = Mn(this, v, e, r, c, u, f, B, M, _), i && (i.faceIndex = Math.floor(S / 3), i.face.materialIndex = x.materialIndex, t.push(i));
             }
           }
         else {
-          const g = Math.max(0, p.start), m = Math.min(o.count, p.start + p.count);
-          for (let x = g, v = m; x < v; x += 3) {
+          const d = Math.max(0, p.start), m = Math.min(o.count, p.start + p.count);
+          for (let x = d, v = m; x < v; x += 3) {
             const w = o.getX(x), b = o.getX(x + 1), S = o.getX(x + 2);
             i = Mn(this, a, e, r, c, u, f, w, b, S), i && (i.faceIndex = Math.floor(x / 3), t.push(i));
           }
         }
       else if (h !== void 0)
         if (Array.isArray(a))
-          for (let g = 0, m = l.length; g < m; g++) {
-            const x = l[g], v = a[x.materialIndex], w = Math.max(x.start, p.start), b = Math.min(h.count, Math.min(x.start + x.count, p.start + p.count));
+          for (let d = 0, m = l.length; d < m; d++) {
+            const x = l[d], v = a[x.materialIndex], w = Math.max(x.start, p.start), b = Math.min(h.count, Math.min(x.start + x.count, p.start + p.count));
             for (let S = w, T = b; S < T; S += 3) {
               const B = S, M = S + 1, _ = S + 2;
               i = Mn(this, v, e, r, c, u, f, B, M, _), i && (i.faceIndex = Math.floor(S / 3), i.face.materialIndex = x.materialIndex, t.push(i));
             }
           }
         else {
-          const g = Math.max(0, p.start), m = Math.min(h.count, p.start + p.count);
-          for (let x = g, v = m; x < v; x += 3) {
+          const d = Math.max(0, p.start), m = Math.min(h.count, p.start + p.count);
+          for (let x = d, v = m; x < v; x += 3) {
             const w = x, b = x + 1, S = x + 2;
             i = Mn(this, a, e, r, c, u, f, w, b, S), i && (i.faceIndex = Math.floor(x / 3), t.push(i));
           }
@@ -4924,23 +4924,23 @@ var P1 = Fc((L) => {
       Ma.copy(i).invert(), Lr.copy(e.ray).applyMatrix4(Ma);
       const o = s / ((this.scale.x + this.scale.y + this.scale.z) / 3), h = o * o, c = this.isLineSegments ? 2 : 1, u = r.index, l = r.attributes.position;
       if (u !== null) {
-        const p = Math.max(0, a.start), g = Math.min(u.count, a.start + a.count);
-        for (let m = p, x = g - 1; m < x; m += c) {
+        const p = Math.max(0, a.start), d = Math.min(u.count, a.start + a.count);
+        for (let m = p, x = d - 1; m < x; m += c) {
           const v = u.getX(m), w = u.getX(m + 1), b = Bn(this, e, Lr, h, v, w);
           b && t.push(b);
         }
         if (this.isLineLoop) {
-          const m = u.getX(g - 1), x = u.getX(p), v = Bn(this, e, Lr, h, m, x);
+          const m = u.getX(d - 1), x = u.getX(p), v = Bn(this, e, Lr, h, m, x);
           v && t.push(v);
         }
       } else {
-        const p = Math.max(0, a.start), g = Math.min(l.count, a.start + a.count);
-        for (let m = p, x = g - 1; m < x; m += c) {
+        const p = Math.max(0, a.start), d = Math.min(l.count, a.start + a.count);
+        for (let m = p, x = d - 1; m < x; m += c) {
           const v = Bn(this, e, Lr, h, m, m + 1);
           v && t.push(v);
         }
         if (this.isLineLoop) {
-          const m = Bn(this, e, Lr, h, g - 1, p);
+          const m = Bn(this, e, Lr, h, d - 1, p);
           m && t.push(m);
         }
       }
@@ -5087,8 +5087,8 @@ var P1 = Fc((L) => {
     computeFrenetFrames(e, t) {
       const r = new E(), i = [], s = [], a = [], o = new E(), h = new Fe();
       for (let p = 0; p <= e; p++) {
-        const g = p / e;
-        i[p] = this.getTangentAt(g, new E());
+        const d = p / e;
+        i[p] = this.getTangentAt(d, new E());
       }
       s[0] = new E(), a[0] = new E();
       let c = Number.MAX_VALUE;
@@ -5097,16 +5097,16 @@ var P1 = Fc((L) => {
       for (let p = 1; p <= e; p++) {
         if (s[p] = s[p - 1].clone(), a[p] = a[p - 1].clone(), o.crossVectors(i[p - 1], i[p]), o.length() > Number.EPSILON) {
           o.normalize();
-          const g = Math.acos(X(i[p - 1].dot(i[p]), -1, 1));
-          s[p].applyMatrix4(h.makeRotationAxis(o, g));
+          const d = Math.acos(X(i[p - 1].dot(i[p]), -1, 1));
+          s[p].applyMatrix4(h.makeRotationAxis(o, d));
         }
         a[p].crossVectors(i[p], s[p]);
       }
       if (t === !0) {
         let p = Math.acos(X(s[0].dot(s[e]), -1, 1));
         p /= e, i[0].dot(o.crossVectors(s[0], s[e])) > 0 && (p = -p);
-        for (let g = 1; g <= e; g++)
-          s[g].applyMatrix4(h.makeRotationAxis(i[g], p * g)), a[g].crossVectors(i[g], s[g]);
+        for (let d = 1; d <= e; d++)
+          s[d].applyMatrix4(h.makeRotationAxis(i[d], p * d)), a[d].crossVectors(i[d], s[d]);
       }
       return {
         tangents: i,
@@ -5202,8 +5202,8 @@ var P1 = Fc((L) => {
       const f = i[o % s], l = i[(o + 1) % s];
       if (this.closed || o + 2 < s ? u = i[(o + 2) % s] : (Ln.subVectors(i[s - 1], i[s - 2]).add(i[s - 1]), u = Ln), this.curveType === "centripetal" || this.curveType === "chordal") {
         const p = this.curveType === "chordal" ? 0.5 : 0.25;
-        let g = Math.pow(c.distanceToSquared(f), p), m = Math.pow(f.distanceToSquared(l), p), x = Math.pow(l.distanceToSquared(u), p);
-        m < 1e-4 && (m = 1), g < 1e-4 && (g = m), x < 1e-4 && (x = m), Ii.initNonuniformCatmullRom(c.x, f.x, l.x, u.x, g, m, x), zi.initNonuniformCatmullRom(c.y, f.y, l.y, u.y, g, m, x), Pi.initNonuniformCatmullRom(c.z, f.z, l.z, u.z, g, m, x);
+        let d = Math.pow(c.distanceToSquared(f), p), m = Math.pow(f.distanceToSquared(l), p), x = Math.pow(l.distanceToSquared(u), p);
+        m < 1e-4 && (m = 1), d < 1e-4 && (d = m), x < 1e-4 && (x = m), Ii.initNonuniformCatmullRom(c.x, f.x, l.x, u.x, d, m, x), zi.initNonuniformCatmullRom(c.y, f.y, l.y, u.y, d, m, x), Pi.initNonuniformCatmullRom(c.z, f.z, l.z, u.z, d, m, x);
       } else this.curveType === "catmullrom" && (Ii.initCatmullRom(c.x, f.x, l.x, u.x, this.tension), zi.initCatmullRom(c.y, f.y, l.y, u.y, this.tension), Pi.initCatmullRom(c.z, f.z, l.z, u.z, this.tension));
       return r.set(
         Ii.calc(h),
@@ -5698,8 +5698,8 @@ var P1 = Fc((L) => {
       let o, h, c, u, f, l, p;
       if (r && (s = Tu(n, e, s, t)), n.length > 80 * t) {
         o = c = n[0], h = u = n[1];
-        for (let g = t; g < i; g += t)
-          f = n[g], l = n[g + 1], f < o && (o = f), l < h && (h = l), f > c && (c = f), l > u && (u = l);
+        for (let d = t; d < i; d += t)
+          f = n[d], l = n[d + 1], f < o && (o = f), l < h && (h = l), f > c && (c = f), l > u && (u = l);
         p = Math.max(c - o, u - h), p = p !== 0 ? 32767 / p : 0;
       }
       return Vr(s, a, t, o, h, p, 0), a;
@@ -5745,28 +5745,28 @@ var P1 = Fc((L) => {
     const e = n.prev, t = n, r = n.next;
     if (ue(e, t, r) >= 0) return !1;
     const i = e.x, s = t.x, a = r.x, o = e.y, h = t.y, c = r.y, u = i < s ? i < a ? i : a : s < a ? s : a, f = o < h ? o < c ? o : c : h < c ? h : c, l = i > s ? i > a ? i : a : s > a ? s : a, p = o > h ? o > c ? o : c : h > c ? h : c;
-    let g = r.next;
-    for (; g !== e; ) {
-      if (g.x >= u && g.x <= l && g.y >= f && g.y <= p && dr(i, o, s, h, a, c, g.x, g.y) && ue(g.prev, g, g.next) >= 0) return !1;
-      g = g.next;
+    let d = r.next;
+    for (; d !== e; ) {
+      if (d.x >= u && d.x <= l && d.y >= f && d.y <= p && dr(i, o, s, h, a, c, d.x, d.y) && ue(d.prev, d, d.next) >= 0) return !1;
+      d = d.next;
     }
     return !0;
   }
   function Su(n, e, t, r) {
     const i = n.prev, s = n, a = n.next;
     if (ue(i, s, a) >= 0) return !1;
-    const o = i.x, h = s.x, c = a.x, u = i.y, f = s.y, l = a.y, p = o < h ? o < c ? o : c : h < c ? h : c, g = u < f ? u < l ? u : l : f < l ? f : l, m = o > h ? o > c ? o : c : h > c ? h : c, x = u > f ? u > l ? u : l : f > l ? f : l, v = gs(p, g, e, t, r), w = gs(m, x, e, t, r);
+    const o = i.x, h = s.x, c = a.x, u = i.y, f = s.y, l = a.y, p = o < h ? o < c ? o : c : h < c ? h : c, d = u < f ? u < l ? u : l : f < l ? f : l, m = o > h ? o > c ? o : c : h > c ? h : c, x = u > f ? u > l ? u : l : f > l ? f : l, v = gs(p, d, e, t, r), w = gs(m, x, e, t, r);
     let b = n.prevZ, S = n.nextZ;
     for (; b && b.z >= v && S && S.z <= w; ) {
-      if (b.x >= p && b.x <= m && b.y >= g && b.y <= x && b !== i && b !== a && dr(o, u, h, f, c, l, b.x, b.y) && ue(b.prev, b, b.next) >= 0 || (b = b.prevZ, S.x >= p && S.x <= m && S.y >= g && S.y <= x && S !== i && S !== a && dr(o, u, h, f, c, l, S.x, S.y) && ue(S.prev, S, S.next) >= 0)) return !1;
+      if (b.x >= p && b.x <= m && b.y >= d && b.y <= x && b !== i && b !== a && dr(o, u, h, f, c, l, b.x, b.y) && ue(b.prev, b, b.next) >= 0 || (b = b.prevZ, S.x >= p && S.x <= m && S.y >= d && S.y <= x && S !== i && S !== a && dr(o, u, h, f, c, l, S.x, S.y) && ue(S.prev, S, S.next) >= 0)) return !1;
       S = S.nextZ;
     }
     for (; b && b.z >= v; ) {
-      if (b.x >= p && b.x <= m && b.y >= g && b.y <= x && b !== i && b !== a && dr(o, u, h, f, c, l, b.x, b.y) && ue(b.prev, b, b.next) >= 0) return !1;
+      if (b.x >= p && b.x <= m && b.y >= d && b.y <= x && b !== i && b !== a && dr(o, u, h, f, c, l, b.x, b.y) && ue(b.prev, b, b.next) >= 0) return !1;
       b = b.prevZ;
     }
     for (; S && S.z <= w; ) {
-      if (S.x >= p && S.x <= m && S.y >= g && S.y <= x && S !== i && S !== a && dr(o, u, h, f, c, l, S.x, S.y) && ue(S.prev, S, S.next) >= 0) return !1;
+      if (S.x >= p && S.x <= m && S.y >= d && S.y <= x && S !== i && S !== a && dr(o, u, h, f, c, l, S.x, S.y) && ue(S.prev, S, S.next) >= 0) return !1;
       S = S.nextZ;
     }
     return !0;
@@ -5981,15 +5981,15 @@ var P1 = Fc((L) => {
       function c(u) {
         const f = i.length / 3, l = u.extractPoints(t);
         let p = l.shape;
-        const g = l.holes;
+        const d = l.holes;
         Rt.isClockWise(p) === !1 && (p = p.reverse());
-        for (let x = 0, v = g.length; x < v; x++) {
-          const w = g[x];
-          Rt.isClockWise(w) === !0 && (g[x] = w.reverse());
+        for (let x = 0, v = d.length; x < v; x++) {
+          const w = d[x];
+          Rt.isClockWise(w) === !0 && (d[x] = w.reverse());
         }
-        const m = Rt.triangulateShape(p, g);
-        for (let x = 0, v = g.length; x < v; x++) {
-          const w = g[x];
+        const m = Rt.triangulateShape(p, d);
+        for (let x = 0, v = d.length; x < v; x++) {
+          const w = d[x];
           p = p.concat(w);
         }
         for (let x = 0, v = p.length; x < v; x++) {
@@ -6067,9 +6067,9 @@ var P1 = Fc((L) => {
         return f !== -1 && c.splice(f, 2), this;
       }, this.getHandler = function(u) {
         for (let f = 0, l = c.length; f < l; f += 2) {
-          const p = c[f], g = c[f + 1];
+          const p = c[f], d = c[f + 1];
           if (p.global && (p.lastIndex = 0), p.test(u))
-            return g;
+            return d;
         }
         return null;
       };
@@ -6146,7 +6146,7 @@ var P1 = Fc((L) => {
         if (c.status === 200 || c.status === 0) {
           if (c.status === 0 && console.warn("THREE.FileLoader: HTTP Status 0 received."), typeof ReadableStream > "u" || c.body === void 0 || c.body.getReader === void 0)
             return c;
-          const u = lt[e], f = c.body.getReader(), l = c.headers.get("X-File-Size") || c.headers.get("Content-Length"), p = l ? parseInt(l) : 0, g = p !== 0;
+          const u = lt[e], f = c.body.getReader(), l = c.headers.get("X-File-Size") || c.headers.get("Content-Length"), p = l ? parseInt(l) : 0, d = p !== 0;
           let m = 0;
           const x = new ReadableStream({
             start(v) {
@@ -6157,7 +6157,7 @@ var P1 = Fc((L) => {
                     v.close();
                   else {
                     m += S.byteLength;
-                    const T = new ProgressEvent("progress", { lengthComputable: g, loaded: m, total: p });
+                    const T = new ProgressEvent("progress", { lengthComputable: d, loaded: m, total: p });
                     for (let B = 0, M = u.length; B < M; B++) {
                       const _ = u[B];
                       _.onProgress && _.onProgress(T);
@@ -6188,7 +6188,7 @@ var P1 = Fc((L) => {
               return c.text();
             {
               const f = /charset="?([^;"\s]*)"?/i.exec(o), l = f && f[1] ? f[1].toLowerCase() : void 0, p = new TextDecoder(l);
-              return c.arrayBuffer().then((g) => p.decode(g));
+              return c.arrayBuffer().then((d) => p.decode(d));
             }
         }
       }).then((c) => {
@@ -6279,10 +6279,10 @@ var P1 = Fc((L) => {
       let u = !i(s[0].getPoints());
       u = e ? !u : u;
       const f = [], l = [];
-      let p = [], g = 0, m;
-      l[g] = void 0, p[g] = [];
+      let p = [], d = 0, m;
+      l[d] = void 0, p[d] = [];
       for (let v = 0, w = s.length; v < w; v++)
-        o = s[v], m = o.getPoints(), a = i(m), a = e ? !a : a, a ? (!u && l[g] && g++, l[g] = { s: new yr(), p: m }, l[g].s.curves = o.curves, u && g++, p[g] = []) : p[g].push({ h: o, p: m[0] });
+        o = s[v], m = o.getPoints(), a = i(m), a = e ? !a : a, a ? (!u && l[d] && d++, l[d] = { s: new yr(), p: m }, l[d].s.curves = o.curves, u && d++, p[d] = []) : p[d].push({ h: o, p: m[0] });
       if (!l[0]) return t(s);
       if (l.length > 1) {
         let v = !1, w = 0;
@@ -7205,19 +7205,19 @@ var P1 = Fc((L) => {
     var h = [n, e], c = [t, r], u = [i, s], f = [a, o];
     this.addPoint(n, e), this.addPoint(a, o);
     for (var l = 0; l <= 1; l++) {
-      var p = 6 * h[l] - 12 * c[l] + 6 * u[l], g = -3 * h[l] + 9 * c[l] - 9 * u[l] + 3 * f[l], m = 3 * c[l] - 3 * h[l];
-      if (g === 0) {
+      var p = 6 * h[l] - 12 * c[l] + 6 * u[l], d = -3 * h[l] + 9 * c[l] - 9 * u[l] + 3 * f[l], m = 3 * c[l] - 3 * h[l];
+      if (d === 0) {
         if (p === 0)
           continue;
         var x = -m / p;
         0 < x && x < 1 && (l === 0 && this.addX(fr(h[l], c[l], u[l], f[l], x)), l === 1 && this.addY(fr(h[l], c[l], u[l], f[l], x)));
         continue;
       }
-      var v = Math.pow(p, 2) - 4 * m * g;
+      var v = Math.pow(p, 2) - 4 * m * d;
       if (!(v < 0)) {
-        var w = (-p + Math.sqrt(v)) / (2 * g);
+        var w = (-p + Math.sqrt(v)) / (2 * d);
         0 < w && w < 1 && (l === 0 && this.addX(fr(h[l], c[l], u[l], f[l], w)), l === 1 && this.addY(fr(h[l], c[l], u[l], f[l], w)));
-        var b = (-p - Math.sqrt(v)) / (2 * g);
+        var b = (-p - Math.sqrt(v)) / (2 * d);
         0 < b && b < 1 && (l === 0 && this.addX(fr(h[l], c[l], u[l], f[l], b)), l === 1 && this.addY(fr(h[l], c[l], u[l], f[l], b)));
       }
     }
@@ -8195,8 +8195,8 @@ var P1 = Fc((L) => {
     var s;
     n.segCount = s = e.parseUShort() >> 1, e.skip("uShort", 3), n.glyphIndexMap = {};
     for (var a = new P.Parser(t, r + i + 14), o = new P.Parser(t, r + i + 16 + s * 2), h = new P.Parser(t, r + i + 16 + s * 4), c = new P.Parser(t, r + i + 16 + s * 6), u = r + i + 16 + s * 8, f = 0; f < s - 1; f += 1)
-      for (var l = void 0, p = a.parseUShort(), g = o.parseUShort(), m = h.parseShort(), x = c.parseUShort(), v = g; v <= p; v += 1)
-        x !== 0 ? (u = c.offset + c.relativeOffset - 2, u += x, u += (v - g) * 2, l = P.getUShort(t, u), l !== 0 && (l = l + m & 65535)) : l = v + m & 65535, n.glyphIndexMap[v] = l;
+      for (var l = void 0, p = a.parseUShort(), d = o.parseUShort(), m = h.parseShort(), x = c.parseUShort(), v = d; v <= p; v += 1)
+        x !== 0 ? (u = c.offset + c.relativeOffset - 2, u += x, u += (v - d) * 2, l = P.getUShort(t, u), l !== 0 && (l = l + m & 65535)) : l = v + m & 65535, n.glyphIndexMap[v] = l;
   }
   function Sl(n, e) {
     var t = {};
@@ -8278,14 +8278,14 @@ var P1 = Fc((L) => {
       });
     }
     Cl(s);
-    var h = s.segments.length, c = 0, u = [], f = [], l = [], p = [], g = [], m = [];
+    var h = s.segments.length, c = 0, u = [], f = [], l = [], p = [], d = [], m = [];
     for (t = 0; t < h; t += 1) {
       var x = s.segments[t];
-      x.end <= 65535 && x.start <= 65535 ? (u = u.concat({ name: "end_" + t, type: "USHORT", value: x.end }), f = f.concat({ name: "start_" + t, type: "USHORT", value: x.start }), l = l.concat({ name: "idDelta_" + t, type: "SHORT", value: x.delta }), p = p.concat({ name: "idRangeOffset_" + t, type: "USHORT", value: x.offset }), x.glyphId !== void 0 && (g = g.concat({ name: "glyph_" + t, type: "USHORT", value: x.glyphId }))) : c += 1, !e && x.glyphIndex !== void 0 && (m = m.concat({ name: "cmap12Start_" + t, type: "ULONG", value: x.start }), m = m.concat({ name: "cmap12End_" + t, type: "ULONG", value: x.end }), m = m.concat({ name: "cmap12Glyph_" + t, type: "ULONG", value: x.glyphIndex }));
+      x.end <= 65535 && x.start <= 65535 ? (u = u.concat({ name: "end_" + t, type: "USHORT", value: x.end }), f = f.concat({ name: "start_" + t, type: "USHORT", value: x.start }), l = l.concat({ name: "idDelta_" + t, type: "SHORT", value: x.delta }), p = p.concat({ name: "idRangeOffset_" + t, type: "USHORT", value: x.offset }), x.glyphId !== void 0 && (d = d.concat({ name: "glyph_" + t, type: "USHORT", value: x.glyphId }))) : c += 1, !e && x.glyphIndex !== void 0 && (m = m.concat({ name: "cmap12Start_" + t, type: "ULONG", value: x.start }), m = m.concat({ name: "cmap12End_" + t, type: "ULONG", value: x.end }), m = m.concat({ name: "cmap12Glyph_" + t, type: "ULONG", value: x.glyphIndex }));
     }
-    if (s.segCountX2 = (h - c) * 2, s.searchRange = Math.pow(2, Math.floor(Math.log(h - c) / Math.log(2))) * 2, s.entrySelector = Math.log(s.searchRange / 2) / Math.log(2), s.rangeShift = s.segCountX2 - s.searchRange, s.fields = s.fields.concat(u), s.fields.push({ name: "reservedPad", type: "USHORT", value: 0 }), s.fields = s.fields.concat(f), s.fields = s.fields.concat(l), s.fields = s.fields.concat(p), s.fields = s.fields.concat(g), s.cmap4Length = 14 + // Subtable header
+    if (s.segCountX2 = (h - c) * 2, s.searchRange = Math.pow(2, Math.floor(Math.log(h - c) / Math.log(2))) * 2, s.entrySelector = Math.log(s.searchRange / 2) / Math.log(2), s.rangeShift = s.segCountX2 - s.searchRange, s.fields = s.fields.concat(u), s.fields.push({ name: "reservedPad", type: "USHORT", value: 0 }), s.fields = s.fields.concat(f), s.fields = s.fields.concat(l), s.fields = s.fields.concat(p), s.fields = s.fields.concat(d), s.cmap4Length = 14 + // Subtable header
     u.length * 2 + 2 + // reservedPad
-    f.length * 2 + l.length * 2 + p.length * 2 + g.length * 2, !e) {
+    f.length * 2 + l.length * 2 + p.length * 2 + d.length * 2, !e) {
       var v = 16 + // Subtable header
       m.length * 4;
       s.cmap12Offset = 12 + 2 * 2 + 4 + s.cmap4Length, s.fields = s.fields.concat([
@@ -9619,10 +9619,10 @@ var P1 = Fc((L) => {
     this.getPath(e, t, r, i).draw(n);
   };
   Ne.prototype.drawPoints = function(n, e, t, r) {
-    function i(f, l, p, g) {
+    function i(f, l, p, d) {
       n.beginPath();
       for (var m = 0; m < f.length; m += 1)
-        n.moveTo(l + f[m].x * g, p + f[m].y * g), n.arc(l + f[m].x * g, p + f[m].y * g, 2, 0, Math.PI * 2, !1);
+        n.moveTo(l + f[m].x * d, p + f[m].y * d), n.arc(l + f[m].x * d, p + f[m].y * d, 2, 0, Math.PI * 2, !1);
       n.closePath(), n.fill();
     }
     e = e !== void 0 ? e : 0, t = t !== void 0 ? t : 0, r = r !== void 0 ? r : 24;
@@ -9919,12 +9919,12 @@ var P1 = Fc((L) => {
     return new si(i, t);
   }
   function ro(n, e, t) {
-    var r, i, s, a, o = new me(), h = [], c = 0, u = !1, f = !1, l = 0, p = 0, g, m, x, v;
+    var r, i, s, a, o = new me(), h = [], c = 0, u = !1, f = !1, l = 0, p = 0, d, m, x, v;
     if (n.isCIDFont) {
       var w = n.tables.cff.topDict._fdSelect[e.index], b = n.tables.cff.topDict._fdArray[w];
-      g = b._subrs, m = b._subrsBias, x = b._defaultWidthX, v = b._nominalWidthX;
+      d = b._subrs, m = b._subrsBias, x = b._defaultWidthX, v = b._nominalWidthX;
     } else
-      g = n.tables.cff.topDict._subrs, m = n.tables.cff.topDict._subrsBias, x = n.tables.cff.topDict._defaultWidthX, v = n.tables.cff.topDict._nominalWidthX;
+      d = n.tables.cff.topDict._subrs, m = n.tables.cff.topDict._subrsBias, x = n.tables.cff.topDict._defaultWidthX, v = n.tables.cff.topDict._nominalWidthX;
     var S = x;
     function T(_, D) {
       f && o.closePath(), o.moveTo(_, D), f = !0;
@@ -9963,7 +9963,7 @@ var P1 = Fc((L) => {
               r = l + h.shift(), i = p + h.shift(), s = r + h.shift(), a = i + h.shift(), l = s + h.shift(), p = a + h.shift(), o.curveTo(r, i, s, a, l, p);
             break;
           case 10:
-            Y = h.pop() + m, Z = g[Y], Z && M(Z);
+            Y = h.pop() + m, Z = d[Y], Z && M(Z);
             break;
           case 11:
             return;
@@ -10083,8 +10083,8 @@ var P1 = Fc((L) => {
       if (f === 0 || l === 0)
         throw new Error("Font is marked as a CID font, but FDArray and/or FDSelect information is missing");
       f += e;
-      var p = Et(n, f), g = to(n, e, p.objects, o.objects);
-      u._fdArray = g, l += e, u._fdSelect = ql(n, l, t.numGlyphs, g.length);
+      var p = Et(n, f), d = to(n, e, p.objects, o.objects);
+      u._fdArray = d, l += e, u._fdSelect = ql(n, l, t.numGlyphs, d.length);
     }
     var m = e + u.private[1], x = Ph(n, m, u.private[0], o.objects);
     if (t.defaultWidthX = x.defaultWidthX, t.nominalWidthX = x.nominalWidthX, x.subrs !== 0) {
@@ -10191,8 +10191,8 @@ var P1 = Fc((L) => {
       else if (h.type === "L")
         a = Math.round(h.x - r), o = Math.round(h.y - i), e.push({ name: "dx", type: "NUMBER", value: a }), e.push({ name: "dy", type: "NUMBER", value: o }), e.push({ name: "rlineto", type: "OP", value: 5 }), r = Math.round(h.x), i = Math.round(h.y);
       else if (h.type === "C") {
-        var f = Math.round(h.x1 - r), l = Math.round(h.y1 - i), p = Math.round(h.x2 - h.x1), g = Math.round(h.y2 - h.y1);
-        a = Math.round(h.x - h.x2), o = Math.round(h.y - h.y2), e.push({ name: "dx1", type: "NUMBER", value: f }), e.push({ name: "dy1", type: "NUMBER", value: l }), e.push({ name: "dx2", type: "NUMBER", value: p }), e.push({ name: "dy2", type: "NUMBER", value: g }), e.push({ name: "dx", type: "NUMBER", value: a }), e.push({ name: "dy", type: "NUMBER", value: o }), e.push({ name: "rrcurveto", type: "OP", value: 8 }), r = Math.round(h.x), i = Math.round(h.y);
+        var f = Math.round(h.x1 - r), l = Math.round(h.y1 - i), p = Math.round(h.x2 - h.x1), d = Math.round(h.y2 - h.y1);
+        a = Math.round(h.x - h.x2), o = Math.round(h.y - h.y2), e.push({ name: "dx1", type: "NUMBER", value: f }), e.push({ name: "dy1", type: "NUMBER", value: l }), e.push({ name: "dx2", type: "NUMBER", value: p }), e.push({ name: "dy2", type: "NUMBER", value: d }), e.push({ name: "dx", type: "NUMBER", value: a }), e.push({ name: "dy", type: "NUMBER", value: o }), e.push({ name: "rrcurveto", type: "OP", value: 8 }), r = Math.round(h.x), i = Math.round(h.y);
       }
     }
     return e.push({ name: "endchar", type: "OP", value: 14 }), e;
@@ -11093,10 +11093,10 @@ var P1 = Fc((L) => {
   }
   function xf(n, e, t) {
     for (var r = {}, i = new P.Parser(n, e), s = i.parseUShort(), a = i.parseUShort(), o = i.offset + i.parseUShort(), h = 0; h < a; h++) {
-      var c = i.parseUShort(), u = i.parseUShort(), f = i.parseUShort(), l = i.parseUShort(), p = Zh[l] || l, g = i.parseUShort(), m = i.parseUShort(), x = yf(c, f, t), v = jh(c, u, f);
+      var c = i.parseUShort(), u = i.parseUShort(), f = i.parseUShort(), l = i.parseUShort(), p = Zh[l] || l, d = i.parseUShort(), m = i.parseUShort(), x = yf(c, f, t), v = jh(c, u, f);
       if (v !== void 0 && x !== void 0) {
         var w = void 0;
-        if (v === Es ? w = wr.UTF16(n, o + m, g) : w = wr.MACSTRING(n, o + m, g, v), w) {
+        if (v === Es ? w = wr.UTF16(n, o + m, d) : w = wr.MACSTRING(n, o + m, d, v), w) {
           var b = r[p];
           b === void 0 && (b = r[p] = {}), b[x] = w;
         }
@@ -11152,9 +11152,9 @@ var P1 = Fc((L) => {
     for (var h = Vi(Jh), c = Vi($h), u = [], f = [], l = 0; l < r.length; l++) {
       t = r[l];
       var p = i[t];
-      for (var g in p) {
-        var m = p[g], x = 1, v = h[g], w = gf[v], b = jh(x, w, v), S = U.MACSTRING(m, b);
-        S === void 0 && (x = 0, v = e.indexOf(g), v < 0 && (v = e.length, e.push(g)), w = 4, S = U.UTF16(m));
+      for (var d in p) {
+        var m = p[d], x = 1, v = h[d], w = gf[v], b = jh(x, w, v), S = U.MACSTRING(m, b);
+        S === void 0 && (x = 0, v = e.indexOf(d), v < 0 && (v = e.length, e.push(d)), w = 4, S = U.UTF16(m));
         var T = ao(S, f);
         u.push(so(
           x,
@@ -11164,7 +11164,7 @@ var P1 = Fc((L) => {
           S.length,
           T
         ));
-        var B = c[g];
+        var B = c[d];
         if (B !== void 0) {
           var M = U.UTF16(m), _ = ao(M, f);
           u.push(so(
@@ -11869,10 +11869,10 @@ var P1 = Fc((L) => {
     return e / n.length;
   }
   function Lf(n) {
-    for (var e = [], t = [], r = [], i = [], s = [], a = [], o = [], h, c = 0, u = 0, f = 0, l = 0, p = 0, g = 0; g < n.glyphs.length; g += 1) {
-      var m = n.glyphs.get(g), x = m.unicode | 0;
+    for (var e = [], t = [], r = [], i = [], s = [], a = [], o = [], h, c = 0, u = 0, f = 0, l = 0, p = 0, d = 0; d < n.glyphs.length; d += 1) {
+      var m = n.glyphs.get(d), x = m.unicode | 0;
       if (isNaN(m.advanceWidth))
-        throw new Error("Glyph " + m.name + " (" + g + "): advanceWidth is not a number.");
+        throw new Error("Glyph " + m.name + " (" + d + "): advanceWidth is not a number.");
       (h > x || h === void 0) && x > 0 && (h = x), c < x && (c = x);
       var v = Ms.getUnicodeRange(x);
       if (v < 32)
@@ -12325,8 +12325,8 @@ var P1 = Fc((L) => {
     for (var r = [], i = this.getLookupTables(e, t, n, 4), s = 0; s < i.length; s++)
       for (var a = i[s].subtables, o = 0; o < a.length; o++)
         for (var h = a[o], c = this.expandCoverage(h.coverage), u = h.ligatureSets, f = 0; f < c.length; f++)
-          for (var l = c[f], p = u[f], g = 0; g < p.length; g++) {
-            var m = p[g];
+          for (var l = c[f], p = u[f], d = 0; d < p.length; d++) {
+            var m = p[d];
             r.push({
               sub: [l].concat(m.components),
               by: m.ligGlyph
@@ -12453,14 +12453,14 @@ var P1 = Fc((L) => {
           for (var f = r.parseByte(), l = 0; l < f; l += 1)
             i.push(s), u += 1;
       if (H.argument(i.length === c, "Bad flags."), a.length > 0) {
-        var p = [], g;
+        var p = [], d;
         if (c > 0) {
           for (var m = 0; m < c; m += 1)
-            s = i[m], g = {}, g.onCurve = !!(s & 1), g.lastPointOfContour = a.indexOf(m) >= 0, p.push(g);
+            s = i[m], d = {}, d.onCurve = !!(s & 1), d.lastPointOfContour = a.indexOf(m) >= 0, p.push(d);
           for (var x = 0, v = 0; v < c; v += 1)
-            s = i[v], g = p[v], g.x = fo(r, s, x, 2, 16), x = g.x;
+            s = i[v], d = p[v], d.x = fo(r, s, x, 2, 16), x = d.x;
           for (var w = 0, b = 0; b < c; b += 1)
-            s = i[b], g = p[b], g.y = fo(r, s, w, 4, 32), w = g.y;
+            s = i[b], d = p[b], d.y = fo(r, s, w, 4, 32), w = d.y;
         }
         n.points = p;
       } else
@@ -12841,12 +12841,12 @@ var P1 = Fc((L) => {
       for (var c = 0; c < i.length; c++) {
         var u = i[c], f = h.glyphs.get(u.glyphIndex);
         o = new Bt("glyf", f.instructions), L.DEBUG && (console.log("---EXEC COMP " + c + "---"), o.step = -1), _s(f, o, t, r);
-        for (var l = Math.round(u.dx * t), p = Math.round(u.dy * r), g = o.gZone, m = o.contours, x = 0; x < g.length; x++) {
-          var v = g[x];
+        for (var l = Math.round(u.dx * t), p = Math.round(u.dy * r), d = o.gZone, m = o.contours, x = 0; x < d.length; x++) {
+          var v = d[x];
           v.xTouched = v.yTouched = !1, v.xo = v.x = v.x + l, v.yo = v.y = v.y + p;
         }
         var w = a.length;
-        a.push.apply(a, g);
+        a.push.apply(a, d);
         for (var b = 0; b < m.length; b++)
           s.push(m[b] + w);
       }
@@ -12878,8 +12878,8 @@ var P1 = Fc((L) => {
         new vt(Math.round(n.advanceWidth * t), 0)
       ), Kt(e), a.length -= 2, L.DEBUG) {
         console.log("FINISHED GLYPH", e.stack);
-        for (var g = 0; g < s; g++)
-          console.log(g, a[g].x, a[g].y);
+        for (var d = 0; d < s; d++)
+          console.log(d, a[d].x, a[d].y);
       }
     }
   };
@@ -12963,8 +12963,8 @@ var P1 = Fc((L) => {
   function Qf(n) {
     var e = n.stack, t = e.pop(), r = e.pop(), i = e.pop(), s = e.pop(), a = e.pop(), o = n.z0, h = n.z1, c = o[t], u = o[r], f = h[i], l = h[s], p = n.z2[a];
     L.DEBUG && console.log("ISECT[], ", t, r, i, s, a);
-    var g = c.x, m = c.y, x = u.x, v = u.y, w = f.x, b = f.y, S = l.x, T = l.y, B = (g - x) * (b - T) - (m - v) * (w - S), M = g * v - m * x, _ = w * T - b * S;
-    p.x = (M * (w - S) - _ * (g - x)) / B, p.y = (M * (b - T) - _ * (m - v)) / B;
+    var d = c.x, m = c.y, x = u.x, v = u.y, w = f.x, b = f.y, S = l.x, T = l.y, B = (d - x) * (b - T) - (m - v) * (w - S), M = d * v - m * x, _ = w * T - b * S;
+    p.x = (M * (w - S) - _ * (d - x)) / B, p.y = (M * (b - T) - _ * (m - v)) / B;
   }
   function Kf(n) {
     n.rp0 = n.stack.pop(), L.DEBUG && console.log(n.step, "SRP0[]", n.rp0);
@@ -13317,10 +13317,10 @@ var P1 = Fc((L) => {
     for (var u = 0; u < r; u++) {
       var f = t.pop(), l = t.pop(), p = o + ((l & 240) >> 4);
       if (p === a) {
-        var g = (l & 15) - 8;
-        g >= 0 && g++, L.DEBUG && console.log(e.step, "DELTAPFIX", f, "by", g * h);
+        var d = (l & 15) - 8;
+        d >= 0 && d++, L.DEBUG && console.log(e.step, "DELTAPFIX", f, "by", d * h);
         var m = c[f];
-        i.setRelative(m, m, g * h, s);
+        i.setRelative(m, m, d * h, s);
       }
     }
   }
@@ -13524,8 +13524,8 @@ var P1 = Fc((L) => {
     e.ip = t;
   }
   function z(n, e, t, r, i, s) {
-    var a = s.stack, o = n && a.pop(), h = a.pop(), c = s.rp0, u = s.z0[c], f = s.z1[h], l = s.minDis, p = s.fv, g = s.dpv, m, x, v, w;
-    x = m = g.distance(f, u, !0, !0), v = x >= 0 ? 1 : -1, x = Math.abs(x), n && (w = s.cvt[o], r && Math.abs(x - w) < s.cvCutIn && (x = w)), t && x < l && (x = l), r && (x = s.round(x)), p.setRelative(f, u, v * x, g), p.touch(f), L.DEBUG && console.log(
+    var a = s.stack, o = n && a.pop(), h = a.pop(), c = s.rp0, u = s.z0[c], f = s.z1[h], l = s.minDis, p = s.fv, d = s.dpv, m, x, v, w;
+    x = m = d.distance(f, u, !0, !0), v = x >= 0 ? 1 : -1, x = Math.abs(x), n && (w = s.cvt[o], r && Math.abs(x - w) < s.cvCutIn && (x = w)), t && x < l && (x = l), r && (x = s.round(x)), p.setRelative(f, u, v * x, d), p.touch(f), L.DEBUG && console.log(
       s.step,
       (n ? "MIRP[" : "MDRP[") + (e ? "M" : "m") + (t ? ">" : "_") + (r ? "R" : "_") + (i === 0 ? "Gr" : i === 1 ? "Bl" : i === 2 ? "Wh" : "") + "]",
       n ? o + "(" + s.cvt[o] + "," + w + ")" : "",
@@ -14412,7 +14412,7 @@ var P1 = Fc((L) => {
     ), f = r.length === e.inputCoverage.length && o.length === e.lookaheadCoverage.length && u.length === e.backtrackCoverage.length, l = [];
     if (f)
       for (var p = 0; p < e.lookupRecords.length; p++)
-        for (var g = e.lookupRecords[p], m = g.lookupListIndex, x = this.getLookupByIndex(m), v = 0; v < x.subtables.length; v++) {
+        for (var d = e.lookupRecords[p], m = d.lookupListIndex, x = this.getLookupByIndex(m), v = 0; v < x.subtables.length; v++) {
           var w = x.subtables[v], b = this.getLookupMethod(x, w), S = this.getSubstitutionType(x, w);
           if (S === "12")
             for (var T = 0; T < r.length; T++) {
@@ -15253,8 +15253,8 @@ var P1 = Fc((L) => {
     r.skip("uShort", 1);
     for (var a = r.parseUShort(), o = r.parseUShort(), h = r.parseUShort(), c = r.parseUShort(), u = [], f = 0; f < a; f++)
       u.push(Zp(n, e + s + f * o, t));
-    for (var l = [], p = e + s + a * o, g = 0; g < h; g++)
-      l.push($p(n, p + g * c, u, t));
+    for (var l = [], p = e + s + a * o, d = 0; d < h; d++)
+      l.push($p(n, p + d * c, u, t));
     return { axes: u, instances: l };
   }
   var Kp = { make: jp, parse: Qp }, ed = function() {
@@ -15497,7 +15497,7 @@ var P1 = Fc((L) => {
       a = P.getUShort(s, 12), o = md(s, a);
     } else
       throw new Error("Unsupported OpenType signature " + h);
-    for (var u, f, l, p, g, m, x, v, w, b, S, T, B = 0; B < a; B += 1) {
+    for (var u, f, l, p, d, m, x, v, w, b, S, T, B = 0; B < a; B += 1) {
       var M = o[B], _ = void 0;
       switch (M.tag) {
         case "cmap":
@@ -15555,7 +15555,7 @@ var P1 = Fc((L) => {
           p = M;
           break;
         case "GPOS":
-          g = M;
+          d = M;
           break;
         case "GSUB":
           m = M;
@@ -15584,8 +15584,8 @@ var P1 = Fc((L) => {
       var ne = de(s, p);
       i.tables.gdef = ad.parse(ne.data, ne.offset);
     }
-    if (g) {
-      var ae = de(s, g);
+    if (d) {
+      var ae = de(s, d);
       i.tables.gpos = ud.parse(ae.data, ae.offset), i.position.init();
     }
     if (m) {
@@ -15640,8 +15640,8 @@ var P1 = Fc((L) => {
       const f = [];
       for (let l = 0; l < n.length; ++l) {
         const p = n[l].index;
-        for (let g = 0; g < p.count; ++g)
-          f.push(p.getX(g) + u);
+        for (let d = 0; d < p.count; ++d)
+          f.push(p.getX(d) + u);
         u += n[l].attributes.position.count;
       }
       h.setIndex(f);
@@ -15660,10 +15660,10 @@ var P1 = Fc((L) => {
         const p = [];
         for (let m = 0; m < a[u].length; ++m)
           p.push(a[u][m][l]);
-        const g = Ro(p);
-        if (!g)
+        const d = Ro(p);
+        if (!d)
           return console.error("THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the " + u + " morphAttribute."), null;
-        h.morphAttributes[u].push(g);
+        h.morphAttributes[u].push(d);
       }
     }
     return h;
@@ -15689,9 +15689,9 @@ var P1 = Fc((L) => {
       if (u.isInterleavedBufferAttribute) {
         const f = h / t;
         for (let l = 0, p = u.count; l < p; l++)
-          for (let g = 0; g < t; g++) {
-            const m = u.getComponent(l, g);
-            o.setComponent(l + f, g, m);
+          for (let d = 0; d < t; d++) {
+            const m = u.getComponent(l, d);
+            o.setComponent(l + f, d, m);
           }
       } else
         a.set(u.array, h);
@@ -15717,7 +15717,7 @@ var P1 = Fc((L) => {
         c[S][_] = new M.constructor(D, M.itemSize, M.normalized);
       }));
     }
-    const p = e * 0.5, g = Math.log10(1 / e), m = Math.pow(10, g), x = p * m;
+    const p = e * 0.5, d = Math.log10(1 / e), m = Math.pow(10, d), x = p * m;
     for (let w = 0; w < s; w++) {
       const b = r ? r.getX(w) : w;
       let S = "";
@@ -15826,7 +15826,7 @@ var P1 = Fc((L) => {
       return;
     }
     const a = new yh();
-    let o, h, c, u, f, l, p, g;
+    let o, h, c, u, f, l, p, d;
     if (s.o) {
       const m = s._cachedOutline || (s._cachedOutline = s.o.split(" "));
       for (let x = 0, v = m.length; x < v; )
@@ -15841,7 +15841,7 @@ var P1 = Fc((L) => {
             c = m[x++] * e + t, u = m[x++] * e + r, f = m[x++] * e + t, l = m[x++] * e + r, a.quadraticCurveTo(f, l, c, u);
             break;
           case "b":
-            c = m[x++] * e + t, u = m[x++] * e + r, f = m[x++] * e + t, l = m[x++] * e + r, p = m[x++] * e + t, g = m[x++] * e + r, a.bezierCurveTo(f, l, p, g, c, u);
+            c = m[x++] * e + t, u = m[x++] * e + r, f = m[x++] * e + t, l = m[x++] * e + r, p = m[x++] * e + t, d = m[x++] * e + r, a.bezierCurveTo(f, l, p, d, c, u);
             break;
         }
     }
@@ -15923,7 +15923,7 @@ var P1 = Fc((L) => {
       let h = 0;
       for (; h < o.length; ) {
         const c = o[h++];
-        let u, f, l, p, g, m, x, v;
+        let u, f, l, p, d, m, x, v;
         switch (c) {
           case "m":
             u = parseFloat(o[h++]) * e + t, f = parseFloat(o[h++]) * e + r, a.moveTo(u, f);
@@ -15932,10 +15932,10 @@ var P1 = Fc((L) => {
             u = parseFloat(o[h++]) * e + t, f = parseFloat(o[h++]) * e + r, a.lineTo(u, f);
             break;
           case "q":
-            l = parseFloat(o[h++]) * e + t, p = parseFloat(o[h++]) * e + r, g = parseFloat(o[h++]) * e + t, m = parseFloat(o[h++]) * e + r, a.quadraticCurveTo(g, m, l, p);
+            l = parseFloat(o[h++]) * e + t, p = parseFloat(o[h++]) * e + r, d = parseFloat(o[h++]) * e + t, m = parseFloat(o[h++]) * e + r, a.quadraticCurveTo(d, m, l, p);
             break;
           case "b":
-            l = parseFloat(o[h++]) * e + t, p = parseFloat(o[h++]) * e + r, g = parseFloat(o[h++]) * e + t, m = parseFloat(o[h++]) * e + r, x = parseFloat(o[h++]) * e + t, v = parseFloat(o[h++]) * e + r, a.bezierCurveTo(g, m, x, v, l, p);
+            l = parseFloat(o[h++]) * e + t, p = parseFloat(o[h++]) * e + r, d = parseFloat(o[h++]) * e + t, m = parseFloat(o[h++]) * e + r, x = parseFloat(o[h++]) * e + t, v = parseFloat(o[h++]) * e + r, a.bezierCurveTo(d, m, x, v, l, p);
             break;
         }
       }
@@ -16024,23 +16024,23 @@ var P1 = Fc((L) => {
     if (!t || t.length === 0) return [];
     const r = t.map((p) => p.getPoints(e)), i = Ed(r), s = Ad(i), a = Md(i), o = t.length, h = Array(o).fill(-1), c = Array(o).fill(-1);
     for (const p of a) {
-      const g = [{ idx: p, d: 0 }];
-      for (; g.length; ) {
-        const m = g.pop();
+      const d = [{ idx: p, d: 0 }];
+      for (; d.length; ) {
+        const m = d.pop();
         h[m.idx] = m.d, c[m.idx] = p;
-        for (const x of s[m.idx]) g.push({ idx: x, d: m.d + 1 });
+        for (const x of s[m.idx]) d.push({ idx: x, d: m.d + 1 });
       }
     }
     const u = [], f = /* @__PURE__ */ new Set();
     function l(p) {
-      const g = Do(t[p], !0);
+      const d = Do(t[p], !0);
       f.add(p);
       for (const m of s[p])
         if (!f.has(m) && h[m] === h[p] + 1) {
           const x = Do(t[m], !1);
-          g.holes.push(x), f.add(m);
+          d.holes.push(x), f.add(m);
         }
-      u.push(g);
+      u.push(d);
     }
     for (const p of a) l(p);
     for (let p = 0; p < o; p++)
@@ -16844,14 +16844,14 @@ var P1 = Fc((L) => {
       const { strokeWidth: t = "0.5%", strokeColor: r = "black", isAutoFit: i = !1 } = e;
       let s, a;
       if (i) {
-        const o = this.bbox, h = 0.2, c = o.maxX - o.minX, u = o.maxY - o.minY, f = c === 0 ? u : c, l = u === 0 ? c : u, p = o.minX - f * h, g = o.maxX + f * h, m = o.minY - l * h, x = o.maxY + l * h;
+        const o = this.bbox, h = 0.2, c = o.maxX - o.minX, u = o.maxY - o.minY, f = c === 0 ? u : c, l = u === 0 ? c : u, p = o.minX - f * h, d = o.maxX + f * h, m = o.minY - l * h, x = o.maxY + l * h;
         a = this.polylines.map((v) => {
           let w = "";
           return v.forEach((b, S) => {
             const T = b.x, B = -b.y;
             w += S === 0 ? `M ${T} ${B} ` : `L ${T} ${B} `;
           }), `<path d="${w}" stroke="${r}" stroke-width="${t}" fill="none"/>`;
-        }).join(""), s = `${p} ${-x} ${g - p} ${x - m}`;
+        }).join(""), s = `${p} ${-x} ${d - p} ${x - m}`;
       } else
         s = "0 0 20 20", a = this.polylines.map((o) => {
           let h = "";
@@ -16939,8 +16939,8 @@ var P1 = Fc((L) => {
       u && (u.x *= c, u.y *= h);
       const f = e.polylines.map(
         (l) => l.map((p) => {
-          const g = p.clone();
-          return g.x *= c, g.y *= h, g;
+          const d = p.clone();
+          return d.x *= c, d.y *= h, d;
         })
       );
       return new Gr(u, f);
@@ -17129,8 +17129,8 @@ var P1 = Fc((L) => {
       let c = o & 7;
       const u = o < 0, f = Math.PI / 4 * h, l = r.currentPoint.clone().subtract(new fe(Math.cos(f) * a, Math.sin(f) * a)), p = jr.fromOctant(l, a, h, c, u);
       if (r.isPenDown) {
-        const g = p.tessellate();
-        r.currentPolyline.pop(), r.currentPolyline.push(...g.slice());
+        const d = p.tessellate();
+        r.currentPolyline.pop(), r.currentPolyline.push(...d.slice());
       }
       return r.currentPoint = (i = p.tessellate().pop()) == null ? void 0 : i.clone(), s;
     }
@@ -17140,9 +17140,9 @@ var P1 = Fc((L) => {
       let l = u & 7;
       l === 0 && (l = 8), a !== 0 && l--;
       const p = Math.PI / 4;
-      let g = p * l, m = Nd, x = 1;
-      u < 0 && (m = -m, g = -g, x = -1);
-      let v = p * f, w = v + g;
+      let d = p * l, m = Nd, x = 1;
+      u < 0 && (m = -m, d = -d, x = -1);
+      let v = p * f, w = v + d;
       v += p * s / 256 * x, w += p * a / 256 * x;
       const b = r.currentPoint.clone().subtract(new fe(c * Math.cos(v), c * Math.sin(v)));
       if (r.currentPoint = b.clone().add(new fe(c * Math.cos(w), c * Math.sin(w))), r.isPenDown) {
@@ -17420,12 +17420,12 @@ var P1 = Fc((L) => {
     return (p ? -1 : 1) * a * Math.pow(2, s - r);
   };
   qs.write = function(n, e, t, r, i, s) {
-    var a, o, h, c = s * 8 - i - 1, u = (1 << c) - 1, f = u >> 1, l = i === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, p = r ? 0 : s - 1, g = r ? 1 : -1, m = e < 0 || e === 0 && 1 / e < 0 ? 1 : 0;
-    for (e = Math.abs(e), isNaN(e) || e === 1 / 0 ? (o = isNaN(e) ? 1 : 0, a = u) : (a = Math.floor(Math.log(e) / Math.LN2), e * (h = Math.pow(2, -a)) < 1 && (a--, h *= 2), a + f >= 1 ? e += l / h : e += l * Math.pow(2, 1 - f), e * h >= 2 && (a++, h /= 2), a + f >= u ? (o = 0, a = u) : a + f >= 1 ? (o = (e * h - 1) * Math.pow(2, i), a = a + f) : (o = e * Math.pow(2, f - 1) * Math.pow(2, i), a = 0)); i >= 8; n[t + p] = o & 255, p += g, o /= 256, i -= 8)
+    var a, o, h, c = s * 8 - i - 1, u = (1 << c) - 1, f = u >> 1, l = i === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, p = r ? 0 : s - 1, d = r ? 1 : -1, m = e < 0 || e === 0 && 1 / e < 0 ? 1 : 0;
+    for (e = Math.abs(e), isNaN(e) || e === 1 / 0 ? (o = isNaN(e) ? 1 : 0, a = u) : (a = Math.floor(Math.log(e) / Math.LN2), e * (h = Math.pow(2, -a)) < 1 && (a--, h *= 2), a + f >= 1 ? e += l / h : e += l * Math.pow(2, 1 - f), e * h >= 2 && (a++, h /= 2), a + f >= u ? (o = 0, a = u) : a + f >= 1 ? (o = (e * h - 1) * Math.pow(2, i), a = a + f) : (o = e * Math.pow(2, f - 1) * Math.pow(2, i), a = 0)); i >= 8; n[t + p] = o & 255, p += d, o /= 256, i -= 8)
       ;
-    for (a = a << i | o, c += i; c > 0; n[t + p] = a & 255, p += g, a /= 256, c -= 8)
+    for (a = a << i | o, c += i; c > 0; n[t + p] = a & 255, p += d, a /= 256, c -= 8)
       ;
-    n[t + p - g] |= m * 128;
+    n[t + p - d] |= m * 128;
   };
   /*!
    * The buffer module from node.js, for the browser.
@@ -17442,10 +17442,10 @@ var P1 = Fc((L) => {
     );
     function s() {
       try {
-        var F = new Uint8Array(1), d = { foo: function() {
+        var F = new Uint8Array(1), g = { foo: function() {
           return 42;
         } };
-        return Object.setPrototypeOf(d, Uint8Array.prototype), Object.setPrototypeOf(F, d), F.foo() === 42;
+        return Object.setPrototypeOf(g, Uint8Array.prototype), Object.setPrototypeOf(F, g), F.foo() === 42;
       } catch {
         return !1;
       }
@@ -17466,52 +17466,52 @@ var P1 = Fc((L) => {
     function a(F) {
       if (F > i)
         throw new RangeError('The value "' + F + '" is invalid for option "size"');
-      var d = new Uint8Array(F);
-      return Object.setPrototypeOf(d, o.prototype), d;
+      var g = new Uint8Array(F);
+      return Object.setPrototypeOf(g, o.prototype), g;
     }
-    function o(F, d, y) {
+    function o(F, g, y) {
       if (typeof F == "number") {
-        if (typeof d == "string")
+        if (typeof g == "string")
           throw new TypeError(
             'The "string" argument must be of type string. Received type number'
           );
         return f(F);
       }
-      return h(F, d, y);
+      return h(F, g, y);
     }
     o.poolSize = 8192;
-    function h(F, d, y) {
+    function h(F, g, y) {
       if (typeof F == "string")
-        return l(F, d);
+        return l(F, g);
       if (ArrayBuffer.isView(F))
-        return g(F);
+        return d(F);
       if (F == null)
         throw new TypeError(
           "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof F
         );
       if (Ke(F, ArrayBuffer) || F && Ke(F.buffer, ArrayBuffer) || typeof SharedArrayBuffer < "u" && (Ke(F, SharedArrayBuffer) || F && Ke(F.buffer, SharedArrayBuffer)))
-        return m(F, d, y);
+        return m(F, g, y);
       if (typeof F == "number")
         throw new TypeError(
           'The "value" argument must not be of type number. Received type number'
         );
       var C = F.valueOf && F.valueOf();
       if (C != null && C !== F)
-        return o.from(C, d, y);
+        return o.from(C, g, y);
       var k = x(F);
       if (k) return k;
       if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof F[Symbol.toPrimitive] == "function")
         return o.from(
           F[Symbol.toPrimitive]("string"),
-          d,
+          g,
           y
         );
       throw new TypeError(
         "The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof F
       );
     }
-    o.from = function(F, d, y) {
-      return h(F, d, y);
+    o.from = function(F, g, y) {
+      return h(F, g, y);
     }, Object.setPrototypeOf(o.prototype, Uint8Array.prototype), Object.setPrototypeOf(o, Uint8Array);
     function c(F) {
       if (typeof F != "number")
@@ -17519,11 +17519,11 @@ var P1 = Fc((L) => {
       if (F < 0)
         throw new RangeError('The value "' + F + '" is invalid for option "size"');
     }
-    function u(F, d, y) {
-      return c(F), F <= 0 ? a(F) : d !== void 0 ? typeof y == "string" ? a(F).fill(d, y) : a(F).fill(d) : a(F);
+    function u(F, g, y) {
+      return c(F), F <= 0 ? a(F) : g !== void 0 ? typeof y == "string" ? a(F).fill(g, y) : a(F).fill(g) : a(F);
     }
-    o.alloc = function(F, d, y) {
-      return u(F, d, y);
+    o.alloc = function(F, g, y) {
+      return u(F, g, y);
     };
     function f(F) {
       return c(F), a(F < 0 ? 0 : v(F) | 0);
@@ -17533,36 +17533,36 @@ var P1 = Fc((L) => {
     }, o.allocUnsafeSlow = function(F) {
       return f(F);
     };
-    function l(F, d) {
-      if ((typeof d != "string" || d === "") && (d = "utf8"), !o.isEncoding(d))
-        throw new TypeError("Unknown encoding: " + d);
-      var y = b(F, d) | 0, C = a(y), k = C.write(F, d);
+    function l(F, g) {
+      if ((typeof g != "string" || g === "") && (g = "utf8"), !o.isEncoding(g))
+        throw new TypeError("Unknown encoding: " + g);
+      var y = b(F, g) | 0, C = a(y), k = C.write(F, g);
       return k !== y && (C = C.slice(0, k)), C;
     }
     function p(F) {
-      for (var d = F.length < 0 ? 0 : v(F.length) | 0, y = a(d), C = 0; C < d; C += 1)
+      for (var g = F.length < 0 ? 0 : v(F.length) | 0, y = a(g), C = 0; C < g; C += 1)
         y[C] = F[C] & 255;
       return y;
     }
-    function g(F) {
+    function d(F) {
       if (Ke(F, Uint8Array)) {
-        var d = new Uint8Array(F);
-        return m(d.buffer, d.byteOffset, d.byteLength);
+        var g = new Uint8Array(F);
+        return m(g.buffer, g.byteOffset, g.byteLength);
       }
       return p(F);
     }
-    function m(F, d, y) {
-      if (d < 0 || F.byteLength < d)
+    function m(F, g, y) {
+      if (g < 0 || F.byteLength < g)
         throw new RangeError('"offset" is outside of buffer bounds');
-      if (F.byteLength < d + (y || 0))
+      if (F.byteLength < g + (y || 0))
         throw new RangeError('"length" is outside of buffer bounds');
       var C;
-      return d === void 0 && y === void 0 ? C = new Uint8Array(F) : y === void 0 ? C = new Uint8Array(F, d) : C = new Uint8Array(F, d, y), Object.setPrototypeOf(C, o.prototype), C;
+      return g === void 0 && y === void 0 ? C = new Uint8Array(F) : y === void 0 ? C = new Uint8Array(F, g) : C = new Uint8Array(F, g, y), Object.setPrototypeOf(C, o.prototype), C;
     }
     function x(F) {
       if (o.isBuffer(F)) {
-        var d = v(F.length) | 0, y = a(d);
-        return y.length === 0 || F.copy(y, 0, 0, d), y;
+        var g = v(F.length) | 0, y = a(g);
+        return y.length === 0 || F.copy(y, 0, 0, g), y;
       }
       if (F.length !== void 0)
         return typeof F.length != "number" || fi(F.length) ? a(0) : p(F);
@@ -17577,22 +17577,22 @@ var P1 = Fc((L) => {
     function w(F) {
       return +F != F && (F = 0), o.alloc(+F);
     }
-    o.isBuffer = function(d) {
-      return d != null && d._isBuffer === !0 && d !== o.prototype;
-    }, o.compare = function(d, y) {
-      if (Ke(d, Uint8Array) && (d = o.from(d, d.offset, d.byteLength)), Ke(y, Uint8Array) && (y = o.from(y, y.offset, y.byteLength)), !o.isBuffer(d) || !o.isBuffer(y))
+    o.isBuffer = function(g) {
+      return g != null && g._isBuffer === !0 && g !== o.prototype;
+    }, o.compare = function(g, y) {
+      if (Ke(g, Uint8Array) && (g = o.from(g, g.offset, g.byteLength)), Ke(y, Uint8Array) && (y = o.from(y, y.offset, y.byteLength)), !o.isBuffer(g) || !o.isBuffer(y))
         throw new TypeError(
           'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
         );
-      if (d === y) return 0;
-      for (var C = d.length, k = y.length, O = 0, R = Math.min(C, k); O < R; ++O)
-        if (d[O] !== y[O]) {
-          C = d[O], k = y[O];
+      if (g === y) return 0;
+      for (var C = g.length, k = y.length, O = 0, R = Math.min(C, k); O < R; ++O)
+        if (g[O] !== y[O]) {
+          C = g[O], k = y[O];
           break;
         }
       return C < k ? -1 : k < C ? 1 : 0;
-    }, o.isEncoding = function(d) {
-      switch (String(d).toLowerCase()) {
+    }, o.isEncoding = function(g) {
+      switch (String(g).toLowerCase()) {
         case "hex":
         case "utf8":
         case "utf-8":
@@ -17608,18 +17608,18 @@ var P1 = Fc((L) => {
         default:
           return !1;
       }
-    }, o.concat = function(d, y) {
-      if (!Array.isArray(d))
+    }, o.concat = function(g, y) {
+      if (!Array.isArray(g))
         throw new TypeError('"list" argument must be an Array of Buffers');
-      if (d.length === 0)
+      if (g.length === 0)
         return o.alloc(0);
       var C;
       if (y === void 0)
-        for (y = 0, C = 0; C < d.length; ++C)
-          y += d[C].length;
+        for (y = 0, C = 0; C < g.length; ++C)
+          y += g[C].length;
       var k = o.allocUnsafe(y), O = 0;
-      for (C = 0; C < d.length; ++C) {
-        var R = d[C];
+      for (C = 0; C < g.length; ++C) {
+        var R = g[C];
         if (Ke(R, Uint8Array))
           O + R.length > k.length ? o.from(R).copy(k, O) : Uint8Array.prototype.set.call(
             k,
@@ -17634,7 +17634,7 @@ var P1 = Fc((L) => {
       }
       return k;
     };
-    function b(F, d) {
+    function b(F, g) {
       if (o.isBuffer(F))
         return F.length;
       if (ArrayBuffer.isView(F) || Ke(F, ArrayBuffer))
@@ -17646,7 +17646,7 @@ var P1 = Fc((L) => {
       var y = F.length, C = arguments.length > 2 && arguments[2] === !0;
       if (!C && y === 0) return 0;
       for (var k = !1; ; )
-        switch (d) {
+        switch (g) {
           case "ascii":
           case "latin1":
           case "binary":
@@ -17666,79 +17666,79 @@ var P1 = Fc((L) => {
           default:
             if (k)
               return C ? -1 : xt(F).length;
-            d = ("" + d).toLowerCase(), k = !0;
+            g = ("" + g).toLowerCase(), k = !0;
         }
     }
     o.byteLength = b;
-    function S(F, d, y) {
+    function S(F, g, y) {
       var C = !1;
-      if ((d === void 0 || d < 0) && (d = 0), d > this.length || ((y === void 0 || y > this.length) && (y = this.length), y <= 0) || (y >>>= 0, d >>>= 0, y <= d))
+      if ((g === void 0 || g < 0) && (g = 0), g > this.length || ((y === void 0 || y > this.length) && (y = this.length), y <= 0) || (y >>>= 0, g >>>= 0, y <= g))
         return "";
       for (F || (F = "utf8"); ; )
         switch (F) {
           case "hex":
-            return ie(this, d, y);
+            return ie(this, g, y);
           case "utf8":
           case "utf-8":
-            return Z(this, d, y);
+            return Z(this, g, y);
           case "ascii":
-            return ne(this, d, y);
+            return ne(this, g, y);
           case "latin1":
           case "binary":
-            return ae(this, d, y);
+            return ae(this, g, y);
           case "base64":
-            return Y(this, d, y);
+            return Y(this, g, y);
           case "ucs2":
           case "ucs-2":
           case "utf16le":
           case "utf-16le":
-            return he(this, d, y);
+            return he(this, g, y);
           default:
             if (C) throw new TypeError("Unknown encoding: " + F);
             F = (F + "").toLowerCase(), C = !0;
         }
     }
     o.prototype._isBuffer = !0;
-    function T(F, d, y) {
-      var C = F[d];
-      F[d] = F[y], F[y] = C;
+    function T(F, g, y) {
+      var C = F[g];
+      F[g] = F[y], F[y] = C;
     }
     o.prototype.swap16 = function() {
-      var d = this.length;
-      if (d % 2 !== 0)
+      var g = this.length;
+      if (g % 2 !== 0)
         throw new RangeError("Buffer size must be a multiple of 16-bits");
-      for (var y = 0; y < d; y += 2)
+      for (var y = 0; y < g; y += 2)
         T(this, y, y + 1);
       return this;
     }, o.prototype.swap32 = function() {
-      var d = this.length;
-      if (d % 4 !== 0)
+      var g = this.length;
+      if (g % 4 !== 0)
         throw new RangeError("Buffer size must be a multiple of 32-bits");
-      for (var y = 0; y < d; y += 4)
+      for (var y = 0; y < g; y += 4)
         T(this, y, y + 3), T(this, y + 1, y + 2);
       return this;
     }, o.prototype.swap64 = function() {
-      var d = this.length;
-      if (d % 8 !== 0)
+      var g = this.length;
+      if (g % 8 !== 0)
         throw new RangeError("Buffer size must be a multiple of 64-bits");
-      for (var y = 0; y < d; y += 8)
+      for (var y = 0; y < g; y += 8)
         T(this, y, y + 7), T(this, y + 1, y + 6), T(this, y + 2, y + 5), T(this, y + 3, y + 4);
       return this;
     }, o.prototype.toString = function() {
-      var d = this.length;
-      return d === 0 ? "" : arguments.length === 0 ? Z(this, 0, d) : S.apply(this, arguments);
-    }, o.prototype.toLocaleString = o.prototype.toString, o.prototype.equals = function(d) {
-      if (!o.isBuffer(d)) throw new TypeError("Argument must be a Buffer");
-      return this === d ? !0 : o.compare(this, d) === 0;
+      var g = this.length;
+      return g === 0 ? "" : arguments.length === 0 ? Z(this, 0, g) : S.apply(this, arguments);
+    }, o.prototype.toLocaleString = o.prototype.toString, o.prototype.equals = function(g) {
+      if (!o.isBuffer(g)) throw new TypeError("Argument must be a Buffer");
+      return this === g ? !0 : o.compare(this, g) === 0;
     }, o.prototype.inspect = function() {
-      var d = "", y = n.INSPECT_MAX_BYTES;
-      return d = this.toString("hex", 0, y).replace(/(.{2})/g, "$1 ").trim(), this.length > y && (d += " ... "), "<Buffer " + d + ">";
-    }, r && (o.prototype[r] = o.prototype.inspect), o.prototype.compare = function(d, y, C, k, O) {
-      if (Ke(d, Uint8Array) && (d = o.from(d, d.offset, d.byteLength)), !o.isBuffer(d))
+      var g = "", y = n.INSPECT_MAX_BYTES;
+      return g = this.toString("hex", 0, y).replace(/(.{2})/g, "$1 ").trim(), this.length > y && (g += " ... "), "<Buffer " + g + ">";
+    }, r && (o.prototype[r] = o.prototype.inspect), o.prototype.compare = function(g, y, C, k, O) {
+      if (Ke(g, Uint8Array) && (g = o.from(g, g.offset, g.byteLength)), !o.isBuffer(g))
         throw new TypeError(
-          'The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof d
+          'The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof g
         );
-      if (y === void 0 && (y = 0), C === void 0 && (C = d ? d.length : 0), k === void 0 && (k = 0), O === void 0 && (O = this.length), y < 0 || C > d.length || k < 0 || O > this.length)
+      if (y === void 0 && (y = 0), C === void 0 && (C = g ? g.length : 0), k === void 0 && (k = 0), O === void 0 && (O = this.length), y < 0 || C > g.length || k < 0 || O > this.length)
         throw new RangeError("out of range index");
       if (k >= O && y >= C)
         return 0;
@@ -17746,15 +17746,15 @@ var P1 = Fc((L) => {
         return -1;
       if (y >= C)
         return 1;
-      if (y >>>= 0, C >>>= 0, k >>>= 0, O >>>= 0, this === d) return 0;
-      for (var R = O - k, J = C - y, te = Math.min(R, J), oe = this.slice(k, O), be = d.slice(y, C), le = 0; le < te; ++le)
+      if (y >>>= 0, C >>>= 0, k >>>= 0, O >>>= 0, this === g) return 0;
+      for (var R = O - k, J = C - y, te = Math.min(R, J), oe = this.slice(k, O), be = g.slice(y, C), le = 0; le < te; ++le)
         if (oe[le] !== be[le]) {
           R = oe[le], J = be[le];
           break;
         }
       return R < J ? -1 : J < R ? 1 : 0;
     };
-    function B(F, d, y, C, k) {
+    function B(F, g, y, C, k) {
       if (F.length === 0) return -1;
       if (typeof y == "string" ? (C = y, y = 0) : y > 2147483647 ? y = 2147483647 : y < -2147483648 && (y = -2147483648), y = +y, fi(y) && (y = k ? 0 : F.length - 1), y < 0 && (y = F.length + y), y >= F.length) {
         if (k) return -1;
@@ -17762,16 +17762,16 @@ var P1 = Fc((L) => {
       } else if (y < 0)
         if (k) y = 0;
         else return -1;
-      if (typeof d == "string" && (d = o.from(d, C)), o.isBuffer(d))
-        return d.length === 0 ? -1 : M(F, d, y, C, k);
-      if (typeof d == "number")
-        return d = d & 255, typeof Uint8Array.prototype.indexOf == "function" ? k ? Uint8Array.prototype.indexOf.call(F, d, y) : Uint8Array.prototype.lastIndexOf.call(F, d, y) : M(F, [d], y, C, k);
+      if (typeof g == "string" && (g = o.from(g, C)), o.isBuffer(g))
+        return g.length === 0 ? -1 : M(F, g, y, C, k);
+      if (typeof g == "number")
+        return g = g & 255, typeof Uint8Array.prototype.indexOf == "function" ? k ? Uint8Array.prototype.indexOf.call(F, g, y) : Uint8Array.prototype.lastIndexOf.call(F, g, y) : M(F, [g], y, C, k);
       throw new TypeError("val must be string, number or Buffer");
     }
-    function M(F, d, y, C, k) {
-      var O = 1, R = F.length, J = d.length;
+    function M(F, g, y, C, k) {
+      var O = 1, R = F.length, J = g.length;
       if (C !== void 0 && (C = String(C).toLowerCase(), C === "ucs2" || C === "ucs-2" || C === "utf16le" || C === "utf-16le")) {
-        if (F.length < 2 || d.length < 2)
+        if (F.length < 2 || g.length < 2)
           return -1;
         O = 2, R /= 2, J /= 2, y /= 2;
       }
@@ -17782,14 +17782,14 @@ var P1 = Fc((L) => {
       if (k) {
         var be = -1;
         for (oe = y; oe < R; oe++)
-          if (te(F, oe) === te(d, be === -1 ? 0 : oe - be)) {
+          if (te(F, oe) === te(g, be === -1 ? 0 : oe - be)) {
             if (be === -1 && (be = oe), oe - be + 1 === J) return be * O;
           } else
             be !== -1 && (oe -= oe - be), be = -1;
       } else
         for (y + J > R && (y = R - J), oe = y; oe >= 0; oe--) {
           for (var le = !0, ln = 0; ln < J; ln++)
-            if (te(F, oe + ln) !== te(d, ln)) {
+            if (te(F, oe + ln) !== te(g, ln)) {
               le = !1;
               break;
             }
@@ -17797,39 +17797,39 @@ var P1 = Fc((L) => {
         }
       return -1;
     }
-    o.prototype.includes = function(d, y, C) {
-      return this.indexOf(d, y, C) !== -1;
-    }, o.prototype.indexOf = function(d, y, C) {
-      return B(this, d, y, C, !0);
-    }, o.prototype.lastIndexOf = function(d, y, C) {
-      return B(this, d, y, C, !1);
+    o.prototype.includes = function(g, y, C) {
+      return this.indexOf(g, y, C) !== -1;
+    }, o.prototype.indexOf = function(g, y, C) {
+      return B(this, g, y, C, !0);
+    }, o.prototype.lastIndexOf = function(g, y, C) {
+      return B(this, g, y, C, !1);
     };
-    function _(F, d, y, C) {
+    function _(F, g, y, C) {
       y = Number(y) || 0;
       var k = F.length - y;
       C ? (C = Number(C), C > k && (C = k)) : C = k;
-      var O = d.length;
+      var O = g.length;
       C > O / 2 && (C = O / 2);
       for (var R = 0; R < C; ++R) {
-        var J = parseInt(d.substr(R * 2, 2), 16);
+        var J = parseInt(g.substr(R * 2, 2), 16);
         if (fi(J)) return R;
         F[y + R] = J;
       }
       return R;
     }
-    function D(F, d, y, C) {
-      return un(xt(d, F.length - y), F, y, C);
+    function D(F, g, y, C) {
+      return un(xt(g, F.length - y), F, y, C);
     }
-    function N(F, d, y, C) {
-      return un(bc(d), F, y, C);
+    function N(F, g, y, C) {
+      return un(bc(g), F, y, C);
     }
-    function G(F, d, y, C) {
-      return un(Qs(d), F, y, C);
+    function G(F, g, y, C) {
+      return un(Qs(g), F, y, C);
     }
-    function ee(F, d, y, C) {
-      return un(wc(d, F.length - y), F, y, C);
+    function ee(F, g, y, C) {
+      return un(wc(g, F.length - y), F, y, C);
     }
-    o.prototype.write = function(d, y, C, k) {
+    o.prototype.write = function(g, y, C, k) {
       if (y === void 0)
         k = "utf8", C = this.length, y = 0;
       else if (C === void 0 && typeof y == "string")
@@ -17841,27 +17841,27 @@ var P1 = Fc((L) => {
           "Buffer.write(string, encoding, offset[, length]) is no longer supported"
         );
       var O = this.length - y;
-      if ((C === void 0 || C > O) && (C = O), d.length > 0 && (C < 0 || y < 0) || y > this.length)
+      if ((C === void 0 || C > O) && (C = O), g.length > 0 && (C < 0 || y < 0) || y > this.length)
         throw new RangeError("Attempt to write outside buffer bounds");
       k || (k = "utf8");
       for (var R = !1; ; )
         switch (k) {
           case "hex":
-            return _(this, d, y, C);
+            return _(this, g, y, C);
           case "utf8":
           case "utf-8":
-            return D(this, d, y, C);
+            return D(this, g, y, C);
           case "ascii":
           case "latin1":
           case "binary":
-            return N(this, d, y, C);
+            return N(this, g, y, C);
           case "base64":
-            return G(this, d, y, C);
+            return G(this, g, y, C);
           case "ucs2":
           case "ucs-2":
           case "utf16le":
           case "utf-16le":
-            return ee(this, d, y, C);
+            return ee(this, g, y, C);
           default:
             if (R) throw new TypeError("Unknown encoding: " + k);
             k = ("" + k).toLowerCase(), R = !0;
@@ -17872,12 +17872,12 @@ var P1 = Fc((L) => {
         data: Array.prototype.slice.call(this._arr || this, 0)
       };
     };
-    function Y(F, d, y) {
-      return d === 0 && y === F.length ? e.fromByteArray(F) : e.fromByteArray(F.slice(d, y));
+    function Y(F, g, y) {
+      return g === 0 && y === F.length ? e.fromByteArray(F) : e.fromByteArray(F.slice(g, y));
     }
-    function Z(F, d, y) {
+    function Z(F, g, y) {
       y = Math.min(F.length, y);
-      for (var C = [], k = d; k < y; ) {
+      for (var C = [], k = g; k < y; ) {
         var O = F[k], R = null, J = O > 239 ? 4 : O > 223 ? 3 : O > 191 ? 2 : 1;
         if (k + J <= y) {
           var te, oe, be, le;
@@ -17901,224 +17901,224 @@ var P1 = Fc((L) => {
     }
     var Q = 4096;
     function K(F) {
-      var d = F.length;
-      if (d <= Q)
+      var g = F.length;
+      if (g <= Q)
         return String.fromCharCode.apply(String, F);
-      for (var y = "", C = 0; C < d; )
+      for (var y = "", C = 0; C < g; )
         y += String.fromCharCode.apply(
           String,
           F.slice(C, C += Q)
         );
       return y;
     }
-    function ne(F, d, y) {
+    function ne(F, g, y) {
       var C = "";
       y = Math.min(F.length, y);
-      for (var k = d; k < y; ++k)
+      for (var k = g; k < y; ++k)
         C += String.fromCharCode(F[k] & 127);
       return C;
     }
-    function ae(F, d, y) {
+    function ae(F, g, y) {
       var C = "";
       y = Math.min(F.length, y);
-      for (var k = d; k < y; ++k)
+      for (var k = g; k < y; ++k)
         C += String.fromCharCode(F[k]);
       return C;
     }
-    function ie(F, d, y) {
+    function ie(F, g, y) {
       var C = F.length;
-      (!d || d < 0) && (d = 0), (!y || y < 0 || y > C) && (y = C);
-      for (var k = "", O = d; O < y; ++O)
+      (!g || g < 0) && (g = 0), (!y || y < 0 || y > C) && (y = C);
+      for (var k = "", O = g; O < y; ++O)
         k += Sc[F[O]];
       return k;
     }
-    function he(F, d, y) {
-      for (var C = F.slice(d, y), k = "", O = 0; O < C.length - 1; O += 2)
+    function he(F, g, y) {
+      for (var C = F.slice(g, y), k = "", O = 0; O < C.length - 1; O += 2)
         k += String.fromCharCode(C[O] + C[O + 1] * 256);
       return k;
     }
-    o.prototype.slice = function(d, y) {
+    o.prototype.slice = function(g, y) {
       var C = this.length;
-      d = ~~d, y = y === void 0 ? C : ~~y, d < 0 ? (d += C, d < 0 && (d = 0)) : d > C && (d = C), y < 0 ? (y += C, y < 0 && (y = 0)) : y > C && (y = C), y < d && (y = d);
-      var k = this.subarray(d, y);
+      g = ~~g, y = y === void 0 ? C : ~~y, g < 0 ? (g += C, g < 0 && (g = 0)) : g > C && (g = C), y < 0 ? (y += C, y < 0 && (y = 0)) : y > C && (y = C), y < g && (y = g);
+      var k = this.subarray(g, y);
       return Object.setPrototypeOf(k, o.prototype), k;
     };
-    function W(F, d, y) {
+    function W(F, g, y) {
       if (F % 1 !== 0 || F < 0) throw new RangeError("offset is not uint");
-      if (F + d > y) throw new RangeError("Trying to access beyond buffer length");
+      if (F + g > y) throw new RangeError("Trying to access beyond buffer length");
     }
-    o.prototype.readUintLE = o.prototype.readUIntLE = function(d, y, C) {
-      d = d >>> 0, y = y >>> 0, C || W(d, y, this.length);
-      for (var k = this[d], O = 1, R = 0; ++R < y && (O *= 256); )
-        k += this[d + R] * O;
+    o.prototype.readUintLE = o.prototype.readUIntLE = function(g, y, C) {
+      g = g >>> 0, y = y >>> 0, C || W(g, y, this.length);
+      for (var k = this[g], O = 1, R = 0; ++R < y && (O *= 256); )
+        k += this[g + R] * O;
       return k;
-    }, o.prototype.readUintBE = o.prototype.readUIntBE = function(d, y, C) {
-      d = d >>> 0, y = y >>> 0, C || W(d, y, this.length);
-      for (var k = this[d + --y], O = 1; y > 0 && (O *= 256); )
-        k += this[d + --y] * O;
+    }, o.prototype.readUintBE = o.prototype.readUIntBE = function(g, y, C) {
+      g = g >>> 0, y = y >>> 0, C || W(g, y, this.length);
+      for (var k = this[g + --y], O = 1; y > 0 && (O *= 256); )
+        k += this[g + --y] * O;
       return k;
-    }, o.prototype.readUint8 = o.prototype.readUInt8 = function(d, y) {
-      return d = d >>> 0, y || W(d, 1, this.length), this[d];
-    }, o.prototype.readUint16LE = o.prototype.readUInt16LE = function(d, y) {
-      return d = d >>> 0, y || W(d, 2, this.length), this[d] | this[d + 1] << 8;
-    }, o.prototype.readUint16BE = o.prototype.readUInt16BE = function(d, y) {
-      return d = d >>> 0, y || W(d, 2, this.length), this[d] << 8 | this[d + 1];
-    }, o.prototype.readUint32LE = o.prototype.readUInt32LE = function(d, y) {
-      return d = d >>> 0, y || W(d, 4, this.length), (this[d] | this[d + 1] << 8 | this[d + 2] << 16) + this[d + 3] * 16777216;
-    }, o.prototype.readUint32BE = o.prototype.readUInt32BE = function(d, y) {
-      return d = d >>> 0, y || W(d, 4, this.length), this[d] * 16777216 + (this[d + 1] << 16 | this[d + 2] << 8 | this[d + 3]);
-    }, o.prototype.readIntLE = function(d, y, C) {
-      d = d >>> 0, y = y >>> 0, C || W(d, y, this.length);
-      for (var k = this[d], O = 1, R = 0; ++R < y && (O *= 256); )
-        k += this[d + R] * O;
+    }, o.prototype.readUint8 = o.prototype.readUInt8 = function(g, y) {
+      return g = g >>> 0, y || W(g, 1, this.length), this[g];
+    }, o.prototype.readUint16LE = o.prototype.readUInt16LE = function(g, y) {
+      return g = g >>> 0, y || W(g, 2, this.length), this[g] | this[g + 1] << 8;
+    }, o.prototype.readUint16BE = o.prototype.readUInt16BE = function(g, y) {
+      return g = g >>> 0, y || W(g, 2, this.length), this[g] << 8 | this[g + 1];
+    }, o.prototype.readUint32LE = o.prototype.readUInt32LE = function(g, y) {
+      return g = g >>> 0, y || W(g, 4, this.length), (this[g] | this[g + 1] << 8 | this[g + 2] << 16) + this[g + 3] * 16777216;
+    }, o.prototype.readUint32BE = o.prototype.readUInt32BE = function(g, y) {
+      return g = g >>> 0, y || W(g, 4, this.length), this[g] * 16777216 + (this[g + 1] << 16 | this[g + 2] << 8 | this[g + 3]);
+    }, o.prototype.readIntLE = function(g, y, C) {
+      g = g >>> 0, y = y >>> 0, C || W(g, y, this.length);
+      for (var k = this[g], O = 1, R = 0; ++R < y && (O *= 256); )
+        k += this[g + R] * O;
       return O *= 128, k >= O && (k -= Math.pow(2, 8 * y)), k;
-    }, o.prototype.readIntBE = function(d, y, C) {
-      d = d >>> 0, y = y >>> 0, C || W(d, y, this.length);
-      for (var k = y, O = 1, R = this[d + --k]; k > 0 && (O *= 256); )
-        R += this[d + --k] * O;
+    }, o.prototype.readIntBE = function(g, y, C) {
+      g = g >>> 0, y = y >>> 0, C || W(g, y, this.length);
+      for (var k = y, O = 1, R = this[g + --k]; k > 0 && (O *= 256); )
+        R += this[g + --k] * O;
       return O *= 128, R >= O && (R -= Math.pow(2, 8 * y)), R;
-    }, o.prototype.readInt8 = function(d, y) {
-      return d = d >>> 0, y || W(d, 1, this.length), this[d] & 128 ? (255 - this[d] + 1) * -1 : this[d];
-    }, o.prototype.readInt16LE = function(d, y) {
-      d = d >>> 0, y || W(d, 2, this.length);
-      var C = this[d] | this[d + 1] << 8;
+    }, o.prototype.readInt8 = function(g, y) {
+      return g = g >>> 0, y || W(g, 1, this.length), this[g] & 128 ? (255 - this[g] + 1) * -1 : this[g];
+    }, o.prototype.readInt16LE = function(g, y) {
+      g = g >>> 0, y || W(g, 2, this.length);
+      var C = this[g] | this[g + 1] << 8;
       return C & 32768 ? C | 4294901760 : C;
-    }, o.prototype.readInt16BE = function(d, y) {
-      d = d >>> 0, y || W(d, 2, this.length);
-      var C = this[d + 1] | this[d] << 8;
+    }, o.prototype.readInt16BE = function(g, y) {
+      g = g >>> 0, y || W(g, 2, this.length);
+      var C = this[g + 1] | this[g] << 8;
       return C & 32768 ? C | 4294901760 : C;
-    }, o.prototype.readInt32LE = function(d, y) {
-      return d = d >>> 0, y || W(d, 4, this.length), this[d] | this[d + 1] << 8 | this[d + 2] << 16 | this[d + 3] << 24;
-    }, o.prototype.readInt32BE = function(d, y) {
-      return d = d >>> 0, y || W(d, 4, this.length), this[d] << 24 | this[d + 1] << 16 | this[d + 2] << 8 | this[d + 3];
-    }, o.prototype.readFloatLE = function(d, y) {
-      return d = d >>> 0, y || W(d, 4, this.length), t.read(this, d, !0, 23, 4);
-    }, o.prototype.readFloatBE = function(d, y) {
-      return d = d >>> 0, y || W(d, 4, this.length), t.read(this, d, !1, 23, 4);
-    }, o.prototype.readDoubleLE = function(d, y) {
-      return d = d >>> 0, y || W(d, 8, this.length), t.read(this, d, !0, 52, 8);
-    }, o.prototype.readDoubleBE = function(d, y) {
-      return d = d >>> 0, y || W(d, 8, this.length), t.read(this, d, !1, 52, 8);
+    }, o.prototype.readInt32LE = function(g, y) {
+      return g = g >>> 0, y || W(g, 4, this.length), this[g] | this[g + 1] << 8 | this[g + 2] << 16 | this[g + 3] << 24;
+    }, o.prototype.readInt32BE = function(g, y) {
+      return g = g >>> 0, y || W(g, 4, this.length), this[g] << 24 | this[g + 1] << 16 | this[g + 2] << 8 | this[g + 3];
+    }, o.prototype.readFloatLE = function(g, y) {
+      return g = g >>> 0, y || W(g, 4, this.length), t.read(this, g, !0, 23, 4);
+    }, o.prototype.readFloatBE = function(g, y) {
+      return g = g >>> 0, y || W(g, 4, this.length), t.read(this, g, !1, 23, 4);
+    }, o.prototype.readDoubleLE = function(g, y) {
+      return g = g >>> 0, y || W(g, 8, this.length), t.read(this, g, !0, 52, 8);
+    }, o.prototype.readDoubleBE = function(g, y) {
+      return g = g >>> 0, y || W(g, 8, this.length), t.read(this, g, !1, 52, 8);
     };
-    function $(F, d, y, C, k, O) {
+    function $(F, g, y, C, k, O) {
       if (!o.isBuffer(F)) throw new TypeError('"buffer" argument must be a Buffer instance');
-      if (d > k || d < O) throw new RangeError('"value" argument is out of bounds');
+      if (g > k || g < O) throw new RangeError('"value" argument is out of bounds');
       if (y + C > F.length) throw new RangeError("Index out of range");
     }
-    o.prototype.writeUintLE = o.prototype.writeUIntLE = function(d, y, C, k) {
-      if (d = +d, y = y >>> 0, C = C >>> 0, !k) {
+    o.prototype.writeUintLE = o.prototype.writeUIntLE = function(g, y, C, k) {
+      if (g = +g, y = y >>> 0, C = C >>> 0, !k) {
         var O = Math.pow(2, 8 * C) - 1;
-        $(this, d, y, C, O, 0);
+        $(this, g, y, C, O, 0);
       }
       var R = 1, J = 0;
-      for (this[y] = d & 255; ++J < C && (R *= 256); )
-        this[y + J] = d / R & 255;
+      for (this[y] = g & 255; ++J < C && (R *= 256); )
+        this[y + J] = g / R & 255;
       return y + C;
-    }, o.prototype.writeUintBE = o.prototype.writeUIntBE = function(d, y, C, k) {
-      if (d = +d, y = y >>> 0, C = C >>> 0, !k) {
+    }, o.prototype.writeUintBE = o.prototype.writeUIntBE = function(g, y, C, k) {
+      if (g = +g, y = y >>> 0, C = C >>> 0, !k) {
         var O = Math.pow(2, 8 * C) - 1;
-        $(this, d, y, C, O, 0);
+        $(this, g, y, C, O, 0);
       }
       var R = C - 1, J = 1;
-      for (this[y + R] = d & 255; --R >= 0 && (J *= 256); )
-        this[y + R] = d / J & 255;
+      for (this[y + R] = g & 255; --R >= 0 && (J *= 256); )
+        this[y + R] = g / J & 255;
       return y + C;
-    }, o.prototype.writeUint8 = o.prototype.writeUInt8 = function(d, y, C) {
-      return d = +d, y = y >>> 0, C || $(this, d, y, 1, 255, 0), this[y] = d & 255, y + 1;
-    }, o.prototype.writeUint16LE = o.prototype.writeUInt16LE = function(d, y, C) {
-      return d = +d, y = y >>> 0, C || $(this, d, y, 2, 65535, 0), this[y] = d & 255, this[y + 1] = d >>> 8, y + 2;
-    }, o.prototype.writeUint16BE = o.prototype.writeUInt16BE = function(d, y, C) {
-      return d = +d, y = y >>> 0, C || $(this, d, y, 2, 65535, 0), this[y] = d >>> 8, this[y + 1] = d & 255, y + 2;
-    }, o.prototype.writeUint32LE = o.prototype.writeUInt32LE = function(d, y, C) {
-      return d = +d, y = y >>> 0, C || $(this, d, y, 4, 4294967295, 0), this[y + 3] = d >>> 24, this[y + 2] = d >>> 16, this[y + 1] = d >>> 8, this[y] = d & 255, y + 4;
-    }, o.prototype.writeUint32BE = o.prototype.writeUInt32BE = function(d, y, C) {
-      return d = +d, y = y >>> 0, C || $(this, d, y, 4, 4294967295, 0), this[y] = d >>> 24, this[y + 1] = d >>> 16, this[y + 2] = d >>> 8, this[y + 3] = d & 255, y + 4;
-    }, o.prototype.writeIntLE = function(d, y, C, k) {
-      if (d = +d, y = y >>> 0, !k) {
+    }, o.prototype.writeUint8 = o.prototype.writeUInt8 = function(g, y, C) {
+      return g = +g, y = y >>> 0, C || $(this, g, y, 1, 255, 0), this[y] = g & 255, y + 1;
+    }, o.prototype.writeUint16LE = o.prototype.writeUInt16LE = function(g, y, C) {
+      return g = +g, y = y >>> 0, C || $(this, g, y, 2, 65535, 0), this[y] = g & 255, this[y + 1] = g >>> 8, y + 2;
+    }, o.prototype.writeUint16BE = o.prototype.writeUInt16BE = function(g, y, C) {
+      return g = +g, y = y >>> 0, C || $(this, g, y, 2, 65535, 0), this[y] = g >>> 8, this[y + 1] = g & 255, y + 2;
+    }, o.prototype.writeUint32LE = o.prototype.writeUInt32LE = function(g, y, C) {
+      return g = +g, y = y >>> 0, C || $(this, g, y, 4, 4294967295, 0), this[y + 3] = g >>> 24, this[y + 2] = g >>> 16, this[y + 1] = g >>> 8, this[y] = g & 255, y + 4;
+    }, o.prototype.writeUint32BE = o.prototype.writeUInt32BE = function(g, y, C) {
+      return g = +g, y = y >>> 0, C || $(this, g, y, 4, 4294967295, 0), this[y] = g >>> 24, this[y + 1] = g >>> 16, this[y + 2] = g >>> 8, this[y + 3] = g & 255, y + 4;
+    }, o.prototype.writeIntLE = function(g, y, C, k) {
+      if (g = +g, y = y >>> 0, !k) {
         var O = Math.pow(2, 8 * C - 1);
-        $(this, d, y, C, O - 1, -O);
+        $(this, g, y, C, O - 1, -O);
       }
       var R = 0, J = 1, te = 0;
-      for (this[y] = d & 255; ++R < C && (J *= 256); )
-        d < 0 && te === 0 && this[y + R - 1] !== 0 && (te = 1), this[y + R] = (d / J >> 0) - te & 255;
+      for (this[y] = g & 255; ++R < C && (J *= 256); )
+        g < 0 && te === 0 && this[y + R - 1] !== 0 && (te = 1), this[y + R] = (g / J >> 0) - te & 255;
       return y + C;
-    }, o.prototype.writeIntBE = function(d, y, C, k) {
-      if (d = +d, y = y >>> 0, !k) {
+    }, o.prototype.writeIntBE = function(g, y, C, k) {
+      if (g = +g, y = y >>> 0, !k) {
         var O = Math.pow(2, 8 * C - 1);
-        $(this, d, y, C, O - 1, -O);
+        $(this, g, y, C, O - 1, -O);
       }
       var R = C - 1, J = 1, te = 0;
-      for (this[y + R] = d & 255; --R >= 0 && (J *= 256); )
-        d < 0 && te === 0 && this[y + R + 1] !== 0 && (te = 1), this[y + R] = (d / J >> 0) - te & 255;
+      for (this[y + R] = g & 255; --R >= 0 && (J *= 256); )
+        g < 0 && te === 0 && this[y + R + 1] !== 0 && (te = 1), this[y + R] = (g / J >> 0) - te & 255;
       return y + C;
-    }, o.prototype.writeInt8 = function(d, y, C) {
-      return d = +d, y = y >>> 0, C || $(this, d, y, 1, 127, -128), d < 0 && (d = 255 + d + 1), this[y] = d & 255, y + 1;
-    }, o.prototype.writeInt16LE = function(d, y, C) {
-      return d = +d, y = y >>> 0, C || $(this, d, y, 2, 32767, -32768), this[y] = d & 255, this[y + 1] = d >>> 8, y + 2;
-    }, o.prototype.writeInt16BE = function(d, y, C) {
-      return d = +d, y = y >>> 0, C || $(this, d, y, 2, 32767, -32768), this[y] = d >>> 8, this[y + 1] = d & 255, y + 2;
-    }, o.prototype.writeInt32LE = function(d, y, C) {
-      return d = +d, y = y >>> 0, C || $(this, d, y, 4, 2147483647, -2147483648), this[y] = d & 255, this[y + 1] = d >>> 8, this[y + 2] = d >>> 16, this[y + 3] = d >>> 24, y + 4;
-    }, o.prototype.writeInt32BE = function(d, y, C) {
-      return d = +d, y = y >>> 0, C || $(this, d, y, 4, 2147483647, -2147483648), d < 0 && (d = 4294967295 + d + 1), this[y] = d >>> 24, this[y + 1] = d >>> 16, this[y + 2] = d >>> 8, this[y + 3] = d & 255, y + 4;
+    }, o.prototype.writeInt8 = function(g, y, C) {
+      return g = +g, y = y >>> 0, C || $(this, g, y, 1, 127, -128), g < 0 && (g = 255 + g + 1), this[y] = g & 255, y + 1;
+    }, o.prototype.writeInt16LE = function(g, y, C) {
+      return g = +g, y = y >>> 0, C || $(this, g, y, 2, 32767, -32768), this[y] = g & 255, this[y + 1] = g >>> 8, y + 2;
+    }, o.prototype.writeInt16BE = function(g, y, C) {
+      return g = +g, y = y >>> 0, C || $(this, g, y, 2, 32767, -32768), this[y] = g >>> 8, this[y + 1] = g & 255, y + 2;
+    }, o.prototype.writeInt32LE = function(g, y, C) {
+      return g = +g, y = y >>> 0, C || $(this, g, y, 4, 2147483647, -2147483648), this[y] = g & 255, this[y + 1] = g >>> 8, this[y + 2] = g >>> 16, this[y + 3] = g >>> 24, y + 4;
+    }, o.prototype.writeInt32BE = function(g, y, C) {
+      return g = +g, y = y >>> 0, C || $(this, g, y, 4, 2147483647, -2147483648), g < 0 && (g = 4294967295 + g + 1), this[y] = g >>> 24, this[y + 1] = g >>> 16, this[y + 2] = g >>> 8, this[y + 3] = g & 255, y + 4;
     };
-    function er(F, d, y, C, k, O) {
+    function er(F, g, y, C, k, O) {
       if (y + C > F.length) throw new RangeError("Index out of range");
       if (y < 0) throw new RangeError("Index out of range");
     }
-    function on(F, d, y, C, k) {
-      return d = +d, y = y >>> 0, k || er(F, d, y, 4), t.write(F, d, y, C, 23, 4), y + 4;
+    function on(F, g, y, C, k) {
+      return g = +g, y = y >>> 0, k || er(F, g, y, 4), t.write(F, g, y, C, 23, 4), y + 4;
     }
-    o.prototype.writeFloatLE = function(d, y, C) {
-      return on(this, d, y, !0, C);
-    }, o.prototype.writeFloatBE = function(d, y, C) {
-      return on(this, d, y, !1, C);
+    o.prototype.writeFloatLE = function(g, y, C) {
+      return on(this, g, y, !0, C);
+    }, o.prototype.writeFloatBE = function(g, y, C) {
+      return on(this, g, y, !1, C);
     };
-    function hn(F, d, y, C, k) {
-      return d = +d, y = y >>> 0, k || er(F, d, y, 8), t.write(F, d, y, C, 52, 8), y + 8;
-    }
-    o.prototype.writeDoubleLE = function(d, y, C) {
-      return hn(this, d, y, !0, C);
-    }, o.prototype.writeDoubleBE = function(d, y, C) {
-      return hn(this, d, y, !1, C);
-    }, o.prototype.copy = function(d, y, C, k) {
-      if (!o.isBuffer(d)) throw new TypeError("argument should be a Buffer");
-      if (C || (C = 0), !k && k !== 0 && (k = this.length), y >= d.length && (y = d.length), y || (y = 0), k > 0 && k < C && (k = C), k === C || d.length === 0 || this.length === 0) return 0;
+    function hn(F, g, y, C, k) {
+      return g = +g, y = y >>> 0, k || er(F, g, y, 8), t.write(F, g, y, C, 52, 8), y + 8;
+    }
+    o.prototype.writeDoubleLE = function(g, y, C) {
+      return hn(this, g, y, !0, C);
+    }, o.prototype.writeDoubleBE = function(g, y, C) {
+      return hn(this, g, y, !1, C);
+    }, o.prototype.copy = function(g, y, C, k) {
+      if (!o.isBuffer(g)) throw new TypeError("argument should be a Buffer");
+      if (C || (C = 0), !k && k !== 0 && (k = this.length), y >= g.length && (y = g.length), y || (y = 0), k > 0 && k < C && (k = C), k === C || g.length === 0 || this.length === 0) return 0;
       if (y < 0)
         throw new RangeError("targetStart out of bounds");
       if (C < 0 || C >= this.length) throw new RangeError("Index out of range");
       if (k < 0) throw new RangeError("sourceEnd out of bounds");
-      k > this.length && (k = this.length), d.length - y < k - C && (k = d.length - y + C);
+      k > this.length && (k = this.length), g.length - y < k - C && (k = g.length - y + C);
       var O = k - C;
-      return this === d && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(y, C, k) : Uint8Array.prototype.set.call(
-        d,
+      return this === g && typeof Uint8Array.prototype.copyWithin == "function" ? this.copyWithin(y, C, k) : Uint8Array.prototype.set.call(
+        g,
         this.subarray(C, k),
         y
       ), O;
-    }, o.prototype.fill = function(d, y, C, k) {
-      if (typeof d == "string") {
+    }, o.prototype.fill = function(g, y, C, k) {
+      if (typeof g == "string") {
         if (typeof y == "string" ? (k = y, y = 0, C = this.length) : typeof C == "string" && (k = C, C = this.length), k !== void 0 && typeof k != "string")
           throw new TypeError("encoding must be a string");
         if (typeof k == "string" && !o.isEncoding(k))
           throw new TypeError("Unknown encoding: " + k);
-        if (d.length === 1) {
-          var O = d.charCodeAt(0);
-          (k === "utf8" && O < 128 || k === "latin1") && (d = O);
+        if (g.length === 1) {
+          var O = g.charCodeAt(0);
+          (k === "utf8" && O < 128 || k === "latin1") && (g = O);
         }
-      } else typeof d == "number" ? d = d & 255 : typeof d == "boolean" && (d = Number(d));
+      } else typeof g == "number" ? g = g & 255 : typeof g == "boolean" && (g = Number(g));
       if (y < 0 || this.length < y || this.length < C)
         throw new RangeError("Out of range index");
       if (C <= y)
         return this;
-      y = y >>> 0, C = C === void 0 ? this.length : C >>> 0, d || (d = 0);
+      y = y >>> 0, C = C === void 0 ? this.length : C >>> 0, g || (g = 0);
       var R;
-      if (typeof d == "number")
+      if (typeof g == "number")
         for (R = y; R < C; ++R)
-          this[R] = d;
+          this[R] = g;
       else {
-        var J = o.isBuffer(d) ? d : o.from(d, k), te = J.length;
+        var J = o.isBuffer(g) ? g : o.from(g, k), te = J.length;
         if (te === 0)
-          throw new TypeError('The value "' + d + '" is invalid for argument "value"');
+          throw new TypeError('The value "' + g + '" is invalid for argument "value"');
         for (R = 0; R < C - y; ++R)
           this[R + y] = J[R % te];
       }
@@ -18131,45 +18131,45 @@ var P1 = Fc((L) => {
         F = F + "=";
       return F;
     }
-    function xt(F, d) {
-      d = d || 1 / 0;
+    function xt(F, g) {
+      g = g || 1 / 0;
       for (var y, C = F.length, k = null, O = [], R = 0; R < C; ++R) {
         if (y = F.charCodeAt(R), y > 55295 && y < 57344) {
           if (!k) {
             if (y > 56319) {
-              (d -= 3) > -1 && O.push(239, 191, 189);
+              (g -= 3) > -1 && O.push(239, 191, 189);
               continue;
             } else if (R + 1 === C) {
-              (d -= 3) > -1 && O.push(239, 191, 189);
+              (g -= 3) > -1 && O.push(239, 191, 189);
               continue;
             }
             k = y;
             continue;
           }
           if (y < 56320) {
-            (d -= 3) > -1 && O.push(239, 191, 189), k = y;
+            (g -= 3) > -1 && O.push(239, 191, 189), k = y;
             continue;
           }
           y = (k - 55296 << 10 | y - 56320) + 65536;
-        } else k && (d -= 3) > -1 && O.push(239, 191, 189);
+        } else k && (g -= 3) > -1 && O.push(239, 191, 189);
         if (k = null, y < 128) {
-          if ((d -= 1) < 0) break;
+          if ((g -= 1) < 0) break;
           O.push(y);
         } else if (y < 2048) {
-          if ((d -= 2) < 0) break;
+          if ((g -= 2) < 0) break;
           O.push(
             y >> 6 | 192,
             y & 63 | 128
           );
         } else if (y < 65536) {
-          if ((d -= 3) < 0) break;
+          if ((g -= 3) < 0) break;
           O.push(
             y >> 12 | 224,
             y >> 6 & 63 | 128,
             y & 63 | 128
           );
         } else if (y < 1114112) {
-          if ((d -= 4) < 0) break;
+          if ((g -= 4) < 0) break;
           O.push(
             y >> 18 | 240,
             y >> 12 & 63 | 128,
@@ -18182,34 +18182,34 @@ var P1 = Fc((L) => {
       return O;
     }
     function bc(F) {
-      for (var d = [], y = 0; y < F.length; ++y)
-        d.push(F.charCodeAt(y) & 255);
-      return d;
+      for (var g = [], y = 0; y < F.length; ++y)
+        g.push(F.charCodeAt(y) & 255);
+      return g;
     }
-    function wc(F, d) {
-      for (var y, C, k, O = [], R = 0; R < F.length && !((d -= 2) < 0); ++R)
+    function wc(F, g) {
+      for (var y, C, k, O = [], R = 0; R < F.length && !((g -= 2) < 0); ++R)
         y = F.charCodeAt(R), C = y >> 8, k = y % 256, O.push(k), O.push(C);
       return O;
     }
     function Qs(F) {
       return e.toByteArray(cn(F));
     }
-    function un(F, d, y, C) {
-      for (var k = 0; k < C && !(k + y >= d.length || k >= F.length); ++k)
-        d[k + y] = F[k];
+    function un(F, g, y, C) {
+      for (var k = 0; k < C && !(k + y >= g.length || k >= F.length); ++k)
+        g[k + y] = F[k];
       return k;
     }
-    function Ke(F, d) {
-      return F instanceof d || F != null && F.constructor != null && F.constructor.name != null && F.constructor.name === d.name;
+    function Ke(F, g) {
+      return F instanceof g || F != null && F.constructor != null && F.constructor.name != null && F.constructor.name === g.name;
     }
     function fi(F) {
       return F !== F;
     }
     var Sc = function() {
-      for (var F = "0123456789abcdef", d = new Array(256), y = 0; y < 16; ++y)
+      for (var F = "0123456789abcdef", g = new Array(256), y = 0; y < 16; ++y)
         for (var C = y * 16, k = 0; k < 16; ++k)
-          d[C + k] = F[y] + F[k];
-      return d;
+          g[C + k] = F[y] + F[k];
+      return g;
     }();
   })(Vs);
   var Xn = Vs, xr = Xn.Buffer, De = {}, Ie;
@@ -18366,7 +18366,7 @@ var P1 = Fc((L) => {
           this.fillLast = h, w = 4;
           break;
         case "base64":
-          this.text = p, this.end = g, w = 3;
+          this.text = p, this.end = d, w = 3;
           break;
         default:
           this.write = m, this.end = x;
@@ -18449,7 +18449,7 @@ var P1 = Fc((L) => {
       var b = (v.length - w) % 3;
       return b === 0 ? v.toString("base64", w) : (this.lastNeed = 3 - b, this.lastTotal = 3, b === 1 ? this.lastChar[0] = v[v.length - 1] : (this.lastChar[0] = v[v.length - 2], this.lastChar[1] = v[v.length - 1]), v.toString("base64", w, v.length - b));
     }
-    function g(v) {
+    function d(v) {
       var w = v && v.length ? this.write(v) : "";
       return this.lastNeed ? w + this.lastChar.toString("base64", 0, 3 - this.lastNeed) : w;
     }
@@ -18523,8 +18523,8 @@ var P1 = Fc((L) => {
       this.acc = 0, this.contBytes = 0, this.accBytes = 0, this.defaultCharUnicode = u.defaultCharUnicode;
     }
     o.prototype.write = function(c) {
-      for (var u = this.acc, f = this.contBytes, l = this.accBytes, p = "", g = 0; g < c.length; g++) {
-        var m = c[g];
+      for (var u = this.acc, f = this.contBytes, l = this.accBytes, p = "", d = 0; d < c.length; d++) {
+        var m = c[d];
         (m & 192) !== 128 ? (f > 0 && (p += this.defaultCharUnicode, f = 0), m < 128 ? p += String.fromCharCode(m) : m < 224 ? (u = m & 31, f = 1, l = 1) : m < 240 ? (u = m & 15, f = 2, l = 1) : p += this.defaultCharUnicode) : f > 0 ? (u = u << 6 | m & 63, f--, l++, f === 0 && (l === 2 && u < 128 && u > 0 ? p += this.defaultCharUnicode : l === 3 && u < 2048 ? p += this.defaultCharUnicode : p += String.fromCharCode(u))) : p += this.defaultCharUnicode;
       }
       return this.acc = u, this.contBytes = f, this.accBytes = l, p;
@@ -18562,8 +18562,8 @@ var P1 = Fc((L) => {
       this.isLE = u.isLE, this.highSurrogate = 0;
     }
     t.prototype.write = function(c) {
-      for (var u = n.from(c, "ucs2"), f = n.alloc(u.length * 2), l = this.isLE ? f.writeUInt32LE : f.writeUInt32BE, p = 0, g = 0; g < u.length; g += 2) {
-        var m = u.readUInt16LE(g), x = m >= 55296 && m < 56320, v = m >= 56320 && m < 57344;
+      for (var u = n.from(c, "ucs2"), f = n.alloc(u.length * 2), l = this.isLE ? f.writeUInt32LE : f.writeUInt32BE, p = 0, d = 0; d < u.length; d += 2) {
+        var m = u.readUInt16LE(d), x = m >= 55296 && m < 56320, v = m >= 56320 && m < 57344;
         if (this.highSurrogate)
           if (x || !v)
             l.call(f, this.highSurrogate, p), p += 4;
@@ -18587,14 +18587,14 @@ var P1 = Fc((L) => {
     r.prototype.write = function(c) {
       if (c.length === 0)
         return "";
-      var u = 0, f = 0, l = n.alloc(c.length + 4), p = 0, g = this.isLE, m = this.overflow, x = this.badChar;
+      var u = 0, f = 0, l = n.alloc(c.length + 4), p = 0, d = this.isLE, m = this.overflow, x = this.badChar;
       if (m.length > 0) {
         for (; u < c.length && m.length < 4; u++)
           m.push(c[u]);
-        m.length === 4 && (g ? f = m[u] | m[u + 1] << 8 | m[u + 2] << 16 | m[u + 3] << 24 : f = m[u + 3] | m[u + 2] << 8 | m[u + 1] << 16 | m[u] << 24, m.length = 0, p = i(l, p, f, x));
+        m.length === 4 && (d ? f = m[u] | m[u + 1] << 8 | m[u + 2] << 16 | m[u + 3] << 24 : f = m[u + 3] | m[u + 2] << 8 | m[u + 1] << 16 | m[u] << 24, m.length = 0, p = i(l, p, f, x));
       }
       for (; u < c.length - 3; u += 4)
-        g ? f = c[u] | c[u + 1] << 8 | c[u + 2] << 16 | c[u + 3] << 24 : f = c[u + 3] | c[u + 2] << 8 | c[u + 1] << 16 | c[u] << 24, p = i(l, p, f, x);
+        d ? f = c[u] | c[u + 1] << 8 | c[u + 2] << 16 | c[u + 3] << 24 : f = c[u + 3] | c[u + 2] << 8 | c[u + 1] << 16 | c[u] << 24, p = i(l, p, f, x);
       for (; u < c.length; u++)
         m.push(c[u]);
       return l.slice(0, p).toString("ucs2");
@@ -18649,7 +18649,7 @@ var P1 = Fc((L) => {
       return this.decoder.end();
     };
     function h(c, u) {
-      var f = [], l = 0, p = 0, g = 0, m = 0, x = 0;
+      var f = [], l = 0, p = 0, d = 0, m = 0, x = 0;
       e:
         for (var v = 0; v < c.length; v++)
           for (var w = c[v], b = 0; b < w.length; b++)
@@ -18660,10 +18660,10 @@ var P1 = Fc((L) => {
                 if (f[0] === 0 && f[1] === 0 && f[2] === 254 && f[3] === 255)
                   return "utf-32be";
               }
-              if ((f[0] !== 0 || f[1] > 16) && g++, (f[3] !== 0 || f[2] > 16) && p++, f[0] === 0 && f[1] === 0 && (f[2] !== 0 || f[3] !== 0) && x++, (f[0] !== 0 || f[1] !== 0) && f[2] === 0 && f[3] === 0 && m++, f.length = 0, l++, l >= 100)
+              if ((f[0] !== 0 || f[1] > 16) && d++, (f[3] !== 0 || f[2] > 16) && p++, f[0] === 0 && f[1] === 0 && (f[2] !== 0 || f[3] !== 0) && x++, (f[0] !== 0 || f[1] !== 0) && f[2] === 0 && f[3] === 0 && m++, f.length = 0, l++, l >= 100)
                 break e;
             }
-      return x - g > m - p ? "utf-32be" : x - g < m - p ? "utf-32le" : u || "utf-32le";
+      return x - d > m - p ? "utf-32be" : x - d < m - p ? "utf-32le" : u || "utf-32le";
     }
     return ft;
   }
@@ -18739,8 +18739,8 @@ var P1 = Fc((L) => {
     function o(h, c) {
       var u = [], f = 0, l = 0, p = 0;
       e:
-        for (var g = 0; g < h.length; g++)
-          for (var m = h[g], x = 0; x < m.length; x++)
+        for (var d = 0; d < h.length; d++)
+          for (var m = h[d], x = 0; x < m.length; x++)
             if (u.push(m[x]), u.length === 2) {
               if (f === 0) {
                 if (u[0] === 255 && u[1] === 254) return "utf-16le";
@@ -18823,12 +18823,12 @@ var P1 = Fc((L) => {
     function p(m, x) {
       this.iconv = x.iconv, this.inBase64 = !1, this.base64Accum = "";
     }
-    var g = a.slice();
-    return g[44] = !0, p.prototype.write = function(m) {
+    var d = a.slice();
+    return d[44] = !0, p.prototype.write = function(m) {
       for (var x = "", v = 0, w = this.inBase64, b = this.base64Accum, S = 0; S < m.length; S++)
         if (!w)
           m[S] == u && (x += this.iconv.decode(m.slice(v, S), "ascii"), v = S + 1, w = !0);
-        else if (!g[m[S]]) {
+        else if (!d[m[S]]) {
           if (S == v && m[S] == c)
             x += "&";
           else {
@@ -19508,10 +19508,10 @@ var P1 = Fc((L) => {
         throw new Error("DBCS codec is called without the data.");
       if (!l.table)
         throw new Error("Encoding '" + this.encodingName + "' has no data.");
-      var g = l.table();
+      var d = l.table();
       this.decodeTables = [], this.decodeTables[0] = s.slice(0), this.decodeTableSeq = [];
-      for (var m = 0; m < g.length; m++)
-        this._addDecodeChunk(g[m]);
+      for (var m = 0; m < d.length; m++)
+        this._addDecodeChunk(d[m]);
       if (typeof l.gb18030 == "function") {
         this.gb18030 = l.gb18030();
         var x = this.decodeTables.length;
@@ -19558,18 +19558,18 @@ var P1 = Fc((L) => {
       for (var p = []; l > 0; l >>>= 8)
         p.push(l & 255);
       p.length == 0 && p.push(0);
-      for (var g = this.decodeTables[0], m = p.length - 1; m > 0; m--) {
-        var x = g[p[m]];
+      for (var d = this.decodeTables[0], m = p.length - 1; m > 0; m--) {
+        var x = d[p[m]];
         if (x == e)
-          g[p[m]] = i - this.decodeTables.length, this.decodeTables.push(g = s.slice(0));
+          d[p[m]] = i - this.decodeTables.length, this.decodeTables.push(d = s.slice(0));
         else if (x <= i)
-          g = this.decodeTables[i - x];
+          d = this.decodeTables[i - x];
         else
           throw new Error("Overwrite byte in " + this.encodingName + ", addr: " + l.toString(16));
       }
-      return g;
+      return d;
     }, h.prototype._addDecodeChunk = function(l) {
-      var p = parseInt(l[0], 16), g = this._getDecodeTrieNode(p);
+      var p = parseInt(l[0], 16), d = this._getDecodeTrieNode(p);
       p = p & 255;
       for (var m = 1; m < l.length; m++) {
         var x = l[m];
@@ -19579,19 +19579,19 @@ var P1 = Fc((L) => {
             if (w >= 55296 && w < 56320) {
               var b = x.charCodeAt(v++);
               if (b >= 56320 && b < 57344)
-                g[p++] = 65536 + (w - 55296) * 1024 + (b - 56320);
+                d[p++] = 65536 + (w - 55296) * 1024 + (b - 56320);
               else
                 throw new Error("Incorrect surrogate pair in " + this.encodingName + " at chunk " + l[0]);
             } else if (w > 4080 && w <= 4095) {
               for (var S = 4095 - w + 2, T = [], B = 0; B < S; B++)
                 T.push(x.charCodeAt(v++));
-              g[p++] = r - this.decodeTableSeq.length, this.decodeTableSeq.push(T);
+              d[p++] = r - this.decodeTableSeq.length, this.decodeTableSeq.push(T);
             } else
-              g[p++] = w;
+              d[p++] = w;
           }
         else if (typeof x == "number")
-          for (var M = g[p - 1] + 1, v = 0; v < x; v++)
-            g[p++] = M++;
+          for (var M = d[p - 1] + 1, v = 0; v < x; v++)
+            d[p++] = M++;
         else
           throw new Error("Incorrect type '" + typeof x + "' given in " + this.encodingName + " at chunk " + l[0]);
       }
@@ -19601,27 +19601,27 @@ var P1 = Fc((L) => {
       var p = l >> 8;
       return this.encodeTable[p] === void 0 && (this.encodeTable[p] = s.slice(0)), this.encodeTable[p];
     }, h.prototype._setEncodeChar = function(l, p) {
-      var g = this._getEncodeBucket(l), m = l & 255;
-      g[m] <= r ? this.encodeTableSeq[r - g[m]][a] = p : g[m] == e && (g[m] = p);
+      var d = this._getEncodeBucket(l), m = l & 255;
+      d[m] <= r ? this.encodeTableSeq[r - d[m]][a] = p : d[m] == e && (d[m] = p);
     }, h.prototype._setEncodeSequence = function(l, p) {
-      var g = l[0], m = this._getEncodeBucket(g), x = g & 255, v;
+      var d = l[0], m = this._getEncodeBucket(d), x = d & 255, v;
       m[x] <= r ? v = this.encodeTableSeq[r - m[x]] : (v = {}, m[x] !== e && (v[a] = m[x]), m[x] = r - this.encodeTableSeq.length, this.encodeTableSeq.push(v));
       for (var w = 1; w < l.length - 1; w++) {
-        var b = v[g];
-        typeof b == "object" ? v = b : (v = v[g] = {}, b !== void 0 && (v[a] = b));
+        var b = v[d];
+        typeof b == "object" ? v = b : (v = v[d] = {}, b !== void 0 && (v[a] = b));
       }
-      g = l[l.length - 1], v[g] = p;
-    }, h.prototype._fillEncodeTable = function(l, p, g) {
+      d = l[l.length - 1], v[d] = p;
+    }, h.prototype._fillEncodeTable = function(l, p, d) {
       for (var m = this.decodeTables[l], x = !1, v = {}, w = 0; w < 256; w++) {
         var b = m[w], S = p + w;
-        if (!g[S])
+        if (!d[S])
           if (b >= 0)
             this._setEncodeChar(b, S), x = !0;
           else if (b <= i) {
             var T = i - b;
             if (!v[T]) {
               var B = S << 8 >>> 0;
-              this._fillEncodeTable(T, B, g) ? x = !0 : v[T] = !0;
+              this._fillEncodeTable(T, B, d) ? x = !0 : v[T] = !0;
             }
           } else b <= r && (this._setEncodeSequence(this.decodeTableSeq[r - b], S), x = !0);
       }
@@ -19631,7 +19631,7 @@ var P1 = Fc((L) => {
       this.leadSurrogate = -1, this.seqObj = void 0, this.encodeTable = p.encodeTable, this.encodeTableSeq = p.encodeTableSeq, this.defaultCharSingleByte = p.defCharSB, this.gb18030 = p.gb18030;
     }
     c.prototype.write = function(l) {
-      for (var p = n.alloc(l.length * (this.gb18030 ? 4 : 3)), g = this.leadSurrogate, m = this.seqObj, x = -1, v = 0, w = 0; ; ) {
+      for (var p = n.alloc(l.length * (this.gb18030 ? 4 : 3)), d = this.leadSurrogate, m = this.seqObj, x = -1, v = 0, w = 0; ; ) {
         if (x === -1) {
           if (v == l.length) break;
           var b = l.charCodeAt(v++);
@@ -19641,14 +19641,14 @@ var P1 = Fc((L) => {
         }
         if (b >= 55296 && b < 57344)
           if (b < 56320)
-            if (g === -1) {
-              g = b;
+            if (d === -1) {
+              d = b;
               continue;
             } else
-              g = b, b = e;
+              d = b, b = e;
           else
-            g !== -1 ? (b = 65536 + (g - 55296) * 1024 + (b - 56320), g = -1) : b = e;
-        else g !== -1 && (x = b, b = e, g = -1);
+            d !== -1 ? (b = 65536 + (d - 55296) * 1024 + (b - 56320), d = -1) : b = e;
+        else d !== -1 && (x = b, b = e, d = -1);
         var S = e;
         if (m !== void 0 && b != e) {
           var T = m[b];
@@ -19674,13 +19674,13 @@ var P1 = Fc((L) => {
         }
         S === e && (S = this.defaultCharSingleByte), S < 256 ? p[w++] = S : S < 65536 ? (p[w++] = S >> 8, p[w++] = S & 255) : S < 16777216 ? (p[w++] = S >> 16, p[w++] = S >> 8 & 255, p[w++] = S & 255) : (p[w++] = S >>> 24, p[w++] = S >>> 16 & 255, p[w++] = S >>> 8 & 255, p[w++] = S & 255);
       }
-      return this.seqObj = m, this.leadSurrogate = g, p.slice(0, w);
+      return this.seqObj = m, this.leadSurrogate = d, p.slice(0, w);
     }, c.prototype.end = function() {
       if (!(this.leadSurrogate === -1 && this.seqObj === void 0)) {
         var l = n.alloc(10), p = 0;
         if (this.seqObj) {
-          var g = this.seqObj[a];
-          g !== void 0 && (g < 256 ? l[p++] = g : (l[p++] = g >> 8, l[p++] = g & 255)), this.seqObj = void 0;
+          var d = this.seqObj[a];
+          d !== void 0 && (d < 256 ? l[p++] = d : (l[p++] = d >> 8, l[p++] = d & 255)), this.seqObj = void 0;
         }
         return this.leadSurrogate !== -1 && (l[p++] = this.defaultCharSingleByte, this.leadSurrogate = -1), l.slice(0, p);
       }
@@ -19689,8 +19689,8 @@ var P1 = Fc((L) => {
       this.nodeIdx = 0, this.prevBytes = [], this.decodeTables = p.decodeTables, this.decodeTableSeq = p.decodeTableSeq, this.defaultCharUnicode = p.defaultCharUnicode, this.gb18030 = p.gb18030;
     }
     u.prototype.write = function(l) {
-      for (var p = n.alloc(l.length * 2), g = this.nodeIdx, m = this.prevBytes, x = this.prevBytes.length, v = -this.prevBytes.length, w, b = 0, S = 0; b < l.length; b++) {
-        var T = b >= 0 ? l[b] : m[b + x], w = this.decodeTables[g][T];
+      for (var p = n.alloc(l.length * 2), d = this.nodeIdx, m = this.prevBytes, x = this.prevBytes.length, v = -this.prevBytes.length, w, b = 0, S = 0; b < l.length; b++) {
+        var T = b >= 0 ? l[b] : m[b + x], w = this.decodeTables[d][T];
         if (!(w >= 0)) if (w === e)
           w = this.defaultCharUnicode.charCodeAt(0), b = v;
         else if (w === t) {
@@ -19701,22 +19701,22 @@ var P1 = Fc((L) => {
           var M = f(this.gb18030.gbChars, B);
           w = this.gb18030.uChars[M] + B - this.gb18030.gbChars[M];
         } else if (w <= i) {
-          g = i - w;
+          d = i - w;
           continue;
         } else if (w <= r) {
           for (var _ = this.decodeTableSeq[r - w], D = 0; D < _.length - 1; D++)
             w = _[D], p[S++] = w & 255, p[S++] = w >> 8;
           w = _[_.length - 1];
         } else
-          throw new Error("iconv-lite internal error: invalid decoding table value " + w + " at " + g + "/" + T);
+          throw new Error("iconv-lite internal error: invalid decoding table value " + w + " at " + d + "/" + T);
         if (w >= 65536) {
           w -= 65536;
           var N = 55296 | w >> 10;
           p[S++] = N & 255, p[S++] = N >> 8, w = 56320 | w & 1023;
         }
-        p[S++] = w & 255, p[S++] = w >> 8, g = 0, v = b + 1;
+        p[S++] = w & 255, p[S++] = w >> 8, d = 0, v = b + 1;
       }
-      return this.nodeIdx = g, this.prevBytes = v >= 0 ? Array.prototype.slice.call(l, v) : m.slice(v + x).concat(Array.prototype.slice.call(l)), p.slice(0, S).toString("ucs2");
+      return this.nodeIdx = d, this.prevBytes = v >= 0 ? Array.prototype.slice.call(l, v) : m.slice(v + x).concat(Array.prototype.slice.call(l)), p.slice(0, S).toString("ucs2");
     }, u.prototype.end = function() {
       for (var l = ""; this.prevBytes.length > 0; ) {
         l += this.defaultCharUnicode;
@@ -19728,11 +19728,11 @@ var P1 = Fc((L) => {
     function f(l, p) {
       if (l[0] > p)
         return -1;
-      for (var g = 0, m = l.length; g < m - 1; ) {
-        var x = g + (m - g + 1 >> 1);
-        l[x] <= p ? g = x : m = x;
+      for (var d = 0, m = l.length; d < m - 1; ) {
+        var x = d + (m - d + 1 >> 1);
+        l[x] <= p ? d = x : m = x;
       }
-      return g;
+      return d;
     }
     return ss;
   }
@@ -28418,8 +28418,25 @@ var P1 = Fc((L) => {
      * @param shape - The shape data for this character
      */
     constructor(e, t, r, i) {
-      var s;
-      super(), this.fontSize = t, this.shape = r, this.font = i, this.code = e, i.data.header.fontType === Te.BIGFONT ? this.width = this.calcWidth() : this.width = ((s = r.lastPoint) == null ? void 0 : s.x) ?? this.calcWidth();
+      super(), this.fontSize = t, this.shape = r, this.font = i, this.code = e, this.width = this.resolveAdvanceWidth(r);
+    }
+    /**
+     * Resolves horizontal advance for SHX glyphs.
+     *
+     * - Unicode / shapes fonts: prefer the pen-down end X (lastPoint), which matches
+     *   AutoCAD's advance for single-byte SHX.
+     * - Big fonts (CJK): advance is the scaled font cell width (content.width /
+     *   content.height * fontSize). Glyph bbox or lastPoint can be narrower than the
+     *   cell; using only bbox caused successive Han characters to overlap visually.
+     */
+    resolveAdvanceWidth(e) {
+      var i;
+      const t = this.calcWidth(), r = ((i = e.lastPoint) == null ? void 0 : i.x) ?? 0;
+      if (this.font.data.header.fontType === Te.BIGFONT) {
+        const { width: s, height: a } = this.font.data.content, o = a > 0 ? s / a * this.fontSize : 0;
+        return Math.max(t, r, o);
+      }
+      return r > 0 ? r : t;
     }
     calcWidth() {
       const e = this.shape.bbox;
@@ -28479,18 +28496,27 @@ var P1 = Fc((L) => {
     hasCode(e) {
       return this.font.hasChar(e);
     }
+    /**
+     * Horizontal advance for the space character (ASCII 32) at the given size.
+     * Uses the SHX glyph pen advance when defined; otherwise falls back to half the
+     * text height (common for AutoCAD SHX fonts).
+     */
+    getSpaceAdvance(e) {
+      const t = this.getCharShape(" ", e);
+      return t ? t.width : e * 0.5;
+    }
     generateShapes(e, t) {
       const r = [];
       let i = 0;
       for (let s = 0; s < e.length; s++) {
         const a = e[s];
         if (a === " ") {
-          i += t;
+          i += this.getSpaceAdvance(t);
           continue;
         }
         const o = this.getCharShape(a, t);
         if (!o) {
-          i += t, this.addUnsupportedChar(a);
+          i += this.getSpaceAdvance(t), this.addUnsupportedChar(a);
           continue;
         }
         r.push(o.offset(new fe(i, 0))), i += o.width;
@@ -28498,11 +28524,35 @@ var P1 = Fc((L) => {
       return r;
     }
     /**
-     * SHX font always has fixed scale factor 1.
-     * @returns Always return value 1
+     * Scale factor that converts AutoCAD's `TEXT.height` (cap-height in the SHX
+     * convention) into the em-box-scaled size expected by `generateShapes`.
+     *
+     * SHX glyphs are defined with `baseUp` units of cap-height (height of an
+     * uppercase letter above the baseline) and `height` units of total em-box
+     * (cap-height + descender + headroom for accents). AutoCAD's DXF group 40
+     * for TEXT/ATTRIB/MTEXT is the cap-height — the historical SHX convention
+     * since the format's introduction in AutoCAD R2 (1985), kept by AutoCAD
+     * when TrueType support was added in the early 1990s so that DWGs portable
+     * across font formats render at consistent visual sizes.
+     *
+     * Returning `1` (the previous behavior) meant SHX glyphs were rendered at
+     * `baseUp / height` of the expected size — typically ~0.75 for western
+     * fonts like `romans.shx`/`complex.shx` where `baseUp=21, height=28`.
+     * Multiplying by `height / baseUp` restores the cap-height interpretation.
+     *
+     * Mirrors the behavior already in place for mesh fonts (see
+     * `meshFontParser.ts` where `scaleFactor = unitsPerEm / glyph('A').yMax`),
+     * isolated to the glyph render path only — `mtextProcessor.currentLayoutFontSize`
+     * divides by this factor to keep layout metrics (line height, attachment
+     * offsets, blank width) on the original cap-height scale.
+     *
+     * @returns `height / baseUp` when both are populated and positive; `1`
+     *   otherwise (e.g. exotic BIGFONT/symbol fonts without standard metrics),
+     *   matching the prior behavior as a safe fallback.
      */
     getScaleFactor() {
-      return 1;
+      const { height: e, baseUp: t } = this.data.content;
+      return t > 0 && e > 0 ? e / t : 1;
     }
     /**
      * Gets the shape data for a specific character at a given size.
@@ -28999,7 +29049,7 @@ var P1 = Fc((L) => {
     const r = [];
     if (n.filter((l) => l.char !== Zn).forEach((l) => {
       const p = _1(
-        new Ee().copy(l.box).applyMatrix4(e)
+        new ke().copy(l.box).applyMatrix4(e)
       );
       p && r.push({
         type: ye.CHAR,
@@ -29019,7 +29069,7 @@ var P1 = Fc((L) => {
       }
     const h = r.slice(0, a).filter(i), c = r.slice(o + 1).filter(i), u = r.slice(a, o + 1).filter(s);
     if (u.length === 0) return [...h, ...c];
-    const f = new Ee().copy(u[0].box);
+    const f = new ke().copy(u[0].box);
     return u.slice(1).forEach((l) => f.union(l.box)), [
       ...h,
       {
@@ -29203,6 +29253,10 @@ var P1 = Fc((L) => {
     get currentWidthFactor() {
       return this._currentContext.widthFactor.value;
     }
+    /** Horizontal advance for one space, including tracking and width factor. */
+    get currentBlankAdvance() {
+      return this._currentContext.blankWidth * this.currentWordSpace * this.currentWidthFactor;
+    }
     /**
      * All of THREE.js objects in current line. It contains objects in all of sections of this line.
      */
@@ -29535,7 +29589,7 @@ var P1 = Fc((L) => {
       let a = 0;
       for (let o = 0; o < e.length; o++) {
         const h = this.getCharShape(e[o]);
-        h ? this.currentHorizontalAlignment == ce.DISTRIBUTED ? a += h.width * this.currentWidthFactor : a += h.width * this.currentWordSpace * this.currentWidthFactor : a += this._currentContext.blankWidth;
+        h ? this.currentHorizontalAlignment == ce.DISTRIBUTED ? a += h.width * this.currentWidthFactor : a += h.width * this.currentWordSpace * this.currentWidthFactor : a += this.currentBlankAdvance;
       }
       this.hOffset + a > (this.maxLineWidth || 1 / 0) && (this._vOffset <= 0 && this._currentLineObjects.length <= 0 || (this.recordVisualLineBreak(i, s), this.advanceToNextLine(!1)));
       for (let o = 0; o < e.length; o++)
@@ -29550,10 +29604,10 @@ var P1 = Fc((L) => {
     processStack(e, t, r, i, s) {
       const [a, o, h] = e, c = this._hOffset, u = this._vOffset, f = this._currentContext.charTrackingFactor.value, l = this.currentFontSize, p = this._currentContext.fontSizeScaleFactor;
       this._hOffset = c, this._currentContext.charTrackingFactor = { value: 1, isRelative: !1 };
-      let g = 0;
+      let d = 0;
       for (let b = 0; b < a.length; b++) {
         const S = this.getCharShape(a[b]);
-        S && (g += S.width * this.currentWidthFactor);
+        S && (d += S.width * this.currentWidthFactor);
       }
       this._hOffset = c;
       let m = 0;
@@ -29561,7 +29615,7 @@ var P1 = Fc((L) => {
         const S = this.getCharShape(o[b]);
         S && (m += S.width * this.currentWidthFactor);
       }
-      const x = Math.max(g, m), v = (x - g) / 2, w = (x - m) / 2;
+      const x = Math.max(d, m), v = (x - d) / 2, w = (x - m) / 2;
       if (h === "^") {
         if (this._currentContext.fontSizeScaleFactor = p * 0.7, this.calcuateLineParams(), a && !o) {
           const b = [], S = [], T = [], B = [];
@@ -29577,7 +29631,7 @@ var P1 = Fc((L) => {
               T,
               B
             );
-          t.push(...b), r.push(...S), i.push(...T), s.push(...B), this._hOffset = c + g;
+          t.push(...b), r.push(...S), i.push(...T), s.push(...B), this._hOffset = c + d;
         } else if (!a && o) {
           const b = [], S = [], T = [], B = [];
           this._hOffset = c, this._vOffset = this.convertTopAlignedVOffset(
@@ -29652,7 +29706,7 @@ var P1 = Fc((L) => {
     }
     recordStackDivider(e, t, r, i, s) {
       if (this._options.collectCharBoxes === !1) return;
-      const a = t - this.currentFontSize * 0.8 + this.defaultFontSize * Wn, o = new Ee(
+      const a = t - this.currentFontSize * 0.8 + this.defaultFontSize * Wn, o = new ke(
         new E(e, a, 0),
         new E(e + r, a, 0)
       );
@@ -29677,10 +29731,10 @@ var P1 = Fc((L) => {
     }
     processBlank(e, t) {
       if (this._options.collectCharBoxes !== !1) {
-        const r = this._hOffset, i = this.flowDirection == Mt.BOTTOM_TO_TOP ? this._vOffset : this._vOffset - this.currentLayoutFontSize, s = new Ee(
+        const r = this._hOffset, i = this.flowDirection == Mt.BOTTOM_TO_TOP ? this._vOffset : this._vOffset - this.currentLayoutFontSize, s = new ke(
           new E(r, i, 0),
           new E(
-            r + this._currentContext.blankWidth,
+            r + this.currentBlankAdvance,
             i + this.currentLayoutFontSize,
             0
           )
@@ -29697,7 +29751,7 @@ var P1 = Fc((L) => {
           children: []
         });
       }
-      this._hOffset += this._currentContext.blankWidth;
+      this._hOffset += this.currentBlankAdvance;
     }
     recordVisualLineBreak(e, t) {
       const r = this._processedCharCount + this.countFinalCharBoxes(
@@ -29723,12 +29777,15 @@ var P1 = Fc((L) => {
       this._lineHasRenderableChar || this.applyPendingEmptyLineYAdjust();
       const o = a.toGeometry();
       o.scale(this.currentWidthFactor, 1, 1);
-      let h = this._currentContext.oblique;
-      if (this._currentContext.italic && (h += 15), h) {
-        const x = h * Math.PI / 180, v = new Fe();
-        v.set(
+      const h = this.currentLayoutFontSize;
+      let c = this._currentContext.oblique;
+      this._currentContext.italic && (c += 15);
+      let u = 0;
+      if (c) {
+        const w = c * Math.PI / 180, b = new Fe();
+        b.set(
           1,
-          Math.tan(x),
+          Math.tan(w),
           0,
           0,
           0,
@@ -29743,77 +29800,79 @@ var P1 = Fc((L) => {
           0,
           0,
           1
-        ), o.applyMatrix4(v);
-      }
-      const c = this.fontManager.getFontType(this.currentFont);
-      this._currentContext.bold && c === "mesh" && o.scale(1.06, 1.06, 1), this.hOffset > (this.maxLineWidth || 1 / 0) && (this.recordVisualLineBreak(i, s), this.advanceToNextLine(!1));
-      const u = this.hOffset, f = this.flowDirection == Mt.BOTTOM_TO_TOP ? this.vOffset : this.vOffset - this.currentLayoutFontSize, l = a.width * this.currentWidthFactor, p = this.currentLayoutFontSize;
-      if (o.translate(u, f, 0), this.currentHorizontalAlignment == ce.DISTRIBUTED ? this._hOffset += a.width * this.currentWidthFactor : this._hOffset += a.width * this.currentWordSpace * this.currentWidthFactor, t.push(o), this._lineHasRenderableChar = !0, this._options.collectCharBoxes !== !1) {
+        ), o.applyMatrix4(b), u = Math.tan(w) * h;
+      }
+      const f = this.fontManager.getFontType(this.currentFont);
+      this._currentContext.bold && f === "mesh" && o.scale(1.06, 1.06, 1), this.hOffset > (this.maxLineWidth || 1 / 0) && (this.recordVisualLineBreak(i, s), this.advanceToNextLine(!1));
+      const l = this.hOffset, p = this.flowDirection == Mt.BOTTOM_TO_TOP ? this.vOffset : this.vOffset - this.currentLayoutFontSize, d = a.width * this.currentWidthFactor;
+      o.translate(l, p, 0);
+      const m = a.width * this.currentWidthFactor + u * this.currentWidthFactor;
+      if (this.currentHorizontalAlignment == ce.DISTRIBUTED ? this._hOffset += m : this._hOffset += a.width * this.currentWordSpace * this.currentWidthFactor + u * this.currentWidthFactor, t.push(o), this._lineHasRenderableChar = !0, this._options.collectCharBoxes !== !1) {
         o.userData.char = e, o.boundingBox || o.computeBoundingBox();
-        const x = new Ee().copy(o.boundingBox);
+        const w = new ke().copy(o.boundingBox);
         o instanceof mr ? (this._lastCharBoxTarget = "mesh", i.push({
           type: ye.CHAR,
-          box: x,
+          box: w,
           char: e,
           children: []
         })) : (this._lastCharBoxTarget = "line", s.push({
           type: ye.CHAR,
-          box: x,
+          box: w,
           char: e,
           children: []
         }));
       }
-      const g = p * 0.05, m = 1e-3;
+      const x = h * 0.05, v = 1e-3;
       if (this._currentContext.underline) {
-        const x = new ze(), v = f - g;
-        x.setAttribute(
+        const w = new ze(), b = p - x;
+        w.setAttribute(
           "position",
           new Ye(
             new Float32Array([
-              u,
-              v,
-              m,
-              u + l,
+              l,
+              b,
               v,
-              m
+              l + d,
+              b,
+              v
             ]),
             3
           )
-        ), x.setIndex(null), x.userData = { isDecoration: !0 }, r.push(x);
+        ), w.setIndex(null), w.userData = { isDecoration: !0 }, r.push(w);
       }
       if (this._currentContext.overline) {
-        const x = new ze(), v = f + p + g;
-        x.setAttribute(
+        const w = new ze(), b = p + h + x;
+        w.setAttribute(
           "position",
           new Ye(
             new Float32Array([
-              u,
-              v,
-              m,
-              u + l,
+              l,
+              b,
               v,
-              m
+              l + d,
+              b,
+              v
             ]),
             3
           )
-        ), x.setIndex(null), x.userData = { isDecoration: !0 }, r.push(x);
+        ), w.setIndex(null), w.userData = { isDecoration: !0 }, r.push(w);
       }
       if (this._currentContext.strikeThrough) {
-        const x = new ze(), v = f + p / 2 - p * 0.2;
-        x.setAttribute(
+        const w = new ze(), b = p + h / 2 - h * 0.2;
+        w.setAttribute(
           "position",
           new Ye(
             new Float32Array([
-              u,
-              v,
-              m,
-              u + l,
+              l,
+              b,
               v,
-              m
+              l + d,
+              b,
+              v
             ]),
             3
           )
-        ), x.setIndex(null), x.userData = { isDecoration: !0 }, r.push(x);
+        ), w.setIndex(null), w.userData = { isDecoration: !0 }, r.push(w);
       }
     }
     processLastLine() {
@@ -29946,17 +30005,15 @@ var P1 = Fc((L) => {
       }
     }
     /**
-     * In AutoCAD, the width of a regular space character (ASCII 32, the space key on the keyboard) in MText
-     * depends on the current font and text height, and is not a fixed value.
-     * Specifically:
-     * - Space width ≈ Text height × space width ratio defined by the font
-     * - For common TrueType fonts (like Arial), the space width is typically about 1/4 to 1/3 of the text height.
-     * For example, if the text height is 10 (units), the space width would be approximately 2.5 to 3.3 units.
-     * - For SHX fonts (AutoCAD's built-in vector fonts, such as txt.shx), the space width is often half the text height.
-     * So if the text height is 10, the space width is typically 5 units.
+     * Resolves horizontal advance for an ASCII space in the active font.
+     *
+     * AutoCAD uses each font's own space glyph metrics (SHX pen advance or TrueType
+     * horizontal advance). A fixed fraction of text height (e.g. 50% for SHX) is only
+     * a rough fallback when the font has no space definition.
      */
     calculateBlankWidthForFont(e, t) {
-      return this.fontManager.getFontType(e) === "shx" ? t * 0.5 : t * 0.3;
+      const r = this.fontManager.getCharShape(" ", e, t);
+      return r && r.width > 0 ? r.width : this.fontManager.getFontType(e) === "shx" ? t * 0.5 : t * 0.3;
     }
     /**
      * Convert the text shape geometries to three.js object
@@ -29970,16 +30027,16 @@ var P1 = Fc((L) => {
         o
       ), u = this._options.collectCharBoxes !== !1, f = e.filter((p) => p instanceof mr);
       if (f.length > 0) {
-        const p = f.length > 1 ? Oo(f) : f[0], g = new Hr(p, h);
-        g.userData.bboxIntersectionCheck = !0, g.userData.charBoxType = s, u && r.length > 0 && (g.userData.layout = { chars: r.slice() }), a.add(g);
+        const p = f.length > 1 ? Oo(f) : f[0], d = new Hr(p, h);
+        d.userData.bboxIntersectionCheck = !0, d.userData.charBoxType = s, u && r.length > 0 && (d.userData.layout = { chars: r.slice() }), a.add(d);
       }
       const l = [
         ...t,
         ...e.filter((p) => !(p instanceof mr))
       ];
       if (l.length > 0) {
-        const p = l.length > 1 ? Oo(l) : l[0], g = new au(p, c);
-        g.userData.bboxIntersectionCheck = !0, g.userData.charBoxType = s, u && i.length > 0 && (g.userData.layout = { chars: i.slice() }), a.add(g);
+        const p = l.length > 1 ? Oo(l) : l[0], d = new au(p, c);
+        d.userData.bboxIntersectionCheck = !0, d.userData.charBoxType = s, u && i.length > 0 && (d.userData.layout = { chars: i.slice() }), a.add(d);
       }
       return a.children.length === 1 ? a.children[0] : a;
     }
@@ -30035,7 +30092,7 @@ var P1 = Fc((L) => {
         byBlockColor: s.byBlockColor,
         layer: s.layer,
         color: s.color.copy()
-      }, this._box = new Ee(), this._layoutData = void 0, this._mtextData = e, this._fontsInStyleLoaded = !1;
+      }, this._box = new ke(), this._layoutData = void 0, this._mtextData = e, this._fontsInStyleLoaded = !1;
     }
     /**
      * Gets the font manager instance associated with this MText object.
@@ -30087,9 +30144,10 @@ var P1 = Fc((L) => {
           minY: 1 / 0,
           maxY: -1 / 0,
           minZ: 1 / 0,
-          maxZ: -1 / 0
+          maxZ: -1 / 0,
+          hasLogicalBounds: !1
         };
-        this.updateBoxFromObject(e, t), t.hasLine && (this.box.isEmpty() ? (this.box.min.set(t.minX, t.minY, t.minZ), this.box.max.set(t.maxX, t.maxY, t.maxZ)) : (this.box.min.y = Math.min(this.box.min.y, t.minY), this.box.max.y = Math.max(this.box.max.y, t.maxY))), this.add(e);
+        this.updateBoxFromObject(e, t), t.hasLine && !t.hasLogicalBounds && (this.box.isEmpty() ? (this.box.min.set(t.minX, t.minY, t.minZ), this.box.max.set(t.maxX, t.maxY, t.maxZ)) : (this.box.min.y = Math.min(this.box.min.y, t.minY), this.box.max.y = Math.max(this.box.max.y, t.maxY))), this.add(e);
       }
     }
     /**
@@ -30159,45 +30217,52 @@ var P1 = Fc((L) => {
       if (!r)
         return;
       r.matrix.decompose(qt, us, cs), e.position && (qt.x += e.position.x, qt.y += e.position.y, r.matrix.compose(qt, us, cs));
-      let s = e.width, a = i;
+      let s = e.width;
       r.updateWorldMatrix(!0, !0);
-      const o = new Ee().setFromObject(r);
-      if (!o.isEmpty()) {
-        const p = o.max.y - o.min.y;
-        Number.isFinite(p) && p > 0 && (a = p);
-      }
+      const a = new ke().setFromObject(r);
       if (!Number.isFinite(s)) {
-        const p = o.max.x - o.min.x;
+        const p = a.max.x - a.min.x;
         s = Number.isFinite(p) && p > 0 ? p : 0;
       }
-      const h = this.calculateAnchorPoint(
+      const o = this.measureAnchorMetrics(
+        r,
         s,
+        i,
         a,
-        e.attachmentPoint,
         e.drawingDirection
-      ), c = (p) => {
+      ), h = this.calculateAnchorPoint(
+        o,
+        e.attachmentPoint
+      );
+      r.userData.logicalBounds = {
+        minX: o.minX + h.x,
+        maxX: o.maxX + h.x,
+        minY: o.minY + h.y,
+        maxY: o.maxY + h.y
+      };
+      const c = (p) => {
         if (!p || p.length === 0) return;
-        const g = new E(h.x, h.y, 0), m = (x) => {
+        const d = new E(h.x, h.y, 0), m = (x) => {
           var v;
-          (v = x.box) == null || v.translate(g), x.children && x.children.length > 0 && x.children.forEach(m);
+          (v = x.box) == null || v.translate(d), x.children && x.children.length > 0 && x.children.forEach(m);
         };
         p.forEach(m);
       }, u = (p) => {
-        !p || p.length === 0 || p.forEach((g) => {
-          g.y += h.y;
+        !p || p.length === 0 || p.forEach((d) => {
+          d.y += h.y;
         });
       };
       r.traverse((p) => {
-        var g, m, x;
-        "geometry" in p ? p.geometry.translate(h.x, h.y, 0) : c(
-          (m = (g = p.userData) == null ? void 0 : g.layout) == null ? void 0 : m.chars
+        var d, m, x;
+        "geometry" in p && p.geometry.translate(h.x, h.y, 0), c(
+          (m = (d = p.userData) == null ? void 0 : d.layout) == null ? void 0 : m.chars
         ), u(
           (x = p.userData) == null ? void 0 : x.lineLayouts
         ), p.layers.enableAll();
       });
       let f = e.rotation || 0;
       if (e.directionVector) {
-        const p = e.directionVector, g = new E(p.x, p.y, p.z), m = g.clone().cross(th), x = th.angleTo(g);
+        const p = e.directionVector, d = new E(p.x, p.y, p.z), m = d.clone().cross(th), x = th.angleTo(d);
         f = m.z > 0 ? -x : x;
       }
       r.matrix.compose(qt, us, cs);
@@ -30278,54 +30343,128 @@ var P1 = Fc((L) => {
       };
     }
     /**
-     * Calculates the anchor point for text positioning based on alignment and flow direction.
-     * @param width - The width of the text
-     * @param height - The height of the text
-     * @param attachmentPoint - The attachment point for text alignment
-     * @param flowDirection - The text flow direction
-     * @returns The calculated anchor point coordinates
-     */
-    calculateAnchorPoint(e, t, r, i) {
+     * Measures the logical text frame used by attachment-point anchoring.
+     *
+     * @remarks
+     * Line-layout boxes include inter-line leading that is useful for hit testing, but
+     * that leading must not become extra padding above the first rendered line when
+     * aligning to top/middle/bottom attachment points. This method therefore prefers the
+     * visible geometry height from `geometryBox` when it is non-empty, and only falls
+     * back to `layoutHeight` when there are no measurable glyphs (e.g. empty or
+     * whitespace-only runs).
+     *
+     * @param object - Root group produced by layout; traversed for {@link LineLayout}
+     *   metadata to locate the first line baseline.
+     * @param width - Column width used for horizontal anchoring when finite and
+     *   positive; if not, horizontal extents are taken from `geometryBox`.
+     * @param layoutHeight - Total laid-out height from {@link MTextProcessor} when
+     *   geometry height is unavailable or zero.
+     * @param geometryBox - Axis-aligned bounds of rendered primitives under `object`,
+     *   typically from {@link THREE.Box3.setFromObject}.
+     * @param flowDirection - Optional flow; when {@link MTextFlowDirection.BOTTOM_TO_TOP},
+     *   the vertical frame is anchored from the geometry minimum upward.
+     * @returns Metrics consumed by {@link MText.calculateAnchorPoint}.
+     */
+    measureAnchorMetrics(e, t, r, i, s) {
+      const a = {
+        hasLine: !1,
+        minY: 1 / 0,
+        maxY: -1 / 0,
+        baselineY: 0
+      };
+      let o = !1;
+      e.traverse((m) => {
+        var v;
+        const x = (v = m.userData) == null ? void 0 : v.lineLayouts;
+        !x || x.length === 0 || x.forEach((w) => {
+          const b = w.y - w.height / 2, S = w.y + w.height / 2;
+          a.hasLine = !0, a.minY = Math.min(a.minY, b), a.maxY = Math.max(a.maxY, S), o || (a.baselineY = b, o = !0);
+        });
+      });
+      const h = i.isEmpty() ? 0 : i.max.y - i.min.y, c = Number.isFinite(h) && h > 0 ? h : Number.isFinite(r) && r > 0 ? r : 0;
+      let u = 0, f = Number.isFinite(t) && t > 0 ? t : 0;
+      f <= u && !i.isEmpty() && (u = i.min.x, f = i.max.x);
+      let l = 0, p = 0;
+      s == Mt.BOTTOM_TO_TOP ? (l = i.isEmpty() ? 0 : i.min.y, p = l + c) : (p = i.isEmpty() ? 0 : i.max.y, l = p - c);
+      const d = a.hasLine ? a.baselineY : l;
+      return { minX: u, maxX: f, minY: l, maxY: p, baselineY: d };
+    }
+    /**
+     * Computes the 2D translation that maps the logical frame described by `metrics`
+     * so that the chosen AutoCAD-style attachment point coincides with the insertion
+     * origin (before rotation/insertion-point transforms applied later in
+     * {@link MText.loadMText}).
+     *
+     * @remarks
+     * The returned vector is **added** to vertex positions and char-box metadata via
+     * `geometry.translate` / `CharBox.box.translate` / line `y` offsets. For `undefined`
+     * attachment, behavior matches {@link MTextAttachmentPoint.TopLeft}.
+     *
+     * @param metrics - Pre-anchoring frame from {@link MText.measureAnchorMetrics}.
+     * @param attachmentPoint - DWG attachment constant; determines which corner, edge
+     *   center, or baseline of the frame is pinned to `(0,0)` in anchored space.
+     * @returns Translation `(x, y)` in drawing units applied uniformly to the laid-out
+     *   group and its layout sidecars.
+     */
+    calculateAnchorPoint(e, t) {
+      const r = (e.minX + e.maxX) / 2, i = (e.minY + e.maxY) / 2;
       let s = 0, a = 0;
-      switch (r) {
+      switch (t) {
         case void 0:
         case j.TopLeft:
-          s = 0, a = 0;
+          s = -e.minX, a = -e.maxY;
           break;
         case j.TopCenter:
-          s -= e / 2, a = 0;
+          s = -r, a = -e.maxY;
           break;
         case j.TopRight:
-          s -= e, a = 0;
+          s = -e.maxX, a = -e.maxY;
           break;
         case j.MiddleLeft:
-          s = 0, a += t / 2;
+          s = -e.minX, a = -i;
           break;
         case j.MiddleCenter:
-          s -= e / 2, a += t / 2;
+          s = -r, a = -i;
           break;
         case j.MiddleRight:
-          s -= e, a += t / 2;
+          s = -e.maxX, a = -i;
           break;
         case j.BottomLeft:
-        case j.BaselineLeft:
-          s = 0, a += t;
+          s = -e.minX, a = -e.minY;
           break;
         case j.BottomCenter:
-        case j.BaselineCenter:
-          s -= e / 2, a += t;
+          s = -r, a = -e.minY;
           break;
         case j.BottomRight:
+          s = -e.maxX, a = -e.minY;
+          break;
+        case j.BaselineLeft:
+          s = -e.minX, a = -e.baselineY;
+          break;
+        case j.BaselineCenter:
+          s = -r, a = -e.baselineY;
+          break;
         case j.BaselineRight:
-          s -= e, a += t;
+          s = -e.maxX, a = -e.baselineY;
           break;
       }
-      return i == Mt.BOTTOM_TO_TOP && (a -= t), { x: s, y: a };
+      return { x: s, y: a };
     }
     /**
-     * Recursively calculates bounding boxes for an object and its children.
-     * @param object - The Three.js object to process
-     * @param boxes - Array to store the calculated bounding boxes
+     * Walks a laid-out MText subgraph and accumulates world-space character hit boxes and
+     * soft line rectangles for {@link MText.createLayoutData} (raycasting, cursors, debug).
+     *
+     * @remarks
+     * - When `userData.layout.chars` is present, entries are transformed with
+     *   {@link buildCharBoxesFromObject} and appended to `chars`, then recursion stops
+     *   for that branch (char metadata is authoritative).
+     * - When only mesh/line geometry exists, a single synthetic {@link CharBox} wrapping
+     *   the geometry AABB may be emitted.
+     * - `userData.lineLayouts` rows are converted to world-space center `y` and height.
+     *
+     * @param object - Node to traverse (typically the root group from {@link MText.loadMText}).
+     * @param chars - Output collection; receives merged {@link CharBox} entries in world space.
+     * @param lines - Output collection; receives {@link LineLayout} summaries per line break.
      */
     getLayout(e, t, r) {
       var o, h, c, u, f;
@@ -30350,7 +30489,7 @@ var P1 = Fc((L) => {
         const l = e.geometry;
         if (!((f = l.userData) != null && f.isDecoration)) {
           l.boundingBox === null && l.computeBoundingBox();
-          const p = new Ee().copy(l.boundingBox);
+          const p = new ke().copy(l.boundingBox);
           p.applyMatrix4(e.matrixWorld), t.push({
             type: ye.CHAR,
             box: p,
@@ -30363,36 +30502,67 @@ var P1 = Fc((L) => {
       for (let l = 0, p = a.length; l < p; l++)
         this.getLayout(a[l], t, r);
     }
+    /**
+     * Depth-first union of this MText’s {@link MText.box} from layout metadata and mesh
+     * geometry, while optionally tracking coarse line AABB in `lineBounds`.
+     *
+     * @remarks
+     * Priority order per node:
+     * 1. If `userData.logicalBounds` exists (set in {@link MText.loadMText}), union that
+     *    axis-aligned rectangle transformed by `matrixWorld` — this reflects anchored
+     *    logical extents even when individual glyphs are expensive to union.
+     * 2. Else if `userData.lineLayouts` exists, expand `lineBounds` from the world-space
+     *    top/bottom of each line strip (used as a fallback when no logical bounds were
+     *    written, e.g. legacy paths).
+     * 3. Else if `userData.layout.chars` exists, union each transformed char AABB.
+     * 4. Else for mesh/line primitives, union non-decoration geometry bounds.
+     * 5. Always recurse into children.
+     *
+     * @param object - Current scene graph node.
+     * @param lineBounds - Mutable accumulator: `hasLine`/`min*`/`max*` track the union of
+     *   line-layout strips in world space; `hasLogicalBounds` flips true when any child
+     *   contributed `logicalBounds` so {@link MText.syncDraw} can avoid double-counting
+     *   vertical extent from line strips alone.
+     */
     updateBoxFromObject(e, t) {
-      var a, o, h, c, u;
+      var o, h, c, u, f, l;
       e.updateWorldMatrix(!1, !1);
-      const r = (a = e.userData) == null ? void 0 : a.lineLayouts;
-      r && r.length > 0 && r.forEach((f) => {
-        pt.set(0, f.y - f.height / 2, 0).applyMatrix4(e.matrixWorld), dt.set(0, f.y + f.height / 2, 0).applyMatrix4(e.matrixWorld), t.hasLine = !0, t.minX = Math.min(t.minX, pt.x, dt.x), t.maxX = Math.max(t.maxX, pt.x, dt.x), t.minY = Math.min(t.minY, pt.y, dt.y), t.maxY = Math.max(t.maxY, pt.y, dt.y), t.minZ = Math.min(t.minZ, pt.z, dt.z), t.maxZ = Math.max(t.maxZ, pt.z, dt.z);
+      const r = (o = e.userData) == null ? void 0 : o.logicalBounds;
+      if (r) {
+        t.hasLogicalBounds = !0;
+        const p = new ke(
+          new E(r.minX, r.minY, 0),
+          new E(r.maxX, r.maxY, 0)
+        );
+        p.applyMatrix4(e.matrixWorld), this.box.union(p);
+      }
+      const i = (h = e.userData) == null ? void 0 : h.lineLayouts;
+      i && i.length > 0 && i.forEach((p) => {
+        pt.set(0, p.y - p.height / 2, 0).applyMatrix4(e.matrixWorld), dt.set(0, p.y + p.height / 2, 0).applyMatrix4(e.matrixWorld), t.hasLine = !0, t.minX = Math.min(t.minX, pt.x, dt.x), t.maxX = Math.max(t.maxX, pt.x, dt.x), t.minY = Math.min(t.minY, pt.y, dt.y), t.maxY = Math.max(t.maxY, pt.y, dt.y), t.minZ = Math.min(t.minZ, pt.z, dt.z), t.maxZ = Math.max(t.maxZ, pt.z, dt.z);
       });
-      const i = (h = (o = e.userData) == null ? void 0 : o.layout) == null ? void 0 : h.chars;
-      if (i && i.length > 0) {
-        const f = (c = e.userData) == null ? void 0 : c.charBoxType;
+      const s = (u = (c = e.userData) == null ? void 0 : c.layout) == null ? void 0 : u.chars;
+      if (s && s.length > 0) {
+        const p = (f = e.userData) == null ? void 0 : f.charBoxType;
         Ko(
-          i,
+          s,
           e.matrixWorld,
-          f
-        ).forEach((p) => {
-          p.box && this.box.union(p.box);
+          p
+        ).forEach((m) => {
+          m.box && this.box.union(m.box);
         });
         return;
       }
       if (e instanceof jn || e instanceof Hr) {
-        const f = e.geometry;
-        if (!((u = f.userData) != null && u.isDecoration)) {
-          f.boundingBox === null && f.computeBoundingBox();
-          const l = new Ee().copy(f.boundingBox);
-          l.applyMatrix4(e.matrixWorld), this.box.union(l);
+        const p = e.geometry;
+        if (!((l = p.userData) != null && l.isDecoration)) {
+          p.boundingBox === null && p.computeBoundingBox();
+          const d = new ke().copy(p.boundingBox);
+          d.applyMatrix4(e.matrixWorld), this.box.union(d);
         }
       }
-      const s = e.children;
-      for (let f = 0, l = s.length; f < l; f++)
-        this.updateBoxFromObject(s[f], t);
+      const a = e.children;
+      for (let p = 0, d = a.length; p < d; p++)
+        this.updateBoxFromObject(a[p], t);
     }
     /**
      * Remove the specified object from its parent and release geometry and material resource used
@@ -30418,6 +30588,13 @@ var P1 = Fc((L) => {
         }
       });
     }
+    /**
+     * Normalizes a font file reference to the lowercase stem used by
+     * {@link FontManager.loadFontsByNames} (strip extension).
+     *
+     * @param fontFileName - Style font path such as `arial.ttf` or extension-less name.
+     * @returns Lowercase name without the last extension segment, or `undefined` if empty.
+     */
     getFontName(e) {
       if (e) {
         const t = e.lastIndexOf(".");
@@ -30568,14 +30745,14 @@ var P1 = Fc((L) => {
         if (h instanceof ze) {
           const u = r.matrixWorld.clone(), f = new E(), l = new zt(), p = new E();
           u.decompose(f, l, p);
-          const g = {};
+          const d = {};
           h.attributes && Object.keys(h.attributes).forEach((w) => {
             const b = h.attributes[w], B = new Uint8Array(
               b.array.buffer,
               b.array.byteOffset,
               b.array.byteLength
             ).slice().buffer;
-            t.push(B), g[w] = {
+            t.push(B), d[w] = {
               arrayBuffer: B,
               byteOffset: 0,
               // Since we copied, offset is 0
@@ -30624,7 +30801,7 @@ var P1 = Fc((L) => {
               z: p.z
             },
             geometry: {
-              attributes: g,
+              attributes: d,
               index: m
             },
             material: x,