fui-material 1.17.1 → 1.17.3

package/dist/f-ui-kit.es.js

@@ -85,7 +85,7 @@ function Pr() {
     function T(C) {
       return C.displayName || "Context";
     }
-    function B(C) {
+    function D(C) {
       if (C == null)
         return null;
       if (typeof C.tag == "number" && y("Received an unexpected object in getComponentNameFromType(). This is likely a bug in React. Please file an issue."), typeof C == "function")
@@ -118,11 +118,11 @@ function Pr() {
             return ee(C, C.render, "ForwardRef");
           case v:
             var se = C.displayName || null;
-            return se !== null ? se : B(C.type) || "Memo";
+            return se !== null ? se : D(C.type) || "Memo";
           case b: {
             var pe = C, we = pe._payload, fe = pe._init;
             try {
-              return B(fe(we));
+              return D(fe(we));
             } catch {
               return null;
             }
@@ -289,7 +289,7 @@ function Pr() {
       var V = C.prototype;
       return !!(V && V.isReactComponent);
     }
-    function D(C, V, K) {
+    function B(C, V, K) {
       if (C == null)
         return "";
       if (typeof C == "function")
@@ -307,11 +307,11 @@ function Pr() {
           case l:
             return Le(C.render);
           case v:
-            return D(C.type, V, K);
+            return B(C.type, V, K);
           case b: {
             var se = C, pe = se._payload, we = se._init;
             try {
-              return D(we(pe), V, K);
+              return B(we(pe), V, K);
             } catch {
             }
           }
@@ -321,7 +321,7 @@ function Pr() {
     var O = Object.prototype.hasOwnProperty, k = {}, E = g.ReactDebugCurrentFrame;
     function I(C) {
       if (C) {
-        var V = C._owner, K = D(C.type, C._source, V ? V.type : null);
+        var V = C._owner, K = B(C.type, C._source, V ? V.type : null);
         E.setExtraStackFrame(K);
       } else
         E.setExtraStackFrame(null);
@@ -394,8 +394,8 @@ function Pr() {
     }
     function et(C, V) {
       if (typeof C.ref == "string" && me.current && V && me.current.stateNode !== V) {
-        var K = B(me.current.type);
-        Ie[K] || (y('Component "%s" contains the string ref "%s". Support for string refs will be removed in a future major release. This case cannot be automatically converted to an arrow function. We ask you to manually fix this case by using useRef() or createRef() instead. Learn more about using refs safely here: https://reactjs.org/link/strict-mode-string-ref', B(me.current.type), C.ref), Ie[K] = !0);
+        var K = D(me.current.type);
+        Ie[K] || (y('Component "%s" contains the string ref "%s". Support for string refs will be removed in a future major release. This case cannot be automatically converted to an arrow function. We ask you to manually fix this case by using useRef() or createRef() instead. Learn more about using refs safely here: https://reactjs.org/link/strict-mode-string-ref', D(me.current.type), C.ref), Ie[K] = !0);
       }
     }
     function lt(C, V) {
@@ -470,7 +470,7 @@ function Pr() {
     var ct = g.ReactCurrentOwner, xt = g.ReactDebugCurrentFrame;
     function Ne(C) {
       if (C) {
-        var V = C._owner, K = D(C.type, C._source, V ? V.type : null);
+        var V = C._owner, K = B(C.type, C._source, V ? V.type : null);
         xt.setExtraStackFrame(K);
       } else
         xt.setExtraStackFrame(null);
@@ -483,7 +483,7 @@ function Pr() {
     function un() {
       {
         if (ct.current) {
-          var C = B(ct.current.type);
+          var C = D(ct.current.type);
           if (C)
             return `
 
@@ -518,7 +518,7 @@ Check the top-level render call using <` + K + ">.");
           return;
         fn[K] = !0;
         var se = "";
-        C && C._owner && C._owner !== ct.current && (se = " It was passed a child from " + B(C._owner.type) + "."), Ne(C), y('Each child in a list should have a unique "key" prop.%s%s See https://reactjs.org/link/warning-keys for more information.', K, se), Ne(null);
+        C && C._owner && C._owner !== ct.current && (se = " It was passed a child from " + D(C._owner.type) + "."), Ne(C), y('Each child in a list should have a unique "key" prop.%s%s See https://reactjs.org/link/warning-keys for more information.', K, se), Ne(null);
       }
     }
     function mn(C, V) {
@@ -555,11 +555,11 @@ Check the top-level render call using <` + K + ">.");
         else
           return;
         if (K) {
-          var se = B(V);
+          var se = D(V);
           N(K, C.props, "prop", se, C);
         } else if (V.PropTypes !== void 0 && !Ue) {
           Ue = !0;
-          var pe = B(V);
+          var pe = D(V);
           y("Component %s declared `PropTypes` instead of `propTypes`. Did you misspell the property assignment?", pe || "Unknown");
         }
         typeof V.getDefaultProps == "function" && !V.getDefaultProps.isReactClassApproved && y("getDefaultProps is only used on classic React.createClass definitions. Use a static property named `defaultProps` instead.");
@@ -587,7 +587,7 @@ Check the top-level render call using <` + K + ">.");
           var Te = gr();
           Te ? de += Te : de += un();
           var xe;
-          C === null ? xe = "null" : P(C) ? xe = "array" : C !== void 0 && C.$$typeof === e ? (xe = "<" + (B(C.type) || "Unknown") + " />", de = " Did you accidentally export a JSX literal instead of a component?") : xe = typeof C, y("React.jsx: type is invalid -- expected a string (for built-in components) or a class/function (for composite components) but got: %s.%s", xe, de);
+          C === null ? xe = "null" : P(C) ? xe = "array" : C !== void 0 && C.$$typeof === e ? (xe = "<" + (D(C.type) || "Unknown") + " />", de = " Did you accidentally export a JSX literal instead of a component?") : xe = typeof C, y("React.jsx: type is invalid -- expected a string (for built-in components) or a class/function (for composite components) but got: %s.%s", xe, de);
         }
         var Ae = zt(C, V, K, pe, we);
         if (Ae == null)
@@ -606,17 +606,17 @@ Check the top-level render call using <` + K + ">.");
               mn(Oe, C);
         }
         if (O.call(V, "key")) {
-          var Xe = B(C), _e = Object.keys(V).filter(function(Sr) {
+          var Xe = D(C), _e = Object.keys(V).filter(function(Sr) {
             return Sr !== "key";
-          }), Bt = _e.length > 0 ? "{key: someKey, " + _e.join(": ..., ") + ": ...}" : "{key: someKey}";
-          if (!pn[Xe + Bt]) {
+          }), Dt = _e.length > 0 ? "{key: someKey, " + _e.join(": ..., ") + ": ...}" : "{key: someKey}";
+          if (!pn[Xe + Dt]) {
             var Cr = _e.length > 0 ? "{" + _e.join(": ..., ") + ": ...}" : "{}";
             y(`A props object containing a "key" prop is being spread into JSX:
   let props = %s;
   <%s {...props} />
 React keys must be passed directly to JSX without using spread:
   let props = %s;
-  <%s key={someKey} {...props} />`, Bt, Xe, Cr, Xe), pn[Xe + Bt] = !0;
+  <%s key={someKey} {...props} />`, Dt, Xe, Cr, Xe), pn[Xe + Dt] = !0;
           }
         }
         return C === r ? br(Ae) : vr(Ae), Ae;
@@ -692,7 +692,7 @@ const Un = ({
       children: i
     }
   );
-}, Bs = ({
+}, Ds = ({
   children: i,
   variant: e = "contained",
   color: t = "primary",
@@ -826,7 +826,7 @@ const Un = ({
       }
     )
   ] });
-}, Ds = it(({
+}, Bs = it(({
   label: i,
   type: e = "text",
   fullWidth: t,
@@ -2820,7 +2820,7 @@ const ma = ({
     t(!1);
   });
 });
-function Br(i) {
+function Dr(i) {
   return i ? i.value : null;
 }
 const Ha = ({ title: i, body: e }) => new Promise((t) => {
@@ -2870,7 +2870,7 @@ const Ha = ({ title: i, body: e }) => new Promise((t) => {
   );
   const r = document.querySelector("#f-function-prompt-ok"), n = document.querySelector("#f-function-prompt-cancellation"), s = document.querySelector("#f-function-prompt-input");
   r.addEventListener("click", function() {
-    t(Br(s));
+    t(Dr(s));
   }), n.addEventListener("click", function() {
     t(null);
   });
@@ -2887,7 +2887,7 @@ class Ce {
       ZIP64_CENTRAL_DIRECTORY_LOCATOR: "PK\x07",
       ZIP64_CENTRAL_DIRECTORY_END: "PK",
       DATA_DESCRIPTOR: "PK\x07\b"
-    }, this.compressions = new Dr(), this.options = {
+    }, this.compressions = new Br(), this.options = {
       base64: !1,
       binary: !1,
       dir: !1,
@@ -3361,7 +3361,7 @@ class vn {
     return Je.getArrayBuffer(this.asBinary());
   }
 }
-class Dr {
+class Br {
   constructor() {
     this.magic = "\0\0";
   }
@@ -3470,13 +3470,13 @@ dn._keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="
 let pt = dn;
 class Ke {
   constructor() {
-    this.sheet = null, this.workBook = new Dt("Uni"), this.cell = null, this.style = null, this.merge = null;
+    this.sheet = null, this.workBook = new Bt("Uni"), this.cell = null, this.style = null, this.merge = null;
   }
   ngOnInit(e) {
-    this.workBook = new Dt(e);
+    this.workBook = new Bt(e);
   }
   getWorkBook(e = "Uni") {
-    return new Dt(e);
+    return new Bt(e);
   }
   getSheet(e) {
     return new Wn(e);
@@ -3903,7 +3903,7 @@ class he {
     return e += n + "wra;", kt(e);
   }
 }
-class Dt {
+class Bt {
   constructor(e = "Uni") {
     this.sheet = [], this.nameSheet = [], this.styleList = [new he(1), new he(1, 164)], this.nextStyle = 2, this.author = "Uni", this.author = e;
   }
@@ -5044,17 +5044,17 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return h;
       }
       function a(d, p, f, h, g, y) {
-        var A, S, R = d.file, F = d.compression, _ = y !== u.utf8encode, G = o.transformTo("string", y(R.name)), z = o.transformTo("string", u.utf8encode(R.name)), W = R.comment, ee = o.transformTo("string", y(W)), T = o.transformTo("string", u.utf8encode(W)), B = z.length !== R.name.length, w = T.length !== W.length, M = "", ie = "", Z = "", oe = R.dir, J = R.date, re = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+        var A, S, R = d.file, F = d.compression, _ = y !== u.utf8encode, G = o.transformTo("string", y(R.name)), z = o.transformTo("string", u.utf8encode(R.name)), W = R.comment, ee = o.transformTo("string", y(W)), T = o.transformTo("string", u.utf8encode(W)), D = z.length !== R.name.length, w = T.length !== W.length, M = "", ie = "", Z = "", oe = R.dir, J = R.date, re = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
         p && !f || (re.crc32 = d.crc32, re.compressedSize = d.compressedSize, re.uncompressedSize = d.uncompressedSize);
         var j = 0;
-        p && (j |= 8), _ || !B && !w || (j |= 2048);
+        p && (j |= 8), _ || !D && !w || (j |= 2048);
         var L = 0, ne = 0;
         oe && (L |= 16), g === "UNIX" ? (ne = 798, L |= function(Y, ge) {
           var Ee = Y;
           return Y || (Ee = ge ? 16893 : 33204), (65535 & Ee) << 16;
         }(R.unixPermissions, oe)) : (ne = 20, L |= function(Y) {
           return 63 & (Y || 0);
-        }(R.dosPermissions)), A = J.getUTCHours(), A <<= 6, A |= J.getUTCMinutes(), A <<= 5, A |= J.getUTCSeconds() / 2, S = J.getUTCFullYear() - 1980, S <<= 4, S |= J.getUTCMonth() + 1, S <<= 5, S |= J.getUTCDate(), B && (ie = s(1, 1) + s(m(G), 4) + z, M += "up" + s(ie.length, 2) + ie), w && (Z = s(1, 1) + s(m(ee), 4) + T, M += "uc" + s(Z.length, 2) + Z);
+        }(R.dosPermissions)), A = J.getUTCHours(), A <<= 6, A |= J.getUTCMinutes(), A <<= 5, A |= J.getUTCSeconds() / 2, S = J.getUTCFullYear() - 1980, S <<= 4, S |= J.getUTCMonth() + 1, S <<= 5, S |= J.getUTCDate(), D && (ie = s(1, 1) + s(m(G), 4) + z, M += "up" + s(ie.length, 2) + ie), w && (Z = s(1, 1) + s(m(ee), 4) + T, M += "uc" + s(Z.length, 2) + Z);
         var Q = "";
         return Q += `
 \0`, Q += s(j, 2), Q += F.magic, Q += s(A, 2), Q += s(S, 2), Q += s(re.crc32, 4), Q += s(re.compressedSize, 4), Q += s(re.uncompressedSize, 4), Q += s(G.length, 2), Q += s(M.length, 2), { fileRecord: v.LOCAL_FILE_HEADER + Q + G + M, dirRecord: v.CENTRAL_FILE_HEADER + s(ne, 2) + Q + s(ee.length, 2) + "\0\0\0\0" + s(L, 4) + s(h, 4) + G + M + ee };
@@ -5232,8 +5232,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         _ && _.binary !== void 0 || (W.binary = !ee), (F instanceof v && F.uncompressedSize === 0 || W.dir || !F || F.length === 0) && (W.base64 = !1, W.binary = !0, F = "", W.compression = "STORE", z = "string");
         var T = null;
         T = F instanceof v || F instanceof l ? F : p.isNode && p.isStream(F) ? new f(R, F) : o.prepareContent(R, F, W.binary, W.optimizedBinaryString, W.base64);
-        var B = new b(R, T, W);
-        this.files[R] = B;
+        var D = new b(R, T, W);
+        this.files[R] = D;
       }
       var a = t("./utf8"), o = t("./utils"), l = t("./stream/GenericWorker"), u = t("./stream/StreamHelper"), m = t("./defaults"), v = t("./compressedObject"), b = t("./zipObject"), d = t("./generate"), p = t("./nodejsUtils"), f = t("./nodejs/NodejsStreamInputAdapter"), h = function(R) {
         R.slice(-1) === "/" && (R = R.substring(0, R.length - 1));
@@ -6281,62 +6281,62 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         return -1 ^ a;
       };
     }, {}], 46: [function(t, r, n) {
-      var s, a = t("../utils/common"), o = t("./trees"), l = t("./adler32"), u = t("./crc32"), m = t("./messages"), v = 0, b = 4, d = 0, p = -2, f = -1, h = 4, g = 2, y = 8, A = 9, S = 286, R = 30, F = 19, _ = 2 * S + 1, G = 15, z = 3, W = 258, ee = W + z + 1, T = 42, B = 113, w = 1, M = 2, ie = 3, Z = 4;
-      function oe(c, D) {
-        return c.msg = m[D], D;
+      var s, a = t("../utils/common"), o = t("./trees"), l = t("./adler32"), u = t("./crc32"), m = t("./messages"), v = 0, b = 4, d = 0, p = -2, f = -1, h = 4, g = 2, y = 8, A = 9, S = 286, R = 30, F = 19, _ = 2 * S + 1, G = 15, z = 3, W = 258, ee = W + z + 1, T = 42, D = 113, w = 1, M = 2, ie = 3, Z = 4;
+      function oe(c, B) {
+        return c.msg = m[B], B;
       }
       function J(c) {
         return (c << 1) - (4 < c ? 9 : 0);
       }
       function re(c) {
-        for (var D = c.length; 0 <= --D; ) c[D] = 0;
+        for (var B = c.length; 0 <= --B; ) c[B] = 0;
       }
       function j(c) {
-        var D = c.state, O = D.pending;
-        O > c.avail_out && (O = c.avail_out), O !== 0 && (a.arraySet(c.output, D.pending_buf, D.pending_out, O, c.next_out), c.next_out += O, D.pending_out += O, c.total_out += O, c.avail_out -= O, D.pending -= O, D.pending === 0 && (D.pending_out = 0));
+        var B = c.state, O = B.pending;
+        O > c.avail_out && (O = c.avail_out), O !== 0 && (a.arraySet(c.output, B.pending_buf, B.pending_out, O, c.next_out), c.next_out += O, B.pending_out += O, c.total_out += O, c.avail_out -= O, B.pending -= O, B.pending === 0 && (B.pending_out = 0));
       }
-      function L(c, D) {
-        o._tr_flush_block(c, 0 <= c.block_start ? c.block_start : -1, c.strstart - c.block_start, D), c.block_start = c.strstart, j(c.strm);
+      function L(c, B) {
+        o._tr_flush_block(c, 0 <= c.block_start ? c.block_start : -1, c.strstart - c.block_start, B), c.block_start = c.strstart, j(c.strm);
       }
-      function ne(c, D) {
-        c.pending_buf[c.pending++] = D;
+      function ne(c, B) {
+        c.pending_buf[c.pending++] = B;
       }
-      function Q(c, D) {
-        c.pending_buf[c.pending++] = D >>> 8 & 255, c.pending_buf[c.pending++] = 255 & D;
+      function Q(c, B) {
+        c.pending_buf[c.pending++] = B >>> 8 & 255, c.pending_buf[c.pending++] = 255 & B;
       }
-      function Y(c, D) {
+      function Y(c, B) {
         var O, k, E = c.max_chain_length, I = c.strstart, N = c.prev_length, U = c.nice_match, P = c.strstart > c.w_size - ee ? c.strstart - (c.w_size - ee) : 0, q = c.window, $ = c.w_mask, X = c.prev, te = c.strstart + W, me = q[I + N - 1], ce = q[I + N];
         c.prev_length >= c.good_match && (E >>= 2), U > c.lookahead && (U = c.lookahead);
         do
-          if (q[(O = D) + N] === ce && q[O + N - 1] === me && q[O] === q[I] && q[++O] === q[I + 1]) {
+          if (q[(O = B) + N] === ce && q[O + N - 1] === me && q[O] === q[I] && q[++O] === q[I + 1]) {
             I += 2, O++;
             do
               ;
             while (q[++I] === q[++O] && q[++I] === q[++O] && q[++I] === q[++O] && q[++I] === q[++O] && q[++I] === q[++O] && q[++I] === q[++O] && q[++I] === q[++O] && q[++I] === q[++O] && I < te);
             if (k = W - (te - I), I = te - W, N < k) {
-              if (c.match_start = D, U <= (N = k)) break;
+              if (c.match_start = B, U <= (N = k)) break;
               me = q[I + N - 1], ce = q[I + N];
             }
           }
-        while ((D = X[D & $]) > P && --E != 0);
+        while ((B = X[B & $]) > P && --E != 0);
         return N <= c.lookahead ? N : c.lookahead;
       }
       function ge(c) {
-        var D, O, k, E, I, N, U, P, q, $, X = c.w_size;
+        var B, O, k, E, I, N, U, P, q, $, X = c.w_size;
         do {
           if (E = c.window_size - c.lookahead - c.strstart, c.strstart >= X + (X - ee)) {
-            for (a.arraySet(c.window, c.window, X, X, 0), c.match_start -= X, c.strstart -= X, c.block_start -= X, D = O = c.hash_size; k = c.head[--D], c.head[D] = X <= k ? k - X : 0, --O; ) ;
-            for (D = O = X; k = c.prev[--D], c.prev[D] = X <= k ? k - X : 0, --O; ) ;
+            for (a.arraySet(c.window, c.window, X, X, 0), c.match_start -= X, c.strstart -= X, c.block_start -= X, B = O = c.hash_size; k = c.head[--B], c.head[B] = X <= k ? k - X : 0, --O; ) ;
+            for (B = O = X; k = c.prev[--B], c.prev[B] = X <= k ? k - X : 0, --O; ) ;
             E += X;
           }
           if (c.strm.avail_in === 0) break;
           if (N = c.strm, U = c.window, P = c.strstart + c.lookahead, q = E, $ = void 0, $ = N.avail_in, q < $ && ($ = q), O = $ === 0 ? 0 : (N.avail_in -= $, a.arraySet(U, N.input, N.next_in, $, P), N.state.wrap === 1 ? N.adler = l(N.adler, U, $, P) : N.state.wrap === 2 && (N.adler = u(N.adler, U, $, P)), N.next_in += $, N.total_in += $, $), c.lookahead += O, c.lookahead + c.insert >= z) for (I = c.strstart - c.insert, c.ins_h = c.window[I], c.ins_h = (c.ins_h << c.hash_shift ^ c.window[I + 1]) & c.hash_mask; c.insert && (c.ins_h = (c.ins_h << c.hash_shift ^ c.window[I + z - 1]) & c.hash_mask, c.prev[I & c.w_mask] = c.head[c.ins_h], c.head[c.ins_h] = I, I++, c.insert--, !(c.lookahead + c.insert < z)); ) ;
         } while (c.lookahead < ee && c.strm.avail_in !== 0);
       }
-      function Ee(c, D) {
+      function Ee(c, B) {
         for (var O, k; ; ) {
           if (c.lookahead < ee) {
-            if (ge(c), c.lookahead < ee && D === v) return w;
+            if (ge(c), c.lookahead < ee && B === v) return w;
             if (c.lookahead === 0) break;
           }
           if (O = 0, c.lookahead >= z && (c.ins_h = (c.ins_h << c.hash_shift ^ c.window[c.strstart + z - 1]) & c.hash_mask, O = c.prev[c.strstart & c.w_mask] = c.head[c.ins_h], c.head[c.ins_h] = c.strstart), O !== 0 && c.strstart - O <= c.w_size - ee && (c.match_length = Y(c, O)), c.match_length >= z) if (k = o._tr_tally(c, c.strstart - c.match_start, c.match_length - z), c.lookahead -= c.match_length, c.match_length <= c.max_lazy_match && c.lookahead >= z) {
@@ -6346,12 +6346,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           else k = o._tr_tally(c, 0, c.window[c.strstart]), c.lookahead--, c.strstart++;
           if (k && (L(c, !1), c.strm.avail_out === 0)) return w;
         }
-        return c.insert = c.strstart < z - 1 ? c.strstart : z - 1, D === b ? (L(c, !0), c.strm.avail_out === 0 ? ie : Z) : c.last_lit && (L(c, !1), c.strm.avail_out === 0) ? w : M;
+        return c.insert = c.strstart < z - 1 ? c.strstart : z - 1, B === b ? (L(c, !0), c.strm.avail_out === 0 ? ie : Z) : c.last_lit && (L(c, !1), c.strm.avail_out === 0) ? w : M;
       }
-      function le(c, D) {
+      function le(c, B) {
         for (var O, k, E; ; ) {
           if (c.lookahead < ee) {
-            if (ge(c), c.lookahead < ee && D === v) return w;
+            if (ge(c), c.lookahead < ee && B === v) return w;
             if (c.lookahead === 0) break;
           }
           if (O = 0, c.lookahead >= z && (c.ins_h = (c.ins_h << c.hash_shift ^ c.window[c.strstart + z - 1]) & c.hash_mask, O = 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 = z - 1, O !== 0 && c.prev_length < c.max_lazy_match && c.strstart - O <= c.w_size - ee && (c.match_length = Y(c, O), c.match_length <= 5 && (c.strategy === 1 || c.match_length === z && 4096 < c.strstart - c.match_start) && (c.match_length = z - 1)), c.prev_length >= z && c.match_length <= c.prev_length) {
@@ -6361,56 +6361,56 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             if ((k = o._tr_tally(c, 0, c.window[c.strstart - 1])) && L(c, !1), c.strstart++, c.lookahead--, c.strm.avail_out === 0) return w;
           } else c.match_available = 1, c.strstart++, c.lookahead--;
         }
-        return c.match_available && (k = o._tr_tally(c, 0, c.window[c.strstart - 1]), c.match_available = 0), c.insert = c.strstart < z - 1 ? c.strstart : z - 1, D === b ? (L(c, !0), c.strm.avail_out === 0 ? ie : Z) : c.last_lit && (L(c, !1), c.strm.avail_out === 0) ? w : M;
+        return c.match_available && (k = o._tr_tally(c, 0, c.window[c.strstart - 1]), c.match_available = 0), c.insert = c.strstart < z - 1 ? c.strstart : z - 1, B === b ? (L(c, !0), c.strm.avail_out === 0 ? ie : Z) : c.last_lit && (L(c, !1), c.strm.avail_out === 0) ? w : M;
       }
-      function ue(c, D, O, k, E) {
-        this.good_length = c, this.max_lazy = D, this.nice_length = O, this.max_chain = k, this.func = E;
+      function ue(c, B, O, k, E) {
+        this.good_length = c, this.max_lazy = B, this.nice_length = O, this.max_chain = k, this.func = E;
       }
       function ye() {
         this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = y, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new a.Buf16(2 * _), this.dyn_dtree = new a.Buf16(2 * (2 * R + 1)), this.bl_tree = new a.Buf16(2 * (2 * F + 1)), re(this.dyn_ltree), re(this.dyn_dtree), re(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new a.Buf16(G + 1), this.heap = new a.Buf16(2 * S + 1), re(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new a.Buf16(2 * S + 1), re(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
       }
       function ve(c) {
-        var D;
-        return c && c.state ? (c.total_in = c.total_out = 0, c.data_type = g, (D = c.state).pending = 0, D.pending_out = 0, D.wrap < 0 && (D.wrap = -D.wrap), D.status = D.wrap ? T : B, c.adler = D.wrap === 2 ? 0 : 1, D.last_flush = v, o._tr_init(D), d) : oe(c, p);
+        var B;
+        return c && c.state ? (c.total_in = c.total_out = 0, c.data_type = g, (B = c.state).pending = 0, B.pending_out = 0, B.wrap < 0 && (B.wrap = -B.wrap), B.status = B.wrap ? T : D, c.adler = B.wrap === 2 ? 0 : 1, B.last_flush = v, o._tr_init(B), d) : oe(c, p);
       }
       function Fe(c) {
-        var D = ve(c);
-        return D === d && function(O) {
+        var B = ve(c);
+        return B === d && function(O) {
           O.window_size = 2 * O.w_size, re(O.head), O.max_lazy_match = s[O.level].max_lazy, O.good_match = s[O.level].good_length, O.nice_match = s[O.level].nice_length, O.max_chain_length = s[O.level].max_chain, O.strstart = 0, O.block_start = 0, O.lookahead = 0, O.insert = 0, O.match_length = O.prev_length = z - 1, O.match_available = 0, O.ins_h = 0;
-        }(c.state), D;
+        }(c.state), B;
       }
-      function Le(c, D, O, k, E, I) {
+      function Le(c, B, O, k, E, I) {
         if (!c) return p;
         var N = 1;
-        if (D === f && (D = 6), k < 0 ? (N = 0, k = -k) : 15 < k && (N = 2, k -= 16), E < 1 || A < E || O !== y || k < 8 || 15 < k || D < 0 || 9 < D || I < 0 || h < I) return oe(c, p);
+        if (B === f && (B = 6), k < 0 ? (N = 0, k = -k) : 15 < k && (N = 2, k -= 16), E < 1 || A < E || O !== y || k < 8 || 15 < k || B < 0 || 9 < B || I < 0 || h < I) return oe(c, p);
         k === 8 && (k = 9);
         var U = new ye();
-        return (c.state = U).strm = c, U.wrap = N, U.gzhead = null, U.w_bits = k, U.w_size = 1 << U.w_bits, U.w_mask = U.w_size - 1, U.hash_bits = E + 7, U.hash_size = 1 << U.hash_bits, U.hash_mask = U.hash_size - 1, U.hash_shift = ~~((U.hash_bits + z - 1) / z), U.window = new a.Buf8(2 * U.w_size), U.head = new a.Buf16(U.hash_size), U.prev = new a.Buf16(U.w_size), U.lit_bufsize = 1 << E + 6, U.pending_buf_size = 4 * U.lit_bufsize, U.pending_buf = new a.Buf8(U.pending_buf_size), U.d_buf = 1 * U.lit_bufsize, U.l_buf = 3 * U.lit_bufsize, U.level = D, U.strategy = I, U.method = O, Fe(c);
+        return (c.state = U).strm = c, U.wrap = N, U.gzhead = null, U.w_bits = k, U.w_size = 1 << U.w_bits, U.w_mask = U.w_size - 1, U.hash_bits = E + 7, U.hash_size = 1 << U.hash_bits, U.hash_mask = U.hash_size - 1, U.hash_shift = ~~((U.hash_bits + z - 1) / z), U.window = new a.Buf8(2 * U.w_size), U.head = new a.Buf16(U.hash_size), U.prev = new a.Buf16(U.w_size), U.lit_bufsize = 1 << E + 6, U.pending_buf_size = 4 * U.lit_bufsize, U.pending_buf = new a.Buf8(U.pending_buf_size), U.d_buf = 1 * U.lit_bufsize, U.l_buf = 3 * U.lit_bufsize, U.level = B, U.strategy = I, U.method = O, Fe(c);
       }
-      s = [new ue(0, 0, 0, 0, function(c, D) {
+      s = [new ue(0, 0, 0, 0, function(c, B) {
         var O = 65535;
         for (O > c.pending_buf_size - 5 && (O = c.pending_buf_size - 5); ; ) {
           if (c.lookahead <= 1) {
-            if (ge(c), c.lookahead === 0 && D === v) return w;
+            if (ge(c), c.lookahead === 0 && B === v) return w;
             if (c.lookahead === 0) break;
           }
           c.strstart += c.lookahead, c.lookahead = 0;
           var k = c.block_start + O;
           if ((c.strstart === 0 || c.strstart >= k) && (c.lookahead = c.strstart - k, c.strstart = k, L(c, !1), c.strm.avail_out === 0) || c.strstart - c.block_start >= c.w_size - ee && (L(c, !1), c.strm.avail_out === 0)) return w;
         }
-        return c.insert = 0, D === b ? (L(c, !0), c.strm.avail_out === 0 ? ie : Z) : (c.strstart > c.block_start && (L(c, !1), c.strm.avail_out), w);
-      }), new ue(4, 4, 8, 4, Ee), new ue(4, 5, 16, 8, Ee), new ue(4, 6, 32, 32, Ee), new ue(4, 4, 16, 16, le), new ue(8, 16, 32, 32, le), new ue(8, 16, 128, 128, le), new ue(8, 32, 128, 256, le), new ue(32, 128, 258, 1024, le), new ue(32, 258, 258, 4096, le)], n.deflateInit = function(c, D) {
-        return Le(c, D, y, 15, 8, 0);
-      }, n.deflateInit2 = Le, n.deflateReset = Fe, n.deflateResetKeep = ve, n.deflateSetHeader = function(c, D) {
-        return c && c.state ? c.state.wrap !== 2 ? p : (c.state.gzhead = D, d) : p;
-      }, n.deflate = function(c, D) {
+        return c.insert = 0, B === b ? (L(c, !0), c.strm.avail_out === 0 ? ie : Z) : (c.strstart > c.block_start && (L(c, !1), c.strm.avail_out), w);
+      }), new ue(4, 4, 8, 4, Ee), new ue(4, 5, 16, 8, Ee), new ue(4, 6, 32, 32, Ee), new ue(4, 4, 16, 16, le), new ue(8, 16, 32, 32, le), new ue(8, 16, 128, 128, le), new ue(8, 32, 128, 256, le), new ue(32, 128, 258, 1024, le), new ue(32, 258, 258, 4096, le)], n.deflateInit = function(c, B) {
+        return Le(c, B, y, 15, 8, 0);
+      }, n.deflateInit2 = Le, n.deflateReset = Fe, n.deflateResetKeep = ve, n.deflateSetHeader = function(c, B) {
+        return c && c.state ? c.state.wrap !== 2 ? p : (c.state.gzhead = B, d) : p;
+      }, n.deflate = function(c, B) {
         var O, k, E, I;
-        if (!c || !c.state || 5 < D || D < 0) return c ? oe(c, p) : p;
-        if (k = c.state, !c.output || !c.input && c.avail_in !== 0 || k.status === 666 && D !== b) return oe(c, c.avail_out === 0 ? -5 : p);
-        if (k.strm = c, O = k.last_flush, k.last_flush = D, k.status === T) if (k.wrap === 2) c.adler = 0, ne(k, 31), ne(k, 139), ne(k, 8), k.gzhead ? (ne(k, (k.gzhead.text ? 1 : 0) + (k.gzhead.hcrc ? 2 : 0) + (k.gzhead.extra ? 4 : 0) + (k.gzhead.name ? 8 : 0) + (k.gzhead.comment ? 16 : 0)), ne(k, 255 & k.gzhead.time), ne(k, k.gzhead.time >> 8 & 255), ne(k, k.gzhead.time >> 16 & 255), ne(k, k.gzhead.time >> 24 & 255), ne(k, k.level === 9 ? 2 : 2 <= k.strategy || k.level < 2 ? 4 : 0), ne(k, 255 & k.gzhead.os), k.gzhead.extra && k.gzhead.extra.length && (ne(k, 255 & k.gzhead.extra.length), ne(k, k.gzhead.extra.length >> 8 & 255)), k.gzhead.hcrc && (c.adler = u(c.adler, k.pending_buf, k.pending, 0)), k.gzindex = 0, k.status = 69) : (ne(k, 0), ne(k, 0), ne(k, 0), ne(k, 0), ne(k, 0), ne(k, k.level === 9 ? 2 : 2 <= k.strategy || k.level < 2 ? 4 : 0), ne(k, 3), k.status = B);
+        if (!c || !c.state || 5 < B || B < 0) return c ? oe(c, p) : p;
+        if (k = c.state, !c.output || !c.input && c.avail_in !== 0 || k.status === 666 && B !== b) return oe(c, c.avail_out === 0 ? -5 : p);
+        if (k.strm = c, O = k.last_flush, k.last_flush = B, k.status === T) if (k.wrap === 2) c.adler = 0, ne(k, 31), ne(k, 139), ne(k, 8), k.gzhead ? (ne(k, (k.gzhead.text ? 1 : 0) + (k.gzhead.hcrc ? 2 : 0) + (k.gzhead.extra ? 4 : 0) + (k.gzhead.name ? 8 : 0) + (k.gzhead.comment ? 16 : 0)), ne(k, 255 & k.gzhead.time), ne(k, k.gzhead.time >> 8 & 255), ne(k, k.gzhead.time >> 16 & 255), ne(k, k.gzhead.time >> 24 & 255), ne(k, k.level === 9 ? 2 : 2 <= k.strategy || k.level < 2 ? 4 : 0), ne(k, 255 & k.gzhead.os), k.gzhead.extra && k.gzhead.extra.length && (ne(k, 255 & k.gzhead.extra.length), ne(k, k.gzhead.extra.length >> 8 & 255)), k.gzhead.hcrc && (c.adler = u(c.adler, k.pending_buf, k.pending, 0)), k.gzindex = 0, k.status = 69) : (ne(k, 0), ne(k, 0), ne(k, 0), ne(k, 0), ne(k, 0), ne(k, k.level === 9 ? 2 : 2 <= k.strategy || k.level < 2 ? 4 : 0), ne(k, 3), k.status = D);
         else {
           var N = y + (k.w_bits - 8 << 4) << 8;
-          N |= (2 <= k.strategy || k.level < 2 ? 0 : k.level < 6 ? 1 : k.level === 6 ? 2 : 3) << 6, k.strstart !== 0 && (N |= 32), N += 31 - N % 31, k.status = B, Q(k, N), k.strstart !== 0 && (Q(k, c.adler >>> 16), Q(k, 65535 & c.adler)), c.adler = 1;
+          N |= (2 <= k.strategy || k.level < 2 ? 0 : k.level < 6 ? 1 : k.level === 6 ? 2 : 3) << 6, k.strstart !== 0 && (N |= 32), N += 31 - N % 31, k.status = D, Q(k, N), k.strstart !== 0 && (Q(k, c.adler >>> 16), Q(k, 65535 & c.adler)), c.adler = 1;
         }
         if (k.status === 69) if (k.gzhead.extra) {
           for (E = k.pending; k.gzindex < (65535 & k.gzhead.extra.length) && (k.pending !== k.pending_buf_size || (k.gzhead.hcrc && k.pending > E && (c.adler = u(c.adler, k.pending_buf, k.pending - E, E)), j(c), E = k.pending, k.pending !== k.pending_buf_size)); ) ne(k, 255 & k.gzhead.extra[k.gzindex]), k.gzindex++;
@@ -6438,11 +6438,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           } while (I !== 0);
           k.gzhead.hcrc && k.pending > E && (c.adler = u(c.adler, k.pending_buf, k.pending - E, E)), I === 0 && (k.status = 103);
         } else k.status = 103;
-        if (k.status === 103 && (k.gzhead.hcrc ? (k.pending + 2 > k.pending_buf_size && j(c), k.pending + 2 <= k.pending_buf_size && (ne(k, 255 & c.adler), ne(k, c.adler >> 8 & 255), c.adler = 0, k.status = B)) : k.status = B), k.pending !== 0) {
+        if (k.status === 103 && (k.gzhead.hcrc ? (k.pending + 2 > k.pending_buf_size && j(c), k.pending + 2 <= k.pending_buf_size && (ne(k, 255 & c.adler), ne(k, c.adler >> 8 & 255), c.adler = 0, k.status = D)) : k.status = D), k.pending !== 0) {
           if (j(c), c.avail_out === 0) return k.last_flush = -1, d;
-        } else if (c.avail_in === 0 && J(D) <= J(O) && D !== b) return oe(c, -5);
+        } else if (c.avail_in === 0 && J(B) <= J(O) && B !== b) return oe(c, -5);
         if (k.status === 666 && c.avail_in !== 0) return oe(c, -5);
-        if (c.avail_in !== 0 || k.lookahead !== 0 || D !== v && k.status !== 666) {
+        if (c.avail_in !== 0 || k.lookahead !== 0 || B !== v && k.status !== 666) {
           var U = k.strategy === 2 ? function(P, q) {
             for (var $; ; ) {
               if (P.lookahead === 0 && (ge(P), P.lookahead === 0)) {
@@ -6452,7 +6452,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               if (P.match_length = 0, $ = o._tr_tally(P, 0, P.window[P.strstart]), P.lookahead--, P.strstart++, $ && (L(P, !1), P.strm.avail_out === 0)) return w;
             }
             return P.insert = 0, q === b ? (L(P, !0), P.strm.avail_out === 0 ? ie : Z) : P.last_lit && (L(P, !1), P.strm.avail_out === 0) ? w : M;
-          }(k, D) : k.strategy === 3 ? function(P, q) {
+          }(k, B) : k.strategy === 3 ? function(P, q) {
             for (var $, X, te, me, ce = P.window; ; ) {
               if (P.lookahead <= W) {
                 if (ge(P), P.lookahead <= W && q === v) return w;
@@ -6468,18 +6468,18 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               if (P.match_length >= z ? ($ = o._tr_tally(P, 1, P.match_length - z), P.lookahead -= P.match_length, P.strstart += P.match_length, P.match_length = 0) : ($ = o._tr_tally(P, 0, P.window[P.strstart]), P.lookahead--, P.strstart++), $ && (L(P, !1), P.strm.avail_out === 0)) return w;
             }
             return P.insert = 0, q === b ? (L(P, !0), P.strm.avail_out === 0 ? ie : Z) : P.last_lit && (L(P, !1), P.strm.avail_out === 0) ? w : M;
-          }(k, D) : s[k.level].func(k, D);
+          }(k, B) : s[k.level].func(k, B);
           if (U !== ie && U !== Z || (k.status = 666), U === w || U === ie) return c.avail_out === 0 && (k.last_flush = -1), d;
-          if (U === M && (D === 1 ? o._tr_align(k) : D !== 5 && (o._tr_stored_block(k, 0, 0, !1), D === 3 && (re(k.head), k.lookahead === 0 && (k.strstart = 0, k.block_start = 0, k.insert = 0))), j(c), c.avail_out === 0)) return k.last_flush = -1, d;
+          if (U === M && (B === 1 ? o._tr_align(k) : B !== 5 && (o._tr_stored_block(k, 0, 0, !1), B === 3 && (re(k.head), k.lookahead === 0 && (k.strstart = 0, k.block_start = 0, k.insert = 0))), j(c), c.avail_out === 0)) return k.last_flush = -1, d;
         }
-        return D !== b ? d : k.wrap <= 0 ? 1 : (k.wrap === 2 ? (ne(k, 255 & c.adler), ne(k, c.adler >> 8 & 255), ne(k, c.adler >> 16 & 255), ne(k, c.adler >> 24 & 255), ne(k, 255 & c.total_in), ne(k, c.total_in >> 8 & 255), ne(k, c.total_in >> 16 & 255), ne(k, c.total_in >> 24 & 255)) : (Q(k, c.adler >>> 16), Q(k, 65535 & c.adler)), j(c), 0 < k.wrap && (k.wrap = -k.wrap), k.pending !== 0 ? d : 1);
+        return B !== b ? d : k.wrap <= 0 ? 1 : (k.wrap === 2 ? (ne(k, 255 & c.adler), ne(k, c.adler >> 8 & 255), ne(k, c.adler >> 16 & 255), ne(k, c.adler >> 24 & 255), ne(k, 255 & c.total_in), ne(k, c.total_in >> 8 & 255), ne(k, c.total_in >> 16 & 255), ne(k, c.total_in >> 24 & 255)) : (Q(k, c.adler >>> 16), Q(k, 65535 & c.adler)), j(c), 0 < k.wrap && (k.wrap = -k.wrap), k.pending !== 0 ? d : 1);
       }, n.deflateEnd = function(c) {
-        var D;
-        return c && c.state ? (D = c.state.status) !== T && D !== 69 && D !== 73 && D !== 91 && D !== 103 && D !== B && D !== 666 ? oe(c, p) : (c.state = null, D === B ? oe(c, -3) : d) : p;
-      }, n.deflateSetDictionary = function(c, D) {
-        var O, k, E, I, N, U, P, q, $ = D.length;
+        var B;
+        return c && c.state ? (B = c.state.status) !== T && B !== 69 && B !== 73 && B !== 91 && B !== 103 && B !== D && B !== 666 ? oe(c, p) : (c.state = null, B === D ? oe(c, -3) : d) : p;
+      }, n.deflateSetDictionary = function(c, B) {
+        var O, k, E, I, N, U, P, q, $ = B.length;
         if (!c || !c.state || (I = (O = c.state).wrap) === 2 || I === 1 && O.status !== T || O.lookahead) return p;
-        for (I === 1 && (c.adler = l(c.adler, D, $, 0)), O.wrap = 0, $ >= O.w_size && (I === 0 && (re(O.head), O.strstart = 0, O.block_start = 0, O.insert = 0), q = new a.Buf8(O.w_size), a.arraySet(q, D, $ - O.w_size, O.w_size, 0), D = q, $ = O.w_size), N = c.avail_in, U = c.next_in, P = c.input, c.avail_in = $, c.next_in = 0, c.input = D, ge(O); O.lookahead >= z; ) {
+        for (I === 1 && (c.adler = l(c.adler, B, $, 0)), O.wrap = 0, $ >= O.w_size && (I === 0 && (re(O.head), O.strstart = 0, O.block_start = 0, O.insert = 0), q = new a.Buf8(O.w_size), a.arraySet(q, B, $ - O.w_size, O.w_size, 0), B = q, $ = O.w_size), N = c.avail_in, U = c.next_in, P = c.input, c.avail_in = $, c.next_in = 0, c.input = B, ge(O); O.lookahead >= z; ) {
           for (k = O.strstart, E = O.lookahead - (z - 1); O.ins_h = (O.ins_h << O.hash_shift ^ O.window[k + z - 1]) & O.hash_mask, O.prev[k & O.w_mask] = O.head[O.ins_h], O.head[O.ins_h] = k, k++, --E; ) ;
           O.strstart = k, O.lookahead = z - 1, ge(O);
         }
@@ -6491,7 +6491,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       };
     }, {}], 48: [function(t, r, n) {
       r.exports = function(s, a) {
-        var o, l, u, m, v, b, d, p, f, h, g, y, A, S, R, F, _, G, z, W, ee, T, B, w, M;
+        var o, l, u, m, v, b, d, p, f, h, g, y, A, S, R, F, _, G, z, W, ee, T, D, w, M;
         o = s.state, l = s.next_in, w = s.input, u = l + (s.avail_in - 5), m = s.next_out, M = s.output, v = m - (a - s.avail_out), b = m + (s.avail_out - 257), d = o.dmax, p = o.wsize, f = o.whave, h = o.wnext, g = o.window, y = o.hold, A = o.bits, S = o.lencode, R = o.distcode, F = (1 << o.lenbits) - 1, _ = (1 << o.distbits) - 1;
         e: do {
           A < 15 && (y += w[l++] << A, A += 8, y += w[l++] << A, A += 8), G = S[y & F];
@@ -6529,25 +6529,25 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                     s.msg = "invalid distance too far back", o.mode = 30;
                     break e;
                   }
-                  if (B = g, (T = 0) === h) {
+                  if (D = g, (T = 0) === h) {
                     if (T += p - z, z < W) {
                       for (W -= z; M[m++] = g[T++], --z; ) ;
-                      T = m - ee, B = M;
+                      T = m - ee, D = M;
                     }
                   } else if (h < z) {
                     if (T += p + h - z, (z -= h) < W) {
                       for (W -= z; M[m++] = g[T++], --z; ) ;
                       if (T = 0, h < W) {
                         for (W -= z = h; M[m++] = g[T++], --z; ) ;
-                        T = m - ee, B = M;
+                        T = m - ee, D = M;
                       }
                     }
                   } else if (T += h - z, z < W) {
                     for (W -= z; M[m++] = g[T++], --z; ) ;
-                    T = m - ee, B = M;
+                    T = m - ee, D = M;
                   }
-                  for (; 2 < W; ) M[m++] = B[T++], M[m++] = B[T++], M[m++] = B[T++], W -= 3;
-                  W && (M[m++] = B[T++], 1 < W && (M[m++] = B[T++]));
+                  for (; 2 < W; ) M[m++] = D[T++], M[m++] = D[T++], M[m++] = D[T++], W -= 3;
+                  W && (M[m++] = D[T++], 1 < W && (M[m++] = D[T++]));
                 } else {
                   for (T = m - ee; M[m++] = M[T++], M[m++] = M[T++], M[m++] = M[T++], 2 < (W -= 3); ) ;
                   W && (M[m++] = M[T++], 1 < W && (M[m++] = M[T++]));
@@ -6569,44 +6569,44 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new s.Buf16(320), this.work = new s.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
       }
       function A(T) {
-        var B;
-        return T && T.state ? (B = T.state, T.total_in = T.total_out = B.total = 0, T.msg = "", B.wrap && (T.adler = 1 & B.wrap), B.mode = p, B.last = 0, B.havedict = 0, B.dmax = 32768, B.head = null, B.hold = 0, B.bits = 0, B.lencode = B.lendyn = new s.Buf32(f), B.distcode = B.distdyn = new s.Buf32(h), B.sane = 1, B.back = -1, b) : d;
+        var D;
+        return T && T.state ? (D = T.state, T.total_in = T.total_out = D.total = 0, T.msg = "", D.wrap && (T.adler = 1 & D.wrap), D.mode = p, D.last = 0, D.havedict = 0, D.dmax = 32768, D.head = null, D.hold = 0, D.bits = 0, D.lencode = D.lendyn = new s.Buf32(f), D.distcode = D.distdyn = new s.Buf32(h), D.sane = 1, D.back = -1, b) : d;
       }
       function S(T) {
-        var B;
-        return T && T.state ? ((B = T.state).wsize = 0, B.whave = 0, B.wnext = 0, A(T)) : d;
+        var D;
+        return T && T.state ? ((D = T.state).wsize = 0, D.whave = 0, D.wnext = 0, A(T)) : d;
       }
-      function R(T, B) {
+      function R(T, D) {
         var w, M;
-        return T && T.state ? (M = T.state, B < 0 ? (w = 0, B = -B) : (w = 1 + (B >> 4), B < 48 && (B &= 15)), B && (B < 8 || 15 < B) ? d : (M.window !== null && M.wbits !== B && (M.window = null), M.wrap = w, M.wbits = B, S(T))) : d;
+        return T && T.state ? (M = T.state, D < 0 ? (w = 0, D = -D) : (w = 1 + (D >> 4), D < 48 && (D &= 15)), D && (D < 8 || 15 < D) ? d : (M.window !== null && M.wbits !== D && (M.window = null), M.wrap = w, M.wbits = D, S(T))) : d;
       }
-      function F(T, B) {
+      function F(T, D) {
         var w, M;
-        return T ? (M = new y(), (T.state = M).window = null, (w = R(T, B)) !== b && (T.state = null), w) : d;
+        return T ? (M = new y(), (T.state = M).window = null, (w = R(T, D)) !== b && (T.state = null), w) : d;
       }
       var _, G, z = !0;
       function W(T) {
         if (z) {
-          var B;
-          for (_ = new s.Buf32(512), G = new s.Buf32(32), B = 0; B < 144; ) T.lens[B++] = 8;
-          for (; B < 256; ) T.lens[B++] = 9;
-          for (; B < 280; ) T.lens[B++] = 7;
-          for (; B < 288; ) T.lens[B++] = 8;
-          for (u(m, T.lens, 0, 288, _, 0, T.work, { bits: 9 }), B = 0; B < 32; ) T.lens[B++] = 5;
+          var D;
+          for (_ = new s.Buf32(512), G = new s.Buf32(32), D = 0; D < 144; ) T.lens[D++] = 8;
+          for (; D < 256; ) T.lens[D++] = 9;
+          for (; D < 280; ) T.lens[D++] = 7;
+          for (; D < 288; ) T.lens[D++] = 8;
+          for (u(m, T.lens, 0, 288, _, 0, T.work, { bits: 9 }), D = 0; D < 32; ) T.lens[D++] = 5;
           u(v, T.lens, 0, 32, G, 0, T.work, { bits: 5 }), z = !1;
         }
         T.lencode = _, T.lenbits = 9, T.distcode = G, T.distbits = 5;
       }
-      function ee(T, B, w, M) {
+      function ee(T, D, w, M) {
         var ie, Z = T.state;
-        return Z.window === null && (Z.wsize = 1 << Z.wbits, Z.wnext = 0, Z.whave = 0, Z.window = new s.Buf8(Z.wsize)), M >= Z.wsize ? (s.arraySet(Z.window, B, w - Z.wsize, Z.wsize, 0), Z.wnext = 0, Z.whave = Z.wsize) : (M < (ie = Z.wsize - Z.wnext) && (ie = M), s.arraySet(Z.window, B, w - M, ie, Z.wnext), (M -= ie) ? (s.arraySet(Z.window, B, w - M, M, 0), Z.wnext = M, Z.whave = Z.wsize) : (Z.wnext += ie, Z.wnext === Z.wsize && (Z.wnext = 0), Z.whave < Z.wsize && (Z.whave += ie))), 0;
+        return Z.window === null && (Z.wsize = 1 << Z.wbits, Z.wnext = 0, Z.whave = 0, Z.window = new s.Buf8(Z.wsize)), M >= Z.wsize ? (s.arraySet(Z.window, D, w - Z.wsize, Z.wsize, 0), Z.wnext = 0, Z.whave = Z.wsize) : (M < (ie = Z.wsize - Z.wnext) && (ie = M), s.arraySet(Z.window, D, w - M, ie, Z.wnext), (M -= ie) ? (s.arraySet(Z.window, D, w - M, M, 0), Z.wnext = M, Z.whave = Z.wsize) : (Z.wnext += ie, Z.wnext === Z.wsize && (Z.wnext = 0), Z.whave < Z.wsize && (Z.whave += ie))), 0;
       }
       n.inflateReset = S, n.inflateReset2 = R, n.inflateResetKeep = A, n.inflateInit = function(T) {
         return F(T, 15);
-      }, n.inflateInit2 = F, n.inflate = function(T, B) {
-        var w, M, ie, Z, oe, J, re, j, L, ne, Q, Y, ge, Ee, le, ue, ye, ve, Fe, Le, c, D, O, k, E = 0, I = new s.Buf8(4), N = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+      }, n.inflateInit2 = F, n.inflate = function(T, D) {
+        var w, M, ie, Z, oe, J, re, j, L, ne, Q, Y, ge, Ee, le, ue, ye, ve, Fe, Le, c, B, O, k, E = 0, I = new s.Buf8(4), N = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
         if (!T || !T.state || !T.output || !T.input && T.avail_in !== 0) return d;
-        (w = T.state).mode === 12 && (w.mode = 13), oe = T.next_out, ie = T.output, re = T.avail_out, Z = T.next_in, M = T.input, J = T.avail_in, j = w.hold, L = w.bits, ne = J, Q = re, D = b;
+        (w = T.state).mode === 12 && (w.mode = 13), oe = T.next_out, ie = T.output, re = T.avail_out, Z = T.next_in, M = T.input, J = T.avail_in, j = w.hold, L = w.bits, ne = J, Q = re, B = b;
         e: for (; ; ) switch (w.mode) {
           case p:
             if (w.wrap === 0) {
@@ -6712,7 +6712,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             if (w.havedict === 0) return T.next_out = oe, T.avail_out = re, T.next_in = Z, T.avail_in = J, w.hold = j, w.bits = L, 2;
             T.adler = w.check = 1, w.mode = 12;
           case 12:
-            if (B === 5 || B === 6) break e;
+            if (D === 5 || D === 6) break e;
           case 13:
             if (w.last) {
               j >>>= 7 & L, L -= 7 & L, w.mode = 27;
@@ -6727,7 +6727,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
                 w.mode = 14;
                 break;
               case 1:
-                if (W(w), w.mode = 20, B !== 6) break;
+                if (W(w), w.mode = 20, D !== 6) break;
                 j >>>= 2, L -= 2;
                 break e;
               case 2:
@@ -6747,7 +6747,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               T.msg = "invalid stored block lengths", w.mode = 30;
               break;
             }
-            if (w.length = 65535 & j, L = j = 0, w.mode = 15, B === 6) break e;
+            if (w.length = 65535 & j, L = j = 0, w.mode = 15, D === 6) break e;
           case 15:
             w.mode = 16;
           case 16:
@@ -6777,7 +6777,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               w.lens[N[w.have++]] = 7 & j, j >>>= 3, L -= 3;
             }
             for (; w.have < 19; ) w.lens[N[w.have++]] = 0;
-            if (w.lencode = w.lendyn, w.lenbits = 7, O = { bits: w.lenbits }, D = u(0, w.lens, 0, 19, w.lencode, 0, w.work, O), w.lenbits = O.bits, D) {
+            if (w.lencode = w.lendyn, w.lenbits = 7, O = { bits: w.lenbits }, B = u(0, w.lens, 0, 19, w.lencode, 0, w.work, O), w.lenbits = O.bits, B) {
               T.msg = "invalid code lengths set", w.mode = 30;
               break;
             }
@@ -6825,15 +6825,15 @@ https://github.com/nodeca/pako/blob/main/LICENSE
               T.msg = "invalid code -- missing end-of-block", w.mode = 30;
               break;
             }
-            if (w.lenbits = 9, O = { bits: w.lenbits }, D = u(m, w.lens, 0, w.nlen, w.lencode, 0, w.work, O), w.lenbits = O.bits, D) {
+            if (w.lenbits = 9, O = { bits: w.lenbits }, B = u(m, w.lens, 0, w.nlen, w.lencode, 0, w.work, O), w.lenbits = O.bits, B) {
               T.msg = "invalid literal/lengths set", w.mode = 30;
               break;
             }
-            if (w.distbits = 6, w.distcode = w.distdyn, O = { bits: w.distbits }, D = u(v, w.lens, w.nlen, w.ndist, w.distcode, 0, w.work, O), w.distbits = O.bits, D) {
+            if (w.distbits = 6, w.distcode = w.distdyn, O = { bits: w.distbits }, B = u(v, w.lens, w.nlen, w.ndist, w.distcode, 0, w.work, O), w.distbits = O.bits, B) {
               T.msg = "invalid distances set", w.mode = 30;
               break;
             }
-            if (w.mode = 20, B === 6) break e;
+            if (w.mode = 20, D === 6) break e;
           case 20:
             w.mode = 21;
           case 21:
@@ -6947,10 +6947,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
             }
             w.mode = 29;
           case 29:
-            D = 1;
+            B = 1;
             break e;
           case 30:
-            D = -3;
+            B = -3;
             break e;
           case 31:
             return -4;
@@ -6958,38 +6958,38 @@ https://github.com/nodeca/pako/blob/main/LICENSE
           default:
             return d;
         }
-        return T.next_out = oe, T.avail_out = re, T.next_in = Z, T.avail_in = J, w.hold = j, w.bits = L, (w.wsize || Q !== T.avail_out && w.mode < 30 && (w.mode < 27 || B !== 4)) && ee(T, T.output, T.next_out, Q - T.avail_out) ? (w.mode = 31, -4) : (ne -= T.avail_in, Q -= T.avail_out, T.total_in += ne, T.total_out += Q, w.total += Q, w.wrap && Q && (T.adler = w.check = w.flags ? o(w.check, ie, Q, T.next_out - Q) : a(w.check, ie, Q, T.next_out - Q)), T.data_type = w.bits + (w.last ? 64 : 0) + (w.mode === 12 ? 128 : 0) + (w.mode === 20 || w.mode === 15 ? 256 : 0), (ne == 0 && Q === 0 || B === 4) && D === b && (D = -5), D);
+        return T.next_out = oe, T.avail_out = re, T.next_in = Z, T.avail_in = J, w.hold = j, w.bits = L, (w.wsize || Q !== T.avail_out && w.mode < 30 && (w.mode < 27 || D !== 4)) && ee(T, T.output, T.next_out, Q - T.avail_out) ? (w.mode = 31, -4) : (ne -= T.avail_in, Q -= T.avail_out, T.total_in += ne, T.total_out += Q, w.total += Q, w.wrap && Q && (T.adler = w.check = w.flags ? o(w.check, ie, Q, T.next_out - Q) : a(w.check, ie, Q, T.next_out - Q)), T.data_type = w.bits + (w.last ? 64 : 0) + (w.mode === 12 ? 128 : 0) + (w.mode === 20 || w.mode === 15 ? 256 : 0), (ne == 0 && Q === 0 || D === 4) && B === b && (B = -5), B);
       }, n.inflateEnd = function(T) {
         if (!T || !T.state) return d;
-        var B = T.state;
-        return B.window && (B.window = null), T.state = null, b;
-      }, n.inflateGetHeader = function(T, B) {
+        var D = T.state;
+        return D.window && (D.window = null), T.state = null, b;
+      }, n.inflateGetHeader = function(T, D) {
         var w;
-        return T && T.state && 2 & (w = T.state).wrap ? ((w.head = B).done = !1, b) : d;
-      }, n.inflateSetDictionary = function(T, B) {
-        var w, M = B.length;
-        return T && T.state ? (w = T.state).wrap !== 0 && w.mode !== 11 ? d : w.mode === 11 && a(1, B, M, 0) !== w.check ? -3 : ee(T, B, M, M) ? (w.mode = 31, -4) : (w.havedict = 1, b) : d;
+        return T && T.state && 2 & (w = T.state).wrap ? ((w.head = D).done = !1, b) : d;
+      }, n.inflateSetDictionary = function(T, D) {
+        var w, M = D.length;
+        return T && T.state ? (w = T.state).wrap !== 0 && w.mode !== 11 ? d : w.mode === 11 && a(1, D, M, 0) !== w.check ? -3 : ee(T, D, M, M) ? (w.mode = 31, -4) : (w.havedict = 1, b) : d;
       }, n.inflateInfo = "pako inflate (from Nodeca project)";
     }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(t, r, n) {
       var s = t("../utils/common"), a = [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], l = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0], u = [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];
       r.exports = function(m, v, b, d, p, f, h, g) {
-        var y, A, S, R, F, _, G, z, W, ee = g.bits, T = 0, B = 0, w = 0, M = 0, ie = 0, Z = 0, oe = 0, J = 0, re = 0, j = 0, L = null, ne = 0, Q = new s.Buf16(16), Y = new s.Buf16(16), ge = null, Ee = 0;
+        var y, A, S, R, F, _, G, z, W, ee = g.bits, T = 0, D = 0, w = 0, M = 0, ie = 0, Z = 0, oe = 0, J = 0, re = 0, j = 0, L = null, ne = 0, Q = new s.Buf16(16), Y = new s.Buf16(16), ge = null, Ee = 0;
         for (T = 0; T <= 15; T++) Q[T] = 0;
-        for (B = 0; B < d; B++) Q[v[b + B]]++;
+        for (D = 0; D < d; D++) Q[v[b + D]]++;
         for (ie = ee, M = 15; 1 <= M && Q[M] === 0; M--) ;
         if (M < ie && (ie = M), M === 0) return p[f++] = 20971520, p[f++] = 20971520, g.bits = 1, 0;
         for (w = 1; w < M && Q[w] === 0; w++) ;
         for (ie < w && (ie = w), T = J = 1; T <= 15; T++) if (J <<= 1, (J -= Q[T]) < 0) return -1;
         if (0 < J && (m === 0 || M !== 1)) return -1;
         for (Y[1] = 0, T = 1; T < 15; T++) Y[T + 1] = Y[T] + Q[T];
-        for (B = 0; B < d; B++) v[b + B] !== 0 && (h[Y[v[b + B]]++] = B);
-        if (_ = m === 0 ? (L = ge = h, 19) : m === 1 ? (L = a, ne -= 257, ge = o, Ee -= 257, 256) : (L = l, ge = u, -1), T = w, F = f, oe = B = j = 0, S = -1, R = (re = 1 << (Z = ie)) - 1, m === 1 && 852 < re || m === 2 && 592 < re) return 1;
+        for (D = 0; D < d; D++) v[b + D] !== 0 && (h[Y[v[b + D]]++] = D);
+        if (_ = m === 0 ? (L = ge = h, 19) : m === 1 ? (L = a, ne -= 257, ge = o, Ee -= 257, 256) : (L = l, ge = u, -1), T = w, F = f, oe = D = j = 0, S = -1, R = (re = 1 << (Z = ie)) - 1, m === 1 && 852 < re || m === 2 && 592 < re) return 1;
         for (; ; ) {
-          for (G = T - oe, W = h[B] < _ ? (z = 0, h[B]) : h[B] > _ ? (z = ge[Ee + h[B]], L[ne + h[B]]) : (z = 96, 0), y = 1 << T - oe, w = A = 1 << Z; p[F + (j >> oe) + (A -= y)] = G << 24 | z << 16 | W | 0, A !== 0; ) ;
+          for (G = T - oe, W = h[D] < _ ? (z = 0, h[D]) : h[D] > _ ? (z = ge[Ee + h[D]], L[ne + h[D]]) : (z = 96, 0), y = 1 << T - oe, w = A = 1 << Z; p[F + (j >> oe) + (A -= y)] = G << 24 | z << 16 | W | 0, A !== 0; ) ;
           for (y = 1 << T - 1; j & y; ) y >>= 1;
-          if (y !== 0 ? (j &= y - 1, j += y) : j = 0, B++, --Q[T] == 0) {
+          if (y !== 0 ? (j &= y - 1, j += y) : j = 0, D++, --Q[T] == 0) {
             if (T === M) break;
-            T = v[b + h[B]];
+            T = v[b + h[D]];
           }
           if (ie < T && (j & R) !== S) {
             for (oe === 0 && (oe = ie), F += w, J = 1 << (Z = T - oe); Z + oe < M && !((J -= Q[Z + oe]) <= 0); ) Z++, J <<= 1;
@@ -7010,8 +7010,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
       l(ee);
       var T = new Array(2 * d);
       l(T);
-      var B = new Array(512);
-      l(B);
+      var D = new Array(512);
+      l(D);
       var w = new Array(256);
       l(w);
       var M = new Array(m);
@@ -7024,7 +7024,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         this.dyn_tree = E, this.max_code = 0, this.stat_desc = I;
       }
       function L(E) {
-        return E < 256 ? B[E] : B[256 + (E >>> 7)];
+        return E < 256 ? D[E] : D[256 + (E >>> 7)];
       }
       function ne(E, I) {
         E.pending_buf[E.pending++] = 255 & I, E.pending_buf[E.pending++] = I >>> 8 & 255;
@@ -7093,7 +7093,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         var U, P, q = -1, $ = I[1], X = 0, te = 7, me = 4;
         for ($ === 0 && (te = 138, me = 3), I[2 * (N + 1) + 1] = 65535, U = 0; U <= N; U++) P = $, $ = I[2 * (U + 1) + 1], ++X < te && P === $ || (X < me ? E.bl_tree[2 * P] += X : P !== 0 ? (P !== q && E.bl_tree[2 * P]++, E.bl_tree[2 * S]++) : X <= 10 ? E.bl_tree[2 * R]++ : E.bl_tree[2 * F]++, q = P, me = (X = 0) === $ ? (te = 138, 3) : P === $ ? (te = 6, 3) : (te = 7, 4));
       }
-      function D(E, I, N) {
+      function B(E, I, N) {
         var U, P, q = -1, $ = I[1], X = 0, te = 7, me = 4;
         for ($ === 0 && (te = 138, me = 3), U = 0; U <= N; U++) if (P = $, $ = I[2 * (U + 1) + 1], !(++X < te && P === $)) {
           if (X < me) for (; Y(E, P, E.bl_tree), --X != 0; ) ;
@@ -7112,8 +7112,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         O || (function() {
           var I, N, U, P, q, $ = new Array(h + 1);
           for (P = U = 0; P < m - 1; P++) for (M[P] = U, I = 0; I < 1 << _[P]; I++) w[U++] = P;
-          for (w[U - 1] = P, P = q = 0; P < 16; P++) for (J[P] = q, I = 0; I < 1 << G[P]; I++) B[q++] = P;
-          for (q >>= 7; P < d; P++) for (J[P] = q << 7, I = 0; I < 1 << G[P] - 7; I++) B[256 + q++] = P;
+          for (w[U - 1] = P, P = q = 0; P < 16; P++) for (J[P] = q, I = 0; I < 1 << G[P]; I++) D[q++] = P;
+          for (q >>= 7; P < d; P++) for (J[P] = q << 7, I = 0; I < 1 << G[P] - 7; I++) D[256 + q++] = P;
           for (N = 0; N <= h; N++) $[N] = 0;
           for (I = 0; I <= 143; ) ee[2 * I + 1] = 8, I++, $[8]++;
           for (; I <= 255; ) ee[2 * I + 1] = 9, I++, $[9]++;
@@ -7137,7 +7137,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
         }(E), P = E.opt_len + 3 + 7 >>> 3, (q = E.static_len + 3 + 7 >>> 3) <= P && (P = q)) : P = q = N + 5, N + 4 <= P && I !== -1 ? k(E, I, N, U) : E.strategy === 4 || q === P ? (Q(E, 2 + (U ? 1 : 0), 3), Fe(E, ee, T)) : (Q(E, 4 + (U ? 1 : 0), 3), function(X, te, me, ce) {
           var Se;
           for (Q(X, te - 257, 5), Q(X, me - 1, 5), Q(X, ce - 4, 4), Se = 0; Se < ce; Se++) Q(X, X.bl_tree[2 * W[Se] + 1], 3);
-          D(X, X.dyn_ltree, te - 1), D(X, X.dyn_dtree, me - 1);
+          B(X, X.dyn_ltree, te - 1), B(X, X.dyn_dtree, me - 1);
         }(E, E.l_desc.max_code + 1, E.d_desc.max_code + 1, $ + 1), Fe(E, E.dyn_ltree, E.dyn_dtree)), le(E), U && ue(E);
       }, n._tr_tally = function(E, I, N) {
         return E.pending_buf[E.d_buf + 2 * E.last_lit] = I >>> 8 & 255, E.pending_buf[E.d_buf + 2 * E.last_lit + 1] = 255 & I, E.pending_buf[E.l_buf + E.last_lit] = 255 & N, E.last_lit++, I === 0 ? E.dyn_ltree[2 * N]++ : (E.matches++, I--, E.dyn_ltree[2 * (w[N] + v + 1)]++, E.dyn_dtree[2 * L(I)]++), E.last_lit === E.lit_bufsize - 1;
@@ -7259,7 +7259,7 @@ function oi(i) {
       e(null);
   });
 }
-const Ba = async ({
+const Da = async ({
   tableId: i,
   fileName: e,
   jsxElement: t,
@@ -7394,7 +7394,7 @@ const Ba = async ({
     }, r * 1e3));
   }
   a(`#${m}`);
-}), Da = (i) => {
+}), Ba = (i) => {
   const e = window.document.querySelector(i);
   e !== null && (e.className = "f-function-notification-hidden", setTimeout(() => {
     e.classList.remove("f-function-notification-visible");
@@ -7410,11 +7410,11 @@ function Jn(i, e) {
 const { toString: ci } = Object.prototype, { getPrototypeOf: sn } = Object, Ft = /* @__PURE__ */ ((i) => (e) => {
   const t = ci.call(e);
   return i[t] || (i[t] = t.slice(8, -1).toLowerCase());
-})(/* @__PURE__ */ Object.create(null)), De = (i) => (i = i.toLowerCase(), (e) => Ft(e) === i), Lt = (i) => (e) => typeof e === i, { isArray: at } = Array, wt = Lt("undefined");
+})(/* @__PURE__ */ Object.create(null)), Be = (i) => (i = i.toLowerCase(), (e) => Ft(e) === i), Lt = (i) => (e) => typeof e === i, { isArray: at } = Array, wt = Lt("undefined");
 function di(i) {
   return i !== null && !wt(i) && i.constructor !== null && !wt(i.constructor) && je(i.constructor.isBuffer) && i.constructor.isBuffer(i);
 }
-const qn = De("ArrayBuffer");
+const qn = Be("ArrayBuffer");
 function ui(i) {
   let e;
   return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? e = ArrayBuffer.isView(i) : e = i && i.buffer && qn(i.buffer), e;
@@ -7424,11 +7424,11 @@ const fi = Lt("string"), je = Lt("function"), Xn = Lt("number"), jt = (i) => i !
     return !1;
   const e = sn(i);
   return (e === null || e === Object.prototype || Object.getPrototypeOf(e) === null) && !(Symbol.toStringTag in i) && !(Symbol.iterator in i);
-}, mi = De("Date"), pi = De("File"), wi = De("Blob"), gi = De("FileList"), yi = (i) => jt(i) && je(i.pipe), vi = (i) => {
+}, mi = Be("Date"), pi = Be("File"), wi = Be("Blob"), gi = Be("FileList"), yi = (i) => jt(i) && je(i.pipe), vi = (i) => {
   let e;
   return i && (typeof FormData == "function" && i instanceof FormData || je(i.append) && ((e = Ft(i)) === "formdata" || // detect form-data instance
   e === "object" && je(i.toString) && i.toString() === "[object FormData]"));
-}, bi = De("URLSearchParams"), [xi, Ei, Ai, ki] = ["ReadableStream", "Request", "Response", "Headers"].map(De), Ci = (i) => i.trim ? i.trim() : i.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
+}, bi = Be("URLSearchParams"), [xi, Ei, Ai, ki] = ["ReadableStream", "Request", "Response", "Headers"].map(Be), Ci = (i) => i.trim ? i.trim() : i.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
 function yt(i, e, { allOwnKeys: t = !1 } = {}) {
   if (i === null || typeof i > "u")
     return;
@@ -7504,18 +7504,18 @@ const Si = (i, e, t, { allOwnKeys: r } = {}) => (yt(e, (n, s) => {
   for (; (t = i.exec(e)) !== null; )
     r.push(t);
   return r;
-}, Oi = De("HTMLFormElement"), Hi = (i) => i.toLowerCase().replace(
+}, Oi = Be("HTMLFormElement"), Hi = (i) => i.toLowerCase().replace(
   /[-_\s]([a-z\d])(\w*)/g,
   function(t, r, n) {
     return r.toUpperCase() + n;
   }
-), Tn = (({ hasOwnProperty: i }) => (e, t) => i.call(e, t))(Object.prototype), zi = De("RegExp"), Qn = (i, e) => {
+), Tn = (({ hasOwnProperty: i }) => (e, t) => i.call(e, t))(Object.prototype), zi = Be("RegExp"), Qn = (i, e) => {
   const t = Object.getOwnPropertyDescriptors(i), r = {};
   yt(t, (n, s) => {
     let a;
     (a = e(n, s, i)) !== !1 && (r[s] = a || n);
   }), Object.defineProperties(i, r);
-}, Bi = (i) => {
+}, Di = (i) => {
   Qn(i, (e, t) => {
     if (je(i) && ["arguments", "caller", "callee"].indexOf(t) !== -1)
       return !1;
@@ -7530,7 +7530,7 @@ const Si = (i, e, t, { allOwnKeys: r } = {}) => (yt(e, (n, s) => {
       });
     }
   });
-}, Di = (i, e) => {
+}, Bi = (i, e) => {
   const t = {}, r = (n) => {
     n.forEach((s) => {
       t[s] = !0;
@@ -7569,7 +7569,7 @@ const Gi = (i) => {
     return r;
   };
   return t(i, 0);
-}, Vi = De("AsyncFunction"), Zi = (i) => i && (jt(i) || je(i)) && je(i.then) && je(i.catch), er = ((i, e) => i ? setImmediate : e ? ((t, r) => (Ye.addEventListener("message", ({ source: n, data: s }) => {
+}, Vi = Be("AsyncFunction"), Zi = (i) => i && (jt(i) || je(i)) && je(i.then) && je(i.catch), er = ((i, e) => i ? setImmediate : e ? ((t, r) => (Ye.addEventListener("message", ({ source: n, data: s }) => {
   n === Ye && s === t && r.length && r.shift()();
 }, !1), (n) => {
   r.push(n), Ye.postMessage(t, "*");
@@ -7609,7 +7609,7 @@ const Gi = (i) => {
   inherits: Ri,
   toFlatObject: Ii,
   kindOf: Ft,
-  kindOfTest: De,
+  kindOfTest: Be,
   endsWith: _i,
   toArray: Pi,
   forEachEntry: Li,
@@ -7619,8 +7619,8 @@ const Gi = (i) => {
   hasOwnProp: Tn,
   // an alias to avoid ESLint no-prototype-builtins detection
   reduceDescriptors: Qn,
-  freezeMethods: Bi,
-  toObjectSet: Di,
+  freezeMethods: Di,
+  toObjectSet: Bi,
   toCamelCase: Hi,
   noop: Mi,
   toFiniteNumber: Ni,
@@ -7881,14 +7881,14 @@ self instanceof WorkerGlobalScope && typeof self.importScripts == "function", is
   hasStandardBrowserEnv: ns,
   hasStandardBrowserWebWorkerEnv: rs,
   origin: is
-}, Symbol.toStringTag, { value: "Module" })), Be = {
+}, Symbol.toStringTag, { value: "Module" })), De = {
   ...ss,
   ...ts
 };
 function as(i, e) {
-  return Ot(i, new Be.classes.URLSearchParams(), Object.assign({
+  return Ot(i, new De.classes.URLSearchParams(), Object.assign({
     visitor: function(t, r, n, s) {
-      return Be.isNode && H.isBuffer(t) ? (this.append(r, t.toString("base64")), !1) : s.defaultVisitor.apply(this, arguments);
+      return De.isNode && H.isBuffer(t) ? (this.append(r, t.toString("base64")), !1) : s.defaultVisitor.apply(this, arguments);
     }
   }, e));
 }
@@ -7982,8 +7982,8 @@ const vt = {
   maxContentLength: -1,
   maxBodyLength: -1,
   env: {
-    FormData: Be.classes.FormData,
-    Blob: Be.classes.Blob
+    FormData: De.classes.FormData,
+    Blob: De.classes.Blob
   },
   validateStatus: function(e) {
     return e >= 200 && e < 300;
@@ -8275,7 +8275,7 @@ const It = (i, e, t = 3) => {
     total: i,
     loaded: r
   }), e[1]];
-}, jn = (i) => (...e) => H.asap(() => i(...e)), vs = Be.hasStandardBrowserEnv ? (
+}, jn = (i) => (...e) => H.asap(() => i(...e)), vs = De.hasStandardBrowserEnv ? (
   // Standard browser envs have full support of the APIs needed to test
   // whether the request URL is of the same origin as current location.
   function() {
@@ -8306,7 +8306,7 @@ const It = (i, e, t = 3) => {
       return !0;
     };
   }()
-), bs = Be.hasStandardBrowserEnv ? (
+), bs = De.hasStandardBrowserEnv ? (
   // Standard browser envs support document.cookie
   {
     write(i, e, t, r, n, s) {
@@ -8416,14 +8416,14 @@ const ur = (i) => {
   );
   let l;
   if (H.isFormData(t)) {
-    if (Be.hasStandardBrowserEnv || Be.hasStandardBrowserWebWorkerEnv)
+    if (De.hasStandardBrowserEnv || De.hasStandardBrowserWebWorkerEnv)
       a.setContentType(void 0);
     else if ((l = a.getContentType()) !== !1) {
       const [u, ...m] = l ? l.split(";").map((v) => v.trim()).filter(Boolean) : [];
       a.setContentType([u || "multipart/form-data", ...m].join("; "));
     }
   }
-  if (Be.hasStandardBrowserEnv && (r && H.isFunction(r) && (r = r(e)), r || r !== !1 && vs(e.url))) {
+  if (De.hasStandardBrowserEnv && (r && H.isFunction(r) && (r = r(e)), r || r !== !1 && vs(e.url))) {
     const u = n && s && bs.read(s);
     u && a.set(n, u);
   }
@@ -8479,7 +8479,7 @@ const ur = (i) => {
       h && (r(!A || A.type ? new ot(null, i, h) : A), h.abort(), h = null);
     }, n.cancelToken && n.cancelToken.subscribe(m), n.signal && (n.signal.aborted ? m() : n.signal.addEventListener("abort", m)));
     const y = ws(n.url);
-    if (y && Be.protocols.indexOf(y) === -1) {
+    if (y && De.protocols.indexOf(y) === -1) {
       r(new ae("Unsupported protocol " + y + ":", ae.ERR_BAD_REQUEST, i));
       return;
     }
@@ -8556,7 +8556,7 @@ const ur = (i) => {
   }
 }, Rs = fr && hr(() => {
   let i = !1;
-  const e = new Request(Be.origin, {
+  const e = new Request(De.origin, {
     body: new ReadableStream(),
     method: "POST",
     get duplex() {
@@ -8687,7 +8687,7 @@ H.forEach(en, (i, e) => {
     Object.defineProperty(i, "adapterName", { value: e });
   }
 });
-const Bn = (i) => `- ${i}`, Fs = (i) => H.isFunction(i) || i === null || i === !1, mr = {
+const Dn = (i) => `- ${i}`, Fs = (i) => H.isFunction(i) || i === null || i === !1, mr = {
   getAdapter: (i) => {
     i = H.isArray(i) ? i : [i];
     const { length: e } = i;
@@ -8707,8 +8707,8 @@ const Bn = (i) => `- ${i}`, Fs = (i) => H.isFunction(i) || i === null || i === !
         ([o, l]) => `adapter ${o} ` + (l === !1 ? "is not supported by the environment" : "is not available in the build")
       );
       let a = e ? s.length > 1 ? `since :
-` + s.map(Bn).join(`
-`) : " " + Bn(s[0]) : "as no adapter specified";
+` + s.map(Dn).join(`
+`) : " " + Dn(s[0]) : "as no adapter specified";
       throw new ae(
         "There is no suitable adapter to dispatch the request " + a,
         "ERR_NOT_SUPPORT"
@@ -8722,7 +8722,7 @@ function Zt(i) {
   if (i.cancelToken && i.cancelToken.throwIfRequested(), i.signal && i.signal.aborted)
     throw new ot(null, i);
 }
-function Dn(i) {
+function Bn(i) {
   return Zt(i), i.headers = Pe.from(i.headers), i.data = Vt.call(
     i,
     i.transformRequest
@@ -8852,7 +8852,7 @@ class Qe {
     });
     let m, v = 0, b;
     if (!l) {
-      const p = [Dn.bind(this), void 0];
+      const p = [Bn.bind(this), void 0];
       for (p.unshift.apply(p, o), p.push.apply(p, u), b = p.length, m = Promise.resolve(t); v < b; )
         m = m.then(p[v++], p[v++]);
       return m;
@@ -8869,7 +8869,7 @@ class Qe {
       }
     }
     try {
-      m = Dn.call(this, d);
+      m = Bn.call(this, d);
     } catch (p) {
       return Promise.reject(p);
     }
@@ -9076,36 +9076,36 @@ ke.formToJSON = (i) => or(H.isHTMLForm(i) ? new FormData(i) : i);
 ke.getAdapter = mr.getAdapter;
 ke.HttpStatusCode = nn;
 ke.default = ke;
-const Ma = ({ doNotUseState: i = !1, defaultState: e = null }) => {
-  const [t, r] = ze(e), [n, s] = ze(!1), [a, o] = ze(null), l = async (m) => {
-    var v, b, d;
-    s(!0), o(null);
+const Ma = ({ doNotUseState: i = !1, defaultState: e = null, getValueByPath: t = void 0 } = {}) => {
+  const [r, n] = ze(e === void 0 ? null : e), [s, a] = ze(!1), [o, l] = ze(null);
+  return { data: r, loading: s, error: o, execute: async (v) => {
+    var b, d, p;
+    a(!0), l(null);
     try {
-      const p = await ke(m);
-      return i || r(p.data), p.data;
-    } catch (p) {
-      const f = p, h = ((b = (v = f.response) == null ? void 0 : v.data) == null ? void 0 : b.message) || f.message || "Unknown error";
+      const f = await ke(v);
+      return i || n(f.data), t ? t.split(".").reduce((h, g) => h && h[g], f.data) : f.data;
+    } catch (f) {
+      const h = f, g = ((d = (b = h.response) == null ? void 0 : b.data) == null ? void 0 : d.message) || h.message || "Unknown error";
       return li({
         variant: "error",
         title: "Ошибка",
-        body: `- При отправке данных произошла ошибка ${(d = f.response) == null ? void 0 : d.status}
-- ${h}`,
+        body: `- При отправке данных произошла ошибка ${(p = h.response) == null ? void 0 : p.status}
+- ${g}`,
         timeSecClose: 5
-      }), o(h), null;
+      }), l(g), null;
     } finally {
-      s(!1);
+      a(!1);
     }
-  }, u = (m) => {
-    r(m);
-  };
-  return i ? { loading: n, error: a, execute: l } : { data: t, loading: n, error: a, execute: l, reset: u };
+  }, reset: (v) => {
+    i || n(v);
+  } };
 };
 export {
   aa as FAccordion,
   ma as FAlert,
   qt as FArrowIcon,
   Un as FButton,
-  Bs as FButtonFile,
+  Ds as FButtonFile,
   xa as FCarousel,
   Ea as FCarouselItem,
   Sa as FCheckIcon,
@@ -9153,17 +9153,17 @@ export {
   Vs as FTableRow,
   wa as FTabs,
   ha as FTextArea,
-  Ds as FTextField,
+  Bs as FTextField,
   ra as FTimeline,
   ia as FTimelineCard,
   Ca as FTrashIcon,
   Pa as FUnlinkIcon,
   ja as fAlert,
   Oa as fConfirm,
-  Ba as fExportHtmlOrJsxToWord,
+  Da as fExportHtmlOrJsxToWord,
   za as fExportTableToExcel,
   li as fNotification,
-  Da as fNotificationDelete,
+  Ba as fNotificationDelete,
   Ha as fPrompt,
   Ma as useFApi
 };

package/dist/types/hooks/useFApi/useFApi.d.ts

@@ -1,14 +1,15 @@
 import { AxiosRequestConfig } from 'axios';
 export type IUseFApi<T> = {
-    data?: T | null;
+    data: T | null;
     loading: boolean;
     error: string | null;
     execute: (config: AxiosRequestConfig) => Promise<T | null>;
-    reset?: (newData: T | null) => void;
+    reset: (newData: T | null) => void;
 };
 type IProps<T> = {
     doNotUseState?: boolean;
     defaultState?: T | null;
+    getValueByPath?: string;
 };
-declare const useFApi: <T>({ doNotUseState, defaultState }: IProps<T>) => IUseFApi<T>;
+declare const useFApi: <T>({ doNotUseState, defaultState, getValueByPath }?: IProps<T>) => IUseFApi<T>;
 export default useFApi;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "fui-material",
-  "version": "1.17.1",
+  "version": "1.17.3",
   "publishConfig": {
     "access": "public",
     "registry": "https://registry.npmjs.org/"