@thatopen/components 2.3.9 → 2.3.11

package/dist/index.mjs

@@ -95,12 +95,12 @@ function $s(c, i, t, e, s = null) {
   let n = 1 / 0, r = 1 / 0, o = 1 / 0, a = -1 / 0, l = -1 / 0, h = -1 / 0, f = 1 / 0, I = 1 / 0, u = 1 / 0, d = -1 / 0, E = -1 / 0, T = -1 / 0;
   const p = s !== null;
   for (let m = i * 6, F = (i + t) * 6; m < F; m += 6) {
-    const R = c[m + 0], S = c[m + 1], N = R - S, y = R + S;
-    N < n && (n = N), y > a && (a = y), p && R < f && (f = R), p && R > d && (d = R);
-    const M = c[m + 2], L = c[m + 3], b = M - L, Y = M + L;
-    b < r && (r = b), Y > l && (l = Y), p && M < I && (I = M), p && M > E && (E = M);
-    const O = c[m + 4], w = c[m + 5], g = O - w, v = O + w;
-    g < o && (o = g), v > h && (h = v), p && O < u && (u = O), p && O > T && (T = O);
+    const R = c[m + 0], S = c[m + 1], O = R - S, y = R + S;
+    O < n && (n = O), y > a && (a = y), p && R < f && (f = R), p && R > d && (d = R);
+    const w = c[m + 2], L = c[m + 3], b = w - L, Y = w + L;
+    b < r && (r = b), Y > l && (l = Y), p && w < I && (I = w), p && w > E && (E = w);
+    const N = c[m + 4], M = c[m + 5], g = N - M, v = N + M;
+    g < o && (o = g), v > h && (h = v), p && N < u && (u = N), p && N > T && (T = N);
   }
   e[0] = n, e[1] = r, e[2] = o, e[3] = a, e[4] = l, e[5] = h, p && (s[0] = f, s[1] = I, s[2] = u, s[3] = d, s[4] = E, s[5] = T);
 }
@@ -131,10 +131,10 @@ function ko(c, i) {
       r ? (m = t[h[p]](d), F = t[h[p]](E), R = t[h[p]](T)) : (m = o[d + p], F = o[E + p], R = o[T + p]);
       let S = m;
       F < S && (S = F), R < S && (S = R);
-      let N = m;
-      F > N && (N = F), R > N && (N = R);
-      const y = (N - S) / 2, M = p * 2;
-      n[u + M + 0] = S + y, n[u + M + 1] = y + (Math.abs(S) + y) * Uo, S < i[p] && (i[p] = S), N > i[p + 3] && (i[p + 3] = N);
+      let O = m;
+      F > O && (O = F), R > O && (O = R);
+      const y = (O - S) / 2, w = p * 2;
+      n[u + w + 0] = S + y, n[u + w + 1] = y + (Math.abs(S) + y) * Uo, S < i[p] && (i[p] = S), O > i[p + 3] && (i[p + 3] = O);
     }
   }
   return n;
@@ -166,13 +166,13 @@ function Wo(c, i, t, e, s, n) {
           const S = p[m];
           S.candidate = t[R + 2 * I], S.count = 0;
           const {
-            bounds: N,
+            bounds: O,
             leftCacheBounds: y,
-            rightCacheBounds: M
+            rightCacheBounds: w
           } = S;
           for (let L = 0; L < 3; L++)
-            M[L] = 1 / 0, M[L + 3] = -1 / 0, y[L] = 1 / 0, y[L + 3] = -1 / 0, N[L] = 1 / 0, N[L + 3] = -1 / 0;
-          zi(R, t, N);
+            w[L] = 1 / 0, w[L + 3] = -1 / 0, y[L] = 1 / 0, y[L + 3] = -1 / 0, O[L] = 1 / 0, O[L + 3] = -1 / 0;
+          zi(R, t, O);
         }
         p.sort(Ho);
         let F = s;
@@ -183,32 +183,32 @@ function Wo(c, i, t, e, s, n) {
         }
         for (let R = h; R < f; R += 6) {
           const S = t[R + 2 * I];
-          for (let N = 0; N < F; N++) {
-            const y = p[N];
+          for (let O = 0; O < F; O++) {
+            const y = p[O];
             S >= y.candidate ? zi(R, t, y.rightCacheBounds) : (zi(R, t, y.leftCacheBounds), y.count++);
           }
         }
         for (let R = 0; R < F; R++) {
-          const S = p[R], N = S.count, y = s - S.count, M = S.leftCacheBounds, L = S.rightCacheBounds;
+          const S = p[R], O = S.count, y = s - S.count, w = S.leftCacheBounds, L = S.rightCacheBounds;
           let b = 0;
-          N !== 0 && (b = di(M) / a);
+          O !== 0 && (b = di(w) / a);
           let Y = 0;
           y !== 0 && (Y = di(L) / a);
-          const O = qn + Ws * (b * N + Y * y);
-          O < l && (r = I, l = O, o = S.candidate);
+          const N = qn + Ws * (b * O + Y * y);
+          N < l && (r = I, l = N, o = S.candidate);
         }
       } else {
         for (let F = 0; F < Te; F++) {
           const R = Fe[F];
           R.count = 0, R.candidate = u + T + F * T;
           const S = R.bounds;
-          for (let N = 0; N < 3; N++)
-            S[N] = 1 / 0, S[N + 3] = -1 / 0;
+          for (let O = 0; O < 3; O++)
+            S[O] = 1 / 0, S[O + 3] = -1 / 0;
         }
         for (let F = h; F < f; F += 6) {
-          let N = ~~((t[F + 2 * I] - u) / T);
-          N >= Te && (N = Te - 1);
-          const y = Fe[N];
+          let O = ~~((t[F + 2 * I] - u) / T);
+          O >= Te && (O = Te - 1);
+          const y = Fe[O];
           y.count++, zi(F, t, y.bounds);
         }
         const p = Fe[Te - 1];
@@ -219,14 +219,14 @@ function Wo(c, i, t, e, s, n) {
         }
         let m = 0;
         for (let F = 0; F < Te - 1; F++) {
-          const R = Fe[F], S = R.count, N = R.bounds, M = Fe[F + 1].rightCacheBounds;
-          S !== 0 && (m === 0 ? Kn(N, ki) : Jn(N, ki, ki)), m += S;
+          const R = Fe[F], S = R.count, O = R.bounds, w = Fe[F + 1].rightCacheBounds;
+          S !== 0 && (m === 0 ? Kn(O, ki) : Jn(O, ki, ki)), m += S;
           let L = 0, b = 0;
           m !== 0 && (L = di(ki) / a);
           const Y = s - m;
-          Y !== 0 && (b = di(M) / a);
-          const O = qn + Ws * (L * m + b * Y);
-          O < l && (r = I, l = O, o = R.candidate);
+          Y !== 0 && (b = di(w) / a);
+          const N = qn + Ws * (L * m + b * Y);
+          N < l && (r = I, l = N, o = R.candidate);
         }
       }
     }
@@ -308,21 +308,21 @@ function qo(c, i) {
   function m(R) {
     a && a(R / l);
   }
-  function F(R, S, N, y = null, M = 0) {
-    if (!f && M >= s && (f = !0, n && (console.warn(`MeshBVH: Max depth of ${s} reached when generating BVH. Consider increasing maxDepth.`), console.warn(t))), N <= r || M >= s)
-      return m(S + N), R.offset = S, R.count = N, R;
-    const L = Wo(R.boundingData, y, d, S, N, o);
+  function F(R, S, O, y = null, w = 0) {
+    if (!f && w >= s && (f = !0, n && (console.warn(`MeshBVH: Max depth of ${s} reached when generating BVH. Consider increasing maxDepth.`), console.warn(t))), O <= r || w >= s)
+      return m(S + O), R.offset = S, R.count = O, R;
+    const L = Wo(R.boundingData, y, d, S, O, o);
     if (L.axis === -1)
-      return m(S + N), R.offset = S, R.count = N, R;
-    const b = E(h, e, d, S, N, L);
-    if (b === S || b === S + N)
-      m(S + N), R.offset = S, R.count = N;
+      return m(S + O), R.offset = S, R.count = O, R;
+    const b = E(h, e, d, S, O, L);
+    if (b === S || b === S + O)
+      m(S + O), R.offset = S, R.count = O;
     else {
       R.splitAxis = L.axis;
-      const Y = new Hi(), O = S, w = b - S;
-      R.left = Y, Y.boundingData = new Float32Array(6), $s(d, O, w, Y.boundingData, u), F(Y, O, w, u, M + 1);
-      const g = new Hi(), v = b, q = N - w;
-      R.right = g, g.boundingData = new Float32Array(6), $s(d, v, q, g.boundingData, u), F(g, v, q, u, M + 1);
+      const Y = new Hi(), N = S, M = b - S;
+      R.left = Y, Y.boundingData = new Float32Array(6), $s(d, N, M, Y.boundingData, u), F(Y, N, M, u, w + 1);
+      const g = new Hi(), v = b, q = O - M;
+      R.right = g, g.boundingData = new Float32Array(6), $s(d, v, q, g.boundingData, u), F(g, v, q, u, w + 1);
     }
     return R;
   }
@@ -493,17 +493,17 @@ ne.prototype.intersectsTriangle = function() {
     const m = E.points;
     let F = 0, R = -1;
     for (let S = 0; S < 3; S++) {
-      const { start: N, end: y } = h;
-      N.copy(m[S]), y.copy(m[(S + 1) % 3]), h.delta(r);
-      const M = Zs(T.distanceToPoint(N));
-      if (Zs(T.normal.dot(r)) && M) {
+      const { start: O, end: y } = h;
+      O.copy(m[S]), y.copy(m[(S + 1) % 3]), h.delta(r);
+      const w = Zs(T.distanceToPoint(O));
+      if (Zs(T.normal.dot(r)) && w) {
         p.copy(h), F = 2;
         break;
       }
       const L = T.intersectLine(h, u);
-      if (!L && M && u.copy(N), (L || M) && !Zs(u.distanceTo(y))) {
+      if (!L && w && u.copy(O), (L || w) && !Zs(u.distanceTo(y))) {
         if (F <= 1)
-          (F === 1 ? p.start : p.end).copy(u), M && (R = F);
+          (F === 1 ? p.start : p.end).copy(u), w && (R = F);
         else if (F >= 2) {
           (R === 1 ? p.start : p.end).copy(u), F = 2;
           break;
@@ -518,25 +518,25 @@ ne.prototype.intersectsTriangle = function() {
     this.needsUpdate && this.update(), T.isExtendedTriangle ? T.needsUpdate && T.update() : (c.copy(T), c.update(), T = c);
     const F = this.plane, R = T.plane;
     if (Math.abs(F.normal.dot(R.normal)) > 1 - 1e-10) {
-      const S = this.satBounds, N = this.satAxes;
+      const S = this.satBounds, O = this.satAxes;
       t[0] = T.a, t[1] = T.b, t[2] = T.c;
       for (let L = 0; L < 4; L++) {
-        const b = S[L], Y = N[L];
+        const b = S[L], Y = O[L];
         if (e.setFromPoints(Y, t), b.isSeparated(e))
           return !1;
       }
-      const y = T.satBounds, M = T.satAxes;
+      const y = T.satBounds, w = T.satAxes;
       i[0] = this.a, i[1] = this.b, i[2] = this.c;
       for (let L = 0; L < 4; L++) {
-        const b = y[L], Y = M[L];
+        const b = y[L], Y = w[L];
         if (e.setFromPoints(Y, i), b.isSeparated(e))
           return !1;
       }
       for (let L = 0; L < 4; L++) {
-        const b = N[L];
+        const b = O[L];
         for (let Y = 0; Y < 4; Y++) {
-          const O = M[Y];
-          if (n.crossVectors(b, O), e.setFromPoints(n, i), s.setFromPoints(n, t), e.isSeparated(s))
+          const N = w[Y];
+          if (n.crossVectors(b, N), e.setFromPoints(n, i), s.setFromPoints(n, t), e.isSeparated(s))
             return !1;
         }
       }
@@ -547,17 +547,17 @@ ne.prototype.intersectsTriangle = function() {
         return p && (p.start.copy(f.end), p.end.copy(f.end)), !0;
       if (S !== 2)
         return !1;
-      const N = d(T, F, I);
-      if (N === 1 && this.containsPoint(I.end))
+      const O = d(T, F, I);
+      if (O === 1 && this.containsPoint(I.end))
         return p && (p.start.copy(I.end), p.end.copy(I.end)), !0;
-      if (N !== 2)
+      if (O !== 2)
         return !1;
       if (f.delta(o), I.delta(a), o.dot(a) < 0) {
-        let w = I.start;
-        I.start = I.end, I.end = w;
+        let M = I.start;
+        I.start = I.end, I.end = M;
       }
-      const y = f.start.dot(o), M = f.end.dot(o), L = I.start.dot(o), b = I.end.dot(o), Y = M < L, O = y < b;
-      return y !== b && L !== M && Y === O ? !1 : (p && (l.subVectors(f.start, I.start), l.dot(o) > 0 ? p.start.copy(f.start) : p.start.copy(I.start), l.subVectors(f.end, I.end), l.dot(o) < 0 ? p.end.copy(f.end) : p.end.copy(I.end)), !0);
+      const y = f.start.dot(o), w = f.end.dot(o), L = I.start.dot(o), b = I.end.dot(o), Y = w < L, N = y < b;
+      return y !== b && L !== w && Y === N ? !1 : (p && (l.subVectors(f.start, I.start), l.dot(o) > 0 ? p.start.copy(f.start) : p.start.copy(I.start), l.subVectors(f.end, I.end), l.dot(o) < 0 ? p.end.copy(f.end) : p.end.copy(I.end)), !0);
     }
   };
 }();
@@ -695,10 +695,10 @@ Bt.prototype.distanceToBox = function() {
     for (let T = 0; T < 3; T++)
       for (let p = 0; p <= 1; p++)
         for (let m = 0; m <= 1; m++) {
-          const F = (T + 1) % 3, R = (T + 2) % 3, S = p << F | m << R, N = 1 << T | p << F | m << R, y = u[S], M = u[N];
-          i[E].set(y, M);
-          const b = c[T], Y = c[F], O = c[R], w = t[E], g = w.start, v = w.end;
-          g[b] = f[b], g[Y] = p ? f[Y] : I[Y], g[O] = m ? f[O] : I[Y], v[b] = I[b], v[Y] = p ? f[Y] : I[Y], v[O] = m ? f[O] : I[Y], E++;
+          const F = (T + 1) % 3, R = (T + 2) % 3, S = p << F | m << R, O = 1 << T | p << F | m << R, y = u[S], w = u[O];
+          i[E].set(y, w);
+          const b = c[T], Y = c[F], N = c[R], M = t[E], g = M.start, v = M.end;
+          g[b] = f[b], g[Y] = p ? f[Y] : I[Y], g[N] = m ? f[N] : I[Y], v[b] = I[b], v[Y] = p ? f[Y] : I[Y], v[N] = m ? f[N] : I[Y], E++;
         }
     for (let T = 0; T <= 1; T++)
       for (let p = 0; p <= 1; p++)
@@ -786,34 +786,34 @@ function dn(c, i, t, e, s = null, n = 0, r = 0) {
     const I = zt(c, l), u = Zt(h, a);
     return Nt(c, o, _e), e(I, u, !1, r, n + c, _e);
   } else {
-    let b = function(O) {
-      const { uint16Array: w, uint32Array: g } = Ft;
-      let v = O * 2;
-      for (; !Gt(v, w); )
-        O = jt(O), v = O * 2;
-      return zt(O, g);
-    }, Y = function(O) {
-      const { uint16Array: w, uint32Array: g } = Ft;
-      let v = O * 2;
-      for (; !Gt(v, w); )
-        O = qt(O, g), v = O * 2;
-      return zt(O, g) + Zt(v, w);
+    let b = function(N) {
+      const { uint16Array: M, uint32Array: g } = Ft;
+      let v = N * 2;
+      for (; !Gt(v, M); )
+        N = jt(N), v = N * 2;
+      return zt(N, g);
+    }, Y = function(N) {
+      const { uint16Array: M, uint32Array: g } = Ft;
+      let v = N * 2;
+      for (; !Gt(v, M); )
+        N = qt(N, g), v = N * 2;
+      return zt(N, g) + Zt(v, M);
     };
     const I = jt(c), u = qt(c, l);
     let d = I, E = u, T, p, m, F;
     if (s && (m = _e, F = si, Nt(d, o, m), Nt(E, o, F), T = s(m), p = s(F), p < T)) {
       d = u, E = I;
-      const O = T;
-      T = p, p = O, m = F;
+      const N = T;
+      T = p, p = N, m = F;
     }
     m || (m = _e, Nt(d, o, m));
     const R = Gt(d * 2, a), S = t(m, R, T, r + 1, n + d);
-    let N;
+    let O;
     if (S === jn) {
-      const O = b(d), g = Y(d) - O;
-      N = e(O, g, !0, r + 1, n + d, m);
+      const N = b(d), g = Y(d) - N;
+      O = e(N, g, !0, r + 1, n + d, m);
     } else
-      N = S && dn(
+      O = S && dn(
         d,
         i,
         t,
@@ -822,16 +822,16 @@ function dn(c, i, t, e, s = null, n = 0, r = 0) {
         n,
         r + 1
       );
-    if (N)
+    if (O)
       return !0;
     F = si, Nt(E, o, F);
-    const y = Gt(E * 2, a), M = t(F, y, p, r + 1, n + E);
+    const y = Gt(E * 2, a), w = t(F, y, p, r + 1, n + E);
     let L;
-    if (M === jn) {
-      const O = b(E), g = Y(E) - O;
-      L = e(O, g, !0, r + 1, n + E, F);
+    if (w === jn) {
+      const N = b(E), g = Y(E) - N;
+      L = e(N, g, !0, r + 1, n + E, F);
     } else
-      L = M && dn(
+      L = w && dn(
         E,
         i,
         t,
@@ -933,29 +933,29 @@ function ha(c, i = null) {
     const E = I * 2;
     if (o[E + 15] === Ys) {
       const p = r[I + 6], m = o[E + 14];
-      let F = 1 / 0, R = 1 / 0, S = 1 / 0, N = -1 / 0, y = -1 / 0, M = -1 / 0;
+      let F = 1 / 0, R = 1 / 0, S = 1 / 0, O = -1 / 0, y = -1 / 0, w = -1 / 0;
       for (let L = 3 * p, b = 3 * (p + m); L < b; L++) {
         let Y = e[L];
-        const O = s.getX(Y), w = s.getY(Y), g = s.getZ(Y);
-        O < F && (F = O), O > N && (N = O), w < R && (R = w), w > y && (y = w), g < S && (S = g), g > M && (M = g);
+        const N = s.getX(Y), M = s.getY(Y), g = s.getZ(Y);
+        N < F && (F = N), N > O && (O = N), M < R && (R = M), M > y && (y = M), g < S && (S = g), g > w && (w = g);
       }
-      return a[I + 0] !== F || a[I + 1] !== R || a[I + 2] !== S || a[I + 3] !== N || a[I + 4] !== y || a[I + 5] !== M ? (a[I + 0] = F, a[I + 1] = R, a[I + 2] = S, a[I + 3] = N, a[I + 4] = y, a[I + 5] = M, !0) : !1;
+      return a[I + 0] !== F || a[I + 1] !== R || a[I + 2] !== S || a[I + 3] !== O || a[I + 4] !== y || a[I + 5] !== w ? (a[I + 0] = F, a[I + 1] = R, a[I + 2] = S, a[I + 3] = O, a[I + 4] = y, a[I + 5] = w, !0) : !1;
     } else {
       const p = I + 8, m = r[I + 6], F = p + u, R = m + u;
-      let S = d, N = !1, y = !1;
-      i ? S || (N = i.has(F), y = i.has(R), S = !N && !y) : (N = !0, y = !0);
-      const M = S || N, L = S || y;
+      let S = d, O = !1, y = !1;
+      i ? S || (O = i.has(F), y = i.has(R), S = !O && !y) : (O = !0, y = !0);
+      const w = S || O, L = S || y;
       let b = !1;
-      M && (b = f(p, u, S));
+      w && (b = f(p, u, S));
       let Y = !1;
       L && (Y = f(m, u, S));
-      const O = b || Y;
-      if (O)
-        for (let w = 0; w < 3; w++) {
-          const g = p + w, v = m + w, q = a[g], G = a[g + 3], et = a[v], W = a[v + 3];
-          a[I + w] = q < et ? q : et, a[I + w + 3] = G > W ? G : W;
+      const N = b || Y;
+      if (N)
+        for (let M = 0; M < 3; M++) {
+          const g = p + M, v = m + M, q = a[g], G = a[g + 3], et = a[v], W = a[v + 3];
+          a[I + M] = q < et ? q : et, a[I + M + 3] = G > W ? G : W;
         }
-      return O;
+      return N;
     }
   }
 }
@@ -1076,19 +1076,19 @@ function Aa(c, i, t, e = {}, s = {}, n = 0, r = 1 / 0) {
   return Ki.copy(t).invert(), Ci.matrix.copy(Ki), c.shapecast(
     {
       boundsTraverseOrder: (S) => qs.distanceToBox(S),
-      intersectsBounds: (S, N, y) => y < m && y < r ? (N && (Ci.min.copy(S.min), Ci.max.copy(S.max), Ci.needsUpdate = !0), !0) : !1,
-      intersectsRange: (S, N) => {
+      intersectsBounds: (S, O, y) => y < m && y < r ? (O && (Ci.min.copy(S.min), Ci.max.copy(S.max), Ci.needsUpdate = !0), !0) : !1,
+      intersectsRange: (S, O) => {
         if (i.boundsTree)
           return i.boundsTree.shapecast({
-            boundsTraverseOrder: (M) => Ci.distanceToBox(M),
-            intersectsBounds: (M, L, b) => b < m && b < r,
-            intersectsRange: (M, L) => {
-              for (let b = M, Y = M + L; b < Y; b++) {
+            boundsTraverseOrder: (w) => Ci.distanceToBox(w),
+            intersectsBounds: (w, L, b) => b < m && b < r,
+            intersectsRange: (w, L) => {
+              for (let b = w, Y = w + L; b < Y; b++) {
                 wt(u, 3 * b, f, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
-                for (let O = S, w = S + N; O < w; O++) {
-                  wt(I, 3 * O, l, a), I.needsUpdate = !0;
+                for (let N = S, M = S + O; N < M; N++) {
+                  wt(I, 3 * N, l, a), I.needsUpdate = !0;
                   const g = I.distanceToTriangle(u, d, T);
-                  if (g < m && (E.copy(d), p && p.copy(T), m = g, F = O, R = b), g < n)
+                  if (g < m && (E.copy(d), p && p.copy(T), m = g, F = N, R = b), g < n)
                     return !0;
                 }
               }
@@ -1096,12 +1096,12 @@ function Aa(c, i, t, e = {}, s = {}, n = 0, r = 1 / 0) {
           });
         {
           const y = li(i);
-          for (let M = 0, L = y; M < L; M++) {
-            wt(u, 3 * M, f, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
-            for (let b = S, Y = S + N; b < Y; b++) {
+          for (let w = 0, L = y; w < L; w++) {
+            wt(u, 3 * w, f, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+            for (let b = S, Y = S + O; b < Y; b++) {
               wt(I, 3 * b, l, a), I.needsUpdate = !0;
-              const O = I.distanceToTriangle(u, d, T);
-              if (O < m && (E.copy(d), p && p.copy(T), m = O, F = b, R = M), O < n)
+              const N = I.distanceToTriangle(u, d, T);
+              if (N < m && (E.copy(d), p && p.copy(T), m = N, F = b, R = w), N < n)
                 return !0;
             }
           }
@@ -1121,33 +1121,33 @@ function Fa(c, i = null) {
     const E = I * 2;
     if (o[E + 15] === Ys) {
       const p = r[I + 6], m = o[E + 14];
-      let F = 1 / 0, R = 1 / 0, S = 1 / 0, N = -1 / 0, y = -1 / 0, M = -1 / 0;
+      let F = 1 / 0, R = 1 / 0, S = 1 / 0, O = -1 / 0, y = -1 / 0, w = -1 / 0;
       for (let L = p, b = p + m; L < b; L++) {
         const Y = 3 * c.resolveTriangleIndex(L);
-        for (let O = 0; O < 3; O++) {
-          let w = Y + O;
-          w = e ? e[w] : w;
-          const g = s.getX(w), v = s.getY(w), q = s.getZ(w);
-          g < F && (F = g), g > N && (N = g), v < R && (R = v), v > y && (y = v), q < S && (S = q), q > M && (M = q);
+        for (let N = 0; N < 3; N++) {
+          let M = Y + N;
+          M = e ? e[M] : M;
+          const g = s.getX(M), v = s.getY(M), q = s.getZ(M);
+          g < F && (F = g), g > O && (O = g), v < R && (R = v), v > y && (y = v), q < S && (S = q), q > w && (w = q);
         }
       }
-      return a[I + 0] !== F || a[I + 1] !== R || a[I + 2] !== S || a[I + 3] !== N || a[I + 4] !== y || a[I + 5] !== M ? (a[I + 0] = F, a[I + 1] = R, a[I + 2] = S, a[I + 3] = N, a[I + 4] = y, a[I + 5] = M, !0) : !1;
+      return a[I + 0] !== F || a[I + 1] !== R || a[I + 2] !== S || a[I + 3] !== O || a[I + 4] !== y || a[I + 5] !== w ? (a[I + 0] = F, a[I + 1] = R, a[I + 2] = S, a[I + 3] = O, a[I + 4] = y, a[I + 5] = w, !0) : !1;
     } else {
       const p = I + 8, m = r[I + 6], F = p + u, R = m + u;
-      let S = d, N = !1, y = !1;
-      i ? S || (N = i.has(F), y = i.has(R), S = !N && !y) : (N = !0, y = !0);
-      const M = S || N, L = S || y;
+      let S = d, O = !1, y = !1;
+      i ? S || (O = i.has(F), y = i.has(R), S = !O && !y) : (O = !0, y = !0);
+      const w = S || O, L = S || y;
       let b = !1;
-      M && (b = f(p, u, S));
+      w && (b = f(p, u, S));
       let Y = !1;
       L && (Y = f(m, u, S));
-      const O = b || Y;
-      if (O)
-        for (let w = 0; w < 3; w++) {
-          const g = p + w, v = m + w, q = a[g], G = a[g + 3], et = a[v], W = a[v + 3];
-          a[I + w] = q < et ? q : et, a[I + w + 3] = G > W ? G : W;
+      const N = b || Y;
+      if (N)
+        for (let M = 0; M < 3; M++) {
+          const g = p + M, v = m + M, q = a[g], G = a[g + 3], et = a[v], W = a[v + 3];
+          a[I + M] = q < et ? q : et, a[I + M + 3] = G > W ? G : W;
         }
-      return O;
+      return N;
     }
   }
 }
@@ -1240,22 +1240,22 @@ function Ma(c, i, t, e = {}, s = {}, n = 0, r = 1 / 0) {
   return es.copy(t).invert(), mi.matrix.copy(es), c.shapecast(
     {
       boundsTraverseOrder: (S) => Qs.distanceToBox(S),
-      intersectsBounds: (S, N, y) => y < m && y < r ? (N && (mi.min.copy(S.min), mi.max.copy(S.max), mi.needsUpdate = !0), !0) : !1,
-      intersectsRange: (S, N) => {
+      intersectsBounds: (S, O, y) => y < m && y < r ? (O && (mi.min.copy(S.min), mi.max.copy(S.max), mi.needsUpdate = !0), !0) : !1,
+      intersectsRange: (S, O) => {
         if (i.boundsTree) {
           const y = i.boundsTree;
           return y.shapecast({
-            boundsTraverseOrder: (M) => mi.distanceToBox(M),
-            intersectsBounds: (M, L, b) => b < m && b < r,
-            intersectsRange: (M, L) => {
-              for (let b = M, Y = M + L; b < Y; b++) {
-                const O = y.resolveTriangleIndex(b);
-                wt(u, 3 * O, f, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
-                for (let w = S, g = S + N; w < g; w++) {
-                  const v = c.resolveTriangleIndex(w);
+            boundsTraverseOrder: (w) => mi.distanceToBox(w),
+            intersectsBounds: (w, L, b) => b < m && b < r,
+            intersectsRange: (w, L) => {
+              for (let b = w, Y = w + L; b < Y; b++) {
+                const N = y.resolveTriangleIndex(b);
+                wt(u, 3 * N, f, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+                for (let M = S, g = S + O; M < g; M++) {
+                  const v = c.resolveTriangleIndex(M);
                   wt(I, 3 * v, l, a), I.needsUpdate = !0;
                   const q = I.distanceToTriangle(u, d, T);
-                  if (q < m && (E.copy(d), p && p.copy(T), m = q, F = w, R = b), q < n)
+                  if (q < m && (E.copy(d), p && p.copy(T), m = q, F = M, R = b), q < n)
                     return !0;
                 }
               }
@@ -1263,13 +1263,13 @@ function Ma(c, i, t, e = {}, s = {}, n = 0, r = 1 / 0) {
           });
         } else {
           const y = li(i);
-          for (let M = 0, L = y; M < L; M++) {
-            wt(u, 3 * M, f, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
-            for (let b = S, Y = S + N; b < Y; b++) {
-              const O = c.resolveTriangleIndex(b);
-              wt(I, 3 * O, l, a), I.needsUpdate = !0;
-              const w = I.distanceToTriangle(u, d, T);
-              if (w < m && (E.copy(d), p && p.copy(T), m = w, F = b, R = M), w < n)
+          for (let w = 0, L = y; w < L; w++) {
+            wt(u, 3 * w, f, h), u.a.applyMatrix4(t), u.b.applyMatrix4(t), u.c.applyMatrix4(t), u.needsUpdate = !0;
+            for (let b = S, Y = S + O; b < Y; b++) {
+              const N = c.resolveTriangleIndex(b);
+              wt(I, 3 * N, l, a), I.needsUpdate = !0;
+              const M = I.distanceToTriangle(u, d, T);
+              if (M < m && (E.copy(d), p && p.copy(T), m = M, F = b, R = w), M < n)
                 return !0;
             }
           }
@@ -1315,9 +1315,9 @@ function ba(c, i, t, e) {
 function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
   let f, I;
   h ? (f = ps, I = wi) : (f = wi, I = ps);
-  const u = f.float32Array, d = f.uint32Array, E = f.uint16Array, T = I.float32Array, p = I.uint32Array, m = I.uint16Array, F = c * 2, R = i * 2, S = Gt(F, E), N = Gt(R, m);
+  const u = f.float32Array, d = f.uint32Array, E = f.uint16Array, T = I.float32Array, p = I.uint32Array, m = I.uint16Array, F = c * 2, R = i * 2, S = Gt(F, E), O = Gt(R, m);
   let y = !1;
-  if (N && S)
+  if (O && S)
     h ? y = s(
       zt(i, p),
       Zt(i * 2, m),
@@ -1337,12 +1337,12 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
       a,
       r + i
     );
-  else if (N) {
-    const M = Ne.getPrimitive();
-    Nt(i, T, M), M.applyMatrix4(t);
+  else if (O) {
+    const w = Ne.getPrimitive();
+    Nt(i, T, w), w.applyMatrix4(t);
     const L = jt(c), b = qt(c, d);
     Nt(L, u, qe), Nt(b, u, Qe);
-    const Y = M.intersectsBox(qe), O = M.intersectsBox(Qe);
+    const Y = w.intersectsBox(qe), N = w.intersectsBox(Qe);
     y = Y && Kt(
       i,
       L,
@@ -1353,9 +1353,9 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
       n,
       a,
       o + 1,
-      M,
+      w,
       !h
-    ) || O && Kt(
+    ) || N && Kt(
       i,
       b,
       e,
@@ -1365,17 +1365,17 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
       n,
       a,
       o + 1,
-      M,
+      w,
       !h
-    ), Ne.releasePrimitive(M);
+    ), Ne.releasePrimitive(w);
   } else {
-    const M = jt(i), L = qt(i, p);
-    Nt(M, T, Ks), Nt(L, T, Js);
+    const w = jt(i), L = qt(i, p);
+    Nt(w, T, Ks), Nt(L, T, Js);
     const b = l.intersectsBox(Ks), Y = l.intersectsBox(Js);
     if (b && Y)
       y = Kt(
         c,
-        M,
+        w,
         t,
         e,
         s,
@@ -1402,7 +1402,7 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
       if (S)
         y = Kt(
           c,
-          M,
+          w,
           t,
           e,
           s,
@@ -1414,14 +1414,14 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
           h
         );
       else {
-        const O = Ne.getPrimitive();
-        O.copy(Ks).applyMatrix4(t);
-        const w = jt(c), g = qt(c, d);
-        Nt(w, u, qe), Nt(g, u, Qe);
-        const v = O.intersectsBox(qe), q = O.intersectsBox(Qe);
+        const N = Ne.getPrimitive();
+        N.copy(Ks).applyMatrix4(t);
+        const M = jt(c), g = qt(c, d);
+        Nt(M, u, qe), Nt(g, u, Qe);
+        const v = N.intersectsBox(qe), q = N.intersectsBox(Qe);
         y = v && Kt(
-          M,
           w,
+          M,
           e,
           t,
           s,
@@ -1429,10 +1429,10 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
           n,
           a,
           o + 1,
-          O,
+          N,
           !h
         ) || q && Kt(
-          M,
+          w,
           g,
           e,
           t,
@@ -1441,9 +1441,9 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
           n,
           a,
           o + 1,
-          O,
+          N,
           !h
-        ), Ne.releasePrimitive(O);
+        ), Ne.releasePrimitive(N);
       }
     else if (Y)
       if (S)
@@ -1461,14 +1461,14 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
           h
         );
       else {
-        const O = Ne.getPrimitive();
-        O.copy(Js).applyMatrix4(t);
-        const w = jt(c), g = qt(c, d);
-        Nt(w, u, qe), Nt(g, u, Qe);
-        const v = O.intersectsBox(qe), q = O.intersectsBox(Qe);
+        const N = Ne.getPrimitive();
+        N.copy(Js).applyMatrix4(t);
+        const M = jt(c), g = qt(c, d);
+        Nt(M, u, qe), Nt(g, u, Qe);
+        const v = N.intersectsBox(qe), q = N.intersectsBox(Qe);
         y = v && Kt(
           L,
-          w,
+          M,
           e,
           t,
           s,
@@ -1476,7 +1476,7 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
           n,
           a,
           o + 1,
-          O,
+          N,
           !h
         ) || q && Kt(
           L,
@@ -1488,9 +1488,9 @@ function Kt(c, i, t, e, s, n = 0, r = 0, o = 0, a = 0, l = null, h = !1) {
           n,
           a,
           o + 1,
-          O,
+          N,
           !h
-        ), Ne.releasePrimitive(O);
+        ), Ne.releasePrimitive(N);
       }
   }
   return y;
@@ -1645,19 +1645,19 @@ class Un {
       wt(h, d * 3, f, I);
     };
     if (n) {
-      const d = (E, T, p, m, F, R, S, N) => {
-        for (let y = p, M = p + m; y < M; y++) {
+      const d = (E, T, p, m, F, R, S, O) => {
+        for (let y = p, w = p + m; y < w; y++) {
           u(y), h.a.applyMatrix4(t), h.b.applyMatrix4(t), h.c.applyMatrix4(t), h.needsUpdate = !0;
           for (let L = E, b = E + T; L < b; L++)
-            if (l(L), r.needsUpdate = !0, n(r, h, L, y, F, R, S, N))
+            if (l(L), r.needsUpdate = !0, n(r, h, L, y, F, R, S, O))
               return !0;
         }
         return !1;
       };
       if (s) {
         const E = s;
-        s = function(T, p, m, F, R, S, N, y) {
-          return E(T, p, m, F, R, S, N, y) ? !0 : d(T, p, m, F, R, S, N, y);
+        s = function(T, p, m, F, R, S, O, y) {
+          return E(T, p, m, F, R, S, O, y) ? !0 : d(T, p, m, F, R, S, O, y);
         };
       } else
         s = d;
@@ -2554,18 +2554,18 @@ function qa(c) {
     d.add(I.copy(u).multiplyScalar(ft)), E += ft, T += (9 * u.x * u.x + o.x * o.x + a.x * a.x + l.x * l.x) * (ft / 12), p += (9 * u.x * u.y + o.x * o.y + a.x * a.y + l.x * l.y) * (ft / 12), m += (9 * u.x * u.z + o.x * o.z + a.x * a.z + l.x * l.z) * (ft / 12), F += (9 * u.y * u.y + o.y * o.y + a.y * a.y + l.y * l.y) * (ft / 12), R += (9 * u.y * u.z + o.y * o.z + a.y * a.z + l.y * l.z) * (ft / 12), S += (9 * u.z * u.z + o.z * o.z + a.z * a.z + l.z * l.z) * (ft / 12);
   }
   d.divideScalar(E), T /= E, p /= E, m /= E, F /= E, R /= E, S /= E, T -= d.x * d.x, p -= d.x * d.y, m -= d.x * d.z, F -= d.y * d.y, R -= d.y * d.z, S -= d.z * d.z;
-  const N = new D.Matrix3();
-  N.elements[0] = T, N.elements[1] = p, N.elements[2] = m, N.elements[3] = p, N.elements[4] = F, N.elements[5] = R, N.elements[6] = m, N.elements[7] = R, N.elements[8] = S, ja(N, e);
-  const y = e.unitary, M = new D.Vector3(), L = new D.Vector3(), b = new D.Vector3();
-  y.extractBasis(M, L, b);
-  let Y = -1 / 0, O = -1 / 0, w = -1 / 0, g = 1 / 0, v = 1 / 0, q = 1 / 0;
+  const O = new D.Matrix3();
+  O.elements[0] = T, O.elements[1] = p, O.elements[2] = m, O.elements[3] = p, O.elements[4] = F, O.elements[5] = R, O.elements[6] = m, O.elements[7] = R, O.elements[8] = S, ja(O, e);
+  const y = e.unitary, w = new D.Vector3(), L = new D.Vector3(), b = new D.Vector3();
+  y.extractBasis(w, L, b);
+  let Y = -1 / 0, N = -1 / 0, M = -1 / 0, g = 1 / 0, v = 1 / 0, q = 1 / 0;
   for (let at = 0, It = i.length; at < It; at++) {
     const ft = i[at];
-    Y = Math.max(M.dot(ft), Y), O = Math.max(L.dot(ft), O), w = Math.max(b.dot(ft), w), g = Math.min(M.dot(ft), g), v = Math.min(L.dot(ft), v), q = Math.min(b.dot(ft), q);
+    Y = Math.max(w.dot(ft), Y), N = Math.max(L.dot(ft), N), M = Math.max(b.dot(ft), M), g = Math.min(w.dot(ft), g), v = Math.min(L.dot(ft), v), q = Math.min(b.dot(ft), q);
   }
-  M.multiplyScalar(0.5 * (g + Y)), L.multiplyScalar(0.5 * (v + O)), b.multiplyScalar(0.5 * (q + w));
+  w.multiplyScalar(0.5 * (g + Y)), L.multiplyScalar(0.5 * (v + N)), b.multiplyScalar(0.5 * (q + M));
   const G = new D.Vector3(), et = new D.Vector3(), W = new D.Matrix3();
-  G.add(M).add(L).add(b), et.x = Y - g, et.y = O - v, et.z = w - q, et.multiplyScalar(0.5), W.copy(y);
+  G.add(w).add(L).add(b), et.x = Y - g, et.y = N - v, et.z = M - q, et.multiplyScalar(0.5), W.copy(y);
   const { x: nt, y: V, z: x } = et, ot = new D.Matrix4();
   ot.makeScale(nt * 2, V * 2, x * 2);
   const it = new D.Matrix4();
@@ -3137,7 +3137,7 @@ const Fs = class Fs {
 /**
  * The version of the @thatopen/components library.
  */
-C(Fs, "release", "2.3.9");
+C(Fs, "release", "2.3.11");
 let Cs = Fs;
 class Qa extends xn {
   constructor() {
@@ -3658,10 +3658,10 @@ function mr(c, i, t, e, s = 1 / 0, n, r) {
     u = u / v * F, d = d / v * F, E = E / v * F;
   }
   h = c.x - u, f = c.y - d, I = c.z - E;
-  const N = (t.x + o * u) * n, y = (t.y + o * d) * n, M = (t.z + o * E) * n;
-  t.x = (t.x - o * N) * l, t.y = (t.y - o * y) * l, t.z = (t.z - o * M) * l, r.x = h + (u + N) * l, r.y = f + (d + y) * l, r.z = I + (E + M) * l;
-  const L = T - c.x, b = p - c.y, Y = m - c.z, O = r.x - T, w = r.y - p, g = r.z - m;
-  return L * O + b * w + Y * g > 0 && (r.x = T, r.y = p, r.z = m, t.x = (r.x - T) / n, t.y = (r.y - p) / n, t.z = (r.z - m) / n), r;
+  const O = (t.x + o * u) * n, y = (t.y + o * d) * n, w = (t.z + o * E) * n;
+  t.x = (t.x - o * O) * l, t.y = (t.y - o * y) * l, t.z = (t.z - o * w) * l, r.x = h + (u + O) * l, r.y = f + (d + y) * l, r.z = I + (E + w) * l;
+  const L = T - c.x, b = p - c.y, Y = m - c.z, N = r.x - T, M = r.y - p, g = r.z - m;
+  return L * N + b * M + Y * g > 0 && (r.x = T, r.y = p, r.z = m, t.x = (r.x - T) / n, t.y = (r.y - p) / n, t.z = (r.z - m) / n), r;
 }
 function rn(c, i) {
   i.set(0, 0), c.forEach((t) => {
@@ -3807,26 +3807,26 @@ class vt extends ic {
    */
   constructor(i, t) {
     super(), this.minPolarAngle = 0, this.maxPolarAngle = Math.PI, this.minAzimuthAngle = -1 / 0, this.maxAzimuthAngle = 1 / 0, this.minDistance = Number.EPSILON, this.maxDistance = 1 / 0, this.infinityDolly = !1, this.minZoom = 0.01, this.maxZoom = 1 / 0, this.smoothTime = 0.25, this.draggingSmoothTime = 0.125, this.maxSpeed = 1 / 0, this.azimuthRotateSpeed = 1, this.polarRotateSpeed = 1, this.dollySpeed = 1, this.dollyDragInverted = !1, this.truckSpeed = 2, this.dollyToCursor = !1, this.dragToOffset = !1, this.verticalDragToForward = !1, this.boundaryFriction = 0, this.restThreshold = 0.01, this.colliderMeshes = [], this.cancel = () => {
-    }, this._enabled = !0, this._state = H.NONE, this._viewport = null, this._changedDolly = 0, this._changedZoom = 0, this._hasRested = !0, this._boundaryEnclosesCamera = !1, this._needsUpdate = !0, this._updatedLastTime = !1, this._elementRect = new DOMRect(), this._isDragging = !1, this._dragNeedsUpdate = !0, this._activePointers = [], this._lockedPointer = null, this._interactiveArea = new DOMRect(0, 0, 1, 1), this._isUserControllingRotate = !1, this._isUserControllingDolly = !1, this._isUserControllingTruck = !1, this._isUserControllingOffset = !1, this._isUserControllingZoom = !1, this._lastDollyDirection = Ke.NONE, this._thetaVelocity = { value: 0 }, this._phiVelocity = { value: 0 }, this._radiusVelocity = { value: 0 }, this._targetVelocity = new lt.Vector3(), this._focalOffsetVelocity = new lt.Vector3(), this._zoomVelocity = { value: 0 }, this._truckInternal = (R, S, N) => {
-      let y, M;
+    }, this._enabled = !0, this._state = H.NONE, this._viewport = null, this._changedDolly = 0, this._changedZoom = 0, this._hasRested = !0, this._boundaryEnclosesCamera = !1, this._needsUpdate = !0, this._updatedLastTime = !1, this._elementRect = new DOMRect(), this._isDragging = !1, this._dragNeedsUpdate = !0, this._activePointers = [], this._lockedPointer = null, this._interactiveArea = new DOMRect(0, 0, 1, 1), this._isUserControllingRotate = !1, this._isUserControllingDolly = !1, this._isUserControllingTruck = !1, this._isUserControllingOffset = !1, this._isUserControllingZoom = !1, this._lastDollyDirection = Ke.NONE, this._thetaVelocity = { value: 0 }, this._phiVelocity = { value: 0 }, this._radiusVelocity = { value: 0 }, this._targetVelocity = new lt.Vector3(), this._focalOffsetVelocity = new lt.Vector3(), this._zoomVelocity = { value: 0 }, this._truckInternal = (R, S, O) => {
+      let y, w;
       if (ve(this._camera)) {
         const L = ut.copy(this._camera.position).sub(this._target), b = this._camera.getEffectiveFOV() * Ri, Y = L.length() * Math.tan(b * 0.5);
-        y = this.truckSpeed * R * Y / this._elementRect.height, M = this.truckSpeed * S * Y / this._elementRect.height;
+        y = this.truckSpeed * R * Y / this._elementRect.height, w = this.truckSpeed * S * Y / this._elementRect.height;
       } else if (Oe(this._camera)) {
         const L = this._camera;
-        y = R * (L.right - L.left) / L.zoom / this._elementRect.width, M = S * (L.top - L.bottom) / L.zoom / this._elementRect.height;
+        y = R * (L.right - L.left) / L.zoom / this._elementRect.width, w = S * (L.top - L.bottom) / L.zoom / this._elementRect.height;
       } else
         return;
-      this.verticalDragToForward ? (N ? this.setFocalOffset(this._focalOffsetEnd.x + y, this._focalOffsetEnd.y, this._focalOffsetEnd.z, !0) : this.truck(y, 0, !0), this.forward(-M, !0)) : N ? this.setFocalOffset(this._focalOffsetEnd.x + y, this._focalOffsetEnd.y + M, this._focalOffsetEnd.z, !0) : this.truck(y, M, !0);
+      this.verticalDragToForward ? (O ? this.setFocalOffset(this._focalOffsetEnd.x + y, this._focalOffsetEnd.y, this._focalOffsetEnd.z, !0) : this.truck(y, 0, !0), this.forward(-w, !0)) : O ? this.setFocalOffset(this._focalOffsetEnd.x + y, this._focalOffsetEnd.y + w, this._focalOffsetEnd.z, !0) : this.truck(y, w, !0);
     }, this._rotateInternal = (R, S) => {
-      const N = Je * this.azimuthRotateSpeed * R / this._elementRect.height, y = Je * this.polarRotateSpeed * S / this._elementRect.height;
-      this.rotate(N, y, !0);
-    }, this._dollyInternal = (R, S, N) => {
-      const y = Math.pow(0.95, -R * this.dollySpeed), M = this._sphericalEnd.radius, L = this._sphericalEnd.radius * y, b = Jt(L, this.minDistance, this.maxDistance), Y = b - L;
-      this.infinityDolly && this.dollyToCursor ? this._dollyToNoClamp(L, !0) : this.infinityDolly && !this.dollyToCursor ? (this.dollyInFixed(Y, !0), this._dollyToNoClamp(b, !0)) : this._dollyToNoClamp(b, !0), this.dollyToCursor && (this._changedDolly += (this.infinityDolly ? L : b) - M, this._dollyControlCoord.set(S, N)), this._lastDollyDirection = Math.sign(-R);
-    }, this._zoomInternal = (R, S, N) => {
-      const y = Math.pow(0.95, R * this.dollySpeed), M = this._zoom, L = this._zoom * y;
-      this.zoomTo(L, !0), this.dollyToCursor && (this._changedZoom += L - M, this._dollyControlCoord.set(S, N));
+      const O = Je * this.azimuthRotateSpeed * R / this._elementRect.height, y = Je * this.polarRotateSpeed * S / this._elementRect.height;
+      this.rotate(O, y, !0);
+    }, this._dollyInternal = (R, S, O) => {
+      const y = Math.pow(0.95, -R * this.dollySpeed), w = this._sphericalEnd.radius, L = this._sphericalEnd.radius * y, b = Jt(L, this.minDistance, this.maxDistance), Y = b - L;
+      this.infinityDolly && this.dollyToCursor ? this._dollyToNoClamp(L, !0) : this.infinityDolly && !this.dollyToCursor ? (this.dollyInFixed(Y, !0), this._dollyToNoClamp(b, !0)) : this._dollyToNoClamp(b, !0), this.dollyToCursor && (this._changedDolly += (this.infinityDolly ? L : b) - w, this._dollyControlCoord.set(S, O)), this._lastDollyDirection = Math.sign(-R);
+    }, this._zoomInternal = (R, S, O) => {
+      const y = Math.pow(0.95, R * this.dollySpeed), w = this._zoom, L = this._zoom * y;
+      this.zoomTo(L, !0), this.dollyToCursor && (this._changedZoom += L - w, this._dollyControlCoord.set(S, O));
     }, typeof lt > "u" && console.error("camera-controls: `THREE` is undefined. You must first run `CameraControls.install( { THREE: THREE } )`. Check the docs for further information."), this._camera = i, this._yAxisUpSpace = new lt.Quaternion().setFromUnitVectors(this._camera.up, os), this._yAxisUpSpaceInverse = this._yAxisUpSpace.clone().invert(), this._state = H.NONE, this._target = new lt.Vector3(), this._targetEnd = this._target.clone(), this._focalOffset = new lt.Vector3(), this._focalOffsetEnd = this._focalOffset.clone(), this._spherical = new lt.Spherical().setFromVector3(ut.copy(this._camera.position).applyQuaternion(this._yAxisUpSpace)), this._sphericalEnd = this._spherical.clone(), this._lastDistance = this._spherical.radius, this._zoom = this._camera.zoom, this._zoomEnd = this._zoom, this._lastZoom = this._zoom, this._nearPlaneCorners = [
       new lt.Vector3(),
       new lt.Vector3(),
@@ -3846,8 +3846,8 @@ class vt extends ic {
       if (!this._enabled || !this._domElement)
         return;
       if (this._interactiveArea.left !== 0 || this._interactiveArea.top !== 0 || this._interactiveArea.width !== 1 || this._interactiveArea.height !== 1) {
-        const y = this._domElement.getBoundingClientRect(), M = R.clientX / y.width, L = R.clientY / y.height;
-        if (M < this._interactiveArea.left || M > this._interactiveArea.right || L < this._interactiveArea.top || L > this._interactiveArea.bottom)
+        const y = this._domElement.getBoundingClientRect(), w = R.clientX / y.width, L = R.clientY / y.height;
+        if (w < this._interactiveArea.left || w > this._interactiveArea.right || L < this._interactiveArea.top || L > this._interactiveArea.bottom)
           return;
       }
       const S = R.pointerType !== "mouse" ? null : (R.buttons & ht.LEFT) === ht.LEFT ? ht.LEFT : (R.buttons & ht.MIDDLE) === ht.MIDDLE ? ht.MIDDLE : (R.buttons & ht.RIGHT) === ht.RIGHT ? ht.RIGHT : null;
@@ -3857,7 +3857,7 @@ class vt extends ic {
       }
       if ((R.buttons & ht.LEFT) === ht.LEFT && this._lockedPointer)
         return;
-      const N = {
+      const O = {
         pointerId: R.pointerId,
         clientX: R.clientX,
         clientY: R.clientY,
@@ -3865,13 +3865,13 @@ class vt extends ic {
         deltaY: 0,
         mouseButton: S
       };
-      this._activePointers.push(N), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.addEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.addEventListener("pointerup", h), this._isDragging = !0, E(R);
+      this._activePointers.push(O), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.addEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.addEventListener("pointerup", h), this._isDragging = !0, E(R);
     }, o = (R) => {
       if (!this._enabled || !this._domElement || this._lockedPointer)
         return;
       if (this._interactiveArea.left !== 0 || this._interactiveArea.top !== 0 || this._interactiveArea.width !== 1 || this._interactiveArea.height !== 1) {
-        const y = this._domElement.getBoundingClientRect(), M = R.clientX / y.width, L = R.clientY / y.height;
-        if (M < this._interactiveArea.left || M > this._interactiveArea.right || L < this._interactiveArea.top || L > this._interactiveArea.bottom)
+        const y = this._domElement.getBoundingClientRect(), w = R.clientX / y.width, L = R.clientY / y.height;
+        if (w < this._interactiveArea.left || w > this._interactiveArea.right || L < this._interactiveArea.top || L > this._interactiveArea.bottom)
           return;
       }
       const S = (R.buttons & ht.LEFT) === ht.LEFT ? ht.LEFT : (R.buttons & ht.MIDDLE) === ht.MIDDLE ? ht.MIDDLE : (R.buttons & ht.RIGHT) === ht.RIGHT ? ht.RIGHT : null;
@@ -3879,7 +3879,7 @@ class vt extends ic {
         const y = this._findPointerByMouseButton(S);
         y && this._disposePointer(y);
       }
-      const N = {
+      const O = {
         pointerId: 1,
         clientX: R.clientX,
         clientY: R.clientY,
@@ -3887,12 +3887,12 @@ class vt extends ic {
         deltaY: 0,
         mouseButton: (R.buttons & ht.LEFT) === ht.LEFT ? ht.LEFT : (R.buttons & ht.MIDDLE) === ht.LEFT ? ht.MIDDLE : (R.buttons & ht.RIGHT) === ht.LEFT ? ht.RIGHT : null
       };
-      this._activePointers.push(N), this._domElement.ownerDocument.removeEventListener("mousemove", l), this._domElement.ownerDocument.removeEventListener("mouseup", f), this._domElement.ownerDocument.addEventListener("mousemove", l), this._domElement.ownerDocument.addEventListener("mouseup", f), this._isDragging = !0, E(R);
+      this._activePointers.push(O), this._domElement.ownerDocument.removeEventListener("mousemove", l), this._domElement.ownerDocument.removeEventListener("mouseup", f), this._domElement.ownerDocument.addEventListener("mousemove", l), this._domElement.ownerDocument.addEventListener("mouseup", f), this._isDragging = !0, E(R);
     }, a = (R) => {
       R.cancelable && R.preventDefault();
-      const S = R.pointerId, N = this._lockedPointer || this._findPointerById(S);
-      if (N) {
-        if (N.clientX = R.clientX, N.clientY = R.clientY, N.deltaX = R.movementX, N.deltaY = R.movementY, this._state = 0, R.pointerType === "touch")
+      const S = R.pointerId, O = this._lockedPointer || this._findPointerById(S);
+      if (O) {
+        if (O.clientX = R.clientX, O.clientY = R.clientY, O.deltaX = R.movementX, O.deltaY = R.movementY, this._state = 0, R.pointerType === "touch")
           switch (this._activePointers.length) {
             case 1:
               this._state = this.touches.one;
@@ -3950,7 +3950,7 @@ class vt extends ic {
         const L = performance.now();
         I - L < 1e3 && this._getClientRect(this._elementRect), I = L;
       }
-      const S = nc ? -1 : -3, N = R.deltaMode === 1 ? R.deltaY / S : R.deltaY / (S * 10), y = this.dollyToCursor ? (R.clientX - this._elementRect.x) / this._elementRect.width * 2 - 1 : 0, M = this.dollyToCursor ? (R.clientY - this._elementRect.y) / this._elementRect.height * -2 + 1 : 0;
+      const S = nc ? -1 : -3, O = R.deltaMode === 1 ? R.deltaY / S : R.deltaY / (S * 10), y = this.dollyToCursor ? (R.clientX - this._elementRect.x) / this._elementRect.width * 2 - 1 : 0, w = this.dollyToCursor ? (R.clientY - this._elementRect.y) / this._elementRect.height * -2 + 1 : 0;
       switch (this.mouseButtons.wheel) {
         case H.ROTATE: {
           this._rotateInternal(R.deltaX, R.deltaY), this._isUserControllingRotate = !0;
@@ -3965,11 +3965,11 @@ class vt extends ic {
           break;
         }
         case H.DOLLY: {
-          this._dollyInternal(-N, y, M), this._isUserControllingDolly = !0;
+          this._dollyInternal(-O, y, w), this._isUserControllingDolly = !0;
           break;
         }
         case H.ZOOM: {
-          this._zoomInternal(-N, y, M), this._isUserControllingZoom = !0;
+          this._zoomInternal(-O, y, w), this._isUserControllingZoom = !0;
           break;
         }
       }
@@ -3977,8 +3977,8 @@ class vt extends ic {
     }, d = (R) => {
       if (!(!this._domElement || !this._enabled)) {
         if (this.mouseButtons.right === vt.ACTION.NONE) {
-          const S = R instanceof PointerEvent ? R.pointerId : (R instanceof MouseEvent, 0), N = this._findPointerById(S);
-          N && this._disposePointer(N), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.removeEventListener("mousemove", l), this._domElement.ownerDocument.removeEventListener("mouseup", f);
+          const S = R instanceof PointerEvent ? R.pointerId : (R instanceof MouseEvent, 0), O = this._findPointerById(S);
+          O && this._disposePointer(O), this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.removeEventListener("mousemove", l), this._domElement.ownerDocument.removeEventListener("mouseup", f);
           return;
         }
         R.preventDefault();
@@ -3987,8 +3987,8 @@ class vt extends ic {
       if (!this._enabled)
         return;
       if (rn(this._activePointers, Yt), this._getClientRect(this._elementRect), e.copy(Yt), s.copy(Yt), this._activePointers.length >= 2) {
-        const N = Yt.x - this._activePointers[1].clientX, y = Yt.y - this._activePointers[1].clientY, M = Math.sqrt(N * N + y * y);
-        n.set(0, M);
+        const O = Yt.x - this._activePointers[1].clientX, y = Yt.y - this._activePointers[1].clientY, w = Math.sqrt(O * O + y * y);
+        n.set(0, w);
         const L = (this._activePointers[0].clientX + this._activePointers[1].clientX) * 0.5, b = (this._activePointers[0].clientY + this._activePointers[1].clientY) * 0.5;
         s.set(L, b);
       }
@@ -4013,18 +4013,18 @@ class vt extends ic {
       if (!this._enabled || !this._dragNeedsUpdate)
         return;
       this._dragNeedsUpdate = !1, rn(this._activePointers, Yt);
-      const S = this._domElement && document.pointerLockElement === this._domElement ? this._lockedPointer || this._activePointers[0] : null, N = S ? -S.deltaX : s.x - Yt.x, y = S ? -S.deltaY : s.y - Yt.y;
-      if (s.copy(Yt), ((this._state & H.ROTATE) === H.ROTATE || (this._state & H.TOUCH_ROTATE) === H.TOUCH_ROTATE || (this._state & H.TOUCH_DOLLY_ROTATE) === H.TOUCH_DOLLY_ROTATE || (this._state & H.TOUCH_ZOOM_ROTATE) === H.TOUCH_ZOOM_ROTATE) && (this._rotateInternal(N, y), this._isUserControllingRotate = !0), (this._state & H.DOLLY) === H.DOLLY || (this._state & H.ZOOM) === H.ZOOM) {
-        const M = this.dollyToCursor ? (e.x - this._elementRect.x) / this._elementRect.width * 2 - 1 : 0, L = this.dollyToCursor ? (e.y - this._elementRect.y) / this._elementRect.height * -2 + 1 : 0, b = this.dollyDragInverted ? -1 : 1;
-        (this._state & H.DOLLY) === H.DOLLY ? (this._dollyInternal(b * y * rs, M, L), this._isUserControllingDolly = !0) : (this._zoomInternal(b * y * rs, M, L), this._isUserControllingZoom = !0);
+      const S = this._domElement && document.pointerLockElement === this._domElement ? this._lockedPointer || this._activePointers[0] : null, O = S ? -S.deltaX : s.x - Yt.x, y = S ? -S.deltaY : s.y - Yt.y;
+      if (s.copy(Yt), ((this._state & H.ROTATE) === H.ROTATE || (this._state & H.TOUCH_ROTATE) === H.TOUCH_ROTATE || (this._state & H.TOUCH_DOLLY_ROTATE) === H.TOUCH_DOLLY_ROTATE || (this._state & H.TOUCH_ZOOM_ROTATE) === H.TOUCH_ZOOM_ROTATE) && (this._rotateInternal(O, y), this._isUserControllingRotate = !0), (this._state & H.DOLLY) === H.DOLLY || (this._state & H.ZOOM) === H.ZOOM) {
+        const w = this.dollyToCursor ? (e.x - this._elementRect.x) / this._elementRect.width * 2 - 1 : 0, L = this.dollyToCursor ? (e.y - this._elementRect.y) / this._elementRect.height * -2 + 1 : 0, b = this.dollyDragInverted ? -1 : 1;
+        (this._state & H.DOLLY) === H.DOLLY ? (this._dollyInternal(b * y * rs, w, L), this._isUserControllingDolly = !0) : (this._zoomInternal(b * y * rs, w, L), this._isUserControllingZoom = !0);
       }
       if ((this._state & H.TOUCH_DOLLY) === H.TOUCH_DOLLY || (this._state & H.TOUCH_ZOOM) === H.TOUCH_ZOOM || (this._state & H.TOUCH_DOLLY_TRUCK) === H.TOUCH_DOLLY_TRUCK || (this._state & H.TOUCH_ZOOM_TRUCK) === H.TOUCH_ZOOM_TRUCK || (this._state & H.TOUCH_DOLLY_OFFSET) === H.TOUCH_DOLLY_OFFSET || (this._state & H.TOUCH_ZOOM_OFFSET) === H.TOUCH_ZOOM_OFFSET || (this._state & H.TOUCH_DOLLY_ROTATE) === H.TOUCH_DOLLY_ROTATE || (this._state & H.TOUCH_ZOOM_ROTATE) === H.TOUCH_ZOOM_ROTATE) {
-        const M = Yt.x - this._activePointers[1].clientX, L = Yt.y - this._activePointers[1].clientY, b = Math.sqrt(M * M + L * L), Y = n.y - b;
+        const w = Yt.x - this._activePointers[1].clientX, L = Yt.y - this._activePointers[1].clientY, b = Math.sqrt(w * w + L * L), Y = n.y - b;
         n.set(0, b);
-        const O = this.dollyToCursor ? (s.x - this._elementRect.x) / this._elementRect.width * 2 - 1 : 0, w = this.dollyToCursor ? (s.y - this._elementRect.y) / this._elementRect.height * -2 + 1 : 0;
-        (this._state & H.TOUCH_DOLLY) === H.TOUCH_DOLLY || (this._state & H.TOUCH_DOLLY_ROTATE) === H.TOUCH_DOLLY_ROTATE || (this._state & H.TOUCH_DOLLY_TRUCK) === H.TOUCH_DOLLY_TRUCK || (this._state & H.TOUCH_DOLLY_OFFSET) === H.TOUCH_DOLLY_OFFSET ? (this._dollyInternal(Y * rs, O, w), this._isUserControllingDolly = !0) : (this._zoomInternal(Y * rs, O, w), this._isUserControllingZoom = !0);
+        const N = this.dollyToCursor ? (s.x - this._elementRect.x) / this._elementRect.width * 2 - 1 : 0, M = this.dollyToCursor ? (s.y - this._elementRect.y) / this._elementRect.height * -2 + 1 : 0;
+        (this._state & H.TOUCH_DOLLY) === H.TOUCH_DOLLY || (this._state & H.TOUCH_DOLLY_ROTATE) === H.TOUCH_DOLLY_ROTATE || (this._state & H.TOUCH_DOLLY_TRUCK) === H.TOUCH_DOLLY_TRUCK || (this._state & H.TOUCH_DOLLY_OFFSET) === H.TOUCH_DOLLY_OFFSET ? (this._dollyInternal(Y * rs, N, M), this._isUserControllingDolly = !0) : (this._zoomInternal(Y * rs, N, M), this._isUserControllingZoom = !0);
       }
-      ((this._state & H.TRUCK) === H.TRUCK || (this._state & H.TOUCH_TRUCK) === H.TOUCH_TRUCK || (this._state & H.TOUCH_DOLLY_TRUCK) === H.TOUCH_DOLLY_TRUCK || (this._state & H.TOUCH_ZOOM_TRUCK) === H.TOUCH_ZOOM_TRUCK) && (this._truckInternal(N, y, !1), this._isUserControllingTruck = !0), ((this._state & H.OFFSET) === H.OFFSET || (this._state & H.TOUCH_OFFSET) === H.TOUCH_OFFSET || (this._state & H.TOUCH_DOLLY_OFFSET) === H.TOUCH_DOLLY_OFFSET || (this._state & H.TOUCH_ZOOM_OFFSET) === H.TOUCH_ZOOM_OFFSET) && (this._truckInternal(N, y, !0), this._isUserControllingOffset = !0), this.dispatchEvent({ type: "control" });
+      ((this._state & H.TRUCK) === H.TRUCK || (this._state & H.TOUCH_TRUCK) === H.TOUCH_TRUCK || (this._state & H.TOUCH_DOLLY_TRUCK) === H.TOUCH_DOLLY_TRUCK || (this._state & H.TOUCH_ZOOM_TRUCK) === H.TOUCH_ZOOM_TRUCK) && (this._truckInternal(O, y, !1), this._isUserControllingTruck = !0), ((this._state & H.OFFSET) === H.OFFSET || (this._state & H.TOUCH_OFFSET) === H.TOUCH_OFFSET || (this._state & H.TOUCH_DOLLY_OFFSET) === H.TOUCH_DOLLY_OFFSET || (this._state & H.TOUCH_ZOOM_OFFSET) === H.TOUCH_ZOOM_OFFSET) && (this._truckInternal(O, y, !0), this._isUserControllingOffset = !0), this.dispatchEvent({ type: "control" });
     }, p = () => {
       rn(this._activePointers, Yt), s.copy(Yt), this._dragNeedsUpdate = !1, (this._activePointers.length === 0 || this._activePointers.length === 1 && this._activePointers[0] === this._lockedPointer) && (this._isDragging = !1), this._activePointers.length === 0 && this._domElement && (this._domElement.ownerDocument.removeEventListener("pointermove", a, { passive: !1 }), this._domElement.ownerDocument.removeEventListener("mousemove", l), this._domElement.ownerDocument.removeEventListener("pointerup", h), this._domElement.ownerDocument.removeEventListener("mouseup", f), this.dispatchEvent({ type: "controlend" }));
     };
@@ -4492,8 +4492,8 @@ class vt extends ic {
     Si.setFromVector3(m.sub(p).applyQuaternion(this._yAxisUpSpace)), this._targetEnd.copy(E.lerp(p, u));
     const F = Si.theta - Xt.theta, R = Si.phi - Xt.phi, S = Si.radius - Xt.radius;
     this._sphericalEnd.set(Xt.radius + S * u, Xt.phi + R * u, Xt.theta + F * u), this.normalizeRotations(), this._needsUpdate = !0, d || (this._target.copy(this._targetEnd), this._spherical.copy(this._sphericalEnd));
-    const N = !d || pt(this._target.x, this._targetEnd.x, this.restThreshold) && pt(this._target.y, this._targetEnd.y, this.restThreshold) && pt(this._target.z, this._targetEnd.z, this.restThreshold) && pt(this._spherical.theta, this._sphericalEnd.theta, this.restThreshold) && pt(this._spherical.phi, this._sphericalEnd.phi, this.restThreshold) && pt(this._spherical.radius, this._sphericalEnd.radius, this.restThreshold);
-    return this._createOnRestPromise(N);
+    const O = !d || pt(this._target.x, this._targetEnd.x, this.restThreshold) && pt(this._target.y, this._targetEnd.y, this.restThreshold) && pt(this._target.z, this._targetEnd.z, this.restThreshold) && pt(this._spherical.theta, this._sphericalEnd.theta, this.restThreshold) && pt(this._spherical.phi, this._sphericalEnd.phi, this.restThreshold) && pt(this._spherical.radius, this._sphericalEnd.radius, this.restThreshold);
+    return this._createOnRestPromise(O);
   }
   /**
    * Set angle and distance by given position.
@@ -4736,18 +4736,18 @@ class vt extends ic {
       if (ve(this._camera) && this._changedDolly !== 0) {
         const f = this._spherical.radius - this._lastDistance, I = this._camera, u = this._getCameraDirection(Fi), d = ut.copy(u).cross(I.up).normalize();
         d.lengthSq() === 0 && (d.x = 1);
-        const E = Et.crossVectors(d, u), T = this._sphericalEnd.radius * Math.tan(I.getEffectiveFOV() * Ri * 0.5), m = (this._sphericalEnd.radius - f - this._sphericalEnd.radius) / this._sphericalEnd.radius, F = ti.copy(this._targetEnd).add(d.multiplyScalar(this._dollyControlCoord.x * T * I.aspect)).add(E.multiplyScalar(this._dollyControlCoord.y * T)), R = ut.copy(this._targetEnd).lerp(F, m), S = this._lastDollyDirection === Ke.IN && this._spherical.radius <= this.minDistance, N = this._lastDollyDirection === Ke.OUT && this.maxDistance <= this._spherical.radius;
-        if (this.infinityDolly && (S || N)) {
+        const E = Et.crossVectors(d, u), T = this._sphericalEnd.radius * Math.tan(I.getEffectiveFOV() * Ri * 0.5), m = (this._sphericalEnd.radius - f - this._sphericalEnd.radius) / this._sphericalEnd.radius, F = ti.copy(this._targetEnd).add(d.multiplyScalar(this._dollyControlCoord.x * T * I.aspect)).add(E.multiplyScalar(this._dollyControlCoord.y * T)), R = ut.copy(this._targetEnd).lerp(F, m), S = this._lastDollyDirection === Ke.IN && this._spherical.radius <= this.minDistance, O = this._lastDollyDirection === Ke.OUT && this.maxDistance <= this._spherical.radius;
+        if (this.infinityDolly && (S || O)) {
           this._sphericalEnd.radius -= f, this._spherical.radius -= f;
-          const M = Et.copy(u).multiplyScalar(-f);
-          R.add(M);
+          const w = Et.copy(u).multiplyScalar(-f);
+          R.add(w);
         }
         this._boundary.clampPoint(R, R);
         const y = Et.subVectors(R, this._targetEnd);
         this._targetEnd.copy(R), this._target.add(y), this._changedDolly -= f, gt(this._changedDolly) && (this._changedDolly = 0);
       } else if (Oe(this._camera) && this._changedZoom !== 0) {
-        const f = this._zoom - this._lastZoom, I = this._camera, u = ut.set(this._dollyControlCoord.x, this._dollyControlCoord.y, (I.near + I.far) / (I.near - I.far)).unproject(I), d = Et.set(0, 0, -1).applyQuaternion(I.quaternion), E = ti.copy(u).add(d.multiplyScalar(-u.dot(I.up))), p = -(this._zoom - f - this._zoom) / this._zoom, m = this._getCameraDirection(Fi), F = this._targetEnd.dot(m), R = ut.copy(this._targetEnd).lerp(E, p), S = R.dot(m), N = m.multiplyScalar(S - F);
-        R.sub(N), this._boundary.clampPoint(R, R);
+        const f = this._zoom - this._lastZoom, I = this._camera, u = ut.set(this._dollyControlCoord.x, this._dollyControlCoord.y, (I.near + I.far) / (I.near - I.far)).unproject(I), d = Et.set(0, 0, -1).applyQuaternion(I.quaternion), E = ti.copy(u).add(d.multiplyScalar(-u.dot(I.up))), p = -(this._zoom - f - this._zoom) / this._zoom, m = this._getCameraDirection(Fi), F = this._targetEnd.dot(m), R = ut.copy(this._targetEnd).lerp(E, p), S = R.dot(m), O = m.multiplyScalar(S - F);
+        R.sub(O), this._boundary.clampPoint(R, R);
         const y = Et.subVectors(R, this._targetEnd);
         this._targetEnd.copy(R), this._target.add(y), this._changedZoom -= f, gt(this._changedZoom) && (this._changedZoom = 0);
       }
@@ -6674,7 +6674,7 @@ class Ac extends In {
       XZ: [
         [new rt(new Ut(0.15, 0.15, 0.01), l.clone()), [0.15, 0, 0.15], [-Math.PI / 2, 0, 0]]
       ]
-    }, N = {
+    }, O = {
       X: [
         [new rt(new Vt(0.2, 0, 0.6, 4), e), [0.3, 0, 0], [0, 0, -Math.PI / 2]],
         [new rt(new Vt(0.2, 0, 0.6, 4), e), [-0.3, 0, 0], [0, 0, Math.PI / 2]]
@@ -6718,7 +6718,7 @@ class Ac extends In {
       Z: [
         [new Ae(p, s.clone()), [0, 0, -1e3], [0, -Math.PI / 2, 0], [1e6, 1, 1], "helper"]
       ]
-    }, M = {
+    }, w = {
       XYZE: [
         [new rt(F(0.5, 1), d), null, [0, Math.PI / 2, 0]]
       ],
@@ -6782,7 +6782,7 @@ class Ac extends In {
       XYZ: [
         [new rt(new Ut(0.1, 0.1, 0.1), f.clone())]
       ]
-    }, O = {
+    }, N = {
       X: [
         [new rt(new Vt(0.2, 0, 0.6, 4), e), [0.3, 0, 0], [0, 0, -Math.PI / 2]],
         [new rt(new Vt(0.2, 0, 0.6, 4), e), [-0.3, 0, 0], [0, 0, Math.PI / 2]]
@@ -6807,7 +6807,7 @@ class Ac extends In {
       XYZ: [
         [new rt(new Ut(0.2, 0.2, 0.2), e), [0, 0, 0]]
       ]
-    }, w = {
+    }, M = {
       X: [
         [new Ae(p, s.clone()), [-1e3, 0, 0], null, [1e6, 1, 1], "helper"]
       ],
@@ -6829,7 +6829,7 @@ class Ac extends In {
         }
       return q;
     }
-    this.gizmo = {}, this.picker = {}, this.helper = {}, this.add(this.gizmo.translate = g(S)), this.add(this.gizmo.rotate = g(M)), this.add(this.gizmo.scale = g(Y)), this.add(this.picker.translate = g(N)), this.add(this.picker.rotate = g(b)), this.add(this.picker.scale = g(O)), this.add(this.helper.translate = g(y)), this.add(this.helper.rotate = g(L)), this.add(this.helper.scale = g(w)), this.picker.translate.visible = !1, this.picker.rotate.visible = !1, this.picker.scale.visible = !1;
+    this.gizmo = {}, this.picker = {}, this.helper = {}, this.add(this.gizmo.translate = g(S)), this.add(this.gizmo.rotate = g(w)), this.add(this.gizmo.scale = g(Y)), this.add(this.picker.translate = g(O)), this.add(this.picker.rotate = g(b)), this.add(this.picker.scale = g(N)), this.add(this.helper.translate = g(y)), this.add(this.helper.rotate = g(L)), this.add(this.helper.scale = g(M)), this.picker.translate.visible = !1, this.picker.rotate.visible = !1, this.picker.scale.visible = !1;
   }
   // updateMatrixWorld will update transformations and appearance of individual handles
   updateMatrixWorld(i) {
@@ -10967,10 +10967,10 @@ const bi = class bi extends At {
     for (let r = 0; r < s; r++) {
       const o = t.geometries.get(r), { x: a, y: l, z: h, w: f } = o.color, I = f !== 1, { geometryExpressID: u } = o, d = `${u}-${I}`;
       if (!this._visitedFragments.has(d)) {
-        const S = this.getGeometry(this.webIfc, u), N = I ? this._materialT : this._material, y = new Qt.Fragment(S, N, 1);
+        const S = this.getGeometry(this.webIfc, u), O = I ? this._materialT : this._material, y = new Qt.Fragment(S, O, 1);
         e.add(y.mesh), e.items.push(y);
-        const M = this._visitedFragments.size;
-        this._visitedFragments.set(d, { index: M, fragment: y });
+        const w = this._visitedFragments.size;
+        this._visitedFragments.set(d, { index: w, fragment: y });
       }
       const E = new D.Color().setRGB(a, l, h, "srgb"), T = new D.Matrix4();
       T.fromArray(o.flatTransformation);
@@ -12330,20 +12330,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return T;
       }
       function r(u, d, E, T, p, m) {
-        var F, R, S = u.file, N = u.compression, y = m !== l.utf8encode, M = o.transformTo("string", m(S.name)), L = o.transformTo("string", l.utf8encode(S.name)), b = S.comment, Y = o.transformTo("string", m(b)), O = o.transformTo("string", l.utf8encode(b)), w = L.length !== S.name.length, g = O.length !== b.length, v = "", q = "", G = "", et = S.dir, W = S.date, nt = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+        var F, R, S = u.file, O = u.compression, y = m !== l.utf8encode, w = o.transformTo("string", m(S.name)), L = o.transformTo("string", l.utf8encode(S.name)), b = S.comment, Y = o.transformTo("string", m(b)), N = o.transformTo("string", l.utf8encode(b)), M = L.length !== S.name.length, g = N.length !== b.length, v = "", q = "", G = "", et = S.dir, W = S.date, nt = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
         d && !E || (nt.crc32 = u.crc32, nt.compressedSize = u.compressedSize, nt.uncompressedSize = u.uncompressedSize);
         var V = 0;
-        d && (V |= 8), y || !w && !g || (V |= 2048);
+        d && (V |= 8), y || !M && !g || (V |= 2048);
         var x = 0, ot = 0;
         et && (x |= 16), p === "UNIX" ? (ot = 798, x |= function(tt, St) {
           var yt = tt;
           return tt || (yt = St ? 16893 : 33204), (65535 & yt) << 16;
         }(S.unixPermissions, et)) : (ot = 20, x |= function(tt) {
           return 63 & (tt || 0);
-        }(S.dosPermissions)), F = W.getUTCHours(), F <<= 6, F |= W.getUTCMinutes(), F <<= 5, F |= W.getUTCSeconds() / 2, R = W.getUTCFullYear() - 1980, R <<= 4, R |= W.getUTCMonth() + 1, R <<= 5, R |= W.getUTCDate(), w && (q = n(1, 1) + n(h(M), 4) + L, v += "up" + n(q.length, 2) + q), g && (G = n(1, 1) + n(h(Y), 4) + O, v += "uc" + n(G.length, 2) + G);
+        }(S.dosPermissions)), F = W.getUTCHours(), F <<= 6, F |= W.getUTCMinutes(), F <<= 5, F |= W.getUTCSeconds() / 2, R = W.getUTCFullYear() - 1980, R <<= 4, R |= W.getUTCMonth() + 1, R <<= 5, R |= W.getUTCDate(), M && (q = n(1, 1) + n(h(w), 4) + L, v += "up" + n(q.length, 2) + q), g && (G = n(1, 1) + n(h(Y), 4) + N, v += "uc" + n(G.length, 2) + G);
         var it = "";
         return it += `
-\0`, it += n(V, 2), it += N.magic, it += n(F, 2), it += n(R, 2), it += n(nt.crc32, 4), it += n(nt.compressedSize, 4), it += n(nt.uncompressedSize, 4), it += n(M.length, 2), it += n(v.length, 2), { fileRecord: f.LOCAL_FILE_HEADER + it + M + v, dirRecord: f.CENTRAL_FILE_HEADER + n(ot, 2) + it + n(Y.length, 2) + "\0\0\0\0" + n(x, 4) + n(T, 4) + M + v + Y };
+\0`, it += n(V, 2), it += O.magic, it += n(F, 2), it += n(R, 2), it += n(nt.crc32, 4), it += n(nt.compressedSize, 4), it += n(nt.uncompressedSize, 4), it += n(w.length, 2), it += n(v.length, 2), { fileRecord: f.LOCAL_FILE_HEADER + it + w + v, dirRecord: f.CENTRAL_FILE_HEADER + n(ot, 2) + it + n(Y.length, 2) + "\0\0\0\0" + n(x, 4) + n(T, 4) + w + v + Y };
       }
       var o = t("../utils"), a = t("../stream/GenericWorker"), l = t("../utf8"), h = t("../crc32"), f = t("../signature");
       function I(u, d, E, T) {
@@ -12375,8 +12375,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         for (var u = this.bytesWritten, d = 0; d < this.dirRecords.length; d++)
           this.push({ data: this.dirRecords[d], meta: { percent: 100 } });
         var E = this.bytesWritten - u, T = function(p, m, F, R, S) {
-          var N = o.transformTo("string", S(R));
-          return f.CENTRAL_DIRECTORY_END + "\0\0\0\0" + n(p, 2) + n(p, 2) + n(m, 4) + n(F, 4) + n(N.length, 2) + N;
+          var O = o.transformTo("string", S(R));
+          return f.CENTRAL_DIRECTORY_END + "\0\0\0\0" + n(p, 2) + n(p, 2) + n(m, 4) + n(F, 4) + n(O.length, 2) + O;
         }(this.dirRecords.length, E, u, this.zipComment, this.encodeFileName);
         this.push({ data: T, meta: { percent: 100 } });
       }, I.prototype.prepareNextSource = function() {
@@ -12528,24 +12528,24 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return n && typeof n.on == "function" && typeof n.pause == "function" && typeof n.resume == "function";
       } };
     }, {}], 15: [function(t, e, s) {
-      function n(S, N, y) {
-        var M, L = o.getTypeOf(N), b = o.extend(y || {}, h);
-        b.date = b.date || /* @__PURE__ */ new Date(), b.compression !== null && (b.compression = b.compression.toUpperCase()), typeof b.unixPermissions == "string" && (b.unixPermissions = parseInt(b.unixPermissions, 8)), b.unixPermissions && 16384 & b.unixPermissions && (b.dir = !0), b.dosPermissions && 16 & b.dosPermissions && (b.dir = !0), b.dir && (S = p(S)), b.createFolders && (M = T(S)) && m.call(this, M, !0);
+      function n(S, O, y) {
+        var w, L = o.getTypeOf(O), b = o.extend(y || {}, h);
+        b.date = b.date || /* @__PURE__ */ new Date(), b.compression !== null && (b.compression = b.compression.toUpperCase()), typeof b.unixPermissions == "string" && (b.unixPermissions = parseInt(b.unixPermissions, 8)), b.unixPermissions && 16384 & b.unixPermissions && (b.dir = !0), b.dosPermissions && 16 & b.dosPermissions && (b.dir = !0), b.dir && (S = p(S)), b.createFolders && (w = T(S)) && m.call(this, w, !0);
         var Y = L === "string" && b.binary === !1 && b.base64 === !1;
-        y && y.binary !== void 0 || (b.binary = !Y), (N instanceof f && N.uncompressedSize === 0 || b.dir || !N || N.length === 0) && (b.base64 = !1, b.binary = !0, N = "", b.compression = "STORE", L = "string");
-        var O = null;
-        O = N instanceof f || N instanceof a ? N : d.isNode && d.isStream(N) ? new E(S, N) : o.prepareContent(S, N, b.binary, b.optimizedBinaryString, b.base64);
-        var w = new I(S, O, b);
-        this.files[S] = w;
+        y && y.binary !== void 0 || (b.binary = !Y), (O instanceof f && O.uncompressedSize === 0 || b.dir || !O || O.length === 0) && (b.base64 = !1, b.binary = !0, O = "", b.compression = "STORE", L = "string");
+        var N = null;
+        N = O instanceof f || O instanceof a ? O : d.isNode && d.isStream(O) ? new E(S, O) : o.prepareContent(S, O, b.binary, b.optimizedBinaryString, b.base64);
+        var M = new I(S, N, b);
+        this.files[S] = M;
       }
       var r = t("./utf8"), o = t("./utils"), a = t("./stream/GenericWorker"), l = t("./stream/StreamHelper"), h = t("./defaults"), f = t("./compressedObject"), I = t("./zipObject"), u = t("./generate"), d = t("./nodejsUtils"), E = t("./nodejs/NodejsStreamInputAdapter"), T = function(S) {
         S.slice(-1) === "/" && (S = S.substring(0, S.length - 1));
-        var N = S.lastIndexOf("/");
-        return 0 < N ? S.substring(0, N) : "";
+        var O = S.lastIndexOf("/");
+        return 0 < O ? S.substring(0, O) : "";
       }, p = function(S) {
         return S.slice(-1) !== "/" && (S += "/"), S;
-      }, m = function(S, N) {
-        return N = N !== void 0 ? N : h.createFolders, S = p(S), this.files[S] || n.call(this, S, null, { dir: !0, createFolders: N }), this.files[S];
+      }, m = function(S, O) {
+        return O = O !== void 0 ? O : h.createFolders, S = p(S), this.files[S] || n.call(this, S, null, { dir: !0, createFolders: O }), this.files[S];
       };
       function F(S) {
         return Object.prototype.toString.call(S) === "[object RegExp]";
@@ -12553,21 +12553,21 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       var R = { load: function() {
         throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
       }, forEach: function(S) {
-        var N, y, M;
-        for (N in this.files)
-          M = this.files[N], (y = N.slice(this.root.length, N.length)) && N.slice(0, this.root.length) === this.root && S(y, M);
+        var O, y, w;
+        for (O in this.files)
+          w = this.files[O], (y = O.slice(this.root.length, O.length)) && O.slice(0, this.root.length) === this.root && S(y, w);
       }, filter: function(S) {
-        var N = [];
-        return this.forEach(function(y, M) {
-          S(y, M) && N.push(M);
-        }), N;
-      }, file: function(S, N, y) {
+        var O = [];
+        return this.forEach(function(y, w) {
+          S(y, w) && O.push(w);
+        }), O;
+      }, file: function(S, O, y) {
         if (arguments.length !== 1)
-          return S = this.root + S, n.call(this, S, N, y), this;
+          return S = this.root + S, n.call(this, S, O, y), this;
         if (F(S)) {
-          var M = S;
+          var w = S;
           return this.filter(function(b, Y) {
-            return !Y.dir && M.test(b);
+            return !Y.dir && w.test(b);
           });
         }
         var L = this.files[this.root + S];
@@ -12579,37 +12579,37 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           return this.filter(function(L, b) {
             return b.dir && S.test(L);
           });
-        var N = this.root + S, y = m.call(this, N), M = this.clone();
-        return M.root = y.name, M;
+        var O = this.root + S, y = m.call(this, O), w = this.clone();
+        return w.root = y.name, w;
       }, remove: function(S) {
         S = this.root + S;
-        var N = this.files[S];
-        if (N || (S.slice(-1) !== "/" && (S += "/"), N = this.files[S]), N && !N.dir)
+        var O = this.files[S];
+        if (O || (S.slice(-1) !== "/" && (S += "/"), O = this.files[S]), O && !O.dir)
           delete this.files[S];
         else
           for (var y = this.filter(function(L, b) {
             return b.name.slice(0, S.length) === S;
-          }), M = 0; M < y.length; M++)
-            delete this.files[y[M].name];
+          }), w = 0; w < y.length; w++)
+            delete this.files[y[w].name];
         return this;
       }, generate: function() {
         throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
       }, generateInternalStream: function(S) {
-        var N, y = {};
+        var O, y = {};
         try {
           if ((y = o.extend(S || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: r.utf8encode })).type = y.type.toLowerCase(), y.compression = y.compression.toUpperCase(), y.type === "binarystring" && (y.type = "string"), !y.type)
             throw new Error("No output type specified.");
           o.checkSupport(y.type), y.platform !== "darwin" && y.platform !== "freebsd" && y.platform !== "linux" && y.platform !== "sunos" || (y.platform = "UNIX"), y.platform === "win32" && (y.platform = "DOS");
-          var M = y.comment || this.comment || "";
-          N = u.generateWorker(this, y, M);
+          var w = y.comment || this.comment || "";
+          O = u.generateWorker(this, y, w);
         } catch (L) {
-          (N = new a("error")).error(L);
+          (O = new a("error")).error(L);
         }
-        return new l(N, y.type || "string", y.mimeType);
-      }, generateAsync: function(S, N) {
-        return this.generateInternalStream(S).accumulate(N);
-      }, generateNodeStream: function(S, N) {
-        return (S = S || {}).type || (S.type = "nodebuffer"), this.generateInternalStream(S).toNodejsStream(N);
+        return new l(O, y.type || "string", y.mimeType);
+      }, generateAsync: function(S, O) {
+        return this.generateInternalStream(S).accumulate(O);
+      }, generateNodeStream: function(S, O) {
+        return (S = S || {}).type || (S.type = "nodebuffer"), this.generateInternalStream(S).toNodejsStream(O);
       } };
       e.exports = R;
     }, { "./compressedObject": 2, "./defaults": 5, "./generate": 9, "./nodejs/NodejsStreamInputAdapter": 12, "./nodejsUtils": 14, "./stream/GenericWorker": 28, "./stream/StreamHelper": 29, "./utf8": 31, "./utils": 32, "./zipObject": 35 }], 16: [function(t, e, s) {
@@ -12848,41 +12848,41 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function I(d, E) {
         return new h.Promise(function(T, p) {
           var m = [], F = d._internalType, R = d._outputType, S = d._mimeType;
-          d.on("data", function(N, y) {
-            m.push(N), E && E(y);
-          }).on("error", function(N) {
-            m = [], p(N);
+          d.on("data", function(O, y) {
+            m.push(O), E && E(y);
+          }).on("error", function(O) {
+            m = [], p(O);
           }).on("end", function() {
             try {
-              var N = function(y, M, L) {
+              var O = function(y, w, L) {
                 switch (y) {
                   case "blob":
-                    return n.newBlob(n.transformTo("arraybuffer", M), L);
+                    return n.newBlob(n.transformTo("arraybuffer", w), L);
                   case "base64":
-                    return a.encode(M);
+                    return a.encode(w);
                   default:
-                    return n.transformTo(y, M);
+                    return n.transformTo(y, w);
                 }
-              }(R, function(y, M) {
-                var L, b = 0, Y = null, O = 0;
-                for (L = 0; L < M.length; L++)
-                  O += M[L].length;
+              }(R, function(y, w) {
+                var L, b = 0, Y = null, N = 0;
+                for (L = 0; L < w.length; L++)
+                  N += w[L].length;
                 switch (y) {
                   case "string":
-                    return M.join("");
+                    return w.join("");
                   case "array":
-                    return Array.prototype.concat.apply([], M);
+                    return Array.prototype.concat.apply([], w);
                   case "uint8array":
-                    for (Y = new Uint8Array(O), L = 0; L < M.length; L++)
-                      Y.set(M[L], b), b += M[L].length;
+                    for (Y = new Uint8Array(N), L = 0; L < w.length; L++)
+                      Y.set(w[L], b), b += w[L].length;
                     return Y;
                   case "nodebuffer":
-                    return Buffer.concat(M);
+                    return Buffer.concat(w);
                   default:
                     throw new Error("concat : unsupported type '" + y + "'");
                 }
               }(F, m), S);
-              T(N);
+              T(O);
             } catch (y) {
               p(y);
             }
@@ -13138,18 +13138,18 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return p;
       }, s.prepareContent = function(E, T, p, m, F) {
         return a.Promise.resolve(T).then(function(R) {
-          return n.blob && (R instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(R)) !== -1) && typeof FileReader < "u" ? new a.Promise(function(S, N) {
+          return n.blob && (R instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(R)) !== -1) && typeof FileReader < "u" ? new a.Promise(function(S, O) {
             var y = new FileReader();
-            y.onload = function(M) {
-              S(M.target.result);
-            }, y.onerror = function(M) {
-              N(M.target.error);
+            y.onload = function(w) {
+              S(w.target.result);
+            }, y.onerror = function(w) {
+              O(w.target.error);
             }, y.readAsArrayBuffer(R);
           }) : R;
         }).then(function(R) {
           var S = s.getTypeOf(R);
-          return S ? (S === "arraybuffer" ? R = s.transformTo("uint8array", R) : S === "string" && (F ? R = r.decode(R) : p && m !== !0 && (R = function(N) {
-            return h(N, n.uint8array ? new Uint8Array(N.length) : new Array(N.length));
+          return S ? (S === "arraybuffer" ? R = s.transformTo("uint8array", R) : S === "string" && (F ? R = r.decode(R) : p && m !== !0 && (R = function(O) {
+            return h(O, n.uint8array ? new Uint8Array(O.length) : new Array(O.length));
           }(R))), R) : a.Promise.reject(new Error("Can't read the data of '" + E + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
         });
       };
@@ -13403,10 +13403,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         function S(y) {
           F || (F = !0, o.resolve(p, y));
         }
-        var N = T(function() {
+        var O = T(function() {
           m(S, R);
         });
-        N.status === "error" && R(N.value);
+        O.status === "error" && R(O.value);
       }
       function T(p, m) {
         var F = {};
@@ -13454,7 +13454,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           E(p, R);
         else {
           p.state = l, p.outcome = m;
-          for (var S = -1, N = p.queue.length; ++S < N; )
+          for (var S = -1, O = p.queue.length; ++S < O; )
             p.queue[S].callFulfilled(m);
         }
         return p;
@@ -13475,14 +13475,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         var F = p.length, R = !1;
         if (!F)
           return this.resolve([]);
-        for (var S = new Array(F), N = 0, y = -1, M = new this(r); ++y < F; )
+        for (var S = new Array(F), O = 0, y = -1, w = new this(r); ++y < F; )
           L(p[y], y);
-        return M;
+        return w;
         function L(b, Y) {
-          m.resolve(b).then(function(O) {
-            S[Y] = O, ++N !== F || R || (R = !0, o.resolve(M, S));
-          }, function(O) {
-            R || (R = !0, o.reject(M, O));
+          m.resolve(b).then(function(N) {
+            S[Y] = N, ++O !== F || R || (R = !0, o.resolve(w, S));
+          }, function(N) {
+            R || (R = !0, o.reject(w, N));
           });
         }
       }, f.race = function(p) {
@@ -13492,14 +13492,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         var F = p.length, R = !1;
         if (!F)
           return this.resolve([]);
-        for (var S = -1, N = new this(r); ++S < F; )
-          y = p[S], m.resolve(y).then(function(M) {
-            R || (R = !0, o.resolve(N, M));
-          }, function(M) {
-            R || (R = !0, o.reject(N, M));
+        for (var S = -1, O = new this(r); ++S < F; )
+          y = p[S], m.resolve(y).then(function(w) {
+            R || (R = !0, o.resolve(O, w));
+          }, function(w) {
+            R || (R = !0, o.reject(O, w));
           });
         var y;
-        return N;
+        return O;
       };
     }, { immediate: 36 }], 38: [function(t, e, s) {
       var n = {};
@@ -13529,12 +13529,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return F.result;
       }
       E.prototype.push = function(p, m) {
-        var F, R, S = this.strm, N = this.options.chunkSize;
+        var F, R, S = this.strm, O = this.options.chunkSize;
         if (this.ended)
           return !1;
         R = m === ~~m ? m : m === !0 ? 4 : 0, typeof p == "string" ? S.input = o.string2buf(p) : h.call(p) === "[object ArrayBuffer]" ? S.input = new Uint8Array(p) : S.input = p, S.next_in = 0, S.avail_in = S.input.length;
         do {
-          if (S.avail_out === 0 && (S.output = new r.Buf8(N), S.next_out = 0, S.avail_out = N), (F = n.deflate(S, R)) !== 1 && F !== f)
+          if (S.avail_out === 0 && (S.output = new r.Buf8(O), S.next_out = 0, S.avail_out = O), (F = n.deflate(S, R)) !== 1 && F !== f)
             return this.onEnd(F), !(this.ended = !0);
           S.avail_out !== 0 && (S.avail_in !== 0 || R !== 4 && R !== 2) || (this.options.to === "string" ? this.onData(o.buf2binstring(r.shrinkBuf(S.output, S.next_out))) : this.onData(r.shrinkBuf(S.output, S.next_out)));
         } while ((0 < S.avail_in || S.avail_out === 0) && F !== 1);
@@ -13568,14 +13568,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return p.result;
       }
       u.prototype.push = function(E, T) {
-        var p, m, F, R, S, N, y = this.strm, M = this.options.chunkSize, L = this.options.dictionary, b = !1;
+        var p, m, F, R, S, O, y = this.strm, w = this.options.chunkSize, L = this.options.dictionary, b = !1;
         if (this.ended)
           return !1;
         m = T === ~~T ? T : T === !0 ? a.Z_FINISH : a.Z_NO_FLUSH, typeof E == "string" ? y.input = o.binstring2buf(E) : I.call(E) === "[object ArrayBuffer]" ? y.input = new Uint8Array(E) : y.input = E, y.next_in = 0, y.avail_in = y.input.length;
         do {
-          if (y.avail_out === 0 && (y.output = new r.Buf8(M), y.next_out = 0, y.avail_out = M), (p = n.inflate(y, a.Z_NO_FLUSH)) === a.Z_NEED_DICT && L && (N = typeof L == "string" ? o.string2buf(L) : I.call(L) === "[object ArrayBuffer]" ? new Uint8Array(L) : L, p = n.inflateSetDictionary(this.strm, N)), p === a.Z_BUF_ERROR && b === !0 && (p = a.Z_OK, b = !1), p !== a.Z_STREAM_END && p !== a.Z_OK)
+          if (y.avail_out === 0 && (y.output = new r.Buf8(w), y.next_out = 0, y.avail_out = w), (p = n.inflate(y, a.Z_NO_FLUSH)) === a.Z_NEED_DICT && L && (O = typeof L == "string" ? o.string2buf(L) : I.call(L) === "[object ArrayBuffer]" ? new Uint8Array(L) : L, p = n.inflateSetDictionary(this.strm, O)), p === a.Z_BUF_ERROR && b === !0 && (p = a.Z_OK, b = !1), p !== a.Z_STREAM_END && p !== a.Z_OK)
             return this.onEnd(p), !(this.ended = !0);
-          y.next_out && (y.avail_out !== 0 && p !== a.Z_STREAM_END && (y.avail_in !== 0 || m !== a.Z_FINISH && m !== a.Z_SYNC_FLUSH) || (this.options.to === "string" ? (F = o.utf8border(y.output, y.next_out), R = y.next_out - F, S = o.buf2string(y.output, F), y.next_out = R, y.avail_out = M - R, R && r.arraySet(y.output, y.output, F, R, 0), this.onData(S)) : this.onData(r.shrinkBuf(y.output, y.next_out)))), y.avail_in === 0 && y.avail_out === 0 && (b = !0);
+          y.next_out && (y.avail_out !== 0 && p !== a.Z_STREAM_END && (y.avail_in !== 0 || m !== a.Z_FINISH && m !== a.Z_SYNC_FLUSH) || (this.options.to === "string" ? (F = o.utf8border(y.output, y.next_out), R = y.next_out - F, S = o.buf2string(y.output, F), y.next_out = R, y.avail_out = w - R, R && r.arraySet(y.output, y.output, F, R, 0), this.onData(S)) : this.onData(r.shrinkBuf(y.output, y.next_out)))), y.avail_in === 0 && y.avail_out === 0 && (b = !0);
         } while ((0 < y.avail_in || y.avail_out === 0) && p !== a.Z_STREAM_END);
         return p === a.Z_STREAM_END && (m = a.Z_FINISH), m === a.Z_FINISH ? (p = n.inflateEnd(this.strm), this.onEnd(p), this.ended = !0, p === a.Z_OK) : m !== a.Z_SYNC_FLUSH || (this.onEnd(a.Z_OK), !(y.avail_out = 0));
       }, u.prototype.onData = function(E) {
@@ -13705,7 +13705,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return -1 ^ r;
       };
     }, {}], 46: [function(t, e, s) {
-      var n, r = t("../utils/common"), o = t("./trees"), a = t("./adler32"), l = t("./crc32"), h = t("./messages"), f = 0, I = 4, u = 0, d = -2, E = -1, T = 4, p = 2, m = 8, F = 9, R = 286, S = 30, N = 19, y = 2 * R + 1, M = 15, L = 3, b = 258, Y = b + L + 1, O = 42, w = 113, g = 1, v = 2, q = 3, G = 4;
+      var n, r = t("../utils/common"), o = t("./trees"), a = t("./adler32"), l = t("./crc32"), h = t("./messages"), f = 0, I = 4, u = 0, d = -2, E = -1, T = 4, p = 2, m = 8, F = 9, R = 286, S = 30, O = 19, y = 2 * R + 1, w = 15, L = 3, b = 258, Y = b + L + 1, N = 42, M = 113, g = 1, v = 2, q = 3, G = 4;
       function et(A, X) {
         return A.msg = h[X], X;
       }
@@ -13811,11 +13811,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         this.good_length = A, this.max_lazy = X, this.nice_length = k, this.max_chain = P, this.func = _;
       }
       function ft() {
-        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 = m, 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 * y), this.dyn_dtree = new r.Buf16(2 * (2 * S + 1)), this.bl_tree = new r.Buf16(2 * (2 * N + 1)), nt(this.dyn_ltree), nt(this.dyn_dtree), nt(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new r.Buf16(M + 1), this.heap = new r.Buf16(2 * R + 1), nt(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new r.Buf16(2 * R + 1), nt(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;
+        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 = m, 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 * y), this.dyn_dtree = new r.Buf16(2 * (2 * S + 1)), this.bl_tree = new r.Buf16(2 * (2 * O + 1)), nt(this.dyn_ltree), nt(this.dyn_dtree), nt(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new r.Buf16(w + 1), this.heap = new r.Buf16(2 * R + 1), nt(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new r.Buf16(2 * R + 1), nt(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;
       }
       function Ct(A) {
         var X;
-        return A && A.state ? (A.total_in = A.total_out = 0, A.data_type = p, (X = A.state).pending = 0, X.pending_out = 0, X.wrap < 0 && (X.wrap = -X.wrap), X.status = X.wrap ? O : w, A.adler = X.wrap === 2 ? 0 : 1, X.last_flush = f, o._tr_init(X), u) : et(A, d);
+        return A && A.state ? (A.total_in = A.total_out = 0, A.data_type = p, (X = A.state).pending = 0, X.pending_out = 0, X.wrap < 0 && (X.wrap = -X.wrap), X.status = X.wrap ? N : M, A.adler = X.wrap === 2 ? 0 : 1, X.last_flush = f, o._tr_init(X), u) : et(A, d);
       }
       function Ht(A) {
         var X = Ct(A);
@@ -13858,12 +13858,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           return A ? et(A, d) : d;
         if (P = A.state, !A.output || !A.input && A.avail_in !== 0 || P.status === 666 && X !== I)
           return et(A, A.avail_out === 0 ? -5 : d);
-        if (P.strm = A, k = P.last_flush, P.last_flush = X, P.status === O)
+        if (P.strm = A, k = P.last_flush, P.last_flush = X, P.status === N)
           if (P.wrap === 2)
-            A.adler = 0, ot(P, 31), ot(P, 139), ot(P, 8), P.gzhead ? (ot(P, (P.gzhead.text ? 1 : 0) + (P.gzhead.hcrc ? 2 : 0) + (P.gzhead.extra ? 4 : 0) + (P.gzhead.name ? 8 : 0) + (P.gzhead.comment ? 16 : 0)), ot(P, 255 & P.gzhead.time), ot(P, P.gzhead.time >> 8 & 255), ot(P, P.gzhead.time >> 16 & 255), ot(P, P.gzhead.time >> 24 & 255), ot(P, P.level === 9 ? 2 : 2 <= P.strategy || P.level < 2 ? 4 : 0), ot(P, 255 & P.gzhead.os), P.gzhead.extra && P.gzhead.extra.length && (ot(P, 255 & P.gzhead.extra.length), ot(P, P.gzhead.extra.length >> 8 & 255)), P.gzhead.hcrc && (A.adler = l(A.adler, P.pending_buf, P.pending, 0)), P.gzindex = 0, P.status = 69) : (ot(P, 0), ot(P, 0), ot(P, 0), ot(P, 0), ot(P, 0), ot(P, P.level === 9 ? 2 : 2 <= P.strategy || P.level < 2 ? 4 : 0), ot(P, 3), P.status = w);
+            A.adler = 0, ot(P, 31), ot(P, 139), ot(P, 8), P.gzhead ? (ot(P, (P.gzhead.text ? 1 : 0) + (P.gzhead.hcrc ? 2 : 0) + (P.gzhead.extra ? 4 : 0) + (P.gzhead.name ? 8 : 0) + (P.gzhead.comment ? 16 : 0)), ot(P, 255 & P.gzhead.time), ot(P, P.gzhead.time >> 8 & 255), ot(P, P.gzhead.time >> 16 & 255), ot(P, P.gzhead.time >> 24 & 255), ot(P, P.level === 9 ? 2 : 2 <= P.strategy || P.level < 2 ? 4 : 0), ot(P, 255 & P.gzhead.os), P.gzhead.extra && P.gzhead.extra.length && (ot(P, 255 & P.gzhead.extra.length), ot(P, P.gzhead.extra.length >> 8 & 255)), P.gzhead.hcrc && (A.adler = l(A.adler, P.pending_buf, P.pending, 0)), P.gzindex = 0, P.status = 69) : (ot(P, 0), ot(P, 0), ot(P, 0), ot(P, 0), ot(P, 0), ot(P, P.level === 9 ? 2 : 2 <= P.strategy || P.level < 2 ? 4 : 0), ot(P, 3), P.status = M);
           else {
             var $ = m + (P.w_bits - 8 << 4) << 8;
-            $ |= (2 <= P.strategy || P.level < 2 ? 0 : P.level < 6 ? 1 : P.level === 6 ? 2 : 3) << 6, P.strstart !== 0 && ($ |= 32), $ += 31 - $ % 31, P.status = w, it(P, $), P.strstart !== 0 && (it(P, A.adler >>> 16), it(P, 65535 & A.adler)), A.adler = 1;
+            $ |= (2 <= P.strategy || P.level < 2 ? 0 : P.level < 6 ? 1 : P.level === 6 ? 2 : 3) << 6, P.strstart !== 0 && ($ |= 32), $ += 31 - $ % 31, P.status = M, it(P, $), P.strstart !== 0 && (it(P, A.adler >>> 16), it(P, 65535 & A.adler)), A.adler = 1;
           }
         if (P.status === 69)
           if (P.gzhead.extra) {
@@ -13898,7 +13898,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             P.gzhead.hcrc && P.pending > _ && (A.adler = l(A.adler, P.pending_buf, P.pending - _, _)), U === 0 && (P.status = 103);
           } else
             P.status = 103;
-        if (P.status === 103 && (P.gzhead.hcrc ? (P.pending + 2 > P.pending_buf_size && V(A), P.pending + 2 <= P.pending_buf_size && (ot(P, 255 & A.adler), ot(P, A.adler >> 8 & 255), A.adler = 0, P.status = w)) : P.status = w), P.pending !== 0) {
+        if (P.status === 103 && (P.gzhead.hcrc ? (P.pending + 2 > P.pending_buf_size && V(A), P.pending + 2 <= P.pending_buf_size && (ot(P, 255 & A.adler), ot(P, A.adler >> 8 & 255), A.adler = 0, P.status = M)) : P.status = M), P.pending !== 0) {
           if (V(A), A.avail_out === 0)
             return P.last_flush = -1, u;
         } else if (A.avail_in === 0 && W(X) <= W(k) && X !== I)
@@ -13945,10 +13945,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return X !== I ? u : P.wrap <= 0 ? 1 : (P.wrap === 2 ? (ot(P, 255 & A.adler), ot(P, A.adler >> 8 & 255), ot(P, A.adler >> 16 & 255), ot(P, A.adler >> 24 & 255), ot(P, 255 & A.total_in), ot(P, A.total_in >> 8 & 255), ot(P, A.total_in >> 16 & 255), ot(P, A.total_in >> 24 & 255)) : (it(P, A.adler >>> 16), it(P, 65535 & A.adler)), V(A), 0 < P.wrap && (P.wrap = -P.wrap), P.pending !== 0 ? u : 1);
       }, s.deflateEnd = function(A) {
         var X;
-        return A && A.state ? (X = A.state.status) !== O && X !== 69 && X !== 73 && X !== 91 && X !== 103 && X !== w && X !== 666 ? et(A, d) : (A.state = null, X === w ? et(A, -3) : u) : d;
+        return A && A.state ? (X = A.state.status) !== N && X !== 69 && X !== 73 && X !== 91 && X !== 103 && X !== M && X !== 666 ? et(A, d) : (A.state = null, X === M ? et(A, -3) : u) : d;
       }, s.deflateSetDictionary = function(A, X) {
         var k, P, _, U, $, Z, B, K, st = X.length;
-        if (!A || !A.state || (U = (k = A.state).wrap) === 2 || U === 1 && k.status !== O || k.lookahead)
+        if (!A || !A.state || (U = (k = A.state).wrap) === 2 || U === 1 && k.status !== N || k.lookahead)
           return d;
         for (U === 1 && (A.adler = a(A.adler, X, st, 0)), k.wrap = 0, st >= k.w_size && (U === 0 && (nt(k.head), k.strstart = 0, k.block_start = 0, k.insert = 0), K = new r.Buf8(k.w_size), r.arraySet(K, X, st - k.w_size, k.w_size, 0), X = K, st = k.w_size), $ = A.avail_in, Z = A.next_in, B = A.input, A.avail_in = st, A.next_in = 0, A.input = X, St(k); k.lookahead >= L; ) {
           for (P = k.strstart, _ = k.lookahead - (L - 1); k.ins_h = (k.ins_h << k.hash_shift ^ k.window[P + L - 1]) & k.hash_mask, k.prev[P & k.w_mask] = k.head[k.ins_h], k.head[k.ins_h] = P, P++, --_; )
@@ -13963,19 +13963,19 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       };
     }, {}], 48: [function(t, e, s) {
       e.exports = function(n, r) {
-        var o, a, l, h, f, I, u, d, E, T, p, m, F, R, S, N, y, M, L, b, Y, O, w, g, v;
-        o = n.state, a = n.next_in, g = n.input, l = a + (n.avail_in - 5), h = n.next_out, v = n.output, f = h - (r - n.avail_out), I = h + (n.avail_out - 257), u = o.dmax, d = o.wsize, E = o.whave, T = o.wnext, p = o.window, m = o.hold, F = o.bits, R = o.lencode, S = o.distcode, N = (1 << o.lenbits) - 1, y = (1 << o.distbits) - 1;
+        var o, a, l, h, f, I, u, d, E, T, p, m, F, R, S, O, y, w, L, b, Y, N, M, g, v;
+        o = n.state, a = n.next_in, g = n.input, l = a + (n.avail_in - 5), h = n.next_out, v = n.output, f = h - (r - n.avail_out), I = h + (n.avail_out - 257), u = o.dmax, d = o.wsize, E = o.whave, T = o.wnext, p = o.window, m = o.hold, F = o.bits, R = o.lencode, S = o.distcode, O = (1 << o.lenbits) - 1, y = (1 << o.distbits) - 1;
         t:
           do {
-            F < 15 && (m += g[a++] << F, F += 8, m += g[a++] << F, F += 8), M = R[m & N];
+            F < 15 && (m += g[a++] << F, F += 8, m += g[a++] << F, F += 8), w = R[m & O];
             e:
               for (; ; ) {
-                if (m >>>= L = M >>> 24, F -= L, (L = M >>> 16 & 255) === 0)
-                  v[h++] = 65535 & M;
+                if (m >>>= L = w >>> 24, F -= L, (L = w >>> 16 & 255) === 0)
+                  v[h++] = 65535 & w;
                 else {
                   if (!(16 & L)) {
                     if (!(64 & L)) {
-                      M = R[(65535 & M) + (m & (1 << L) - 1)];
+                      w = R[(65535 & w) + (m & (1 << L) - 1)];
                       continue e;
                     }
                     if (32 & L) {
@@ -13985,18 +13985,18 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     n.msg = "invalid literal/length code", o.mode = 30;
                     break t;
                   }
-                  b = 65535 & M, (L &= 15) && (F < L && (m += g[a++] << F, F += 8), b += m & (1 << L) - 1, m >>>= L, F -= L), F < 15 && (m += g[a++] << F, F += 8, m += g[a++] << F, F += 8), M = S[m & y];
+                  b = 65535 & w, (L &= 15) && (F < L && (m += g[a++] << F, F += 8), b += m & (1 << L) - 1, m >>>= L, F -= L), F < 15 && (m += g[a++] << F, F += 8, m += g[a++] << F, F += 8), w = S[m & y];
                   i:
                     for (; ; ) {
-                      if (m >>>= L = M >>> 24, F -= L, !(16 & (L = M >>> 16 & 255))) {
+                      if (m >>>= L = w >>> 24, F -= L, !(16 & (L = w >>> 16 & 255))) {
                         if (!(64 & L)) {
-                          M = S[(65535 & M) + (m & (1 << L) - 1)];
+                          w = S[(65535 & w) + (m & (1 << L) - 1)];
                           continue i;
                         }
                         n.msg = "invalid distance code", o.mode = 30;
                         break t;
                       }
-                      if (Y = 65535 & M, F < (L &= 15) && (m += g[a++] << F, (F += 8) < L && (m += g[a++] << F, F += 8)), u < (Y += m & (1 << L) - 1)) {
+                      if (Y = 65535 & w, F < (L &= 15) && (m += g[a++] << F, (F += 8) < L && (m += g[a++] << F, F += 8)), u < (Y += m & (1 << L) - 1)) {
                         n.msg = "invalid distance too far back", o.mode = 30;
                         break t;
                       }
@@ -14005,34 +14005,34 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                           n.msg = "invalid distance too far back", o.mode = 30;
                           break t;
                         }
-                        if (w = p, (O = 0) === T) {
-                          if (O += d - L, L < b) {
-                            for (b -= L; v[h++] = p[O++], --L; )
+                        if (M = p, (N = 0) === T) {
+                          if (N += d - L, L < b) {
+                            for (b -= L; v[h++] = p[N++], --L; )
                               ;
-                            O = h - Y, w = v;
+                            N = h - Y, M = v;
                           }
                         } else if (T < L) {
-                          if (O += d + T - L, (L -= T) < b) {
-                            for (b -= L; v[h++] = p[O++], --L; )
+                          if (N += d + T - L, (L -= T) < b) {
+                            for (b -= L; v[h++] = p[N++], --L; )
                               ;
-                            if (O = 0, T < b) {
-                              for (b -= L = T; v[h++] = p[O++], --L; )
+                            if (N = 0, T < b) {
+                              for (b -= L = T; v[h++] = p[N++], --L; )
                                 ;
-                              O = h - Y, w = v;
+                              N = h - Y, M = v;
                             }
                           }
-                        } else if (O += T - L, L < b) {
-                          for (b -= L; v[h++] = p[O++], --L; )
+                        } else if (N += T - L, L < b) {
+                          for (b -= L; v[h++] = p[N++], --L; )
                             ;
-                          O = h - Y, w = v;
+                          N = h - Y, M = v;
                         }
                         for (; 2 < b; )
-                          v[h++] = w[O++], v[h++] = w[O++], v[h++] = w[O++], b -= 3;
-                        b && (v[h++] = w[O++], 1 < b && (v[h++] = w[O++]));
+                          v[h++] = M[N++], v[h++] = M[N++], v[h++] = M[N++], b -= 3;
+                        b && (v[h++] = M[N++], 1 < b && (v[h++] = M[N++]));
                       } else {
-                        for (O = h - Y; v[h++] = v[O++], v[h++] = v[O++], v[h++] = v[O++], 2 < (b -= 3); )
+                        for (N = h - Y; v[h++] = v[N++], v[h++] = v[N++], v[h++] = v[N++], 2 < (b -= 3); )
                           ;
-                        b && (v[h++] = v[O++], 1 < b && (v[h++] = v[O++]));
+                        b && (v[h++] = v[N++], 1 < b && (v[h++] = v[N++]));
                       }
                       break;
                     }
@@ -14044,57 +14044,57 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       };
     }, {}], 49: [function(t, e, s) {
       var n = t("../utils/common"), r = t("./adler32"), o = t("./crc32"), a = t("./inffast"), l = t("./inftrees"), h = 1, f = 2, I = 0, u = -2, d = 1, E = 852, T = 592;
-      function p(O) {
-        return (O >>> 24 & 255) + (O >>> 8 & 65280) + ((65280 & O) << 8) + ((255 & O) << 24);
+      function p(N) {
+        return (N >>> 24 & 255) + (N >>> 8 & 65280) + ((65280 & N) << 8) + ((255 & N) << 24);
       }
       function m() {
         this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new n.Buf16(320), this.work = new n.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
       }
-      function F(O) {
-        var w;
-        return O && O.state ? (w = O.state, O.total_in = O.total_out = w.total = 0, O.msg = "", w.wrap && (O.adler = 1 & w.wrap), w.mode = d, w.last = 0, w.havedict = 0, w.dmax = 32768, w.head = null, w.hold = 0, w.bits = 0, w.lencode = w.lendyn = new n.Buf32(E), w.distcode = w.distdyn = new n.Buf32(T), w.sane = 1, w.back = -1, I) : u;
+      function F(N) {
+        var M;
+        return N && N.state ? (M = N.state, N.total_in = N.total_out = M.total = 0, N.msg = "", M.wrap && (N.adler = 1 & M.wrap), M.mode = d, M.last = 0, M.havedict = 0, M.dmax = 32768, M.head = null, M.hold = 0, M.bits = 0, M.lencode = M.lendyn = new n.Buf32(E), M.distcode = M.distdyn = new n.Buf32(T), M.sane = 1, M.back = -1, I) : u;
       }
-      function R(O) {
-        var w;
-        return O && O.state ? ((w = O.state).wsize = 0, w.whave = 0, w.wnext = 0, F(O)) : u;
+      function R(N) {
+        var M;
+        return N && N.state ? ((M = N.state).wsize = 0, M.whave = 0, M.wnext = 0, F(N)) : u;
       }
-      function S(O, w) {
+      function S(N, M) {
         var g, v;
-        return O && O.state ? (v = O.state, w < 0 ? (g = 0, w = -w) : (g = 1 + (w >> 4), w < 48 && (w &= 15)), w && (w < 8 || 15 < w) ? u : (v.window !== null && v.wbits !== w && (v.window = null), v.wrap = g, v.wbits = w, R(O))) : u;
+        return N && N.state ? (v = N.state, M < 0 ? (g = 0, M = -M) : (g = 1 + (M >> 4), M < 48 && (M &= 15)), M && (M < 8 || 15 < M) ? u : (v.window !== null && v.wbits !== M && (v.window = null), v.wrap = g, v.wbits = M, R(N))) : u;
       }
-      function N(O, w) {
+      function O(N, M) {
         var g, v;
-        return O ? (v = new m(), (O.state = v).window = null, (g = S(O, w)) !== I && (O.state = null), g) : u;
+        return N ? (v = new m(), (N.state = v).window = null, (g = S(N, M)) !== I && (N.state = null), g) : u;
       }
-      var y, M, L = !0;
-      function b(O) {
+      var y, w, L = !0;
+      function b(N) {
         if (L) {
-          var w;
-          for (y = new n.Buf32(512), M = new n.Buf32(32), w = 0; w < 144; )
-            O.lens[w++] = 8;
-          for (; w < 256; )
-            O.lens[w++] = 9;
-          for (; w < 280; )
-            O.lens[w++] = 7;
-          for (; w < 288; )
-            O.lens[w++] = 8;
-          for (l(h, O.lens, 0, 288, y, 0, O.work, { bits: 9 }), w = 0; w < 32; )
-            O.lens[w++] = 5;
-          l(f, O.lens, 0, 32, M, 0, O.work, { bits: 5 }), L = !1;
+          var M;
+          for (y = new n.Buf32(512), w = new n.Buf32(32), M = 0; M < 144; )
+            N.lens[M++] = 8;
+          for (; M < 256; )
+            N.lens[M++] = 9;
+          for (; M < 280; )
+            N.lens[M++] = 7;
+          for (; M < 288; )
+            N.lens[M++] = 8;
+          for (l(h, N.lens, 0, 288, y, 0, N.work, { bits: 9 }), M = 0; M < 32; )
+            N.lens[M++] = 5;
+          l(f, N.lens, 0, 32, w, 0, N.work, { bits: 5 }), L = !1;
         }
-        O.lencode = y, O.lenbits = 9, O.distcode = M, O.distbits = 5;
+        N.lencode = y, N.lenbits = 9, N.distcode = w, N.distbits = 5;
       }
-      function Y(O, w, g, v) {
-        var q, G = O.state;
-        return G.window === null && (G.wsize = 1 << G.wbits, G.wnext = 0, G.whave = 0, G.window = new n.Buf8(G.wsize)), v >= G.wsize ? (n.arraySet(G.window, w, g - G.wsize, G.wsize, 0), G.wnext = 0, G.whave = G.wsize) : (v < (q = G.wsize - G.wnext) && (q = v), n.arraySet(G.window, w, g - v, q, G.wnext), (v -= q) ? (n.arraySet(G.window, w, g - v, v, 0), G.wnext = v, G.whave = G.wsize) : (G.wnext += q, G.wnext === G.wsize && (G.wnext = 0), G.whave < G.wsize && (G.whave += q))), 0;
+      function Y(N, M, g, v) {
+        var q, G = N.state;
+        return G.window === null && (G.wsize = 1 << G.wbits, G.wnext = 0, G.whave = 0, G.window = new n.Buf8(G.wsize)), v >= G.wsize ? (n.arraySet(G.window, M, g - G.wsize, G.wsize, 0), G.wnext = 0, G.whave = G.wsize) : (v < (q = G.wsize - G.wnext) && (q = v), n.arraySet(G.window, M, g - v, q, G.wnext), (v -= q) ? (n.arraySet(G.window, M, g - v, v, 0), G.wnext = v, G.whave = G.wsize) : (G.wnext += q, G.wnext === G.wsize && (G.wnext = 0), G.whave < G.wsize && (G.whave += q))), 0;
       }
-      s.inflateReset = R, s.inflateReset2 = S, s.inflateResetKeep = F, s.inflateInit = function(O) {
-        return N(O, 15);
-      }, s.inflateInit2 = N, s.inflate = function(O, w) {
+      s.inflateReset = R, s.inflateReset2 = S, s.inflateResetKeep = F, s.inflateInit = function(N) {
+        return O(N, 15);
+      }, s.inflateInit2 = O, s.inflate = function(N, M) {
         var g, v, q, G, et, W, nt, V, x, ot, it, tt, St, yt, at, It, ft, Ct, Ht, Dt, A, X, k, P, _ = 0, U = new n.Buf8(4), $ = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
-        if (!O || !O.state || !O.output || !O.input && O.avail_in !== 0)
+        if (!N || !N.state || !N.output || !N.input && N.avail_in !== 0)
           return u;
-        (g = O.state).mode === 12 && (g.mode = 13), et = O.next_out, q = O.output, nt = O.avail_out, G = O.next_in, v = O.input, W = O.avail_in, V = g.hold, x = g.bits, ot = W, it = nt, X = I;
+        (g = N.state).mode === 12 && (g.mode = 13), et = N.next_out, q = N.output, nt = N.avail_out, G = N.next_in, v = N.input, W = N.avail_in, V = g.hold, x = g.bits, ot = W, it = nt, X = I;
         t:
           for (; ; )
             switch (g.mode) {
@@ -14113,20 +14113,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   break;
                 }
                 if (g.flags = 0, g.head && (g.head.done = !1), !(1 & g.wrap) || (((255 & V) << 8) + (V >> 8)) % 31) {
-                  O.msg = "incorrect header check", g.mode = 30;
+                  N.msg = "incorrect header check", g.mode = 30;
                   break;
                 }
                 if ((15 & V) != 8) {
-                  O.msg = "unknown compression method", g.mode = 30;
+                  N.msg = "unknown compression method", g.mode = 30;
                   break;
                 }
                 if (x -= 4, A = 8 + (15 & (V >>>= 4)), g.wbits === 0)
                   g.wbits = A;
                 else if (A > g.wbits) {
-                  O.msg = "invalid window size", g.mode = 30;
+                  N.msg = "invalid window size", g.mode = 30;
                   break;
                 }
-                g.dmax = 1 << A, O.adler = g.check = 1, g.mode = 512 & V ? 10 : 12, x = V = 0;
+                g.dmax = 1 << A, N.adler = g.check = 1, g.mode = 512 & V ? 10 : 12, x = V = 0;
                 break;
               case 2:
                 for (; x < 16; ) {
@@ -14135,11 +14135,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   W--, V += v[G++] << x, x += 8;
                 }
                 if (g.flags = V, (255 & g.flags) != 8) {
-                  O.msg = "unknown compression method", g.mode = 30;
+                  N.msg = "unknown compression method", g.mode = 30;
                   break;
                 }
                 if (57344 & g.flags) {
-                  O.msg = "unknown header flags set", g.mode = 30;
+                  N.msg = "unknown header flags set", g.mode = 30;
                   break;
                 }
                 g.head && (g.head.text = V >> 8 & 1), 512 & g.flags && (U[0] = 255 & V, U[1] = V >>> 8 & 255, g.check = o(g.check, U, 2, 0)), x = V = 0, g.mode = 3;
@@ -14202,12 +14202,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     W--, V += v[G++] << x, x += 8;
                   }
                   if (V !== (65535 & g.check)) {
-                    O.msg = "header crc mismatch", g.mode = 30;
+                    N.msg = "header crc mismatch", g.mode = 30;
                     break;
                   }
                   x = V = 0;
                 }
-                g.head && (g.head.hcrc = g.flags >> 9 & 1, g.head.done = !0), O.adler = g.check = 0, g.mode = 12;
+                g.head && (g.head.hcrc = g.flags >> 9 & 1, g.head.done = !0), N.adler = g.check = 0, g.mode = 12;
                 break;
               case 10:
                 for (; x < 32; ) {
@@ -14215,13 +14215,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     break t;
                   W--, V += v[G++] << x, x += 8;
                 }
-                O.adler = g.check = p(V), x = V = 0, g.mode = 11;
+                N.adler = g.check = p(V), x = V = 0, g.mode = 11;
               case 11:
                 if (g.havedict === 0)
-                  return O.next_out = et, O.avail_out = nt, O.next_in = G, O.avail_in = W, g.hold = V, g.bits = x, 2;
-                O.adler = g.check = 1, g.mode = 12;
+                  return N.next_out = et, N.avail_out = nt, N.next_in = G, N.avail_in = W, g.hold = V, g.bits = x, 2;
+                N.adler = g.check = 1, g.mode = 12;
               case 12:
-                if (w === 5 || w === 6)
+                if (M === 5 || M === 6)
                   break t;
               case 13:
                 if (g.last) {
@@ -14238,7 +14238,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     g.mode = 14;
                     break;
                   case 1:
-                    if (b(g), g.mode = 20, w !== 6)
+                    if (b(g), g.mode = 20, M !== 6)
                       break;
                     V >>>= 2, x -= 2;
                     break t;
@@ -14246,7 +14246,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     g.mode = 17;
                     break;
                   case 3:
-                    O.msg = "invalid block type", g.mode = 30;
+                    N.msg = "invalid block type", g.mode = 30;
                 }
                 V >>>= 2, x -= 2;
                 break;
@@ -14257,10 +14257,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   W--, V += v[G++] << x, x += 8;
                 }
                 if ((65535 & V) != (V >>> 16 ^ 65535)) {
-                  O.msg = "invalid stored block lengths", g.mode = 30;
+                  N.msg = "invalid stored block lengths", g.mode = 30;
                   break;
                 }
-                if (g.length = 65535 & V, x = V = 0, g.mode = 15, w === 6)
+                if (g.length = 65535 & V, x = V = 0, g.mode = 15, M === 6)
                   break t;
               case 15:
                 g.mode = 16;
@@ -14280,7 +14280,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   W--, V += v[G++] << x, x += 8;
                 }
                 if (g.nlen = 257 + (31 & V), V >>>= 5, x -= 5, g.ndist = 1 + (31 & V), V >>>= 5, x -= 5, g.ncode = 4 + (15 & V), V >>>= 4, x -= 4, 286 < g.nlen || 30 < g.ndist) {
-                  O.msg = "too many length or distance symbols", g.mode = 30;
+                  N.msg = "too many length or distance symbols", g.mode = 30;
                   break;
                 }
                 g.have = 0, g.mode = 18;
@@ -14296,7 +14296,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 for (; g.have < 19; )
                   g.lens[$[g.have++]] = 0;
                 if (g.lencode = g.lendyn, g.lenbits = 7, k = { bits: g.lenbits }, X = l(0, g.lens, 0, 19, g.lencode, 0, g.work, k), g.lenbits = k.bits, X) {
-                  O.msg = "invalid code lengths set", g.mode = 30;
+                  N.msg = "invalid code lengths set", g.mode = 30;
                   break;
                 }
                 g.have = 0, g.mode = 19;
@@ -14317,7 +14317,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                         W--, V += v[G++] << x, x += 8;
                       }
                       if (V >>>= at, x -= at, g.have === 0) {
-                        O.msg = "invalid bit length repeat", g.mode = 30;
+                        N.msg = "invalid bit length repeat", g.mode = 30;
                         break;
                       }
                       A = g.lens[g.have - 1], tt = 3 + (3 & V), V >>>= 2, x -= 2;
@@ -14337,7 +14337,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                       x -= at, A = 0, tt = 11 + (127 & (V >>>= at)), V >>>= 7, x -= 7;
                     }
                     if (g.have + tt > g.nlen + g.ndist) {
-                      O.msg = "invalid bit length repeat", g.mode = 30;
+                      N.msg = "invalid bit length repeat", g.mode = 30;
                       break;
                     }
                     for (; tt--; )
@@ -14347,24 +14347,24 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 if (g.mode === 30)
                   break;
                 if (g.lens[256] === 0) {
-                  O.msg = "invalid code -- missing end-of-block", g.mode = 30;
+                  N.msg = "invalid code -- missing end-of-block", g.mode = 30;
                   break;
                 }
                 if (g.lenbits = 9, k = { bits: g.lenbits }, X = l(h, g.lens, 0, g.nlen, g.lencode, 0, g.work, k), g.lenbits = k.bits, X) {
-                  O.msg = "invalid literal/lengths set", g.mode = 30;
+                  N.msg = "invalid literal/lengths set", g.mode = 30;
                   break;
                 }
                 if (g.distbits = 6, g.distcode = g.distdyn, k = { bits: g.distbits }, X = l(f, g.lens, g.nlen, g.ndist, g.distcode, 0, g.work, k), g.distbits = k.bits, X) {
-                  O.msg = "invalid distances set", g.mode = 30;
+                  N.msg = "invalid distances set", g.mode = 30;
                   break;
                 }
-                if (g.mode = 20, w === 6)
+                if (g.mode = 20, M === 6)
                   break t;
               case 20:
                 g.mode = 21;
               case 21:
                 if (6 <= W && 258 <= nt) {
-                  O.next_out = et, O.avail_out = nt, O.next_in = G, O.avail_in = W, g.hold = V, g.bits = x, a(O, it), et = O.next_out, q = O.output, nt = O.avail_out, G = O.next_in, v = O.input, W = O.avail_in, V = g.hold, x = g.bits, g.mode === 12 && (g.back = -1);
+                  N.next_out = et, N.avail_out = nt, N.next_in = G, N.avail_in = W, g.hold = V, g.bits = x, a(N, it), et = N.next_out, q = N.output, nt = N.avail_out, G = N.next_in, v = N.input, W = N.avail_in, V = g.hold, x = g.bits, g.mode === 12 && (g.back = -1);
                   break;
                 }
                 for (g.back = 0; It = (_ = g.lencode[V & (1 << g.lenbits) - 1]) >>> 16 & 255, ft = 65535 & _, !((at = _ >>> 24) <= x); ) {
@@ -14389,7 +14389,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   break;
                 }
                 if (64 & It) {
-                  O.msg = "invalid literal/length code", g.mode = 30;
+                  N.msg = "invalid literal/length code", g.mode = 30;
                   break;
                 }
                 g.extra = 15 & It, g.mode = 22;
@@ -14418,7 +14418,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   V >>>= Ct, x -= Ct, g.back += Ct;
                 }
                 if (V >>>= at, x -= at, g.back += at, 64 & It) {
-                  O.msg = "invalid distance code", g.mode = 30;
+                  N.msg = "invalid distance code", g.mode = 30;
                   break;
                 }
                 g.offset = ft, g.extra = 15 & It, g.mode = 24;
@@ -14432,7 +14432,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   g.offset += V & (1 << g.extra) - 1, V >>>= g.extra, x -= g.extra, g.back += g.extra;
                 }
                 if (g.offset > g.dmax) {
-                  O.msg = "invalid distance too far back", g.mode = 30;
+                  N.msg = "invalid distance too far back", g.mode = 30;
                   break;
                 }
                 g.mode = 25;
@@ -14441,7 +14441,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                   break t;
                 if (tt = it - nt, g.offset > tt) {
                   if ((tt = g.offset - tt) > g.whave && g.sane) {
-                    O.msg = "invalid distance too far back", g.mode = 30;
+                    N.msg = "invalid distance too far back", g.mode = 30;
                     break;
                   }
                   St = tt > g.wnext ? (tt -= g.wnext, g.wsize - tt) : g.wnext - tt, tt > g.length && (tt = g.length), yt = g.window;
@@ -14463,8 +14463,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                       break t;
                     W--, V |= v[G++] << x, x += 8;
                   }
-                  if (it -= nt, O.total_out += it, g.total += it, it && (O.adler = g.check = g.flags ? o(g.check, q, it, et - it) : r(g.check, q, it, et - it)), it = nt, (g.flags ? V : p(V)) !== g.check) {
-                    O.msg = "incorrect data check", g.mode = 30;
+                  if (it -= nt, N.total_out += it, g.total += it, it && (N.adler = g.check = g.flags ? o(g.check, q, it, et - it) : r(g.check, q, it, et - it)), it = nt, (g.flags ? V : p(V)) !== g.check) {
+                    N.msg = "incorrect data check", g.mode = 30;
                     break;
                   }
                   x = V = 0;
@@ -14478,7 +14478,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     W--, V += v[G++] << x, x += 8;
                   }
                   if (V !== (4294967295 & g.total)) {
-                    O.msg = "incorrect length check", g.mode = 30;
+                    N.msg = "incorrect length check", g.mode = 30;
                     break;
                   }
                   x = V = 0;
@@ -14496,63 +14496,63 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               default:
                 return u;
             }
-        return O.next_out = et, O.avail_out = nt, O.next_in = G, O.avail_in = W, g.hold = V, g.bits = x, (g.wsize || it !== O.avail_out && g.mode < 30 && (g.mode < 27 || w !== 4)) && Y(O, O.output, O.next_out, it - O.avail_out) ? (g.mode = 31, -4) : (ot -= O.avail_in, it -= O.avail_out, O.total_in += ot, O.total_out += it, g.total += it, g.wrap && it && (O.adler = g.check = g.flags ? o(g.check, q, it, O.next_out - it) : r(g.check, q, it, O.next_out - it)), O.data_type = g.bits + (g.last ? 64 : 0) + (g.mode === 12 ? 128 : 0) + (g.mode === 20 || g.mode === 15 ? 256 : 0), (ot == 0 && it === 0 || w === 4) && X === I && (X = -5), X);
-      }, s.inflateEnd = function(O) {
-        if (!O || !O.state)
+        return N.next_out = et, N.avail_out = nt, N.next_in = G, N.avail_in = W, g.hold = V, g.bits = x, (g.wsize || it !== N.avail_out && g.mode < 30 && (g.mode < 27 || M !== 4)) && Y(N, N.output, N.next_out, it - N.avail_out) ? (g.mode = 31, -4) : (ot -= N.avail_in, it -= N.avail_out, N.total_in += ot, N.total_out += it, g.total += it, g.wrap && it && (N.adler = g.check = g.flags ? o(g.check, q, it, N.next_out - it) : r(g.check, q, it, N.next_out - it)), N.data_type = g.bits + (g.last ? 64 : 0) + (g.mode === 12 ? 128 : 0) + (g.mode === 20 || g.mode === 15 ? 256 : 0), (ot == 0 && it === 0 || M === 4) && X === I && (X = -5), X);
+      }, s.inflateEnd = function(N) {
+        if (!N || !N.state)
           return u;
-        var w = O.state;
-        return w.window && (w.window = null), O.state = null, I;
-      }, s.inflateGetHeader = function(O, w) {
+        var M = N.state;
+        return M.window && (M.window = null), N.state = null, I;
+      }, s.inflateGetHeader = function(N, M) {
         var g;
-        return O && O.state && 2 & (g = O.state).wrap ? ((g.head = w).done = !1, I) : u;
-      }, s.inflateSetDictionary = function(O, w) {
-        var g, v = w.length;
-        return O && O.state ? (g = O.state).wrap !== 0 && g.mode !== 11 ? u : g.mode === 11 && r(1, w, v, 0) !== g.check ? -3 : Y(O, w, v, v) ? (g.mode = 31, -4) : (g.havedict = 1, I) : u;
+        return N && N.state && 2 & (g = N.state).wrap ? ((g.head = M).done = !1, I) : u;
+      }, s.inflateSetDictionary = function(N, M) {
+        var g, v = M.length;
+        return N && N.state ? (g = N.state).wrap !== 0 && g.mode !== 11 ? u : g.mode === 11 && r(1, M, v, 0) !== g.check ? -3 : Y(N, M, v, v) ? (g.mode = 31, -4) : (g.havedict = 1, I) : u;
       }, s.inflateInfo = "pako inflate (from Nodeca project)";
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(t, e, s) {
       var n = 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], o = [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], a = [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], l = [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];
       e.exports = function(h, f, I, u, d, E, T, p) {
-        var m, F, R, S, N, y, M, L, b, Y = p.bits, O = 0, w = 0, g = 0, v = 0, q = 0, G = 0, et = 0, W = 0, nt = 0, V = 0, x = null, ot = 0, it = new n.Buf16(16), tt = new n.Buf16(16), St = null, yt = 0;
-        for (O = 0; O <= 15; O++)
-          it[O] = 0;
-        for (w = 0; w < u; w++)
-          it[f[I + w]]++;
+        var m, F, R, S, O, y, w, L, b, Y = p.bits, N = 0, M = 0, g = 0, v = 0, q = 0, G = 0, et = 0, W = 0, nt = 0, V = 0, x = null, ot = 0, it = new n.Buf16(16), tt = new n.Buf16(16), St = null, yt = 0;
+        for (N = 0; N <= 15; N++)
+          it[N] = 0;
+        for (M = 0; M < u; M++)
+          it[f[I + M]]++;
         for (q = Y, v = 15; 1 <= v && it[v] === 0; v--)
           ;
         if (v < q && (q = v), v === 0)
           return d[E++] = 20971520, d[E++] = 20971520, p.bits = 1, 0;
         for (g = 1; g < v && it[g] === 0; g++)
           ;
-        for (q < g && (q = g), O = W = 1; O <= 15; O++)
-          if (W <<= 1, (W -= it[O]) < 0)
+        for (q < g && (q = g), N = W = 1; N <= 15; N++)
+          if (W <<= 1, (W -= it[N]) < 0)
             return -1;
         if (0 < W && (h === 0 || v !== 1))
           return -1;
-        for (tt[1] = 0, O = 1; O < 15; O++)
-          tt[O + 1] = tt[O] + it[O];
-        for (w = 0; w < u; w++)
-          f[I + w] !== 0 && (T[tt[f[I + w]]++] = w);
-        if (y = h === 0 ? (x = St = T, 19) : h === 1 ? (x = r, ot -= 257, St = o, yt -= 257, 256) : (x = a, St = l, -1), O = g, N = E, et = w = V = 0, R = -1, S = (nt = 1 << (G = q)) - 1, h === 1 && 852 < nt || h === 2 && 592 < nt)
+        for (tt[1] = 0, N = 1; N < 15; N++)
+          tt[N + 1] = tt[N] + it[N];
+        for (M = 0; M < u; M++)
+          f[I + M] !== 0 && (T[tt[f[I + M]]++] = M);
+        if (y = h === 0 ? (x = St = T, 19) : h === 1 ? (x = r, ot -= 257, St = o, yt -= 257, 256) : (x = a, St = l, -1), N = g, O = E, et = M = V = 0, R = -1, S = (nt = 1 << (G = q)) - 1, h === 1 && 852 < nt || h === 2 && 592 < nt)
           return 1;
         for (; ; ) {
-          for (M = O - et, b = T[w] < y ? (L = 0, T[w]) : T[w] > y ? (L = St[yt + T[w]], x[ot + T[w]]) : (L = 96, 0), m = 1 << O - et, g = F = 1 << G; d[N + (V >> et) + (F -= m)] = M << 24 | L << 16 | b | 0, F !== 0; )
+          for (w = N - et, b = T[M] < y ? (L = 0, T[M]) : T[M] > y ? (L = St[yt + T[M]], x[ot + T[M]]) : (L = 96, 0), m = 1 << N - et, g = F = 1 << G; d[O + (V >> et) + (F -= m)] = w << 24 | L << 16 | b | 0, F !== 0; )
             ;
-          for (m = 1 << O - 1; V & m; )
+          for (m = 1 << N - 1; V & m; )
             m >>= 1;
-          if (m !== 0 ? (V &= m - 1, V += m) : V = 0, w++, --it[O] == 0) {
-            if (O === v)
+          if (m !== 0 ? (V &= m - 1, V += m) : V = 0, M++, --it[N] == 0) {
+            if (N === v)
               break;
-            O = f[I + T[w]];
+            N = f[I + T[M]];
           }
-          if (q < O && (V & S) !== R) {
-            for (et === 0 && (et = q), N += g, W = 1 << (G = O - et); G + et < v && !((W -= it[G + et]) <= 0); )
+          if (q < N && (V & S) !== R) {
+            for (et === 0 && (et = q), O += g, W = 1 << (G = N - et); G + et < v && !((W -= it[G + et]) <= 0); )
               G++, W <<= 1;
             if (nt += 1 << G, h === 1 && 852 < nt || h === 2 && 592 < nt)
               return 1;
-            d[R = V & S] = q << 24 | G << 16 | N - E | 0;
+            d[R = V & S] = q << 24 | G << 16 | O - E | 0;
           }
         }
-        return V !== 0 && (d[N + V] = O - et << 24 | 64 << 16 | 0), p.bits = q, 0;
+        return V !== 0 && (d[O + V] = N - et << 24 | 64 << 16 | 0), p.bits = q, 0;
       };
     }, { "../utils/common": 41 }], 51: [function(t, e, s) {
       e.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" };
@@ -14562,12 +14562,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         for (var U = _.length; 0 <= --U; )
           _[U] = 0;
       }
-      var l = 0, h = 29, f = 256, I = f + 1 + h, u = 30, d = 19, E = 2 * I + 1, T = 15, p = 16, m = 7, F = 256, R = 16, S = 17, N = 18, y = [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], M = [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], L = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], b = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], Y = new Array(2 * (I + 2));
+      var l = 0, h = 29, f = 256, I = f + 1 + h, u = 30, d = 19, E = 2 * I + 1, T = 15, p = 16, m = 7, F = 256, R = 16, S = 17, O = 18, y = [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], w = [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], L = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], b = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], Y = new Array(2 * (I + 2));
       a(Y);
-      var O = new Array(2 * u);
-      a(O);
-      var w = new Array(512);
-      a(w);
+      var N = new Array(2 * u);
+      a(N);
+      var M = new Array(512);
+      a(M);
       var g = new Array(256);
       a(g);
       var v = new Array(h);
@@ -14580,7 +14580,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         this.dyn_tree = _, this.max_code = 0, this.stat_desc = U;
       }
       function x(_) {
-        return _ < 256 ? w[_] : w[256 + (_ >>> 7)];
+        return _ < 256 ? M[_] : M[256 + (_ >>> 7)];
       }
       function ot(_, U) {
         _.pending_buf[_.pending++] = 255 & U, _.pending_buf[_.pending++] = U >>> 8 & 255;
@@ -14630,7 +14630,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function Ht(_, U, $) {
         var Z, B, K, st, J = 0;
         if (_.last_lit !== 0)
-          for (; Z = _.pending_buf[_.d_buf + 2 * J] << 8 | _.pending_buf[_.d_buf + 2 * J + 1], B = _.pending_buf[_.l_buf + J], J++, Z === 0 ? tt(_, B, U) : (tt(_, (K = g[B]) + f + 1, U), (st = y[K]) !== 0 && it(_, B -= v[K], st), tt(_, K = x(--Z), $), (st = M[K]) !== 0 && it(_, Z -= W[K], st)), J < _.last_lit; )
+          for (; Z = _.pending_buf[_.d_buf + 2 * J] << 8 | _.pending_buf[_.d_buf + 2 * J + 1], B = _.pending_buf[_.l_buf + J], J++, Z === 0 ? tt(_, B, U) : (tt(_, (K = g[B]) + f + 1, U), (st = y[K]) !== 0 && it(_, B -= v[K], st), tt(_, K = x(--Z), $), (st = w[K]) !== 0 && it(_, Z -= W[K], st)), J < _.last_lit; )
             ;
         tt(_, F, U);
       }
@@ -14665,7 +14665,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function A(_, U, $) {
         var Z, B, K = -1, st = U[1], J = 0, ct = 7, Rt = 4;
         for (st === 0 && (ct = 138, Rt = 3), U[2 * ($ + 1) + 1] = 65535, Z = 0; Z <= $; Z++)
-          B = st, st = U[2 * (Z + 1) + 1], ++J < ct && B === st || (J < Rt ? _.bl_tree[2 * B] += J : B !== 0 ? (B !== K && _.bl_tree[2 * B]++, _.bl_tree[2 * R]++) : J <= 10 ? _.bl_tree[2 * S]++ : _.bl_tree[2 * N]++, K = B, Rt = (J = 0) === st ? (ct = 138, 3) : B === st ? (ct = 6, 3) : (ct = 7, 4));
+          B = st, st = U[2 * (Z + 1) + 1], ++J < ct && B === st || (J < Rt ? _.bl_tree[2 * B] += J : B !== 0 ? (B !== K && _.bl_tree[2 * B]++, _.bl_tree[2 * R]++) : J <= 10 ? _.bl_tree[2 * S]++ : _.bl_tree[2 * O]++, K = B, Rt = (J = 0) === st ? (ct = 138, 3) : B === st ? (ct = 6, 3) : (ct = 7, 4));
       }
       function X(_, U, $) {
         var Z, B, K = -1, st = U[1], J = 0, ct = 7, Rt = 4;
@@ -14675,7 +14675,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               for (; tt(_, B, _.bl_tree), --J != 0; )
                 ;
             else
-              B !== 0 ? (B !== K && (tt(_, B, _.bl_tree), J--), tt(_, R, _.bl_tree), it(_, J - 3, 2)) : J <= 10 ? (tt(_, S, _.bl_tree), it(_, J - 3, 3)) : (tt(_, N, _.bl_tree), it(_, J - 11, 7));
+              B !== 0 ? (B !== K && (tt(_, B, _.bl_tree), J--), tt(_, R, _.bl_tree), it(_, J - 3, 2)) : J <= 10 ? (tt(_, S, _.bl_tree), it(_, J - 3, 3)) : (tt(_, O, _.bl_tree), it(_, J - 11, 7));
             K = B, Rt = (J = 0) === st ? (ct = 138, 3) : B === st ? (ct = 6, 3) : (ct = 7, 4);
           }
       }
@@ -14693,11 +14693,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             for (v[B] = Z, U = 0; U < 1 << y[B]; U++)
               g[Z++] = B;
           for (g[Z - 1] = B, B = K = 0; B < 16; B++)
-            for (W[B] = K, U = 0; U < 1 << M[B]; U++)
-              w[K++] = B;
+            for (W[B] = K, U = 0; U < 1 << w[B]; U++)
+              M[K++] = B;
           for (K >>= 7; B < u; B++)
-            for (W[B] = K << 7, U = 0; U < 1 << M[B] - 7; U++)
-              w[256 + K++] = B;
+            for (W[B] = K << 7, U = 0; U < 1 << w[B] - 7; U++)
+              M[256 + K++] = B;
           for ($ = 0; $ <= T; $++)
             st[$] = 0;
           for (U = 0; U <= 143; )
@@ -14709,8 +14709,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           for (; U <= 287; )
             Y[2 * U + 1] = 8, U++, st[8]++;
           for (yt(Y, I + 1, st), U = 0; U < u; U++)
-            O[2 * U + 1] = 5, O[2 * U] = St(U, 5);
-          q = new nt(Y, y, f + 1, I, T), G = new nt(O, M, 0, u, T), et = new nt(new Array(0), L, 0, d, m);
+            N[2 * U + 1] = 5, N[2 * U] = St(U, 5);
+          q = new nt(Y, y, f + 1, I, T), G = new nt(N, w, 0, u, T), et = new nt(new Array(0), L, 0, d, m);
         }(), k = !0), _.l_desc = new V(_.dyn_ltree, q), _.d_desc = new V(_.dyn_dtree, G), _.bl_desc = new V(_.bl_tree, et), _.bi_buf = 0, _.bi_valid = 0, at(_);
       }, s._tr_stored_block = P, s._tr_flush_block = function(_, U, $, Z) {
         var B, K, st = 0;
@@ -14730,7 +14730,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           for (A(J, J.dyn_ltree, J.l_desc.max_code), A(J, J.dyn_dtree, J.d_desc.max_code), Dt(J, J.bl_desc), ct = d - 1; 3 <= ct && J.bl_tree[2 * b[ct] + 1] === 0; ct--)
             ;
           return J.opt_len += 3 * (ct + 1) + 5 + 5 + 4, ct;
-        }(_), B = _.opt_len + 3 + 7 >>> 3, (K = _.static_len + 3 + 7 >>> 3) <= B && (B = K)) : B = K = $ + 5, $ + 4 <= B && U !== -1 ? P(_, U, $, Z) : _.strategy === 4 || K === B ? (it(_, 2 + (Z ? 1 : 0), 3), Ht(_, Y, O)) : (it(_, 4 + (Z ? 1 : 0), 3), function(J, ct, Rt, dt) {
+        }(_), B = _.opt_len + 3 + 7 >>> 3, (K = _.static_len + 3 + 7 >>> 3) <= B && (B = K)) : B = K = $ + 5, $ + 4 <= B && U !== -1 ? P(_, U, $, Z) : _.strategy === 4 || K === B ? (it(_, 2 + (Z ? 1 : 0), 3), Ht(_, Y, N)) : (it(_, 4 + (Z ? 1 : 0), 3), function(J, ct, Rt, dt) {
           var Wt;
           for (it(J, ct - 257, 5), it(J, Rt - 1, 5), it(J, dt - 4, 4), Wt = 0; Wt < dt; Wt++)
             it(J, J.bl_tree[2 * b[Wt] + 1], 3);
@@ -14778,8 +14778,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               setTimeout(m, 0, R);
             }, T.setImmediate = function(R) {
               typeof R != "function" && (R = new Function("" + R));
-              for (var S = new Array(arguments.length - 1), N = 0; N < S.length; N++)
-                S[N] = arguments[N + 1];
+              for (var S = new Array(arguments.length - 1), O = 0; O < S.length; O++)
+                S[O] = arguments[O + 1];
               var y = { callback: R, args: S };
               return u[I] = y, a(I), I++;
             }, T.clearImmediate = p;
@@ -14795,23 +14795,23 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               if (S) {
                 d = !0;
                 try {
-                  (function(N) {
-                    var y = N.callback, M = N.args;
-                    switch (M.length) {
+                  (function(O) {
+                    var y = O.callback, w = O.args;
+                    switch (w.length) {
                       case 0:
                         y();
                         break;
                       case 1:
-                        y(M[0]);
+                        y(w[0]);
                         break;
                       case 2:
-                        y(M[0], M[1]);
+                        y(w[0], w[1]);
                         break;
                       case 3:
-                        y(M[0], M[1], M[2]);
+                        y(w[0], w[1], w[2]);
                         break;
                       default:
-                        y.apply(o, M);
+                        y.apply(o, w);
                     }
                   })(S);
                 } finally {
@@ -16678,28 +16678,28 @@ ${o}
         console.warn("Missing VisualizationInfo in Viewpoint");
         continue;
       }
-      const N = {}, {
+      const O = {}, {
         Guid: y,
-        ClippingPlanes: M,
+        ClippingPlanes: w,
         Components: L,
         OrthogonalCamera: b,
         PerspectiveCamera: Y
       } = S;
-      if (y && (N.guid = y), L) {
-        const { Selection: w, Visibility: g } = L;
-        if (w && w.Component) {
-          const q = Array.isArray(w.Component) ? w.Component : [w.Component];
-          N.selectionComponents = q.map((G) => G.IfcGuid).filter((G) => G);
+      if (y && (O.guid = y), L) {
+        const { Selection: M, Visibility: g } = L;
+        if (M && M.Component) {
+          const q = Array.isArray(M.Component) ? M.Component : [M.Component];
+          O.selectionComponents = q.map((G) => G.IfcGuid).filter((G) => G);
         }
-        if (g && "DefaultVisibility" in g && (N.defaultVisibility = g.DefaultVisibility), g && g.Exceptions && "Component" in g.Exceptions) {
+        if (g && "DefaultVisibility" in g && (O.defaultVisibility = g.DefaultVisibility), g && g.Exceptions && "Component" in g.Exceptions) {
           const { Component: q } = g.Exceptions, G = Array.isArray(q) ? q : [q];
-          N.exceptionComponents = G.map((et) => et.IfcGuid).filter((et) => et);
+          O.exceptionComponents = G.map((et) => et.IfcGuid).filter((et) => et);
         }
         let v;
-        l === "2.1" && (v = L.ViewSetupHints), l === "3" && (v = (m = L.Visibility) == null ? void 0 : m.ViewSetupHints), v && ("OpeningsVisible" in v && (N.openingsVisible = v.OpeningsVisible), "SpacesVisible" in v && (N.spacesVisible = v.SpacesVisible), "SpaceBoundariesVisible" in v && (N.spaceBoundariesVisible = v.SpaceBoundariesVisible));
+        l === "2.1" && (v = L.ViewSetupHints), l === "3" && (v = (m = L.Visibility) == null ? void 0 : m.ViewSetupHints), v && ("OpeningsVisible" in v && (O.openingsVisible = v.OpeningsVisible), "SpacesVisible" in v && (O.spacesVisible = v.SpacesVisible), "SpaceBoundariesVisible" in v && (O.spaceBoundariesVisible = v.SpaceBoundariesVisible));
       }
       if (b || Y) {
-        const w = S.PerspectiveCamera ?? S.OrthogonalCamera, { CameraViewPoint: g, CameraDirection: v } = w, q = new D.Vector3(
+        const M = S.PerspectiveCamera ?? S.OrthogonalCamera, { CameraViewPoint: g, CameraDirection: v } = M, q = new D.Vector3(
           Number(g.X),
           Number(g.Z),
           Number(-g.Y)
@@ -16710,33 +16710,33 @@ ${o}
         ), et = {
           position: { x: q.x, y: q.y, z: q.z },
           direction: { x: G.x, y: G.y, z: G.z },
-          aspectRatio: "AspectRatio" in w ? w.AspectRatio : 1
+          aspectRatio: "AspectRatio" in M ? M.AspectRatio : 1
           // Temporal simplification
         };
-        "ViewToWorldScale" in w && (N.camera = {
+        "ViewToWorldScale" in M && (O.camera = {
           ...et,
-          viewToWorldScale: w.ViewToWorldScale
-        }), "FieldOfView" in w && (N.camera = {
+          viewToWorldScale: M.ViewToWorldScale
+        }), "FieldOfView" in M && (O.camera = {
           ...et,
-          fov: w.FieldOfView
+          fov: M.FieldOfView
         });
       }
-      const O = new To(this.components, e, {
-        data: N,
+      const N = new To(this.components, e, {
+        data: O,
         setCamera: !1
       });
       if (L) {
-        const { Coloring: w } = L;
-        if (w && w.Color) {
-          const g = Array.isArray(w.Color) ? w.Color : [w.Color];
+        const { Coloring: M } = L;
+        if (M && M.Color) {
+          const g = Array.isArray(M.Color) ? M.Color : [M.Color];
           for (const v of g) {
             const { Color: q, Component: G } = v, W = (Array.isArray(G) ? G : [G]).map((nt) => nt.IfcGuid);
-            O.componentColors.set(q, W);
+            N.componentColors.set(q, W);
           }
         }
       }
-      if (I.push(O), M) {
-        const w = this.components.get(Sn), g = Array.isArray(M.ClippingPlane) ? M.ClippingPlane : [M.ClippingPlane];
+      if (I.push(N), w) {
+        const M = this.components.get(Sn), g = Array.isArray(w.ClippingPlane) ? w.ClippingPlane : [w.ClippingPlane];
         for (const v of g) {
           const { Location: q, Direction: G } = v;
           if (!(q && G))
@@ -16749,53 +16749,53 @@ ${o}
             G.X,
             -G.Z,
             G.Y
-          ), nt = w.createFromNormalAndCoplanarPoint(
+          ), nt = M.createFromNormalAndCoplanarPoint(
             e,
             W,
             et
           );
-          nt.visible = !1, nt.enabled = !1, O.clippingPlanes.add(nt);
+          nt.visible = !1, nt.enabled = !1, N.clippingPlanes.add(nt);
         }
       }
     }
     const E = {}, T = [], p = a.filter((F) => F.name.endsWith(".bcf"));
     for (const F of p) {
-      const R = await F.async("string"), S = Le.xmlParser.parse(R).Markup, N = S.Topic, {
+      const R = await F.async("string"), S = Le.xmlParser.parse(R).Markup, O = S.Topic, {
         Guid: y,
-        TopicType: M,
+        TopicType: w,
         TopicStatus: L,
         Title: b,
         CreationDate: Y,
-        CreationAuthor: O
-      } = N;
-      if (n && !(y && M && L && b && Y && O))
+        CreationAuthor: N
+      } = O;
+      if (n && !(y && w && L && b && Y && N))
         continue;
-      const w = new Rs(this.components);
-      w.guid = y ?? w.guid;
+      const M = new Rs(this.components);
+      M.guid = y ?? M.guid;
       const g = this.getMarkupRelatedTopics(S, l);
-      E[w.guid] = new Set(g), w.type = M ?? w.type, w.status = L ?? w.status, w.title = b ?? w.title, w.creationDate = Y ? new Date(Y) : w.creationDate, w.creationAuthor = O ?? w.creationAuthor, w.serverAssignedId = N.ServerAssignedId, w.priority = N.Priority, w.index = N.Index, w.modifiedDate = N.ModifiedDate ? new Date(N.ModifiedDate) : void 0, w.modifiedAuthor = N.ModifiedAuthor, w.dueDate = N.DueDate ? new Date(N.DueDate) : void 0, w.assignedTo = N.AssignedTo, w.description = N.Description, w.stage = N.Stage;
+      E[M.guid] = new Set(g), M.type = w ?? M.type, M.status = L ?? M.status, M.title = b ?? M.title, M.creationDate = Y ? new Date(Y) : M.creationDate, M.creationAuthor = N ?? M.creationAuthor, M.serverAssignedId = O.ServerAssignedId, M.priority = O.Priority, M.index = O.Index, M.modifiedDate = O.ModifiedDate ? new Date(O.ModifiedDate) : void 0, M.modifiedAuthor = O.ModifiedAuthor, M.dueDate = O.DueDate ? new Date(O.DueDate) : void 0, M.assignedTo = O.AssignedTo, M.description = O.Description, M.stage = O.Stage;
       const v = this.getMarkupLabels(S, l);
       for (const et of v)
-        w.labels.add(et);
+        M.labels.add(et);
       const q = this.getMarkupComments(S, l);
       for (const et of q)
-        w.comments.set(et.guid, et);
+        M.comments.set(et.guid, et);
       const G = this.getMarkupViewpoints(S, l);
       for (const et of G) {
         if (!(et && et.Guid))
           continue;
         const W = u.list.get(et.Guid);
-        W && w.viewpoints.add(W.guid);
+        W && M.viewpoints.add(W.guid);
       }
-      this.list.set(w.guid, w), T.push(w);
+      this.list.set(M.guid, M), T.push(M);
     }
     for (const F in E) {
       const R = this.list.get(F);
       if (!R)
         continue;
       const S = E[F];
-      for (const N of S)
-        R.relatedTopics.add(N);
+      for (const O of S)
+        R.relatedTopics.add(O);
     }
     return this.onBCFImported.trigger(T), { viewpoints: I, topics: T };
   }
@@ -18264,8 +18264,8 @@ const xs = class xs extends At {
         n[a].push(F);
         const R = this.webIfc.GetLine(0, F);
         if (R.GlobalId) {
-          const N = (R == null ? void 0 : R.GlobalId.value) || (R == null ? void 0 : R.GlobalId);
-          r.globalToExpressIDs.set(N, F);
+          const O = (R == null ? void 0 : R.GlobalId.value) || (R == null ? void 0 : R.GlobalId);
+          r.globalToExpressIDs.set(O, F);
         }
         const S = this._spatialTree.itemsByFloor[F] || 0;
         r.data.set(F, [[], [S, E]]), o++;
@@ -18366,16 +18366,16 @@ const xs = class xs extends At {
         const v = r[g];
         m.push(a[v * 3]), m.push(a[v * 3 + 1]), m.push(a[v * 3 + 2]), F.push(l[v * 3]), F.push(l[v * 3 + 1]), F.push(l[v * 3 + 2]);
       }
-      const S = new Uint32Array(p), N = new Float32Array(m), y = new Float32Array(F), M = qa(N), L = new Float32Array(M.transformation.elements), b = !1, Y = I ? e : this._nextAvailableID++;
+      const S = new Uint32Array(p), O = new Float32Array(m), y = new Float32Array(F), w = qa(O), L = new Float32Array(w.transformation.elements), b = !1, Y = I ? e : this._nextAvailableID++;
       this._geometries.set(Y, {
-        position: N,
+        position: O,
         normal: y,
         index: S,
         boundingBox: L,
         hasHoles: b
       }), I || (this._splittedGeometries.has(e) || this._splittedGeometries.set(e, /* @__PURE__ */ new Set()), this._splittedGeometries.get(e).add(Y));
-      const O = this._visitedGeometries.size, w = D.MathUtils.generateUUID();
-      this._visitedGeometries.set(s, { uuid: w, index: O }), this._geometryCount++, I = !1;
+      const N = this._visitedGeometries.size, M = D.MathUtils.generateUUID();
+      this._visitedGeometries.set(s, { uuid: M, index: N }), this._geometryCount++, I = !1;
     }
     n.delete();
   }
@@ -18547,9 +18547,9 @@ class To {
      */
     C(this, "clippingPlanes", new we());
     C(this, "camera", {
-      aspectRatio: 0,
-      fov: 0,
-      direction: { x: 0, y: 0, z: 80 },
+      aspectRatio: 1,
+      fov: 60,
+      direction: { x: 0, y: 0, z: 0 },
       position: { x: 0, y: 0, z: 0 }
     });
     /**
@@ -18747,28 +18747,38 @@ class To {
         "Viewpoint: the world's camera need controls to set the viewpoint."
       );
     t instanceof _c && t.projection.set(this.projection);
-    const e = this.position, s = this.direction;
-    let n = {
-      x: e.x + s.x * 80,
-      y: e.y + s.y * 80,
-      z: e.z + s.z * 80
+    const e = new D.Vector3(
+      this.camera.position.x,
+      this.camera.position.y,
+      this.camera.position.z
+    ), s = new D.Vector3(
+      this.camera.direction.x,
+      this.camera.direction.y,
+      this.camera.direction.z
+    );
+    if (e.equals(new D.Vector3()) && s.equals(new D.Vector3()))
+      return;
+    const n = this.position, r = this.direction;
+    let o = {
+      x: n.x + r.x * 80,
+      y: n.y + r.y * 80,
+      z: n.z + r.z * 80
     };
-    const r = this.selection;
-    if (Object.keys(r).length === 0) {
-      const h = this._components.get(ci).get(this.world).castRayFromVector(e, this.direction);
-      h && (n = h.point);
+    const a = this.selection;
+    if (Object.keys(a).length === 0) {
+      const f = this._components.get(ci).get(this.world).castRayFromVector(n, this.direction);
+      f && (o = f.point);
     } else {
-      const a = this._components.get(wn);
-      a.reset(), a.addFragmentIdMap(r), n = a.getSphere().center, a.reset();
-    }
-    const o = this._components.get(Mn);
-    o.set(this.defaultVisibility), o.set(!this.defaultVisibility, this.exception), o.set(!0, r), await t.controls.setLookAt(
-      e.x,
-      e.y,
-      e.z,
+      const l = this._components.get(wn);
+      l.reset(), l.addFragmentIdMap(a), o = l.getSphere().center, l.reset();
+    }
+    await t.controls.setLookAt(
       n.x,
       n.y,
       n.z,
+      o.x,
+      o.y,
+      o.z,
       i
     );
   }
@@ -18811,6 +18821,10 @@ class To {
       viewToWorldScale: s.top - s.bottom
     }), this._components.get(ie).list.set(this.guid, this);
   }
+  applyVisibility() {
+    const i = this._components.get(Mn);
+    i.set(this.defaultVisibility), i.set(!this.defaultVisibility, this.exception), i.set(!0, this.selection);
+  }
   /**
    * Applies color to the components in the viewpoint based on their GUIDs.
    *
@@ -18821,21 +18835,15 @@ class To {
    * The color is applied using the `Classifier.setColor` method, which sets the color of the specified fragments.
    * The color is provided as a hexadecimal string, prefixed with a '#'.
    */
-  colorize() {
+  applyColors() {
     const i = this._components.get(ie), t = this._components.get(Tt), e = this._components.get(Bi);
     for (const [s, n] of this.componentColors) {
-      const r = t.guidToFragmentIdMap(n), o = new D.Color(`#${s}`);
-      e.setColor(
-        r,
-        o,
-        i.config.overwriteColors
-      );
+      const r = t.guidToFragmentIdMap(n);
+      e.setColor(r, s, i.config.overwriteColors);
     }
   }
   /**
    * Resets the colors of all components in the viewpoint to their original color.
-   * This method iterates through the `componentColors` map, retrieves the fragment IDs
-   * corresponding to each color, and then uses the `Classifier` to reset the color of those fragments.
    */
   resetColors() {
     const i = this._components.get(Tt), t = this._components.get(Bi);
@@ -18873,6 +18881,20 @@ class To {
 `);
     return s;
   }
+  createColorTags() {
+    let i = "";
+    for (const [t, e] of this.componentColors.entries()) {
+      const s = `#${t.getHexString()}`, n = e.map((r) => `
+<Component IfcGuid="${r}" />`).join(`
+`);
+      i += `<Color Color="${s}">
+${n}
+</Color>`;
+    }
+    return i.length !== 0 ? `<Coloring>
+${i}
+</Coloring>` : "<Coloring />";
+  }
   /**
    * Serializes the viewpoint into a buildingSMART compliant XML string for export.
    *
@@ -18919,7 +18941,7 @@ class To {
         ${h}
         <FieldOfView>${this.camera.fov}</FieldOfView>
       </PerspectiveCamera>`);
-    const I = `<ViewSetupHints SpacesVisible="${this.spacesVisible ?? !1}" SpaceBoundariesVisible="${this.spaceBoundariesVisible ?? !1}" OpeningsVisible="${this.openingsVisible ?? !1}" />`, u = (await this.createComponentTags("selection")).trim(), d = (await this.createComponentTags("exception")).trim();
+    const I = `<ViewSetupHints SpacesVisible="${this.spacesVisible ?? !1}" SpaceBoundariesVisible="${this.spaceBoundariesVisible ?? !1}" OpeningsVisible="${this.openingsVisible ?? !1}" />`, u = (await this.createComponentTags("selection")).trim(), d = (await this.createComponentTags("exception")).trim(), E = this.createColorTags();
     return `<?xml version="1.0" encoding="UTF-8"?>
     <VisualizationInfo Guid="${this.guid}">
       <Components>
@@ -18929,6 +18951,7 @@ class To {
           ${i === "3" ? I : ""}
           ${d.length !== 0 ? `<Exceptions>${d}</Exceptions>` : ""}
         </Visibility>
+        ${E}
       </Components>
       ${f}
     </VisualizationInfo>`;
@@ -19414,14 +19437,14 @@ const Vs = class Vs extends At {
       const d = /* @__PURE__ */ new Map();
       for (const { id: S } of u)
         if (h.has(S)) {
-          const N = h.get(S);
-          d.set(S, N);
+          const O = h.get(S);
+          d.set(S, O);
         }
       const E = u.map((S) => S.id);
       if (!d.size) {
         const S = l++;
-        for (const { id: N } of u)
-          h.set(N, S);
+        for (const { id: O } of u)
+          h.set(O, S);
         f.set(S, {
           edges: new Set(E),
           indices: /* @__PURE__ */ new Set([I])
@@ -19430,9 +19453,9 @@ const Vs = class Vs extends At {
       }
       let T = null;
       const p = /* @__PURE__ */ new Set(), m = new Set(E);
-      for (const [S, N] of d) {
-        T === null ? T = N : N !== T && p.add(N), h.delete(S);
-        const { edges: y } = f.get(N);
+      for (const [S, O] of d) {
+        T === null ? T = O : O !== T && p.add(O), h.delete(S);
+        const { edges: y } = f.get(O);
         y.delete(S), m.delete(S);
       }
       if (T === null)
@@ -19441,15 +19464,15 @@ const Vs = class Vs extends At {
       R.add(I);
       for (const S of m) {
         h.set(S, T);
-        const { edges: N } = F;
-        N.add(S);
+        const { edges: O } = F;
+        O.add(S);
       }
       for (const S of p) {
-        const N = f.get(S), { edges: y, indices: M } = N, L = f.get(T), { edges: b, indices: Y } = L;
-        for (const O of y)
-          b.add(O), h.set(O, T);
-        for (const O of M)
-          Y.add(O);
+        const O = f.get(S), { edges: y, indices: w } = O, L = f.get(T), { edges: b, indices: Y } = L;
+        for (const N of y)
+          b.add(N), h.set(N, T);
+        for (const N of w)
+          Y.add(N);
         f.delete(S);
       }
     }
@@ -19481,8 +19504,8 @@ const Vs = class Vs extends At {
     if (s !== void 0 && t instanceof D.InstancedMesh) {
       const S = new D.Matrix4();
       t.getMatrixAt(s, S);
-      const N = new D.Matrix4();
-      N.extractRotation(S), R.applyMatrix4(N), f.applyMatrix4(S), I.applyMatrix4(S), u.applyMatrix4(S);
+      const O = new D.Matrix4();
+      O.extractRotation(S), R.applyMatrix4(O), f.applyMatrix4(S), I.applyMatrix4(S), u.applyMatrix4(S);
     }
     return { p1: f, p2: I, p3: u, faceNormal: R };
   }
@@ -20411,7 +20434,7 @@ const Re = (c) => {
     if (!n)
       continue;
     const r = new ah(c, n);
-    e.cardinality && (r.cardinality = e.cardinality), r.predefinedType = Re(e.predefinedType), t.push(r);
+    e.cardinality && (r.cardinality = e.cardinality), r.predefinedType = Re(e.predefinedType), r.instructions = e.instructions, t.push(r);
   }
   return t;
 }, hh = (c, i) => {
@@ -20421,7 +20444,7 @@ const Re = (c) => {
     if (!n)
       continue;
     const r = new rh(c, n);
-    e.cardinality && (r.cardinality = e.cardinality), r.value = Re(e.value), t.push(r);
+    e.cardinality && (r.cardinality = e.cardinality), r.value = Re(e.value), r.instructions = e.instructions, t.push(r);
   }
   return t;
 }, uh = (c, i) => {
@@ -20433,7 +20456,7 @@ const Re = (c) => {
     const r = new oh(c, n);
     e.cardinality && (r.cardinality = e.cardinality);
     const o = Re(e.value);
-    (o == null ? void 0 : o.type) === "simple" && (o.parameter = String(o.parameter)), (o == null ? void 0 : o.type) === "enumeration" && Array.isArray(o.parameter) && (o.parameter = o.parameter.map(String)), r.value = o, r.uri = e.uri, t.push(r);
+    (o == null ? void 0 : o.type) === "simple" && (o.parameter = String(o.parameter)), (o == null ? void 0 : o.type) === "enumeration" && Array.isArray(o.parameter) && (o.parameter = o.parameter.map(String)), r.value = o, r.uri = e.uri, r.instructions = e.instructions, t.push(r);
   }
   return t;
 }, fh = (c, i) => {
@@ -20445,7 +20468,7 @@ const Re = (c) => {
     const a = new ch(c, r, o);
     e.cardinality && (a.cardinality = e.cardinality);
     const l = Re(e.value);
-    (l == null ? void 0 : l.type) === "enumeration" && Array.isArray(l.parameter) && (l.parameter = l.parameter.map(String)), a.value = l, a.dataType = e.dataType, a.uri = e.uri, t.push(a);
+    (l == null ? void 0 : l.type) === "enumeration" && Array.isArray(l.parameter) && (l.parameter = l.parameter.map(String)), a.value = l, a.dataType = e.dataType, a.uri = e.uri, a.instructions = e.instructions, t.push(a);
   }
   return t;
 }, ri = class ri extends At {
@@ -20478,13 +20501,13 @@ const Re = (c) => {
    *
    * @returns The newly created IDSSpecification instance.
    */
-  create(t, e) {
-    const s = new lh(
+  create(t, e, s) {
+    const n = new lh(
       this.components,
       t,
       e
     );
-    return this.list.set(s.identifier, s), s;
+    return s && (n.identifier = s), this.list.set(n.identifier, n), n;
   }
   /**
    * Parses and processes an XML string containing Information Delivery Specification (IDS) data.
@@ -20500,50 +20523,57 @@ const Re = (c) => {
     if (n && n.specification) {
       const r = Array.isArray(n.specification) ? n.specification : [n.specification];
       for (const o of r) {
-        const { name: a, ifcVersion: l } = o;
+        const { name: a, ifcVersion: l, description: h, instructions: f, identifier: I } = o;
         if (!(a && l))
           continue;
-        const h = [], f = [], { applicability: I, requirements: u } = o;
-        if (I) {
-          const { maxOccurs: d, ...E } = I, T = Array.isArray(E) ? E : [E];
-          for (const p of T)
-            for (const m in p) {
-              const F = Array.isArray(p[m]) ? p[m] : [p[m]];
-              if (m === "entity") {
-                const R = Xr(this.components, F);
-                h.push(...R);
+        const u = [], d = [], { applicability: E, requirements: T } = o;
+        if (E) {
+          const { maxOccurs: m, ...F } = E, R = Array.isArray(F) ? F : [F];
+          for (const S of R)
+            for (const O in S) {
+              const y = Array.isArray(S[O]) ? S[O] : [S[O]];
+              if (O === "entity") {
+                const w = Xr(this.components, y);
+                u.push(...w);
               }
             }
         }
-        if (u) {
-          const { maxOccurs: d, ...E } = u, T = Array.isArray(E) ? E : [E];
-          for (const p of T)
-            for (const m in p) {
-              const F = Array.isArray(p[m]) ? p[m] : [p[m]];
-              if (m === "entity") {
-                const R = Xr(this.components, F);
-                f.push(...R);
+        let p;
+        if (T) {
+          const { maxOccurs: m, ...F } = T;
+          p = T.description;
+          const R = Array.isArray(F) ? F : [F];
+          for (const S of R)
+            for (const O in S) {
+              const y = Array.isArray(S[O]) ? S[O] : [S[O]];
+              if (O === "entity") {
+                const w = Xr(this.components, y);
+                d.push(...w);
               }
-              if (m === "attribute") {
-                const R = hh(this.components, F);
-                f.push(...R);
+              if (O === "attribute") {
+                const w = hh(this.components, y);
+                d.push(...w);
               }
-              if (m === "classification") {
-                const R = uh(
+              if (O === "classification") {
+                const w = uh(
                   this.components,
-                  F
+                  y
                 );
-                f.push(...R);
+                d.push(...w);
               }
-              if (m === "property") {
-                const R = fh(this.components, F);
-                f.push(...R);
+              if (O === "property") {
+                const w = fh(this.components, y);
+                d.push(...w);
               }
             }
         }
-        if (h.length > 0 && f.length > 0) {
-          const d = this.create(a, l.split(/\s+/));
-          d.applicability.add(...h), d.requirements.add(...f), e.push(d);
+        if (u.length > 0 && d.length > 0) {
+          const m = this.create(
+            a,
+            l.split(/\s+/),
+            I
+          );
+          m.description = h, m.instructions = f, m.requirementsDescription = p, m.applicability.add(...u), m.requirements.add(...d), e.push(m);
         }
       }
     }