ppt-dsl-renderer 1.1.3 → 1.1.4
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/cli.js +149 -143
- package/package.json +1 -1
package/dist/cli.js
CHANGED
|
@@ -54,12 +54,12 @@ html, body { width: 100%; height: 100%; overflow: hidden; }
|
|
|
54
54
|
</body>
|
|
55
55
|
</html>`;
|
|
56
56
|
}
|
|
57
|
-
const ue = /* @__PURE__ */ new Set(["text", "image", "shape", "line", "chart", "table", "latex", "video", "audio"]), de = /* @__PURE__ */ new Set(["area", "bar", "column", "line", "pie", "radar", "ring", "scatter"]), vt = (E) => E !== null && typeof E == "object" && !Array.isArray(E), ut = (E) => typeof E == "string",
|
|
57
|
+
const ue = /* @__PURE__ */ new Set(["text", "image", "shape", "line", "chart", "table", "latex", "video", "audio"]), de = /* @__PURE__ */ new Set(["area", "bar", "column", "line", "pie", "radar", "ring", "scatter"]), vt = (E) => E !== null && typeof E == "object" && !Array.isArray(E), ut = (E) => typeof E == "string", Rt = (E) => Array.isArray(E) && E.length === 2 && E.every(Number.isFinite);
|
|
58
58
|
function at(E, P) {
|
|
59
59
|
if (!E)
|
|
60
60
|
throw new Error(P);
|
|
61
61
|
}
|
|
62
|
-
function
|
|
62
|
+
function Ft(E, P) {
|
|
63
63
|
at(ut(E) && /^(https?:\/\/|data:)/i.test(E), `${P} 必须使用 HTTP(S) URL 或 data URL`);
|
|
64
64
|
const n = new URL(E);
|
|
65
65
|
at(["http:", "https:", "data:"].includes(n.protocol), `${P} 资源协议不受支持`);
|
|
@@ -68,7 +68,7 @@ function Vt(E) {
|
|
|
68
68
|
at(vt(E), "DSL 顶层必须是对象"), at(ut(E.title) && E.title.length > 0, "DSL 缺少 title"), at(Number.isFinite(E.width) && E.width > 0, "DSL width 必须是大于 0 的有限数值"), at(Number.isFinite(E.height) && E.height > 0, "DSL height 必须是大于 0 的有限数值"), at(Array.isArray(E.slides) && E.slides.length > 0, "DSL slides 不能为空"), E.slides.forEach((P, n) => {
|
|
69
69
|
var l, o;
|
|
70
70
|
const S = `第 ${n + 1} 页`;
|
|
71
|
-
at(vt(P) && ut(P.id) && P.id && Array.isArray(P.elements), `${S}结构无效`), ((l = P.background) == null ? void 0 : l.type) === "image" &&
|
|
71
|
+
at(vt(P) && ut(P.id) && P.id && Array.isArray(P.elements), `${S}结构无效`), ((l = P.background) == null ? void 0 : l.type) === "image" && Ft((o = P.background.image) == null ? void 0 : o.src, `${S}背景图`);
|
|
72
72
|
const g = /* @__PURE__ */ new Set();
|
|
73
73
|
P.elements.forEach((e) => {
|
|
74
74
|
var d;
|
|
@@ -84,13 +84,13 @@ function Vt(E) {
|
|
|
84
84
|
case "image":
|
|
85
85
|
case "audio":
|
|
86
86
|
case "video":
|
|
87
|
-
|
|
87
|
+
Ft(e.src, `${a}.src`), e.poster !== void 0 && Ft(e.poster, `${a}.poster`);
|
|
88
88
|
break;
|
|
89
89
|
case "shape":
|
|
90
|
-
at(ut(e.path) &&
|
|
90
|
+
at(ut(e.path) && Rt(e.viewBox), `${a}缺少 path 或有效 viewBox`), e.text !== void 0 && at(ut((d = e.text) == null ? void 0 : d.content), `${a}.text.content 必须是字符串`);
|
|
91
91
|
break;
|
|
92
92
|
case "line":
|
|
93
|
-
at(
|
|
93
|
+
at(Rt(e.start) && Rt(e.end) && ut(e.color), `${a}缺少 start、end 或 color`);
|
|
94
94
|
break;
|
|
95
95
|
case "chart": {
|
|
96
96
|
const c = e.data;
|
|
@@ -410,17 +410,17 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
410
410
|
return f;
|
|
411
411
|
}
|
|
412
412
|
function o(s, m, i, f, h, u) {
|
|
413
|
-
var w, k, x = s.file, O = s.compression, T = u !== d.utf8encode, M = e.transformTo("string", u(x.name)), z = e.transformTo("string", d.utf8encode(x.name)), W = x.comment, j = e.transformTo("string", u(W)), b = e.transformTo("string", d.utf8encode(W)),
|
|
413
|
+
var w, k, x = s.file, O = s.compression, T = u !== d.utf8encode, M = e.transformTo("string", u(x.name)), z = e.transformTo("string", d.utf8encode(x.name)), W = x.comment, j = e.transformTo("string", u(W)), b = e.transformTo("string", d.utf8encode(W)), R = z.length !== x.name.length, r = b.length !== W.length, N = "", Q = "", $ = "", Y = x.dir, L = x.date, K = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
|
|
414
414
|
m && !i || (K.crc32 = s.crc32, K.compressedSize = s.compressedSize, K.uncompressedSize = s.uncompressedSize);
|
|
415
415
|
var I = 0;
|
|
416
|
-
m && (I |= 8), T || !
|
|
416
|
+
m && (I |= 8), T || !R && !r || (I |= 2048);
|
|
417
417
|
var B = 0, tt = 0;
|
|
418
418
|
Y && (B |= 16), h === "UNIX" ? (tt = 798, B |= function(X, st) {
|
|
419
419
|
var ct = X;
|
|
420
420
|
return X || (ct = st ? 16893 : 33204), (65535 & ct) << 16;
|
|
421
421
|
}(x.unixPermissions, Y)) : (tt = 20, B |= function(X) {
|
|
422
422
|
return 63 & (X || 0);
|
|
423
|
-
}(x.dosPermissions)), w = L.getUTCHours(), w <<= 6, w |= L.getUTCMinutes(), w <<= 5, w |= L.getUTCSeconds() / 2, k = L.getUTCFullYear() - 1980, k <<= 4, k |= L.getUTCMonth() + 1, k <<= 5, k |= L.getUTCDate(),
|
|
423
|
+
}(x.dosPermissions)), w = L.getUTCHours(), w <<= 6, w |= L.getUTCMinutes(), w <<= 5, w |= L.getUTCSeconds() / 2, k = L.getUTCFullYear() - 1980, k <<= 4, k |= L.getUTCMonth() + 1, k <<= 5, k |= L.getUTCDate(), R && (Q = l(1, 1) + l(c(M), 4) + z, N += "up" + l(Q.length, 2) + Q), r && ($ = l(1, 1) + l(c(j), 4) + b, N += "uc" + l($.length, 2) + $);
|
|
424
424
|
var q = "";
|
|
425
425
|
return q += `
|
|
426
426
|
\0`, q += l(I, 2), q += O.magic, q += l(w, 2), q += l(k, 2), q += l(K.crc32, 4), q += l(K.compressedSize, 4), q += l(K.uncompressedSize, 4), q += l(M.length, 2), q += l(N.length, 2), { fileRecord: _.LOCAL_FILE_HEADER + q + M + N, dirRecord: _.CENTRAL_FILE_HEADER + l(tt, 2) + q + l(j.length, 2) + "\0\0\0\0" + l(B, 4) + l(f, 4) + M + N + j };
|
|
@@ -615,8 +615,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
615
615
|
T && T.binary !== void 0 || (W.binary = !j), (O instanceof _ && O.uncompressedSize === 0 || W.dir || !O || O.length === 0) && (W.base64 = !1, W.binary = !0, O = "", W.compression = "STORE", z = "string");
|
|
616
616
|
var b = null;
|
|
617
617
|
b = O instanceof _ || O instanceof a ? O : m.isNode && m.isStream(O) ? new i(x, O) : e.prepareContent(x, O, W.binary, W.optimizedBinaryString, W.base64);
|
|
618
|
-
var
|
|
619
|
-
this.files[x] =
|
|
618
|
+
var R = new v(x, b, W);
|
|
619
|
+
this.files[x] = R;
|
|
620
620
|
}
|
|
621
621
|
var o = n("./utf8"), e = n("./utils"), a = n("./stream/GenericWorker"), d = n("./stream/StreamHelper"), c = n("./defaults"), _ = n("./compressedObject"), v = n("./zipObject"), s = n("./generate"), m = n("./nodejsUtils"), i = n("./nodejs/NodejsStreamInputAdapter"), f = function(x) {
|
|
622
622
|
x.slice(-1) === "/" && (x = x.substring(0, x.length - 1));
|
|
@@ -1785,7 +1785,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1785
1785
|
return -1 ^ o;
|
|
1786
1786
|
};
|
|
1787
1787
|
}, {}], 46: [function(n, S, g) {
|
|
1788
|
-
var l, o = n("../utils/common"), e = n("./trees"), a = n("./adler32"), d = n("./crc32"), c = n("./messages"), _ = 0, v = 4, s = 0, m = -2, i = -1, f = 4, h = 2, u = 8, w = 9, k = 286, x = 30, O = 19, T = 2 * k + 1, M = 15, z = 3, W = 258, j = W + z + 1, b = 42,
|
|
1788
|
+
var l, o = n("../utils/common"), e = n("./trees"), a = n("./adler32"), d = n("./crc32"), c = n("./messages"), _ = 0, v = 4, s = 0, m = -2, i = -1, f = 4, h = 2, u = 8, w = 9, k = 286, x = 30, O = 19, T = 2 * k + 1, M = 15, z = 3, W = 258, j = W + z + 1, b = 42, R = 113, r = 1, N = 2, Q = 3, $ = 4;
|
|
1789
1789
|
function Y(t, D) {
|
|
1790
1790
|
return t.msg = c[D], D;
|
|
1791
1791
|
}
|
|
@@ -1797,8 +1797,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1797
1797
|
t[D] = 0;
|
|
1798
1798
|
}
|
|
1799
1799
|
function I(t) {
|
|
1800
|
-
var D = t.state,
|
|
1801
|
-
|
|
1800
|
+
var D = t.state, F = D.pending;
|
|
1801
|
+
F > t.avail_out && (F = t.avail_out), F !== 0 && (o.arraySet(t.output, D.pending_buf, D.pending_out, F, t.next_out), t.next_out += F, D.pending_out += F, t.total_out += F, t.avail_out -= F, D.pending -= F, D.pending === 0 && (D.pending_out = 0));
|
|
1802
1802
|
}
|
|
1803
1803
|
function B(t, D) {
|
|
1804
1804
|
e._tr_flush_block(t, 0 <= t.block_start ? t.block_start : -1, t.strstart - t.block_start, D), t.block_start = t.strstart, I(t.strm);
|
|
@@ -1810,14 +1810,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1810
1810
|
t.pending_buf[t.pending++] = D >>> 8 & 255, t.pending_buf[t.pending++] = 255 & D;
|
|
1811
1811
|
}
|
|
1812
1812
|
function X(t, D) {
|
|
1813
|
-
var
|
|
1813
|
+
var F, y, p = t.max_chain_length, C = t.strstart, U = t.prev_length, Z = t.nice_match, A = t.strstart > t.w_size - j ? t.strstart - (t.w_size - j) : 0, H = t.window, J = t.w_mask, G = t.prev, V = t.strstart + W, it = H[C + U - 1], rt = H[C + U];
|
|
1814
1814
|
t.prev_length >= t.good_match && (p >>= 2), Z > t.lookahead && (Z = t.lookahead);
|
|
1815
1815
|
do
|
|
1816
|
-
if (H[(
|
|
1817
|
-
C += 2,
|
|
1816
|
+
if (H[(F = D) + U] === rt && H[F + U - 1] === it && H[F] === H[C] && H[++F] === H[C + 1]) {
|
|
1817
|
+
C += 2, F++;
|
|
1818
1818
|
do
|
|
1819
1819
|
;
|
|
1820
|
-
while (H[++C] === H[++
|
|
1820
|
+
while (H[++C] === H[++F] && H[++C] === H[++F] && H[++C] === H[++F] && H[++C] === H[++F] && H[++C] === H[++F] && H[++C] === H[++F] && H[++C] === H[++F] && H[++C] === H[++F] && C < V);
|
|
1821
1821
|
if (y = W - (V - C), C = V - W, U < y) {
|
|
1822
1822
|
if (t.match_start = D, Z <= (U = y))
|
|
1823
1823
|
break;
|
|
@@ -1828,33 +1828,33 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1828
1828
|
return U <= t.lookahead ? U : t.lookahead;
|
|
1829
1829
|
}
|
|
1830
1830
|
function st(t) {
|
|
1831
|
-
var D,
|
|
1831
|
+
var D, F, y, p, C, U, Z, A, H, J, G = t.w_size;
|
|
1832
1832
|
do {
|
|
1833
1833
|
if (p = t.window_size - t.lookahead - t.strstart, t.strstart >= G + (G - j)) {
|
|
1834
|
-
for (o.arraySet(t.window, t.window, G, G, 0), t.match_start -= G, t.strstart -= G, t.block_start -= G, D =
|
|
1834
|
+
for (o.arraySet(t.window, t.window, G, G, 0), t.match_start -= G, t.strstart -= G, t.block_start -= G, D = F = t.hash_size; y = t.head[--D], t.head[D] = G <= y ? y - G : 0, --F; )
|
|
1835
1835
|
;
|
|
1836
|
-
for (D =
|
|
1836
|
+
for (D = F = G; y = t.prev[--D], t.prev[D] = G <= y ? y - G : 0, --F; )
|
|
1837
1837
|
;
|
|
1838
1838
|
p += G;
|
|
1839
1839
|
}
|
|
1840
1840
|
if (t.strm.avail_in === 0)
|
|
1841
1841
|
break;
|
|
1842
|
-
if (U = t.strm, Z = t.window, A = t.strstart + t.lookahead, H = p, J = void 0, J = U.avail_in, H < J && (J = H),
|
|
1842
|
+
if (U = t.strm, Z = t.window, A = t.strstart + t.lookahead, H = p, J = void 0, J = U.avail_in, H < J && (J = H), F = J === 0 ? 0 : (U.avail_in -= J, o.arraySet(Z, U.input, U.next_in, J, A), U.state.wrap === 1 ? U.adler = a(U.adler, Z, J, A) : U.state.wrap === 2 && (U.adler = d(U.adler, Z, J, A)), U.next_in += J, U.total_in += J, J), t.lookahead += F, t.lookahead + t.insert >= z)
|
|
1843
1843
|
for (C = t.strstart - t.insert, t.ins_h = t.window[C], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[C + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[C + z - 1]) & t.hash_mask, t.prev[C & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = C, C++, t.insert--, !(t.lookahead + t.insert < z)); )
|
|
1844
1844
|
;
|
|
1845
1845
|
} while (t.lookahead < j && t.strm.avail_in !== 0);
|
|
1846
1846
|
}
|
|
1847
1847
|
function ct(t, D) {
|
|
1848
|
-
for (var
|
|
1848
|
+
for (var F, y; ; ) {
|
|
1849
1849
|
if (t.lookahead < j) {
|
|
1850
1850
|
if (st(t), t.lookahead < j && D === _)
|
|
1851
1851
|
return r;
|
|
1852
1852
|
if (t.lookahead === 0)
|
|
1853
1853
|
break;
|
|
1854
1854
|
}
|
|
1855
|
-
if (
|
|
1855
|
+
if (F = 0, t.lookahead >= z && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + z - 1]) & t.hash_mask, F = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), F !== 0 && t.strstart - F <= t.w_size - j && (t.match_length = X(t, F)), t.match_length >= z)
|
|
1856
1856
|
if (y = e._tr_tally(t, t.strstart - t.match_start, t.match_length - z), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= z) {
|
|
1857
|
-
for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + z - 1]) & t.hash_mask,
|
|
1857
|
+
for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + z - 1]) & t.hash_mask, F = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart, --t.match_length != 0; )
|
|
1858
1858
|
;
|
|
1859
1859
|
t.strstart++;
|
|
1860
1860
|
} else
|
|
@@ -1867,15 +1867,15 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1867
1867
|
return t.insert = t.strstart < z - 1 ? t.strstart : z - 1, D === v ? (B(t, !0), t.strm.avail_out === 0 ? Q : $) : t.last_lit && (B(t, !1), t.strm.avail_out === 0) ? r : N;
|
|
1868
1868
|
}
|
|
1869
1869
|
function et(t, D) {
|
|
1870
|
-
for (var
|
|
1870
|
+
for (var F, y, p; ; ) {
|
|
1871
1871
|
if (t.lookahead < j) {
|
|
1872
1872
|
if (st(t), t.lookahead < j && D === _)
|
|
1873
1873
|
return r;
|
|
1874
1874
|
if (t.lookahead === 0)
|
|
1875
1875
|
break;
|
|
1876
1876
|
}
|
|
1877
|
-
if (
|
|
1878
|
-
for (p = t.strstart + t.lookahead - z, y = e._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - z), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= p && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + z - 1]) & t.hash_mask,
|
|
1877
|
+
if (F = 0, t.lookahead >= z && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + z - 1]) & t.hash_mask, F = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), t.prev_length = t.match_length, t.prev_match = t.match_start, t.match_length = z - 1, F !== 0 && t.prev_length < t.max_lazy_match && t.strstart - F <= t.w_size - j && (t.match_length = X(t, F), t.match_length <= 5 && (t.strategy === 1 || t.match_length === z && 4096 < t.strstart - t.match_start) && (t.match_length = z - 1)), t.prev_length >= z && t.match_length <= t.prev_length) {
|
|
1878
|
+
for (p = t.strstart + t.lookahead - z, y = e._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - z), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= p && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + z - 1]) & t.hash_mask, F = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), --t.prev_length != 0; )
|
|
1879
1879
|
;
|
|
1880
1880
|
if (t.match_available = 0, t.match_length = z - 1, t.strstart++, y && (B(t, !1), t.strm.avail_out === 0))
|
|
1881
1881
|
return r;
|
|
@@ -1887,35 +1887,35 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1887
1887
|
}
|
|
1888
1888
|
return t.match_available && (y = e._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < z - 1 ? t.strstart : z - 1, D === v ? (B(t, !0), t.strm.avail_out === 0 ? Q : $) : t.last_lit && (B(t, !1), t.strm.avail_out === 0) ? r : N;
|
|
1889
1889
|
}
|
|
1890
|
-
function nt(t, D,
|
|
1891
|
-
this.good_length = t, this.max_lazy = D, this.nice_length =
|
|
1890
|
+
function nt(t, D, F, y, p) {
|
|
1891
|
+
this.good_length = t, this.max_lazy = D, this.nice_length = F, this.max_chain = y, this.func = p;
|
|
1892
1892
|
}
|
|
1893
1893
|
function ht() {
|
|
1894
1894
|
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 = u, 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 o.Buf16(2 * T), this.dyn_dtree = new o.Buf16(2 * (2 * x + 1)), this.bl_tree = new o.Buf16(2 * (2 * O + 1)), K(this.dyn_ltree), K(this.dyn_dtree), K(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new o.Buf16(M + 1), this.heap = new o.Buf16(2 * k + 1), K(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new o.Buf16(2 * k + 1), K(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;
|
|
1895
1895
|
}
|
|
1896
1896
|
function ot(t) {
|
|
1897
1897
|
var D;
|
|
1898
|
-
return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = h, (D = t.state).pending = 0, D.pending_out = 0, D.wrap < 0 && (D.wrap = -D.wrap), D.status = D.wrap ? b :
|
|
1898
|
+
return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = h, (D = t.state).pending = 0, D.pending_out = 0, D.wrap < 0 && (D.wrap = -D.wrap), D.status = D.wrap ? b : R, t.adler = D.wrap === 2 ? 0 : 1, D.last_flush = _, e._tr_init(D), s) : Y(t, m);
|
|
1899
1899
|
}
|
|
1900
1900
|
function mt(t) {
|
|
1901
1901
|
var D = ot(t);
|
|
1902
|
-
return D === s && function(
|
|
1903
|
-
|
|
1902
|
+
return D === s && function(F) {
|
|
1903
|
+
F.window_size = 2 * F.w_size, K(F.head), F.max_lazy_match = l[F.level].max_lazy, F.good_match = l[F.level].good_length, F.nice_match = l[F.level].nice_length, F.max_chain_length = l[F.level].max_chain, F.strstart = 0, F.block_start = 0, F.lookahead = 0, F.insert = 0, F.match_length = F.prev_length = z - 1, F.match_available = 0, F.ins_h = 0;
|
|
1904
1904
|
}(t.state), D;
|
|
1905
1905
|
}
|
|
1906
|
-
function pt(t, D,
|
|
1906
|
+
function pt(t, D, F, y, p, C) {
|
|
1907
1907
|
if (!t)
|
|
1908
1908
|
return m;
|
|
1909
1909
|
var U = 1;
|
|
1910
|
-
if (D === i && (D = 6), y < 0 ? (U = 0, y = -y) : 15 < y && (U = 2, y -= 16), p < 1 || w < p ||
|
|
1910
|
+
if (D === i && (D = 6), y < 0 ? (U = 0, y = -y) : 15 < y && (U = 2, y -= 16), p < 1 || w < p || F !== u || y < 8 || 15 < y || D < 0 || 9 < D || C < 0 || f < C)
|
|
1911
1911
|
return Y(t, m);
|
|
1912
1912
|
y === 8 && (y = 9);
|
|
1913
1913
|
var Z = new ht();
|
|
1914
|
-
return (t.state = Z).strm = t, Z.wrap = U, Z.gzhead = null, Z.w_bits = y, Z.w_size = 1 << Z.w_bits, Z.w_mask = Z.w_size - 1, Z.hash_bits = p + 7, Z.hash_size = 1 << Z.hash_bits, Z.hash_mask = Z.hash_size - 1, Z.hash_shift = ~~((Z.hash_bits + z - 1) / z), Z.window = new o.Buf8(2 * Z.w_size), Z.head = new o.Buf16(Z.hash_size), Z.prev = new o.Buf16(Z.w_size), Z.lit_bufsize = 1 << p + 6, Z.pending_buf_size = 4 * Z.lit_bufsize, Z.pending_buf = new o.Buf8(Z.pending_buf_size), Z.d_buf = 1 * Z.lit_bufsize, Z.l_buf = 3 * Z.lit_bufsize, Z.level = D, Z.strategy = C, Z.method =
|
|
1914
|
+
return (t.state = Z).strm = t, Z.wrap = U, Z.gzhead = null, Z.w_bits = y, Z.w_size = 1 << Z.w_bits, Z.w_mask = Z.w_size - 1, Z.hash_bits = p + 7, Z.hash_size = 1 << Z.hash_bits, Z.hash_mask = Z.hash_size - 1, Z.hash_shift = ~~((Z.hash_bits + z - 1) / z), Z.window = new o.Buf8(2 * Z.w_size), Z.head = new o.Buf16(Z.hash_size), Z.prev = new o.Buf16(Z.w_size), Z.lit_bufsize = 1 << p + 6, Z.pending_buf_size = 4 * Z.lit_bufsize, Z.pending_buf = new o.Buf8(Z.pending_buf_size), Z.d_buf = 1 * Z.lit_bufsize, Z.l_buf = 3 * Z.lit_bufsize, Z.level = D, Z.strategy = C, Z.method = F, mt(t);
|
|
1915
1915
|
}
|
|
1916
1916
|
l = [new nt(0, 0, 0, 0, function(t, D) {
|
|
1917
|
-
var
|
|
1918
|
-
for (
|
|
1917
|
+
var F = 65535;
|
|
1918
|
+
for (F > t.pending_buf_size - 5 && (F = t.pending_buf_size - 5); ; ) {
|
|
1919
1919
|
if (t.lookahead <= 1) {
|
|
1920
1920
|
if (st(t), t.lookahead === 0 && D === _)
|
|
1921
1921
|
return r;
|
|
@@ -1923,7 +1923,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1923
1923
|
break;
|
|
1924
1924
|
}
|
|
1925
1925
|
t.strstart += t.lookahead, t.lookahead = 0;
|
|
1926
|
-
var y = t.block_start +
|
|
1926
|
+
var y = t.block_start + F;
|
|
1927
1927
|
if ((t.strstart === 0 || t.strstart >= y) && (t.lookahead = t.strstart - y, t.strstart = y, B(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - j && (B(t, !1), t.strm.avail_out === 0))
|
|
1928
1928
|
return r;
|
|
1929
1929
|
}
|
|
@@ -1933,17 +1933,17 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1933
1933
|
}, g.deflateInit2 = pt, g.deflateReset = mt, g.deflateResetKeep = ot, g.deflateSetHeader = function(t, D) {
|
|
1934
1934
|
return t && t.state ? t.state.wrap !== 2 ? m : (t.state.gzhead = D, s) : m;
|
|
1935
1935
|
}, g.deflate = function(t, D) {
|
|
1936
|
-
var
|
|
1936
|
+
var F, y, p, C;
|
|
1937
1937
|
if (!t || !t.state || 5 < D || D < 0)
|
|
1938
1938
|
return t ? Y(t, m) : m;
|
|
1939
1939
|
if (y = t.state, !t.output || !t.input && t.avail_in !== 0 || y.status === 666 && D !== v)
|
|
1940
1940
|
return Y(t, t.avail_out === 0 ? -5 : m);
|
|
1941
|
-
if (y.strm = t,
|
|
1941
|
+
if (y.strm = t, F = y.last_flush, y.last_flush = D, y.status === b)
|
|
1942
1942
|
if (y.wrap === 2)
|
|
1943
|
-
t.adler = 0, tt(y, 31), tt(y, 139), tt(y, 8), y.gzhead ? (tt(y, (y.gzhead.text ? 1 : 0) + (y.gzhead.hcrc ? 2 : 0) + (y.gzhead.extra ? 4 : 0) + (y.gzhead.name ? 8 : 0) + (y.gzhead.comment ? 16 : 0)), tt(y, 255 & y.gzhead.time), tt(y, y.gzhead.time >> 8 & 255), tt(y, y.gzhead.time >> 16 & 255), tt(y, y.gzhead.time >> 24 & 255), tt(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), tt(y, 255 & y.gzhead.os), y.gzhead.extra && y.gzhead.extra.length && (tt(y, 255 & y.gzhead.extra.length), tt(y, y.gzhead.extra.length >> 8 & 255)), y.gzhead.hcrc && (t.adler = d(t.adler, y.pending_buf, y.pending, 0)), y.gzindex = 0, y.status = 69) : (tt(y, 0), tt(y, 0), tt(y, 0), tt(y, 0), tt(y, 0), tt(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), tt(y, 3), y.status =
|
|
1943
|
+
t.adler = 0, tt(y, 31), tt(y, 139), tt(y, 8), y.gzhead ? (tt(y, (y.gzhead.text ? 1 : 0) + (y.gzhead.hcrc ? 2 : 0) + (y.gzhead.extra ? 4 : 0) + (y.gzhead.name ? 8 : 0) + (y.gzhead.comment ? 16 : 0)), tt(y, 255 & y.gzhead.time), tt(y, y.gzhead.time >> 8 & 255), tt(y, y.gzhead.time >> 16 & 255), tt(y, y.gzhead.time >> 24 & 255), tt(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), tt(y, 255 & y.gzhead.os), y.gzhead.extra && y.gzhead.extra.length && (tt(y, 255 & y.gzhead.extra.length), tt(y, y.gzhead.extra.length >> 8 & 255)), y.gzhead.hcrc && (t.adler = d(t.adler, y.pending_buf, y.pending, 0)), y.gzindex = 0, y.status = 69) : (tt(y, 0), tt(y, 0), tt(y, 0), tt(y, 0), tt(y, 0), tt(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), tt(y, 3), y.status = R);
|
|
1944
1944
|
else {
|
|
1945
1945
|
var U = u + (y.w_bits - 8 << 4) << 8;
|
|
1946
|
-
U |= (2 <= y.strategy || y.level < 2 ? 0 : y.level < 6 ? 1 : y.level === 6 ? 2 : 3) << 6, y.strstart !== 0 && (U |= 32), U += 31 - U % 31, y.status =
|
|
1946
|
+
U |= (2 <= y.strategy || y.level < 2 ? 0 : y.level < 6 ? 1 : y.level === 6 ? 2 : 3) << 6, y.strstart !== 0 && (U |= 32), U += 31 - U % 31, y.status = R, q(y, U), y.strstart !== 0 && (q(y, t.adler >>> 16), q(y, 65535 & t.adler)), t.adler = 1;
|
|
1947
1947
|
}
|
|
1948
1948
|
if (y.status === 69)
|
|
1949
1949
|
if (y.gzhead.extra) {
|
|
@@ -1978,10 +1978,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1978
1978
|
y.gzhead.hcrc && y.pending > p && (t.adler = d(t.adler, y.pending_buf, y.pending - p, p)), C === 0 && (y.status = 103);
|
|
1979
1979
|
} else
|
|
1980
1980
|
y.status = 103;
|
|
1981
|
-
if (y.status === 103 && (y.gzhead.hcrc ? (y.pending + 2 > y.pending_buf_size && I(t), y.pending + 2 <= y.pending_buf_size && (tt(y, 255 & t.adler), tt(y, t.adler >> 8 & 255), t.adler = 0, y.status =
|
|
1981
|
+
if (y.status === 103 && (y.gzhead.hcrc ? (y.pending + 2 > y.pending_buf_size && I(t), y.pending + 2 <= y.pending_buf_size && (tt(y, 255 & t.adler), tt(y, t.adler >> 8 & 255), t.adler = 0, y.status = R)) : y.status = R), y.pending !== 0) {
|
|
1982
1982
|
if (I(t), t.avail_out === 0)
|
|
1983
1983
|
return y.last_flush = -1, s;
|
|
1984
|
-
} else if (t.avail_in === 0 && L(D) <= L(
|
|
1984
|
+
} else if (t.avail_in === 0 && L(D) <= L(F) && D !== v)
|
|
1985
1985
|
return Y(t, -5);
|
|
1986
1986
|
if (y.status === 666 && t.avail_in !== 0)
|
|
1987
1987
|
return Y(t, -5);
|
|
@@ -2025,17 +2025,17 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2025
2025
|
return D !== v ? s : y.wrap <= 0 ? 1 : (y.wrap === 2 ? (tt(y, 255 & t.adler), tt(y, t.adler >> 8 & 255), tt(y, t.adler >> 16 & 255), tt(y, t.adler >> 24 & 255), tt(y, 255 & t.total_in), tt(y, t.total_in >> 8 & 255), tt(y, t.total_in >> 16 & 255), tt(y, t.total_in >> 24 & 255)) : (q(y, t.adler >>> 16), q(y, 65535 & t.adler)), I(t), 0 < y.wrap && (y.wrap = -y.wrap), y.pending !== 0 ? s : 1);
|
|
2026
2026
|
}, g.deflateEnd = function(t) {
|
|
2027
2027
|
var D;
|
|
2028
|
-
return t && t.state ? (D = t.state.status) !== b && D !== 69 && D !== 73 && D !== 91 && D !== 103 && D !==
|
|
2028
|
+
return t && t.state ? (D = t.state.status) !== b && D !== 69 && D !== 73 && D !== 91 && D !== 103 && D !== R && D !== 666 ? Y(t, m) : (t.state = null, D === R ? Y(t, -3) : s) : m;
|
|
2029
2029
|
}, g.deflateSetDictionary = function(t, D) {
|
|
2030
|
-
var
|
|
2031
|
-
if (!t || !t.state || (C = (
|
|
2030
|
+
var F, y, p, C, U, Z, A, H, J = D.length;
|
|
2031
|
+
if (!t || !t.state || (C = (F = t.state).wrap) === 2 || C === 1 && F.status !== b || F.lookahead)
|
|
2032
2032
|
return m;
|
|
2033
|
-
for (C === 1 && (t.adler = a(t.adler, D, J, 0)),
|
|
2034
|
-
for (y =
|
|
2033
|
+
for (C === 1 && (t.adler = a(t.adler, D, J, 0)), F.wrap = 0, J >= F.w_size && (C === 0 && (K(F.head), F.strstart = 0, F.block_start = 0, F.insert = 0), H = new o.Buf8(F.w_size), o.arraySet(H, D, J - F.w_size, F.w_size, 0), D = H, J = F.w_size), U = t.avail_in, Z = t.next_in, A = t.input, t.avail_in = J, t.next_in = 0, t.input = D, st(F); F.lookahead >= z; ) {
|
|
2034
|
+
for (y = F.strstart, p = F.lookahead - (z - 1); F.ins_h = (F.ins_h << F.hash_shift ^ F.window[y + z - 1]) & F.hash_mask, F.prev[y & F.w_mask] = F.head[F.ins_h], F.head[F.ins_h] = y, y++, --p; )
|
|
2035
2035
|
;
|
|
2036
|
-
|
|
2036
|
+
F.strstart = y, F.lookahead = z - 1, st(F);
|
|
2037
2037
|
}
|
|
2038
|
-
return
|
|
2038
|
+
return F.strstart += F.lookahead, F.block_start = F.strstart, F.insert = F.lookahead, F.lookahead = 0, F.match_length = F.prev_length = z - 1, F.match_available = 0, t.next_in = Z, t.input = A, t.avail_in = U, F.wrap = C, s;
|
|
2039
2039
|
}, g.deflateInfo = "pako deflate (from Nodeca project)";
|
|
2040
2040
|
}, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(n, S, g) {
|
|
2041
2041
|
S.exports = function() {
|
|
@@ -2043,7 +2043,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2043
2043
|
};
|
|
2044
2044
|
}, {}], 48: [function(n, S, g) {
|
|
2045
2045
|
S.exports = function(l, o) {
|
|
2046
|
-
var e, a, d, c, _, v, s, m, i, f, h, u, w, k, x, O, T, M, z, W, j, b,
|
|
2046
|
+
var e, a, d, c, _, v, s, m, i, f, h, u, w, k, x, O, T, M, z, W, j, b, R, r, N;
|
|
2047
2047
|
e = l.state, a = l.next_in, r = l.input, d = a + (l.avail_in - 5), c = l.next_out, N = l.output, _ = c - (o - l.avail_out), v = c + (l.avail_out - 257), s = e.dmax, m = e.wsize, i = e.whave, f = e.wnext, h = e.window, u = e.hold, w = e.bits, k = e.lencode, x = e.distcode, O = (1 << e.lenbits) - 1, T = (1 << e.distbits) - 1;
|
|
2048
2048
|
t:
|
|
2049
2049
|
do {
|
|
@@ -2085,11 +2085,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2085
2085
|
l.msg = "invalid distance too far back", e.mode = 30;
|
|
2086
2086
|
break t;
|
|
2087
2087
|
}
|
|
2088
|
-
if (
|
|
2088
|
+
if (R = h, (b = 0) === f) {
|
|
2089
2089
|
if (b += m - z, z < W) {
|
|
2090
2090
|
for (W -= z; N[c++] = h[b++], --z; )
|
|
2091
2091
|
;
|
|
2092
|
-
b = c - j,
|
|
2092
|
+
b = c - j, R = N;
|
|
2093
2093
|
}
|
|
2094
2094
|
} else if (f < z) {
|
|
2095
2095
|
if (b += m + f - z, (z -= f) < W) {
|
|
@@ -2098,17 +2098,17 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2098
2098
|
if (b = 0, f < W) {
|
|
2099
2099
|
for (W -= z = f; N[c++] = h[b++], --z; )
|
|
2100
2100
|
;
|
|
2101
|
-
b = c - j,
|
|
2101
|
+
b = c - j, R = N;
|
|
2102
2102
|
}
|
|
2103
2103
|
}
|
|
2104
2104
|
} else if (b += f - z, z < W) {
|
|
2105
2105
|
for (W -= z; N[c++] = h[b++], --z; )
|
|
2106
2106
|
;
|
|
2107
|
-
b = c - j,
|
|
2107
|
+
b = c - j, R = N;
|
|
2108
2108
|
}
|
|
2109
2109
|
for (; 2 < W; )
|
|
2110
|
-
N[c++] =
|
|
2111
|
-
W && (N[c++] =
|
|
2110
|
+
N[c++] = R[b++], N[c++] = R[b++], N[c++] = R[b++], W -= 3;
|
|
2111
|
+
W && (N[c++] = R[b++], 1 < W && (N[c++] = R[b++]));
|
|
2112
2112
|
} else {
|
|
2113
2113
|
for (b = c - j; N[c++] = N[b++], N[c++] = N[b++], N[c++] = N[b++], 2 < (W -= 3); )
|
|
2114
2114
|
;
|
|
@@ -2131,47 +2131,47 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2131
2131
|
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 l.Buf16(320), this.work = new l.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
|
|
2132
2132
|
}
|
|
2133
2133
|
function w(b) {
|
|
2134
|
-
var
|
|
2135
|
-
return b && b.state ? (
|
|
2134
|
+
var R;
|
|
2135
|
+
return b && b.state ? (R = b.state, b.total_in = b.total_out = R.total = 0, b.msg = "", R.wrap && (b.adler = 1 & R.wrap), R.mode = m, R.last = 0, R.havedict = 0, R.dmax = 32768, R.head = null, R.hold = 0, R.bits = 0, R.lencode = R.lendyn = new l.Buf32(i), R.distcode = R.distdyn = new l.Buf32(f), R.sane = 1, R.back = -1, v) : s;
|
|
2136
2136
|
}
|
|
2137
2137
|
function k(b) {
|
|
2138
|
-
var
|
|
2139
|
-
return b && b.state ? ((
|
|
2138
|
+
var R;
|
|
2139
|
+
return b && b.state ? ((R = b.state).wsize = 0, R.whave = 0, R.wnext = 0, w(b)) : s;
|
|
2140
2140
|
}
|
|
2141
|
-
function x(b,
|
|
2141
|
+
function x(b, R) {
|
|
2142
2142
|
var r, N;
|
|
2143
|
-
return b && b.state ? (N = b.state,
|
|
2143
|
+
return b && b.state ? (N = b.state, R < 0 ? (r = 0, R = -R) : (r = 1 + (R >> 4), R < 48 && (R &= 15)), R && (R < 8 || 15 < R) ? s : (N.window !== null && N.wbits !== R && (N.window = null), N.wrap = r, N.wbits = R, k(b))) : s;
|
|
2144
2144
|
}
|
|
2145
|
-
function O(b,
|
|
2145
|
+
function O(b, R) {
|
|
2146
2146
|
var r, N;
|
|
2147
|
-
return b ? (N = new u(), (b.state = N).window = null, (r = x(b,
|
|
2147
|
+
return b ? (N = new u(), (b.state = N).window = null, (r = x(b, R)) !== v && (b.state = null), r) : s;
|
|
2148
2148
|
}
|
|
2149
2149
|
var T, M, z = !0;
|
|
2150
2150
|
function W(b) {
|
|
2151
2151
|
if (z) {
|
|
2152
|
-
var
|
|
2153
|
-
for (T = new l.Buf32(512), M = new l.Buf32(32),
|
|
2154
|
-
b.lens[
|
|
2155
|
-
for (;
|
|
2156
|
-
b.lens[
|
|
2157
|
-
for (;
|
|
2158
|
-
b.lens[
|
|
2159
|
-
for (;
|
|
2160
|
-
b.lens[
|
|
2161
|
-
for (d(c, b.lens, 0, 288, T, 0, b.work, { bits: 9 }),
|
|
2162
|
-
b.lens[
|
|
2152
|
+
var R;
|
|
2153
|
+
for (T = new l.Buf32(512), M = new l.Buf32(32), R = 0; R < 144; )
|
|
2154
|
+
b.lens[R++] = 8;
|
|
2155
|
+
for (; R < 256; )
|
|
2156
|
+
b.lens[R++] = 9;
|
|
2157
|
+
for (; R < 280; )
|
|
2158
|
+
b.lens[R++] = 7;
|
|
2159
|
+
for (; R < 288; )
|
|
2160
|
+
b.lens[R++] = 8;
|
|
2161
|
+
for (d(c, b.lens, 0, 288, T, 0, b.work, { bits: 9 }), R = 0; R < 32; )
|
|
2162
|
+
b.lens[R++] = 5;
|
|
2163
2163
|
d(_, b.lens, 0, 32, M, 0, b.work, { bits: 5 }), z = !1;
|
|
2164
2164
|
}
|
|
2165
2165
|
b.lencode = T, b.lenbits = 9, b.distcode = M, b.distbits = 5;
|
|
2166
2166
|
}
|
|
2167
|
-
function j(b,
|
|
2167
|
+
function j(b, R, r, N) {
|
|
2168
2168
|
var Q, $ = b.state;
|
|
2169
|
-
return $.window === null && ($.wsize = 1 << $.wbits, $.wnext = 0, $.whave = 0, $.window = new l.Buf8($.wsize)), N >= $.wsize ? (l.arraySet($.window,
|
|
2169
|
+
return $.window === null && ($.wsize = 1 << $.wbits, $.wnext = 0, $.whave = 0, $.window = new l.Buf8($.wsize)), N >= $.wsize ? (l.arraySet($.window, R, r - $.wsize, $.wsize, 0), $.wnext = 0, $.whave = $.wsize) : (N < (Q = $.wsize - $.wnext) && (Q = N), l.arraySet($.window, R, r - N, Q, $.wnext), (N -= Q) ? (l.arraySet($.window, R, r - N, N, 0), $.wnext = N, $.whave = $.wsize) : ($.wnext += Q, $.wnext === $.wsize && ($.wnext = 0), $.whave < $.wsize && ($.whave += Q))), 0;
|
|
2170
2170
|
}
|
|
2171
2171
|
g.inflateReset = k, g.inflateReset2 = x, g.inflateResetKeep = w, g.inflateInit = function(b) {
|
|
2172
2172
|
return O(b, 15);
|
|
2173
|
-
}, g.inflateInit2 = O, g.inflate = function(b,
|
|
2174
|
-
var r, N, Q, $, Y, L, K, I, B, tt, q, X, st, ct, et, nt, ht, ot, mt, pt, t, D,
|
|
2173
|
+
}, g.inflateInit2 = O, g.inflate = function(b, R) {
|
|
2174
|
+
var r, N, Q, $, Y, L, K, I, B, tt, q, X, st, ct, et, nt, ht, ot, mt, pt, t, D, F, y, p = 0, C = new l.Buf8(4), U = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
|
|
2175
2175
|
if (!b || !b.state || !b.output || !b.input && b.avail_in !== 0)
|
|
2176
2176
|
return s;
|
|
2177
2177
|
(r = b.state).mode === 12 && (r.mode = 13), Y = b.next_out, Q = b.output, K = b.avail_out, $ = b.next_in, N = b.input, L = b.avail_in, I = r.hold, B = r.bits, tt = L, q = K, D = v;
|
|
@@ -2301,7 +2301,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2301
2301
|
return b.next_out = Y, b.avail_out = K, b.next_in = $, b.avail_in = L, r.hold = I, r.bits = B, 2;
|
|
2302
2302
|
b.adler = r.check = 1, r.mode = 12;
|
|
2303
2303
|
case 12:
|
|
2304
|
-
if (
|
|
2304
|
+
if (R === 5 || R === 6)
|
|
2305
2305
|
break t;
|
|
2306
2306
|
case 13:
|
|
2307
2307
|
if (r.last) {
|
|
@@ -2318,7 +2318,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2318
2318
|
r.mode = 14;
|
|
2319
2319
|
break;
|
|
2320
2320
|
case 1:
|
|
2321
|
-
if (W(r), r.mode = 20,
|
|
2321
|
+
if (W(r), r.mode = 20, R !== 6)
|
|
2322
2322
|
break;
|
|
2323
2323
|
I >>>= 2, B -= 2;
|
|
2324
2324
|
break t;
|
|
@@ -2340,7 +2340,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2340
2340
|
b.msg = "invalid stored block lengths", r.mode = 30;
|
|
2341
2341
|
break;
|
|
2342
2342
|
}
|
|
2343
|
-
if (r.length = 65535 & I, B = I = 0, r.mode = 15,
|
|
2343
|
+
if (r.length = 65535 & I, B = I = 0, r.mode = 15, R === 6)
|
|
2344
2344
|
break t;
|
|
2345
2345
|
case 15:
|
|
2346
2346
|
r.mode = 16;
|
|
@@ -2375,7 +2375,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2375
2375
|
}
|
|
2376
2376
|
for (; r.have < 19; )
|
|
2377
2377
|
r.lens[U[r.have++]] = 0;
|
|
2378
|
-
if (r.lencode = r.lendyn, r.lenbits = 7,
|
|
2378
|
+
if (r.lencode = r.lendyn, r.lenbits = 7, F = { bits: r.lenbits }, D = d(0, r.lens, 0, 19, r.lencode, 0, r.work, F), r.lenbits = F.bits, D) {
|
|
2379
2379
|
b.msg = "invalid code lengths set", r.mode = 30;
|
|
2380
2380
|
break;
|
|
2381
2381
|
}
|
|
@@ -2430,15 +2430,15 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2430
2430
|
b.msg = "invalid code -- missing end-of-block", r.mode = 30;
|
|
2431
2431
|
break;
|
|
2432
2432
|
}
|
|
2433
|
-
if (r.lenbits = 9,
|
|
2433
|
+
if (r.lenbits = 9, F = { bits: r.lenbits }, D = d(c, r.lens, 0, r.nlen, r.lencode, 0, r.work, F), r.lenbits = F.bits, D) {
|
|
2434
2434
|
b.msg = "invalid literal/lengths set", r.mode = 30;
|
|
2435
2435
|
break;
|
|
2436
2436
|
}
|
|
2437
|
-
if (r.distbits = 6, r.distcode = r.distdyn,
|
|
2437
|
+
if (r.distbits = 6, r.distcode = r.distdyn, F = { bits: r.distbits }, D = d(_, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, F), r.distbits = F.bits, D) {
|
|
2438
2438
|
b.msg = "invalid distances set", r.mode = 30;
|
|
2439
2439
|
break;
|
|
2440
2440
|
}
|
|
2441
|
-
if (r.mode = 20,
|
|
2441
|
+
if (r.mode = 20, R === 6)
|
|
2442
2442
|
break t;
|
|
2443
2443
|
case 20:
|
|
2444
2444
|
r.mode = 21;
|
|
@@ -2576,27 +2576,27 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2576
2576
|
default:
|
|
2577
2577
|
return s;
|
|
2578
2578
|
}
|
|
2579
|
-
return b.next_out = Y, b.avail_out = K, b.next_in = $, b.avail_in = L, r.hold = I, r.bits = B, (r.wsize || q !== b.avail_out && r.mode < 30 && (r.mode < 27 ||
|
|
2579
|
+
return b.next_out = Y, b.avail_out = K, b.next_in = $, b.avail_in = L, r.hold = I, r.bits = B, (r.wsize || q !== b.avail_out && r.mode < 30 && (r.mode < 27 || R !== 4)) && j(b, b.output, b.next_out, q - b.avail_out) ? (r.mode = 31, -4) : (tt -= b.avail_in, q -= b.avail_out, b.total_in += tt, b.total_out += q, r.total += q, r.wrap && q && (b.adler = r.check = r.flags ? e(r.check, Q, q, b.next_out - q) : o(r.check, Q, q, b.next_out - q)), b.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === 12 ? 128 : 0) + (r.mode === 20 || r.mode === 15 ? 256 : 0), (tt == 0 && q === 0 || R === 4) && D === v && (D = -5), D);
|
|
2580
2580
|
}, g.inflateEnd = function(b) {
|
|
2581
2581
|
if (!b || !b.state)
|
|
2582
2582
|
return s;
|
|
2583
|
-
var
|
|
2584
|
-
return
|
|
2585
|
-
}, g.inflateGetHeader = function(b,
|
|
2583
|
+
var R = b.state;
|
|
2584
|
+
return R.window && (R.window = null), b.state = null, v;
|
|
2585
|
+
}, g.inflateGetHeader = function(b, R) {
|
|
2586
2586
|
var r;
|
|
2587
|
-
return b && b.state && 2 & (r = b.state).wrap ? ((r.head =
|
|
2588
|
-
}, g.inflateSetDictionary = function(b,
|
|
2589
|
-
var r, N =
|
|
2590
|
-
return b && b.state ? (r = b.state).wrap !== 0 && r.mode !== 11 ? s : r.mode === 11 && o(1,
|
|
2587
|
+
return b && b.state && 2 & (r = b.state).wrap ? ((r.head = R).done = !1, v) : s;
|
|
2588
|
+
}, g.inflateSetDictionary = function(b, R) {
|
|
2589
|
+
var r, N = R.length;
|
|
2590
|
+
return b && b.state ? (r = b.state).wrap !== 0 && r.mode !== 11 ? s : r.mode === 11 && o(1, R, N, 0) !== r.check ? -3 : j(b, R, N, N) ? (r.mode = 31, -4) : (r.havedict = 1, v) : s;
|
|
2591
2591
|
}, g.inflateInfo = "pako inflate (from Nodeca project)";
|
|
2592
2592
|
}, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(n, S, g) {
|
|
2593
2593
|
var l = n("../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], e = [16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78], a = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0], d = [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];
|
|
2594
2594
|
S.exports = function(c, _, v, s, m, i, f, h) {
|
|
2595
|
-
var u, w, k, x, O, T, M, z, W, j = h.bits, b = 0,
|
|
2595
|
+
var u, w, k, x, O, T, M, z, W, j = h.bits, b = 0, R = 0, r = 0, N = 0, Q = 0, $ = 0, Y = 0, L = 0, K = 0, I = 0, B = null, tt = 0, q = new l.Buf16(16), X = new l.Buf16(16), st = null, ct = 0;
|
|
2596
2596
|
for (b = 0; b <= 15; b++)
|
|
2597
2597
|
q[b] = 0;
|
|
2598
|
-
for (
|
|
2599
|
-
q[_[v +
|
|
2598
|
+
for (R = 0; R < s; R++)
|
|
2599
|
+
q[_[v + R]]++;
|
|
2600
2600
|
for (Q = j, N = 15; 1 <= N && q[N] === 0; N--)
|
|
2601
2601
|
;
|
|
2602
2602
|
if (N < Q && (Q = N), N === 0)
|
|
@@ -2610,19 +2610,19 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2610
2610
|
return -1;
|
|
2611
2611
|
for (X[1] = 0, b = 1; b < 15; b++)
|
|
2612
2612
|
X[b + 1] = X[b] + q[b];
|
|
2613
|
-
for (
|
|
2614
|
-
_[v +
|
|
2615
|
-
if (T = c === 0 ? (B = st = f, 19) : c === 1 ? (B = o, tt -= 257, st = e, ct -= 257, 256) : (B = a, st = d, -1), b = r, O = i, Y =
|
|
2613
|
+
for (R = 0; R < s; R++)
|
|
2614
|
+
_[v + R] !== 0 && (f[X[_[v + R]]++] = R);
|
|
2615
|
+
if (T = c === 0 ? (B = st = f, 19) : c === 1 ? (B = o, tt -= 257, st = e, ct -= 257, 256) : (B = a, st = d, -1), b = r, O = i, Y = R = I = 0, k = -1, x = (K = 1 << ($ = Q)) - 1, c === 1 && 852 < K || c === 2 && 592 < K)
|
|
2616
2616
|
return 1;
|
|
2617
2617
|
for (; ; ) {
|
|
2618
|
-
for (M = b - Y, W = f[
|
|
2618
|
+
for (M = b - Y, W = f[R] < T ? (z = 0, f[R]) : f[R] > T ? (z = st[ct + f[R]], B[tt + f[R]]) : (z = 96, 0), u = 1 << b - Y, r = w = 1 << $; m[O + (I >> Y) + (w -= u)] = M << 24 | z << 16 | W | 0, w !== 0; )
|
|
2619
2619
|
;
|
|
2620
2620
|
for (u = 1 << b - 1; I & u; )
|
|
2621
2621
|
u >>= 1;
|
|
2622
|
-
if (u !== 0 ? (I &= u - 1, I += u) : I = 0,
|
|
2622
|
+
if (u !== 0 ? (I &= u - 1, I += u) : I = 0, R++, --q[b] == 0) {
|
|
2623
2623
|
if (b === N)
|
|
2624
2624
|
break;
|
|
2625
|
-
b = _[v + f[
|
|
2625
|
+
b = _[v + f[R]];
|
|
2626
2626
|
}
|
|
2627
2627
|
if (Q < b && (I & x) !== k) {
|
|
2628
2628
|
for (Y === 0 && (Y = Q), O += r, L = 1 << ($ = b - Y); $ + Y < N && !((L -= q[$ + Y]) <= 0); )
|
|
@@ -2646,8 +2646,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2646
2646
|
a(j);
|
|
2647
2647
|
var b = new Array(2 * s);
|
|
2648
2648
|
a(b);
|
|
2649
|
-
var
|
|
2650
|
-
a(
|
|
2649
|
+
var R = new Array(512);
|
|
2650
|
+
a(R);
|
|
2651
2651
|
var r = new Array(256);
|
|
2652
2652
|
a(r);
|
|
2653
2653
|
var N = new Array(c);
|
|
@@ -2660,7 +2660,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2660
2660
|
this.dyn_tree = p, this.max_code = 0, this.stat_desc = C;
|
|
2661
2661
|
}
|
|
2662
2662
|
function B(p) {
|
|
2663
|
-
return p < 256 ?
|
|
2663
|
+
return p < 256 ? R[p] : R[256 + (p >>> 7)];
|
|
2664
2664
|
}
|
|
2665
2665
|
function tt(p, C) {
|
|
2666
2666
|
p.pending_buf[p.pending++] = 255 & C, p.pending_buf[p.pending++] = C >>> 8 & 255;
|
|
@@ -2760,24 +2760,24 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2760
2760
|
}
|
|
2761
2761
|
}
|
|
2762
2762
|
a(L);
|
|
2763
|
-
var
|
|
2763
|
+
var F = !1;
|
|
2764
2764
|
function y(p, C, U, Z) {
|
|
2765
2765
|
q(p, (d << 1) + (Z ? 1 : 0), 3), function(A, H, J, G) {
|
|
2766
2766
|
nt(A), G && (tt(A, J), tt(A, ~J)), l.arraySet(A.pending_buf, A.window, H, J, A.pending), A.pending += J;
|
|
2767
2767
|
}(p, C, U, !0);
|
|
2768
2768
|
}
|
|
2769
2769
|
g._tr_init = function(p) {
|
|
2770
|
-
|
|
2770
|
+
F || (function() {
|
|
2771
2771
|
var C, U, Z, A, H, J = new Array(f + 1);
|
|
2772
2772
|
for (A = Z = 0; A < c - 1; A++)
|
|
2773
2773
|
for (N[A] = Z, C = 0; C < 1 << T[A]; C++)
|
|
2774
2774
|
r[Z++] = A;
|
|
2775
2775
|
for (r[Z - 1] = A, A = H = 0; A < 16; A++)
|
|
2776
2776
|
for (L[A] = H, C = 0; C < 1 << M[A]; C++)
|
|
2777
|
-
|
|
2777
|
+
R[H++] = A;
|
|
2778
2778
|
for (H >>= 7; A < s; A++)
|
|
2779
2779
|
for (L[A] = H << 7, C = 0; C < 1 << M[A] - 7; C++)
|
|
2780
|
-
|
|
2780
|
+
R[256 + H++] = A;
|
|
2781
2781
|
for (U = 0; U <= f; U++)
|
|
2782
2782
|
J[U] = 0;
|
|
2783
2783
|
for (C = 0; C <= 143; )
|
|
@@ -2791,7 +2791,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2791
2791
|
for (ct(j, v + 1, J), C = 0; C < s; C++)
|
|
2792
2792
|
b[2 * C + 1] = 5, b[2 * C] = st(C, 5);
|
|
2793
2793
|
Q = new K(j, T, _ + 1, v, f), $ = new K(b, M, 0, s, f), Y = new K(new Array(0), z, 0, m, u);
|
|
2794
|
-
}(),
|
|
2794
|
+
}(), F = !0), p.l_desc = new I(p.dyn_ltree, Q), p.d_desc = new I(p.dyn_dtree, $), p.bl_desc = new I(p.bl_tree, Y), p.bi_buf = 0, p.bi_valid = 0, et(p);
|
|
2795
2795
|
}, g._tr_stored_block = y, g._tr_flush_block = function(p, C, U, Z) {
|
|
2796
2796
|
var A, H, J = 0;
|
|
2797
2797
|
0 < p.level ? (p.strm.data_type === 2 && (p.strm.data_type = function(G) {
|
|
@@ -2992,7 +2992,7 @@ function ve() {
|
|
|
2992
2992
|
for (const P of [...document.querySelectorAll("*")])
|
|
2993
2993
|
for (const n of ["before", "after"]) {
|
|
2994
2994
|
const S = getComputedStyle(P, "::" + n), g = parseFloat(S.width), l = parseFloat(S.height);
|
|
2995
|
-
if (S.content === "none" || S.content === "normal" || !(g >= 8 && l > 0 && l <=
|
|
2995
|
+
if (S.content === "none" || S.content === "normal" || !(g >= 8 && l > 0 && l <= 4 || l >= 8 && g > 0 && g <= 4) || ["transparent", "rgba(0, 0, 0, 0)"].includes(S.backgroundColor) && S.backgroundImage === "none")
|
|
2996
2996
|
continue;
|
|
2997
2997
|
const o = document.createElement("span");
|
|
2998
2998
|
for (let e = 0; e < S.length; e++) {
|
|
@@ -3033,20 +3033,20 @@ function Gt(E) {
|
|
|
3033
3033
|
else if (k[0].startsWith("to "))
|
|
3034
3034
|
return null;
|
|
3035
3035
|
const z = M * Math.PI / 180, W = Math.abs(w.w * Math.sin(z)) + Math.abs(w.h * Math.cos(z)), j = k.map((b) => {
|
|
3036
|
-
const
|
|
3037
|
-
if (!
|
|
3036
|
+
const R = b.match(/^(rgba?\([^)]+\)|#[0-9a-f]{3,8}|transparent)(?:\s+(-?[\d.]+)(%|px))?$/i);
|
|
3037
|
+
if (!R)
|
|
3038
3038
|
return null;
|
|
3039
|
-
let r = e(
|
|
3040
|
-
if (
|
|
3039
|
+
let r = e(R[1]);
|
|
3040
|
+
if (R[1].toLowerCase() === "transparent")
|
|
3041
3041
|
r = { hex: "000000", alpha: 0 };
|
|
3042
|
-
else if (
|
|
3043
|
-
const N =
|
|
3042
|
+
else if (R[1][0] === "#") {
|
|
3043
|
+
const N = R[1].slice(1);
|
|
3044
3044
|
r = {
|
|
3045
3045
|
hex: (N.length <= 4 ? [...N.slice(0, 3)].map((Q) => Q + Q).join("") : N.slice(0, 6)).toUpperCase(),
|
|
3046
3046
|
alpha: N.length === 4 ? parseInt(N[3] + N[3], 16) / 255 : N.length === 8 ? parseInt(N.slice(-2), 16) / 255 : 1
|
|
3047
3047
|
};
|
|
3048
3048
|
}
|
|
3049
|
-
return r ? { ...r, position:
|
|
3049
|
+
return r ? { ...r, position: R[2] === void 0 ? null : Number(R[2]) * (R[3] === "%" ? 0.01 : 1 / W) } : null;
|
|
3050
3050
|
});
|
|
3051
3051
|
if (j.length < 2 || j.some((b) => !b))
|
|
3052
3052
|
return null;
|
|
@@ -3055,11 +3055,11 @@ function Gt(E) {
|
|
|
3055
3055
|
if (j[b].position !== null)
|
|
3056
3056
|
j[b].position = Math.max(j[b].position, j[b - 1].position);
|
|
3057
3057
|
else {
|
|
3058
|
-
let
|
|
3059
|
-
for (; j[
|
|
3060
|
-
|
|
3061
|
-
const r = (Math.max(j[
|
|
3062
|
-
for (let N = b; N <
|
|
3058
|
+
let R = b + 1;
|
|
3059
|
+
for (; j[R].position === null; )
|
|
3060
|
+
R++;
|
|
3061
|
+
const r = (Math.max(j[R].position, j[b - 1].position) - j[b - 1].position) / (R - b + 1);
|
|
3062
|
+
for (let N = b; N < R; N++)
|
|
3063
3063
|
j[N].position = j[b - 1].position + r * (N - b + 1);
|
|
3064
3064
|
}
|
|
3065
3065
|
return { angle: M, stops: j };
|
|
@@ -3113,9 +3113,9 @@ function Gt(E) {
|
|
|
3113
3113
|
q && (j[X] = Math.max(j[X], B[X]));
|
|
3114
3114
|
});
|
|
3115
3115
|
}
|
|
3116
|
-
const b = w.clipPath.match(/^polygon\((.*)\)$/),
|
|
3117
|
-
if (u.clientWidth === 0 && u.clientHeight === 0 &&
|
|
3118
|
-
const Y =
|
|
3116
|
+
const b = w.clipPath.match(/^polygon\((.*)\)$/), R = z.map((Y, L) => ({ ...Y, index: L })).filter((Y) => Y.width && Y.color);
|
|
3117
|
+
if (u.clientWidth === 0 && u.clientHeight === 0 && R.length === 1) {
|
|
3118
|
+
const Y = R[0], L = [
|
|
3119
3119
|
[[0, 0], [x.w, 0], [x.w / 2, x.h]],
|
|
3120
3120
|
[[x.w, 0], [x.w, x.h], [0, x.h / 2]],
|
|
3121
3121
|
[[x.w / 2, 0], [x.w, x.h], [0, x.h]],
|
|
@@ -3161,6 +3161,7 @@ function Gt(E) {
|
|
|
3161
3161
|
type: "border-strip",
|
|
3162
3162
|
...x,
|
|
3163
3163
|
side: L,
|
|
3164
|
+
rotate: O,
|
|
3164
3165
|
widths: z.map((K) => K.width),
|
|
3165
3166
|
color: Y.color,
|
|
3166
3167
|
radii: j
|
|
@@ -3175,9 +3176,9 @@ function Gt(E) {
|
|
|
3175
3176
|
const b = O.getBoundingClientRect();
|
|
3176
3177
|
if (b.width < 0.2 || b.height < 0.2)
|
|
3177
3178
|
continue;
|
|
3178
|
-
const
|
|
3179
|
+
const R = /\s/.test(x[j]) && !k.whiteSpace.startsWith("pre") ? " " : x[j];
|
|
3179
3180
|
let r = T[T.length - 1];
|
|
3180
|
-
|
|
3181
|
+
R === " " && (!r || !r.text) || ((!r || Math.abs(r.y - b.top) > 3) && (r = { text: "", x: b.left, y: b.top, right: b.right, h: b.height }, T.push(r)), (R !== " " || r.text && !r.text.endsWith(" ")) && (r.text += R), r.right = b.right, r.h = Math.max(r.h, b.height));
|
|
3181
3182
|
}
|
|
3182
3183
|
const M = k.fontFamily.split(",")[0].trim().replace(/^['"]|['"]$/g, ""), z = v(k), W = (() => {
|
|
3183
3184
|
for (let j = w; j && j !== P; j = j.parentElement) {
|
|
@@ -3212,16 +3213,15 @@ function Gt(E) {
|
|
|
3212
3213
|
const w = getComputedStyle(u);
|
|
3213
3214
|
if (w.display === "none" || w.visibility === "hidden" || o(w.opacity) === 0)
|
|
3214
3215
|
return;
|
|
3215
|
-
const k = c(u);
|
|
3216
|
-
if (k.w <= 0 || k.h <= 0)
|
|
3217
|
-
return;
|
|
3218
|
-
const x = u.tagName.toLowerCase();
|
|
3216
|
+
const k = c(u), x = u.tagName.toLowerCase();
|
|
3219
3217
|
if (x === "img" || x === "svg" || x === "canvas") {
|
|
3220
|
-
|
|
3221
|
-
|
|
3218
|
+
if (k.w > 0 && k.h > 0) {
|
|
3219
|
+
const O = ++l;
|
|
3220
|
+
u.setAttribute("data-html2pptx-capture", String(O)), g.push({ type: "capture-element", id: O, ...k });
|
|
3221
|
+
}
|
|
3222
3222
|
return;
|
|
3223
3223
|
}
|
|
3224
|
-
s(u, w, k);
|
|
3224
|
+
k.w > 0 && k.h > 0 && s(u, w, k);
|
|
3225
3225
|
for (const O of u.childNodes)
|
|
3226
3226
|
O.nodeType === Node.TEXT_NODE ? m(O, u) : O.nodeType === Node.ELEMENT_NODE && i(O);
|
|
3227
3227
|
}, f = getComputedStyle(P), h = a(f.backgroundColor) || a(getComputedStyle(document.body).backgroundColor);
|
|
@@ -3325,10 +3325,10 @@ function xe(E, P, n) {
|
|
|
3325
3325
|
i + k - k * w,
|
|
3326
3326
|
f
|
|
3327
3327
|
]
|
|
3328
|
-
].map(([z, W, j, b,
|
|
3328
|
+
].map(([z, W, j, b, R, r]) => {
|
|
3329
3329
|
const [N, Q] = u(z, W), $ = { x: N * P, y: Q * n };
|
|
3330
3330
|
if (j !== void 0) {
|
|
3331
|
-
const [Y, L] = u(j, b), [K, I] = u(
|
|
3331
|
+
const [Y, L] = u(j, b), [K, I] = u(R, r);
|
|
3332
3332
|
$.curve = { type: "cubic", x1: Y * P, y1: L * n, x2: K * P, y2: I * n };
|
|
3333
3333
|
}
|
|
3334
3334
|
return $;
|
|
@@ -3418,7 +3418,8 @@ function Ee(E, P, n, S, g, l) {
|
|
|
3418
3418
|
...o,
|
|
3419
3419
|
points: [...a, { close: !0 }],
|
|
3420
3420
|
fill: Dt(n.type === "polygon" ? n.fill : n.color),
|
|
3421
|
-
line: { color: "FFFFFF", transparency: 100 }
|
|
3421
|
+
line: { color: "FFFFFF", transparency: 100 },
|
|
3422
|
+
...n.rotate ? { rotate: n.rotate } : {}
|
|
3422
3423
|
});
|
|
3423
3424
|
return;
|
|
3424
3425
|
}
|
|
@@ -3447,9 +3448,14 @@ async function Ce(E, P) {
|
|
|
3447
3448
|
height: `${o.height}px`,
|
|
3448
3449
|
boxSizing: "border-box",
|
|
3449
3450
|
background: l.background,
|
|
3450
|
-
|
|
3451
|
+
borderTop: l.borderTop,
|
|
3452
|
+
borderRight: l.borderRight,
|
|
3453
|
+
borderBottom: l.borderBottom,
|
|
3454
|
+
borderLeft: l.borderLeft,
|
|
3451
3455
|
borderRadius: l.borderRadius,
|
|
3452
3456
|
clipPath: l.clipPath,
|
|
3457
|
+
mask: l.mask,
|
|
3458
|
+
webkitMask: l.webkitMask,
|
|
3453
3459
|
opacity: l.opacity
|
|
3454
3460
|
}), document.body.appendChild(e), document.documentElement.classList.add("__html2pptx_background_isolate");
|
|
3455
3461
|
});
|