useblocks 1.1.71 → 1.1.81
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/CHANGELOG.md +426 -0
- package/README.md +38 -0
- package/iframe/js/amp.Da_6yDxX.js +1 -0
- package/iframe/js/iframe-eblock.js +1 -1
- package/iframe/js/iframe.js +1 -1
- package/iframe/js/rules.4N5s3OV-.js +1 -1
- package/package.json +30 -9
- package/static/core/1ab52017.js +2134 -0
- package/static/core/4296ff4b.js +3280 -0
- package/static/core/{63206e112.js → 496a28e52.js} +2682 -2421
- package/static/core/{9ab1c444.js → 5cc21a00.js} +2302 -2432
- package/static/core/{b9b92e01.js → 6a3ea43c.js} +15 -15
- package/static/core/{e02024fb2.js → 6fc5508e2.js} +69 -69
- package/static/core/{ea6c5c93.js → 7cff1d56.js} +3327 -2997
- package/static/core/87de8255.js +1098 -0
- package/static/core/{3f22a9d32.js → 909c874d2.js} +1196 -1123
- package/static/core/{c3b45fb6.js → ace7c2d1.js} +7 -7
- package/static/core/{5e082e16.js → c287f8b6.js} +38 -38
- package/static/core/{585259872.js → cc4c61c42.js} +108 -108
- package/static/core/{222d29d9.js → d2293148.js} +272 -248
- package/static/core/{e4d01015.js → d70b5c31.js} +22367 -19437
- package/static/core/{68ec11c8.js → dfbad00e.js} +4 -4
- package/static/core/{ce9be2ec2.js → f2b0c97b2.js} +2138 -2086
- package/static/core/{d3bbb05e.js → f7e3905a.js} +3 -3
- package/static/core/{513594a8.js → fc514220.js} +34 -34
- package/static/umd-runtime/ui-kit.js +1171 -1103
- package/ui-kit/index.js +1541 -1469
- package/{useblocks-core.77131b3d.js → useblocks-core.0a682f7d.js} +6 -6
- package/useblocks-esm.js +4 -4
- package/{useblocks-po.77131b3d.js → useblocks-po.0a682f7d.js} +1 -1
- package/useblocks.d.ts +66 -0
- package/useblocks.js +3 -3
- package/favicon-b.ico +0 -0
- package/favicon.ico +0 -0
- package/fonts/SegoeUI-Bold.woff2 +0 -0
- package/fonts/SegoeUI-Semibold.woff2 +0 -0
- package/fonts/SegoeUI.woff2 +0 -0
- package/iframe/js/amp.DllX-Im0.js +0 -1
- package/js/amplitude.min.js +0 -10859
- package/js/sourcebuster.min.js +0 -672
- package/manifest.json +0 -17
- package/npm-publish.manifest.json +0 -51
- package/static/core/23546a64.js +0 -925
- package/static/core/35ad3ae5.js +0 -3150
- package/static/core/36bf6931.js +0 -2119
- package/static/media/image-editor/images/samples/large_sample.jpg +0 -0
- package/static/media/image-editor/images/samples/sample1.jpg +0 -0
- package/static/media/image-editor/images/samples/sample1_thumbnail.jpg +0 -0
- package/static/media/image-editor/images/samples/sample2.jpg +0 -0
- package/static/media/image-editor/images/samples/sample2_thumbnail.jpg +0 -0
- package/static/media/image-editor/images/samples/sample3.jpg +0 -0
- package/static/media/image-editor/images/samples/sample3_thumbnail.jpg +0 -0
- package/static/media/image-editor/images/samples/sample4.json +0 -871
- package/static/media/image-editor/images/samples/sample4_preview.jpg +0 -0
- package/test-font.otf +0 -0
- package/test-font.ttf +0 -0
- package/test-font.woff2 +0 -0
- package/tsconfig.json +0 -14
- package/two_step_headless_plugin.html +0 -558
- /package/iframe/{iframe-eblock.77131b3d.html → iframe-eblock.0a682f7d.html} +0 -0
- /package/iframe/{iframe.77131b3d.html → iframe.0a682f7d.html} +0 -0
package/static/core/35ad3ae5.js
DELETED
|
@@ -1,3150 +0,0 @@
|
|
|
1
|
-
__useblocks__.define("static/core/35ad3ae5.js", [
|
|
2
|
-
"require",
|
|
3
|
-
"exports",
|
|
4
|
-
"module",
|
|
5
|
-
"static/core/df237243.js",
|
|
6
|
-
"static/core/ea6c5c93.js",
|
|
7
|
-
"static/core/ce9be2ec2.js",
|
|
8
|
-
"static/core/3f22a9d32.js",
|
|
9
|
-
"static/core/63206e112.js",
|
|
10
|
-
"react"
|
|
11
|
-
], function(Qe, le, Fn) {
|
|
12
|
-
const Ve = Qe("./df237243.js"), Ie = Qe("./ea6c5c93.js"), ft = Qe("./ce9be2ec2.js"), kt = Qe("./3f22a9d32.js"), yt = Qe("./63206e112.js");
|
|
13
|
-
let Bt = Qe("react");
|
|
14
|
-
var Dt = Ve.__commonJSMin(((A, S) => {
|
|
15
|
-
S.exports = "SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED";
|
|
16
|
-
})), Ht = Ve.__commonJSMin(((A, S) => {
|
|
17
|
-
var j = Dt();
|
|
18
|
-
function G() {}
|
|
19
|
-
function $() {}
|
|
20
|
-
$.resetWarningCache = G, S.exports = function() {
|
|
21
|
-
function Q(Y, z, ue, ee, Me, ye) {
|
|
22
|
-
if (ye !== j) {
|
|
23
|
-
var Ee = new Error("Calling PropTypes validators directly is not supported by the `prop-types` package. Use PropTypes.checkPropTypes() to call them. Read more at http://fb.me/use-check-prop-types");
|
|
24
|
-
throw Ee.name = "Invariant Violation", Ee;
|
|
25
|
-
}
|
|
26
|
-
}
|
|
27
|
-
Q.isRequired = Q;
|
|
28
|
-
function V() {
|
|
29
|
-
return Q;
|
|
30
|
-
}
|
|
31
|
-
var K = {
|
|
32
|
-
array: Q,
|
|
33
|
-
bigint: Q,
|
|
34
|
-
bool: Q,
|
|
35
|
-
func: Q,
|
|
36
|
-
number: Q,
|
|
37
|
-
object: Q,
|
|
38
|
-
string: Q,
|
|
39
|
-
symbol: Q,
|
|
40
|
-
any: Q,
|
|
41
|
-
arrayOf: V,
|
|
42
|
-
element: Q,
|
|
43
|
-
elementType: Q,
|
|
44
|
-
instanceOf: V,
|
|
45
|
-
node: Q,
|
|
46
|
-
objectOf: V,
|
|
47
|
-
oneOf: V,
|
|
48
|
-
oneOfType: V,
|
|
49
|
-
shape: V,
|
|
50
|
-
exact: V,
|
|
51
|
-
checkPropTypes: $,
|
|
52
|
-
resetWarningCache: G
|
|
53
|
-
};
|
|
54
|
-
return K.PropTypes = K, K;
|
|
55
|
-
};
|
|
56
|
-
})), jt = Ve.__commonJSMin(((A, S) => {
|
|
57
|
-
S.exports = Ht()();
|
|
58
|
-
}));
|
|
59
|
-
function wt({ limitsInPlugin: A, hostedAiActive: S }) {
|
|
60
|
-
return A && !S;
|
|
61
|
-
}
|
|
62
|
-
function Wt({ limitsInPlugin: A, hostedAiActive: S, counter: j, limit: G }) {
|
|
63
|
-
return wt({
|
|
64
|
-
limitsInPlugin: A,
|
|
65
|
-
hostedAiActive: S
|
|
66
|
-
}) ? G > 0 && j >= G : !1;
|
|
67
|
-
}
|
|
68
|
-
function ct(A, S) {
|
|
69
|
-
if (A) {
|
|
70
|
-
if (S === "preview") {
|
|
71
|
-
const j = A;
|
|
72
|
-
return j.preview ?? j.test_sends;
|
|
73
|
-
}
|
|
74
|
-
return A[S];
|
|
75
|
-
}
|
|
76
|
-
}
|
|
77
|
-
function lt(A, S) {
|
|
78
|
-
if (A?.flags) {
|
|
79
|
-
if (S === "preview") {
|
|
80
|
-
const j = A.flags;
|
|
81
|
-
return j.preview ?? j.test_sends;
|
|
82
|
-
}
|
|
83
|
-
return A.flags[S];
|
|
84
|
-
}
|
|
85
|
-
}
|
|
86
|
-
var Nt = [
|
|
87
|
-
10,
|
|
88
|
-
30,
|
|
89
|
-
300
|
|
90
|
-
], At = [
|
|
91
|
-
10,
|
|
92
|
-
50,
|
|
93
|
-
150
|
|
94
|
-
];
|
|
95
|
-
function ut(A, S) {
|
|
96
|
-
for (const j of S) if (j > A) return j;
|
|
97
|
-
return "infinity";
|
|
98
|
-
}
|
|
99
|
-
function zt(A) {
|
|
100
|
-
return A <= 10 ? "email_10_30" : A <= 30 ? "email_30_300" : "email_300_inf";
|
|
101
|
-
}
|
|
102
|
-
function _t(A) {
|
|
103
|
-
return A <= 10 ? "ai_10_50" : A <= 50 ? "ai_30_150" : "ai_150_inf";
|
|
104
|
-
}
|
|
105
|
-
function ht(A, S) {
|
|
106
|
-
return S?.limit_exceeded ? !0 : A.is_unlimited || A.total_limit <= 0 ? !1 : A.remaining <= 0 || A.used >= A.total_limit;
|
|
107
|
-
}
|
|
108
|
-
var Qt = [
|
|
109
|
-
"optimization",
|
|
110
|
-
"image_generate",
|
|
111
|
-
"preview",
|
|
112
|
-
"link_check",
|
|
113
|
-
"image_check",
|
|
114
|
-
"spam_check"
|
|
115
|
-
];
|
|
116
|
-
function Gt(A) {
|
|
117
|
-
return Qt.includes(A);
|
|
118
|
-
}
|
|
119
|
-
var qt = {
|
|
120
|
-
optimization: "optimization_exceeded",
|
|
121
|
-
image_generate: "image_generate_exceeded",
|
|
122
|
-
preview: "preview_exceeded",
|
|
123
|
-
link_check: "link_check_exceeded",
|
|
124
|
-
image_check: "image_check_exceeded",
|
|
125
|
-
spam_check: "spam_check_exceeded"
|
|
126
|
-
};
|
|
127
|
-
function Ge(A, S, j) {
|
|
128
|
-
if (Gt(A)) return null;
|
|
129
|
-
const G = ct(S, A), $ = lt(j, A);
|
|
130
|
-
if (!G || !ht(G, $)) return null;
|
|
131
|
-
const Q = G.total_limit;
|
|
132
|
-
return {
|
|
133
|
-
kind: A,
|
|
134
|
-
presetId: qt[A],
|
|
135
|
-
previousLimit: Q,
|
|
136
|
-
nextLimit: "infinity"
|
|
137
|
-
};
|
|
138
|
-
}
|
|
139
|
-
function $t(A, S) {
|
|
140
|
-
if (!A) return null;
|
|
141
|
-
const j = ct(A, "ai"), G = lt(S, "ai");
|
|
142
|
-
if (j && ht(j, G)) {
|
|
143
|
-
const ee = j.total_limit;
|
|
144
|
-
return {
|
|
145
|
-
kind: "ai",
|
|
146
|
-
presetId: _t(ee),
|
|
147
|
-
previousLimit: ee,
|
|
148
|
-
nextLimit: ut(ee, At)
|
|
149
|
-
};
|
|
150
|
-
}
|
|
151
|
-
const $ = ct(A, "email_generate"), Q = lt(S, "email_generate");
|
|
152
|
-
if ($ && ht($, Q)) {
|
|
153
|
-
const ee = $.total_limit;
|
|
154
|
-
return {
|
|
155
|
-
kind: "email_generate",
|
|
156
|
-
presetId: zt(ee),
|
|
157
|
-
previousLimit: ee,
|
|
158
|
-
nextLimit: ut(ee, Nt)
|
|
159
|
-
};
|
|
160
|
-
}
|
|
161
|
-
const V = Ge("image_generate", A, S);
|
|
162
|
-
if (V) return V;
|
|
163
|
-
const K = Ge("optimization", A, S);
|
|
164
|
-
if (K) return K;
|
|
165
|
-
const Y = Ge("preview", A, S);
|
|
166
|
-
if (Y) return Y;
|
|
167
|
-
const z = Ge("link_check", A, S);
|
|
168
|
-
if (z) return z;
|
|
169
|
-
return Ge("image_check", A, S) || Ge("spam_check", A, S);
|
|
170
|
-
}
|
|
171
|
-
function Xt(A) {
|
|
172
|
-
return {
|
|
173
|
-
presetId: _t(A),
|
|
174
|
-
previousLimit: A,
|
|
175
|
-
nextLimit: ut(A, At)
|
|
176
|
-
};
|
|
177
|
-
}
|
|
178
|
-
function Kt(A) {
|
|
179
|
-
const S = String(A ?? "").split(";")[0].trim();
|
|
180
|
-
if (!S) return "";
|
|
181
|
-
const j = S.toLowerCase(), G = j.indexOf("/");
|
|
182
|
-
if (G === -1) return j;
|
|
183
|
-
const $ = j.slice(G + 1);
|
|
184
|
-
return $ === "svg+xml" ? "svg" : $;
|
|
185
|
-
}
|
|
186
|
-
async function Vt(A) {
|
|
187
|
-
if (typeof createImageBitmap == "function") try {
|
|
188
|
-
const S = await createImageBitmap(A);
|
|
189
|
-
try {
|
|
190
|
-
return {
|
|
191
|
-
width: S.width,
|
|
192
|
-
height: S.height
|
|
193
|
-
};
|
|
194
|
-
} finally {
|
|
195
|
-
S.close?.();
|
|
196
|
-
}
|
|
197
|
-
} catch {}
|
|
198
|
-
return new Promise((S, j) => {
|
|
199
|
-
const G = URL.createObjectURL(A), $ = new Image();
|
|
200
|
-
$.onload = () => {
|
|
201
|
-
URL.revokeObjectURL(G);
|
|
202
|
-
const Q = $.naturalWidth || $.width, V = $.naturalHeight || $.height;
|
|
203
|
-
Q > 0 && V > 0 ? S({
|
|
204
|
-
width: Q,
|
|
205
|
-
height: V
|
|
206
|
-
}) : j(new Error("Could not read image dimensions"));
|
|
207
|
-
}, $.onerror = () => {
|
|
208
|
-
URL.revokeObjectURL(G), j(new Error("Could not decode image"));
|
|
209
|
-
}, $.src = G;
|
|
210
|
-
});
|
|
211
|
-
}
|
|
212
|
-
function dt(A) {
|
|
213
|
-
return A.trim();
|
|
214
|
-
}
|
|
215
|
-
function Zt() {
|
|
216
|
-
const A = new Map(), S = new Map();
|
|
217
|
-
function j(V, K) {
|
|
218
|
-
return K ? new Promise((Y, z) => {
|
|
219
|
-
if (K.aborted) {
|
|
220
|
-
z(new DOMException("Aborted", "AbortError"));
|
|
221
|
-
return;
|
|
222
|
-
}
|
|
223
|
-
const ue = () => {
|
|
224
|
-
z(new DOMException("Aborted", "AbortError"));
|
|
225
|
-
};
|
|
226
|
-
K.addEventListener("abort", ue, { once: !0 }), V.then((ee) => {
|
|
227
|
-
K.removeEventListener("abort", ue), Y(ee);
|
|
228
|
-
}, (ee) => {
|
|
229
|
-
K.removeEventListener("abort", ue), z(ee);
|
|
230
|
-
});
|
|
231
|
-
}) : V;
|
|
232
|
-
}
|
|
233
|
-
async function G(V, K, Y) {
|
|
234
|
-
const z = dt(V);
|
|
235
|
-
if (!z) throw new Error("Empty image URL");
|
|
236
|
-
const ue = A.get(z);
|
|
237
|
-
if (ue) {
|
|
238
|
-
if (K?.aborted) throw new DOMException("Aborted", "AbortError");
|
|
239
|
-
return ue;
|
|
240
|
-
}
|
|
241
|
-
const ee = S.get(z);
|
|
242
|
-
if (ee) return j(ee.promise, K);
|
|
243
|
-
const Me = new AbortController(), ye = Y(z, Me.signal).then((Ee) => (S.delete(z), A.set(z, Ee), Ee)).catch((Ee) => {
|
|
244
|
-
throw S.delete(z), Ee;
|
|
245
|
-
});
|
|
246
|
-
return S.set(z, {
|
|
247
|
-
promise: ye,
|
|
248
|
-
controller: Me
|
|
249
|
-
}), j(ye, K);
|
|
250
|
-
}
|
|
251
|
-
function $(V) {
|
|
252
|
-
const K = dt(V);
|
|
253
|
-
if (!K) return;
|
|
254
|
-
const Y = S.get(K);
|
|
255
|
-
Y && (Y.controller.abort(), S.delete(K)), A.delete(K);
|
|
256
|
-
}
|
|
257
|
-
function Q() {
|
|
258
|
-
for (const [, V] of S) V.controller.abort();
|
|
259
|
-
S.clear(), A.clear();
|
|
260
|
-
}
|
|
261
|
-
return {
|
|
262
|
-
resolve: G,
|
|
263
|
-
abandonKey: $,
|
|
264
|
-
invalidateAll: Q
|
|
265
|
-
};
|
|
266
|
-
}
|
|
267
|
-
var Yt = Ve.__commonJSMin(((A, S) => {
|
|
268
|
-
(function(j, G) {
|
|
269
|
-
typeof A == "object" && typeof S < "u" ? S.exports = G() : typeof define == "function" && define.amd ? define(G) : (j = typeof globalThis < "u" ? globalThis : j || self).imageCompression = G();
|
|
270
|
-
})(A, (function() {
|
|
271
|
-
"use strict";
|
|
272
|
-
function j(T, P) {
|
|
273
|
-
return P.forEach((function(H) {
|
|
274
|
-
H && typeof H != "string" && !Array.isArray(H) && Object.keys(H).forEach((function(h) {
|
|
275
|
-
if (h !== "default" && !(h in T)) {
|
|
276
|
-
var e = Object.getOwnPropertyDescriptor(H, h);
|
|
277
|
-
Object.defineProperty(T, h, e.get ? e : {
|
|
278
|
-
enumerable: !0,
|
|
279
|
-
get: function() {
|
|
280
|
-
return H[h];
|
|
281
|
-
}
|
|
282
|
-
});
|
|
283
|
-
}
|
|
284
|
-
}));
|
|
285
|
-
})), Object.freeze(T);
|
|
286
|
-
}
|
|
287
|
-
function G(T, P) {
|
|
288
|
-
return new Promise((function(H, h) {
|
|
289
|
-
let e;
|
|
290
|
-
return $(T).then((function(t) {
|
|
291
|
-
try {
|
|
292
|
-
return e = t, H(new Blob([
|
|
293
|
-
P.slice(0, 2),
|
|
294
|
-
e,
|
|
295
|
-
P.slice(2)
|
|
296
|
-
], { type: "image/jpeg" }));
|
|
297
|
-
} catch (u) {
|
|
298
|
-
return h(u);
|
|
299
|
-
}
|
|
300
|
-
}), h);
|
|
301
|
-
}));
|
|
302
|
-
}
|
|
303
|
-
const $ = (T) => new Promise(((P, H) => {
|
|
304
|
-
const h = new FileReader();
|
|
305
|
-
h.addEventListener("load", (({ target: { result: e } }) => {
|
|
306
|
-
const t = new DataView(e);
|
|
307
|
-
let u = 0;
|
|
308
|
-
if (t.getUint16(u) !== 65496) return H("not a valid JPEG");
|
|
309
|
-
for (u += 2;;) {
|
|
310
|
-
const a = t.getUint16(u);
|
|
311
|
-
if (a === 65498) break;
|
|
312
|
-
const p = t.getUint16(u + 2);
|
|
313
|
-
if (a === 65505 && t.getUint32(u + 4) === 1165519206) {
|
|
314
|
-
const _ = u + 10;
|
|
315
|
-
let r;
|
|
316
|
-
switch (t.getUint16(_)) {
|
|
317
|
-
case 18761:
|
|
318
|
-
r = !0;
|
|
319
|
-
break;
|
|
320
|
-
case 19789:
|
|
321
|
-
r = !1;
|
|
322
|
-
break;
|
|
323
|
-
default: return H("TIFF header contains invalid endian");
|
|
324
|
-
}
|
|
325
|
-
if (t.getUint16(_ + 2, r) !== 42) return H("TIFF header contains invalid version");
|
|
326
|
-
const i = t.getUint32(_ + 4, r), n = _ + i + 2 + 12 * t.getUint16(_ + i, r);
|
|
327
|
-
for (let s = _ + i + 2; s < n; s += 12) if (t.getUint16(s, r) == 274) {
|
|
328
|
-
if (t.getUint16(s + 2, r) !== 3) return H("Orientation data type is invalid");
|
|
329
|
-
if (t.getUint32(s + 4, r) !== 1) return H("Orientation data count is invalid");
|
|
330
|
-
t.setUint16(s + 8, 1, r);
|
|
331
|
-
break;
|
|
332
|
-
}
|
|
333
|
-
return P(e.slice(u, u + 2 + p));
|
|
334
|
-
}
|
|
335
|
-
u += 2 + p;
|
|
336
|
-
}
|
|
337
|
-
return P(new Blob());
|
|
338
|
-
})), h.readAsArrayBuffer(T);
|
|
339
|
-
}));
|
|
340
|
-
var Q = {};
|
|
341
|
-
(function(T) {
|
|
342
|
-
var P, H, h = {};
|
|
343
|
-
T.exports = h, h.parse = function(e, t) {
|
|
344
|
-
for (var u = h.bin.readUshort, a = h.bin.readUint, p = 0, _ = {}, r = new Uint8Array(e), i = r.length - 4; a(r, i) != 101010256;) i--;
|
|
345
|
-
p = i, p += 4;
|
|
346
|
-
var n = u(r, p += 4);
|
|
347
|
-
u(r, p += 2);
|
|
348
|
-
var s = a(r, p += 2), d = a(r, p += 4);
|
|
349
|
-
p += 4, p = d;
|
|
350
|
-
for (var E = 0; E < n; E++) {
|
|
351
|
-
a(r, p), p += 4, p += 4, p += 4, a(r, p += 4), s = a(r, p += 4);
|
|
352
|
-
var x = a(r, p += 4), b = u(r, p += 4), D = u(r, p + 2), O = u(r, p + 4);
|
|
353
|
-
p += 6;
|
|
354
|
-
var M = a(r, p += 8);
|
|
355
|
-
p += 4, p += b + D + O, h._readLocal(r, M, _, s, x, t);
|
|
356
|
-
}
|
|
357
|
-
return _;
|
|
358
|
-
}, h._readLocal = function(e, t, u, a, p, _) {
|
|
359
|
-
var r = h.bin.readUshort, i = h.bin.readUint;
|
|
360
|
-
i(e, t), r(e, t += 4), r(e, t += 2);
|
|
361
|
-
var n = r(e, t += 2);
|
|
362
|
-
i(e, t += 2), i(e, t += 4), t += 4;
|
|
363
|
-
var s = r(e, t += 8), d = r(e, t += 2);
|
|
364
|
-
t += 2;
|
|
365
|
-
var E = h.bin.readUTF8(e, t, s);
|
|
366
|
-
if (t += s, t += d, _) u[E] = {
|
|
367
|
-
size: p,
|
|
368
|
-
csize: a
|
|
369
|
-
};
|
|
370
|
-
else {
|
|
371
|
-
var x = new Uint8Array(e.buffer, t);
|
|
372
|
-
if (n == 0) u[E] = new Uint8Array(x.buffer.slice(t, t + a));
|
|
373
|
-
else {
|
|
374
|
-
if (n != 8) throw "unknown compression method: " + n;
|
|
375
|
-
var b = new Uint8Array(p);
|
|
376
|
-
h.inflateRaw(x, b), u[E] = b;
|
|
377
|
-
}
|
|
378
|
-
}
|
|
379
|
-
}, h.inflateRaw = function(e, t) {
|
|
380
|
-
return h.F.inflate(e, t);
|
|
381
|
-
}, h.inflate = function(e, t) {
|
|
382
|
-
return e[0], e[1], h.inflateRaw(new Uint8Array(e.buffer, e.byteOffset + 2, e.length - 6), t);
|
|
383
|
-
}, h.deflate = function(e, t) {
|
|
384
|
-
t ??= { level: 6 };
|
|
385
|
-
var u = 0, a = new Uint8Array(50 + Math.floor(1.1 * e.length));
|
|
386
|
-
a[u] = 120, a[u + 1] = 156, u += 2, u = h.F.deflateRaw(e, a, u, t.level);
|
|
387
|
-
var p = h.adler(e, 0, e.length);
|
|
388
|
-
return a[u + 0] = p >>> 24 & 255, a[u + 1] = p >>> 16 & 255, a[u + 2] = p >>> 8 & 255, a[u + 3] = p >>> 0 & 255, new Uint8Array(a.buffer, 0, u + 4);
|
|
389
|
-
}, h.deflateRaw = function(e, t) {
|
|
390
|
-
t ??= { level: 6 };
|
|
391
|
-
var u = new Uint8Array(50 + Math.floor(1.1 * e.length)), a = h.F.deflateRaw(e, u, a, t.level);
|
|
392
|
-
return new Uint8Array(u.buffer, 0, a);
|
|
393
|
-
}, h.encode = function(e, t) {
|
|
394
|
-
t ??= !1;
|
|
395
|
-
var u = 0, a = h.bin.writeUint, p = h.bin.writeUshort, _ = {};
|
|
396
|
-
for (var r in e) {
|
|
397
|
-
var i = !h._noNeed(r) && !t, n = e[r], s = h.crc.crc(n, 0, n.length);
|
|
398
|
-
_[r] = {
|
|
399
|
-
cpr: i,
|
|
400
|
-
usize: n.length,
|
|
401
|
-
crc: s,
|
|
402
|
-
file: i ? h.deflateRaw(n) : n
|
|
403
|
-
};
|
|
404
|
-
}
|
|
405
|
-
for (var r in _) u += _[r].file.length + 30 + 46 + 2 * h.bin.sizeUTF8(r);
|
|
406
|
-
u += 22;
|
|
407
|
-
var d = new Uint8Array(u), E = 0, x = [];
|
|
408
|
-
for (var r in _) {
|
|
409
|
-
var b = _[r];
|
|
410
|
-
x.push(E), E = h._writeHeader(d, E, r, b, 0);
|
|
411
|
-
}
|
|
412
|
-
var D = 0, O = E;
|
|
413
|
-
for (var r in _) b = _[r], x.push(E), E = h._writeHeader(d, E, r, b, 1, x[D++]);
|
|
414
|
-
var M = E - O;
|
|
415
|
-
return a(d, E, 101010256), E += 4, p(d, E += 4, D), p(d, E += 2, D), a(d, E += 2, M), a(d, E += 4, O), E += 4, E += 2, d.buffer;
|
|
416
|
-
}, h._noNeed = function(e) {
|
|
417
|
-
var t = e.split(".").pop().toLowerCase();
|
|
418
|
-
return "png,jpg,jpeg,zip".indexOf(t) != -1;
|
|
419
|
-
}, h._writeHeader = function(e, t, u, a, p, _) {
|
|
420
|
-
var r = h.bin.writeUint, i = h.bin.writeUshort, n = a.file;
|
|
421
|
-
return r(e, t, p == 0 ? 67324752 : 33639248), t += 4, p == 1 && (t += 2), i(e, t, 20), i(e, t += 2, 0), i(e, t += 2, a.cpr ? 8 : 0), r(e, t += 2, 0), r(e, t += 4, a.crc), r(e, t += 4, n.length), r(e, t += 4, a.usize), i(e, t += 4, h.bin.sizeUTF8(u)), i(e, t += 2, 0), t += 2, p == 1 && (t += 2, t += 2, r(e, t += 6, _), t += 4), t += h.bin.writeUTF8(e, t, u), p == 0 && (e.set(n, t), t += n.length), t;
|
|
422
|
-
}, h.crc = {
|
|
423
|
-
table: (function() {
|
|
424
|
-
for (var e = new Uint32Array(256), t = 0; t < 256; t++) {
|
|
425
|
-
for (var u = t, a = 0; a < 8; a++) 1 & u ? u = 3988292384 ^ u >>> 1 : u >>>= 1;
|
|
426
|
-
e[t] = u;
|
|
427
|
-
}
|
|
428
|
-
return e;
|
|
429
|
-
})(),
|
|
430
|
-
update: function(e, t, u, a) {
|
|
431
|
-
for (var p = 0; p < a; p++) e = h.crc.table[255 & (e ^ t[u + p])] ^ e >>> 8;
|
|
432
|
-
return e;
|
|
433
|
-
},
|
|
434
|
-
crc: function(e, t, u) {
|
|
435
|
-
return 4294967295 ^ h.crc.update(4294967295, e, t, u);
|
|
436
|
-
}
|
|
437
|
-
}, h.adler = function(e, t, u) {
|
|
438
|
-
for (var a = 1, p = 0, _ = t, r = t + u; _ < r;) {
|
|
439
|
-
for (var i = Math.min(_ + 5552, r); _ < i;) p += a += e[_++];
|
|
440
|
-
a %= 65521, p %= 65521;
|
|
441
|
-
}
|
|
442
|
-
return p << 16 | a;
|
|
443
|
-
}, h.bin = {
|
|
444
|
-
readUshort: function(e, t) {
|
|
445
|
-
return e[t] | e[t + 1] << 8;
|
|
446
|
-
},
|
|
447
|
-
writeUshort: function(e, t, u) {
|
|
448
|
-
e[t] = 255 & u, e[t + 1] = u >> 8 & 255;
|
|
449
|
-
},
|
|
450
|
-
readUint: function(e, t) {
|
|
451
|
-
return 16777216 * e[t + 3] + (e[t + 2] << 16 | e[t + 1] << 8 | e[t]);
|
|
452
|
-
},
|
|
453
|
-
writeUint: function(e, t, u) {
|
|
454
|
-
e[t] = 255 & u, e[t + 1] = u >> 8 & 255, e[t + 2] = u >> 16 & 255, e[t + 3] = u >> 24 & 255;
|
|
455
|
-
},
|
|
456
|
-
readASCII: function(e, t, u) {
|
|
457
|
-
for (var a = "", p = 0; p < u; p++) a += String.fromCharCode(e[t + p]);
|
|
458
|
-
return a;
|
|
459
|
-
},
|
|
460
|
-
writeASCII: function(e, t, u) {
|
|
461
|
-
for (var a = 0; a < u.length; a++) e[t + a] = u.charCodeAt(a);
|
|
462
|
-
},
|
|
463
|
-
pad: function(e) {
|
|
464
|
-
return e.length < 2 ? "0" + e : e;
|
|
465
|
-
},
|
|
466
|
-
readUTF8: function(e, t, u) {
|
|
467
|
-
for (var a, p = "", _ = 0; _ < u; _++) p += "%" + h.bin.pad(e[t + _].toString(16));
|
|
468
|
-
try {
|
|
469
|
-
a = decodeURIComponent(p);
|
|
470
|
-
} catch {
|
|
471
|
-
return h.bin.readASCII(e, t, u);
|
|
472
|
-
}
|
|
473
|
-
return a;
|
|
474
|
-
},
|
|
475
|
-
writeUTF8: function(e, t, u) {
|
|
476
|
-
for (var a = u.length, p = 0, _ = 0; _ < a; _++) {
|
|
477
|
-
var r = u.charCodeAt(_);
|
|
478
|
-
if ((4294967168 & r) == 0) e[t + p] = r, p++;
|
|
479
|
-
else if ((4294965248 & r) == 0) e[t + p] = 192 | r >> 6, e[t + p + 1] = 128 | r >> 0 & 63, p += 2;
|
|
480
|
-
else if ((4294901760 & r) == 0) e[t + p] = 224 | r >> 12, e[t + p + 1] = 128 | r >> 6 & 63, e[t + p + 2] = 128 | r >> 0 & 63, p += 3;
|
|
481
|
-
else {
|
|
482
|
-
if ((4292870144 & r) != 0) throw "e";
|
|
483
|
-
e[t + p] = 240 | r >> 18, e[t + p + 1] = 128 | r >> 12 & 63, e[t + p + 2] = 128 | r >> 6 & 63, e[t + p + 3] = 128 | r >> 0 & 63, p += 4;
|
|
484
|
-
}
|
|
485
|
-
}
|
|
486
|
-
return p;
|
|
487
|
-
},
|
|
488
|
-
sizeUTF8: function(e) {
|
|
489
|
-
for (var t = e.length, u = 0, a = 0; a < t; a++) {
|
|
490
|
-
var p = e.charCodeAt(a);
|
|
491
|
-
if ((4294967168 & p) == 0) u++;
|
|
492
|
-
else if ((4294965248 & p) == 0) u += 2;
|
|
493
|
-
else if ((4294901760 & p) == 0) u += 3;
|
|
494
|
-
else {
|
|
495
|
-
if ((4292870144 & p) != 0) throw "e";
|
|
496
|
-
u += 4;
|
|
497
|
-
}
|
|
498
|
-
}
|
|
499
|
-
return u;
|
|
500
|
-
}
|
|
501
|
-
}, h.F = {}, h.F.deflateRaw = function(e, t, u, a) {
|
|
502
|
-
var p = [
|
|
503
|
-
[
|
|
504
|
-
0,
|
|
505
|
-
0,
|
|
506
|
-
0,
|
|
507
|
-
0,
|
|
508
|
-
0
|
|
509
|
-
],
|
|
510
|
-
[
|
|
511
|
-
4,
|
|
512
|
-
4,
|
|
513
|
-
8,
|
|
514
|
-
4,
|
|
515
|
-
0
|
|
516
|
-
],
|
|
517
|
-
[
|
|
518
|
-
4,
|
|
519
|
-
5,
|
|
520
|
-
16,
|
|
521
|
-
8,
|
|
522
|
-
0
|
|
523
|
-
],
|
|
524
|
-
[
|
|
525
|
-
4,
|
|
526
|
-
6,
|
|
527
|
-
16,
|
|
528
|
-
16,
|
|
529
|
-
0
|
|
530
|
-
],
|
|
531
|
-
[
|
|
532
|
-
4,
|
|
533
|
-
10,
|
|
534
|
-
16,
|
|
535
|
-
32,
|
|
536
|
-
0
|
|
537
|
-
],
|
|
538
|
-
[
|
|
539
|
-
8,
|
|
540
|
-
16,
|
|
541
|
-
32,
|
|
542
|
-
32,
|
|
543
|
-
0
|
|
544
|
-
],
|
|
545
|
-
[
|
|
546
|
-
8,
|
|
547
|
-
16,
|
|
548
|
-
128,
|
|
549
|
-
128,
|
|
550
|
-
0
|
|
551
|
-
],
|
|
552
|
-
[
|
|
553
|
-
8,
|
|
554
|
-
32,
|
|
555
|
-
128,
|
|
556
|
-
256,
|
|
557
|
-
0
|
|
558
|
-
],
|
|
559
|
-
[
|
|
560
|
-
32,
|
|
561
|
-
128,
|
|
562
|
-
258,
|
|
563
|
-
1024,
|
|
564
|
-
1
|
|
565
|
-
],
|
|
566
|
-
[
|
|
567
|
-
32,
|
|
568
|
-
258,
|
|
569
|
-
258,
|
|
570
|
-
4096,
|
|
571
|
-
1
|
|
572
|
-
]
|
|
573
|
-
][a], _ = h.F.U, r = h.F._goodIndex;
|
|
574
|
-
h.F._hash;
|
|
575
|
-
var i = h.F._putsE, n = 0, s = u << 3, d = 0, E = e.length;
|
|
576
|
-
if (a == 0) {
|
|
577
|
-
for (; n < E;) i(t, s, n + (w = Math.min(65535, E - n)) == E ? 1 : 0), s = h.F._copyExact(e, n, w, t, s + 8), n += w;
|
|
578
|
-
return s >>> 3;
|
|
579
|
-
}
|
|
580
|
-
var x = _.lits, b = _.strt, D = _.prev, O = 0, M = 0, B = 0, g = 0, R = 0, c = 0;
|
|
581
|
-
for (E > 2 && (b[c = h.F._hash(e, 0)] = 0), n = 0; n < E; n++) {
|
|
582
|
-
if (R = c, n + 1 < E - 2) {
|
|
583
|
-
c = h.F._hash(e, n + 1);
|
|
584
|
-
var f = n + 1 & 32767;
|
|
585
|
-
D[f] = b[c], b[c] = f;
|
|
586
|
-
}
|
|
587
|
-
if (d <= n) {
|
|
588
|
-
(O > 14e3 || M > 26697) && E - n > 100 && (d < n && (x[O] = n - d, O += 2, d = n), s = h.F._writeBlock(n == E - 1 || d == E ? 1 : 0, x, O, g, e, B, n - B, t, s), O = M = g = 0, B = n);
|
|
589
|
-
var v = 0;
|
|
590
|
-
n < E - 2 && (v = h.F._bestMatch(e, n, D, R, Math.min(p[2], E - n), p[3]));
|
|
591
|
-
var w = v >>> 16, y = 65535 & v;
|
|
592
|
-
if (v != 0) {
|
|
593
|
-
y = 65535 & v;
|
|
594
|
-
var U = r(w = v >>> 16, _.of0);
|
|
595
|
-
_.lhst[257 + U]++;
|
|
596
|
-
var m = r(y, _.df0);
|
|
597
|
-
_.dhst[m]++, g += _.exb[U] + _.dxb[m], x[O] = w << 23 | n - d, x[O + 1] = y << 16 | U << 8 | m, O += 2, d = n + w;
|
|
598
|
-
} else _.lhst[e[n]]++;
|
|
599
|
-
M++;
|
|
600
|
-
}
|
|
601
|
-
}
|
|
602
|
-
for (B == n && e.length != 0 || (d < n && (x[O] = n - d, O += 2, d = n), s = h.F._writeBlock(1, x, O, g, e, B, n - B, t, s), O = 0, M = 0, O = M = g = 0, B = n); (7 & s) != 0;) s++;
|
|
603
|
-
return s >>> 3;
|
|
604
|
-
}, h.F._bestMatch = function(e, t, u, a, p, _) {
|
|
605
|
-
var r = 32767 & t, i = u[r], n = r - i + 32768 & 32767;
|
|
606
|
-
if (i == r || a != h.F._hash(e, t - n)) return 0;
|
|
607
|
-
for (var s = 0, d = 0, E = Math.min(32767, t); n <= E && --_ != 0 && i != r;) {
|
|
608
|
-
if (s == 0 || e[t + s] == e[t + s - n]) {
|
|
609
|
-
var x = h.F._howLong(e, t, n);
|
|
610
|
-
if (x > s) {
|
|
611
|
-
if (d = n, (s = x) >= p) break;
|
|
612
|
-
n + 2 < x && (x = n + 2);
|
|
613
|
-
for (var b = 0, D = 0; D < x - 2; D++) {
|
|
614
|
-
var O = t - n + D + 32768 & 32767, M = O - u[O] + 32768 & 32767;
|
|
615
|
-
M > b && (b = M, i = O);
|
|
616
|
-
}
|
|
617
|
-
}
|
|
618
|
-
}
|
|
619
|
-
n += (r = i) - (i = u[r]) + 32768 & 32767;
|
|
620
|
-
}
|
|
621
|
-
return s << 16 | d;
|
|
622
|
-
}, h.F._howLong = function(e, t, u) {
|
|
623
|
-
if (e[t] != e[t - u] || e[t + 1] != e[t + 1 - u] || e[t + 2] != e[t + 2 - u]) return 0;
|
|
624
|
-
var a = t, p = Math.min(e.length, t + 258);
|
|
625
|
-
for (t += 3; t < p && e[t] == e[t - u];) t++;
|
|
626
|
-
return t - a;
|
|
627
|
-
}, h.F._hash = function(e, t) {
|
|
628
|
-
return (e[t] << 8 | e[t + 1]) + (e[t + 2] << 4) & 65535;
|
|
629
|
-
}, h.saved = 0, h.F._writeBlock = function(e, t, u, a, p, _, r, i, n) {
|
|
630
|
-
var s, d, E, x, b, D, O, M, B, g = h.F.U, R = h.F._putsF, c = h.F._putsE;
|
|
631
|
-
g.lhst[256]++, d = (s = h.F.getTrees())[0], E = s[1], x = s[2], b = s[3], D = s[4], O = s[5], M = s[6], B = s[7];
|
|
632
|
-
var f = 32 + ((n + 3 & 7) == 0 ? 0 : 8 - (n + 3 & 7)) + (r << 3), v = a + h.F.contSize(g.fltree, g.lhst) + h.F.contSize(g.fdtree, g.dhst), w = a + h.F.contSize(g.ltree, g.lhst) + h.F.contSize(g.dtree, g.dhst);
|
|
633
|
-
w += 14 + 3 * O + h.F.contSize(g.itree, g.ihst) + (2 * g.ihst[16] + 3 * g.ihst[17] + 7 * g.ihst[18]);
|
|
634
|
-
for (var y = 0; y < 286; y++) g.lhst[y] = 0;
|
|
635
|
-
for (y = 0; y < 30; y++) g.dhst[y] = 0;
|
|
636
|
-
for (y = 0; y < 19; y++) g.ihst[y] = 0;
|
|
637
|
-
var U = f < v && f < w ? 0 : v < w ? 1 : 2;
|
|
638
|
-
if (R(i, n, e), R(i, n + 1, U), n += 3, U == 0) {
|
|
639
|
-
for (; (7 & n) != 0;) n++;
|
|
640
|
-
n = h.F._copyExact(p, _, r, i, n);
|
|
641
|
-
} else {
|
|
642
|
-
var m, I;
|
|
643
|
-
if (U == 1 && (m = g.fltree, I = g.fdtree), U == 2) {
|
|
644
|
-
h.F.makeCodes(g.ltree, d), h.F.revCodes(g.ltree, d), h.F.makeCodes(g.dtree, E), h.F.revCodes(g.dtree, E), h.F.makeCodes(g.itree, x), h.F.revCodes(g.itree, x), m = g.ltree, I = g.dtree, c(i, n, b - 257), c(i, n += 5, D - 1), c(i, n += 5, O - 4), n += 4;
|
|
645
|
-
for (var l = 0; l < O; l++) c(i, n + 3 * l, g.itree[1 + (g.ordr[l] << 1)]);
|
|
646
|
-
n += 3 * O, n = h.F._codeTiny(M, g.itree, i, n), n = h.F._codeTiny(B, g.itree, i, n);
|
|
647
|
-
}
|
|
648
|
-
for (var o = _, L = 0; L < u; L += 2) {
|
|
649
|
-
for (var F = t[L], k = F >>> 23, X = o + (8388607 & F); o < X;) n = h.F._writeLit(p[o++], m, i, n);
|
|
650
|
-
if (k != 0) {
|
|
651
|
-
var N = t[L + 1], q = N >> 16, W = N >> 8 & 255, C = 255 & N;
|
|
652
|
-
c(i, n = h.F._writeLit(257 + W, m, i, n), k - g.of0[W]), n += g.exb[W], R(i, n = h.F._writeLit(C, I, i, n), q - g.df0[C]), n += g.dxb[C], o += k;
|
|
653
|
-
}
|
|
654
|
-
}
|
|
655
|
-
n = h.F._writeLit(256, m, i, n);
|
|
656
|
-
}
|
|
657
|
-
return n;
|
|
658
|
-
}, h.F._copyExact = function(e, t, u, a, p) {
|
|
659
|
-
var _ = p >>> 3;
|
|
660
|
-
return a[_] = u, a[_ + 1] = u >>> 8, a[_ + 2] = 255 - a[_], a[_ + 3] = 255 - a[_ + 1], _ += 4, a.set(new Uint8Array(e.buffer, t, u), _), p + (u + 4 << 3);
|
|
661
|
-
}, h.F.getTrees = function() {
|
|
662
|
-
for (var e = h.F.U, t = h.F._hufTree(e.lhst, e.ltree, 15), u = h.F._hufTree(e.dhst, e.dtree, 15), a = [], p = h.F._lenCodes(e.ltree, a), _ = [], r = h.F._lenCodes(e.dtree, _), i = 0; i < a.length; i += 2) e.ihst[a[i]]++;
|
|
663
|
-
for (i = 0; i < _.length; i += 2) e.ihst[_[i]]++;
|
|
664
|
-
for (var n = h.F._hufTree(e.ihst, e.itree, 7), s = 19; s > 4 && e.itree[1 + (e.ordr[s - 1] << 1)] == 0;) s--;
|
|
665
|
-
return [
|
|
666
|
-
t,
|
|
667
|
-
u,
|
|
668
|
-
n,
|
|
669
|
-
p,
|
|
670
|
-
r,
|
|
671
|
-
s,
|
|
672
|
-
a,
|
|
673
|
-
_
|
|
674
|
-
];
|
|
675
|
-
}, h.F.getSecond = function(e) {
|
|
676
|
-
for (var t = [], u = 0; u < e.length; u += 2) t.push(e[u + 1]);
|
|
677
|
-
return t;
|
|
678
|
-
}, h.F.nonZero = function(e) {
|
|
679
|
-
for (var t = "", u = 0; u < e.length; u += 2) e[u + 1] != 0 && (t += (u >> 1) + ",");
|
|
680
|
-
return t;
|
|
681
|
-
}, h.F.contSize = function(e, t) {
|
|
682
|
-
for (var u = 0, a = 0; a < t.length; a++) u += t[a] * e[1 + (a << 1)];
|
|
683
|
-
return u;
|
|
684
|
-
}, h.F._codeTiny = function(e, t, u, a) {
|
|
685
|
-
for (var p = 0; p < e.length; p += 2) {
|
|
686
|
-
var _ = e[p], r = e[p + 1];
|
|
687
|
-
a = h.F._writeLit(_, t, u, a);
|
|
688
|
-
var i = _ == 16 ? 2 : _ == 17 ? 3 : 7;
|
|
689
|
-
_ > 15 && (h.F._putsE(u, a, r, i), a += i);
|
|
690
|
-
}
|
|
691
|
-
return a;
|
|
692
|
-
}, h.F._lenCodes = function(e, t) {
|
|
693
|
-
for (var u = e.length; u != 2 && e[u - 1] == 0;) u -= 2;
|
|
694
|
-
for (var a = 0; a < u; a += 2) {
|
|
695
|
-
var p = e[a + 1], _ = a + 3 < u ? e[a + 3] : -1, r = a + 5 < u ? e[a + 5] : -1, i = a == 0 ? -1 : e[a - 1];
|
|
696
|
-
if (p == 0 && _ == p && r == p) {
|
|
697
|
-
for (var n = a + 5; n + 2 < u && e[n + 2] == p;) n += 2;
|
|
698
|
-
(s = Math.min(n + 1 - a >>> 1, 138)) < 11 ? t.push(17, s - 3) : t.push(18, s - 11), a += 2 * s - 2;
|
|
699
|
-
} else if (p == i && _ == p && r == p) {
|
|
700
|
-
for (n = a + 5; n + 2 < u && e[n + 2] == p;) n += 2;
|
|
701
|
-
var s = Math.min(n + 1 - a >>> 1, 6);
|
|
702
|
-
t.push(16, s - 3), a += 2 * s - 2;
|
|
703
|
-
} else t.push(p, 0);
|
|
704
|
-
}
|
|
705
|
-
return u >>> 1;
|
|
706
|
-
}, h.F._hufTree = function(e, t, u) {
|
|
707
|
-
var a = [], p = e.length, _ = t.length, r = 0;
|
|
708
|
-
for (r = 0; r < _; r += 2) t[r] = 0, t[r + 1] = 0;
|
|
709
|
-
for (r = 0; r < p; r++) e[r] != 0 && a.push({
|
|
710
|
-
lit: r,
|
|
711
|
-
f: e[r]
|
|
712
|
-
});
|
|
713
|
-
var i = a.length, n = a.slice(0);
|
|
714
|
-
if (i == 0) return 0;
|
|
715
|
-
if (i == 1) {
|
|
716
|
-
var s = a[0].lit;
|
|
717
|
-
return n = s == 0 ? 1 : 0, t[1 + (s << 1)] = 1, t[1 + (n << 1)] = 1, 1;
|
|
718
|
-
}
|
|
719
|
-
a.sort((function(M, B) {
|
|
720
|
-
return M.f - B.f;
|
|
721
|
-
}));
|
|
722
|
-
var d = a[0], E = a[1], x = 0, b = 1, D = 2;
|
|
723
|
-
for (a[0] = {
|
|
724
|
-
lit: -1,
|
|
725
|
-
f: d.f + E.f,
|
|
726
|
-
l: d,
|
|
727
|
-
r: E,
|
|
728
|
-
d: 0
|
|
729
|
-
}; b != i - 1;) d = x != b && (D == i || a[x].f < a[D].f) ? a[x++] : a[D++], E = x != b && (D == i || a[x].f < a[D].f) ? a[x++] : a[D++], a[b++] = {
|
|
730
|
-
lit: -1,
|
|
731
|
-
f: d.f + E.f,
|
|
732
|
-
l: d,
|
|
733
|
-
r: E
|
|
734
|
-
};
|
|
735
|
-
var O = h.F.setDepth(a[b - 1], 0);
|
|
736
|
-
for (O > u && (h.F.restrictDepth(n, u, O), O = u), r = 0; r < i; r++) t[1 + (n[r].lit << 1)] = n[r].d;
|
|
737
|
-
return O;
|
|
738
|
-
}, h.F.setDepth = function(e, t) {
|
|
739
|
-
return e.lit != -1 ? (e.d = t, t) : Math.max(h.F.setDepth(e.l, t + 1), h.F.setDepth(e.r, t + 1));
|
|
740
|
-
}, h.F.restrictDepth = function(e, t, u) {
|
|
741
|
-
var a = 0, p = 1 << u - t, _ = 0;
|
|
742
|
-
for (e.sort((function(i, n) {
|
|
743
|
-
return n.d == i.d ? i.f - n.f : n.d - i.d;
|
|
744
|
-
})), a = 0; a < e.length && e[a].d > t; a++) {
|
|
745
|
-
var r = e[a].d;
|
|
746
|
-
e[a].d = t, _ += p - (1 << u - r);
|
|
747
|
-
}
|
|
748
|
-
for (_ >>>= u - t; _ > 0;) (r = e[a].d) < t ? (e[a].d++, _ -= 1 << t - r - 1) : a++;
|
|
749
|
-
for (; a >= 0; a--) e[a].d == t && _ < 0 && (e[a].d--, _++);
|
|
750
|
-
}, h.F._goodIndex = function(e, t) {
|
|
751
|
-
var u = 0;
|
|
752
|
-
return t[16 | u] <= e && (u |= 16), t[8 | u] <= e && (u |= 8), t[4 | u] <= e && (u |= 4), t[2 | u] <= e && (u |= 2), t[1 | u] <= e && (u |= 1), u;
|
|
753
|
-
}, h.F._writeLit = function(e, t, u, a) {
|
|
754
|
-
return h.F._putsF(u, a, t[e << 1]), a + t[1 + (e << 1)];
|
|
755
|
-
}, h.F.inflate = function(e, t) {
|
|
756
|
-
var u = Uint8Array;
|
|
757
|
-
if (e[0] == 3 && e[1] == 0) return t || new u(0);
|
|
758
|
-
var a = h.F, p = a._bitsF, _ = a._bitsE, r = a._decodeTiny, i = a.makeCodes, n = a.codes2map, s = a._get17, d = a.U, E = t == null;
|
|
759
|
-
E && (t = new u(e.length >>> 2 << 3));
|
|
760
|
-
for (var x, b, D = 0, O = 0, M = 0, B = 0, g = 0, R = 0, c = 0, f = 0, v = 0; D == 0;) if (D = p(e, v, 1), O = p(e, v + 1, 2), v += 3, O != 0) {
|
|
761
|
-
if (E && (t = h.F._check(t, f + (1 << 17))), O == 1 && (x = d.flmap, b = d.fdmap, R = 511, c = 31), O == 2) {
|
|
762
|
-
M = _(e, v, 5) + 257, B = _(e, v + 5, 5) + 1, g = _(e, v + 10, 4) + 4, v += 14;
|
|
763
|
-
for (var w = 0; w < 38; w += 2) d.itree[w] = 0, d.itree[w + 1] = 0;
|
|
764
|
-
var y = 1;
|
|
765
|
-
for (w = 0; w < g; w++) {
|
|
766
|
-
var U = _(e, v + 3 * w, 3);
|
|
767
|
-
d.itree[1 + (d.ordr[w] << 1)] = U, U > y && (y = U);
|
|
768
|
-
}
|
|
769
|
-
v += 3 * g, i(d.itree, y), n(d.itree, y, d.imap), x = d.lmap, b = d.dmap, v = r(d.imap, (1 << y) - 1, M + B, e, v, d.ttree);
|
|
770
|
-
var m = a._copyOut(d.ttree, 0, M, d.ltree);
|
|
771
|
-
R = (1 << m) - 1;
|
|
772
|
-
var I = a._copyOut(d.ttree, M, B, d.dtree);
|
|
773
|
-
c = (1 << I) - 1, i(d.ltree, m), n(d.ltree, m, x), i(d.dtree, I), n(d.dtree, I, b);
|
|
774
|
-
}
|
|
775
|
-
for (;;) {
|
|
776
|
-
var l = x[s(e, v) & R];
|
|
777
|
-
v += 15 & l;
|
|
778
|
-
var o = l >>> 4;
|
|
779
|
-
if (!(o >>> 8)) t[f++] = o;
|
|
780
|
-
else {
|
|
781
|
-
if (o == 256) break;
|
|
782
|
-
var L = f + o - 254;
|
|
783
|
-
if (o > 264) {
|
|
784
|
-
var F = d.ldef[o - 257];
|
|
785
|
-
L = f + (F >>> 3) + _(e, v, 7 & F), v += 7 & F;
|
|
786
|
-
}
|
|
787
|
-
var k = b[s(e, v) & c];
|
|
788
|
-
v += 15 & k;
|
|
789
|
-
var X = k >>> 4, N = d.ddef[X], q = (N >>> 4) + p(e, v, 15 & N);
|
|
790
|
-
for (v += 15 & N, E && (t = h.F._check(t, f + (1 << 17))); f < L;) t[f] = t[f++ - q], t[f] = t[f++ - q], t[f] = t[f++ - q], t[f] = t[f++ - q];
|
|
791
|
-
f = L;
|
|
792
|
-
}
|
|
793
|
-
}
|
|
794
|
-
} else {
|
|
795
|
-
7 & v && (v += 8 - (7 & v));
|
|
796
|
-
var W = 4 + (v >>> 3), C = e[W - 4] | e[W - 3] << 8;
|
|
797
|
-
E && (t = h.F._check(t, f + C)), t.set(new u(e.buffer, e.byteOffset + W, C), f), v = W + C << 3, f += C;
|
|
798
|
-
}
|
|
799
|
-
return t.length == f ? t : t.slice(0, f);
|
|
800
|
-
}, h.F._check = function(e, t) {
|
|
801
|
-
var u = e.length;
|
|
802
|
-
if (t <= u) return e;
|
|
803
|
-
var a = new Uint8Array(Math.max(u << 1, t));
|
|
804
|
-
return a.set(e, 0), a;
|
|
805
|
-
}, h.F._decodeTiny = function(e, t, u, a, p, _) {
|
|
806
|
-
for (var r = h.F._bitsE, i = h.F._get17, n = 0; n < u;) {
|
|
807
|
-
var s = e[i(a, p) & t];
|
|
808
|
-
p += 15 & s;
|
|
809
|
-
var d = s >>> 4;
|
|
810
|
-
if (d <= 15) _[n] = d, n++;
|
|
811
|
-
else {
|
|
812
|
-
var E = 0, x = 0;
|
|
813
|
-
d == 16 ? (x = 3 + r(a, p, 2), p += 2, E = _[n - 1]) : d == 17 ? (x = 3 + r(a, p, 3), p += 3) : d == 18 && (x = 11 + r(a, p, 7), p += 7);
|
|
814
|
-
for (var b = n + x; n < b;) _[n] = E, n++;
|
|
815
|
-
}
|
|
816
|
-
}
|
|
817
|
-
return p;
|
|
818
|
-
}, h.F._copyOut = function(e, t, u, a) {
|
|
819
|
-
for (var p = 0, _ = 0, r = a.length >>> 1; _ < u;) {
|
|
820
|
-
var i = e[_ + t];
|
|
821
|
-
a[_ << 1] = 0, a[1 + (_ << 1)] = i, i > p && (p = i), _++;
|
|
822
|
-
}
|
|
823
|
-
for (; _ < r;) a[_ << 1] = 0, a[1 + (_ << 1)] = 0, _++;
|
|
824
|
-
return p;
|
|
825
|
-
}, h.F.makeCodes = function(e, t) {
|
|
826
|
-
for (var u, a, p, _, r = h.F.U, i = e.length, n = r.bl_count, s = 0; s <= t; s++) n[s] = 0;
|
|
827
|
-
for (s = 1; s < i; s += 2) n[e[s]]++;
|
|
828
|
-
var d = r.next_code;
|
|
829
|
-
for (u = 0, n[0] = 0, a = 1; a <= t; a++) u = u + n[a - 1] << 1, d[a] = u;
|
|
830
|
-
for (p = 0; p < i; p += 2) (_ = e[p + 1]) != 0 && (e[p] = d[_], d[_]++);
|
|
831
|
-
}, h.F.codes2map = function(e, t, u) {
|
|
832
|
-
for (var a = e.length, p = h.F.U.rev15, _ = 0; _ < a; _ += 2) if (e[_ + 1] != 0) for (var r = _ >> 1, i = e[_ + 1], n = r << 4 | i, s = t - i, d = e[_] << s, E = d + (1 << s); d != E;) u[p[d] >>> 15 - t] = n, d++;
|
|
833
|
-
}, h.F.revCodes = function(e, t) {
|
|
834
|
-
for (var u = h.F.U.rev15, a = 15 - t, p = 0; p < e.length; p += 2) e[p] = u[e[p] << t - e[p + 1]] >>> a;
|
|
835
|
-
}, h.F._putsE = function(e, t, u) {
|
|
836
|
-
u <<= 7 & t;
|
|
837
|
-
var a = t >>> 3;
|
|
838
|
-
e[a] |= u, e[a + 1] |= u >>> 8;
|
|
839
|
-
}, h.F._putsF = function(e, t, u) {
|
|
840
|
-
u <<= 7 & t;
|
|
841
|
-
var a = t >>> 3;
|
|
842
|
-
e[a] |= u, e[a + 1] |= u >>> 8, e[a + 2] |= u >>> 16;
|
|
843
|
-
}, h.F._bitsE = function(e, t, u) {
|
|
844
|
-
return (e[t >>> 3] | e[1 + (t >>> 3)] << 8) >>> (7 & t) & (1 << u) - 1;
|
|
845
|
-
}, h.F._bitsF = function(e, t, u) {
|
|
846
|
-
return (e[t >>> 3] | e[1 + (t >>> 3)] << 8 | e[2 + (t >>> 3)] << 16) >>> (7 & t) & (1 << u) - 1;
|
|
847
|
-
}, h.F._get17 = function(e, t) {
|
|
848
|
-
return (e[t >>> 3] | e[1 + (t >>> 3)] << 8 | e[2 + (t >>> 3)] << 16) >>> (7 & t);
|
|
849
|
-
}, h.F._get25 = function(e, t) {
|
|
850
|
-
return (e[t >>> 3] | e[1 + (t >>> 3)] << 8 | e[2 + (t >>> 3)] << 16 | e[3 + (t >>> 3)] << 24) >>> (7 & t);
|
|
851
|
-
}, h.F.U = (P = Uint16Array, H = Uint32Array, {
|
|
852
|
-
next_code: new P(16),
|
|
853
|
-
bl_count: new P(16),
|
|
854
|
-
ordr: [
|
|
855
|
-
16,
|
|
856
|
-
17,
|
|
857
|
-
18,
|
|
858
|
-
0,
|
|
859
|
-
8,
|
|
860
|
-
7,
|
|
861
|
-
9,
|
|
862
|
-
6,
|
|
863
|
-
10,
|
|
864
|
-
5,
|
|
865
|
-
11,
|
|
866
|
-
4,
|
|
867
|
-
12,
|
|
868
|
-
3,
|
|
869
|
-
13,
|
|
870
|
-
2,
|
|
871
|
-
14,
|
|
872
|
-
1,
|
|
873
|
-
15
|
|
874
|
-
],
|
|
875
|
-
of0: [
|
|
876
|
-
3,
|
|
877
|
-
4,
|
|
878
|
-
5,
|
|
879
|
-
6,
|
|
880
|
-
7,
|
|
881
|
-
8,
|
|
882
|
-
9,
|
|
883
|
-
10,
|
|
884
|
-
11,
|
|
885
|
-
13,
|
|
886
|
-
15,
|
|
887
|
-
17,
|
|
888
|
-
19,
|
|
889
|
-
23,
|
|
890
|
-
27,
|
|
891
|
-
31,
|
|
892
|
-
35,
|
|
893
|
-
43,
|
|
894
|
-
51,
|
|
895
|
-
59,
|
|
896
|
-
67,
|
|
897
|
-
83,
|
|
898
|
-
99,
|
|
899
|
-
115,
|
|
900
|
-
131,
|
|
901
|
-
163,
|
|
902
|
-
195,
|
|
903
|
-
227,
|
|
904
|
-
258,
|
|
905
|
-
999,
|
|
906
|
-
999,
|
|
907
|
-
999
|
|
908
|
-
],
|
|
909
|
-
exb: [
|
|
910
|
-
0,
|
|
911
|
-
0,
|
|
912
|
-
0,
|
|
913
|
-
0,
|
|
914
|
-
0,
|
|
915
|
-
0,
|
|
916
|
-
0,
|
|
917
|
-
0,
|
|
918
|
-
1,
|
|
919
|
-
1,
|
|
920
|
-
1,
|
|
921
|
-
1,
|
|
922
|
-
2,
|
|
923
|
-
2,
|
|
924
|
-
2,
|
|
925
|
-
2,
|
|
926
|
-
3,
|
|
927
|
-
3,
|
|
928
|
-
3,
|
|
929
|
-
3,
|
|
930
|
-
4,
|
|
931
|
-
4,
|
|
932
|
-
4,
|
|
933
|
-
4,
|
|
934
|
-
5,
|
|
935
|
-
5,
|
|
936
|
-
5,
|
|
937
|
-
5,
|
|
938
|
-
0,
|
|
939
|
-
0,
|
|
940
|
-
0,
|
|
941
|
-
0
|
|
942
|
-
],
|
|
943
|
-
ldef: new P(32),
|
|
944
|
-
df0: [
|
|
945
|
-
1,
|
|
946
|
-
2,
|
|
947
|
-
3,
|
|
948
|
-
4,
|
|
949
|
-
5,
|
|
950
|
-
7,
|
|
951
|
-
9,
|
|
952
|
-
13,
|
|
953
|
-
17,
|
|
954
|
-
25,
|
|
955
|
-
33,
|
|
956
|
-
49,
|
|
957
|
-
65,
|
|
958
|
-
97,
|
|
959
|
-
129,
|
|
960
|
-
193,
|
|
961
|
-
257,
|
|
962
|
-
385,
|
|
963
|
-
513,
|
|
964
|
-
769,
|
|
965
|
-
1025,
|
|
966
|
-
1537,
|
|
967
|
-
2049,
|
|
968
|
-
3073,
|
|
969
|
-
4097,
|
|
970
|
-
6145,
|
|
971
|
-
8193,
|
|
972
|
-
12289,
|
|
973
|
-
16385,
|
|
974
|
-
24577,
|
|
975
|
-
65535,
|
|
976
|
-
65535
|
|
977
|
-
],
|
|
978
|
-
dxb: [
|
|
979
|
-
0,
|
|
980
|
-
0,
|
|
981
|
-
0,
|
|
982
|
-
0,
|
|
983
|
-
1,
|
|
984
|
-
1,
|
|
985
|
-
2,
|
|
986
|
-
2,
|
|
987
|
-
3,
|
|
988
|
-
3,
|
|
989
|
-
4,
|
|
990
|
-
4,
|
|
991
|
-
5,
|
|
992
|
-
5,
|
|
993
|
-
6,
|
|
994
|
-
6,
|
|
995
|
-
7,
|
|
996
|
-
7,
|
|
997
|
-
8,
|
|
998
|
-
8,
|
|
999
|
-
9,
|
|
1000
|
-
9,
|
|
1001
|
-
10,
|
|
1002
|
-
10,
|
|
1003
|
-
11,
|
|
1004
|
-
11,
|
|
1005
|
-
12,
|
|
1006
|
-
12,
|
|
1007
|
-
13,
|
|
1008
|
-
13,
|
|
1009
|
-
0,
|
|
1010
|
-
0
|
|
1011
|
-
],
|
|
1012
|
-
ddef: new H(32),
|
|
1013
|
-
flmap: new P(512),
|
|
1014
|
-
fltree: [],
|
|
1015
|
-
fdmap: new P(32),
|
|
1016
|
-
fdtree: [],
|
|
1017
|
-
lmap: new P(32768),
|
|
1018
|
-
ltree: [],
|
|
1019
|
-
ttree: [],
|
|
1020
|
-
dmap: new P(32768),
|
|
1021
|
-
dtree: [],
|
|
1022
|
-
imap: new P(512),
|
|
1023
|
-
itree: [],
|
|
1024
|
-
rev15: new P(32768),
|
|
1025
|
-
lhst: new H(286),
|
|
1026
|
-
dhst: new H(30),
|
|
1027
|
-
ihst: new H(19),
|
|
1028
|
-
lits: new H(15e3),
|
|
1029
|
-
strt: new P(65536),
|
|
1030
|
-
prev: new P(32768)
|
|
1031
|
-
}), (function() {
|
|
1032
|
-
for (var e = h.F.U, t = 0; t < 32768; t++) {
|
|
1033
|
-
var u = t;
|
|
1034
|
-
u = (4278255360 & (u = (4042322160 & (u = (3435973836 & (u = (2863311530 & u) >>> 1 | (1431655765 & u) << 1)) >>> 2 | (858993459 & u) << 2)) >>> 4 | (252645135 & u) << 4)) >>> 8 | (16711935 & u) << 8, e.rev15[t] = (u >>> 16 | u << 16) >>> 17;
|
|
1035
|
-
}
|
|
1036
|
-
function a(p, _, r) {
|
|
1037
|
-
for (; _-- != 0;) p.push(0, r);
|
|
1038
|
-
}
|
|
1039
|
-
for (t = 0; t < 32; t++) e.ldef[t] = e.of0[t] << 3 | e.exb[t], e.ddef[t] = e.df0[t] << 4 | e.dxb[t];
|
|
1040
|
-
a(e.fltree, 144, 8), a(e.fltree, 112, 9), a(e.fltree, 24, 7), a(e.fltree, 8, 8), h.F.makeCodes(e.fltree, 9), h.F.codes2map(e.fltree, 9, e.flmap), h.F.revCodes(e.fltree, 9), a(e.fdtree, 32, 5), h.F.makeCodes(e.fdtree, 5), h.F.codes2map(e.fdtree, 5, e.fdmap), h.F.revCodes(e.fdtree, 5), a(e.itree, 19, 0), a(e.ltree, 286, 0), a(e.dtree, 30, 0), a(e.ttree, 320, 0);
|
|
1041
|
-
})();
|
|
1042
|
-
})({
|
|
1043
|
-
get exports() {
|
|
1044
|
-
return Q;
|
|
1045
|
-
},
|
|
1046
|
-
set exports(T) {
|
|
1047
|
-
Q = T;
|
|
1048
|
-
}
|
|
1049
|
-
});
|
|
1050
|
-
var V = j({
|
|
1051
|
-
__proto__: null,
|
|
1052
|
-
default: Q
|
|
1053
|
-
}, [Q]);
|
|
1054
|
-
const K = (function() {
|
|
1055
|
-
var T = {
|
|
1056
|
-
nextZero(r, i) {
|
|
1057
|
-
for (; r[i] != 0;) i++;
|
|
1058
|
-
return i;
|
|
1059
|
-
},
|
|
1060
|
-
readUshort: (r, i) => r[i] << 8 | r[i + 1],
|
|
1061
|
-
writeUshort(r, i, n) {
|
|
1062
|
-
r[i] = n >> 8 & 255, r[i + 1] = 255 & n;
|
|
1063
|
-
},
|
|
1064
|
-
readUint: (r, i) => 16777216 * r[i] + (r[i + 1] << 16 | r[i + 2] << 8 | r[i + 3]),
|
|
1065
|
-
writeUint(r, i, n) {
|
|
1066
|
-
r[i] = n >> 24 & 255, r[i + 1] = n >> 16 & 255, r[i + 2] = n >> 8 & 255, r[i + 3] = 255 & n;
|
|
1067
|
-
},
|
|
1068
|
-
readASCII(r, i, n) {
|
|
1069
|
-
let s = "";
|
|
1070
|
-
for (let d = 0; d < n; d++) s += String.fromCharCode(r[i + d]);
|
|
1071
|
-
return s;
|
|
1072
|
-
},
|
|
1073
|
-
writeASCII(r, i, n) {
|
|
1074
|
-
for (let s = 0; s < n.length; s++) r[i + s] = n.charCodeAt(s);
|
|
1075
|
-
},
|
|
1076
|
-
readBytes(r, i, n) {
|
|
1077
|
-
const s = [];
|
|
1078
|
-
for (let d = 0; d < n; d++) s.push(r[i + d]);
|
|
1079
|
-
return s;
|
|
1080
|
-
},
|
|
1081
|
-
pad: (r) => r.length < 2 ? `0${r}` : r,
|
|
1082
|
-
readUTF8(r, i, n) {
|
|
1083
|
-
let s, d = "";
|
|
1084
|
-
for (let E = 0; E < n; E++) d += `%${T.pad(r[i + E].toString(16))}`;
|
|
1085
|
-
try {
|
|
1086
|
-
s = decodeURIComponent(d);
|
|
1087
|
-
} catch {
|
|
1088
|
-
return T.readASCII(r, i, n);
|
|
1089
|
-
}
|
|
1090
|
-
return s;
|
|
1091
|
-
}
|
|
1092
|
-
};
|
|
1093
|
-
function P(r, i, n, s) {
|
|
1094
|
-
const d = i * n, E = t(s), x = Math.ceil(i * E / 8), b = new Uint8Array(4 * d), D = new Uint32Array(b.buffer), { ctype: O } = s, { depth: M } = s, B = T.readUshort;
|
|
1095
|
-
if (O == 6) {
|
|
1096
|
-
const F = d << 2;
|
|
1097
|
-
if (M == 8) for (var g = 0; g < F; g += 4) b[g] = r[g], b[g + 1] = r[g + 1], b[g + 2] = r[g + 2], b[g + 3] = r[g + 3];
|
|
1098
|
-
if (M == 16) for (g = 0; g < F; g++) b[g] = r[g << 1];
|
|
1099
|
-
} else if (O == 2) {
|
|
1100
|
-
const F = s.tabs.tRNS;
|
|
1101
|
-
if (F == null) {
|
|
1102
|
-
if (M == 8) for (g = 0; g < d; g++) {
|
|
1103
|
-
var R = 3 * g;
|
|
1104
|
-
D[g] = 255 << 24 | r[R + 2] << 16 | r[R + 1] << 8 | r[R];
|
|
1105
|
-
}
|
|
1106
|
-
if (M == 16) for (g = 0; g < d; g++) R = 6 * g, D[g] = 255 << 24 | r[R + 4] << 16 | r[R + 2] << 8 | r[R];
|
|
1107
|
-
} else {
|
|
1108
|
-
var c = F[0];
|
|
1109
|
-
const k = F[1], X = F[2];
|
|
1110
|
-
if (M == 8) for (g = 0; g < d; g++) {
|
|
1111
|
-
var f = g << 2;
|
|
1112
|
-
R = 3 * g, D[g] = 255 << 24 | r[R + 2] << 16 | r[R + 1] << 8 | r[R], r[R] == c && r[R + 1] == k && r[R + 2] == X && (b[f + 3] = 0);
|
|
1113
|
-
}
|
|
1114
|
-
if (M == 16) for (g = 0; g < d; g++) f = g << 2, R = 6 * g, D[g] = 255 << 24 | r[R + 4] << 16 | r[R + 2] << 8 | r[R], B(r, R) == c && B(r, R + 2) == k && B(r, R + 4) == X && (b[f + 3] = 0);
|
|
1115
|
-
}
|
|
1116
|
-
} else if (O == 3) {
|
|
1117
|
-
const F = s.tabs.PLTE, k = s.tabs.tRNS, X = k ? k.length : 0;
|
|
1118
|
-
if (M == 1) for (var v = 0; v < n; v++) {
|
|
1119
|
-
var w = v * x, y = v * i;
|
|
1120
|
-
for (g = 0; g < i; g++) {
|
|
1121
|
-
f = y + g << 2;
|
|
1122
|
-
var U = 3 * (m = r[w + (g >> 3)] >> 7 - ((7 & g) << 0) & 1);
|
|
1123
|
-
b[f] = F[U], b[f + 1] = F[U + 1], b[f + 2] = F[U + 2], b[f + 3] = m < X ? k[m] : 255;
|
|
1124
|
-
}
|
|
1125
|
-
}
|
|
1126
|
-
if (M == 2) for (v = 0; v < n; v++) for (w = v * x, y = v * i, g = 0; g < i; g++) f = y + g << 2, U = 3 * (m = r[w + (g >> 2)] >> 6 - ((3 & g) << 1) & 3), b[f] = F[U], b[f + 1] = F[U + 1], b[f + 2] = F[U + 2], b[f + 3] = m < X ? k[m] : 255;
|
|
1127
|
-
if (M == 4) for (v = 0; v < n; v++) for (w = v * x, y = v * i, g = 0; g < i; g++) f = y + g << 2, U = 3 * (m = r[w + (g >> 1)] >> 4 - ((1 & g) << 2) & 15), b[f] = F[U], b[f + 1] = F[U + 1], b[f + 2] = F[U + 2], b[f + 3] = m < X ? k[m] : 255;
|
|
1128
|
-
if (M == 8) for (g = 0; g < d; g++) {
|
|
1129
|
-
var m;
|
|
1130
|
-
f = g << 2, U = 3 * (m = r[g]), b[f] = F[U], b[f + 1] = F[U + 1], b[f + 2] = F[U + 2], b[f + 3] = m < X ? k[m] : 255;
|
|
1131
|
-
}
|
|
1132
|
-
} else if (O == 4) {
|
|
1133
|
-
if (M == 8) for (g = 0; g < d; g++) {
|
|
1134
|
-
f = g << 2;
|
|
1135
|
-
var I = r[l = g << 1];
|
|
1136
|
-
b[f] = I, b[f + 1] = I, b[f + 2] = I, b[f + 3] = r[l + 1];
|
|
1137
|
-
}
|
|
1138
|
-
if (M == 16) for (g = 0; g < d; g++) {
|
|
1139
|
-
var l;
|
|
1140
|
-
f = g << 2, I = r[l = g << 2], b[f] = I, b[f + 1] = I, b[f + 2] = I, b[f + 3] = r[l + 2];
|
|
1141
|
-
}
|
|
1142
|
-
} else if (O == 0) for (c = s.tabs.tRNS ? s.tabs.tRNS : -1, v = 0; v < n; v++) {
|
|
1143
|
-
const F = v * x, k = v * i;
|
|
1144
|
-
if (M == 1) for (var o = 0; o < i; o++) {
|
|
1145
|
-
var L = (I = 255 * (r[F + (o >>> 3)] >>> 7 - (7 & o) & 1)) == 255 * c ? 0 : 255;
|
|
1146
|
-
D[k + o] = L << 24 | I << 16 | I << 8 | I;
|
|
1147
|
-
}
|
|
1148
|
-
else if (M == 2) for (o = 0; o < i; o++) L = (I = 85 * (r[F + (o >>> 2)] >>> 6 - ((3 & o) << 1) & 3)) == 85 * c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
|
|
1149
|
-
else if (M == 4) for (o = 0; o < i; o++) L = (I = 17 * (r[F + (o >>> 1)] >>> 4 - ((1 & o) << 2) & 15)) == 17 * c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
|
|
1150
|
-
else if (M == 8) for (o = 0; o < i; o++) L = (I = r[F + o]) == c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
|
|
1151
|
-
else if (M == 16) for (o = 0; o < i; o++) I = r[F + (o << 1)], L = B(r, F + (o << 1)) == c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
|
|
1152
|
-
}
|
|
1153
|
-
return b;
|
|
1154
|
-
}
|
|
1155
|
-
function H(r, i, n, s) {
|
|
1156
|
-
const d = t(r), E = Math.ceil(n * d / 8), x = new Uint8Array((E + 1 + r.interlace) * s);
|
|
1157
|
-
return i = r.tabs.CgBI ? e(i, x) : h(i, x), r.interlace == 0 ? i = u(i, r, 0, n, s) : r.interlace == 1 && (i = (function(D, O) {
|
|
1158
|
-
const M = O.width, B = O.height, g = t(O), R = g >> 3, c = Math.ceil(M * g / 8), f = new Uint8Array(B * c);
|
|
1159
|
-
let v = 0;
|
|
1160
|
-
const w = [
|
|
1161
|
-
0,
|
|
1162
|
-
0,
|
|
1163
|
-
4,
|
|
1164
|
-
0,
|
|
1165
|
-
2,
|
|
1166
|
-
0,
|
|
1167
|
-
1
|
|
1168
|
-
], y = [
|
|
1169
|
-
0,
|
|
1170
|
-
4,
|
|
1171
|
-
0,
|
|
1172
|
-
2,
|
|
1173
|
-
0,
|
|
1174
|
-
1,
|
|
1175
|
-
0
|
|
1176
|
-
], U = [
|
|
1177
|
-
8,
|
|
1178
|
-
8,
|
|
1179
|
-
8,
|
|
1180
|
-
4,
|
|
1181
|
-
4,
|
|
1182
|
-
2,
|
|
1183
|
-
2
|
|
1184
|
-
], m = [
|
|
1185
|
-
8,
|
|
1186
|
-
8,
|
|
1187
|
-
4,
|
|
1188
|
-
4,
|
|
1189
|
-
2,
|
|
1190
|
-
2,
|
|
1191
|
-
1
|
|
1192
|
-
];
|
|
1193
|
-
let I = 0;
|
|
1194
|
-
for (; I < 7;) {
|
|
1195
|
-
const o = U[I], L = m[I];
|
|
1196
|
-
let F = 0, k = 0, X = w[I];
|
|
1197
|
-
for (; X < B;) X += o, k++;
|
|
1198
|
-
let N = y[I];
|
|
1199
|
-
for (; N < M;) N += L, F++;
|
|
1200
|
-
const q = Math.ceil(F * g / 8);
|
|
1201
|
-
u(D, O, v, F, k);
|
|
1202
|
-
let W = 0, C = w[I];
|
|
1203
|
-
for (; C < B;) {
|
|
1204
|
-
let Z = y[I], oe = v + W * q << 3;
|
|
1205
|
-
for (; Z < M;) {
|
|
1206
|
-
var l;
|
|
1207
|
-
if (g == 1 && (l = (l = D[oe >> 3]) >> 7 - (7 & oe) & 1, f[C * c + (Z >> 3)] |= l << 7 - ((7 & Z) << 0)), g == 2 && (l = (l = D[oe >> 3]) >> 6 - (7 & oe) & 3, f[C * c + (Z >> 2)] |= l << 6 - ((3 & Z) << 1)), g == 4 && (l = (l = D[oe >> 3]) >> 4 - (7 & oe) & 15, f[C * c + (Z >> 1)] |= l << 4 - ((1 & Z) << 2)), g >= 8) {
|
|
1208
|
-
const te = C * c + Z * R;
|
|
1209
|
-
for (let J = 0; J < R; J++) f[te + J] = D[(oe >> 3) + J];
|
|
1210
|
-
}
|
|
1211
|
-
oe += g, Z += L;
|
|
1212
|
-
}
|
|
1213
|
-
W++, C += o;
|
|
1214
|
-
}
|
|
1215
|
-
F * k != 0 && (v += k * (1 + q)), I += 1;
|
|
1216
|
-
}
|
|
1217
|
-
return f;
|
|
1218
|
-
})(i, r)), i;
|
|
1219
|
-
}
|
|
1220
|
-
function h(r, i) {
|
|
1221
|
-
return e(new Uint8Array(r.buffer, 2, r.length - 6), i);
|
|
1222
|
-
}
|
|
1223
|
-
var e = (function() {
|
|
1224
|
-
const r = { H: {} };
|
|
1225
|
-
return r.H.N = function(i, n) {
|
|
1226
|
-
const s = Uint8Array;
|
|
1227
|
-
let d, E, x = 0, b = 0, D = 0, O = 0, M = 0, B = 0, g = 0, R = 0, c = 0;
|
|
1228
|
-
if (i[0] == 3 && i[1] == 0) return n || new s(0);
|
|
1229
|
-
const f = r.H, v = f.b, w = f.e, y = f.R, U = f.n, m = f.A, I = f.Z, l = f.m, o = n == null;
|
|
1230
|
-
for (o && (n = new s(i.length >>> 2 << 5)); x == 0;) if (x = v(i, c, 1), b = v(i, c + 1, 2), c += 3, b != 0) {
|
|
1231
|
-
if (o && (n = r.H.W(n, R + (1 << 17))), b == 1 && (d = l.J, E = l.h, B = 511, g = 31), b == 2) {
|
|
1232
|
-
D = w(i, c, 5) + 257, O = w(i, c + 5, 5) + 1, M = w(i, c + 10, 4) + 4, c += 14;
|
|
1233
|
-
let F = 1;
|
|
1234
|
-
for (var L = 0; L < 38; L += 2) l.Q[L] = 0, l.Q[L + 1] = 0;
|
|
1235
|
-
for (L = 0; L < M; L++) {
|
|
1236
|
-
const N = w(i, c + 3 * L, 3);
|
|
1237
|
-
l.Q[1 + (l.X[L] << 1)] = N, N > F && (F = N);
|
|
1238
|
-
}
|
|
1239
|
-
c += 3 * M, U(l.Q, F), m(l.Q, F, l.u), d = l.w, E = l.d, c = y(l.u, (1 << F) - 1, D + O, i, c, l.v);
|
|
1240
|
-
const k = f.V(l.v, 0, D, l.C);
|
|
1241
|
-
B = (1 << k) - 1;
|
|
1242
|
-
const X = f.V(l.v, D, O, l.D);
|
|
1243
|
-
g = (1 << X) - 1, U(l.C, k), m(l.C, k, d), U(l.D, X), m(l.D, X, E);
|
|
1244
|
-
}
|
|
1245
|
-
for (;;) {
|
|
1246
|
-
const F = d[I(i, c) & B];
|
|
1247
|
-
c += 15 & F;
|
|
1248
|
-
const k = F >>> 4;
|
|
1249
|
-
if (!(k >>> 8)) n[R++] = k;
|
|
1250
|
-
else {
|
|
1251
|
-
if (k == 256) break;
|
|
1252
|
-
{
|
|
1253
|
-
let X = R + k - 254;
|
|
1254
|
-
if (k > 264) {
|
|
1255
|
-
const Z = l.q[k - 257];
|
|
1256
|
-
X = R + (Z >>> 3) + w(i, c, 7 & Z), c += 7 & Z;
|
|
1257
|
-
}
|
|
1258
|
-
const N = E[I(i, c) & g];
|
|
1259
|
-
c += 15 & N;
|
|
1260
|
-
const q = N >>> 4, W = l.c[q], C = (W >>> 4) + v(i, c, 15 & W);
|
|
1261
|
-
for (c += 15 & W; R < X;) n[R] = n[R++ - C], n[R] = n[R++ - C], n[R] = n[R++ - C], n[R] = n[R++ - C];
|
|
1262
|
-
R = X;
|
|
1263
|
-
}
|
|
1264
|
-
}
|
|
1265
|
-
}
|
|
1266
|
-
} else {
|
|
1267
|
-
7 & c && (c += 8 - (7 & c));
|
|
1268
|
-
const F = 4 + (c >>> 3), k = i[F - 4] | i[F - 3] << 8;
|
|
1269
|
-
o && (n = r.H.W(n, R + k)), n.set(new s(i.buffer, i.byteOffset + F, k), R), c = F + k << 3, R += k;
|
|
1270
|
-
}
|
|
1271
|
-
return n.length == R ? n : n.slice(0, R);
|
|
1272
|
-
}, r.H.W = function(i, n) {
|
|
1273
|
-
const s = i.length;
|
|
1274
|
-
if (n <= s) return i;
|
|
1275
|
-
const d = new Uint8Array(s << 1);
|
|
1276
|
-
return d.set(i, 0), d;
|
|
1277
|
-
}, r.H.R = function(i, n, s, d, E, x) {
|
|
1278
|
-
const b = r.H.e, D = r.H.Z;
|
|
1279
|
-
let O = 0;
|
|
1280
|
-
for (; O < s;) {
|
|
1281
|
-
const M = i[D(d, E) & n];
|
|
1282
|
-
E += 15 & M;
|
|
1283
|
-
const B = M >>> 4;
|
|
1284
|
-
if (B <= 15) x[O] = B, O++;
|
|
1285
|
-
else {
|
|
1286
|
-
let g = 0, R = 0;
|
|
1287
|
-
B == 16 ? (R = 3 + b(d, E, 2), E += 2, g = x[O - 1]) : B == 17 ? (R = 3 + b(d, E, 3), E += 3) : B == 18 && (R = 11 + b(d, E, 7), E += 7);
|
|
1288
|
-
const c = O + R;
|
|
1289
|
-
for (; O < c;) x[O] = g, O++;
|
|
1290
|
-
}
|
|
1291
|
-
}
|
|
1292
|
-
return E;
|
|
1293
|
-
}, r.H.V = function(i, n, s, d) {
|
|
1294
|
-
let E = 0, x = 0;
|
|
1295
|
-
const b = d.length >>> 1;
|
|
1296
|
-
for (; x < s;) {
|
|
1297
|
-
const D = i[x + n];
|
|
1298
|
-
d[x << 1] = 0, d[1 + (x << 1)] = D, D > E && (E = D), x++;
|
|
1299
|
-
}
|
|
1300
|
-
for (; x < b;) d[x << 1] = 0, d[1 + (x << 1)] = 0, x++;
|
|
1301
|
-
return E;
|
|
1302
|
-
}, r.H.n = function(i, n) {
|
|
1303
|
-
const s = r.H.m, d = i.length;
|
|
1304
|
-
let E, x, b, D;
|
|
1305
|
-
const O = s.j;
|
|
1306
|
-
for (var M = 0; M <= n; M++) O[M] = 0;
|
|
1307
|
-
for (M = 1; M < d; M += 2) O[i[M]]++;
|
|
1308
|
-
const B = s.K;
|
|
1309
|
-
for (E = 0, O[0] = 0, x = 1; x <= n; x++) E = E + O[x - 1] << 1, B[x] = E;
|
|
1310
|
-
for (b = 0; b < d; b += 2) D = i[b + 1], D != 0 && (i[b] = B[D], B[D]++);
|
|
1311
|
-
}, r.H.A = function(i, n, s) {
|
|
1312
|
-
const d = i.length, E = r.H.m.r;
|
|
1313
|
-
for (let x = 0; x < d; x += 2) if (i[x + 1] != 0) {
|
|
1314
|
-
const b = x >> 1, D = i[x + 1], O = b << 4 | D, M = n - D;
|
|
1315
|
-
let B = i[x] << M;
|
|
1316
|
-
const g = B + (1 << M);
|
|
1317
|
-
for (; B != g;) s[E[B] >>> 15 - n] = O, B++;
|
|
1318
|
-
}
|
|
1319
|
-
}, r.H.l = function(i, n) {
|
|
1320
|
-
const s = r.H.m.r, d = 15 - n;
|
|
1321
|
-
for (let E = 0; E < i.length; E += 2) i[E] = s[i[E] << n - i[E + 1]] >>> d;
|
|
1322
|
-
}, r.H.M = function(i, n, s) {
|
|
1323
|
-
s <<= 7 & n;
|
|
1324
|
-
const d = n >>> 3;
|
|
1325
|
-
i[d] |= s, i[d + 1] |= s >>> 8;
|
|
1326
|
-
}, r.H.I = function(i, n, s) {
|
|
1327
|
-
s <<= 7 & n;
|
|
1328
|
-
const d = n >>> 3;
|
|
1329
|
-
i[d] |= s, i[d + 1] |= s >>> 8, i[d + 2] |= s >>> 16;
|
|
1330
|
-
}, r.H.e = function(i, n, s) {
|
|
1331
|
-
return (i[n >>> 3] | i[1 + (n >>> 3)] << 8) >>> (7 & n) & (1 << s) - 1;
|
|
1332
|
-
}, r.H.b = function(i, n, s) {
|
|
1333
|
-
return (i[n >>> 3] | i[1 + (n >>> 3)] << 8 | i[2 + (n >>> 3)] << 16) >>> (7 & n) & (1 << s) - 1;
|
|
1334
|
-
}, r.H.Z = function(i, n) {
|
|
1335
|
-
return (i[n >>> 3] | i[1 + (n >>> 3)] << 8 | i[2 + (n >>> 3)] << 16) >>> (7 & n);
|
|
1336
|
-
}, r.H.i = function(i, n) {
|
|
1337
|
-
return (i[n >>> 3] | i[1 + (n >>> 3)] << 8 | i[2 + (n >>> 3)] << 16 | i[3 + (n >>> 3)] << 24) >>> (7 & n);
|
|
1338
|
-
}, r.H.m = (function() {
|
|
1339
|
-
const i = Uint16Array, n = Uint32Array;
|
|
1340
|
-
return {
|
|
1341
|
-
K: new i(16),
|
|
1342
|
-
j: new i(16),
|
|
1343
|
-
X: [
|
|
1344
|
-
16,
|
|
1345
|
-
17,
|
|
1346
|
-
18,
|
|
1347
|
-
0,
|
|
1348
|
-
8,
|
|
1349
|
-
7,
|
|
1350
|
-
9,
|
|
1351
|
-
6,
|
|
1352
|
-
10,
|
|
1353
|
-
5,
|
|
1354
|
-
11,
|
|
1355
|
-
4,
|
|
1356
|
-
12,
|
|
1357
|
-
3,
|
|
1358
|
-
13,
|
|
1359
|
-
2,
|
|
1360
|
-
14,
|
|
1361
|
-
1,
|
|
1362
|
-
15
|
|
1363
|
-
],
|
|
1364
|
-
S: [
|
|
1365
|
-
3,
|
|
1366
|
-
4,
|
|
1367
|
-
5,
|
|
1368
|
-
6,
|
|
1369
|
-
7,
|
|
1370
|
-
8,
|
|
1371
|
-
9,
|
|
1372
|
-
10,
|
|
1373
|
-
11,
|
|
1374
|
-
13,
|
|
1375
|
-
15,
|
|
1376
|
-
17,
|
|
1377
|
-
19,
|
|
1378
|
-
23,
|
|
1379
|
-
27,
|
|
1380
|
-
31,
|
|
1381
|
-
35,
|
|
1382
|
-
43,
|
|
1383
|
-
51,
|
|
1384
|
-
59,
|
|
1385
|
-
67,
|
|
1386
|
-
83,
|
|
1387
|
-
99,
|
|
1388
|
-
115,
|
|
1389
|
-
131,
|
|
1390
|
-
163,
|
|
1391
|
-
195,
|
|
1392
|
-
227,
|
|
1393
|
-
258,
|
|
1394
|
-
999,
|
|
1395
|
-
999,
|
|
1396
|
-
999
|
|
1397
|
-
],
|
|
1398
|
-
T: [
|
|
1399
|
-
0,
|
|
1400
|
-
0,
|
|
1401
|
-
0,
|
|
1402
|
-
0,
|
|
1403
|
-
0,
|
|
1404
|
-
0,
|
|
1405
|
-
0,
|
|
1406
|
-
0,
|
|
1407
|
-
1,
|
|
1408
|
-
1,
|
|
1409
|
-
1,
|
|
1410
|
-
1,
|
|
1411
|
-
2,
|
|
1412
|
-
2,
|
|
1413
|
-
2,
|
|
1414
|
-
2,
|
|
1415
|
-
3,
|
|
1416
|
-
3,
|
|
1417
|
-
3,
|
|
1418
|
-
3,
|
|
1419
|
-
4,
|
|
1420
|
-
4,
|
|
1421
|
-
4,
|
|
1422
|
-
4,
|
|
1423
|
-
5,
|
|
1424
|
-
5,
|
|
1425
|
-
5,
|
|
1426
|
-
5,
|
|
1427
|
-
0,
|
|
1428
|
-
0,
|
|
1429
|
-
0,
|
|
1430
|
-
0
|
|
1431
|
-
],
|
|
1432
|
-
q: new i(32),
|
|
1433
|
-
p: [
|
|
1434
|
-
1,
|
|
1435
|
-
2,
|
|
1436
|
-
3,
|
|
1437
|
-
4,
|
|
1438
|
-
5,
|
|
1439
|
-
7,
|
|
1440
|
-
9,
|
|
1441
|
-
13,
|
|
1442
|
-
17,
|
|
1443
|
-
25,
|
|
1444
|
-
33,
|
|
1445
|
-
49,
|
|
1446
|
-
65,
|
|
1447
|
-
97,
|
|
1448
|
-
129,
|
|
1449
|
-
193,
|
|
1450
|
-
257,
|
|
1451
|
-
385,
|
|
1452
|
-
513,
|
|
1453
|
-
769,
|
|
1454
|
-
1025,
|
|
1455
|
-
1537,
|
|
1456
|
-
2049,
|
|
1457
|
-
3073,
|
|
1458
|
-
4097,
|
|
1459
|
-
6145,
|
|
1460
|
-
8193,
|
|
1461
|
-
12289,
|
|
1462
|
-
16385,
|
|
1463
|
-
24577,
|
|
1464
|
-
65535,
|
|
1465
|
-
65535
|
|
1466
|
-
],
|
|
1467
|
-
z: [
|
|
1468
|
-
0,
|
|
1469
|
-
0,
|
|
1470
|
-
0,
|
|
1471
|
-
0,
|
|
1472
|
-
1,
|
|
1473
|
-
1,
|
|
1474
|
-
2,
|
|
1475
|
-
2,
|
|
1476
|
-
3,
|
|
1477
|
-
3,
|
|
1478
|
-
4,
|
|
1479
|
-
4,
|
|
1480
|
-
5,
|
|
1481
|
-
5,
|
|
1482
|
-
6,
|
|
1483
|
-
6,
|
|
1484
|
-
7,
|
|
1485
|
-
7,
|
|
1486
|
-
8,
|
|
1487
|
-
8,
|
|
1488
|
-
9,
|
|
1489
|
-
9,
|
|
1490
|
-
10,
|
|
1491
|
-
10,
|
|
1492
|
-
11,
|
|
1493
|
-
11,
|
|
1494
|
-
12,
|
|
1495
|
-
12,
|
|
1496
|
-
13,
|
|
1497
|
-
13,
|
|
1498
|
-
0,
|
|
1499
|
-
0
|
|
1500
|
-
],
|
|
1501
|
-
c: new n(32),
|
|
1502
|
-
J: new i(512),
|
|
1503
|
-
_: [],
|
|
1504
|
-
h: new i(32),
|
|
1505
|
-
$: [],
|
|
1506
|
-
w: new i(32768),
|
|
1507
|
-
C: [],
|
|
1508
|
-
v: [],
|
|
1509
|
-
d: new i(32768),
|
|
1510
|
-
D: [],
|
|
1511
|
-
u: new i(512),
|
|
1512
|
-
Q: [],
|
|
1513
|
-
r: new i(32768),
|
|
1514
|
-
s: new n(286),
|
|
1515
|
-
Y: new n(30),
|
|
1516
|
-
a: new n(19),
|
|
1517
|
-
t: new n(15e3),
|
|
1518
|
-
k: new i(65536),
|
|
1519
|
-
g: new i(32768)
|
|
1520
|
-
};
|
|
1521
|
-
})(), (function() {
|
|
1522
|
-
const i = r.H.m;
|
|
1523
|
-
for (var n = 0; n < 32768; n++) {
|
|
1524
|
-
let d = n;
|
|
1525
|
-
d = (2863311530 & d) >>> 1 | (1431655765 & d) << 1, d = (3435973836 & d) >>> 2 | (858993459 & d) << 2, d = (4042322160 & d) >>> 4 | (252645135 & d) << 4, d = (4278255360 & d) >>> 8 | (16711935 & d) << 8, i.r[n] = (d >>> 16 | d << 16) >>> 17;
|
|
1526
|
-
}
|
|
1527
|
-
function s(d, E, x) {
|
|
1528
|
-
for (; E-- != 0;) d.push(0, x);
|
|
1529
|
-
}
|
|
1530
|
-
for (n = 0; n < 32; n++) i.q[n] = i.S[n] << 3 | i.T[n], i.c[n] = i.p[n] << 4 | i.z[n];
|
|
1531
|
-
s(i._, 144, 8), s(i._, 112, 9), s(i._, 24, 7), s(i._, 8, 8), r.H.n(i._, 9), r.H.A(i._, 9, i.J), r.H.l(i._, 9), s(i.$, 32, 5), r.H.n(i.$, 5), r.H.A(i.$, 5, i.h), r.H.l(i.$, 5), s(i.Q, 19, 0), s(i.C, 286, 0), s(i.D, 30, 0), s(i.v, 320, 0);
|
|
1532
|
-
})(), r.H.N;
|
|
1533
|
-
})();
|
|
1534
|
-
function t(r) {
|
|
1535
|
-
return [
|
|
1536
|
-
1,
|
|
1537
|
-
null,
|
|
1538
|
-
3,
|
|
1539
|
-
1,
|
|
1540
|
-
2,
|
|
1541
|
-
null,
|
|
1542
|
-
4
|
|
1543
|
-
][r.ctype] * r.depth;
|
|
1544
|
-
}
|
|
1545
|
-
function u(r, i, n, s, d) {
|
|
1546
|
-
let E = t(i);
|
|
1547
|
-
const x = Math.ceil(s * E / 8);
|
|
1548
|
-
let b, D;
|
|
1549
|
-
E = Math.ceil(E / 8);
|
|
1550
|
-
let O = r[n], M = 0;
|
|
1551
|
-
if (O > 1 && (r[n] = [
|
|
1552
|
-
0,
|
|
1553
|
-
0,
|
|
1554
|
-
1
|
|
1555
|
-
][O - 2]), O == 3) for (M = E; M < x; M++) r[M + 1] = r[M + 1] + (r[M + 1 - E] >>> 1) & 255;
|
|
1556
|
-
for (let B = 0; B < d; B++) if (b = n + B * x, D = b + B + 1, O = r[D - 1], M = 0, O == 0) for (; M < x; M++) r[b + M] = r[D + M];
|
|
1557
|
-
else if (O == 1) {
|
|
1558
|
-
for (; M < E; M++) r[b + M] = r[D + M];
|
|
1559
|
-
for (; M < x; M++) r[b + M] = r[D + M] + r[b + M - E];
|
|
1560
|
-
} else if (O == 2) for (; M < x; M++) r[b + M] = r[D + M] + r[b + M - x];
|
|
1561
|
-
else if (O == 3) {
|
|
1562
|
-
for (; M < E; M++) r[b + M] = r[D + M] + (r[b + M - x] >>> 1);
|
|
1563
|
-
for (; M < x; M++) r[b + M] = r[D + M] + (r[b + M - x] + r[b + M - E] >>> 1);
|
|
1564
|
-
} else {
|
|
1565
|
-
for (; M < E; M++) r[b + M] = r[D + M] + a(0, r[b + M - x], 0);
|
|
1566
|
-
for (; M < x; M++) r[b + M] = r[D + M] + a(r[b + M - E], r[b + M - x], r[b + M - E - x]);
|
|
1567
|
-
}
|
|
1568
|
-
return r;
|
|
1569
|
-
}
|
|
1570
|
-
function a(r, i, n) {
|
|
1571
|
-
const s = r + i - n, d = s - r, E = s - i, x = s - n;
|
|
1572
|
-
return d * d <= E * E && d * d <= x * x ? r : E * E <= x * x ? i : n;
|
|
1573
|
-
}
|
|
1574
|
-
function p(r, i, n) {
|
|
1575
|
-
n.width = T.readUint(r, i), i += 4, n.height = T.readUint(r, i), i += 4, n.depth = r[i], i++, n.ctype = r[i], i++, n.compress = r[i], i++, n.filter = r[i], i++, n.interlace = r[i], i++;
|
|
1576
|
-
}
|
|
1577
|
-
function _(r, i, n, s, d, E, x, b, D) {
|
|
1578
|
-
const O = Math.min(i, d), M = Math.min(n, E);
|
|
1579
|
-
let B = 0, g = 0;
|
|
1580
|
-
for (let I = 0; I < M; I++) for (let l = 0; l < O; l++) if (x >= 0 && b >= 0 ? (B = I * i + l << 2, g = (b + I) * d + x + l << 2) : (B = (-b + I) * i - x + l << 2, g = I * d + l << 2), D == 0) s[g] = r[B], s[g + 1] = r[B + 1], s[g + 2] = r[B + 2], s[g + 3] = r[B + 3];
|
|
1581
|
-
else if (D == 1) {
|
|
1582
|
-
var R = r[B + 3] * .00392156862745098, c = r[B] * R, f = r[B + 1] * R, v = r[B + 2] * R, w = s[g + 3] * (1 / 255), y = s[g] * w, U = s[g + 1] * w, m = s[g + 2] * w;
|
|
1583
|
-
const o = 1 - R, L = R + w * o, F = L == 0 ? 0 : 1 / L;
|
|
1584
|
-
s[g + 3] = 255 * L, s[g + 0] = (c + y * o) * F, s[g + 1] = (f + U * o) * F, s[g + 2] = (v + m * o) * F;
|
|
1585
|
-
} else if (D == 2) R = r[B + 3], c = r[B], f = r[B + 1], v = r[B + 2], w = s[g + 3], y = s[g], U = s[g + 1], m = s[g + 2], R == w && c == y && f == U && v == m ? (s[g] = 0, s[g + 1] = 0, s[g + 2] = 0, s[g + 3] = 0) : (s[g] = c, s[g + 1] = f, s[g + 2] = v, s[g + 3] = R);
|
|
1586
|
-
else if (D == 3) {
|
|
1587
|
-
if (R = r[B + 3], c = r[B], f = r[B + 1], v = r[B + 2], w = s[g + 3], y = s[g], U = s[g + 1], m = s[g + 2], R == w && c == y && f == U && v == m) continue;
|
|
1588
|
-
if (R < 220 && w > 20) return !1;
|
|
1589
|
-
}
|
|
1590
|
-
return !0;
|
|
1591
|
-
}
|
|
1592
|
-
return {
|
|
1593
|
-
decode: function(i) {
|
|
1594
|
-
const n = new Uint8Array(i);
|
|
1595
|
-
let s = 8;
|
|
1596
|
-
const d = T, E = d.readUshort, x = d.readUint, b = {
|
|
1597
|
-
tabs: {},
|
|
1598
|
-
frames: []
|
|
1599
|
-
}, D = new Uint8Array(n.length);
|
|
1600
|
-
let O, M = 0, B = 0;
|
|
1601
|
-
const g = [
|
|
1602
|
-
137,
|
|
1603
|
-
80,
|
|
1604
|
-
78,
|
|
1605
|
-
71,
|
|
1606
|
-
13,
|
|
1607
|
-
10,
|
|
1608
|
-
26,
|
|
1609
|
-
10
|
|
1610
|
-
];
|
|
1611
|
-
for (var R = 0; R < 8; R++) if (n[R] != g[R]) throw "The input is not a PNG file!";
|
|
1612
|
-
for (; s < n.length;) {
|
|
1613
|
-
const I = d.readUint(n, s);
|
|
1614
|
-
s += 4;
|
|
1615
|
-
const l = d.readASCII(n, s, 4);
|
|
1616
|
-
if (s += 4, l == "IHDR") p(n, s, b);
|
|
1617
|
-
else if (l == "iCCP") {
|
|
1618
|
-
for (var c = s; n[c] != 0;) c++;
|
|
1619
|
-
d.readASCII(n, s, c - s), n[c + 1];
|
|
1620
|
-
const o = n.slice(c + 2, s + I);
|
|
1621
|
-
let L = null;
|
|
1622
|
-
try {
|
|
1623
|
-
L = h(o);
|
|
1624
|
-
} catch {
|
|
1625
|
-
L = e(o);
|
|
1626
|
-
}
|
|
1627
|
-
b.tabs[l] = L;
|
|
1628
|
-
} else if (l == "CgBI") b.tabs[l] = n.slice(s, s + 4);
|
|
1629
|
-
else if (l == "IDAT") {
|
|
1630
|
-
for (R = 0; R < I; R++) D[M + R] = n[s + R];
|
|
1631
|
-
M += I;
|
|
1632
|
-
} else if (l == "acTL") b.tabs[l] = {
|
|
1633
|
-
num_frames: x(n, s),
|
|
1634
|
-
num_plays: x(n, s + 4)
|
|
1635
|
-
}, O = new Uint8Array(n.length);
|
|
1636
|
-
else if (l == "fcTL") {
|
|
1637
|
-
B != 0 && ((m = b.frames[b.frames.length - 1]).data = H(b, O.slice(0, B), m.rect.width, m.rect.height), B = 0);
|
|
1638
|
-
const o = {
|
|
1639
|
-
x: x(n, s + 12),
|
|
1640
|
-
y: x(n, s + 16),
|
|
1641
|
-
width: x(n, s + 4),
|
|
1642
|
-
height: x(n, s + 8)
|
|
1643
|
-
};
|
|
1644
|
-
let L = E(n, s + 22);
|
|
1645
|
-
L = E(n, s + 20) / (L == 0 ? 100 : L);
|
|
1646
|
-
const F = {
|
|
1647
|
-
rect: o,
|
|
1648
|
-
delay: Math.round(1e3 * L),
|
|
1649
|
-
dispose: n[s + 24],
|
|
1650
|
-
blend: n[s + 25]
|
|
1651
|
-
};
|
|
1652
|
-
b.frames.push(F);
|
|
1653
|
-
} else if (l == "fdAT") {
|
|
1654
|
-
for (R = 0; R < I - 4; R++) O[B + R] = n[s + R + 4];
|
|
1655
|
-
B += I - 4;
|
|
1656
|
-
} else if (l == "pHYs") b.tabs[l] = [
|
|
1657
|
-
d.readUint(n, s),
|
|
1658
|
-
d.readUint(n, s + 4),
|
|
1659
|
-
n[s + 8]
|
|
1660
|
-
];
|
|
1661
|
-
else if (l == "cHRM") for (b.tabs[l] = [], R = 0; R < 8; R++) b.tabs[l].push(d.readUint(n, s + 4 * R));
|
|
1662
|
-
else if (l == "tEXt" || l == "zTXt") {
|
|
1663
|
-
b.tabs[l] ?? (b.tabs[l] = {});
|
|
1664
|
-
var f = d.nextZero(n, s), v = d.readASCII(n, s, f - s), w = s + I - f - 1;
|
|
1665
|
-
if (l == "tEXt") U = d.readASCII(n, f + 1, w);
|
|
1666
|
-
else {
|
|
1667
|
-
var y = h(n.slice(f + 2, f + 2 + w));
|
|
1668
|
-
U = d.readUTF8(y, 0, y.length);
|
|
1669
|
-
}
|
|
1670
|
-
b.tabs[l][v] = U;
|
|
1671
|
-
} else if (l == "iTXt") {
|
|
1672
|
-
b.tabs[l] ?? (b.tabs[l] = {}), f = 0, c = s, f = d.nextZero(n, c), v = d.readASCII(n, c, f - c);
|
|
1673
|
-
const o = n[c = f + 1];
|
|
1674
|
-
var U;
|
|
1675
|
-
n[c + 1], c += 2, f = d.nextZero(n, c), d.readASCII(n, c, f - c), c = f + 1, f = d.nextZero(n, c), d.readUTF8(n, c, f - c), w = I - ((c = f + 1) - s), o == 0 ? U = d.readUTF8(n, c, w) : (y = h(n.slice(c, c + w)), U = d.readUTF8(y, 0, y.length)), b.tabs[l][v] = U;
|
|
1676
|
-
} else if (l == "PLTE") b.tabs[l] = d.readBytes(n, s, I);
|
|
1677
|
-
else if (l == "hIST") {
|
|
1678
|
-
const o = b.tabs.PLTE.length / 3;
|
|
1679
|
-
for (b.tabs[l] = [], R = 0; R < o; R++) b.tabs[l].push(E(n, s + 2 * R));
|
|
1680
|
-
} else if (l == "tRNS") b.ctype == 3 ? b.tabs[l] = d.readBytes(n, s, I) : b.ctype == 0 ? b.tabs[l] = E(n, s) : b.ctype == 2 && (b.tabs[l] = [
|
|
1681
|
-
E(n, s),
|
|
1682
|
-
E(n, s + 2),
|
|
1683
|
-
E(n, s + 4)
|
|
1684
|
-
]);
|
|
1685
|
-
else if (l == "gAMA") b.tabs[l] = d.readUint(n, s) / 1e5;
|
|
1686
|
-
else if (l == "sRGB") b.tabs[l] = n[s];
|
|
1687
|
-
else if (l == "bKGD") b.ctype == 0 || b.ctype == 4 ? b.tabs[l] = [E(n, s)] : b.ctype == 2 || b.ctype == 6 ? b.tabs[l] = [
|
|
1688
|
-
E(n, s),
|
|
1689
|
-
E(n, s + 2),
|
|
1690
|
-
E(n, s + 4)
|
|
1691
|
-
] : b.ctype == 3 && (b.tabs[l] = n[s]);
|
|
1692
|
-
else if (l == "IEND") break;
|
|
1693
|
-
s += I, d.readUint(n, s), s += 4;
|
|
1694
|
-
}
|
|
1695
|
-
var m;
|
|
1696
|
-
return B != 0 && ((m = b.frames[b.frames.length - 1]).data = H(b, O.slice(0, B), m.rect.width, m.rect.height)), b.data = H(b, D, b.width, b.height), delete b.compress, delete b.interlace, delete b.filter, b;
|
|
1697
|
-
},
|
|
1698
|
-
toRGBA8: function(i) {
|
|
1699
|
-
const n = i.width, s = i.height;
|
|
1700
|
-
if (i.tabs.acTL == null) return [P(i.data, n, s, i).buffer];
|
|
1701
|
-
const d = [];
|
|
1702
|
-
i.frames[0].data ?? (i.frames[0].data = i.data);
|
|
1703
|
-
const E = n * s * 4, x = new Uint8Array(E), b = new Uint8Array(E), D = new Uint8Array(E);
|
|
1704
|
-
for (let M = 0; M < i.frames.length; M++) {
|
|
1705
|
-
const B = i.frames[M], g = B.rect.x, R = B.rect.y, c = B.rect.width, f = B.rect.height, v = P(B.data, c, f, i);
|
|
1706
|
-
if (M != 0) for (var O = 0; O < E; O++) D[O] = x[O];
|
|
1707
|
-
if (B.blend == 0 ? _(v, c, f, x, n, s, g, R, 0) : B.blend == 1 && _(v, c, f, x, n, s, g, R, 1), d.push(x.buffer.slice(0)), B.dispose != 0) {
|
|
1708
|
-
if (B.dispose == 1) _(b, c, f, x, n, s, g, R, 0);
|
|
1709
|
-
else if (B.dispose == 2) for (O = 0; O < E; O++) x[O] = D[O];
|
|
1710
|
-
}
|
|
1711
|
-
}
|
|
1712
|
-
return d;
|
|
1713
|
-
},
|
|
1714
|
-
_paeth: a,
|
|
1715
|
-
_copyTile: _,
|
|
1716
|
-
_bin: T
|
|
1717
|
-
};
|
|
1718
|
-
})();
|
|
1719
|
-
(function() {
|
|
1720
|
-
const { _copyTile: T } = K, { _bin: P } = K, H = K._paeth;
|
|
1721
|
-
var h = {
|
|
1722
|
-
table: (function() {
|
|
1723
|
-
const c = new Uint32Array(256);
|
|
1724
|
-
for (let f = 0; f < 256; f++) {
|
|
1725
|
-
let v = f;
|
|
1726
|
-
for (let w = 0; w < 8; w++) 1 & v ? v = 3988292384 ^ v >>> 1 : v >>>= 1;
|
|
1727
|
-
c[f] = v;
|
|
1728
|
-
}
|
|
1729
|
-
return c;
|
|
1730
|
-
})(),
|
|
1731
|
-
update(c, f, v, w) {
|
|
1732
|
-
for (let y = 0; y < w; y++) c = h.table[255 & (c ^ f[v + y])] ^ c >>> 8;
|
|
1733
|
-
return c;
|
|
1734
|
-
},
|
|
1735
|
-
crc: (c, f, v) => 4294967295 ^ h.update(4294967295, c, f, v)
|
|
1736
|
-
};
|
|
1737
|
-
function e(c, f, v, w) {
|
|
1738
|
-
f[v] += c[0] * w >> 4, f[v + 1] += c[1] * w >> 4, f[v + 2] += c[2] * w >> 4, f[v + 3] += c[3] * w >> 4;
|
|
1739
|
-
}
|
|
1740
|
-
function t(c) {
|
|
1741
|
-
return Math.max(0, Math.min(255, c));
|
|
1742
|
-
}
|
|
1743
|
-
function u(c, f) {
|
|
1744
|
-
const v = c[0] - f[0], w = c[1] - f[1], y = c[2] - f[2], U = c[3] - f[3];
|
|
1745
|
-
return v * v + w * w + y * y + U * U;
|
|
1746
|
-
}
|
|
1747
|
-
function a(c, f, v, w, y, U, m) {
|
|
1748
|
-
m ??= 1;
|
|
1749
|
-
const I = w.length, l = [];
|
|
1750
|
-
for (var o = 0; o < I; o++) {
|
|
1751
|
-
const C = w[o];
|
|
1752
|
-
l.push([
|
|
1753
|
-
C >>> 0 & 255,
|
|
1754
|
-
C >>> 8 & 255,
|
|
1755
|
-
C >>> 16 & 255,
|
|
1756
|
-
C >>> 24 & 255
|
|
1757
|
-
]);
|
|
1758
|
-
}
|
|
1759
|
-
for (o = 0; o < I; o++) {
|
|
1760
|
-
let C = 4294967295;
|
|
1761
|
-
for (var L = 0, F = 0; F < I; F++) {
|
|
1762
|
-
var k = u(l[o], l[F]);
|
|
1763
|
-
F != o && k < C && (C = k, L = F);
|
|
1764
|
-
}
|
|
1765
|
-
}
|
|
1766
|
-
const X = new Uint32Array(y.buffer), N = new Int16Array(f * v * 4), q = [
|
|
1767
|
-
0,
|
|
1768
|
-
8,
|
|
1769
|
-
2,
|
|
1770
|
-
10,
|
|
1771
|
-
12,
|
|
1772
|
-
4,
|
|
1773
|
-
14,
|
|
1774
|
-
6,
|
|
1775
|
-
3,
|
|
1776
|
-
11,
|
|
1777
|
-
1,
|
|
1778
|
-
9,
|
|
1779
|
-
15,
|
|
1780
|
-
7,
|
|
1781
|
-
13,
|
|
1782
|
-
5
|
|
1783
|
-
];
|
|
1784
|
-
for (o = 0; o < q.length; o++) q[o] = 255 * ((q[o] + .5) / 16 - .5);
|
|
1785
|
-
for (let C = 0; C < v; C++) for (let Z = 0; Z < f; Z++) {
|
|
1786
|
-
var W;
|
|
1787
|
-
o = 4 * (C * f + Z), m != 2 ? W = [
|
|
1788
|
-
t(c[o] + N[o]),
|
|
1789
|
-
t(c[o + 1] + N[o + 1]),
|
|
1790
|
-
t(c[o + 2] + N[o + 2]),
|
|
1791
|
-
t(c[o + 3] + N[o + 3])
|
|
1792
|
-
] : (k = q[4 * (3 & C) + (3 & Z)], W = [
|
|
1793
|
-
t(c[o] + k),
|
|
1794
|
-
t(c[o + 1] + k),
|
|
1795
|
-
t(c[o + 2] + k),
|
|
1796
|
-
t(c[o + 3] + k)
|
|
1797
|
-
]), L = 0;
|
|
1798
|
-
let oe = 16777215;
|
|
1799
|
-
for (F = 0; F < I; F++) {
|
|
1800
|
-
const re = u(W, l[F]);
|
|
1801
|
-
re < oe && (oe = re, L = F);
|
|
1802
|
-
}
|
|
1803
|
-
const te = l[L], J = [
|
|
1804
|
-
W[0] - te[0],
|
|
1805
|
-
W[1] - te[1],
|
|
1806
|
-
W[2] - te[2],
|
|
1807
|
-
W[3] - te[3]
|
|
1808
|
-
];
|
|
1809
|
-
m == 1 && (Z != f - 1 && e(J, N, o + 4, 7), C != v - 1 && (Z != 0 && e(J, N, o + 4 * f - 4, 3), e(J, N, o + 4 * f, 5), Z != f - 1 && e(J, N, o + 4 * f + 4, 1))), U[o >> 2] = L, X[o >> 2] = w[L];
|
|
1810
|
-
}
|
|
1811
|
-
}
|
|
1812
|
-
function p(c, f, v, w, y) {
|
|
1813
|
-
y ??= {};
|
|
1814
|
-
const { crc: U } = h, m = P.writeUint, I = P.writeUshort, l = P.writeASCII;
|
|
1815
|
-
let o = 8;
|
|
1816
|
-
const L = c.frames.length > 1;
|
|
1817
|
-
let F, k = !1, X = 33 + (L ? 20 : 0);
|
|
1818
|
-
if (y.sRGB != null && (X += 13), y.pHYs != null && (X += 21), y.iCCP != null && (F = pako.deflate(y.iCCP), X += 21 + F.length + 4), c.ctype == 3) {
|
|
1819
|
-
for (var N = c.plte.length, q = 0; q < N; q++) c.plte[q] >>> 24 != 255 && (k = !0);
|
|
1820
|
-
X += 8 + 3 * N + 4 + (k ? 8 + 1 * N + 4 : 0);
|
|
1821
|
-
}
|
|
1822
|
-
for (var W = 0; W < c.frames.length; W++) L && (X += 38), X += (te = c.frames[W]).cimg.length + 12, W != 0 && (X += 4);
|
|
1823
|
-
X += 12;
|
|
1824
|
-
const C = new Uint8Array(X), Z = [
|
|
1825
|
-
137,
|
|
1826
|
-
80,
|
|
1827
|
-
78,
|
|
1828
|
-
71,
|
|
1829
|
-
13,
|
|
1830
|
-
10,
|
|
1831
|
-
26,
|
|
1832
|
-
10
|
|
1833
|
-
];
|
|
1834
|
-
for (q = 0; q < 8; q++) C[q] = Z[q];
|
|
1835
|
-
if (m(C, o, 13), o += 4, l(C, o, "IHDR"), o += 4, m(C, o, f), o += 4, m(C, o, v), o += 4, C[o] = c.depth, o++, C[o] = c.ctype, o++, C[o] = 0, o++, C[o] = 0, o++, C[o] = 0, o++, m(C, o, U(C, o - 17, 17)), o += 4, y.sRGB != null && (m(C, o, 1), o += 4, l(C, o, "sRGB"), o += 4, C[o] = y.sRGB, o++, m(C, o, U(C, o - 5, 5)), o += 4), y.iCCP != null) {
|
|
1836
|
-
const J = 13 + F.length;
|
|
1837
|
-
m(C, o, J), o += 4, l(C, o, "iCCP"), o += 4, l(C, o, "ICC profile"), o += 11, o += 2, C.set(F, o), o += F.length, m(C, o, U(C, o - (J + 4), J + 4)), o += 4;
|
|
1838
|
-
}
|
|
1839
|
-
if (y.pHYs != null && (m(C, o, 9), o += 4, l(C, o, "pHYs"), o += 4, m(C, o, y.pHYs[0]), o += 4, m(C, o, y.pHYs[1]), o += 4, C[o] = y.pHYs[2], o++, m(C, o, U(C, o - 13, 13)), o += 4), L && (m(C, o, 8), o += 4, l(C, o, "acTL"), o += 4, m(C, o, c.frames.length), o += 4, m(C, o, y.loop != null ? y.loop : 0), o += 4, m(C, o, U(C, o - 12, 12)), o += 4), c.ctype == 3) {
|
|
1840
|
-
for (m(C, o, 3 * (N = c.plte.length)), o += 4, l(C, o, "PLTE"), o += 4, q = 0; q < N; q++) {
|
|
1841
|
-
const J = 3 * q, re = c.plte[q], fe = 255 & re, ce = re >>> 8 & 255, He = re >>> 16 & 255;
|
|
1842
|
-
C[o + J + 0] = fe, C[o + J + 1] = ce, C[o + J + 2] = He;
|
|
1843
|
-
}
|
|
1844
|
-
if (o += 3 * N, m(C, o, U(C, o - 3 * N - 4, 3 * N + 4)), o += 4, k) {
|
|
1845
|
-
for (m(C, o, N), o += 4, l(C, o, "tRNS"), o += 4, q = 0; q < N; q++) C[o + q] = c.plte[q] >>> 24 & 255;
|
|
1846
|
-
o += N, m(C, o, U(C, o - N - 4, N + 4)), o += 4;
|
|
1847
|
-
}
|
|
1848
|
-
}
|
|
1849
|
-
let oe = 0;
|
|
1850
|
-
for (W = 0; W < c.frames.length; W++) {
|
|
1851
|
-
var te = c.frames[W];
|
|
1852
|
-
L && (m(C, o, 26), o += 4, l(C, o, "fcTL"), o += 4, m(C, o, oe++), o += 4, m(C, o, te.rect.width), o += 4, m(C, o, te.rect.height), o += 4, m(C, o, te.rect.x), o += 4, m(C, o, te.rect.y), o += 4, I(C, o, w[W]), o += 2, I(C, o, 1e3), o += 2, C[o] = te.dispose, o++, C[o] = te.blend, o++, m(C, o, U(C, o - 30, 30)), o += 4);
|
|
1853
|
-
const J = te.cimg;
|
|
1854
|
-
m(C, o, (N = J.length) + (W == 0 ? 0 : 4)), o += 4;
|
|
1855
|
-
const re = o;
|
|
1856
|
-
l(C, o, W == 0 ? "IDAT" : "fdAT"), o += 4, W != 0 && (m(C, o, oe++), o += 4), C.set(J, o), o += N, m(C, o, U(C, re, o - re)), o += 4;
|
|
1857
|
-
}
|
|
1858
|
-
return m(C, o, 0), o += 4, l(C, o, "IEND"), o += 4, m(C, o, U(C, o - 4, 4)), o += 4, C.buffer;
|
|
1859
|
-
}
|
|
1860
|
-
function _(c, f, v) {
|
|
1861
|
-
for (let w = 0; w < c.frames.length; w++) {
|
|
1862
|
-
const y = c.frames[w];
|
|
1863
|
-
y.rect.width;
|
|
1864
|
-
const U = y.rect.height, m = new Uint8Array(U * y.bpl + U);
|
|
1865
|
-
y.cimg = s(y.img, U, y.bpp, y.bpl, m, f, v);
|
|
1866
|
-
}
|
|
1867
|
-
}
|
|
1868
|
-
function r(c, f, v, w, y) {
|
|
1869
|
-
const U = y[0], m = y[1], I = y[2], l = y[3], o = y[4], L = y[5];
|
|
1870
|
-
let F = 6, k = 8, X = 255;
|
|
1871
|
-
for (var N = 0; N < c.length; N++) {
|
|
1872
|
-
const be = new Uint8Array(c[N]);
|
|
1873
|
-
for (var q = be.length, W = 0; W < q; W += 4) X &= be[W + 3];
|
|
1874
|
-
}
|
|
1875
|
-
const C = X != 255, Z = (function(ne, ae, he, de, we, ge) {
|
|
1876
|
-
const pe = [];
|
|
1877
|
-
for (var ie = 0; ie < ne.length; ie++) {
|
|
1878
|
-
const Ae = new Uint8Array(ne[ie]), Fe = new Uint32Array(Ae.buffer);
|
|
1879
|
-
var _e;
|
|
1880
|
-
let Te = 0, Pe = 0, Ce = ae, We = he, vt = de ? 1 : 0;
|
|
1881
|
-
if (ie != 0) {
|
|
1882
|
-
const Un = ge || de || ie == 1 || pe[ie - 2].dispose != 0 ? 1 : 2;
|
|
1883
|
-
let bt = 0, Ot = 1e9;
|
|
1884
|
-
for (let et = 0; et < Un; et++) {
|
|
1885
|
-
var Je = new Uint8Array(ne[ie - 1 - et]);
|
|
1886
|
-
const En = new Uint32Array(ne[ie - 1 - et]);
|
|
1887
|
-
let Le = ae, ke = he, Ke = -1, tt = -1;
|
|
1888
|
-
for (let Ne = 0; Ne < he; Ne++) for (let ze = 0; ze < ae; ze++) Fe[Oe = Ne * ae + ze] != En[Oe] && (ze < Le && (Le = ze), ze > Ke && (Ke = ze), Ne < ke && (ke = Ne), Ne > tt && (tt = Ne));
|
|
1889
|
-
Ke == -1 && (Le = ke = Ke = tt = 0), we && ((1 & Le) == 1 && Le--, (1 & ke) == 1 && ke--);
|
|
1890
|
-
const Lt = (Ke - Le + 1) * (tt - ke + 1);
|
|
1891
|
-
Lt < Ot && (Ot = Lt, bt = et, Te = Le, Pe = ke, Ce = Ke - Le + 1, We = tt - ke + 1);
|
|
1892
|
-
}
|
|
1893
|
-
Je = new Uint8Array(ne[ie - 1 - bt]), bt == 1 && (pe[ie - 1].dispose = 2), _e = new Uint8Array(Ce * We * 4), T(Je, ae, he, _e, Ce, We, -Te, -Pe, 0), vt = T(Ae, ae, he, _e, Ce, We, -Te, -Pe, 3) ? 1 : 0, vt == 1 ? n(Ae, ae, he, _e, {
|
|
1894
|
-
x: Te,
|
|
1895
|
-
y: Pe,
|
|
1896
|
-
width: Ce,
|
|
1897
|
-
height: We
|
|
1898
|
-
}) : T(Ae, ae, he, _e, Ce, We, -Te, -Pe, 0);
|
|
1899
|
-
} else _e = Ae.slice(0);
|
|
1900
|
-
pe.push({
|
|
1901
|
-
rect: {
|
|
1902
|
-
x: Te,
|
|
1903
|
-
y: Pe,
|
|
1904
|
-
width: Ce,
|
|
1905
|
-
height: We
|
|
1906
|
-
},
|
|
1907
|
-
img: _e,
|
|
1908
|
-
blend: vt,
|
|
1909
|
-
dispose: 0
|
|
1910
|
-
});
|
|
1911
|
-
}
|
|
1912
|
-
if (de) for (ie = 0; ie < pe.length; ie++) {
|
|
1913
|
-
if ((je = pe[ie]).blend == 1) continue;
|
|
1914
|
-
const Ae = je.rect, Fe = pe[ie - 1].rect, Te = Math.min(Ae.x, Fe.x), Pe = Math.min(Ae.y, Fe.y), Ce = {
|
|
1915
|
-
x: Te,
|
|
1916
|
-
y: Pe,
|
|
1917
|
-
width: Math.max(Ae.x + Ae.width, Fe.x + Fe.width) - Te,
|
|
1918
|
-
height: Math.max(Ae.y + Ae.height, Fe.y + Fe.height) - Pe
|
|
1919
|
-
};
|
|
1920
|
-
pe[ie - 1].dispose = 1, ie - 1 != 0 && i(ne, ae, he, pe, ie - 1, Ce, we), i(ne, ae, he, pe, ie, Ce, we);
|
|
1921
|
-
}
|
|
1922
|
-
let Ue = 0;
|
|
1923
|
-
if (ne.length != 1) for (var Oe = 0; Oe < pe.length; Oe++) {
|
|
1924
|
-
var je;
|
|
1925
|
-
Ue += (je = pe[Oe]).rect.width * je.rect.height;
|
|
1926
|
-
}
|
|
1927
|
-
return pe;
|
|
1928
|
-
})(c, f, v, U, m, I), oe = {}, te = [], J = [];
|
|
1929
|
-
if (w != 0) {
|
|
1930
|
-
const be = [];
|
|
1931
|
-
for (W = 0; W < Z.length; W++) be.push(Z[W].img.buffer);
|
|
1932
|
-
const ne = E((function(de) {
|
|
1933
|
-
let we = 0;
|
|
1934
|
-
for (var ge = 0; ge < de.length; ge++) we += de[ge].byteLength;
|
|
1935
|
-
const pe = new Uint8Array(we);
|
|
1936
|
-
let ie = 0;
|
|
1937
|
-
for (ge = 0; ge < de.length; ge++) {
|
|
1938
|
-
const _e = new Uint8Array(de[ge]), Je = _e.length;
|
|
1939
|
-
for (let Ue = 0; Ue < Je; Ue += 4) {
|
|
1940
|
-
let Oe = _e[Ue], je = _e[Ue + 1], Ae = _e[Ue + 2];
|
|
1941
|
-
const Fe = _e[Ue + 3];
|
|
1942
|
-
Fe == 0 && (Oe = je = Ae = 0), pe[ie + Ue] = Oe, pe[ie + Ue + 1] = je, pe[ie + Ue + 2] = Ae, pe[ie + Ue + 3] = Fe;
|
|
1943
|
-
}
|
|
1944
|
-
ie += Je;
|
|
1945
|
-
}
|
|
1946
|
-
return pe.buffer;
|
|
1947
|
-
})(be), w);
|
|
1948
|
-
for (W = 0; W < ne.plte.length; W++) te.push(ne.plte[W].est.rgba);
|
|
1949
|
-
let ae = 0;
|
|
1950
|
-
for (W = 0; W < Z.length; W++) {
|
|
1951
|
-
const he = (fe = Z[W]).img.length;
|
|
1952
|
-
var re = new Uint8Array(ne.inds.buffer, ae >> 2, he >> 2);
|
|
1953
|
-
J.push(re);
|
|
1954
|
-
const de = new Uint8Array(ne.abuf, ae, he);
|
|
1955
|
-
L && a(fe.img, fe.rect.width, fe.rect.height, te, de, re), fe.img.set(de), ae += he;
|
|
1956
|
-
}
|
|
1957
|
-
} else for (N = 0; N < Z.length; N++) {
|
|
1958
|
-
var fe = Z[N];
|
|
1959
|
-
const be = new Uint32Array(fe.img.buffer);
|
|
1960
|
-
var ce = fe.rect.width;
|
|
1961
|
-
for (q = be.length, re = new Uint8Array(q), J.push(re), W = 0; W < q; W++) {
|
|
1962
|
-
const ne = be[W];
|
|
1963
|
-
if (W != 0 && ne == be[W - 1]) re[W] = re[W - 1];
|
|
1964
|
-
else if (W > ce && ne == be[W - ce]) re[W] = re[W - ce];
|
|
1965
|
-
else {
|
|
1966
|
-
let ae = oe[ne];
|
|
1967
|
-
if (ae == null && (oe[ne] = ae = te.length, te.push(ne), te.length >= 300)) break;
|
|
1968
|
-
re[W] = ae;
|
|
1969
|
-
}
|
|
1970
|
-
}
|
|
1971
|
-
}
|
|
1972
|
-
const He = te.length;
|
|
1973
|
-
for (He <= 256 && o == 0 && (k = He <= 2 ? 1 : He <= 4 ? 2 : He <= 16 ? 4 : 8, k = Math.max(k, l)), N = 0; N < Z.length; N++) {
|
|
1974
|
-
(fe = Z[N]).rect.x, fe.rect.y, ce = fe.rect.width;
|
|
1975
|
-
const be = fe.rect.height;
|
|
1976
|
-
let ne = fe.img;
|
|
1977
|
-
new Uint32Array(ne.buffer);
|
|
1978
|
-
let ae = 4 * ce, he = 4;
|
|
1979
|
-
if (He <= 256 && o == 0) {
|
|
1980
|
-
ae = Math.ceil(k * ce / 8);
|
|
1981
|
-
var Se = new Uint8Array(ae * be);
|
|
1982
|
-
const de = J[N];
|
|
1983
|
-
for (let we = 0; we < be; we++) {
|
|
1984
|
-
W = we * ae;
|
|
1985
|
-
const ge = we * ce;
|
|
1986
|
-
if (k == 8) for (var se = 0; se < ce; se++) Se[W + se] = de[ge + se];
|
|
1987
|
-
else if (k == 4) for (se = 0; se < ce; se++) Se[W + (se >> 1)] |= de[ge + se] << 4 - 4 * (1 & se);
|
|
1988
|
-
else if (k == 2) for (se = 0; se < ce; se++) Se[W + (se >> 2)] |= de[ge + se] << 6 - 2 * (3 & se);
|
|
1989
|
-
else if (k == 1) for (se = 0; se < ce; se++) Se[W + (se >> 3)] |= de[ge + se] << 7 - 1 * (7 & se);
|
|
1990
|
-
}
|
|
1991
|
-
ne = Se, F = 3, he = 1;
|
|
1992
|
-
} else if (C == 0 && Z.length == 1) {
|
|
1993
|
-
Se = new Uint8Array(ce * be * 3);
|
|
1994
|
-
const de = ce * be;
|
|
1995
|
-
for (W = 0; W < de; W++) {
|
|
1996
|
-
const we = 3 * W, ge = 4 * W;
|
|
1997
|
-
Se[we] = ne[ge], Se[we + 1] = ne[ge + 1], Se[we + 2] = ne[ge + 2];
|
|
1998
|
-
}
|
|
1999
|
-
ne = Se, F = 2, he = 3, ae = 3 * ce;
|
|
2000
|
-
}
|
|
2001
|
-
fe.img = ne, fe.bpl = ae, fe.bpp = he;
|
|
2002
|
-
}
|
|
2003
|
-
return {
|
|
2004
|
-
ctype: F,
|
|
2005
|
-
depth: k,
|
|
2006
|
-
plte: te,
|
|
2007
|
-
frames: Z
|
|
2008
|
-
};
|
|
2009
|
-
}
|
|
2010
|
-
function i(c, f, v, w, y, U, m) {
|
|
2011
|
-
const I = Uint8Array, l = Uint32Array, o = new I(c[y - 1]), L = new l(c[y - 1]), F = y + 1 < c.length ? new I(c[y + 1]) : null, k = new I(c[y]), X = new l(k.buffer);
|
|
2012
|
-
let N = f, q = v, W = -1, C = -1;
|
|
2013
|
-
for (let oe = 0; oe < U.height; oe++) for (let te = 0; te < U.width; te++) {
|
|
2014
|
-
const J = U.x + te, re = U.y + oe, fe = re * f + J, ce = X[fe];
|
|
2015
|
-
ce == 0 || w[y - 1].dispose == 0 && L[fe] == ce && (F == null || F[4 * fe + 3] != 0) || (J < N && (N = J), J > W && (W = J), re < q && (q = re), re > C && (C = re));
|
|
2016
|
-
}
|
|
2017
|
-
W == -1 && (N = q = W = C = 0), m && ((1 & N) == 1 && N--, (1 & q) == 1 && q--), U = {
|
|
2018
|
-
x: N,
|
|
2019
|
-
y: q,
|
|
2020
|
-
width: W - N + 1,
|
|
2021
|
-
height: C - q + 1
|
|
2022
|
-
};
|
|
2023
|
-
const Z = w[y];
|
|
2024
|
-
Z.rect = U, Z.blend = 1, Z.img = new Uint8Array(U.width * U.height * 4), w[y - 1].dispose == 0 ? (T(o, f, v, Z.img, U.width, U.height, -U.x, -U.y, 0), n(k, f, v, Z.img, U)) : T(k, f, v, Z.img, U.width, U.height, -U.x, -U.y, 0);
|
|
2025
|
-
}
|
|
2026
|
-
function n(c, f, v, w, y) {
|
|
2027
|
-
T(c, f, v, w, y.width, y.height, -y.x, -y.y, 2);
|
|
2028
|
-
}
|
|
2029
|
-
function s(c, f, v, w, y, U, m) {
|
|
2030
|
-
const I = [];
|
|
2031
|
-
let l, o = [
|
|
2032
|
-
0,
|
|
2033
|
-
1,
|
|
2034
|
-
2,
|
|
2035
|
-
3,
|
|
2036
|
-
4
|
|
2037
|
-
];
|
|
2038
|
-
U != -1 ? o = [U] : (f * w > 5e5 || v == 1) && (o = [0]), m && (l = { level: 0 });
|
|
2039
|
-
const L = V;
|
|
2040
|
-
for (var F = 0; F < o.length; F++) {
|
|
2041
|
-
for (let N = 0; N < f; N++) d(y, c, N, w, v, o[F]);
|
|
2042
|
-
I.push(L.deflate(y, l));
|
|
2043
|
-
}
|
|
2044
|
-
let k, X = 1e9;
|
|
2045
|
-
for (F = 0; F < I.length; F++) I[F].length < X && (k = F, X = I[F].length);
|
|
2046
|
-
return I[k];
|
|
2047
|
-
}
|
|
2048
|
-
function d(c, f, v, w, y, U) {
|
|
2049
|
-
const m = v * w;
|
|
2050
|
-
let I = m + v;
|
|
2051
|
-
if (c[I] = U, I++, U == 0) if (w < 500) for (var l = 0; l < w; l++) c[I + l] = f[m + l];
|
|
2052
|
-
else c.set(new Uint8Array(f.buffer, m, w), I);
|
|
2053
|
-
else if (U == 1) {
|
|
2054
|
-
for (l = 0; l < y; l++) c[I + l] = f[m + l];
|
|
2055
|
-
for (l = y; l < w; l++) c[I + l] = f[m + l] - f[m + l - y] + 256 & 255;
|
|
2056
|
-
} else if (v == 0) {
|
|
2057
|
-
for (l = 0; l < y; l++) c[I + l] = f[m + l];
|
|
2058
|
-
if (U == 2) for (l = y; l < w; l++) c[I + l] = f[m + l];
|
|
2059
|
-
if (U == 3) for (l = y; l < w; l++) c[I + l] = f[m + l] - (f[m + l - y] >> 1) + 256 & 255;
|
|
2060
|
-
if (U == 4) for (l = y; l < w; l++) c[I + l] = f[m + l] - H(f[m + l - y], 0, 0) + 256 & 255;
|
|
2061
|
-
} else {
|
|
2062
|
-
if (U == 2) for (l = 0; l < w; l++) c[I + l] = f[m + l] + 256 - f[m + l - w] & 255;
|
|
2063
|
-
if (U == 3) {
|
|
2064
|
-
for (l = 0; l < y; l++) c[I + l] = f[m + l] + 256 - (f[m + l - w] >> 1) & 255;
|
|
2065
|
-
for (l = y; l < w; l++) c[I + l] = f[m + l] + 256 - (f[m + l - w] + f[m + l - y] >> 1) & 255;
|
|
2066
|
-
}
|
|
2067
|
-
if (U == 4) {
|
|
2068
|
-
for (l = 0; l < y; l++) c[I + l] = f[m + l] + 256 - H(0, f[m + l - w], 0) & 255;
|
|
2069
|
-
for (l = y; l < w; l++) c[I + l] = f[m + l] + 256 - H(f[m + l - y], f[m + l - w], f[m + l - y - w]) & 255;
|
|
2070
|
-
}
|
|
2071
|
-
}
|
|
2072
|
-
}
|
|
2073
|
-
function E(c, f) {
|
|
2074
|
-
const v = new Uint8Array(c), w = v.slice(0), y = new Uint32Array(w.buffer), U = x(w, f), m = U[0], I = U[1], l = v.length, o = new Uint8Array(l >> 2);
|
|
2075
|
-
let L;
|
|
2076
|
-
if (v.length < 2e7) for (var F = 0; F < l; F += 4) L = b(m, k = v[F] * (1 / 255), X = v[F + 1] * (1 / 255), N = v[F + 2] * (1 / 255), q = v[F + 3] * (1 / 255)), o[F >> 2] = L.ind, y[F >> 2] = L.est.rgba;
|
|
2077
|
-
else for (F = 0; F < l; F += 4) {
|
|
2078
|
-
var k = v[F] * .00392156862745098, X = v[F + 1] * (1 / 255), N = v[F + 2] * (1 / 255), q = v[F + 3] * (1 / 255);
|
|
2079
|
-
for (L = m; L.left;) L = D(L.est, k, X, N, q) <= 0 ? L.left : L.right;
|
|
2080
|
-
o[F >> 2] = L.ind, y[F >> 2] = L.est.rgba;
|
|
2081
|
-
}
|
|
2082
|
-
return {
|
|
2083
|
-
abuf: w.buffer,
|
|
2084
|
-
inds: o,
|
|
2085
|
-
plte: I
|
|
2086
|
-
};
|
|
2087
|
-
}
|
|
2088
|
-
function x(c, f, v) {
|
|
2089
|
-
v ??= 1e-4;
|
|
2090
|
-
const w = new Uint32Array(c.buffer), y = {
|
|
2091
|
-
i0: 0,
|
|
2092
|
-
i1: c.length,
|
|
2093
|
-
bst: null,
|
|
2094
|
-
est: null,
|
|
2095
|
-
tdst: 0,
|
|
2096
|
-
left: null,
|
|
2097
|
-
right: null
|
|
2098
|
-
};
|
|
2099
|
-
y.bst = B(c, y.i0, y.i1), y.est = g(y.bst);
|
|
2100
|
-
const U = [y];
|
|
2101
|
-
for (; U.length < f;) {
|
|
2102
|
-
let I = 0, l = 0;
|
|
2103
|
-
for (var m = 0; m < U.length; m++) U[m].est.L > I && (I = U[m].est.L, l = m);
|
|
2104
|
-
if (I < v) break;
|
|
2105
|
-
const o = U[l], L = O(c, w, o.i0, o.i1, o.est.e, o.est.eMq255);
|
|
2106
|
-
if (o.i0 >= L || o.i1 <= L) {
|
|
2107
|
-
o.est.L = 0;
|
|
2108
|
-
continue;
|
|
2109
|
-
}
|
|
2110
|
-
const F = {
|
|
2111
|
-
i0: o.i0,
|
|
2112
|
-
i1: L,
|
|
2113
|
-
bst: null,
|
|
2114
|
-
est: null,
|
|
2115
|
-
tdst: 0,
|
|
2116
|
-
left: null,
|
|
2117
|
-
right: null
|
|
2118
|
-
};
|
|
2119
|
-
F.bst = B(c, F.i0, F.i1), F.est = g(F.bst);
|
|
2120
|
-
const k = {
|
|
2121
|
-
i0: L,
|
|
2122
|
-
i1: o.i1,
|
|
2123
|
-
bst: null,
|
|
2124
|
-
est: null,
|
|
2125
|
-
tdst: 0,
|
|
2126
|
-
left: null,
|
|
2127
|
-
right: null
|
|
2128
|
-
};
|
|
2129
|
-
for (k.bst = {
|
|
2130
|
-
R: [],
|
|
2131
|
-
m: [],
|
|
2132
|
-
N: o.bst.N - F.bst.N
|
|
2133
|
-
}, m = 0; m < 16; m++) k.bst.R[m] = o.bst.R[m] - F.bst.R[m];
|
|
2134
|
-
for (m = 0; m < 4; m++) k.bst.m[m] = o.bst.m[m] - F.bst.m[m];
|
|
2135
|
-
k.est = g(k.bst), o.left = F, o.right = k, U[l] = F, U.push(k);
|
|
2136
|
-
}
|
|
2137
|
-
for (U.sort(((I, l) => l.bst.N - I.bst.N)), m = 0; m < U.length; m++) U[m].ind = m;
|
|
2138
|
-
return [y, U];
|
|
2139
|
-
}
|
|
2140
|
-
function b(c, f, v, w, y) {
|
|
2141
|
-
if (c.left == null) return c.tdst = (function(F, k, X, N, q) {
|
|
2142
|
-
const W = k - F[0], C = X - F[1], Z = N - F[2], oe = q - F[3];
|
|
2143
|
-
return W * W + C * C + Z * Z + oe * oe;
|
|
2144
|
-
})(c.est.q, f, v, w, y), c;
|
|
2145
|
-
const U = D(c.est, f, v, w, y);
|
|
2146
|
-
let m = c.left, I = c.right;
|
|
2147
|
-
U > 0 && (m = c.right, I = c.left);
|
|
2148
|
-
const l = b(m, f, v, w, y);
|
|
2149
|
-
if (l.tdst <= U * U) return l;
|
|
2150
|
-
const o = b(I, f, v, w, y);
|
|
2151
|
-
return o.tdst < l.tdst ? o : l;
|
|
2152
|
-
}
|
|
2153
|
-
function D(c, f, v, w, y) {
|
|
2154
|
-
const { e: U } = c;
|
|
2155
|
-
return U[0] * f + U[1] * v + U[2] * w + U[3] * y - c.eMq;
|
|
2156
|
-
}
|
|
2157
|
-
function O(c, f, v, w, y, U) {
|
|
2158
|
-
for (w -= 4; v < w;) {
|
|
2159
|
-
for (; M(c, v, y) <= U;) v += 4;
|
|
2160
|
-
for (; M(c, w, y) > U;) w -= 4;
|
|
2161
|
-
if (v >= w) break;
|
|
2162
|
-
const m = f[v >> 2];
|
|
2163
|
-
f[v >> 2] = f[w >> 2], f[w >> 2] = m, v += 4, w -= 4;
|
|
2164
|
-
}
|
|
2165
|
-
for (; M(c, v, y) > U;) v -= 4;
|
|
2166
|
-
return v + 4;
|
|
2167
|
-
}
|
|
2168
|
-
function M(c, f, v) {
|
|
2169
|
-
return c[f] * v[0] + c[f + 1] * v[1] + c[f + 2] * v[2] + c[f + 3] * v[3];
|
|
2170
|
-
}
|
|
2171
|
-
function B(c, f, v) {
|
|
2172
|
-
const w = [
|
|
2173
|
-
0,
|
|
2174
|
-
0,
|
|
2175
|
-
0,
|
|
2176
|
-
0,
|
|
2177
|
-
0,
|
|
2178
|
-
0,
|
|
2179
|
-
0,
|
|
2180
|
-
0,
|
|
2181
|
-
0,
|
|
2182
|
-
0,
|
|
2183
|
-
0,
|
|
2184
|
-
0,
|
|
2185
|
-
0,
|
|
2186
|
-
0,
|
|
2187
|
-
0,
|
|
2188
|
-
0
|
|
2189
|
-
], y = [
|
|
2190
|
-
0,
|
|
2191
|
-
0,
|
|
2192
|
-
0,
|
|
2193
|
-
0
|
|
2194
|
-
], U = v - f >> 2;
|
|
2195
|
-
for (let m = f; m < v; m += 4) {
|
|
2196
|
-
const I = c[m] * .00392156862745098, l = c[m + 1] * (1 / 255), o = c[m + 2] * (1 / 255), L = c[m + 3] * (1 / 255);
|
|
2197
|
-
y[0] += I, y[1] += l, y[2] += o, y[3] += L, w[0] += I * I, w[1] += I * l, w[2] += I * o, w[3] += I * L, w[5] += l * l, w[6] += l * o, w[7] += l * L, w[10] += o * o, w[11] += o * L, w[15] += L * L;
|
|
2198
|
-
}
|
|
2199
|
-
return w[4] = w[1], w[8] = w[2], w[9] = w[6], w[12] = w[3], w[13] = w[7], w[14] = w[11], {
|
|
2200
|
-
R: w,
|
|
2201
|
-
m: y,
|
|
2202
|
-
N: U
|
|
2203
|
-
};
|
|
2204
|
-
}
|
|
2205
|
-
function g(c) {
|
|
2206
|
-
const { R: f } = c, { m: v } = c, { N: w } = c, y = v[0], U = v[1], m = v[2], I = v[3], l = w == 0 ? 0 : 1 / w, o = [
|
|
2207
|
-
f[0] - y * y * l,
|
|
2208
|
-
f[1] - y * U * l,
|
|
2209
|
-
f[2] - y * m * l,
|
|
2210
|
-
f[3] - y * I * l,
|
|
2211
|
-
f[4] - U * y * l,
|
|
2212
|
-
f[5] - U * U * l,
|
|
2213
|
-
f[6] - U * m * l,
|
|
2214
|
-
f[7] - U * I * l,
|
|
2215
|
-
f[8] - m * y * l,
|
|
2216
|
-
f[9] - m * U * l,
|
|
2217
|
-
f[10] - m * m * l,
|
|
2218
|
-
f[11] - m * I * l,
|
|
2219
|
-
f[12] - I * y * l,
|
|
2220
|
-
f[13] - I * U * l,
|
|
2221
|
-
f[14] - I * m * l,
|
|
2222
|
-
f[15] - I * I * l
|
|
2223
|
-
], L = o, F = R;
|
|
2224
|
-
let k = [
|
|
2225
|
-
Math.random(),
|
|
2226
|
-
Math.random(),
|
|
2227
|
-
Math.random(),
|
|
2228
|
-
Math.random()
|
|
2229
|
-
], X = 0, N = 0;
|
|
2230
|
-
if (w != 0) for (let W = 0; W < 16 && (k = F.multVec(L, k), N = Math.sqrt(F.dot(k, k)), k = F.sml(1 / N, k), !(W != 0 && Math.abs(N - X) < 1e-9)); W++) X = N;
|
|
2231
|
-
const q = [
|
|
2232
|
-
y * l,
|
|
2233
|
-
U * l,
|
|
2234
|
-
m * l,
|
|
2235
|
-
I * l
|
|
2236
|
-
];
|
|
2237
|
-
return {
|
|
2238
|
-
Cov: o,
|
|
2239
|
-
q,
|
|
2240
|
-
e: k,
|
|
2241
|
-
L: X,
|
|
2242
|
-
eMq255: F.dot(F.sml(255, q), k),
|
|
2243
|
-
eMq: F.dot(k, q),
|
|
2244
|
-
rgba: (Math.round(255 * q[3]) << 24 | Math.round(255 * q[2]) << 16 | Math.round(255 * q[1]) << 8 | Math.round(255 * q[0]) << 0) >>> 0
|
|
2245
|
-
};
|
|
2246
|
-
}
|
|
2247
|
-
var R = {
|
|
2248
|
-
multVec: (c, f) => [
|
|
2249
|
-
c[0] * f[0] + c[1] * f[1] + c[2] * f[2] + c[3] * f[3],
|
|
2250
|
-
c[4] * f[0] + c[5] * f[1] + c[6] * f[2] + c[7] * f[3],
|
|
2251
|
-
c[8] * f[0] + c[9] * f[1] + c[10] * f[2] + c[11] * f[3],
|
|
2252
|
-
c[12] * f[0] + c[13] * f[1] + c[14] * f[2] + c[15] * f[3]
|
|
2253
|
-
],
|
|
2254
|
-
dot: (c, f) => c[0] * f[0] + c[1] * f[1] + c[2] * f[2] + c[3] * f[3],
|
|
2255
|
-
sml: (c, f) => [
|
|
2256
|
-
c * f[0],
|
|
2257
|
-
c * f[1],
|
|
2258
|
-
c * f[2],
|
|
2259
|
-
c * f[3]
|
|
2260
|
-
]
|
|
2261
|
-
};
|
|
2262
|
-
K.encode = function(f, v, w, y, U, m, I) {
|
|
2263
|
-
y ??= 0, I ??= !1;
|
|
2264
|
-
const l = r(f, v, w, y, [
|
|
2265
|
-
!1,
|
|
2266
|
-
!1,
|
|
2267
|
-
!1,
|
|
2268
|
-
0,
|
|
2269
|
-
I,
|
|
2270
|
-
!1
|
|
2271
|
-
]);
|
|
2272
|
-
return _(l, -1), p(l, v, w, U, m);
|
|
2273
|
-
}, K.encodeLL = function(f, v, w, y, U, m, I, l) {
|
|
2274
|
-
const o = {
|
|
2275
|
-
ctype: 0 + (y == 1 ? 0 : 2) + (U == 0 ? 0 : 4),
|
|
2276
|
-
depth: m,
|
|
2277
|
-
frames: []
|
|
2278
|
-
}, L = (y + U) * m, F = L * v;
|
|
2279
|
-
for (let k = 0; k < f.length; k++) o.frames.push({
|
|
2280
|
-
rect: {
|
|
2281
|
-
x: 0,
|
|
2282
|
-
y: 0,
|
|
2283
|
-
width: v,
|
|
2284
|
-
height: w
|
|
2285
|
-
},
|
|
2286
|
-
img: new Uint8Array(f[k]),
|
|
2287
|
-
blend: 0,
|
|
2288
|
-
dispose: 1,
|
|
2289
|
-
bpp: Math.ceil(L / 8),
|
|
2290
|
-
bpl: Math.ceil(F / 8)
|
|
2291
|
-
});
|
|
2292
|
-
return _(o, 0, !0), p(o, v, w, I, l);
|
|
2293
|
-
}, K.encode.compress = r, K.encode.dither = a, K.quantize = E, K.quantize.getKDtree = x, K.quantize.getNearest = b;
|
|
2294
|
-
})();
|
|
2295
|
-
const Y = {
|
|
2296
|
-
toArrayBuffer(T, P) {
|
|
2297
|
-
const H = T.width, h = T.height, e = H << 2, t = T.getContext("2d").getImageData(0, 0, H, h), u = new Uint32Array(t.data.buffer), a = (32 * H + 31) / 32 << 2, p = a * h, _ = 122 + p, r = new ArrayBuffer(_), i = new DataView(r), n = 1 << 20;
|
|
2298
|
-
let s, d, E, x, b = n, D = 0, O = 0, M = 0;
|
|
2299
|
-
function B(c) {
|
|
2300
|
-
i.setUint16(O, c, !0), O += 2;
|
|
2301
|
-
}
|
|
2302
|
-
function g(c) {
|
|
2303
|
-
i.setUint32(O, c, !0), O += 4;
|
|
2304
|
-
}
|
|
2305
|
-
function R(c) {
|
|
2306
|
-
O += c;
|
|
2307
|
-
}
|
|
2308
|
-
B(19778), g(_), R(4), g(122), g(108), g(H), g(-h >>> 0), B(1), B(32), g(3), g(p), g(2835), g(2835), R(8), g(16711680), g(65280), g(255), g(4278190080), g(1466527264), (function c() {
|
|
2309
|
-
for (; D < h && b > 0;) {
|
|
2310
|
-
for (x = 122 + D * a, s = 0; s < e;) b--, d = u[M++], E = d >>> 24, i.setUint32(x + s, d << 8 | E), s += 4;
|
|
2311
|
-
D++;
|
|
2312
|
-
}
|
|
2313
|
-
M < u.length ? (b = n, setTimeout(c, Y._dly)) : P(r);
|
|
2314
|
-
})();
|
|
2315
|
-
},
|
|
2316
|
-
toBlob(T, P) {
|
|
2317
|
-
this.toArrayBuffer(T, ((H) => {
|
|
2318
|
-
P(new Blob([H], { type: "image/bmp" }));
|
|
2319
|
-
}));
|
|
2320
|
-
},
|
|
2321
|
-
_dly: 9
|
|
2322
|
-
};
|
|
2323
|
-
var z = {
|
|
2324
|
-
CHROME: "CHROME",
|
|
2325
|
-
FIREFOX: "FIREFOX",
|
|
2326
|
-
DESKTOP_SAFARI: "DESKTOP_SAFARI",
|
|
2327
|
-
IE: "IE",
|
|
2328
|
-
IOS: "IOS",
|
|
2329
|
-
ETC: "ETC"
|
|
2330
|
-
}, ue = {
|
|
2331
|
-
[z.CHROME]: 16384,
|
|
2332
|
-
[z.FIREFOX]: 11180,
|
|
2333
|
-
[z.DESKTOP_SAFARI]: 16384,
|
|
2334
|
-
[z.IE]: 8192,
|
|
2335
|
-
[z.IOS]: 4096,
|
|
2336
|
-
[z.ETC]: 8192
|
|
2337
|
-
};
|
|
2338
|
-
const ee = typeof window < "u", Me = typeof WorkerGlobalScope < "u" && self instanceof WorkerGlobalScope, ye = ee && window.cordova && window.cordova.require && window.cordova.require("cordova/modulemapper"), Ee = (ee || Me) && (ye && ye.getOriginalSymbol(window, "File") || typeof File < "u" && File), ot = (ee || Me) && (ye && ye.getOriginalSymbol(window, "FileReader") || typeof FileReader < "u" && FileReader);
|
|
2339
|
-
function Be(T, P, H = Date.now()) {
|
|
2340
|
-
return new Promise(((h) => {
|
|
2341
|
-
const e = T.split(","), t = e[0].match(/:(.*?);/)[1], u = globalThis.atob(e[1]);
|
|
2342
|
-
let a = u.length;
|
|
2343
|
-
const p = new Uint8Array(a);
|
|
2344
|
-
for (; a--;) p[a] = u.charCodeAt(a);
|
|
2345
|
-
const _ = new Blob([p], { type: t });
|
|
2346
|
-
_.name = P, _.lastModified = H, h(_);
|
|
2347
|
-
}));
|
|
2348
|
-
}
|
|
2349
|
-
function Ze(T) {
|
|
2350
|
-
return new Promise(((P, H) => {
|
|
2351
|
-
const h = new ot();
|
|
2352
|
-
h.onload = () => P(h.result), h.onerror = (e) => H(e), h.readAsDataURL(T);
|
|
2353
|
-
}));
|
|
2354
|
-
}
|
|
2355
|
-
function qe(T) {
|
|
2356
|
-
return new Promise(((P, H) => {
|
|
2357
|
-
const h = new Image();
|
|
2358
|
-
h.onload = () => P(h), h.onerror = (e) => H(e), h.src = T;
|
|
2359
|
-
}));
|
|
2360
|
-
}
|
|
2361
|
-
function me() {
|
|
2362
|
-
if (me.cachedResult !== void 0) return me.cachedResult;
|
|
2363
|
-
let T = z.ETC;
|
|
2364
|
-
const { userAgent: P } = navigator;
|
|
2365
|
-
return /Chrom(e|ium)/i.test(P) ? T = z.CHROME : /iP(ad|od|hone)/i.test(P) && /WebKit/i.test(P) ? T = z.IOS : /Safari/i.test(P) ? T = z.DESKTOP_SAFARI : /Firefox/i.test(P) ? T = z.FIREFOX : (/MSIE/i.test(P) || document.documentMode) && (T = z.IE), me.cachedResult = T, me.cachedResult;
|
|
2366
|
-
}
|
|
2367
|
-
function Re(T, P) {
|
|
2368
|
-
const H = ue[me()];
|
|
2369
|
-
let h = T, e = P, t = h * e;
|
|
2370
|
-
const u = h > e ? e / h : h / e;
|
|
2371
|
-
for (; t > H * H;) {
|
|
2372
|
-
const a = (H + h) / 2, p = (H + e) / 2;
|
|
2373
|
-
a < p ? (e = p, h = p * u) : (e = a * u, h = a), t = h * e;
|
|
2374
|
-
}
|
|
2375
|
-
return {
|
|
2376
|
-
width: h,
|
|
2377
|
-
height: e
|
|
2378
|
-
};
|
|
2379
|
-
}
|
|
2380
|
-
function De(T, P) {
|
|
2381
|
-
let H, h;
|
|
2382
|
-
try {
|
|
2383
|
-
if (H = new OffscreenCanvas(T, P), h = H.getContext("2d"), h === null) throw new Error("getContext of OffscreenCanvas returns null");
|
|
2384
|
-
} catch {
|
|
2385
|
-
H = document.createElement("canvas"), h = H.getContext("2d");
|
|
2386
|
-
}
|
|
2387
|
-
return H.width = T, H.height = P, [H, h];
|
|
2388
|
-
}
|
|
2389
|
-
function $e(T, P) {
|
|
2390
|
-
const { width: H, height: h } = Re(T.width, T.height), [e, t] = De(H, h);
|
|
2391
|
-
return P && /jpe?g/.test(P) && (t.fillStyle = "white", t.fillRect(0, 0, e.width, e.height)), t.drawImage(T, 0, 0, e.width, e.height), e;
|
|
2392
|
-
}
|
|
2393
|
-
function Ye() {
|
|
2394
|
-
return Ye.cachedResult !== void 0 || (Ye.cachedResult = [
|
|
2395
|
-
"iPad Simulator",
|
|
2396
|
-
"iPhone Simulator",
|
|
2397
|
-
"iPod Simulator",
|
|
2398
|
-
"iPad",
|
|
2399
|
-
"iPhone",
|
|
2400
|
-
"iPod"
|
|
2401
|
-
].includes(navigator.platform) || navigator.userAgent.includes("Mac") && typeof document < "u" && "ontouchend" in document), Ye.cachedResult;
|
|
2402
|
-
}
|
|
2403
|
-
function at(T, P = {}) {
|
|
2404
|
-
return new Promise((function(H, h) {
|
|
2405
|
-
let e, t;
|
|
2406
|
-
var u = function() {
|
|
2407
|
-
try {
|
|
2408
|
-
return t = $e(e, P.fileType || T.type), H([e, t]);
|
|
2409
|
-
} catch (p) {
|
|
2410
|
-
return h(p);
|
|
2411
|
-
}
|
|
2412
|
-
}, a = function(p) {
|
|
2413
|
-
try {
|
|
2414
|
-
var _ = function(r) {
|
|
2415
|
-
try {
|
|
2416
|
-
throw r;
|
|
2417
|
-
} catch (i) {
|
|
2418
|
-
return h(i);
|
|
2419
|
-
}
|
|
2420
|
-
};
|
|
2421
|
-
try {
|
|
2422
|
-
let r;
|
|
2423
|
-
return Ze(T).then((function(i) {
|
|
2424
|
-
try {
|
|
2425
|
-
return r = i, qe(r).then((function(n) {
|
|
2426
|
-
try {
|
|
2427
|
-
return e = n, (function() {
|
|
2428
|
-
try {
|
|
2429
|
-
return u();
|
|
2430
|
-
} catch (s) {
|
|
2431
|
-
return h(s);
|
|
2432
|
-
}
|
|
2433
|
-
})();
|
|
2434
|
-
} catch (s) {
|
|
2435
|
-
return _(s);
|
|
2436
|
-
}
|
|
2437
|
-
}), _);
|
|
2438
|
-
} catch (n) {
|
|
2439
|
-
return _(n);
|
|
2440
|
-
}
|
|
2441
|
-
}), _);
|
|
2442
|
-
} catch (r) {
|
|
2443
|
-
_(r);
|
|
2444
|
-
}
|
|
2445
|
-
} catch (r) {
|
|
2446
|
-
return h(r);
|
|
2447
|
-
}
|
|
2448
|
-
};
|
|
2449
|
-
try {
|
|
2450
|
-
if (Ye() || [z.DESKTOP_SAFARI, z.MOBILE_SAFARI].includes(me())) throw new Error("Skip createImageBitmap on IOS and Safari");
|
|
2451
|
-
return createImageBitmap(T).then((function(p) {
|
|
2452
|
-
try {
|
|
2453
|
-
return e = p, u();
|
|
2454
|
-
} catch {
|
|
2455
|
-
return a();
|
|
2456
|
-
}
|
|
2457
|
-
}), a);
|
|
2458
|
-
} catch {
|
|
2459
|
-
a();
|
|
2460
|
-
}
|
|
2461
|
-
}));
|
|
2462
|
-
}
|
|
2463
|
-
function st(T, P, H, h, e = 1) {
|
|
2464
|
-
return new Promise((function(t, u) {
|
|
2465
|
-
let a;
|
|
2466
|
-
if (P === "image/png") {
|
|
2467
|
-
let _, r, i;
|
|
2468
|
-
return _ = T.getContext("2d"), {data: r} = _.getImageData(0, 0, T.width, T.height), i = K.encode([r.buffer], T.width, T.height, 4096 * e), a = new Blob([i], { type: P }), a.name = H, a.lastModified = h, p.call(this);
|
|
2469
|
-
}
|
|
2470
|
-
{
|
|
2471
|
-
let _ = function() {
|
|
2472
|
-
return p.call(this);
|
|
2473
|
-
};
|
|
2474
|
-
if (P === "image/bmp") return new Promise(((r) => Y.toBlob(T, r))).then(function(r) {
|
|
2475
|
-
try {
|
|
2476
|
-
return a = r, a.name = H, a.lastModified = h, _.call(this);
|
|
2477
|
-
} catch (i) {
|
|
2478
|
-
return u(i);
|
|
2479
|
-
}
|
|
2480
|
-
}.bind(this), u);
|
|
2481
|
-
{
|
|
2482
|
-
let r = function() {
|
|
2483
|
-
return _.call(this);
|
|
2484
|
-
};
|
|
2485
|
-
if (typeof OffscreenCanvas == "function" && T instanceof OffscreenCanvas) return T.convertToBlob({
|
|
2486
|
-
type: P,
|
|
2487
|
-
quality: e
|
|
2488
|
-
}).then(function(i) {
|
|
2489
|
-
try {
|
|
2490
|
-
return a = i, a.name = H, a.lastModified = h, r.call(this);
|
|
2491
|
-
} catch (n) {
|
|
2492
|
-
return u(n);
|
|
2493
|
-
}
|
|
2494
|
-
}.bind(this), u);
|
|
2495
|
-
{
|
|
2496
|
-
let i;
|
|
2497
|
-
return i = T.toDataURL(P, e), Be(i, H, h).then(function(n) {
|
|
2498
|
-
try {
|
|
2499
|
-
return a = n, r.call(this);
|
|
2500
|
-
} catch (s) {
|
|
2501
|
-
return u(s);
|
|
2502
|
-
}
|
|
2503
|
-
}.bind(this), u);
|
|
2504
|
-
}
|
|
2505
|
-
}
|
|
2506
|
-
}
|
|
2507
|
-
function p() {
|
|
2508
|
-
return t(a);
|
|
2509
|
-
}
|
|
2510
|
-
}));
|
|
2511
|
-
}
|
|
2512
|
-
function xe(T) {
|
|
2513
|
-
T.width = 0, T.height = 0;
|
|
2514
|
-
}
|
|
2515
|
-
function Xe() {
|
|
2516
|
-
return new Promise((function(T, P) {
|
|
2517
|
-
let H, h, e, t;
|
|
2518
|
-
return Xe.cachedResult !== void 0 ? T(Xe.cachedResult) : Be("data:image/jpeg;base64,/9j/4QAiRXhpZgAATU0AKgAAAAgAAQESAAMAAAABAAYAAAAAAAD/2wCEAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAf/AABEIAAEAAgMBEQACEQEDEQH/xABKAAEAAAAAAAAAAAAAAAAAAAALEAEAAAAAAAAAAAAAAAAAAAAAAQEAAAAAAAAAAAAAAAAAAAAAEQEAAAAAAAAAAAAAAAAAAAAA/9oADAMBAAIRAxEAPwA/8H//2Q==", "test.jpg", Date.now()).then((function(u) {
|
|
2519
|
-
try {
|
|
2520
|
-
return H = u, at(H).then((function(a) {
|
|
2521
|
-
try {
|
|
2522
|
-
return h = a[1], st(h, H.type, H.name, H.lastModified).then((function(p) {
|
|
2523
|
-
try {
|
|
2524
|
-
return e = p, xe(h), at(e).then((function(_) {
|
|
2525
|
-
try {
|
|
2526
|
-
return t = _[0], Xe.cachedResult = t.width === 1 && t.height === 2, T(Xe.cachedResult);
|
|
2527
|
-
} catch (r) {
|
|
2528
|
-
return P(r);
|
|
2529
|
-
}
|
|
2530
|
-
}), P);
|
|
2531
|
-
} catch (_) {
|
|
2532
|
-
return P(_);
|
|
2533
|
-
}
|
|
2534
|
-
}), P);
|
|
2535
|
-
} catch (p) {
|
|
2536
|
-
return P(p);
|
|
2537
|
-
}
|
|
2538
|
-
}), P);
|
|
2539
|
-
} catch (a) {
|
|
2540
|
-
return P(a);
|
|
2541
|
-
}
|
|
2542
|
-
}), P);
|
|
2543
|
-
}));
|
|
2544
|
-
}
|
|
2545
|
-
function Ct(T) {
|
|
2546
|
-
return new Promise(((P, H) => {
|
|
2547
|
-
const h = new ot();
|
|
2548
|
-
h.onload = (e) => {
|
|
2549
|
-
const t = new DataView(e.target.result);
|
|
2550
|
-
if (t.getUint16(0, !1) != 65496) return P(-2);
|
|
2551
|
-
const u = t.byteLength;
|
|
2552
|
-
let a = 2;
|
|
2553
|
-
for (; a < u;) {
|
|
2554
|
-
if (t.getUint16(a + 2, !1) <= 8) return P(-1);
|
|
2555
|
-
const p = t.getUint16(a, !1);
|
|
2556
|
-
if (a += 2, p == 65505) {
|
|
2557
|
-
if (t.getUint32(a += 2, !1) != 1165519206) return P(-1);
|
|
2558
|
-
const _ = t.getUint16(a += 6, !1) == 18761;
|
|
2559
|
-
a += t.getUint32(a + 4, _);
|
|
2560
|
-
const r = t.getUint16(a, _);
|
|
2561
|
-
a += 2;
|
|
2562
|
-
for (let i = 0; i < r; i++) if (t.getUint16(a + 12 * i, _) == 274) return P(t.getUint16(a + 12 * i + 8, _));
|
|
2563
|
-
} else {
|
|
2564
|
-
if ((65280 & p) != 65280) break;
|
|
2565
|
-
a += t.getUint16(a, !1);
|
|
2566
|
-
}
|
|
2567
|
-
}
|
|
2568
|
-
return P(-1);
|
|
2569
|
-
}, h.onerror = (e) => H(e), h.readAsArrayBuffer(T);
|
|
2570
|
-
}));
|
|
2571
|
-
}
|
|
2572
|
-
function Rt(T, P) {
|
|
2573
|
-
const { width: H } = T, { height: h } = T, { maxWidthOrHeight: e } = P;
|
|
2574
|
-
let t, u = T;
|
|
2575
|
-
return isFinite(e) && (H > e || h > e) && ([u, t] = De(H, h), H > h ? (u.width = e, u.height = h / H * e) : (u.width = H / h * e, u.height = e), t.drawImage(T, 0, 0, u.width, u.height), xe(T)), u;
|
|
2576
|
-
}
|
|
2577
|
-
function Tt(T, P) {
|
|
2578
|
-
const { width: H } = T, { height: h } = T, [e, t] = De(H, h);
|
|
2579
|
-
switch (P > 4 && P < 9 ? (e.width = h, e.height = H) : (e.width = H, e.height = h), P) {
|
|
2580
|
-
case 2:
|
|
2581
|
-
t.transform(-1, 0, 0, 1, H, 0);
|
|
2582
|
-
break;
|
|
2583
|
-
case 3:
|
|
2584
|
-
t.transform(-1, 0, 0, -1, H, h);
|
|
2585
|
-
break;
|
|
2586
|
-
case 4:
|
|
2587
|
-
t.transform(1, 0, 0, -1, 0, h);
|
|
2588
|
-
break;
|
|
2589
|
-
case 5:
|
|
2590
|
-
t.transform(0, 1, 1, 0, 0, 0);
|
|
2591
|
-
break;
|
|
2592
|
-
case 6:
|
|
2593
|
-
t.transform(0, 1, -1, 0, h, 0);
|
|
2594
|
-
break;
|
|
2595
|
-
case 7:
|
|
2596
|
-
t.transform(0, -1, -1, 0, h, H);
|
|
2597
|
-
break;
|
|
2598
|
-
case 8: t.transform(0, -1, 1, 0, 0, H);
|
|
2599
|
-
}
|
|
2600
|
-
return t.drawImage(T, 0, 0, H, h), xe(T), e;
|
|
2601
|
-
}
|
|
2602
|
-
function Pt(T, P, H = 0) {
|
|
2603
|
-
return new Promise((function(h, e) {
|
|
2604
|
-
let t, u, a, p, _, r, i, n, s, d, E, x, b, D, O, M, B, g, R, c;
|
|
2605
|
-
function f(w = 5) {
|
|
2606
|
-
if (P.signal && P.signal.aborted) throw P.signal.reason;
|
|
2607
|
-
t += w, P.onProgress(Math.min(t, 100));
|
|
2608
|
-
}
|
|
2609
|
-
function v(w) {
|
|
2610
|
-
if (P.signal && P.signal.aborted) throw P.signal.reason;
|
|
2611
|
-
t = Math.min(Math.max(w, t), 100), P.onProgress(t);
|
|
2612
|
-
}
|
|
2613
|
-
return t = H, u = P.maxIteration || 10, a = 1024 * P.maxSizeMB * 1024, f(), at(T, P).then(function(w) {
|
|
2614
|
-
try {
|
|
2615
|
-
return [, p] = w, f(), _ = Rt(p, P), f(), new Promise((function(y, U) {
|
|
2616
|
-
var m;
|
|
2617
|
-
if (!(m = P.exifOrientation)) return Ct(T).then(function(l) {
|
|
2618
|
-
try {
|
|
2619
|
-
return m = l, I.call(this);
|
|
2620
|
-
} catch (o) {
|
|
2621
|
-
return U(o);
|
|
2622
|
-
}
|
|
2623
|
-
}.bind(this), U);
|
|
2624
|
-
function I() {
|
|
2625
|
-
return y(m);
|
|
2626
|
-
}
|
|
2627
|
-
return I.call(this);
|
|
2628
|
-
})).then(function(y) {
|
|
2629
|
-
try {
|
|
2630
|
-
return r = y, f(), Xe().then(function(U) {
|
|
2631
|
-
try {
|
|
2632
|
-
return i = U ? _ : Tt(_, r), f(), n = P.initialQuality || 1, s = P.fileType || T.type, st(i, s, T.name, T.lastModified, n).then(function(m) {
|
|
2633
|
-
try {
|
|
2634
|
-
{
|
|
2635
|
-
let l = function() {
|
|
2636
|
-
if (u-- && (O > a || O > b)) {
|
|
2637
|
-
let L, F;
|
|
2638
|
-
return L = c ? .95 * R.width : R.width, F = c ? .95 * R.height : R.height, [B, g] = De(L, F), g.drawImage(R, 0, 0, L, F), n *= s === "image/png" ? .85 : .95, st(B, s, T.name, T.lastModified, n).then((function(k) {
|
|
2639
|
-
try {
|
|
2640
|
-
return M = k, xe(R), R = B, O = M.size, v(Math.min(99, Math.floor((D - O) / (D - a) * 100))), l;
|
|
2641
|
-
} catch (X) {
|
|
2642
|
-
return e(X);
|
|
2643
|
-
}
|
|
2644
|
-
}), e);
|
|
2645
|
-
}
|
|
2646
|
-
return [1];
|
|
2647
|
-
}, o = function() {
|
|
2648
|
-
return xe(R), xe(B), xe(_), xe(i), xe(p), v(100), h(M);
|
|
2649
|
-
};
|
|
2650
|
-
if (d = m, f(), E = d.size > a, x = d.size > T.size, !E && !x) return v(100), h(d);
|
|
2651
|
-
var I;
|
|
2652
|
-
return b = T.size, D = d.size, O = D, R = i, c = !P.alwaysKeepResolution && E, (I = function(L) {
|
|
2653
|
-
for (; L;) {
|
|
2654
|
-
if (L.then) return void L.then(I, e);
|
|
2655
|
-
try {
|
|
2656
|
-
if (L.pop) {
|
|
2657
|
-
if (L.length) return L.pop() ? o.call(this) : L;
|
|
2658
|
-
L = l;
|
|
2659
|
-
} else L = L.call(this);
|
|
2660
|
-
} catch (F) {
|
|
2661
|
-
return e(F);
|
|
2662
|
-
}
|
|
2663
|
-
}
|
|
2664
|
-
}.bind(this))(l);
|
|
2665
|
-
}
|
|
2666
|
-
} catch (l) {
|
|
2667
|
-
return e(l);
|
|
2668
|
-
}
|
|
2669
|
-
}.bind(this), e);
|
|
2670
|
-
} catch (m) {
|
|
2671
|
-
return e(m);
|
|
2672
|
-
}
|
|
2673
|
-
}.bind(this), e);
|
|
2674
|
-
} catch (U) {
|
|
2675
|
-
return e(U);
|
|
2676
|
-
}
|
|
2677
|
-
}.bind(this), e);
|
|
2678
|
-
} catch (y) {
|
|
2679
|
-
return e(y);
|
|
2680
|
-
}
|
|
2681
|
-
}.bind(this), e);
|
|
2682
|
-
}));
|
|
2683
|
-
}
|
|
2684
|
-
const An = `
|
|
2685
|
-
let scriptImported = false
|
|
2686
|
-
self.addEventListener('message', async (e) => {
|
|
2687
|
-
const { file, id, imageCompressionLibUrl, options } = e.data
|
|
2688
|
-
options.onProgress = (progress) => self.postMessage({ progress, id })
|
|
2689
|
-
try {
|
|
2690
|
-
if (!scriptImported) {
|
|
2691
|
-
// console.log('[worker] importScripts', imageCompressionLibUrl)
|
|
2692
|
-
self.importScripts(imageCompressionLibUrl)
|
|
2693
|
-
scriptImported = true
|
|
2694
|
-
}
|
|
2695
|
-
// console.log('[worker] self', self)
|
|
2696
|
-
const compressedFile = await imageCompression(file, options)
|
|
2697
|
-
self.postMessage({ file: compressedFile, id })
|
|
2698
|
-
} catch (e) {
|
|
2699
|
-
// console.error('[worker] error', e)
|
|
2700
|
-
self.postMessage({ error: e.message + '\\n' + e.stack, id })
|
|
2701
|
-
}
|
|
2702
|
-
})
|
|
2703
|
-
`;
|
|
2704
|
-
let mt;
|
|
2705
|
-
function _n(T, P) {
|
|
2706
|
-
return new Promise(((H, h) => {
|
|
2707
|
-
mt || (mt = (function(u) {
|
|
2708
|
-
const a = [];
|
|
2709
|
-
return typeof u == "function" ? a.push(`(${u})()`) : a.push(u), URL.createObjectURL(new Blob(a));
|
|
2710
|
-
})(An));
|
|
2711
|
-
const e = new Worker(mt);
|
|
2712
|
-
e.addEventListener("message", (function(u) {
|
|
2713
|
-
if (P.signal && P.signal.aborted) e.terminate();
|
|
2714
|
-
else if (u.data.progress === void 0) {
|
|
2715
|
-
if (u.data.error) return h(new Error(u.data.error)), void e.terminate();
|
|
2716
|
-
H(u.data.file), e.terminate();
|
|
2717
|
-
} else P.onProgress(u.data.progress);
|
|
2718
|
-
})), e.addEventListener("error", h), P.signal && P.signal.addEventListener("abort", (() => {
|
|
2719
|
-
h(P.signal.reason), e.terminate();
|
|
2720
|
-
})), e.postMessage({
|
|
2721
|
-
file: T,
|
|
2722
|
-
imageCompressionLibUrl: P.libURL,
|
|
2723
|
-
options: {
|
|
2724
|
-
...P,
|
|
2725
|
-
onProgress: void 0,
|
|
2726
|
-
signal: void 0
|
|
2727
|
-
}
|
|
2728
|
-
});
|
|
2729
|
-
}));
|
|
2730
|
-
}
|
|
2731
|
-
function ve(T, P) {
|
|
2732
|
-
return new Promise((function(H, h) {
|
|
2733
|
-
let e, t, u, a, p, _;
|
|
2734
|
-
if (e = { ...P }, u = 0, {onProgress: a} = e, e.maxSizeMB = e.maxSizeMB || Number.POSITIVE_INFINITY, p = typeof e.useWebWorker != "boolean" || e.useWebWorker, delete e.useWebWorker, e.onProgress = (s) => {
|
|
2735
|
-
u = s, typeof a == "function" && a(u);
|
|
2736
|
-
}, !(T instanceof Blob || T instanceof Ee)) return h(new Error("The file given is not an instance of Blob or File"));
|
|
2737
|
-
if (!/^image/.test(T.type)) return h(new Error("The file given is not an image"));
|
|
2738
|
-
if (_ = typeof WorkerGlobalScope < "u" && self instanceof WorkerGlobalScope, !p || typeof Worker != "function" || _) return Pt(T, e).then(function(s) {
|
|
2739
|
-
try {
|
|
2740
|
-
return t = s, n.call(this);
|
|
2741
|
-
} catch (d) {
|
|
2742
|
-
return h(d);
|
|
2743
|
-
}
|
|
2744
|
-
}.bind(this), h);
|
|
2745
|
-
var r = function() {
|
|
2746
|
-
try {
|
|
2747
|
-
return n.call(this);
|
|
2748
|
-
} catch (s) {
|
|
2749
|
-
return h(s);
|
|
2750
|
-
}
|
|
2751
|
-
}.bind(this), i = function(s) {
|
|
2752
|
-
try {
|
|
2753
|
-
return Pt(T, e).then((function(d) {
|
|
2754
|
-
try {
|
|
2755
|
-
return t = d, r();
|
|
2756
|
-
} catch (E) {
|
|
2757
|
-
return h(E);
|
|
2758
|
-
}
|
|
2759
|
-
}), h);
|
|
2760
|
-
} catch (d) {
|
|
2761
|
-
return h(d);
|
|
2762
|
-
}
|
|
2763
|
-
};
|
|
2764
|
-
try {
|
|
2765
|
-
return e.libURL = e.libURL || "https://cdn.jsdelivr.net/npm/browser-image-compression@2.0.2/dist/browser-image-compression.js", _n(T, e).then((function(s) {
|
|
2766
|
-
try {
|
|
2767
|
-
return t = s, r();
|
|
2768
|
-
} catch {
|
|
2769
|
-
return i();
|
|
2770
|
-
}
|
|
2771
|
-
}), i);
|
|
2772
|
-
} catch {
|
|
2773
|
-
i();
|
|
2774
|
-
}
|
|
2775
|
-
function n() {
|
|
2776
|
-
try {
|
|
2777
|
-
t.name = T.name, t.lastModified = T.lastModified;
|
|
2778
|
-
} catch {}
|
|
2779
|
-
try {
|
|
2780
|
-
e.preserveExif && T.type === "image/jpeg" && (!e.fileType || e.fileType && e.fileType === T.type) && (t = G(T, t));
|
|
2781
|
-
} catch {}
|
|
2782
|
-
return H(t);
|
|
2783
|
-
}
|
|
2784
|
-
}));
|
|
2785
|
-
}
|
|
2786
|
-
return ve.getDataUrlFromFile = Ze, ve.getFilefromDataUrl = Be, ve.loadImage = qe, ve.drawImageInCanvas = $e, ve.drawFileInCanvas = at, ve.canvasToFile = st, ve.getExifOrientation = Ct, ve.handleMaxWidthOrHeight = Rt, ve.followExifOrientation = Tt, ve.cleanupCanvasMemory = xe, ve.isAutoOrientationInBrowser = Xe, ve.approximateBelowMaximumCanvasSizeOfBrowser = Re, ve.copyExifWithoutOrientation = G, ve.getBrowserName = me, ve.version = "2.0.2", ve;
|
|
2787
|
-
}));
|
|
2788
|
-
})), Jt = Ve.__toESM(Yt()), gt = (A) => {
|
|
2789
|
-
if (!A) return "image/png";
|
|
2790
|
-
const S = A.toLowerCase();
|
|
2791
|
-
return S.includes("jpeg") || S.includes("jpg") || S.includes("pjpeg") ? "image/jpeg" : S.includes("png") ? "image/png" : S.includes("gif") ? "image/gif" : S.includes("webp") ? "image/webp" : S.includes("svg") ? "image/svg+xml" : "image/png";
|
|
2792
|
-
}, Ut = (A) => {
|
|
2793
|
-
const S = gt(A).split("/")[1];
|
|
2794
|
-
return S === "svg+xml" ? "svg" : S || "png";
|
|
2795
|
-
};
|
|
2796
|
-
function nt(A) {
|
|
2797
|
-
switch (A.trim().split(".").pop()?.toLowerCase()) {
|
|
2798
|
-
case "svg": return "image/svg+xml";
|
|
2799
|
-
case "png": return "image/png";
|
|
2800
|
-
case "jpg":
|
|
2801
|
-
case "jpeg": return "image/jpeg";
|
|
2802
|
-
case "gif": return "image/gif";
|
|
2803
|
-
case "webp": return "image/webp";
|
|
2804
|
-
default: return;
|
|
2805
|
-
}
|
|
2806
|
-
}
|
|
2807
|
-
function Et(A) {
|
|
2808
|
-
if (A.type?.startsWith?.("image/")) return !0;
|
|
2809
|
-
const S = (A.name ?? "").trim();
|
|
2810
|
-
if (nt(S)) return !0;
|
|
2811
|
-
const j = (A.type ?? "").toLowerCase();
|
|
2812
|
-
return j.includes("svg") ? !0 : j === "text/xml" || j === "application/xml" || j === "text/plain" ? S.toLowerCase().endsWith(".svg") : !1;
|
|
2813
|
-
}
|
|
2814
|
-
var rt = {
|
|
2815
|
-
MAX_SIZE_MB: .48,
|
|
2816
|
-
MAX_WIDTH_OR_HEIGHT: 2e3,
|
|
2817
|
-
QUALITY: .8
|
|
2818
|
-
}, en = ["gif", "svg"];
|
|
2819
|
-
function tn(A) {
|
|
2820
|
-
return !en.includes(A);
|
|
2821
|
-
}
|
|
2822
|
-
function Ft(A, S) {
|
|
2823
|
-
if (A?.compressMaxSize === 0 || A?.compressMaxWidthOrHeight === 0) return !1;
|
|
2824
|
-
const j = S?.trim() ?? "";
|
|
2825
|
-
return j.startsWith("image/") && j !== "image/gif";
|
|
2826
|
-
}
|
|
2827
|
-
function It(A) {
|
|
2828
|
-
return {
|
|
2829
|
-
maxSizeMB: A?.compressMaxSize ?? rt.MAX_SIZE_MB,
|
|
2830
|
-
maxWidthOrHeight: A?.compressMaxWidthOrHeight ?? rt.MAX_WIDTH_OR_HEIGHT
|
|
2831
|
-
};
|
|
2832
|
-
}
|
|
2833
|
-
function Mt(A) {
|
|
2834
|
-
if (!A) return null;
|
|
2835
|
-
const S = A.trim();
|
|
2836
|
-
if (S.endsWith("%")) return null;
|
|
2837
|
-
const j = parseFloat(S.replace(/px$/i, ""));
|
|
2838
|
-
return Number.isFinite(j) && j > 0 ? j : null;
|
|
2839
|
-
}
|
|
2840
|
-
function nn(A) {
|
|
2841
|
-
const S = A.match(/<\s*svg\b[\s\S]*?>/i)?.[0] ?? "", j = S.match(/\bwidth\s*=\s*["']([^"']*)["']/i)?.[1], G = S.match(/\bheight\s*=\s*["']([^"']*)["']/i)?.[1], $ = Mt(j), Q = Mt(G);
|
|
2842
|
-
if ($ != null && Q != null) return {
|
|
2843
|
-
width: $,
|
|
2844
|
-
height: Q
|
|
2845
|
-
};
|
|
2846
|
-
const V = A.match(/viewBox\s*=\s*["']([^"']+)["']/i)?.[1];
|
|
2847
|
-
if (V) {
|
|
2848
|
-
const K = V.trim().split(/[\s,]+/);
|
|
2849
|
-
if (K.length === 4) {
|
|
2850
|
-
const Y = parseFloat(K[2]), z = parseFloat(K[3]);
|
|
2851
|
-
if (Number.isFinite(Y) && Number.isFinite(z) && Y > 0 && z > 0) return {
|
|
2852
|
-
width: Y,
|
|
2853
|
-
height: z
|
|
2854
|
-
};
|
|
2855
|
-
}
|
|
2856
|
-
}
|
|
2857
|
-
return $ != null ? {
|
|
2858
|
-
width: $,
|
|
2859
|
-
height: $
|
|
2860
|
-
} : Q != null ? {
|
|
2861
|
-
width: Q,
|
|
2862
|
-
height: Q
|
|
2863
|
-
} : {
|
|
2864
|
-
width: 300,
|
|
2865
|
-
height: 300
|
|
2866
|
-
};
|
|
2867
|
-
}
|
|
2868
|
-
function rn(A, S = 2, j = 4096) {
|
|
2869
|
-
const { width: G, height: $ } = nn(A);
|
|
2870
|
-
let Q = Math.max(1, Math.round(G * S)), V = Math.max(1, Math.round($ * S));
|
|
2871
|
-
const K = Math.max(64, j), Y = Math.max(Q, V);
|
|
2872
|
-
if (Y > K) {
|
|
2873
|
-
const z = K / Y;
|
|
2874
|
-
Q = Math.max(1, Math.round(Q * z)), V = Math.max(1, Math.round(V * z));
|
|
2875
|
-
}
|
|
2876
|
-
return {
|
|
2877
|
-
width: Q,
|
|
2878
|
-
height: V
|
|
2879
|
-
};
|
|
2880
|
-
}
|
|
2881
|
-
function on(A) {
|
|
2882
|
-
return new Promise((S, j) => {
|
|
2883
|
-
A.toBlob((G) => {
|
|
2884
|
-
G ? S(G) : j(new Error("canvas.toBlob returned null"));
|
|
2885
|
-
}, "image/png");
|
|
2886
|
-
});
|
|
2887
|
-
}
|
|
2888
|
-
async function an(A, S, j) {
|
|
2889
|
-
const G = new Blob([A], { type: "image/svg+xml;charset=utf-8" }), $ = URL.createObjectURL(G);
|
|
2890
|
-
try {
|
|
2891
|
-
const Q = new Image();
|
|
2892
|
-
await new Promise((ue, ee) => {
|
|
2893
|
-
Q.onload = () => ue(), Q.onerror = () => ee(new Error("Failed to load SVG image")), Q.src = $;
|
|
2894
|
-
});
|
|
2895
|
-
const V = document.createElement("canvas"), K = Math.max(1, Math.round(S)), Y = Math.max(1, Math.round(j));
|
|
2896
|
-
V.width = K, V.height = Y;
|
|
2897
|
-
const z = V.getContext("2d");
|
|
2898
|
-
if (!z) throw new Error("Canvas 2D context is not available");
|
|
2899
|
-
return z.clearRect(0, 0, K, Y), z.drawImage(Q, 0, 0, K, Y), on(V);
|
|
2900
|
-
} finally {
|
|
2901
|
-
URL.revokeObjectURL($);
|
|
2902
|
-
}
|
|
2903
|
-
}
|
|
2904
|
-
var sn = 24e3;
|
|
2905
|
-
async function fn(A, S = sn) {
|
|
2906
|
-
const j = Math.min(S, Math.max(0, A.size));
|
|
2907
|
-
return A.slice(0, j).text();
|
|
2908
|
-
}
|
|
2909
|
-
function cn(A) {
|
|
2910
|
-
const S = A.trimStart().replace(/^\uFEFF/, "");
|
|
2911
|
-
return S.startsWith("<") ? /<\s*svg[\s>/]/i.test(S) : !1;
|
|
2912
|
-
}
|
|
2913
|
-
async function ln(A, S = {}) {
|
|
2914
|
-
const j = S.pixelScale ?? 2, G = S.maxLongEdge ?? 4096, $ = await A.text(), { width: Q, height: V } = rn($, j, G), K = await an($, Q, V), Y = S.outputFileName ?? A.name, z = /\.svg$/i.test(Y) ? Y.replace(/\.svg$/i, ".png") : `${Y}.png`;
|
|
2915
|
-
return new File([K], z, {
|
|
2916
|
-
type: "image/png",
|
|
2917
|
-
lastModified: A.lastModified
|
|
2918
|
-
});
|
|
2919
|
-
}
|
|
2920
|
-
function it(A, S, j, G) {
|
|
2921
|
-
return new File([A], S, {
|
|
2922
|
-
type: j,
|
|
2923
|
-
lastModified: G
|
|
2924
|
-
});
|
|
2925
|
-
}
|
|
2926
|
-
function pt(A, S) {
|
|
2927
|
-
return !S || S === A.name ? A : it(A, S, A.type, A.lastModified);
|
|
2928
|
-
}
|
|
2929
|
-
function un(A, S, j, G) {
|
|
2930
|
-
const $ = G ?? S.name;
|
|
2931
|
-
return A instanceof File ? A.type !== j || A.lastModified !== S.lastModified || A.name !== $ ? it(A, $, j, S.lastModified) : A : it(A, $, j, S.lastModified);
|
|
2932
|
-
}
|
|
2933
|
-
function hn(A, S) {
|
|
2934
|
-
const j = S.startsWith(".") ? S.slice(1) : S, G = A.lastIndexOf(".");
|
|
2935
|
-
return G > 0 ? `${A.substring(0, G)}.${j}` : `${A}.${j}`;
|
|
2936
|
-
}
|
|
2937
|
-
function dn(A) {
|
|
2938
|
-
return A === "image/webp" ? "image/jpeg" : A;
|
|
2939
|
-
}
|
|
2940
|
-
async function xt(A, S = {}) {
|
|
2941
|
-
const { maxSizeMB: j = rt.MAX_SIZE_MB, maxWidthOrHeight: G = rt.MAX_WIDTH_OR_HEIGHT, mimeType: $, fileName: Q, libURL: V, enableCompression: K = !0, convertSvgToPng: Y = !1 } = S;
|
|
2942
|
-
if (!A || !(A instanceof File)) return A;
|
|
2943
|
-
let z = A, ue = !1;
|
|
2944
|
-
if (Y) {
|
|
2945
|
-
const me = (z.type || "").toLowerCase(), Re = /\.svg$/i.test(z.name.trim()), De = me.includes("svg");
|
|
2946
|
-
let $e = !1;
|
|
2947
|
-
if (!De && !Re) try {
|
|
2948
|
-
$e = cn(await fn(z));
|
|
2949
|
-
} catch {
|
|
2950
|
-
$e = !1;
|
|
2951
|
-
}
|
|
2952
|
-
if (De || Re || $e) try {
|
|
2953
|
-
z = await ln(z, {
|
|
2954
|
-
maxLongEdge: G,
|
|
2955
|
-
outputFileName: Q ?? z.name
|
|
2956
|
-
}), ue = !0;
|
|
2957
|
-
} catch {
|
|
2958
|
-
z = A;
|
|
2959
|
-
}
|
|
2960
|
-
}
|
|
2961
|
-
const ee = gt((z.type && z.type.trim() !== "" ? z.type : nt(z.name)) || (ue ? "image/png" : $) || "image/jpeg"), Me = ue ? z.name : Q ?? z.name;
|
|
2962
|
-
if (!ee.startsWith("image/")) return pt(z, Me);
|
|
2963
|
-
const ye = dn(ee), Ee = Ut(ee), ot = Ut(ye), Be = ye !== ee ? hn(Me, ot) : Me, Ze = K && tn(Ee);
|
|
2964
|
-
if (!Ze && ye === ee) return pt(z, Be);
|
|
2965
|
-
const qe = z.type === ee ? z : it(z, z.name, ee, z.lastModified);
|
|
2966
|
-
try {
|
|
2967
|
-
const me = {
|
|
2968
|
-
libURL: V,
|
|
2969
|
-
useWebWorker: !0,
|
|
2970
|
-
fileType: ye
|
|
2971
|
-
};
|
|
2972
|
-
Ze ? (me.maxSizeMB = j, me.maxWidthOrHeight = G) : (me.maxSizeMB = Math.max(qe.size / (1024 * 1024) + 1, 1), me.initialQuality = 1, me.alwaysKeepResolution = !0);
|
|
2973
|
-
const Re = await (0, Jt.default)(qe, me);
|
|
2974
|
-
return un(Re, qe, gt(Re.type || ye), Be);
|
|
2975
|
-
} catch {
|
|
2976
|
-
try {
|
|
2977
|
-
return pt(z, Be);
|
|
2978
|
-
} catch {
|
|
2979
|
-
return z;
|
|
2980
|
-
}
|
|
2981
|
-
}
|
|
2982
|
-
}
|
|
2983
|
-
var gn = "js/browser-image-compression.js";
|
|
2984
|
-
function St() {
|
|
2985
|
-
return kt.getBundledHostAssetUrl(gn);
|
|
2986
|
-
}
|
|
2987
|
-
async function pn(A, S, j = St()) {
|
|
2988
|
-
if (!Et(A)) return A;
|
|
2989
|
-
const { maxSizeMB: G, maxWidthOrHeight: $ } = It(S), Q = A.type?.trim() || nt(A.name) || A.type || "";
|
|
2990
|
-
return xt(A, {
|
|
2991
|
-
maxSizeMB: G,
|
|
2992
|
-
maxWidthOrHeight: $,
|
|
2993
|
-
mimeType: Q || void 0,
|
|
2994
|
-
fileName: A.name,
|
|
2995
|
-
libURL: j,
|
|
2996
|
-
enableCompression: Ft(S, Q),
|
|
2997
|
-
convertSvgToPng: !0
|
|
2998
|
-
});
|
|
2999
|
-
}
|
|
3000
|
-
async function mn(A, S) {
|
|
3001
|
-
if (!A || typeof A.findFileByUrl != "function") return null;
|
|
3002
|
-
const j = await A.findFileByUrl(S);
|
|
3003
|
-
if (!j) return null;
|
|
3004
|
-
const G = typeof A.getFileById == "function" && j.id && await A.getFileById(j.id) || j, $ = G.url || S, Q = G.thumbnailUrl || G.thumbnail || $ || (typeof A.getThumbnailUrl == "function" ? await A.getThumbnailUrl(G) : "") || "";
|
|
3005
|
-
return Q ? {
|
|
3006
|
-
file: G,
|
|
3007
|
-
previewUrl: Q
|
|
3008
|
-
} : null;
|
|
3009
|
-
}
|
|
3010
|
-
function vn(A) {
|
|
3011
|
-
if (!(A instanceof Blob) || A.size === 0) throw new ft.G("Failed to download file from the URL.", "UploadUrlDownloadFailed");
|
|
3012
|
-
const S = A.type?.split(";")[0]?.trim() || "image/png";
|
|
3013
|
-
if (!S.startsWith("image/")) throw new ft.G("Content type at the URL is not allowed.", "UploadUrlContentTypeNotAllowed");
|
|
3014
|
-
return {
|
|
3015
|
-
blob: A,
|
|
3016
|
-
mimeType: S
|
|
3017
|
-
};
|
|
3018
|
-
}
|
|
3019
|
-
async function bn(A, S) {
|
|
3020
|
-
const j = await fetch(A, S);
|
|
3021
|
-
if (!j.ok) throw new Error(`Server returned ${j.status}`);
|
|
3022
|
-
return j.blob();
|
|
3023
|
-
}
|
|
3024
|
-
async function yn(A, S, j) {
|
|
3025
|
-
const G = j ? { signal: j } : void 0, { blob: $ } = await ft.Oi(A, {
|
|
3026
|
-
handleFileProxy: async (Q) => yt.pickFileProxyBlobFromFireResults(await S.fireFileProxy(Q)) ?? null,
|
|
3027
|
-
handleProxyUrl: async (Q) => yt.pickProxyUrlOverrideFromFireResults(await S.fireProxyUrl(Q), Q),
|
|
3028
|
-
fetchWithProxy: (Q, V, K) => Ie.fetchWithResourceProxy(Q, {
|
|
3029
|
-
config: S.appConfig,
|
|
3030
|
-
standalone: S.isStandalone,
|
|
3031
|
-
intent: K?.intent || "downloadBlob",
|
|
3032
|
-
validateBlob: async (Y) => !Y.type || Y.type.startsWith("image/"),
|
|
3033
|
-
init: V
|
|
3034
|
-
})
|
|
3035
|
-
}, (Q) => bn(Q, G), vn, { fetchInit: G });
|
|
3036
|
-
return $;
|
|
3037
|
-
}
|
|
3038
|
-
function wn() {
|
|
3039
|
-
const A = Ie.useAppConfig(), S = Ie.useIsStandalone(), j = Ie.useSelector(Ie.selectProject), { projectId: G } = Ie.useParams(), $ = j?.id !== void 0 ? String(j.id) : G || "", Q = Ie.useEventEmitter(Ie.events.FILE_PROXY_EVENT_ID), V = Ie.useEventEmitter(Ie.events.PROXY_URL_EVENT_ID);
|
|
3040
|
-
return (0, Bt.useCallback)(async (K, Y) => yn(K, {
|
|
3041
|
-
appConfig: A,
|
|
3042
|
-
isStandalone: S,
|
|
3043
|
-
fireFileProxy: (z) => Q.fire({
|
|
3044
|
-
url: z,
|
|
3045
|
-
project: $
|
|
3046
|
-
}),
|
|
3047
|
-
fireProxyUrl: (z) => V.fire({
|
|
3048
|
-
url: z,
|
|
3049
|
-
project: $
|
|
3050
|
-
})
|
|
3051
|
-
}, Y), [
|
|
3052
|
-
A,
|
|
3053
|
-
$,
|
|
3054
|
-
S,
|
|
3055
|
-
Q,
|
|
3056
|
-
V
|
|
3057
|
-
]);
|
|
3058
|
-
}
|
|
3059
|
-
Object.defineProperty(le, "canonicalImageUrlKey", {
|
|
3060
|
-
enumerable: !0,
|
|
3061
|
-
get: function() {
|
|
3062
|
-
return dt;
|
|
3063
|
-
}
|
|
3064
|
-
}), Object.defineProperty(le, "createImageUrlBlobResolver", {
|
|
3065
|
-
enumerable: !0,
|
|
3066
|
-
get: function() {
|
|
3067
|
-
return Zt;
|
|
3068
|
-
}
|
|
3069
|
-
}), Object.defineProperty(le, "getAiTariffUpgradeStep", {
|
|
3070
|
-
enumerable: !0,
|
|
3071
|
-
get: function() {
|
|
3072
|
-
return Xt;
|
|
3073
|
-
}
|
|
3074
|
-
}), Object.defineProperty(le, "getBrowserImageCompressionLibUrl", {
|
|
3075
|
-
enumerable: !0,
|
|
3076
|
-
get: function() {
|
|
3077
|
-
return St;
|
|
3078
|
-
}
|
|
3079
|
-
}), Object.defineProperty(le, "getImageDimensionsFromBlob", {
|
|
3080
|
-
enumerable: !0,
|
|
3081
|
-
get: function() {
|
|
3082
|
-
return Vt;
|
|
3083
|
-
}
|
|
3084
|
-
}), Object.defineProperty(le, "inferImageMimeFromFileName", {
|
|
3085
|
-
enumerable: !0,
|
|
3086
|
-
get: function() {
|
|
3087
|
-
return nt;
|
|
3088
|
-
}
|
|
3089
|
-
}), Object.defineProperty(le, "isAiLimitReached", {
|
|
3090
|
-
enumerable: !0,
|
|
3091
|
-
get: function() {
|
|
3092
|
-
return Wt;
|
|
3093
|
-
}
|
|
3094
|
-
}), Object.defineProperty(le, "isAllowedImageUploadFile", {
|
|
3095
|
-
enumerable: !0,
|
|
3096
|
-
get: function() {
|
|
3097
|
-
return Et;
|
|
3098
|
-
}
|
|
3099
|
-
}), Object.defineProperty(le, "normalizeImageFormatForDisplay", {
|
|
3100
|
-
enumerable: !0,
|
|
3101
|
-
get: function() {
|
|
3102
|
-
return Kt;
|
|
3103
|
-
}
|
|
3104
|
-
}), Object.defineProperty(le, "prepareImageForEditorUpload", {
|
|
3105
|
-
enumerable: !0,
|
|
3106
|
-
get: function() {
|
|
3107
|
-
return pn;
|
|
3108
|
-
}
|
|
3109
|
-
}), Object.defineProperty(le, "prepareImageForUpload", {
|
|
3110
|
-
enumerable: !0,
|
|
3111
|
-
get: function() {
|
|
3112
|
-
return xt;
|
|
3113
|
-
}
|
|
3114
|
-
}), Object.defineProperty(le, "require_prop_types", {
|
|
3115
|
-
enumerable: !0,
|
|
3116
|
-
get: function() {
|
|
3117
|
-
return jt;
|
|
3118
|
-
}
|
|
3119
|
-
}), Object.defineProperty(le, "resolveAutoLimitUpgrade", {
|
|
3120
|
-
enumerable: !0,
|
|
3121
|
-
get: function() {
|
|
3122
|
-
return $t;
|
|
3123
|
-
}
|
|
3124
|
-
}), Object.defineProperty(le, "resolveDataProviderPreview", {
|
|
3125
|
-
enumerable: !0,
|
|
3126
|
-
get: function() {
|
|
3127
|
-
return mn;
|
|
3128
|
-
}
|
|
3129
|
-
}), Object.defineProperty(le, "resolveImageCompressionLimits", {
|
|
3130
|
-
enumerable: !0,
|
|
3131
|
-
get: function() {
|
|
3132
|
-
return It;
|
|
3133
|
-
}
|
|
3134
|
-
}), Object.defineProperty(le, "shouldCountAiUsage", {
|
|
3135
|
-
enumerable: !0,
|
|
3136
|
-
get: function() {
|
|
3137
|
-
return wt;
|
|
3138
|
-
}
|
|
3139
|
-
}), Object.defineProperty(le, "shouldEnableImageCompression", {
|
|
3140
|
-
enumerable: !0,
|
|
3141
|
-
get: function() {
|
|
3142
|
-
return Ft;
|
|
3143
|
-
}
|
|
3144
|
-
}), Object.defineProperty(le, "useImageBlobFetch", {
|
|
3145
|
-
enumerable: !0,
|
|
3146
|
-
get: function() {
|
|
3147
|
-
return wn;
|
|
3148
|
-
}
|
|
3149
|
-
});
|
|
3150
|
-
});
|