iflow-engine-base 3.9.211 → 3.9.222

package/dist/chunks/{engine-2d-DfXdo35a.js → engine-2d-rxLSmzpm.js}

@@ -1,19 +1,43 @@
-import { V as X, E as gt, Q as yt, M as Me, a as we, b as se, B as Ee, F as ye, S as vt, c as Ge, m as ze, d as wt, P as bt, C as pe, e as xt, f as Mt, N as kt, T as _t, L as Ze, g as ge, h as Te, D as Ae, i as Et, j as Re, k as at, G as Se, l as Ct, n as St, A as Tt, o as At, O as It, p as Lt, W as Pt, q as Dt, r as Ue, s as zt, I as Rt, R as Bt } from "./three-vendor-BislQYFI.js";
-import { F as qe, C as Nt, W as lt, L as Ot, r as Wt } from "./sdk-runtime-CvEwm_hr.js";
+import { V as X, E as gt, Q as yt, M as Me, a as we, b as se, B as Ee, F as ye, S as vt, c as Ge, m as ze, d as wt, P as bt, C as pe, e as xt, f as Mt, N as kt, T as _t, L as Ze, g as ge, h as Te, D as Ae, i as Et, j as Re, k as at, G as Se, l as Ct, n as St, A as Tt, o as At, O as It, p as Lt, W as Pt, q as Dt, r as Ue, s as zt, I as Rt, R as Bt } from "./three-vendor-Drr85AIk.js";
+import { F as qe, C as Nt, W as lt, L as Ot, r as Wt } from "./sdk-runtime-WxFsGvNA.js";
 import { r as _e } from "./sdk-assets-1SXx8Tbf.js";
 var Oe = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
-function ht(A) {
-  return A && A.__esModule && Object.prototype.hasOwnProperty.call(A, "default") ? A.default : A;
+function ht(T) {
+  return T && T.__esModule && Object.prototype.hasOwnProperty.call(T, "default") ? T.default : T;
 }
-function We(A) {
-  throw new Error('Could not dynamically require "' + A + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+function Vi(T) {
+  if (Object.prototype.hasOwnProperty.call(T, "__esModule")) return T;
+  var e = T.default;
+  if (typeof e == "function") {
+    var t = function i() {
+      var n = !1;
+      try {
+        n = this instanceof i;
+      } catch {
+      }
+      return n ? Reflect.construct(e, arguments, this.constructor) : e.apply(this, arguments);
+    };
+    t.prototype = e.prototype;
+  } else t = {};
+  return Object.defineProperty(t, "__esModule", { value: !0 }), Object.keys(T).forEach(function(i) {
+    var n = Object.getOwnPropertyDescriptor(T, i);
+    Object.defineProperty(t, i, n.get ? n : {
+      enumerable: !0,
+      get: function() {
+        return T[i];
+      }
+    });
+  }), t;
+}
+function We(T) {
+  throw new Error('Could not dynamically require "' + T + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
 var Ve = { exports: {} };
 var Je;
 function jt() {
-  return Je || (Je = 1, (function(A, e) {
+  return Je || (Je = 1, (function(T, e) {
     (function(t) {
-      A.exports = t();
+      T.exports = t();
     })(function() {
       return (function t(i, n, s) {
         function r(h, u) {
@@ -130,16 +154,16 @@ function jt() {
           y && !l || (Q.crc32 = d.crc32, Q.compressedSize = d.compressedSize, Q.uncompressedSize = d.uncompressedSize);
           var I = 0;
           y && (I |= 8), P || !z && !p || (I |= 2048);
-          var T = 0, J = 0;
-          te && (T |= 16), m === "UNIX" ? (J = 798, T |= (function(Z, le) {
+          var A = 0, J = 0;
+          te && (A |= 16), m === "UNIX" ? (J = 798, A |= (function(Z, le) {
             var ue = Z;
             return Z || (ue = le ? 16893 : 33204), (65535 & ue) << 16;
-          })(_.unixPermissions, te)) : (J = 20, T |= (function(Z) {
+          })(_.unixPermissions, te)) : (J = 20, A |= (function(Z) {
             return 63 & (Z || 0);
           })(_.dosPermissions)), M = F.getUTCHours(), M <<= 6, M |= F.getUTCMinutes(), M <<= 5, M |= F.getUTCSeconds() / 2, E = F.getUTCFullYear() - 1980, E <<= 4, E |= F.getUTCMonth() + 1, E <<= 5, E |= F.getUTCDate(), z && (ee = s(1, 1) + s(u(j), 4) + D, B += "up" + s(ee.length, 2) + ee), p && (U = s(1, 1) + s(u(q), 4) + k, B += "uc" + s(U.length, 2) + U);
           var $ = "";
           return $ += `
-\0`, $ += s(I, 2), $ += N.magic, $ += s(M, 2), $ += s(E, 2), $ += s(Q.crc32, 4), $ += s(Q.compressedSize, 4), $ += s(Q.uncompressedSize, 4), $ += s(j.length, 2), $ += s(B.length, 2), { fileRecord: g.LOCAL_FILE_HEADER + $ + j + B, dirRecord: g.CENTRAL_FILE_HEADER + s(J, 2) + $ + s(q.length, 2) + "\0\0\0\0" + s(T, 4) + s(f, 4) + j + B + q };
+\0`, $ += s(I, 2), $ += N.magic, $ += s(M, 2), $ += s(E, 2), $ += s(Q.crc32, 4), $ += s(Q.compressedSize, 4), $ += s(Q.uncompressedSize, 4), $ += s(j.length, 2), $ += s(B.length, 2), { fileRecord: g.LOCAL_FILE_HEADER + $ + j + B, dirRecord: g.CENTRAL_FILE_HEADER + s(J, 2) + $ + s(q.length, 2) + "\0\0\0\0" + s(A, 4) + s(f, 4) + j + B + q };
         }
         var o = t("../utils"), a = t("../stream/GenericWorker"), h = t("../utf8"), u = t("../crc32"), g = t("../signature");
         function v(d, y, l, f) {
@@ -1377,7 +1401,7 @@ function jt() {
           var R = c.state, L = R.pending;
           L > c.avail_out && (L = c.avail_out), L !== 0 && (r.arraySet(c.output, R.pending_buf, R.pending_out, L, c.next_out), c.next_out += L, R.pending_out += L, c.total_out += L, c.avail_out -= L, R.pending -= L, R.pending === 0 && (R.pending_out = 0));
         }
-        function T(c, R) {
+        function A(c, R) {
           o._tr_flush_block(c, 0 <= c.block_start ? c.block_start : -1, c.strstart - c.block_start, R), c.block_start = c.strstart, I(c.strm);
         }
         function J(c, R) {
@@ -1426,9 +1450,9 @@ function jt() {
               c.strstart++;
             } else c.strstart += c.match_length, c.match_length = 0, c.ins_h = c.window[c.strstart], c.ins_h = (c.ins_h << c.hash_shift ^ c.window[c.strstart + 1]) & c.hash_mask;
             else x = o._tr_tally(c, 0, c.window[c.strstart]), c.lookahead--, c.strstart++;
-            if (x && (T(c, !1), c.strm.avail_out === 0)) return p;
+            if (x && (A(c, !1), c.strm.avail_out === 0)) return p;
           }
-          return c.insert = c.strstart < D - 1 ? c.strstart : D - 1, R === v ? (T(c, !0), c.strm.avail_out === 0 ? ee : U) : c.last_lit && (T(c, !1), c.strm.avail_out === 0) ? p : B;
+          return c.insert = c.strstart < D - 1 ? c.strstart : D - 1, R === v ? (A(c, !0), c.strm.avail_out === 0 ? ee : U) : c.last_lit && (A(c, !1), c.strm.avail_out === 0) ? p : B;
         }
         function ie(c, R) {
           for (var L, x, b; ; ) {
@@ -1438,12 +1462,12 @@ function jt() {
             }
             if (L = 0, c.lookahead >= D && (c.ins_h = (c.ins_h << c.hash_shift ^ c.window[c.strstart + D - 1]) & c.hash_mask, L = c.prev[c.strstart & c.w_mask] = c.head[c.ins_h], c.head[c.ins_h] = c.strstart), c.prev_length = c.match_length, c.prev_match = c.match_start, c.match_length = D - 1, L !== 0 && c.prev_length < c.max_lazy_match && c.strstart - L <= c.w_size - q && (c.match_length = Z(c, L), c.match_length <= 5 && (c.strategy === 1 || c.match_length === D && 4096 < c.strstart - c.match_start) && (c.match_length = D - 1)), c.prev_length >= D && c.match_length <= c.prev_length) {
               for (b = c.strstart + c.lookahead - D, x = o._tr_tally(c, c.strstart - 1 - c.prev_match, c.prev_length - D), c.lookahead -= c.prev_length - 1, c.prev_length -= 2; ++c.strstart <= b && (c.ins_h = (c.ins_h << c.hash_shift ^ c.window[c.strstart + D - 1]) & c.hash_mask, L = c.prev[c.strstart & c.w_mask] = c.head[c.ins_h], c.head[c.ins_h] = c.strstart), --c.prev_length != 0; ) ;
-              if (c.match_available = 0, c.match_length = D - 1, c.strstart++, x && (T(c, !1), c.strm.avail_out === 0)) return p;
+              if (c.match_available = 0, c.match_length = D - 1, c.strstart++, x && (A(c, !1), c.strm.avail_out === 0)) return p;
             } else if (c.match_available) {
-              if ((x = o._tr_tally(c, 0, c.window[c.strstart - 1])) && T(c, !1), c.strstart++, c.lookahead--, c.strm.avail_out === 0) return p;
+              if ((x = o._tr_tally(c, 0, c.window[c.strstart - 1])) && A(c, !1), c.strstart++, c.lookahead--, c.strm.avail_out === 0) return p;
             } else c.match_available = 1, c.strstart++, c.lookahead--;
           }
-          return c.match_available && (x = o._tr_tally(c, 0, c.window[c.strstart - 1]), c.match_available = 0), c.insert = c.strstart < D - 1 ? c.strstart : D - 1, R === v ? (T(c, !0), c.strm.avail_out === 0 ? ee : U) : c.last_lit && (T(c, !1), c.strm.avail_out === 0) ? p : B;
+          return c.match_available && (x = o._tr_tally(c, 0, c.window[c.strstart - 1]), c.match_available = 0), c.insert = c.strstart < D - 1 ? c.strstart : D - 1, R === v ? (A(c, !0), c.strm.avail_out === 0 ? ee : U) : c.last_lit && (A(c, !1), c.strm.avail_out === 0) ? p : B;
         }
         function re(c, R, L, x, b) {
           this.good_length = c, this.max_lazy = R, this.nice_length = L, this.max_chain = x, this.func = b;
@@ -1478,9 +1502,9 @@ function jt() {
             }
             c.strstart += c.lookahead, c.lookahead = 0;
             var x = c.block_start + L;
-            if ((c.strstart === 0 || c.strstart >= x) && (c.lookahead = c.strstart - x, c.strstart = x, T(c, !1), c.strm.avail_out === 0) || c.strstart - c.block_start >= c.w_size - q && (T(c, !1), c.strm.avail_out === 0)) return p;
+            if ((c.strstart === 0 || c.strstart >= x) && (c.lookahead = c.strstart - x, c.strstart = x, A(c, !1), c.strm.avail_out === 0) || c.strstart - c.block_start >= c.w_size - q && (A(c, !1), c.strm.avail_out === 0)) return p;
           }
-          return c.insert = 0, R === v ? (T(c, !0), c.strm.avail_out === 0 ? ee : U) : (c.strstart > c.block_start && (T(c, !1), c.strm.avail_out), p);
+          return c.insert = 0, R === v ? (A(c, !0), c.strm.avail_out === 0 ? ee : U) : (c.strstart > c.block_start && (A(c, !1), c.strm.avail_out), p);
         }), new re(4, 4, 8, 4, ue), new re(4, 5, 16, 8, ue), new re(4, 6, 32, 32, ue), new re(4, 4, 16, 16, ie), new re(8, 16, 32, 32, ie), new re(8, 16, 128, 128, ie), new re(8, 32, 128, 256, ie), new re(32, 128, 258, 1024, ie), new re(32, 258, 258, 4096, ie)], n.deflateInit = function(c, R) {
           return ve(c, R, w, 15, 8, 0);
         }, n.deflateInit2 = ve, n.deflateReset = be, n.deflateResetKeep = he, n.deflateSetHeader = function(c, R) {
@@ -1531,9 +1555,9 @@ function jt() {
                   if (V === g) return p;
                   break;
                 }
-                if (S.match_length = 0, Y = o._tr_tally(S, 0, S.window[S.strstart]), S.lookahead--, S.strstart++, Y && (T(S, !1), S.strm.avail_out === 0)) return p;
+                if (S.match_length = 0, Y = o._tr_tally(S, 0, S.window[S.strstart]), S.lookahead--, S.strstart++, Y && (A(S, !1), S.strm.avail_out === 0)) return p;
               }
-              return S.insert = 0, V === v ? (T(S, !0), S.strm.avail_out === 0 ? ee : U) : S.last_lit && (T(S, !1), S.strm.avail_out === 0) ? p : B;
+              return S.insert = 0, V === v ? (A(S, !0), S.strm.avail_out === 0 ? ee : U) : S.last_lit && (A(S, !1), S.strm.avail_out === 0) ? p : B;
             })(x, R) : x.strategy === 3 ? (function(S, V) {
               for (var Y, G, K, oe, ne = S.window; ; ) {
                 if (S.lookahead <= H) {
@@ -1547,9 +1571,9 @@ function jt() {
                   while (G === ne[++K] && G === ne[++K] && G === ne[++K] && G === ne[++K] && G === ne[++K] && G === ne[++K] && G === ne[++K] && G === ne[++K] && K < oe);
                   S.match_length = H - (oe - K), S.match_length > S.lookahead && (S.match_length = S.lookahead);
                 }
-                if (S.match_length >= D ? (Y = o._tr_tally(S, 1, S.match_length - D), S.lookahead -= S.match_length, S.strstart += S.match_length, S.match_length = 0) : (Y = o._tr_tally(S, 0, S.window[S.strstart]), S.lookahead--, S.strstart++), Y && (T(S, !1), S.strm.avail_out === 0)) return p;
+                if (S.match_length >= D ? (Y = o._tr_tally(S, 1, S.match_length - D), S.lookahead -= S.match_length, S.strstart += S.match_length, S.match_length = 0) : (Y = o._tr_tally(S, 0, S.window[S.strstart]), S.lookahead--, S.strstart++), Y && (A(S, !1), S.strm.avail_out === 0)) return p;
               }
-              return S.insert = 0, V === v ? (T(S, !0), S.strm.avail_out === 0 ? ee : U) : S.last_lit && (T(S, !1), S.strm.avail_out === 0) ? p : B;
+              return S.insert = 0, V === v ? (A(S, !0), S.strm.avail_out === 0 ? ee : U) : S.last_lit && (A(S, !1), S.strm.avail_out === 0) ? p : B;
             })(x, R) : s[x.level].func(x, R);
             if (W !== ee && W !== U || (x.status = 666), W === p || W === ee) return c.avail_out === 0 && (x.last_flush = -1), d;
             if (W === B && (R === 1 ? o._tr_align(x) : R !== 5 && (o._tr_stored_block(x, 0, 0, !1), R === 3 && (Q(x.head), x.lookahead === 0 && (x.strstart = 0, x.block_start = 0, x.insert = 0))), I(c), c.avail_out === 0)) return x.last_flush = -1, d;
@@ -1686,21 +1710,21 @@ function jt() {
         n.inflateReset = E, n.inflateReset2 = _, n.inflateResetKeep = M, n.inflateInit = function(k) {
           return N(k, 15);
         }, n.inflateInit2 = N, n.inflate = function(k, z) {
-          var p, B, ee, U, te, F, Q, I, T, J, $, Z, le, ue, ie, re, de, he, be, ve, c, R, L, x, b = 0, C = new s.Buf8(4), O = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+          var p, B, ee, U, te, F, Q, I, A, J, $, Z, le, ue, ie, re, de, he, be, ve, c, R, L, x, b = 0, C = new s.Buf8(4), O = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
           if (!k || !k.state || !k.output || !k.input && k.avail_in !== 0) return d;
-          (p = k.state).mode === 12 && (p.mode = 13), te = k.next_out, ee = k.output, Q = k.avail_out, U = k.next_in, B = k.input, F = k.avail_in, I = p.hold, T = p.bits, J = F, $ = Q, R = v;
+          (p = k.state).mode === 12 && (p.mode = 13), te = k.next_out, ee = k.output, Q = k.avail_out, U = k.next_in, B = k.input, F = k.avail_in, I = p.hold, A = p.bits, J = F, $ = Q, R = v;
           e: for (; ; ) switch (p.mode) {
             case y:
               if (p.wrap === 0) {
                 p.mode = 13;
                 break;
               }
-              for (; T < 16; ) {
+              for (; A < 16; ) {
                 if (F === 0) break e;
-                F--, I += B[U++] << T, T += 8;
+                F--, I += B[U++] << A, A += 8;
               }
               if (2 & p.wrap && I === 35615) {
-                C[p.check = 0] = 255 & I, C[1] = I >>> 8 & 255, p.check = o(p.check, C, 2, 0), T = I = 0, p.mode = 2;
+                C[p.check = 0] = 255 & I, C[1] = I >>> 8 & 255, p.check = o(p.check, C, 2, 0), A = I = 0, p.mode = 2;
                 break;
               }
               if (p.flags = 0, p.head && (p.head.done = !1), !(1 & p.wrap) || (((255 & I) << 8) + (I >> 8)) % 31) {
@@ -1711,17 +1735,17 @@ function jt() {
                 k.msg = "unknown compression method", p.mode = 30;
                 break;
               }
-              if (T -= 4, c = 8 + (15 & (I >>>= 4)), p.wbits === 0) p.wbits = c;
+              if (A -= 4, c = 8 + (15 & (I >>>= 4)), p.wbits === 0) p.wbits = c;
               else if (c > p.wbits) {
                 k.msg = "invalid window size", p.mode = 30;
                 break;
               }
-              p.dmax = 1 << c, k.adler = p.check = 1, p.mode = 512 & I ? 10 : 12, T = I = 0;
+              p.dmax = 1 << c, k.adler = p.check = 1, p.mode = 512 & I ? 10 : 12, A = I = 0;
               break;
             case 2:
-              for (; T < 16; ) {
+              for (; A < 16; ) {
                 if (F === 0) break e;
-                F--, I += B[U++] << T, T += 8;
+                F--, I += B[U++] << A, A += 8;
               }
               if (p.flags = I, (255 & p.flags) != 8) {
                 k.msg = "unknown compression method", p.mode = 30;
@@ -1731,26 +1755,26 @@ function jt() {
                 k.msg = "unknown header flags set", p.mode = 30;
                 break;
               }
-              p.head && (p.head.text = I >> 8 & 1), 512 & p.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, p.check = o(p.check, C, 2, 0)), T = I = 0, p.mode = 3;
+              p.head && (p.head.text = I >> 8 & 1), 512 & p.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, p.check = o(p.check, C, 2, 0)), A = I = 0, p.mode = 3;
             case 3:
-              for (; T < 32; ) {
+              for (; A < 32; ) {
                 if (F === 0) break e;
-                F--, I += B[U++] << T, T += 8;
+                F--, I += B[U++] << A, A += 8;
               }
-              p.head && (p.head.time = I), 512 & p.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, C[2] = I >>> 16 & 255, C[3] = I >>> 24 & 255, p.check = o(p.check, C, 4, 0)), T = I = 0, p.mode = 4;
+              p.head && (p.head.time = I), 512 & p.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, C[2] = I >>> 16 & 255, C[3] = I >>> 24 & 255, p.check = o(p.check, C, 4, 0)), A = I = 0, p.mode = 4;
             case 4:
-              for (; T < 16; ) {
+              for (; A < 16; ) {
                 if (F === 0) break e;
-                F--, I += B[U++] << T, T += 8;
+                F--, I += B[U++] << A, A += 8;
               }
-              p.head && (p.head.xflags = 255 & I, p.head.os = I >> 8), 512 & p.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, p.check = o(p.check, C, 2, 0)), T = I = 0, p.mode = 5;
+              p.head && (p.head.xflags = 255 & I, p.head.os = I >> 8), 512 & p.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, p.check = o(p.check, C, 2, 0)), A = I = 0, p.mode = 5;
             case 5:
               if (1024 & p.flags) {
-                for (; T < 16; ) {
+                for (; A < 16; ) {
                   if (F === 0) break e;
-                  F--, I += B[U++] << T, T += 8;
+                  F--, I += B[U++] << A, A += 8;
                 }
-                p.length = I, p.head && (p.head.extra_len = I), 512 & p.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, p.check = o(p.check, C, 2, 0)), T = I = 0;
+                p.length = I, p.head && (p.head.extra_len = I), 512 & p.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, p.check = o(p.check, C, 2, 0)), A = I = 0;
               } else p.head && (p.head.extra = null);
               p.mode = 6;
             case 6:
@@ -1772,45 +1796,45 @@ function jt() {
               p.mode = 9;
             case 9:
               if (512 & p.flags) {
-                for (; T < 16; ) {
+                for (; A < 16; ) {
                   if (F === 0) break e;
-                  F--, I += B[U++] << T, T += 8;
+                  F--, I += B[U++] << A, A += 8;
                 }
                 if (I !== (65535 & p.check)) {
                   k.msg = "header crc mismatch", p.mode = 30;
                   break;
                 }
-                T = I = 0;
+                A = I = 0;
               }
               p.head && (p.head.hcrc = p.flags >> 9 & 1, p.head.done = !0), k.adler = p.check = 0, p.mode = 12;
               break;
             case 10:
-              for (; T < 32; ) {
+              for (; A < 32; ) {
                 if (F === 0) break e;
-                F--, I += B[U++] << T, T += 8;
+                F--, I += B[U++] << A, A += 8;
               }
-              k.adler = p.check = m(I), T = I = 0, p.mode = 11;
+              k.adler = p.check = m(I), A = I = 0, p.mode = 11;
             case 11:
-              if (p.havedict === 0) return k.next_out = te, k.avail_out = Q, k.next_in = U, k.avail_in = F, p.hold = I, p.bits = T, 2;
+              if (p.havedict === 0) return k.next_out = te, k.avail_out = Q, k.next_in = U, k.avail_in = F, p.hold = I, p.bits = A, 2;
               k.adler = p.check = 1, p.mode = 12;
             case 12:
               if (z === 5 || z === 6) break e;
             case 13:
               if (p.last) {
-                I >>>= 7 & T, T -= 7 & T, p.mode = 27;
+                I >>>= 7 & A, A -= 7 & A, p.mode = 27;
                 break;
               }
-              for (; T < 3; ) {
+              for (; A < 3; ) {
                 if (F === 0) break e;
-                F--, I += B[U++] << T, T += 8;
+                F--, I += B[U++] << A, A += 8;
               }
-              switch (p.last = 1 & I, T -= 1, 3 & (I >>>= 1)) {
+              switch (p.last = 1 & I, A -= 1, 3 & (I >>>= 1)) {
                 case 0:
                   p.mode = 14;
                   break;
                 case 1:
                   if (H(p), p.mode = 20, z !== 6) break;
-                  I >>>= 2, T -= 2;
+                  I >>>= 2, A -= 2;
                   break e;
                 case 2:
                   p.mode = 17;
@@ -1818,18 +1842,18 @@ function jt() {
                 case 3:
                   k.msg = "invalid block type", p.mode = 30;
               }
-              I >>>= 2, T -= 2;
+              I >>>= 2, A -= 2;
               break;
             case 14:
-              for (I >>>= 7 & T, T -= 7 & T; T < 32; ) {
+              for (I >>>= 7 & A, A -= 7 & A; A < 32; ) {
                 if (F === 0) break e;
-                F--, I += B[U++] << T, T += 8;
+                F--, I += B[U++] << A, A += 8;
               }
               if ((65535 & I) != (I >>> 16 ^ 65535)) {
                 k.msg = "invalid stored block lengths", p.mode = 30;
                 break;
               }
-              if (p.length = 65535 & I, T = I = 0, p.mode = 15, z === 6) break e;
+              if (p.length = 65535 & I, A = I = 0, p.mode = 15, z === 6) break e;
             case 15:
               p.mode = 16;
             case 16:
@@ -1841,22 +1865,22 @@ function jt() {
               p.mode = 12;
               break;
             case 17:
-              for (; T < 14; ) {
+              for (; A < 14; ) {
                 if (F === 0) break e;
-                F--, I += B[U++] << T, T += 8;
+                F--, I += B[U++] << A, A += 8;
               }
-              if (p.nlen = 257 + (31 & I), I >>>= 5, T -= 5, p.ndist = 1 + (31 & I), I >>>= 5, T -= 5, p.ncode = 4 + (15 & I), I >>>= 4, T -= 4, 286 < p.nlen || 30 < p.ndist) {
+              if (p.nlen = 257 + (31 & I), I >>>= 5, A -= 5, p.ndist = 1 + (31 & I), I >>>= 5, A -= 5, p.ncode = 4 + (15 & I), I >>>= 4, A -= 4, 286 < p.nlen || 30 < p.ndist) {
                 k.msg = "too many length or distance symbols", p.mode = 30;
                 break;
               }
               p.have = 0, p.mode = 18;
             case 18:
               for (; p.have < p.ncode; ) {
-                for (; T < 3; ) {
+                for (; A < 3; ) {
                   if (F === 0) break e;
-                  F--, I += B[U++] << T, T += 8;
+                  F--, I += B[U++] << A, A += 8;
                 }
-                p.lens[O[p.have++]] = 7 & I, I >>>= 3, T -= 3;
+                p.lens[O[p.have++]] = 7 & I, I >>>= 3, A -= 3;
               }
               for (; p.have < 19; ) p.lens[O[p.have++]] = 0;
               if (p.lencode = p.lendyn, p.lenbits = 7, L = { bits: p.lenbits }, R = h(0, p.lens, 0, 19, p.lencode, 0, p.work, L), p.lenbits = L.bits, R) {
@@ -1866,34 +1890,34 @@ function jt() {
               p.have = 0, p.mode = 19;
             case 19:
               for (; p.have < p.nlen + p.ndist; ) {
-                for (; re = (b = p.lencode[I & (1 << p.lenbits) - 1]) >>> 16 & 255, de = 65535 & b, !((ie = b >>> 24) <= T); ) {
+                for (; re = (b = p.lencode[I & (1 << p.lenbits) - 1]) >>> 16 & 255, de = 65535 & b, !((ie = b >>> 24) <= A); ) {
                   if (F === 0) break e;
-                  F--, I += B[U++] << T, T += 8;
+                  F--, I += B[U++] << A, A += 8;
                 }
-                if (de < 16) I >>>= ie, T -= ie, p.lens[p.have++] = de;
+                if (de < 16) I >>>= ie, A -= ie, p.lens[p.have++] = de;
                 else {
                   if (de === 16) {
-                    for (x = ie + 2; T < x; ) {
+                    for (x = ie + 2; A < x; ) {
                       if (F === 0) break e;
-                      F--, I += B[U++] << T, T += 8;
+                      F--, I += B[U++] << A, A += 8;
                     }
-                    if (I >>>= ie, T -= ie, p.have === 0) {
+                    if (I >>>= ie, A -= ie, p.have === 0) {
                       k.msg = "invalid bit length repeat", p.mode = 30;
                       break;
                     }
-                    c = p.lens[p.have - 1], Z = 3 + (3 & I), I >>>= 2, T -= 2;
+                    c = p.lens[p.have - 1], Z = 3 + (3 & I), I >>>= 2, A -= 2;
                   } else if (de === 17) {
-                    for (x = ie + 3; T < x; ) {
+                    for (x = ie + 3; A < x; ) {
                       if (F === 0) break e;
-                      F--, I += B[U++] << T, T += 8;
+                      F--, I += B[U++] << A, A += 8;
                     }
-                    T -= ie, c = 0, Z = 3 + (7 & (I >>>= ie)), I >>>= 3, T -= 3;
+                    A -= ie, c = 0, Z = 3 + (7 & (I >>>= ie)), I >>>= 3, A -= 3;
                   } else {
-                    for (x = ie + 7; T < x; ) {
+                    for (x = ie + 7; A < x; ) {
                       if (F === 0) break e;
-                      F--, I += B[U++] << T, T += 8;
+                      F--, I += B[U++] << A, A += 8;
                     }
-                    T -= ie, c = 0, Z = 11 + (127 & (I >>>= ie)), I >>>= 7, T -= 7;
+                    A -= ie, c = 0, Z = 11 + (127 & (I >>>= ie)), I >>>= 7, A -= 7;
                   }
                   if (p.have + Z > p.nlen + p.ndist) {
                     k.msg = "invalid bit length repeat", p.mode = 30;
@@ -1920,21 +1944,21 @@ function jt() {
               p.mode = 21;
             case 21:
               if (6 <= F && 258 <= Q) {
-                k.next_out = te, k.avail_out = Q, k.next_in = U, k.avail_in = F, p.hold = I, p.bits = T, a(k, $), te = k.next_out, ee = k.output, Q = k.avail_out, U = k.next_in, B = k.input, F = k.avail_in, I = p.hold, T = p.bits, p.mode === 12 && (p.back = -1);
+                k.next_out = te, k.avail_out = Q, k.next_in = U, k.avail_in = F, p.hold = I, p.bits = A, a(k, $), te = k.next_out, ee = k.output, Q = k.avail_out, U = k.next_in, B = k.input, F = k.avail_in, I = p.hold, A = p.bits, p.mode === 12 && (p.back = -1);
                 break;
               }
-              for (p.back = 0; re = (b = p.lencode[I & (1 << p.lenbits) - 1]) >>> 16 & 255, de = 65535 & b, !((ie = b >>> 24) <= T); ) {
+              for (p.back = 0; re = (b = p.lencode[I & (1 << p.lenbits) - 1]) >>> 16 & 255, de = 65535 & b, !((ie = b >>> 24) <= A); ) {
                 if (F === 0) break e;
-                F--, I += B[U++] << T, T += 8;
+                F--, I += B[U++] << A, A += 8;
               }
               if (re && (240 & re) == 0) {
-                for (he = ie, be = re, ve = de; re = (b = p.lencode[ve + ((I & (1 << he + be) - 1) >> he)]) >>> 16 & 255, de = 65535 & b, !(he + (ie = b >>> 24) <= T); ) {
+                for (he = ie, be = re, ve = de; re = (b = p.lencode[ve + ((I & (1 << he + be) - 1) >> he)]) >>> 16 & 255, de = 65535 & b, !(he + (ie = b >>> 24) <= A); ) {
                   if (F === 0) break e;
-                  F--, I += B[U++] << T, T += 8;
+                  F--, I += B[U++] << A, A += 8;
                 }
-                I >>>= he, T -= he, p.back += he;
+                I >>>= he, A -= he, p.back += he;
               }
-              if (I >>>= ie, T -= ie, p.back += ie, p.length = de, re === 0) {
+              if (I >>>= ie, A -= ie, p.back += ie, p.length = de, re === 0) {
                 p.mode = 26;
                 break;
               }
@@ -1949,37 +1973,37 @@ function jt() {
               p.extra = 15 & re, p.mode = 22;
             case 22:
               if (p.extra) {
-                for (x = p.extra; T < x; ) {
+                for (x = p.extra; A < x; ) {
                   if (F === 0) break e;
-                  F--, I += B[U++] << T, T += 8;
+                  F--, I += B[U++] << A, A += 8;
                 }
-                p.length += I & (1 << p.extra) - 1, I >>>= p.extra, T -= p.extra, p.back += p.extra;
+                p.length += I & (1 << p.extra) - 1, I >>>= p.extra, A -= p.extra, p.back += p.extra;
               }
               p.was = p.length, p.mode = 23;
             case 23:
-              for (; re = (b = p.distcode[I & (1 << p.distbits) - 1]) >>> 16 & 255, de = 65535 & b, !((ie = b >>> 24) <= T); ) {
+              for (; re = (b = p.distcode[I & (1 << p.distbits) - 1]) >>> 16 & 255, de = 65535 & b, !((ie = b >>> 24) <= A); ) {
                 if (F === 0) break e;
-                F--, I += B[U++] << T, T += 8;
+                F--, I += B[U++] << A, A += 8;
               }
               if ((240 & re) == 0) {
-                for (he = ie, be = re, ve = de; re = (b = p.distcode[ve + ((I & (1 << he + be) - 1) >> he)]) >>> 16 & 255, de = 65535 & b, !(he + (ie = b >>> 24) <= T); ) {
+                for (he = ie, be = re, ve = de; re = (b = p.distcode[ve + ((I & (1 << he + be) - 1) >> he)]) >>> 16 & 255, de = 65535 & b, !(he + (ie = b >>> 24) <= A); ) {
                   if (F === 0) break e;
-                  F--, I += B[U++] << T, T += 8;
+                  F--, I += B[U++] << A, A += 8;
                 }
-                I >>>= he, T -= he, p.back += he;
+                I >>>= he, A -= he, p.back += he;
               }
-              if (I >>>= ie, T -= ie, p.back += ie, 64 & re) {
+              if (I >>>= ie, A -= ie, p.back += ie, 64 & re) {
                 k.msg = "invalid distance code", p.mode = 30;
                 break;
               }
               p.offset = de, p.extra = 15 & re, p.mode = 24;
             case 24:
               if (p.extra) {
-                for (x = p.extra; T < x; ) {
+                for (x = p.extra; A < x; ) {
                   if (F === 0) break e;
-                  F--, I += B[U++] << T, T += 8;
+                  F--, I += B[U++] << A, A += 8;
                 }
-                p.offset += I & (1 << p.extra) - 1, I >>>= p.extra, T -= p.extra, p.back += p.extra;
+                p.offset += I & (1 << p.extra) - 1, I >>>= p.extra, A -= p.extra, p.back += p.extra;
               }
               if (p.offset > p.dmax) {
                 k.msg = "invalid distance too far back", p.mode = 30;
@@ -2004,28 +2028,28 @@ function jt() {
               break;
             case 27:
               if (p.wrap) {
-                for (; T < 32; ) {
+                for (; A < 32; ) {
                   if (F === 0) break e;
-                  F--, I |= B[U++] << T, T += 8;
+                  F--, I |= B[U++] << A, A += 8;
                 }
                 if ($ -= Q, k.total_out += $, p.total += $, $ && (k.adler = p.check = p.flags ? o(p.check, ee, $, te - $) : r(p.check, ee, $, te - $)), $ = Q, (p.flags ? I : m(I)) !== p.check) {
                   k.msg = "incorrect data check", p.mode = 30;
                   break;
                 }
-                T = I = 0;
+                A = I = 0;
               }
               p.mode = 28;
             case 28:
               if (p.wrap && p.flags) {
-                for (; T < 32; ) {
+                for (; A < 32; ) {
                   if (F === 0) break e;
-                  F--, I += B[U++] << T, T += 8;
+                  F--, I += B[U++] << A, A += 8;
                 }
                 if (I !== (4294967295 & p.total)) {
                   k.msg = "incorrect length check", p.mode = 30;
                   break;
                 }
-                T = I = 0;
+                A = I = 0;
               }
               p.mode = 29;
             case 29:
@@ -2040,7 +2064,7 @@ function jt() {
             default:
               return d;
           }
-          return k.next_out = te, k.avail_out = Q, k.next_in = U, k.avail_in = F, p.hold = I, p.bits = T, (p.wsize || $ !== k.avail_out && p.mode < 30 && (p.mode < 27 || z !== 4)) && q(k, k.output, k.next_out, $ - k.avail_out) ? (p.mode = 31, -4) : (J -= k.avail_in, $ -= k.avail_out, k.total_in += J, k.total_out += $, p.total += $, p.wrap && $ && (k.adler = p.check = p.flags ? o(p.check, ee, $, k.next_out - $) : r(p.check, ee, $, k.next_out - $)), k.data_type = p.bits + (p.last ? 64 : 0) + (p.mode === 12 ? 128 : 0) + (p.mode === 20 || p.mode === 15 ? 256 : 0), (J == 0 && $ === 0 || z === 4) && R === v && (R = -5), R);
+          return k.next_out = te, k.avail_out = Q, k.next_in = U, k.avail_in = F, p.hold = I, p.bits = A, (p.wsize || $ !== k.avail_out && p.mode < 30 && (p.mode < 27 || z !== 4)) && q(k, k.output, k.next_out, $ - k.avail_out) ? (p.mode = 31, -4) : (J -= k.avail_in, $ -= k.avail_out, k.total_in += J, k.total_out += $, p.total += $, p.wrap && $ && (k.adler = p.check = p.flags ? o(p.check, ee, $, k.next_out - $) : r(p.check, ee, $, k.next_out - $)), k.data_type = p.bits + (p.last ? 64 : 0) + (p.mode === 12 ? 128 : 0) + (p.mode === 20 || p.mode === 15 ? 256 : 0), (J == 0 && $ === 0 || z === 4) && R === v && (R = -5), R);
         }, n.inflateEnd = function(k) {
           if (!k || !k.state) return d;
           var z = k.state;
@@ -2055,7 +2079,7 @@ function jt() {
       }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(t, i, n) {
         var s = t("../utils/common"), r = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0], 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], h = [16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64];
         i.exports = function(u, g, v, d, y, l, f, m) {
-          var w, M, E, _, N, P, j, D, H, q = m.bits, k = 0, z = 0, p = 0, B = 0, ee = 0, U = 0, te = 0, F = 0, Q = 0, I = 0, T = null, J = 0, $ = new s.Buf16(16), Z = new s.Buf16(16), le = null, ue = 0;
+          var w, M, E, _, N, P, j, D, H, q = m.bits, k = 0, z = 0, p = 0, B = 0, ee = 0, U = 0, te = 0, F = 0, Q = 0, I = 0, A = null, J = 0, $ = new s.Buf16(16), Z = new s.Buf16(16), le = null, ue = 0;
           for (k = 0; k <= 15; k++) $[k] = 0;
           for (z = 0; z < d; z++) $[g[v + z]]++;
           for (ee = q, B = 15; 1 <= B && $[B] === 0; B--) ;
@@ -2065,9 +2089,9 @@ function jt() {
           if (0 < F && (u === 0 || B !== 1)) return -1;
           for (Z[1] = 0, k = 1; k < 15; k++) Z[k + 1] = Z[k] + $[k];
           for (z = 0; z < d; z++) g[v + z] !== 0 && (f[Z[g[v + z]]++] = z);
-          if (P = u === 0 ? (T = le = f, 19) : u === 1 ? (T = r, J -= 257, le = o, ue -= 257, 256) : (T = a, le = h, -1), k = p, N = l, te = z = I = 0, E = -1, _ = (Q = 1 << (U = ee)) - 1, u === 1 && 852 < Q || u === 2 && 592 < Q) return 1;
+          if (P = u === 0 ? (A = le = f, 19) : u === 1 ? (A = r, J -= 257, le = o, ue -= 257, 256) : (A = a, le = h, -1), k = p, N = l, te = z = I = 0, E = -1, _ = (Q = 1 << (U = ee)) - 1, u === 1 && 852 < Q || u === 2 && 592 < Q) return 1;
           for (; ; ) {
-            for (j = k - te, H = f[z] < P ? (D = 0, f[z]) : f[z] > P ? (D = le[ue + f[z]], T[J + f[z]]) : (D = 96, 0), w = 1 << k - te, p = M = 1 << U; y[N + (I >> te) + (M -= w)] = j << 24 | D << 16 | H | 0, M !== 0; ) ;
+            for (j = k - te, H = f[z] < P ? (D = 0, f[z]) : f[z] > P ? (D = le[ue + f[z]], A[J + f[z]]) : (D = 96, 0), w = 1 << k - te, p = M = 1 << U; y[N + (I >> te) + (M -= w)] = j << 24 | D << 16 | H | 0, M !== 0; ) ;
             for (w = 1 << k - 1; I & w; ) w >>= 1;
             if (w !== 0 ? (I &= w - 1, I += w) : I = 0, z++, --$[k] == 0) {
               if (k === B) break;
@@ -2105,7 +2129,7 @@ function jt() {
         function I(b, C) {
           this.dyn_tree = b, this.max_code = 0, this.stat_desc = C;
         }
-        function T(b) {
+        function A(b) {
           return b < 256 ? z[b] : z[256 + (b >>> 7)];
         }
         function J(b, C) {
@@ -2149,7 +2173,7 @@ function jt() {
         }
         function be(b, C, O) {
           var W, S, V, Y, G = 0;
-          if (b.last_lit !== 0) for (; W = b.pending_buf[b.d_buf + 2 * G] << 8 | b.pending_buf[b.d_buf + 2 * G + 1], S = b.pending_buf[b.l_buf + G], G++, W === 0 ? Z(b, S, C) : (Z(b, (V = p[S]) + g + 1, C), (Y = P[V]) !== 0 && $(b, S -= B[V], Y), Z(b, V = T(--W), O), (Y = j[V]) !== 0 && $(b, W -= F[V], Y)), G < b.last_lit; ) ;
+          if (b.last_lit !== 0) for (; W = b.pending_buf[b.d_buf + 2 * G] << 8 | b.pending_buf[b.d_buf + 2 * G + 1], S = b.pending_buf[b.l_buf + G], G++, W === 0 ? Z(b, S, C) : (Z(b, (V = p[S]) + g + 1, C), (Y = P[V]) !== 0 && $(b, S -= B[V], Y), Z(b, V = A(--W), O), (Y = j[V]) !== 0 && $(b, W -= F[V], Y)), G < b.last_lit; ) ;
           Z(b, M, C);
         }
         function ve(b, C) {
@@ -2222,7 +2246,7 @@ function jt() {
             R(G, G.dyn_ltree, K - 1), R(G, G.dyn_dtree, oe - 1);
           })(b, b.l_desc.max_code + 1, b.d_desc.max_code + 1, Y + 1), be(b, b.dyn_ltree, b.dyn_dtree)), ie(b), W && re(b);
         }, n._tr_tally = function(b, C, O) {
-          return b.pending_buf[b.d_buf + 2 * b.last_lit] = C >>> 8 & 255, b.pending_buf[b.d_buf + 2 * b.last_lit + 1] = 255 & C, b.pending_buf[b.l_buf + b.last_lit] = 255 & O, b.last_lit++, C === 0 ? b.dyn_ltree[2 * O]++ : (b.matches++, C--, b.dyn_ltree[2 * (p[O] + g + 1)]++, b.dyn_dtree[2 * T(C)]++), b.last_lit === b.lit_bufsize - 1;
+          return b.pending_buf[b.d_buf + 2 * b.last_lit] = C >>> 8 & 255, b.pending_buf[b.d_buf + 2 * b.last_lit + 1] = 255 & C, b.pending_buf[b.l_buf + b.last_lit] = 255 & O, b.last_lit++, C === 0 ? b.dyn_ltree[2 * O]++ : (b.matches++, C--, b.dyn_ltree[2 * (p[O] + g + 1)]++, b.dyn_dtree[2 * A(C)]++), b.last_lit === b.lit_bufsize - 1;
         }, n._tr_align = function(b) {
           $(b, 2, 3), Z(b, M, q), (function(C) {
             C.bi_valid === 16 ? (J(C, C.bi_buf), C.bi_buf = 0, C.bi_valid = 0) : 8 <= C.bi_valid && (C.pending_buf[C.pending++] = 255 & C.bi_buf, C.bi_buf >>= 8, C.bi_valid -= 8);
@@ -2316,9 +2340,9 @@ var Ut = jt();
 const Ft = /* @__PURE__ */ ht(Ut);
 var je = { exports: {} }, Vt = je.exports, Qe;
 function Ht() {
-  return Qe || (Qe = 1, (function(A, e) {
+  return Qe || (Qe = 1, (function(T, e) {
     (function(t, i) {
-      A.exports = i();
+      T.exports = i();
     })(Vt, function() {
       var t = function() {
         function i(d) {
@@ -2642,7 +2666,7 @@ class ct {
     this.panelUI?.dispose(), this.panelUI = null, this.layerMap.clear();
   }
 }
-var fe = /* @__PURE__ */ ((A) => (A.ModelLoadStart = "model-load-start", A.ModelLoadProgress = "model-load-progress", A.ModelLoaded = "model-loaded", A.ModelLoadError = "model-load-error", A.RenderStart = "render-start", A.RenderEnd = "render-end", A.CameraChanged = "camera-changed", A.CameraReset = "camera-reset", A.SelectionChanged = "selection-changed", A.HoverChanged = "hover-changed", A.EntityClick = "entity-click", A.LayerVisibilityChanged = "layer-visibility-changed", A.LayerColorChanged = "layer-color-changed", A.ViewZoomChanged = "view-zoom-changed", A.ViewPanChanged = "view-pan-changed", A.ToolActivated = "tool-activated", A.ToolDeactivated = "tool-deactivated", A.Error = "error", A.Warning = "warning", A))(fe || {});
+var fe = /* @__PURE__ */ ((T) => (T.ModelLoadStart = "model-load-start", T.ModelLoadProgress = "model-load-progress", T.ModelLoaded = "model-loaded", T.ModelLoadError = "model-load-error", T.RenderStart = "render-start", T.RenderEnd = "render-end", T.CameraChanged = "camera-changed", T.CameraReset = "camera-reset", T.SelectionChanged = "selection-changed", T.HoverChanged = "hover-changed", T.EntityClick = "entity-click", T.LayerVisibilityChanged = "layer-visibility-changed", T.LayerColorChanged = "layer-color-changed", T.ViewZoomChanged = "view-zoom-changed", T.ViewPanChanged = "view-pan-changed", T.ToolActivated = "tool-activated", T.ToolDeactivated = "tool-deactivated", T.Error = "error", T.Warning = "warning", T))(fe || {});
 class Yt {
   listeners = /* @__PURE__ */ new Map();
   onceListeners = /* @__PURE__ */ new Map();
@@ -2755,31 +2779,31 @@ class Yt {
     this.removeAllListeners(), this.listeners.clear(), this.onceListeners.clear(), this.debugMode && console.log("[EventModule2d] Disposed");
   }
 }
-function Ce(A) {
-  return Array.isArray(A) ? new X(A[0] ?? 0, A[1] ?? 0, A[2] ?? 0) : new X(A?.x ?? 0, A?.y ?? 0, A?.z ?? 0);
+function Ce(T) {
+  return Array.isArray(T) ? new X(T[0] ?? 0, T[1] ?? 0, T[2] ?? 0) : new X(T?.x ?? 0, T?.y ?? 0, T?.z ?? 0);
 }
-function Ie(A) {
-  return A ? (A.computeBoundingBox(), {
-    min: A.boundingBox?.min.clone() ?? new X(),
-    max: A.boundingBox?.max.clone() ?? new X()
+function Ie(T) {
+  return T ? (T.computeBoundingBox(), {
+    min: T.boundingBox?.min.clone() ?? new X(),
+    max: T.boundingBox?.max.clone() ?? new X()
   }) : { min: new X(), max: new X() };
 }
-function $e(A, e, t) {
-  const i = new X(A[0] ?? 0, A[1] ?? 0, A[2] ?? 0), n = new gt(0, 0, t ?? 0), s = new X(e[0] ?? 1, e[1] ?? 1, e[2] ?? 1), r = new yt().setFromEuler(n);
+function $e(T, e, t) {
+  const i = new X(T[0] ?? 0, T[1] ?? 0, T[2] ?? 0), n = new gt(0, 0, t ?? 0), s = new X(e[0] ?? 1, e[1] ?? 1, e[2] ?? 1), r = new yt().setFromEuler(n);
   return new Me().compose(i, r, s);
 }
-function Xt(A) {
-  return Array.isArray(A?.transformMatrix) && A.transformMatrix.length === 16 ? new Me().fromArray(A.transformMatrix) : $e(
-    A.position ?? [0, 0, 0],
-    A.scale ?? [1, 1, 1],
-    A.rotation ?? 0
+function Xt(T) {
+  return Array.isArray(T?.transformMatrix) && T.transformMatrix.length === 16 ? new Me().fromArray(T.transformMatrix) : $e(
+    T.position ?? [0, 0, 0],
+    T.scale ?? [1, 1, 1],
+    T.rotation ?? 0
   );
 }
-function dt(A) {
-  if (A.length === 0)
+function dt(T) {
+  if (T.length === 0)
     return { min: new X(), max: new X() };
   const e = new X(Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY), t = new X(Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY);
-  return A.forEach((i) => {
+  return T.forEach((i) => {
     e.x = Math.min(e.x, i.x), e.y = Math.min(e.y, i.y), e.z = Math.min(e.z, i.z), t.x = Math.max(t.x, i.x), t.y = Math.max(t.y, i.y), t.z = Math.max(t.z, i.z);
   }), {
     min: e,
@@ -4669,7 +4693,7 @@ class ei {
     this.clear();
   }
 }
-const ti = "3.9.21", ii = {
+const ti = "3.9.222", ii = {
   version: ti
 }, ni = ii.version, si = `
   varying vec2 vWorldPos;
@@ -6361,7 +6385,7 @@ class gi {
     return !0;
   }
 }
-function yi(A) {
+function yi(T) {
   const e = {
     mouseMoveFrame: null,
     latestMouseMoveEvent: null,
@@ -6383,9 +6407,9 @@ function yi(A) {
   }, e.render = function() {
     e.self && e.self.render != null && e.self.render();
   }, e.active = function() {
-    A.renderer.domElement.addEventListener("mousedown", o), A.renderer.domElement.addEventListener("mouseup", h), A.renderer.domElement.addEventListener("mousemove", a), A.renderer.domElement.addEventListener("touchstart", g, { passive: !1 }), A.renderer.domElement.addEventListener("touchend", d, { passive: !1 }), A.renderer.domElement.addEventListener("touchmove", v, { passive: !1 }), window.addEventListener("keydown", t), window.addEventListener("keyup", i);
+    T.renderer.domElement.addEventListener("mousedown", o), T.renderer.domElement.addEventListener("mouseup", h), T.renderer.domElement.addEventListener("mousemove", a), T.renderer.domElement.addEventListener("touchstart", g, { passive: !1 }), T.renderer.domElement.addEventListener("touchend", d, { passive: !1 }), T.renderer.domElement.addEventListener("touchmove", v, { passive: !1 }), window.addEventListener("keydown", t), window.addEventListener("keyup", i);
   }, e.disActive = function() {
-    A.renderer.domElement.removeEventListener("mousedown", o), A.renderer.domElement.removeEventListener("mouseup", h), A.renderer.domElement.removeEventListener("mousemove", a), A.renderer.domElement.removeEventListener("touchstart", g), A.renderer.domElement.removeEventListener("touchend", d), A.renderer.domElement.removeEventListener("touchmove", v), window.removeEventListener("keydown", t), window.removeEventListener("keyup", i), e.mouseMoveFrame != null && (cancelAnimationFrame(e.mouseMoveFrame), e.mouseMoveFrame = null, e.latestMouseMoveEvent = null);
+    T.renderer.domElement.removeEventListener("mousedown", o), T.renderer.domElement.removeEventListener("mouseup", h), T.renderer.domElement.removeEventListener("mousemove", a), T.renderer.domElement.removeEventListener("touchstart", g), T.renderer.domElement.removeEventListener("touchend", d), T.renderer.domElement.removeEventListener("touchmove", v), window.removeEventListener("keydown", t), window.removeEventListener("keyup", i), e.mouseMoveFrame != null && (cancelAnimationFrame(e.mouseMoveFrame), e.mouseMoveFrame = null, e.latestMouseMoveEvent = null);
   };
   function t(l) {
     (l.keyCode === 8 || l.keyCode === 46) && e.self && e.self.handelKeyDeleteDown != null && e.self.handelKeyDeleteDown(), l.keyCode === 27 && e.self && e.self.handelKeyEscDown != null && e.self.handelKeyEscDown(), l.keyCode === 13 && e.self && e.self.handelKeyEnterDown != null && e.self.handelKeyEnterDown(), l.keyCode === 32 && e.self && e.self.handelKeySpaceDown != null && e.self.handelKeySpaceDown(), l.key === "Control" && e.self && e.self.handelKeyCtrlDown != null && e.self.handelKeyCtrlDown(), l.key === "Delete" && e.self && e.self.handelKeyDeleteDown != null && e.self.handelKeyDeleteDown(), l.key === "Shift" && e.self && e.self.handelKeyShiftDown != null && e.self.handelKeyShiftDown(), l.key === "Meta" && e.self && e.self.handelKeyMetaDown != null && e.self.handelKeyMetaDown();
@@ -6394,12 +6418,12 @@ function yi(A) {
     l.key === "Alt" && e.self && e.self.handelKeyAltUp != null && e.self.handelKeyAltUp(), l.key === "Tab" && e.self && e.self.handelKeyTabUp != null && e.self.handelKeyTabUp(), l.key === "Control" && e.self && e.self.handelKeyCtrlUp != null && e.self.handelKeyCtrlUp(), l.key === "Shift" && e.self && e.self.handelKeyShiftUp != null && e.self.handelKeyShiftUp(), l.key === "Meta" && e.self && e.self.handelKeyMetaUp != null && e.self.handelKeyMetaUp(), l.key === "Command" && e.self && e.self.handelKeyCommandUp != null && e.self.handelKeyCommandUp(), l.key === "Windows" && e.self && e.self.handelKeyWindowsUp != null && e.self.handelKeyWindowsUp();
   }
   function n(l) {
-    const f = new se(), m = A.renderer.domElement.clientWidth, w = A.renderer.domElement.clientHeight;
+    const f = new se(), m = T.renderer.domElement.clientWidth, w = T.renderer.domElement.clientHeight;
     return f.x = l.offsetX / m * 2 - 1, f.y = -(l.offsetY / w) * 2 + 1, f;
   }
   function s(l) {
     const f = new Bt(), m = n(l);
-    return f.setFromCamera(m, A.camera), f;
+    return f.setFromCamera(m, T.camera), f;
   }
   function r(l, f = !1) {
     const m = s(l);
@@ -6409,7 +6433,7 @@ function yi(A) {
     }
   }
   function o(l) {
-    l.button === 0 && (e.mouseDownTime = Date.now(), e.mouseDownPosition = new X(l.offsetX, l.offsetY, 0), e.self && e.self.handleMouseDown != null && (A.engineStatus.isFree = !0, r(l, !0), l.catch != null && A.controlModule.orbitControls.origin.set(l.catch.point.x, l.catch.point.y, l.catch.point.z), e.self.handleMouseDown(l)));
+    l.button === 0 && (e.mouseDownTime = Date.now(), e.mouseDownPosition = new X(l.offsetX, l.offsetY, 0), e.self && e.self.handleMouseDown != null && (T.engineStatus.isFree = !0, r(l, !0), l.catch != null && T.controlModule.orbitControls.origin.set(l.catch.point.x, l.catch.point.y, l.catch.point.z), e.self.handleMouseDown(l)));
   }
   function a(l) {
     e.latestMouseMoveEvent = l, e.mouseMoveFrame == null && (e.mouseMoveFrame = requestAnimationFrame(() => {
@@ -6429,7 +6453,7 @@ function yi(A) {
     const f = l.touches[0] || l.changedTouches[0];
     if (!f)
       return null;
-    const w = A.renderer.domElement.getBoundingClientRect(), M = f.clientX - w.left, E = f.clientY - w.top;
+    const w = T.renderer.domElement.getBoundingClientRect(), M = f.clientX - w.left, E = f.clientY - w.top;
     return {
       offsetX: M,
       offsetY: E,
@@ -6461,9 +6485,9 @@ function yi(A) {
     f && h(f);
   }
   function y(l, f) {
-    if (A.isModelSpaceActive?.() === !1 && A.isElementLink2d3dEnabled?.() !== !0)
+    if (T.isModelSpaceActive?.() === !1 && T.isElementLink2d3dEnabled?.() !== !0)
       return null;
-    var m = A.octreeBox2d.pick2d(l, f);
+    var m = T.octreeBox2d.pick2d(l, f);
     return m == null ? null : {
       point: null,
       id: m
@@ -6490,7 +6514,7 @@ class vi {
     this.el.parentElement?.removeChild(this.el);
   }
 }
-var ut = /* @__PURE__ */ ((A) => (A.ModelLoadStart = "model-load-start", A.ModelLoadProgress = "model-load-progress", A.ModelLoaded = "model-loaded", A.ModelError = "model-error", A.SelectionChanged = "selection-changed", A.HoverChanged = "hover-changed", A.Click = "click", A.MouseMove = "mouse-move", A.CameraChanged = "camera-changed", A.CameraIdle = "camera-idle", A.EngineFree = "engine-free", A.EngineBusy = "engine-busy", A.MeasureChanged = "measure-changed", A.MeasureClick = "measure-click", A.SectionMove = "section-move", A))(ut || {});
+var ut = /* @__PURE__ */ ((T) => (T.ModelLoadStart = "model-load-start", T.ModelLoadProgress = "model-load-progress", T.ModelLoaded = "model-loaded", T.ModelError = "model-error", T.SelectionChanged = "selection-changed", T.HoverChanged = "hover-changed", T.Click = "click", T.MouseMove = "mouse-move", T.CameraChanged = "camera-changed", T.CameraIdle = "camera-idle", T.EngineFree = "engine-free", T.EngineBusy = "engine-busy", T.MeasureChanged = "measure-changed", T.MeasureClick = "measure-click", T.SectionMove = "section-move", T))(ut || {});
 class wi {
   engine;
   behavior;
@@ -8423,7 +8447,7 @@ class Wi {
     console.log("[EngineKernel2d] Disposing engine..."), this.stopRendering(), this.cadCursorUI?.dispose(), this.contextMenuUI?.dispose(), this.loadingUI?.dispose(), this.workspaceTabsUI?.dispose(), this.versionEl?.parentElement?.removeChild(this.versionEl), this.searchManager?.dispose(), this.measure?.dispose(), this.markup?.dispose(), this.label?.dispose(), this.themeManager?.dispose(), this.loaderModule2d?.dispose(), this.controlModule2d?.dispose(), this.renderModule2d?.dispose(), this.cameraModule2d?.dispose(), this.sceneModule2d?.dispose(), this.events?.dispose(), this.stats?.dom?.parentElement && this.stats.dom.parentElement.removeChild(this.stats.dom), this.scene = null, this.camera = null, this.renderer = null, this.dwgData = null, this.stats = void 0, this.versionEl = null, console.log("[EngineKernel2d] Engine disposed");
   }
 }
-const Vi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Hi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   EngineKernel2d: Wi
 }, Symbol.toStringTag, { value: "Module" }));
@@ -8433,6 +8457,7 @@ export {
   ei as L,
   Zt as S,
   Vi as a,
+  Hi as b,
   Oe as c,
   ht as g
 };