superdoc 2.4.0-next.2 → 2.4.0-next.21
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/chunks/{FindReplaceSurface-Dx0llWqP.cjs → FindReplaceSurface-0p7EtMZh.cjs} +4 -4
- package/dist/chunks/{FindReplaceSurface-BEW-1NhM.es.js → FindReplaceSurface-40AnrqWk.es.js} +5 -4
- package/dist/chunks/{PasswordPromptSurface-BUUVC2ee.cjs → PasswordPromptSurface-31lYPcCK.cjs} +4 -3
- package/dist/chunks/{PasswordPromptSurface-BA6HHqEa.es.js → PasswordPromptSurface-CwYeO3iQ.es.js} +4 -2
- package/dist/chunks/{PdfViewer-CNOtyS-I.es.js → PdfViewer-D8h7LRZy.es.js} +103 -19
- package/dist/chunks/{PdfViewer-qpvzwYMz.cjs → PdfViewer-Dug6yDRC.cjs} +105 -20
- package/dist/chunks/_plugin-vue_export-helper-BOaGB7Aw.es.js +8 -0
- package/dist/chunks/_plugin-vue_export-helper-SDR04tiH.cjs +13 -0
- package/dist/chunks/{blank-docx-DP8RUPW-.cjs → blank-docx-BuFAbRjs.cjs} +2 -0
- package/dist/chunks/{blank-docx-XRX6Ker2.es.js → blank-docx-DzQccOlW.es.js} +2 -0
- package/dist/chunks/constants-B6VBlmKp.es.js +4 -0
- package/dist/chunks/constants-DpXuDx_g.cjs +9 -0
- package/dist/chunks/{create-super-doc-ui-D4kk9AjM.es.js → create-super-doc-ui-CFsY0uxw.es.js} +2177 -581
- package/dist/chunks/{create-super-doc-ui-DXdWuTzm.cjs → create-super-doc-ui-jSJQis_0.cjs} +1987 -619
- package/dist/chunks/{eventemitter3-DqY4aSMf.cjs → eventemitter3-C_TAnXOl.cjs} +125 -16
- package/dist/chunks/{eventemitter3-Bt2s0X0a.es.js → eventemitter3-DEIiXiH2.es.js} +124 -16
- package/dist/chunks/jszip-BzJ3CyxR.es.js +4717 -0
- package/dist/chunks/jszip-D8mAFF-r.cjs +4758 -0
- package/dist/chunks/{rolldown-runtime-D7PMmH3s.es.js → rolldown-runtime-0pSA04fp.es.js} +12 -3
- package/dist/chunks/{rolldown-runtime-1Y-nnZJ3.cjs → rolldown-runtime-74VwNCz7.cjs} +11 -2
- package/dist/chunks/{uuid-CFp0WGVU.cjs → uuid-BhG0ngwk.cjs} +10 -6
- package/dist/chunks/{uuid-B2Sqk-3p.es.js → uuid-H0Xcmmhy.es.js} +8 -3
- package/dist/collaboration-upgrade-engine.cjs +34 -9
- package/dist/collaboration-upgrade-engine.es.js +30 -5
- package/dist/document-api/src/comments/comments.types.d.ts +7 -0
- package/dist/document-api/src/types/track-changes.types.d.ts +1 -3
- package/dist/layout-engine/contracts/src/incremental-dependency.d.ts +22 -2
- package/dist/layout-engine/contracts/src/index.d.ts +1 -1
- package/dist/layout-engine/layout-bridge/src/incrementalLayout.d.ts +2 -1
- package/dist/layout-engine/layout-bridge/src/index.d.ts +1 -0
- package/dist/public/ui-react.cjs +66 -2
- package/dist/public/ui-react.es.js +66 -1
- package/dist/public/ui.cjs +1 -1
- package/dist/public/ui.es.js +1 -1
- package/dist/style.css +104 -69
- package/dist/style.layered.css +104 -69
- package/dist/superdoc/src/core/SuperDoc.d.ts +4 -0
- package/dist/superdoc/src/core/types/index.d.ts +505 -42
- package/dist/superdoc/src/helpers/comment-small-screen.d.ts +10 -0
- package/dist/superdoc/src/helpers/v2-review-mutation-impact.d.ts +1 -0
- package/dist/superdoc/src/helpers/v2-review-mutation-reconciler.d.ts +1 -1
- package/dist/superdoc/src/helpers/v2-typing-review-hydration.d.ts +16 -0
- package/dist/superdoc/src/internal/toolbar/built-in/ToolbarButton.vue.d.ts +4 -4
- package/dist/superdoc/src/internal/toolbar/built-in-toolbar.d.ts +11 -0
- package/dist/superdoc/src/internal/toolbar/compatibility-catalog.d.ts +1 -1
- package/dist/superdoc/src/public/index.d.cts +22 -0
- package/dist/superdoc/src/public/index.d.ts +11 -0
- package/dist/superdoc/src/public/ui/types.d.ts +25 -1
- package/dist/superdoc/src/stores/comments-store.d.ts +100 -22
- package/dist/superdoc/src/stores/superdoc-store.d.ts +300 -66
- package/dist/superdoc.cjs +6678 -1391
- package/dist/superdoc.es.js +6556 -1268
- package/dist-cdn/style.layered.css +1 -1
- package/dist-cdn/superdoc.min.css +1 -1
- package/dist-cdn/superdoc.min.js +37 -37
- package/package.json +14 -14
- package/dist/chunks/_plugin-vue_export-helper-BTwbGDKw.cjs +0 -11
- package/dist/chunks/_plugin-vue_export-helper-CInC0bKI.es.js +0 -6
- package/dist/chunks/constants-CY3R3_kF.es.js +0 -3
- package/dist/chunks/constants-sbCZ2O_A.cjs +0 -14
- package/dist/chunks/jszip-C8srOKAO.es.js +0 -4650
- package/dist/chunks/jszip-Cs9JBLlJ.cjs +0 -4691
|
@@ -1,4691 +0,0 @@
|
|
|
1
|
-
const require_rolldown_runtime = require("./rolldown-runtime-1Y-nnZJ3.cjs");
|
|
2
|
-
function getLens(b64) {
|
|
3
|
-
var len$1 = b64.length;
|
|
4
|
-
if (len$1 % 4 > 0) throw new Error("Invalid string. Length must be a multiple of 4");
|
|
5
|
-
var validLen = b64.indexOf("=");
|
|
6
|
-
if (validLen === -1) validLen = len$1;
|
|
7
|
-
var placeHoldersLen = validLen === len$1 ? 0 : 4 - validLen % 4;
|
|
8
|
-
return [validLen, placeHoldersLen];
|
|
9
|
-
}
|
|
10
|
-
function byteLength(b64) {
|
|
11
|
-
var lens = getLens(b64);
|
|
12
|
-
var validLen = lens[0];
|
|
13
|
-
var placeHoldersLen = lens[1];
|
|
14
|
-
return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen;
|
|
15
|
-
}
|
|
16
|
-
function _byteLength(b64, validLen, placeHoldersLen) {
|
|
17
|
-
return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen;
|
|
18
|
-
}
|
|
19
|
-
function toByteArray(b64) {
|
|
20
|
-
var tmp;
|
|
21
|
-
var lens = getLens(b64);
|
|
22
|
-
var validLen = lens[0];
|
|
23
|
-
var placeHoldersLen = lens[1];
|
|
24
|
-
var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen));
|
|
25
|
-
var curByte = 0;
|
|
26
|
-
var len$1 = placeHoldersLen > 0 ? validLen - 4 : validLen;
|
|
27
|
-
var i$1;
|
|
28
|
-
for (i$1 = 0; i$1 < len$1; i$1 += 4) {
|
|
29
|
-
tmp = revLookup[b64.charCodeAt(i$1)] << 18 | revLookup[b64.charCodeAt(i$1 + 1)] << 12 | revLookup[b64.charCodeAt(i$1 + 2)] << 6 | revLookup[b64.charCodeAt(i$1 + 3)];
|
|
30
|
-
arr[curByte++] = tmp >> 16 & 255;
|
|
31
|
-
arr[curByte++] = tmp >> 8 & 255;
|
|
32
|
-
arr[curByte++] = tmp & 255;
|
|
33
|
-
}
|
|
34
|
-
if (placeHoldersLen === 2) {
|
|
35
|
-
tmp = revLookup[b64.charCodeAt(i$1)] << 2 | revLookup[b64.charCodeAt(i$1 + 1)] >> 4;
|
|
36
|
-
arr[curByte++] = tmp & 255;
|
|
37
|
-
}
|
|
38
|
-
if (placeHoldersLen === 1) {
|
|
39
|
-
tmp = revLookup[b64.charCodeAt(i$1)] << 10 | revLookup[b64.charCodeAt(i$1 + 1)] << 4 | revLookup[b64.charCodeAt(i$1 + 2)] >> 2;
|
|
40
|
-
arr[curByte++] = tmp >> 8 & 255;
|
|
41
|
-
arr[curByte++] = tmp & 255;
|
|
42
|
-
}
|
|
43
|
-
return arr;
|
|
44
|
-
}
|
|
45
|
-
function tripletToBase64(num) {
|
|
46
|
-
return lookup[num >> 18 & 63] + lookup[num >> 12 & 63] + lookup[num >> 6 & 63] + lookup[num & 63];
|
|
47
|
-
}
|
|
48
|
-
function encodeChunk(uint8, start, end) {
|
|
49
|
-
var tmp;
|
|
50
|
-
var output = [];
|
|
51
|
-
for (var i$1 = start; i$1 < end; i$1 += 3) {
|
|
52
|
-
tmp = (uint8[i$1] << 16 & 16711680) + (uint8[i$1 + 1] << 8 & 65280) + (uint8[i$1 + 2] & 255);
|
|
53
|
-
output.push(tripletToBase64(tmp));
|
|
54
|
-
}
|
|
55
|
-
return output.join("");
|
|
56
|
-
}
|
|
57
|
-
function fromByteArray(uint8) {
|
|
58
|
-
var tmp;
|
|
59
|
-
var len$1 = uint8.length;
|
|
60
|
-
var extraBytes = len$1 % 3;
|
|
61
|
-
var parts = [];
|
|
62
|
-
var maxChunkLength = 16383;
|
|
63
|
-
for (var i$1 = 0, len2 = len$1 - extraBytes; i$1 < len2; i$1 += maxChunkLength) parts.push(encodeChunk(uint8, i$1, i$1 + maxChunkLength > len2 ? len2 : i$1 + maxChunkLength));
|
|
64
|
-
if (extraBytes === 1) {
|
|
65
|
-
tmp = uint8[len$1 - 1];
|
|
66
|
-
parts.push(lookup[tmp >> 2] + lookup[tmp << 4 & 63] + "==");
|
|
67
|
-
} else if (extraBytes === 2) {
|
|
68
|
-
tmp = (uint8[len$1 - 2] << 8) + uint8[len$1 - 1];
|
|
69
|
-
parts.push(lookup[tmp >> 10] + lookup[tmp >> 4 & 63] + lookup[tmp << 2 & 63] + "=");
|
|
70
|
-
}
|
|
71
|
-
return parts.join("");
|
|
72
|
-
}
|
|
73
|
-
var buffer, base64Js, lookup, revLookup, Arr, code, i, len, ieee754, Buffer, Blob$1, BlobOptions, Buffer$1, File, FileOptions, INSPECT_MAX_BYTES, SlowBuffer, TranscodeEncoding, atob, btoa, constants, isAscii, isUtf8, kMaxLength, kStringMaxLength, resolveObjectURL, transcode;
|
|
74
|
-
var init_dist$2 = require_rolldown_runtime.__esmMin((() => {
|
|
75
|
-
buffer = {};
|
|
76
|
-
base64Js = {};
|
|
77
|
-
base64Js.byteLength = byteLength;
|
|
78
|
-
base64Js.toByteArray = toByteArray;
|
|
79
|
-
base64Js.fromByteArray = fromByteArray;
|
|
80
|
-
lookup = [];
|
|
81
|
-
revLookup = [];
|
|
82
|
-
Arr = typeof Uint8Array !== "undefined" ? Uint8Array : Array;
|
|
83
|
-
code = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
|
84
|
-
for (i = 0, len = code.length; i < len; ++i) {
|
|
85
|
-
lookup[i] = code[i];
|
|
86
|
-
revLookup[code.charCodeAt(i)] = i;
|
|
87
|
-
}
|
|
88
|
-
revLookup["-".charCodeAt(0)] = 62;
|
|
89
|
-
revLookup["_".charCodeAt(0)] = 63;
|
|
90
|
-
ieee754 = {};
|
|
91
|
-
ieee754.read = function(buffer$1, offset, isLE, mLen, nBytes) {
|
|
92
|
-
var e, m;
|
|
93
|
-
var eLen = nBytes * 8 - mLen - 1;
|
|
94
|
-
var eMax = (1 << eLen) - 1;
|
|
95
|
-
var eBias = eMax >> 1;
|
|
96
|
-
var nBits = -7;
|
|
97
|
-
var i$1 = isLE ? nBytes - 1 : 0;
|
|
98
|
-
var d = isLE ? -1 : 1;
|
|
99
|
-
var s = buffer$1[offset + i$1];
|
|
100
|
-
i$1 += d;
|
|
101
|
-
e = s & (1 << -nBits) - 1;
|
|
102
|
-
s >>= -nBits;
|
|
103
|
-
nBits += eLen;
|
|
104
|
-
for (; nBits > 0; e = e * 256 + buffer$1[offset + i$1], i$1 += d, nBits -= 8);
|
|
105
|
-
m = e & (1 << -nBits) - 1;
|
|
106
|
-
e >>= -nBits;
|
|
107
|
-
nBits += mLen;
|
|
108
|
-
for (; nBits > 0; m = m * 256 + buffer$1[offset + i$1], i$1 += d, nBits -= 8);
|
|
109
|
-
if (e === 0) e = 1 - eBias;
|
|
110
|
-
else if (e === eMax) return m ? NaN : (s ? -1 : 1) * Infinity;
|
|
111
|
-
else {
|
|
112
|
-
m = m + Math.pow(2, mLen);
|
|
113
|
-
e = e - eBias;
|
|
114
|
-
}
|
|
115
|
-
return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
|
|
116
|
-
};
|
|
117
|
-
ieee754.write = function(buffer$1, value, offset, isLE, mLen, nBytes) {
|
|
118
|
-
var e, m, c;
|
|
119
|
-
var eLen = nBytes * 8 - mLen - 1;
|
|
120
|
-
var eMax = (1 << eLen) - 1;
|
|
121
|
-
var eBias = eMax >> 1;
|
|
122
|
-
var rt = mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
|
|
123
|
-
var i$1 = isLE ? 0 : nBytes - 1;
|
|
124
|
-
var d = isLE ? 1 : -1;
|
|
125
|
-
var s = value < 0 || value === 0 && 1 / value < 0 ? 1 : 0;
|
|
126
|
-
value = Math.abs(value);
|
|
127
|
-
if (isNaN(value) || value === Infinity) {
|
|
128
|
-
m = isNaN(value) ? 1 : 0;
|
|
129
|
-
e = eMax;
|
|
130
|
-
} else {
|
|
131
|
-
e = Math.floor(Math.log(value) / Math.LN2);
|
|
132
|
-
if (value * (c = Math.pow(2, -e)) < 1) {
|
|
133
|
-
e--;
|
|
134
|
-
c *= 2;
|
|
135
|
-
}
|
|
136
|
-
if (e + eBias >= 1) value += rt / c;
|
|
137
|
-
else value += rt * Math.pow(2, 1 - eBias);
|
|
138
|
-
if (value * c >= 2) {
|
|
139
|
-
e++;
|
|
140
|
-
c /= 2;
|
|
141
|
-
}
|
|
142
|
-
if (e + eBias >= eMax) {
|
|
143
|
-
m = 0;
|
|
144
|
-
e = eMax;
|
|
145
|
-
} else if (e + eBias >= 1) {
|
|
146
|
-
m = (value * c - 1) * Math.pow(2, mLen);
|
|
147
|
-
e = e + eBias;
|
|
148
|
-
} else {
|
|
149
|
-
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
|
|
150
|
-
e = 0;
|
|
151
|
-
}
|
|
152
|
-
}
|
|
153
|
-
for (; mLen >= 8; buffer$1[offset + i$1] = m & 255, i$1 += d, m /= 256, mLen -= 8);
|
|
154
|
-
e = e << mLen | m;
|
|
155
|
-
eLen += mLen;
|
|
156
|
-
for (; eLen > 0; buffer$1[offset + i$1] = e & 255, i$1 += d, e /= 256, eLen -= 8);
|
|
157
|
-
buffer$1[offset + i$1 - d] |= s * 128;
|
|
158
|
-
};
|
|
159
|
-
(function(exports$1) {
|
|
160
|
-
const base64 = base64Js;
|
|
161
|
-
const ieee754$1 = ieee754;
|
|
162
|
-
const customInspectSymbol = typeof Symbol === "function" && typeof Symbol["for"] === "function" ? Symbol["for"]("nodejs.util.inspect.custom") : null;
|
|
163
|
-
exports$1.Buffer = Buffer$2;
|
|
164
|
-
exports$1.SlowBuffer = SlowBuffer$1;
|
|
165
|
-
exports$1.INSPECT_MAX_BYTES = 50;
|
|
166
|
-
const K_MAX_LENGTH = 2147483647;
|
|
167
|
-
exports$1.kMaxLength = K_MAX_LENGTH;
|
|
168
|
-
const { Uint8Array: GlobalUint8Array, ArrayBuffer: GlobalArrayBuffer, SharedArrayBuffer: GlobalSharedArrayBuffer } = globalThis;
|
|
169
|
-
Buffer$2.TYPED_ARRAY_SUPPORT = typedArraySupport();
|
|
170
|
-
if (!Buffer$2.TYPED_ARRAY_SUPPORT && typeof console !== "undefined" && typeof console.error === "function") console.error("This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support.");
|
|
171
|
-
function typedArraySupport() {
|
|
172
|
-
try {
|
|
173
|
-
const arr = new GlobalUint8Array(1);
|
|
174
|
-
const proto = { foo: function() {
|
|
175
|
-
return 42;
|
|
176
|
-
} };
|
|
177
|
-
Object.setPrototypeOf(proto, GlobalUint8Array.prototype);
|
|
178
|
-
Object.setPrototypeOf(arr, proto);
|
|
179
|
-
return arr.foo() === 42;
|
|
180
|
-
} catch (e) {
|
|
181
|
-
return false;
|
|
182
|
-
}
|
|
183
|
-
}
|
|
184
|
-
Object.defineProperty(Buffer$2.prototype, "parent", {
|
|
185
|
-
enumerable: true,
|
|
186
|
-
get: function() {
|
|
187
|
-
if (!Buffer$2.isBuffer(this)) return void 0;
|
|
188
|
-
return this.buffer;
|
|
189
|
-
}
|
|
190
|
-
});
|
|
191
|
-
Object.defineProperty(Buffer$2.prototype, "offset", {
|
|
192
|
-
enumerable: true,
|
|
193
|
-
get: function() {
|
|
194
|
-
if (!Buffer$2.isBuffer(this)) return void 0;
|
|
195
|
-
return this.byteOffset;
|
|
196
|
-
}
|
|
197
|
-
});
|
|
198
|
-
function createBuffer(length) {
|
|
199
|
-
if (length > K_MAX_LENGTH) throw new RangeError("The value \"" + length + "\" is invalid for option \"size\"");
|
|
200
|
-
const buf = new GlobalUint8Array(length);
|
|
201
|
-
Object.setPrototypeOf(buf, Buffer$2.prototype);
|
|
202
|
-
return buf;
|
|
203
|
-
}
|
|
204
|
-
function Buffer$2(arg, encodingOrOffset, length) {
|
|
205
|
-
if (typeof arg === "number") {
|
|
206
|
-
if (typeof encodingOrOffset === "string") throw new TypeError("The \"string\" argument must be of type string. Received type number");
|
|
207
|
-
return allocUnsafe(arg);
|
|
208
|
-
}
|
|
209
|
-
return from(arg, encodingOrOffset, length);
|
|
210
|
-
}
|
|
211
|
-
Buffer$2.poolSize = 8192;
|
|
212
|
-
function from(value, encodingOrOffset, length) {
|
|
213
|
-
if (typeof value === "string") return fromString(value, encodingOrOffset);
|
|
214
|
-
if (GlobalArrayBuffer.isView(value)) return fromArrayView(value);
|
|
215
|
-
if (value == null) throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof value);
|
|
216
|
-
if (isInstance(value, GlobalArrayBuffer) || value && isInstance(value.buffer, GlobalArrayBuffer)) return fromArrayBuffer(value, encodingOrOffset, length);
|
|
217
|
-
if (typeof GlobalSharedArrayBuffer !== "undefined" && (isInstance(value, GlobalSharedArrayBuffer) || value && isInstance(value.buffer, GlobalSharedArrayBuffer))) return fromArrayBuffer(value, encodingOrOffset, length);
|
|
218
|
-
if (typeof value === "number") throw new TypeError("The \"value\" argument must not be of type number. Received type number");
|
|
219
|
-
const valueOf = value.valueOf && value.valueOf();
|
|
220
|
-
if (valueOf != null && valueOf !== value) return Buffer$2.from(valueOf, encodingOrOffset, length);
|
|
221
|
-
const b = fromObject(value);
|
|
222
|
-
if (b) return b;
|
|
223
|
-
if (typeof Symbol !== "undefined" && Symbol.toPrimitive != null && typeof value[Symbol.toPrimitive] === "function") return Buffer$2.from(value[Symbol.toPrimitive]("string"), encodingOrOffset, length);
|
|
224
|
-
throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof value);
|
|
225
|
-
}
|
|
226
|
-
Buffer$2.from = function(value, encodingOrOffset, length) {
|
|
227
|
-
return from(value, encodingOrOffset, length);
|
|
228
|
-
};
|
|
229
|
-
Object.setPrototypeOf(Buffer$2.prototype, GlobalUint8Array.prototype);
|
|
230
|
-
Object.setPrototypeOf(Buffer$2, GlobalUint8Array);
|
|
231
|
-
function assertSize(size) {
|
|
232
|
-
if (typeof size !== "number") throw new TypeError("\"size\" argument must be of type number");
|
|
233
|
-
else if (size < 0) throw new RangeError("The value \"" + size + "\" is invalid for option \"size\"");
|
|
234
|
-
}
|
|
235
|
-
function alloc(size, fill, encoding) {
|
|
236
|
-
assertSize(size);
|
|
237
|
-
if (size <= 0) return createBuffer(size);
|
|
238
|
-
if (fill !== void 0) return typeof encoding === "string" ? createBuffer(size).fill(fill, encoding) : createBuffer(size).fill(fill);
|
|
239
|
-
return createBuffer(size);
|
|
240
|
-
}
|
|
241
|
-
Buffer$2.alloc = function(size, fill, encoding) {
|
|
242
|
-
return alloc(size, fill, encoding);
|
|
243
|
-
};
|
|
244
|
-
function allocUnsafe(size) {
|
|
245
|
-
assertSize(size);
|
|
246
|
-
return createBuffer(size < 0 ? 0 : checked(size) | 0);
|
|
247
|
-
}
|
|
248
|
-
Buffer$2.allocUnsafe = function(size) {
|
|
249
|
-
return allocUnsafe(size);
|
|
250
|
-
};
|
|
251
|
-
Buffer$2.allocUnsafeSlow = function(size) {
|
|
252
|
-
return allocUnsafe(size);
|
|
253
|
-
};
|
|
254
|
-
function fromString(string, encoding) {
|
|
255
|
-
if (typeof encoding !== "string" || encoding === "") encoding = "utf8";
|
|
256
|
-
if (!Buffer$2.isEncoding(encoding)) throw new TypeError("Unknown encoding: " + encoding);
|
|
257
|
-
const length = byteLength$1(string, encoding) | 0;
|
|
258
|
-
let buf = createBuffer(length);
|
|
259
|
-
const actual = buf.write(string, encoding);
|
|
260
|
-
if (actual !== length) buf = buf.slice(0, actual);
|
|
261
|
-
return buf;
|
|
262
|
-
}
|
|
263
|
-
function fromArrayLike(array) {
|
|
264
|
-
const length = array.length < 0 ? 0 : checked(array.length) | 0;
|
|
265
|
-
const buf = createBuffer(length);
|
|
266
|
-
for (let i$1 = 0; i$1 < length; i$1 += 1) buf[i$1] = array[i$1] & 255;
|
|
267
|
-
return buf;
|
|
268
|
-
}
|
|
269
|
-
function fromArrayView(arrayView) {
|
|
270
|
-
if (isInstance(arrayView, GlobalUint8Array)) {
|
|
271
|
-
const copy = new GlobalUint8Array(arrayView);
|
|
272
|
-
return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength);
|
|
273
|
-
}
|
|
274
|
-
return fromArrayLike(arrayView);
|
|
275
|
-
}
|
|
276
|
-
function fromArrayBuffer(array, byteOffset, length) {
|
|
277
|
-
if (byteOffset < 0 || array.byteLength < byteOffset) throw new RangeError("\"offset\" is outside of buffer bounds");
|
|
278
|
-
if (array.byteLength < byteOffset + (length || 0)) throw new RangeError("\"length\" is outside of buffer bounds");
|
|
279
|
-
let buf;
|
|
280
|
-
if (byteOffset === void 0 && length === void 0) buf = new GlobalUint8Array(array);
|
|
281
|
-
else if (length === void 0) buf = new GlobalUint8Array(array, byteOffset);
|
|
282
|
-
else buf = new GlobalUint8Array(array, byteOffset, length);
|
|
283
|
-
Object.setPrototypeOf(buf, Buffer$2.prototype);
|
|
284
|
-
return buf;
|
|
285
|
-
}
|
|
286
|
-
function fromObject(obj) {
|
|
287
|
-
if (Buffer$2.isBuffer(obj)) {
|
|
288
|
-
const len$1 = checked(obj.length) | 0;
|
|
289
|
-
const buf = createBuffer(len$1);
|
|
290
|
-
if (buf.length === 0) return buf;
|
|
291
|
-
obj.copy(buf, 0, 0, len$1);
|
|
292
|
-
return buf;
|
|
293
|
-
}
|
|
294
|
-
if (obj.length !== void 0) {
|
|
295
|
-
if (typeof obj.length !== "number" || numberIsNaN(obj.length)) return createBuffer(0);
|
|
296
|
-
return fromArrayLike(obj);
|
|
297
|
-
}
|
|
298
|
-
if (obj.type === "Buffer" && Array.isArray(obj.data)) return fromArrayLike(obj.data);
|
|
299
|
-
}
|
|
300
|
-
function checked(length) {
|
|
301
|
-
if (length >= K_MAX_LENGTH) throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + K_MAX_LENGTH.toString(16) + " bytes");
|
|
302
|
-
return length | 0;
|
|
303
|
-
}
|
|
304
|
-
function SlowBuffer$1(length) {
|
|
305
|
-
if (+length != length) length = 0;
|
|
306
|
-
return Buffer$2.alloc(+length);
|
|
307
|
-
}
|
|
308
|
-
Buffer$2.isBuffer = function isBuffer(b) {
|
|
309
|
-
return b != null && b._isBuffer === true && b !== Buffer$2.prototype;
|
|
310
|
-
};
|
|
311
|
-
Buffer$2.compare = function compare(a, b) {
|
|
312
|
-
if (isInstance(a, GlobalUint8Array)) a = Buffer$2.from(a, a.offset, a.byteLength);
|
|
313
|
-
if (isInstance(b, GlobalUint8Array)) b = Buffer$2.from(b, b.offset, b.byteLength);
|
|
314
|
-
if (!Buffer$2.isBuffer(a) || !Buffer$2.isBuffer(b)) throw new TypeError("The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array");
|
|
315
|
-
if (a === b) return 0;
|
|
316
|
-
let x = a.length;
|
|
317
|
-
let y = b.length;
|
|
318
|
-
for (let i$1 = 0, len$1 = Math.min(x, y); i$1 < len$1; ++i$1) if (a[i$1] !== b[i$1]) {
|
|
319
|
-
x = a[i$1];
|
|
320
|
-
y = b[i$1];
|
|
321
|
-
break;
|
|
322
|
-
}
|
|
323
|
-
if (x < y) return -1;
|
|
324
|
-
if (y < x) return 1;
|
|
325
|
-
return 0;
|
|
326
|
-
};
|
|
327
|
-
Buffer$2.isEncoding = function isEncoding(encoding) {
|
|
328
|
-
switch (String(encoding).toLowerCase()) {
|
|
329
|
-
case "hex":
|
|
330
|
-
case "utf8":
|
|
331
|
-
case "utf-8":
|
|
332
|
-
case "ascii":
|
|
333
|
-
case "latin1":
|
|
334
|
-
case "binary":
|
|
335
|
-
case "base64":
|
|
336
|
-
case "ucs2":
|
|
337
|
-
case "ucs-2":
|
|
338
|
-
case "utf16le":
|
|
339
|
-
case "utf-16le": return true;
|
|
340
|
-
default: return false;
|
|
341
|
-
}
|
|
342
|
-
};
|
|
343
|
-
Buffer$2.concat = function concat(list, length) {
|
|
344
|
-
if (!Array.isArray(list)) throw new TypeError("\"list\" argument must be an Array of Buffers");
|
|
345
|
-
if (list.length === 0) return Buffer$2.alloc(0);
|
|
346
|
-
let i$1;
|
|
347
|
-
if (length === void 0) {
|
|
348
|
-
length = 0;
|
|
349
|
-
for (i$1 = 0; i$1 < list.length; ++i$1) length += list[i$1].length;
|
|
350
|
-
}
|
|
351
|
-
const buffer$1 = Buffer$2.allocUnsafe(length);
|
|
352
|
-
let pos = 0;
|
|
353
|
-
for (i$1 = 0; i$1 < list.length; ++i$1) {
|
|
354
|
-
let buf = list[i$1];
|
|
355
|
-
if (isInstance(buf, GlobalUint8Array)) if (pos + buf.length > buffer$1.length) {
|
|
356
|
-
if (!Buffer$2.isBuffer(buf)) buf = Buffer$2.from(buf);
|
|
357
|
-
buf.copy(buffer$1, pos);
|
|
358
|
-
} else GlobalUint8Array.prototype.set.call(buffer$1, buf, pos);
|
|
359
|
-
else if (!Buffer$2.isBuffer(buf)) throw new TypeError("\"list\" argument must be an Array of Buffers");
|
|
360
|
-
else buf.copy(buffer$1, pos);
|
|
361
|
-
pos += buf.length;
|
|
362
|
-
}
|
|
363
|
-
return buffer$1;
|
|
364
|
-
};
|
|
365
|
-
function byteLength$1(string, encoding) {
|
|
366
|
-
if (Buffer$2.isBuffer(string)) return string.length;
|
|
367
|
-
if (GlobalArrayBuffer.isView(string) || isInstance(string, GlobalArrayBuffer)) return string.byteLength;
|
|
368
|
-
if (typeof string !== "string") throw new TypeError("The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. Received type " + typeof string);
|
|
369
|
-
const len$1 = string.length;
|
|
370
|
-
const mustMatch = arguments.length > 2 && arguments[2] === true;
|
|
371
|
-
if (!mustMatch && len$1 === 0) return 0;
|
|
372
|
-
let loweredCase = false;
|
|
373
|
-
for (;;) switch (encoding) {
|
|
374
|
-
case "ascii":
|
|
375
|
-
case "latin1":
|
|
376
|
-
case "binary": return len$1;
|
|
377
|
-
case "utf8":
|
|
378
|
-
case "utf-8": return utf8ToBytes(string).length;
|
|
379
|
-
case "ucs2":
|
|
380
|
-
case "ucs-2":
|
|
381
|
-
case "utf16le":
|
|
382
|
-
case "utf-16le": return len$1 * 2;
|
|
383
|
-
case "hex": return len$1 >>> 1;
|
|
384
|
-
case "base64": return base64ToBytes(string).length;
|
|
385
|
-
default:
|
|
386
|
-
if (loweredCase) return mustMatch ? -1 : utf8ToBytes(string).length;
|
|
387
|
-
encoding = ("" + encoding).toLowerCase();
|
|
388
|
-
loweredCase = true;
|
|
389
|
-
}
|
|
390
|
-
}
|
|
391
|
-
Buffer$2.byteLength = byteLength$1;
|
|
392
|
-
function slowToString(encoding, start, end) {
|
|
393
|
-
let loweredCase = false;
|
|
394
|
-
if (start === void 0 || start < 0) start = 0;
|
|
395
|
-
if (start > this.length) return "";
|
|
396
|
-
if (end === void 0 || end > this.length) end = this.length;
|
|
397
|
-
if (end <= 0) return "";
|
|
398
|
-
end >>>= 0;
|
|
399
|
-
start >>>= 0;
|
|
400
|
-
if (end <= start) return "";
|
|
401
|
-
if (!encoding) encoding = "utf8";
|
|
402
|
-
while (true) switch (encoding) {
|
|
403
|
-
case "hex": return hexSlice(this, start, end);
|
|
404
|
-
case "utf8":
|
|
405
|
-
case "utf-8": return utf8Slice(this, start, end);
|
|
406
|
-
case "ascii": return asciiSlice(this, start, end);
|
|
407
|
-
case "latin1":
|
|
408
|
-
case "binary": return latin1Slice(this, start, end);
|
|
409
|
-
case "base64": return base64Slice(this, start, end);
|
|
410
|
-
case "ucs2":
|
|
411
|
-
case "ucs-2":
|
|
412
|
-
case "utf16le":
|
|
413
|
-
case "utf-16le": return utf16leSlice(this, start, end);
|
|
414
|
-
default:
|
|
415
|
-
if (loweredCase) throw new TypeError("Unknown encoding: " + encoding);
|
|
416
|
-
encoding = (encoding + "").toLowerCase();
|
|
417
|
-
loweredCase = true;
|
|
418
|
-
}
|
|
419
|
-
}
|
|
420
|
-
Buffer$2.prototype._isBuffer = true;
|
|
421
|
-
function swap(b, n, m) {
|
|
422
|
-
const i$1 = b[n];
|
|
423
|
-
b[n] = b[m];
|
|
424
|
-
b[m] = i$1;
|
|
425
|
-
}
|
|
426
|
-
Buffer$2.prototype.swap16 = function swap16() {
|
|
427
|
-
const len$1 = this.length;
|
|
428
|
-
if (len$1 % 2 !== 0) throw new RangeError("Buffer size must be a multiple of 16-bits");
|
|
429
|
-
for (let i$1 = 0; i$1 < len$1; i$1 += 2) swap(this, i$1, i$1 + 1);
|
|
430
|
-
return this;
|
|
431
|
-
};
|
|
432
|
-
Buffer$2.prototype.swap32 = function swap32() {
|
|
433
|
-
const len$1 = this.length;
|
|
434
|
-
if (len$1 % 4 !== 0) throw new RangeError("Buffer size must be a multiple of 32-bits");
|
|
435
|
-
for (let i$1 = 0; i$1 < len$1; i$1 += 4) {
|
|
436
|
-
swap(this, i$1, i$1 + 3);
|
|
437
|
-
swap(this, i$1 + 1, i$1 + 2);
|
|
438
|
-
}
|
|
439
|
-
return this;
|
|
440
|
-
};
|
|
441
|
-
Buffer$2.prototype.swap64 = function swap64() {
|
|
442
|
-
const len$1 = this.length;
|
|
443
|
-
if (len$1 % 8 !== 0) throw new RangeError("Buffer size must be a multiple of 64-bits");
|
|
444
|
-
for (let i$1 = 0; i$1 < len$1; i$1 += 8) {
|
|
445
|
-
swap(this, i$1, i$1 + 7);
|
|
446
|
-
swap(this, i$1 + 1, i$1 + 6);
|
|
447
|
-
swap(this, i$1 + 2, i$1 + 5);
|
|
448
|
-
swap(this, i$1 + 3, i$1 + 4);
|
|
449
|
-
}
|
|
450
|
-
return this;
|
|
451
|
-
};
|
|
452
|
-
Buffer$2.prototype.toString = function toString() {
|
|
453
|
-
const length = this.length;
|
|
454
|
-
if (length === 0) return "";
|
|
455
|
-
if (arguments.length === 0) return utf8Slice(this, 0, length);
|
|
456
|
-
return slowToString.apply(this, arguments);
|
|
457
|
-
};
|
|
458
|
-
Buffer$2.prototype.toLocaleString = Buffer$2.prototype.toString;
|
|
459
|
-
Buffer$2.prototype.equals = function equals(b) {
|
|
460
|
-
if (!Buffer$2.isBuffer(b)) throw new TypeError("Argument must be a Buffer");
|
|
461
|
-
if (this === b) return true;
|
|
462
|
-
return Buffer$2.compare(this, b) === 0;
|
|
463
|
-
};
|
|
464
|
-
Buffer$2.prototype.inspect = function inspect() {
|
|
465
|
-
let str = "";
|
|
466
|
-
const max = exports$1.INSPECT_MAX_BYTES;
|
|
467
|
-
str = this.toString("hex", 0, max).replace(/(.{2})/g, "$1 ").trim();
|
|
468
|
-
if (this.length > max) str += " ... ";
|
|
469
|
-
return "<Buffer " + str + ">";
|
|
470
|
-
};
|
|
471
|
-
if (customInspectSymbol) Buffer$2.prototype[customInspectSymbol] = Buffer$2.prototype.inspect;
|
|
472
|
-
Buffer$2.prototype.compare = function compare(target, start, end, thisStart, thisEnd) {
|
|
473
|
-
if (isInstance(target, GlobalUint8Array)) target = Buffer$2.from(target, target.offset, target.byteLength);
|
|
474
|
-
if (!Buffer$2.isBuffer(target)) throw new TypeError("The \"target\" argument must be one of type Buffer or Uint8Array. Received type " + typeof target);
|
|
475
|
-
if (start === void 0) start = 0;
|
|
476
|
-
if (end === void 0) end = target ? target.length : 0;
|
|
477
|
-
if (thisStart === void 0) thisStart = 0;
|
|
478
|
-
if (thisEnd === void 0) thisEnd = this.length;
|
|
479
|
-
if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) throw new RangeError("out of range index");
|
|
480
|
-
if (thisStart >= thisEnd && start >= end) return 0;
|
|
481
|
-
if (thisStart >= thisEnd) return -1;
|
|
482
|
-
if (start >= end) return 1;
|
|
483
|
-
start >>>= 0;
|
|
484
|
-
end >>>= 0;
|
|
485
|
-
thisStart >>>= 0;
|
|
486
|
-
thisEnd >>>= 0;
|
|
487
|
-
if (this === target) return 0;
|
|
488
|
-
let x = thisEnd - thisStart;
|
|
489
|
-
let y = end - start;
|
|
490
|
-
const len$1 = Math.min(x, y);
|
|
491
|
-
const thisCopy = this.slice(thisStart, thisEnd);
|
|
492
|
-
const targetCopy = target.slice(start, end);
|
|
493
|
-
for (let i$1 = 0; i$1 < len$1; ++i$1) if (thisCopy[i$1] !== targetCopy[i$1]) {
|
|
494
|
-
x = thisCopy[i$1];
|
|
495
|
-
y = targetCopy[i$1];
|
|
496
|
-
break;
|
|
497
|
-
}
|
|
498
|
-
if (x < y) return -1;
|
|
499
|
-
if (y < x) return 1;
|
|
500
|
-
return 0;
|
|
501
|
-
};
|
|
502
|
-
function bidirectionalIndexOf(buffer$1, val, byteOffset, encoding, dir) {
|
|
503
|
-
if (buffer$1.length === 0) return -1;
|
|
504
|
-
if (typeof byteOffset === "string") {
|
|
505
|
-
encoding = byteOffset;
|
|
506
|
-
byteOffset = 0;
|
|
507
|
-
} else if (byteOffset > 2147483647) byteOffset = 2147483647;
|
|
508
|
-
else if (byteOffset < -2147483648) byteOffset = -2147483648;
|
|
509
|
-
byteOffset = +byteOffset;
|
|
510
|
-
if (numberIsNaN(byteOffset)) byteOffset = dir ? 0 : buffer$1.length - 1;
|
|
511
|
-
if (byteOffset < 0) byteOffset = buffer$1.length + byteOffset;
|
|
512
|
-
if (byteOffset >= buffer$1.length) if (dir) return -1;
|
|
513
|
-
else byteOffset = buffer$1.length - 1;
|
|
514
|
-
else if (byteOffset < 0) if (dir) byteOffset = 0;
|
|
515
|
-
else return -1;
|
|
516
|
-
if (typeof val === "string") val = Buffer$2.from(val, encoding);
|
|
517
|
-
if (Buffer$2.isBuffer(val)) {
|
|
518
|
-
if (val.length === 0) return -1;
|
|
519
|
-
return arrayIndexOf(buffer$1, val, byteOffset, encoding, dir);
|
|
520
|
-
} else if (typeof val === "number") {
|
|
521
|
-
val = val & 255;
|
|
522
|
-
if (typeof GlobalUint8Array.prototype.indexOf === "function") if (dir) return GlobalUint8Array.prototype.indexOf.call(buffer$1, val, byteOffset);
|
|
523
|
-
else return GlobalUint8Array.prototype.lastIndexOf.call(buffer$1, val, byteOffset);
|
|
524
|
-
return arrayIndexOf(buffer$1, [val], byteOffset, encoding, dir);
|
|
525
|
-
}
|
|
526
|
-
throw new TypeError("val must be string, number or Buffer");
|
|
527
|
-
}
|
|
528
|
-
function arrayIndexOf(arr, val, byteOffset, encoding, dir) {
|
|
529
|
-
let indexSize = 1;
|
|
530
|
-
let arrLength = arr.length;
|
|
531
|
-
let valLength = val.length;
|
|
532
|
-
if (encoding !== void 0) {
|
|
533
|
-
encoding = String(encoding).toLowerCase();
|
|
534
|
-
if (encoding === "ucs2" || encoding === "ucs-2" || encoding === "utf16le" || encoding === "utf-16le") {
|
|
535
|
-
if (arr.length < 2 || val.length < 2) return -1;
|
|
536
|
-
indexSize = 2;
|
|
537
|
-
arrLength /= 2;
|
|
538
|
-
valLength /= 2;
|
|
539
|
-
byteOffset /= 2;
|
|
540
|
-
}
|
|
541
|
-
}
|
|
542
|
-
function read(buf, i$2) {
|
|
543
|
-
if (indexSize === 1) return buf[i$2];
|
|
544
|
-
else return buf.readUInt16BE(i$2 * indexSize);
|
|
545
|
-
}
|
|
546
|
-
let i$1;
|
|
547
|
-
if (dir) {
|
|
548
|
-
let foundIndex = -1;
|
|
549
|
-
for (i$1 = byteOffset; i$1 < arrLength; i$1++) if (read(arr, i$1) === read(val, foundIndex === -1 ? 0 : i$1 - foundIndex)) {
|
|
550
|
-
if (foundIndex === -1) foundIndex = i$1;
|
|
551
|
-
if (i$1 - foundIndex + 1 === valLength) return foundIndex * indexSize;
|
|
552
|
-
} else {
|
|
553
|
-
if (foundIndex !== -1) i$1 -= i$1 - foundIndex;
|
|
554
|
-
foundIndex = -1;
|
|
555
|
-
}
|
|
556
|
-
} else {
|
|
557
|
-
if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength;
|
|
558
|
-
for (i$1 = byteOffset; i$1 >= 0; i$1--) {
|
|
559
|
-
let found = true;
|
|
560
|
-
for (let j = 0; j < valLength; j++) if (read(arr, i$1 + j) !== read(val, j)) {
|
|
561
|
-
found = false;
|
|
562
|
-
break;
|
|
563
|
-
}
|
|
564
|
-
if (found) return i$1;
|
|
565
|
-
}
|
|
566
|
-
}
|
|
567
|
-
return -1;
|
|
568
|
-
}
|
|
569
|
-
Buffer$2.prototype.includes = function includes(val, byteOffset, encoding) {
|
|
570
|
-
return this.indexOf(val, byteOffset, encoding) !== -1;
|
|
571
|
-
};
|
|
572
|
-
Buffer$2.prototype.indexOf = function indexOf(val, byteOffset, encoding) {
|
|
573
|
-
return bidirectionalIndexOf(this, val, byteOffset, encoding, true);
|
|
574
|
-
};
|
|
575
|
-
Buffer$2.prototype.lastIndexOf = function lastIndexOf(val, byteOffset, encoding) {
|
|
576
|
-
return bidirectionalIndexOf(this, val, byteOffset, encoding, false);
|
|
577
|
-
};
|
|
578
|
-
function hexWrite(buf, string, offset, length) {
|
|
579
|
-
offset = Number(offset) || 0;
|
|
580
|
-
const remaining = buf.length - offset;
|
|
581
|
-
if (!length) length = remaining;
|
|
582
|
-
else {
|
|
583
|
-
length = Number(length);
|
|
584
|
-
if (length > remaining) length = remaining;
|
|
585
|
-
}
|
|
586
|
-
const strLen = string.length;
|
|
587
|
-
if (length > strLen / 2) length = strLen / 2;
|
|
588
|
-
let i$1;
|
|
589
|
-
for (i$1 = 0; i$1 < length; ++i$1) {
|
|
590
|
-
const parsed = parseInt(string.substr(i$1 * 2, 2), 16);
|
|
591
|
-
if (numberIsNaN(parsed)) return i$1;
|
|
592
|
-
buf[offset + i$1] = parsed;
|
|
593
|
-
}
|
|
594
|
-
return i$1;
|
|
595
|
-
}
|
|
596
|
-
function utf8Write(buf, string, offset, length) {
|
|
597
|
-
return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length);
|
|
598
|
-
}
|
|
599
|
-
function asciiWrite(buf, string, offset, length) {
|
|
600
|
-
return blitBuffer(asciiToBytes(string), buf, offset, length);
|
|
601
|
-
}
|
|
602
|
-
function base64Write(buf, string, offset, length) {
|
|
603
|
-
return blitBuffer(base64ToBytes(string), buf, offset, length);
|
|
604
|
-
}
|
|
605
|
-
function ucs2Write(buf, string, offset, length) {
|
|
606
|
-
return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length);
|
|
607
|
-
}
|
|
608
|
-
Buffer$2.prototype.write = function write(string, offset, length, encoding) {
|
|
609
|
-
if (offset === void 0) {
|
|
610
|
-
encoding = "utf8";
|
|
611
|
-
length = this.length;
|
|
612
|
-
offset = 0;
|
|
613
|
-
} else if (length === void 0 && typeof offset === "string") {
|
|
614
|
-
encoding = offset;
|
|
615
|
-
length = this.length;
|
|
616
|
-
offset = 0;
|
|
617
|
-
} else if (isFinite(offset)) {
|
|
618
|
-
offset = offset >>> 0;
|
|
619
|
-
if (isFinite(length)) {
|
|
620
|
-
length = length >>> 0;
|
|
621
|
-
if (encoding === void 0) encoding = "utf8";
|
|
622
|
-
} else {
|
|
623
|
-
encoding = length;
|
|
624
|
-
length = void 0;
|
|
625
|
-
}
|
|
626
|
-
} else throw new Error("Buffer.write(string, encoding, offset[, length]) is no longer supported");
|
|
627
|
-
const remaining = this.length - offset;
|
|
628
|
-
if (length === void 0 || length > remaining) length = remaining;
|
|
629
|
-
if (string.length > 0 && (length < 0 || offset < 0) || offset > this.length) throw new RangeError("Attempt to write outside buffer bounds");
|
|
630
|
-
if (!encoding) encoding = "utf8";
|
|
631
|
-
let loweredCase = false;
|
|
632
|
-
for (;;) switch (encoding) {
|
|
633
|
-
case "hex": return hexWrite(this, string, offset, length);
|
|
634
|
-
case "utf8":
|
|
635
|
-
case "utf-8": return utf8Write(this, string, offset, length);
|
|
636
|
-
case "ascii":
|
|
637
|
-
case "latin1":
|
|
638
|
-
case "binary": return asciiWrite(this, string, offset, length);
|
|
639
|
-
case "base64": return base64Write(this, string, offset, length);
|
|
640
|
-
case "ucs2":
|
|
641
|
-
case "ucs-2":
|
|
642
|
-
case "utf16le":
|
|
643
|
-
case "utf-16le": return ucs2Write(this, string, offset, length);
|
|
644
|
-
default:
|
|
645
|
-
if (loweredCase) throw new TypeError("Unknown encoding: " + encoding);
|
|
646
|
-
encoding = ("" + encoding).toLowerCase();
|
|
647
|
-
loweredCase = true;
|
|
648
|
-
}
|
|
649
|
-
};
|
|
650
|
-
Buffer$2.prototype.toJSON = function toJSON() {
|
|
651
|
-
return {
|
|
652
|
-
type: "Buffer",
|
|
653
|
-
data: Array.prototype.slice.call(this._arr || this, 0)
|
|
654
|
-
};
|
|
655
|
-
};
|
|
656
|
-
function base64Slice(buf, start, end) {
|
|
657
|
-
if (start === 0 && end === buf.length) return base64.fromByteArray(buf);
|
|
658
|
-
else return base64.fromByteArray(buf.slice(start, end));
|
|
659
|
-
}
|
|
660
|
-
function utf8Slice(buf, start, end) {
|
|
661
|
-
end = Math.min(buf.length, end);
|
|
662
|
-
const res = [];
|
|
663
|
-
let i$1 = start;
|
|
664
|
-
while (i$1 < end) {
|
|
665
|
-
const firstByte = buf[i$1];
|
|
666
|
-
let codePoint = null;
|
|
667
|
-
let bytesPerSequence = firstByte > 239 ? 4 : firstByte > 223 ? 3 : firstByte > 191 ? 2 : 1;
|
|
668
|
-
if (i$1 + bytesPerSequence <= end) {
|
|
669
|
-
let secondByte, thirdByte, fourthByte, tempCodePoint;
|
|
670
|
-
switch (bytesPerSequence) {
|
|
671
|
-
case 1:
|
|
672
|
-
if (firstByte < 128) codePoint = firstByte;
|
|
673
|
-
break;
|
|
674
|
-
case 2:
|
|
675
|
-
secondByte = buf[i$1 + 1];
|
|
676
|
-
if ((secondByte & 192) === 128) {
|
|
677
|
-
tempCodePoint = (firstByte & 31) << 6 | secondByte & 63;
|
|
678
|
-
if (tempCodePoint > 127) codePoint = tempCodePoint;
|
|
679
|
-
}
|
|
680
|
-
break;
|
|
681
|
-
case 3:
|
|
682
|
-
secondByte = buf[i$1 + 1];
|
|
683
|
-
thirdByte = buf[i$1 + 2];
|
|
684
|
-
if ((secondByte & 192) === 128 && (thirdByte & 192) === 128) {
|
|
685
|
-
tempCodePoint = (firstByte & 15) << 12 | (secondByte & 63) << 6 | thirdByte & 63;
|
|
686
|
-
if (tempCodePoint > 2047 && (tempCodePoint < 55296 || tempCodePoint > 57343)) codePoint = tempCodePoint;
|
|
687
|
-
}
|
|
688
|
-
break;
|
|
689
|
-
case 4:
|
|
690
|
-
secondByte = buf[i$1 + 1];
|
|
691
|
-
thirdByte = buf[i$1 + 2];
|
|
692
|
-
fourthByte = buf[i$1 + 3];
|
|
693
|
-
if ((secondByte & 192) === 128 && (thirdByte & 192) === 128 && (fourthByte & 192) === 128) {
|
|
694
|
-
tempCodePoint = (firstByte & 15) << 18 | (secondByte & 63) << 12 | (thirdByte & 63) << 6 | fourthByte & 63;
|
|
695
|
-
if (tempCodePoint > 65535 && tempCodePoint < 1114112) codePoint = tempCodePoint;
|
|
696
|
-
}
|
|
697
|
-
}
|
|
698
|
-
}
|
|
699
|
-
if (codePoint === null) {
|
|
700
|
-
codePoint = 65533;
|
|
701
|
-
bytesPerSequence = 1;
|
|
702
|
-
} else if (codePoint > 65535) {
|
|
703
|
-
codePoint -= 65536;
|
|
704
|
-
res.push(codePoint >>> 10 & 1023 | 55296);
|
|
705
|
-
codePoint = 56320 | codePoint & 1023;
|
|
706
|
-
}
|
|
707
|
-
res.push(codePoint);
|
|
708
|
-
i$1 += bytesPerSequence;
|
|
709
|
-
}
|
|
710
|
-
return decodeCodePointsArray(res);
|
|
711
|
-
}
|
|
712
|
-
const MAX_ARGUMENTS_LENGTH = 4096;
|
|
713
|
-
function decodeCodePointsArray(codePoints) {
|
|
714
|
-
const len$1 = codePoints.length;
|
|
715
|
-
if (len$1 <= MAX_ARGUMENTS_LENGTH) return String.fromCharCode.apply(String, codePoints);
|
|
716
|
-
let res = "";
|
|
717
|
-
let i$1 = 0;
|
|
718
|
-
while (i$1 < len$1) res += String.fromCharCode.apply(String, codePoints.slice(i$1, i$1 += MAX_ARGUMENTS_LENGTH));
|
|
719
|
-
return res;
|
|
720
|
-
}
|
|
721
|
-
function asciiSlice(buf, start, end) {
|
|
722
|
-
let ret = "";
|
|
723
|
-
end = Math.min(buf.length, end);
|
|
724
|
-
for (let i$1 = start; i$1 < end; ++i$1) ret += String.fromCharCode(buf[i$1] & 127);
|
|
725
|
-
return ret;
|
|
726
|
-
}
|
|
727
|
-
function latin1Slice(buf, start, end) {
|
|
728
|
-
let ret = "";
|
|
729
|
-
end = Math.min(buf.length, end);
|
|
730
|
-
for (let i$1 = start; i$1 < end; ++i$1) ret += String.fromCharCode(buf[i$1]);
|
|
731
|
-
return ret;
|
|
732
|
-
}
|
|
733
|
-
function hexSlice(buf, start, end) {
|
|
734
|
-
const len$1 = buf.length;
|
|
735
|
-
if (!start || start < 0) start = 0;
|
|
736
|
-
if (!end || end < 0 || end > len$1) end = len$1;
|
|
737
|
-
let out = "";
|
|
738
|
-
for (let i$1 = start; i$1 < end; ++i$1) out += hexSliceLookupTable[buf[i$1]];
|
|
739
|
-
return out;
|
|
740
|
-
}
|
|
741
|
-
function utf16leSlice(buf, start, end) {
|
|
742
|
-
const bytes = buf.slice(start, end);
|
|
743
|
-
let res = "";
|
|
744
|
-
for (let i$1 = 0; i$1 < bytes.length - 1; i$1 += 2) res += String.fromCharCode(bytes[i$1] + bytes[i$1 + 1] * 256);
|
|
745
|
-
return res;
|
|
746
|
-
}
|
|
747
|
-
Buffer$2.prototype.slice = function slice(start, end) {
|
|
748
|
-
const len$1 = this.length;
|
|
749
|
-
start = ~~start;
|
|
750
|
-
end = end === void 0 ? len$1 : ~~end;
|
|
751
|
-
if (start < 0) {
|
|
752
|
-
start += len$1;
|
|
753
|
-
if (start < 0) start = 0;
|
|
754
|
-
} else if (start > len$1) start = len$1;
|
|
755
|
-
if (end < 0) {
|
|
756
|
-
end += len$1;
|
|
757
|
-
if (end < 0) end = 0;
|
|
758
|
-
} else if (end > len$1) end = len$1;
|
|
759
|
-
if (end < start) end = start;
|
|
760
|
-
const newBuf = this.subarray(start, end);
|
|
761
|
-
Object.setPrototypeOf(newBuf, Buffer$2.prototype);
|
|
762
|
-
return newBuf;
|
|
763
|
-
};
|
|
764
|
-
function checkOffset(offset, ext, length) {
|
|
765
|
-
if (offset % 1 !== 0 || offset < 0) throw new RangeError("offset is not uint");
|
|
766
|
-
if (offset + ext > length) throw new RangeError("Trying to access beyond buffer length");
|
|
767
|
-
}
|
|
768
|
-
Buffer$2.prototype.readUintLE = Buffer$2.prototype.readUIntLE = function readUIntLE(offset, byteLength$2, noAssert) {
|
|
769
|
-
offset = offset >>> 0;
|
|
770
|
-
byteLength$2 = byteLength$2 >>> 0;
|
|
771
|
-
if (!noAssert) checkOffset(offset, byteLength$2, this.length);
|
|
772
|
-
let val = this[offset];
|
|
773
|
-
let mul = 1;
|
|
774
|
-
let i$1 = 0;
|
|
775
|
-
while (++i$1 < byteLength$2 && (mul *= 256)) val += this[offset + i$1] * mul;
|
|
776
|
-
return val;
|
|
777
|
-
};
|
|
778
|
-
Buffer$2.prototype.readUintBE = Buffer$2.prototype.readUIntBE = function readUIntBE(offset, byteLength$2, noAssert) {
|
|
779
|
-
offset = offset >>> 0;
|
|
780
|
-
byteLength$2 = byteLength$2 >>> 0;
|
|
781
|
-
if (!noAssert) checkOffset(offset, byteLength$2, this.length);
|
|
782
|
-
let val = this[offset + --byteLength$2];
|
|
783
|
-
let mul = 1;
|
|
784
|
-
while (byteLength$2 > 0 && (mul *= 256)) val += this[offset + --byteLength$2] * mul;
|
|
785
|
-
return val;
|
|
786
|
-
};
|
|
787
|
-
Buffer$2.prototype.readUint8 = Buffer$2.prototype.readUInt8 = function readUInt8(offset, noAssert) {
|
|
788
|
-
offset = offset >>> 0;
|
|
789
|
-
if (!noAssert) checkOffset(offset, 1, this.length);
|
|
790
|
-
return this[offset];
|
|
791
|
-
};
|
|
792
|
-
Buffer$2.prototype.readUint16LE = Buffer$2.prototype.readUInt16LE = function readUInt16LE(offset, noAssert) {
|
|
793
|
-
offset = offset >>> 0;
|
|
794
|
-
if (!noAssert) checkOffset(offset, 2, this.length);
|
|
795
|
-
return this[offset] | this[offset + 1] << 8;
|
|
796
|
-
};
|
|
797
|
-
Buffer$2.prototype.readUint16BE = Buffer$2.prototype.readUInt16BE = function readUInt16BE(offset, noAssert) {
|
|
798
|
-
offset = offset >>> 0;
|
|
799
|
-
if (!noAssert) checkOffset(offset, 2, this.length);
|
|
800
|
-
return this[offset] << 8 | this[offset + 1];
|
|
801
|
-
};
|
|
802
|
-
Buffer$2.prototype.readUint32LE = Buffer$2.prototype.readUInt32LE = function readUInt32LE(offset, noAssert) {
|
|
803
|
-
offset = offset >>> 0;
|
|
804
|
-
if (!noAssert) checkOffset(offset, 4, this.length);
|
|
805
|
-
return (this[offset] | this[offset + 1] << 8 | this[offset + 2] << 16) + this[offset + 3] * 16777216;
|
|
806
|
-
};
|
|
807
|
-
Buffer$2.prototype.readUint32BE = Buffer$2.prototype.readUInt32BE = function readUInt32BE(offset, noAssert) {
|
|
808
|
-
offset = offset >>> 0;
|
|
809
|
-
if (!noAssert) checkOffset(offset, 4, this.length);
|
|
810
|
-
return this[offset] * 16777216 + (this[offset + 1] << 16 | this[offset + 2] << 8 | this[offset + 3]);
|
|
811
|
-
};
|
|
812
|
-
Buffer$2.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE(offset) {
|
|
813
|
-
offset = offset >>> 0;
|
|
814
|
-
validateNumber(offset, "offset");
|
|
815
|
-
const first = this[offset];
|
|
816
|
-
const last = this[offset + 7];
|
|
817
|
-
if (first === void 0 || last === void 0) boundsError(offset, this.length - 8);
|
|
818
|
-
const lo = first + this[++offset] * 2 ** 8 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 24;
|
|
819
|
-
const hi = this[++offset] + this[++offset] * 2 ** 8 + this[++offset] * 2 ** 16 + last * 2 ** 24;
|
|
820
|
-
return BigInt(lo) + (BigInt(hi) << BigInt(32));
|
|
821
|
-
});
|
|
822
|
-
Buffer$2.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE(offset) {
|
|
823
|
-
offset = offset >>> 0;
|
|
824
|
-
validateNumber(offset, "offset");
|
|
825
|
-
const first = this[offset];
|
|
826
|
-
const last = this[offset + 7];
|
|
827
|
-
if (first === void 0 || last === void 0) boundsError(offset, this.length - 8);
|
|
828
|
-
const hi = first * 2 ** 24 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + this[++offset];
|
|
829
|
-
const lo = this[++offset] * 2 ** 24 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + last;
|
|
830
|
-
return (BigInt(hi) << BigInt(32)) + BigInt(lo);
|
|
831
|
-
});
|
|
832
|
-
Buffer$2.prototype.readIntLE = function readIntLE(offset, byteLength$2, noAssert) {
|
|
833
|
-
offset = offset >>> 0;
|
|
834
|
-
byteLength$2 = byteLength$2 >>> 0;
|
|
835
|
-
if (!noAssert) checkOffset(offset, byteLength$2, this.length);
|
|
836
|
-
let val = this[offset];
|
|
837
|
-
let mul = 1;
|
|
838
|
-
let i$1 = 0;
|
|
839
|
-
while (++i$1 < byteLength$2 && (mul *= 256)) val += this[offset + i$1] * mul;
|
|
840
|
-
mul *= 128;
|
|
841
|
-
if (val >= mul) val -= Math.pow(2, 8 * byteLength$2);
|
|
842
|
-
return val;
|
|
843
|
-
};
|
|
844
|
-
Buffer$2.prototype.readIntBE = function readIntBE(offset, byteLength$2, noAssert) {
|
|
845
|
-
offset = offset >>> 0;
|
|
846
|
-
byteLength$2 = byteLength$2 >>> 0;
|
|
847
|
-
if (!noAssert) checkOffset(offset, byteLength$2, this.length);
|
|
848
|
-
let i$1 = byteLength$2;
|
|
849
|
-
let mul = 1;
|
|
850
|
-
let val = this[offset + --i$1];
|
|
851
|
-
while (i$1 > 0 && (mul *= 256)) val += this[offset + --i$1] * mul;
|
|
852
|
-
mul *= 128;
|
|
853
|
-
if (val >= mul) val -= Math.pow(2, 8 * byteLength$2);
|
|
854
|
-
return val;
|
|
855
|
-
};
|
|
856
|
-
Buffer$2.prototype.readInt8 = function readInt8(offset, noAssert) {
|
|
857
|
-
offset = offset >>> 0;
|
|
858
|
-
if (!noAssert) checkOffset(offset, 1, this.length);
|
|
859
|
-
if (!(this[offset] & 128)) return this[offset];
|
|
860
|
-
return (255 - this[offset] + 1) * -1;
|
|
861
|
-
};
|
|
862
|
-
Buffer$2.prototype.readInt16LE = function readInt16LE(offset, noAssert) {
|
|
863
|
-
offset = offset >>> 0;
|
|
864
|
-
if (!noAssert) checkOffset(offset, 2, this.length);
|
|
865
|
-
const val = this[offset] | this[offset + 1] << 8;
|
|
866
|
-
return val & 32768 ? val | 4294901760 : val;
|
|
867
|
-
};
|
|
868
|
-
Buffer$2.prototype.readInt16BE = function readInt16BE(offset, noAssert) {
|
|
869
|
-
offset = offset >>> 0;
|
|
870
|
-
if (!noAssert) checkOffset(offset, 2, this.length);
|
|
871
|
-
const val = this[offset + 1] | this[offset] << 8;
|
|
872
|
-
return val & 32768 ? val | 4294901760 : val;
|
|
873
|
-
};
|
|
874
|
-
Buffer$2.prototype.readInt32LE = function readInt32LE(offset, noAssert) {
|
|
875
|
-
offset = offset >>> 0;
|
|
876
|
-
if (!noAssert) checkOffset(offset, 4, this.length);
|
|
877
|
-
return this[offset] | this[offset + 1] << 8 | this[offset + 2] << 16 | this[offset + 3] << 24;
|
|
878
|
-
};
|
|
879
|
-
Buffer$2.prototype.readInt32BE = function readInt32BE(offset, noAssert) {
|
|
880
|
-
offset = offset >>> 0;
|
|
881
|
-
if (!noAssert) checkOffset(offset, 4, this.length);
|
|
882
|
-
return this[offset] << 24 | this[offset + 1] << 16 | this[offset + 2] << 8 | this[offset + 3];
|
|
883
|
-
};
|
|
884
|
-
Buffer$2.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE(offset) {
|
|
885
|
-
offset = offset >>> 0;
|
|
886
|
-
validateNumber(offset, "offset");
|
|
887
|
-
const first = this[offset];
|
|
888
|
-
const last = this[offset + 7];
|
|
889
|
-
if (first === void 0 || last === void 0) boundsError(offset, this.length - 8);
|
|
890
|
-
const val = this[offset + 4] + this[offset + 5] * 2 ** 8 + this[offset + 6] * 2 ** 16 + (last << 24);
|
|
891
|
-
return (BigInt(val) << BigInt(32)) + BigInt(first + this[++offset] * 2 ** 8 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 24);
|
|
892
|
-
});
|
|
893
|
-
Buffer$2.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE(offset) {
|
|
894
|
-
offset = offset >>> 0;
|
|
895
|
-
validateNumber(offset, "offset");
|
|
896
|
-
const first = this[offset];
|
|
897
|
-
const last = this[offset + 7];
|
|
898
|
-
if (first === void 0 || last === void 0) boundsError(offset, this.length - 8);
|
|
899
|
-
const val = (first << 24) + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + this[++offset];
|
|
900
|
-
return (BigInt(val) << BigInt(32)) + BigInt(this[++offset] * 2 ** 24 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + last);
|
|
901
|
-
});
|
|
902
|
-
Buffer$2.prototype.readFloatLE = function readFloatLE(offset, noAssert) {
|
|
903
|
-
offset = offset >>> 0;
|
|
904
|
-
if (!noAssert) checkOffset(offset, 4, this.length);
|
|
905
|
-
return ieee754$1.read(this, offset, true, 23, 4);
|
|
906
|
-
};
|
|
907
|
-
Buffer$2.prototype.readFloatBE = function readFloatBE(offset, noAssert) {
|
|
908
|
-
offset = offset >>> 0;
|
|
909
|
-
if (!noAssert) checkOffset(offset, 4, this.length);
|
|
910
|
-
return ieee754$1.read(this, offset, false, 23, 4);
|
|
911
|
-
};
|
|
912
|
-
Buffer$2.prototype.readDoubleLE = function readDoubleLE(offset, noAssert) {
|
|
913
|
-
offset = offset >>> 0;
|
|
914
|
-
if (!noAssert) checkOffset(offset, 8, this.length);
|
|
915
|
-
return ieee754$1.read(this, offset, true, 52, 8);
|
|
916
|
-
};
|
|
917
|
-
Buffer$2.prototype.readDoubleBE = function readDoubleBE(offset, noAssert) {
|
|
918
|
-
offset = offset >>> 0;
|
|
919
|
-
if (!noAssert) checkOffset(offset, 8, this.length);
|
|
920
|
-
return ieee754$1.read(this, offset, false, 52, 8);
|
|
921
|
-
};
|
|
922
|
-
function checkInt(buf, value, offset, ext, max, min) {
|
|
923
|
-
if (!Buffer$2.isBuffer(buf)) throw new TypeError("\"buffer\" argument must be a Buffer instance");
|
|
924
|
-
if (value > max || value < min) throw new RangeError("\"value\" argument is out of bounds");
|
|
925
|
-
if (offset + ext > buf.length) throw new RangeError("Index out of range");
|
|
926
|
-
}
|
|
927
|
-
Buffer$2.prototype.writeUintLE = Buffer$2.prototype.writeUIntLE = function writeUIntLE(value, offset, byteLength$2, noAssert) {
|
|
928
|
-
value = +value;
|
|
929
|
-
offset = offset >>> 0;
|
|
930
|
-
byteLength$2 = byteLength$2 >>> 0;
|
|
931
|
-
if (!noAssert) {
|
|
932
|
-
const maxBytes = Math.pow(2, 8 * byteLength$2) - 1;
|
|
933
|
-
checkInt(this, value, offset, byteLength$2, maxBytes, 0);
|
|
934
|
-
}
|
|
935
|
-
let mul = 1;
|
|
936
|
-
let i$1 = 0;
|
|
937
|
-
this[offset] = value & 255;
|
|
938
|
-
while (++i$1 < byteLength$2 && (mul *= 256)) this[offset + i$1] = value / mul & 255;
|
|
939
|
-
return offset + byteLength$2;
|
|
940
|
-
};
|
|
941
|
-
Buffer$2.prototype.writeUintBE = Buffer$2.prototype.writeUIntBE = function writeUIntBE(value, offset, byteLength$2, noAssert) {
|
|
942
|
-
value = +value;
|
|
943
|
-
offset = offset >>> 0;
|
|
944
|
-
byteLength$2 = byteLength$2 >>> 0;
|
|
945
|
-
if (!noAssert) {
|
|
946
|
-
const maxBytes = Math.pow(2, 8 * byteLength$2) - 1;
|
|
947
|
-
checkInt(this, value, offset, byteLength$2, maxBytes, 0);
|
|
948
|
-
}
|
|
949
|
-
let i$1 = byteLength$2 - 1;
|
|
950
|
-
let mul = 1;
|
|
951
|
-
this[offset + i$1] = value & 255;
|
|
952
|
-
while (--i$1 >= 0 && (mul *= 256)) this[offset + i$1] = value / mul & 255;
|
|
953
|
-
return offset + byteLength$2;
|
|
954
|
-
};
|
|
955
|
-
Buffer$2.prototype.writeUint8 = Buffer$2.prototype.writeUInt8 = function writeUInt8(value, offset, noAssert) {
|
|
956
|
-
value = +value;
|
|
957
|
-
offset = offset >>> 0;
|
|
958
|
-
if (!noAssert) checkInt(this, value, offset, 1, 255, 0);
|
|
959
|
-
this[offset] = value & 255;
|
|
960
|
-
return offset + 1;
|
|
961
|
-
};
|
|
962
|
-
Buffer$2.prototype.writeUint16LE = Buffer$2.prototype.writeUInt16LE = function writeUInt16LE(value, offset, noAssert) {
|
|
963
|
-
value = +value;
|
|
964
|
-
offset = offset >>> 0;
|
|
965
|
-
if (!noAssert) checkInt(this, value, offset, 2, 65535, 0);
|
|
966
|
-
this[offset] = value & 255;
|
|
967
|
-
this[offset + 1] = value >>> 8;
|
|
968
|
-
return offset + 2;
|
|
969
|
-
};
|
|
970
|
-
Buffer$2.prototype.writeUint16BE = Buffer$2.prototype.writeUInt16BE = function writeUInt16BE(value, offset, noAssert) {
|
|
971
|
-
value = +value;
|
|
972
|
-
offset = offset >>> 0;
|
|
973
|
-
if (!noAssert) checkInt(this, value, offset, 2, 65535, 0);
|
|
974
|
-
this[offset] = value >>> 8;
|
|
975
|
-
this[offset + 1] = value & 255;
|
|
976
|
-
return offset + 2;
|
|
977
|
-
};
|
|
978
|
-
Buffer$2.prototype.writeUint32LE = Buffer$2.prototype.writeUInt32LE = function writeUInt32LE(value, offset, noAssert) {
|
|
979
|
-
value = +value;
|
|
980
|
-
offset = offset >>> 0;
|
|
981
|
-
if (!noAssert) checkInt(this, value, offset, 4, 4294967295, 0);
|
|
982
|
-
this[offset + 3] = value >>> 24;
|
|
983
|
-
this[offset + 2] = value >>> 16;
|
|
984
|
-
this[offset + 1] = value >>> 8;
|
|
985
|
-
this[offset] = value & 255;
|
|
986
|
-
return offset + 4;
|
|
987
|
-
};
|
|
988
|
-
Buffer$2.prototype.writeUint32BE = Buffer$2.prototype.writeUInt32BE = function writeUInt32BE(value, offset, noAssert) {
|
|
989
|
-
value = +value;
|
|
990
|
-
offset = offset >>> 0;
|
|
991
|
-
if (!noAssert) checkInt(this, value, offset, 4, 4294967295, 0);
|
|
992
|
-
this[offset] = value >>> 24;
|
|
993
|
-
this[offset + 1] = value >>> 16;
|
|
994
|
-
this[offset + 2] = value >>> 8;
|
|
995
|
-
this[offset + 3] = value & 255;
|
|
996
|
-
return offset + 4;
|
|
997
|
-
};
|
|
998
|
-
function wrtBigUInt64LE(buf, value, offset, min, max) {
|
|
999
|
-
checkIntBI(value, min, max, buf, offset, 7);
|
|
1000
|
-
let lo = Number(value & BigInt(4294967295));
|
|
1001
|
-
buf[offset++] = lo;
|
|
1002
|
-
lo = lo >> 8;
|
|
1003
|
-
buf[offset++] = lo;
|
|
1004
|
-
lo = lo >> 8;
|
|
1005
|
-
buf[offset++] = lo;
|
|
1006
|
-
lo = lo >> 8;
|
|
1007
|
-
buf[offset++] = lo;
|
|
1008
|
-
let hi = Number(value >> BigInt(32) & BigInt(4294967295));
|
|
1009
|
-
buf[offset++] = hi;
|
|
1010
|
-
hi = hi >> 8;
|
|
1011
|
-
buf[offset++] = hi;
|
|
1012
|
-
hi = hi >> 8;
|
|
1013
|
-
buf[offset++] = hi;
|
|
1014
|
-
hi = hi >> 8;
|
|
1015
|
-
buf[offset++] = hi;
|
|
1016
|
-
return offset;
|
|
1017
|
-
}
|
|
1018
|
-
function wrtBigUInt64BE(buf, value, offset, min, max) {
|
|
1019
|
-
checkIntBI(value, min, max, buf, offset, 7);
|
|
1020
|
-
let lo = Number(value & BigInt(4294967295));
|
|
1021
|
-
buf[offset + 7] = lo;
|
|
1022
|
-
lo = lo >> 8;
|
|
1023
|
-
buf[offset + 6] = lo;
|
|
1024
|
-
lo = lo >> 8;
|
|
1025
|
-
buf[offset + 5] = lo;
|
|
1026
|
-
lo = lo >> 8;
|
|
1027
|
-
buf[offset + 4] = lo;
|
|
1028
|
-
let hi = Number(value >> BigInt(32) & BigInt(4294967295));
|
|
1029
|
-
buf[offset + 3] = hi;
|
|
1030
|
-
hi = hi >> 8;
|
|
1031
|
-
buf[offset + 2] = hi;
|
|
1032
|
-
hi = hi >> 8;
|
|
1033
|
-
buf[offset + 1] = hi;
|
|
1034
|
-
hi = hi >> 8;
|
|
1035
|
-
buf[offset] = hi;
|
|
1036
|
-
return offset + 8;
|
|
1037
|
-
}
|
|
1038
|
-
Buffer$2.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE(value, offset = 0) {
|
|
1039
|
-
return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt("0xffffffffffffffff"));
|
|
1040
|
-
});
|
|
1041
|
-
Buffer$2.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE(value, offset = 0) {
|
|
1042
|
-
return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt("0xffffffffffffffff"));
|
|
1043
|
-
});
|
|
1044
|
-
Buffer$2.prototype.writeIntLE = function writeIntLE(value, offset, byteLength$2, noAssert) {
|
|
1045
|
-
value = +value;
|
|
1046
|
-
offset = offset >>> 0;
|
|
1047
|
-
if (!noAssert) {
|
|
1048
|
-
const limit = Math.pow(2, 8 * byteLength$2 - 1);
|
|
1049
|
-
checkInt(this, value, offset, byteLength$2, limit - 1, -limit);
|
|
1050
|
-
}
|
|
1051
|
-
let i$1 = 0;
|
|
1052
|
-
let mul = 1;
|
|
1053
|
-
let sub = 0;
|
|
1054
|
-
this[offset] = value & 255;
|
|
1055
|
-
while (++i$1 < byteLength$2 && (mul *= 256)) {
|
|
1056
|
-
if (value < 0 && sub === 0 && this[offset + i$1 - 1] !== 0) sub = 1;
|
|
1057
|
-
this[offset + i$1] = (value / mul >> 0) - sub & 255;
|
|
1058
|
-
}
|
|
1059
|
-
return offset + byteLength$2;
|
|
1060
|
-
};
|
|
1061
|
-
Buffer$2.prototype.writeIntBE = function writeIntBE(value, offset, byteLength$2, noAssert) {
|
|
1062
|
-
value = +value;
|
|
1063
|
-
offset = offset >>> 0;
|
|
1064
|
-
if (!noAssert) {
|
|
1065
|
-
const limit = Math.pow(2, 8 * byteLength$2 - 1);
|
|
1066
|
-
checkInt(this, value, offset, byteLength$2, limit - 1, -limit);
|
|
1067
|
-
}
|
|
1068
|
-
let i$1 = byteLength$2 - 1;
|
|
1069
|
-
let mul = 1;
|
|
1070
|
-
let sub = 0;
|
|
1071
|
-
this[offset + i$1] = value & 255;
|
|
1072
|
-
while (--i$1 >= 0 && (mul *= 256)) {
|
|
1073
|
-
if (value < 0 && sub === 0 && this[offset + i$1 + 1] !== 0) sub = 1;
|
|
1074
|
-
this[offset + i$1] = (value / mul >> 0) - sub & 255;
|
|
1075
|
-
}
|
|
1076
|
-
return offset + byteLength$2;
|
|
1077
|
-
};
|
|
1078
|
-
Buffer$2.prototype.writeInt8 = function writeInt8(value, offset, noAssert) {
|
|
1079
|
-
value = +value;
|
|
1080
|
-
offset = offset >>> 0;
|
|
1081
|
-
if (!noAssert) checkInt(this, value, offset, 1, 127, -128);
|
|
1082
|
-
if (value < 0) value = 255 + value + 1;
|
|
1083
|
-
this[offset] = value & 255;
|
|
1084
|
-
return offset + 1;
|
|
1085
|
-
};
|
|
1086
|
-
Buffer$2.prototype.writeInt16LE = function writeInt16LE(value, offset, noAssert) {
|
|
1087
|
-
value = +value;
|
|
1088
|
-
offset = offset >>> 0;
|
|
1089
|
-
if (!noAssert) checkInt(this, value, offset, 2, 32767, -32768);
|
|
1090
|
-
this[offset] = value & 255;
|
|
1091
|
-
this[offset + 1] = value >>> 8;
|
|
1092
|
-
return offset + 2;
|
|
1093
|
-
};
|
|
1094
|
-
Buffer$2.prototype.writeInt16BE = function writeInt16BE(value, offset, noAssert) {
|
|
1095
|
-
value = +value;
|
|
1096
|
-
offset = offset >>> 0;
|
|
1097
|
-
if (!noAssert) checkInt(this, value, offset, 2, 32767, -32768);
|
|
1098
|
-
this[offset] = value >>> 8;
|
|
1099
|
-
this[offset + 1] = value & 255;
|
|
1100
|
-
return offset + 2;
|
|
1101
|
-
};
|
|
1102
|
-
Buffer$2.prototype.writeInt32LE = function writeInt32LE(value, offset, noAssert) {
|
|
1103
|
-
value = +value;
|
|
1104
|
-
offset = offset >>> 0;
|
|
1105
|
-
if (!noAssert) checkInt(this, value, offset, 4, 2147483647, -2147483648);
|
|
1106
|
-
this[offset] = value & 255;
|
|
1107
|
-
this[offset + 1] = value >>> 8;
|
|
1108
|
-
this[offset + 2] = value >>> 16;
|
|
1109
|
-
this[offset + 3] = value >>> 24;
|
|
1110
|
-
return offset + 4;
|
|
1111
|
-
};
|
|
1112
|
-
Buffer$2.prototype.writeInt32BE = function writeInt32BE(value, offset, noAssert) {
|
|
1113
|
-
value = +value;
|
|
1114
|
-
offset = offset >>> 0;
|
|
1115
|
-
if (!noAssert) checkInt(this, value, offset, 4, 2147483647, -2147483648);
|
|
1116
|
-
if (value < 0) value = 4294967295 + value + 1;
|
|
1117
|
-
this[offset] = value >>> 24;
|
|
1118
|
-
this[offset + 1] = value >>> 16;
|
|
1119
|
-
this[offset + 2] = value >>> 8;
|
|
1120
|
-
this[offset + 3] = value & 255;
|
|
1121
|
-
return offset + 4;
|
|
1122
|
-
};
|
|
1123
|
-
Buffer$2.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE(value, offset = 0) {
|
|
1124
|
-
return wrtBigUInt64LE(this, value, offset, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
|
|
1125
|
-
});
|
|
1126
|
-
Buffer$2.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE(value, offset = 0) {
|
|
1127
|
-
return wrtBigUInt64BE(this, value, offset, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
|
|
1128
|
-
});
|
|
1129
|
-
function checkIEEE754(buf, value, offset, ext, max, min) {
|
|
1130
|
-
if (offset + ext > buf.length) throw new RangeError("Index out of range");
|
|
1131
|
-
if (offset < 0) throw new RangeError("Index out of range");
|
|
1132
|
-
}
|
|
1133
|
-
function writeFloat(buf, value, offset, littleEndian, noAssert) {
|
|
1134
|
-
value = +value;
|
|
1135
|
-
offset = offset >>> 0;
|
|
1136
|
-
if (!noAssert) checkIEEE754(buf, value, offset, 4);
|
|
1137
|
-
ieee754$1.write(buf, value, offset, littleEndian, 23, 4);
|
|
1138
|
-
return offset + 4;
|
|
1139
|
-
}
|
|
1140
|
-
Buffer$2.prototype.writeFloatLE = function writeFloatLE(value, offset, noAssert) {
|
|
1141
|
-
return writeFloat(this, value, offset, true, noAssert);
|
|
1142
|
-
};
|
|
1143
|
-
Buffer$2.prototype.writeFloatBE = function writeFloatBE(value, offset, noAssert) {
|
|
1144
|
-
return writeFloat(this, value, offset, false, noAssert);
|
|
1145
|
-
};
|
|
1146
|
-
function writeDouble(buf, value, offset, littleEndian, noAssert) {
|
|
1147
|
-
value = +value;
|
|
1148
|
-
offset = offset >>> 0;
|
|
1149
|
-
if (!noAssert) checkIEEE754(buf, value, offset, 8);
|
|
1150
|
-
ieee754$1.write(buf, value, offset, littleEndian, 52, 8);
|
|
1151
|
-
return offset + 8;
|
|
1152
|
-
}
|
|
1153
|
-
Buffer$2.prototype.writeDoubleLE = function writeDoubleLE(value, offset, noAssert) {
|
|
1154
|
-
return writeDouble(this, value, offset, true, noAssert);
|
|
1155
|
-
};
|
|
1156
|
-
Buffer$2.prototype.writeDoubleBE = function writeDoubleBE(value, offset, noAssert) {
|
|
1157
|
-
return writeDouble(this, value, offset, false, noAssert);
|
|
1158
|
-
};
|
|
1159
|
-
Buffer$2.prototype.copy = function copy(target, targetStart, start, end) {
|
|
1160
|
-
if (!Buffer$2.isBuffer(target)) throw new TypeError("argument should be a Buffer");
|
|
1161
|
-
if (!start) start = 0;
|
|
1162
|
-
if (!end && end !== 0) end = this.length;
|
|
1163
|
-
if (targetStart >= target.length) targetStart = target.length;
|
|
1164
|
-
if (!targetStart) targetStart = 0;
|
|
1165
|
-
if (end > 0 && end < start) end = start;
|
|
1166
|
-
if (end === start) return 0;
|
|
1167
|
-
if (target.length === 0 || this.length === 0) return 0;
|
|
1168
|
-
if (targetStart < 0) throw new RangeError("targetStart out of bounds");
|
|
1169
|
-
if (start < 0 || start >= this.length) throw new RangeError("Index out of range");
|
|
1170
|
-
if (end < 0) throw new RangeError("sourceEnd out of bounds");
|
|
1171
|
-
if (end > this.length) end = this.length;
|
|
1172
|
-
if (target.length - targetStart < end - start) end = target.length - targetStart + start;
|
|
1173
|
-
const len$1 = end - start;
|
|
1174
|
-
if (this === target && typeof GlobalUint8Array.prototype.copyWithin === "function") this.copyWithin(targetStart, start, end);
|
|
1175
|
-
else GlobalUint8Array.prototype.set.call(target, this.subarray(start, end), targetStart);
|
|
1176
|
-
return len$1;
|
|
1177
|
-
};
|
|
1178
|
-
Buffer$2.prototype.fill = function fill(val, start, end, encoding) {
|
|
1179
|
-
if (typeof val === "string") {
|
|
1180
|
-
if (typeof start === "string") {
|
|
1181
|
-
encoding = start;
|
|
1182
|
-
start = 0;
|
|
1183
|
-
end = this.length;
|
|
1184
|
-
} else if (typeof end === "string") {
|
|
1185
|
-
encoding = end;
|
|
1186
|
-
end = this.length;
|
|
1187
|
-
}
|
|
1188
|
-
if (encoding !== void 0 && typeof encoding !== "string") throw new TypeError("encoding must be a string");
|
|
1189
|
-
if (typeof encoding === "string" && !Buffer$2.isEncoding(encoding)) throw new TypeError("Unknown encoding: " + encoding);
|
|
1190
|
-
if (val.length === 1) {
|
|
1191
|
-
const code$1 = val.charCodeAt(0);
|
|
1192
|
-
if (encoding === "utf8" && code$1 < 128 || encoding === "latin1") val = code$1;
|
|
1193
|
-
}
|
|
1194
|
-
} else if (typeof val === "number") val = val & 255;
|
|
1195
|
-
else if (typeof val === "boolean") val = Number(val);
|
|
1196
|
-
if (start < 0 || this.length < start || this.length < end) throw new RangeError("Out of range index");
|
|
1197
|
-
if (end <= start) return this;
|
|
1198
|
-
start = start >>> 0;
|
|
1199
|
-
end = end === void 0 ? this.length : end >>> 0;
|
|
1200
|
-
if (!val) val = 0;
|
|
1201
|
-
let i$1;
|
|
1202
|
-
if (typeof val === "number") for (i$1 = start; i$1 < end; ++i$1) this[i$1] = val;
|
|
1203
|
-
else {
|
|
1204
|
-
const bytes = Buffer$2.isBuffer(val) ? val : Buffer$2.from(val, encoding);
|
|
1205
|
-
const len$1 = bytes.length;
|
|
1206
|
-
if (len$1 === 0) throw new TypeError("The value \"" + val + "\" is invalid for argument \"value\"");
|
|
1207
|
-
for (i$1 = 0; i$1 < end - start; ++i$1) this[i$1 + start] = bytes[i$1 % len$1];
|
|
1208
|
-
}
|
|
1209
|
-
return this;
|
|
1210
|
-
};
|
|
1211
|
-
const errors = {};
|
|
1212
|
-
function E(sym, getMessage, Base) {
|
|
1213
|
-
errors[sym] = class NodeError extends Base {
|
|
1214
|
-
constructor() {
|
|
1215
|
-
super();
|
|
1216
|
-
Object.defineProperty(this, "message", {
|
|
1217
|
-
value: getMessage.apply(this, arguments),
|
|
1218
|
-
writable: true,
|
|
1219
|
-
configurable: true
|
|
1220
|
-
});
|
|
1221
|
-
this.name = `${this.name} [${sym}]`;
|
|
1222
|
-
this.stack;
|
|
1223
|
-
delete this.name;
|
|
1224
|
-
}
|
|
1225
|
-
get code() {
|
|
1226
|
-
return sym;
|
|
1227
|
-
}
|
|
1228
|
-
set code(value) {
|
|
1229
|
-
Object.defineProperty(this, "code", {
|
|
1230
|
-
configurable: true,
|
|
1231
|
-
enumerable: true,
|
|
1232
|
-
value,
|
|
1233
|
-
writable: true
|
|
1234
|
-
});
|
|
1235
|
-
}
|
|
1236
|
-
toString() {
|
|
1237
|
-
return `${this.name} [${sym}]: ${this.message}`;
|
|
1238
|
-
}
|
|
1239
|
-
};
|
|
1240
|
-
}
|
|
1241
|
-
E("ERR_BUFFER_OUT_OF_BOUNDS", function(name) {
|
|
1242
|
-
if (name) return `${name} is outside of buffer bounds`;
|
|
1243
|
-
return "Attempt to access memory outside buffer bounds";
|
|
1244
|
-
}, RangeError);
|
|
1245
|
-
E("ERR_INVALID_ARG_TYPE", function(name, actual) {
|
|
1246
|
-
return `The "${name}" argument must be of type number. Received type ${typeof actual}`;
|
|
1247
|
-
}, TypeError);
|
|
1248
|
-
E("ERR_OUT_OF_RANGE", function(str, range, input) {
|
|
1249
|
-
let msg = `The value of "${str}" is out of range.`;
|
|
1250
|
-
let received = input;
|
|
1251
|
-
if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) received = addNumericalSeparator(String(input));
|
|
1252
|
-
else if (typeof input === "bigint") {
|
|
1253
|
-
received = String(input);
|
|
1254
|
-
if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) received = addNumericalSeparator(received);
|
|
1255
|
-
received += "n";
|
|
1256
|
-
}
|
|
1257
|
-
msg += ` It must be ${range}. Received ${received}`;
|
|
1258
|
-
return msg;
|
|
1259
|
-
}, RangeError);
|
|
1260
|
-
function addNumericalSeparator(val) {
|
|
1261
|
-
let res = "";
|
|
1262
|
-
let i$1 = val.length;
|
|
1263
|
-
const start = val[0] === "-" ? 1 : 0;
|
|
1264
|
-
for (; i$1 >= start + 4; i$1 -= 3) res = `_${val.slice(i$1 - 3, i$1)}${res}`;
|
|
1265
|
-
return `${val.slice(0, i$1)}${res}`;
|
|
1266
|
-
}
|
|
1267
|
-
function checkBounds(buf, offset, byteLength$2) {
|
|
1268
|
-
validateNumber(offset, "offset");
|
|
1269
|
-
if (buf[offset] === void 0 || buf[offset + byteLength$2] === void 0) boundsError(offset, buf.length - (byteLength$2 + 1));
|
|
1270
|
-
}
|
|
1271
|
-
function checkIntBI(value, min, max, buf, offset, byteLength$2) {
|
|
1272
|
-
if (value > max || value < min) {
|
|
1273
|
-
const n = typeof min === "bigint" ? "n" : "";
|
|
1274
|
-
let range;
|
|
1275
|
-
if (byteLength$2 > 3) if (min === 0 || min === BigInt(0)) range = `>= 0${n} and < 2${n} ** ${(byteLength$2 + 1) * 8}${n}`;
|
|
1276
|
-
else range = `>= -(2${n} ** ${(byteLength$2 + 1) * 8 - 1}${n}) and < 2 ** ${(byteLength$2 + 1) * 8 - 1}${n}`;
|
|
1277
|
-
else range = `>= ${min}${n} and <= ${max}${n}`;
|
|
1278
|
-
throw new errors.ERR_OUT_OF_RANGE("value", range, value);
|
|
1279
|
-
}
|
|
1280
|
-
checkBounds(buf, offset, byteLength$2);
|
|
1281
|
-
}
|
|
1282
|
-
function validateNumber(value, name) {
|
|
1283
|
-
if (typeof value !== "number") throw new errors.ERR_INVALID_ARG_TYPE(name, "number", value);
|
|
1284
|
-
}
|
|
1285
|
-
function boundsError(value, length, type) {
|
|
1286
|
-
if (Math.floor(value) !== value) {
|
|
1287
|
-
validateNumber(value, type);
|
|
1288
|
-
throw new errors.ERR_OUT_OF_RANGE(type || "offset", "an integer", value);
|
|
1289
|
-
}
|
|
1290
|
-
if (length < 0) throw new errors.ERR_BUFFER_OUT_OF_BOUNDS();
|
|
1291
|
-
throw new errors.ERR_OUT_OF_RANGE(type || "offset", `>= ${type ? 1 : 0} and <= ${length}`, value);
|
|
1292
|
-
}
|
|
1293
|
-
const INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g;
|
|
1294
|
-
function base64clean(str) {
|
|
1295
|
-
str = str.split("=")[0];
|
|
1296
|
-
str = str.trim().replace(INVALID_BASE64_RE, "");
|
|
1297
|
-
if (str.length < 2) return "";
|
|
1298
|
-
while (str.length % 4 !== 0) str = str + "=";
|
|
1299
|
-
return str;
|
|
1300
|
-
}
|
|
1301
|
-
function utf8ToBytes(string, units) {
|
|
1302
|
-
units = units || Infinity;
|
|
1303
|
-
let codePoint;
|
|
1304
|
-
const length = string.length;
|
|
1305
|
-
let leadSurrogate = null;
|
|
1306
|
-
const bytes = [];
|
|
1307
|
-
for (let i$1 = 0; i$1 < length; ++i$1) {
|
|
1308
|
-
codePoint = string.charCodeAt(i$1);
|
|
1309
|
-
if (codePoint > 55295 && codePoint < 57344) {
|
|
1310
|
-
if (!leadSurrogate) {
|
|
1311
|
-
if (codePoint > 56319) {
|
|
1312
|
-
if ((units -= 3) > -1) bytes.push(239, 191, 189);
|
|
1313
|
-
continue;
|
|
1314
|
-
} else if (i$1 + 1 === length) {
|
|
1315
|
-
if ((units -= 3) > -1) bytes.push(239, 191, 189);
|
|
1316
|
-
continue;
|
|
1317
|
-
}
|
|
1318
|
-
leadSurrogate = codePoint;
|
|
1319
|
-
continue;
|
|
1320
|
-
}
|
|
1321
|
-
if (codePoint < 56320) {
|
|
1322
|
-
if ((units -= 3) > -1) bytes.push(239, 191, 189);
|
|
1323
|
-
leadSurrogate = codePoint;
|
|
1324
|
-
continue;
|
|
1325
|
-
}
|
|
1326
|
-
codePoint = (leadSurrogate - 55296 << 10 | codePoint - 56320) + 65536;
|
|
1327
|
-
} else if (leadSurrogate) {
|
|
1328
|
-
if ((units -= 3) > -1) bytes.push(239, 191, 189);
|
|
1329
|
-
}
|
|
1330
|
-
leadSurrogate = null;
|
|
1331
|
-
if (codePoint < 128) {
|
|
1332
|
-
if ((units -= 1) < 0) break;
|
|
1333
|
-
bytes.push(codePoint);
|
|
1334
|
-
} else if (codePoint < 2048) {
|
|
1335
|
-
if ((units -= 2) < 0) break;
|
|
1336
|
-
bytes.push(codePoint >> 6 | 192, codePoint & 63 | 128);
|
|
1337
|
-
} else if (codePoint < 65536) {
|
|
1338
|
-
if ((units -= 3) < 0) break;
|
|
1339
|
-
bytes.push(codePoint >> 12 | 224, codePoint >> 6 & 63 | 128, codePoint & 63 | 128);
|
|
1340
|
-
} else if (codePoint < 1114112) {
|
|
1341
|
-
if ((units -= 4) < 0) break;
|
|
1342
|
-
bytes.push(codePoint >> 18 | 240, codePoint >> 12 & 63 | 128, codePoint >> 6 & 63 | 128, codePoint & 63 | 128);
|
|
1343
|
-
} else throw new Error("Invalid code point");
|
|
1344
|
-
}
|
|
1345
|
-
return bytes;
|
|
1346
|
-
}
|
|
1347
|
-
function asciiToBytes(str) {
|
|
1348
|
-
const byteArray = [];
|
|
1349
|
-
for (let i$1 = 0; i$1 < str.length; ++i$1) byteArray.push(str.charCodeAt(i$1) & 255);
|
|
1350
|
-
return byteArray;
|
|
1351
|
-
}
|
|
1352
|
-
function utf16leToBytes(str, units) {
|
|
1353
|
-
let c, hi, lo;
|
|
1354
|
-
const byteArray = [];
|
|
1355
|
-
for (let i$1 = 0; i$1 < str.length; ++i$1) {
|
|
1356
|
-
if ((units -= 2) < 0) break;
|
|
1357
|
-
c = str.charCodeAt(i$1);
|
|
1358
|
-
hi = c >> 8;
|
|
1359
|
-
lo = c % 256;
|
|
1360
|
-
byteArray.push(lo);
|
|
1361
|
-
byteArray.push(hi);
|
|
1362
|
-
}
|
|
1363
|
-
return byteArray;
|
|
1364
|
-
}
|
|
1365
|
-
function base64ToBytes(str) {
|
|
1366
|
-
return base64.toByteArray(base64clean(str));
|
|
1367
|
-
}
|
|
1368
|
-
function blitBuffer(src, dst, offset, length) {
|
|
1369
|
-
let i$1;
|
|
1370
|
-
for (i$1 = 0; i$1 < length; ++i$1) {
|
|
1371
|
-
if (i$1 + offset >= dst.length || i$1 >= src.length) break;
|
|
1372
|
-
dst[i$1 + offset] = src[i$1];
|
|
1373
|
-
}
|
|
1374
|
-
return i$1;
|
|
1375
|
-
}
|
|
1376
|
-
function isInstance(obj, type) {
|
|
1377
|
-
return obj instanceof type || obj != null && obj.constructor != null && obj.constructor.name != null && obj.constructor.name === type.name;
|
|
1378
|
-
}
|
|
1379
|
-
function numberIsNaN(obj) {
|
|
1380
|
-
return obj !== obj;
|
|
1381
|
-
}
|
|
1382
|
-
const hexSliceLookupTable = (function() {
|
|
1383
|
-
const alphabet = "0123456789abcdef";
|
|
1384
|
-
const table = new Array(256);
|
|
1385
|
-
for (let i$1 = 0; i$1 < 16; ++i$1) {
|
|
1386
|
-
const i16 = i$1 * 16;
|
|
1387
|
-
for (let j = 0; j < 16; ++j) table[i16 + j] = alphabet[i$1] + alphabet[j];
|
|
1388
|
-
}
|
|
1389
|
-
return table;
|
|
1390
|
-
})();
|
|
1391
|
-
function defineBigIntMethod(fn) {
|
|
1392
|
-
return typeof BigInt === "undefined" ? BufferBigIntNotDefined : fn;
|
|
1393
|
-
}
|
|
1394
|
-
function BufferBigIntNotDefined() {
|
|
1395
|
-
throw new Error("BigInt not supported");
|
|
1396
|
-
}
|
|
1397
|
-
})(buffer);
|
|
1398
|
-
Buffer = buffer.Buffer;
|
|
1399
|
-
buffer.Blob;
|
|
1400
|
-
buffer.BlobOptions;
|
|
1401
|
-
buffer.Buffer;
|
|
1402
|
-
buffer.File;
|
|
1403
|
-
buffer.FileOptions;
|
|
1404
|
-
buffer.INSPECT_MAX_BYTES;
|
|
1405
|
-
buffer.SlowBuffer;
|
|
1406
|
-
buffer.TranscodeEncoding;
|
|
1407
|
-
buffer.atob;
|
|
1408
|
-
buffer.btoa;
|
|
1409
|
-
buffer.constants;
|
|
1410
|
-
buffer.isAscii;
|
|
1411
|
-
buffer.isUtf8;
|
|
1412
|
-
buffer.kMaxLength;
|
|
1413
|
-
buffer.kStringMaxLength;
|
|
1414
|
-
buffer.resolveObjectURL;
|
|
1415
|
-
buffer.transcode;
|
|
1416
|
-
}));
|
|
1417
|
-
var global;
|
|
1418
|
-
var init_dist$1 = require_rolldown_runtime.__esmMin((() => {
|
|
1419
|
-
global = globalThis || self;
|
|
1420
|
-
}));
|
|
1421
|
-
function getDefaultExportFromCjs(x) {
|
|
1422
|
-
return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, "default") ? x["default"] : x;
|
|
1423
|
-
}
|
|
1424
|
-
function defaultSetTimout() {
|
|
1425
|
-
throw new Error("setTimeout has not been defined");
|
|
1426
|
-
}
|
|
1427
|
-
function defaultClearTimeout() {
|
|
1428
|
-
throw new Error("clearTimeout has not been defined");
|
|
1429
|
-
}
|
|
1430
|
-
function runTimeout(fun) {
|
|
1431
|
-
if (cachedSetTimeout === setTimeout) return setTimeout(fun, 0);
|
|
1432
|
-
if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {
|
|
1433
|
-
cachedSetTimeout = setTimeout;
|
|
1434
|
-
return setTimeout(fun, 0);
|
|
1435
|
-
}
|
|
1436
|
-
try {
|
|
1437
|
-
return cachedSetTimeout(fun, 0);
|
|
1438
|
-
} catch (e) {
|
|
1439
|
-
try {
|
|
1440
|
-
return cachedSetTimeout.call(null, fun, 0);
|
|
1441
|
-
} catch (e$1) {
|
|
1442
|
-
return cachedSetTimeout.call(this, fun, 0);
|
|
1443
|
-
}
|
|
1444
|
-
}
|
|
1445
|
-
}
|
|
1446
|
-
function runClearTimeout(marker) {
|
|
1447
|
-
if (cachedClearTimeout === clearTimeout) return clearTimeout(marker);
|
|
1448
|
-
if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {
|
|
1449
|
-
cachedClearTimeout = clearTimeout;
|
|
1450
|
-
return clearTimeout(marker);
|
|
1451
|
-
}
|
|
1452
|
-
try {
|
|
1453
|
-
return cachedClearTimeout(marker);
|
|
1454
|
-
} catch (e) {
|
|
1455
|
-
try {
|
|
1456
|
-
return cachedClearTimeout.call(null, marker);
|
|
1457
|
-
} catch (e$1) {
|
|
1458
|
-
return cachedClearTimeout.call(this, marker);
|
|
1459
|
-
}
|
|
1460
|
-
}
|
|
1461
|
-
}
|
|
1462
|
-
function cleanUpNextTick() {
|
|
1463
|
-
if (!draining || !currentQueue) return;
|
|
1464
|
-
draining = false;
|
|
1465
|
-
if (currentQueue.length) queue = currentQueue.concat(queue);
|
|
1466
|
-
else queueIndex = -1;
|
|
1467
|
-
if (queue.length) drainQueue();
|
|
1468
|
-
}
|
|
1469
|
-
function drainQueue() {
|
|
1470
|
-
if (draining) return;
|
|
1471
|
-
var timeout = runTimeout(cleanUpNextTick);
|
|
1472
|
-
draining = true;
|
|
1473
|
-
var len$1 = queue.length;
|
|
1474
|
-
while (len$1) {
|
|
1475
|
-
currentQueue = queue;
|
|
1476
|
-
queue = [];
|
|
1477
|
-
while (++queueIndex < len$1) if (currentQueue) currentQueue[queueIndex].run();
|
|
1478
|
-
queueIndex = -1;
|
|
1479
|
-
len$1 = queue.length;
|
|
1480
|
-
}
|
|
1481
|
-
currentQueue = null;
|
|
1482
|
-
draining = false;
|
|
1483
|
-
runClearTimeout(timeout);
|
|
1484
|
-
}
|
|
1485
|
-
function Item(fun, array) {
|
|
1486
|
-
this.fun = fun;
|
|
1487
|
-
this.array = array;
|
|
1488
|
-
}
|
|
1489
|
-
function noop() {}
|
|
1490
|
-
var browser, process, cachedSetTimeout, cachedClearTimeout, queue, draining, currentQueue, queueIndex, browserExports, process$1;
|
|
1491
|
-
var init_dist = require_rolldown_runtime.__esmMin((() => {
|
|
1492
|
-
browser = { exports: {} };
|
|
1493
|
-
process = browser.exports = {};
|
|
1494
|
-
(function() {
|
|
1495
|
-
try {
|
|
1496
|
-
if (typeof setTimeout === "function") cachedSetTimeout = setTimeout;
|
|
1497
|
-
else cachedSetTimeout = defaultSetTimout;
|
|
1498
|
-
} catch (e) {
|
|
1499
|
-
cachedSetTimeout = defaultSetTimout;
|
|
1500
|
-
}
|
|
1501
|
-
try {
|
|
1502
|
-
if (typeof clearTimeout === "function") cachedClearTimeout = clearTimeout;
|
|
1503
|
-
else cachedClearTimeout = defaultClearTimeout;
|
|
1504
|
-
} catch (e) {
|
|
1505
|
-
cachedClearTimeout = defaultClearTimeout;
|
|
1506
|
-
}
|
|
1507
|
-
})();
|
|
1508
|
-
queue = [];
|
|
1509
|
-
draining = false;
|
|
1510
|
-
queueIndex = -1;
|
|
1511
|
-
process.nextTick = function(fun) {
|
|
1512
|
-
var args = new Array(arguments.length - 1);
|
|
1513
|
-
if (arguments.length > 1) for (var i$1 = 1; i$1 < arguments.length; i$1++) args[i$1 - 1] = arguments[i$1];
|
|
1514
|
-
queue.push(new Item(fun, args));
|
|
1515
|
-
if (queue.length === 1 && !draining) runTimeout(drainQueue);
|
|
1516
|
-
};
|
|
1517
|
-
Item.prototype.run = function() {
|
|
1518
|
-
this.fun.apply(null, this.array);
|
|
1519
|
-
};
|
|
1520
|
-
process.title = "browser";
|
|
1521
|
-
process.browser = true;
|
|
1522
|
-
process.env = {};
|
|
1523
|
-
process.argv = [];
|
|
1524
|
-
process.version = "";
|
|
1525
|
-
process.versions = {};
|
|
1526
|
-
process.on = noop;
|
|
1527
|
-
process.addListener = noop;
|
|
1528
|
-
process.once = noop;
|
|
1529
|
-
process.off = noop;
|
|
1530
|
-
process.removeListener = noop;
|
|
1531
|
-
process.removeAllListeners = noop;
|
|
1532
|
-
process.emit = noop;
|
|
1533
|
-
process.prependListener = noop;
|
|
1534
|
-
process.prependOnceListener = noop;
|
|
1535
|
-
process.listeners = function(name) {
|
|
1536
|
-
return [];
|
|
1537
|
-
};
|
|
1538
|
-
process.binding = function(name) {
|
|
1539
|
-
throw new Error("process.binding is not supported");
|
|
1540
|
-
};
|
|
1541
|
-
process.cwd = function() {
|
|
1542
|
-
return "/";
|
|
1543
|
-
};
|
|
1544
|
-
process.chdir = function(dir) {
|
|
1545
|
-
throw new Error("process.chdir is not supported");
|
|
1546
|
-
};
|
|
1547
|
-
process.umask = function() {
|
|
1548
|
-
return 0;
|
|
1549
|
-
};
|
|
1550
|
-
browserExports = browser.exports;
|
|
1551
|
-
process$1 = /* @__PURE__ */ getDefaultExportFromCjs(browserExports);
|
|
1552
|
-
}));
|
|
1553
|
-
var require_jszip_min = /* @__PURE__ */ require_rolldown_runtime.__commonJSMin(((exports, module) => {
|
|
1554
|
-
init_dist$2();
|
|
1555
|
-
init_dist$1();
|
|
1556
|
-
init_dist();
|
|
1557
|
-
(function(e) {
|
|
1558
|
-
if ("object" == typeof exports && "undefined" != typeof module) module.exports = e();
|
|
1559
|
-
else if ("function" == typeof define && define.amd) define([], e);
|
|
1560
|
-
else ("undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof self ? self : this).JSZip = e();
|
|
1561
|
-
})(function() {
|
|
1562
|
-
return function s(a, o, h) {
|
|
1563
|
-
function u(r, e$1) {
|
|
1564
|
-
if (!o[r]) {
|
|
1565
|
-
if (!a[r]) {
|
|
1566
|
-
var t = "function" == typeof require && require;
|
|
1567
|
-
if (!e$1 && t) return t(r, !0);
|
|
1568
|
-
if (l) return l(r, !0);
|
|
1569
|
-
var n = /* @__PURE__ */ new Error("Cannot find module '" + r + "'");
|
|
1570
|
-
throw n.code = "MODULE_NOT_FOUND", n;
|
|
1571
|
-
}
|
|
1572
|
-
var i$1 = o[r] = { exports: {} };
|
|
1573
|
-
a[r][0].call(i$1.exports, function(e$2) {
|
|
1574
|
-
var t$1 = a[r][1][e$2];
|
|
1575
|
-
return u(t$1 || e$2);
|
|
1576
|
-
}, i$1, i$1.exports, s, a, o, h);
|
|
1577
|
-
}
|
|
1578
|
-
return o[r].exports;
|
|
1579
|
-
}
|
|
1580
|
-
for (var l = "function" == typeof require && require, e = 0; e < h.length; e++) u(h[e]);
|
|
1581
|
-
return u;
|
|
1582
|
-
}({
|
|
1583
|
-
1: [function(e, t, r) {
|
|
1584
|
-
"use strict";
|
|
1585
|
-
var d = e("./utils"), c = e("./support"), p = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
|
|
1586
|
-
r.encode = function(e$1) {
|
|
1587
|
-
for (var t$1, r$1, n, i$1, s, a, o, h = [], u = 0, l = e$1.length, f = l, c$1 = "string" !== d.getTypeOf(e$1); u < e$1.length;) f = l - u, n = c$1 ? (t$1 = e$1[u++], r$1 = u < l ? e$1[u++] : 0, u < l ? e$1[u++] : 0) : (t$1 = e$1.charCodeAt(u++), r$1 = u < l ? e$1.charCodeAt(u++) : 0, u < l ? e$1.charCodeAt(u++) : 0), i$1 = t$1 >> 2, s = (3 & t$1) << 4 | r$1 >> 4, a = 1 < f ? (15 & r$1) << 2 | n >> 6 : 64, o = 2 < f ? 63 & n : 64, h.push(p.charAt(i$1) + p.charAt(s) + p.charAt(a) + p.charAt(o));
|
|
1588
|
-
return h.join("");
|
|
1589
|
-
}, r.decode = function(e$1) {
|
|
1590
|
-
var t$1, r$1, n, i$1, s, a, o = 0, h = 0, u = "data:";
|
|
1591
|
-
if (e$1.substr(0, u.length) === u) throw new Error("Invalid base64 input, it looks like a data url.");
|
|
1592
|
-
var l, f = 3 * (e$1 = e$1.replace(/[^A-Za-z0-9+/=]/g, "")).length / 4;
|
|
1593
|
-
if (e$1.charAt(e$1.length - 1) === p.charAt(64) && f--, e$1.charAt(e$1.length - 2) === p.charAt(64) && f--, f % 1 != 0) throw new Error("Invalid base64 input, bad content length.");
|
|
1594
|
-
for (l = c.uint8array ? new Uint8Array(0 | f) : new Array(0 | f); o < e$1.length;) t$1 = p.indexOf(e$1.charAt(o++)) << 2 | (i$1 = p.indexOf(e$1.charAt(o++))) >> 4, r$1 = (15 & i$1) << 4 | (s = p.indexOf(e$1.charAt(o++))) >> 2, n = (3 & s) << 6 | (a = p.indexOf(e$1.charAt(o++))), l[h++] = t$1, 64 !== s && (l[h++] = r$1), 64 !== a && (l[h++] = n);
|
|
1595
|
-
return l;
|
|
1596
|
-
};
|
|
1597
|
-
}, {
|
|
1598
|
-
"./support": 30,
|
|
1599
|
-
"./utils": 32
|
|
1600
|
-
}],
|
|
1601
|
-
2: [function(e, t, r) {
|
|
1602
|
-
"use strict";
|
|
1603
|
-
var n = e("./external"), i$1 = e("./stream/DataWorker"), s = e("./stream/Crc32Probe"), a = e("./stream/DataLengthProbe");
|
|
1604
|
-
function o(e$1, t$1, r$1, n$1, i$2) {
|
|
1605
|
-
this.compressedSize = e$1, this.uncompressedSize = t$1, this.crc32 = r$1, this.compression = n$1, this.compressedContent = i$2;
|
|
1606
|
-
}
|
|
1607
|
-
o.prototype = {
|
|
1608
|
-
getContentWorker: function() {
|
|
1609
|
-
var e$1 = new i$1(n.Promise.resolve(this.compressedContent)).pipe(this.compression.uncompressWorker()).pipe(new a("data_length")), t$1 = this;
|
|
1610
|
-
return e$1.on("end", function() {
|
|
1611
|
-
if (this.streamInfo.data_length !== t$1.uncompressedSize) throw new Error("Bug : uncompressed data size mismatch");
|
|
1612
|
-
}), e$1;
|
|
1613
|
-
},
|
|
1614
|
-
getCompressedWorker: function() {
|
|
1615
|
-
return new i$1(n.Promise.resolve(this.compressedContent)).withStreamInfo("compressedSize", this.compressedSize).withStreamInfo("uncompressedSize", this.uncompressedSize).withStreamInfo("crc32", this.crc32).withStreamInfo("compression", this.compression);
|
|
1616
|
-
}
|
|
1617
|
-
}, o.createWorkerFrom = function(e$1, t$1, r$1) {
|
|
1618
|
-
return e$1.pipe(new s()).pipe(new a("uncompressedSize")).pipe(t$1.compressWorker(r$1)).pipe(new a("compressedSize")).withStreamInfo("compression", t$1);
|
|
1619
|
-
}, t.exports = o;
|
|
1620
|
-
}, {
|
|
1621
|
-
"./external": 6,
|
|
1622
|
-
"./stream/Crc32Probe": 25,
|
|
1623
|
-
"./stream/DataLengthProbe": 26,
|
|
1624
|
-
"./stream/DataWorker": 27
|
|
1625
|
-
}],
|
|
1626
|
-
3: [function(e, t, r) {
|
|
1627
|
-
"use strict";
|
|
1628
|
-
var n = e("./stream/GenericWorker");
|
|
1629
|
-
r.STORE = {
|
|
1630
|
-
magic: "\0\0",
|
|
1631
|
-
compressWorker: function() {
|
|
1632
|
-
return new n("STORE compression");
|
|
1633
|
-
},
|
|
1634
|
-
uncompressWorker: function() {
|
|
1635
|
-
return new n("STORE decompression");
|
|
1636
|
-
}
|
|
1637
|
-
}, r.DEFLATE = e("./flate");
|
|
1638
|
-
}, {
|
|
1639
|
-
"./flate": 7,
|
|
1640
|
-
"./stream/GenericWorker": 28
|
|
1641
|
-
}],
|
|
1642
|
-
4: [function(e, t, r) {
|
|
1643
|
-
"use strict";
|
|
1644
|
-
var n = e("./utils");
|
|
1645
|
-
var o = function() {
|
|
1646
|
-
for (var e$1, t$1 = [], r$1 = 0; r$1 < 256; r$1++) {
|
|
1647
|
-
e$1 = r$1;
|
|
1648
|
-
for (var n$1 = 0; n$1 < 8; n$1++) e$1 = 1 & e$1 ? 3988292384 ^ e$1 >>> 1 : e$1 >>> 1;
|
|
1649
|
-
t$1[r$1] = e$1;
|
|
1650
|
-
}
|
|
1651
|
-
return t$1;
|
|
1652
|
-
}();
|
|
1653
|
-
t.exports = function(e$1, t$1) {
|
|
1654
|
-
return void 0 !== e$1 && e$1.length ? "string" !== n.getTypeOf(e$1) ? function(e$2, t$2, r$1, n$1) {
|
|
1655
|
-
var i$1 = o, s = n$1 + r$1;
|
|
1656
|
-
e$2 ^= -1;
|
|
1657
|
-
for (var a = n$1; a < s; a++) e$2 = e$2 >>> 8 ^ i$1[255 & (e$2 ^ t$2[a])];
|
|
1658
|
-
return -1 ^ e$2;
|
|
1659
|
-
}(0 | t$1, e$1, e$1.length, 0) : function(e$2, t$2, r$1, n$1) {
|
|
1660
|
-
var i$1 = o, s = n$1 + r$1;
|
|
1661
|
-
e$2 ^= -1;
|
|
1662
|
-
for (var a = n$1; a < s; a++) e$2 = e$2 >>> 8 ^ i$1[255 & (e$2 ^ t$2.charCodeAt(a))];
|
|
1663
|
-
return -1 ^ e$2;
|
|
1664
|
-
}(0 | t$1, e$1, e$1.length, 0) : 0;
|
|
1665
|
-
};
|
|
1666
|
-
}, { "./utils": 32 }],
|
|
1667
|
-
5: [function(e, t, r) {
|
|
1668
|
-
"use strict";
|
|
1669
|
-
r.base64 = !1, r.binary = !1, r.dir = !1, r.createFolders = !0, r.date = null, r.compression = null, r.compressionOptions = null, r.comment = null, r.unixPermissions = null, r.dosPermissions = null;
|
|
1670
|
-
}, {}],
|
|
1671
|
-
6: [function(e, t, r) {
|
|
1672
|
-
"use strict";
|
|
1673
|
-
var n = null;
|
|
1674
|
-
n = "undefined" != typeof Promise ? Promise : e("lie"), t.exports = { Promise: n };
|
|
1675
|
-
}, { lie: 37 }],
|
|
1676
|
-
7: [function(e, t, r) {
|
|
1677
|
-
"use strict";
|
|
1678
|
-
var n = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Uint32Array, i$1 = e("pako"), s = e("./utils"), a = e("./stream/GenericWorker"), o = n ? "uint8array" : "array";
|
|
1679
|
-
function h(e$1, t$1) {
|
|
1680
|
-
a.call(this, "FlateWorker/" + e$1), this._pako = null, this._pakoAction = e$1, this._pakoOptions = t$1, this.meta = {};
|
|
1681
|
-
}
|
|
1682
|
-
r.magic = "\b\0", s.inherits(h, a), h.prototype.processChunk = function(e$1) {
|
|
1683
|
-
this.meta = e$1.meta, null === this._pako && this._createPako(), this._pako.push(s.transformTo(o, e$1.data), !1);
|
|
1684
|
-
}, h.prototype.flush = function() {
|
|
1685
|
-
a.prototype.flush.call(this), null === this._pako && this._createPako(), this._pako.push([], !0);
|
|
1686
|
-
}, h.prototype.cleanUp = function() {
|
|
1687
|
-
a.prototype.cleanUp.call(this), this._pako = null;
|
|
1688
|
-
}, h.prototype._createPako = function() {
|
|
1689
|
-
this._pako = new i$1[this._pakoAction]({
|
|
1690
|
-
raw: !0,
|
|
1691
|
-
level: this._pakoOptions.level || -1
|
|
1692
|
-
});
|
|
1693
|
-
var t$1 = this;
|
|
1694
|
-
this._pako.onData = function(e$1) {
|
|
1695
|
-
t$1.push({
|
|
1696
|
-
data: e$1,
|
|
1697
|
-
meta: t$1.meta
|
|
1698
|
-
});
|
|
1699
|
-
};
|
|
1700
|
-
}, r.compressWorker = function(e$1) {
|
|
1701
|
-
return new h("Deflate", e$1);
|
|
1702
|
-
}, r.uncompressWorker = function() {
|
|
1703
|
-
return new h("Inflate", {});
|
|
1704
|
-
};
|
|
1705
|
-
}, {
|
|
1706
|
-
"./stream/GenericWorker": 28,
|
|
1707
|
-
"./utils": 32,
|
|
1708
|
-
pako: 38
|
|
1709
|
-
}],
|
|
1710
|
-
8: [function(e, t, r) {
|
|
1711
|
-
"use strict";
|
|
1712
|
-
function A(e$1, t$1) {
|
|
1713
|
-
var r$1, n$1 = "";
|
|
1714
|
-
for (r$1 = 0; r$1 < t$1; r$1++) n$1 += String.fromCharCode(255 & e$1), e$1 >>>= 8;
|
|
1715
|
-
return n$1;
|
|
1716
|
-
}
|
|
1717
|
-
function n(e$1, t$1, r$1, n$1, i$2, s$1) {
|
|
1718
|
-
var a, o, h = e$1.file, u = e$1.compression, l = s$1 !== O.utf8encode, f = I.transformTo("string", s$1(h.name)), c = I.transformTo("string", O.utf8encode(h.name)), d = h.comment, p = I.transformTo("string", s$1(d)), m = I.transformTo("string", O.utf8encode(d)), _ = c.length !== h.name.length, g = m.length !== d.length, b = "", v = "", y = "", w = h.dir, k = h.date, x = {
|
|
1719
|
-
crc32: 0,
|
|
1720
|
-
compressedSize: 0,
|
|
1721
|
-
uncompressedSize: 0
|
|
1722
|
-
};
|
|
1723
|
-
t$1 && !r$1 || (x.crc32 = e$1.crc32, x.compressedSize = e$1.compressedSize, x.uncompressedSize = e$1.uncompressedSize);
|
|
1724
|
-
var S = 0;
|
|
1725
|
-
t$1 && (S |= 8), l || !_ && !g || (S |= 2048);
|
|
1726
|
-
var z = 0, C = 0;
|
|
1727
|
-
w && (z |= 16), "UNIX" === i$2 ? (C = 798, z |= function(e$2, t$2) {
|
|
1728
|
-
var r$2 = e$2;
|
|
1729
|
-
return e$2 || (r$2 = t$2 ? 16893 : 33204), (65535 & r$2) << 16;
|
|
1730
|
-
}(h.unixPermissions, w)) : (C = 20, z |= function(e$2) {
|
|
1731
|
-
return 63 & (e$2 || 0);
|
|
1732
|
-
}(h.dosPermissions)), a = k.getUTCHours(), a <<= 6, a |= k.getUTCMinutes(), a <<= 5, a |= k.getUTCSeconds() / 2, o = k.getUTCFullYear() - 1980, o <<= 4, o |= k.getUTCMonth() + 1, o <<= 5, o |= k.getUTCDate(), _ && (v = A(1, 1) + A(B(f), 4) + c, b += "up" + A(v.length, 2) + v), g && (y = A(1, 1) + A(B(p), 4) + m, b += "uc" + A(y.length, 2) + y);
|
|
1733
|
-
var E = "";
|
|
1734
|
-
return E += "\n\0", E += A(S, 2), E += u.magic, E += A(a, 2), E += A(o, 2), E += A(x.crc32, 4), E += A(x.compressedSize, 4), E += A(x.uncompressedSize, 4), E += A(f.length, 2), E += A(b.length, 2), {
|
|
1735
|
-
fileRecord: R.LOCAL_FILE_HEADER + E + f + b,
|
|
1736
|
-
dirRecord: R.CENTRAL_FILE_HEADER + A(C, 2) + E + A(p.length, 2) + "\0\0\0\0" + A(z, 4) + A(n$1, 4) + f + b + p
|
|
1737
|
-
};
|
|
1738
|
-
}
|
|
1739
|
-
var I = e("../utils"), i$1 = e("../stream/GenericWorker"), O = e("../utf8"), B = e("../crc32"), R = e("../signature");
|
|
1740
|
-
function s(e$1, t$1, r$1, n$1) {
|
|
1741
|
-
i$1.call(this, "ZipFileWorker"), this.bytesWritten = 0, this.zipComment = t$1, this.zipPlatform = r$1, this.encodeFileName = n$1, this.streamFiles = e$1, this.accumulate = !1, this.contentBuffer = [], this.dirRecords = [], this.currentSourceOffset = 0, this.entriesCount = 0, this.currentFile = null, this._sources = [];
|
|
1742
|
-
}
|
|
1743
|
-
I.inherits(s, i$1), s.prototype.push = function(e$1) {
|
|
1744
|
-
var t$1 = e$1.meta.percent || 0, r$1 = this.entriesCount, n$1 = this._sources.length;
|
|
1745
|
-
this.accumulate ? this.contentBuffer.push(e$1) : (this.bytesWritten += e$1.data.length, i$1.prototype.push.call(this, {
|
|
1746
|
-
data: e$1.data,
|
|
1747
|
-
meta: {
|
|
1748
|
-
currentFile: this.currentFile,
|
|
1749
|
-
percent: r$1 ? (t$1 + 100 * (r$1 - n$1 - 1)) / r$1 : 100
|
|
1750
|
-
}
|
|
1751
|
-
}));
|
|
1752
|
-
}, s.prototype.openedSource = function(e$1) {
|
|
1753
|
-
this.currentSourceOffset = this.bytesWritten, this.currentFile = e$1.file.name;
|
|
1754
|
-
var t$1 = this.streamFiles && !e$1.file.dir;
|
|
1755
|
-
if (t$1) {
|
|
1756
|
-
var r$1 = n(e$1, t$1, !1, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
|
|
1757
|
-
this.push({
|
|
1758
|
-
data: r$1.fileRecord,
|
|
1759
|
-
meta: { percent: 0 }
|
|
1760
|
-
});
|
|
1761
|
-
} else this.accumulate = !0;
|
|
1762
|
-
}, s.prototype.closedSource = function(e$1) {
|
|
1763
|
-
this.accumulate = !1;
|
|
1764
|
-
var t$1 = this.streamFiles && !e$1.file.dir, r$1 = n(e$1, t$1, !0, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
|
|
1765
|
-
if (this.dirRecords.push(r$1.dirRecord), t$1) this.push({
|
|
1766
|
-
data: function(e$2) {
|
|
1767
|
-
return R.DATA_DESCRIPTOR + A(e$2.crc32, 4) + A(e$2.compressedSize, 4) + A(e$2.uncompressedSize, 4);
|
|
1768
|
-
}(e$1),
|
|
1769
|
-
meta: { percent: 100 }
|
|
1770
|
-
});
|
|
1771
|
-
else for (this.push({
|
|
1772
|
-
data: r$1.fileRecord,
|
|
1773
|
-
meta: { percent: 0 }
|
|
1774
|
-
}); this.contentBuffer.length;) this.push(this.contentBuffer.shift());
|
|
1775
|
-
this.currentFile = null;
|
|
1776
|
-
}, s.prototype.flush = function() {
|
|
1777
|
-
for (var e$1 = this.bytesWritten, t$1 = 0; t$1 < this.dirRecords.length; t$1++) this.push({
|
|
1778
|
-
data: this.dirRecords[t$1],
|
|
1779
|
-
meta: { percent: 100 }
|
|
1780
|
-
});
|
|
1781
|
-
var r$1 = this.bytesWritten - e$1, n$1 = function(e$2, t$2, r$2, n$2, i$2) {
|
|
1782
|
-
var s$1 = I.transformTo("string", i$2(n$2));
|
|
1783
|
-
return R.CENTRAL_DIRECTORY_END + "\0\0\0\0" + A(e$2, 2) + A(e$2, 2) + A(t$2, 4) + A(r$2, 4) + A(s$1.length, 2) + s$1;
|
|
1784
|
-
}(this.dirRecords.length, r$1, e$1, this.zipComment, this.encodeFileName);
|
|
1785
|
-
this.push({
|
|
1786
|
-
data: n$1,
|
|
1787
|
-
meta: { percent: 100 }
|
|
1788
|
-
});
|
|
1789
|
-
}, s.prototype.prepareNextSource = function() {
|
|
1790
|
-
this.previous = this._sources.shift(), this.openedSource(this.previous.streamInfo), this.isPaused ? this.previous.pause() : this.previous.resume();
|
|
1791
|
-
}, s.prototype.registerPrevious = function(e$1) {
|
|
1792
|
-
this._sources.push(e$1);
|
|
1793
|
-
var t$1 = this;
|
|
1794
|
-
return e$1.on("data", function(e$2) {
|
|
1795
|
-
t$1.processChunk(e$2);
|
|
1796
|
-
}), e$1.on("end", function() {
|
|
1797
|
-
t$1.closedSource(t$1.previous.streamInfo), t$1._sources.length ? t$1.prepareNextSource() : t$1.end();
|
|
1798
|
-
}), e$1.on("error", function(e$2) {
|
|
1799
|
-
t$1.error(e$2);
|
|
1800
|
-
}), this;
|
|
1801
|
-
}, s.prototype.resume = function() {
|
|
1802
|
-
return !!i$1.prototype.resume.call(this) && (!this.previous && this._sources.length ? (this.prepareNextSource(), !0) : this.previous || this._sources.length || this.generatedError ? void 0 : (this.end(), !0));
|
|
1803
|
-
}, s.prototype.error = function(e$1) {
|
|
1804
|
-
var t$1 = this._sources;
|
|
1805
|
-
if (!i$1.prototype.error.call(this, e$1)) return !1;
|
|
1806
|
-
for (var r$1 = 0; r$1 < t$1.length; r$1++) try {
|
|
1807
|
-
t$1[r$1].error(e$1);
|
|
1808
|
-
} catch (e$2) {}
|
|
1809
|
-
return !0;
|
|
1810
|
-
}, s.prototype.lock = function() {
|
|
1811
|
-
i$1.prototype.lock.call(this);
|
|
1812
|
-
for (var e$1 = this._sources, t$1 = 0; t$1 < e$1.length; t$1++) e$1[t$1].lock();
|
|
1813
|
-
}, t.exports = s;
|
|
1814
|
-
}, {
|
|
1815
|
-
"../crc32": 4,
|
|
1816
|
-
"../signature": 23,
|
|
1817
|
-
"../stream/GenericWorker": 28,
|
|
1818
|
-
"../utf8": 31,
|
|
1819
|
-
"../utils": 32
|
|
1820
|
-
}],
|
|
1821
|
-
9: [function(e, t, r) {
|
|
1822
|
-
"use strict";
|
|
1823
|
-
var u = e("../compressions"), n = e("./ZipFileWorker");
|
|
1824
|
-
r.generateWorker = function(e$1, a, t$1) {
|
|
1825
|
-
var o = new n(a.streamFiles, t$1, a.platform, a.encodeFileName), h = 0;
|
|
1826
|
-
try {
|
|
1827
|
-
e$1.forEach(function(e$2, t$2) {
|
|
1828
|
-
h++;
|
|
1829
|
-
var r$1 = function(e$3, t$3) {
|
|
1830
|
-
var r$2 = e$3 || t$3, n$2 = u[r$2];
|
|
1831
|
-
if (!n$2) throw new Error(r$2 + " is not a valid compression method !");
|
|
1832
|
-
return n$2;
|
|
1833
|
-
}(t$2.options.compression, a.compression), n$1 = t$2.options.compressionOptions || a.compressionOptions || {}, i$1 = t$2.dir, s = t$2.date;
|
|
1834
|
-
t$2._compressWorker(r$1, n$1).withStreamInfo("file", {
|
|
1835
|
-
name: e$2,
|
|
1836
|
-
dir: i$1,
|
|
1837
|
-
date: s,
|
|
1838
|
-
comment: t$2.comment || "",
|
|
1839
|
-
unixPermissions: t$2.unixPermissions,
|
|
1840
|
-
dosPermissions: t$2.dosPermissions
|
|
1841
|
-
}).pipe(o);
|
|
1842
|
-
}), o.entriesCount = h;
|
|
1843
|
-
} catch (e$2) {
|
|
1844
|
-
o.error(e$2);
|
|
1845
|
-
}
|
|
1846
|
-
return o;
|
|
1847
|
-
};
|
|
1848
|
-
}, {
|
|
1849
|
-
"../compressions": 3,
|
|
1850
|
-
"./ZipFileWorker": 8
|
|
1851
|
-
}],
|
|
1852
|
-
10: [function(e, t, r) {
|
|
1853
|
-
"use strict";
|
|
1854
|
-
function n() {
|
|
1855
|
-
if (!(this instanceof n)) return new n();
|
|
1856
|
-
if (arguments.length) throw new Error("The constructor with parameters has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
1857
|
-
this.files = Object.create(null), this.comment = null, this.root = "", this.clone = function() {
|
|
1858
|
-
var e$1 = new n();
|
|
1859
|
-
for (var t$1 in this) "function" != typeof this[t$1] && (e$1[t$1] = this[t$1]);
|
|
1860
|
-
return e$1;
|
|
1861
|
-
};
|
|
1862
|
-
}
|
|
1863
|
-
(n.prototype = e("./object")).loadAsync = e("./load"), n.support = e("./support"), n.defaults = e("./defaults"), n.version = "3.10.1", n.loadAsync = function(e$1, t$1) {
|
|
1864
|
-
return new n().loadAsync(e$1, t$1);
|
|
1865
|
-
}, n.external = e("./external"), t.exports = n;
|
|
1866
|
-
}, {
|
|
1867
|
-
"./defaults": 5,
|
|
1868
|
-
"./external": 6,
|
|
1869
|
-
"./load": 11,
|
|
1870
|
-
"./object": 15,
|
|
1871
|
-
"./support": 30
|
|
1872
|
-
}],
|
|
1873
|
-
11: [function(e, t, r) {
|
|
1874
|
-
"use strict";
|
|
1875
|
-
var u = e("./utils"), i$1 = e("./external"), n = e("./utf8"), s = e("./zipEntries"), a = e("./stream/Crc32Probe"), l = e("./nodejsUtils");
|
|
1876
|
-
function f(n$1) {
|
|
1877
|
-
return new i$1.Promise(function(e$1, t$1) {
|
|
1878
|
-
var r$1 = n$1.decompressed.getContentWorker().pipe(new a());
|
|
1879
|
-
r$1.on("error", function(e$2) {
|
|
1880
|
-
t$1(e$2);
|
|
1881
|
-
}).on("end", function() {
|
|
1882
|
-
r$1.streamInfo.crc32 !== n$1.decompressed.crc32 ? t$1(/* @__PURE__ */ new Error("Corrupted zip : CRC32 mismatch")) : e$1();
|
|
1883
|
-
}).resume();
|
|
1884
|
-
});
|
|
1885
|
-
}
|
|
1886
|
-
t.exports = function(e$1, o) {
|
|
1887
|
-
var h = this;
|
|
1888
|
-
return o = u.extend(o || {}, {
|
|
1889
|
-
base64: !1,
|
|
1890
|
-
checkCRC32: !1,
|
|
1891
|
-
optimizedBinaryString: !1,
|
|
1892
|
-
createFolders: !1,
|
|
1893
|
-
decodeFileName: n.utf8decode
|
|
1894
|
-
}), l.isNode && l.isStream(e$1) ? i$1.Promise.reject(/* @__PURE__ */ new Error("JSZip can't accept a stream when loading a zip file.")) : u.prepareContent("the loaded zip file", e$1, !0, o.optimizedBinaryString, o.base64).then(function(e$2) {
|
|
1895
|
-
var t$1 = new s(o);
|
|
1896
|
-
return t$1.load(e$2), t$1;
|
|
1897
|
-
}).then(function(e$2) {
|
|
1898
|
-
var t$1 = [i$1.Promise.resolve(e$2)], r$1 = e$2.files;
|
|
1899
|
-
if (o.checkCRC32) for (var n$1 = 0; n$1 < r$1.length; n$1++) t$1.push(f(r$1[n$1]));
|
|
1900
|
-
return i$1.Promise.all(t$1);
|
|
1901
|
-
}).then(function(e$2) {
|
|
1902
|
-
for (var t$1 = e$2.shift(), r$1 = t$1.files, n$1 = 0; n$1 < r$1.length; n$1++) {
|
|
1903
|
-
var i$2 = r$1[n$1], s$1 = i$2.fileNameStr, a$1 = u.resolve(i$2.fileNameStr);
|
|
1904
|
-
h.file(a$1, i$2.decompressed, {
|
|
1905
|
-
binary: !0,
|
|
1906
|
-
optimizedBinaryString: !0,
|
|
1907
|
-
date: i$2.date,
|
|
1908
|
-
dir: i$2.dir,
|
|
1909
|
-
comment: i$2.fileCommentStr.length ? i$2.fileCommentStr : null,
|
|
1910
|
-
unixPermissions: i$2.unixPermissions,
|
|
1911
|
-
dosPermissions: i$2.dosPermissions,
|
|
1912
|
-
createFolders: o.createFolders
|
|
1913
|
-
}), i$2.dir || (h.file(a$1).unsafeOriginalName = s$1);
|
|
1914
|
-
}
|
|
1915
|
-
return t$1.zipComment.length && (h.comment = t$1.zipComment), h;
|
|
1916
|
-
});
|
|
1917
|
-
};
|
|
1918
|
-
}, {
|
|
1919
|
-
"./external": 6,
|
|
1920
|
-
"./nodejsUtils": 14,
|
|
1921
|
-
"./stream/Crc32Probe": 25,
|
|
1922
|
-
"./utf8": 31,
|
|
1923
|
-
"./utils": 32,
|
|
1924
|
-
"./zipEntries": 33
|
|
1925
|
-
}],
|
|
1926
|
-
12: [function(e, t, r) {
|
|
1927
|
-
"use strict";
|
|
1928
|
-
var n = e("../utils"), i$1 = e("../stream/GenericWorker");
|
|
1929
|
-
function s(e$1, t$1) {
|
|
1930
|
-
i$1.call(this, "Nodejs stream input adapter for " + e$1), this._upstreamEnded = !1, this._bindStream(t$1);
|
|
1931
|
-
}
|
|
1932
|
-
n.inherits(s, i$1), s.prototype._bindStream = function(e$1) {
|
|
1933
|
-
var t$1 = this;
|
|
1934
|
-
(this._stream = e$1).pause(), e$1.on("data", function(e$2) {
|
|
1935
|
-
t$1.push({
|
|
1936
|
-
data: e$2,
|
|
1937
|
-
meta: { percent: 0 }
|
|
1938
|
-
});
|
|
1939
|
-
}).on("error", function(e$2) {
|
|
1940
|
-
t$1.isPaused ? this.generatedError = e$2 : t$1.error(e$2);
|
|
1941
|
-
}).on("end", function() {
|
|
1942
|
-
t$1.isPaused ? t$1._upstreamEnded = !0 : t$1.end();
|
|
1943
|
-
});
|
|
1944
|
-
}, s.prototype.pause = function() {
|
|
1945
|
-
return !!i$1.prototype.pause.call(this) && (this._stream.pause(), !0);
|
|
1946
|
-
}, s.prototype.resume = function() {
|
|
1947
|
-
return !!i$1.prototype.resume.call(this) && (this._upstreamEnded ? this.end() : this._stream.resume(), !0);
|
|
1948
|
-
}, t.exports = s;
|
|
1949
|
-
}, {
|
|
1950
|
-
"../stream/GenericWorker": 28,
|
|
1951
|
-
"../utils": 32
|
|
1952
|
-
}],
|
|
1953
|
-
13: [function(e, t, r) {
|
|
1954
|
-
"use strict";
|
|
1955
|
-
var i$1 = e("readable-stream").Readable;
|
|
1956
|
-
function n(e$1, t$1, r$1) {
|
|
1957
|
-
i$1.call(this, t$1), this._helper = e$1;
|
|
1958
|
-
var n$1 = this;
|
|
1959
|
-
e$1.on("data", function(e$2, t$2) {
|
|
1960
|
-
n$1.push(e$2) || n$1._helper.pause(), r$1 && r$1(t$2);
|
|
1961
|
-
}).on("error", function(e$2) {
|
|
1962
|
-
n$1.emit("error", e$2);
|
|
1963
|
-
}).on("end", function() {
|
|
1964
|
-
n$1.push(null);
|
|
1965
|
-
});
|
|
1966
|
-
}
|
|
1967
|
-
e("../utils").inherits(n, i$1), n.prototype._read = function() {
|
|
1968
|
-
this._helper.resume();
|
|
1969
|
-
}, t.exports = n;
|
|
1970
|
-
}, {
|
|
1971
|
-
"../utils": 32,
|
|
1972
|
-
"readable-stream": 16
|
|
1973
|
-
}],
|
|
1974
|
-
14: [function(e, t, r) {
|
|
1975
|
-
"use strict";
|
|
1976
|
-
t.exports = {
|
|
1977
|
-
isNode: "undefined" != typeof Buffer,
|
|
1978
|
-
newBufferFrom: function(e$1, t$1) {
|
|
1979
|
-
if (Buffer.from && Buffer.from !== Uint8Array.from) return Buffer.from(e$1, t$1);
|
|
1980
|
-
if ("number" == typeof e$1) throw new Error("The \"data\" argument must not be a number");
|
|
1981
|
-
return new Buffer(e$1, t$1);
|
|
1982
|
-
},
|
|
1983
|
-
allocBuffer: function(e$1) {
|
|
1984
|
-
if (Buffer.alloc) return Buffer.alloc(e$1);
|
|
1985
|
-
var t$1 = new Buffer(e$1);
|
|
1986
|
-
return t$1.fill(0), t$1;
|
|
1987
|
-
},
|
|
1988
|
-
isBuffer: function(e$1) {
|
|
1989
|
-
return Buffer.isBuffer(e$1);
|
|
1990
|
-
},
|
|
1991
|
-
isStream: function(e$1) {
|
|
1992
|
-
return e$1 && "function" == typeof e$1.on && "function" == typeof e$1.pause && "function" == typeof e$1.resume;
|
|
1993
|
-
}
|
|
1994
|
-
};
|
|
1995
|
-
}, {}],
|
|
1996
|
-
15: [function(e, t, r) {
|
|
1997
|
-
"use strict";
|
|
1998
|
-
function s(e$1, t$1, r$1) {
|
|
1999
|
-
var n, i$2 = u.getTypeOf(t$1), s$1 = u.extend(r$1 || {}, f);
|
|
2000
|
-
s$1.date = s$1.date || /* @__PURE__ */ new Date(), null !== s$1.compression && (s$1.compression = s$1.compression.toUpperCase()), "string" == typeof s$1.unixPermissions && (s$1.unixPermissions = parseInt(s$1.unixPermissions, 8)), s$1.unixPermissions && 16384 & s$1.unixPermissions && (s$1.dir = !0), s$1.dosPermissions && 16 & s$1.dosPermissions && (s$1.dir = !0), s$1.dir && (e$1 = g(e$1)), s$1.createFolders && (n = _(e$1)) && b.call(this, n, !0);
|
|
2001
|
-
var a$1 = "string" === i$2 && !1 === s$1.binary && !1 === s$1.base64;
|
|
2002
|
-
r$1 && void 0 !== r$1.binary || (s$1.binary = !a$1), (t$1 instanceof c && 0 === t$1.uncompressedSize || s$1.dir || !t$1 || 0 === t$1.length) && (s$1.base64 = !1, s$1.binary = !0, t$1 = "", s$1.compression = "STORE", i$2 = "string");
|
|
2003
|
-
var o$1 = null;
|
|
2004
|
-
o$1 = t$1 instanceof c || t$1 instanceof l ? t$1 : p.isNode && p.isStream(t$1) ? new m(e$1, t$1) : u.prepareContent(e$1, t$1, s$1.binary, s$1.optimizedBinaryString, s$1.base64);
|
|
2005
|
-
var h$1 = new d(e$1, o$1, s$1);
|
|
2006
|
-
this.files[e$1] = h$1;
|
|
2007
|
-
}
|
|
2008
|
-
var i$1 = e("./utf8"), u = e("./utils"), l = e("./stream/GenericWorker"), a = e("./stream/StreamHelper"), f = e("./defaults"), c = e("./compressedObject"), d = e("./zipObject"), o = e("./generate"), p = e("./nodejsUtils"), m = e("./nodejs/NodejsStreamInputAdapter"), _ = function(e$1) {
|
|
2009
|
-
"/" === e$1.slice(-1) && (e$1 = e$1.substring(0, e$1.length - 1));
|
|
2010
|
-
var t$1 = e$1.lastIndexOf("/");
|
|
2011
|
-
return 0 < t$1 ? e$1.substring(0, t$1) : "";
|
|
2012
|
-
}, g = function(e$1) {
|
|
2013
|
-
return "/" !== e$1.slice(-1) && (e$1 += "/"), e$1;
|
|
2014
|
-
}, b = function(e$1, t$1) {
|
|
2015
|
-
return t$1 = void 0 !== t$1 ? t$1 : f.createFolders, e$1 = g(e$1), this.files[e$1] || s.call(this, e$1, null, {
|
|
2016
|
-
dir: !0,
|
|
2017
|
-
createFolders: t$1
|
|
2018
|
-
}), this.files[e$1];
|
|
2019
|
-
};
|
|
2020
|
-
function h(e$1) {
|
|
2021
|
-
return "[object RegExp]" === Object.prototype.toString.call(e$1);
|
|
2022
|
-
}
|
|
2023
|
-
t.exports = {
|
|
2024
|
-
load: function() {
|
|
2025
|
-
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
2026
|
-
},
|
|
2027
|
-
forEach: function(e$1) {
|
|
2028
|
-
var t$1, r$1, n;
|
|
2029
|
-
for (t$1 in this.files) n = this.files[t$1], (r$1 = t$1.slice(this.root.length, t$1.length)) && t$1.slice(0, this.root.length) === this.root && e$1(r$1, n);
|
|
2030
|
-
},
|
|
2031
|
-
filter: function(r$1) {
|
|
2032
|
-
var n = [];
|
|
2033
|
-
return this.forEach(function(e$1, t$1) {
|
|
2034
|
-
r$1(e$1, t$1) && n.push(t$1);
|
|
2035
|
-
}), n;
|
|
2036
|
-
},
|
|
2037
|
-
file: function(e$1, t$1, r$1) {
|
|
2038
|
-
if (1 !== arguments.length) return e$1 = this.root + e$1, s.call(this, e$1, t$1, r$1), this;
|
|
2039
|
-
if (h(e$1)) {
|
|
2040
|
-
var n = e$1;
|
|
2041
|
-
return this.filter(function(e$2, t$2) {
|
|
2042
|
-
return !t$2.dir && n.test(e$2);
|
|
2043
|
-
});
|
|
2044
|
-
}
|
|
2045
|
-
var i$2 = this.files[this.root + e$1];
|
|
2046
|
-
return i$2 && !i$2.dir ? i$2 : null;
|
|
2047
|
-
},
|
|
2048
|
-
folder: function(r$1) {
|
|
2049
|
-
if (!r$1) return this;
|
|
2050
|
-
if (h(r$1)) return this.filter(function(e$2, t$2) {
|
|
2051
|
-
return t$2.dir && r$1.test(e$2);
|
|
2052
|
-
});
|
|
2053
|
-
var e$1 = this.root + r$1, t$1 = b.call(this, e$1), n = this.clone();
|
|
2054
|
-
return n.root = t$1.name, n;
|
|
2055
|
-
},
|
|
2056
|
-
remove: function(r$1) {
|
|
2057
|
-
r$1 = this.root + r$1;
|
|
2058
|
-
var e$1 = this.files[r$1];
|
|
2059
|
-
if (e$1 || ("/" !== r$1.slice(-1) && (r$1 += "/"), e$1 = this.files[r$1]), e$1 && !e$1.dir) delete this.files[r$1];
|
|
2060
|
-
else for (var t$1 = this.filter(function(e$2, t$2) {
|
|
2061
|
-
return t$2.name.slice(0, r$1.length) === r$1;
|
|
2062
|
-
}), n = 0; n < t$1.length; n++) delete this.files[t$1[n].name];
|
|
2063
|
-
return this;
|
|
2064
|
-
},
|
|
2065
|
-
generate: function() {
|
|
2066
|
-
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
2067
|
-
},
|
|
2068
|
-
generateInternalStream: function(e$1) {
|
|
2069
|
-
var t$1, r$1 = {};
|
|
2070
|
-
try {
|
|
2071
|
-
if ((r$1 = u.extend(e$1 || {}, {
|
|
2072
|
-
streamFiles: !1,
|
|
2073
|
-
compression: "STORE",
|
|
2074
|
-
compressionOptions: null,
|
|
2075
|
-
type: "",
|
|
2076
|
-
platform: "DOS",
|
|
2077
|
-
comment: null,
|
|
2078
|
-
mimeType: "application/zip",
|
|
2079
|
-
encodeFileName: i$1.utf8encode
|
|
2080
|
-
})).type = r$1.type.toLowerCase(), r$1.compression = r$1.compression.toUpperCase(), "binarystring" === r$1.type && (r$1.type = "string"), !r$1.type) throw new Error("No output type specified.");
|
|
2081
|
-
u.checkSupport(r$1.type), "darwin" !== r$1.platform && "freebsd" !== r$1.platform && "linux" !== r$1.platform && "sunos" !== r$1.platform || (r$1.platform = "UNIX"), "win32" === r$1.platform && (r$1.platform = "DOS");
|
|
2082
|
-
var n = r$1.comment || this.comment || "";
|
|
2083
|
-
t$1 = o.generateWorker(this, r$1, n);
|
|
2084
|
-
} catch (e$2) {
|
|
2085
|
-
(t$1 = new l("error")).error(e$2);
|
|
2086
|
-
}
|
|
2087
|
-
return new a(t$1, r$1.type || "string", r$1.mimeType);
|
|
2088
|
-
},
|
|
2089
|
-
generateAsync: function(e$1, t$1) {
|
|
2090
|
-
return this.generateInternalStream(e$1).accumulate(t$1);
|
|
2091
|
-
},
|
|
2092
|
-
generateNodeStream: function(e$1, t$1) {
|
|
2093
|
-
return (e$1 = e$1 || {}).type || (e$1.type = "nodebuffer"), this.generateInternalStream(e$1).toNodejsStream(t$1);
|
|
2094
|
-
}
|
|
2095
|
-
};
|
|
2096
|
-
}, {
|
|
2097
|
-
"./compressedObject": 2,
|
|
2098
|
-
"./defaults": 5,
|
|
2099
|
-
"./generate": 9,
|
|
2100
|
-
"./nodejs/NodejsStreamInputAdapter": 12,
|
|
2101
|
-
"./nodejsUtils": 14,
|
|
2102
|
-
"./stream/GenericWorker": 28,
|
|
2103
|
-
"./stream/StreamHelper": 29,
|
|
2104
|
-
"./utf8": 31,
|
|
2105
|
-
"./utils": 32,
|
|
2106
|
-
"./zipObject": 35
|
|
2107
|
-
}],
|
|
2108
|
-
16: [function(e, t, r) {
|
|
2109
|
-
"use strict";
|
|
2110
|
-
t.exports = e("stream");
|
|
2111
|
-
}, { stream: void 0 }],
|
|
2112
|
-
17: [function(e, t, r) {
|
|
2113
|
-
"use strict";
|
|
2114
|
-
var n = e("./DataReader");
|
|
2115
|
-
function i$1(e$1) {
|
|
2116
|
-
n.call(this, e$1);
|
|
2117
|
-
for (var t$1 = 0; t$1 < this.data.length; t$1++) e$1[t$1] = 255 & e$1[t$1];
|
|
2118
|
-
}
|
|
2119
|
-
e("../utils").inherits(i$1, n), i$1.prototype.byteAt = function(e$1) {
|
|
2120
|
-
return this.data[this.zero + e$1];
|
|
2121
|
-
}, i$1.prototype.lastIndexOfSignature = function(e$1) {
|
|
2122
|
-
for (var t$1 = e$1.charCodeAt(0), r$1 = e$1.charCodeAt(1), n$1 = e$1.charCodeAt(2), i$2 = e$1.charCodeAt(3), s = this.length - 4; 0 <= s; --s) if (this.data[s] === t$1 && this.data[s + 1] === r$1 && this.data[s + 2] === n$1 && this.data[s + 3] === i$2) return s - this.zero;
|
|
2123
|
-
return -1;
|
|
2124
|
-
}, i$1.prototype.readAndCheckSignature = function(e$1) {
|
|
2125
|
-
var t$1 = e$1.charCodeAt(0), r$1 = e$1.charCodeAt(1), n$1 = e$1.charCodeAt(2), i$2 = e$1.charCodeAt(3), s = this.readData(4);
|
|
2126
|
-
return t$1 === s[0] && r$1 === s[1] && n$1 === s[2] && i$2 === s[3];
|
|
2127
|
-
}, i$1.prototype.readData = function(e$1) {
|
|
2128
|
-
if (this.checkOffset(e$1), 0 === e$1) return [];
|
|
2129
|
-
var t$1 = this.data.slice(this.zero + this.index, this.zero + this.index + e$1);
|
|
2130
|
-
return this.index += e$1, t$1;
|
|
2131
|
-
}, t.exports = i$1;
|
|
2132
|
-
}, {
|
|
2133
|
-
"../utils": 32,
|
|
2134
|
-
"./DataReader": 18
|
|
2135
|
-
}],
|
|
2136
|
-
18: [function(e, t, r) {
|
|
2137
|
-
"use strict";
|
|
2138
|
-
var n = e("../utils");
|
|
2139
|
-
function i$1(e$1) {
|
|
2140
|
-
this.data = e$1, this.length = e$1.length, this.index = 0, this.zero = 0;
|
|
2141
|
-
}
|
|
2142
|
-
i$1.prototype = {
|
|
2143
|
-
checkOffset: function(e$1) {
|
|
2144
|
-
this.checkIndex(this.index + e$1);
|
|
2145
|
-
},
|
|
2146
|
-
checkIndex: function(e$1) {
|
|
2147
|
-
if (this.length < this.zero + e$1 || e$1 < 0) throw new Error("End of data reached (data length = " + this.length + ", asked index = " + e$1 + "). Corrupted zip ?");
|
|
2148
|
-
},
|
|
2149
|
-
setIndex: function(e$1) {
|
|
2150
|
-
this.checkIndex(e$1), this.index = e$1;
|
|
2151
|
-
},
|
|
2152
|
-
skip: function(e$1) {
|
|
2153
|
-
this.setIndex(this.index + e$1);
|
|
2154
|
-
},
|
|
2155
|
-
byteAt: function() {},
|
|
2156
|
-
readInt: function(e$1) {
|
|
2157
|
-
var t$1, r$1 = 0;
|
|
2158
|
-
for (this.checkOffset(e$1), t$1 = this.index + e$1 - 1; t$1 >= this.index; t$1--) r$1 = (r$1 << 8) + this.byteAt(t$1);
|
|
2159
|
-
return this.index += e$1, r$1;
|
|
2160
|
-
},
|
|
2161
|
-
readString: function(e$1) {
|
|
2162
|
-
return n.transformTo("string", this.readData(e$1));
|
|
2163
|
-
},
|
|
2164
|
-
readData: function() {},
|
|
2165
|
-
lastIndexOfSignature: function() {},
|
|
2166
|
-
readAndCheckSignature: function() {},
|
|
2167
|
-
readDate: function() {
|
|
2168
|
-
var e$1 = this.readInt(4);
|
|
2169
|
-
return new Date(Date.UTC(1980 + (e$1 >> 25 & 127), (e$1 >> 21 & 15) - 1, e$1 >> 16 & 31, e$1 >> 11 & 31, e$1 >> 5 & 63, (31 & e$1) << 1));
|
|
2170
|
-
}
|
|
2171
|
-
}, t.exports = i$1;
|
|
2172
|
-
}, { "../utils": 32 }],
|
|
2173
|
-
19: [function(e, t, r) {
|
|
2174
|
-
"use strict";
|
|
2175
|
-
var n = e("./Uint8ArrayReader");
|
|
2176
|
-
function i$1(e$1) {
|
|
2177
|
-
n.call(this, e$1);
|
|
2178
|
-
}
|
|
2179
|
-
e("../utils").inherits(i$1, n), i$1.prototype.readData = function(e$1) {
|
|
2180
|
-
this.checkOffset(e$1);
|
|
2181
|
-
var t$1 = this.data.slice(this.zero + this.index, this.zero + this.index + e$1);
|
|
2182
|
-
return this.index += e$1, t$1;
|
|
2183
|
-
}, t.exports = i$1;
|
|
2184
|
-
}, {
|
|
2185
|
-
"../utils": 32,
|
|
2186
|
-
"./Uint8ArrayReader": 21
|
|
2187
|
-
}],
|
|
2188
|
-
20: [function(e, t, r) {
|
|
2189
|
-
"use strict";
|
|
2190
|
-
var n = e("./DataReader");
|
|
2191
|
-
function i$1(e$1) {
|
|
2192
|
-
n.call(this, e$1);
|
|
2193
|
-
}
|
|
2194
|
-
e("../utils").inherits(i$1, n), i$1.prototype.byteAt = function(e$1) {
|
|
2195
|
-
return this.data.charCodeAt(this.zero + e$1);
|
|
2196
|
-
}, i$1.prototype.lastIndexOfSignature = function(e$1) {
|
|
2197
|
-
return this.data.lastIndexOf(e$1) - this.zero;
|
|
2198
|
-
}, i$1.prototype.readAndCheckSignature = function(e$1) {
|
|
2199
|
-
return e$1 === this.readData(4);
|
|
2200
|
-
}, i$1.prototype.readData = function(e$1) {
|
|
2201
|
-
this.checkOffset(e$1);
|
|
2202
|
-
var t$1 = this.data.slice(this.zero + this.index, this.zero + this.index + e$1);
|
|
2203
|
-
return this.index += e$1, t$1;
|
|
2204
|
-
}, t.exports = i$1;
|
|
2205
|
-
}, {
|
|
2206
|
-
"../utils": 32,
|
|
2207
|
-
"./DataReader": 18
|
|
2208
|
-
}],
|
|
2209
|
-
21: [function(e, t, r) {
|
|
2210
|
-
"use strict";
|
|
2211
|
-
var n = e("./ArrayReader");
|
|
2212
|
-
function i$1(e$1) {
|
|
2213
|
-
n.call(this, e$1);
|
|
2214
|
-
}
|
|
2215
|
-
e("../utils").inherits(i$1, n), i$1.prototype.readData = function(e$1) {
|
|
2216
|
-
if (this.checkOffset(e$1), 0 === e$1) return new Uint8Array(0);
|
|
2217
|
-
var t$1 = this.data.subarray(this.zero + this.index, this.zero + this.index + e$1);
|
|
2218
|
-
return this.index += e$1, t$1;
|
|
2219
|
-
}, t.exports = i$1;
|
|
2220
|
-
}, {
|
|
2221
|
-
"../utils": 32,
|
|
2222
|
-
"./ArrayReader": 17
|
|
2223
|
-
}],
|
|
2224
|
-
22: [function(e, t, r) {
|
|
2225
|
-
"use strict";
|
|
2226
|
-
var n = e("../utils"), i$1 = e("../support"), s = e("./ArrayReader"), a = e("./StringReader"), o = e("./NodeBufferReader"), h = e("./Uint8ArrayReader");
|
|
2227
|
-
t.exports = function(e$1) {
|
|
2228
|
-
var t$1 = n.getTypeOf(e$1);
|
|
2229
|
-
return n.checkSupport(t$1), "string" !== t$1 || i$1.uint8array ? "nodebuffer" === t$1 ? new o(e$1) : i$1.uint8array ? new h(n.transformTo("uint8array", e$1)) : new s(n.transformTo("array", e$1)) : new a(e$1);
|
|
2230
|
-
};
|
|
2231
|
-
}, {
|
|
2232
|
-
"../support": 30,
|
|
2233
|
-
"../utils": 32,
|
|
2234
|
-
"./ArrayReader": 17,
|
|
2235
|
-
"./NodeBufferReader": 19,
|
|
2236
|
-
"./StringReader": 20,
|
|
2237
|
-
"./Uint8ArrayReader": 21
|
|
2238
|
-
}],
|
|
2239
|
-
23: [function(e, t, r) {
|
|
2240
|
-
"use strict";
|
|
2241
|
-
r.LOCAL_FILE_HEADER = "PK", r.CENTRAL_FILE_HEADER = "PK", r.CENTRAL_DIRECTORY_END = "PK", r.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x07", r.ZIP64_CENTRAL_DIRECTORY_END = "PK", r.DATA_DESCRIPTOR = "PK\x07\b";
|
|
2242
|
-
}, {}],
|
|
2243
|
-
24: [function(e, t, r) {
|
|
2244
|
-
"use strict";
|
|
2245
|
-
var n = e("./GenericWorker"), i$1 = e("../utils");
|
|
2246
|
-
function s(e$1) {
|
|
2247
|
-
n.call(this, "ConvertWorker to " + e$1), this.destType = e$1;
|
|
2248
|
-
}
|
|
2249
|
-
i$1.inherits(s, n), s.prototype.processChunk = function(e$1) {
|
|
2250
|
-
this.push({
|
|
2251
|
-
data: i$1.transformTo(this.destType, e$1.data),
|
|
2252
|
-
meta: e$1.meta
|
|
2253
|
-
});
|
|
2254
|
-
}, t.exports = s;
|
|
2255
|
-
}, {
|
|
2256
|
-
"../utils": 32,
|
|
2257
|
-
"./GenericWorker": 28
|
|
2258
|
-
}],
|
|
2259
|
-
25: [function(e, t, r) {
|
|
2260
|
-
"use strict";
|
|
2261
|
-
var n = e("./GenericWorker"), i$1 = e("../crc32");
|
|
2262
|
-
function s() {
|
|
2263
|
-
n.call(this, "Crc32Probe"), this.withStreamInfo("crc32", 0);
|
|
2264
|
-
}
|
|
2265
|
-
e("../utils").inherits(s, n), s.prototype.processChunk = function(e$1) {
|
|
2266
|
-
this.streamInfo.crc32 = i$1(e$1.data, this.streamInfo.crc32 || 0), this.push(e$1);
|
|
2267
|
-
}, t.exports = s;
|
|
2268
|
-
}, {
|
|
2269
|
-
"../crc32": 4,
|
|
2270
|
-
"../utils": 32,
|
|
2271
|
-
"./GenericWorker": 28
|
|
2272
|
-
}],
|
|
2273
|
-
26: [function(e, t, r) {
|
|
2274
|
-
"use strict";
|
|
2275
|
-
var n = e("../utils"), i$1 = e("./GenericWorker");
|
|
2276
|
-
function s(e$1) {
|
|
2277
|
-
i$1.call(this, "DataLengthProbe for " + e$1), this.propName = e$1, this.withStreamInfo(e$1, 0);
|
|
2278
|
-
}
|
|
2279
|
-
n.inherits(s, i$1), s.prototype.processChunk = function(e$1) {
|
|
2280
|
-
if (e$1) {
|
|
2281
|
-
var t$1 = this.streamInfo[this.propName] || 0;
|
|
2282
|
-
this.streamInfo[this.propName] = t$1 + e$1.data.length;
|
|
2283
|
-
}
|
|
2284
|
-
i$1.prototype.processChunk.call(this, e$1);
|
|
2285
|
-
}, t.exports = s;
|
|
2286
|
-
}, {
|
|
2287
|
-
"../utils": 32,
|
|
2288
|
-
"./GenericWorker": 28
|
|
2289
|
-
}],
|
|
2290
|
-
27: [function(e, t, r) {
|
|
2291
|
-
"use strict";
|
|
2292
|
-
var n = e("../utils"), i$1 = e("./GenericWorker");
|
|
2293
|
-
function s(e$1) {
|
|
2294
|
-
i$1.call(this, "DataWorker");
|
|
2295
|
-
var t$1 = this;
|
|
2296
|
-
this.dataIsReady = !1, this.index = 0, this.max = 0, this.data = null, this.type = "", this._tickScheduled = !1, e$1.then(function(e$2) {
|
|
2297
|
-
t$1.dataIsReady = !0, t$1.data = e$2, t$1.max = e$2 && e$2.length || 0, t$1.type = n.getTypeOf(e$2), t$1.isPaused || t$1._tickAndRepeat();
|
|
2298
|
-
}, function(e$2) {
|
|
2299
|
-
t$1.error(e$2);
|
|
2300
|
-
});
|
|
2301
|
-
}
|
|
2302
|
-
n.inherits(s, i$1), s.prototype.cleanUp = function() {
|
|
2303
|
-
i$1.prototype.cleanUp.call(this), this.data = null;
|
|
2304
|
-
}, s.prototype.resume = function() {
|
|
2305
|
-
return !!i$1.prototype.resume.call(this) && (!this._tickScheduled && this.dataIsReady && (this._tickScheduled = !0, n.delay(this._tickAndRepeat, [], this)), !0);
|
|
2306
|
-
}, s.prototype._tickAndRepeat = function() {
|
|
2307
|
-
this._tickScheduled = !1, this.isPaused || this.isFinished || (this._tick(), this.isFinished || (n.delay(this._tickAndRepeat, [], this), this._tickScheduled = !0));
|
|
2308
|
-
}, s.prototype._tick = function() {
|
|
2309
|
-
if (this.isPaused || this.isFinished) return !1;
|
|
2310
|
-
var e$1 = null, t$1 = Math.min(this.max, this.index + 16384);
|
|
2311
|
-
if (this.index >= this.max) return this.end();
|
|
2312
|
-
switch (this.type) {
|
|
2313
|
-
case "string":
|
|
2314
|
-
e$1 = this.data.substring(this.index, t$1);
|
|
2315
|
-
break;
|
|
2316
|
-
case "uint8array":
|
|
2317
|
-
e$1 = this.data.subarray(this.index, t$1);
|
|
2318
|
-
break;
|
|
2319
|
-
case "array":
|
|
2320
|
-
case "nodebuffer": e$1 = this.data.slice(this.index, t$1);
|
|
2321
|
-
}
|
|
2322
|
-
return this.index = t$1, this.push({
|
|
2323
|
-
data: e$1,
|
|
2324
|
-
meta: { percent: this.max ? this.index / this.max * 100 : 0 }
|
|
2325
|
-
});
|
|
2326
|
-
}, t.exports = s;
|
|
2327
|
-
}, {
|
|
2328
|
-
"../utils": 32,
|
|
2329
|
-
"./GenericWorker": 28
|
|
2330
|
-
}],
|
|
2331
|
-
28: [function(e, t, r) {
|
|
2332
|
-
"use strict";
|
|
2333
|
-
function n(e$1) {
|
|
2334
|
-
this.name = e$1 || "default", this.streamInfo = {}, this.generatedError = null, this.extraStreamInfo = {}, this.isPaused = !0, this.isFinished = !1, this.isLocked = !1, this._listeners = {
|
|
2335
|
-
data: [],
|
|
2336
|
-
end: [],
|
|
2337
|
-
error: []
|
|
2338
|
-
}, this.previous = null;
|
|
2339
|
-
}
|
|
2340
|
-
n.prototype = {
|
|
2341
|
-
push: function(e$1) {
|
|
2342
|
-
this.emit("data", e$1);
|
|
2343
|
-
},
|
|
2344
|
-
end: function() {
|
|
2345
|
-
if (this.isFinished) return !1;
|
|
2346
|
-
this.flush();
|
|
2347
|
-
try {
|
|
2348
|
-
this.emit("end"), this.cleanUp(), this.isFinished = !0;
|
|
2349
|
-
} catch (e$1) {
|
|
2350
|
-
this.emit("error", e$1);
|
|
2351
|
-
}
|
|
2352
|
-
return !0;
|
|
2353
|
-
},
|
|
2354
|
-
error: function(e$1) {
|
|
2355
|
-
return !this.isFinished && (this.isPaused ? this.generatedError = e$1 : (this.isFinished = !0, this.emit("error", e$1), this.previous && this.previous.error(e$1), this.cleanUp()), !0);
|
|
2356
|
-
},
|
|
2357
|
-
on: function(e$1, t$1) {
|
|
2358
|
-
return this._listeners[e$1].push(t$1), this;
|
|
2359
|
-
},
|
|
2360
|
-
cleanUp: function() {
|
|
2361
|
-
this.streamInfo = this.generatedError = this.extraStreamInfo = null, this._listeners = [];
|
|
2362
|
-
},
|
|
2363
|
-
emit: function(e$1, t$1) {
|
|
2364
|
-
if (this._listeners[e$1]) for (var r$1 = 0; r$1 < this._listeners[e$1].length; r$1++) this._listeners[e$1][r$1].call(this, t$1);
|
|
2365
|
-
},
|
|
2366
|
-
pipe: function(e$1) {
|
|
2367
|
-
return e$1.registerPrevious(this);
|
|
2368
|
-
},
|
|
2369
|
-
registerPrevious: function(e$1) {
|
|
2370
|
-
if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
|
|
2371
|
-
this.streamInfo = e$1.streamInfo, this.mergeStreamInfo(), this.previous = e$1;
|
|
2372
|
-
var t$1 = this;
|
|
2373
|
-
return e$1.on("data", function(e$2) {
|
|
2374
|
-
t$1.processChunk(e$2);
|
|
2375
|
-
}), e$1.on("end", function() {
|
|
2376
|
-
t$1.end();
|
|
2377
|
-
}), e$1.on("error", function(e$2) {
|
|
2378
|
-
t$1.error(e$2);
|
|
2379
|
-
}), this;
|
|
2380
|
-
},
|
|
2381
|
-
pause: function() {
|
|
2382
|
-
return !this.isPaused && !this.isFinished && (this.isPaused = !0, this.previous && this.previous.pause(), !0);
|
|
2383
|
-
},
|
|
2384
|
-
resume: function() {
|
|
2385
|
-
if (!this.isPaused || this.isFinished) return !1;
|
|
2386
|
-
var e$1 = this.isPaused = !1;
|
|
2387
|
-
return this.generatedError && (this.error(this.generatedError), e$1 = !0), this.previous && this.previous.resume(), !e$1;
|
|
2388
|
-
},
|
|
2389
|
-
flush: function() {},
|
|
2390
|
-
processChunk: function(e$1) {
|
|
2391
|
-
this.push(e$1);
|
|
2392
|
-
},
|
|
2393
|
-
withStreamInfo: function(e$1, t$1) {
|
|
2394
|
-
return this.extraStreamInfo[e$1] = t$1, this.mergeStreamInfo(), this;
|
|
2395
|
-
},
|
|
2396
|
-
mergeStreamInfo: function() {
|
|
2397
|
-
for (var e$1 in this.extraStreamInfo) Object.prototype.hasOwnProperty.call(this.extraStreamInfo, e$1) && (this.streamInfo[e$1] = this.extraStreamInfo[e$1]);
|
|
2398
|
-
},
|
|
2399
|
-
lock: function() {
|
|
2400
|
-
if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
|
|
2401
|
-
this.isLocked = !0, this.previous && this.previous.lock();
|
|
2402
|
-
},
|
|
2403
|
-
toString: function() {
|
|
2404
|
-
var e$1 = "Worker " + this.name;
|
|
2405
|
-
return this.previous ? this.previous + " -> " + e$1 : e$1;
|
|
2406
|
-
}
|
|
2407
|
-
}, t.exports = n;
|
|
2408
|
-
}, {}],
|
|
2409
|
-
29: [function(e, t, r) {
|
|
2410
|
-
"use strict";
|
|
2411
|
-
var h = e("../utils"), i$1 = e("./ConvertWorker"), s = e("./GenericWorker"), u = e("../base64"), n = e("../support"), a = e("../external"), o = null;
|
|
2412
|
-
if (n.nodestream) try {
|
|
2413
|
-
o = e("../nodejs/NodejsStreamOutputAdapter");
|
|
2414
|
-
} catch (e$1) {}
|
|
2415
|
-
function l(e$1, o$1) {
|
|
2416
|
-
return new a.Promise(function(t$1, r$1) {
|
|
2417
|
-
var n$1 = [], i$2 = e$1._internalType, s$1 = e$1._outputType, a$1 = e$1._mimeType;
|
|
2418
|
-
e$1.on("data", function(e$2, t$2) {
|
|
2419
|
-
n$1.push(e$2), o$1 && o$1(t$2);
|
|
2420
|
-
}).on("error", function(e$2) {
|
|
2421
|
-
n$1 = [], r$1(e$2);
|
|
2422
|
-
}).on("end", function() {
|
|
2423
|
-
try {
|
|
2424
|
-
t$1(function(e$2, t$2, r$2) {
|
|
2425
|
-
switch (e$2) {
|
|
2426
|
-
case "blob": return h.newBlob(h.transformTo("arraybuffer", t$2), r$2);
|
|
2427
|
-
case "base64": return u.encode(t$2);
|
|
2428
|
-
default: return h.transformTo(e$2, t$2);
|
|
2429
|
-
}
|
|
2430
|
-
}(s$1, function(e$2, t$2) {
|
|
2431
|
-
var r$2, n$2 = 0, i$3 = null, s$2 = 0;
|
|
2432
|
-
for (r$2 = 0; r$2 < t$2.length; r$2++) s$2 += t$2[r$2].length;
|
|
2433
|
-
switch (e$2) {
|
|
2434
|
-
case "string": return t$2.join("");
|
|
2435
|
-
case "array": return Array.prototype.concat.apply([], t$2);
|
|
2436
|
-
case "uint8array":
|
|
2437
|
-
for (i$3 = new Uint8Array(s$2), r$2 = 0; r$2 < t$2.length; r$2++) i$3.set(t$2[r$2], n$2), n$2 += t$2[r$2].length;
|
|
2438
|
-
return i$3;
|
|
2439
|
-
case "nodebuffer": return Buffer.concat(t$2);
|
|
2440
|
-
default: throw new Error("concat : unsupported type '" + e$2 + "'");
|
|
2441
|
-
}
|
|
2442
|
-
}(i$2, n$1), a$1));
|
|
2443
|
-
} catch (e$2) {
|
|
2444
|
-
r$1(e$2);
|
|
2445
|
-
}
|
|
2446
|
-
n$1 = [];
|
|
2447
|
-
}).resume();
|
|
2448
|
-
});
|
|
2449
|
-
}
|
|
2450
|
-
function f(e$1, t$1, r$1) {
|
|
2451
|
-
var n$1 = t$1;
|
|
2452
|
-
switch (t$1) {
|
|
2453
|
-
case "blob":
|
|
2454
|
-
case "arraybuffer":
|
|
2455
|
-
n$1 = "uint8array";
|
|
2456
|
-
break;
|
|
2457
|
-
case "base64": n$1 = "string";
|
|
2458
|
-
}
|
|
2459
|
-
try {
|
|
2460
|
-
this._internalType = n$1, this._outputType = t$1, this._mimeType = r$1, h.checkSupport(n$1), this._worker = e$1.pipe(new i$1(n$1)), e$1.lock();
|
|
2461
|
-
} catch (e$2) {
|
|
2462
|
-
this._worker = new s("error"), this._worker.error(e$2);
|
|
2463
|
-
}
|
|
2464
|
-
}
|
|
2465
|
-
f.prototype = {
|
|
2466
|
-
accumulate: function(e$1) {
|
|
2467
|
-
return l(this, e$1);
|
|
2468
|
-
},
|
|
2469
|
-
on: function(e$1, t$1) {
|
|
2470
|
-
var r$1 = this;
|
|
2471
|
-
return "data" === e$1 ? this._worker.on(e$1, function(e$2) {
|
|
2472
|
-
t$1.call(r$1, e$2.data, e$2.meta);
|
|
2473
|
-
}) : this._worker.on(e$1, function() {
|
|
2474
|
-
h.delay(t$1, arguments, r$1);
|
|
2475
|
-
}), this;
|
|
2476
|
-
},
|
|
2477
|
-
resume: function() {
|
|
2478
|
-
return h.delay(this._worker.resume, [], this._worker), this;
|
|
2479
|
-
},
|
|
2480
|
-
pause: function() {
|
|
2481
|
-
return this._worker.pause(), this;
|
|
2482
|
-
},
|
|
2483
|
-
toNodejsStream: function(e$1) {
|
|
2484
|
-
if (h.checkSupport("nodestream"), "nodebuffer" !== this._outputType) throw new Error(this._outputType + " is not supported by this method");
|
|
2485
|
-
return new o(this, { objectMode: "nodebuffer" !== this._outputType }, e$1);
|
|
2486
|
-
}
|
|
2487
|
-
}, t.exports = f;
|
|
2488
|
-
}, {
|
|
2489
|
-
"../base64": 1,
|
|
2490
|
-
"../external": 6,
|
|
2491
|
-
"../nodejs/NodejsStreamOutputAdapter": 13,
|
|
2492
|
-
"../support": 30,
|
|
2493
|
-
"../utils": 32,
|
|
2494
|
-
"./ConvertWorker": 24,
|
|
2495
|
-
"./GenericWorker": 28
|
|
2496
|
-
}],
|
|
2497
|
-
30: [function(e, t, r) {
|
|
2498
|
-
"use strict";
|
|
2499
|
-
if (r.base64 = !0, r.array = !0, r.string = !0, r.arraybuffer = "undefined" != typeof ArrayBuffer && "undefined" != typeof Uint8Array, r.nodebuffer = "undefined" != typeof Buffer, r.uint8array = "undefined" != typeof Uint8Array, "undefined" == typeof ArrayBuffer) r.blob = !1;
|
|
2500
|
-
else {
|
|
2501
|
-
var n = /* @__PURE__ */ new ArrayBuffer(0);
|
|
2502
|
-
try {
|
|
2503
|
-
r.blob = 0 === new Blob([n], { type: "application/zip" }).size;
|
|
2504
|
-
} catch (e$1) {
|
|
2505
|
-
try {
|
|
2506
|
-
var i$1 = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
|
|
2507
|
-
i$1.append(n), r.blob = 0 === i$1.getBlob("application/zip").size;
|
|
2508
|
-
} catch (e$2) {
|
|
2509
|
-
r.blob = !1;
|
|
2510
|
-
}
|
|
2511
|
-
}
|
|
2512
|
-
}
|
|
2513
|
-
try {
|
|
2514
|
-
r.nodestream = !!e("readable-stream").Readable;
|
|
2515
|
-
} catch (e$1) {
|
|
2516
|
-
r.nodestream = !1;
|
|
2517
|
-
}
|
|
2518
|
-
}, { "readable-stream": 16 }],
|
|
2519
|
-
31: [function(e, t, s) {
|
|
2520
|
-
"use strict";
|
|
2521
|
-
for (var o = e("./utils"), h = e("./support"), r = e("./nodejsUtils"), n = e("./stream/GenericWorker"), u = new Array(256), i$1 = 0; i$1 < 256; i$1++) u[i$1] = 252 <= i$1 ? 6 : 248 <= i$1 ? 5 : 240 <= i$1 ? 4 : 224 <= i$1 ? 3 : 192 <= i$1 ? 2 : 1;
|
|
2522
|
-
u[254] = u[254] = 1;
|
|
2523
|
-
function a() {
|
|
2524
|
-
n.call(this, "utf-8 decode"), this.leftOver = null;
|
|
2525
|
-
}
|
|
2526
|
-
function l() {
|
|
2527
|
-
n.call(this, "utf-8 encode");
|
|
2528
|
-
}
|
|
2529
|
-
s.utf8encode = function(e$1) {
|
|
2530
|
-
return h.nodebuffer ? r.newBufferFrom(e$1, "utf-8") : function(e$2) {
|
|
2531
|
-
var t$1, r$1, n$1, i$2, s$1, a$1 = e$2.length, o$1 = 0;
|
|
2532
|
-
for (i$2 = 0; i$2 < a$1; i$2++) 55296 == (64512 & (r$1 = e$2.charCodeAt(i$2))) && i$2 + 1 < a$1 && 56320 == (64512 & (n$1 = e$2.charCodeAt(i$2 + 1))) && (r$1 = 65536 + (r$1 - 55296 << 10) + (n$1 - 56320), i$2++), o$1 += r$1 < 128 ? 1 : r$1 < 2048 ? 2 : r$1 < 65536 ? 3 : 4;
|
|
2533
|
-
for (t$1 = h.uint8array ? new Uint8Array(o$1) : new Array(o$1), i$2 = s$1 = 0; s$1 < o$1; i$2++) 55296 == (64512 & (r$1 = e$2.charCodeAt(i$2))) && i$2 + 1 < a$1 && 56320 == (64512 & (n$1 = e$2.charCodeAt(i$2 + 1))) && (r$1 = 65536 + (r$1 - 55296 << 10) + (n$1 - 56320), i$2++), r$1 < 128 ? t$1[s$1++] = r$1 : (r$1 < 2048 ? t$1[s$1++] = 192 | r$1 >>> 6 : (r$1 < 65536 ? t$1[s$1++] = 224 | r$1 >>> 12 : (t$1[s$1++] = 240 | r$1 >>> 18, t$1[s$1++] = 128 | r$1 >>> 12 & 63), t$1[s$1++] = 128 | r$1 >>> 6 & 63), t$1[s$1++] = 128 | 63 & r$1);
|
|
2534
|
-
return t$1;
|
|
2535
|
-
}(e$1);
|
|
2536
|
-
}, s.utf8decode = function(e$1) {
|
|
2537
|
-
return h.nodebuffer ? o.transformTo("nodebuffer", e$1).toString("utf-8") : function(e$2) {
|
|
2538
|
-
var t$1, r$1, n$1, i$2, s$1 = e$2.length, a$1 = new Array(2 * s$1);
|
|
2539
|
-
for (t$1 = r$1 = 0; t$1 < s$1;) if ((n$1 = e$2[t$1++]) < 128) a$1[r$1++] = n$1;
|
|
2540
|
-
else if (4 < (i$2 = u[n$1])) a$1[r$1++] = 65533, t$1 += i$2 - 1;
|
|
2541
|
-
else {
|
|
2542
|
-
for (n$1 &= 2 === i$2 ? 31 : 3 === i$2 ? 15 : 7; 1 < i$2 && t$1 < s$1;) n$1 = n$1 << 6 | 63 & e$2[t$1++], i$2--;
|
|
2543
|
-
1 < i$2 ? a$1[r$1++] = 65533 : n$1 < 65536 ? a$1[r$1++] = n$1 : (n$1 -= 65536, a$1[r$1++] = 55296 | n$1 >> 10 & 1023, a$1[r$1++] = 56320 | 1023 & n$1);
|
|
2544
|
-
}
|
|
2545
|
-
return a$1.length !== r$1 && (a$1.subarray ? a$1 = a$1.subarray(0, r$1) : a$1.length = r$1), o.applyFromCharCode(a$1);
|
|
2546
|
-
}(e$1 = o.transformTo(h.uint8array ? "uint8array" : "array", e$1));
|
|
2547
|
-
}, o.inherits(a, n), a.prototype.processChunk = function(e$1) {
|
|
2548
|
-
var t$1 = o.transformTo(h.uint8array ? "uint8array" : "array", e$1.data);
|
|
2549
|
-
if (this.leftOver && this.leftOver.length) {
|
|
2550
|
-
if (h.uint8array) {
|
|
2551
|
-
var r$1 = t$1;
|
|
2552
|
-
(t$1 = new Uint8Array(r$1.length + this.leftOver.length)).set(this.leftOver, 0), t$1.set(r$1, this.leftOver.length);
|
|
2553
|
-
} else t$1 = this.leftOver.concat(t$1);
|
|
2554
|
-
this.leftOver = null;
|
|
2555
|
-
}
|
|
2556
|
-
var n$1 = function(e$2, t$2) {
|
|
2557
|
-
var r$2;
|
|
2558
|
-
for ((t$2 = t$2 || e$2.length) > e$2.length && (t$2 = e$2.length), r$2 = t$2 - 1; 0 <= r$2 && 128 == (192 & e$2[r$2]);) r$2--;
|
|
2559
|
-
return r$2 < 0 ? t$2 : 0 === r$2 ? t$2 : r$2 + u[e$2[r$2]] > t$2 ? r$2 : t$2;
|
|
2560
|
-
}(t$1), i$2 = t$1;
|
|
2561
|
-
n$1 !== t$1.length && (h.uint8array ? (i$2 = t$1.subarray(0, n$1), this.leftOver = t$1.subarray(n$1, t$1.length)) : (i$2 = t$1.slice(0, n$1), this.leftOver = t$1.slice(n$1, t$1.length))), this.push({
|
|
2562
|
-
data: s.utf8decode(i$2),
|
|
2563
|
-
meta: e$1.meta
|
|
2564
|
-
});
|
|
2565
|
-
}, a.prototype.flush = function() {
|
|
2566
|
-
this.leftOver && this.leftOver.length && (this.push({
|
|
2567
|
-
data: s.utf8decode(this.leftOver),
|
|
2568
|
-
meta: {}
|
|
2569
|
-
}), this.leftOver = null);
|
|
2570
|
-
}, s.Utf8DecodeWorker = a, o.inherits(l, n), l.prototype.processChunk = function(e$1) {
|
|
2571
|
-
this.push({
|
|
2572
|
-
data: s.utf8encode(e$1.data),
|
|
2573
|
-
meta: e$1.meta
|
|
2574
|
-
});
|
|
2575
|
-
}, s.Utf8EncodeWorker = l;
|
|
2576
|
-
}, {
|
|
2577
|
-
"./nodejsUtils": 14,
|
|
2578
|
-
"./stream/GenericWorker": 28,
|
|
2579
|
-
"./support": 30,
|
|
2580
|
-
"./utils": 32
|
|
2581
|
-
}],
|
|
2582
|
-
32: [function(e, t, a) {
|
|
2583
|
-
"use strict";
|
|
2584
|
-
var o = e("./support"), h = e("./base64"), r = e("./nodejsUtils"), u = e("./external");
|
|
2585
|
-
function n(e$1) {
|
|
2586
|
-
return e$1;
|
|
2587
|
-
}
|
|
2588
|
-
function l(e$1, t$1) {
|
|
2589
|
-
for (var r$1 = 0; r$1 < e$1.length; ++r$1) t$1[r$1] = 255 & e$1.charCodeAt(r$1);
|
|
2590
|
-
return t$1;
|
|
2591
|
-
}
|
|
2592
|
-
e("setimmediate"), a.newBlob = function(t$1, r$1) {
|
|
2593
|
-
a.checkSupport("blob");
|
|
2594
|
-
try {
|
|
2595
|
-
return new Blob([t$1], { type: r$1 });
|
|
2596
|
-
} catch (e$1) {
|
|
2597
|
-
try {
|
|
2598
|
-
var n$1 = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
|
|
2599
|
-
return n$1.append(t$1), n$1.getBlob(r$1);
|
|
2600
|
-
} catch (e$2) {
|
|
2601
|
-
throw new Error("Bug : can't construct the Blob.");
|
|
2602
|
-
}
|
|
2603
|
-
}
|
|
2604
|
-
};
|
|
2605
|
-
var i$1 = {
|
|
2606
|
-
stringifyByChunk: function(e$1, t$1, r$1) {
|
|
2607
|
-
var n$1 = [], i$2 = 0, s$1 = e$1.length;
|
|
2608
|
-
if (s$1 <= r$1) return String.fromCharCode.apply(null, e$1);
|
|
2609
|
-
for (; i$2 < s$1;) "array" === t$1 || "nodebuffer" === t$1 ? n$1.push(String.fromCharCode.apply(null, e$1.slice(i$2, Math.min(i$2 + r$1, s$1)))) : n$1.push(String.fromCharCode.apply(null, e$1.subarray(i$2, Math.min(i$2 + r$1, s$1)))), i$2 += r$1;
|
|
2610
|
-
return n$1.join("");
|
|
2611
|
-
},
|
|
2612
|
-
stringifyByChar: function(e$1) {
|
|
2613
|
-
for (var t$1 = "", r$1 = 0; r$1 < e$1.length; r$1++) t$1 += String.fromCharCode(e$1[r$1]);
|
|
2614
|
-
return t$1;
|
|
2615
|
-
},
|
|
2616
|
-
applyCanBeUsed: {
|
|
2617
|
-
uint8array: function() {
|
|
2618
|
-
try {
|
|
2619
|
-
return o.uint8array && 1 === String.fromCharCode.apply(null, new Uint8Array(1)).length;
|
|
2620
|
-
} catch (e$1) {
|
|
2621
|
-
return !1;
|
|
2622
|
-
}
|
|
2623
|
-
}(),
|
|
2624
|
-
nodebuffer: function() {
|
|
2625
|
-
try {
|
|
2626
|
-
return o.nodebuffer && 1 === String.fromCharCode.apply(null, r.allocBuffer(1)).length;
|
|
2627
|
-
} catch (e$1) {
|
|
2628
|
-
return !1;
|
|
2629
|
-
}
|
|
2630
|
-
}()
|
|
2631
|
-
}
|
|
2632
|
-
};
|
|
2633
|
-
function s(e$1) {
|
|
2634
|
-
var t$1 = 65536, r$1 = a.getTypeOf(e$1), n$1 = !0;
|
|
2635
|
-
if ("uint8array" === r$1 ? n$1 = i$1.applyCanBeUsed.uint8array : "nodebuffer" === r$1 && (n$1 = i$1.applyCanBeUsed.nodebuffer), n$1) for (; 1 < t$1;) try {
|
|
2636
|
-
return i$1.stringifyByChunk(e$1, r$1, t$1);
|
|
2637
|
-
} catch (e$2) {
|
|
2638
|
-
t$1 = Math.floor(t$1 / 2);
|
|
2639
|
-
}
|
|
2640
|
-
return i$1.stringifyByChar(e$1);
|
|
2641
|
-
}
|
|
2642
|
-
function f(e$1, t$1) {
|
|
2643
|
-
for (var r$1 = 0; r$1 < e$1.length; r$1++) t$1[r$1] = e$1[r$1];
|
|
2644
|
-
return t$1;
|
|
2645
|
-
}
|
|
2646
|
-
a.applyFromCharCode = s;
|
|
2647
|
-
var c = {};
|
|
2648
|
-
c.string = {
|
|
2649
|
-
string: n,
|
|
2650
|
-
array: function(e$1) {
|
|
2651
|
-
return l(e$1, new Array(e$1.length));
|
|
2652
|
-
},
|
|
2653
|
-
arraybuffer: function(e$1) {
|
|
2654
|
-
return c.string.uint8array(e$1).buffer;
|
|
2655
|
-
},
|
|
2656
|
-
uint8array: function(e$1) {
|
|
2657
|
-
return l(e$1, new Uint8Array(e$1.length));
|
|
2658
|
-
},
|
|
2659
|
-
nodebuffer: function(e$1) {
|
|
2660
|
-
return l(e$1, r.allocBuffer(e$1.length));
|
|
2661
|
-
}
|
|
2662
|
-
}, c.array = {
|
|
2663
|
-
string: s,
|
|
2664
|
-
array: n,
|
|
2665
|
-
arraybuffer: function(e$1) {
|
|
2666
|
-
return new Uint8Array(e$1).buffer;
|
|
2667
|
-
},
|
|
2668
|
-
uint8array: function(e$1) {
|
|
2669
|
-
return new Uint8Array(e$1);
|
|
2670
|
-
},
|
|
2671
|
-
nodebuffer: function(e$1) {
|
|
2672
|
-
return r.newBufferFrom(e$1);
|
|
2673
|
-
}
|
|
2674
|
-
}, c.arraybuffer = {
|
|
2675
|
-
string: function(e$1) {
|
|
2676
|
-
return s(new Uint8Array(e$1));
|
|
2677
|
-
},
|
|
2678
|
-
array: function(e$1) {
|
|
2679
|
-
return f(new Uint8Array(e$1), new Array(e$1.byteLength));
|
|
2680
|
-
},
|
|
2681
|
-
arraybuffer: n,
|
|
2682
|
-
uint8array: function(e$1) {
|
|
2683
|
-
return new Uint8Array(e$1);
|
|
2684
|
-
},
|
|
2685
|
-
nodebuffer: function(e$1) {
|
|
2686
|
-
return r.newBufferFrom(new Uint8Array(e$1));
|
|
2687
|
-
}
|
|
2688
|
-
}, c.uint8array = {
|
|
2689
|
-
string: s,
|
|
2690
|
-
array: function(e$1) {
|
|
2691
|
-
return f(e$1, new Array(e$1.length));
|
|
2692
|
-
},
|
|
2693
|
-
arraybuffer: function(e$1) {
|
|
2694
|
-
return e$1.buffer;
|
|
2695
|
-
},
|
|
2696
|
-
uint8array: n,
|
|
2697
|
-
nodebuffer: function(e$1) {
|
|
2698
|
-
return r.newBufferFrom(e$1);
|
|
2699
|
-
}
|
|
2700
|
-
}, c.nodebuffer = {
|
|
2701
|
-
string: s,
|
|
2702
|
-
array: function(e$1) {
|
|
2703
|
-
return f(e$1, new Array(e$1.length));
|
|
2704
|
-
},
|
|
2705
|
-
arraybuffer: function(e$1) {
|
|
2706
|
-
return c.nodebuffer.uint8array(e$1).buffer;
|
|
2707
|
-
},
|
|
2708
|
-
uint8array: function(e$1) {
|
|
2709
|
-
return f(e$1, new Uint8Array(e$1.length));
|
|
2710
|
-
},
|
|
2711
|
-
nodebuffer: n
|
|
2712
|
-
}, a.transformTo = function(e$1, t$1) {
|
|
2713
|
-
if (t$1 = t$1 || "", !e$1) return t$1;
|
|
2714
|
-
a.checkSupport(e$1);
|
|
2715
|
-
return c[a.getTypeOf(t$1)][e$1](t$1);
|
|
2716
|
-
}, a.resolve = function(e$1) {
|
|
2717
|
-
for (var t$1 = e$1.split("/"), r$1 = [], n$1 = 0; n$1 < t$1.length; n$1++) {
|
|
2718
|
-
var i$2 = t$1[n$1];
|
|
2719
|
-
"." === i$2 || "" === i$2 && 0 !== n$1 && n$1 !== t$1.length - 1 || (".." === i$2 ? r$1.pop() : r$1.push(i$2));
|
|
2720
|
-
}
|
|
2721
|
-
return r$1.join("/");
|
|
2722
|
-
}, a.getTypeOf = function(e$1) {
|
|
2723
|
-
return "string" == typeof e$1 ? "string" : "[object Array]" === Object.prototype.toString.call(e$1) ? "array" : o.nodebuffer && r.isBuffer(e$1) ? "nodebuffer" : o.uint8array && e$1 instanceof Uint8Array ? "uint8array" : o.arraybuffer && e$1 instanceof ArrayBuffer ? "arraybuffer" : void 0;
|
|
2724
|
-
}, a.checkSupport = function(e$1) {
|
|
2725
|
-
if (!o[e$1.toLowerCase()]) throw new Error(e$1 + " is not supported by this platform");
|
|
2726
|
-
}, a.MAX_VALUE_16BITS = 65535, a.MAX_VALUE_32BITS = -1, a.pretty = function(e$1) {
|
|
2727
|
-
var t$1, r$1, n$1 = "";
|
|
2728
|
-
for (r$1 = 0; r$1 < (e$1 || "").length; r$1++) n$1 += "\\x" + ((t$1 = e$1.charCodeAt(r$1)) < 16 ? "0" : "") + t$1.toString(16).toUpperCase();
|
|
2729
|
-
return n$1;
|
|
2730
|
-
}, a.delay = function(e$1, t$1, r$1) {
|
|
2731
|
-
setImmediate(function() {
|
|
2732
|
-
e$1.apply(r$1 || null, t$1 || []);
|
|
2733
|
-
});
|
|
2734
|
-
}, a.inherits = function(e$1, t$1) {
|
|
2735
|
-
function r$1() {}
|
|
2736
|
-
r$1.prototype = t$1.prototype, e$1.prototype = new r$1();
|
|
2737
|
-
}, a.extend = function() {
|
|
2738
|
-
var e$1, t$1, r$1 = {};
|
|
2739
|
-
for (e$1 = 0; e$1 < arguments.length; e$1++) for (t$1 in arguments[e$1]) Object.prototype.hasOwnProperty.call(arguments[e$1], t$1) && void 0 === r$1[t$1] && (r$1[t$1] = arguments[e$1][t$1]);
|
|
2740
|
-
return r$1;
|
|
2741
|
-
}, a.prepareContent = function(r$1, e$1, n$1, i$2, s$1) {
|
|
2742
|
-
return u.Promise.resolve(e$1).then(function(n$2) {
|
|
2743
|
-
return o.blob && (n$2 instanceof Blob || -1 !== ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(n$2))) && "undefined" != typeof FileReader ? new u.Promise(function(t$1, r$2) {
|
|
2744
|
-
var e$2 = new FileReader();
|
|
2745
|
-
e$2.onload = function(e$3) {
|
|
2746
|
-
t$1(e$3.target.result);
|
|
2747
|
-
}, e$2.onerror = function(e$3) {
|
|
2748
|
-
r$2(e$3.target.error);
|
|
2749
|
-
}, e$2.readAsArrayBuffer(n$2);
|
|
2750
|
-
}) : n$2;
|
|
2751
|
-
}).then(function(e$2) {
|
|
2752
|
-
var t$1 = a.getTypeOf(e$2);
|
|
2753
|
-
return t$1 ? ("arraybuffer" === t$1 ? e$2 = a.transformTo("uint8array", e$2) : "string" === t$1 && (s$1 ? e$2 = h.decode(e$2) : n$1 && !0 !== i$2 && (e$2 = function(e$3) {
|
|
2754
|
-
return l(e$3, o.uint8array ? new Uint8Array(e$3.length) : new Array(e$3.length));
|
|
2755
|
-
}(e$2))), e$2) : u.Promise.reject(/* @__PURE__ */ new Error("Can't read the data of '" + r$1 + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
|
|
2756
|
-
});
|
|
2757
|
-
};
|
|
2758
|
-
}, {
|
|
2759
|
-
"./base64": 1,
|
|
2760
|
-
"./external": 6,
|
|
2761
|
-
"./nodejsUtils": 14,
|
|
2762
|
-
"./support": 30,
|
|
2763
|
-
setimmediate: 54
|
|
2764
|
-
}],
|
|
2765
|
-
33: [function(e, t, r) {
|
|
2766
|
-
"use strict";
|
|
2767
|
-
var n = e("./reader/readerFor"), i$1 = e("./utils"), s = e("./signature"), a = e("./zipEntry"), o = e("./support");
|
|
2768
|
-
function h(e$1) {
|
|
2769
|
-
this.files = [], this.loadOptions = e$1;
|
|
2770
|
-
}
|
|
2771
|
-
h.prototype = {
|
|
2772
|
-
checkSignature: function(e$1) {
|
|
2773
|
-
if (!this.reader.readAndCheckSignature(e$1)) {
|
|
2774
|
-
this.reader.index -= 4;
|
|
2775
|
-
var t$1 = this.reader.readString(4);
|
|
2776
|
-
throw new Error("Corrupted zip or bug: unexpected signature (" + i$1.pretty(t$1) + ", expected " + i$1.pretty(e$1) + ")");
|
|
2777
|
-
}
|
|
2778
|
-
},
|
|
2779
|
-
isSignature: function(e$1, t$1) {
|
|
2780
|
-
var r$1 = this.reader.index;
|
|
2781
|
-
this.reader.setIndex(e$1);
|
|
2782
|
-
var n$1 = this.reader.readString(4) === t$1;
|
|
2783
|
-
return this.reader.setIndex(r$1), n$1;
|
|
2784
|
-
},
|
|
2785
|
-
readBlockEndOfCentral: function() {
|
|
2786
|
-
this.diskNumber = this.reader.readInt(2), this.diskWithCentralDirStart = this.reader.readInt(2), this.centralDirRecordsOnThisDisk = this.reader.readInt(2), this.centralDirRecords = this.reader.readInt(2), this.centralDirSize = this.reader.readInt(4), this.centralDirOffset = this.reader.readInt(4), this.zipCommentLength = this.reader.readInt(2);
|
|
2787
|
-
var e$1 = this.reader.readData(this.zipCommentLength), t$1 = o.uint8array ? "uint8array" : "array", r$1 = i$1.transformTo(t$1, e$1);
|
|
2788
|
-
this.zipComment = this.loadOptions.decodeFileName(r$1);
|
|
2789
|
-
},
|
|
2790
|
-
readBlockZip64EndOfCentral: function() {
|
|
2791
|
-
this.zip64EndOfCentralSize = this.reader.readInt(8), this.reader.skip(4), this.diskNumber = this.reader.readInt(4), this.diskWithCentralDirStart = this.reader.readInt(4), this.centralDirRecordsOnThisDisk = this.reader.readInt(8), this.centralDirRecords = this.reader.readInt(8), this.centralDirSize = this.reader.readInt(8), this.centralDirOffset = this.reader.readInt(8), this.zip64ExtensibleData = {};
|
|
2792
|
-
for (var e$1, t$1, r$1, n$1 = this.zip64EndOfCentralSize - 44; 0 < n$1;) e$1 = this.reader.readInt(2), t$1 = this.reader.readInt(4), r$1 = this.reader.readData(t$1), this.zip64ExtensibleData[e$1] = {
|
|
2793
|
-
id: e$1,
|
|
2794
|
-
length: t$1,
|
|
2795
|
-
value: r$1
|
|
2796
|
-
};
|
|
2797
|
-
},
|
|
2798
|
-
readBlockZip64EndOfCentralLocator: function() {
|
|
2799
|
-
if (this.diskWithZip64CentralDirStart = this.reader.readInt(4), this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8), this.disksCount = this.reader.readInt(4), 1 < this.disksCount) throw new Error("Multi-volumes zip are not supported");
|
|
2800
|
-
},
|
|
2801
|
-
readLocalFiles: function() {
|
|
2802
|
-
var e$1, t$1;
|
|
2803
|
-
for (e$1 = 0; e$1 < this.files.length; e$1++) t$1 = this.files[e$1], this.reader.setIndex(t$1.localHeaderOffset), this.checkSignature(s.LOCAL_FILE_HEADER), t$1.readLocalPart(this.reader), t$1.handleUTF8(), t$1.processAttributes();
|
|
2804
|
-
},
|
|
2805
|
-
readCentralDir: function() {
|
|
2806
|
-
var e$1;
|
|
2807
|
-
for (this.reader.setIndex(this.centralDirOffset); this.reader.readAndCheckSignature(s.CENTRAL_FILE_HEADER);) (e$1 = new a({ zip64: this.zip64 }, this.loadOptions)).readCentralPart(this.reader), this.files.push(e$1);
|
|
2808
|
-
if (this.centralDirRecords !== this.files.length && 0 !== this.centralDirRecords && 0 === this.files.length) throw new Error("Corrupted zip or bug: expected " + this.centralDirRecords + " records in central dir, got " + this.files.length);
|
|
2809
|
-
},
|
|
2810
|
-
readEndOfCentral: function() {
|
|
2811
|
-
var e$1 = this.reader.lastIndexOfSignature(s.CENTRAL_DIRECTORY_END);
|
|
2812
|
-
if (e$1 < 0) throw !this.isSignature(0, s.LOCAL_FILE_HEADER) ? /* @__PURE__ */ new Error("Can't find end of central directory : is this a zip file ? If it is, see https://stuk.github.io/jszip/documentation/howto/read_zip.html") : /* @__PURE__ */ new Error("Corrupted zip: can't find end of central directory");
|
|
2813
|
-
this.reader.setIndex(e$1);
|
|
2814
|
-
var t$1 = e$1;
|
|
2815
|
-
if (this.checkSignature(s.CENTRAL_DIRECTORY_END), this.readBlockEndOfCentral(), this.diskNumber === i$1.MAX_VALUE_16BITS || this.diskWithCentralDirStart === i$1.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === i$1.MAX_VALUE_16BITS || this.centralDirRecords === i$1.MAX_VALUE_16BITS || this.centralDirSize === i$1.MAX_VALUE_32BITS || this.centralDirOffset === i$1.MAX_VALUE_32BITS) {
|
|
2816
|
-
if (this.zip64 = !0, (e$1 = this.reader.lastIndexOfSignature(s.ZIP64_CENTRAL_DIRECTORY_LOCATOR)) < 0) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator");
|
|
2817
|
-
if (this.reader.setIndex(e$1), this.checkSignature(s.ZIP64_CENTRAL_DIRECTORY_LOCATOR), this.readBlockZip64EndOfCentralLocator(), !this.isSignature(this.relativeOffsetEndOfZip64CentralDir, s.ZIP64_CENTRAL_DIRECTORY_END) && (this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(s.ZIP64_CENTRAL_DIRECTORY_END), this.relativeOffsetEndOfZip64CentralDir < 0)) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory");
|
|
2818
|
-
this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir), this.checkSignature(s.ZIP64_CENTRAL_DIRECTORY_END), this.readBlockZip64EndOfCentral();
|
|
2819
|
-
}
|
|
2820
|
-
var r$1 = this.centralDirOffset + this.centralDirSize;
|
|
2821
|
-
this.zip64 && (r$1 += 20, r$1 += 12 + this.zip64EndOfCentralSize);
|
|
2822
|
-
var n$1 = t$1 - r$1;
|
|
2823
|
-
if (0 < n$1) this.isSignature(t$1, s.CENTRAL_FILE_HEADER) || (this.reader.zero = n$1);
|
|
2824
|
-
else if (n$1 < 0) throw new Error("Corrupted zip: missing " + Math.abs(n$1) + " bytes.");
|
|
2825
|
-
},
|
|
2826
|
-
prepareReader: function(e$1) {
|
|
2827
|
-
this.reader = n(e$1);
|
|
2828
|
-
},
|
|
2829
|
-
load: function(e$1) {
|
|
2830
|
-
this.prepareReader(e$1), this.readEndOfCentral(), this.readCentralDir(), this.readLocalFiles();
|
|
2831
|
-
}
|
|
2832
|
-
}, t.exports = h;
|
|
2833
|
-
}, {
|
|
2834
|
-
"./reader/readerFor": 22,
|
|
2835
|
-
"./signature": 23,
|
|
2836
|
-
"./support": 30,
|
|
2837
|
-
"./utils": 32,
|
|
2838
|
-
"./zipEntry": 34
|
|
2839
|
-
}],
|
|
2840
|
-
34: [function(e, t, r) {
|
|
2841
|
-
"use strict";
|
|
2842
|
-
var n = e("./reader/readerFor"), s = e("./utils"), i$1 = e("./compressedObject"), a = e("./crc32"), o = e("./utf8"), h = e("./compressions"), u = e("./support");
|
|
2843
|
-
function l(e$1, t$1) {
|
|
2844
|
-
this.options = e$1, this.loadOptions = t$1;
|
|
2845
|
-
}
|
|
2846
|
-
l.prototype = {
|
|
2847
|
-
isEncrypted: function() {
|
|
2848
|
-
return 1 == (1 & this.bitFlag);
|
|
2849
|
-
},
|
|
2850
|
-
useUTF8: function() {
|
|
2851
|
-
return 2048 == (2048 & this.bitFlag);
|
|
2852
|
-
},
|
|
2853
|
-
readLocalPart: function(e$1) {
|
|
2854
|
-
var t$1, r$1;
|
|
2855
|
-
if (e$1.skip(22), this.fileNameLength = e$1.readInt(2), r$1 = e$1.readInt(2), this.fileName = e$1.readData(this.fileNameLength), e$1.skip(r$1), -1 === this.compressedSize || -1 === this.uncompressedSize) throw new Error("Bug or corrupted zip : didn't get enough information from the central directory (compressedSize === -1 || uncompressedSize === -1)");
|
|
2856
|
-
if (null === (t$1 = function(e$2) {
|
|
2857
|
-
for (var t$2 in h) if (Object.prototype.hasOwnProperty.call(h, t$2) && h[t$2].magic === e$2) return h[t$2];
|
|
2858
|
-
return null;
|
|
2859
|
-
}(this.compressionMethod))) throw new Error("Corrupted zip : compression " + s.pretty(this.compressionMethod) + " unknown (inner file : " + s.transformTo("string", this.fileName) + ")");
|
|
2860
|
-
this.decompressed = new i$1(this.compressedSize, this.uncompressedSize, this.crc32, t$1, e$1.readData(this.compressedSize));
|
|
2861
|
-
},
|
|
2862
|
-
readCentralPart: function(e$1) {
|
|
2863
|
-
this.versionMadeBy = e$1.readInt(2), e$1.skip(2), this.bitFlag = e$1.readInt(2), this.compressionMethod = e$1.readString(2), this.date = e$1.readDate(), this.crc32 = e$1.readInt(4), this.compressedSize = e$1.readInt(4), this.uncompressedSize = e$1.readInt(4);
|
|
2864
|
-
var t$1 = e$1.readInt(2);
|
|
2865
|
-
if (this.extraFieldsLength = e$1.readInt(2), this.fileCommentLength = e$1.readInt(2), this.diskNumberStart = e$1.readInt(2), this.internalFileAttributes = e$1.readInt(2), this.externalFileAttributes = e$1.readInt(4), this.localHeaderOffset = e$1.readInt(4), this.isEncrypted()) throw new Error("Encrypted zip are not supported");
|
|
2866
|
-
e$1.skip(t$1), this.readExtraFields(e$1), this.parseZIP64ExtraField(e$1), this.fileComment = e$1.readData(this.fileCommentLength);
|
|
2867
|
-
},
|
|
2868
|
-
processAttributes: function() {
|
|
2869
|
-
this.unixPermissions = null, this.dosPermissions = null;
|
|
2870
|
-
var e$1 = this.versionMadeBy >> 8;
|
|
2871
|
-
this.dir = !!(16 & this.externalFileAttributes), 0 == e$1 && (this.dosPermissions = 63 & this.externalFileAttributes), 3 == e$1 && (this.unixPermissions = this.externalFileAttributes >> 16 & 65535), this.dir || "/" !== this.fileNameStr.slice(-1) || (this.dir = !0);
|
|
2872
|
-
},
|
|
2873
|
-
parseZIP64ExtraField: function() {
|
|
2874
|
-
if (this.extraFields[1]) {
|
|
2875
|
-
var e$1 = n(this.extraFields[1].value);
|
|
2876
|
-
this.uncompressedSize === s.MAX_VALUE_32BITS && (this.uncompressedSize = e$1.readInt(8)), this.compressedSize === s.MAX_VALUE_32BITS && (this.compressedSize = e$1.readInt(8)), this.localHeaderOffset === s.MAX_VALUE_32BITS && (this.localHeaderOffset = e$1.readInt(8)), this.diskNumberStart === s.MAX_VALUE_32BITS && (this.diskNumberStart = e$1.readInt(4));
|
|
2877
|
-
}
|
|
2878
|
-
},
|
|
2879
|
-
readExtraFields: function(e$1) {
|
|
2880
|
-
var t$1, r$1, n$1, i$2 = e$1.index + this.extraFieldsLength;
|
|
2881
|
-
for (this.extraFields || (this.extraFields = {}); e$1.index + 4 < i$2;) t$1 = e$1.readInt(2), r$1 = e$1.readInt(2), n$1 = e$1.readData(r$1), this.extraFields[t$1] = {
|
|
2882
|
-
id: t$1,
|
|
2883
|
-
length: r$1,
|
|
2884
|
-
value: n$1
|
|
2885
|
-
};
|
|
2886
|
-
e$1.setIndex(i$2);
|
|
2887
|
-
},
|
|
2888
|
-
handleUTF8: function() {
|
|
2889
|
-
var e$1 = u.uint8array ? "uint8array" : "array";
|
|
2890
|
-
if (this.useUTF8()) this.fileNameStr = o.utf8decode(this.fileName), this.fileCommentStr = o.utf8decode(this.fileComment);
|
|
2891
|
-
else {
|
|
2892
|
-
var t$1 = this.findExtraFieldUnicodePath();
|
|
2893
|
-
if (null !== t$1) this.fileNameStr = t$1;
|
|
2894
|
-
else {
|
|
2895
|
-
var r$1 = s.transformTo(e$1, this.fileName);
|
|
2896
|
-
this.fileNameStr = this.loadOptions.decodeFileName(r$1);
|
|
2897
|
-
}
|
|
2898
|
-
var n$1 = this.findExtraFieldUnicodeComment();
|
|
2899
|
-
if (null !== n$1) this.fileCommentStr = n$1;
|
|
2900
|
-
else {
|
|
2901
|
-
var i$2 = s.transformTo(e$1, this.fileComment);
|
|
2902
|
-
this.fileCommentStr = this.loadOptions.decodeFileName(i$2);
|
|
2903
|
-
}
|
|
2904
|
-
}
|
|
2905
|
-
},
|
|
2906
|
-
findExtraFieldUnicodePath: function() {
|
|
2907
|
-
var e$1 = this.extraFields[28789];
|
|
2908
|
-
if (e$1) {
|
|
2909
|
-
var t$1 = n(e$1.value);
|
|
2910
|
-
return 1 !== t$1.readInt(1) ? null : a(this.fileName) !== t$1.readInt(4) ? null : o.utf8decode(t$1.readData(e$1.length - 5));
|
|
2911
|
-
}
|
|
2912
|
-
return null;
|
|
2913
|
-
},
|
|
2914
|
-
findExtraFieldUnicodeComment: function() {
|
|
2915
|
-
var e$1 = this.extraFields[25461];
|
|
2916
|
-
if (e$1) {
|
|
2917
|
-
var t$1 = n(e$1.value);
|
|
2918
|
-
return 1 !== t$1.readInt(1) ? null : a(this.fileComment) !== t$1.readInt(4) ? null : o.utf8decode(t$1.readData(e$1.length - 5));
|
|
2919
|
-
}
|
|
2920
|
-
return null;
|
|
2921
|
-
}
|
|
2922
|
-
}, t.exports = l;
|
|
2923
|
-
}, {
|
|
2924
|
-
"./compressedObject": 2,
|
|
2925
|
-
"./compressions": 3,
|
|
2926
|
-
"./crc32": 4,
|
|
2927
|
-
"./reader/readerFor": 22,
|
|
2928
|
-
"./support": 30,
|
|
2929
|
-
"./utf8": 31,
|
|
2930
|
-
"./utils": 32
|
|
2931
|
-
}],
|
|
2932
|
-
35: [function(e, t, r) {
|
|
2933
|
-
"use strict";
|
|
2934
|
-
function n(e$1, t$1, r$1) {
|
|
2935
|
-
this.name = e$1, this.dir = r$1.dir, this.date = r$1.date, this.comment = r$1.comment, this.unixPermissions = r$1.unixPermissions, this.dosPermissions = r$1.dosPermissions, this._data = t$1, this._dataBinary = r$1.binary, this.options = {
|
|
2936
|
-
compression: r$1.compression,
|
|
2937
|
-
compressionOptions: r$1.compressionOptions
|
|
2938
|
-
};
|
|
2939
|
-
}
|
|
2940
|
-
var s = e("./stream/StreamHelper"), i$1 = e("./stream/DataWorker"), a = e("./utf8"), o = e("./compressedObject"), h = e("./stream/GenericWorker");
|
|
2941
|
-
n.prototype = {
|
|
2942
|
-
internalStream: function(e$1) {
|
|
2943
|
-
var t$1 = null, r$1 = "string";
|
|
2944
|
-
try {
|
|
2945
|
-
if (!e$1) throw new Error("No output type specified.");
|
|
2946
|
-
var n$1 = "string" === (r$1 = e$1.toLowerCase()) || "text" === r$1;
|
|
2947
|
-
"binarystring" !== r$1 && "text" !== r$1 || (r$1 = "string"), t$1 = this._decompressWorker();
|
|
2948
|
-
var i$2 = !this._dataBinary;
|
|
2949
|
-
i$2 && !n$1 && (t$1 = t$1.pipe(new a.Utf8EncodeWorker())), !i$2 && n$1 && (t$1 = t$1.pipe(new a.Utf8DecodeWorker()));
|
|
2950
|
-
} catch (e$2) {
|
|
2951
|
-
(t$1 = new h("error")).error(e$2);
|
|
2952
|
-
}
|
|
2953
|
-
return new s(t$1, r$1, "");
|
|
2954
|
-
},
|
|
2955
|
-
async: function(e$1, t$1) {
|
|
2956
|
-
return this.internalStream(e$1).accumulate(t$1);
|
|
2957
|
-
},
|
|
2958
|
-
nodeStream: function(e$1, t$1) {
|
|
2959
|
-
return this.internalStream(e$1 || "nodebuffer").toNodejsStream(t$1);
|
|
2960
|
-
},
|
|
2961
|
-
_compressWorker: function(e$1, t$1) {
|
|
2962
|
-
if (this._data instanceof o && this._data.compression.magic === e$1.magic) return this._data.getCompressedWorker();
|
|
2963
|
-
var r$1 = this._decompressWorker();
|
|
2964
|
-
return this._dataBinary || (r$1 = r$1.pipe(new a.Utf8EncodeWorker())), o.createWorkerFrom(r$1, e$1, t$1);
|
|
2965
|
-
},
|
|
2966
|
-
_decompressWorker: function() {
|
|
2967
|
-
return this._data instanceof o ? this._data.getContentWorker() : this._data instanceof h ? this._data : new i$1(this._data);
|
|
2968
|
-
}
|
|
2969
|
-
};
|
|
2970
|
-
for (var u = [
|
|
2971
|
-
"asText",
|
|
2972
|
-
"asBinary",
|
|
2973
|
-
"asNodeBuffer",
|
|
2974
|
-
"asUint8Array",
|
|
2975
|
-
"asArrayBuffer"
|
|
2976
|
-
], l = function() {
|
|
2977
|
-
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
2978
|
-
}, f = 0; f < u.length; f++) n.prototype[u[f]] = l;
|
|
2979
|
-
t.exports = n;
|
|
2980
|
-
}, {
|
|
2981
|
-
"./compressedObject": 2,
|
|
2982
|
-
"./stream/DataWorker": 27,
|
|
2983
|
-
"./stream/GenericWorker": 28,
|
|
2984
|
-
"./stream/StreamHelper": 29,
|
|
2985
|
-
"./utf8": 31
|
|
2986
|
-
}],
|
|
2987
|
-
36: [function(e, l, t) {
|
|
2988
|
-
(function(t$1) {
|
|
2989
|
-
"use strict";
|
|
2990
|
-
var r, n, e$1 = t$1.MutationObserver || t$1.WebKitMutationObserver;
|
|
2991
|
-
if (e$1) {
|
|
2992
|
-
var i$1 = 0, s = new e$1(u), a = t$1.document.createTextNode("");
|
|
2993
|
-
s.observe(a, { characterData: !0 }), r = function() {
|
|
2994
|
-
a.data = i$1 = ++i$1 % 2;
|
|
2995
|
-
};
|
|
2996
|
-
} else if (t$1.setImmediate || void 0 === t$1.MessageChannel) r = "document" in t$1 && "onreadystatechange" in t$1.document.createElement("script") ? function() {
|
|
2997
|
-
var e$2 = t$1.document.createElement("script");
|
|
2998
|
-
e$2.onreadystatechange = function() {
|
|
2999
|
-
u(), e$2.onreadystatechange = null, e$2.parentNode.removeChild(e$2), e$2 = null;
|
|
3000
|
-
}, t$1.document.documentElement.appendChild(e$2);
|
|
3001
|
-
} : function() {
|
|
3002
|
-
setTimeout(u, 0);
|
|
3003
|
-
};
|
|
3004
|
-
else {
|
|
3005
|
-
var o = new t$1.MessageChannel();
|
|
3006
|
-
o.port1.onmessage = u, r = function() {
|
|
3007
|
-
o.port2.postMessage(0);
|
|
3008
|
-
};
|
|
3009
|
-
}
|
|
3010
|
-
var h = [];
|
|
3011
|
-
function u() {
|
|
3012
|
-
var e$2, t$2;
|
|
3013
|
-
n = !0;
|
|
3014
|
-
for (var r$1 = h.length; r$1;) {
|
|
3015
|
-
for (t$2 = h, h = [], e$2 = -1; ++e$2 < r$1;) t$2[e$2]();
|
|
3016
|
-
r$1 = h.length;
|
|
3017
|
-
}
|
|
3018
|
-
n = !1;
|
|
3019
|
-
}
|
|
3020
|
-
l.exports = function(e$2) {
|
|
3021
|
-
1 !== h.push(e$2) || n || r();
|
|
3022
|
-
};
|
|
3023
|
-
}).call(this, "undefined" != typeof global ? global : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {});
|
|
3024
|
-
}, {}],
|
|
3025
|
-
37: [function(e, t, r) {
|
|
3026
|
-
"use strict";
|
|
3027
|
-
var i$1 = e("immediate");
|
|
3028
|
-
function u() {}
|
|
3029
|
-
var l = {}, s = ["REJECTED"], a = ["FULFILLED"], n = ["PENDING"];
|
|
3030
|
-
function o(e$1) {
|
|
3031
|
-
if ("function" != typeof e$1) throw new TypeError("resolver must be a function");
|
|
3032
|
-
this.state = n, this.queue = [], this.outcome = void 0, e$1 !== u && d(this, e$1);
|
|
3033
|
-
}
|
|
3034
|
-
function h(e$1, t$1, r$1) {
|
|
3035
|
-
this.promise = e$1, "function" == typeof t$1 && (this.onFulfilled = t$1, this.callFulfilled = this.otherCallFulfilled), "function" == typeof r$1 && (this.onRejected = r$1, this.callRejected = this.otherCallRejected);
|
|
3036
|
-
}
|
|
3037
|
-
function f(t$1, r$1, n$1) {
|
|
3038
|
-
i$1(function() {
|
|
3039
|
-
var e$1;
|
|
3040
|
-
try {
|
|
3041
|
-
e$1 = r$1(n$1);
|
|
3042
|
-
} catch (e$2) {
|
|
3043
|
-
return l.reject(t$1, e$2);
|
|
3044
|
-
}
|
|
3045
|
-
e$1 === t$1 ? l.reject(t$1, /* @__PURE__ */ new TypeError("Cannot resolve promise with itself")) : l.resolve(t$1, e$1);
|
|
3046
|
-
});
|
|
3047
|
-
}
|
|
3048
|
-
function c(e$1) {
|
|
3049
|
-
var t$1 = e$1 && e$1.then;
|
|
3050
|
-
if (e$1 && ("object" == typeof e$1 || "function" == typeof e$1) && "function" == typeof t$1) return function() {
|
|
3051
|
-
t$1.apply(e$1, arguments);
|
|
3052
|
-
};
|
|
3053
|
-
}
|
|
3054
|
-
function d(t$1, e$1) {
|
|
3055
|
-
var r$1 = !1;
|
|
3056
|
-
function n$1(e$2) {
|
|
3057
|
-
r$1 || (r$1 = !0, l.reject(t$1, e$2));
|
|
3058
|
-
}
|
|
3059
|
-
function i$2(e$2) {
|
|
3060
|
-
r$1 || (r$1 = !0, l.resolve(t$1, e$2));
|
|
3061
|
-
}
|
|
3062
|
-
var s$1 = p(function() {
|
|
3063
|
-
e$1(i$2, n$1);
|
|
3064
|
-
});
|
|
3065
|
-
"error" === s$1.status && n$1(s$1.value);
|
|
3066
|
-
}
|
|
3067
|
-
function p(e$1, t$1) {
|
|
3068
|
-
var r$1 = {};
|
|
3069
|
-
try {
|
|
3070
|
-
r$1.value = e$1(t$1), r$1.status = "success";
|
|
3071
|
-
} catch (e$2) {
|
|
3072
|
-
r$1.status = "error", r$1.value = e$2;
|
|
3073
|
-
}
|
|
3074
|
-
return r$1;
|
|
3075
|
-
}
|
|
3076
|
-
(t.exports = o).prototype.finally = function(t$1) {
|
|
3077
|
-
if ("function" != typeof t$1) return this;
|
|
3078
|
-
var r$1 = this.constructor;
|
|
3079
|
-
return this.then(function(e$1) {
|
|
3080
|
-
return r$1.resolve(t$1()).then(function() {
|
|
3081
|
-
return e$1;
|
|
3082
|
-
});
|
|
3083
|
-
}, function(e$1) {
|
|
3084
|
-
return r$1.resolve(t$1()).then(function() {
|
|
3085
|
-
throw e$1;
|
|
3086
|
-
});
|
|
3087
|
-
});
|
|
3088
|
-
}, o.prototype.catch = function(e$1) {
|
|
3089
|
-
return this.then(null, e$1);
|
|
3090
|
-
}, o.prototype.then = function(e$1, t$1) {
|
|
3091
|
-
if ("function" != typeof e$1 && this.state === a || "function" != typeof t$1 && this.state === s) return this;
|
|
3092
|
-
var r$1 = new this.constructor(u);
|
|
3093
|
-
this.state !== n ? f(r$1, this.state === a ? e$1 : t$1, this.outcome) : this.queue.push(new h(r$1, e$1, t$1));
|
|
3094
|
-
return r$1;
|
|
3095
|
-
}, h.prototype.callFulfilled = function(e$1) {
|
|
3096
|
-
l.resolve(this.promise, e$1);
|
|
3097
|
-
}, h.prototype.otherCallFulfilled = function(e$1) {
|
|
3098
|
-
f(this.promise, this.onFulfilled, e$1);
|
|
3099
|
-
}, h.prototype.callRejected = function(e$1) {
|
|
3100
|
-
l.reject(this.promise, e$1);
|
|
3101
|
-
}, h.prototype.otherCallRejected = function(e$1) {
|
|
3102
|
-
f(this.promise, this.onRejected, e$1);
|
|
3103
|
-
}, l.resolve = function(e$1, t$1) {
|
|
3104
|
-
var r$1 = p(c, t$1);
|
|
3105
|
-
if ("error" === r$1.status) return l.reject(e$1, r$1.value);
|
|
3106
|
-
var n$1 = r$1.value;
|
|
3107
|
-
if (n$1) d(e$1, n$1);
|
|
3108
|
-
else {
|
|
3109
|
-
e$1.state = a, e$1.outcome = t$1;
|
|
3110
|
-
for (var i$2 = -1, s$1 = e$1.queue.length; ++i$2 < s$1;) e$1.queue[i$2].callFulfilled(t$1);
|
|
3111
|
-
}
|
|
3112
|
-
return e$1;
|
|
3113
|
-
}, l.reject = function(e$1, t$1) {
|
|
3114
|
-
e$1.state = s, e$1.outcome = t$1;
|
|
3115
|
-
for (var r$1 = -1, n$1 = e$1.queue.length; ++r$1 < n$1;) e$1.queue[r$1].callRejected(t$1);
|
|
3116
|
-
return e$1;
|
|
3117
|
-
}, o.resolve = function(e$1) {
|
|
3118
|
-
if (e$1 instanceof this) return e$1;
|
|
3119
|
-
return l.resolve(new this(u), e$1);
|
|
3120
|
-
}, o.reject = function(e$1) {
|
|
3121
|
-
var t$1 = new this(u);
|
|
3122
|
-
return l.reject(t$1, e$1);
|
|
3123
|
-
}, o.all = function(e$1) {
|
|
3124
|
-
var r$1 = this;
|
|
3125
|
-
if ("[object Array]" !== Object.prototype.toString.call(e$1)) return this.reject(/* @__PURE__ */ new TypeError("must be an array"));
|
|
3126
|
-
var n$1 = e$1.length, i$2 = !1;
|
|
3127
|
-
if (!n$1) return this.resolve([]);
|
|
3128
|
-
var s$1 = new Array(n$1), a$1 = 0, t$1 = -1, o$1 = new this(u);
|
|
3129
|
-
for (; ++t$1 < n$1;) h$1(e$1[t$1], t$1);
|
|
3130
|
-
return o$1;
|
|
3131
|
-
function h$1(e$2, t$2) {
|
|
3132
|
-
r$1.resolve(e$2).then(function(e$3) {
|
|
3133
|
-
s$1[t$2] = e$3, ++a$1 !== n$1 || i$2 || (i$2 = !0, l.resolve(o$1, s$1));
|
|
3134
|
-
}, function(e$3) {
|
|
3135
|
-
i$2 || (i$2 = !0, l.reject(o$1, e$3));
|
|
3136
|
-
});
|
|
3137
|
-
}
|
|
3138
|
-
}, o.race = function(e$1) {
|
|
3139
|
-
var t$1 = this;
|
|
3140
|
-
if ("[object Array]" !== Object.prototype.toString.call(e$1)) return this.reject(/* @__PURE__ */ new TypeError("must be an array"));
|
|
3141
|
-
var r$1 = e$1.length, n$1 = !1;
|
|
3142
|
-
if (!r$1) return this.resolve([]);
|
|
3143
|
-
var i$2 = -1, s$1 = new this(u);
|
|
3144
|
-
for (; ++i$2 < r$1;) a$1 = e$1[i$2], t$1.resolve(a$1).then(function(e$2) {
|
|
3145
|
-
n$1 || (n$1 = !0, l.resolve(s$1, e$2));
|
|
3146
|
-
}, function(e$2) {
|
|
3147
|
-
n$1 || (n$1 = !0, l.reject(s$1, e$2));
|
|
3148
|
-
});
|
|
3149
|
-
var a$1;
|
|
3150
|
-
return s$1;
|
|
3151
|
-
};
|
|
3152
|
-
}, { immediate: 36 }],
|
|
3153
|
-
38: [function(e, t, r) {
|
|
3154
|
-
"use strict";
|
|
3155
|
-
var n = {};
|
|
3156
|
-
(0, e("./lib/utils/common").assign)(n, e("./lib/deflate"), e("./lib/inflate"), e("./lib/zlib/constants")), t.exports = n;
|
|
3157
|
-
}, {
|
|
3158
|
-
"./lib/deflate": 39,
|
|
3159
|
-
"./lib/inflate": 40,
|
|
3160
|
-
"./lib/utils/common": 41,
|
|
3161
|
-
"./lib/zlib/constants": 44
|
|
3162
|
-
}],
|
|
3163
|
-
39: [function(e, t, r) {
|
|
3164
|
-
"use strict";
|
|
3165
|
-
var a = e("./zlib/deflate"), o = e("./utils/common"), h = e("./utils/strings"), i$1 = e("./zlib/messages"), s = e("./zlib/zstream"), u = Object.prototype.toString, l = 0, f = -1, c = 0, d = 8;
|
|
3166
|
-
function p(e$1) {
|
|
3167
|
-
if (!(this instanceof p)) return new p(e$1);
|
|
3168
|
-
this.options = o.assign({
|
|
3169
|
-
level: f,
|
|
3170
|
-
method: d,
|
|
3171
|
-
chunkSize: 16384,
|
|
3172
|
-
windowBits: 15,
|
|
3173
|
-
memLevel: 8,
|
|
3174
|
-
strategy: c,
|
|
3175
|
-
to: ""
|
|
3176
|
-
}, e$1 || {});
|
|
3177
|
-
var t$1 = this.options;
|
|
3178
|
-
t$1.raw && 0 < t$1.windowBits ? t$1.windowBits = -t$1.windowBits : t$1.gzip && 0 < t$1.windowBits && t$1.windowBits < 16 && (t$1.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new s(), this.strm.avail_out = 0;
|
|
3179
|
-
var r$1 = a.deflateInit2(this.strm, t$1.level, t$1.method, t$1.windowBits, t$1.memLevel, t$1.strategy);
|
|
3180
|
-
if (r$1 !== l) throw new Error(i$1[r$1]);
|
|
3181
|
-
if (t$1.header && a.deflateSetHeader(this.strm, t$1.header), t$1.dictionary) {
|
|
3182
|
-
var n$1;
|
|
3183
|
-
if (n$1 = "string" == typeof t$1.dictionary ? h.string2buf(t$1.dictionary) : "[object ArrayBuffer]" === u.call(t$1.dictionary) ? new Uint8Array(t$1.dictionary) : t$1.dictionary, (r$1 = a.deflateSetDictionary(this.strm, n$1)) !== l) throw new Error(i$1[r$1]);
|
|
3184
|
-
this._dict_set = !0;
|
|
3185
|
-
}
|
|
3186
|
-
}
|
|
3187
|
-
function n(e$1, t$1) {
|
|
3188
|
-
var r$1 = new p(t$1);
|
|
3189
|
-
if (r$1.push(e$1, !0), r$1.err) throw r$1.msg || i$1[r$1.err];
|
|
3190
|
-
return r$1.result;
|
|
3191
|
-
}
|
|
3192
|
-
p.prototype.push = function(e$1, t$1) {
|
|
3193
|
-
var r$1, n$1, i$2 = this.strm, s$1 = this.options.chunkSize;
|
|
3194
|
-
if (this.ended) return !1;
|
|
3195
|
-
n$1 = t$1 === ~~t$1 ? t$1 : !0 === t$1 ? 4 : 0, "string" == typeof e$1 ? i$2.input = h.string2buf(e$1) : "[object ArrayBuffer]" === u.call(e$1) ? i$2.input = new Uint8Array(e$1) : i$2.input = e$1, i$2.next_in = 0, i$2.avail_in = i$2.input.length;
|
|
3196
|
-
do {
|
|
3197
|
-
if (0 === i$2.avail_out && (i$2.output = new o.Buf8(s$1), i$2.next_out = 0, i$2.avail_out = s$1), 1 !== (r$1 = a.deflate(i$2, n$1)) && r$1 !== l) return this.onEnd(r$1), !(this.ended = !0);
|
|
3198
|
-
0 !== i$2.avail_out && (0 !== i$2.avail_in || 4 !== n$1 && 2 !== n$1) || ("string" === this.options.to ? this.onData(h.buf2binstring(o.shrinkBuf(i$2.output, i$2.next_out))) : this.onData(o.shrinkBuf(i$2.output, i$2.next_out)));
|
|
3199
|
-
} while ((0 < i$2.avail_in || 0 === i$2.avail_out) && 1 !== r$1);
|
|
3200
|
-
return 4 === n$1 ? (r$1 = a.deflateEnd(this.strm), this.onEnd(r$1), this.ended = !0, r$1 === l) : 2 !== n$1 || (this.onEnd(l), !(i$2.avail_out = 0));
|
|
3201
|
-
}, p.prototype.onData = function(e$1) {
|
|
3202
|
-
this.chunks.push(e$1);
|
|
3203
|
-
}, p.prototype.onEnd = function(e$1) {
|
|
3204
|
-
e$1 === l && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = o.flattenChunks(this.chunks)), this.chunks = [], this.err = e$1, this.msg = this.strm.msg;
|
|
3205
|
-
}, r.Deflate = p, r.deflate = n, r.deflateRaw = function(e$1, t$1) {
|
|
3206
|
-
return (t$1 = t$1 || {}).raw = !0, n(e$1, t$1);
|
|
3207
|
-
}, r.gzip = function(e$1, t$1) {
|
|
3208
|
-
return (t$1 = t$1 || {}).gzip = !0, n(e$1, t$1);
|
|
3209
|
-
};
|
|
3210
|
-
}, {
|
|
3211
|
-
"./utils/common": 41,
|
|
3212
|
-
"./utils/strings": 42,
|
|
3213
|
-
"./zlib/deflate": 46,
|
|
3214
|
-
"./zlib/messages": 51,
|
|
3215
|
-
"./zlib/zstream": 53
|
|
3216
|
-
}],
|
|
3217
|
-
40: [function(e, t, r) {
|
|
3218
|
-
"use strict";
|
|
3219
|
-
var c = e("./zlib/inflate"), d = e("./utils/common"), p = e("./utils/strings"), m = e("./zlib/constants"), n = e("./zlib/messages"), i$1 = e("./zlib/zstream"), s = e("./zlib/gzheader"), _ = Object.prototype.toString;
|
|
3220
|
-
function a(e$1) {
|
|
3221
|
-
if (!(this instanceof a)) return new a(e$1);
|
|
3222
|
-
this.options = d.assign({
|
|
3223
|
-
chunkSize: 16384,
|
|
3224
|
-
windowBits: 0,
|
|
3225
|
-
to: ""
|
|
3226
|
-
}, e$1 || {});
|
|
3227
|
-
var t$1 = this.options;
|
|
3228
|
-
t$1.raw && 0 <= t$1.windowBits && t$1.windowBits < 16 && (t$1.windowBits = -t$1.windowBits, 0 === t$1.windowBits && (t$1.windowBits = -15)), !(0 <= t$1.windowBits && t$1.windowBits < 16) || e$1 && e$1.windowBits || (t$1.windowBits += 32), 15 < t$1.windowBits && t$1.windowBits < 48 && 0 == (15 & t$1.windowBits) && (t$1.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new i$1(), this.strm.avail_out = 0;
|
|
3229
|
-
var r$1 = c.inflateInit2(this.strm, t$1.windowBits);
|
|
3230
|
-
if (r$1 !== m.Z_OK) throw new Error(n[r$1]);
|
|
3231
|
-
this.header = new s(), c.inflateGetHeader(this.strm, this.header);
|
|
3232
|
-
}
|
|
3233
|
-
function o(e$1, t$1) {
|
|
3234
|
-
var r$1 = new a(t$1);
|
|
3235
|
-
if (r$1.push(e$1, !0), r$1.err) throw r$1.msg || n[r$1.err];
|
|
3236
|
-
return r$1.result;
|
|
3237
|
-
}
|
|
3238
|
-
a.prototype.push = function(e$1, t$1) {
|
|
3239
|
-
var r$1, n$1, i$2, s$1, a$1, o$1, h = this.strm, u = this.options.chunkSize, l = this.options.dictionary, f = !1;
|
|
3240
|
-
if (this.ended) return !1;
|
|
3241
|
-
n$1 = t$1 === ~~t$1 ? t$1 : !0 === t$1 ? m.Z_FINISH : m.Z_NO_FLUSH, "string" == typeof e$1 ? h.input = p.binstring2buf(e$1) : "[object ArrayBuffer]" === _.call(e$1) ? h.input = new Uint8Array(e$1) : h.input = e$1, h.next_in = 0, h.avail_in = h.input.length;
|
|
3242
|
-
do {
|
|
3243
|
-
if (0 === h.avail_out && (h.output = new d.Buf8(u), h.next_out = 0, h.avail_out = u), (r$1 = c.inflate(h, m.Z_NO_FLUSH)) === m.Z_NEED_DICT && l && (o$1 = "string" == typeof l ? p.string2buf(l) : "[object ArrayBuffer]" === _.call(l) ? new Uint8Array(l) : l, r$1 = c.inflateSetDictionary(this.strm, o$1)), r$1 === m.Z_BUF_ERROR && !0 === f && (r$1 = m.Z_OK, f = !1), r$1 !== m.Z_STREAM_END && r$1 !== m.Z_OK) return this.onEnd(r$1), !(this.ended = !0);
|
|
3244
|
-
h.next_out && (0 !== h.avail_out && r$1 !== m.Z_STREAM_END && (0 !== h.avail_in || n$1 !== m.Z_FINISH && n$1 !== m.Z_SYNC_FLUSH) || ("string" === this.options.to ? (i$2 = p.utf8border(h.output, h.next_out), s$1 = h.next_out - i$2, a$1 = p.buf2string(h.output, i$2), h.next_out = s$1, h.avail_out = u - s$1, s$1 && d.arraySet(h.output, h.output, i$2, s$1, 0), this.onData(a$1)) : this.onData(d.shrinkBuf(h.output, h.next_out)))), 0 === h.avail_in && 0 === h.avail_out && (f = !0);
|
|
3245
|
-
} while ((0 < h.avail_in || 0 === h.avail_out) && r$1 !== m.Z_STREAM_END);
|
|
3246
|
-
return r$1 === m.Z_STREAM_END && (n$1 = m.Z_FINISH), n$1 === m.Z_FINISH ? (r$1 = c.inflateEnd(this.strm), this.onEnd(r$1), this.ended = !0, r$1 === m.Z_OK) : n$1 !== m.Z_SYNC_FLUSH || (this.onEnd(m.Z_OK), !(h.avail_out = 0));
|
|
3247
|
-
}, a.prototype.onData = function(e$1) {
|
|
3248
|
-
this.chunks.push(e$1);
|
|
3249
|
-
}, a.prototype.onEnd = function(e$1) {
|
|
3250
|
-
e$1 === m.Z_OK && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = d.flattenChunks(this.chunks)), this.chunks = [], this.err = e$1, this.msg = this.strm.msg;
|
|
3251
|
-
}, r.Inflate = a, r.inflate = o, r.inflateRaw = function(e$1, t$1) {
|
|
3252
|
-
return (t$1 = t$1 || {}).raw = !0, o(e$1, t$1);
|
|
3253
|
-
}, r.ungzip = o;
|
|
3254
|
-
}, {
|
|
3255
|
-
"./utils/common": 41,
|
|
3256
|
-
"./utils/strings": 42,
|
|
3257
|
-
"./zlib/constants": 44,
|
|
3258
|
-
"./zlib/gzheader": 47,
|
|
3259
|
-
"./zlib/inflate": 49,
|
|
3260
|
-
"./zlib/messages": 51,
|
|
3261
|
-
"./zlib/zstream": 53
|
|
3262
|
-
}],
|
|
3263
|
-
41: [function(e, t, r) {
|
|
3264
|
-
"use strict";
|
|
3265
|
-
var n = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Int32Array;
|
|
3266
|
-
r.assign = function(e$1) {
|
|
3267
|
-
for (var t$1 = Array.prototype.slice.call(arguments, 1); t$1.length;) {
|
|
3268
|
-
var r$1 = t$1.shift();
|
|
3269
|
-
if (r$1) {
|
|
3270
|
-
if ("object" != typeof r$1) throw new TypeError(r$1 + "must be non-object");
|
|
3271
|
-
for (var n$1 in r$1) r$1.hasOwnProperty(n$1) && (e$1[n$1] = r$1[n$1]);
|
|
3272
|
-
}
|
|
3273
|
-
}
|
|
3274
|
-
return e$1;
|
|
3275
|
-
}, r.shrinkBuf = function(e$1, t$1) {
|
|
3276
|
-
return e$1.length === t$1 ? e$1 : e$1.subarray ? e$1.subarray(0, t$1) : (e$1.length = t$1, e$1);
|
|
3277
|
-
};
|
|
3278
|
-
var i$1 = {
|
|
3279
|
-
arraySet: function(e$1, t$1, r$1, n$1, i$2) {
|
|
3280
|
-
if (t$1.subarray && e$1.subarray) e$1.set(t$1.subarray(r$1, r$1 + n$1), i$2);
|
|
3281
|
-
else for (var s$1 = 0; s$1 < n$1; s$1++) e$1[i$2 + s$1] = t$1[r$1 + s$1];
|
|
3282
|
-
},
|
|
3283
|
-
flattenChunks: function(e$1) {
|
|
3284
|
-
var t$1, r$1, n$1, i$2, s$1, a;
|
|
3285
|
-
for (t$1 = n$1 = 0, r$1 = e$1.length; t$1 < r$1; t$1++) n$1 += e$1[t$1].length;
|
|
3286
|
-
for (a = new Uint8Array(n$1), t$1 = i$2 = 0, r$1 = e$1.length; t$1 < r$1; t$1++) s$1 = e$1[t$1], a.set(s$1, i$2), i$2 += s$1.length;
|
|
3287
|
-
return a;
|
|
3288
|
-
}
|
|
3289
|
-
}, s = {
|
|
3290
|
-
arraySet: function(e$1, t$1, r$1, n$1, i$2) {
|
|
3291
|
-
for (var s$1 = 0; s$1 < n$1; s$1++) e$1[i$2 + s$1] = t$1[r$1 + s$1];
|
|
3292
|
-
},
|
|
3293
|
-
flattenChunks: function(e$1) {
|
|
3294
|
-
return [].concat.apply([], e$1);
|
|
3295
|
-
}
|
|
3296
|
-
};
|
|
3297
|
-
r.setTyped = function(e$1) {
|
|
3298
|
-
e$1 ? (r.Buf8 = Uint8Array, r.Buf16 = Uint16Array, r.Buf32 = Int32Array, r.assign(r, i$1)) : (r.Buf8 = Array, r.Buf16 = Array, r.Buf32 = Array, r.assign(r, s));
|
|
3299
|
-
}, r.setTyped(n);
|
|
3300
|
-
}, {}],
|
|
3301
|
-
42: [function(e, t, r) {
|
|
3302
|
-
"use strict";
|
|
3303
|
-
var h = e("./common"), i$1 = !0, s = !0;
|
|
3304
|
-
try {
|
|
3305
|
-
String.fromCharCode.apply(null, [0]);
|
|
3306
|
-
} catch (e$1) {
|
|
3307
|
-
i$1 = !1;
|
|
3308
|
-
}
|
|
3309
|
-
try {
|
|
3310
|
-
String.fromCharCode.apply(null, new Uint8Array(1));
|
|
3311
|
-
} catch (e$1) {
|
|
3312
|
-
s = !1;
|
|
3313
|
-
}
|
|
3314
|
-
for (var u = new h.Buf8(256), n = 0; n < 256; n++) u[n] = 252 <= n ? 6 : 248 <= n ? 5 : 240 <= n ? 4 : 224 <= n ? 3 : 192 <= n ? 2 : 1;
|
|
3315
|
-
function l(e$1, t$1) {
|
|
3316
|
-
if (t$1 < 65537 && (e$1.subarray && s || !e$1.subarray && i$1)) return String.fromCharCode.apply(null, h.shrinkBuf(e$1, t$1));
|
|
3317
|
-
for (var r$1 = "", n$1 = 0; n$1 < t$1; n$1++) r$1 += String.fromCharCode(e$1[n$1]);
|
|
3318
|
-
return r$1;
|
|
3319
|
-
}
|
|
3320
|
-
u[254] = u[254] = 1, r.string2buf = function(e$1) {
|
|
3321
|
-
var t$1, r$1, n$1, i$2, s$1, a = e$1.length, o = 0;
|
|
3322
|
-
for (i$2 = 0; i$2 < a; i$2++) 55296 == (64512 & (r$1 = e$1.charCodeAt(i$2))) && i$2 + 1 < a && 56320 == (64512 & (n$1 = e$1.charCodeAt(i$2 + 1))) && (r$1 = 65536 + (r$1 - 55296 << 10) + (n$1 - 56320), i$2++), o += r$1 < 128 ? 1 : r$1 < 2048 ? 2 : r$1 < 65536 ? 3 : 4;
|
|
3323
|
-
for (t$1 = new h.Buf8(o), i$2 = s$1 = 0; s$1 < o; i$2++) 55296 == (64512 & (r$1 = e$1.charCodeAt(i$2))) && i$2 + 1 < a && 56320 == (64512 & (n$1 = e$1.charCodeAt(i$2 + 1))) && (r$1 = 65536 + (r$1 - 55296 << 10) + (n$1 - 56320), i$2++), r$1 < 128 ? t$1[s$1++] = r$1 : (r$1 < 2048 ? t$1[s$1++] = 192 | r$1 >>> 6 : (r$1 < 65536 ? t$1[s$1++] = 224 | r$1 >>> 12 : (t$1[s$1++] = 240 | r$1 >>> 18, t$1[s$1++] = 128 | r$1 >>> 12 & 63), t$1[s$1++] = 128 | r$1 >>> 6 & 63), t$1[s$1++] = 128 | 63 & r$1);
|
|
3324
|
-
return t$1;
|
|
3325
|
-
}, r.buf2binstring = function(e$1) {
|
|
3326
|
-
return l(e$1, e$1.length);
|
|
3327
|
-
}, r.binstring2buf = function(e$1) {
|
|
3328
|
-
for (var t$1 = new h.Buf8(e$1.length), r$1 = 0, n$1 = t$1.length; r$1 < n$1; r$1++) t$1[r$1] = e$1.charCodeAt(r$1);
|
|
3329
|
-
return t$1;
|
|
3330
|
-
}, r.buf2string = function(e$1, t$1) {
|
|
3331
|
-
var r$1, n$1, i$2, s$1, a = t$1 || e$1.length, o = new Array(2 * a);
|
|
3332
|
-
for (r$1 = n$1 = 0; r$1 < a;) if ((i$2 = e$1[r$1++]) < 128) o[n$1++] = i$2;
|
|
3333
|
-
else if (4 < (s$1 = u[i$2])) o[n$1++] = 65533, r$1 += s$1 - 1;
|
|
3334
|
-
else {
|
|
3335
|
-
for (i$2 &= 2 === s$1 ? 31 : 3 === s$1 ? 15 : 7; 1 < s$1 && r$1 < a;) i$2 = i$2 << 6 | 63 & e$1[r$1++], s$1--;
|
|
3336
|
-
1 < s$1 ? o[n$1++] = 65533 : i$2 < 65536 ? o[n$1++] = i$2 : (i$2 -= 65536, o[n$1++] = 55296 | i$2 >> 10 & 1023, o[n$1++] = 56320 | 1023 & i$2);
|
|
3337
|
-
}
|
|
3338
|
-
return l(o, n$1);
|
|
3339
|
-
}, r.utf8border = function(e$1, t$1) {
|
|
3340
|
-
var r$1;
|
|
3341
|
-
for ((t$1 = t$1 || e$1.length) > e$1.length && (t$1 = e$1.length), r$1 = t$1 - 1; 0 <= r$1 && 128 == (192 & e$1[r$1]);) r$1--;
|
|
3342
|
-
return r$1 < 0 ? t$1 : 0 === r$1 ? t$1 : r$1 + u[e$1[r$1]] > t$1 ? r$1 : t$1;
|
|
3343
|
-
};
|
|
3344
|
-
}, { "./common": 41 }],
|
|
3345
|
-
43: [function(e, t, r) {
|
|
3346
|
-
"use strict";
|
|
3347
|
-
t.exports = function(e$1, t$1, r$1, n) {
|
|
3348
|
-
for (var i$1 = 65535 & e$1 | 0, s = e$1 >>> 16 & 65535 | 0, a = 0; 0 !== r$1;) {
|
|
3349
|
-
for (r$1 -= a = 2e3 < r$1 ? 2e3 : r$1; s = s + (i$1 = i$1 + t$1[n++] | 0) | 0, --a;);
|
|
3350
|
-
i$1 %= 65521, s %= 65521;
|
|
3351
|
-
}
|
|
3352
|
-
return i$1 | s << 16 | 0;
|
|
3353
|
-
};
|
|
3354
|
-
}, {}],
|
|
3355
|
-
44: [function(e, t, r) {
|
|
3356
|
-
"use strict";
|
|
3357
|
-
t.exports = {
|
|
3358
|
-
Z_NO_FLUSH: 0,
|
|
3359
|
-
Z_PARTIAL_FLUSH: 1,
|
|
3360
|
-
Z_SYNC_FLUSH: 2,
|
|
3361
|
-
Z_FULL_FLUSH: 3,
|
|
3362
|
-
Z_FINISH: 4,
|
|
3363
|
-
Z_BLOCK: 5,
|
|
3364
|
-
Z_TREES: 6,
|
|
3365
|
-
Z_OK: 0,
|
|
3366
|
-
Z_STREAM_END: 1,
|
|
3367
|
-
Z_NEED_DICT: 2,
|
|
3368
|
-
Z_ERRNO: -1,
|
|
3369
|
-
Z_STREAM_ERROR: -2,
|
|
3370
|
-
Z_DATA_ERROR: -3,
|
|
3371
|
-
Z_BUF_ERROR: -5,
|
|
3372
|
-
Z_NO_COMPRESSION: 0,
|
|
3373
|
-
Z_BEST_SPEED: 1,
|
|
3374
|
-
Z_BEST_COMPRESSION: 9,
|
|
3375
|
-
Z_DEFAULT_COMPRESSION: -1,
|
|
3376
|
-
Z_FILTERED: 1,
|
|
3377
|
-
Z_HUFFMAN_ONLY: 2,
|
|
3378
|
-
Z_RLE: 3,
|
|
3379
|
-
Z_FIXED: 4,
|
|
3380
|
-
Z_DEFAULT_STRATEGY: 0,
|
|
3381
|
-
Z_BINARY: 0,
|
|
3382
|
-
Z_TEXT: 1,
|
|
3383
|
-
Z_UNKNOWN: 2,
|
|
3384
|
-
Z_DEFLATED: 8
|
|
3385
|
-
};
|
|
3386
|
-
}, {}],
|
|
3387
|
-
45: [function(e, t, r) {
|
|
3388
|
-
"use strict";
|
|
3389
|
-
var o = function() {
|
|
3390
|
-
for (var e$1, t$1 = [], r$1 = 0; r$1 < 256; r$1++) {
|
|
3391
|
-
e$1 = r$1;
|
|
3392
|
-
for (var n = 0; n < 8; n++) e$1 = 1 & e$1 ? 3988292384 ^ e$1 >>> 1 : e$1 >>> 1;
|
|
3393
|
-
t$1[r$1] = e$1;
|
|
3394
|
-
}
|
|
3395
|
-
return t$1;
|
|
3396
|
-
}();
|
|
3397
|
-
t.exports = function(e$1, t$1, r$1, n) {
|
|
3398
|
-
var i$1 = o, s = n + r$1;
|
|
3399
|
-
e$1 ^= -1;
|
|
3400
|
-
for (var a = n; a < s; a++) e$1 = e$1 >>> 8 ^ i$1[255 & (e$1 ^ t$1[a])];
|
|
3401
|
-
return -1 ^ e$1;
|
|
3402
|
-
};
|
|
3403
|
-
}, {}],
|
|
3404
|
-
46: [function(e, t, r) {
|
|
3405
|
-
"use strict";
|
|
3406
|
-
var h, c = e("../utils/common"), u = e("./trees"), d = e("./adler32"), p = e("./crc32"), n = e("./messages"), l = 0, f = 4, m = 0, _ = -2, g = -1, b = 4, i$1 = 2, v = 8, y = 9, s = 286, a = 30, o = 19, w = 2 * s + 1, k = 15, x = 3, S = 258, z = S + x + 1, C = 42, E = 113, A = 1, I = 2, O = 3, B = 4;
|
|
3407
|
-
function R(e$1, t$1) {
|
|
3408
|
-
return e$1.msg = n[t$1], t$1;
|
|
3409
|
-
}
|
|
3410
|
-
function T(e$1) {
|
|
3411
|
-
return (e$1 << 1) - (4 < e$1 ? 9 : 0);
|
|
3412
|
-
}
|
|
3413
|
-
function D(e$1) {
|
|
3414
|
-
for (var t$1 = e$1.length; 0 <= --t$1;) e$1[t$1] = 0;
|
|
3415
|
-
}
|
|
3416
|
-
function F(e$1) {
|
|
3417
|
-
var t$1 = e$1.state, r$1 = t$1.pending;
|
|
3418
|
-
r$1 > e$1.avail_out && (r$1 = e$1.avail_out), 0 !== r$1 && (c.arraySet(e$1.output, t$1.pending_buf, t$1.pending_out, r$1, e$1.next_out), e$1.next_out += r$1, t$1.pending_out += r$1, e$1.total_out += r$1, e$1.avail_out -= r$1, t$1.pending -= r$1, 0 === t$1.pending && (t$1.pending_out = 0));
|
|
3419
|
-
}
|
|
3420
|
-
function N(e$1, t$1) {
|
|
3421
|
-
u._tr_flush_block(e$1, 0 <= e$1.block_start ? e$1.block_start : -1, e$1.strstart - e$1.block_start, t$1), e$1.block_start = e$1.strstart, F(e$1.strm);
|
|
3422
|
-
}
|
|
3423
|
-
function U(e$1, t$1) {
|
|
3424
|
-
e$1.pending_buf[e$1.pending++] = t$1;
|
|
3425
|
-
}
|
|
3426
|
-
function P(e$1, t$1) {
|
|
3427
|
-
e$1.pending_buf[e$1.pending++] = t$1 >>> 8 & 255, e$1.pending_buf[e$1.pending++] = 255 & t$1;
|
|
3428
|
-
}
|
|
3429
|
-
function L(e$1, t$1) {
|
|
3430
|
-
var r$1, n$1, i$2 = e$1.max_chain_length, s$1 = e$1.strstart, a$1 = e$1.prev_length, o$1 = e$1.nice_match, h$1 = e$1.strstart > e$1.w_size - z ? e$1.strstart - (e$1.w_size - z) : 0, u$1 = e$1.window, l$1 = e$1.w_mask, f$1 = e$1.prev, c$1 = e$1.strstart + S, d$1 = u$1[s$1 + a$1 - 1], p$1 = u$1[s$1 + a$1];
|
|
3431
|
-
e$1.prev_length >= e$1.good_match && (i$2 >>= 2), o$1 > e$1.lookahead && (o$1 = e$1.lookahead);
|
|
3432
|
-
do
|
|
3433
|
-
if (u$1[(r$1 = t$1) + a$1] === p$1 && u$1[r$1 + a$1 - 1] === d$1 && u$1[r$1] === u$1[s$1] && u$1[++r$1] === u$1[s$1 + 1]) {
|
|
3434
|
-
s$1 += 2, r$1++;
|
|
3435
|
-
do ;
|
|
3436
|
-
while (u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && s$1 < c$1);
|
|
3437
|
-
if (n$1 = S - (c$1 - s$1), s$1 = c$1 - S, a$1 < n$1) {
|
|
3438
|
-
if (e$1.match_start = t$1, o$1 <= (a$1 = n$1)) break;
|
|
3439
|
-
d$1 = u$1[s$1 + a$1 - 1], p$1 = u$1[s$1 + a$1];
|
|
3440
|
-
}
|
|
3441
|
-
}
|
|
3442
|
-
while ((t$1 = f$1[t$1 & l$1]) > h$1 && 0 != --i$2);
|
|
3443
|
-
return a$1 <= e$1.lookahead ? a$1 : e$1.lookahead;
|
|
3444
|
-
}
|
|
3445
|
-
function j(e$1) {
|
|
3446
|
-
var t$1, r$1, n$1, i$2, s$1, a$1, o$1, h$1, u$1, l$1, f$1 = e$1.w_size;
|
|
3447
|
-
do {
|
|
3448
|
-
if (i$2 = e$1.window_size - e$1.lookahead - e$1.strstart, e$1.strstart >= f$1 + (f$1 - z)) {
|
|
3449
|
-
for (c.arraySet(e$1.window, e$1.window, f$1, f$1, 0), e$1.match_start -= f$1, e$1.strstart -= f$1, e$1.block_start -= f$1, t$1 = r$1 = e$1.hash_size; n$1 = e$1.head[--t$1], e$1.head[t$1] = f$1 <= n$1 ? n$1 - f$1 : 0, --r$1;);
|
|
3450
|
-
for (t$1 = r$1 = f$1; n$1 = e$1.prev[--t$1], e$1.prev[t$1] = f$1 <= n$1 ? n$1 - f$1 : 0, --r$1;);
|
|
3451
|
-
i$2 += f$1;
|
|
3452
|
-
}
|
|
3453
|
-
if (0 === e$1.strm.avail_in) break;
|
|
3454
|
-
if (a$1 = e$1.strm, o$1 = e$1.window, h$1 = e$1.strstart + e$1.lookahead, u$1 = i$2, l$1 = void 0, l$1 = a$1.avail_in, u$1 < l$1 && (l$1 = u$1), r$1 = 0 === l$1 ? 0 : (a$1.avail_in -= l$1, c.arraySet(o$1, a$1.input, a$1.next_in, l$1, h$1), 1 === a$1.state.wrap ? a$1.adler = d(a$1.adler, o$1, l$1, h$1) : 2 === a$1.state.wrap && (a$1.adler = p(a$1.adler, o$1, l$1, h$1)), a$1.next_in += l$1, a$1.total_in += l$1, l$1), e$1.lookahead += r$1, e$1.lookahead + e$1.insert >= x) for (s$1 = e$1.strstart - e$1.insert, e$1.ins_h = e$1.window[s$1], e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[s$1 + 1]) & e$1.hash_mask; e$1.insert && (e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[s$1 + x - 1]) & e$1.hash_mask, e$1.prev[s$1 & e$1.w_mask] = e$1.head[e$1.ins_h], e$1.head[e$1.ins_h] = s$1, s$1++, e$1.insert--, !(e$1.lookahead + e$1.insert < x)););
|
|
3455
|
-
} while (e$1.lookahead < z && 0 !== e$1.strm.avail_in);
|
|
3456
|
-
}
|
|
3457
|
-
function Z(e$1, t$1) {
|
|
3458
|
-
for (var r$1, n$1;;) {
|
|
3459
|
-
if (e$1.lookahead < z) {
|
|
3460
|
-
if (j(e$1), e$1.lookahead < z && t$1 === l) return A;
|
|
3461
|
-
if (0 === e$1.lookahead) break;
|
|
3462
|
-
}
|
|
3463
|
-
if (r$1 = 0, e$1.lookahead >= x && (e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[e$1.strstart + x - 1]) & e$1.hash_mask, r$1 = e$1.prev[e$1.strstart & e$1.w_mask] = e$1.head[e$1.ins_h], e$1.head[e$1.ins_h] = e$1.strstart), 0 !== r$1 && e$1.strstart - r$1 <= e$1.w_size - z && (e$1.match_length = L(e$1, r$1)), e$1.match_length >= x) if (n$1 = u._tr_tally(e$1, e$1.strstart - e$1.match_start, e$1.match_length - x), e$1.lookahead -= e$1.match_length, e$1.match_length <= e$1.max_lazy_match && e$1.lookahead >= x) {
|
|
3464
|
-
for (e$1.match_length--; e$1.strstart++, e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[e$1.strstart + x - 1]) & e$1.hash_mask, r$1 = e$1.prev[e$1.strstart & e$1.w_mask] = e$1.head[e$1.ins_h], e$1.head[e$1.ins_h] = e$1.strstart, 0 != --e$1.match_length;);
|
|
3465
|
-
e$1.strstart++;
|
|
3466
|
-
} else e$1.strstart += e$1.match_length, e$1.match_length = 0, e$1.ins_h = e$1.window[e$1.strstart], e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[e$1.strstart + 1]) & e$1.hash_mask;
|
|
3467
|
-
else n$1 = u._tr_tally(e$1, 0, e$1.window[e$1.strstart]), e$1.lookahead--, e$1.strstart++;
|
|
3468
|
-
if (n$1 && (N(e$1, !1), 0 === e$1.strm.avail_out)) return A;
|
|
3469
|
-
}
|
|
3470
|
-
return e$1.insert = e$1.strstart < x - 1 ? e$1.strstart : x - 1, t$1 === f ? (N(e$1, !0), 0 === e$1.strm.avail_out ? O : B) : e$1.last_lit && (N(e$1, !1), 0 === e$1.strm.avail_out) ? A : I;
|
|
3471
|
-
}
|
|
3472
|
-
function W(e$1, t$1) {
|
|
3473
|
-
for (var r$1, n$1, i$2;;) {
|
|
3474
|
-
if (e$1.lookahead < z) {
|
|
3475
|
-
if (j(e$1), e$1.lookahead < z && t$1 === l) return A;
|
|
3476
|
-
if (0 === e$1.lookahead) break;
|
|
3477
|
-
}
|
|
3478
|
-
if (r$1 = 0, e$1.lookahead >= x && (e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[e$1.strstart + x - 1]) & e$1.hash_mask, r$1 = e$1.prev[e$1.strstart & e$1.w_mask] = e$1.head[e$1.ins_h], e$1.head[e$1.ins_h] = e$1.strstart), e$1.prev_length = e$1.match_length, e$1.prev_match = e$1.match_start, e$1.match_length = x - 1, 0 !== r$1 && e$1.prev_length < e$1.max_lazy_match && e$1.strstart - r$1 <= e$1.w_size - z && (e$1.match_length = L(e$1, r$1), e$1.match_length <= 5 && (1 === e$1.strategy || e$1.match_length === x && 4096 < e$1.strstart - e$1.match_start) && (e$1.match_length = x - 1)), e$1.prev_length >= x && e$1.match_length <= e$1.prev_length) {
|
|
3479
|
-
for (i$2 = e$1.strstart + e$1.lookahead - x, n$1 = u._tr_tally(e$1, e$1.strstart - 1 - e$1.prev_match, e$1.prev_length - x), e$1.lookahead -= e$1.prev_length - 1, e$1.prev_length -= 2; ++e$1.strstart <= i$2 && (e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[e$1.strstart + x - 1]) & e$1.hash_mask, r$1 = e$1.prev[e$1.strstart & e$1.w_mask] = e$1.head[e$1.ins_h], e$1.head[e$1.ins_h] = e$1.strstart), 0 != --e$1.prev_length;);
|
|
3480
|
-
if (e$1.match_available = 0, e$1.match_length = x - 1, e$1.strstart++, n$1 && (N(e$1, !1), 0 === e$1.strm.avail_out)) return A;
|
|
3481
|
-
} else if (e$1.match_available) {
|
|
3482
|
-
if ((n$1 = u._tr_tally(e$1, 0, e$1.window[e$1.strstart - 1])) && N(e$1, !1), e$1.strstart++, e$1.lookahead--, 0 === e$1.strm.avail_out) return A;
|
|
3483
|
-
} else e$1.match_available = 1, e$1.strstart++, e$1.lookahead--;
|
|
3484
|
-
}
|
|
3485
|
-
return e$1.match_available && (n$1 = u._tr_tally(e$1, 0, e$1.window[e$1.strstart - 1]), e$1.match_available = 0), e$1.insert = e$1.strstart < x - 1 ? e$1.strstart : x - 1, t$1 === f ? (N(e$1, !0), 0 === e$1.strm.avail_out ? O : B) : e$1.last_lit && (N(e$1, !1), 0 === e$1.strm.avail_out) ? A : I;
|
|
3486
|
-
}
|
|
3487
|
-
function M(e$1, t$1, r$1, n$1, i$2) {
|
|
3488
|
-
this.good_length = e$1, this.max_lazy = t$1, this.nice_length = r$1, this.max_chain = n$1, this.func = i$2;
|
|
3489
|
-
}
|
|
3490
|
-
function H() {
|
|
3491
|
-
this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = v, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new c.Buf16(2 * w), this.dyn_dtree = new c.Buf16(2 * (2 * a + 1)), this.bl_tree = new c.Buf16(2 * (2 * o + 1)), D(this.dyn_ltree), D(this.dyn_dtree), D(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new c.Buf16(k + 1), this.heap = new c.Buf16(2 * s + 1), D(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new c.Buf16(2 * s + 1), D(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
|
|
3492
|
-
}
|
|
3493
|
-
function G(e$1) {
|
|
3494
|
-
var t$1;
|
|
3495
|
-
return e$1 && e$1.state ? (e$1.total_in = e$1.total_out = 0, e$1.data_type = i$1, (t$1 = e$1.state).pending = 0, t$1.pending_out = 0, t$1.wrap < 0 && (t$1.wrap = -t$1.wrap), t$1.status = t$1.wrap ? C : E, e$1.adler = 2 === t$1.wrap ? 0 : 1, t$1.last_flush = l, u._tr_init(t$1), m) : R(e$1, _);
|
|
3496
|
-
}
|
|
3497
|
-
function K(e$1) {
|
|
3498
|
-
var t$1 = G(e$1);
|
|
3499
|
-
return t$1 === m && function(e$2) {
|
|
3500
|
-
e$2.window_size = 2 * e$2.w_size, D(e$2.head), e$2.max_lazy_match = h[e$2.level].max_lazy, e$2.good_match = h[e$2.level].good_length, e$2.nice_match = h[e$2.level].nice_length, e$2.max_chain_length = h[e$2.level].max_chain, e$2.strstart = 0, e$2.block_start = 0, e$2.lookahead = 0, e$2.insert = 0, e$2.match_length = e$2.prev_length = x - 1, e$2.match_available = 0, e$2.ins_h = 0;
|
|
3501
|
-
}(e$1.state), t$1;
|
|
3502
|
-
}
|
|
3503
|
-
function Y(e$1, t$1, r$1, n$1, i$2, s$1) {
|
|
3504
|
-
if (!e$1) return _;
|
|
3505
|
-
var a$1 = 1;
|
|
3506
|
-
if (t$1 === g && (t$1 = 6), n$1 < 0 ? (a$1 = 0, n$1 = -n$1) : 15 < n$1 && (a$1 = 2, n$1 -= 16), i$2 < 1 || y < i$2 || r$1 !== v || n$1 < 8 || 15 < n$1 || t$1 < 0 || 9 < t$1 || s$1 < 0 || b < s$1) return R(e$1, _);
|
|
3507
|
-
8 === n$1 && (n$1 = 9);
|
|
3508
|
-
var o$1 = new H();
|
|
3509
|
-
return (e$1.state = o$1).strm = e$1, o$1.wrap = a$1, o$1.gzhead = null, o$1.w_bits = n$1, o$1.w_size = 1 << o$1.w_bits, o$1.w_mask = o$1.w_size - 1, o$1.hash_bits = i$2 + 7, o$1.hash_size = 1 << o$1.hash_bits, o$1.hash_mask = o$1.hash_size - 1, o$1.hash_shift = ~~((o$1.hash_bits + x - 1) / x), o$1.window = new c.Buf8(2 * o$1.w_size), o$1.head = new c.Buf16(o$1.hash_size), o$1.prev = new c.Buf16(o$1.w_size), o$1.lit_bufsize = 1 << i$2 + 6, o$1.pending_buf_size = 4 * o$1.lit_bufsize, o$1.pending_buf = new c.Buf8(o$1.pending_buf_size), o$1.d_buf = 1 * o$1.lit_bufsize, o$1.l_buf = 3 * o$1.lit_bufsize, o$1.level = t$1, o$1.strategy = s$1, o$1.method = r$1, K(e$1);
|
|
3510
|
-
}
|
|
3511
|
-
h = [
|
|
3512
|
-
new M(0, 0, 0, 0, function(e$1, t$1) {
|
|
3513
|
-
var r$1 = 65535;
|
|
3514
|
-
for (r$1 > e$1.pending_buf_size - 5 && (r$1 = e$1.pending_buf_size - 5);;) {
|
|
3515
|
-
if (e$1.lookahead <= 1) {
|
|
3516
|
-
if (j(e$1), 0 === e$1.lookahead && t$1 === l) return A;
|
|
3517
|
-
if (0 === e$1.lookahead) break;
|
|
3518
|
-
}
|
|
3519
|
-
e$1.strstart += e$1.lookahead, e$1.lookahead = 0;
|
|
3520
|
-
var n$1 = e$1.block_start + r$1;
|
|
3521
|
-
if ((0 === e$1.strstart || e$1.strstart >= n$1) && (e$1.lookahead = e$1.strstart - n$1, e$1.strstart = n$1, N(e$1, !1), 0 === e$1.strm.avail_out)) return A;
|
|
3522
|
-
if (e$1.strstart - e$1.block_start >= e$1.w_size - z && (N(e$1, !1), 0 === e$1.strm.avail_out)) return A;
|
|
3523
|
-
}
|
|
3524
|
-
return e$1.insert = 0, t$1 === f ? (N(e$1, !0), 0 === e$1.strm.avail_out ? O : B) : (e$1.strstart > e$1.block_start && (N(e$1, !1), e$1.strm.avail_out), A);
|
|
3525
|
-
}),
|
|
3526
|
-
new M(4, 4, 8, 4, Z),
|
|
3527
|
-
new M(4, 5, 16, 8, Z),
|
|
3528
|
-
new M(4, 6, 32, 32, Z),
|
|
3529
|
-
new M(4, 4, 16, 16, W),
|
|
3530
|
-
new M(8, 16, 32, 32, W),
|
|
3531
|
-
new M(8, 16, 128, 128, W),
|
|
3532
|
-
new M(8, 32, 128, 256, W),
|
|
3533
|
-
new M(32, 128, 258, 1024, W),
|
|
3534
|
-
new M(32, 258, 258, 4096, W)
|
|
3535
|
-
], r.deflateInit = function(e$1, t$1) {
|
|
3536
|
-
return Y(e$1, t$1, v, 15, 8, 0);
|
|
3537
|
-
}, r.deflateInit2 = Y, r.deflateReset = K, r.deflateResetKeep = G, r.deflateSetHeader = function(e$1, t$1) {
|
|
3538
|
-
return e$1 && e$1.state ? 2 !== e$1.state.wrap ? _ : (e$1.state.gzhead = t$1, m) : _;
|
|
3539
|
-
}, r.deflate = function(e$1, t$1) {
|
|
3540
|
-
var r$1, n$1, i$2, s$1;
|
|
3541
|
-
if (!e$1 || !e$1.state || 5 < t$1 || t$1 < 0) return e$1 ? R(e$1, _) : _;
|
|
3542
|
-
if (n$1 = e$1.state, !e$1.output || !e$1.input && 0 !== e$1.avail_in || 666 === n$1.status && t$1 !== f) return R(e$1, 0 === e$1.avail_out ? -5 : _);
|
|
3543
|
-
if (n$1.strm = e$1, r$1 = n$1.last_flush, n$1.last_flush = t$1, n$1.status === C) if (2 === n$1.wrap) e$1.adler = 0, U(n$1, 31), U(n$1, 139), U(n$1, 8), n$1.gzhead ? (U(n$1, (n$1.gzhead.text ? 1 : 0) + (n$1.gzhead.hcrc ? 2 : 0) + (n$1.gzhead.extra ? 4 : 0) + (n$1.gzhead.name ? 8 : 0) + (n$1.gzhead.comment ? 16 : 0)), U(n$1, 255 & n$1.gzhead.time), U(n$1, n$1.gzhead.time >> 8 & 255), U(n$1, n$1.gzhead.time >> 16 & 255), U(n$1, n$1.gzhead.time >> 24 & 255), U(n$1, 9 === n$1.level ? 2 : 2 <= n$1.strategy || n$1.level < 2 ? 4 : 0), U(n$1, 255 & n$1.gzhead.os), n$1.gzhead.extra && n$1.gzhead.extra.length && (U(n$1, 255 & n$1.gzhead.extra.length), U(n$1, n$1.gzhead.extra.length >> 8 & 255)), n$1.gzhead.hcrc && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending, 0)), n$1.gzindex = 0, n$1.status = 69) : (U(n$1, 0), U(n$1, 0), U(n$1, 0), U(n$1, 0), U(n$1, 0), U(n$1, 9 === n$1.level ? 2 : 2 <= n$1.strategy || n$1.level < 2 ? 4 : 0), U(n$1, 3), n$1.status = E);
|
|
3544
|
-
else {
|
|
3545
|
-
var a$1 = v + (n$1.w_bits - 8 << 4) << 8;
|
|
3546
|
-
a$1 |= (2 <= n$1.strategy || n$1.level < 2 ? 0 : n$1.level < 6 ? 1 : 6 === n$1.level ? 2 : 3) << 6, 0 !== n$1.strstart && (a$1 |= 32), a$1 += 31 - a$1 % 31, n$1.status = E, P(n$1, a$1), 0 !== n$1.strstart && (P(n$1, e$1.adler >>> 16), P(n$1, 65535 & e$1.adler)), e$1.adler = 1;
|
|
3547
|
-
}
|
|
3548
|
-
if (69 === n$1.status) if (n$1.gzhead.extra) {
|
|
3549
|
-
for (i$2 = n$1.pending; n$1.gzindex < (65535 & n$1.gzhead.extra.length) && (n$1.pending !== n$1.pending_buf_size || (n$1.gzhead.hcrc && n$1.pending > i$2 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$2, i$2)), F(e$1), i$2 = n$1.pending, n$1.pending !== n$1.pending_buf_size));) U(n$1, 255 & n$1.gzhead.extra[n$1.gzindex]), n$1.gzindex++;
|
|
3550
|
-
n$1.gzhead.hcrc && n$1.pending > i$2 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$2, i$2)), n$1.gzindex === n$1.gzhead.extra.length && (n$1.gzindex = 0, n$1.status = 73);
|
|
3551
|
-
} else n$1.status = 73;
|
|
3552
|
-
if (73 === n$1.status) if (n$1.gzhead.name) {
|
|
3553
|
-
i$2 = n$1.pending;
|
|
3554
|
-
do {
|
|
3555
|
-
if (n$1.pending === n$1.pending_buf_size && (n$1.gzhead.hcrc && n$1.pending > i$2 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$2, i$2)), F(e$1), i$2 = n$1.pending, n$1.pending === n$1.pending_buf_size)) {
|
|
3556
|
-
s$1 = 1;
|
|
3557
|
-
break;
|
|
3558
|
-
}
|
|
3559
|
-
s$1 = n$1.gzindex < n$1.gzhead.name.length ? 255 & n$1.gzhead.name.charCodeAt(n$1.gzindex++) : 0, U(n$1, s$1);
|
|
3560
|
-
} while (0 !== s$1);
|
|
3561
|
-
n$1.gzhead.hcrc && n$1.pending > i$2 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$2, i$2)), 0 === s$1 && (n$1.gzindex = 0, n$1.status = 91);
|
|
3562
|
-
} else n$1.status = 91;
|
|
3563
|
-
if (91 === n$1.status) if (n$1.gzhead.comment) {
|
|
3564
|
-
i$2 = n$1.pending;
|
|
3565
|
-
do {
|
|
3566
|
-
if (n$1.pending === n$1.pending_buf_size && (n$1.gzhead.hcrc && n$1.pending > i$2 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$2, i$2)), F(e$1), i$2 = n$1.pending, n$1.pending === n$1.pending_buf_size)) {
|
|
3567
|
-
s$1 = 1;
|
|
3568
|
-
break;
|
|
3569
|
-
}
|
|
3570
|
-
s$1 = n$1.gzindex < n$1.gzhead.comment.length ? 255 & n$1.gzhead.comment.charCodeAt(n$1.gzindex++) : 0, U(n$1, s$1);
|
|
3571
|
-
} while (0 !== s$1);
|
|
3572
|
-
n$1.gzhead.hcrc && n$1.pending > i$2 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$2, i$2)), 0 === s$1 && (n$1.status = 103);
|
|
3573
|
-
} else n$1.status = 103;
|
|
3574
|
-
if (103 === n$1.status && (n$1.gzhead.hcrc ? (n$1.pending + 2 > n$1.pending_buf_size && F(e$1), n$1.pending + 2 <= n$1.pending_buf_size && (U(n$1, 255 & e$1.adler), U(n$1, e$1.adler >> 8 & 255), e$1.adler = 0, n$1.status = E)) : n$1.status = E), 0 !== n$1.pending) {
|
|
3575
|
-
if (F(e$1), 0 === e$1.avail_out) return n$1.last_flush = -1, m;
|
|
3576
|
-
} else if (0 === e$1.avail_in && T(t$1) <= T(r$1) && t$1 !== f) return R(e$1, -5);
|
|
3577
|
-
if (666 === n$1.status && 0 !== e$1.avail_in) return R(e$1, -5);
|
|
3578
|
-
if (0 !== e$1.avail_in || 0 !== n$1.lookahead || t$1 !== l && 666 !== n$1.status) {
|
|
3579
|
-
var o$1 = 2 === n$1.strategy ? function(e$2, t$2) {
|
|
3580
|
-
for (var r$2;;) {
|
|
3581
|
-
if (0 === e$2.lookahead && (j(e$2), 0 === e$2.lookahead)) {
|
|
3582
|
-
if (t$2 === l) return A;
|
|
3583
|
-
break;
|
|
3584
|
-
}
|
|
3585
|
-
if (e$2.match_length = 0, r$2 = u._tr_tally(e$2, 0, e$2.window[e$2.strstart]), e$2.lookahead--, e$2.strstart++, r$2 && (N(e$2, !1), 0 === e$2.strm.avail_out)) return A;
|
|
3586
|
-
}
|
|
3587
|
-
return e$2.insert = 0, t$2 === f ? (N(e$2, !0), 0 === e$2.strm.avail_out ? O : B) : e$2.last_lit && (N(e$2, !1), 0 === e$2.strm.avail_out) ? A : I;
|
|
3588
|
-
}(n$1, t$1) : 3 === n$1.strategy ? function(e$2, t$2) {
|
|
3589
|
-
for (var r$2, n$2, i$3, s$2, a$2 = e$2.window;;) {
|
|
3590
|
-
if (e$2.lookahead <= S) {
|
|
3591
|
-
if (j(e$2), e$2.lookahead <= S && t$2 === l) return A;
|
|
3592
|
-
if (0 === e$2.lookahead) break;
|
|
3593
|
-
}
|
|
3594
|
-
if (e$2.match_length = 0, e$2.lookahead >= x && 0 < e$2.strstart && (n$2 = a$2[i$3 = e$2.strstart - 1]) === a$2[++i$3] && n$2 === a$2[++i$3] && n$2 === a$2[++i$3]) {
|
|
3595
|
-
s$2 = e$2.strstart + S;
|
|
3596
|
-
do ;
|
|
3597
|
-
while (n$2 === a$2[++i$3] && n$2 === a$2[++i$3] && n$2 === a$2[++i$3] && n$2 === a$2[++i$3] && n$2 === a$2[++i$3] && n$2 === a$2[++i$3] && n$2 === a$2[++i$3] && n$2 === a$2[++i$3] && i$3 < s$2);
|
|
3598
|
-
e$2.match_length = S - (s$2 - i$3), e$2.match_length > e$2.lookahead && (e$2.match_length = e$2.lookahead);
|
|
3599
|
-
}
|
|
3600
|
-
if (e$2.match_length >= x ? (r$2 = u._tr_tally(e$2, 1, e$2.match_length - x), e$2.lookahead -= e$2.match_length, e$2.strstart += e$2.match_length, e$2.match_length = 0) : (r$2 = u._tr_tally(e$2, 0, e$2.window[e$2.strstart]), e$2.lookahead--, e$2.strstart++), r$2 && (N(e$2, !1), 0 === e$2.strm.avail_out)) return A;
|
|
3601
|
-
}
|
|
3602
|
-
return e$2.insert = 0, t$2 === f ? (N(e$2, !0), 0 === e$2.strm.avail_out ? O : B) : e$2.last_lit && (N(e$2, !1), 0 === e$2.strm.avail_out) ? A : I;
|
|
3603
|
-
}(n$1, t$1) : h[n$1.level].func(n$1, t$1);
|
|
3604
|
-
if (o$1 !== O && o$1 !== B || (n$1.status = 666), o$1 === A || o$1 === O) return 0 === e$1.avail_out && (n$1.last_flush = -1), m;
|
|
3605
|
-
if (o$1 === I && (1 === t$1 ? u._tr_align(n$1) : 5 !== t$1 && (u._tr_stored_block(n$1, 0, 0, !1), 3 === t$1 && (D(n$1.head), 0 === n$1.lookahead && (n$1.strstart = 0, n$1.block_start = 0, n$1.insert = 0))), F(e$1), 0 === e$1.avail_out)) return n$1.last_flush = -1, m;
|
|
3606
|
-
}
|
|
3607
|
-
return t$1 !== f ? m : n$1.wrap <= 0 ? 1 : (2 === n$1.wrap ? (U(n$1, 255 & e$1.adler), U(n$1, e$1.adler >> 8 & 255), U(n$1, e$1.adler >> 16 & 255), U(n$1, e$1.adler >> 24 & 255), U(n$1, 255 & e$1.total_in), U(n$1, e$1.total_in >> 8 & 255), U(n$1, e$1.total_in >> 16 & 255), U(n$1, e$1.total_in >> 24 & 255)) : (P(n$1, e$1.adler >>> 16), P(n$1, 65535 & e$1.adler)), F(e$1), 0 < n$1.wrap && (n$1.wrap = -n$1.wrap), 0 !== n$1.pending ? m : 1);
|
|
3608
|
-
}, r.deflateEnd = function(e$1) {
|
|
3609
|
-
var t$1;
|
|
3610
|
-
return e$1 && e$1.state ? (t$1 = e$1.state.status) !== C && 69 !== t$1 && 73 !== t$1 && 91 !== t$1 && 103 !== t$1 && t$1 !== E && 666 !== t$1 ? R(e$1, _) : (e$1.state = null, t$1 === E ? R(e$1, -3) : m) : _;
|
|
3611
|
-
}, r.deflateSetDictionary = function(e$1, t$1) {
|
|
3612
|
-
var r$1, n$1, i$2, s$1, a$1, o$1, h$1, u$1, l$1 = t$1.length;
|
|
3613
|
-
if (!e$1 || !e$1.state) return _;
|
|
3614
|
-
if (2 === (s$1 = (r$1 = e$1.state).wrap) || 1 === s$1 && r$1.status !== C || r$1.lookahead) return _;
|
|
3615
|
-
for (1 === s$1 && (e$1.adler = d(e$1.adler, t$1, l$1, 0)), r$1.wrap = 0, l$1 >= r$1.w_size && (0 === s$1 && (D(r$1.head), r$1.strstart = 0, r$1.block_start = 0, r$1.insert = 0), u$1 = new c.Buf8(r$1.w_size), c.arraySet(u$1, t$1, l$1 - r$1.w_size, r$1.w_size, 0), t$1 = u$1, l$1 = r$1.w_size), a$1 = e$1.avail_in, o$1 = e$1.next_in, h$1 = e$1.input, e$1.avail_in = l$1, e$1.next_in = 0, e$1.input = t$1, j(r$1); r$1.lookahead >= x;) {
|
|
3616
|
-
for (n$1 = r$1.strstart, i$2 = r$1.lookahead - (x - 1); r$1.ins_h = (r$1.ins_h << r$1.hash_shift ^ r$1.window[n$1 + x - 1]) & r$1.hash_mask, r$1.prev[n$1 & r$1.w_mask] = r$1.head[r$1.ins_h], r$1.head[r$1.ins_h] = n$1, n$1++, --i$2;);
|
|
3617
|
-
r$1.strstart = n$1, r$1.lookahead = x - 1, j(r$1);
|
|
3618
|
-
}
|
|
3619
|
-
return r$1.strstart += r$1.lookahead, r$1.block_start = r$1.strstart, r$1.insert = r$1.lookahead, r$1.lookahead = 0, r$1.match_length = r$1.prev_length = x - 1, r$1.match_available = 0, e$1.next_in = o$1, e$1.input = h$1, e$1.avail_in = a$1, r$1.wrap = s$1, m;
|
|
3620
|
-
}, r.deflateInfo = "pako deflate (from Nodeca project)";
|
|
3621
|
-
}, {
|
|
3622
|
-
"../utils/common": 41,
|
|
3623
|
-
"./adler32": 43,
|
|
3624
|
-
"./crc32": 45,
|
|
3625
|
-
"./messages": 51,
|
|
3626
|
-
"./trees": 52
|
|
3627
|
-
}],
|
|
3628
|
-
47: [function(e, t, r) {
|
|
3629
|
-
"use strict";
|
|
3630
|
-
t.exports = function() {
|
|
3631
|
-
this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1;
|
|
3632
|
-
};
|
|
3633
|
-
}, {}],
|
|
3634
|
-
48: [function(e, t, r) {
|
|
3635
|
-
"use strict";
|
|
3636
|
-
t.exports = function(e$1, t$1) {
|
|
3637
|
-
var r$1 = e$1.state, n = e$1.next_in, i$1, s, a, o, h, u, l, f, c, d, p, m, _, g, b, v, y, w, k, x, S, z = e$1.input, C;
|
|
3638
|
-
i$1 = n + (e$1.avail_in - 5), s = e$1.next_out, C = e$1.output, a = s - (t$1 - e$1.avail_out), o = s + (e$1.avail_out - 257), h = r$1.dmax, u = r$1.wsize, l = r$1.whave, f = r$1.wnext, c = r$1.window, d = r$1.hold, p = r$1.bits, m = r$1.lencode, _ = r$1.distcode, g = (1 << r$1.lenbits) - 1, b = (1 << r$1.distbits) - 1;
|
|
3639
|
-
e: do {
|
|
3640
|
-
p < 15 && (d += z[n++] << p, p += 8, d += z[n++] << p, p += 8), v = m[d & g];
|
|
3641
|
-
t: for (;;) {
|
|
3642
|
-
if (d >>>= y = v >>> 24, p -= y, 0 === (y = v >>> 16 & 255)) C[s++] = 65535 & v;
|
|
3643
|
-
else {
|
|
3644
|
-
if (!(16 & y)) {
|
|
3645
|
-
if (0 == (64 & y)) {
|
|
3646
|
-
v = m[(65535 & v) + (d & (1 << y) - 1)];
|
|
3647
|
-
continue t;
|
|
3648
|
-
}
|
|
3649
|
-
if (32 & y) {
|
|
3650
|
-
r$1.mode = 12;
|
|
3651
|
-
break e;
|
|
3652
|
-
}
|
|
3653
|
-
e$1.msg = "invalid literal/length code", r$1.mode = 30;
|
|
3654
|
-
break e;
|
|
3655
|
-
}
|
|
3656
|
-
w = 65535 & v, (y &= 15) && (p < y && (d += z[n++] << p, p += 8), w += d & (1 << y) - 1, d >>>= y, p -= y), p < 15 && (d += z[n++] << p, p += 8, d += z[n++] << p, p += 8), v = _[d & b];
|
|
3657
|
-
r: for (;;) {
|
|
3658
|
-
if (d >>>= y = v >>> 24, p -= y, !(16 & (y = v >>> 16 & 255))) {
|
|
3659
|
-
if (0 == (64 & y)) {
|
|
3660
|
-
v = _[(65535 & v) + (d & (1 << y) - 1)];
|
|
3661
|
-
continue r;
|
|
3662
|
-
}
|
|
3663
|
-
e$1.msg = "invalid distance code", r$1.mode = 30;
|
|
3664
|
-
break e;
|
|
3665
|
-
}
|
|
3666
|
-
if (k = 65535 & v, p < (y &= 15) && (d += z[n++] << p, (p += 8) < y && (d += z[n++] << p, p += 8)), h < (k += d & (1 << y) - 1)) {
|
|
3667
|
-
e$1.msg = "invalid distance too far back", r$1.mode = 30;
|
|
3668
|
-
break e;
|
|
3669
|
-
}
|
|
3670
|
-
if (d >>>= y, p -= y, (y = s - a) < k) {
|
|
3671
|
-
if (l < (y = k - y) && r$1.sane) {
|
|
3672
|
-
e$1.msg = "invalid distance too far back", r$1.mode = 30;
|
|
3673
|
-
break e;
|
|
3674
|
-
}
|
|
3675
|
-
if (S = c, (x = 0) === f) {
|
|
3676
|
-
if (x += u - y, y < w) {
|
|
3677
|
-
for (w -= y; C[s++] = c[x++], --y;);
|
|
3678
|
-
x = s - k, S = C;
|
|
3679
|
-
}
|
|
3680
|
-
} else if (f < y) {
|
|
3681
|
-
if (x += u + f - y, (y -= f) < w) {
|
|
3682
|
-
for (w -= y; C[s++] = c[x++], --y;);
|
|
3683
|
-
if (x = 0, f < w) {
|
|
3684
|
-
for (w -= y = f; C[s++] = c[x++], --y;);
|
|
3685
|
-
x = s - k, S = C;
|
|
3686
|
-
}
|
|
3687
|
-
}
|
|
3688
|
-
} else if (x += f - y, y < w) {
|
|
3689
|
-
for (w -= y; C[s++] = c[x++], --y;);
|
|
3690
|
-
x = s - k, S = C;
|
|
3691
|
-
}
|
|
3692
|
-
for (; 2 < w;) C[s++] = S[x++], C[s++] = S[x++], C[s++] = S[x++], w -= 3;
|
|
3693
|
-
w && (C[s++] = S[x++], 1 < w && (C[s++] = S[x++]));
|
|
3694
|
-
} else {
|
|
3695
|
-
for (x = s - k; C[s++] = C[x++], C[s++] = C[x++], C[s++] = C[x++], 2 < (w -= 3););
|
|
3696
|
-
w && (C[s++] = C[x++], 1 < w && (C[s++] = C[x++]));
|
|
3697
|
-
}
|
|
3698
|
-
break;
|
|
3699
|
-
}
|
|
3700
|
-
}
|
|
3701
|
-
break;
|
|
3702
|
-
}
|
|
3703
|
-
} while (n < i$1 && s < o);
|
|
3704
|
-
n -= w = p >> 3, d &= (1 << (p -= w << 3)) - 1, e$1.next_in = n, e$1.next_out = s, e$1.avail_in = n < i$1 ? i$1 - n + 5 : 5 - (n - i$1), e$1.avail_out = s < o ? o - s + 257 : 257 - (s - o), r$1.hold = d, r$1.bits = p;
|
|
3705
|
-
};
|
|
3706
|
-
}, {}],
|
|
3707
|
-
49: [function(e, t, r) {
|
|
3708
|
-
"use strict";
|
|
3709
|
-
var I = e("../utils/common"), O = e("./adler32"), B = e("./crc32"), R = e("./inffast"), T = e("./inftrees"), D = 1, F = 2, N = 0, U = -2, P = 1, n = 852, i$1 = 592;
|
|
3710
|
-
function L(e$1) {
|
|
3711
|
-
return (e$1 >>> 24 & 255) + (e$1 >>> 8 & 65280) + ((65280 & e$1) << 8) + ((255 & e$1) << 24);
|
|
3712
|
-
}
|
|
3713
|
-
function s() {
|
|
3714
|
-
this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new I.Buf16(320), this.work = new I.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
|
|
3715
|
-
}
|
|
3716
|
-
function a(e$1) {
|
|
3717
|
-
var t$1;
|
|
3718
|
-
return e$1 && e$1.state ? (t$1 = e$1.state, e$1.total_in = e$1.total_out = t$1.total = 0, e$1.msg = "", t$1.wrap && (e$1.adler = 1 & t$1.wrap), t$1.mode = P, t$1.last = 0, t$1.havedict = 0, t$1.dmax = 32768, t$1.head = null, t$1.hold = 0, t$1.bits = 0, t$1.lencode = t$1.lendyn = new I.Buf32(n), t$1.distcode = t$1.distdyn = new I.Buf32(i$1), t$1.sane = 1, t$1.back = -1, N) : U;
|
|
3719
|
-
}
|
|
3720
|
-
function o(e$1) {
|
|
3721
|
-
var t$1;
|
|
3722
|
-
return e$1 && e$1.state ? ((t$1 = e$1.state).wsize = 0, t$1.whave = 0, t$1.wnext = 0, a(e$1)) : U;
|
|
3723
|
-
}
|
|
3724
|
-
function h(e$1, t$1) {
|
|
3725
|
-
var r$1, n$1;
|
|
3726
|
-
return e$1 && e$1.state ? (n$1 = e$1.state, t$1 < 0 ? (r$1 = 0, t$1 = -t$1) : (r$1 = 1 + (t$1 >> 4), t$1 < 48 && (t$1 &= 15)), t$1 && (t$1 < 8 || 15 < t$1) ? U : (null !== n$1.window && n$1.wbits !== t$1 && (n$1.window = null), n$1.wrap = r$1, n$1.wbits = t$1, o(e$1))) : U;
|
|
3727
|
-
}
|
|
3728
|
-
function u(e$1, t$1) {
|
|
3729
|
-
var r$1, n$1;
|
|
3730
|
-
return e$1 ? (n$1 = new s(), (e$1.state = n$1).window = null, (r$1 = h(e$1, t$1)) !== N && (e$1.state = null), r$1) : U;
|
|
3731
|
-
}
|
|
3732
|
-
var l, f, c = !0;
|
|
3733
|
-
function j(e$1) {
|
|
3734
|
-
if (c) {
|
|
3735
|
-
var t$1;
|
|
3736
|
-
for (l = new I.Buf32(512), f = new I.Buf32(32), t$1 = 0; t$1 < 144;) e$1.lens[t$1++] = 8;
|
|
3737
|
-
for (; t$1 < 256;) e$1.lens[t$1++] = 9;
|
|
3738
|
-
for (; t$1 < 280;) e$1.lens[t$1++] = 7;
|
|
3739
|
-
for (; t$1 < 288;) e$1.lens[t$1++] = 8;
|
|
3740
|
-
for (T(D, e$1.lens, 0, 288, l, 0, e$1.work, { bits: 9 }), t$1 = 0; t$1 < 32;) e$1.lens[t$1++] = 5;
|
|
3741
|
-
T(F, e$1.lens, 0, 32, f, 0, e$1.work, { bits: 5 }), c = !1;
|
|
3742
|
-
}
|
|
3743
|
-
e$1.lencode = l, e$1.lenbits = 9, e$1.distcode = f, e$1.distbits = 5;
|
|
3744
|
-
}
|
|
3745
|
-
function Z(e$1, t$1, r$1, n$1) {
|
|
3746
|
-
var i$2, s$1 = e$1.state;
|
|
3747
|
-
return null === s$1.window && (s$1.wsize = 1 << s$1.wbits, s$1.wnext = 0, s$1.whave = 0, s$1.window = new I.Buf8(s$1.wsize)), n$1 >= s$1.wsize ? (I.arraySet(s$1.window, t$1, r$1 - s$1.wsize, s$1.wsize, 0), s$1.wnext = 0, s$1.whave = s$1.wsize) : (n$1 < (i$2 = s$1.wsize - s$1.wnext) && (i$2 = n$1), I.arraySet(s$1.window, t$1, r$1 - n$1, i$2, s$1.wnext), (n$1 -= i$2) ? (I.arraySet(s$1.window, t$1, r$1 - n$1, n$1, 0), s$1.wnext = n$1, s$1.whave = s$1.wsize) : (s$1.wnext += i$2, s$1.wnext === s$1.wsize && (s$1.wnext = 0), s$1.whave < s$1.wsize && (s$1.whave += i$2))), 0;
|
|
3748
|
-
}
|
|
3749
|
-
r.inflateReset = o, r.inflateReset2 = h, r.inflateResetKeep = a, r.inflateInit = function(e$1) {
|
|
3750
|
-
return u(e$1, 15);
|
|
3751
|
-
}, r.inflateInit2 = u, r.inflate = function(e$1, t$1) {
|
|
3752
|
-
var r$1, n$1, i$2, s$1, a$1, o$1, h$1, u$1, l$1, f$1, c$1, d, p, m, _, g, b, v, y, w, k, x, S, z, C = 0, E = new I.Buf8(4), A = [
|
|
3753
|
-
16,
|
|
3754
|
-
17,
|
|
3755
|
-
18,
|
|
3756
|
-
0,
|
|
3757
|
-
8,
|
|
3758
|
-
7,
|
|
3759
|
-
9,
|
|
3760
|
-
6,
|
|
3761
|
-
10,
|
|
3762
|
-
5,
|
|
3763
|
-
11,
|
|
3764
|
-
4,
|
|
3765
|
-
12,
|
|
3766
|
-
3,
|
|
3767
|
-
13,
|
|
3768
|
-
2,
|
|
3769
|
-
14,
|
|
3770
|
-
1,
|
|
3771
|
-
15
|
|
3772
|
-
];
|
|
3773
|
-
if (!e$1 || !e$1.state || !e$1.output || !e$1.input && 0 !== e$1.avail_in) return U;
|
|
3774
|
-
12 === (r$1 = e$1.state).mode && (r$1.mode = 13), a$1 = e$1.next_out, i$2 = e$1.output, h$1 = e$1.avail_out, s$1 = e$1.next_in, n$1 = e$1.input, o$1 = e$1.avail_in, u$1 = r$1.hold, l$1 = r$1.bits, f$1 = o$1, c$1 = h$1, x = N;
|
|
3775
|
-
e: for (;;) switch (r$1.mode) {
|
|
3776
|
-
case P:
|
|
3777
|
-
if (0 === r$1.wrap) {
|
|
3778
|
-
r$1.mode = 13;
|
|
3779
|
-
break;
|
|
3780
|
-
}
|
|
3781
|
-
for (; l$1 < 16;) {
|
|
3782
|
-
if (0 === o$1) break e;
|
|
3783
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3784
|
-
}
|
|
3785
|
-
if (2 & r$1.wrap && 35615 === u$1) {
|
|
3786
|
-
E[r$1.check = 0] = 255 & u$1, E[1] = u$1 >>> 8 & 255, r$1.check = B(r$1.check, E, 2, 0), l$1 = u$1 = 0, r$1.mode = 2;
|
|
3787
|
-
break;
|
|
3788
|
-
}
|
|
3789
|
-
if (r$1.flags = 0, r$1.head && (r$1.head.done = !1), !(1 & r$1.wrap) || (((255 & u$1) << 8) + (u$1 >> 8)) % 31) {
|
|
3790
|
-
e$1.msg = "incorrect header check", r$1.mode = 30;
|
|
3791
|
-
break;
|
|
3792
|
-
}
|
|
3793
|
-
if (8 != (15 & u$1)) {
|
|
3794
|
-
e$1.msg = "unknown compression method", r$1.mode = 30;
|
|
3795
|
-
break;
|
|
3796
|
-
}
|
|
3797
|
-
if (l$1 -= 4, k = 8 + (15 & (u$1 >>>= 4)), 0 === r$1.wbits) r$1.wbits = k;
|
|
3798
|
-
else if (k > r$1.wbits) {
|
|
3799
|
-
e$1.msg = "invalid window size", r$1.mode = 30;
|
|
3800
|
-
break;
|
|
3801
|
-
}
|
|
3802
|
-
r$1.dmax = 1 << k, e$1.adler = r$1.check = 1, r$1.mode = 512 & u$1 ? 10 : 12, l$1 = u$1 = 0;
|
|
3803
|
-
break;
|
|
3804
|
-
case 2:
|
|
3805
|
-
for (; l$1 < 16;) {
|
|
3806
|
-
if (0 === o$1) break e;
|
|
3807
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3808
|
-
}
|
|
3809
|
-
if (r$1.flags = u$1, 8 != (255 & r$1.flags)) {
|
|
3810
|
-
e$1.msg = "unknown compression method", r$1.mode = 30;
|
|
3811
|
-
break;
|
|
3812
|
-
}
|
|
3813
|
-
if (57344 & r$1.flags) {
|
|
3814
|
-
e$1.msg = "unknown header flags set", r$1.mode = 30;
|
|
3815
|
-
break;
|
|
3816
|
-
}
|
|
3817
|
-
r$1.head && (r$1.head.text = u$1 >> 8 & 1), 512 & r$1.flags && (E[0] = 255 & u$1, E[1] = u$1 >>> 8 & 255, r$1.check = B(r$1.check, E, 2, 0)), l$1 = u$1 = 0, r$1.mode = 3;
|
|
3818
|
-
case 3:
|
|
3819
|
-
for (; l$1 < 32;) {
|
|
3820
|
-
if (0 === o$1) break e;
|
|
3821
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3822
|
-
}
|
|
3823
|
-
r$1.head && (r$1.head.time = u$1), 512 & r$1.flags && (E[0] = 255 & u$1, E[1] = u$1 >>> 8 & 255, E[2] = u$1 >>> 16 & 255, E[3] = u$1 >>> 24 & 255, r$1.check = B(r$1.check, E, 4, 0)), l$1 = u$1 = 0, r$1.mode = 4;
|
|
3824
|
-
case 4:
|
|
3825
|
-
for (; l$1 < 16;) {
|
|
3826
|
-
if (0 === o$1) break e;
|
|
3827
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3828
|
-
}
|
|
3829
|
-
r$1.head && (r$1.head.xflags = 255 & u$1, r$1.head.os = u$1 >> 8), 512 & r$1.flags && (E[0] = 255 & u$1, E[1] = u$1 >>> 8 & 255, r$1.check = B(r$1.check, E, 2, 0)), l$1 = u$1 = 0, r$1.mode = 5;
|
|
3830
|
-
case 5:
|
|
3831
|
-
if (1024 & r$1.flags) {
|
|
3832
|
-
for (; l$1 < 16;) {
|
|
3833
|
-
if (0 === o$1) break e;
|
|
3834
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3835
|
-
}
|
|
3836
|
-
r$1.length = u$1, r$1.head && (r$1.head.extra_len = u$1), 512 & r$1.flags && (E[0] = 255 & u$1, E[1] = u$1 >>> 8 & 255, r$1.check = B(r$1.check, E, 2, 0)), l$1 = u$1 = 0;
|
|
3837
|
-
} else r$1.head && (r$1.head.extra = null);
|
|
3838
|
-
r$1.mode = 6;
|
|
3839
|
-
case 6:
|
|
3840
|
-
if (1024 & r$1.flags && (o$1 < (d = r$1.length) && (d = o$1), d && (r$1.head && (k = r$1.head.extra_len - r$1.length, r$1.head.extra || (r$1.head.extra = new Array(r$1.head.extra_len)), I.arraySet(r$1.head.extra, n$1, s$1, d, k)), 512 & r$1.flags && (r$1.check = B(r$1.check, n$1, d, s$1)), o$1 -= d, s$1 += d, r$1.length -= d), r$1.length)) break e;
|
|
3841
|
-
r$1.length = 0, r$1.mode = 7;
|
|
3842
|
-
case 7:
|
|
3843
|
-
if (2048 & r$1.flags) {
|
|
3844
|
-
if (0 === o$1) break e;
|
|
3845
|
-
for (d = 0; k = n$1[s$1 + d++], r$1.head && k && r$1.length < 65536 && (r$1.head.name += String.fromCharCode(k)), k && d < o$1;);
|
|
3846
|
-
if (512 & r$1.flags && (r$1.check = B(r$1.check, n$1, d, s$1)), o$1 -= d, s$1 += d, k) break e;
|
|
3847
|
-
} else r$1.head && (r$1.head.name = null);
|
|
3848
|
-
r$1.length = 0, r$1.mode = 8;
|
|
3849
|
-
case 8:
|
|
3850
|
-
if (4096 & r$1.flags) {
|
|
3851
|
-
if (0 === o$1) break e;
|
|
3852
|
-
for (d = 0; k = n$1[s$1 + d++], r$1.head && k && r$1.length < 65536 && (r$1.head.comment += String.fromCharCode(k)), k && d < o$1;);
|
|
3853
|
-
if (512 & r$1.flags && (r$1.check = B(r$1.check, n$1, d, s$1)), o$1 -= d, s$1 += d, k) break e;
|
|
3854
|
-
} else r$1.head && (r$1.head.comment = null);
|
|
3855
|
-
r$1.mode = 9;
|
|
3856
|
-
case 9:
|
|
3857
|
-
if (512 & r$1.flags) {
|
|
3858
|
-
for (; l$1 < 16;) {
|
|
3859
|
-
if (0 === o$1) break e;
|
|
3860
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3861
|
-
}
|
|
3862
|
-
if (u$1 !== (65535 & r$1.check)) {
|
|
3863
|
-
e$1.msg = "header crc mismatch", r$1.mode = 30;
|
|
3864
|
-
break;
|
|
3865
|
-
}
|
|
3866
|
-
l$1 = u$1 = 0;
|
|
3867
|
-
}
|
|
3868
|
-
r$1.head && (r$1.head.hcrc = r$1.flags >> 9 & 1, r$1.head.done = !0), e$1.adler = r$1.check = 0, r$1.mode = 12;
|
|
3869
|
-
break;
|
|
3870
|
-
case 10:
|
|
3871
|
-
for (; l$1 < 32;) {
|
|
3872
|
-
if (0 === o$1) break e;
|
|
3873
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3874
|
-
}
|
|
3875
|
-
e$1.adler = r$1.check = L(u$1), l$1 = u$1 = 0, r$1.mode = 11;
|
|
3876
|
-
case 11:
|
|
3877
|
-
if (0 === r$1.havedict) return e$1.next_out = a$1, e$1.avail_out = h$1, e$1.next_in = s$1, e$1.avail_in = o$1, r$1.hold = u$1, r$1.bits = l$1, 2;
|
|
3878
|
-
e$1.adler = r$1.check = 1, r$1.mode = 12;
|
|
3879
|
-
case 12: if (5 === t$1 || 6 === t$1) break e;
|
|
3880
|
-
case 13:
|
|
3881
|
-
if (r$1.last) {
|
|
3882
|
-
u$1 >>>= 7 & l$1, l$1 -= 7 & l$1, r$1.mode = 27;
|
|
3883
|
-
break;
|
|
3884
|
-
}
|
|
3885
|
-
for (; l$1 < 3;) {
|
|
3886
|
-
if (0 === o$1) break e;
|
|
3887
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3888
|
-
}
|
|
3889
|
-
switch (r$1.last = 1 & u$1, l$1 -= 1, 3 & (u$1 >>>= 1)) {
|
|
3890
|
-
case 0:
|
|
3891
|
-
r$1.mode = 14;
|
|
3892
|
-
break;
|
|
3893
|
-
case 1:
|
|
3894
|
-
if (j(r$1), r$1.mode = 20, 6 !== t$1) break;
|
|
3895
|
-
u$1 >>>= 2, l$1 -= 2;
|
|
3896
|
-
break e;
|
|
3897
|
-
case 2:
|
|
3898
|
-
r$1.mode = 17;
|
|
3899
|
-
break;
|
|
3900
|
-
case 3: e$1.msg = "invalid block type", r$1.mode = 30;
|
|
3901
|
-
}
|
|
3902
|
-
u$1 >>>= 2, l$1 -= 2;
|
|
3903
|
-
break;
|
|
3904
|
-
case 14:
|
|
3905
|
-
for (u$1 >>>= 7 & l$1, l$1 -= 7 & l$1; l$1 < 32;) {
|
|
3906
|
-
if (0 === o$1) break e;
|
|
3907
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3908
|
-
}
|
|
3909
|
-
if ((65535 & u$1) != (u$1 >>> 16 ^ 65535)) {
|
|
3910
|
-
e$1.msg = "invalid stored block lengths", r$1.mode = 30;
|
|
3911
|
-
break;
|
|
3912
|
-
}
|
|
3913
|
-
if (r$1.length = 65535 & u$1, l$1 = u$1 = 0, r$1.mode = 15, 6 === t$1) break e;
|
|
3914
|
-
case 15: r$1.mode = 16;
|
|
3915
|
-
case 16:
|
|
3916
|
-
if (d = r$1.length) {
|
|
3917
|
-
if (o$1 < d && (d = o$1), h$1 < d && (d = h$1), 0 === d) break e;
|
|
3918
|
-
I.arraySet(i$2, n$1, s$1, d, a$1), o$1 -= d, s$1 += d, h$1 -= d, a$1 += d, r$1.length -= d;
|
|
3919
|
-
break;
|
|
3920
|
-
}
|
|
3921
|
-
r$1.mode = 12;
|
|
3922
|
-
break;
|
|
3923
|
-
case 17:
|
|
3924
|
-
for (; l$1 < 14;) {
|
|
3925
|
-
if (0 === o$1) break e;
|
|
3926
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3927
|
-
}
|
|
3928
|
-
if (r$1.nlen = 257 + (31 & u$1), u$1 >>>= 5, l$1 -= 5, r$1.ndist = 1 + (31 & u$1), u$1 >>>= 5, l$1 -= 5, r$1.ncode = 4 + (15 & u$1), u$1 >>>= 4, l$1 -= 4, 286 < r$1.nlen || 30 < r$1.ndist) {
|
|
3929
|
-
e$1.msg = "too many length or distance symbols", r$1.mode = 30;
|
|
3930
|
-
break;
|
|
3931
|
-
}
|
|
3932
|
-
r$1.have = 0, r$1.mode = 18;
|
|
3933
|
-
case 18:
|
|
3934
|
-
for (; r$1.have < r$1.ncode;) {
|
|
3935
|
-
for (; l$1 < 3;) {
|
|
3936
|
-
if (0 === o$1) break e;
|
|
3937
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3938
|
-
}
|
|
3939
|
-
r$1.lens[A[r$1.have++]] = 7 & u$1, u$1 >>>= 3, l$1 -= 3;
|
|
3940
|
-
}
|
|
3941
|
-
for (; r$1.have < 19;) r$1.lens[A[r$1.have++]] = 0;
|
|
3942
|
-
if (r$1.lencode = r$1.lendyn, r$1.lenbits = 7, S = { bits: r$1.lenbits }, x = T(0, r$1.lens, 0, 19, r$1.lencode, 0, r$1.work, S), r$1.lenbits = S.bits, x) {
|
|
3943
|
-
e$1.msg = "invalid code lengths set", r$1.mode = 30;
|
|
3944
|
-
break;
|
|
3945
|
-
}
|
|
3946
|
-
r$1.have = 0, r$1.mode = 19;
|
|
3947
|
-
case 19:
|
|
3948
|
-
for (; r$1.have < r$1.nlen + r$1.ndist;) {
|
|
3949
|
-
for (; g = (C = r$1.lencode[u$1 & (1 << r$1.lenbits) - 1]) >>> 16 & 255, b = 65535 & C, !((_ = C >>> 24) <= l$1);) {
|
|
3950
|
-
if (0 === o$1) break e;
|
|
3951
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3952
|
-
}
|
|
3953
|
-
if (b < 16) u$1 >>>= _, l$1 -= _, r$1.lens[r$1.have++] = b;
|
|
3954
|
-
else {
|
|
3955
|
-
if (16 === b) {
|
|
3956
|
-
for (z = _ + 2; l$1 < z;) {
|
|
3957
|
-
if (0 === o$1) break e;
|
|
3958
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3959
|
-
}
|
|
3960
|
-
if (u$1 >>>= _, l$1 -= _, 0 === r$1.have) {
|
|
3961
|
-
e$1.msg = "invalid bit length repeat", r$1.mode = 30;
|
|
3962
|
-
break;
|
|
3963
|
-
}
|
|
3964
|
-
k = r$1.lens[r$1.have - 1], d = 3 + (3 & u$1), u$1 >>>= 2, l$1 -= 2;
|
|
3965
|
-
} else if (17 === b) {
|
|
3966
|
-
for (z = _ + 3; l$1 < z;) {
|
|
3967
|
-
if (0 === o$1) break e;
|
|
3968
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3969
|
-
}
|
|
3970
|
-
l$1 -= _, k = 0, d = 3 + (7 & (u$1 >>>= _)), u$1 >>>= 3, l$1 -= 3;
|
|
3971
|
-
} else {
|
|
3972
|
-
for (z = _ + 7; l$1 < z;) {
|
|
3973
|
-
if (0 === o$1) break e;
|
|
3974
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
3975
|
-
}
|
|
3976
|
-
l$1 -= _, k = 0, d = 11 + (127 & (u$1 >>>= _)), u$1 >>>= 7, l$1 -= 7;
|
|
3977
|
-
}
|
|
3978
|
-
if (r$1.have + d > r$1.nlen + r$1.ndist) {
|
|
3979
|
-
e$1.msg = "invalid bit length repeat", r$1.mode = 30;
|
|
3980
|
-
break;
|
|
3981
|
-
}
|
|
3982
|
-
for (; d--;) r$1.lens[r$1.have++] = k;
|
|
3983
|
-
}
|
|
3984
|
-
}
|
|
3985
|
-
if (30 === r$1.mode) break;
|
|
3986
|
-
if (0 === r$1.lens[256]) {
|
|
3987
|
-
e$1.msg = "invalid code -- missing end-of-block", r$1.mode = 30;
|
|
3988
|
-
break;
|
|
3989
|
-
}
|
|
3990
|
-
if (r$1.lenbits = 9, S = { bits: r$1.lenbits }, x = T(D, r$1.lens, 0, r$1.nlen, r$1.lencode, 0, r$1.work, S), r$1.lenbits = S.bits, x) {
|
|
3991
|
-
e$1.msg = "invalid literal/lengths set", r$1.mode = 30;
|
|
3992
|
-
break;
|
|
3993
|
-
}
|
|
3994
|
-
if (r$1.distbits = 6, r$1.distcode = r$1.distdyn, S = { bits: r$1.distbits }, x = T(F, r$1.lens, r$1.nlen, r$1.ndist, r$1.distcode, 0, r$1.work, S), r$1.distbits = S.bits, x) {
|
|
3995
|
-
e$1.msg = "invalid distances set", r$1.mode = 30;
|
|
3996
|
-
break;
|
|
3997
|
-
}
|
|
3998
|
-
if (r$1.mode = 20, 6 === t$1) break e;
|
|
3999
|
-
case 20: r$1.mode = 21;
|
|
4000
|
-
case 21:
|
|
4001
|
-
if (6 <= o$1 && 258 <= h$1) {
|
|
4002
|
-
e$1.next_out = a$1, e$1.avail_out = h$1, e$1.next_in = s$1, e$1.avail_in = o$1, r$1.hold = u$1, r$1.bits = l$1, R(e$1, c$1), a$1 = e$1.next_out, i$2 = e$1.output, h$1 = e$1.avail_out, s$1 = e$1.next_in, n$1 = e$1.input, o$1 = e$1.avail_in, u$1 = r$1.hold, l$1 = r$1.bits, 12 === r$1.mode && (r$1.back = -1);
|
|
4003
|
-
break;
|
|
4004
|
-
}
|
|
4005
|
-
for (r$1.back = 0; g = (C = r$1.lencode[u$1 & (1 << r$1.lenbits) - 1]) >>> 16 & 255, b = 65535 & C, !((_ = C >>> 24) <= l$1);) {
|
|
4006
|
-
if (0 === o$1) break e;
|
|
4007
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
4008
|
-
}
|
|
4009
|
-
if (g && 0 == (240 & g)) {
|
|
4010
|
-
for (v = _, y = g, w = b; g = (C = r$1.lencode[w + ((u$1 & (1 << v + y) - 1) >> v)]) >>> 16 & 255, b = 65535 & C, !(v + (_ = C >>> 24) <= l$1);) {
|
|
4011
|
-
if (0 === o$1) break e;
|
|
4012
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
4013
|
-
}
|
|
4014
|
-
u$1 >>>= v, l$1 -= v, r$1.back += v;
|
|
4015
|
-
}
|
|
4016
|
-
if (u$1 >>>= _, l$1 -= _, r$1.back += _, r$1.length = b, 0 === g) {
|
|
4017
|
-
r$1.mode = 26;
|
|
4018
|
-
break;
|
|
4019
|
-
}
|
|
4020
|
-
if (32 & g) {
|
|
4021
|
-
r$1.back = -1, r$1.mode = 12;
|
|
4022
|
-
break;
|
|
4023
|
-
}
|
|
4024
|
-
if (64 & g) {
|
|
4025
|
-
e$1.msg = "invalid literal/length code", r$1.mode = 30;
|
|
4026
|
-
break;
|
|
4027
|
-
}
|
|
4028
|
-
r$1.extra = 15 & g, r$1.mode = 22;
|
|
4029
|
-
case 22:
|
|
4030
|
-
if (r$1.extra) {
|
|
4031
|
-
for (z = r$1.extra; l$1 < z;) {
|
|
4032
|
-
if (0 === o$1) break e;
|
|
4033
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
4034
|
-
}
|
|
4035
|
-
r$1.length += u$1 & (1 << r$1.extra) - 1, u$1 >>>= r$1.extra, l$1 -= r$1.extra, r$1.back += r$1.extra;
|
|
4036
|
-
}
|
|
4037
|
-
r$1.was = r$1.length, r$1.mode = 23;
|
|
4038
|
-
case 23:
|
|
4039
|
-
for (; g = (C = r$1.distcode[u$1 & (1 << r$1.distbits) - 1]) >>> 16 & 255, b = 65535 & C, !((_ = C >>> 24) <= l$1);) {
|
|
4040
|
-
if (0 === o$1) break e;
|
|
4041
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
4042
|
-
}
|
|
4043
|
-
if (0 == (240 & g)) {
|
|
4044
|
-
for (v = _, y = g, w = b; g = (C = r$1.distcode[w + ((u$1 & (1 << v + y) - 1) >> v)]) >>> 16 & 255, b = 65535 & C, !(v + (_ = C >>> 24) <= l$1);) {
|
|
4045
|
-
if (0 === o$1) break e;
|
|
4046
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
4047
|
-
}
|
|
4048
|
-
u$1 >>>= v, l$1 -= v, r$1.back += v;
|
|
4049
|
-
}
|
|
4050
|
-
if (u$1 >>>= _, l$1 -= _, r$1.back += _, 64 & g) {
|
|
4051
|
-
e$1.msg = "invalid distance code", r$1.mode = 30;
|
|
4052
|
-
break;
|
|
4053
|
-
}
|
|
4054
|
-
r$1.offset = b, r$1.extra = 15 & g, r$1.mode = 24;
|
|
4055
|
-
case 24:
|
|
4056
|
-
if (r$1.extra) {
|
|
4057
|
-
for (z = r$1.extra; l$1 < z;) {
|
|
4058
|
-
if (0 === o$1) break e;
|
|
4059
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
4060
|
-
}
|
|
4061
|
-
r$1.offset += u$1 & (1 << r$1.extra) - 1, u$1 >>>= r$1.extra, l$1 -= r$1.extra, r$1.back += r$1.extra;
|
|
4062
|
-
}
|
|
4063
|
-
if (r$1.offset > r$1.dmax) {
|
|
4064
|
-
e$1.msg = "invalid distance too far back", r$1.mode = 30;
|
|
4065
|
-
break;
|
|
4066
|
-
}
|
|
4067
|
-
r$1.mode = 25;
|
|
4068
|
-
case 25:
|
|
4069
|
-
if (0 === h$1) break e;
|
|
4070
|
-
if (d = c$1 - h$1, r$1.offset > d) {
|
|
4071
|
-
if ((d = r$1.offset - d) > r$1.whave && r$1.sane) {
|
|
4072
|
-
e$1.msg = "invalid distance too far back", r$1.mode = 30;
|
|
4073
|
-
break;
|
|
4074
|
-
}
|
|
4075
|
-
p = d > r$1.wnext ? (d -= r$1.wnext, r$1.wsize - d) : r$1.wnext - d, d > r$1.length && (d = r$1.length), m = r$1.window;
|
|
4076
|
-
} else m = i$2, p = a$1 - r$1.offset, d = r$1.length;
|
|
4077
|
-
for (h$1 < d && (d = h$1), h$1 -= d, r$1.length -= d; i$2[a$1++] = m[p++], --d;);
|
|
4078
|
-
0 === r$1.length && (r$1.mode = 21);
|
|
4079
|
-
break;
|
|
4080
|
-
case 26:
|
|
4081
|
-
if (0 === h$1) break e;
|
|
4082
|
-
i$2[a$1++] = r$1.length, h$1--, r$1.mode = 21;
|
|
4083
|
-
break;
|
|
4084
|
-
case 27:
|
|
4085
|
-
if (r$1.wrap) {
|
|
4086
|
-
for (; l$1 < 32;) {
|
|
4087
|
-
if (0 === o$1) break e;
|
|
4088
|
-
o$1--, u$1 |= n$1[s$1++] << l$1, l$1 += 8;
|
|
4089
|
-
}
|
|
4090
|
-
if (c$1 -= h$1, e$1.total_out += c$1, r$1.total += c$1, c$1 && (e$1.adler = r$1.check = r$1.flags ? B(r$1.check, i$2, c$1, a$1 - c$1) : O(r$1.check, i$2, c$1, a$1 - c$1)), c$1 = h$1, (r$1.flags ? u$1 : L(u$1)) !== r$1.check) {
|
|
4091
|
-
e$1.msg = "incorrect data check", r$1.mode = 30;
|
|
4092
|
-
break;
|
|
4093
|
-
}
|
|
4094
|
-
l$1 = u$1 = 0;
|
|
4095
|
-
}
|
|
4096
|
-
r$1.mode = 28;
|
|
4097
|
-
case 28:
|
|
4098
|
-
if (r$1.wrap && r$1.flags) {
|
|
4099
|
-
for (; l$1 < 32;) {
|
|
4100
|
-
if (0 === o$1) break e;
|
|
4101
|
-
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
|
4102
|
-
}
|
|
4103
|
-
if (u$1 !== (4294967295 & r$1.total)) {
|
|
4104
|
-
e$1.msg = "incorrect length check", r$1.mode = 30;
|
|
4105
|
-
break;
|
|
4106
|
-
}
|
|
4107
|
-
l$1 = u$1 = 0;
|
|
4108
|
-
}
|
|
4109
|
-
r$1.mode = 29;
|
|
4110
|
-
case 29:
|
|
4111
|
-
x = 1;
|
|
4112
|
-
break e;
|
|
4113
|
-
case 30:
|
|
4114
|
-
x = -3;
|
|
4115
|
-
break e;
|
|
4116
|
-
case 31: return -4;
|
|
4117
|
-
case 32:
|
|
4118
|
-
default: return U;
|
|
4119
|
-
}
|
|
4120
|
-
return e$1.next_out = a$1, e$1.avail_out = h$1, e$1.next_in = s$1, e$1.avail_in = o$1, r$1.hold = u$1, r$1.bits = l$1, (r$1.wsize || c$1 !== e$1.avail_out && r$1.mode < 30 && (r$1.mode < 27 || 4 !== t$1)) && Z(e$1, e$1.output, e$1.next_out, c$1 - e$1.avail_out) ? (r$1.mode = 31, -4) : (f$1 -= e$1.avail_in, c$1 -= e$1.avail_out, e$1.total_in += f$1, e$1.total_out += c$1, r$1.total += c$1, r$1.wrap && c$1 && (e$1.adler = r$1.check = r$1.flags ? B(r$1.check, i$2, c$1, e$1.next_out - c$1) : O(r$1.check, i$2, c$1, e$1.next_out - c$1)), e$1.data_type = r$1.bits + (r$1.last ? 64 : 0) + (12 === r$1.mode ? 128 : 0) + (20 === r$1.mode || 15 === r$1.mode ? 256 : 0), (0 == f$1 && 0 === c$1 || 4 === t$1) && x === N && (x = -5), x);
|
|
4121
|
-
}, r.inflateEnd = function(e$1) {
|
|
4122
|
-
if (!e$1 || !e$1.state) return U;
|
|
4123
|
-
var t$1 = e$1.state;
|
|
4124
|
-
return t$1.window && (t$1.window = null), e$1.state = null, N;
|
|
4125
|
-
}, r.inflateGetHeader = function(e$1, t$1) {
|
|
4126
|
-
var r$1;
|
|
4127
|
-
return e$1 && e$1.state ? 0 == (2 & (r$1 = e$1.state).wrap) ? U : ((r$1.head = t$1).done = !1, N) : U;
|
|
4128
|
-
}, r.inflateSetDictionary = function(e$1, t$1) {
|
|
4129
|
-
var r$1, n$1 = t$1.length;
|
|
4130
|
-
return e$1 && e$1.state ? 0 !== (r$1 = e$1.state).wrap && 11 !== r$1.mode ? U : 11 === r$1.mode && O(1, t$1, n$1, 0) !== r$1.check ? -3 : Z(e$1, t$1, n$1, n$1) ? (r$1.mode = 31, -4) : (r$1.havedict = 1, N) : U;
|
|
4131
|
-
}, r.inflateInfo = "pako inflate (from Nodeca project)";
|
|
4132
|
-
}, {
|
|
4133
|
-
"../utils/common": 41,
|
|
4134
|
-
"./adler32": 43,
|
|
4135
|
-
"./crc32": 45,
|
|
4136
|
-
"./inffast": 48,
|
|
4137
|
-
"./inftrees": 50
|
|
4138
|
-
}],
|
|
4139
|
-
50: [function(e, t, r) {
|
|
4140
|
-
"use strict";
|
|
4141
|
-
var D = e("../utils/common"), F = [
|
|
4142
|
-
3,
|
|
4143
|
-
4,
|
|
4144
|
-
5,
|
|
4145
|
-
6,
|
|
4146
|
-
7,
|
|
4147
|
-
8,
|
|
4148
|
-
9,
|
|
4149
|
-
10,
|
|
4150
|
-
11,
|
|
4151
|
-
13,
|
|
4152
|
-
15,
|
|
4153
|
-
17,
|
|
4154
|
-
19,
|
|
4155
|
-
23,
|
|
4156
|
-
27,
|
|
4157
|
-
31,
|
|
4158
|
-
35,
|
|
4159
|
-
43,
|
|
4160
|
-
51,
|
|
4161
|
-
59,
|
|
4162
|
-
67,
|
|
4163
|
-
83,
|
|
4164
|
-
99,
|
|
4165
|
-
115,
|
|
4166
|
-
131,
|
|
4167
|
-
163,
|
|
4168
|
-
195,
|
|
4169
|
-
227,
|
|
4170
|
-
258,
|
|
4171
|
-
0,
|
|
4172
|
-
0
|
|
4173
|
-
], N = [
|
|
4174
|
-
16,
|
|
4175
|
-
16,
|
|
4176
|
-
16,
|
|
4177
|
-
16,
|
|
4178
|
-
16,
|
|
4179
|
-
16,
|
|
4180
|
-
16,
|
|
4181
|
-
16,
|
|
4182
|
-
17,
|
|
4183
|
-
17,
|
|
4184
|
-
17,
|
|
4185
|
-
17,
|
|
4186
|
-
18,
|
|
4187
|
-
18,
|
|
4188
|
-
18,
|
|
4189
|
-
18,
|
|
4190
|
-
19,
|
|
4191
|
-
19,
|
|
4192
|
-
19,
|
|
4193
|
-
19,
|
|
4194
|
-
20,
|
|
4195
|
-
20,
|
|
4196
|
-
20,
|
|
4197
|
-
20,
|
|
4198
|
-
21,
|
|
4199
|
-
21,
|
|
4200
|
-
21,
|
|
4201
|
-
21,
|
|
4202
|
-
16,
|
|
4203
|
-
72,
|
|
4204
|
-
78
|
|
4205
|
-
], U = [
|
|
4206
|
-
1,
|
|
4207
|
-
2,
|
|
4208
|
-
3,
|
|
4209
|
-
4,
|
|
4210
|
-
5,
|
|
4211
|
-
7,
|
|
4212
|
-
9,
|
|
4213
|
-
13,
|
|
4214
|
-
17,
|
|
4215
|
-
25,
|
|
4216
|
-
33,
|
|
4217
|
-
49,
|
|
4218
|
-
65,
|
|
4219
|
-
97,
|
|
4220
|
-
129,
|
|
4221
|
-
193,
|
|
4222
|
-
257,
|
|
4223
|
-
385,
|
|
4224
|
-
513,
|
|
4225
|
-
769,
|
|
4226
|
-
1025,
|
|
4227
|
-
1537,
|
|
4228
|
-
2049,
|
|
4229
|
-
3073,
|
|
4230
|
-
4097,
|
|
4231
|
-
6145,
|
|
4232
|
-
8193,
|
|
4233
|
-
12289,
|
|
4234
|
-
16385,
|
|
4235
|
-
24577,
|
|
4236
|
-
0,
|
|
4237
|
-
0
|
|
4238
|
-
], P = [
|
|
4239
|
-
16,
|
|
4240
|
-
16,
|
|
4241
|
-
16,
|
|
4242
|
-
16,
|
|
4243
|
-
17,
|
|
4244
|
-
17,
|
|
4245
|
-
18,
|
|
4246
|
-
18,
|
|
4247
|
-
19,
|
|
4248
|
-
19,
|
|
4249
|
-
20,
|
|
4250
|
-
20,
|
|
4251
|
-
21,
|
|
4252
|
-
21,
|
|
4253
|
-
22,
|
|
4254
|
-
22,
|
|
4255
|
-
23,
|
|
4256
|
-
23,
|
|
4257
|
-
24,
|
|
4258
|
-
24,
|
|
4259
|
-
25,
|
|
4260
|
-
25,
|
|
4261
|
-
26,
|
|
4262
|
-
26,
|
|
4263
|
-
27,
|
|
4264
|
-
27,
|
|
4265
|
-
28,
|
|
4266
|
-
28,
|
|
4267
|
-
29,
|
|
4268
|
-
29,
|
|
4269
|
-
64,
|
|
4270
|
-
64
|
|
4271
|
-
];
|
|
4272
|
-
t.exports = function(e$1, t$1, r$1, n, i$1, s, a, o) {
|
|
4273
|
-
var h, u, l, f, c, d, p, m, _, g = o.bits, b = 0, v = 0, y = 0, w = 0, k = 0, x = 0, S = 0, z = 0, C = 0, E = 0, A = null, I = 0, O = new D.Buf16(16), B = new D.Buf16(16), R = null, T = 0;
|
|
4274
|
-
for (b = 0; b <= 15; b++) O[b] = 0;
|
|
4275
|
-
for (v = 0; v < n; v++) O[t$1[r$1 + v]]++;
|
|
4276
|
-
for (k = g, w = 15; 1 <= w && 0 === O[w]; w--);
|
|
4277
|
-
if (w < k && (k = w), 0 === w) return i$1[s++] = 20971520, i$1[s++] = 20971520, o.bits = 1, 0;
|
|
4278
|
-
for (y = 1; y < w && 0 === O[y]; y++);
|
|
4279
|
-
for (k < y && (k = y), b = z = 1; b <= 15; b++) if (z <<= 1, (z -= O[b]) < 0) return -1;
|
|
4280
|
-
if (0 < z && (0 === e$1 || 1 !== w)) return -1;
|
|
4281
|
-
for (B[1] = 0, b = 1; b < 15; b++) B[b + 1] = B[b] + O[b];
|
|
4282
|
-
for (v = 0; v < n; v++) 0 !== t$1[r$1 + v] && (a[B[t$1[r$1 + v]]++] = v);
|
|
4283
|
-
if (d = 0 === e$1 ? (A = R = a, 19) : 1 === e$1 ? (A = F, I -= 257, R = N, T -= 257, 256) : (A = U, R = P, -1), b = y, c = s, S = v = E = 0, l = -1, f = (C = 1 << (x = k)) - 1, 1 === e$1 && 852 < C || 2 === e$1 && 592 < C) return 1;
|
|
4284
|
-
for (;;) {
|
|
4285
|
-
for (p = b - S, _ = a[v] < d ? (m = 0, a[v]) : a[v] > d ? (m = R[T + a[v]], A[I + a[v]]) : (m = 96, 0), h = 1 << b - S, y = u = 1 << x; i$1[c + (E >> S) + (u -= h)] = p << 24 | m << 16 | _ | 0, 0 !== u;);
|
|
4286
|
-
for (h = 1 << b - 1; E & h;) h >>= 1;
|
|
4287
|
-
if (0 !== h ? (E &= h - 1, E += h) : E = 0, v++, 0 == --O[b]) {
|
|
4288
|
-
if (b === w) break;
|
|
4289
|
-
b = t$1[r$1 + a[v]];
|
|
4290
|
-
}
|
|
4291
|
-
if (k < b && (E & f) !== l) {
|
|
4292
|
-
for (0 === S && (S = k), c += y, z = 1 << (x = b - S); x + S < w && !((z -= O[x + S]) <= 0);) x++, z <<= 1;
|
|
4293
|
-
if (C += 1 << x, 1 === e$1 && 852 < C || 2 === e$1 && 592 < C) return 1;
|
|
4294
|
-
i$1[l = E & f] = k << 24 | x << 16 | c - s | 0;
|
|
4295
|
-
}
|
|
4296
|
-
}
|
|
4297
|
-
return 0 !== E && (i$1[c + E] = b - S << 24 | 4194304), o.bits = k, 0;
|
|
4298
|
-
};
|
|
4299
|
-
}, { "../utils/common": 41 }],
|
|
4300
|
-
51: [function(e, t, r) {
|
|
4301
|
-
"use strict";
|
|
4302
|
-
t.exports = {
|
|
4303
|
-
2: "need dictionary",
|
|
4304
|
-
1: "stream end",
|
|
4305
|
-
0: "",
|
|
4306
|
-
"-1": "file error",
|
|
4307
|
-
"-2": "stream error",
|
|
4308
|
-
"-3": "data error",
|
|
4309
|
-
"-4": "insufficient memory",
|
|
4310
|
-
"-5": "buffer error",
|
|
4311
|
-
"-6": "incompatible version"
|
|
4312
|
-
};
|
|
4313
|
-
}, {}],
|
|
4314
|
-
52: [function(e, t, r) {
|
|
4315
|
-
"use strict";
|
|
4316
|
-
var i$1 = e("../utils/common"), o = 0, h = 1;
|
|
4317
|
-
function n(e$1) {
|
|
4318
|
-
for (var t$1 = e$1.length; 0 <= --t$1;) e$1[t$1] = 0;
|
|
4319
|
-
}
|
|
4320
|
-
var s = 0, a = 29, u = 256, l = u + 1 + a, f = 30, c = 19, _ = 2 * l + 1, g = 15, d = 16, p = 7, m = 256, b = 16, v = 17, y = 18, w = [
|
|
4321
|
-
0,
|
|
4322
|
-
0,
|
|
4323
|
-
0,
|
|
4324
|
-
0,
|
|
4325
|
-
0,
|
|
4326
|
-
0,
|
|
4327
|
-
0,
|
|
4328
|
-
0,
|
|
4329
|
-
1,
|
|
4330
|
-
1,
|
|
4331
|
-
1,
|
|
4332
|
-
1,
|
|
4333
|
-
2,
|
|
4334
|
-
2,
|
|
4335
|
-
2,
|
|
4336
|
-
2,
|
|
4337
|
-
3,
|
|
4338
|
-
3,
|
|
4339
|
-
3,
|
|
4340
|
-
3,
|
|
4341
|
-
4,
|
|
4342
|
-
4,
|
|
4343
|
-
4,
|
|
4344
|
-
4,
|
|
4345
|
-
5,
|
|
4346
|
-
5,
|
|
4347
|
-
5,
|
|
4348
|
-
5,
|
|
4349
|
-
0
|
|
4350
|
-
], k = [
|
|
4351
|
-
0,
|
|
4352
|
-
0,
|
|
4353
|
-
0,
|
|
4354
|
-
0,
|
|
4355
|
-
1,
|
|
4356
|
-
1,
|
|
4357
|
-
2,
|
|
4358
|
-
2,
|
|
4359
|
-
3,
|
|
4360
|
-
3,
|
|
4361
|
-
4,
|
|
4362
|
-
4,
|
|
4363
|
-
5,
|
|
4364
|
-
5,
|
|
4365
|
-
6,
|
|
4366
|
-
6,
|
|
4367
|
-
7,
|
|
4368
|
-
7,
|
|
4369
|
-
8,
|
|
4370
|
-
8,
|
|
4371
|
-
9,
|
|
4372
|
-
9,
|
|
4373
|
-
10,
|
|
4374
|
-
10,
|
|
4375
|
-
11,
|
|
4376
|
-
11,
|
|
4377
|
-
12,
|
|
4378
|
-
12,
|
|
4379
|
-
13,
|
|
4380
|
-
13
|
|
4381
|
-
], x = [
|
|
4382
|
-
0,
|
|
4383
|
-
0,
|
|
4384
|
-
0,
|
|
4385
|
-
0,
|
|
4386
|
-
0,
|
|
4387
|
-
0,
|
|
4388
|
-
0,
|
|
4389
|
-
0,
|
|
4390
|
-
0,
|
|
4391
|
-
0,
|
|
4392
|
-
0,
|
|
4393
|
-
0,
|
|
4394
|
-
0,
|
|
4395
|
-
0,
|
|
4396
|
-
0,
|
|
4397
|
-
0,
|
|
4398
|
-
2,
|
|
4399
|
-
3,
|
|
4400
|
-
7
|
|
4401
|
-
], S = [
|
|
4402
|
-
16,
|
|
4403
|
-
17,
|
|
4404
|
-
18,
|
|
4405
|
-
0,
|
|
4406
|
-
8,
|
|
4407
|
-
7,
|
|
4408
|
-
9,
|
|
4409
|
-
6,
|
|
4410
|
-
10,
|
|
4411
|
-
5,
|
|
4412
|
-
11,
|
|
4413
|
-
4,
|
|
4414
|
-
12,
|
|
4415
|
-
3,
|
|
4416
|
-
13,
|
|
4417
|
-
2,
|
|
4418
|
-
14,
|
|
4419
|
-
1,
|
|
4420
|
-
15
|
|
4421
|
-
], z = new Array(2 * (l + 2));
|
|
4422
|
-
n(z);
|
|
4423
|
-
var C = new Array(2 * f);
|
|
4424
|
-
n(C);
|
|
4425
|
-
var E = new Array(512);
|
|
4426
|
-
n(E);
|
|
4427
|
-
var A = new Array(256);
|
|
4428
|
-
n(A);
|
|
4429
|
-
var I = new Array(a);
|
|
4430
|
-
n(I);
|
|
4431
|
-
var O, B, R, T = new Array(f);
|
|
4432
|
-
function D(e$1, t$1, r$1, n$1, i$2) {
|
|
4433
|
-
this.static_tree = e$1, this.extra_bits = t$1, this.extra_base = r$1, this.elems = n$1, this.max_length = i$2, this.has_stree = e$1 && e$1.length;
|
|
4434
|
-
}
|
|
4435
|
-
function F(e$1, t$1) {
|
|
4436
|
-
this.dyn_tree = e$1, this.max_code = 0, this.stat_desc = t$1;
|
|
4437
|
-
}
|
|
4438
|
-
function N(e$1) {
|
|
4439
|
-
return e$1 < 256 ? E[e$1] : E[256 + (e$1 >>> 7)];
|
|
4440
|
-
}
|
|
4441
|
-
function U(e$1, t$1) {
|
|
4442
|
-
e$1.pending_buf[e$1.pending++] = 255 & t$1, e$1.pending_buf[e$1.pending++] = t$1 >>> 8 & 255;
|
|
4443
|
-
}
|
|
4444
|
-
function P(e$1, t$1, r$1) {
|
|
4445
|
-
e$1.bi_valid > d - r$1 ? (e$1.bi_buf |= t$1 << e$1.bi_valid & 65535, U(e$1, e$1.bi_buf), e$1.bi_buf = t$1 >> d - e$1.bi_valid, e$1.bi_valid += r$1 - d) : (e$1.bi_buf |= t$1 << e$1.bi_valid & 65535, e$1.bi_valid += r$1);
|
|
4446
|
-
}
|
|
4447
|
-
function L(e$1, t$1, r$1) {
|
|
4448
|
-
P(e$1, r$1[2 * t$1], r$1[2 * t$1 + 1]);
|
|
4449
|
-
}
|
|
4450
|
-
function j(e$1, t$1) {
|
|
4451
|
-
for (var r$1 = 0; r$1 |= 1 & e$1, e$1 >>>= 1, r$1 <<= 1, 0 < --t$1;);
|
|
4452
|
-
return r$1 >>> 1;
|
|
4453
|
-
}
|
|
4454
|
-
function Z(e$1, t$1, r$1) {
|
|
4455
|
-
var n$1, i$2, s$1 = new Array(g + 1), a$1 = 0;
|
|
4456
|
-
for (n$1 = 1; n$1 <= g; n$1++) s$1[n$1] = a$1 = a$1 + r$1[n$1 - 1] << 1;
|
|
4457
|
-
for (i$2 = 0; i$2 <= t$1; i$2++) {
|
|
4458
|
-
var o$1 = e$1[2 * i$2 + 1];
|
|
4459
|
-
0 !== o$1 && (e$1[2 * i$2] = j(s$1[o$1]++, o$1));
|
|
4460
|
-
}
|
|
4461
|
-
}
|
|
4462
|
-
function W(e$1) {
|
|
4463
|
-
var t$1;
|
|
4464
|
-
for (t$1 = 0; t$1 < l; t$1++) e$1.dyn_ltree[2 * t$1] = 0;
|
|
4465
|
-
for (t$1 = 0; t$1 < f; t$1++) e$1.dyn_dtree[2 * t$1] = 0;
|
|
4466
|
-
for (t$1 = 0; t$1 < c; t$1++) e$1.bl_tree[2 * t$1] = 0;
|
|
4467
|
-
e$1.dyn_ltree[2 * m] = 1, e$1.opt_len = e$1.static_len = 0, e$1.last_lit = e$1.matches = 0;
|
|
4468
|
-
}
|
|
4469
|
-
function M(e$1) {
|
|
4470
|
-
8 < e$1.bi_valid ? U(e$1, e$1.bi_buf) : 0 < e$1.bi_valid && (e$1.pending_buf[e$1.pending++] = e$1.bi_buf), e$1.bi_buf = 0, e$1.bi_valid = 0;
|
|
4471
|
-
}
|
|
4472
|
-
function H(e$1, t$1, r$1, n$1) {
|
|
4473
|
-
var i$2 = 2 * t$1, s$1 = 2 * r$1;
|
|
4474
|
-
return e$1[i$2] < e$1[s$1] || e$1[i$2] === e$1[s$1] && n$1[t$1] <= n$1[r$1];
|
|
4475
|
-
}
|
|
4476
|
-
function G(e$1, t$1, r$1) {
|
|
4477
|
-
for (var n$1 = e$1.heap[r$1], i$2 = r$1 << 1; i$2 <= e$1.heap_len && (i$2 < e$1.heap_len && H(t$1, e$1.heap[i$2 + 1], e$1.heap[i$2], e$1.depth) && i$2++, !H(t$1, n$1, e$1.heap[i$2], e$1.depth));) e$1.heap[r$1] = e$1.heap[i$2], r$1 = i$2, i$2 <<= 1;
|
|
4478
|
-
e$1.heap[r$1] = n$1;
|
|
4479
|
-
}
|
|
4480
|
-
function K(e$1, t$1, r$1) {
|
|
4481
|
-
var n$1, i$2, s$1, a$1, o$1 = 0;
|
|
4482
|
-
if (0 !== e$1.last_lit) for (; n$1 = e$1.pending_buf[e$1.d_buf + 2 * o$1] << 8 | e$1.pending_buf[e$1.d_buf + 2 * o$1 + 1], i$2 = e$1.pending_buf[e$1.l_buf + o$1], o$1++, 0 === n$1 ? L(e$1, i$2, t$1) : (L(e$1, (s$1 = A[i$2]) + u + 1, t$1), 0 !== (a$1 = w[s$1]) && P(e$1, i$2 -= I[s$1], a$1), L(e$1, s$1 = N(--n$1), r$1), 0 !== (a$1 = k[s$1]) && P(e$1, n$1 -= T[s$1], a$1)), o$1 < e$1.last_lit;);
|
|
4483
|
-
L(e$1, m, t$1);
|
|
4484
|
-
}
|
|
4485
|
-
function Y(e$1, t$1) {
|
|
4486
|
-
var r$1, n$1, i$2, s$1 = t$1.dyn_tree, a$1 = t$1.stat_desc.static_tree, o$1 = t$1.stat_desc.has_stree, h$1 = t$1.stat_desc.elems, u$1 = -1;
|
|
4487
|
-
for (e$1.heap_len = 0, e$1.heap_max = _, r$1 = 0; r$1 < h$1; r$1++) 0 !== s$1[2 * r$1] ? (e$1.heap[++e$1.heap_len] = u$1 = r$1, e$1.depth[r$1] = 0) : s$1[2 * r$1 + 1] = 0;
|
|
4488
|
-
for (; e$1.heap_len < 2;) s$1[2 * (i$2 = e$1.heap[++e$1.heap_len] = u$1 < 2 ? ++u$1 : 0)] = 1, e$1.depth[i$2] = 0, e$1.opt_len--, o$1 && (e$1.static_len -= a$1[2 * i$2 + 1]);
|
|
4489
|
-
for (t$1.max_code = u$1, r$1 = e$1.heap_len >> 1; 1 <= r$1; r$1--) G(e$1, s$1, r$1);
|
|
4490
|
-
for (i$2 = h$1; r$1 = e$1.heap[1], e$1.heap[1] = e$1.heap[e$1.heap_len--], G(e$1, s$1, 1), n$1 = e$1.heap[1], e$1.heap[--e$1.heap_max] = r$1, e$1.heap[--e$1.heap_max] = n$1, s$1[2 * i$2] = s$1[2 * r$1] + s$1[2 * n$1], e$1.depth[i$2] = (e$1.depth[r$1] >= e$1.depth[n$1] ? e$1.depth[r$1] : e$1.depth[n$1]) + 1, s$1[2 * r$1 + 1] = s$1[2 * n$1 + 1] = i$2, e$1.heap[1] = i$2++, G(e$1, s$1, 1), 2 <= e$1.heap_len;);
|
|
4491
|
-
e$1.heap[--e$1.heap_max] = e$1.heap[1], function(e$2, t$2) {
|
|
4492
|
-
var r$2, n$2, i$3, s$2, a$2, o$2, h$2 = t$2.dyn_tree, u$2 = t$2.max_code, l$1 = t$2.stat_desc.static_tree, f$1 = t$2.stat_desc.has_stree, c$1 = t$2.stat_desc.extra_bits, d$1 = t$2.stat_desc.extra_base, p$1 = t$2.stat_desc.max_length, m$1 = 0;
|
|
4493
|
-
for (s$2 = 0; s$2 <= g; s$2++) e$2.bl_count[s$2] = 0;
|
|
4494
|
-
for (h$2[2 * e$2.heap[e$2.heap_max] + 1] = 0, r$2 = e$2.heap_max + 1; r$2 < _; r$2++) p$1 < (s$2 = h$2[2 * h$2[2 * (n$2 = e$2.heap[r$2]) + 1] + 1] + 1) && (s$2 = p$1, m$1++), h$2[2 * n$2 + 1] = s$2, u$2 < n$2 || (e$2.bl_count[s$2]++, a$2 = 0, d$1 <= n$2 && (a$2 = c$1[n$2 - d$1]), o$2 = h$2[2 * n$2], e$2.opt_len += o$2 * (s$2 + a$2), f$1 && (e$2.static_len += o$2 * (l$1[2 * n$2 + 1] + a$2)));
|
|
4495
|
-
if (0 !== m$1) {
|
|
4496
|
-
do {
|
|
4497
|
-
for (s$2 = p$1 - 1; 0 === e$2.bl_count[s$2];) s$2--;
|
|
4498
|
-
e$2.bl_count[s$2]--, e$2.bl_count[s$2 + 1] += 2, e$2.bl_count[p$1]--, m$1 -= 2;
|
|
4499
|
-
} while (0 < m$1);
|
|
4500
|
-
for (s$2 = p$1; 0 !== s$2; s$2--) for (n$2 = e$2.bl_count[s$2]; 0 !== n$2;) u$2 < (i$3 = e$2.heap[--r$2]) || (h$2[2 * i$3 + 1] !== s$2 && (e$2.opt_len += (s$2 - h$2[2 * i$3 + 1]) * h$2[2 * i$3], h$2[2 * i$3 + 1] = s$2), n$2--);
|
|
4501
|
-
}
|
|
4502
|
-
}(e$1, t$1), Z(s$1, u$1, e$1.bl_count);
|
|
4503
|
-
}
|
|
4504
|
-
function X(e$1, t$1, r$1) {
|
|
4505
|
-
var n$1, i$2, s$1 = -1, a$1 = t$1[1], o$1 = 0, h$1 = 7, u$1 = 4;
|
|
4506
|
-
for (0 === a$1 && (h$1 = 138, u$1 = 3), t$1[2 * (r$1 + 1) + 1] = 65535, n$1 = 0; n$1 <= r$1; n$1++) i$2 = a$1, a$1 = t$1[2 * (n$1 + 1) + 1], ++o$1 < h$1 && i$2 === a$1 || (o$1 < u$1 ? e$1.bl_tree[2 * i$2] += o$1 : 0 !== i$2 ? (i$2 !== s$1 && e$1.bl_tree[2 * i$2]++, e$1.bl_tree[2 * b]++) : o$1 <= 10 ? e$1.bl_tree[2 * v]++ : e$1.bl_tree[2 * y]++, s$1 = i$2, u$1 = (o$1 = 0) === a$1 ? (h$1 = 138, 3) : i$2 === a$1 ? (h$1 = 6, 3) : (h$1 = 7, 4));
|
|
4507
|
-
}
|
|
4508
|
-
function V(e$1, t$1, r$1) {
|
|
4509
|
-
var n$1, i$2, s$1 = -1, a$1 = t$1[1], o$1 = 0, h$1 = 7, u$1 = 4;
|
|
4510
|
-
for (0 === a$1 && (h$1 = 138, u$1 = 3), n$1 = 0; n$1 <= r$1; n$1++) if (i$2 = a$1, a$1 = t$1[2 * (n$1 + 1) + 1], !(++o$1 < h$1 && i$2 === a$1)) {
|
|
4511
|
-
if (o$1 < u$1) for (; L(e$1, i$2, e$1.bl_tree), 0 != --o$1;);
|
|
4512
|
-
else 0 !== i$2 ? (i$2 !== s$1 && (L(e$1, i$2, e$1.bl_tree), o$1--), L(e$1, b, e$1.bl_tree), P(e$1, o$1 - 3, 2)) : o$1 <= 10 ? (L(e$1, v, e$1.bl_tree), P(e$1, o$1 - 3, 3)) : (L(e$1, y, e$1.bl_tree), P(e$1, o$1 - 11, 7));
|
|
4513
|
-
s$1 = i$2, u$1 = (o$1 = 0) === a$1 ? (h$1 = 138, 3) : i$2 === a$1 ? (h$1 = 6, 3) : (h$1 = 7, 4);
|
|
4514
|
-
}
|
|
4515
|
-
}
|
|
4516
|
-
n(T);
|
|
4517
|
-
var q = !1;
|
|
4518
|
-
function J(e$1, t$1, r$1, n$1) {
|
|
4519
|
-
P(e$1, (s << 1) + (n$1 ? 1 : 0), 3), function(e$2, t$2, r$2, n$2) {
|
|
4520
|
-
M(e$2), n$2 && (U(e$2, r$2), U(e$2, ~r$2)), i$1.arraySet(e$2.pending_buf, e$2.window, t$2, r$2, e$2.pending), e$2.pending += r$2;
|
|
4521
|
-
}(e$1, t$1, r$1, !0);
|
|
4522
|
-
}
|
|
4523
|
-
r._tr_init = function(e$1) {
|
|
4524
|
-
q || (function() {
|
|
4525
|
-
var e$2, t$1, r$1, n$1, i$2, s$1 = new Array(g + 1);
|
|
4526
|
-
for (n$1 = r$1 = 0; n$1 < a - 1; n$1++) for (I[n$1] = r$1, e$2 = 0; e$2 < 1 << w[n$1]; e$2++) A[r$1++] = n$1;
|
|
4527
|
-
for (A[r$1 - 1] = n$1, n$1 = i$2 = 0; n$1 < 16; n$1++) for (T[n$1] = i$2, e$2 = 0; e$2 < 1 << k[n$1]; e$2++) E[i$2++] = n$1;
|
|
4528
|
-
for (i$2 >>= 7; n$1 < f; n$1++) for (T[n$1] = i$2 << 7, e$2 = 0; e$2 < 1 << k[n$1] - 7; e$2++) E[256 + i$2++] = n$1;
|
|
4529
|
-
for (t$1 = 0; t$1 <= g; t$1++) s$1[t$1] = 0;
|
|
4530
|
-
for (e$2 = 0; e$2 <= 143;) z[2 * e$2 + 1] = 8, e$2++, s$1[8]++;
|
|
4531
|
-
for (; e$2 <= 255;) z[2 * e$2 + 1] = 9, e$2++, s$1[9]++;
|
|
4532
|
-
for (; e$2 <= 279;) z[2 * e$2 + 1] = 7, e$2++, s$1[7]++;
|
|
4533
|
-
for (; e$2 <= 287;) z[2 * e$2 + 1] = 8, e$2++, s$1[8]++;
|
|
4534
|
-
for (Z(z, l + 1, s$1), e$2 = 0; e$2 < f; e$2++) C[2 * e$2 + 1] = 5, C[2 * e$2] = j(e$2, 5);
|
|
4535
|
-
O = new D(z, w, u + 1, l, g), B = new D(C, k, 0, f, g), R = new D(new Array(0), x, 0, c, p);
|
|
4536
|
-
}(), q = !0), e$1.l_desc = new F(e$1.dyn_ltree, O), e$1.d_desc = new F(e$1.dyn_dtree, B), e$1.bl_desc = new F(e$1.bl_tree, R), e$1.bi_buf = 0, e$1.bi_valid = 0, W(e$1);
|
|
4537
|
-
}, r._tr_stored_block = J, r._tr_flush_block = function(e$1, t$1, r$1, n$1) {
|
|
4538
|
-
var i$2, s$1, a$1 = 0;
|
|
4539
|
-
0 < e$1.level ? (2 === e$1.strm.data_type && (e$1.strm.data_type = function(e$2) {
|
|
4540
|
-
var t$2, r$2 = 4093624447;
|
|
4541
|
-
for (t$2 = 0; t$2 <= 31; t$2++, r$2 >>>= 1) if (1 & r$2 && 0 !== e$2.dyn_ltree[2 * t$2]) return o;
|
|
4542
|
-
if (0 !== e$2.dyn_ltree[18] || 0 !== e$2.dyn_ltree[20] || 0 !== e$2.dyn_ltree[26]) return h;
|
|
4543
|
-
for (t$2 = 32; t$2 < u; t$2++) if (0 !== e$2.dyn_ltree[2 * t$2]) return h;
|
|
4544
|
-
return o;
|
|
4545
|
-
}(e$1)), Y(e$1, e$1.l_desc), Y(e$1, e$1.d_desc), a$1 = function(e$2) {
|
|
4546
|
-
var t$2;
|
|
4547
|
-
for (X(e$2, e$2.dyn_ltree, e$2.l_desc.max_code), X(e$2, e$2.dyn_dtree, e$2.d_desc.max_code), Y(e$2, e$2.bl_desc), t$2 = c - 1; 3 <= t$2 && 0 === e$2.bl_tree[2 * S[t$2] + 1]; t$2--);
|
|
4548
|
-
return e$2.opt_len += 3 * (t$2 + 1) + 5 + 5 + 4, t$2;
|
|
4549
|
-
}(e$1), i$2 = e$1.opt_len + 3 + 7 >>> 3, (s$1 = e$1.static_len + 3 + 7 >>> 3) <= i$2 && (i$2 = s$1)) : i$2 = s$1 = r$1 + 5, r$1 + 4 <= i$2 && -1 !== t$1 ? J(e$1, t$1, r$1, n$1) : 4 === e$1.strategy || s$1 === i$2 ? (P(e$1, 2 + (n$1 ? 1 : 0), 3), K(e$1, z, C)) : (P(e$1, 4 + (n$1 ? 1 : 0), 3), function(e$2, t$2, r$2, n$2) {
|
|
4550
|
-
var i$3;
|
|
4551
|
-
for (P(e$2, t$2 - 257, 5), P(e$2, r$2 - 1, 5), P(e$2, n$2 - 4, 4), i$3 = 0; i$3 < n$2; i$3++) P(e$2, e$2.bl_tree[2 * S[i$3] + 1], 3);
|
|
4552
|
-
V(e$2, e$2.dyn_ltree, t$2 - 1), V(e$2, e$2.dyn_dtree, r$2 - 1);
|
|
4553
|
-
}(e$1, e$1.l_desc.max_code + 1, e$1.d_desc.max_code + 1, a$1 + 1), K(e$1, e$1.dyn_ltree, e$1.dyn_dtree)), W(e$1), n$1 && M(e$1);
|
|
4554
|
-
}, r._tr_tally = function(e$1, t$1, r$1) {
|
|
4555
|
-
return e$1.pending_buf[e$1.d_buf + 2 * e$1.last_lit] = t$1 >>> 8 & 255, e$1.pending_buf[e$1.d_buf + 2 * e$1.last_lit + 1] = 255 & t$1, e$1.pending_buf[e$1.l_buf + e$1.last_lit] = 255 & r$1, e$1.last_lit++, 0 === t$1 ? e$1.dyn_ltree[2 * r$1]++ : (e$1.matches++, t$1--, e$1.dyn_ltree[2 * (A[r$1] + u + 1)]++, e$1.dyn_dtree[2 * N(t$1)]++), e$1.last_lit === e$1.lit_bufsize - 1;
|
|
4556
|
-
}, r._tr_align = function(e$1) {
|
|
4557
|
-
P(e$1, 2, 3), L(e$1, m, z), function(e$2) {
|
|
4558
|
-
16 === e$2.bi_valid ? (U(e$2, e$2.bi_buf), e$2.bi_buf = 0, e$2.bi_valid = 0) : 8 <= e$2.bi_valid && (e$2.pending_buf[e$2.pending++] = 255 & e$2.bi_buf, e$2.bi_buf >>= 8, e$2.bi_valid -= 8);
|
|
4559
|
-
}(e$1);
|
|
4560
|
-
};
|
|
4561
|
-
}, { "../utils/common": 41 }],
|
|
4562
|
-
53: [function(e, t, r) {
|
|
4563
|
-
"use strict";
|
|
4564
|
-
t.exports = function() {
|
|
4565
|
-
this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
|
|
4566
|
-
};
|
|
4567
|
-
}, {}],
|
|
4568
|
-
54: [function(e, t, r) {
|
|
4569
|
-
(function(e$1) {
|
|
4570
|
-
(function(r$1, n) {
|
|
4571
|
-
"use strict";
|
|
4572
|
-
if (!r$1.setImmediate) {
|
|
4573
|
-
var i$1, s, t$1, a, o = 1, h = {}, u = !1, l = r$1.document, e$2 = Object.getPrototypeOf && Object.getPrototypeOf(r$1);
|
|
4574
|
-
e$2 = e$2 && e$2.setTimeout ? e$2 : r$1, i$1 = "[object process]" === {}.toString.call(r$1.process) ? function(e$3) {
|
|
4575
|
-
process$1.nextTick(function() {
|
|
4576
|
-
c(e$3);
|
|
4577
|
-
});
|
|
4578
|
-
} : function() {
|
|
4579
|
-
if (r$1.postMessage && !r$1.importScripts) {
|
|
4580
|
-
var e$3 = !0, t$2 = r$1.onmessage;
|
|
4581
|
-
return r$1.onmessage = function() {
|
|
4582
|
-
e$3 = !1;
|
|
4583
|
-
}, r$1.postMessage("", "*"), r$1.onmessage = t$2, e$3;
|
|
4584
|
-
}
|
|
4585
|
-
}() ? (a = "setImmediate$" + Math.random() + "$", r$1.addEventListener ? r$1.addEventListener("message", d, !1) : r$1.attachEvent("onmessage", d), function(e$3) {
|
|
4586
|
-
r$1.postMessage(a + e$3, "*");
|
|
4587
|
-
}) : r$1.MessageChannel ? ((t$1 = new MessageChannel()).port1.onmessage = function(e$3) {
|
|
4588
|
-
c(e$3.data);
|
|
4589
|
-
}, function(e$3) {
|
|
4590
|
-
t$1.port2.postMessage(e$3);
|
|
4591
|
-
}) : l && "onreadystatechange" in l.createElement("script") ? (s = l.documentElement, function(e$3) {
|
|
4592
|
-
var t$2 = l.createElement("script");
|
|
4593
|
-
t$2.onreadystatechange = function() {
|
|
4594
|
-
c(e$3), t$2.onreadystatechange = null, s.removeChild(t$2), t$2 = null;
|
|
4595
|
-
}, s.appendChild(t$2);
|
|
4596
|
-
}) : function(e$3) {
|
|
4597
|
-
setTimeout(c, 0, e$3);
|
|
4598
|
-
}, e$2.setImmediate = function(e$3) {
|
|
4599
|
-
"function" != typeof e$3 && (e$3 = new Function("" + e$3));
|
|
4600
|
-
for (var t$2 = new Array(arguments.length - 1), r$2 = 0; r$2 < t$2.length; r$2++) t$2[r$2] = arguments[r$2 + 1];
|
|
4601
|
-
return h[o] = {
|
|
4602
|
-
callback: e$3,
|
|
4603
|
-
args: t$2
|
|
4604
|
-
}, i$1(o), o++;
|
|
4605
|
-
}, e$2.clearImmediate = f;
|
|
4606
|
-
}
|
|
4607
|
-
function f(e$3) {
|
|
4608
|
-
delete h[e$3];
|
|
4609
|
-
}
|
|
4610
|
-
function c(e$3) {
|
|
4611
|
-
if (u) setTimeout(c, 0, e$3);
|
|
4612
|
-
else {
|
|
4613
|
-
var t$2 = h[e$3];
|
|
4614
|
-
if (t$2) {
|
|
4615
|
-
u = !0;
|
|
4616
|
-
try {
|
|
4617
|
-
(function(e$4) {
|
|
4618
|
-
var t$3 = e$4.callback, r$2 = e$4.args;
|
|
4619
|
-
switch (r$2.length) {
|
|
4620
|
-
case 0:
|
|
4621
|
-
t$3();
|
|
4622
|
-
break;
|
|
4623
|
-
case 1:
|
|
4624
|
-
t$3(r$2[0]);
|
|
4625
|
-
break;
|
|
4626
|
-
case 2:
|
|
4627
|
-
t$3(r$2[0], r$2[1]);
|
|
4628
|
-
break;
|
|
4629
|
-
case 3:
|
|
4630
|
-
t$3(r$2[0], r$2[1], r$2[2]);
|
|
4631
|
-
break;
|
|
4632
|
-
default: t$3.apply(n, r$2);
|
|
4633
|
-
}
|
|
4634
|
-
})(t$2);
|
|
4635
|
-
} finally {
|
|
4636
|
-
f(e$3), u = !1;
|
|
4637
|
-
}
|
|
4638
|
-
}
|
|
4639
|
-
}
|
|
4640
|
-
}
|
|
4641
|
-
function d(e$3) {
|
|
4642
|
-
e$3.source === r$1 && "string" == typeof e$3.data && 0 === e$3.data.indexOf(a) && c(+e$3.data.slice(a.length));
|
|
4643
|
-
}
|
|
4644
|
-
})("undefined" == typeof self ? void 0 === e$1 ? this : e$1 : self);
|
|
4645
|
-
}).call(this, "undefined" != typeof global ? global : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {});
|
|
4646
|
-
}, {}]
|
|
4647
|
-
}, {}, [10])(10);
|
|
4648
|
-
});
|
|
4649
|
-
}));
|
|
4650
|
-
Object.defineProperty(exports, "Buffer", {
|
|
4651
|
-
enumerable: true,
|
|
4652
|
-
get: function() {
|
|
4653
|
-
return Buffer;
|
|
4654
|
-
}
|
|
4655
|
-
});
|
|
4656
|
-
Object.defineProperty(exports, "global", {
|
|
4657
|
-
enumerable: true,
|
|
4658
|
-
get: function() {
|
|
4659
|
-
return global;
|
|
4660
|
-
}
|
|
4661
|
-
});
|
|
4662
|
-
Object.defineProperty(exports, "init_dist", {
|
|
4663
|
-
enumerable: true,
|
|
4664
|
-
get: function() {
|
|
4665
|
-
return init_dist;
|
|
4666
|
-
}
|
|
4667
|
-
});
|
|
4668
|
-
Object.defineProperty(exports, "init_dist$1", {
|
|
4669
|
-
enumerable: true,
|
|
4670
|
-
get: function() {
|
|
4671
|
-
return init_dist$1;
|
|
4672
|
-
}
|
|
4673
|
-
});
|
|
4674
|
-
Object.defineProperty(exports, "init_dist$2", {
|
|
4675
|
-
enumerable: true,
|
|
4676
|
-
get: function() {
|
|
4677
|
-
return init_dist$2;
|
|
4678
|
-
}
|
|
4679
|
-
});
|
|
4680
|
-
Object.defineProperty(exports, "process$1", {
|
|
4681
|
-
enumerable: true,
|
|
4682
|
-
get: function() {
|
|
4683
|
-
return process$1;
|
|
4684
|
-
}
|
|
4685
|
-
});
|
|
4686
|
-
Object.defineProperty(exports, "require_jszip_min", {
|
|
4687
|
-
enumerable: true,
|
|
4688
|
-
get: function() {
|
|
4689
|
-
return require_jszip_min;
|
|
4690
|
-
}
|
|
4691
|
-
});
|