@work-zhanguo/light-file-preview 0.0.6 → 0.0.8

package/dist/{docx-preview-D_8kC8vU.js → docx-preview-BV-bQyiM.js}

@@ -1,10 +1,4 @@
-var Mt = typeof globalThis != "undefined" ? globalThis : typeof window != "undefined" ? window : typeof global != "undefined" ? global : typeof self != "undefined" ? self : {};
-function _e(c) {
-  return c && c.__esModule && Object.prototype.hasOwnProperty.call(c, "default") ? c.default : c;
-}
-function Rt(c) {
-  throw new Error('Could not dynamically require "' + c + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
-}
+import { c as Mt, a as Rt, b as _e } from "./_commonjs-dynamic-modules-C74YT1gS.js";
 var Lt = { exports: {} };
 /*!
 
@@ -17,9 +11,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
 */
-var qt;
+var Kt;
 function we() {
-  return qt || (qt = 1, (function(c, e) {
+  return Kt || (Kt = 1, (function(c, e) {
     (function(t) {
       c.exports = t();
     })(function() {
@@ -27,7 +21,7 @@ function we() {
         function o(b, y) {
           if (!n[b]) {
             if (!r[b]) {
-              var _ = typeof Rt == "function" && Rt;
+              var _ = typeof Mt == "function" && Mt;
               if (!y && _) return _(b, !0);
               if (i) return i(b, !0);
               var w = new Error("Cannot find module '" + b + "'");
@@ -41,7 +35,7 @@ function we() {
           }
           return n[b].exports;
         }
-        for (var i = typeof Rt == "function" && Rt, h = 0; h < a.length; h++) o(a[h]);
+        for (var i = typeof Mt == "function" && Mt, h = 0; h < a.length; h++) o(a[h]);
         return o;
       })({ 1: [function(t, r, n) {
         var a = t("./utils"), o = t("./support"), i = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
@@ -145,9 +139,9 @@ function we() {
           })(P.unixPermissions, rt)) : (J = 20, z |= (function(X) {
             return 63 & (X || 0);
           })(P.dosPermissions)), x = H.getUTCHours(), x <<= 6, x |= H.getUTCMinutes(), x <<= 5, x |= H.getUTCSeconds() / 2, A = H.getUTCFullYear() - 1980, A <<= 4, A |= H.getUTCMonth() + 1, A <<= 5, A |= H.getUTCDate(), I && (et = a(1, 1) + a(y(W), 4) + T, L += "up" + a(et.length, 2) + et), l && ($ = a(1, 1) + a(y(Q), 4) + S, L += "uc" + a($.length, 2) + $);
-          var q = "";
-          return q += `
-\0`, q += a(M, 2), q += D.magic, q += a(x, 2), q += a(A, 2), q += a(tt.crc32, 4), q += a(tt.compressedSize, 4), q += a(tt.uncompressedSize, 4), q += a(W.length, 2), q += a(L.length, 2), { fileRecord: _.LOCAL_FILE_HEADER + q + W + L, dirRecord: _.CENTRAL_FILE_HEADER + a(J, 2) + q + a(Q.length, 2) + "\0\0\0\0" + a(z, 4) + a(m, 4) + W + L + Q };
+          var K = "";
+          return K += `
+\0`, K += a(M, 2), K += D.magic, K += a(x, 2), K += a(A, 2), K += a(tt.crc32, 4), K += a(tt.compressedSize, 4), K += a(tt.uncompressedSize, 4), K += a(W.length, 2), K += a(L.length, 2), { fileRecord: _.LOCAL_FILE_HEADER + K + W + L, dirRecord: _.CENTRAL_FILE_HEADER + a(J, 2) + K + a(Q.length, 2) + "\0\0\0\0" + a(z, 4) + a(m, 4) + W + L + Q };
         }
         var i = t("../utils"), h = t("../stream/GenericWorker"), b = t("../utf8"), y = t("../crc32"), _ = t("../signature");
         function w(d, k, u, m) {
@@ -1076,7 +1070,7 @@ function we() {
           r.exports = function(u) {
             d.push(u) !== 1 || i || o();
           };
-        }).call(this, typeof Mt != "undefined" ? Mt : typeof self != "undefined" ? self : typeof window != "undefined" ? window : {});
+        }).call(this, typeof Rt != "undefined" ? Rt : typeof self != "undefined" ? self : typeof window != "undefined" ? window : {});
       }, {}], 37: [function(t, r, n) {
         var a = t("immediate");
         function o() {
@@ -1391,11 +1385,11 @@ function we() {
         function J(s, O) {
           s.pending_buf[s.pending++] = O;
         }
-        function q(s, O) {
+        function K(s, O) {
           s.pending_buf[s.pending++] = O >>> 8 & 255, s.pending_buf[s.pending++] = 255 & O;
         }
         function X(s, O) {
-          var R, g, p = s.max_chain_length, E = s.strstart, j = s.prev_length, U = s.nice_match, N = s.strstart > s.w_size - Q ? s.strstart - (s.w_size - Q) : 0, Z = s.window, K = s.w_mask, G = s.prev, Y = s.strstart + V, lt = Z[E + j - 1], st = Z[E + j];
+          var R, g, p = s.max_chain_length, E = s.strstart, j = s.prev_length, U = s.nice_match, N = s.strstart > s.w_size - Q ? s.strstart - (s.w_size - Q) : 0, Z = s.window, q = s.w_mask, G = s.prev, Y = s.strstart + V, lt = Z[E + j - 1], st = Z[E + j];
           s.prev_length >= s.good_match && (p >>= 2), U > s.lookahead && (U = s.lookahead);
           do
             if (Z[(R = O) + j] === st && Z[R + j - 1] === lt && Z[R] === Z[E] && Z[++R] === Z[E + 1]) {
@@ -1408,11 +1402,11 @@ function we() {
                 lt = Z[E + j - 1], st = Z[E + j];
               }
             }
-          while ((O = G[O & K]) > N && --p != 0);
+          while ((O = G[O & q]) > N && --p != 0);
           return j <= s.lookahead ? j : s.lookahead;
         }
         function ct(s) {
-          var O, R, g, p, E, j, U, N, Z, K, G = s.w_size;
+          var O, R, g, p, E, j, U, N, Z, q, G = s.w_size;
           do {
             if (p = s.window_size - s.lookahead - s.strstart, s.strstart >= G + (G - Q)) {
               for (o.arraySet(s.window, s.window, G, G, 0), s.match_start -= G, s.strstart -= G, s.block_start -= G, O = R = s.hash_size; g = s.head[--O], s.head[O] = G <= g ? g - G : 0, --R; ) ;
@@ -1420,7 +1414,7 @@ function we() {
               p += G;
             }
             if (s.strm.avail_in === 0) break;
-            if (j = s.strm, U = s.window, N = s.strstart + s.lookahead, Z = p, K = void 0, K = j.avail_in, Z < K && (K = Z), R = K === 0 ? 0 : (j.avail_in -= K, o.arraySet(U, j.input, j.next_in, K, N), j.state.wrap === 1 ? j.adler = h(j.adler, U, K, N) : j.state.wrap === 2 && (j.adler = b(j.adler, U, K, N)), j.next_in += K, j.total_in += K, K), s.lookahead += R, s.lookahead + s.insert >= T) for (E = s.strstart - s.insert, s.ins_h = s.window[E], s.ins_h = (s.ins_h << s.hash_shift ^ s.window[E + 1]) & s.hash_mask; s.insert && (s.ins_h = (s.ins_h << s.hash_shift ^ s.window[E + T - 1]) & s.hash_mask, s.prev[E & s.w_mask] = s.head[s.ins_h], s.head[s.ins_h] = E, E++, s.insert--, !(s.lookahead + s.insert < T)); ) ;
+            if (j = s.strm, U = s.window, N = s.strstart + s.lookahead, Z = p, q = void 0, q = j.avail_in, Z < q && (q = Z), R = q === 0 ? 0 : (j.avail_in -= q, o.arraySet(U, j.input, j.next_in, q, N), j.state.wrap === 1 ? j.adler = h(j.adler, U, q, N) : j.state.wrap === 2 && (j.adler = b(j.adler, U, q, N)), j.next_in += q, j.total_in += q, q), s.lookahead += R, s.lookahead + s.insert >= T) for (E = s.strstart - s.insert, s.ins_h = s.window[E], s.ins_h = (s.ins_h << s.hash_shift ^ s.window[E + 1]) & s.hash_mask; s.insert && (s.ins_h = (s.ins_h << s.hash_shift ^ s.window[E + T - 1]) & s.hash_mask, s.prev[E & s.w_mask] = s.head[s.ins_h], s.head[s.ins_h] = E, E++, s.insert--, !(s.lookahead + s.insert < T)); ) ;
           } while (s.lookahead < Q && s.strm.avail_in !== 0);
         }
         function mt(s, O) {
@@ -1500,7 +1494,7 @@ function we() {
           if (g.strm = s, R = g.last_flush, g.last_flush = O, g.status === S) if (g.wrap === 2) s.adler = 0, J(g, 31), J(g, 139), J(g, 8), g.gzhead ? (J(g, (g.gzhead.text ? 1 : 0) + (g.gzhead.hcrc ? 2 : 0) + (g.gzhead.extra ? 4 : 0) + (g.gzhead.name ? 8 : 0) + (g.gzhead.comment ? 16 : 0)), J(g, 255 & g.gzhead.time), J(g, g.gzhead.time >> 8 & 255), J(g, g.gzhead.time >> 16 & 255), J(g, g.gzhead.time >> 24 & 255), J(g, g.level === 9 ? 2 : 2 <= g.strategy || g.level < 2 ? 4 : 0), J(g, 255 & g.gzhead.os), g.gzhead.extra && g.gzhead.extra.length && (J(g, 255 & g.gzhead.extra.length), J(g, g.gzhead.extra.length >> 8 & 255)), g.gzhead.hcrc && (s.adler = b(s.adler, g.pending_buf, g.pending, 0)), g.gzindex = 0, g.status = 69) : (J(g, 0), J(g, 0), J(g, 0), J(g, 0), J(g, 0), J(g, g.level === 9 ? 2 : 2 <= g.strategy || g.level < 2 ? 4 : 0), J(g, 3), g.status = I);
           else {
             var j = v + (g.w_bits - 8 << 4) << 8;
-            j |= (2 <= g.strategy || g.level < 2 ? 0 : g.level < 6 ? 1 : g.level === 6 ? 2 : 3) << 6, g.strstart !== 0 && (j |= 32), j += 31 - j % 31, g.status = I, q(g, j), g.strstart !== 0 && (q(g, s.adler >>> 16), q(g, 65535 & s.adler)), s.adler = 1;
+            j |= (2 <= g.strategy || g.level < 2 ? 0 : g.level < 6 ? 1 : g.level === 6 ? 2 : 3) << 6, g.strstart !== 0 && (j |= 32), j += 31 - j % 31, g.status = I, K(g, j), g.strstart !== 0 && (K(g, s.adler >>> 16), K(g, 65535 & s.adler)), s.adler = 1;
           }
           if (g.status === 69) if (g.gzhead.extra) {
             for (p = g.pending; g.gzindex < (65535 & g.gzhead.extra.length) && (g.pending !== g.pending_buf_size || (g.gzhead.hcrc && g.pending > p && (s.adler = b(s.adler, g.pending_buf, g.pending - p, p)), M(s), p = g.pending, g.pending !== g.pending_buf_size)); ) J(g, 255 & g.gzhead.extra[g.gzindex]), g.gzindex++;
@@ -1534,16 +1528,16 @@ function we() {
           if (g.status === 666 && s.avail_in !== 0) return rt(s, -5);
           if (s.avail_in !== 0 || g.lookahead !== 0 || O !== _ && g.status !== 666) {
             var U = g.strategy === 2 ? (function(N, Z) {
-              for (var K; ; ) {
+              for (var q; ; ) {
                 if (N.lookahead === 0 && (ct(N), N.lookahead === 0)) {
                   if (Z === _) return l;
                   break;
                 }
-                if (N.match_length = 0, K = i._tr_tally(N, 0, N.window[N.strstart]), N.lookahead--, N.strstart++, K && (z(N, !1), N.strm.avail_out === 0)) return l;
+                if (N.match_length = 0, q = i._tr_tally(N, 0, N.window[N.strstart]), N.lookahead--, N.strstart++, q && (z(N, !1), N.strm.avail_out === 0)) return l;
               }
               return N.insert = 0, Z === w ? (z(N, !0), N.strm.avail_out === 0 ? et : $) : N.last_lit && (z(N, !1), N.strm.avail_out === 0) ? l : L;
             })(g, O) : g.strategy === 3 ? (function(N, Z) {
-              for (var K, G, Y, lt, st = N.window; ; ) {
+              for (var q, G, Y, lt, st = N.window; ; ) {
                 if (N.lookahead <= V) {
                   if (ct(N), N.lookahead <= V && Z === _) return l;
                   if (N.lookahead === 0) break;
@@ -1555,21 +1549,21 @@ function we() {
                   while (G === st[++Y] && G === st[++Y] && G === st[++Y] && G === st[++Y] && G === st[++Y] && G === st[++Y] && G === st[++Y] && G === st[++Y] && Y < lt);
                   N.match_length = V - (lt - Y), N.match_length > N.lookahead && (N.match_length = N.lookahead);
                 }
-                if (N.match_length >= T ? (K = i._tr_tally(N, 1, N.match_length - T), N.lookahead -= N.match_length, N.strstart += N.match_length, N.match_length = 0) : (K = i._tr_tally(N, 0, N.window[N.strstart]), N.lookahead--, N.strstart++), K && (z(N, !1), N.strm.avail_out === 0)) return l;
+                if (N.match_length >= T ? (q = i._tr_tally(N, 1, N.match_length - T), N.lookahead -= N.match_length, N.strstart += N.match_length, N.match_length = 0) : (q = i._tr_tally(N, 0, N.window[N.strstart]), N.lookahead--, N.strstart++), q && (z(N, !1), N.strm.avail_out === 0)) return l;
               }
               return N.insert = 0, Z === w ? (z(N, !0), N.strm.avail_out === 0 ? et : $) : N.last_lit && (z(N, !1), N.strm.avail_out === 0) ? l : L;
             })(g, O) : a[g.level].func(g, O);
             if (U !== et && U !== $ || (g.status = 666), U === l || U === et) return s.avail_out === 0 && (g.last_flush = -1), d;
             if (U === L && (O === 1 ? i._tr_align(g) : O !== 5 && (i._tr_stored_block(g, 0, 0, !1), O === 3 && (tt(g.head), g.lookahead === 0 && (g.strstart = 0, g.block_start = 0, g.insert = 0))), M(s), s.avail_out === 0)) return g.last_flush = -1, d;
           }
-          return O !== w ? d : g.wrap <= 0 ? 1 : (g.wrap === 2 ? (J(g, 255 & s.adler), J(g, s.adler >> 8 & 255), J(g, s.adler >> 16 & 255), J(g, s.adler >> 24 & 255), J(g, 255 & s.total_in), J(g, s.total_in >> 8 & 255), J(g, s.total_in >> 16 & 255), J(g, s.total_in >> 24 & 255)) : (q(g, s.adler >>> 16), q(g, 65535 & s.adler)), M(s), 0 < g.wrap && (g.wrap = -g.wrap), g.pending !== 0 ? d : 1);
+          return O !== w ? d : g.wrap <= 0 ? 1 : (g.wrap === 2 ? (J(g, 255 & s.adler), J(g, s.adler >> 8 & 255), J(g, s.adler >> 16 & 255), J(g, s.adler >> 24 & 255), J(g, 255 & s.total_in), J(g, s.total_in >> 8 & 255), J(g, s.total_in >> 16 & 255), J(g, s.total_in >> 24 & 255)) : (K(g, s.adler >>> 16), K(g, 65535 & s.adler)), M(s), 0 < g.wrap && (g.wrap = -g.wrap), g.pending !== 0 ? d : 1);
         }, n.deflateEnd = function(s) {
           var O;
           return s && s.state ? (O = s.state.status) !== S && O !== 69 && O !== 73 && O !== 91 && O !== 103 && O !== I && O !== 666 ? rt(s, k) : (s.state = null, O === I ? rt(s, -3) : d) : k;
         }, n.deflateSetDictionary = function(s, O) {
-          var R, g, p, E, j, U, N, Z, K = O.length;
+          var R, g, p, E, j, U, N, Z, q = O.length;
           if (!s || !s.state || (E = (R = s.state).wrap) === 2 || E === 1 && R.status !== S || R.lookahead) return k;
-          for (E === 1 && (s.adler = h(s.adler, O, K, 0)), R.wrap = 0, K >= R.w_size && (E === 0 && (tt(R.head), R.strstart = 0, R.block_start = 0, R.insert = 0), Z = new o.Buf8(R.w_size), o.arraySet(Z, O, K - R.w_size, R.w_size, 0), O = Z, K = R.w_size), j = s.avail_in, U = s.next_in, N = s.input, s.avail_in = K, s.next_in = 0, s.input = O, ct(R); R.lookahead >= T; ) {
+          for (E === 1 && (s.adler = h(s.adler, O, q, 0)), R.wrap = 0, q >= R.w_size && (E === 0 && (tt(R.head), R.strstart = 0, R.block_start = 0, R.insert = 0), Z = new o.Buf8(R.w_size), o.arraySet(Z, O, q - R.w_size, R.w_size, 0), O = Z, q = R.w_size), j = s.avail_in, U = s.next_in, N = s.input, s.avail_in = q, s.next_in = 0, s.input = O, ct(R); R.lookahead >= T; ) {
             for (g = R.strstart, p = R.lookahead - (T - 1); R.ins_h = (R.ins_h << R.hash_shift ^ R.window[g + T - 1]) & R.hash_mask, R.prev[g & R.w_mask] = R.head[R.ins_h], R.head[R.ins_h] = g, g++, --p; ) ;
             R.strstart = g, R.lookahead = T - 1, ct(R);
           }
@@ -1694,9 +1688,9 @@ function we() {
         n.inflateReset = A, n.inflateReset2 = P, n.inflateResetKeep = x, n.inflateInit = function(S) {
           return D(S, 15);
         }, n.inflateInit2 = D, n.inflate = function(S, I) {
-          var l, L, et, $, rt, H, tt, M, z, J, q, X, ct, mt, at, it, pt, ht, kt, vt, s, O, R, g, p = 0, E = new a.Buf8(4), j = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+          var l, L, et, $, rt, H, tt, M, z, J, K, X, ct, mt, at, it, pt, ht, kt, vt, s, O, R, g, p = 0, E = new a.Buf8(4), j = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
           if (!S || !S.state || !S.output || !S.input && S.avail_in !== 0) return d;
-          (l = S.state).mode === 12 && (l.mode = 13), rt = S.next_out, et = S.output, tt = S.avail_out, $ = S.next_in, L = S.input, H = S.avail_in, M = l.hold, z = l.bits, J = H, q = tt, O = w;
+          (l = S.state).mode === 12 && (l.mode = 13), rt = S.next_out, et = S.output, tt = S.avail_out, $ = S.next_in, L = S.input, H = S.avail_in, M = l.hold, z = l.bits, J = H, K = tt, O = w;
           t: for (; ; ) switch (l.mode) {
             case k:
               if (l.wrap === 0) {
@@ -1928,7 +1922,7 @@ function we() {
               l.mode = 21;
             case 21:
               if (6 <= H && 258 <= tt) {
-                S.next_out = rt, S.avail_out = tt, S.next_in = $, S.avail_in = H, l.hold = M, l.bits = z, h(S, q), rt = S.next_out, et = S.output, tt = S.avail_out, $ = S.next_in, L = S.input, H = S.avail_in, M = l.hold, z = l.bits, l.mode === 12 && (l.back = -1);
+                S.next_out = rt, S.avail_out = tt, S.next_in = $, S.avail_in = H, l.hold = M, l.bits = z, h(S, K), rt = S.next_out, et = S.output, tt = S.avail_out, $ = S.next_in, L = S.input, H = S.avail_in, M = l.hold, z = l.bits, l.mode === 12 && (l.back = -1);
                 break;
               }
               for (l.back = 0; it = (p = l.lencode[M & (1 << l.lenbits) - 1]) >>> 16 & 255, pt = 65535 & p, !((at = p >>> 24) <= z); ) {
@@ -1996,7 +1990,7 @@ function we() {
               l.mode = 25;
             case 25:
               if (tt === 0) break t;
-              if (X = q - tt, l.offset > X) {
+              if (X = K - tt, l.offset > X) {
                 if ((X = l.offset - X) > l.whave && l.sane) {
                   S.msg = "invalid distance too far back", l.mode = 30;
                   break;
@@ -2016,7 +2010,7 @@ function we() {
                   if (H === 0) break t;
                   H--, M |= L[$++] << z, z += 8;
                 }
-                if (q -= tt, S.total_out += q, l.total += q, q && (S.adler = l.check = l.flags ? i(l.check, et, q, rt - q) : o(l.check, et, q, rt - q)), q = tt, (l.flags ? M : f(M)) !== l.check) {
+                if (K -= tt, S.total_out += K, l.total += K, K && (S.adler = l.check = l.flags ? i(l.check, et, K, rt - K) : o(l.check, et, K, rt - K)), K = tt, (l.flags ? M : f(M)) !== l.check) {
                   S.msg = "incorrect data check", l.mode = 30;
                   break;
                 }
@@ -2048,7 +2042,7 @@ function we() {
             default:
               return d;
           }
-          return S.next_out = rt, S.avail_out = tt, S.next_in = $, S.avail_in = H, l.hold = M, l.bits = z, (l.wsize || q !== S.avail_out && l.mode < 30 && (l.mode < 27 || I !== 4)) && Q(S, S.output, S.next_out, q - S.avail_out) ? (l.mode = 31, -4) : (J -= S.avail_in, q -= S.avail_out, S.total_in += J, S.total_out += q, l.total += q, l.wrap && q && (S.adler = l.check = l.flags ? i(l.check, et, q, S.next_out - q) : o(l.check, et, q, S.next_out - q)), S.data_type = l.bits + (l.last ? 64 : 0) + (l.mode === 12 ? 128 : 0) + (l.mode === 20 || l.mode === 15 ? 256 : 0), (J == 0 && q === 0 || I === 4) && O === w && (O = -5), O);
+          return S.next_out = rt, S.avail_out = tt, S.next_in = $, S.avail_in = H, l.hold = M, l.bits = z, (l.wsize || K !== S.avail_out && l.mode < 30 && (l.mode < 27 || I !== 4)) && Q(S, S.output, S.next_out, K - S.avail_out) ? (l.mode = 31, -4) : (J -= S.avail_in, K -= S.avail_out, S.total_in += J, S.total_out += K, l.total += K, l.wrap && K && (S.adler = l.check = l.flags ? i(l.check, et, K, S.next_out - K) : o(l.check, et, K, S.next_out - K)), S.data_type = l.bits + (l.last ? 64 : 0) + (l.mode === 12 ? 128 : 0) + (l.mode === 20 || l.mode === 15 ? 256 : 0), (J == 0 && K === 0 || I === 4) && O === w && (O = -5), O);
         }, n.inflateEnd = function(S) {
           if (!S || !S.state) return d;
           var I = S.state;
@@ -2063,26 +2057,26 @@ function we() {
       }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(t, r, n) {
         var a = t("../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], i = [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], h = [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], b = [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(y, _, w, d, k, u, m, f) {
-          var v, x, A, P, D, F, W, T, V, Q = f.bits, S = 0, I = 0, l = 0, L = 0, et = 0, $ = 0, rt = 0, H = 0, tt = 0, M = 0, z = null, J = 0, q = new a.Buf16(16), X = new a.Buf16(16), ct = null, mt = 0;
-          for (S = 0; S <= 15; S++) q[S] = 0;
-          for (I = 0; I < d; I++) q[_[w + I]]++;
-          for (et = Q, L = 15; 1 <= L && q[L] === 0; L--) ;
+          var v, x, A, P, D, F, W, T, V, Q = f.bits, S = 0, I = 0, l = 0, L = 0, et = 0, $ = 0, rt = 0, H = 0, tt = 0, M = 0, z = null, J = 0, K = new a.Buf16(16), X = new a.Buf16(16), ct = null, mt = 0;
+          for (S = 0; S <= 15; S++) K[S] = 0;
+          for (I = 0; I < d; I++) K[_[w + I]]++;
+          for (et = Q, L = 15; 1 <= L && K[L] === 0; L--) ;
           if (L < et && (et = L), L === 0) return k[u++] = 20971520, k[u++] = 20971520, f.bits = 1, 0;
-          for (l = 1; l < L && q[l] === 0; l++) ;
-          for (et < l && (et = l), S = H = 1; S <= 15; S++) if (H <<= 1, (H -= q[S]) < 0) return -1;
+          for (l = 1; l < L && K[l] === 0; l++) ;
+          for (et < l && (et = l), S = H = 1; S <= 15; S++) if (H <<= 1, (H -= K[S]) < 0) return -1;
           if (0 < H && (y === 0 || L !== 1)) return -1;
-          for (X[1] = 0, S = 1; S < 15; S++) X[S + 1] = X[S] + q[S];
+          for (X[1] = 0, S = 1; S < 15; S++) X[S + 1] = X[S] + K[S];
           for (I = 0; I < d; I++) _[w + I] !== 0 && (m[X[_[w + I]]++] = I);
           if (F = y === 0 ? (z = ct = m, 19) : y === 1 ? (z = o, J -= 257, ct = i, mt -= 257, 256) : (z = h, ct = b, -1), S = l, D = u, rt = I = M = 0, A = -1, P = (tt = 1 << ($ = et)) - 1, y === 1 && 852 < tt || y === 2 && 592 < tt) return 1;
           for (; ; ) {
             for (W = S - rt, V = m[I] < F ? (T = 0, m[I]) : m[I] > F ? (T = ct[mt + m[I]], z[J + m[I]]) : (T = 96, 0), v = 1 << S - rt, l = x = 1 << $; k[D + (M >> rt) + (x -= v)] = W << 24 | T << 16 | V | 0, x !== 0; ) ;
             for (v = 1 << S - 1; M & v; ) v >>= 1;
-            if (v !== 0 ? (M &= v - 1, M += v) : M = 0, I++, --q[S] == 0) {
+            if (v !== 0 ? (M &= v - 1, M += v) : M = 0, I++, --K[S] == 0) {
               if (S === L) break;
               S = _[w + m[I]];
             }
             if (et < S && (M & P) !== A) {
-              for (rt === 0 && (rt = et), D += l, H = 1 << ($ = S - rt); $ + rt < L && !((H -= q[$ + rt]) <= 0); ) $++, H <<= 1;
+              for (rt === 0 && (rt = et), D += l, H = 1 << ($ = S - rt); $ + rt < L && !((H -= K[$ + rt]) <= 0); ) $++, H <<= 1;
               if (tt += 1 << $, y === 1 && 852 < tt || y === 2 && 592 < tt) return 1;
               k[A = M & P] = et << 24 | $ << 16 | D - u | 0;
             }
@@ -2119,19 +2113,19 @@ function we() {
         function J(p, E) {
           p.pending_buf[p.pending++] = 255 & E, p.pending_buf[p.pending++] = E >>> 8 & 255;
         }
-        function q(p, E, j) {
+        function K(p, E, j) {
           p.bi_valid > f - j ? (p.bi_buf |= E << p.bi_valid & 65535, J(p, p.bi_buf), p.bi_buf = E >> f - p.bi_valid, p.bi_valid += j - f) : (p.bi_buf |= E << p.bi_valid & 65535, p.bi_valid += j);
         }
         function X(p, E, j) {
-          q(p, j[2 * E], j[2 * E + 1]);
+          K(p, j[2 * E], j[2 * E + 1]);
         }
         function ct(p, E) {
           for (var j = 0; j |= 1 & p, p >>>= 1, j <<= 1, 0 < --E; ) ;
           return j >>> 1;
         }
         function mt(p, E, j) {
-          var U, N, Z = new Array(m + 1), K = 0;
-          for (U = 1; U <= m; U++) Z[U] = K = K + j[U - 1] << 1;
+          var U, N, Z = new Array(m + 1), q = 0;
+          for (U = 1; U <= m; U++) Z[U] = q = q + j[U - 1] << 1;
           for (N = 0; N <= E; N++) {
             var G = p[2 * N + 1];
             G !== 0 && (p[2 * N] = ct(Z[G]++, G));
@@ -2156,14 +2150,14 @@ function we() {
           p.heap[j] = U;
         }
         function kt(p, E, j) {
-          var U, N, Z, K, G = 0;
-          if (p.last_lit !== 0) for (; U = p.pending_buf[p.d_buf + 2 * G] << 8 | p.pending_buf[p.d_buf + 2 * G + 1], N = p.pending_buf[p.l_buf + G], G++, U === 0 ? X(p, N, E) : (X(p, (Z = l[N]) + _ + 1, E), (K = F[Z]) !== 0 && q(p, N -= L[Z], K), X(p, Z = z(--U), j), (K = W[Z]) !== 0 && q(p, U -= H[Z], K)), G < p.last_lit; ) ;
+          var U, N, Z, q, G = 0;
+          if (p.last_lit !== 0) for (; U = p.pending_buf[p.d_buf + 2 * G] << 8 | p.pending_buf[p.d_buf + 2 * G + 1], N = p.pending_buf[p.l_buf + G], G++, U === 0 ? X(p, N, E) : (X(p, (Z = l[N]) + _ + 1, E), (q = F[Z]) !== 0 && K(p, N -= L[Z], q), X(p, Z = z(--U), j), (q = W[Z]) !== 0 && K(p, U -= H[Z], q)), G < p.last_lit; ) ;
           X(p, x, E);
         }
         function vt(p, E) {
-          var j, U, N, Z = E.dyn_tree, K = E.stat_desc.static_tree, G = E.stat_desc.has_stree, Y = E.stat_desc.elems, lt = -1;
+          var j, U, N, Z = E.dyn_tree, q = E.stat_desc.static_tree, G = E.stat_desc.has_stree, Y = E.stat_desc.elems, lt = -1;
           for (p.heap_len = 0, p.heap_max = u, j = 0; j < Y; j++) Z[2 * j] !== 0 ? (p.heap[++p.heap_len] = lt = j, p.depth[j] = 0) : Z[2 * j + 1] = 0;
-          for (; p.heap_len < 2; ) Z[2 * (N = p.heap[++p.heap_len] = lt < 2 ? ++lt : 0)] = 1, p.depth[N] = 0, p.opt_len--, G && (p.static_len -= K[2 * N + 1]);
+          for (; p.heap_len < 2; ) Z[2 * (N = p.heap[++p.heap_len] = lt < 2 ? ++lt : 0)] = 1, p.depth[N] = 0, p.opt_len--, G && (p.static_len -= q[2 * N + 1]);
           for (E.max_code = lt, j = p.heap_len >> 1; 1 <= j; j--) ht(p, Z, j);
           for (N = Y; j = p.heap[1], p.heap[1] = p.heap[p.heap_len--], ht(p, Z, 1), U = p.heap[1], p.heap[--p.heap_max] = j, p.heap[--p.heap_max] = U, Z[2 * N] = Z[2 * j] + Z[2 * U], p.depth[N] = (p.depth[j] >= p.depth[U] ? p.depth[j] : p.depth[U]) + 1, Z[2 * j + 1] = Z[2 * U + 1] = N, p.heap[1] = N++, ht(p, Z, 1), 2 <= p.heap_len; ) ;
           p.heap[--p.heap_max] = p.heap[1], (function(st, bt) {
@@ -2180,59 +2174,59 @@ function we() {
           })(p, E), mt(Z, lt, p.bl_count);
         }
         function s(p, E, j) {
-          var U, N, Z = -1, K = E[1], G = 0, Y = 7, lt = 4;
-          for (K === 0 && (Y = 138, lt = 3), E[2 * (j + 1) + 1] = 65535, U = 0; U <= j; U++) N = K, K = E[2 * (U + 1) + 1], ++G < Y && N === K || (G < lt ? p.bl_tree[2 * N] += G : N !== 0 ? (N !== Z && p.bl_tree[2 * N]++, p.bl_tree[2 * A]++) : G <= 10 ? p.bl_tree[2 * P]++ : p.bl_tree[2 * D]++, Z = N, lt = (G = 0) === K ? (Y = 138, 3) : N === K ? (Y = 6, 3) : (Y = 7, 4));
+          var U, N, Z = -1, q = E[1], G = 0, Y = 7, lt = 4;
+          for (q === 0 && (Y = 138, lt = 3), E[2 * (j + 1) + 1] = 65535, U = 0; U <= j; U++) N = q, q = E[2 * (U + 1) + 1], ++G < Y && N === q || (G < lt ? p.bl_tree[2 * N] += G : N !== 0 ? (N !== Z && p.bl_tree[2 * N]++, p.bl_tree[2 * A]++) : G <= 10 ? p.bl_tree[2 * P]++ : p.bl_tree[2 * D]++, Z = N, lt = (G = 0) === q ? (Y = 138, 3) : N === q ? (Y = 6, 3) : (Y = 7, 4));
         }
         function O(p, E, j) {
-          var U, N, Z = -1, K = E[1], G = 0, Y = 7, lt = 4;
-          for (K === 0 && (Y = 138, lt = 3), U = 0; U <= j; U++) if (N = K, K = E[2 * (U + 1) + 1], !(++G < Y && N === K)) {
+          var U, N, Z = -1, q = E[1], G = 0, Y = 7, lt = 4;
+          for (q === 0 && (Y = 138, lt = 3), U = 0; U <= j; U++) if (N = q, q = E[2 * (U + 1) + 1], !(++G < Y && N === q)) {
             if (G < lt) for (; X(p, N, p.bl_tree), --G != 0; ) ;
-            else N !== 0 ? (N !== Z && (X(p, N, p.bl_tree), G--), X(p, A, p.bl_tree), q(p, G - 3, 2)) : G <= 10 ? (X(p, P, p.bl_tree), q(p, G - 3, 3)) : (X(p, D, p.bl_tree), q(p, G - 11, 7));
-            Z = N, lt = (G = 0) === K ? (Y = 138, 3) : N === K ? (Y = 6, 3) : (Y = 7, 4);
+            else N !== 0 ? (N !== Z && (X(p, N, p.bl_tree), G--), X(p, A, p.bl_tree), K(p, G - 3, 2)) : G <= 10 ? (X(p, P, p.bl_tree), K(p, G - 3, 3)) : (X(p, D, p.bl_tree), K(p, G - 11, 7));
+            Z = N, lt = (G = 0) === q ? (Y = 138, 3) : N === q ? (Y = 6, 3) : (Y = 7, 4);
           }
         }
         h(H);
         var R = !1;
         function g(p, E, j, U) {
-          q(p, (b << 1) + (U ? 1 : 0), 3), (function(N, Z, K, G) {
-            it(N), J(N, K), J(N, ~K), a.arraySet(N.pending_buf, N.window, Z, K, N.pending), N.pending += K;
+          K(p, (b << 1) + (U ? 1 : 0), 3), (function(N, Z, q, G) {
+            it(N), J(N, q), J(N, ~q), a.arraySet(N.pending_buf, N.window, Z, q, N.pending), N.pending += q;
           })(p, E, j);
         }
         n._tr_init = function(p) {
           R || ((function() {
-            var E, j, U, N, Z, K = new Array(m + 1);
+            var E, j, U, N, Z, q = new Array(m + 1);
             for (N = U = 0; N < y - 1; N++) for (L[N] = U, E = 0; E < 1 << F[N]; E++) l[U++] = N;
             for (l[U - 1] = N, N = Z = 0; N < 16; N++) for (H[N] = Z, E = 0; E < 1 << W[N]; E++) I[Z++] = N;
             for (Z >>= 7; N < d; N++) for (H[N] = Z << 7, E = 0; E < 1 << W[N] - 7; E++) I[256 + Z++] = N;
-            for (j = 0; j <= m; j++) K[j] = 0;
-            for (E = 0; E <= 143; ) Q[2 * E + 1] = 8, E++, K[8]++;
-            for (; E <= 255; ) Q[2 * E + 1] = 9, E++, K[9]++;
-            for (; E <= 279; ) Q[2 * E + 1] = 7, E++, K[7]++;
-            for (; E <= 287; ) Q[2 * E + 1] = 8, E++, K[8]++;
-            for (mt(Q, w + 1, K), E = 0; E < d; E++) S[2 * E + 1] = 5, S[2 * E] = ct(E, 5);
+            for (j = 0; j <= m; j++) q[j] = 0;
+            for (E = 0; E <= 143; ) Q[2 * E + 1] = 8, E++, q[8]++;
+            for (; E <= 255; ) Q[2 * E + 1] = 9, E++, q[9]++;
+            for (; E <= 279; ) Q[2 * E + 1] = 7, E++, q[7]++;
+            for (; E <= 287; ) Q[2 * E + 1] = 8, E++, q[8]++;
+            for (mt(Q, w + 1, q), E = 0; E < d; E++) S[2 * E + 1] = 5, S[2 * E] = ct(E, 5);
             et = new tt(Q, F, _ + 1, w, m), $ = new tt(S, W, 0, d, m), rt = new tt(new Array(0), T, 0, k, v);
           })(), R = !0), p.l_desc = new M(p.dyn_ltree, et), p.d_desc = new M(p.dyn_dtree, $), p.bl_desc = new M(p.bl_tree, rt), p.bi_buf = 0, p.bi_valid = 0, at(p);
         }, n._tr_stored_block = g, n._tr_flush_block = function(p, E, j, U) {
-          var N, Z, K = 0;
+          var N, Z, q = 0;
           0 < p.level ? (p.strm.data_type === 2 && (p.strm.data_type = (function(G) {
             var Y, lt = 4093624447;
             for (Y = 0; Y <= 31; Y++, lt >>>= 1) if (1 & lt && G.dyn_ltree[2 * Y] !== 0) return o;
             if (G.dyn_ltree[18] !== 0 || G.dyn_ltree[20] !== 0 || G.dyn_ltree[26] !== 0) return i;
             for (Y = 32; Y < _; Y++) if (G.dyn_ltree[2 * Y] !== 0) return i;
             return o;
-          })(p)), vt(p, p.l_desc), vt(p, p.d_desc), K = (function(G) {
+          })(p)), vt(p, p.l_desc), vt(p, p.d_desc), q = (function(G) {
             var Y;
             for (s(G, G.dyn_ltree, G.l_desc.max_code), s(G, G.dyn_dtree, G.d_desc.max_code), vt(G, G.bl_desc), Y = k - 1; 3 <= Y && G.bl_tree[2 * V[Y] + 1] === 0; Y--) ;
             return G.opt_len += 3 * (Y + 1) + 5 + 5 + 4, Y;
-          })(p), N = p.opt_len + 3 + 7 >>> 3, (Z = p.static_len + 3 + 7 >>> 3) <= N && (N = Z)) : N = Z = j + 5, j + 4 <= N && E !== -1 ? g(p, E, j, U) : p.strategy === 4 || Z === N ? (q(p, 2 + (U ? 1 : 0), 3), kt(p, Q, S)) : (q(p, 4 + (U ? 1 : 0), 3), (function(G, Y, lt, st) {
+          })(p), N = p.opt_len + 3 + 7 >>> 3, (Z = p.static_len + 3 + 7 >>> 3) <= N && (N = Z)) : N = Z = j + 5, j + 4 <= N && E !== -1 ? g(p, E, j, U) : p.strategy === 4 || Z === N ? (K(p, 2 + (U ? 1 : 0), 3), kt(p, Q, S)) : (K(p, 4 + (U ? 1 : 0), 3), (function(G, Y, lt, st) {
             var bt;
-            for (q(G, Y - 257, 5), q(G, lt - 1, 5), q(G, st - 4, 4), bt = 0; bt < st; bt++) q(G, G.bl_tree[2 * V[bt] + 1], 3);
+            for (K(G, Y - 257, 5), K(G, lt - 1, 5), K(G, st - 4, 4), bt = 0; bt < st; bt++) K(G, G.bl_tree[2 * V[bt] + 1], 3);
             O(G, G.dyn_ltree, Y - 1), O(G, G.dyn_dtree, lt - 1);
-          })(p, p.l_desc.max_code + 1, p.d_desc.max_code + 1, K + 1), kt(p, p.dyn_ltree, p.dyn_dtree)), at(p), U && it(p);
+          })(p, p.l_desc.max_code + 1, p.d_desc.max_code + 1, q + 1), kt(p, p.dyn_ltree, p.dyn_dtree)), at(p), U && it(p);
         }, n._tr_tally = function(p, E, j) {
           return p.pending_buf[p.d_buf + 2 * p.last_lit] = E >>> 8 & 255, p.pending_buf[p.d_buf + 2 * p.last_lit + 1] = 255 & E, p.pending_buf[p.l_buf + p.last_lit] = 255 & j, p.last_lit++, E === 0 ? p.dyn_ltree[2 * j]++ : (p.matches++, E--, p.dyn_ltree[2 * (l[j] + _ + 1)]++, p.dyn_dtree[2 * z(E)]++), p.last_lit === p.lit_bufsize - 1;
         }, n._tr_align = function(p) {
-          q(p, 2, 3), X(p, x, Q), (function(E) {
+          K(p, 2, 3), X(p, x, Q), (function(E) {
             E.bi_valid === 16 ? (J(E, E.bi_buf), E.bi_buf = 0, E.bi_valid = 0) : 8 <= E.bi_valid && (E.pending_buf[E.pending++] = 255 & E.bi_buf, E.bi_buf >>= 8, E.bi_valid -= 8);
           })(p);
         };
@@ -2315,7 +2309,7 @@ function we() {
               A.source === o && typeof A.data == "string" && A.data.indexOf(_) === 0 && v(+A.data.slice(_.length));
             }
           })(typeof self == "undefined" ? a === void 0 ? this : a : self);
-        }).call(this, typeof Mt != "undefined" ? Mt : typeof self != "undefined" ? self : typeof window != "undefined" ? window : {});
+        }).call(this, typeof Rt != "undefined" ? Rt : typeof self != "undefined" ? self : typeof window != "undefined" ? window : {});
       }, {}] }, {}, [10])(10);
     });
   })(Lt)), Lt.exports;
@@ -2645,10 +2639,10 @@ function $e(c, e) {
     }
   return t;
 }
-var Kt;
+var qt;
 (function(c) {
   c.Continuous = "continuous", c.NextPage = "nextPage", c.NextColumn = "nextColumn", c.EvenPage = "evenPage", c.OddPage = "oddPage";
-})(Kt || (Kt = {}));
+})(qt || (qt = {}));
 function ce(c, e = C) {
   var r, n;
   var t = {};
@@ -2807,7 +2801,7 @@ function Xe(c, e) {
     }
   return t;
 }
-function qe(c, e) {
+function Ke(c, e) {
   let t = {
     numberings: [],
     abstractNumberings: [],
@@ -2816,7 +2810,7 @@ function qe(c, e) {
   for (let r of e.elements(c))
     switch (r.localName) {
       case "num":
-        t.numberings.push(Ke(r, e));
+        t.numberings.push(qe(r, e));
         break;
       case "abstractNum":
         t.abstractNumberings.push(Ye(r, e));
@@ -2827,7 +2821,7 @@ function qe(c, e) {
     }
   return t;
 }
-function Ke(c, e) {
+function qe(c, e) {
   let t = {
     id: e.attr(c, "numId"),
     overrides: []
@@ -2932,7 +2926,7 @@ class tr extends gt {
     super(e, t), this._documentParser = r;
   }
   parseXml(e) {
-    Object.assign(this, qe(e, this._package.xmlParser)), this.domNumberings = this._documentParser.parseNumberingFile(e);
+    Object.assign(this, Ke(e, this._package.xmlParser)), this.domNumberings = this._documentParser.parseNumberingFile(e);
   }
 }
 class er extends gt {
@@ -5527,13 +5521,13 @@ async function Zr(c, e, t, r) {
   const n = { ...be, ...r };
   return await new $r(window.document).render(c, e, t, n);
 }
-async function Vr(c, e, t, r) {
+async function Gr(c, e, t, r) {
   const n = await Hr(c, r);
   return await Zr(n, e, t, r), n;
 }
 export {
   be as defaultOptions,
   Hr as parseAsync,
-  Vr as renderAsync,
+  Gr as renderAsync,
   Zr as renderDocument
 };

package/dist/{index-DZOrV9D_.js → index-B8Ff5iZD.js}

@@ -77,7 +77,7 @@ const ee = ["aria-modal"], te = {
   },
   emits: ["update:visible", "error"],
   setup(e, { emit: t }) {
-    const o = h(() => import("./PdfRenderer-SICIjXYT.js")), c = h(() => import("./TextRenderer-KUhpnf63.js")), i = h(() => import("./DocxRenderer-D0ngcG2T.js")), p = h(() => import("./SheetRenderer-D4Y1dYZX.js")), d = h(() => import("./UnsupportedRenderer-Y2AgN0-l.js")), l = e, D = t, f = U(null), j = U(!1), L = U(""), n = U(I(l.source, l.fileName)), m = w(() => Q(n.value.name)), N = w(() => l.fileName || n.value.name || l.dialogTitle), b = w(() => l.mode === "dialog"), O = w(() => b.value ? l.visible : !0), T = w(() => m.value === "image" ? "img" : m.value === "video" ? "video" : m.value === "audio" ? "audio" : null);
+    const o = h(() => import("./PdfRenderer-Due2M5cA.js")), c = h(() => import("./TextRenderer-KUhpnf63.js")), i = h(() => import("./DocxRenderer-DogNhBLd.js")), p = h(() => import("./SheetRenderer-Dea6-NBg.js")), d = h(() => import("./UnsupportedRenderer-DDB3UZdt.js")), l = e, D = t, f = U(null), j = U(!1), L = U(""), n = U(I(l.source, l.fileName)), m = w(() => Q(n.value.name)), N = w(() => l.fileName || n.value.name || l.dialogTitle), b = w(() => l.mode === "dialog"), O = w(() => b.value ? l.visible : !0), T = w(() => m.value === "image" ? "img" : m.value === "video" ? "video" : m.value === "audio" ? "audio" : null);
     Z(
       () => [l.source, l.fileName],
       () => {

package/dist/light-file-preview.js

@@ -1,4 +1,4 @@
-import { _ as i, i as r, o, r as l } from "./index-DZOrV9D_.js";
+import { _ as i, i as r, o, r as l } from "./index-B8Ff5iZD.js";
 export {
   i as FilePreview,
   r as default,