@vctrl/hooks 0.3.1 → 0.4.0

package/use-export-model.es.js

@@ -1,6 +1,10 @@
-import { c as mt, g as Rt, G as Tt } from "./_commonjsHelpers-CT5_WOk_.js";
-function wt(et) {
-  throw new Error('Could not dynamically require "' + et + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+import { G as Rt } from "./GLTFExporter-Q5UJ5eb1.js";
+var mt = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function Tt($) {
+  return $ && $.__esModule && Object.prototype.hasOwnProperty.call($, "default") ? $.default : $;
+}
+function wt($) {
+  throw new Error('Could not dynamically require "' + $ + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
 var Et = { exports: {} };
 /*!
@@ -14,9 +18,9 @@ Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/js
 JSZip uses the library pako released under the MIT license :
 https://github.com/nodeca/pako/blob/main/LICENSE
 */
-(function(et, ot) {
+(function($, ot) {
   (function(g) {
-    et.exports = g();
+    $.exports = g();
   })(function() {
     return function g(I, w, s) {
       function o(c, v) {
@@ -129,15 +133,15 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return l;
       }
       function o(i, d, r, l, a, p) {
-        var y, S, x = i.file, F = i.compression, B = p !== c.utf8encode, P = n.transformTo("string", p(x.name)), O = n.transformTo("string", c.utf8encode(x.name)), W = x.comment, q = n.transformTo("string", p(W)), b = n.transformTo("string", c.utf8encode(W)), R = O.length !== x.name.length, e = b.length !== W.length, D = "", J = "", L = "", $ = x.dir, j = x.date, V = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+        var y, S, x = i.file, F = i.compression, B = p !== c.utf8encode, P = n.transformTo("string", p(x.name)), O = n.transformTo("string", c.utf8encode(x.name)), W = x.comment, q = n.transformTo("string", p(W)), b = n.transformTo("string", c.utf8encode(W)), R = O.length !== x.name.length, e = b.length !== W.length, D = "", J = "", L = "", Q = x.dir, j = x.date, V = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
         d && !r || (V.crc32 = i.crc32, V.compressedSize = i.compressedSize, V.uncompressedSize = i.uncompressedSize);
         var A = 0;
         d && (A |= 8), B || !R && !e || (A |= 2048);
         var z = 0, X = 0;
-        $ && (z |= 16), a === "UNIX" ? (X = 798, z |= function(H, it) {
+        Q && (z |= 16), a === "UNIX" ? (X = 798, z |= function(H, it) {
           var ut = H;
           return H || (ut = it ? 16893 : 33204), (65535 & ut) << 16;
-        }(x.unixPermissions, $)) : (X = 20, z |= function(H) {
+        }(x.unixPermissions, Q)) : (X = 20, z |= function(H) {
           return 63 & (H || 0);
         }(x.dosPermissions)), y = j.getUTCHours(), y <<= 6, y |= j.getUTCMinutes(), y <<= 5, y |= j.getUTCSeconds() / 2, S = j.getUTCFullYear() - 1980, S <<= 4, S |= j.getUTCMonth() + 1, S <<= 5, S |= j.getUTCDate(), R && (J = s(1, 1) + s(v(P), 4) + O, D += "up" + s(J.length, 2) + J), e && (L = s(1, 1) + s(v(q), 4) + b, D += "uc" + s(L.length, 2) + L);
         var G = "";
@@ -1367,7 +1371,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       };
     }, {}], 46: [function(g, I, w) {
       var s, o = g("../utils/common"), n = g("./trees"), u = g("./adler32"), c = g("./crc32"), v = g("./messages"), _ = 0, m = 4, i = 0, d = -2, r = -1, l = 4, a = 2, p = 8, y = 9, S = 286, x = 30, F = 19, B = 2 * S + 1, P = 15, O = 3, W = 258, q = W + O + 1, b = 42, R = 113, e = 1, D = 2, J = 3, L = 4;
-      function $(t, T) {
+      function Q(t, T) {
         return t.msg = v[T], T;
       }
       function j(t) {
@@ -1390,17 +1394,17 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         t.pending_buf[t.pending++] = T >>> 8 & 255, t.pending_buf[t.pending++] = 255 & T;
       }
       function H(t, T) {
-        var C, f, h = t.max_chain_length, k = t.strstart, U = t.prev_length, N = t.nice_match, E = t.strstart > t.w_size - q ? t.strstart - (t.w_size - q) : 0, Z = t.window, K = t.w_mask, M = t.prev, Y = t.strstart + W, nt = Z[k + U - 1], tt = Z[k + U];
+        var C, f, h = t.max_chain_length, k = t.strstart, U = t.prev_length, N = t.nice_match, E = t.strstart > t.w_size - q ? t.strstart - (t.w_size - q) : 0, Z = t.window, K = t.w_mask, M = t.prev, Y = t.strstart + W, nt = Z[k + U - 1], et = Z[k + U];
         t.prev_length >= t.good_match && (h >>= 2), N > t.lookahead && (N = t.lookahead);
         do
-          if (Z[(C = T) + U] === tt && Z[C + U - 1] === nt && Z[C] === Z[k] && Z[++C] === Z[k + 1]) {
+          if (Z[(C = T) + U] === et && Z[C + U - 1] === nt && Z[C] === Z[k] && Z[++C] === Z[k + 1]) {
             k += 2, C++;
             do
               ;
             while (Z[++k] === Z[++C] && Z[++k] === Z[++C] && Z[++k] === Z[++C] && Z[++k] === Z[++C] && Z[++k] === Z[++C] && Z[++k] === Z[++C] && Z[++k] === Z[++C] && Z[++k] === Z[++C] && k < Y);
             if (f = W - (Y - k), k = Y - W, U < f) {
               if (t.match_start = T, N <= (U = f)) break;
-              nt = Z[k + U - 1], tt = Z[k + U];
+              nt = Z[k + U - 1], et = Z[k + U];
             }
           }
         while ((T = M[T & K]) > E && --h != 0);
@@ -1433,7 +1437,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         }
         return t.insert = t.strstart < O - 1 ? t.strstart : O - 1, T === m ? (z(t, !0), t.strm.avail_out === 0 ? J : L) : t.last_lit && (z(t, !1), t.strm.avail_out === 0) ? e : D;
       }
-      function Q(t, T) {
+      function tt(t, T) {
         for (var C, f, h; ; ) {
           if (t.lookahead < q) {
             if (it(t), t.lookahead < q && T === _) return e;
@@ -1456,7 +1460,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       }
       function at(t) {
         var T;
-        return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = a, (T = t.state).pending = 0, T.pending_out = 0, T.wrap < 0 && (T.wrap = -T.wrap), T.status = T.wrap ? b : R, t.adler = T.wrap === 2 ? 0 : 1, T.last_flush = _, n._tr_init(T), i) : $(t, d);
+        return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = a, (T = t.state).pending = 0, T.pending_out = 0, T.wrap < 0 && (T.wrap = -T.wrap), T.status = T.wrap ? b : R, t.adler = T.wrap === 2 ? 0 : 1, T.last_flush = _, n._tr_init(T), i) : Q(t, d);
       }
       function ct(t) {
         var T = at(t);
@@ -1467,7 +1471,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       function ft(t, T, C, f, h, k) {
         if (!t) return d;
         var U = 1;
-        if (T === r && (T = 6), f < 0 ? (U = 0, f = -f) : 15 < f && (U = 2, f -= 16), h < 1 || y < h || C !== p || f < 8 || 15 < f || T < 0 || 9 < T || k < 0 || l < k) return $(t, d);
+        if (T === r && (T = 6), f < 0 ? (U = 0, f = -f) : 15 < f && (U = 2, f -= 16), h < 1 || y < h || C !== p || f < 8 || 15 < f || T < 0 || 9 < T || k < 0 || l < k) return Q(t, d);
         f === 8 && (f = 9);
         var N = new ht();
         return (t.state = N).strm = t, N.wrap = U, N.gzhead = null, N.w_bits = f, N.w_size = 1 << N.w_bits, N.w_mask = N.w_size - 1, N.hash_bits = h + 7, N.hash_size = 1 << N.hash_bits, N.hash_mask = N.hash_size - 1, N.hash_shift = ~~((N.hash_bits + O - 1) / O), N.window = new o.Buf8(2 * N.w_size), N.head = new o.Buf16(N.hash_size), N.prev = new o.Buf16(N.w_size), N.lit_bufsize = 1 << h + 6, N.pending_buf_size = 4 * N.lit_bufsize, N.pending_buf = new o.Buf8(N.pending_buf_size), N.d_buf = 1 * N.lit_bufsize, N.l_buf = 3 * N.lit_bufsize, N.level = T, N.strategy = k, N.method = C, ct(t);
@@ -1484,14 +1488,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           if ((t.strstart === 0 || t.strstart >= f) && (t.lookahead = t.strstart - f, t.strstart = f, z(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - q && (z(t, !1), t.strm.avail_out === 0)) return e;
         }
         return t.insert = 0, T === m ? (z(t, !0), t.strm.avail_out === 0 ? J : L) : (t.strstart > t.block_start && (z(t, !1), t.strm.avail_out), e);
-      }), new rt(4, 4, 8, 4, ut), new rt(4, 5, 16, 8, ut), new rt(4, 6, 32, 32, ut), new rt(4, 4, 16, 16, Q), new rt(8, 16, 32, 32, Q), new rt(8, 16, 128, 128, Q), new rt(8, 32, 128, 256, Q), new rt(32, 128, 258, 1024, Q), new rt(32, 258, 258, 4096, Q)], w.deflateInit = function(t, T) {
+      }), new rt(4, 4, 8, 4, ut), new rt(4, 5, 16, 8, ut), new rt(4, 6, 32, 32, ut), new rt(4, 4, 16, 16, tt), new rt(8, 16, 32, 32, tt), new rt(8, 16, 128, 128, tt), new rt(8, 32, 128, 256, tt), new rt(32, 128, 258, 1024, tt), new rt(32, 258, 258, 4096, tt)], w.deflateInit = function(t, T) {
         return ft(t, T, p, 15, 8, 0);
       }, w.deflateInit2 = ft, w.deflateReset = ct, w.deflateResetKeep = at, w.deflateSetHeader = function(t, T) {
         return t && t.state ? t.state.wrap !== 2 ? d : (t.state.gzhead = T, i) : d;
       }, w.deflate = function(t, T) {
         var C, f, h, k;
-        if (!t || !t.state || 5 < T || T < 0) return t ? $(t, d) : d;
-        if (f = t.state, !t.output || !t.input && t.avail_in !== 0 || f.status === 666 && T !== m) return $(t, t.avail_out === 0 ? -5 : d);
+        if (!t || !t.state || 5 < T || T < 0) return t ? Q(t, d) : d;
+        if (f = t.state, !t.output || !t.input && t.avail_in !== 0 || f.status === 666 && T !== m) return Q(t, t.avail_out === 0 ? -5 : d);
         if (f.strm = t, C = f.last_flush, f.last_flush = T, f.status === b) if (f.wrap === 2) t.adler = 0, X(f, 31), X(f, 139), X(f, 8), f.gzhead ? (X(f, (f.gzhead.text ? 1 : 0) + (f.gzhead.hcrc ? 2 : 0) + (f.gzhead.extra ? 4 : 0) + (f.gzhead.name ? 8 : 0) + (f.gzhead.comment ? 16 : 0)), X(f, 255 & f.gzhead.time), X(f, f.gzhead.time >> 8 & 255), X(f, f.gzhead.time >> 16 & 255), X(f, f.gzhead.time >> 24 & 255), X(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), X(f, 255 & f.gzhead.os), f.gzhead.extra && f.gzhead.extra.length && (X(f, 255 & f.gzhead.extra.length), X(f, f.gzhead.extra.length >> 8 & 255)), f.gzhead.hcrc && (t.adler = c(t.adler, f.pending_buf, f.pending, 0)), f.gzindex = 0, f.status = 69) : (X(f, 0), X(f, 0), X(f, 0), X(f, 0), X(f, 0), X(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), X(f, 3), f.status = R);
         else {
           var U = p + (f.w_bits - 8 << 4) << 8;
@@ -1525,8 +1529,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         } else f.status = 103;
         if (f.status === 103 && (f.gzhead.hcrc ? (f.pending + 2 > f.pending_buf_size && A(t), f.pending + 2 <= f.pending_buf_size && (X(f, 255 & t.adler), X(f, t.adler >> 8 & 255), t.adler = 0, f.status = R)) : f.status = R), f.pending !== 0) {
           if (A(t), t.avail_out === 0) return f.last_flush = -1, i;
-        } else if (t.avail_in === 0 && j(T) <= j(C) && T !== m) return $(t, -5);
-        if (f.status === 666 && t.avail_in !== 0) return $(t, -5);
+        } else if (t.avail_in === 0 && j(T) <= j(C) && T !== m) return Q(t, -5);
+        if (f.status === 666 && t.avail_in !== 0) return Q(t, -5);
         if (t.avail_in !== 0 || f.lookahead !== 0 || T !== _ && f.status !== 666) {
           var N = f.strategy === 2 ? function(E, Z) {
             for (var K; ; ) {
@@ -1538,16 +1542,16 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             }
             return E.insert = 0, Z === m ? (z(E, !0), E.strm.avail_out === 0 ? J : L) : E.last_lit && (z(E, !1), E.strm.avail_out === 0) ? e : D;
           }(f, T) : f.strategy === 3 ? function(E, Z) {
-            for (var K, M, Y, nt, tt = E.window; ; ) {
+            for (var K, M, Y, nt, et = E.window; ; ) {
               if (E.lookahead <= W) {
                 if (it(E), E.lookahead <= W && Z === _) return e;
                 if (E.lookahead === 0) break;
               }
-              if (E.match_length = 0, E.lookahead >= O && 0 < E.strstart && (M = tt[Y = E.strstart - 1]) === tt[++Y] && M === tt[++Y] && M === tt[++Y]) {
+              if (E.match_length = 0, E.lookahead >= O && 0 < E.strstart && (M = et[Y = E.strstart - 1]) === et[++Y] && M === et[++Y] && M === et[++Y]) {
                 nt = E.strstart + W;
                 do
                   ;
-                while (M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && Y < nt);
+                while (M === et[++Y] && M === et[++Y] && M === et[++Y] && M === et[++Y] && M === et[++Y] && M === et[++Y] && M === et[++Y] && M === et[++Y] && Y < nt);
                 E.match_length = W - (nt - Y), E.match_length > E.lookahead && (E.match_length = E.lookahead);
               }
               if (E.match_length >= O ? (K = n._tr_tally(E, 1, E.match_length - O), E.lookahead -= E.match_length, E.strstart += E.match_length, E.match_length = 0) : (K = n._tr_tally(E, 0, E.window[E.strstart]), E.lookahead--, E.strstart++), K && (z(E, !1), E.strm.avail_out === 0)) return e;
@@ -1560,7 +1564,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return T !== m ? i : f.wrap <= 0 ? 1 : (f.wrap === 2 ? (X(f, 255 & t.adler), X(f, t.adler >> 8 & 255), X(f, t.adler >> 16 & 255), X(f, t.adler >> 24 & 255), X(f, 255 & t.total_in), X(f, t.total_in >> 8 & 255), X(f, t.total_in >> 16 & 255), X(f, t.total_in >> 24 & 255)) : (G(f, t.adler >>> 16), G(f, 65535 & t.adler)), A(t), 0 < f.wrap && (f.wrap = -f.wrap), f.pending !== 0 ? i : 1);
       }, w.deflateEnd = function(t) {
         var T;
-        return t && t.state ? (T = t.state.status) !== b && T !== 69 && T !== 73 && T !== 91 && T !== 103 && T !== R && T !== 666 ? $(t, d) : (t.state = null, T === R ? $(t, -3) : i) : d;
+        return t && t.state ? (T = t.state.status) !== b && T !== 69 && T !== 73 && T !== 91 && T !== 103 && T !== R && T !== 666 ? Q(t, d) : (t.state = null, T === R ? Q(t, -3) : i) : d;
       }, w.deflateSetDictionary = function(t, T) {
         var C, f, h, k, U, N, E, Z, K = T.length;
         if (!t || !t.state || (k = (C = t.state).wrap) === 2 || k === 1 && C.status !== b || C.lookahead) return d;
@@ -1689,9 +1693,9 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       w.inflateReset = S, w.inflateReset2 = x, w.inflateResetKeep = y, w.inflateInit = function(b) {
         return F(b, 15);
       }, w.inflateInit2 = F, w.inflate = function(b, R) {
-        var e, D, J, L, $, j, V, A, z, X, G, H, it, ut, Q, rt, ht, at, ct, ft, t, T, C, f, h = 0, k = new s.Buf8(4), U = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+        var e, D, J, L, Q, j, V, A, z, X, G, H, it, ut, tt, rt, ht, at, ct, ft, t, T, C, f, h = 0, k = new s.Buf8(4), U = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
         if (!b || !b.state || !b.output || !b.input && b.avail_in !== 0) return i;
-        (e = b.state).mode === 12 && (e.mode = 13), $ = b.next_out, J = b.output, V = b.avail_out, L = b.next_in, D = b.input, j = b.avail_in, A = e.hold, z = e.bits, X = j, G = V, T = m;
+        (e = b.state).mode === 12 && (e.mode = 13), Q = b.next_out, J = b.output, V = b.avail_out, L = b.next_in, D = b.input, j = b.avail_in, A = e.hold, z = e.bits, X = j, G = V, T = m;
         t: for (; ; ) switch (e.mode) {
           case d:
             if (e.wrap === 0) {
@@ -1794,7 +1798,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             }
             b.adler = e.check = a(A), z = A = 0, e.mode = 11;
           case 11:
-            if (e.havedict === 0) return b.next_out = $, b.avail_out = V, b.next_in = L, b.avail_in = j, e.hold = A, e.bits = z, 2;
+            if (e.havedict === 0) return b.next_out = Q, b.avail_out = V, b.next_in = L, b.avail_in = j, e.hold = A, e.bits = z, 2;
             b.adler = e.check = 1, e.mode = 12;
           case 12:
             if (R === 5 || R === 6) break t;
@@ -1838,7 +1842,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           case 16:
             if (H = e.length) {
               if (j < H && (H = j), V < H && (H = V), H === 0) break t;
-              s.arraySet(J, D, L, H, $), j -= H, L += H, V -= H, $ += H, e.length -= H;
+              s.arraySet(J, D, L, H, Q), j -= H, L += H, V -= H, Q += H, e.length -= H;
               break;
             }
             e.mode = 12;
@@ -1869,34 +1873,34 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             e.have = 0, e.mode = 19;
           case 19:
             for (; e.have < e.nlen + e.ndist; ) {
-              for (; rt = (h = e.lencode[A & (1 << e.lenbits) - 1]) >>> 16 & 255, ht = 65535 & h, !((Q = h >>> 24) <= z); ) {
+              for (; rt = (h = e.lencode[A & (1 << e.lenbits) - 1]) >>> 16 & 255, ht = 65535 & h, !((tt = h >>> 24) <= z); ) {
                 if (j === 0) break t;
                 j--, A += D[L++] << z, z += 8;
               }
-              if (ht < 16) A >>>= Q, z -= Q, e.lens[e.have++] = ht;
+              if (ht < 16) A >>>= tt, z -= tt, e.lens[e.have++] = ht;
               else {
                 if (ht === 16) {
-                  for (f = Q + 2; z < f; ) {
+                  for (f = tt + 2; z < f; ) {
                     if (j === 0) break t;
                     j--, A += D[L++] << z, z += 8;
                   }
-                  if (A >>>= Q, z -= Q, e.have === 0) {
+                  if (A >>>= tt, z -= tt, e.have === 0) {
                     b.msg = "invalid bit length repeat", e.mode = 30;
                     break;
                   }
                   t = e.lens[e.have - 1], H = 3 + (3 & A), A >>>= 2, z -= 2;
                 } else if (ht === 17) {
-                  for (f = Q + 3; z < f; ) {
+                  for (f = tt + 3; z < f; ) {
                     if (j === 0) break t;
                     j--, A += D[L++] << z, z += 8;
                   }
-                  z -= Q, t = 0, H = 3 + (7 & (A >>>= Q)), A >>>= 3, z -= 3;
+                  z -= tt, t = 0, H = 3 + (7 & (A >>>= tt)), A >>>= 3, z -= 3;
                 } else {
-                  for (f = Q + 7; z < f; ) {
+                  for (f = tt + 7; z < f; ) {
                     if (j === 0) break t;
                     j--, A += D[L++] << z, z += 8;
                   }
-                  z -= Q, t = 0, H = 11 + (127 & (A >>>= Q)), A >>>= 7, z -= 7;
+                  z -= tt, t = 0, H = 11 + (127 & (A >>>= tt)), A >>>= 7, z -= 7;
                 }
                 if (e.have + H > e.nlen + e.ndist) {
                   b.msg = "invalid bit length repeat", e.mode = 30;
@@ -1923,21 +1927,21 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             e.mode = 21;
           case 21:
             if (6 <= j && 258 <= V) {
-              b.next_out = $, b.avail_out = V, b.next_in = L, b.avail_in = j, e.hold = A, e.bits = z, u(b, G), $ = b.next_out, J = b.output, V = b.avail_out, L = b.next_in, D = b.input, j = b.avail_in, A = e.hold, z = e.bits, e.mode === 12 && (e.back = -1);
+              b.next_out = Q, b.avail_out = V, b.next_in = L, b.avail_in = j, e.hold = A, e.bits = z, u(b, G), Q = b.next_out, J = b.output, V = b.avail_out, L = b.next_in, D = b.input, j = b.avail_in, A = e.hold, z = e.bits, e.mode === 12 && (e.back = -1);
               break;
             }
-            for (e.back = 0; rt = (h = e.lencode[A & (1 << e.lenbits) - 1]) >>> 16 & 255, ht = 65535 & h, !((Q = h >>> 24) <= z); ) {
+            for (e.back = 0; rt = (h = e.lencode[A & (1 << e.lenbits) - 1]) >>> 16 & 255, ht = 65535 & h, !((tt = h >>> 24) <= z); ) {
               if (j === 0) break t;
               j--, A += D[L++] << z, z += 8;
             }
             if (rt && !(240 & rt)) {
-              for (at = Q, ct = rt, ft = ht; rt = (h = e.lencode[ft + ((A & (1 << at + ct) - 1) >> at)]) >>> 16 & 255, ht = 65535 & h, !(at + (Q = h >>> 24) <= z); ) {
+              for (at = tt, ct = rt, ft = ht; rt = (h = e.lencode[ft + ((A & (1 << at + ct) - 1) >> at)]) >>> 16 & 255, ht = 65535 & h, !(at + (tt = h >>> 24) <= z); ) {
                 if (j === 0) break t;
                 j--, A += D[L++] << z, z += 8;
               }
               A >>>= at, z -= at, e.back += at;
             }
-            if (A >>>= Q, z -= Q, e.back += Q, e.length = ht, rt === 0) {
+            if (A >>>= tt, z -= tt, e.back += tt, e.length = ht, rt === 0) {
               e.mode = 26;
               break;
             }
@@ -1960,18 +1964,18 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             }
             e.was = e.length, e.mode = 23;
           case 23:
-            for (; rt = (h = e.distcode[A & (1 << e.distbits) - 1]) >>> 16 & 255, ht = 65535 & h, !((Q = h >>> 24) <= z); ) {
+            for (; rt = (h = e.distcode[A & (1 << e.distbits) - 1]) >>> 16 & 255, ht = 65535 & h, !((tt = h >>> 24) <= z); ) {
               if (j === 0) break t;
               j--, A += D[L++] << z, z += 8;
             }
             if (!(240 & rt)) {
-              for (at = Q, ct = rt, ft = ht; rt = (h = e.distcode[ft + ((A & (1 << at + ct) - 1) >> at)]) >>> 16 & 255, ht = 65535 & h, !(at + (Q = h >>> 24) <= z); ) {
+              for (at = tt, ct = rt, ft = ht; rt = (h = e.distcode[ft + ((A & (1 << at + ct) - 1) >> at)]) >>> 16 & 255, ht = 65535 & h, !(at + (tt = h >>> 24) <= z); ) {
                 if (j === 0) break t;
                 j--, A += D[L++] << z, z += 8;
               }
               A >>>= at, z -= at, e.back += at;
             }
-            if (A >>>= Q, z -= Q, e.back += Q, 64 & rt) {
+            if (A >>>= tt, z -= tt, e.back += tt, 64 & rt) {
               b.msg = "invalid distance code", e.mode = 30;
               break;
             }
@@ -1997,13 +2001,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 break;
               }
               it = H > e.wnext ? (H -= e.wnext, e.wsize - H) : e.wnext - H, H > e.length && (H = e.length), ut = e.window;
-            } else ut = J, it = $ - e.offset, H = e.length;
-            for (V < H && (H = V), V -= H, e.length -= H; J[$++] = ut[it++], --H; ) ;
+            } else ut = J, it = Q - e.offset, H = e.length;
+            for (V < H && (H = V), V -= H, e.length -= H; J[Q++] = ut[it++], --H; ) ;
             e.length === 0 && (e.mode = 21);
             break;
           case 26:
             if (V === 0) break t;
-            J[$++] = e.length, V--, e.mode = 21;
+            J[Q++] = e.length, V--, e.mode = 21;
             break;
           case 27:
             if (e.wrap) {
@@ -2011,7 +2015,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 if (j === 0) break t;
                 j--, A |= D[L++] << z, z += 8;
               }
-              if (G -= V, b.total_out += G, e.total += G, G && (b.adler = e.check = e.flags ? n(e.check, J, G, $ - G) : o(e.check, J, G, $ - G)), G = V, (e.flags ? A : a(A)) !== e.check) {
+              if (G -= V, b.total_out += G, e.total += G, G && (b.adler = e.check = e.flags ? n(e.check, J, G, Q - G) : o(e.check, J, G, Q - G)), G = V, (e.flags ? A : a(A)) !== e.check) {
                 b.msg = "incorrect data check", e.mode = 30;
                 break;
               }
@@ -2043,7 +2047,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           default:
             return i;
         }
-        return b.next_out = $, b.avail_out = V, b.next_in = L, b.avail_in = j, e.hold = A, e.bits = z, (e.wsize || G !== b.avail_out && e.mode < 30 && (e.mode < 27 || R !== 4)) && q(b, b.output, b.next_out, G - b.avail_out) ? (e.mode = 31, -4) : (X -= b.avail_in, G -= b.avail_out, b.total_in += X, b.total_out += G, e.total += G, e.wrap && G && (b.adler = e.check = e.flags ? n(e.check, J, G, b.next_out - G) : o(e.check, J, G, b.next_out - G)), b.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === 12 ? 128 : 0) + (e.mode === 20 || e.mode === 15 ? 256 : 0), (X == 0 && G === 0 || R === 4) && T === m && (T = -5), T);
+        return b.next_out = Q, b.avail_out = V, b.next_in = L, b.avail_in = j, e.hold = A, e.bits = z, (e.wsize || G !== b.avail_out && e.mode < 30 && (e.mode < 27 || R !== 4)) && q(b, b.output, b.next_out, G - b.avail_out) ? (e.mode = 31, -4) : (X -= b.avail_in, G -= b.avail_out, b.total_in += X, b.total_out += G, e.total += G, e.wrap && G && (b.adler = e.check = e.flags ? n(e.check, J, G, b.next_out - G) : o(e.check, J, G, b.next_out - G)), b.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === 12 ? 128 : 0) + (e.mode === 20 || e.mode === 15 ? 256 : 0), (X == 0 && G === 0 || R === 4) && T === m && (T = -5), T);
       }, w.inflateEnd = function(b) {
         if (!b || !b.state) return i;
         var R = b.state;
@@ -2058,7 +2062,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(g, I, w) {
       var s = g("../utils/common"), o = [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], n = [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], u = [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], c = [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(v, _, m, i, d, r, l, a) {
-        var p, y, S, x, F, B, P, O, W, q = a.bits, b = 0, R = 0, e = 0, D = 0, J = 0, L = 0, $ = 0, j = 0, V = 0, A = 0, z = null, X = 0, G = new s.Buf16(16), H = new s.Buf16(16), it = null, ut = 0;
+        var p, y, S, x, F, B, P, O, W, q = a.bits, b = 0, R = 0, e = 0, D = 0, J = 0, L = 0, Q = 0, j = 0, V = 0, A = 0, z = null, X = 0, G = new s.Buf16(16), H = new s.Buf16(16), it = null, ut = 0;
         for (b = 0; b <= 15; b++) G[b] = 0;
         for (R = 0; R < i; R++) G[_[m + R]]++;
         for (J = q, D = 15; 1 <= D && G[D] === 0; D--) ;
@@ -2068,21 +2072,21 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         if (0 < j && (v === 0 || D !== 1)) return -1;
         for (H[1] = 0, b = 1; b < 15; b++) H[b + 1] = H[b] + G[b];
         for (R = 0; R < i; R++) _[m + R] !== 0 && (l[H[_[m + R]]++] = R);
-        if (B = v === 0 ? (z = it = l, 19) : v === 1 ? (z = o, X -= 257, it = n, ut -= 257, 256) : (z = u, it = c, -1), b = e, F = r, $ = R = A = 0, S = -1, x = (V = 1 << (L = J)) - 1, v === 1 && 852 < V || v === 2 && 592 < V) return 1;
+        if (B = v === 0 ? (z = it = l, 19) : v === 1 ? (z = o, X -= 257, it = n, ut -= 257, 256) : (z = u, it = c, -1), b = e, F = r, Q = R = A = 0, S = -1, x = (V = 1 << (L = J)) - 1, v === 1 && 852 < V || v === 2 && 592 < V) return 1;
         for (; ; ) {
-          for (P = b - $, W = l[R] < B ? (O = 0, l[R]) : l[R] > B ? (O = it[ut + l[R]], z[X + l[R]]) : (O = 96, 0), p = 1 << b - $, e = y = 1 << L; d[F + (A >> $) + (y -= p)] = P << 24 | O << 16 | W | 0, y !== 0; ) ;
+          for (P = b - Q, W = l[R] < B ? (O = 0, l[R]) : l[R] > B ? (O = it[ut + l[R]], z[X + l[R]]) : (O = 96, 0), p = 1 << b - Q, e = y = 1 << L; d[F + (A >> Q) + (y -= p)] = P << 24 | O << 16 | W | 0, y !== 0; ) ;
           for (p = 1 << b - 1; A & p; ) p >>= 1;
           if (p !== 0 ? (A &= p - 1, A += p) : A = 0, R++, --G[b] == 0) {
             if (b === D) break;
             b = _[m + l[R]];
           }
           if (J < b && (A & x) !== S) {
-            for ($ === 0 && ($ = J), F += e, j = 1 << (L = b - $); L + $ < D && !((j -= G[L + $]) <= 0); ) L++, j <<= 1;
+            for (Q === 0 && (Q = J), F += e, j = 1 << (L = b - Q); L + Q < D && !((j -= G[L + Q]) <= 0); ) L++, j <<= 1;
             if (V += 1 << L, v === 1 && 852 < V || v === 2 && 592 < V) return 1;
             d[S = A & x] = J << 24 | L << 16 | F - r | 0;
           }
         }
-        return A !== 0 && (d[F + A] = b - $ << 24 | 64 << 16 | 0), a.bits = J, 0;
+        return A !== 0 && (d[F + A] = b - Q << 24 | 64 << 16 | 0), a.bits = J, 0;
       };
     }, { "../utils/common": 41 }], 51: [function(g, I, w) {
       I.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" };
@@ -2101,7 +2105,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       u(e);
       var D = new Array(v);
       u(D);
-      var J, L, $, j = new Array(i);
+      var J, L, Q, j = new Array(i);
       function V(h, k, U, N, E) {
         this.static_tree = h, this.extra_bits = k, this.extra_base = U, this.elems = N, this.max_length = E, this.has_stree = h && h.length;
       }
@@ -2132,7 +2136,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           M !== 0 && (h[2 * E] = it(Z[M]++, M));
         }
       }
-      function Q(h) {
+      function tt(h) {
         var k;
         for (k = 0; k < m; k++) h.dyn_ltree[2 * k] = 0;
         for (k = 0; k < i; k++) h.dyn_dtree[2 * k] = 0;
@@ -2161,16 +2165,16 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         for (; h.heap_len < 2; ) Z[2 * (E = h.heap[++h.heap_len] = nt < 2 ? ++nt : 0)] = 1, h.depth[E] = 0, h.opt_len--, M && (h.static_len -= K[2 * E + 1]);
         for (k.max_code = nt, U = h.heap_len >> 1; 1 <= U; U--) at(h, Z, U);
         for (E = Y; U = h.heap[1], h.heap[1] = h.heap[h.heap_len--], at(h, Z, 1), N = h.heap[1], h.heap[--h.heap_max] = U, h.heap[--h.heap_max] = N, Z[2 * E] = Z[2 * U] + Z[2 * N], h.depth[E] = (h.depth[U] >= h.depth[N] ? h.depth[U] : h.depth[N]) + 1, Z[2 * U + 1] = Z[2 * N + 1] = E, h.heap[1] = E++, at(h, Z, 1), 2 <= h.heap_len; ) ;
-        h.heap[--h.heap_max] = h.heap[1], function(tt, lt) {
+        h.heap[--h.heap_max] = h.heap[1], function(et, lt) {
           var _t, dt, gt, st, bt, kt, pt = lt.dyn_tree, xt = lt.max_code, It = lt.stat_desc.static_tree, Ot = lt.stat_desc.has_stree, Bt = lt.stat_desc.extra_bits, St = lt.stat_desc.extra_base, vt = lt.stat_desc.max_length, yt = 0;
-          for (st = 0; st <= l; st++) tt.bl_count[st] = 0;
-          for (pt[2 * tt.heap[tt.heap_max] + 1] = 0, _t = tt.heap_max + 1; _t < r; _t++) vt < (st = pt[2 * pt[2 * (dt = tt.heap[_t]) + 1] + 1] + 1) && (st = vt, yt++), pt[2 * dt + 1] = st, xt < dt || (tt.bl_count[st]++, bt = 0, St <= dt && (bt = Bt[dt - St]), kt = pt[2 * dt], tt.opt_len += kt * (st + bt), Ot && (tt.static_len += kt * (It[2 * dt + 1] + bt)));
+          for (st = 0; st <= l; st++) et.bl_count[st] = 0;
+          for (pt[2 * et.heap[et.heap_max] + 1] = 0, _t = et.heap_max + 1; _t < r; _t++) vt < (st = pt[2 * pt[2 * (dt = et.heap[_t]) + 1] + 1] + 1) && (st = vt, yt++), pt[2 * dt + 1] = st, xt < dt || (et.bl_count[st]++, bt = 0, St <= dt && (bt = Bt[dt - St]), kt = pt[2 * dt], et.opt_len += kt * (st + bt), Ot && (et.static_len += kt * (It[2 * dt + 1] + bt)));
           if (yt !== 0) {
             do {
-              for (st = vt - 1; tt.bl_count[st] === 0; ) st--;
-              tt.bl_count[st]--, tt.bl_count[st + 1] += 2, tt.bl_count[vt]--, yt -= 2;
+              for (st = vt - 1; et.bl_count[st] === 0; ) st--;
+              et.bl_count[st]--, et.bl_count[st + 1] += 2, et.bl_count[vt]--, yt -= 2;
             } while (0 < yt);
-            for (st = vt; st !== 0; st--) for (dt = tt.bl_count[st]; dt !== 0; ) xt < (gt = tt.heap[--_t]) || (pt[2 * gt + 1] !== st && (tt.opt_len += (st - pt[2 * gt + 1]) * pt[2 * gt], pt[2 * gt + 1] = st), dt--);
+            for (st = vt; st !== 0; st--) for (dt = et.bl_count[st]; dt !== 0; ) xt < (gt = et.heap[--_t]) || (pt[2 * gt + 1] !== st && (et.opt_len += (st - pt[2 * gt + 1]) * pt[2 * gt], pt[2 * gt + 1] = st), dt--);
           }
         }(h, k), ut(Z, nt, h.bl_count);
       }
@@ -2205,8 +2209,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           for (; k <= 279; ) q[2 * k + 1] = 7, k++, K[7]++;
           for (; k <= 287; ) q[2 * k + 1] = 8, k++, K[8]++;
           for (ut(q, m + 1, K), k = 0; k < i; k++) b[2 * k + 1] = 5, b[2 * k] = it(k, 5);
-          J = new V(q, B, _ + 1, m, l), L = new V(b, P, 0, i, l), $ = new V(new Array(0), O, 0, d, p);
-        }(), C = !0), h.l_desc = new A(h.dyn_ltree, J), h.d_desc = new A(h.dyn_dtree, L), h.bl_desc = new A(h.bl_tree, $), h.bi_buf = 0, h.bi_valid = 0, Q(h);
+          J = new V(q, B, _ + 1, m, l), L = new V(b, P, 0, i, l), Q = new V(new Array(0), O, 0, d, p);
+        }(), C = !0), h.l_desc = new A(h.dyn_ltree, J), h.d_desc = new A(h.dyn_dtree, L), h.bl_desc = new A(h.bl_tree, Q), h.bi_buf = 0, h.bi_valid = 0, tt(h);
       }, w._tr_stored_block = f, w._tr_flush_block = function(h, k, U, N) {
         var E, Z, K = 0;
         0 < h.level ? (h.strm.data_type === 2 && (h.strm.data_type = function(M) {
@@ -2219,11 +2223,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           var Y;
           for (t(M, M.dyn_ltree, M.l_desc.max_code), t(M, M.dyn_dtree, M.d_desc.max_code), ft(M, M.bl_desc), Y = d - 1; 3 <= Y && M.bl_tree[2 * W[Y] + 1] === 0; Y--) ;
           return M.opt_len += 3 * (Y + 1) + 5 + 5 + 4, Y;
-        }(h), E = h.opt_len + 3 + 7 >>> 3, (Z = h.static_len + 3 + 7 >>> 3) <= E && (E = Z)) : E = Z = U + 5, U + 4 <= E && k !== -1 ? f(h, k, U, N) : h.strategy === 4 || Z === E ? (G(h, 2 + (N ? 1 : 0), 3), ct(h, q, b)) : (G(h, 4 + (N ? 1 : 0), 3), function(M, Y, nt, tt) {
+        }(h), E = h.opt_len + 3 + 7 >>> 3, (Z = h.static_len + 3 + 7 >>> 3) <= E && (E = Z)) : E = Z = U + 5, U + 4 <= E && k !== -1 ? f(h, k, U, N) : h.strategy === 4 || Z === E ? (G(h, 2 + (N ? 1 : 0), 3), ct(h, q, b)) : (G(h, 4 + (N ? 1 : 0), 3), function(M, Y, nt, et) {
           var lt;
-          for (G(M, Y - 257, 5), G(M, nt - 1, 5), G(M, tt - 4, 4), lt = 0; lt < tt; lt++) G(M, M.bl_tree[2 * W[lt] + 1], 3);
+          for (G(M, Y - 257, 5), G(M, nt - 1, 5), G(M, et - 4, 4), lt = 0; lt < et; lt++) G(M, M.bl_tree[2 * W[lt] + 1], 3);
           T(M, M.dyn_ltree, Y - 1), T(M, M.dyn_dtree, nt - 1);
-        }(h, h.l_desc.max_code + 1, h.d_desc.max_code + 1, K + 1), ct(h, h.dyn_ltree, h.dyn_dtree)), Q(h), N && rt(h);
+        }(h, h.l_desc.max_code + 1, h.d_desc.max_code + 1, K + 1), ct(h, h.dyn_ltree, h.dyn_dtree)), tt(h), N && rt(h);
       }, w._tr_tally = function(h, k, U) {
         return h.pending_buf[h.d_buf + 2 * h.last_lit] = k >>> 8 & 255, h.pending_buf[h.d_buf + 2 * h.last_lit + 1] = 255 & k, h.pending_buf[h.l_buf + h.last_lit] = 255 & U, h.last_lit++, k === 0 ? h.dyn_ltree[2 * U]++ : (h.matches++, k--, h.dyn_ltree[2 * (e[U] + _ + 1)]++, h.dyn_dtree[2 * z(k)]++), h.last_lit === h.lit_bufsize - 1;
       }, w._tr_align = function(h) {
@@ -2315,9 +2319,9 @@ https://github.com/nodeca/pako/blob/main/LICENSE
   });
 })(Et);
 var Dt = Et.exports;
-const Ft = /* @__PURE__ */ Rt(Dt);
+const Ft = /* @__PURE__ */ Tt(Dt);
 var zt = { exports: {} };
-(function(et, ot) {
+(function($, ot) {
   (function(g, I) {
     I();
   })(mt, function() {
@@ -2382,27 +2386,27 @@ var zt = { exports: {} };
         }, 4e4);
       }
     });
-    o.saveAs = u.saveAs = u, et.exports = u;
+    o.saveAs = u.saveAs = u, $.exports = u;
   });
 })(zt);
 var At = zt.exports;
-const Ct = (et) => {
-  const ot = atob(et.split(",")[1]), g = et.split(",")[0].split(":")[1].split(";")[0], I = new ArrayBuffer(ot.length), w = new Uint8Array(I);
+const Ct = ($) => {
+  const ot = atob($.split(",")[1]), g = $.split(",")[0].split(":")[1].split(";")[0], I = new ArrayBuffer(ot.length), w = new Uint8Array(I);
   for (let s = 0; s < ot.length; s++)
     w[s] = ot.charCodeAt(s);
   return new Blob([I], { type: g });
 };
-function Ut(et, ot) {
+function Ut($, ot) {
   var I;
-  const g = (I = et.split(".").pop()) == null ? void 0 : I.split("?")[0];
-  return g && g !== et ? g : ot && ot.split("/").pop() || "png";
+  const g = (I = $.split(".").pop()) == null ? void 0 : I.split("?")[0];
+  return g && g !== $ ? g : ot && ot.split("/").pop() || "png";
 }
-function Nt(et) {
-  return (et == null ? void 0 : et.split(".").shift()) || "scene";
+function Nt($) {
+  return ($ == null ? void 0 : $.split(".").shift()) || "scene";
 }
-const Lt = (et, ot, g) => {
+const Lt = ($, ot, g) => {
   ot.forEach((I, w) => {
-    const s = et[I.source];
+    const s = $[I.source];
     if (!s.uri) return;
     const o = Ut(s.uri, s.mimeType), u = `${I.name || `texture_${w}`}.${o}`;
     if (s.data instanceof ArrayBuffer || s.data instanceof Uint8Array) {
@@ -2414,8 +2418,8 @@ const Lt = (et, ot, g) => {
     } else
       console.warn(`Image at index ${w} has unsupported data format`);
   });
-}, Pt = (et, ot, g) => {
-  et.forEach((I, w) => {
+}, Pt = ($, ot, g) => {
+  $.forEach((I, w) => {
     const s = `${g}.bin`;
     if (I instanceof ArrayBuffer)
       ot.file(s, I, { binary: !0 });
@@ -2427,19 +2431,19 @@ const Lt = (et, ot, g) => {
         `Buffer at index ${w} is not an ArrayBuffer or does not have a URI`
       );
   });
-}, jt = (et, ot) => {
+}, jt = ($, ot) => {
   const g = new Ft();
-  g.file(`${ot}.gltf`, JSON.stringify(et, null, 2)), et.buffers && Pt(et.buffers, g, ot), et.images && et.textures && Lt(et.images, et.textures, g), g.generateAsync({ type: "blob" }).then((I) => {
+  g.file(`${ot}.gltf`, JSON.stringify($, null, 2)), $.buffers && Pt($.buffers, g, ot), $.images && $.textures && Lt($.images, $.textures, g), g.generateAsync({ type: "blob" }).then((I) => {
     At.saveAs(I, `${ot}.zip`);
   });
-}, Wt = (et, ot) => ({
+}, Wt = ($, ot) => ({
   handleGltfExport: (I, w) => {
     const s = I == null ? void 0 : I.model;
     if (!s) {
       console.error("Scene not initialized");
       return;
     }
-    const o = new Tt(), n = {
+    const o = new Rt(), n = {
       binary: w,
       includeCustomExtensions: !0
     };
@@ -2447,7 +2451,7 @@ const Lt = (et, ot, g) => {
       s,
       (u) => {
         const c = Nt(I.name);
-        u instanceof ArrayBuffer ? (At.saveAs(new Blob([u]), `${c}.glb`), et && et()) : (jt(u, c), et && et());
+        u instanceof ArrayBuffer ? (At.saveAs(new Blob([u]), `${c}.glb`), $ && $()) : (jt(u, c), $ && $());
       },
       (u) => {
         console.error(u), ot && ot(u);

package/use-load-model.cjs.js

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./model-context-BBYdA-gO.cjs");exports.ModelContext=e.ModelContext;exports.ModelFileTypes=e.ModelFileTypes;exports.ModelProvider=e.ModelProvider;exports.useLoadModel=e.useLoadModel;exports.useModelContext=e.useModelContext;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./model-context-BmfXsk0j.cjs");exports.ModelContext=e.ModelContext;exports.ModelFileTypes=e.ModelFileTypes;exports.ModelProvider=e.ModelProvider;exports.useLoadModel=e.useLoadModel;exports.useModelContext=e.useModelContext;

package/use-load-model.es.js

@@ -1,4 +1,4 @@
-import { a as s, M as a, b as d, u as l, c as M } from "./model-context-Bvjdyghq.js";
+import { a as s, M as a, b as d, u as l, c as M } from "./model-context-qjRd1gfd.js";
 export {
   s as ModelContext,
   a as ModelFileTypes,

package/use-optimize-model-CXJnsRYK.cjs

@@ -0,0 +1 @@
+"use strict";const f=require("react"),m=require("./GLTFExporter-ltc8rmzz.cjs"),d=require("@gltf-transform/core"),t=require("@gltf-transform/functions"),l=require("@gltf-transform/extensions"),p=require("meshoptimizer"),y=new m.GLTFExporter,n=new d.WebIO;n.registerExtensions([l.KHRMeshQuantization]);const w=()=>{const r=f.useRef(null);async function i(e){const a=await y.parseAsync(e,{binary:!0});r.current=await n.readBinary(new Uint8Array(a))}async function o(){if(!r.current)return;const e=await r.current.transform(t.flatten(),t.quantize(),t.weld(),t.simplify({simplifier:p.MeshoptSimplifier,ratio:.1,error:1e-4}));r.current=e}async function s(){if(!r.current)return;const e=await r.current.transform(t.dedup({}));r.current=e}async function u(){if(!r.current)return;const e=await r.current.transform(t.quantize({}));r.current=e}async function c(){if(r.current)return await n.writeBinary(r.current)}return{load:i,getModel:c,simplifyOptimization:o,dedupOptimization:s,quantizeOptimization:u}};exports.useOptimizeModel=w;

package/use-optimize-model-CsddjnWO.js

@@ -0,0 +1,51 @@
+import { useRef as f } from "react";
+import { G as m } from "./GLTFExporter-Q5UJ5eb1.js";
+import { WebIO as p } from "@gltf-transform/core";
+import { flatten as d, quantize as e, weld as l, simplify as y, dedup as w } from "@gltf-transform/functions";
+import { KHRMeshQuantization as z } from "@gltf-transform/extensions";
+import { MeshoptSimplifier as M } from "meshoptimizer";
+const O = new m(), n = new p();
+n.registerExtensions([z]);
+const A = () => {
+  const r = f(null);
+  async function i(t) {
+    const c = await O.parseAsync(t, {
+      binary: !0
+    });
+    r.current = await n.readBinary(new Uint8Array(c));
+  }
+  async function o() {
+    if (!r.current) return;
+    const t = await r.current.transform(
+      d(),
+      e(),
+      l(),
+      y({ simplifier: M, ratio: 0.1, error: 1e-4 })
+    );
+    r.current = t;
+  }
+  async function a() {
+    if (!r.current) return;
+    const t = await r.current.transform(w({}));
+    r.current = t;
+  }
+  async function u() {
+    if (!r.current) return;
+    const t = await r.current.transform(e({}));
+    r.current = t;
+  }
+  async function s() {
+    if (r.current)
+      return await n.writeBinary(r.current);
+  }
+  return {
+    load: i,
+    getModel: s,
+    simplifyOptimization: o,
+    dedupOptimization: a,
+    quantizeOptimization: u
+  };
+};
+export {
+  A as u
+};

package/use-optimize-model.cjs.js

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./use-optimize-model-DMZVYv9U.cjs");exports.useOptimizeModel=e.useOptimizeModel;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./use-optimize-model-CXJnsRYK.cjs");exports.useOptimizeModel=e.useOptimizeModel;

package/use-optimize-model.es.js

@@ -1,4 +1,4 @@
-import { u as i } from "./use-optimize-model-DRrg3MLA.js";
+import { u as i } from "./use-optimize-model-CsddjnWO.js";
 export {
   i as useOptimizeModel
 };