iflow-engine-base 2.1.4 → 2.1.5

package/dist/bim-engine-sdk.es.js

@@ -1,5 +1,5 @@
 import * as M from "three";
-import { Controls as Ya, Vector3 as J, MOUSE as gn, TOUCH as dn, Quaternion as Ni, Spherical as vr, Vector2 as de, Ray as rr, Plane as Xi, MathUtils as or, Mesh as ar, OrthographicCamera as Vo, BufferGeometry as Zi, Float32BufferAttribute as br, ShaderMaterial as tt, UniformsUtils as nt, WebGLRenderTarget as Vn, HalfFloatType as _t, NoBlending as ze, Clock as Ka, Color as st, Matrix4 as Me, DataTexture as lr, RepeatWrapping as vt, MeshNormalMaterial as Ho, AddEquation as fn, ZeroFactor as pn, DstAlphaFactor as Bs, DstColorFactor as Ns, CustomBlending as jo, DepthTexture as Go, DepthStencilFormat as Wo, UnsignedInt248Type as Xo, NearestFilter as xn, RGBAFormat as $a, UnsignedByteType as Ja, RedFormat as Qa, FloatType as Ci, RawShaderMaterial as el, ColorManagement as Fi, SRGBTransfer as tl, LinearToneMapping as nl, ReinhardToneMapping as il, CineonToneMapping as sl, ACESFilmicToneMapping as rl, AgXToneMapping as ol, NeutralToneMapping as al, CustomToneMapping as ll, Loader as Zo, FileLoader as Ui, SRGBColorSpace as Lt, LinearSRGBColorSpace as rt, BufferAttribute as ut, InterleavedBuffer as qo, InterleavedBufferAttribute as Yo, TrianglesDrawMode as cl, TriangleFanDrawMode as Fs, TriangleStripDrawMode as Ko, LoaderUtils as Nn, MeshPhysicalMaterial as ft, SpotLight as hl, PointLight as ul, DirectionalLight as dl, InstancedMesh as fl, InstancedBufferAttribute as pl, Object3D as $o, TextureLoader as ml, ImageBitmapLoader as gl, LinearMipmapLinearFilter as Jo, NearestMipmapLinearFilter as yl, LinearMipmapNearestFilter as wl, NearestMipmapNearestFilter as xl, LinearFilter as Hn, MirroredRepeatWrapping as _l, ClampToEdgeWrapping as vl, PointsMaterial as bl, Material as ns, LineBasicMaterial as Ml, MeshStandardMaterial as Qo, DoubleSide as qi, MeshBasicMaterial as On, PropertyBinding as Sl, SkinnedMesh as Tl, LineSegments as El, Line as Al, LineLoop as Cl, Points as Pl, Group as is, PerspectiveCamera as Rl, Skeleton as Dl, AnimationClip as kl, Bone as Il, InterpolateDiscrete as Ll, InterpolateLinear as ea, Texture as Mr, VectorKeyframeTrack as Sr, NumberKeyframeTrack as Tr, QuaternionKeyframeTrack as Er, FrontSide as Us, Interpolant as zl, Box3 as ot, Sphere as Ol, DataTextureLoader as Bl, DataUtils as qn, Line3 as Ke, Triangle as Ve, BackSide as Nl, REVISION as ta, Vector4 as en, Matrix3 as Fl } from "three";
+import { Controls as Ya, Vector3 as J, MOUSE as gn, TOUCH as dn, Quaternion as Ni, Spherical as vr, Vector2 as de, Ray as rr, Plane as Xi, MathUtils as or, Mesh as ar, OrthographicCamera as Vo, BufferGeometry as Zi, Float32BufferAttribute as br, ShaderMaterial as tt, UniformsUtils as nt, WebGLRenderTarget as Vn, HalfFloatType as _t, NoBlending as ze, Clock as Ka, Color as st, Matrix4 as Me, DataTexture as lr, RepeatWrapping as vt, MeshNormalMaterial as Ho, AddEquation as fn, ZeroFactor as pn, DstAlphaFactor as Bs, DstColorFactor as Ns, CustomBlending as jo, DepthTexture as Go, DepthStencilFormat as Wo, UnsignedInt248Type as Xo, NearestFilter as xn, RGBAFormat as $a, UnsignedByteType as Ja, RedFormat as Qa, FloatType as Ci, RawShaderMaterial as el, ColorManagement as Fi, SRGBTransfer as tl, LinearToneMapping as nl, ReinhardToneMapping as il, CineonToneMapping as sl, ACESFilmicToneMapping as rl, AgXToneMapping as ol, NeutralToneMapping as al, CustomToneMapping as ll, Loader as Zo, FileLoader as Ui, SRGBColorSpace as Lt, LinearSRGBColorSpace as rt, BufferAttribute as ut, InterleavedBuffer as qo, InterleavedBufferAttribute as Yo, TrianglesDrawMode as cl, TriangleFanDrawMode as Fs, TriangleStripDrawMode as Ko, LoaderUtils as Nn, MeshPhysicalMaterial as ft, SpotLight as hl, PointLight as ul, DirectionalLight as dl, InstancedMesh as fl, InstancedBufferAttribute as pl, Object3D as $o, TextureLoader as ml, ImageBitmapLoader as gl, LinearMipmapLinearFilter as Jo, NearestMipmapLinearFilter as yl, LinearMipmapNearestFilter as wl, NearestMipmapNearestFilter as xl, LinearFilter as Hn, MirroredRepeatWrapping as _l, ClampToEdgeWrapping as vl, PointsMaterial as bl, Material as ns, LineBasicMaterial as Ml, MeshStandardMaterial as Qo, DoubleSide as qi, MeshBasicMaterial as On, PropertyBinding as Sl, SkinnedMesh as Tl, LineSegments as El, Line as Al, LineLoop as Cl, Points as Pl, Group as is, PerspectiveCamera as Dl, Skeleton as Rl, AnimationClip as kl, Bone as Il, InterpolateDiscrete as Ll, InterpolateLinear as ea, Texture as Mr, VectorKeyframeTrack as Sr, NumberKeyframeTrack as Tr, QuaternionKeyframeTrack as Er, FrontSide as Us, Interpolant as zl, Box3 as ot, Sphere as Ol, DataTextureLoader as Bl, DataUtils as qn, Line3 as Ke, Triangle as Ve, BackSide as Nl, REVISION as ta, Vector4 as en, Matrix3 as Fl } from "three";
 class Ul {
   engine;
   scene;
@@ -1144,7 +1144,7 @@ function hr(o) {
         Z: I[0].Z * 0.5 + I[1].Z * 0.5
       });
     });
-    let E = [...v[2].map((I) => I[0]), ...C], P = "face", A = [], R = [], z = 10;
+    let E = [...v[2].map((I) => I[0]), ...C], P = "face", A = [], D = [], z = 10;
     if (E.forEach((I) => {
       if (I != null) {
         let U = new M.Vector3(I.X, I.Z, -I.Y), F = o.worldToScreen.worldToScreen(U), K = Math.sqrt(Math.pow(F.x - g.offsetX, 2) + Math.pow(F.y - g.offsetY, 2));
@@ -1159,7 +1159,7 @@ function hr(o) {
         let U = new M.Vector3(I[0].X, I[0].Z, -I[0].Y), F = new M.Vector3(I[1].X, I[1].Z, -I[1].Y), K = o.worldToScreen.worldToScreen(U), H = o.worldToScreen.worldToScreen(F), Y = T(new M.Vector2(g.offsetX, g.offsetY), K, H);
         if (Y < z) {
           let N = k(new M.Vector2(g.offsetX, g.offsetY), K, H), O = b(N, U, F);
-          R.push({
+          D.push({
             distance: Y,
             point: O,
             pointxy: o.worldToScreen.worldToScreen(O),
@@ -1168,7 +1168,7 @@ function hr(o) {
           });
         }
       }
-    }), R.length > 0 && (R.sort((I, U) => I.distance - U.distance), P = "line")), P == "point" && e.options.showCatch) {
+    }), D.length > 0 && (D.sort((I, U) => I.distance - U.distance), P = "line")), P == "point" && e.options.showCatch) {
       const I = new Fe(o.camera, o.renderer, o.scene).worldToScreen(A[0].point);
       o.catchSvg.innerHTML = "";
       const U = I.x + o.reactBoundingClientRect.left, F = I.y + o.reactBoundingClientRect.top;
@@ -1176,11 +1176,11 @@ function hr(o) {
       const K = document.createElementNS("http://www.w3.org/2000/svg", "polygon");
       K.setAttribute("class", "catchPoint"), K.setAttribute("points", `${U},${F - 8} ${U - 7},${F + 4} ${U + 7},${F + 4}`), o.catchSvg.appendChild(K), y[0].point = A[0].point;
     } else if (P == "line" && e.options.showCatch) {
-      o.worldToScreen.worldToScreen(R[0].point);
-      const I = R[0].start, U = R[0].end;
+      o.worldToScreen.worldToScreen(D[0].point);
+      const I = D[0].start, U = D[0].end;
       o.catchSvg.innerHTML = "";
       const F = document.createElementNS("http://www.w3.org/2000/svg", "line");
-      F.setAttribute("class", "catchLine"), F.setAttribute("x1", (I.x + o.reactBoundingClientRect.left).toString()), F.setAttribute("y1", (I.y + o.reactBoundingClientRect.top).toString()), F.setAttribute("x2", (U.x + o.reactBoundingClientRect.left).toString()), F.setAttribute("y2", (U.y + o.reactBoundingClientRect.top).toString()), F.setAttribute("stroke", "rgb(8, 223, 215)"), F.setAttribute("stroke-width", "2"), o.catchSvg.appendChild(F), y[0].point = R[0].point;
+      F.setAttribute("class", "catchLine"), F.setAttribute("x1", (I.x + o.reactBoundingClientRect.left).toString()), F.setAttribute("y1", (I.y + o.reactBoundingClientRect.top).toString()), F.setAttribute("x2", (U.x + o.reactBoundingClientRect.left).toString()), F.setAttribute("y2", (U.y + o.reactBoundingClientRect.top).toString()), F.setAttribute("stroke", "rgb(8, 223, 215)"), F.setAttribute("stroke-width", "2"), o.catchSvg.appendChild(F), y[0].point = D[0].point;
     } else if (P == "face" && e.options.showCatch) {
       let I = y[0].point.clone(), U = y[0].normal || (y[0].face ? y[0].face.normal : null);
       const F = (U ? U.clone() : new M.Vector3(0, 0, 1)).normalize(), K = Math.abs(F.y) < 0.9 ? new M.Vector3(0, 1, 0) : new M.Vector3(1, 0, 0), H = new M.Vector3().crossVectors(F, K).normalize(), Y = new M.Vector3().crossVectors(F, H).normalize(), N = 0.05, ee = [
@@ -1464,7 +1464,7 @@ class Pi extends tn {
     this.material.dispose(), this._fsQuad.dispose();
   }
 }
-class Rr extends tn {
+class Dr extends tn {
   /**
    * Constructs a new mask pass.
    *
@@ -1596,7 +1596,7 @@ class cc {
           }
           this.swapBuffers();
         }
-        Rr !== void 0 && (r instanceof Rr ? n = !0 : r instanceof lc && (n = !1));
+        Dr !== void 0 && (r instanceof Dr ? n = !0 : r instanceof lc && (n = !1));
       }
     }
     this.renderer.setRenderTarget(t);
@@ -2329,13 +2329,13 @@ class sa {
     const r = 0.5 * (Math.sqrt(3) - 1), a = (e + t) * r, l = Math.floor(e + a), h = Math.floor(t + a), c = (3 - Math.sqrt(3)) / 6, d = (l + h) * c, m = l - d, p = h - d, f = e - m, u = t - p;
     let g, y;
     f > u ? (g = 1, y = 0) : (g = 0, y = 1);
-    const w = f - g + c, x = u - y + c, _ = f - 1 + 2 * c, v = u - 1 + 2 * c, C = l & 255, E = h & 255, P = this.perm[C + this.perm[E]] % 12, A = this.perm[C + g + this.perm[E + y]] % 12, R = this.perm[C + 1 + this.perm[E + 1]] % 12;
+    const w = f - g + c, x = u - y + c, _ = f - 1 + 2 * c, v = u - 1 + 2 * c, C = l & 255, E = h & 255, P = this.perm[C + this.perm[E]] % 12, A = this.perm[C + g + this.perm[E + y]] % 12, D = this.perm[C + 1 + this.perm[E + 1]] % 12;
     let z = 0.5 - f * f - u * u;
     z < 0 ? n = 0 : (z *= z, n = z * z * this._dot(this.grad3[P], f, u));
     let T = 0.5 - w * w - x * x;
     T < 0 ? i = 0 : (T *= T, i = T * T * this._dot(this.grad3[A], w, x));
     let k = 0.5 - _ * _ - v * v;
-    return k < 0 ? s = 0 : (k *= k, s = k * k * this._dot(this.grad3[R], _, v)), 70 * (n + i + s);
+    return k < 0 ? s = 0 : (k *= k, s = k * k * this._dot(this.grad3[D], _, v)), 70 * (n + i + s);
   }
   /**
    * A 3D simplex noise method.
@@ -2348,9 +2348,9 @@ class sa {
   noise3d(e, t, n) {
     let i, s, r, a;
     const h = (e + t + n) * 0.3333333333333333, c = Math.floor(e + h), d = Math.floor(t + h), m = Math.floor(n + h), p = 1 / 6, f = (c + d + m) * p, u = c - f, g = d - f, y = m - f, w = e - u, x = t - g, _ = n - y;
-    let v, C, E, P, A, R;
-    w >= x ? x >= _ ? (v = 1, C = 0, E = 0, P = 1, A = 1, R = 0) : w >= _ ? (v = 1, C = 0, E = 0, P = 1, A = 0, R = 1) : (v = 0, C = 0, E = 1, P = 1, A = 0, R = 1) : x < _ ? (v = 0, C = 0, E = 1, P = 0, A = 1, R = 1) : w < _ ? (v = 0, C = 1, E = 0, P = 0, A = 1, R = 1) : (v = 0, C = 1, E = 0, P = 1, A = 1, R = 0);
-    const z = w - v + p, T = x - C + p, k = _ - E + p, b = w - P + 2 * p, I = x - A + 2 * p, U = _ - R + 2 * p, F = w - 1 + 3 * p, K = x - 1 + 3 * p, H = _ - 1 + 3 * p, Y = c & 255, N = d & 255, O = m & 255, te = this.perm[Y + this.perm[N + this.perm[O]]] % 12, ee = this.perm[Y + v + this.perm[N + C + this.perm[O + E]]] % 12, q = this.perm[Y + P + this.perm[N + A + this.perm[O + R]]] % 12, ce = this.perm[Y + 1 + this.perm[N + 1 + this.perm[O + 1]]] % 12;
+    let v, C, E, P, A, D;
+    w >= x ? x >= _ ? (v = 1, C = 0, E = 0, P = 1, A = 1, D = 0) : w >= _ ? (v = 1, C = 0, E = 0, P = 1, A = 0, D = 1) : (v = 0, C = 0, E = 1, P = 1, A = 0, D = 1) : x < _ ? (v = 0, C = 0, E = 1, P = 0, A = 1, D = 1) : w < _ ? (v = 0, C = 1, E = 0, P = 0, A = 1, D = 1) : (v = 0, C = 1, E = 0, P = 1, A = 1, D = 0);
+    const z = w - v + p, T = x - C + p, k = _ - E + p, b = w - P + 2 * p, I = x - A + 2 * p, U = _ - D + 2 * p, F = w - 1 + 3 * p, K = x - 1 + 3 * p, H = _ - 1 + 3 * p, Y = c & 255, N = d & 255, O = m & 255, te = this.perm[Y + this.perm[N + this.perm[O]]] % 12, ee = this.perm[Y + v + this.perm[N + C + this.perm[O + E]]] % 12, q = this.perm[Y + P + this.perm[N + A + this.perm[O + D]]] % 12, ce = this.perm[Y + 1 + this.perm[N + 1 + this.perm[O + 1]]] % 12;
     let pe = 0.6 - w * w - x * x - _ * _;
     pe < 0 ? i = 0 : (pe *= pe, i = pe * pe * this._dot3(this.grad3[te], w, x, _));
     let se = 0.6 - z * z - T * T - k * k;
@@ -2372,13 +2372,13 @@ class sa {
   noise4d(e, t, n, i) {
     const s = this.grad4, r = this.simplex, a = this.perm, l = (Math.sqrt(5) - 1) / 4, h = (5 - Math.sqrt(5)) / 20;
     let c, d, m, p, f;
-    const u = (e + t + n + i) * l, g = Math.floor(e + u), y = Math.floor(t + u), w = Math.floor(n + u), x = Math.floor(i + u), _ = (g + y + w + x) * h, v = g - _, C = y - _, E = w - _, P = x - _, A = e - v, R = t - C, z = n - E, T = i - P, k = A > R ? 32 : 0, b = A > z ? 16 : 0, I = R > z ? 8 : 0, U = A > T ? 4 : 0, F = R > T ? 2 : 0, K = z > T ? 1 : 0, H = k + b + I + U + F + K, Y = r[H][0] >= 3 ? 1 : 0, N = r[H][1] >= 3 ? 1 : 0, O = r[H][2] >= 3 ? 1 : 0, te = r[H][3] >= 3 ? 1 : 0, ee = r[H][0] >= 2 ? 1 : 0, q = r[H][1] >= 2 ? 1 : 0, ce = r[H][2] >= 2 ? 1 : 0, pe = r[H][3] >= 2 ? 1 : 0, se = r[H][0] >= 1 ? 1 : 0, oe = r[H][1] >= 1 ? 1 : 0, ue = r[H][2] >= 1 ? 1 : 0, me = r[H][3] >= 1 ? 1 : 0, Te = A - Y + h, Ie = R - N + h, S = z - O + h, W = T - te + h, G = A - ee + 2 * h, L = R - q + 2 * h, D = z - ce + 2 * h, B = T - pe + 2 * h, X = A - se + 3 * h, Z = R - oe + 3 * h, V = z - ue + 3 * h, $ = T - me + 3 * h, ne = A - 1 + 4 * h, Q = R - 1 + 4 * h, ie = z - 1 + 4 * h, he = T - 1 + 4 * h, ae = g & 255, Ee = y & 255, Je = w & 255, De = x & 255, Bt = a[ae + a[Ee + a[Je + a[De]]]] % 32, ye = a[ae + Y + a[Ee + N + a[Je + O + a[De + te]]]] % 32, sn = a[ae + ee + a[Ee + q + a[Je + ce + a[De + pe]]]] % 32, Mn = a[ae + se + a[Ee + oe + a[Je + ue + a[De + me]]]] % 32, Qe = a[ae + 1 + a[Ee + 1 + a[Je + 1 + a[De + 1]]]] % 32;
-    let Tt = 0.6 - A * A - R * R - z * z - T * T;
-    Tt < 0 ? c = 0 : (Tt *= Tt, c = Tt * Tt * this._dot4(s[Bt], A, R, z, T));
+    const u = (e + t + n + i) * l, g = Math.floor(e + u), y = Math.floor(t + u), w = Math.floor(n + u), x = Math.floor(i + u), _ = (g + y + w + x) * h, v = g - _, C = y - _, E = w - _, P = x - _, A = e - v, D = t - C, z = n - E, T = i - P, k = A > D ? 32 : 0, b = A > z ? 16 : 0, I = D > z ? 8 : 0, U = A > T ? 4 : 0, F = D > T ? 2 : 0, K = z > T ? 1 : 0, H = k + b + I + U + F + K, Y = r[H][0] >= 3 ? 1 : 0, N = r[H][1] >= 3 ? 1 : 0, O = r[H][2] >= 3 ? 1 : 0, te = r[H][3] >= 3 ? 1 : 0, ee = r[H][0] >= 2 ? 1 : 0, q = r[H][1] >= 2 ? 1 : 0, ce = r[H][2] >= 2 ? 1 : 0, pe = r[H][3] >= 2 ? 1 : 0, se = r[H][0] >= 1 ? 1 : 0, oe = r[H][1] >= 1 ? 1 : 0, ue = r[H][2] >= 1 ? 1 : 0, me = r[H][3] >= 1 ? 1 : 0, Te = A - Y + h, Ie = D - N + h, S = z - O + h, W = T - te + h, G = A - ee + 2 * h, L = D - q + 2 * h, R = z - ce + 2 * h, B = T - pe + 2 * h, X = A - se + 3 * h, Z = D - oe + 3 * h, V = z - ue + 3 * h, $ = T - me + 3 * h, ne = A - 1 + 4 * h, Q = D - 1 + 4 * h, ie = z - 1 + 4 * h, he = T - 1 + 4 * h, ae = g & 255, Ee = y & 255, Je = w & 255, Re = x & 255, Bt = a[ae + a[Ee + a[Je + a[Re]]]] % 32, ye = a[ae + Y + a[Ee + N + a[Je + O + a[Re + te]]]] % 32, sn = a[ae + ee + a[Ee + q + a[Je + ce + a[Re + pe]]]] % 32, Mn = a[ae + se + a[Ee + oe + a[Je + ue + a[Re + me]]]] % 32, Qe = a[ae + 1 + a[Ee + 1 + a[Je + 1 + a[Re + 1]]]] % 32;
+    let Tt = 0.6 - A * A - D * D - z * z - T * T;
+    Tt < 0 ? c = 0 : (Tt *= Tt, c = Tt * Tt * this._dot4(s[Bt], A, D, z, T));
     let Nt = 0.6 - Te * Te - Ie * Ie - S * S - W * W;
     Nt < 0 ? d = 0 : (Nt *= Nt, d = Nt * Nt * this._dot4(s[ye], Te, Ie, S, W));
-    let Ft = 0.6 - G * G - L * L - D * D - B * B;
-    Ft < 0 ? m = 0 : (Ft *= Ft, m = Ft * Ft * this._dot4(s[sn], G, L, D, B));
+    let Ft = 0.6 - G * G - L * L - R * R - B * B;
+    Ft < 0 ? m = 0 : (Ft *= Ft, m = Ft * Ft * this._dot4(s[sn], G, L, R, B));
     let Ut = 0.6 - X * X - Z * Z - V * V - $ * $;
     Ut < 0 ? p = 0 : (Ut *= Ut, p = Ut * Ut * this._dot4(s[Mn], X, Z, V, $));
     let Et = 0.6 - ne * ne - Q * Q - ie * ie - he * he;
@@ -3490,9 +3490,9 @@ function si(o) {
   throw new Error('Could not dynamically require "' + o + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
 var os = { exports: {} };
-var Dr;
+var Rr;
 function wc() {
-  return Dr || (Dr = 1, (function(o, e) {
+  return Rr || (Rr = 1, (function(o, e) {
     (function(t) {
       o.exports = t();
     })(function() {
@@ -3607,7 +3607,7 @@ function wc() {
           return g;
         }
         function r(p, f, u, g, y, w) {
-          var x, _, v = p.file, C = p.compression, E = w !== h.utf8encode, P = a.transformTo("string", w(v.name)), A = a.transformTo("string", h.utf8encode(v.name)), R = v.comment, z = a.transformTo("string", w(R)), T = a.transformTo("string", h.utf8encode(R)), k = A.length !== v.name.length, b = T.length !== R.length, I = "", U = "", F = "", K = v.dir, H = v.date, Y = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+          var x, _, v = p.file, C = p.compression, E = w !== h.utf8encode, P = a.transformTo("string", w(v.name)), A = a.transformTo("string", h.utf8encode(v.name)), D = v.comment, z = a.transformTo("string", w(D)), T = a.transformTo("string", h.utf8encode(D)), k = A.length !== v.name.length, b = T.length !== D.length, I = "", U = "", F = "", K = v.dir, H = v.date, Y = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
           f && !u || (Y.crc32 = p.crc32, Y.compressedSize = p.compressedSize, Y.uncompressedSize = p.uncompressedSize);
           var N = 0;
           f && (N |= 8), E || !k && !b || (N |= 2048);
@@ -3789,13 +3789,13 @@ function wc() {
         } };
       }, {}], 15: [function(t, n, i) {
         function s(v, C, E) {
-          var P, A = a.getTypeOf(C), R = a.extend(E || {}, c);
-          R.date = R.date || /* @__PURE__ */ new Date(), R.compression !== null && (R.compression = R.compression.toUpperCase()), typeof R.unixPermissions == "string" && (R.unixPermissions = parseInt(R.unixPermissions, 8)), R.unixPermissions && 16384 & R.unixPermissions && (R.dir = !0), R.dosPermissions && 16 & R.dosPermissions && (R.dir = !0), R.dir && (v = y(v)), R.createFolders && (P = g(v)) && w.call(this, P, !0);
-          var z = A === "string" && R.binary === !1 && R.base64 === !1;
-          E && E.binary !== void 0 || (R.binary = !z), (C instanceof d && C.uncompressedSize === 0 || R.dir || !C || C.length === 0) && (R.base64 = !1, R.binary = !0, C = "", R.compression = "STORE", A = "string");
+          var P, A = a.getTypeOf(C), D = a.extend(E || {}, c);
+          D.date = D.date || /* @__PURE__ */ new Date(), D.compression !== null && (D.compression = D.compression.toUpperCase()), typeof D.unixPermissions == "string" && (D.unixPermissions = parseInt(D.unixPermissions, 8)), D.unixPermissions && 16384 & D.unixPermissions && (D.dir = !0), D.dosPermissions && 16 & D.dosPermissions && (D.dir = !0), D.dir && (v = y(v)), D.createFolders && (P = g(v)) && w.call(this, P, !0);
+          var z = A === "string" && D.binary === !1 && D.base64 === !1;
+          E && E.binary !== void 0 || (D.binary = !z), (C instanceof d && C.uncompressedSize === 0 || D.dir || !C || C.length === 0) && (D.base64 = !1, D.binary = !0, C = "", D.compression = "STORE", A = "string");
           var T = null;
-          T = C instanceof d || C instanceof l ? C : f.isNode && f.isStream(C) ? new u(v, C) : a.prepareContent(v, C, R.binary, R.optimizedBinaryString, R.base64);
-          var k = new m(v, T, R);
+          T = C instanceof d || C instanceof l ? C : f.isNode && f.isStream(C) ? new u(v, C) : a.prepareContent(v, C, D.binary, D.optimizedBinaryString, D.base64);
+          var k = new m(v, T, D);
           this.files[v] = k;
         }
         var r = t("./utf8"), a = t("./utils"), l = t("./stream/GenericWorker"), h = t("./stream/StreamHelper"), c = t("./defaults"), d = t("./compressedObject"), m = t("./zipObject"), p = t("./generate"), f = t("./nodejsUtils"), u = t("./nodejs/NodejsStreamInputAdapter"), g = function(v) {
@@ -3824,16 +3824,16 @@ function wc() {
           if (arguments.length !== 1) return v = this.root + v, s.call(this, v, C, E), this;
           if (x(v)) {
             var P = v;
-            return this.filter(function(R, z) {
-              return !z.dir && P.test(R);
+            return this.filter(function(D, z) {
+              return !z.dir && P.test(D);
             });
           }
           var A = this.files[this.root + v];
           return A && !A.dir ? A : null;
         }, folder: function(v) {
           if (!v) return this;
-          if (x(v)) return this.filter(function(A, R) {
-            return R.dir && v.test(A);
+          if (x(v)) return this.filter(function(A, D) {
+            return D.dir && v.test(A);
           });
           var C = this.root + v, E = w.call(this, C), P = this.clone();
           return P.root = E.name, P;
@@ -3841,8 +3841,8 @@ function wc() {
           v = this.root + v;
           var C = this.files[v];
           if (C || (v.slice(-1) !== "/" && (v += "/"), C = this.files[v]), C && !C.dir) delete this.files[v];
-          else for (var E = this.filter(function(A, R) {
-            return R.name.slice(0, v.length) === v;
+          else for (var E = this.filter(function(A, D) {
+            return D.name.slice(0, v.length) === v;
           }), P = 0; P < E.length; P++) delete this.files[E[P].name];
           return this;
         }, generate: function() {
@@ -4099,7 +4099,7 @@ function wc() {
                       return s.transformTo(E, P);
                   }
                 })(_, (function(E, P) {
-                  var A, R = 0, z = null, T = 0;
+                  var A, D = 0, z = null, T = 0;
                   for (A = 0; A < P.length; A++) T += P[A].length;
                   switch (E) {
                     case "string":
@@ -4107,7 +4107,7 @@ function wc() {
                     case "array":
                       return Array.prototype.concat.apply([], P);
                     case "uint8array":
-                      for (z = new Uint8Array(T), A = 0; A < P.length; A++) z.set(P[A], R), R += P[A].length;
+                      for (z = new Uint8Array(T), A = 0; A < P.length; A++) z.set(P[A], D), D += P[A].length;
                       return z;
                     case "nodebuffer":
                       return Buffer.concat(P);
@@ -4653,8 +4653,8 @@ function wc() {
           if (!x) return this.resolve([]);
           for (var v = new Array(x), C = 0, E = -1, P = new this(r); ++E < x; ) A(y[E], E);
           return P;
-          function A(R, z) {
-            w.resolve(R).then(function(T) {
+          function A(D, z) {
+            w.resolve(D).then(function(T) {
               v[z] = T, ++C !== x || _ || (_ = !0, a.resolve(P, v));
             }, function(T) {
               _ || (_ = !0, a.reject(P, T));
@@ -4731,12 +4731,12 @@ function wc() {
           return y.result;
         }
         p.prototype.push = function(u, g) {
-          var y, w, x, _, v, C, E = this.strm, P = this.options.chunkSize, A = this.options.dictionary, R = !1;
+          var y, w, x, _, v, C, E = this.strm, P = this.options.chunkSize, A = this.options.dictionary, D = !1;
           if (this.ended) return !1;
           w = g === ~~g ? g : g === !0 ? l.Z_FINISH : l.Z_NO_FLUSH, typeof u == "string" ? E.input = a.binstring2buf(u) : m.call(u) === "[object ArrayBuffer]" ? E.input = new Uint8Array(u) : E.input = u, E.next_in = 0, E.avail_in = E.input.length;
           do {
-            if (E.avail_out === 0 && (E.output = new r.Buf8(P), E.next_out = 0, E.avail_out = P), (y = s.inflate(E, l.Z_NO_FLUSH)) === l.Z_NEED_DICT && A && (C = typeof A == "string" ? a.string2buf(A) : m.call(A) === "[object ArrayBuffer]" ? new Uint8Array(A) : A, y = s.inflateSetDictionary(this.strm, C)), y === l.Z_BUF_ERROR && R === !0 && (y = l.Z_OK, R = !1), y !== l.Z_STREAM_END && y !== l.Z_OK) return this.onEnd(y), !(this.ended = !0);
-            E.next_out && (E.avail_out !== 0 && y !== l.Z_STREAM_END && (E.avail_in !== 0 || w !== l.Z_FINISH && w !== l.Z_SYNC_FLUSH) || (this.options.to === "string" ? (x = a.utf8border(E.output, E.next_out), _ = E.next_out - x, v = a.buf2string(E.output, x), E.next_out = _, E.avail_out = P - _, _ && r.arraySet(E.output, E.output, x, _, 0), this.onData(v)) : this.onData(r.shrinkBuf(E.output, E.next_out)))), E.avail_in === 0 && E.avail_out === 0 && (R = !0);
+            if (E.avail_out === 0 && (E.output = new r.Buf8(P), E.next_out = 0, E.avail_out = P), (y = s.inflate(E, l.Z_NO_FLUSH)) === l.Z_NEED_DICT && A && (C = typeof A == "string" ? a.string2buf(A) : m.call(A) === "[object ArrayBuffer]" ? new Uint8Array(A) : A, y = s.inflateSetDictionary(this.strm, C)), y === l.Z_BUF_ERROR && D === !0 && (y = l.Z_OK, D = !1), y !== l.Z_STREAM_END && y !== l.Z_OK) return this.onEnd(y), !(this.ended = !0);
+            E.next_out && (E.avail_out !== 0 && y !== l.Z_STREAM_END && (E.avail_in !== 0 || w !== l.Z_FINISH && w !== l.Z_SYNC_FLUSH) || (this.options.to === "string" ? (x = a.utf8border(E.output, E.next_out), _ = E.next_out - x, v = a.buf2string(E.output, x), E.next_out = _, E.avail_out = P - _, _ && r.arraySet(E.output, E.output, x, _, 0), this.onData(v)) : this.onData(r.shrinkBuf(E.output, E.next_out)))), E.avail_in === 0 && E.avail_out === 0 && (D = !0);
           } while ((0 < E.avail_in || E.avail_out === 0) && y !== l.Z_STREAM_END);
           return y === l.Z_STREAM_END && (w = l.Z_FINISH), w === l.Z_FINISH ? (y = s.inflateEnd(this.strm), this.onEnd(y), this.ended = !0, y === l.Z_OK) : w !== l.Z_SYNC_FLUSH || (this.onEnd(l.Z_OK), !(E.avail_out = 0));
         }, p.prototype.onData = function(u) {
@@ -4844,7 +4844,7 @@ function wc() {
           return -1 ^ r;
         };
       }, {}], 46: [function(t, n, i) {
-        var s, r = t("../utils/common"), a = t("./trees"), l = t("./adler32"), h = t("./crc32"), c = t("./messages"), d = 0, m = 4, p = 0, f = -2, u = -1, g = 4, y = 2, w = 8, x = 9, _ = 286, v = 30, C = 19, E = 2 * _ + 1, P = 15, A = 3, R = 258, z = R + A + 1, T = 42, k = 113, b = 1, I = 2, U = 3, F = 4;
+        var s, r = t("../utils/common"), a = t("./trees"), l = t("./adler32"), h = t("./crc32"), c = t("./messages"), d = 0, m = 4, p = 0, f = -2, u = -1, g = 4, y = 2, w = 8, x = 9, _ = 286, v = 30, C = 19, E = 2 * _ + 1, P = 15, A = 3, D = 258, z = D + A + 1, T = 42, k = 113, b = 1, I = 2, U = 3, F = 4;
         function K(S, W) {
           return S.msg = c[W], W;
         }
@@ -4868,32 +4868,32 @@ function wc() {
           S.pending_buf[S.pending++] = W >>> 8 & 255, S.pending_buf[S.pending++] = 255 & W;
         }
         function q(S, W) {
-          var G, L, D = S.max_chain_length, B = S.strstart, X = S.prev_length, Z = S.nice_match, V = S.strstart > S.w_size - z ? S.strstart - (S.w_size - z) : 0, $ = S.window, ne = S.w_mask, Q = S.prev, ie = S.strstart + R, he = $[B + X - 1], ae = $[B + X];
-          S.prev_length >= S.good_match && (D >>= 2), Z > S.lookahead && (Z = S.lookahead);
+          var G, L, R = S.max_chain_length, B = S.strstart, X = S.prev_length, Z = S.nice_match, V = S.strstart > S.w_size - z ? S.strstart - (S.w_size - z) : 0, $ = S.window, ne = S.w_mask, Q = S.prev, ie = S.strstart + D, he = $[B + X - 1], ae = $[B + X];
+          S.prev_length >= S.good_match && (R >>= 2), Z > S.lookahead && (Z = S.lookahead);
           do
             if ($[(G = W) + X] === ae && $[G + X - 1] === he && $[G] === $[B] && $[++G] === $[B + 1]) {
               B += 2, G++;
               do
                 ;
               while ($[++B] === $[++G] && $[++B] === $[++G] && $[++B] === $[++G] && $[++B] === $[++G] && $[++B] === $[++G] && $[++B] === $[++G] && $[++B] === $[++G] && $[++B] === $[++G] && B < ie);
-              if (L = R - (ie - B), B = ie - R, X < L) {
+              if (L = D - (ie - B), B = ie - D, X < L) {
                 if (S.match_start = W, Z <= (X = L)) break;
                 he = $[B + X - 1], ae = $[B + X];
               }
             }
-          while ((W = Q[W & ne]) > V && --D != 0);
+          while ((W = Q[W & ne]) > V && --R != 0);
           return X <= S.lookahead ? X : S.lookahead;
         }
         function ce(S) {
-          var W, G, L, D, B, X, Z, V, $, ne, Q = S.w_size;
+          var W, G, L, R, B, X, Z, V, $, ne, Q = S.w_size;
           do {
-            if (D = S.window_size - S.lookahead - S.strstart, S.strstart >= Q + (Q - z)) {
+            if (R = S.window_size - S.lookahead - S.strstart, S.strstart >= Q + (Q - z)) {
               for (r.arraySet(S.window, S.window, Q, Q, 0), S.match_start -= Q, S.strstart -= Q, S.block_start -= Q, W = G = S.hash_size; L = S.head[--W], S.head[W] = Q <= L ? L - Q : 0, --G; ) ;
               for (W = G = Q; L = S.prev[--W], S.prev[W] = Q <= L ? L - Q : 0, --G; ) ;
-              D += Q;
+              R += Q;
             }
             if (S.strm.avail_in === 0) break;
-            if (X = S.strm, Z = S.window, V = S.strstart + S.lookahead, $ = D, ne = void 0, ne = X.avail_in, $ < ne && (ne = $), G = ne === 0 ? 0 : (X.avail_in -= ne, r.arraySet(Z, X.input, X.next_in, ne, V), X.state.wrap === 1 ? X.adler = l(X.adler, Z, ne, V) : X.state.wrap === 2 && (X.adler = h(X.adler, Z, ne, V)), X.next_in += ne, X.total_in += ne, ne), S.lookahead += G, S.lookahead + S.insert >= A) for (B = S.strstart - S.insert, S.ins_h = S.window[B], S.ins_h = (S.ins_h << S.hash_shift ^ S.window[B + 1]) & S.hash_mask; S.insert && (S.ins_h = (S.ins_h << S.hash_shift ^ S.window[B + A - 1]) & S.hash_mask, S.prev[B & S.w_mask] = S.head[S.ins_h], S.head[S.ins_h] = B, B++, S.insert--, !(S.lookahead + S.insert < A)); ) ;
+            if (X = S.strm, Z = S.window, V = S.strstart + S.lookahead, $ = R, ne = void 0, ne = X.avail_in, $ < ne && (ne = $), G = ne === 0 ? 0 : (X.avail_in -= ne, r.arraySet(Z, X.input, X.next_in, ne, V), X.state.wrap === 1 ? X.adler = l(X.adler, Z, ne, V) : X.state.wrap === 2 && (X.adler = h(X.adler, Z, ne, V)), X.next_in += ne, X.total_in += ne, ne), S.lookahead += G, S.lookahead + S.insert >= A) for (B = S.strstart - S.insert, S.ins_h = S.window[B], S.ins_h = (S.ins_h << S.hash_shift ^ S.window[B + 1]) & S.hash_mask; S.insert && (S.ins_h = (S.ins_h << S.hash_shift ^ S.window[B + A - 1]) & S.hash_mask, S.prev[B & S.w_mask] = S.head[S.ins_h], S.head[S.ins_h] = B, B++, S.insert--, !(S.lookahead + S.insert < A)); ) ;
           } while (S.lookahead < z && S.strm.avail_in !== 0);
         }
         function pe(S, W) {
@@ -4912,13 +4912,13 @@ function wc() {
           return S.insert = S.strstart < A - 1 ? S.strstart : A - 1, W === m ? (O(S, !0), S.strm.avail_out === 0 ? U : F) : S.last_lit && (O(S, !1), S.strm.avail_out === 0) ? b : I;
         }
         function se(S, W) {
-          for (var G, L, D; ; ) {
+          for (var G, L, R; ; ) {
             if (S.lookahead < z) {
               if (ce(S), S.lookahead < z && W === d) return b;
               if (S.lookahead === 0) break;
             }
             if (G = 0, S.lookahead >= A && (S.ins_h = (S.ins_h << S.hash_shift ^ S.window[S.strstart + A - 1]) & S.hash_mask, G = S.prev[S.strstart & S.w_mask] = S.head[S.ins_h], S.head[S.ins_h] = S.strstart), S.prev_length = S.match_length, S.prev_match = S.match_start, S.match_length = A - 1, G !== 0 && S.prev_length < S.max_lazy_match && S.strstart - G <= S.w_size - z && (S.match_length = q(S, G), S.match_length <= 5 && (S.strategy === 1 || S.match_length === A && 4096 < S.strstart - S.match_start) && (S.match_length = A - 1)), S.prev_length >= A && S.match_length <= S.prev_length) {
-              for (D = S.strstart + S.lookahead - A, L = a._tr_tally(S, S.strstart - 1 - S.prev_match, S.prev_length - A), S.lookahead -= S.prev_length - 1, S.prev_length -= 2; ++S.strstart <= D && (S.ins_h = (S.ins_h << S.hash_shift ^ S.window[S.strstart + A - 1]) & S.hash_mask, G = S.prev[S.strstart & S.w_mask] = S.head[S.ins_h], S.head[S.ins_h] = S.strstart), --S.prev_length != 0; ) ;
+              for (R = S.strstart + S.lookahead - A, L = a._tr_tally(S, S.strstart - 1 - S.prev_match, S.prev_length - A), S.lookahead -= S.prev_length - 1, S.prev_length -= 2; ++S.strstart <= R && (S.ins_h = (S.ins_h << S.hash_shift ^ S.window[S.strstart + A - 1]) & S.hash_mask, G = S.prev[S.strstart & S.w_mask] = S.head[S.ins_h], S.head[S.ins_h] = S.strstart), --S.prev_length != 0; ) ;
               if (S.match_available = 0, S.match_length = A - 1, S.strstart++, L && (O(S, !1), S.strm.avail_out === 0)) return b;
             } else if (S.match_available) {
               if ((L = a._tr_tally(S, 0, S.window[S.strstart - 1])) && O(S, !1), S.strstart++, S.lookahead--, S.strm.avail_out === 0) return b;
@@ -4926,8 +4926,8 @@ function wc() {
           }
           return S.match_available && (L = a._tr_tally(S, 0, S.window[S.strstart - 1]), S.match_available = 0), S.insert = S.strstart < A - 1 ? S.strstart : A - 1, W === m ? (O(S, !0), S.strm.avail_out === 0 ? U : F) : S.last_lit && (O(S, !1), S.strm.avail_out === 0) ? b : I;
         }
-        function oe(S, W, G, L, D) {
-          this.good_length = S, this.max_lazy = W, this.nice_length = G, this.max_chain = L, this.func = D;
+        function oe(S, W, G, L, R) {
+          this.good_length = S, this.max_lazy = W, this.nice_length = G, this.max_chain = L, this.func = R;
         }
         function ue() {
           this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = w, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new r.Buf16(2 * E), this.dyn_dtree = new r.Buf16(2 * (2 * v + 1)), this.bl_tree = new r.Buf16(2 * (2 * C + 1)), Y(this.dyn_ltree), Y(this.dyn_dtree), Y(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new r.Buf16(P + 1), this.heap = new r.Buf16(2 * _ + 1), Y(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new r.Buf16(2 * _ + 1), Y(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
@@ -4942,13 +4942,13 @@ function wc() {
             G.window_size = 2 * G.w_size, Y(G.head), G.max_lazy_match = s[G.level].max_lazy, G.good_match = s[G.level].good_length, G.nice_match = s[G.level].nice_length, G.max_chain_length = s[G.level].max_chain, G.strstart = 0, G.block_start = 0, G.lookahead = 0, G.insert = 0, G.match_length = G.prev_length = A - 1, G.match_available = 0, G.ins_h = 0;
           })(S.state), W;
         }
-        function Ie(S, W, G, L, D, B) {
+        function Ie(S, W, G, L, R, B) {
           if (!S) return f;
           var X = 1;
-          if (W === u && (W = 6), L < 0 ? (X = 0, L = -L) : 15 < L && (X = 2, L -= 16), D < 1 || x < D || G !== w || L < 8 || 15 < L || W < 0 || 9 < W || B < 0 || g < B) return K(S, f);
+          if (W === u && (W = 6), L < 0 ? (X = 0, L = -L) : 15 < L && (X = 2, L -= 16), R < 1 || x < R || G !== w || L < 8 || 15 < L || W < 0 || 9 < W || B < 0 || g < B) return K(S, f);
           L === 8 && (L = 9);
           var Z = new ue();
-          return (S.state = Z).strm = S, Z.wrap = X, Z.gzhead = null, Z.w_bits = L, Z.w_size = 1 << Z.w_bits, Z.w_mask = Z.w_size - 1, Z.hash_bits = D + 7, Z.hash_size = 1 << Z.hash_bits, Z.hash_mask = Z.hash_size - 1, Z.hash_shift = ~~((Z.hash_bits + A - 1) / A), Z.window = new r.Buf8(2 * Z.w_size), Z.head = new r.Buf16(Z.hash_size), Z.prev = new r.Buf16(Z.w_size), Z.lit_bufsize = 1 << D + 6, Z.pending_buf_size = 4 * Z.lit_bufsize, Z.pending_buf = new r.Buf8(Z.pending_buf_size), Z.d_buf = 1 * Z.lit_bufsize, Z.l_buf = 3 * Z.lit_bufsize, Z.level = W, Z.strategy = B, Z.method = G, Te(S);
+          return (S.state = Z).strm = S, Z.wrap = X, Z.gzhead = null, Z.w_bits = L, Z.w_size = 1 << Z.w_bits, Z.w_mask = Z.w_size - 1, Z.hash_bits = R + 7, Z.hash_size = 1 << Z.hash_bits, Z.hash_mask = Z.hash_size - 1, Z.hash_shift = ~~((Z.hash_bits + A - 1) / A), Z.window = new r.Buf8(2 * Z.w_size), Z.head = new r.Buf16(Z.hash_size), Z.prev = new r.Buf16(Z.w_size), Z.lit_bufsize = 1 << R + 6, Z.pending_buf_size = 4 * Z.lit_bufsize, Z.pending_buf = new r.Buf8(Z.pending_buf_size), Z.d_buf = 1 * Z.lit_bufsize, Z.l_buf = 3 * Z.lit_bufsize, Z.level = W, Z.strategy = B, Z.method = G, Te(S);
         }
         s = [new oe(0, 0, 0, 0, function(S, W) {
           var G = 65535;
@@ -4967,7 +4967,7 @@ function wc() {
         }, i.deflateInit2 = Ie, i.deflateReset = Te, i.deflateResetKeep = me, i.deflateSetHeader = function(S, W) {
           return S && S.state ? S.state.wrap !== 2 ? f : (S.state.gzhead = W, p) : f;
         }, i.deflate = function(S, W) {
-          var G, L, D, B;
+          var G, L, R, B;
           if (!S || !S.state || 5 < W || W < 0) return S ? K(S, f) : f;
           if (L = S.state, !S.output || !S.input && S.avail_in !== 0 || L.status === 666 && W !== m) return K(S, S.avail_out === 0 ? -5 : f);
           if (L.strm = S, G = L.last_flush, L.last_flush = W, L.status === T) if (L.wrap === 2) S.adler = 0, te(L, 31), te(L, 139), te(L, 8), L.gzhead ? (te(L, (L.gzhead.text ? 1 : 0) + (L.gzhead.hcrc ? 2 : 0) + (L.gzhead.extra ? 4 : 0) + (L.gzhead.name ? 8 : 0) + (L.gzhead.comment ? 16 : 0)), te(L, 255 & L.gzhead.time), te(L, L.gzhead.time >> 8 & 255), te(L, L.gzhead.time >> 16 & 255), te(L, L.gzhead.time >> 24 & 255), te(L, L.level === 9 ? 2 : 2 <= L.strategy || L.level < 2 ? 4 : 0), te(L, 255 & L.gzhead.os), L.gzhead.extra && L.gzhead.extra.length && (te(L, 255 & L.gzhead.extra.length), te(L, L.gzhead.extra.length >> 8 & 255)), L.gzhead.hcrc && (S.adler = h(S.adler, L.pending_buf, L.pending, 0)), L.gzindex = 0, L.status = 69) : (te(L, 0), te(L, 0), te(L, 0), te(L, 0), te(L, 0), te(L, L.level === 9 ? 2 : 2 <= L.strategy || L.level < 2 ? 4 : 0), te(L, 3), L.status = k);
@@ -4976,30 +4976,30 @@ function wc() {
             X |= (2 <= L.strategy || L.level < 2 ? 0 : L.level < 6 ? 1 : L.level === 6 ? 2 : 3) << 6, L.strstart !== 0 && (X |= 32), X += 31 - X % 31, L.status = k, ee(L, X), L.strstart !== 0 && (ee(L, S.adler >>> 16), ee(L, 65535 & S.adler)), S.adler = 1;
           }
           if (L.status === 69) if (L.gzhead.extra) {
-            for (D = L.pending; L.gzindex < (65535 & L.gzhead.extra.length) && (L.pending !== L.pending_buf_size || (L.gzhead.hcrc && L.pending > D && (S.adler = h(S.adler, L.pending_buf, L.pending - D, D)), N(S), D = L.pending, L.pending !== L.pending_buf_size)); ) te(L, 255 & L.gzhead.extra[L.gzindex]), L.gzindex++;
-            L.gzhead.hcrc && L.pending > D && (S.adler = h(S.adler, L.pending_buf, L.pending - D, D)), L.gzindex === L.gzhead.extra.length && (L.gzindex = 0, L.status = 73);
+            for (R = L.pending; L.gzindex < (65535 & L.gzhead.extra.length) && (L.pending !== L.pending_buf_size || (L.gzhead.hcrc && L.pending > R && (S.adler = h(S.adler, L.pending_buf, L.pending - R, R)), N(S), R = L.pending, L.pending !== L.pending_buf_size)); ) te(L, 255 & L.gzhead.extra[L.gzindex]), L.gzindex++;
+            L.gzhead.hcrc && L.pending > R && (S.adler = h(S.adler, L.pending_buf, L.pending - R, R)), L.gzindex === L.gzhead.extra.length && (L.gzindex = 0, L.status = 73);
           } else L.status = 73;
           if (L.status === 73) if (L.gzhead.name) {
-            D = L.pending;
+            R = L.pending;
             do {
-              if (L.pending === L.pending_buf_size && (L.gzhead.hcrc && L.pending > D && (S.adler = h(S.adler, L.pending_buf, L.pending - D, D)), N(S), D = L.pending, L.pending === L.pending_buf_size)) {
+              if (L.pending === L.pending_buf_size && (L.gzhead.hcrc && L.pending > R && (S.adler = h(S.adler, L.pending_buf, L.pending - R, R)), N(S), R = L.pending, L.pending === L.pending_buf_size)) {
                 B = 1;
                 break;
               }
               B = L.gzindex < L.gzhead.name.length ? 255 & L.gzhead.name.charCodeAt(L.gzindex++) : 0, te(L, B);
             } while (B !== 0);
-            L.gzhead.hcrc && L.pending > D && (S.adler = h(S.adler, L.pending_buf, L.pending - D, D)), B === 0 && (L.gzindex = 0, L.status = 91);
+            L.gzhead.hcrc && L.pending > R && (S.adler = h(S.adler, L.pending_buf, L.pending - R, R)), B === 0 && (L.gzindex = 0, L.status = 91);
           } else L.status = 91;
           if (L.status === 91) if (L.gzhead.comment) {
-            D = L.pending;
+            R = L.pending;
             do {
-              if (L.pending === L.pending_buf_size && (L.gzhead.hcrc && L.pending > D && (S.adler = h(S.adler, L.pending_buf, L.pending - D, D)), N(S), D = L.pending, L.pending === L.pending_buf_size)) {
+              if (L.pending === L.pending_buf_size && (L.gzhead.hcrc && L.pending > R && (S.adler = h(S.adler, L.pending_buf, L.pending - R, R)), N(S), R = L.pending, L.pending === L.pending_buf_size)) {
                 B = 1;
                 break;
               }
               B = L.gzindex < L.gzhead.comment.length ? 255 & L.gzhead.comment.charCodeAt(L.gzindex++) : 0, te(L, B);
             } while (B !== 0);
-            L.gzhead.hcrc && L.pending > D && (S.adler = h(S.adler, L.pending_buf, L.pending - D, D)), B === 0 && (L.status = 103);
+            L.gzhead.hcrc && L.pending > R && (S.adler = h(S.adler, L.pending_buf, L.pending - R, R)), B === 0 && (L.status = 103);
           } else L.status = 103;
           if (L.status === 103 && (L.gzhead.hcrc ? (L.pending + 2 > L.pending_buf_size && N(S), L.pending + 2 <= L.pending_buf_size && (te(L, 255 & S.adler), te(L, S.adler >> 8 & 255), S.adler = 0, L.status = k)) : L.status = k), L.pending !== 0) {
             if (N(S), S.avail_out === 0) return L.last_flush = -1, p;
@@ -5017,16 +5017,16 @@ function wc() {
               return V.insert = 0, $ === m ? (O(V, !0), V.strm.avail_out === 0 ? U : F) : V.last_lit && (O(V, !1), V.strm.avail_out === 0) ? b : I;
             })(L, W) : L.strategy === 3 ? (function(V, $) {
               for (var ne, Q, ie, he, ae = V.window; ; ) {
-                if (V.lookahead <= R) {
-                  if (ce(V), V.lookahead <= R && $ === d) return b;
+                if (V.lookahead <= D) {
+                  if (ce(V), V.lookahead <= D && $ === d) return b;
                   if (V.lookahead === 0) break;
                 }
                 if (V.match_length = 0, V.lookahead >= A && 0 < V.strstart && (Q = ae[ie = V.strstart - 1]) === ae[++ie] && Q === ae[++ie] && Q === ae[++ie]) {
-                  he = V.strstart + R;
+                  he = V.strstart + D;
                   do
                     ;
                   while (Q === ae[++ie] && Q === ae[++ie] && Q === ae[++ie] && Q === ae[++ie] && Q === ae[++ie] && Q === ae[++ie] && Q === ae[++ie] && Q === ae[++ie] && ie < he);
-                  V.match_length = R - (he - ie), V.match_length > V.lookahead && (V.match_length = V.lookahead);
+                  V.match_length = D - (he - ie), V.match_length > V.lookahead && (V.match_length = V.lookahead);
                 }
                 if (V.match_length >= A ? (ne = a._tr_tally(V, 1, V.match_length - A), V.lookahead -= V.match_length, V.strstart += V.match_length, V.match_length = 0) : (ne = a._tr_tally(V, 0, V.window[V.strstart]), V.lookahead--, V.strstart++), ne && (O(V, !1), V.strm.avail_out === 0)) return b;
               }
@@ -5040,10 +5040,10 @@ function wc() {
           var W;
           return S && S.state ? (W = S.state.status) !== T && W !== 69 && W !== 73 && W !== 91 && W !== 103 && W !== k && W !== 666 ? K(S, f) : (S.state = null, W === k ? K(S, -3) : p) : f;
         }, i.deflateSetDictionary = function(S, W) {
-          var G, L, D, B, X, Z, V, $, ne = W.length;
+          var G, L, R, B, X, Z, V, $, ne = W.length;
           if (!S || !S.state || (B = (G = S.state).wrap) === 2 || B === 1 && G.status !== T || G.lookahead) return f;
           for (B === 1 && (S.adler = l(S.adler, W, ne, 0)), G.wrap = 0, ne >= G.w_size && (B === 0 && (Y(G.head), G.strstart = 0, G.block_start = 0, G.insert = 0), $ = new r.Buf8(G.w_size), r.arraySet($, W, ne - G.w_size, G.w_size, 0), W = $, ne = G.w_size), X = S.avail_in, Z = S.next_in, V = S.input, S.avail_in = ne, S.next_in = 0, S.input = W, ce(G); G.lookahead >= A; ) {
-            for (L = G.strstart, D = G.lookahead - (A - 1); G.ins_h = (G.ins_h << G.hash_shift ^ G.window[L + A - 1]) & G.hash_mask, G.prev[L & G.w_mask] = G.head[G.ins_h], G.head[G.ins_h] = L, L++, --D; ) ;
+            for (L = G.strstart, R = G.lookahead - (A - 1); G.ins_h = (G.ins_h << G.hash_shift ^ G.window[L + A - 1]) & G.hash_mask, G.prev[L & G.w_mask] = G.head[G.ins_h], G.head[G.ins_h] = L, L++, --R; ) ;
             G.strstart = L, G.lookahead = A - 1, ce(G);
           }
           return G.strstart += G.lookahead, G.block_start = G.strstart, G.insert = G.lookahead, G.lookahead = 0, G.match_length = G.prev_length = A - 1, G.match_available = 0, S.next_in = Z, S.input = V, S.avail_in = X, G.wrap = B, p;
@@ -5054,7 +5054,7 @@ function wc() {
         };
       }, {}], 48: [function(t, n, i) {
         n.exports = function(s, r) {
-          var a, l, h, c, d, m, p, f, u, g, y, w, x, _, v, C, E, P, A, R, z, T, k, b, I;
+          var a, l, h, c, d, m, p, f, u, g, y, w, x, _, v, C, E, P, A, D, z, T, k, b, I;
           a = s.state, l = s.next_in, b = s.input, h = l + (s.avail_in - 5), c = s.next_out, I = s.output, d = c - (r - s.avail_out), m = c + (s.avail_out - 257), p = a.dmax, f = a.wsize, u = a.whave, g = a.wnext, y = a.window, w = a.hold, x = a.bits, _ = a.lencode, v = a.distcode, C = (1 << a.lenbits) - 1, E = (1 << a.distbits) - 1;
           e: do {
             x < 15 && (w += b[l++] << x, x += 8, w += b[l++] << x, x += 8), P = _[w & C];
@@ -5073,7 +5073,7 @@ function wc() {
                   s.msg = "invalid literal/length code", a.mode = 30;
                   break e;
                 }
-                R = 65535 & P, (A &= 15) && (x < A && (w += b[l++] << x, x += 8), R += w & (1 << A) - 1, w >>>= A, x -= A), x < 15 && (w += b[l++] << x, x += 8, w += b[l++] << x, x += 8), P = v[w & E];
+                D = 65535 & P, (A &= 15) && (x < A && (w += b[l++] << x, x += 8), D += w & (1 << A) - 1, w >>>= A, x -= A), x < 15 && (w += b[l++] << x, x += 8, w += b[l++] << x, x += 8), P = v[w & E];
                 n: for (; ; ) {
                   if (w >>>= A = P >>> 24, x -= A, !(16 & (A = P >>> 16 & 255))) {
                     if ((64 & A) == 0) {
@@ -5093,27 +5093,27 @@ function wc() {
                       break e;
                     }
                     if (k = y, (T = 0) === g) {
-                      if (T += f - A, A < R) {
-                        for (R -= A; I[c++] = y[T++], --A; ) ;
+                      if (T += f - A, A < D) {
+                        for (D -= A; I[c++] = y[T++], --A; ) ;
                         T = c - z, k = I;
                       }
                     } else if (g < A) {
-                      if (T += f + g - A, (A -= g) < R) {
-                        for (R -= A; I[c++] = y[T++], --A; ) ;
-                        if (T = 0, g < R) {
-                          for (R -= A = g; I[c++] = y[T++], --A; ) ;
+                      if (T += f + g - A, (A -= g) < D) {
+                        for (D -= A; I[c++] = y[T++], --A; ) ;
+                        if (T = 0, g < D) {
+                          for (D -= A = g; I[c++] = y[T++], --A; ) ;
                           T = c - z, k = I;
                         }
                       }
-                    } else if (T += g - A, A < R) {
-                      for (R -= A; I[c++] = y[T++], --A; ) ;
+                    } else if (T += g - A, A < D) {
+                      for (D -= A; I[c++] = y[T++], --A; ) ;
                       T = c - z, k = I;
                     }
-                    for (; 2 < R; ) I[c++] = k[T++], I[c++] = k[T++], I[c++] = k[T++], R -= 3;
-                    R && (I[c++] = k[T++], 1 < R && (I[c++] = k[T++]));
+                    for (; 2 < D; ) I[c++] = k[T++], I[c++] = k[T++], I[c++] = k[T++], D -= 3;
+                    D && (I[c++] = k[T++], 1 < D && (I[c++] = k[T++]));
                   } else {
-                    for (T = c - z; I[c++] = I[T++], I[c++] = I[T++], I[c++] = I[T++], 2 < (R -= 3); ) ;
-                    R && (I[c++] = I[T++], 1 < R && (I[c++] = I[T++]));
+                    for (T = c - z; I[c++] = I[T++], I[c++] = I[T++], I[c++] = I[T++], 2 < (D -= 3); ) ;
+                    D && (I[c++] = I[T++], 1 < D && (I[c++] = I[T++]));
                   }
                   break;
                 }
@@ -5121,7 +5121,7 @@ function wc() {
               break;
             }
           } while (l < h && c < m);
-          l -= R = x >> 3, w &= (1 << (x -= R << 3)) - 1, s.next_in = l, s.next_out = c, s.avail_in = l < h ? h - l + 5 : 5 - (l - h), s.avail_out = c < m ? m - c + 257 : 257 - (c - m), a.hold = w, a.bits = x;
+          l -= D = x >> 3, w &= (1 << (x -= D << 3)) - 1, s.next_in = l, s.next_out = c, s.avail_in = l < h ? h - l + 5 : 5 - (l - h), s.avail_out = c < m ? m - c + 257 : 257 - (c - m), a.hold = w, a.bits = x;
         };
       }, {}], 49: [function(t, n, i) {
         var s = t("../utils/common"), r = t("./adler32"), a = t("./crc32"), l = t("./inffast"), h = t("./inftrees"), c = 1, d = 2, m = 0, p = -2, f = 1, u = 852, g = 592;
@@ -5148,7 +5148,7 @@ function wc() {
           return T ? (I = new w(), (T.state = I).window = null, (b = v(T, k)) !== m && (T.state = null), b) : p;
         }
         var E, P, A = !0;
-        function R(T) {
+        function D(T) {
           if (A) {
             var k;
             for (E = new s.Buf32(512), P = new s.Buf32(32), k = 0; k < 144; ) T.lens[k++] = 8;
@@ -5167,7 +5167,7 @@ function wc() {
         i.inflateReset = _, i.inflateReset2 = v, i.inflateResetKeep = x, i.inflateInit = function(T) {
           return C(T, 15);
         }, i.inflateInit2 = C, i.inflate = function(T, k) {
-          var b, I, U, F, K, H, Y, N, O, te, ee, q, ce, pe, se, oe, ue, me, Te, Ie, S, W, G, L, D = 0, B = new s.Buf8(4), X = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+          var b, I, U, F, K, H, Y, N, O, te, ee, q, ce, pe, se, oe, ue, me, Te, Ie, S, W, G, L, R = 0, B = new s.Buf8(4), X = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
           if (!T || !T.state || !T.output || !T.input && T.avail_in !== 0) return p;
           (b = T.state).mode === 12 && (b.mode = 13), K = T.next_out, U = T.output, Y = T.avail_out, F = T.next_in, I = T.input, H = T.avail_in, N = b.hold, O = b.bits, te = H, ee = Y, W = m;
           e: for (; ; ) switch (b.mode) {
@@ -5290,7 +5290,7 @@ function wc() {
                   b.mode = 14;
                   break;
                 case 1:
-                  if (R(b), b.mode = 20, k !== 6) break;
+                  if (D(b), b.mode = 20, k !== 6) break;
                   N >>>= 2, O -= 2;
                   break e;
                 case 2:
@@ -5347,7 +5347,7 @@ function wc() {
               b.have = 0, b.mode = 19;
             case 19:
               for (; b.have < b.nlen + b.ndist; ) {
-                for (; oe = (D = b.lencode[N & (1 << b.lenbits) - 1]) >>> 16 & 255, ue = 65535 & D, !((se = D >>> 24) <= O); ) {
+                for (; oe = (R = b.lencode[N & (1 << b.lenbits) - 1]) >>> 16 & 255, ue = 65535 & R, !((se = R >>> 24) <= O); ) {
                   if (H === 0) break e;
                   H--, N += I[F++] << O, O += 8;
                 }
@@ -5404,12 +5404,12 @@ function wc() {
                 T.next_out = K, T.avail_out = Y, T.next_in = F, T.avail_in = H, b.hold = N, b.bits = O, l(T, ee), K = T.next_out, U = T.output, Y = T.avail_out, F = T.next_in, I = T.input, H = T.avail_in, N = b.hold, O = b.bits, b.mode === 12 && (b.back = -1);
                 break;
               }
-              for (b.back = 0; oe = (D = b.lencode[N & (1 << b.lenbits) - 1]) >>> 16 & 255, ue = 65535 & D, !((se = D >>> 24) <= O); ) {
+              for (b.back = 0; oe = (R = b.lencode[N & (1 << b.lenbits) - 1]) >>> 16 & 255, ue = 65535 & R, !((se = R >>> 24) <= O); ) {
                 if (H === 0) break e;
                 H--, N += I[F++] << O, O += 8;
               }
               if (oe && (240 & oe) == 0) {
-                for (me = se, Te = oe, Ie = ue; oe = (D = b.lencode[Ie + ((N & (1 << me + Te) - 1) >> me)]) >>> 16 & 255, ue = 65535 & D, !(me + (se = D >>> 24) <= O); ) {
+                for (me = se, Te = oe, Ie = ue; oe = (R = b.lencode[Ie + ((N & (1 << me + Te) - 1) >> me)]) >>> 16 & 255, ue = 65535 & R, !(me + (se = R >>> 24) <= O); ) {
                   if (H === 0) break e;
                   H--, N += I[F++] << O, O += 8;
                 }
@@ -5438,12 +5438,12 @@ function wc() {
               }
               b.was = b.length, b.mode = 23;
             case 23:
-              for (; oe = (D = b.distcode[N & (1 << b.distbits) - 1]) >>> 16 & 255, ue = 65535 & D, !((se = D >>> 24) <= O); ) {
+              for (; oe = (R = b.distcode[N & (1 << b.distbits) - 1]) >>> 16 & 255, ue = 65535 & R, !((se = R >>> 24) <= O); ) {
                 if (H === 0) break e;
                 H--, N += I[F++] << O, O += 8;
               }
               if ((240 & oe) == 0) {
-                for (me = se, Te = oe, Ie = ue; oe = (D = b.distcode[Ie + ((N & (1 << me + Te) - 1) >> me)]) >>> 16 & 255, ue = 65535 & D, !(me + (se = D >>> 24) <= O); ) {
+                for (me = se, Te = oe, Ie = ue; oe = (R = b.distcode[Ie + ((N & (1 << me + Te) - 1) >> me)]) >>> 16 & 255, ue = 65535 & R, !(me + (se = R >>> 24) <= O); ) {
                   if (H === 0) break e;
                   H--, N += I[F++] << O, O += 8;
                 }
@@ -5536,7 +5536,7 @@ function wc() {
       }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(t, n, i) {
         var s = t("../utils/common"), r = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0], a = [16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78], l = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0], h = [16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64];
         n.exports = function(c, d, m, p, f, u, g, y) {
-          var w, x, _, v, C, E, P, A, R, z = y.bits, T = 0, k = 0, b = 0, I = 0, U = 0, F = 0, K = 0, H = 0, Y = 0, N = 0, O = null, te = 0, ee = new s.Buf16(16), q = new s.Buf16(16), ce = null, pe = 0;
+          var w, x, _, v, C, E, P, A, D, z = y.bits, T = 0, k = 0, b = 0, I = 0, U = 0, F = 0, K = 0, H = 0, Y = 0, N = 0, O = null, te = 0, ee = new s.Buf16(16), q = new s.Buf16(16), ce = null, pe = 0;
           for (T = 0; T <= 15; T++) ee[T] = 0;
           for (k = 0; k < p; k++) ee[d[m + k]]++;
           for (U = z, I = 15; 1 <= I && ee[I] === 0; I--) ;
@@ -5548,7 +5548,7 @@ function wc() {
           for (k = 0; k < p; k++) d[m + k] !== 0 && (g[q[d[m + k]]++] = k);
           if (E = c === 0 ? (O = ce = g, 19) : c === 1 ? (O = r, te -= 257, ce = a, pe -= 257, 256) : (O = l, ce = h, -1), T = b, C = u, K = k = N = 0, _ = -1, v = (Y = 1 << (F = U)) - 1, c === 1 && 852 < Y || c === 2 && 592 < Y) return 1;
           for (; ; ) {
-            for (P = T - K, R = g[k] < E ? (A = 0, g[k]) : g[k] > E ? (A = ce[pe + g[k]], O[te + g[k]]) : (A = 96, 0), w = 1 << T - K, b = x = 1 << F; f[C + (N >> K) + (x -= w)] = P << 24 | A << 16 | R | 0, x !== 0; ) ;
+            for (P = T - K, D = g[k] < E ? (A = 0, g[k]) : g[k] > E ? (A = ce[pe + g[k]], O[te + g[k]]) : (A = 96, 0), w = 1 << T - K, b = x = 1 << F; f[C + (N >> K) + (x -= w)] = P << 24 | A << 16 | D | 0, x !== 0; ) ;
             for (w = 1 << T - 1; N & w; ) w >>= 1;
             if (w !== 0 ? (N &= w - 1, N += w) : N = 0, k++, --ee[T] == 0) {
               if (T === I) break;
@@ -5566,10 +5566,10 @@ function wc() {
         n.exports = { 2: "need dictionary", 1: "stream end", 0: "", "-1": "file error", "-2": "stream error", "-3": "data error", "-4": "insufficient memory", "-5": "buffer error", "-6": "incompatible version" };
       }, {}], 52: [function(t, n, i) {
         var s = t("../utils/common"), r = 0, a = 1;
-        function l(D) {
-          for (var B = D.length; 0 <= --B; ) D[B] = 0;
+        function l(R) {
+          for (var B = R.length; 0 <= --B; ) R[B] = 0;
         }
-        var h = 0, c = 29, d = 256, m = d + 1 + c, p = 30, f = 19, u = 2 * m + 1, g = 15, y = 16, w = 7, x = 256, _ = 16, v = 17, C = 18, E = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], P = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], A = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], R = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], z = new Array(2 * (m + 2));
+        var h = 0, c = 29, d = 256, m = d + 1 + c, p = 30, f = 19, u = 2 * m + 1, g = 15, y = 16, w = 7, x = 256, _ = 16, v = 17, C = 18, E = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], P = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], A = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], D = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], z = new Array(2 * (m + 2));
         l(z);
         var T = new Array(2 * p);
         l(T);
@@ -5580,98 +5580,98 @@ function wc() {
         var I = new Array(c);
         l(I);
         var U, F, K, H = new Array(p);
-        function Y(D, B, X, Z, V) {
-          this.static_tree = D, this.extra_bits = B, this.extra_base = X, this.elems = Z, this.max_length = V, this.has_stree = D && D.length;
+        function Y(R, B, X, Z, V) {
+          this.static_tree = R, this.extra_bits = B, this.extra_base = X, this.elems = Z, this.max_length = V, this.has_stree = R && R.length;
         }
-        function N(D, B) {
-          this.dyn_tree = D, this.max_code = 0, this.stat_desc = B;
+        function N(R, B) {
+          this.dyn_tree = R, this.max_code = 0, this.stat_desc = B;
         }
-        function O(D) {
-          return D < 256 ? k[D] : k[256 + (D >>> 7)];
+        function O(R) {
+          return R < 256 ? k[R] : k[256 + (R >>> 7)];
         }
-        function te(D, B) {
-          D.pending_buf[D.pending++] = 255 & B, D.pending_buf[D.pending++] = B >>> 8 & 255;
+        function te(R, B) {
+          R.pending_buf[R.pending++] = 255 & B, R.pending_buf[R.pending++] = B >>> 8 & 255;
         }
-        function ee(D, B, X) {
-          D.bi_valid > y - X ? (D.bi_buf |= B << D.bi_valid & 65535, te(D, D.bi_buf), D.bi_buf = B >> y - D.bi_valid, D.bi_valid += X - y) : (D.bi_buf |= B << D.bi_valid & 65535, D.bi_valid += X);
+        function ee(R, B, X) {
+          R.bi_valid > y - X ? (R.bi_buf |= B << R.bi_valid & 65535, te(R, R.bi_buf), R.bi_buf = B >> y - R.bi_valid, R.bi_valid += X - y) : (R.bi_buf |= B << R.bi_valid & 65535, R.bi_valid += X);
         }
-        function q(D, B, X) {
-          ee(D, X[2 * B], X[2 * B + 1]);
+        function q(R, B, X) {
+          ee(R, X[2 * B], X[2 * B + 1]);
         }
-        function ce(D, B) {
-          for (var X = 0; X |= 1 & D, D >>>= 1, X <<= 1, 0 < --B; ) ;
+        function ce(R, B) {
+          for (var X = 0; X |= 1 & R, R >>>= 1, X <<= 1, 0 < --B; ) ;
           return X >>> 1;
         }
-        function pe(D, B, X) {
+        function pe(R, B, X) {
           var Z, V, $ = new Array(g + 1), ne = 0;
           for (Z = 1; Z <= g; Z++) $[Z] = ne = ne + X[Z - 1] << 1;
           for (V = 0; V <= B; V++) {
-            var Q = D[2 * V + 1];
-            Q !== 0 && (D[2 * V] = ce($[Q]++, Q));
+            var Q = R[2 * V + 1];
+            Q !== 0 && (R[2 * V] = ce($[Q]++, Q));
           }
         }
-        function se(D) {
+        function se(R) {
           var B;
-          for (B = 0; B < m; B++) D.dyn_ltree[2 * B] = 0;
-          for (B = 0; B < p; B++) D.dyn_dtree[2 * B] = 0;
-          for (B = 0; B < f; B++) D.bl_tree[2 * B] = 0;
-          D.dyn_ltree[2 * x] = 1, D.opt_len = D.static_len = 0, D.last_lit = D.matches = 0;
+          for (B = 0; B < m; B++) R.dyn_ltree[2 * B] = 0;
+          for (B = 0; B < p; B++) R.dyn_dtree[2 * B] = 0;
+          for (B = 0; B < f; B++) R.bl_tree[2 * B] = 0;
+          R.dyn_ltree[2 * x] = 1, R.opt_len = R.static_len = 0, R.last_lit = R.matches = 0;
         }
-        function oe(D) {
-          8 < D.bi_valid ? te(D, D.bi_buf) : 0 < D.bi_valid && (D.pending_buf[D.pending++] = D.bi_buf), D.bi_buf = 0, D.bi_valid = 0;
+        function oe(R) {
+          8 < R.bi_valid ? te(R, R.bi_buf) : 0 < R.bi_valid && (R.pending_buf[R.pending++] = R.bi_buf), R.bi_buf = 0, R.bi_valid = 0;
         }
-        function ue(D, B, X, Z) {
+        function ue(R, B, X, Z) {
           var V = 2 * B, $ = 2 * X;
-          return D[V] < D[$] || D[V] === D[$] && Z[B] <= Z[X];
+          return R[V] < R[$] || R[V] === R[$] && Z[B] <= Z[X];
         }
-        function me(D, B, X) {
-          for (var Z = D.heap[X], V = X << 1; V <= D.heap_len && (V < D.heap_len && ue(B, D.heap[V + 1], D.heap[V], D.depth) && V++, !ue(B, Z, D.heap[V], D.depth)); ) D.heap[X] = D.heap[V], X = V, V <<= 1;
-          D.heap[X] = Z;
+        function me(R, B, X) {
+          for (var Z = R.heap[X], V = X << 1; V <= R.heap_len && (V < R.heap_len && ue(B, R.heap[V + 1], R.heap[V], R.depth) && V++, !ue(B, Z, R.heap[V], R.depth)); ) R.heap[X] = R.heap[V], X = V, V <<= 1;
+          R.heap[X] = Z;
         }
-        function Te(D, B, X) {
+        function Te(R, B, X) {
           var Z, V, $, ne, Q = 0;
-          if (D.last_lit !== 0) for (; Z = D.pending_buf[D.d_buf + 2 * Q] << 8 | D.pending_buf[D.d_buf + 2 * Q + 1], V = D.pending_buf[D.l_buf + Q], Q++, Z === 0 ? q(D, V, B) : (q(D, ($ = b[V]) + d + 1, B), (ne = E[$]) !== 0 && ee(D, V -= I[$], ne), q(D, $ = O(--Z), X), (ne = P[$]) !== 0 && ee(D, Z -= H[$], ne)), Q < D.last_lit; ) ;
-          q(D, x, B);
+          if (R.last_lit !== 0) for (; Z = R.pending_buf[R.d_buf + 2 * Q] << 8 | R.pending_buf[R.d_buf + 2 * Q + 1], V = R.pending_buf[R.l_buf + Q], Q++, Z === 0 ? q(R, V, B) : (q(R, ($ = b[V]) + d + 1, B), (ne = E[$]) !== 0 && ee(R, V -= I[$], ne), q(R, $ = O(--Z), X), (ne = P[$]) !== 0 && ee(R, Z -= H[$], ne)), Q < R.last_lit; ) ;
+          q(R, x, B);
         }
-        function Ie(D, B) {
+        function Ie(R, B) {
           var X, Z, V, $ = B.dyn_tree, ne = B.stat_desc.static_tree, Q = B.stat_desc.has_stree, ie = B.stat_desc.elems, he = -1;
-          for (D.heap_len = 0, D.heap_max = u, X = 0; X < ie; X++) $[2 * X] !== 0 ? (D.heap[++D.heap_len] = he = X, D.depth[X] = 0) : $[2 * X + 1] = 0;
-          for (; D.heap_len < 2; ) $[2 * (V = D.heap[++D.heap_len] = he < 2 ? ++he : 0)] = 1, D.depth[V] = 0, D.opt_len--, Q && (D.static_len -= ne[2 * V + 1]);
-          for (B.max_code = he, X = D.heap_len >> 1; 1 <= X; X--) me(D, $, X);
-          for (V = ie; X = D.heap[1], D.heap[1] = D.heap[D.heap_len--], me(D, $, 1), Z = D.heap[1], D.heap[--D.heap_max] = X, D.heap[--D.heap_max] = Z, $[2 * V] = $[2 * X] + $[2 * Z], D.depth[V] = (D.depth[X] >= D.depth[Z] ? D.depth[X] : D.depth[Z]) + 1, $[2 * X + 1] = $[2 * Z + 1] = V, D.heap[1] = V++, me(D, $, 1), 2 <= D.heap_len; ) ;
-          D.heap[--D.heap_max] = D.heap[1], (function(ae, Ee) {
-            var Je, De, Bt, ye, sn, Mn, Qe = Ee.dyn_tree, Tt = Ee.max_code, Nt = Ee.stat_desc.static_tree, Ft = Ee.stat_desc.has_stree, Ut = Ee.stat_desc.extra_bits, Et = Ee.stat_desc.extra_base, Sn = Ee.stat_desc.max_length, Zn = 0;
+          for (R.heap_len = 0, R.heap_max = u, X = 0; X < ie; X++) $[2 * X] !== 0 ? (R.heap[++R.heap_len] = he = X, R.depth[X] = 0) : $[2 * X + 1] = 0;
+          for (; R.heap_len < 2; ) $[2 * (V = R.heap[++R.heap_len] = he < 2 ? ++he : 0)] = 1, R.depth[V] = 0, R.opt_len--, Q && (R.static_len -= ne[2 * V + 1]);
+          for (B.max_code = he, X = R.heap_len >> 1; 1 <= X; X--) me(R, $, X);
+          for (V = ie; X = R.heap[1], R.heap[1] = R.heap[R.heap_len--], me(R, $, 1), Z = R.heap[1], R.heap[--R.heap_max] = X, R.heap[--R.heap_max] = Z, $[2 * V] = $[2 * X] + $[2 * Z], R.depth[V] = (R.depth[X] >= R.depth[Z] ? R.depth[X] : R.depth[Z]) + 1, $[2 * X + 1] = $[2 * Z + 1] = V, R.heap[1] = V++, me(R, $, 1), 2 <= R.heap_len; ) ;
+          R.heap[--R.heap_max] = R.heap[1], (function(ae, Ee) {
+            var Je, Re, Bt, ye, sn, Mn, Qe = Ee.dyn_tree, Tt = Ee.max_code, Nt = Ee.stat_desc.static_tree, Ft = Ee.stat_desc.has_stree, Ut = Ee.stat_desc.extra_bits, Et = Ee.stat_desc.extra_base, Sn = Ee.stat_desc.max_length, Zn = 0;
             for (ye = 0; ye <= g; ye++) ae.bl_count[ye] = 0;
-            for (Qe[2 * ae.heap[ae.heap_max] + 1] = 0, Je = ae.heap_max + 1; Je < u; Je++) Sn < (ye = Qe[2 * Qe[2 * (De = ae.heap[Je]) + 1] + 1] + 1) && (ye = Sn, Zn++), Qe[2 * De + 1] = ye, Tt < De || (ae.bl_count[ye]++, sn = 0, Et <= De && (sn = Ut[De - Et]), Mn = Qe[2 * De], ae.opt_len += Mn * (ye + sn), Ft && (ae.static_len += Mn * (Nt[2 * De + 1] + sn)));
+            for (Qe[2 * ae.heap[ae.heap_max] + 1] = 0, Je = ae.heap_max + 1; Je < u; Je++) Sn < (ye = Qe[2 * Qe[2 * (Re = ae.heap[Je]) + 1] + 1] + 1) && (ye = Sn, Zn++), Qe[2 * Re + 1] = ye, Tt < Re || (ae.bl_count[ye]++, sn = 0, Et <= Re && (sn = Ut[Re - Et]), Mn = Qe[2 * Re], ae.opt_len += Mn * (ye + sn), Ft && (ae.static_len += Mn * (Nt[2 * Re + 1] + sn)));
             if (Zn !== 0) {
               do {
                 for (ye = Sn - 1; ae.bl_count[ye] === 0; ) ye--;
                 ae.bl_count[ye]--, ae.bl_count[ye + 1] += 2, ae.bl_count[Sn]--, Zn -= 2;
               } while (0 < Zn);
-              for (ye = Sn; ye !== 0; ye--) for (De = ae.bl_count[ye]; De !== 0; ) Tt < (Bt = ae.heap[--Je]) || (Qe[2 * Bt + 1] !== ye && (ae.opt_len += (ye - Qe[2 * Bt + 1]) * Qe[2 * Bt], Qe[2 * Bt + 1] = ye), De--);
+              for (ye = Sn; ye !== 0; ye--) for (Re = ae.bl_count[ye]; Re !== 0; ) Tt < (Bt = ae.heap[--Je]) || (Qe[2 * Bt + 1] !== ye && (ae.opt_len += (ye - Qe[2 * Bt + 1]) * Qe[2 * Bt], Qe[2 * Bt + 1] = ye), Re--);
             }
-          })(D, B), pe($, he, D.bl_count);
+          })(R, B), pe($, he, R.bl_count);
         }
-        function S(D, B, X) {
+        function S(R, B, X) {
           var Z, V, $ = -1, ne = B[1], Q = 0, ie = 7, he = 4;
-          for (ne === 0 && (ie = 138, he = 3), B[2 * (X + 1) + 1] = 65535, Z = 0; Z <= X; Z++) V = ne, ne = B[2 * (Z + 1) + 1], ++Q < ie && V === ne || (Q < he ? D.bl_tree[2 * V] += Q : V !== 0 ? (V !== $ && D.bl_tree[2 * V]++, D.bl_tree[2 * _]++) : Q <= 10 ? D.bl_tree[2 * v]++ : D.bl_tree[2 * C]++, $ = V, he = (Q = 0) === ne ? (ie = 138, 3) : V === ne ? (ie = 6, 3) : (ie = 7, 4));
+          for (ne === 0 && (ie = 138, he = 3), B[2 * (X + 1) + 1] = 65535, Z = 0; Z <= X; Z++) V = ne, ne = B[2 * (Z + 1) + 1], ++Q < ie && V === ne || (Q < he ? R.bl_tree[2 * V] += Q : V !== 0 ? (V !== $ && R.bl_tree[2 * V]++, R.bl_tree[2 * _]++) : Q <= 10 ? R.bl_tree[2 * v]++ : R.bl_tree[2 * C]++, $ = V, he = (Q = 0) === ne ? (ie = 138, 3) : V === ne ? (ie = 6, 3) : (ie = 7, 4));
         }
-        function W(D, B, X) {
+        function W(R, B, X) {
           var Z, V, $ = -1, ne = B[1], Q = 0, ie = 7, he = 4;
           for (ne === 0 && (ie = 138, he = 3), Z = 0; Z <= X; Z++) if (V = ne, ne = B[2 * (Z + 1) + 1], !(++Q < ie && V === ne)) {
-            if (Q < he) for (; q(D, V, D.bl_tree), --Q != 0; ) ;
-            else V !== 0 ? (V !== $ && (q(D, V, D.bl_tree), Q--), q(D, _, D.bl_tree), ee(D, Q - 3, 2)) : Q <= 10 ? (q(D, v, D.bl_tree), ee(D, Q - 3, 3)) : (q(D, C, D.bl_tree), ee(D, Q - 11, 7));
+            if (Q < he) for (; q(R, V, R.bl_tree), --Q != 0; ) ;
+            else V !== 0 ? (V !== $ && (q(R, V, R.bl_tree), Q--), q(R, _, R.bl_tree), ee(R, Q - 3, 2)) : Q <= 10 ? (q(R, v, R.bl_tree), ee(R, Q - 3, 3)) : (q(R, C, R.bl_tree), ee(R, Q - 11, 7));
             $ = V, he = (Q = 0) === ne ? (ie = 138, 3) : V === ne ? (ie = 6, 3) : (ie = 7, 4);
           }
         }
         l(H);
         var G = !1;
-        function L(D, B, X, Z) {
-          ee(D, (h << 1) + (Z ? 1 : 0), 3), (function(V, $, ne, Q) {
+        function L(R, B, X, Z) {
+          ee(R, (h << 1) + (Z ? 1 : 0), 3), (function(V, $, ne, Q) {
             oe(V), te(V, ne), te(V, ~ne), s.arraySet(V.pending_buf, V.window, $, ne, V.pending), V.pending += ne;
-          })(D, B, X);
+          })(R, B, X);
         }
-        i._tr_init = function(D) {
+        i._tr_init = function(R) {
           G || ((function() {
             var B, X, Z, V, $, ne = new Array(g + 1);
             for (V = Z = 0; V < c - 1; V++) for (I[V] = Z, B = 0; B < 1 << E[V]; B++) b[Z++] = V;
@@ -5684,30 +5684,30 @@ function wc() {
             for (; B <= 287; ) z[2 * B + 1] = 8, B++, ne[8]++;
             for (pe(z, m + 1, ne), B = 0; B < p; B++) T[2 * B + 1] = 5, T[2 * B] = ce(B, 5);
             U = new Y(z, E, d + 1, m, g), F = new Y(T, P, 0, p, g), K = new Y(new Array(0), A, 0, f, w);
-          })(), G = !0), D.l_desc = new N(D.dyn_ltree, U), D.d_desc = new N(D.dyn_dtree, F), D.bl_desc = new N(D.bl_tree, K), D.bi_buf = 0, D.bi_valid = 0, se(D);
-        }, i._tr_stored_block = L, i._tr_flush_block = function(D, B, X, Z) {
+          })(), G = !0), R.l_desc = new N(R.dyn_ltree, U), R.d_desc = new N(R.dyn_dtree, F), R.bl_desc = new N(R.bl_tree, K), R.bi_buf = 0, R.bi_valid = 0, se(R);
+        }, i._tr_stored_block = L, i._tr_flush_block = function(R, B, X, Z) {
           var V, $, ne = 0;
-          0 < D.level ? (D.strm.data_type === 2 && (D.strm.data_type = (function(Q) {
+          0 < R.level ? (R.strm.data_type === 2 && (R.strm.data_type = (function(Q) {
             var ie, he = 4093624447;
             for (ie = 0; ie <= 31; ie++, he >>>= 1) if (1 & he && Q.dyn_ltree[2 * ie] !== 0) return r;
             if (Q.dyn_ltree[18] !== 0 || Q.dyn_ltree[20] !== 0 || Q.dyn_ltree[26] !== 0) return a;
             for (ie = 32; ie < d; ie++) if (Q.dyn_ltree[2 * ie] !== 0) return a;
             return r;
-          })(D)), Ie(D, D.l_desc), Ie(D, D.d_desc), ne = (function(Q) {
+          })(R)), Ie(R, R.l_desc), Ie(R, R.d_desc), ne = (function(Q) {
             var ie;
-            for (S(Q, Q.dyn_ltree, Q.l_desc.max_code), S(Q, Q.dyn_dtree, Q.d_desc.max_code), Ie(Q, Q.bl_desc), ie = f - 1; 3 <= ie && Q.bl_tree[2 * R[ie] + 1] === 0; ie--) ;
+            for (S(Q, Q.dyn_ltree, Q.l_desc.max_code), S(Q, Q.dyn_dtree, Q.d_desc.max_code), Ie(Q, Q.bl_desc), ie = f - 1; 3 <= ie && Q.bl_tree[2 * D[ie] + 1] === 0; ie--) ;
             return Q.opt_len += 3 * (ie + 1) + 5 + 5 + 4, ie;
-          })(D), V = D.opt_len + 3 + 7 >>> 3, ($ = D.static_len + 3 + 7 >>> 3) <= V && (V = $)) : V = $ = X + 5, X + 4 <= V && B !== -1 ? L(D, B, X, Z) : D.strategy === 4 || $ === V ? (ee(D, 2 + (Z ? 1 : 0), 3), Te(D, z, T)) : (ee(D, 4 + (Z ? 1 : 0), 3), (function(Q, ie, he, ae) {
+          })(R), V = R.opt_len + 3 + 7 >>> 3, ($ = R.static_len + 3 + 7 >>> 3) <= V && (V = $)) : V = $ = X + 5, X + 4 <= V && B !== -1 ? L(R, B, X, Z) : R.strategy === 4 || $ === V ? (ee(R, 2 + (Z ? 1 : 0), 3), Te(R, z, T)) : (ee(R, 4 + (Z ? 1 : 0), 3), (function(Q, ie, he, ae) {
             var Ee;
-            for (ee(Q, ie - 257, 5), ee(Q, he - 1, 5), ee(Q, ae - 4, 4), Ee = 0; Ee < ae; Ee++) ee(Q, Q.bl_tree[2 * R[Ee] + 1], 3);
+            for (ee(Q, ie - 257, 5), ee(Q, he - 1, 5), ee(Q, ae - 4, 4), Ee = 0; Ee < ae; Ee++) ee(Q, Q.bl_tree[2 * D[Ee] + 1], 3);
             W(Q, Q.dyn_ltree, ie - 1), W(Q, Q.dyn_dtree, he - 1);
-          })(D, D.l_desc.max_code + 1, D.d_desc.max_code + 1, ne + 1), Te(D, D.dyn_ltree, D.dyn_dtree)), se(D), Z && oe(D);
-        }, i._tr_tally = function(D, B, X) {
-          return D.pending_buf[D.d_buf + 2 * D.last_lit] = B >>> 8 & 255, D.pending_buf[D.d_buf + 2 * D.last_lit + 1] = 255 & B, D.pending_buf[D.l_buf + D.last_lit] = 255 & X, D.last_lit++, B === 0 ? D.dyn_ltree[2 * X]++ : (D.matches++, B--, D.dyn_ltree[2 * (b[X] + d + 1)]++, D.dyn_dtree[2 * O(B)]++), D.last_lit === D.lit_bufsize - 1;
-        }, i._tr_align = function(D) {
-          ee(D, 2, 3), q(D, x, z), (function(B) {
+          })(R, R.l_desc.max_code + 1, R.d_desc.max_code + 1, ne + 1), Te(R, R.dyn_ltree, R.dyn_dtree)), se(R), Z && oe(R);
+        }, i._tr_tally = function(R, B, X) {
+          return R.pending_buf[R.d_buf + 2 * R.last_lit] = B >>> 8 & 255, R.pending_buf[R.d_buf + 2 * R.last_lit + 1] = 255 & B, R.pending_buf[R.l_buf + R.last_lit] = 255 & X, R.last_lit++, B === 0 ? R.dyn_ltree[2 * X]++ : (R.matches++, B--, R.dyn_ltree[2 * (b[X] + d + 1)]++, R.dyn_dtree[2 * O(B)]++), R.last_lit === R.lit_bufsize - 1;
+        }, i._tr_align = function(R) {
+          ee(R, 2, 3), q(R, x, z), (function(B) {
             B.bi_valid === 16 ? (te(B, B.bi_buf), B.bi_buf = 0, B.bi_valid = 0) : 8 <= B.bi_valid && (B.pending_buf[B.pending++] = 255 & B.bi_buf, B.bi_buf >>= 8, B.bi_valid -= 8);
-          })(D);
+          })(R);
         };
       }, { "../utils/common": 41 }], 53: [function(t, n, i) {
         n.exports = function() {
@@ -5812,7 +5812,7 @@ function vc(o) {
   let e;
   return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? e = ArrayBuffer.isView(o) : e = o && o.buffer && ca(o.buffer), e;
 }
-const bc = Ji("string"), He = Ji("function"), ha = Ji("number"), Gn = (o) => o !== null && typeof o == "object", Mc = (o) => o === !0 || o === !1, Ri = (o) => {
+const bc = Ji("string"), He = Ji("function"), ha = Ji("number"), Gn = (o) => o !== null && typeof o == "object", Mc = (o) => o === !0 || o === !1, Di = (o) => {
   if ($i(o) !== "object")
     return !1;
   const e = ur(o);
@@ -5825,11 +5825,11 @@ const bc = Ji("string"), He = Ji("function"), ha = Ji("number"), Gn = (o) => o !
   } catch {
     return !1;
   }
-}, Tc = at("Date"), Ec = at("File"), Ac = at("Blob"), Cc = at("FileList"), Pc = (o) => Gn(o) && He(o.pipe), Rc = (o) => {
+}, Tc = at("Date"), Ec = at("File"), Ac = at("Blob"), Cc = at("FileList"), Pc = (o) => Gn(o) && He(o.pipe), Dc = (o) => {
   let e;
   return o && (typeof FormData == "function" && o instanceof FormData || He(o.append) && ((e = $i(o)) === "formdata" || // detect form-data instance
   e === "object" && He(o.toString) && o.toString() === "[object FormData]"));
-}, Dc = at("URLSearchParams"), [kc, Ic, Lc, zc] = ["ReadableStream", "Request", "Response", "Headers"].map(at), Oc = (o) => o.trim ? o.trim() : o.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
+}, Rc = at("URLSearchParams"), [kc, Ic, Lc, zc] = ["ReadableStream", "Request", "Response", "Headers"].map(at), Oc = (o) => o.trim ? o.trim() : o.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
 function Wn(o, e, { allOwnKeys: t = !1 } = {}) {
   if (o === null || typeof o > "u")
     return;
@@ -5861,7 +5861,7 @@ const Yt = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typ
 function Vs() {
   const { caseless: o, skipUndefined: e } = da(this) && this || {}, t = {}, n = (i, s) => {
     const r = o && ua(t, s) || s;
-    Ri(t[r]) && Ri(i) ? t[r] = Vs(t[r], i) : Ri(i) ? t[r] = Vs({}, i) : vn(i) ? t[r] = i.slice() : (!e || !_n(i)) && (t[r] = i);
+    Di(t[r]) && Di(i) ? t[r] = Vs(t[r], i) : Di(i) ? t[r] = Vs({}, i) : vn(i) ? t[r] = i.slice() : (!e || !_n(i)) && (t[r] = i);
   };
   for (let i = 0, s = arguments.length; i < s; i++)
     arguments[i] && Wn(arguments[i], n);
@@ -5977,13 +5977,13 @@ const eh = (o) => {
   isArray: vn,
   isArrayBuffer: ca,
   isBuffer: jn,
-  isFormData: Rc,
+  isFormData: Dc,
   isArrayBufferView: vc,
   isString: bc,
   isNumber: ha,
   isBoolean: Mc,
   isObject: Gn,
-  isPlainObject: Ri,
+  isPlainObject: Di,
   isEmptyObject: Sc,
   isReadableStream: kc,
   isRequest: Ic,
@@ -5996,7 +5996,7 @@ const eh = (o) => {
   isRegExp: qc,
   isFunction: He,
   isStream: Pc,
-  isURLSearchParams: Dc,
+  isURLSearchParams: Rc,
   isTypedArray: jc,
   isFileList: Cc,
   forEach: Wn,
@@ -6434,8 +6434,8 @@ const vh = j.toObjectSet([
 function Tn(o) {
   return o && String(o).trim().toLowerCase();
 }
-function Di(o) {
-  return o === !1 || o == null ? o : j.isArray(o) ? o.map(Di) : String(o);
+function Ri(o) {
+  return o === !1 || o == null ? o : j.isArray(o) ? o.map(Ri) : String(o);
 }
 function Mh(o) {
   const e = /* @__PURE__ */ Object.create(null), t = /([^\s,;=]+)\s*(?:=\s*([^,;]+))?/g;
@@ -6480,7 +6480,7 @@ let je = class {
       if (!c)
         throw new Error("header name must be a non-empty string");
       const d = j.findKey(i, c);
-      (!d || i[d] === void 0 || h === !0 || h === void 0 && i[d] !== !1) && (i[d || l] = Di(a));
+      (!d || i[d] === void 0 || h === !0 || h === void 0 && i[d] !== !1) && (i[d || l] = Ri(a));
     }
     const r = (a, l) => j.forEach(a, (h, c) => s(h, c, l));
     if (j.isPlainObject(e) || e instanceof this.constructor)
@@ -6548,11 +6548,11 @@ let je = class {
     return j.forEach(this, (i, s) => {
       const r = j.findKey(n, s);
       if (r) {
-        t[r] = Di(i), delete t[s];
+        t[r] = Ri(i), delete t[s];
         return;
       }
       const a = e ? Th(s) : String(s).trim();
-      a !== s && delete t[s], t[a] = Di(i), n[a] = !0;
+      a !== s && delete t[s], t[a] = Ri(i), n[a] = !0;
     }), this;
   }
   concat(...e) {
@@ -6690,10 +6690,10 @@ const Vi = (o, e, t = 3) => {
     total: o,
     loaded: n
   }), e[1]];
-}, Nr = (o) => (...e) => j.asap(() => o(...e)), Rh = ke.hasStandardBrowserEnv ? /* @__PURE__ */ ((o, e) => (t) => (t = new URL(t, ke.origin), o.protocol === t.protocol && o.host === t.host && (e || o.port === t.port)))(
+}, Nr = (o) => (...e) => j.asap(() => o(...e)), Dh = ke.hasStandardBrowserEnv ? /* @__PURE__ */ ((o, e) => (t) => (t = new URL(t, ke.origin), o.protocol === t.protocol && o.host === t.host && (e || o.port === t.port)))(
   new URL(ke.origin),
   ke.navigator && /(msie|trident)/i.test(ke.navigator.userAgent)
-) : () => !0, Dh = ke.hasStandardBrowserEnv ? (
+) : () => !0, Rh = ke.hasStandardBrowserEnv ? (
   // Standard browser envs support document.cookie
   {
     write(o, e, t, n, i, s, r) {
@@ -6813,8 +6813,8 @@ const Ta = (o) => {
       });
     }
   }
-  if (ke.hasStandardBrowserEnv && (n && j.isFunction(n) && (n = n(e)), n || n !== !1 && Rh(e.url))) {
-    const l = i && s && Dh.read(s);
+  if (ke.hasStandardBrowserEnv && (n && j.isFunction(n) && (n = n(e)), n || n !== !1 && Dh(e.url))) {
+    const l = i && s && Rh.read(s);
     l && r.set(i, l);
   }
   return e;
@@ -7027,7 +7027,7 @@ const Ta = (o) => {
       responseType: E,
       headers: P,
       withCredentials: A = "same-origin",
-      fetchOptions: R
+      fetchOptions: D
     } = Ta(f), z = e || fetch;
     E = E ? (E + "").toLowerCase() : "text";
     let T = Oh([w, x && x.toAbortSignal()], _), k = null;
@@ -7052,7 +7052,7 @@ const Ta = (o) => {
       }
       j.isString(A) || (A = A ? "include" : "omit");
       const U = s && "credentials" in t.prototype, F = {
-        ...R,
+        ...D,
         signal: T,
         method: g.toUpperCase(),
         headers: P.normalize().toJSON(),
@@ -7061,7 +7061,7 @@ const Ta = (o) => {
         credentials: U ? A : void 0
       };
       k = s && new t(u, F);
-      let K = await (s ? z(k, R) : z(u, F));
+      let K = await (s ? z(k, D) : z(u, F));
       const H = c && (E === "stream" || E === "response");
       if (c && (v || H && b)) {
         const N = {};
@@ -7520,13 +7520,13 @@ const Gs = {
 Object.entries(Gs).forEach(([o, e]) => {
   Gs[e] = o;
 });
-function Ra(o) {
+function Da(o) {
   const e = new $t(o), t = aa($t.prototype.request, e);
   return j.extend(t, $t.prototype, e, { allOwnKeys: !0 }), j.extend(t, e, null, { allOwnKeys: !0 }), t.create = function(i) {
-    return Ra(Qt(o, i));
+    return Da(Qt(o, i));
   }, t;
 }
-const xe = Ra(Xn);
+const xe = Da(Xn);
 xe.Axios = $t;
 xe.CanceledError = bn;
 xe.CancelToken = Xh;
@@ -7610,7 +7610,7 @@ function Yh(o, e) {
     console.error("下载zip文件失败:", t), e(/* @__PURE__ */ new Map());
   });
 }
-function Da(o, e) {
+function Ra(o, e) {
   xe({
     method: "get",
     responseType: "blob",
@@ -7901,8 +7901,8 @@ function $h() {
       C = new c(x / c.BYTES_PER_ELEMENT);
       let E = 0;
       for (let P = 0, A = v.length; P < A; P++) {
-        for (let R = 0; R < p; R++)
-          C[E + R] = v[P * p + R];
+        for (let D = 0; D < p; D++)
+          C[E + D] = v[P * p + D];
         E += y;
       }
     }
@@ -7935,7 +7935,7 @@ function $h() {
 }
 var zt = /* @__PURE__ */ ((o) => (o.ModelLoadStart = "model-load-start", o.ModelLoadProgress = "model-load-progress", o.ModelLoaded = "model-loaded", o.ModelError = "model-error", o.SelectionChanged = "selection-changed", o.HoverChanged = "hover-changed", o.Click = "click", o.MouseMove = "mouse-move", o.CameraChanged = "camera-changed", o.CameraIdle = "camera-idle", o.ViewportResize = "viewport-resize", o.EngineFree = "engine-free", o.EngineBusy = "engine-busy", o.MeasureChanged = "measure-changed", o.SectionMove = "section-move", o))(zt || {});
 function Jh(o, e, t, n) {
-  let i = 0, s = 0, r = 0, a = o.models.find((p) => p.url == t), l = e.circularMeps, h = e.rectMeps.filter((p) => p.type === "风管"), c = e.rectMeps.filter((p) => p.type === "桥架"), d = e.ellipseMeps, m = o.scene;
+  let i = 0, s = 0, r = 0, a = o.models.find((p) => p.url == t), l = e.circularMeps, h = e.rectMeps?.filter((p) => p.type === "风管"), c = e.rectMeps?.filter((p) => p.type === "桥架"), d = e.ellipseMeps, m = o.scene;
   if (new M.MeshBasicMaterial(), new M.BufferGeometry(), l && l.length) {
     let p = [], f = 0;
     for (let u of l)
@@ -8048,8 +8048,8 @@ function oi(o, e, t, n, i) {
     const C = new M.Euler(w, x, _, "YXZ");
     let E = v.clone().makeRotationFromEuler(C), P, A;
     o === "Circle" ? (P = p.diameter, A = p.diameter) : (P = p.width, A = p.height);
-    let R = v.clone().makeScale(P, A, p.length);
-    v.multiplyMatrices(E, R), v.setPosition(p.position.x, p.position.y, p.position.z), s.setMatrixAt(c, v.clone()), s.setColorAt(c, p.color), s.geometry.computeBoundingBox();
+    let D = v.clone().makeScale(P, A, p.length);
+    v.multiplyMatrices(E, D), v.setPosition(p.position.x, p.position.y, p.position.z), s.setMatrixAt(c, v.clone()), s.setColorAt(c, p.color), s.geometry.computeBoundingBox();
     let z = s.geometry.boundingBox.min.clone().applyMatrix4(v.clone()), T = s.geometry.boundingBox.max.clone().applyMatrix4(v.clone()), k = new M.Vector3(Math.min(z.x, T.x), Math.min(z.y, T.y), Math.min(z.z, T.z)), b = new M.Vector3(Math.max(z.x, T.x), Math.max(z.y, T.y), Math.max(z.z, T.z)), I = k.clone().add(b.clone()).multiplyScalar(0.5), U = {
       name: p.name,
       min: k,
@@ -9104,10 +9104,10 @@ function Xs(o) {
       throw new Error("THREE.GLTFLoader: Unsupported normalized accessor component type.");
   }
 }
-function Ru(o) {
+function Du(o) {
   return o.search(/\.jpe?g($|\?)/i) > 0 || o.search(/^data\:image\/jpeg/) === 0 ? "image/jpeg" : o.search(/\.webp($|\?)/i) > 0 || o.search(/^data\:image\/webp/) === 0 ? "image/webp" : o.search(/\.ktx2($|\?)/i) > 0 || o.search(/^data\:image\/ktx2/) === 0 ? "image/ktx2" : "image/png";
 }
-const Du = new Me();
+const Ru = new Me();
 class ku {
   constructor(e = {}, t = {}) {
     this.json = e, this.extensions = {}, this.plugins = {}, this.options = t, this.cache = new eu(), this.associations = /* @__PURE__ */ new Map(), this.primitiveCache = {}, this.nodeCache = {}, this.meshCache = { refs: {}, uses: {} }, this.cameraCache = { refs: {}, uses: {} }, this.lightCache = { refs: {}, uses: {} }, this.sourceCache = {}, this.textureCache = {}, this.nodeNamesUsed = {};
@@ -9435,7 +9435,7 @@ class ku {
         }), t.load(Nn.resolveURL(d, s.path), f, void 0, p);
       });
     }).then(function(d) {
-      return h === !0 && a.revokeObjectURL(l), ct(d, r), d.userData.mimeType = r.mimeType || Ru(r.uri), d;
+      return h === !0 && a.revokeObjectURL(l), ct(d, r), d.userData.mimeType = r.mimeType || Du(r.uri), d;
     }).catch(function(d) {
       throw console.error("THREE.GLTFLoader: Couldn't load texture", l), d;
     });
@@ -9640,7 +9640,7 @@ class ku {
       console.warn("THREE.GLTFLoader: Missing camera parameters.");
       return;
     }
-    return n.type === "perspective" ? t = new Rl(or.radToDeg(i.yfov), i.aspectRatio || 1, i.znear || 1, i.zfar || 2e6) : n.type === "orthographic" && (t = new Vo(-i.xmag, i.xmag, i.ymag, -i.ymag, i.znear, i.zfar)), n.name && (t.name = this.createUniqueName(n.name)), ct(t, n), Promise.resolve(t);
+    return n.type === "perspective" ? t = new Dl(or.radToDeg(i.yfov), i.aspectRatio || 1, i.znear || 1, i.zfar || 2e6) : n.type === "orthographic" && (t = new Vo(-i.xmag, i.xmag, i.ymag, -i.ymag, i.znear, i.zfar)), n.name && (t.name = this.createUniqueName(n.name)), ct(t, n), Promise.resolve(t);
   }
   /**
    * Specification: https://github.com/KhronosGroup/glTF/tree/master/specification/2.0#skins
@@ -9664,7 +9664,7 @@ class ku {
         } else
           console.warn('THREE.GLTFLoader: Joint "%s" could not be found.', t.joints[h]);
       }
-      return new Dl(a, l);
+      return new Rl(a, l);
     });
   }
   /**
@@ -9692,10 +9692,10 @@ class ku {
         const v = m[x], C = p[x], E = f[x], P = u[x], A = g[x];
         if (v === void 0) continue;
         v.updateMatrix && v.updateMatrix();
-        const R = n._createAnimationTracks(v, C, E, P, A);
-        if (R)
-          for (let z = 0; z < R.length; z++)
-            y.push(R[z]);
+        const D = n._createAnimationTracks(v, C, E, P, A);
+        if (D)
+          for (let z = 0; z < D.length; z++)
+            y.push(D[z]);
       }
       const w = new kl(s, void 0, y);
       return ct(w, i), w;
@@ -9731,7 +9731,7 @@ class ku {
     ]).then(function(h) {
       const c = h[0], d = h[1], m = h[2];
       m !== null && c.traverse(function(p) {
-        p.isSkinnedMesh && p.bind(m, Du);
+        p.isSkinnedMesh && p.bind(m, Ru);
       });
       for (let p = 0, f = d.length; p < f; p++)
         c.add(d[p]);
@@ -9923,7 +9923,7 @@ function eo(o, e, t) {
 }
 function Lu(o, e, t) {
   let n = new M.Group();
-  n.name = e, o.scene.add(n), Da(e + "/info", (i) => {
+  n.name = e, o.scene.add(n), Ra(e + "/info", (i) => {
     let s = JSON.parse(i);
     o.engineStatus.models.push({
       type: "light",
@@ -10217,38 +10217,41 @@ class Gu {
   handelKeyCtrlDown() {
     this.isCtrlDown = !0;
   }
-  // 监听鼠标按下
+  // 监听鼠标按下 
   hoverOldId = null;
+  timeOutEvent;
   // 鼠标移动时，触发模型高亮
   handleMouseMove(e) {
-    if (!this.engine.engineStatus.isFree) {
+    if (this.timeOutEvent != null && (clearTimeout(this.timeOutEvent), this.timeOutEvent = null), e.catch != null && (this.engine.hoverHighLight.showModelNameTag(null, null), this.timeOutEvent = setTimeout(() => {
+      this.hoverOldId = null;
+      let n = this.getCatchMeshs(e, !0);
+      n.length > 0 && this.engine.hoverHighLight.showModelNameTag({ url: n[0].url, ids: [n[0].name] }, e.catch.point);
+    }, 1e3)), !this.engine.engineStatus.isFree) {
       this.engine.hoverHighLight.clearHighlight();
       return;
     }
     let t = this.getCatchMeshs(e);
     t != null ? t.length > 0 && this.engine.hoverHighLight.hightMesh(t) : this.engine.hoverHighLight.clearHighlight();
   }
-  getCatchMeshs(e) {
+  getCatchMeshs(e, t = !1) {
     if (e.catch == null)
       return this.hoverOldId = null, null;
     if (e.catch.object.isInstance) {
-      let t = e.catch.object, n = e.catch.object.id, i = this.engine.models.find((a) => a.url == t.url).nodesMap.get(n), s = /* @__PURE__ */ new Map();
-      i?.indexes.forEach((a) => {
-        this.engine.scene.children[a[0]] instanceof M.InstancedMesh && (s.has(a[0]) ? s.get(a[0])?.push(a[1]) : s.set(a[0], [a[1]]));
+      let n = e.catch.object, i = e.catch.object.id, s = this.engine.models.find((l) => l.url == n.url).nodesMap.get(i), r = /* @__PURE__ */ new Map();
+      s?.indexes.forEach((l) => {
+        this.engine.scene.children[l[0]] instanceof M.InstancedMesh && (r.has(l[0]) ? r.get(l[0])?.push(l[1]) : r.set(l[0], [l[1]]));
       });
-      let r = [];
-      return s.forEach((a, l) => {
-        let h = this.engine.scene.children[l];
-        a.forEach((c) => {
-          let d = h.geometry.clone();
-          d.applyMatrix4(h.matrixs[c]), r.push(new M.Mesh(d, h.material));
+      let a = [];
+      return r.forEach((l, h) => {
+        let c = this.engine.scene.children[h];
+        l.forEach((d) => {
+          let m = c.geometry.clone();
+          m.applyMatrix4(c.matrixs[d]), a.push(new M.Mesh(m, c.material));
         });
-      }), this.hoverOldId == n ? [] : (this.hoverOldId = n, this.engine.hoverHighLight.clearHighlight(), r);
+      }), this.hoverOldId == i ? [] : (this.hoverOldId = i, t || this.engine.hoverHighLight.clearHighlight(), a);
     } else {
-      const t = e.catch;
-      t.object;
-      let n = t.object, i = n.name, a = this.engine.models.find((l) => l.url === n.url).nodesMap.get(i).infos.map((l) => l.mesh);
-      return this.hoverOldId == i ? [] : (this.hoverOldId = i, this.engine.hoverHighLight.clearHighlight(), a);
+      let i = e.catch.object, s = i.name, l = this.engine.models.find((h) => h.url === i.url).nodesMap.get(s).infos.map((h) => h.mesh);
+      return this.hoverOldId == s ? [] : (this.hoverOldId = s, t || this.engine.hoverHighLight.clearHighlight(), l);
     }
   }
   // 业务功能-监听鼠标谈起，点选模型
@@ -10264,10 +10267,10 @@ class Gu {
   handleMouseDoubleClick(e) {
     if (e.catch) {
       const n = e.catch;
-      n.object;
       let i = n.object, r = this.engine.models.find((a) => a.url === i.url).nodesMap.get(i.name);
       if (n.object.isInstance) {
-        let a = n.matrix, l = [];
+        let a = n.matrix;
+        const l = [];
         r.indexes.forEach((c) => {
           let d = c[0], m = this.engine.scene.children[d].geometry.boundingSphere;
           const p = new M.Box3(), f = m.center.clone().applyMatrix4(a), u = m.radius, g = new M.Vector3();
@@ -10286,7 +10289,8 @@ class Gu {
         let h = t(l);
         this.engine.viewCube.zoomToModel(h);
       } else {
-        let a = r.infos.map((h) => h.box), l = t(a);
+        const a = r.infos.map((h) => h.box);
+        let l = t(a);
         this.engine.viewCube.zoomToModel(l);
       }
     }
@@ -10806,8 +10810,27 @@ class Hi {
   animStartTime = 0;
   static FADE_IN_MS = 200;
   static FADE_OUT_MS = 150;
+  tagDiv;
   constructor(e) {
     this.engine = e, this.init();
+    const t = document.createElement("div");
+    this.tagDiv = t, t.className = "tagDiv", t.style.position = "absolute", t.style.top = "0px", t.style.left = "0px", t.style.borderRadius = "10px", t.style.pointerEvents = "none", this.engine.container.appendChild(this.tagDiv);
+  }
+  // 生成悬浮框显示模型名称
+  showModelNameTag(e, t) {
+    if (e == null) {
+      this.tagDiv.style.display = "none";
+      return;
+    }
+    let n = this.engine.models.find((a) => a.url == e.url);
+    if (n == null) {
+      this.tagDiv.style.display = "none";
+      return;
+    }
+    let i = n.nodesMap.get(e.ids[0]);
+    i.infos && i.infos.length > 0 && (this.tagDiv.innerHTML = i.infos[0].name);
+    const r = this.engine.worldToScreen.worldToScreen(t);
+    this.tagDiv ? (this.tagDiv.style.left = r.x + 10 + this.engine.reactBoundingClientRect.left + "px", this.tagDiv.style.top = r.y - 10 + this.engine.reactBoundingClientRect.top + "px", this.tagDiv.style.display = "block") : this.tagDiv && (this.tagDiv.style.display = "none");
   }
   init() {
     this.overlayMaterial = new M.MeshBasicMaterial({
@@ -11323,7 +11346,7 @@ class nd extends Bl {
         case 4:
           throw new Error("THREE.HDRLoader: Memory Error: " + (A || ""));
       }
-    }, d = function(P, A, R) {
+    }, d = function(P, A, D) {
       A = A || 1024;
       let T = P.pos, k = -1, b = 0, I = "", U = String.fromCharCode.apply(null, new Uint16Array(P.subarray(T, T + 128)));
       for (; 0 > (k = U.indexOf(`
@@ -11331,7 +11354,7 @@ class nd extends Bl {
         I += U, b += U.length, T += 128, U += String.fromCharCode.apply(null, new Uint16Array(P.subarray(T, T + 128)));
       return -1 < k ? (P.pos += b + k + 1, I + U.slice(0, k)) : !1;
     }, m = function(P) {
-      const A = /^#\?(\S+)/, R = /^\s*GAMMA\s*=\s*(\d+(\.\d+)?)\s*$/, z = /^\s*EXPOSURE\s*=\s*(\d+(\.\d+)?)\s*$/, T = /^\s*FORMAT=(\S+)\s*$/, k = /^\s*\-Y\s+(\d+)\s+\+X\s+(\d+)\s*$/, b = {
+      const A = /^#\?(\S+)/, D = /^\s*GAMMA\s*=\s*(\d+(\.\d+)?)\s*$/, z = /^\s*EXPOSURE\s*=\s*(\d+(\.\d+)?)\s*$/, T = /^\s*FORMAT=(\S+)\s*$/, k = /^\s*\-Y\s+(\d+)\s+\+X\s+(\d+)\s*$/, b = {
         valid: 0,
         /* indicate which fields are valid */
         string: "",
@@ -11359,10 +11382,10 @@ class nd extends Bl {
 `;
           continue;
         }
-        if ((U = I.match(R)) && (b.gamma = parseFloat(U[1])), (U = I.match(z)) && (b.exposure = parseFloat(U[1])), (U = I.match(T)) && (b.valid |= 2, b.format = U[1]), (U = I.match(k)) && (b.valid |= 4, b.height = parseInt(U[1], 10), b.width = parseInt(U[2], 10)), b.valid & 2 && b.valid & 4) break;
+        if ((U = I.match(D)) && (b.gamma = parseFloat(U[1])), (U = I.match(z)) && (b.exposure = parseFloat(U[1])), (U = I.match(T)) && (b.valid |= 2, b.format = U[1]), (U = I.match(k)) && (b.valid |= 4, b.height = parseInt(U[1], 10), b.width = parseInt(U[2], 10)), b.valid & 2 && b.valid & 4) break;
       }
       return b.valid & 2 || r(3, "missing format specifier"), b.valid & 4 || r(3, "missing image size specifier"), b;
-    }, p = function(P, A, R) {
+    }, p = function(P, A, D) {
       const z = A;
       if (
         // run length encoding is not allowed so read flat
@@ -11371,11 +11394,11 @@ class nd extends Bl {
       )
         return new Uint8Array(P);
       z !== (P[2] << 8 | P[3]) && r(3, "wrong scanline width");
-      const T = new Uint8Array(4 * A * R);
+      const T = new Uint8Array(4 * A * D);
       T.length || r(4, "unable to allocate buffer space");
       let k = 0, b = 0;
       const I = 4 * z, U = new Uint8Array(4), F = new Uint8Array(I);
-      let K = R;
+      let K = D;
       for (; K > 0 && b < P.byteLength; ) {
         b + 4 > P.byteLength && r(1), U[0] = P[b++], U[1] = P[b++], U[2] = P[b++], U[3] = P[b++], (U[0] != 2 || U[1] != 2 || (U[2] << 8 | U[3]) != z) && r(3, "bad rgbe scanline format");
         let H = 0, Y;
@@ -11397,12 +11420,12 @@ class nd extends Bl {
         K--;
       }
       return T;
-    }, f = function(P, A, R, z) {
+    }, f = function(P, A, D, z) {
       const T = P[A + 3], k = Math.pow(2, T - 128) / 255;
-      R[z + 0] = P[A + 0] * k, R[z + 1] = P[A + 1] * k, R[z + 2] = P[A + 2] * k, R[z + 3] = 1;
-    }, u = function(P, A, R, z) {
+      D[z + 0] = P[A + 0] * k, D[z + 1] = P[A + 1] * k, D[z + 2] = P[A + 2] * k, D[z + 3] = 1;
+    }, u = function(P, A, D, z) {
       const T = P[A + 3], k = Math.pow(2, T - 128) / 255;
-      R[z + 0] = qn.toHalfFloat(Math.min(P[A + 0] * k, 65504)), R[z + 1] = qn.toHalfFloat(Math.min(P[A + 1] * k, 65504)), R[z + 2] = qn.toHalfFloat(Math.min(P[A + 2] * k, 65504)), R[z + 3] = qn.toHalfFloat(1);
+      D[z + 0] = qn.toHalfFloat(Math.min(P[A + 0] * k, 65504)), D[z + 1] = qn.toHalfFloat(Math.min(P[A + 1] * k, 65504)), D[z + 2] = qn.toHalfFloat(Math.min(P[A + 2] * k, 65504)), D[z + 3] = qn.toHalfFloat(1);
     }, g = new Uint8Array(e);
     g.pos = 0;
     const y = m(g), w = y.width, x = y.height, _ = p(g.subarray(g.pos), w, x);
@@ -11411,15 +11434,15 @@ class nd extends Bl {
       case Ci:
         E = _.length / 4;
         const P = new Float32Array(E * 4);
-        for (let R = 0; R < E; R++)
-          f(_, R * 4, P, R * 4);
+        for (let D = 0; D < E; D++)
+          f(_, D * 4, P, D * 4);
         v = P, C = Ci;
         break;
       case _t:
         E = _.length / 4;
         const A = new Uint16Array(E * 4);
-        for (let R = 0; R < E; R++)
-          u(_, R * 4, A, R * 4);
+        for (let D = 0; D < E; D++)
+          u(_, D * 4, A, D * 4);
         v = A, C = _t;
         break;
       default:
@@ -11534,12 +11557,12 @@ function rd(o, e, t) {
         new M.Vector3(f.max.x, f.min.y, f.max.z),
         new M.Vector3(f.min.x, f.max.y, f.max.z),
         new M.Vector3(f.max.x, f.max.y, f.max.z)
-      ], E = 1 / 0, P = -1 / 0, A = 1 / 0, R = -1 / 0;
+      ], E = 1 / 0, P = -1 / 0, A = 1 / 0, D = -1 / 0;
       for (var z of C) {
         var T = z.dot(_), k = z.dot(v);
-        E = Math.min(E, T), P = Math.max(P, T), A = Math.min(A, k), R = Math.max(R, k);
+        E = Math.min(E, T), P = Math.max(P, T), A = Math.min(A, k), D = Math.max(D, k);
       }
-      var b = (P - E) / 2, I = (R - A) / 2, U = (e.camera.right - e.camera.left) / 2, F = (e.camera.top - e.camera.bottom) / 2;
+      var b = (P - E) / 2, I = (D - A) / 2, U = (e.camera.right - e.camera.left) / 2, F = (e.camera.top - e.camera.bottom) / 2;
       x = Math.min(U / b, F / I) * 0.75;
       var K = e.camera.position.clone(), H = o.controls.target.clone(), Y = e.camera.zoom, N = new An.Tween({
         x1: K.x,
@@ -13296,8 +13319,8 @@ function gs(o, e, t, n, i) {
   for (let w = (e - y) * 6, x = (e + t - y) * 6; w < x; w += 6) {
     const _ = o[w + 0], v = o[w + 1], C = _ - v, E = _ + v;
     C < s && (s = C), E > l && (l = E), _ < d && (d = _), _ > f && (f = _);
-    const P = o[w + 2], A = o[w + 3], R = P - A, z = P + A;
-    R < r && (r = R), z > h && (h = z), P < m && (m = P), P > u && (u = P);
+    const P = o[w + 2], A = o[w + 3], D = P - A, z = P + A;
+    D < r && (r = D), z > h && (h = z), P < m && (m = P), P > u && (u = P);
     const T = o[w + 4], k = o[w + 5], b = T - k, I = T + k;
     b < a && (a = b), I > c && (c = I), T < p && (p = T), T > g && (g = T);
   }
@@ -13322,9 +13345,9 @@ function ao(o, e, t = null, n = null, i = null) {
       a ? (C = s[d[v]](w), E = s[d[v]](x), P = s[d[v]](_)) : (C = l[w + v], E = l[x + v], P = l[_ + v]);
       let A = C;
       E < A && (A = E), P < A && (A = P);
-      let R = C;
-      E > R && (R = E), P > R && (R = P);
-      const z = (R - A) / 2, T = v * 2;
+      let D = C;
+      E > D && (D = E), P > D && (D = P);
+      const z = (D - A) / 2, T = v * 2;
       i[y + T + 0] = A + z, i[y + T + 1] = z + (Math.abs(A) + z) * vd;
     }
   }
@@ -13392,8 +13415,8 @@ function Ed(o, e, t, n, i, s) {
             leftCacheBounds: P,
             rightCacheBounds: A
           } = C;
-          for (let R = 0; R < 3; R++)
-            A[R] = 1 / 0, A[R + 3] = -1 / 0, P[R] = 1 / 0, P[R + 3] = -1 / 0, E[R] = 1 / 0, E[R + 3] = -1 / 0;
+          for (let D = 0; D < 3; D++)
+            A[D] = 1 / 0, A[D + 3] = -1 / 0, P[D] = 1 / 0, P[D + 3] = -1 / 0, E[D] = 1 / 0, E[D + 3] = -1 / 0;
           li(v, t, E);
         }
         w.sort(Td);
@@ -13411,11 +13434,11 @@ function Ed(o, e, t, n, i, s) {
           }
         }
         for (let v = 0; v < _; v++) {
-          const C = w[v], E = C.count, P = i - C.count, A = C.leftCacheBounds, R = C.rightCacheBounds;
+          const C = w[v], E = C.count, P = i - C.count, A = C.leftCacheBounds, D = C.rightCacheBounds;
           let z = 0;
           E !== 0 && (z = Cn(A) / l);
           let T = 0;
-          P !== 0 && (T = Cn(R) / l);
+          P !== 0 && (T = Cn(D) / l);
           const k = ro + ps * (z * E + T * P);
           k < h && (r = p, h = k, a = C.candidate);
         }
@@ -13443,11 +13466,11 @@ function Ed(o, e, t, n, i, s) {
         for (let _ = 0; _ < yt - 1; _++) {
           const v = Ct[_], C = v.count, E = v.bounds, A = Ct[_ + 1].rightCacheBounds;
           C !== 0 && (x === 0 ? co(E, ci) : ho(E, ci, ci)), x += C;
-          let R = 0, z = 0;
-          x !== 0 && (R = Cn(ci) / l);
+          let D = 0, z = 0;
+          x !== 0 && (D = Cn(ci) / l);
           const T = i - x;
           T !== 0 && (z = Cn(A) / l);
-          const k = ro + ps * (R * x + z * T);
+          const k = ro + ps * (D * x + z * T);
           k < h && (r = p, h = k, a = v.candidate);
         }
       }
@@ -13511,11 +13534,11 @@ function Pd(o, e, t, n, i, s) {
   }
 }
 let Fa, Li, Ys, Ua;
-const Rd = Math.pow(2, 32);
+const Dd = Math.pow(2, 32);
 function Ks(o) {
   return "count" in o ? 1 : 1 + Ks(o.left) + Ks(o.right);
 }
-function Dd(o, e, t) {
+function Rd(o, e, t) {
   return Fa = new Float32Array(t), Li = new Uint32Array(t), Ys = new Uint16Array(t), Ua = new Uint8Array(t), $s(o, e);
 }
 function $s(o, e) {
@@ -13528,7 +13551,7 @@ function $s(o, e) {
     const { left: r, right: a, splitAxis: l } = e, h = o + Oe;
     let c = $s(h, r);
     const d = o / Oe, p = c / Oe - d;
-    if (p > Rd)
+    if (p > Dd)
       throw new Error("MeshBVH: Cannot store relative child node offset greater than 32 bits.");
     return Li[t + 6] = p, Li[t + 7] = l, $s(c, a);
   }
@@ -13562,14 +13585,14 @@ function Id(o, e, t, n, i) {
   function _(v, C, E, P = null, A = 0) {
     if (!y && A >= s && (y = !0, r && (console.warn(`MeshBVH: Max depth of ${s} reached when generating BVH. Consider increasing maxDepth.`), console.warn(m))), E <= a || A >= s)
       return x(C + E), v.offset = C, v.count = E, v;
-    const R = Ed(v.boundingData, P, e, C, E, l);
-    if (R.axis === -1)
+    const D = Ed(v.boundingData, P, e, C, E, l);
+    if (D.axis === -1)
       return x(C + E), v.offset = C, v.count = E, v;
-    const z = f(d, p, e, C, E, R);
+    const z = f(d, p, e, C, E, D);
     if (z === C || z === C + E)
       x(C + E), v.offset = C, v.count = E;
     else {
-      v.splitAxis = R.axis;
+      v.splitAxis = D.axis;
       const T = new ys(), k = C, b = z - C;
       v.left = T, gs(e, k, b, T.boundingData, g), _(T, k, b, g, A + 1);
       const I = new ys(), U = z, F = E - b;
@@ -13591,7 +13614,7 @@ function Ld(o, e) {
   }
   o._roots = s.map((r) => {
     const a = Id(o, i, r.offset, r.count, e), l = Ks(a), h = new t(Oe * l);
-    return Dd(0, a, h), h;
+    return Rd(0, a, h), h;
   });
 }
 class Mt {
@@ -13729,28 +13752,28 @@ $e.prototype.intersectsTriangle = /* @__PURE__ */ (function() {
       const k = P[T], b = A[T];
       if (e.setFromPoints(b, _.points), k.isSeparated(e) || (r.copy(E).cross(b), e.setFromPoints(r, x.points), t.setFromPoints(r, _.points), e.isSeparated(t))) return !1;
     }
-    const R = _.satBounds, z = _.satAxes;
+    const D = _.satBounds, z = _.satAxes;
     for (let T = 1; T < 4; T++) {
-      const k = R[T], b = z[T];
+      const k = D[T], b = z[T];
       if (e.setFromPoints(b, x.points), k.isSeparated(e) || (r.crossVectors(E, b), e.setFromPoints(r, x.points), t.setFromPoints(r, _.points), e.isSeparated(t))) return !1;
     }
     return v && (C || console.warn("ExtendedTriangle.intersectsTriangle: Triangles are coplanar which does not support an output edge. Setting edge to 0, 0, 0."), v.start.set(0, 0, 0), v.end.set(0, 0, 0)), !0;
   }
-  function p(x, _, v, C, E, P, A, R, z, T, k) {
-    let b = A / (A - R);
+  function p(x, _, v, C, E, P, A, D, z, T, k) {
+    let b = A / (A - D);
     T.x = C + (E - C) * b, k.start.subVectors(_, x).multiplyScalar(b).add(x), b = A / (A - z), T.y = C + (P - C) * b, k.end.subVectors(v, x).multiplyScalar(b).add(x);
   }
-  function f(x, _, v, C, E, P, A, R, z, T, k) {
+  function f(x, _, v, C, E, P, A, D, z, T, k) {
     if (E > 0)
-      p(x.c, x.a, x.b, C, _, v, z, A, R, T, k);
+      p(x.c, x.a, x.b, C, _, v, z, A, D, T, k);
     else if (P > 0)
-      p(x.b, x.a, x.c, v, _, C, R, A, z, T, k);
-    else if (R * z > 0 || A != 0)
-      p(x.a, x.b, x.c, _, v, C, A, R, z, T, k);
-    else if (R != 0)
-      p(x.b, x.a, x.c, v, _, C, R, A, z, T, k);
+      p(x.b, x.a, x.c, v, _, C, D, A, z, T, k);
+    else if (D * z > 0 || A != 0)
+      p(x.a, x.b, x.c, _, v, C, A, D, z, T, k);
+    else if (D != 0)
+      p(x.b, x.a, x.c, v, _, C, D, A, z, T, k);
     else if (z != 0)
-      p(x.c, x.a, x.b, C, _, v, z, A, R, T, k);
+      p(x.c, x.a, x.b, C, _, v, z, A, D, T, k);
     else
       return !0;
     return !1;
@@ -13770,15 +13793,15 @@ $e.prototype.intersectsTriangle = /* @__PURE__ */ (function() {
   function w(x, _, v, C) {
     if (x.isDegenerateIntoSegment)
       if (_.isDegenerateIntoSegment) {
-        const E = x.degenerateSegment, P = _.degenerateSegment, A = i, R = s;
-        E.delta(A), P.delta(R);
-        const z = n.subVectors(P.start, E.start), T = A.x * R.y - A.y * R.x;
+        const E = x.degenerateSegment, P = _.degenerateSegment, A = i, D = s;
+        E.delta(A), P.delta(D);
+        const z = n.subVectors(P.start, E.start), T = A.x * D.y - A.y * D.x;
         if (We(T))
           return !1;
-        const k = (z.x * R.y - z.y * R.x) / T, b = -(A.x * z.y - A.y * z.x) / T;
+        const k = (z.x * D.y - z.y * D.x) / T, b = -(A.x * z.y - A.y * z.x) / T;
         if (k < 0 || k > 1 || b < 0 || b > 1)
           return !1;
-        const I = E.start.z + A.z * k, U = P.start.z + R.z * b;
+        const I = E.start.z + A.z * k, U = P.start.z + D.z * b;
         return We(I - U) ? (v && (v.start.copy(E.start).addScaledVector(A, k), v.end.copy(E.start).addScaledVector(A, k)), !0) : !1;
       } else return _.isDegenerateIntoPoint ? y(x, _, v) : u(_, x, v, C);
     else {
@@ -13796,9 +13819,9 @@ $e.prototype.intersectsTriangle = /* @__PURE__ */ (function() {
     if (E !== void 0)
       return E;
     const P = this.plane, A = _.plane;
-    let R = A.distanceToPoint(this.a), z = A.distanceToPoint(this.b), T = A.distanceToPoint(this.c);
-    We(R) && (R = 0), We(z) && (z = 0), We(T) && (T = 0);
-    const k = R * z, b = R * T;
+    let D = A.distanceToPoint(this.a), z = A.distanceToPoint(this.b), T = A.distanceToPoint(this.c);
+    We(D) && (D = 0), We(z) && (z = 0), We(T) && (T = 0);
+    const k = D * z, b = D * T;
     if (k > 0 && b > 0)
       return !1;
     let I = P.distanceToPoint(_.a), U = P.distanceToPoint(_.b), F = P.distanceToPoint(_.c);
@@ -13812,7 +13835,7 @@ $e.prototype.intersectsTriangle = /* @__PURE__ */ (function() {
     const te = Math.abs(Y.y);
     te > O && (O = te, N = 1), Math.abs(Y.z) > O && (N = 2);
     const q = Bd[N], ce = this.a[q], pe = this.b[q], se = this.c[q], oe = _.a[q], ue = _.b[q], me = _.c[q];
-    if (f(this, ce, pe, se, k, b, R, z, T, c, a))
+    if (f(this, ce, pe, se, k, b, D, z, T, c, a))
       return m(this, _, v, C);
     if (f(_, oe, ue, me, K, H, I, U, F, d, l))
       return m(this, _, v, C);
@@ -13958,8 +13981,8 @@ Be.prototype.distanceToBox = /* @__PURE__ */ (function() {
         for (let w = 0; w <= 1; w++) {
           const x = (g + 1) % 3, _ = (g + 2) % 3, v = y << x | w << _, C = 1 << g | y << x | w << _, E = p[v], P = p[C];
           e[u].set(E, P);
-          const R = o[g], z = o[x], T = o[_], k = t[u], b = k.start, I = k.end;
-          b[R] = d[R], b[z] = y ? d[z] : m[z], b[T] = w ? d[T] : m[z], I[R] = m[R], I[z] = y ? d[z] : m[z], I[T] = w ? d[T] : m[z], u++;
+          const D = o[g], z = o[x], T = o[_], k = t[u], b = k.start, I = k.end;
+          b[D] = d[D], b[z] = y ? d[z] : m[z], b[T] = w ? d[T] : m[z], I[D] = m[D], I[z] = y ? d[z] : m[z], I[T] = w ? d[T] : m[z], u++;
         }
     for (let g = 0; g <= 1; g++)
       for (let y = 0; y <= 1; y++)
@@ -14012,7 +14035,7 @@ function Ye(o, e) {
 function Pe(o) {
   return o + Ae;
 }
-function Re(o, e) {
+function De(o, e) {
   const t = e[o + 6];
   return o + t * Ae;
 }
@@ -14048,7 +14071,7 @@ function Js(o, e, t, n, i = null, s = 0, r = 0) {
     const m = Ge(o, h), p = Ye(c, l);
     return we(o, a, kt), n(m, p, !1, r, s + o / Ae, kt);
   } else {
-    let R = function(T) {
+    let D = function(T) {
       const { uint16Array: k, uint32Array: b } = ge;
       let I = T * 2;
       for (; !Ce(I, k); )
@@ -14058,10 +14081,10 @@ function Js(o, e, t, n, i = null, s = 0, r = 0) {
       const { uint16Array: k, uint32Array: b } = ge;
       let I = T * 2;
       for (; !Ce(I, k); )
-        T = Re(T, b), I = T * 2;
+        T = De(T, b), I = T * 2;
       return Ge(T, b) + Ye(I, k);
     };
-    const m = Pe(o), p = Re(o, h);
+    const m = Pe(o), p = De(o, h);
     let f = m, u = p, g, y, w, x;
     if (i && (w = kt, x = mn, we(f, a, w), we(u, a, x), g = i(w), y = i(x), y < g)) {
       f = p, u = m;
@@ -14072,7 +14095,7 @@ function Js(o, e, t, n, i = null, s = 0, r = 0) {
     const _ = Ce(f * 2, l), v = t(w, _, g, r + 1, s + f / Ae);
     let C;
     if (v === so) {
-      const T = R(f), b = z(f) - T;
+      const T = D(f), b = z(f) - T;
       C = n(T, b, !0, r + 1, s + f / Ae, w);
     } else
       C = v && Js(
@@ -14089,7 +14112,7 @@ function Js(o, e, t, n, i = null, s = 0, r = 0) {
     const E = Ce(u * 2, l), P = t(x, E, y, r + 1, s + u / Ae);
     let A;
     if (P === so) {
-      const T = R(u), b = z(u) - T;
+      const T = D(u), b = z(u) - T;
       A = n(T, b, !0, r + 1, s + u / Ae, x);
     } else
       A = P && Js(
@@ -14122,7 +14145,7 @@ function Vd(o, e, t = {}, n = 0, i = 1 / 0) {
   const h = Math.sqrt(a);
   return t.point ? t.point.copy(ws) : t.point = ws.clone(), t.distance = h, t.faceIndex = l, t;
 }
-const ui = parseInt(ta) >= 169, Hd = parseInt(ta) <= 161, Ht = /* @__PURE__ */ new J(), jt = /* @__PURE__ */ new J(), Gt = /* @__PURE__ */ new J(), di = /* @__PURE__ */ new de(), fi = /* @__PURE__ */ new de(), pi = /* @__PURE__ */ new de(), fo = /* @__PURE__ */ new J(), po = /* @__PURE__ */ new J(), mo = /* @__PURE__ */ new J(), Rn = /* @__PURE__ */ new J();
+const ui = parseInt(ta) >= 169, Hd = parseInt(ta) <= 161, Ht = /* @__PURE__ */ new J(), jt = /* @__PURE__ */ new J(), Gt = /* @__PURE__ */ new J(), di = /* @__PURE__ */ new de(), fi = /* @__PURE__ */ new de(), pi = /* @__PURE__ */ new de(), fo = /* @__PURE__ */ new J(), po = /* @__PURE__ */ new J(), mo = /* @__PURE__ */ new J(), Dn = /* @__PURE__ */ new J();
 function jd(o, e, t, n, i, s, r, a) {
   let l;
   if (s === Nl ? l = o.intersectTriangle(n, t, e, !0, i) : l = o.intersectTriangle(e, t, n, s !== qi, i), l === null) return null;
@@ -14134,21 +14157,21 @@ function jd(o, e, t, n, i, s, r, a) {
 }
 function go(o, e, t, n, i, s, r, a, l, h, c) {
   Ht.fromBufferAttribute(e, s), jt.fromBufferAttribute(e, r), Gt.fromBufferAttribute(e, a);
-  const d = jd(o, Ht, jt, Gt, Rn, l, h, c);
+  const d = jd(o, Ht, jt, Gt, Dn, l, h, c);
   if (d) {
     if (n) {
       di.fromBufferAttribute(n, s), fi.fromBufferAttribute(n, r), pi.fromBufferAttribute(n, a), d.uv = new de();
-      const p = Ve.getInterpolation(Rn, Ht, jt, Gt, di, fi, pi, d.uv);
+      const p = Ve.getInterpolation(Dn, Ht, jt, Gt, di, fi, pi, d.uv);
       ui || (d.uv = p);
     }
     if (i) {
       di.fromBufferAttribute(i, s), fi.fromBufferAttribute(i, r), pi.fromBufferAttribute(i, a), d.uv1 = new de();
-      const p = Ve.getInterpolation(Rn, Ht, jt, Gt, di, fi, pi, d.uv1);
+      const p = Ve.getInterpolation(Dn, Ht, jt, Gt, di, fi, pi, d.uv1);
       ui || (d.uv1 = p), Hd && (d.uv2 = d.uv1);
     }
     if (t) {
       fo.fromBufferAttribute(t, s), po.fromBufferAttribute(t, r), mo.fromBufferAttribute(t, a), d.normal = new J();
-      const p = Ve.getInterpolation(Rn, Ht, jt, Gt, fo, po, mo, d.normal);
+      const p = Ve.getInterpolation(Dn, Ht, jt, Gt, fo, po, mo, d.normal);
       d.normal.dot(o.direction) > 0 && d.normal.multiplyScalar(-1), ui || (d.normal = p);
     }
     const m = {
@@ -14160,7 +14183,7 @@ function go(o, e, t, n, i, s, r, a, l, h, c) {
     };
     if (Ve.getNormal(Ht, jt, Gt, m.normal), d.face = m, d.faceIndex = s, ui) {
       const p = new J();
-      Ve.getBarycoord(Rn, Ht, jt, Gt, p), d.barycoord = p;
+      Ve.getBarycoord(Dn, Ht, jt, Gt, p), d.barycoord = p;
     }
   }
   return d;
@@ -14238,18 +14261,18 @@ function Zd(o, e = null) {
       const g = r[m + 6], y = a[u + 14];
       let w = 1 / 0, x = 1 / 0, _ = 1 / 0, v = -1 / 0, C = -1 / 0, E = -1 / 0;
       for (let P = 3 * g, A = 3 * (g + y); P < A; P++) {
-        let R = n[P];
-        const z = i.getX(R), T = i.getY(R), k = i.getZ(R);
+        let D = n[P];
+        const z = i.getX(D), T = i.getY(D), k = i.getZ(D);
         z < w && (w = z), z > v && (v = z), T < x && (x = T), T > C && (C = T), k < _ && (_ = k), k > E && (E = k);
       }
       return l[m + 0] !== w || l[m + 1] !== x || l[m + 2] !== _ || l[m + 3] !== v || l[m + 4] !== C || l[m + 5] !== E ? (l[m + 0] = w, l[m + 1] = x, l[m + 2] = _, l[m + 3] = v, l[m + 4] = C, l[m + 5] = E, !0) : !1;
     } else {
-      const g = Pe(m), y = Re(m, r);
+      const g = Pe(m), y = De(m, r);
       let w = f, x = !1, _ = !1;
       if (e) {
         if (!w) {
-          const R = g / Ae + p / Oe, z = y / Ae + p / Oe;
-          x = e.has(R), _ = e.has(z), w = !x && !_;
+          const D = g / Ae + p / Oe, z = y / Ae + p / Oe;
+          x = e.has(D), _ = e.has(z), w = !x && !_;
         }
       } else
         x = !0, _ = !0;
@@ -14260,9 +14283,9 @@ function Zd(o, e = null) {
       C && (P = d(y, p, w));
       const A = E || P;
       if (A)
-        for (let R = 0; R < 3; R++) {
-          const z = g + R, T = y + R, k = l[z], b = l[z + 3], I = l[T], U = l[T + 3];
-          l[m + R] = k < I ? k : I, l[m + R + 3] = b > U ? b : U;
+        for (let D = 0; D < 3; D++) {
+          const z = g + D, T = y + D, k = l[z], b = l[z + 3], I = l[T], U = l[T + 3];
+          l[m + D] = k < I ? k : I, l[m + D + 3] = b > U ? b : U;
         }
       return A;
     }
@@ -14310,7 +14333,7 @@ function Qs(o, e, t, n, i, s, r) {
   } else {
     const m = Pe(o);
     Ot(m, a, n, s, r) && Qs(m, e, t, n, i, s, r);
-    const p = Re(o, h);
+    const p = De(o, h);
     Ot(p, a, n, s, r) && Qs(p, e, t, n, i, s, r);
   }
 }
@@ -14329,7 +14352,7 @@ function er(o, e, t, n, i, s) {
   } else {
     const d = yr(o, l), m = Jd[d], f = n.direction[m] >= 0;
     let u, g;
-    f ? (u = Pe(o), g = Re(o, l)) : (u = Re(o, l), g = Pe(o));
+    f ? (u = Pe(o), g = De(o, l)) : (u = De(o, l), g = Pe(o));
     const w = Ot(u, r, n, i, s) ? er(u, e, t, n, i, s) : null;
     if (w) {
       const v = w.point[m];
@@ -14343,7 +14366,7 @@ function er(o, e, t, n, i, s) {
     return w && _ ? w.distance <= _.distance ? w : _ : w || _ || null;
   }
 }
-const mi = /* @__PURE__ */ new ot(), on = /* @__PURE__ */ new $e(), an = /* @__PURE__ */ new $e(), Dn = /* @__PURE__ */ new Me(), wo = /* @__PURE__ */ new Be(), gi = /* @__PURE__ */ new Be();
+const mi = /* @__PURE__ */ new ot(), on = /* @__PURE__ */ new $e(), an = /* @__PURE__ */ new $e(), Rn = /* @__PURE__ */ new Me(), wo = /* @__PURE__ */ new Be(), gi = /* @__PURE__ */ new Be();
 function ef(o, e, t, n) {
   ge.setBuffer(o._roots[e]);
   const i = tr(0, o, t, n);
@@ -14354,8 +14377,8 @@ function tr(o, e, t, n, i = null) {
   let l = o * 2;
   if (i === null && (t.boundingBox || t.computeBoundingBox(), wo.set(t.boundingBox.min, t.boundingBox.max, n), i = wo), Ce(l, r)) {
     const c = e.geometry, d = c.index, m = c.attributes.position, p = t.index, f = t.attributes.position, u = Ge(o, a), g = Ye(l, r);
-    if (Dn.copy(n).invert(), t.boundsTree)
-      return we(o, s, gi), gi.matrix.copy(Dn), gi.needsUpdate = !0, t.boundsTree.shapecast({
+    if (Rn.copy(n).invert(), t.boundsTree)
+      return we(o, s, gi), gi.matrix.copy(Rn), gi.needsUpdate = !0, t.boundsTree.shapecast({
         intersectsBounds: (w) => gi.intersectsBox(w),
         intersectsTriangle: (w) => {
           w.a.applyMatrix4(n), w.b.applyMatrix4(n), w.c.applyMatrix4(n), w.needsUpdate = !0;
@@ -14368,14 +14391,14 @@ function tr(o, e, t, n, i = null) {
     {
       const y = nn(t);
       for (let w = u * 3, x = (g + u) * 3; w < x; w += 3) {
-        be(on, w, d, m), on.a.applyMatrix4(Dn), on.b.applyMatrix4(Dn), on.c.applyMatrix4(Dn), on.needsUpdate = !0;
+        be(on, w, d, m), on.a.applyMatrix4(Rn), on.b.applyMatrix4(Rn), on.c.applyMatrix4(Rn), on.needsUpdate = !0;
         for (let _ = 0, v = y * 3; _ < v; _ += 3)
           if (be(an, _, p, f), an.needsUpdate = !0, on.intersectsTriangle(an))
             return !0;
       }
     }
   } else {
-    const c = Pe(o), d = Re(o, a);
+    const c = Pe(o), d = De(o, a);
     return we(c, s, mi), !!(i.intersectsBox(mi) && tr(c, e, t, n, i) || (we(d, s, mi), i.intersectsBox(mi) && tr(d, e, t, n, i)));
   }
 }
@@ -14394,14 +14417,14 @@ function of(o, e, t, n = {}, i = {}, s = 0, r = 1 / 0) {
         if (e.boundsTree)
           return e.boundsTree.shapecast({
             boundsTraverseOrder: (P) => kn.distanceToBox(P),
-            intersectsBounds: (P, A, R) => R < w && R < r,
+            intersectsBounds: (P, A, D) => D < w && D < r,
             intersectsRange: (P, A) => {
-              for (let R = P, z = P + A; R < z; R++) {
-                be(p, 3 * R, d, c), p.a.applyMatrix4(t), p.b.applyMatrix4(t), p.c.applyMatrix4(t), p.needsUpdate = !0;
+              for (let D = P, z = P + A; D < z; D++) {
+                be(p, 3 * D, d, c), p.a.applyMatrix4(t), p.b.applyMatrix4(t), p.c.applyMatrix4(t), p.needsUpdate = !0;
                 for (let T = v, k = v + C; T < k; T++) {
                   be(m, 3 * T, h, l), m.needsUpdate = !0;
                   const b = m.distanceToTriangle(p, f, g);
-                  if (b < w && (u.copy(f), y && y.copy(g), w = b, x = T, _ = R), b < s)
+                  if (b < w && (u.copy(f), y && y.copy(g), w = b, x = T, _ = D), b < s)
                     return !0;
                 }
               }
@@ -14411,10 +14434,10 @@ function of(o, e, t, n = {}, i = {}, s = 0, r = 1 / 0) {
           const E = nn(e);
           for (let P = 0, A = E; P < A; P++) {
             be(p, 3 * P, d, c), p.a.applyMatrix4(t), p.b.applyMatrix4(t), p.c.applyMatrix4(t), p.needsUpdate = !0;
-            for (let R = v, z = v + C; R < z; R++) {
-              be(m, 3 * R, h, l), m.needsUpdate = !0;
+            for (let D = v, z = v + C; D < z; D++) {
+              be(m, 3 * D, h, l), m.needsUpdate = !0;
               const T = m.distanceToTriangle(p, f, g);
-              if (T < w && (u.copy(f), y && y.copy(g), w = T, x = R, _ = P), T < s)
+              if (T < w && (u.copy(f), y && y.copy(g), w = T, x = D, _ = P), T < s)
                 return !0;
             }
           }
@@ -14436,9 +14459,9 @@ function af(o, e = null) {
       const g = r[m + 6], y = a[u + 14];
       let w = 1 / 0, x = 1 / 0, _ = 1 / 0, v = -1 / 0, C = -1 / 0, E = -1 / 0;
       for (let P = g, A = g + y; P < A; P++) {
-        const R = 3 * o.resolveTriangleIndex(P);
+        const D = 3 * o.resolveTriangleIndex(P);
         for (let z = 0; z < 3; z++) {
-          let T = R + z;
+          let T = D + z;
           T = n ? n[T] : T;
           const k = i.getX(T), b = i.getY(T), I = i.getZ(T);
           k < w && (w = k), k > v && (v = k), b < x && (x = b), b > C && (C = b), I < _ && (_ = I), I > E && (E = I);
@@ -14446,12 +14469,12 @@ function af(o, e = null) {
       }
       return l[m + 0] !== w || l[m + 1] !== x || l[m + 2] !== _ || l[m + 3] !== v || l[m + 4] !== C || l[m + 5] !== E ? (l[m + 0] = w, l[m + 1] = x, l[m + 2] = _, l[m + 3] = v, l[m + 4] = C, l[m + 5] = E, !0) : !1;
     } else {
-      const g = Pe(m), y = Re(m, r);
+      const g = Pe(m), y = De(m, r);
       let w = f, x = !1, _ = !1;
       if (e) {
         if (!w) {
-          const R = g / Ae + p / Oe, z = y / Ae + p / Oe;
-          x = e.has(R), _ = e.has(z), w = !x && !_;
+          const D = g / Ae + p / Oe, z = y / Ae + p / Oe;
+          x = e.has(D), _ = e.has(z), w = !x && !_;
         }
       } else
         x = !0, _ = !0;
@@ -14462,9 +14485,9 @@ function af(o, e = null) {
       C && (P = d(y, p, w));
       const A = E || P;
       if (A)
-        for (let R = 0; R < 3; R++) {
-          const z = g + R, T = y + R, k = l[z], b = l[z + 3], I = l[T], U = l[T + 3];
-          l[m + R] = k < I ? k : I, l[m + R + 3] = b > U ? b : U;
+        for (let D = 0; D < 3; D++) {
+          const z = g + D, T = y + D, k = l[z], b = l[z + 3], I = l[T], U = l[T + 3];
+          l[m + D] = k < I ? k : I, l[m + D + 3] = b > U ? b : U;
         }
       return A;
     }
@@ -14481,7 +14504,7 @@ function nr(o, e, t, n, i, s, r) {
   } else {
     const m = Pe(o);
     Ot(m, a, n, s, r) && nr(m, e, t, n, i, s, r);
-    const p = Re(o, h);
+    const p = De(o, h);
     Ot(p, a, n, s, r) && nr(p, e, t, n, i, s, r);
   }
 }
@@ -14500,7 +14523,7 @@ function ir(o, e, t, n, i, s) {
   } else {
     const d = yr(o, l), m = cf[d], f = n.direction[m] >= 0;
     let u, g;
-    f ? (u = Pe(o), g = Re(o, l)) : (u = Re(o, l), g = Pe(o));
+    f ? (u = Pe(o), g = De(o, l)) : (u = De(o, l), g = Pe(o));
     const w = Ot(u, r, n, i, s) ? ir(u, e, t, n, i, s) : null;
     if (w) {
       const v = w.point[m];
@@ -14547,7 +14570,7 @@ function sr(o, e, t, n, i = null) {
       }
     }
   } else {
-    const c = Pe(o), d = Re(o, a);
+    const c = Pe(o), d = De(o, a);
     return we(c, s, wi), !!(i.intersectsBox(wi) && sr(c, e, t, n, i) || (we(d, s, wi), i.intersectsBox(wi) && sr(d, e, t, n, i)));
   }
 }
@@ -14567,16 +14590,16 @@ function gf(o, e, t, n = {}, i = {}, s = 0, r = 1 / 0) {
           const E = e.boundsTree;
           return E.shapecast({
             boundsTraverseOrder: (P) => Ln.distanceToBox(P),
-            intersectsBounds: (P, A, R) => R < w && R < r,
+            intersectsBounds: (P, A, D) => D < w && D < r,
             intersectsRange: (P, A) => {
-              for (let R = P, z = P + A; R < z; R++) {
-                const T = E.resolveTriangleIndex(R);
+              for (let D = P, z = P + A; D < z; D++) {
+                const T = E.resolveTriangleIndex(D);
                 be(p, 3 * T, d, c), p.a.applyMatrix4(t), p.b.applyMatrix4(t), p.c.applyMatrix4(t), p.needsUpdate = !0;
                 for (let k = v, b = v + C; k < b; k++) {
                   const I = o.resolveTriangleIndex(k);
                   be(m, 3 * I, h, l), m.needsUpdate = !0;
                   const U = m.distanceToTriangle(p, f, g);
-                  if (U < w && (u.copy(f), y && y.copy(g), w = U, x = k, _ = R), U < s)
+                  if (U < w && (u.copy(f), y && y.copy(g), w = U, x = k, _ = D), U < s)
                     return !0;
                 }
               }
@@ -14586,11 +14609,11 @@ function gf(o, e, t, n = {}, i = {}, s = 0, r = 1 / 0) {
           const E = nn(e);
           for (let P = 0, A = E; P < A; P++) {
             be(p, 3 * P, d, c), p.a.applyMatrix4(t), p.b.applyMatrix4(t), p.c.applyMatrix4(t), p.needsUpdate = !0;
-            for (let R = v, z = v + C; R < z; R++) {
-              const T = o.resolveTriangleIndex(R);
+            for (let D = v, z = v + C; D < z; D++) {
+              const T = o.resolveTriangleIndex(D);
               be(m, 3 * T, h, l), m.needsUpdate = !0;
               const k = m.distanceToTriangle(p, f, g);
-              if (k < w && (u.copy(f), y && y.copy(g), w = k, x = R, _ = P), k < s)
+              if (k < w && (u.copy(f), y && y.copy(g), w = k, x = D, _ = P), k < s)
                 return !0;
             }
           }
@@ -14602,7 +14625,7 @@ function gf(o, e, t, n = {}, i = {}, s = 0, r = 1 / 0) {
 function yf() {
   return typeof SharedArrayBuffer < "u";
 }
-const Fn = /* @__PURE__ */ new ge.constructor(), ji = /* @__PURE__ */ new ge.constructor(), Rt = /* @__PURE__ */ new gr(() => new ot()), hn = /* @__PURE__ */ new ot(), un = /* @__PURE__ */ new ot(), vs = /* @__PURE__ */ new ot(), bs = /* @__PURE__ */ new ot();
+const Fn = /* @__PURE__ */ new ge.constructor(), ji = /* @__PURE__ */ new ge.constructor(), Dt = /* @__PURE__ */ new gr(() => new ot()), hn = /* @__PURE__ */ new ot(), un = /* @__PURE__ */ new ot(), vs = /* @__PURE__ */ new ot(), bs = /* @__PURE__ */ new ot();
 let Ms = !1;
 function wf(o, e, t, n) {
   if (Ms)
@@ -14613,7 +14636,7 @@ function wf(o, e, t, n) {
   const h = new Me().copy(t).invert();
   for (let c = 0, d = i.length; c < d; c++) {
     Fn.setBuffer(i[c]), l = 0;
-    const m = Rt.getPrimitive();
+    const m = Dt.getPrimitive();
     we(0, Fn.float32Array, m), m.applyMatrix4(h);
     for (let p = 0, f = s.length; p < f && (ji.setBuffer(s[p]), r = et(
       0,
@@ -14628,7 +14651,7 @@ function wf(o, e, t, n) {
       m
     ), ji.clearBuffer(), l += s[p].byteLength / Oe, !r); p++)
       ;
-    if (Rt.releasePrimitive(m), Fn.clearBuffer(), a += i[c].byteLength / Oe, r)
+    if (Dt.releasePrimitive(m), Fn.clearBuffer(), a += i[c].byteLength / Oe, r)
       break;
   }
   return Ms = !1, r;
@@ -14659,10 +14682,10 @@ function et(o, e, t, n, i, s = 0, r = 0, a = 0, l = 0, h = null, c = !1) {
       r + e / Ae
     );
   else if (C) {
-    const P = Rt.getPrimitive();
+    const P = Dt.getPrimitive();
     we(e, g, P), P.applyMatrix4(t);
-    const A = Pe(o), R = Re(o, f);
-    we(A, p, hn), we(R, p, un);
+    const A = Pe(o), D = De(o, f);
+    we(A, p, hn), we(D, p, un);
     const z = P.intersectsBox(hn), T = P.intersectsBox(un);
     E = z && et(
       e,
@@ -14678,7 +14701,7 @@ function et(o, e, t, n, i, s = 0, r = 0, a = 0, l = 0, h = null, c = !1) {
       !c
     ) || T && et(
       e,
-      R,
+      D,
       n,
       t,
       i,
@@ -14688,12 +14711,12 @@ function et(o, e, t, n, i, s = 0, r = 0, a = 0, l = 0, h = null, c = !1) {
       a + 1,
       P,
       !c
-    ), Rt.releasePrimitive(P);
+    ), Dt.releasePrimitive(P);
   } else {
-    const P = Pe(e), A = Re(e, y);
+    const P = Pe(e), A = De(e, y);
     we(P, g, vs), we(A, g, bs);
-    const R = h.intersectsBox(vs), z = h.intersectsBox(bs);
-    if (R && z)
+    const D = h.intersectsBox(vs), z = h.intersectsBox(bs);
+    if (D && z)
       E = et(
         o,
         P,
@@ -14719,7 +14742,7 @@ function et(o, e, t, n, i, s = 0, r = 0, a = 0, l = 0, h = null, c = !1) {
         h,
         c
       );
-    else if (R)
+    else if (D)
       if (v)
         E = et(
           o,
@@ -14735,9 +14758,9 @@ function et(o, e, t, n, i, s = 0, r = 0, a = 0, l = 0, h = null, c = !1) {
           c
         );
       else {
-        const T = Rt.getPrimitive();
+        const T = Dt.getPrimitive();
         T.copy(vs).applyMatrix4(t);
-        const k = Pe(o), b = Re(o, f);
+        const k = Pe(o), b = De(o, f);
         we(k, p, hn), we(b, p, un);
         const I = T.intersectsBox(hn), U = T.intersectsBox(un);
         E = I && et(
@@ -14764,7 +14787,7 @@ function et(o, e, t, n, i, s = 0, r = 0, a = 0, l = 0, h = null, c = !1) {
           a + 1,
           T,
           !c
-        ), Rt.releasePrimitive(T);
+        ), Dt.releasePrimitive(T);
       }
     else if (z)
       if (v)
@@ -14782,9 +14805,9 @@ function et(o, e, t, n, i, s = 0, r = 0, a = 0, l = 0, h = null, c = !1) {
           c
         );
       else {
-        const T = Rt.getPrimitive();
+        const T = Dt.getPrimitive();
         T.copy(bs).applyMatrix4(t);
-        const k = Pe(o), b = Re(o, f);
+        const k = Pe(o), b = De(o, f);
         we(k, p, hn), we(b, p, un);
         const I = T.intersectsBox(hn), U = T.intersectsBox(un);
         E = I && et(
@@ -14811,7 +14834,7 @@ function et(o, e, t, n, i, s = 0, r = 0, a = 0, l = 0, h = null, c = !1) {
           a + 1,
           T,
           !c
-        ), Rt.releasePrimitive(T);
+        ), Dt.releasePrimitive(T);
       }
   }
   return E;
@@ -14915,7 +14938,7 @@ class wr {
         const d = i[a + 6], m = s[h + 14];
         e(l, c, new Float32Array(n, a * 4, 6), d, m);
       } else {
-        const d = Pe(a), m = Re(a, i), p = yr(a, i);
+        const d = Pe(a), m = De(a, i), p = yr(a, i);
         e(l, c, new Float32Array(n, a * 4, 6), p) || (r(d, l + 1), r(m, l + 1));
       }
     }
@@ -14986,7 +15009,7 @@ class wr {
       const f = (u, g, y, w, x, _, v, C) => {
         for (let E = y, P = y + w; E < P; E++) {
           p(E), c.a.applyMatrix4(t), c.b.applyMatrix4(t), c.c.applyMatrix4(t), c.needsUpdate = !0;
-          for (let A = u, R = u + g; A < R; A++)
+          for (let A = u, D = u + g; A < D; A++)
             if (h(A), r.needsUpdate = !0, s(r, c, A, E, x, _, v, C))
               return !0;
         }
@@ -15089,8 +15112,8 @@ function Cf(o) {
 function xr(o) {
   return Cf(o) / 3;
 }
-const Pf = 1e-8, Rf = new J();
-function Df(o) {
+const Pf = 1e-8, Df = new J();
+function Rf(o) {
   return ~~(o / 3);
 }
 function kf(o) {
@@ -15100,7 +15123,7 @@ function bo(o, e) {
   return o.start - e.start;
 }
 function Mo(o, e) {
-  return Rf.subVectors(e, o.origin).dot(o.direction);
+  return Df.subVectors(e, o.origin).dot(o.direction);
 }
 function If(o, e, t, n = Pf) {
   o.sort(bo), e.sort(bo);
@@ -15184,7 +15207,7 @@ const Ss = new J(), Ts = new J(), bi = new rr();
 function zf(o, e, t) {
   const n = o.attributes, i = o.index, s = n.position, r = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), l = Array.from(e), h = new Lf();
   for (let c = 0, d = l.length; c < d; c++) {
-    const m = l[c], p = Df(m), f = kf(m);
+    const m = l[c], p = Rf(m), f = kf(m);
     let u = 3 * p + f, g = 3 * p + (f + 1) % 3;
     i && (u = i.getX(u), g = i.getX(g)), Ss.fromBufferAttribute(s, u), Ts.fromBufferAttribute(s, g), Sf(Ss, Ts, bi);
     let y, w = h.findClosestRay(bi);
@@ -15243,12 +15266,12 @@ class Nf {
         c && (P = c.getX(P)), As[E] = r(P);
       }
       for (let E = 0; E < 3; E++) {
-        const P = (E + 1) % 3, A = As[E], R = As[P], z = `${R}_${A}`;
+        const P = (E + 1) % 3, A = As[E], D = As[P], z = `${D}_${A}`;
         if (a.has(z)) {
           const T = C + E, k = a.get(z);
           u[T] = k, u[k] = T, a.delete(z), g += 2, y.delete(k);
         } else {
-          const T = `${A}_${R}`, k = C + E;
+          const T = `${A}_${D}`, k = C + E;
           a.set(T, k), y.add(k);
         }
       }
@@ -15330,12 +15353,12 @@ class Gi extends ar {
   }
 }
 const Ff = 1e-14, Cs = new J(), Eo = new J(), Ao = new J();
-function Dt(o, e = Ff) {
+function Rt(o, e = Ff) {
   Cs.subVectors(o.b, o.a), Eo.subVectors(o.c, o.a), Ao.subVectors(o.b, o.c);
   const t = Cs.angleTo(Eo), n = Cs.angleTo(Ao), i = Math.PI - t - n;
   return Math.abs(t) < e || Math.abs(n) < e || Math.abs(i) < e || o.a.distanceToSquared(o.b) < e || o.a.distanceToSquared(o.c) < e || o.b.distanceToSquared(o.c) < e;
 }
-const Ps = 1e-10, zn = 1e-10, Uf = 1e-10, pt = new Ke(), _e = new Ke(), mt = new J(), Rs = new J(), Co = new J(), Mi = new Xi(), Ds = new $e();
+const Ps = 1e-10, zn = 1e-10, Uf = 1e-10, pt = new Ke(), _e = new Ke(), mt = new J(), Ds = new J(), Co = new J(), Mi = new Xi(), Rs = new $e();
 class Vf {
   constructor() {
     this._pool = [], this._index = 0;
@@ -15378,7 +15401,7 @@ class Hf {
   // coplanar it will attempt to split by the triangle edge planes
   splitByTriangle(e) {
     const { normal: t, triangles: n } = this;
-    if (e.getNormal(Rs).normalize(), Math.abs(1 - Math.abs(Rs.dot(t))) < Uf) {
+    if (e.getNormal(Ds).normalize(), Math.abs(1 - Math.abs(Ds.dot(t))) < Uf) {
       this.coplanarTriangleUsed = !0;
       for (let s = 0, r = n.length; s < r; s++) {
         const a = n[s];
@@ -15387,7 +15410,7 @@ class Hf {
       const i = [e.a, e.b, e.c];
       for (let s = 0; s < 3; s++) {
         const r = (s + 1) % 3, a = i[s], l = i[r];
-        mt.subVectors(l, a).normalize(), Co.crossVectors(Rs, mt), Mi.setFromNormalAndCoplanarPoint(Co, a), this.splitByPlane(Mi, e);
+        mt.subVectors(l, a).normalize(), Co.crossVectors(Ds, mt), Mi.setFromNormalAndCoplanarPoint(Co, a), this.splitByPlane(Mi, e);
       }
     } else
       e.getPlane(Mi), this.splitByPlane(Mi, e);
@@ -15396,10 +15419,10 @@ class Hf {
   // intersect the triangle before splitting the plane
   splitByPlane(e, t) {
     const { triangles: n, trianglePool: i } = this;
-    Ds.copy(t), Ds.needsUpdate = !0;
+    Rs.copy(t), Rs.needsUpdate = !0;
     for (let s = 0, r = n.length; s < r; s++) {
       const a = n[s];
-      if (!Ds.intersectsTriangle(a, pt, !0))
+      if (!Rs.intersectsTriangle(a, pt, !0))
         continue;
       const { a: l, b: h, c } = a;
       let d = 0, m = -1, p = !1, f = [], u = [];
@@ -15425,7 +15448,7 @@ class Hf {
           let w = y + 1;
           w === m && (w = (w + 1) % 3);
           const x = i.getTriangle();
-          x.a.copy(g[w]), x.b.copy(_e.end), x.c.copy(_e.start), Dt(x) || n.push(x), a.a.copy(g[y]), a.b.copy(_e.start), a.c.copy(_e.end), Dt(a) && (n.splice(s, 1), s--, r--);
+          x.a.copy(g[w]), x.b.copy(_e.end), x.c.copy(_e.start), Rt(x) || n.push(x), a.a.copy(g[y]), a.b.copy(_e.start), a.c.copy(_e.end), Rt(a) && (n.splice(s, 1), s--, r--);
         } else {
           const y = f.length >= 2 ? u[0] : f[0];
           if (y === 0) {
@@ -15433,7 +15456,7 @@ class Hf {
             _e.start = _e.end, _e.end = C;
           }
           const w = (y + 1) % 3, x = (y + 2) % 3, _ = i.getTriangle(), v = i.getTriangle();
-          g[w].distanceToSquared(_e.start) < g[x].distanceToSquared(_e.end) ? (_.a.copy(g[w]), _.b.copy(_e.start), _.c.copy(_e.end), v.a.copy(g[w]), v.b.copy(g[x]), v.c.copy(_e.start)) : (_.a.copy(g[x]), _.b.copy(_e.start), _.c.copy(_e.end), v.a.copy(g[w]), v.b.copy(g[x]), v.c.copy(_e.end)), a.a.copy(g[y]), a.b.copy(_e.end), a.c.copy(_e.start), Dt(_) || n.push(_), Dt(v) || n.push(v), Dt(a) && (n.splice(s, 1), s--, r--);
+          g[w].distanceToSquared(_e.start) < g[x].distanceToSquared(_e.end) ? (_.a.copy(g[w]), _.b.copy(_e.start), _.c.copy(_e.end), v.a.copy(g[w]), v.b.copy(g[x]), v.c.copy(_e.start)) : (_.a.copy(g[x]), _.b.copy(_e.start), _.c.copy(_e.end), v.a.copy(g[w]), v.b.copy(g[x]), v.c.copy(_e.end)), a.a.copy(g[y]), a.b.copy(_e.end), a.c.copy(_e.start), Rt(_) || n.push(_), Rt(v) || n.push(v), Rt(a) && (n.splice(s, 1), s--, r--);
         }
       else d === 3 && console.warn("TriangleClipper: Coplanar clip not handled");
     }
@@ -15563,7 +15586,7 @@ class Gf {
     this.groupAttributes = [], this.groupCount = 0;
   }
 }
-class Ro {
+class Do {
   constructor() {
     this.intersectionSet = {}, this.ids = [];
   }
@@ -15572,7 +15595,7 @@ class Ro {
     n[e] || (n[e] = [], i.push(e)), n[e].push(t);
   }
 }
-const Wf = 0, Xf = 1, Zf = 2, Ga = 3, qf = 4, Wa = 5, Xa = 6, Ze = new rr(), Do = new Me(), Le = new Ve(), gt = new J(), ko = new en(), Io = new en(), Lo = new en(), ks = new en(), Si = new en(), Ti = new en(), zo = new Ke(), Is = new J(), Ls = 1e-8, Yf = 1e-15, Zt = -1, qt = 1, zi = -2, Oi = 2, Un = 0, Wt = 1, _r = 2, Kf = 1e-14;
+const Wf = 0, Xf = 1, Zf = 2, Ga = 3, qf = 4, Wa = 5, Xa = 6, Ze = new rr(), Ro = new Me(), Le = new Ve(), gt = new J(), ko = new en(), Io = new en(), Lo = new en(), ks = new en(), Si = new en(), Ti = new en(), zo = new Ke(), Is = new J(), Ls = 1e-8, Yf = 1e-15, Zt = -1, qt = 1, zi = -2, Oi = 2, Un = 0, Wt = 1, _r = 2, Kf = 1e-14;
 let Bi = null;
 function Oo(o) {
   Bi = o;
@@ -15600,10 +15623,10 @@ function $f(o, e) {
   return i / n > 0.5 ? Zt : qt;
 }
 function Jf(o, e) {
-  const t = new Ro(), n = new Ro();
-  return Do.copy(o.matrixWorld).invert().multiply(e.matrixWorld), o.geometry.boundsTree.bvhcast(e.geometry.boundsTree, Do, {
+  const t = new Do(), n = new Do();
+  return Ro.copy(o.matrixWorld).invert().multiply(e.matrixWorld), o.geometry.boundsTree.bvhcast(e.geometry.boundsTree, Ro, {
     intersectsTriangles(i, s, r, a) {
-      if (!Dt(i) && !Dt(s)) {
+      if (!Rt(i) && !Rt(s)) {
         let l = i.intersectsTriangle(s, zo, !0);
         if (!l) {
           const h = i.plane, c = s.plane, d = h.normal, m = c.normal;
@@ -15794,9 +15817,9 @@ function No(o, e, t, n, i, s, r, a = 0) {
       const k = 3 * A[z], b = p.getX(k + 0), I = p.getX(k + 1), U = p.getX(k + 2);
       Ei.a.fromBufferAttribute(f, b), Ei.b.fromBufferAttribute(f, I), Ei.c.fromBufferAttribute(f, U), s.splitByTriangle(Ei);
     }
-    const R = s.triangles;
-    for (let z = 0, T = R.length; z < T; z++) {
-      const k = R[z], b = s.coplanarTriangleUsed ? $f(k, m) : Za(k, m);
+    const D = s.triangles;
+    for (let z = 0, T = D.length; z < T; z++) {
+      const k = D[z], b = s.coplanarTriangleUsed ? $f(k, m) : Za(k, m);
       it.length = 0, Jt.length = 0;
       for (let I = 0, U = n.length; I < U; I++) {
         const F = qa(n[I], b, i);
@@ -15837,11 +15860,11 @@ function Fo(o, e, t, n, i, s, r = 0) {
         A !== -1 && u.has(A) && (p.push(A), u.delete(A));
       }
       if (it.length !== 0) {
-        const P = 3 * E, A = c.getX(P + 0), R = c.getX(P + 1), z = c.getX(P + 2), T = r === -1 ? 0 : h[E] + r;
-        if (Pt.a.fromBufferAttribute(m, A), Pt.b.fromBufferAttribute(m, R), Pt.c.fromBufferAttribute(m, z), !Dt(Pt))
+        const P = 3 * E, A = c.getX(P + 0), D = c.getX(P + 1), z = c.getX(P + 2), T = r === -1 ? 0 : h[E] + r;
+        if (Pt.a.fromBufferAttribute(m, A), Pt.b.fromBufferAttribute(m, D), Pt.c.fromBufferAttribute(m, z), !Rt(Pt))
           for (let k = 0, b = it.length; k < b; k++) {
             const I = Jt[k], U = it[k].getGroupAttrSet(T), F = I === Un;
-            ep(A, R, z, d, o.matrixWorld, Wi, U, F !== a);
+            ep(A, D, z, d, o.matrixWorld, Wi, U, F !== a);
           }
       }
     }
@@ -16703,7 +16726,7 @@ class up {
       Math.abs(l.z) * g
     ), x = p.clone().add(a.clone().multiplyScalar(-y / 2)).add(l.clone().multiplyScalar(-w / 2)), _ = p.clone().add(a.clone().multiplyScalar(y / 2)).add(l.clone().multiplyScalar(-w / 2)), v = p.clone().add(a.clone().multiplyScalar(y / 2)).add(l.clone().multiplyScalar(w / 2)), C = p.clone().add(a.clone().multiplyScalar(-y / 2)).add(l.clone().multiplyScalar(w / 2));
     x.add(h.clone().multiplyScalar(e)), _.add(h.clone().multiplyScalar(e)), v.add(h.clone().multiplyScalar(e)), C.add(h.clone().multiplyScalar(e)), this.current_center = p.clone().add(h.clone().multiplyScalar(e)), P([x, _, v, C], h, "face");
-    function P(A, R, z) {
+    function P(A, D, z) {
       const T = new M.BufferGeometry(), k = new Float32Array([
         A[0].x,
         A[0].y,
@@ -16744,7 +16767,7 @@ class up {
         });
         Y.polygonOffset = !0, Y.polygonOffsetFactor = 1, Y.polygonOffsetUnits = 4;
         const N = new M.Mesh(T, Y);
-        N.normal = R, N.name = z, n.add(N), t.meshs.push(N);
+        N.normal = D, N.name = z, n.add(N), t.meshs.push(N);
       } else
         I.geometry = T;
       const U = new Float32Array([
@@ -16772,7 +16795,7 @@ class up {
       let F = new M.LineBasicMaterial({ color: 255 }), K = new M.BufferGeometry();
       K.setAttribute("position", new M.BufferAttribute(U, 3));
       let H = t.meshs.find((Y) => Y.name == z + "Line");
-      H == null && (H = new M.Line(K, F), H.name = z + "Line", n.add(H), t.meshs.push(H)), H.geometry = K, H.material = F, t.engine.sectionPlane.find((Y) => Y.name == z).setFromNormalAndCoplanarPoint(R.clone().setLength(t.direction), A[0]);
+      H == null && (H = new M.Line(K, F), H.name = z + "Line", n.add(H), t.meshs.push(H)), H.geometry = K, H.material = F, t.engine.sectionPlane.find((Y) => Y.name == z).setFromNormalAndCoplanarPoint(D.clone().setLength(t.direction), A[0]);
     }
   }
   // 重写鼠标按下事件
@@ -17020,7 +17043,7 @@ class gp {
   // 查询构件属性
   getModelProperties(e, t, n) {
     let i = this.engine.engineStatus.models.find((r) => r.url === e);
-    i.properties == null && Da(e + "/property", (r) => {
+    i.properties == null && Ra(e + "/property", (r) => {
       let a = JSON.parse(r);
       i.properties = a, setTimeout(() => {
         s(a, t, n);
@@ -18589,8 +18612,8 @@ class Pp {
         uWaveSpeed: { value: e.waveSpeed ?? 1 },
         uOpacity: { value: t?.opacity ?? 0.82 }
       },
-      vertexShader: Rp,
-      fragmentShader: Dp,
+      vertexShader: Dp,
+      fragmentShader: Rp,
       transparent: !0,
       side: M.DoubleSide
     });
@@ -18629,7 +18652,7 @@ class Pp {
     Array.isArray(e) ? e.forEach((t) => t.dispose()) : e.dispose(), this.groundGroup.remove(this.groundMesh), this.groundMesh = null, this.waterMaterial = null;
   }
 }
-const Rp = (
+const Dp = (
   /* glsl */
   `
 uniform float uTime;
@@ -18668,7 +18691,7 @@ void main() {
     gl_Position = projectionMatrix * modelViewMatrix * vec4(pos, 1.0);
 }
 `
-), Dp = (
+), Rp = (
   /* glsl */
   `
 uniform float uTime;
@@ -18796,7 +18819,7 @@ class kp {
   // 业务数据
   models = [];
   reactBoundingClientRect = { left: 0, top: 0 };
-  version = "2.1.3";
+  version = "2.1.5";
   versionEl = null;
   // 引擎容器
   container;