@tonyclaw/agent-inspector 4.0.8 → 4.0.10
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/.output/backend/nitro.json +1 -1
- package/.output/cli.js +915 -25970
- package/.output/server/_chunks/ssr-renderer.mjs +1 -38
- package/.output/server/_libs/@opentelemetry/semantic-conventions+[...].mjs +1 -2658
- package/.output/server/_libs/agent-base.mjs +2 -234
- package/.output/server/_libs/ajv-formats.mjs +1 -330
- package/.output/server/_libs/ajv.mjs +8 -6080
- package/.output/server/_libs/anthropic-ai__sdk.mjs +19 -6021
- package/.output/server/_libs/atomically.mjs +1 -155
- package/.output/server/_libs/base64-js.mjs +1 -102
- package/.output/server/_libs/bignumber.js.mjs +1 -1353
- package/.output/server/_libs/buffer-equal-constant-time.mjs +1 -38
- package/.output/server/_libs/conf.mjs +1 -635
- package/.output/server/_libs/cookie-es.mjs +1 -44
- package/.output/server/_libs/core-util-is.mjs +1 -75
- package/.output/server/_libs/data-uri-to-buffer.mjs +1 -39
- package/.output/server/_libs/debounce-fn.mjs +1 -69
- package/.output/server/_libs/debug.mjs +5 -547
- package/.output/server/_libs/dot-prop.mjs +1 -265
- package/.output/server/_libs/ecdsa-sig-formatter.mjs +1 -162
- package/.output/server/_libs/env-paths.mjs +1 -57
- package/.output/server/_libs/extend.mjs +1 -94
- package/.output/server/_libs/fast-deep-equal.mjs +1 -38
- package/.output/server/_libs/fast-uri.mjs +1 -812
- package/.output/server/_libs/fetch-blob.mjs +1 -287
- package/.output/server/_libs/formdata-polyfill.mjs +9 -86
- package/.output/server/_libs/gaxios.mjs +5 -926
- package/.output/server/_libs/gcp-metadata.mjs +1 -322
- package/.output/server/_libs/google-auth-library.mjs +16 -6339
- package/.output/server/_libs/google-logging-utils.mjs +1 -385
- package/.output/server/_libs/google__genai.mjs +13 -18034
- package/.output/server/_libs/h3-v2.mjs +2 -287
- package/.output/server/_libs/h3.mjs +2 -408
- package/.output/server/_libs/has-flag.mjs +1 -16
- package/.output/server/_libs/https-proxy-agent.mjs +7 -280
- package/.output/server/_libs/immediate.mjs +1 -74
- package/.output/server/_libs/inherits.mjs +1 -50
- package/.output/server/_libs/isarray.mjs +1 -14
- package/.output/server/_libs/isbot.mjs +1 -20
- package/.output/server/_libs/json-bigint.mjs +8 -413
- package/.output/server/_libs/json-schema-traverse.mjs +1 -91
- package/.output/server/_libs/jszip.mjs +2 -3051
- package/.output/server/_libs/jwa.mjs +3 -233
- package/.output/server/_libs/jws.mjs +1 -298
- package/.output/server/_libs/lie.mjs +1 -273
- package/.output/server/_libs/mariozechner__pi-agent-core.mjs +1 -824
- package/.output/server/_libs/mariozechner__pi-ai.mjs +34 -22887
- package/.output/server/_libs/mimic-function.mjs +2 -47
- package/.output/server/_libs/mistralai__mistralai.mjs +7 -32045
- package/.output/server/_libs/modelcontextprotocol__core.mjs +1 -1121
- package/.output/server/_libs/modelcontextprotocol__server.mjs +13 -13205
- package/.output/server/_libs/ms.mjs +1 -120
- package/.output/server/_libs/node-domexception.mjs +1 -17
- package/.output/server/_libs/node-fetch.mjs +4 -1578
- package/.output/server/_libs/ohash.mjs +1 -1
- package/.output/server/_libs/openai.mjs +23 -6766
- package/.output/server/_libs/opentelemetry__api.mjs +1 -1678
- package/.output/server/_libs/p-retry.mjs +1 -87
- package/.output/server/_libs/pako.mjs +1 -4223
- package/.output/server/_libs/partial-json.mjs +2 -244
- package/.output/server/_libs/process-nextick-args.mjs +1 -48
- package/.output/server/_libs/react-dom.mjs +62 -10778
- package/.output/server/_libs/react.mjs +1 -519
- package/.output/server/_libs/readable-stream.mjs +1 -1518
- package/.output/server/_libs/retry.mjs +1 -236
- package/.output/server/_libs/rou3.mjs +1 -14
- package/.output/server/_libs/safe-buffer.mjs +1 -126
- package/.output/server/_libs/semver.mjs +1 -1938
- package/.output/server/_libs/seroval-plugins.mjs +1 -58
- package/.output/server/_libs/seroval.mjs +3 -1775
- package/.output/server/_libs/setimmediate.mjs +1 -152
- package/.output/server/_libs/srvx.mjs +4 -1390
- package/.output/server/_libs/stubborn-fs.mjs +1 -91
- package/.output/server/_libs/stubborn-utils.mjs +1 -66
- package/.output/server/_libs/supports-color.mjs +1 -108
- package/.output/server/_libs/tanstack__history.mjs +1 -230
- package/.output/server/_libs/tanstack__react-router.mjs +1 -848
- package/.output/server/_libs/tanstack__react-store.mjs +1 -1
- package/.output/server/_libs/tanstack__router-core.mjs +1 -4839
- package/.output/server/_libs/typebox.mjs +3 -6596
- package/.output/server/_libs/ufo.mjs +1 -54
- package/.output/server/_libs/uint8array-extras.mjs +1 -69
- package/.output/server/_libs/util-deprecate.mjs +1 -12
- package/.output/server/_libs/web-streams-polyfill.mjs +1 -4282
- package/.output/server/_libs/when-exit.mjs +1 -53
- package/.output/server/_libs/ws.mjs +7 -3715
- package/.output/server/_libs/zod-to-json-schema.mjs +5 -1207
- package/.output/server/_libs/zod.mjs +59 -9958
- package/.output/server/_ssr/empty-plugin-adapters-C3Q1xu4u.mjs +1 -0
- package/.output/server/_ssr/index.mjs +2 -1512
- package/.output/server/_ssr/publicBasePathContext--TAQS2_5.mjs +1 -0
- package/.output/server/_ssr/router-B3jax4sN.mjs +341 -0
- package/.output/server/_ssr/start-PDVGOqUN.mjs +1 -0
- package/.output/server/_tanstack-start-manifest_v-D7cKwKzM.mjs +1 -0
- package/.output/server/index.mjs +1 -320
- package/.output/ui/assets/{CompareDrawer-DafpfgaT.js → CompareDrawer-D8fg0prL.js} +1 -1
- package/.output/ui/assets/{InspectorPet-Brsmmfzx.js → InspectorPet-BAY7SAee.js} +1 -1
- package/.output/ui/assets/{ProxyViewerContainer-D2pq1fUr.js → ProxyViewerContainer-BPITPKYp.js} +4 -4
- package/.output/ui/assets/{ReplayDialog-D4mXXgT9.js → ReplayDialog-NLGOmBsc.js} +1 -1
- package/.output/ui/assets/{RequestAnatomy-Ccnsq12U.js → RequestAnatomy-DBhRhis7.js} +1 -1
- package/.output/ui/assets/{ResponseView-CJv3vB5X.js → ResponseView-DNXX-dzj.js} +1 -1
- package/.output/ui/assets/{StreamingChunkSequence-CEkLnOF6.js → StreamingChunkSequence-CLiT5Xun.js} +1 -1
- package/.output/ui/assets/{_sessionId-C7s68UH3.js → _sessionId-CY0Jj2Xv.js} +1 -1
- package/.output/ui/assets/{_sessionId-DlG-yHoI.js → _sessionId-Cf0So2vy.js} +1 -1
- package/.output/ui/assets/{index-ChZZrVHa.js → index-BIMJaHOR.js} +1 -1
- package/.output/ui/assets/{index-CFqnSirZ.js → index-DLG3AIXx.js} +1 -1
- package/.output/ui/assets/{index-B0NCZQ93.js → index-DTj5ErVh.js} +2 -2
- package/.output/ui/assets/{index-Cqh47jeU.js → index-ujyZ2AyC.js} +1 -1
- package/.output/ui/assets/{json-viewer-DvpI0vbY.js → json-viewer-BwPQ5x7s.js} +1 -1
- package/.output/ui/assets/{jszip.min-5AG8hW2c.js → jszip.min-CDwYiHmS.js} +1 -1
- package/.output/ui/index.html +1 -1
- package/.output/workers/logFinalizer.worker.js +41 -17739
- package/.output/workers/sessionWorkerEntry.js +41 -17735
- package/package.json +7 -7
- package/.output/server/_ssr/empty-plugin-adapters-BFgPZ6_d.mjs +0 -6
- package/.output/server/_ssr/publicBasePathContext-IH2ilOfu.mjs +0 -176
- package/.output/server/_ssr/router-BDyF-OMB.mjs +0 -27187
- package/.output/server/_ssr/start-COQu_AgD.mjs +0 -57
- package/.output/server/_tanstack-start-manifest_v-ClTaMkEj.mjs +0 -4
|
@@ -1,4223 +1 @@
|
|
|
1
|
-
var common = {};
|
|
2
|
-
var hasRequiredCommon;
|
|
3
|
-
function requireCommon() {
|
|
4
|
-
if (hasRequiredCommon) return common;
|
|
5
|
-
hasRequiredCommon = 1;
|
|
6
|
-
(function(exports$1) {
|
|
7
|
-
var TYPED_OK = typeof Uint8Array !== "undefined" && typeof Uint16Array !== "undefined" && typeof Int32Array !== "undefined";
|
|
8
|
-
function _has(obj, key) {
|
|
9
|
-
return Object.prototype.hasOwnProperty.call(obj, key);
|
|
10
|
-
}
|
|
11
|
-
exports$1.assign = function(obj) {
|
|
12
|
-
var sources = Array.prototype.slice.call(arguments, 1);
|
|
13
|
-
while (sources.length) {
|
|
14
|
-
var source = sources.shift();
|
|
15
|
-
if (!source) {
|
|
16
|
-
continue;
|
|
17
|
-
}
|
|
18
|
-
if (typeof source !== "object") {
|
|
19
|
-
throw new TypeError(source + "must be non-object");
|
|
20
|
-
}
|
|
21
|
-
for (var p in source) {
|
|
22
|
-
if (_has(source, p)) {
|
|
23
|
-
obj[p] = source[p];
|
|
24
|
-
}
|
|
25
|
-
}
|
|
26
|
-
}
|
|
27
|
-
return obj;
|
|
28
|
-
};
|
|
29
|
-
exports$1.shrinkBuf = function(buf, size) {
|
|
30
|
-
if (buf.length === size) {
|
|
31
|
-
return buf;
|
|
32
|
-
}
|
|
33
|
-
if (buf.subarray) {
|
|
34
|
-
return buf.subarray(0, size);
|
|
35
|
-
}
|
|
36
|
-
buf.length = size;
|
|
37
|
-
return buf;
|
|
38
|
-
};
|
|
39
|
-
var fnTyped = {
|
|
40
|
-
arraySet: function(dest, src, src_offs, len, dest_offs) {
|
|
41
|
-
if (src.subarray && dest.subarray) {
|
|
42
|
-
dest.set(src.subarray(src_offs, src_offs + len), dest_offs);
|
|
43
|
-
return;
|
|
44
|
-
}
|
|
45
|
-
for (var i = 0; i < len; i++) {
|
|
46
|
-
dest[dest_offs + i] = src[src_offs + i];
|
|
47
|
-
}
|
|
48
|
-
},
|
|
49
|
-
// Join array of chunks to single array.
|
|
50
|
-
flattenChunks: function(chunks) {
|
|
51
|
-
var i, l, len, pos, chunk, result;
|
|
52
|
-
len = 0;
|
|
53
|
-
for (i = 0, l = chunks.length; i < l; i++) {
|
|
54
|
-
len += chunks[i].length;
|
|
55
|
-
}
|
|
56
|
-
result = new Uint8Array(len);
|
|
57
|
-
pos = 0;
|
|
58
|
-
for (i = 0, l = chunks.length; i < l; i++) {
|
|
59
|
-
chunk = chunks[i];
|
|
60
|
-
result.set(chunk, pos);
|
|
61
|
-
pos += chunk.length;
|
|
62
|
-
}
|
|
63
|
-
return result;
|
|
64
|
-
}
|
|
65
|
-
};
|
|
66
|
-
var fnUntyped = {
|
|
67
|
-
arraySet: function(dest, src, src_offs, len, dest_offs) {
|
|
68
|
-
for (var i = 0; i < len; i++) {
|
|
69
|
-
dest[dest_offs + i] = src[src_offs + i];
|
|
70
|
-
}
|
|
71
|
-
},
|
|
72
|
-
// Join array of chunks to single array.
|
|
73
|
-
flattenChunks: function(chunks) {
|
|
74
|
-
return [].concat.apply([], chunks);
|
|
75
|
-
}
|
|
76
|
-
};
|
|
77
|
-
exports$1.setTyped = function(on) {
|
|
78
|
-
if (on) {
|
|
79
|
-
exports$1.Buf8 = Uint8Array;
|
|
80
|
-
exports$1.Buf16 = Uint16Array;
|
|
81
|
-
exports$1.Buf32 = Int32Array;
|
|
82
|
-
exports$1.assign(exports$1, fnTyped);
|
|
83
|
-
} else {
|
|
84
|
-
exports$1.Buf8 = Array;
|
|
85
|
-
exports$1.Buf16 = Array;
|
|
86
|
-
exports$1.Buf32 = Array;
|
|
87
|
-
exports$1.assign(exports$1, fnUntyped);
|
|
88
|
-
}
|
|
89
|
-
};
|
|
90
|
-
exports$1.setTyped(TYPED_OK);
|
|
91
|
-
})(common);
|
|
92
|
-
return common;
|
|
93
|
-
}
|
|
94
|
-
var deflate$1 = {};
|
|
95
|
-
var deflate = {};
|
|
96
|
-
var trees = {};
|
|
97
|
-
var hasRequiredTrees;
|
|
98
|
-
function requireTrees() {
|
|
99
|
-
if (hasRequiredTrees) return trees;
|
|
100
|
-
hasRequiredTrees = 1;
|
|
101
|
-
var utils = requireCommon();
|
|
102
|
-
var Z_FIXED = 4;
|
|
103
|
-
var Z_BINARY = 0;
|
|
104
|
-
var Z_TEXT = 1;
|
|
105
|
-
var Z_UNKNOWN = 2;
|
|
106
|
-
function zero(buf) {
|
|
107
|
-
var len = buf.length;
|
|
108
|
-
while (--len >= 0) {
|
|
109
|
-
buf[len] = 0;
|
|
110
|
-
}
|
|
111
|
-
}
|
|
112
|
-
var STORED_BLOCK = 0;
|
|
113
|
-
var STATIC_TREES = 1;
|
|
114
|
-
var DYN_TREES = 2;
|
|
115
|
-
var MIN_MATCH = 3;
|
|
116
|
-
var MAX_MATCH = 258;
|
|
117
|
-
var LENGTH_CODES = 29;
|
|
118
|
-
var LITERALS = 256;
|
|
119
|
-
var L_CODES = LITERALS + 1 + LENGTH_CODES;
|
|
120
|
-
var D_CODES = 30;
|
|
121
|
-
var BL_CODES = 19;
|
|
122
|
-
var HEAP_SIZE = 2 * L_CODES + 1;
|
|
123
|
-
var MAX_BITS = 15;
|
|
124
|
-
var Buf_size = 16;
|
|
125
|
-
var MAX_BL_BITS = 7;
|
|
126
|
-
var END_BLOCK = 256;
|
|
127
|
-
var REP_3_6 = 16;
|
|
128
|
-
var REPZ_3_10 = 17;
|
|
129
|
-
var REPZ_11_138 = 18;
|
|
130
|
-
var extra_lbits = (
|
|
131
|
-
/* extra bits for each length code */
|
|
132
|
-
[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0]
|
|
133
|
-
);
|
|
134
|
-
var extra_dbits = (
|
|
135
|
-
/* extra bits for each distance code */
|
|
136
|
-
[0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13]
|
|
137
|
-
);
|
|
138
|
-
var extra_blbits = (
|
|
139
|
-
/* extra bits for each bit length code */
|
|
140
|
-
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7]
|
|
141
|
-
);
|
|
142
|
-
var bl_order = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
|
|
143
|
-
var DIST_CODE_LEN = 512;
|
|
144
|
-
var static_ltree = new Array((L_CODES + 2) * 2);
|
|
145
|
-
zero(static_ltree);
|
|
146
|
-
var static_dtree = new Array(D_CODES * 2);
|
|
147
|
-
zero(static_dtree);
|
|
148
|
-
var _dist_code = new Array(DIST_CODE_LEN);
|
|
149
|
-
zero(_dist_code);
|
|
150
|
-
var _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);
|
|
151
|
-
zero(_length_code);
|
|
152
|
-
var base_length = new Array(LENGTH_CODES);
|
|
153
|
-
zero(base_length);
|
|
154
|
-
var base_dist = new Array(D_CODES);
|
|
155
|
-
zero(base_dist);
|
|
156
|
-
function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {
|
|
157
|
-
this.static_tree = static_tree;
|
|
158
|
-
this.extra_bits = extra_bits;
|
|
159
|
-
this.extra_base = extra_base;
|
|
160
|
-
this.elems = elems;
|
|
161
|
-
this.max_length = max_length;
|
|
162
|
-
this.has_stree = static_tree && static_tree.length;
|
|
163
|
-
}
|
|
164
|
-
var static_l_desc;
|
|
165
|
-
var static_d_desc;
|
|
166
|
-
var static_bl_desc;
|
|
167
|
-
function TreeDesc(dyn_tree, stat_desc) {
|
|
168
|
-
this.dyn_tree = dyn_tree;
|
|
169
|
-
this.max_code = 0;
|
|
170
|
-
this.stat_desc = stat_desc;
|
|
171
|
-
}
|
|
172
|
-
function d_code(dist) {
|
|
173
|
-
return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];
|
|
174
|
-
}
|
|
175
|
-
function put_short(s, w) {
|
|
176
|
-
s.pending_buf[s.pending++] = w & 255;
|
|
177
|
-
s.pending_buf[s.pending++] = w >>> 8 & 255;
|
|
178
|
-
}
|
|
179
|
-
function send_bits(s, value, length) {
|
|
180
|
-
if (s.bi_valid > Buf_size - length) {
|
|
181
|
-
s.bi_buf |= value << s.bi_valid & 65535;
|
|
182
|
-
put_short(s, s.bi_buf);
|
|
183
|
-
s.bi_buf = value >> Buf_size - s.bi_valid;
|
|
184
|
-
s.bi_valid += length - Buf_size;
|
|
185
|
-
} else {
|
|
186
|
-
s.bi_buf |= value << s.bi_valid & 65535;
|
|
187
|
-
s.bi_valid += length;
|
|
188
|
-
}
|
|
189
|
-
}
|
|
190
|
-
function send_code(s, c, tree) {
|
|
191
|
-
send_bits(
|
|
192
|
-
s,
|
|
193
|
-
tree[c * 2],
|
|
194
|
-
tree[c * 2 + 1]
|
|
195
|
-
/*.Len*/
|
|
196
|
-
);
|
|
197
|
-
}
|
|
198
|
-
function bi_reverse(code, len) {
|
|
199
|
-
var res = 0;
|
|
200
|
-
do {
|
|
201
|
-
res |= code & 1;
|
|
202
|
-
code >>>= 1;
|
|
203
|
-
res <<= 1;
|
|
204
|
-
} while (--len > 0);
|
|
205
|
-
return res >>> 1;
|
|
206
|
-
}
|
|
207
|
-
function bi_flush(s) {
|
|
208
|
-
if (s.bi_valid === 16) {
|
|
209
|
-
put_short(s, s.bi_buf);
|
|
210
|
-
s.bi_buf = 0;
|
|
211
|
-
s.bi_valid = 0;
|
|
212
|
-
} else if (s.bi_valid >= 8) {
|
|
213
|
-
s.pending_buf[s.pending++] = s.bi_buf & 255;
|
|
214
|
-
s.bi_buf >>= 8;
|
|
215
|
-
s.bi_valid -= 8;
|
|
216
|
-
}
|
|
217
|
-
}
|
|
218
|
-
function gen_bitlen(s, desc) {
|
|
219
|
-
var tree = desc.dyn_tree;
|
|
220
|
-
var max_code = desc.max_code;
|
|
221
|
-
var stree = desc.stat_desc.static_tree;
|
|
222
|
-
var has_stree = desc.stat_desc.has_stree;
|
|
223
|
-
var extra = desc.stat_desc.extra_bits;
|
|
224
|
-
var base = desc.stat_desc.extra_base;
|
|
225
|
-
var max_length = desc.stat_desc.max_length;
|
|
226
|
-
var h;
|
|
227
|
-
var n, m;
|
|
228
|
-
var bits;
|
|
229
|
-
var xbits;
|
|
230
|
-
var f;
|
|
231
|
-
var overflow = 0;
|
|
232
|
-
for (bits = 0; bits <= MAX_BITS; bits++) {
|
|
233
|
-
s.bl_count[bits] = 0;
|
|
234
|
-
}
|
|
235
|
-
tree[s.heap[s.heap_max] * 2 + 1] = 0;
|
|
236
|
-
for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {
|
|
237
|
-
n = s.heap[h];
|
|
238
|
-
bits = tree[tree[n * 2 + 1] * 2 + 1] + 1;
|
|
239
|
-
if (bits > max_length) {
|
|
240
|
-
bits = max_length;
|
|
241
|
-
overflow++;
|
|
242
|
-
}
|
|
243
|
-
tree[n * 2 + 1] = bits;
|
|
244
|
-
if (n > max_code) {
|
|
245
|
-
continue;
|
|
246
|
-
}
|
|
247
|
-
s.bl_count[bits]++;
|
|
248
|
-
xbits = 0;
|
|
249
|
-
if (n >= base) {
|
|
250
|
-
xbits = extra[n - base];
|
|
251
|
-
}
|
|
252
|
-
f = tree[n * 2];
|
|
253
|
-
s.opt_len += f * (bits + xbits);
|
|
254
|
-
if (has_stree) {
|
|
255
|
-
s.static_len += f * (stree[n * 2 + 1] + xbits);
|
|
256
|
-
}
|
|
257
|
-
}
|
|
258
|
-
if (overflow === 0) {
|
|
259
|
-
return;
|
|
260
|
-
}
|
|
261
|
-
do {
|
|
262
|
-
bits = max_length - 1;
|
|
263
|
-
while (s.bl_count[bits] === 0) {
|
|
264
|
-
bits--;
|
|
265
|
-
}
|
|
266
|
-
s.bl_count[bits]--;
|
|
267
|
-
s.bl_count[bits + 1] += 2;
|
|
268
|
-
s.bl_count[max_length]--;
|
|
269
|
-
overflow -= 2;
|
|
270
|
-
} while (overflow > 0);
|
|
271
|
-
for (bits = max_length; bits !== 0; bits--) {
|
|
272
|
-
n = s.bl_count[bits];
|
|
273
|
-
while (n !== 0) {
|
|
274
|
-
m = s.heap[--h];
|
|
275
|
-
if (m > max_code) {
|
|
276
|
-
continue;
|
|
277
|
-
}
|
|
278
|
-
if (tree[m * 2 + 1] !== bits) {
|
|
279
|
-
s.opt_len += (bits - tree[m * 2 + 1]) * tree[m * 2];
|
|
280
|
-
tree[m * 2 + 1] = bits;
|
|
281
|
-
}
|
|
282
|
-
n--;
|
|
283
|
-
}
|
|
284
|
-
}
|
|
285
|
-
}
|
|
286
|
-
function gen_codes(tree, max_code, bl_count) {
|
|
287
|
-
var next_code = new Array(MAX_BITS + 1);
|
|
288
|
-
var code = 0;
|
|
289
|
-
var bits;
|
|
290
|
-
var n;
|
|
291
|
-
for (bits = 1; bits <= MAX_BITS; bits++) {
|
|
292
|
-
next_code[bits] = code = code + bl_count[bits - 1] << 1;
|
|
293
|
-
}
|
|
294
|
-
for (n = 0; n <= max_code; n++) {
|
|
295
|
-
var len = tree[n * 2 + 1];
|
|
296
|
-
if (len === 0) {
|
|
297
|
-
continue;
|
|
298
|
-
}
|
|
299
|
-
tree[n * 2] = bi_reverse(next_code[len]++, len);
|
|
300
|
-
}
|
|
301
|
-
}
|
|
302
|
-
function tr_static_init() {
|
|
303
|
-
var n;
|
|
304
|
-
var bits;
|
|
305
|
-
var length;
|
|
306
|
-
var code;
|
|
307
|
-
var dist;
|
|
308
|
-
var bl_count = new Array(MAX_BITS + 1);
|
|
309
|
-
length = 0;
|
|
310
|
-
for (code = 0; code < LENGTH_CODES - 1; code++) {
|
|
311
|
-
base_length[code] = length;
|
|
312
|
-
for (n = 0; n < 1 << extra_lbits[code]; n++) {
|
|
313
|
-
_length_code[length++] = code;
|
|
314
|
-
}
|
|
315
|
-
}
|
|
316
|
-
_length_code[length - 1] = code;
|
|
317
|
-
dist = 0;
|
|
318
|
-
for (code = 0; code < 16; code++) {
|
|
319
|
-
base_dist[code] = dist;
|
|
320
|
-
for (n = 0; n < 1 << extra_dbits[code]; n++) {
|
|
321
|
-
_dist_code[dist++] = code;
|
|
322
|
-
}
|
|
323
|
-
}
|
|
324
|
-
dist >>= 7;
|
|
325
|
-
for (; code < D_CODES; code++) {
|
|
326
|
-
base_dist[code] = dist << 7;
|
|
327
|
-
for (n = 0; n < 1 << extra_dbits[code] - 7; n++) {
|
|
328
|
-
_dist_code[256 + dist++] = code;
|
|
329
|
-
}
|
|
330
|
-
}
|
|
331
|
-
for (bits = 0; bits <= MAX_BITS; bits++) {
|
|
332
|
-
bl_count[bits] = 0;
|
|
333
|
-
}
|
|
334
|
-
n = 0;
|
|
335
|
-
while (n <= 143) {
|
|
336
|
-
static_ltree[n * 2 + 1] = 8;
|
|
337
|
-
n++;
|
|
338
|
-
bl_count[8]++;
|
|
339
|
-
}
|
|
340
|
-
while (n <= 255) {
|
|
341
|
-
static_ltree[n * 2 + 1] = 9;
|
|
342
|
-
n++;
|
|
343
|
-
bl_count[9]++;
|
|
344
|
-
}
|
|
345
|
-
while (n <= 279) {
|
|
346
|
-
static_ltree[n * 2 + 1] = 7;
|
|
347
|
-
n++;
|
|
348
|
-
bl_count[7]++;
|
|
349
|
-
}
|
|
350
|
-
while (n <= 287) {
|
|
351
|
-
static_ltree[n * 2 + 1] = 8;
|
|
352
|
-
n++;
|
|
353
|
-
bl_count[8]++;
|
|
354
|
-
}
|
|
355
|
-
gen_codes(static_ltree, L_CODES + 1, bl_count);
|
|
356
|
-
for (n = 0; n < D_CODES; n++) {
|
|
357
|
-
static_dtree[n * 2 + 1] = 5;
|
|
358
|
-
static_dtree[n * 2] = bi_reverse(n, 5);
|
|
359
|
-
}
|
|
360
|
-
static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);
|
|
361
|
-
static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);
|
|
362
|
-
static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);
|
|
363
|
-
}
|
|
364
|
-
function init_block(s) {
|
|
365
|
-
var n;
|
|
366
|
-
for (n = 0; n < L_CODES; n++) {
|
|
367
|
-
s.dyn_ltree[n * 2] = 0;
|
|
368
|
-
}
|
|
369
|
-
for (n = 0; n < D_CODES; n++) {
|
|
370
|
-
s.dyn_dtree[n * 2] = 0;
|
|
371
|
-
}
|
|
372
|
-
for (n = 0; n < BL_CODES; n++) {
|
|
373
|
-
s.bl_tree[n * 2] = 0;
|
|
374
|
-
}
|
|
375
|
-
s.dyn_ltree[END_BLOCK * 2] = 1;
|
|
376
|
-
s.opt_len = s.static_len = 0;
|
|
377
|
-
s.last_lit = s.matches = 0;
|
|
378
|
-
}
|
|
379
|
-
function bi_windup(s) {
|
|
380
|
-
if (s.bi_valid > 8) {
|
|
381
|
-
put_short(s, s.bi_buf);
|
|
382
|
-
} else if (s.bi_valid > 0) {
|
|
383
|
-
s.pending_buf[s.pending++] = s.bi_buf;
|
|
384
|
-
}
|
|
385
|
-
s.bi_buf = 0;
|
|
386
|
-
s.bi_valid = 0;
|
|
387
|
-
}
|
|
388
|
-
function copy_block(s, buf, len, header) {
|
|
389
|
-
bi_windup(s);
|
|
390
|
-
{
|
|
391
|
-
put_short(s, len);
|
|
392
|
-
put_short(s, ~len);
|
|
393
|
-
}
|
|
394
|
-
utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);
|
|
395
|
-
s.pending += len;
|
|
396
|
-
}
|
|
397
|
-
function smaller(tree, n, m, depth) {
|
|
398
|
-
var _n2 = n * 2;
|
|
399
|
-
var _m2 = m * 2;
|
|
400
|
-
return tree[_n2] < tree[_m2] || tree[_n2] === tree[_m2] && depth[n] <= depth[m];
|
|
401
|
-
}
|
|
402
|
-
function pqdownheap(s, tree, k) {
|
|
403
|
-
var v = s.heap[k];
|
|
404
|
-
var j = k << 1;
|
|
405
|
-
while (j <= s.heap_len) {
|
|
406
|
-
if (j < s.heap_len && smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {
|
|
407
|
-
j++;
|
|
408
|
-
}
|
|
409
|
-
if (smaller(tree, v, s.heap[j], s.depth)) {
|
|
410
|
-
break;
|
|
411
|
-
}
|
|
412
|
-
s.heap[k] = s.heap[j];
|
|
413
|
-
k = j;
|
|
414
|
-
j <<= 1;
|
|
415
|
-
}
|
|
416
|
-
s.heap[k] = v;
|
|
417
|
-
}
|
|
418
|
-
function compress_block(s, ltree, dtree) {
|
|
419
|
-
var dist;
|
|
420
|
-
var lc;
|
|
421
|
-
var lx = 0;
|
|
422
|
-
var code;
|
|
423
|
-
var extra;
|
|
424
|
-
if (s.last_lit !== 0) {
|
|
425
|
-
do {
|
|
426
|
-
dist = s.pending_buf[s.d_buf + lx * 2] << 8 | s.pending_buf[s.d_buf + lx * 2 + 1];
|
|
427
|
-
lc = s.pending_buf[s.l_buf + lx];
|
|
428
|
-
lx++;
|
|
429
|
-
if (dist === 0) {
|
|
430
|
-
send_code(s, lc, ltree);
|
|
431
|
-
} else {
|
|
432
|
-
code = _length_code[lc];
|
|
433
|
-
send_code(s, code + LITERALS + 1, ltree);
|
|
434
|
-
extra = extra_lbits[code];
|
|
435
|
-
if (extra !== 0) {
|
|
436
|
-
lc -= base_length[code];
|
|
437
|
-
send_bits(s, lc, extra);
|
|
438
|
-
}
|
|
439
|
-
dist--;
|
|
440
|
-
code = d_code(dist);
|
|
441
|
-
send_code(s, code, dtree);
|
|
442
|
-
extra = extra_dbits[code];
|
|
443
|
-
if (extra !== 0) {
|
|
444
|
-
dist -= base_dist[code];
|
|
445
|
-
send_bits(s, dist, extra);
|
|
446
|
-
}
|
|
447
|
-
}
|
|
448
|
-
} while (lx < s.last_lit);
|
|
449
|
-
}
|
|
450
|
-
send_code(s, END_BLOCK, ltree);
|
|
451
|
-
}
|
|
452
|
-
function build_tree(s, desc) {
|
|
453
|
-
var tree = desc.dyn_tree;
|
|
454
|
-
var stree = desc.stat_desc.static_tree;
|
|
455
|
-
var has_stree = desc.stat_desc.has_stree;
|
|
456
|
-
var elems = desc.stat_desc.elems;
|
|
457
|
-
var n, m;
|
|
458
|
-
var max_code = -1;
|
|
459
|
-
var node;
|
|
460
|
-
s.heap_len = 0;
|
|
461
|
-
s.heap_max = HEAP_SIZE;
|
|
462
|
-
for (n = 0; n < elems; n++) {
|
|
463
|
-
if (tree[n * 2] !== 0) {
|
|
464
|
-
s.heap[++s.heap_len] = max_code = n;
|
|
465
|
-
s.depth[n] = 0;
|
|
466
|
-
} else {
|
|
467
|
-
tree[n * 2 + 1] = 0;
|
|
468
|
-
}
|
|
469
|
-
}
|
|
470
|
-
while (s.heap_len < 2) {
|
|
471
|
-
node = s.heap[++s.heap_len] = max_code < 2 ? ++max_code : 0;
|
|
472
|
-
tree[node * 2] = 1;
|
|
473
|
-
s.depth[node] = 0;
|
|
474
|
-
s.opt_len--;
|
|
475
|
-
if (has_stree) {
|
|
476
|
-
s.static_len -= stree[node * 2 + 1];
|
|
477
|
-
}
|
|
478
|
-
}
|
|
479
|
-
desc.max_code = max_code;
|
|
480
|
-
for (n = s.heap_len >> 1; n >= 1; n--) {
|
|
481
|
-
pqdownheap(s, tree, n);
|
|
482
|
-
}
|
|
483
|
-
node = elems;
|
|
484
|
-
do {
|
|
485
|
-
n = s.heap[
|
|
486
|
-
1
|
|
487
|
-
/*SMALLEST*/
|
|
488
|
-
];
|
|
489
|
-
s.heap[
|
|
490
|
-
1
|
|
491
|
-
/*SMALLEST*/
|
|
492
|
-
] = s.heap[s.heap_len--];
|
|
493
|
-
pqdownheap(
|
|
494
|
-
s,
|
|
495
|
-
tree,
|
|
496
|
-
1
|
|
497
|
-
/*SMALLEST*/
|
|
498
|
-
);
|
|
499
|
-
m = s.heap[
|
|
500
|
-
1
|
|
501
|
-
/*SMALLEST*/
|
|
502
|
-
];
|
|
503
|
-
s.heap[--s.heap_max] = n;
|
|
504
|
-
s.heap[--s.heap_max] = m;
|
|
505
|
-
tree[node * 2] = tree[n * 2] + tree[m * 2];
|
|
506
|
-
s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
|
|
507
|
-
tree[n * 2 + 1] = tree[m * 2 + 1] = node;
|
|
508
|
-
s.heap[
|
|
509
|
-
1
|
|
510
|
-
/*SMALLEST*/
|
|
511
|
-
] = node++;
|
|
512
|
-
pqdownheap(
|
|
513
|
-
s,
|
|
514
|
-
tree,
|
|
515
|
-
1
|
|
516
|
-
/*SMALLEST*/
|
|
517
|
-
);
|
|
518
|
-
} while (s.heap_len >= 2);
|
|
519
|
-
s.heap[--s.heap_max] = s.heap[
|
|
520
|
-
1
|
|
521
|
-
/*SMALLEST*/
|
|
522
|
-
];
|
|
523
|
-
gen_bitlen(s, desc);
|
|
524
|
-
gen_codes(tree, max_code, s.bl_count);
|
|
525
|
-
}
|
|
526
|
-
function scan_tree(s, tree, max_code) {
|
|
527
|
-
var n;
|
|
528
|
-
var prevlen = -1;
|
|
529
|
-
var curlen;
|
|
530
|
-
var nextlen = tree[0 * 2 + 1];
|
|
531
|
-
var count = 0;
|
|
532
|
-
var max_count = 7;
|
|
533
|
-
var min_count = 4;
|
|
534
|
-
if (nextlen === 0) {
|
|
535
|
-
max_count = 138;
|
|
536
|
-
min_count = 3;
|
|
537
|
-
}
|
|
538
|
-
tree[(max_code + 1) * 2 + 1] = 65535;
|
|
539
|
-
for (n = 0; n <= max_code; n++) {
|
|
540
|
-
curlen = nextlen;
|
|
541
|
-
nextlen = tree[(n + 1) * 2 + 1];
|
|
542
|
-
if (++count < max_count && curlen === nextlen) {
|
|
543
|
-
continue;
|
|
544
|
-
} else if (count < min_count) {
|
|
545
|
-
s.bl_tree[curlen * 2] += count;
|
|
546
|
-
} else if (curlen !== 0) {
|
|
547
|
-
if (curlen !== prevlen) {
|
|
548
|
-
s.bl_tree[curlen * 2]++;
|
|
549
|
-
}
|
|
550
|
-
s.bl_tree[REP_3_6 * 2]++;
|
|
551
|
-
} else if (count <= 10) {
|
|
552
|
-
s.bl_tree[REPZ_3_10 * 2]++;
|
|
553
|
-
} else {
|
|
554
|
-
s.bl_tree[REPZ_11_138 * 2]++;
|
|
555
|
-
}
|
|
556
|
-
count = 0;
|
|
557
|
-
prevlen = curlen;
|
|
558
|
-
if (nextlen === 0) {
|
|
559
|
-
max_count = 138;
|
|
560
|
-
min_count = 3;
|
|
561
|
-
} else if (curlen === nextlen) {
|
|
562
|
-
max_count = 6;
|
|
563
|
-
min_count = 3;
|
|
564
|
-
} else {
|
|
565
|
-
max_count = 7;
|
|
566
|
-
min_count = 4;
|
|
567
|
-
}
|
|
568
|
-
}
|
|
569
|
-
}
|
|
570
|
-
function send_tree(s, tree, max_code) {
|
|
571
|
-
var n;
|
|
572
|
-
var prevlen = -1;
|
|
573
|
-
var curlen;
|
|
574
|
-
var nextlen = tree[0 * 2 + 1];
|
|
575
|
-
var count = 0;
|
|
576
|
-
var max_count = 7;
|
|
577
|
-
var min_count = 4;
|
|
578
|
-
if (nextlen === 0) {
|
|
579
|
-
max_count = 138;
|
|
580
|
-
min_count = 3;
|
|
581
|
-
}
|
|
582
|
-
for (n = 0; n <= max_code; n++) {
|
|
583
|
-
curlen = nextlen;
|
|
584
|
-
nextlen = tree[(n + 1) * 2 + 1];
|
|
585
|
-
if (++count < max_count && curlen === nextlen) {
|
|
586
|
-
continue;
|
|
587
|
-
} else if (count < min_count) {
|
|
588
|
-
do {
|
|
589
|
-
send_code(s, curlen, s.bl_tree);
|
|
590
|
-
} while (--count !== 0);
|
|
591
|
-
} else if (curlen !== 0) {
|
|
592
|
-
if (curlen !== prevlen) {
|
|
593
|
-
send_code(s, curlen, s.bl_tree);
|
|
594
|
-
count--;
|
|
595
|
-
}
|
|
596
|
-
send_code(s, REP_3_6, s.bl_tree);
|
|
597
|
-
send_bits(s, count - 3, 2);
|
|
598
|
-
} else if (count <= 10) {
|
|
599
|
-
send_code(s, REPZ_3_10, s.bl_tree);
|
|
600
|
-
send_bits(s, count - 3, 3);
|
|
601
|
-
} else {
|
|
602
|
-
send_code(s, REPZ_11_138, s.bl_tree);
|
|
603
|
-
send_bits(s, count - 11, 7);
|
|
604
|
-
}
|
|
605
|
-
count = 0;
|
|
606
|
-
prevlen = curlen;
|
|
607
|
-
if (nextlen === 0) {
|
|
608
|
-
max_count = 138;
|
|
609
|
-
min_count = 3;
|
|
610
|
-
} else if (curlen === nextlen) {
|
|
611
|
-
max_count = 6;
|
|
612
|
-
min_count = 3;
|
|
613
|
-
} else {
|
|
614
|
-
max_count = 7;
|
|
615
|
-
min_count = 4;
|
|
616
|
-
}
|
|
617
|
-
}
|
|
618
|
-
}
|
|
619
|
-
function build_bl_tree(s) {
|
|
620
|
-
var max_blindex;
|
|
621
|
-
scan_tree(s, s.dyn_ltree, s.l_desc.max_code);
|
|
622
|
-
scan_tree(s, s.dyn_dtree, s.d_desc.max_code);
|
|
623
|
-
build_tree(s, s.bl_desc);
|
|
624
|
-
for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {
|
|
625
|
-
if (s.bl_tree[bl_order[max_blindex] * 2 + 1] !== 0) {
|
|
626
|
-
break;
|
|
627
|
-
}
|
|
628
|
-
}
|
|
629
|
-
s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
|
|
630
|
-
return max_blindex;
|
|
631
|
-
}
|
|
632
|
-
function send_all_trees(s, lcodes, dcodes, blcodes) {
|
|
633
|
-
var rank;
|
|
634
|
-
send_bits(s, lcodes - 257, 5);
|
|
635
|
-
send_bits(s, dcodes - 1, 5);
|
|
636
|
-
send_bits(s, blcodes - 4, 4);
|
|
637
|
-
for (rank = 0; rank < blcodes; rank++) {
|
|
638
|
-
send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1], 3);
|
|
639
|
-
}
|
|
640
|
-
send_tree(s, s.dyn_ltree, lcodes - 1);
|
|
641
|
-
send_tree(s, s.dyn_dtree, dcodes - 1);
|
|
642
|
-
}
|
|
643
|
-
function detect_data_type(s) {
|
|
644
|
-
var black_mask = 4093624447;
|
|
645
|
-
var n;
|
|
646
|
-
for (n = 0; n <= 31; n++, black_mask >>>= 1) {
|
|
647
|
-
if (black_mask & 1 && s.dyn_ltree[n * 2] !== 0) {
|
|
648
|
-
return Z_BINARY;
|
|
649
|
-
}
|
|
650
|
-
}
|
|
651
|
-
if (s.dyn_ltree[9 * 2] !== 0 || s.dyn_ltree[10 * 2] !== 0 || s.dyn_ltree[13 * 2] !== 0) {
|
|
652
|
-
return Z_TEXT;
|
|
653
|
-
}
|
|
654
|
-
for (n = 32; n < LITERALS; n++) {
|
|
655
|
-
if (s.dyn_ltree[n * 2] !== 0) {
|
|
656
|
-
return Z_TEXT;
|
|
657
|
-
}
|
|
658
|
-
}
|
|
659
|
-
return Z_BINARY;
|
|
660
|
-
}
|
|
661
|
-
var static_init_done = false;
|
|
662
|
-
function _tr_init(s) {
|
|
663
|
-
if (!static_init_done) {
|
|
664
|
-
tr_static_init();
|
|
665
|
-
static_init_done = true;
|
|
666
|
-
}
|
|
667
|
-
s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);
|
|
668
|
-
s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);
|
|
669
|
-
s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);
|
|
670
|
-
s.bi_buf = 0;
|
|
671
|
-
s.bi_valid = 0;
|
|
672
|
-
init_block(s);
|
|
673
|
-
}
|
|
674
|
-
function _tr_stored_block(s, buf, stored_len, last) {
|
|
675
|
-
send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);
|
|
676
|
-
copy_block(s, buf, stored_len);
|
|
677
|
-
}
|
|
678
|
-
function _tr_align(s) {
|
|
679
|
-
send_bits(s, STATIC_TREES << 1, 3);
|
|
680
|
-
send_code(s, END_BLOCK, static_ltree);
|
|
681
|
-
bi_flush(s);
|
|
682
|
-
}
|
|
683
|
-
function _tr_flush_block(s, buf, stored_len, last) {
|
|
684
|
-
var opt_lenb, static_lenb;
|
|
685
|
-
var max_blindex = 0;
|
|
686
|
-
if (s.level > 0) {
|
|
687
|
-
if (s.strm.data_type === Z_UNKNOWN) {
|
|
688
|
-
s.strm.data_type = detect_data_type(s);
|
|
689
|
-
}
|
|
690
|
-
build_tree(s, s.l_desc);
|
|
691
|
-
build_tree(s, s.d_desc);
|
|
692
|
-
max_blindex = build_bl_tree(s);
|
|
693
|
-
opt_lenb = s.opt_len + 3 + 7 >>> 3;
|
|
694
|
-
static_lenb = s.static_len + 3 + 7 >>> 3;
|
|
695
|
-
if (static_lenb <= opt_lenb) {
|
|
696
|
-
opt_lenb = static_lenb;
|
|
697
|
-
}
|
|
698
|
-
} else {
|
|
699
|
-
opt_lenb = static_lenb = stored_len + 5;
|
|
700
|
-
}
|
|
701
|
-
if (stored_len + 4 <= opt_lenb && buf !== -1) {
|
|
702
|
-
_tr_stored_block(s, buf, stored_len, last);
|
|
703
|
-
} else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {
|
|
704
|
-
send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);
|
|
705
|
-
compress_block(s, static_ltree, static_dtree);
|
|
706
|
-
} else {
|
|
707
|
-
send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);
|
|
708
|
-
send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);
|
|
709
|
-
compress_block(s, s.dyn_ltree, s.dyn_dtree);
|
|
710
|
-
}
|
|
711
|
-
init_block(s);
|
|
712
|
-
if (last) {
|
|
713
|
-
bi_windup(s);
|
|
714
|
-
}
|
|
715
|
-
}
|
|
716
|
-
function _tr_tally(s, dist, lc) {
|
|
717
|
-
s.pending_buf[s.d_buf + s.last_lit * 2] = dist >>> 8 & 255;
|
|
718
|
-
s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 255;
|
|
719
|
-
s.pending_buf[s.l_buf + s.last_lit] = lc & 255;
|
|
720
|
-
s.last_lit++;
|
|
721
|
-
if (dist === 0) {
|
|
722
|
-
s.dyn_ltree[lc * 2]++;
|
|
723
|
-
} else {
|
|
724
|
-
s.matches++;
|
|
725
|
-
dist--;
|
|
726
|
-
s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]++;
|
|
727
|
-
s.dyn_dtree[d_code(dist) * 2]++;
|
|
728
|
-
}
|
|
729
|
-
return s.last_lit === s.lit_bufsize - 1;
|
|
730
|
-
}
|
|
731
|
-
trees._tr_init = _tr_init;
|
|
732
|
-
trees._tr_stored_block = _tr_stored_block;
|
|
733
|
-
trees._tr_flush_block = _tr_flush_block;
|
|
734
|
-
trees._tr_tally = _tr_tally;
|
|
735
|
-
trees._tr_align = _tr_align;
|
|
736
|
-
return trees;
|
|
737
|
-
}
|
|
738
|
-
var adler32_1;
|
|
739
|
-
var hasRequiredAdler32;
|
|
740
|
-
function requireAdler32() {
|
|
741
|
-
if (hasRequiredAdler32) return adler32_1;
|
|
742
|
-
hasRequiredAdler32 = 1;
|
|
743
|
-
function adler32(adler, buf, len, pos) {
|
|
744
|
-
var s1 = adler & 65535 | 0, s2 = adler >>> 16 & 65535 | 0, n = 0;
|
|
745
|
-
while (len !== 0) {
|
|
746
|
-
n = len > 2e3 ? 2e3 : len;
|
|
747
|
-
len -= n;
|
|
748
|
-
do {
|
|
749
|
-
s1 = s1 + buf[pos++] | 0;
|
|
750
|
-
s2 = s2 + s1 | 0;
|
|
751
|
-
} while (--n);
|
|
752
|
-
s1 %= 65521;
|
|
753
|
-
s2 %= 65521;
|
|
754
|
-
}
|
|
755
|
-
return s1 | s2 << 16 | 0;
|
|
756
|
-
}
|
|
757
|
-
adler32_1 = adler32;
|
|
758
|
-
return adler32_1;
|
|
759
|
-
}
|
|
760
|
-
var crc32_1;
|
|
761
|
-
var hasRequiredCrc32;
|
|
762
|
-
function requireCrc32() {
|
|
763
|
-
if (hasRequiredCrc32) return crc32_1;
|
|
764
|
-
hasRequiredCrc32 = 1;
|
|
765
|
-
function makeTable() {
|
|
766
|
-
var c, table = [];
|
|
767
|
-
for (var n = 0; n < 256; n++) {
|
|
768
|
-
c = n;
|
|
769
|
-
for (var k = 0; k < 8; k++) {
|
|
770
|
-
c = c & 1 ? 3988292384 ^ c >>> 1 : c >>> 1;
|
|
771
|
-
}
|
|
772
|
-
table[n] = c;
|
|
773
|
-
}
|
|
774
|
-
return table;
|
|
775
|
-
}
|
|
776
|
-
var crcTable = makeTable();
|
|
777
|
-
function crc32(crc, buf, len, pos) {
|
|
778
|
-
var t = crcTable, end = pos + len;
|
|
779
|
-
crc ^= -1;
|
|
780
|
-
for (var i = pos; i < end; i++) {
|
|
781
|
-
crc = crc >>> 8 ^ t[(crc ^ buf[i]) & 255];
|
|
782
|
-
}
|
|
783
|
-
return crc ^ -1;
|
|
784
|
-
}
|
|
785
|
-
crc32_1 = crc32;
|
|
786
|
-
return crc32_1;
|
|
787
|
-
}
|
|
788
|
-
var messages;
|
|
789
|
-
var hasRequiredMessages;
|
|
790
|
-
function requireMessages() {
|
|
791
|
-
if (hasRequiredMessages) return messages;
|
|
792
|
-
hasRequiredMessages = 1;
|
|
793
|
-
messages = {
|
|
794
|
-
2: "need dictionary",
|
|
795
|
-
/* Z_NEED_DICT 2 */
|
|
796
|
-
1: "stream end",
|
|
797
|
-
/* Z_STREAM_END 1 */
|
|
798
|
-
0: "",
|
|
799
|
-
/* Z_OK 0 */
|
|
800
|
-
"-1": "file error",
|
|
801
|
-
/* Z_ERRNO (-1) */
|
|
802
|
-
"-2": "stream error",
|
|
803
|
-
/* Z_STREAM_ERROR (-2) */
|
|
804
|
-
"-3": "data error",
|
|
805
|
-
/* Z_DATA_ERROR (-3) */
|
|
806
|
-
"-4": "insufficient memory",
|
|
807
|
-
/* Z_MEM_ERROR (-4) */
|
|
808
|
-
"-5": "buffer error",
|
|
809
|
-
/* Z_BUF_ERROR (-5) */
|
|
810
|
-
"-6": "incompatible version"
|
|
811
|
-
/* Z_VERSION_ERROR (-6) */
|
|
812
|
-
};
|
|
813
|
-
return messages;
|
|
814
|
-
}
|
|
815
|
-
var hasRequiredDeflate$1;
|
|
816
|
-
function requireDeflate$1() {
|
|
817
|
-
if (hasRequiredDeflate$1) return deflate;
|
|
818
|
-
hasRequiredDeflate$1 = 1;
|
|
819
|
-
var utils = requireCommon();
|
|
820
|
-
var trees2 = requireTrees();
|
|
821
|
-
var adler32 = requireAdler32();
|
|
822
|
-
var crc32 = requireCrc32();
|
|
823
|
-
var msg = requireMessages();
|
|
824
|
-
var Z_NO_FLUSH = 0;
|
|
825
|
-
var Z_PARTIAL_FLUSH = 1;
|
|
826
|
-
var Z_FULL_FLUSH = 3;
|
|
827
|
-
var Z_FINISH = 4;
|
|
828
|
-
var Z_BLOCK = 5;
|
|
829
|
-
var Z_OK = 0;
|
|
830
|
-
var Z_STREAM_END = 1;
|
|
831
|
-
var Z_STREAM_ERROR = -2;
|
|
832
|
-
var Z_DATA_ERROR = -3;
|
|
833
|
-
var Z_BUF_ERROR = -5;
|
|
834
|
-
var Z_DEFAULT_COMPRESSION = -1;
|
|
835
|
-
var Z_FILTERED = 1;
|
|
836
|
-
var Z_HUFFMAN_ONLY = 2;
|
|
837
|
-
var Z_RLE = 3;
|
|
838
|
-
var Z_FIXED = 4;
|
|
839
|
-
var Z_DEFAULT_STRATEGY = 0;
|
|
840
|
-
var Z_UNKNOWN = 2;
|
|
841
|
-
var Z_DEFLATED = 8;
|
|
842
|
-
var MAX_MEM_LEVEL = 9;
|
|
843
|
-
var MAX_WBITS = 15;
|
|
844
|
-
var DEF_MEM_LEVEL = 8;
|
|
845
|
-
var LENGTH_CODES = 29;
|
|
846
|
-
var LITERALS = 256;
|
|
847
|
-
var L_CODES = LITERALS + 1 + LENGTH_CODES;
|
|
848
|
-
var D_CODES = 30;
|
|
849
|
-
var BL_CODES = 19;
|
|
850
|
-
var HEAP_SIZE = 2 * L_CODES + 1;
|
|
851
|
-
var MAX_BITS = 15;
|
|
852
|
-
var MIN_MATCH = 3;
|
|
853
|
-
var MAX_MATCH = 258;
|
|
854
|
-
var MIN_LOOKAHEAD = MAX_MATCH + MIN_MATCH + 1;
|
|
855
|
-
var PRESET_DICT = 32;
|
|
856
|
-
var INIT_STATE = 42;
|
|
857
|
-
var EXTRA_STATE = 69;
|
|
858
|
-
var NAME_STATE = 73;
|
|
859
|
-
var COMMENT_STATE = 91;
|
|
860
|
-
var HCRC_STATE = 103;
|
|
861
|
-
var BUSY_STATE = 113;
|
|
862
|
-
var FINISH_STATE = 666;
|
|
863
|
-
var BS_NEED_MORE = 1;
|
|
864
|
-
var BS_BLOCK_DONE = 2;
|
|
865
|
-
var BS_FINISH_STARTED = 3;
|
|
866
|
-
var BS_FINISH_DONE = 4;
|
|
867
|
-
var OS_CODE = 3;
|
|
868
|
-
function err(strm, errorCode) {
|
|
869
|
-
strm.msg = msg[errorCode];
|
|
870
|
-
return errorCode;
|
|
871
|
-
}
|
|
872
|
-
function rank(f) {
|
|
873
|
-
return (f << 1) - (f > 4 ? 9 : 0);
|
|
874
|
-
}
|
|
875
|
-
function zero(buf) {
|
|
876
|
-
var len = buf.length;
|
|
877
|
-
while (--len >= 0) {
|
|
878
|
-
buf[len] = 0;
|
|
879
|
-
}
|
|
880
|
-
}
|
|
881
|
-
function flush_pending(strm) {
|
|
882
|
-
var s = strm.state;
|
|
883
|
-
var len = s.pending;
|
|
884
|
-
if (len > strm.avail_out) {
|
|
885
|
-
len = strm.avail_out;
|
|
886
|
-
}
|
|
887
|
-
if (len === 0) {
|
|
888
|
-
return;
|
|
889
|
-
}
|
|
890
|
-
utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);
|
|
891
|
-
strm.next_out += len;
|
|
892
|
-
s.pending_out += len;
|
|
893
|
-
strm.total_out += len;
|
|
894
|
-
strm.avail_out -= len;
|
|
895
|
-
s.pending -= len;
|
|
896
|
-
if (s.pending === 0) {
|
|
897
|
-
s.pending_out = 0;
|
|
898
|
-
}
|
|
899
|
-
}
|
|
900
|
-
function flush_block_only(s, last) {
|
|
901
|
-
trees2._tr_flush_block(s, s.block_start >= 0 ? s.block_start : -1, s.strstart - s.block_start, last);
|
|
902
|
-
s.block_start = s.strstart;
|
|
903
|
-
flush_pending(s.strm);
|
|
904
|
-
}
|
|
905
|
-
function put_byte(s, b) {
|
|
906
|
-
s.pending_buf[s.pending++] = b;
|
|
907
|
-
}
|
|
908
|
-
function putShortMSB(s, b) {
|
|
909
|
-
s.pending_buf[s.pending++] = b >>> 8 & 255;
|
|
910
|
-
s.pending_buf[s.pending++] = b & 255;
|
|
911
|
-
}
|
|
912
|
-
function read_buf(strm, buf, start, size) {
|
|
913
|
-
var len = strm.avail_in;
|
|
914
|
-
if (len > size) {
|
|
915
|
-
len = size;
|
|
916
|
-
}
|
|
917
|
-
if (len === 0) {
|
|
918
|
-
return 0;
|
|
919
|
-
}
|
|
920
|
-
strm.avail_in -= len;
|
|
921
|
-
utils.arraySet(buf, strm.input, strm.next_in, len, start);
|
|
922
|
-
if (strm.state.wrap === 1) {
|
|
923
|
-
strm.adler = adler32(strm.adler, buf, len, start);
|
|
924
|
-
} else if (strm.state.wrap === 2) {
|
|
925
|
-
strm.adler = crc32(strm.adler, buf, len, start);
|
|
926
|
-
}
|
|
927
|
-
strm.next_in += len;
|
|
928
|
-
strm.total_in += len;
|
|
929
|
-
return len;
|
|
930
|
-
}
|
|
931
|
-
function longest_match(s, cur_match) {
|
|
932
|
-
var chain_length = s.max_chain_length;
|
|
933
|
-
var scan = s.strstart;
|
|
934
|
-
var match;
|
|
935
|
-
var len;
|
|
936
|
-
var best_len = s.prev_length;
|
|
937
|
-
var nice_match = s.nice_match;
|
|
938
|
-
var limit = s.strstart > s.w_size - MIN_LOOKAHEAD ? s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0;
|
|
939
|
-
var _win = s.window;
|
|
940
|
-
var wmask = s.w_mask;
|
|
941
|
-
var prev = s.prev;
|
|
942
|
-
var strend = s.strstart + MAX_MATCH;
|
|
943
|
-
var scan_end1 = _win[scan + best_len - 1];
|
|
944
|
-
var scan_end = _win[scan + best_len];
|
|
945
|
-
if (s.prev_length >= s.good_match) {
|
|
946
|
-
chain_length >>= 2;
|
|
947
|
-
}
|
|
948
|
-
if (nice_match > s.lookahead) {
|
|
949
|
-
nice_match = s.lookahead;
|
|
950
|
-
}
|
|
951
|
-
do {
|
|
952
|
-
match = cur_match;
|
|
953
|
-
if (_win[match + best_len] !== scan_end || _win[match + best_len - 1] !== scan_end1 || _win[match] !== _win[scan] || _win[++match] !== _win[scan + 1]) {
|
|
954
|
-
continue;
|
|
955
|
-
}
|
|
956
|
-
scan += 2;
|
|
957
|
-
match++;
|
|
958
|
-
do {
|
|
959
|
-
} while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && scan < strend);
|
|
960
|
-
len = MAX_MATCH - (strend - scan);
|
|
961
|
-
scan = strend - MAX_MATCH;
|
|
962
|
-
if (len > best_len) {
|
|
963
|
-
s.match_start = cur_match;
|
|
964
|
-
best_len = len;
|
|
965
|
-
if (len >= nice_match) {
|
|
966
|
-
break;
|
|
967
|
-
}
|
|
968
|
-
scan_end1 = _win[scan + best_len - 1];
|
|
969
|
-
scan_end = _win[scan + best_len];
|
|
970
|
-
}
|
|
971
|
-
} while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);
|
|
972
|
-
if (best_len <= s.lookahead) {
|
|
973
|
-
return best_len;
|
|
974
|
-
}
|
|
975
|
-
return s.lookahead;
|
|
976
|
-
}
|
|
977
|
-
function fill_window(s) {
|
|
978
|
-
var _w_size = s.w_size;
|
|
979
|
-
var p, n, m, more, str;
|
|
980
|
-
do {
|
|
981
|
-
more = s.window_size - s.lookahead - s.strstart;
|
|
982
|
-
if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {
|
|
983
|
-
utils.arraySet(s.window, s.window, _w_size, _w_size, 0);
|
|
984
|
-
s.match_start -= _w_size;
|
|
985
|
-
s.strstart -= _w_size;
|
|
986
|
-
s.block_start -= _w_size;
|
|
987
|
-
n = s.hash_size;
|
|
988
|
-
p = n;
|
|
989
|
-
do {
|
|
990
|
-
m = s.head[--p];
|
|
991
|
-
s.head[p] = m >= _w_size ? m - _w_size : 0;
|
|
992
|
-
} while (--n);
|
|
993
|
-
n = _w_size;
|
|
994
|
-
p = n;
|
|
995
|
-
do {
|
|
996
|
-
m = s.prev[--p];
|
|
997
|
-
s.prev[p] = m >= _w_size ? m - _w_size : 0;
|
|
998
|
-
} while (--n);
|
|
999
|
-
more += _w_size;
|
|
1000
|
-
}
|
|
1001
|
-
if (s.strm.avail_in === 0) {
|
|
1002
|
-
break;
|
|
1003
|
-
}
|
|
1004
|
-
n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);
|
|
1005
|
-
s.lookahead += n;
|
|
1006
|
-
if (s.lookahead + s.insert >= MIN_MATCH) {
|
|
1007
|
-
str = s.strstart - s.insert;
|
|
1008
|
-
s.ins_h = s.window[str];
|
|
1009
|
-
s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + 1]) & s.hash_mask;
|
|
1010
|
-
while (s.insert) {
|
|
1011
|
-
s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
|
|
1012
|
-
s.prev[str & s.w_mask] = s.head[s.ins_h];
|
|
1013
|
-
s.head[s.ins_h] = str;
|
|
1014
|
-
str++;
|
|
1015
|
-
s.insert--;
|
|
1016
|
-
if (s.lookahead + s.insert < MIN_MATCH) {
|
|
1017
|
-
break;
|
|
1018
|
-
}
|
|
1019
|
-
}
|
|
1020
|
-
}
|
|
1021
|
-
} while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);
|
|
1022
|
-
}
|
|
1023
|
-
function deflate_stored(s, flush) {
|
|
1024
|
-
var max_block_size = 65535;
|
|
1025
|
-
if (max_block_size > s.pending_buf_size - 5) {
|
|
1026
|
-
max_block_size = s.pending_buf_size - 5;
|
|
1027
|
-
}
|
|
1028
|
-
for (; ; ) {
|
|
1029
|
-
if (s.lookahead <= 1) {
|
|
1030
|
-
fill_window(s);
|
|
1031
|
-
if (s.lookahead === 0 && flush === Z_NO_FLUSH) {
|
|
1032
|
-
return BS_NEED_MORE;
|
|
1033
|
-
}
|
|
1034
|
-
if (s.lookahead === 0) {
|
|
1035
|
-
break;
|
|
1036
|
-
}
|
|
1037
|
-
}
|
|
1038
|
-
s.strstart += s.lookahead;
|
|
1039
|
-
s.lookahead = 0;
|
|
1040
|
-
var max_start = s.block_start + max_block_size;
|
|
1041
|
-
if (s.strstart === 0 || s.strstart >= max_start) {
|
|
1042
|
-
s.lookahead = s.strstart - max_start;
|
|
1043
|
-
s.strstart = max_start;
|
|
1044
|
-
flush_block_only(s, false);
|
|
1045
|
-
if (s.strm.avail_out === 0) {
|
|
1046
|
-
return BS_NEED_MORE;
|
|
1047
|
-
}
|
|
1048
|
-
}
|
|
1049
|
-
if (s.strstart - s.block_start >= s.w_size - MIN_LOOKAHEAD) {
|
|
1050
|
-
flush_block_only(s, false);
|
|
1051
|
-
if (s.strm.avail_out === 0) {
|
|
1052
|
-
return BS_NEED_MORE;
|
|
1053
|
-
}
|
|
1054
|
-
}
|
|
1055
|
-
}
|
|
1056
|
-
s.insert = 0;
|
|
1057
|
-
if (flush === Z_FINISH) {
|
|
1058
|
-
flush_block_only(s, true);
|
|
1059
|
-
if (s.strm.avail_out === 0) {
|
|
1060
|
-
return BS_FINISH_STARTED;
|
|
1061
|
-
}
|
|
1062
|
-
return BS_FINISH_DONE;
|
|
1063
|
-
}
|
|
1064
|
-
if (s.strstart > s.block_start) {
|
|
1065
|
-
flush_block_only(s, false);
|
|
1066
|
-
if (s.strm.avail_out === 0) {
|
|
1067
|
-
return BS_NEED_MORE;
|
|
1068
|
-
}
|
|
1069
|
-
}
|
|
1070
|
-
return BS_NEED_MORE;
|
|
1071
|
-
}
|
|
1072
|
-
function deflate_fast(s, flush) {
|
|
1073
|
-
var hash_head;
|
|
1074
|
-
var bflush;
|
|
1075
|
-
for (; ; ) {
|
|
1076
|
-
if (s.lookahead < MIN_LOOKAHEAD) {
|
|
1077
|
-
fill_window(s);
|
|
1078
|
-
if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
|
|
1079
|
-
return BS_NEED_MORE;
|
|
1080
|
-
}
|
|
1081
|
-
if (s.lookahead === 0) {
|
|
1082
|
-
break;
|
|
1083
|
-
}
|
|
1084
|
-
}
|
|
1085
|
-
hash_head = 0;
|
|
1086
|
-
if (s.lookahead >= MIN_MATCH) {
|
|
1087
|
-
s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
|
|
1088
|
-
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
|
|
1089
|
-
s.head[s.ins_h] = s.strstart;
|
|
1090
|
-
}
|
|
1091
|
-
if (hash_head !== 0 && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {
|
|
1092
|
-
s.match_length = longest_match(s, hash_head);
|
|
1093
|
-
}
|
|
1094
|
-
if (s.match_length >= MIN_MATCH) {
|
|
1095
|
-
bflush = trees2._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);
|
|
1096
|
-
s.lookahead -= s.match_length;
|
|
1097
|
-
if (s.match_length <= s.max_lazy_match && s.lookahead >= MIN_MATCH) {
|
|
1098
|
-
s.match_length--;
|
|
1099
|
-
do {
|
|
1100
|
-
s.strstart++;
|
|
1101
|
-
s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
|
|
1102
|
-
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
|
|
1103
|
-
s.head[s.ins_h] = s.strstart;
|
|
1104
|
-
} while (--s.match_length !== 0);
|
|
1105
|
-
s.strstart++;
|
|
1106
|
-
} else {
|
|
1107
|
-
s.strstart += s.match_length;
|
|
1108
|
-
s.match_length = 0;
|
|
1109
|
-
s.ins_h = s.window[s.strstart];
|
|
1110
|
-
s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + 1]) & s.hash_mask;
|
|
1111
|
-
}
|
|
1112
|
-
} else {
|
|
1113
|
-
bflush = trees2._tr_tally(s, 0, s.window[s.strstart]);
|
|
1114
|
-
s.lookahead--;
|
|
1115
|
-
s.strstart++;
|
|
1116
|
-
}
|
|
1117
|
-
if (bflush) {
|
|
1118
|
-
flush_block_only(s, false);
|
|
1119
|
-
if (s.strm.avail_out === 0) {
|
|
1120
|
-
return BS_NEED_MORE;
|
|
1121
|
-
}
|
|
1122
|
-
}
|
|
1123
|
-
}
|
|
1124
|
-
s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;
|
|
1125
|
-
if (flush === Z_FINISH) {
|
|
1126
|
-
flush_block_only(s, true);
|
|
1127
|
-
if (s.strm.avail_out === 0) {
|
|
1128
|
-
return BS_FINISH_STARTED;
|
|
1129
|
-
}
|
|
1130
|
-
return BS_FINISH_DONE;
|
|
1131
|
-
}
|
|
1132
|
-
if (s.last_lit) {
|
|
1133
|
-
flush_block_only(s, false);
|
|
1134
|
-
if (s.strm.avail_out === 0) {
|
|
1135
|
-
return BS_NEED_MORE;
|
|
1136
|
-
}
|
|
1137
|
-
}
|
|
1138
|
-
return BS_BLOCK_DONE;
|
|
1139
|
-
}
|
|
1140
|
-
function deflate_slow(s, flush) {
|
|
1141
|
-
var hash_head;
|
|
1142
|
-
var bflush;
|
|
1143
|
-
var max_insert;
|
|
1144
|
-
for (; ; ) {
|
|
1145
|
-
if (s.lookahead < MIN_LOOKAHEAD) {
|
|
1146
|
-
fill_window(s);
|
|
1147
|
-
if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
|
|
1148
|
-
return BS_NEED_MORE;
|
|
1149
|
-
}
|
|
1150
|
-
if (s.lookahead === 0) {
|
|
1151
|
-
break;
|
|
1152
|
-
}
|
|
1153
|
-
}
|
|
1154
|
-
hash_head = 0;
|
|
1155
|
-
if (s.lookahead >= MIN_MATCH) {
|
|
1156
|
-
s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
|
|
1157
|
-
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
|
|
1158
|
-
s.head[s.ins_h] = s.strstart;
|
|
1159
|
-
}
|
|
1160
|
-
s.prev_length = s.match_length;
|
|
1161
|
-
s.prev_match = s.match_start;
|
|
1162
|
-
s.match_length = MIN_MATCH - 1;
|
|
1163
|
-
if (hash_head !== 0 && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {
|
|
1164
|
-
s.match_length = longest_match(s, hash_head);
|
|
1165
|
-
if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096)) {
|
|
1166
|
-
s.match_length = MIN_MATCH - 1;
|
|
1167
|
-
}
|
|
1168
|
-
}
|
|
1169
|
-
if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {
|
|
1170
|
-
max_insert = s.strstart + s.lookahead - MIN_MATCH;
|
|
1171
|
-
bflush = trees2._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);
|
|
1172
|
-
s.lookahead -= s.prev_length - 1;
|
|
1173
|
-
s.prev_length -= 2;
|
|
1174
|
-
do {
|
|
1175
|
-
if (++s.strstart <= max_insert) {
|
|
1176
|
-
s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
|
|
1177
|
-
hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
|
|
1178
|
-
s.head[s.ins_h] = s.strstart;
|
|
1179
|
-
}
|
|
1180
|
-
} while (--s.prev_length !== 0);
|
|
1181
|
-
s.match_available = 0;
|
|
1182
|
-
s.match_length = MIN_MATCH - 1;
|
|
1183
|
-
s.strstart++;
|
|
1184
|
-
if (bflush) {
|
|
1185
|
-
flush_block_only(s, false);
|
|
1186
|
-
if (s.strm.avail_out === 0) {
|
|
1187
|
-
return BS_NEED_MORE;
|
|
1188
|
-
}
|
|
1189
|
-
}
|
|
1190
|
-
} else if (s.match_available) {
|
|
1191
|
-
bflush = trees2._tr_tally(s, 0, s.window[s.strstart - 1]);
|
|
1192
|
-
if (bflush) {
|
|
1193
|
-
flush_block_only(s, false);
|
|
1194
|
-
}
|
|
1195
|
-
s.strstart++;
|
|
1196
|
-
s.lookahead--;
|
|
1197
|
-
if (s.strm.avail_out === 0) {
|
|
1198
|
-
return BS_NEED_MORE;
|
|
1199
|
-
}
|
|
1200
|
-
} else {
|
|
1201
|
-
s.match_available = 1;
|
|
1202
|
-
s.strstart++;
|
|
1203
|
-
s.lookahead--;
|
|
1204
|
-
}
|
|
1205
|
-
}
|
|
1206
|
-
if (s.match_available) {
|
|
1207
|
-
bflush = trees2._tr_tally(s, 0, s.window[s.strstart - 1]);
|
|
1208
|
-
s.match_available = 0;
|
|
1209
|
-
}
|
|
1210
|
-
s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;
|
|
1211
|
-
if (flush === Z_FINISH) {
|
|
1212
|
-
flush_block_only(s, true);
|
|
1213
|
-
if (s.strm.avail_out === 0) {
|
|
1214
|
-
return BS_FINISH_STARTED;
|
|
1215
|
-
}
|
|
1216
|
-
return BS_FINISH_DONE;
|
|
1217
|
-
}
|
|
1218
|
-
if (s.last_lit) {
|
|
1219
|
-
flush_block_only(s, false);
|
|
1220
|
-
if (s.strm.avail_out === 0) {
|
|
1221
|
-
return BS_NEED_MORE;
|
|
1222
|
-
}
|
|
1223
|
-
}
|
|
1224
|
-
return BS_BLOCK_DONE;
|
|
1225
|
-
}
|
|
1226
|
-
function deflate_rle(s, flush) {
|
|
1227
|
-
var bflush;
|
|
1228
|
-
var prev;
|
|
1229
|
-
var scan, strend;
|
|
1230
|
-
var _win = s.window;
|
|
1231
|
-
for (; ; ) {
|
|
1232
|
-
if (s.lookahead <= MAX_MATCH) {
|
|
1233
|
-
fill_window(s);
|
|
1234
|
-
if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {
|
|
1235
|
-
return BS_NEED_MORE;
|
|
1236
|
-
}
|
|
1237
|
-
if (s.lookahead === 0) {
|
|
1238
|
-
break;
|
|
1239
|
-
}
|
|
1240
|
-
}
|
|
1241
|
-
s.match_length = 0;
|
|
1242
|
-
if (s.lookahead >= MIN_MATCH && s.strstart > 0) {
|
|
1243
|
-
scan = s.strstart - 1;
|
|
1244
|
-
prev = _win[scan];
|
|
1245
|
-
if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {
|
|
1246
|
-
strend = s.strstart + MAX_MATCH;
|
|
1247
|
-
do {
|
|
1248
|
-
} while (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && scan < strend);
|
|
1249
|
-
s.match_length = MAX_MATCH - (strend - scan);
|
|
1250
|
-
if (s.match_length > s.lookahead) {
|
|
1251
|
-
s.match_length = s.lookahead;
|
|
1252
|
-
}
|
|
1253
|
-
}
|
|
1254
|
-
}
|
|
1255
|
-
if (s.match_length >= MIN_MATCH) {
|
|
1256
|
-
bflush = trees2._tr_tally(s, 1, s.match_length - MIN_MATCH);
|
|
1257
|
-
s.lookahead -= s.match_length;
|
|
1258
|
-
s.strstart += s.match_length;
|
|
1259
|
-
s.match_length = 0;
|
|
1260
|
-
} else {
|
|
1261
|
-
bflush = trees2._tr_tally(s, 0, s.window[s.strstart]);
|
|
1262
|
-
s.lookahead--;
|
|
1263
|
-
s.strstart++;
|
|
1264
|
-
}
|
|
1265
|
-
if (bflush) {
|
|
1266
|
-
flush_block_only(s, false);
|
|
1267
|
-
if (s.strm.avail_out === 0) {
|
|
1268
|
-
return BS_NEED_MORE;
|
|
1269
|
-
}
|
|
1270
|
-
}
|
|
1271
|
-
}
|
|
1272
|
-
s.insert = 0;
|
|
1273
|
-
if (flush === Z_FINISH) {
|
|
1274
|
-
flush_block_only(s, true);
|
|
1275
|
-
if (s.strm.avail_out === 0) {
|
|
1276
|
-
return BS_FINISH_STARTED;
|
|
1277
|
-
}
|
|
1278
|
-
return BS_FINISH_DONE;
|
|
1279
|
-
}
|
|
1280
|
-
if (s.last_lit) {
|
|
1281
|
-
flush_block_only(s, false);
|
|
1282
|
-
if (s.strm.avail_out === 0) {
|
|
1283
|
-
return BS_NEED_MORE;
|
|
1284
|
-
}
|
|
1285
|
-
}
|
|
1286
|
-
return BS_BLOCK_DONE;
|
|
1287
|
-
}
|
|
1288
|
-
function deflate_huff(s, flush) {
|
|
1289
|
-
var bflush;
|
|
1290
|
-
for (; ; ) {
|
|
1291
|
-
if (s.lookahead === 0) {
|
|
1292
|
-
fill_window(s);
|
|
1293
|
-
if (s.lookahead === 0) {
|
|
1294
|
-
if (flush === Z_NO_FLUSH) {
|
|
1295
|
-
return BS_NEED_MORE;
|
|
1296
|
-
}
|
|
1297
|
-
break;
|
|
1298
|
-
}
|
|
1299
|
-
}
|
|
1300
|
-
s.match_length = 0;
|
|
1301
|
-
bflush = trees2._tr_tally(s, 0, s.window[s.strstart]);
|
|
1302
|
-
s.lookahead--;
|
|
1303
|
-
s.strstart++;
|
|
1304
|
-
if (bflush) {
|
|
1305
|
-
flush_block_only(s, false);
|
|
1306
|
-
if (s.strm.avail_out === 0) {
|
|
1307
|
-
return BS_NEED_MORE;
|
|
1308
|
-
}
|
|
1309
|
-
}
|
|
1310
|
-
}
|
|
1311
|
-
s.insert = 0;
|
|
1312
|
-
if (flush === Z_FINISH) {
|
|
1313
|
-
flush_block_only(s, true);
|
|
1314
|
-
if (s.strm.avail_out === 0) {
|
|
1315
|
-
return BS_FINISH_STARTED;
|
|
1316
|
-
}
|
|
1317
|
-
return BS_FINISH_DONE;
|
|
1318
|
-
}
|
|
1319
|
-
if (s.last_lit) {
|
|
1320
|
-
flush_block_only(s, false);
|
|
1321
|
-
if (s.strm.avail_out === 0) {
|
|
1322
|
-
return BS_NEED_MORE;
|
|
1323
|
-
}
|
|
1324
|
-
}
|
|
1325
|
-
return BS_BLOCK_DONE;
|
|
1326
|
-
}
|
|
1327
|
-
function Config(good_length, max_lazy, nice_length, max_chain, func) {
|
|
1328
|
-
this.good_length = good_length;
|
|
1329
|
-
this.max_lazy = max_lazy;
|
|
1330
|
-
this.nice_length = nice_length;
|
|
1331
|
-
this.max_chain = max_chain;
|
|
1332
|
-
this.func = func;
|
|
1333
|
-
}
|
|
1334
|
-
var configuration_table;
|
|
1335
|
-
configuration_table = [
|
|
1336
|
-
/* good lazy nice chain */
|
|
1337
|
-
new Config(0, 0, 0, 0, deflate_stored),
|
|
1338
|
-
/* 0 store only */
|
|
1339
|
-
new Config(4, 4, 8, 4, deflate_fast),
|
|
1340
|
-
/* 1 max speed, no lazy matches */
|
|
1341
|
-
new Config(4, 5, 16, 8, deflate_fast),
|
|
1342
|
-
/* 2 */
|
|
1343
|
-
new Config(4, 6, 32, 32, deflate_fast),
|
|
1344
|
-
/* 3 */
|
|
1345
|
-
new Config(4, 4, 16, 16, deflate_slow),
|
|
1346
|
-
/* 4 lazy matches */
|
|
1347
|
-
new Config(8, 16, 32, 32, deflate_slow),
|
|
1348
|
-
/* 5 */
|
|
1349
|
-
new Config(8, 16, 128, 128, deflate_slow),
|
|
1350
|
-
/* 6 */
|
|
1351
|
-
new Config(8, 32, 128, 256, deflate_slow),
|
|
1352
|
-
/* 7 */
|
|
1353
|
-
new Config(32, 128, 258, 1024, deflate_slow),
|
|
1354
|
-
/* 8 */
|
|
1355
|
-
new Config(32, 258, 258, 4096, deflate_slow)
|
|
1356
|
-
/* 9 max compression */
|
|
1357
|
-
];
|
|
1358
|
-
function lm_init(s) {
|
|
1359
|
-
s.window_size = 2 * s.w_size;
|
|
1360
|
-
zero(s.head);
|
|
1361
|
-
s.max_lazy_match = configuration_table[s.level].max_lazy;
|
|
1362
|
-
s.good_match = configuration_table[s.level].good_length;
|
|
1363
|
-
s.nice_match = configuration_table[s.level].nice_length;
|
|
1364
|
-
s.max_chain_length = configuration_table[s.level].max_chain;
|
|
1365
|
-
s.strstart = 0;
|
|
1366
|
-
s.block_start = 0;
|
|
1367
|
-
s.lookahead = 0;
|
|
1368
|
-
s.insert = 0;
|
|
1369
|
-
s.match_length = s.prev_length = MIN_MATCH - 1;
|
|
1370
|
-
s.match_available = 0;
|
|
1371
|
-
s.ins_h = 0;
|
|
1372
|
-
}
|
|
1373
|
-
function DeflateState() {
|
|
1374
|
-
this.strm = null;
|
|
1375
|
-
this.status = 0;
|
|
1376
|
-
this.pending_buf = null;
|
|
1377
|
-
this.pending_buf_size = 0;
|
|
1378
|
-
this.pending_out = 0;
|
|
1379
|
-
this.pending = 0;
|
|
1380
|
-
this.wrap = 0;
|
|
1381
|
-
this.gzhead = null;
|
|
1382
|
-
this.gzindex = 0;
|
|
1383
|
-
this.method = Z_DEFLATED;
|
|
1384
|
-
this.last_flush = -1;
|
|
1385
|
-
this.w_size = 0;
|
|
1386
|
-
this.w_bits = 0;
|
|
1387
|
-
this.w_mask = 0;
|
|
1388
|
-
this.window = null;
|
|
1389
|
-
this.window_size = 0;
|
|
1390
|
-
this.prev = null;
|
|
1391
|
-
this.head = null;
|
|
1392
|
-
this.ins_h = 0;
|
|
1393
|
-
this.hash_size = 0;
|
|
1394
|
-
this.hash_bits = 0;
|
|
1395
|
-
this.hash_mask = 0;
|
|
1396
|
-
this.hash_shift = 0;
|
|
1397
|
-
this.block_start = 0;
|
|
1398
|
-
this.match_length = 0;
|
|
1399
|
-
this.prev_match = 0;
|
|
1400
|
-
this.match_available = 0;
|
|
1401
|
-
this.strstart = 0;
|
|
1402
|
-
this.match_start = 0;
|
|
1403
|
-
this.lookahead = 0;
|
|
1404
|
-
this.prev_length = 0;
|
|
1405
|
-
this.max_chain_length = 0;
|
|
1406
|
-
this.max_lazy_match = 0;
|
|
1407
|
-
this.level = 0;
|
|
1408
|
-
this.strategy = 0;
|
|
1409
|
-
this.good_match = 0;
|
|
1410
|
-
this.nice_match = 0;
|
|
1411
|
-
this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);
|
|
1412
|
-
this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2);
|
|
1413
|
-
this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2);
|
|
1414
|
-
zero(this.dyn_ltree);
|
|
1415
|
-
zero(this.dyn_dtree);
|
|
1416
|
-
zero(this.bl_tree);
|
|
1417
|
-
this.l_desc = null;
|
|
1418
|
-
this.d_desc = null;
|
|
1419
|
-
this.bl_desc = null;
|
|
1420
|
-
this.bl_count = new utils.Buf16(MAX_BITS + 1);
|
|
1421
|
-
this.heap = new utils.Buf16(2 * L_CODES + 1);
|
|
1422
|
-
zero(this.heap);
|
|
1423
|
-
this.heap_len = 0;
|
|
1424
|
-
this.heap_max = 0;
|
|
1425
|
-
this.depth = new utils.Buf16(2 * L_CODES + 1);
|
|
1426
|
-
zero(this.depth);
|
|
1427
|
-
this.l_buf = 0;
|
|
1428
|
-
this.lit_bufsize = 0;
|
|
1429
|
-
this.last_lit = 0;
|
|
1430
|
-
this.d_buf = 0;
|
|
1431
|
-
this.opt_len = 0;
|
|
1432
|
-
this.static_len = 0;
|
|
1433
|
-
this.matches = 0;
|
|
1434
|
-
this.insert = 0;
|
|
1435
|
-
this.bi_buf = 0;
|
|
1436
|
-
this.bi_valid = 0;
|
|
1437
|
-
}
|
|
1438
|
-
function deflateResetKeep(strm) {
|
|
1439
|
-
var s;
|
|
1440
|
-
if (!strm || !strm.state) {
|
|
1441
|
-
return err(strm, Z_STREAM_ERROR);
|
|
1442
|
-
}
|
|
1443
|
-
strm.total_in = strm.total_out = 0;
|
|
1444
|
-
strm.data_type = Z_UNKNOWN;
|
|
1445
|
-
s = strm.state;
|
|
1446
|
-
s.pending = 0;
|
|
1447
|
-
s.pending_out = 0;
|
|
1448
|
-
if (s.wrap < 0) {
|
|
1449
|
-
s.wrap = -s.wrap;
|
|
1450
|
-
}
|
|
1451
|
-
s.status = s.wrap ? INIT_STATE : BUSY_STATE;
|
|
1452
|
-
strm.adler = s.wrap === 2 ? 0 : 1;
|
|
1453
|
-
s.last_flush = Z_NO_FLUSH;
|
|
1454
|
-
trees2._tr_init(s);
|
|
1455
|
-
return Z_OK;
|
|
1456
|
-
}
|
|
1457
|
-
function deflateReset(strm) {
|
|
1458
|
-
var ret = deflateResetKeep(strm);
|
|
1459
|
-
if (ret === Z_OK) {
|
|
1460
|
-
lm_init(strm.state);
|
|
1461
|
-
}
|
|
1462
|
-
return ret;
|
|
1463
|
-
}
|
|
1464
|
-
function deflateSetHeader(strm, head) {
|
|
1465
|
-
if (!strm || !strm.state) {
|
|
1466
|
-
return Z_STREAM_ERROR;
|
|
1467
|
-
}
|
|
1468
|
-
if (strm.state.wrap !== 2) {
|
|
1469
|
-
return Z_STREAM_ERROR;
|
|
1470
|
-
}
|
|
1471
|
-
strm.state.gzhead = head;
|
|
1472
|
-
return Z_OK;
|
|
1473
|
-
}
|
|
1474
|
-
function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {
|
|
1475
|
-
if (!strm) {
|
|
1476
|
-
return Z_STREAM_ERROR;
|
|
1477
|
-
}
|
|
1478
|
-
var wrap = 1;
|
|
1479
|
-
if (level === Z_DEFAULT_COMPRESSION) {
|
|
1480
|
-
level = 6;
|
|
1481
|
-
}
|
|
1482
|
-
if (windowBits < 0) {
|
|
1483
|
-
wrap = 0;
|
|
1484
|
-
windowBits = -windowBits;
|
|
1485
|
-
} else if (windowBits > 15) {
|
|
1486
|
-
wrap = 2;
|
|
1487
|
-
windowBits -= 16;
|
|
1488
|
-
}
|
|
1489
|
-
if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED || windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {
|
|
1490
|
-
return err(strm, Z_STREAM_ERROR);
|
|
1491
|
-
}
|
|
1492
|
-
if (windowBits === 8) {
|
|
1493
|
-
windowBits = 9;
|
|
1494
|
-
}
|
|
1495
|
-
var s = new DeflateState();
|
|
1496
|
-
strm.state = s;
|
|
1497
|
-
s.strm = strm;
|
|
1498
|
-
s.wrap = wrap;
|
|
1499
|
-
s.gzhead = null;
|
|
1500
|
-
s.w_bits = windowBits;
|
|
1501
|
-
s.w_size = 1 << s.w_bits;
|
|
1502
|
-
s.w_mask = s.w_size - 1;
|
|
1503
|
-
s.hash_bits = memLevel + 7;
|
|
1504
|
-
s.hash_size = 1 << s.hash_bits;
|
|
1505
|
-
s.hash_mask = s.hash_size - 1;
|
|
1506
|
-
s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);
|
|
1507
|
-
s.window = new utils.Buf8(s.w_size * 2);
|
|
1508
|
-
s.head = new utils.Buf16(s.hash_size);
|
|
1509
|
-
s.prev = new utils.Buf16(s.w_size);
|
|
1510
|
-
s.lit_bufsize = 1 << memLevel + 6;
|
|
1511
|
-
s.pending_buf_size = s.lit_bufsize * 4;
|
|
1512
|
-
s.pending_buf = new utils.Buf8(s.pending_buf_size);
|
|
1513
|
-
s.d_buf = 1 * s.lit_bufsize;
|
|
1514
|
-
s.l_buf = (1 + 2) * s.lit_bufsize;
|
|
1515
|
-
s.level = level;
|
|
1516
|
-
s.strategy = strategy;
|
|
1517
|
-
s.method = method;
|
|
1518
|
-
return deflateReset(strm);
|
|
1519
|
-
}
|
|
1520
|
-
function deflateInit(strm, level) {
|
|
1521
|
-
return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);
|
|
1522
|
-
}
|
|
1523
|
-
function deflate$12(strm, flush) {
|
|
1524
|
-
var old_flush, s;
|
|
1525
|
-
var beg, val;
|
|
1526
|
-
if (!strm || !strm.state || flush > Z_BLOCK || flush < 0) {
|
|
1527
|
-
return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;
|
|
1528
|
-
}
|
|
1529
|
-
s = strm.state;
|
|
1530
|
-
if (!strm.output || !strm.input && strm.avail_in !== 0 || s.status === FINISH_STATE && flush !== Z_FINISH) {
|
|
1531
|
-
return err(strm, strm.avail_out === 0 ? Z_BUF_ERROR : Z_STREAM_ERROR);
|
|
1532
|
-
}
|
|
1533
|
-
s.strm = strm;
|
|
1534
|
-
old_flush = s.last_flush;
|
|
1535
|
-
s.last_flush = flush;
|
|
1536
|
-
if (s.status === INIT_STATE) {
|
|
1537
|
-
if (s.wrap === 2) {
|
|
1538
|
-
strm.adler = 0;
|
|
1539
|
-
put_byte(s, 31);
|
|
1540
|
-
put_byte(s, 139);
|
|
1541
|
-
put_byte(s, 8);
|
|
1542
|
-
if (!s.gzhead) {
|
|
1543
|
-
put_byte(s, 0);
|
|
1544
|
-
put_byte(s, 0);
|
|
1545
|
-
put_byte(s, 0);
|
|
1546
|
-
put_byte(s, 0);
|
|
1547
|
-
put_byte(s, 0);
|
|
1548
|
-
put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0);
|
|
1549
|
-
put_byte(s, OS_CODE);
|
|
1550
|
-
s.status = BUSY_STATE;
|
|
1551
|
-
} else {
|
|
1552
|
-
put_byte(
|
|
1553
|
-
s,
|
|
1554
|
-
(s.gzhead.text ? 1 : 0) + (s.gzhead.hcrc ? 2 : 0) + (!s.gzhead.extra ? 0 : 4) + (!s.gzhead.name ? 0 : 8) + (!s.gzhead.comment ? 0 : 16)
|
|
1555
|
-
);
|
|
1556
|
-
put_byte(s, s.gzhead.time & 255);
|
|
1557
|
-
put_byte(s, s.gzhead.time >> 8 & 255);
|
|
1558
|
-
put_byte(s, s.gzhead.time >> 16 & 255);
|
|
1559
|
-
put_byte(s, s.gzhead.time >> 24 & 255);
|
|
1560
|
-
put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0);
|
|
1561
|
-
put_byte(s, s.gzhead.os & 255);
|
|
1562
|
-
if (s.gzhead.extra && s.gzhead.extra.length) {
|
|
1563
|
-
put_byte(s, s.gzhead.extra.length & 255);
|
|
1564
|
-
put_byte(s, s.gzhead.extra.length >> 8 & 255);
|
|
1565
|
-
}
|
|
1566
|
-
if (s.gzhead.hcrc) {
|
|
1567
|
-
strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);
|
|
1568
|
-
}
|
|
1569
|
-
s.gzindex = 0;
|
|
1570
|
-
s.status = EXTRA_STATE;
|
|
1571
|
-
}
|
|
1572
|
-
} else {
|
|
1573
|
-
var header = Z_DEFLATED + (s.w_bits - 8 << 4) << 8;
|
|
1574
|
-
var level_flags = -1;
|
|
1575
|
-
if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {
|
|
1576
|
-
level_flags = 0;
|
|
1577
|
-
} else if (s.level < 6) {
|
|
1578
|
-
level_flags = 1;
|
|
1579
|
-
} else if (s.level === 6) {
|
|
1580
|
-
level_flags = 2;
|
|
1581
|
-
} else {
|
|
1582
|
-
level_flags = 3;
|
|
1583
|
-
}
|
|
1584
|
-
header |= level_flags << 6;
|
|
1585
|
-
if (s.strstart !== 0) {
|
|
1586
|
-
header |= PRESET_DICT;
|
|
1587
|
-
}
|
|
1588
|
-
header += 31 - header % 31;
|
|
1589
|
-
s.status = BUSY_STATE;
|
|
1590
|
-
putShortMSB(s, header);
|
|
1591
|
-
if (s.strstart !== 0) {
|
|
1592
|
-
putShortMSB(s, strm.adler >>> 16);
|
|
1593
|
-
putShortMSB(s, strm.adler & 65535);
|
|
1594
|
-
}
|
|
1595
|
-
strm.adler = 1;
|
|
1596
|
-
}
|
|
1597
|
-
}
|
|
1598
|
-
if (s.status === EXTRA_STATE) {
|
|
1599
|
-
if (s.gzhead.extra) {
|
|
1600
|
-
beg = s.pending;
|
|
1601
|
-
while (s.gzindex < (s.gzhead.extra.length & 65535)) {
|
|
1602
|
-
if (s.pending === s.pending_buf_size) {
|
|
1603
|
-
if (s.gzhead.hcrc && s.pending > beg) {
|
|
1604
|
-
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
|
|
1605
|
-
}
|
|
1606
|
-
flush_pending(strm);
|
|
1607
|
-
beg = s.pending;
|
|
1608
|
-
if (s.pending === s.pending_buf_size) {
|
|
1609
|
-
break;
|
|
1610
|
-
}
|
|
1611
|
-
}
|
|
1612
|
-
put_byte(s, s.gzhead.extra[s.gzindex] & 255);
|
|
1613
|
-
s.gzindex++;
|
|
1614
|
-
}
|
|
1615
|
-
if (s.gzhead.hcrc && s.pending > beg) {
|
|
1616
|
-
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
|
|
1617
|
-
}
|
|
1618
|
-
if (s.gzindex === s.gzhead.extra.length) {
|
|
1619
|
-
s.gzindex = 0;
|
|
1620
|
-
s.status = NAME_STATE;
|
|
1621
|
-
}
|
|
1622
|
-
} else {
|
|
1623
|
-
s.status = NAME_STATE;
|
|
1624
|
-
}
|
|
1625
|
-
}
|
|
1626
|
-
if (s.status === NAME_STATE) {
|
|
1627
|
-
if (s.gzhead.name) {
|
|
1628
|
-
beg = s.pending;
|
|
1629
|
-
do {
|
|
1630
|
-
if (s.pending === s.pending_buf_size) {
|
|
1631
|
-
if (s.gzhead.hcrc && s.pending > beg) {
|
|
1632
|
-
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
|
|
1633
|
-
}
|
|
1634
|
-
flush_pending(strm);
|
|
1635
|
-
beg = s.pending;
|
|
1636
|
-
if (s.pending === s.pending_buf_size) {
|
|
1637
|
-
val = 1;
|
|
1638
|
-
break;
|
|
1639
|
-
}
|
|
1640
|
-
}
|
|
1641
|
-
if (s.gzindex < s.gzhead.name.length) {
|
|
1642
|
-
val = s.gzhead.name.charCodeAt(s.gzindex++) & 255;
|
|
1643
|
-
} else {
|
|
1644
|
-
val = 0;
|
|
1645
|
-
}
|
|
1646
|
-
put_byte(s, val);
|
|
1647
|
-
} while (val !== 0);
|
|
1648
|
-
if (s.gzhead.hcrc && s.pending > beg) {
|
|
1649
|
-
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
|
|
1650
|
-
}
|
|
1651
|
-
if (val === 0) {
|
|
1652
|
-
s.gzindex = 0;
|
|
1653
|
-
s.status = COMMENT_STATE;
|
|
1654
|
-
}
|
|
1655
|
-
} else {
|
|
1656
|
-
s.status = COMMENT_STATE;
|
|
1657
|
-
}
|
|
1658
|
-
}
|
|
1659
|
-
if (s.status === COMMENT_STATE) {
|
|
1660
|
-
if (s.gzhead.comment) {
|
|
1661
|
-
beg = s.pending;
|
|
1662
|
-
do {
|
|
1663
|
-
if (s.pending === s.pending_buf_size) {
|
|
1664
|
-
if (s.gzhead.hcrc && s.pending > beg) {
|
|
1665
|
-
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
|
|
1666
|
-
}
|
|
1667
|
-
flush_pending(strm);
|
|
1668
|
-
beg = s.pending;
|
|
1669
|
-
if (s.pending === s.pending_buf_size) {
|
|
1670
|
-
val = 1;
|
|
1671
|
-
break;
|
|
1672
|
-
}
|
|
1673
|
-
}
|
|
1674
|
-
if (s.gzindex < s.gzhead.comment.length) {
|
|
1675
|
-
val = s.gzhead.comment.charCodeAt(s.gzindex++) & 255;
|
|
1676
|
-
} else {
|
|
1677
|
-
val = 0;
|
|
1678
|
-
}
|
|
1679
|
-
put_byte(s, val);
|
|
1680
|
-
} while (val !== 0);
|
|
1681
|
-
if (s.gzhead.hcrc && s.pending > beg) {
|
|
1682
|
-
strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
|
|
1683
|
-
}
|
|
1684
|
-
if (val === 0) {
|
|
1685
|
-
s.status = HCRC_STATE;
|
|
1686
|
-
}
|
|
1687
|
-
} else {
|
|
1688
|
-
s.status = HCRC_STATE;
|
|
1689
|
-
}
|
|
1690
|
-
}
|
|
1691
|
-
if (s.status === HCRC_STATE) {
|
|
1692
|
-
if (s.gzhead.hcrc) {
|
|
1693
|
-
if (s.pending + 2 > s.pending_buf_size) {
|
|
1694
|
-
flush_pending(strm);
|
|
1695
|
-
}
|
|
1696
|
-
if (s.pending + 2 <= s.pending_buf_size) {
|
|
1697
|
-
put_byte(s, strm.adler & 255);
|
|
1698
|
-
put_byte(s, strm.adler >> 8 & 255);
|
|
1699
|
-
strm.adler = 0;
|
|
1700
|
-
s.status = BUSY_STATE;
|
|
1701
|
-
}
|
|
1702
|
-
} else {
|
|
1703
|
-
s.status = BUSY_STATE;
|
|
1704
|
-
}
|
|
1705
|
-
}
|
|
1706
|
-
if (s.pending !== 0) {
|
|
1707
|
-
flush_pending(strm);
|
|
1708
|
-
if (strm.avail_out === 0) {
|
|
1709
|
-
s.last_flush = -1;
|
|
1710
|
-
return Z_OK;
|
|
1711
|
-
}
|
|
1712
|
-
} else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && flush !== Z_FINISH) {
|
|
1713
|
-
return err(strm, Z_BUF_ERROR);
|
|
1714
|
-
}
|
|
1715
|
-
if (s.status === FINISH_STATE && strm.avail_in !== 0) {
|
|
1716
|
-
return err(strm, Z_BUF_ERROR);
|
|
1717
|
-
}
|
|
1718
|
-
if (strm.avail_in !== 0 || s.lookahead !== 0 || flush !== Z_NO_FLUSH && s.status !== FINISH_STATE) {
|
|
1719
|
-
var bstate = s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : s.strategy === Z_RLE ? deflate_rle(s, flush) : configuration_table[s.level].func(s, flush);
|
|
1720
|
-
if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {
|
|
1721
|
-
s.status = FINISH_STATE;
|
|
1722
|
-
}
|
|
1723
|
-
if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {
|
|
1724
|
-
if (strm.avail_out === 0) {
|
|
1725
|
-
s.last_flush = -1;
|
|
1726
|
-
}
|
|
1727
|
-
return Z_OK;
|
|
1728
|
-
}
|
|
1729
|
-
if (bstate === BS_BLOCK_DONE) {
|
|
1730
|
-
if (flush === Z_PARTIAL_FLUSH) {
|
|
1731
|
-
trees2._tr_align(s);
|
|
1732
|
-
} else if (flush !== Z_BLOCK) {
|
|
1733
|
-
trees2._tr_stored_block(s, 0, 0, false);
|
|
1734
|
-
if (flush === Z_FULL_FLUSH) {
|
|
1735
|
-
zero(s.head);
|
|
1736
|
-
if (s.lookahead === 0) {
|
|
1737
|
-
s.strstart = 0;
|
|
1738
|
-
s.block_start = 0;
|
|
1739
|
-
s.insert = 0;
|
|
1740
|
-
}
|
|
1741
|
-
}
|
|
1742
|
-
}
|
|
1743
|
-
flush_pending(strm);
|
|
1744
|
-
if (strm.avail_out === 0) {
|
|
1745
|
-
s.last_flush = -1;
|
|
1746
|
-
return Z_OK;
|
|
1747
|
-
}
|
|
1748
|
-
}
|
|
1749
|
-
}
|
|
1750
|
-
if (flush !== Z_FINISH) {
|
|
1751
|
-
return Z_OK;
|
|
1752
|
-
}
|
|
1753
|
-
if (s.wrap <= 0) {
|
|
1754
|
-
return Z_STREAM_END;
|
|
1755
|
-
}
|
|
1756
|
-
if (s.wrap === 2) {
|
|
1757
|
-
put_byte(s, strm.adler & 255);
|
|
1758
|
-
put_byte(s, strm.adler >> 8 & 255);
|
|
1759
|
-
put_byte(s, strm.adler >> 16 & 255);
|
|
1760
|
-
put_byte(s, strm.adler >> 24 & 255);
|
|
1761
|
-
put_byte(s, strm.total_in & 255);
|
|
1762
|
-
put_byte(s, strm.total_in >> 8 & 255);
|
|
1763
|
-
put_byte(s, strm.total_in >> 16 & 255);
|
|
1764
|
-
put_byte(s, strm.total_in >> 24 & 255);
|
|
1765
|
-
} else {
|
|
1766
|
-
putShortMSB(s, strm.adler >>> 16);
|
|
1767
|
-
putShortMSB(s, strm.adler & 65535);
|
|
1768
|
-
}
|
|
1769
|
-
flush_pending(strm);
|
|
1770
|
-
if (s.wrap > 0) {
|
|
1771
|
-
s.wrap = -s.wrap;
|
|
1772
|
-
}
|
|
1773
|
-
return s.pending !== 0 ? Z_OK : Z_STREAM_END;
|
|
1774
|
-
}
|
|
1775
|
-
function deflateEnd(strm) {
|
|
1776
|
-
var status;
|
|
1777
|
-
if (!strm || !strm.state) {
|
|
1778
|
-
return Z_STREAM_ERROR;
|
|
1779
|
-
}
|
|
1780
|
-
status = strm.state.status;
|
|
1781
|
-
if (status !== INIT_STATE && status !== EXTRA_STATE && status !== NAME_STATE && status !== COMMENT_STATE && status !== HCRC_STATE && status !== BUSY_STATE && status !== FINISH_STATE) {
|
|
1782
|
-
return err(strm, Z_STREAM_ERROR);
|
|
1783
|
-
}
|
|
1784
|
-
strm.state = null;
|
|
1785
|
-
return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;
|
|
1786
|
-
}
|
|
1787
|
-
function deflateSetDictionary(strm, dictionary) {
|
|
1788
|
-
var dictLength = dictionary.length;
|
|
1789
|
-
var s;
|
|
1790
|
-
var str, n;
|
|
1791
|
-
var wrap;
|
|
1792
|
-
var avail;
|
|
1793
|
-
var next;
|
|
1794
|
-
var input;
|
|
1795
|
-
var tmpDict;
|
|
1796
|
-
if (!strm || !strm.state) {
|
|
1797
|
-
return Z_STREAM_ERROR;
|
|
1798
|
-
}
|
|
1799
|
-
s = strm.state;
|
|
1800
|
-
wrap = s.wrap;
|
|
1801
|
-
if (wrap === 2 || wrap === 1 && s.status !== INIT_STATE || s.lookahead) {
|
|
1802
|
-
return Z_STREAM_ERROR;
|
|
1803
|
-
}
|
|
1804
|
-
if (wrap === 1) {
|
|
1805
|
-
strm.adler = adler32(strm.adler, dictionary, dictLength, 0);
|
|
1806
|
-
}
|
|
1807
|
-
s.wrap = 0;
|
|
1808
|
-
if (dictLength >= s.w_size) {
|
|
1809
|
-
if (wrap === 0) {
|
|
1810
|
-
zero(s.head);
|
|
1811
|
-
s.strstart = 0;
|
|
1812
|
-
s.block_start = 0;
|
|
1813
|
-
s.insert = 0;
|
|
1814
|
-
}
|
|
1815
|
-
tmpDict = new utils.Buf8(s.w_size);
|
|
1816
|
-
utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);
|
|
1817
|
-
dictionary = tmpDict;
|
|
1818
|
-
dictLength = s.w_size;
|
|
1819
|
-
}
|
|
1820
|
-
avail = strm.avail_in;
|
|
1821
|
-
next = strm.next_in;
|
|
1822
|
-
input = strm.input;
|
|
1823
|
-
strm.avail_in = dictLength;
|
|
1824
|
-
strm.next_in = 0;
|
|
1825
|
-
strm.input = dictionary;
|
|
1826
|
-
fill_window(s);
|
|
1827
|
-
while (s.lookahead >= MIN_MATCH) {
|
|
1828
|
-
str = s.strstart;
|
|
1829
|
-
n = s.lookahead - (MIN_MATCH - 1);
|
|
1830
|
-
do {
|
|
1831
|
-
s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
|
|
1832
|
-
s.prev[str & s.w_mask] = s.head[s.ins_h];
|
|
1833
|
-
s.head[s.ins_h] = str;
|
|
1834
|
-
str++;
|
|
1835
|
-
} while (--n);
|
|
1836
|
-
s.strstart = str;
|
|
1837
|
-
s.lookahead = MIN_MATCH - 1;
|
|
1838
|
-
fill_window(s);
|
|
1839
|
-
}
|
|
1840
|
-
s.strstart += s.lookahead;
|
|
1841
|
-
s.block_start = s.strstart;
|
|
1842
|
-
s.insert = s.lookahead;
|
|
1843
|
-
s.lookahead = 0;
|
|
1844
|
-
s.match_length = s.prev_length = MIN_MATCH - 1;
|
|
1845
|
-
s.match_available = 0;
|
|
1846
|
-
strm.next_in = next;
|
|
1847
|
-
strm.input = input;
|
|
1848
|
-
strm.avail_in = avail;
|
|
1849
|
-
s.wrap = wrap;
|
|
1850
|
-
return Z_OK;
|
|
1851
|
-
}
|
|
1852
|
-
deflate.deflateInit = deflateInit;
|
|
1853
|
-
deflate.deflateInit2 = deflateInit2;
|
|
1854
|
-
deflate.deflateReset = deflateReset;
|
|
1855
|
-
deflate.deflateResetKeep = deflateResetKeep;
|
|
1856
|
-
deflate.deflateSetHeader = deflateSetHeader;
|
|
1857
|
-
deflate.deflate = deflate$12;
|
|
1858
|
-
deflate.deflateEnd = deflateEnd;
|
|
1859
|
-
deflate.deflateSetDictionary = deflateSetDictionary;
|
|
1860
|
-
deflate.deflateInfo = "pako deflate (from Nodeca project)";
|
|
1861
|
-
return deflate;
|
|
1862
|
-
}
|
|
1863
|
-
var strings = {};
|
|
1864
|
-
var hasRequiredStrings;
|
|
1865
|
-
function requireStrings() {
|
|
1866
|
-
if (hasRequiredStrings) return strings;
|
|
1867
|
-
hasRequiredStrings = 1;
|
|
1868
|
-
var utils = requireCommon();
|
|
1869
|
-
var STR_APPLY_OK = true;
|
|
1870
|
-
var STR_APPLY_UIA_OK = true;
|
|
1871
|
-
try {
|
|
1872
|
-
String.fromCharCode.apply(null, [0]);
|
|
1873
|
-
} catch (__) {
|
|
1874
|
-
STR_APPLY_OK = false;
|
|
1875
|
-
}
|
|
1876
|
-
try {
|
|
1877
|
-
String.fromCharCode.apply(null, new Uint8Array(1));
|
|
1878
|
-
} catch (__) {
|
|
1879
|
-
STR_APPLY_UIA_OK = false;
|
|
1880
|
-
}
|
|
1881
|
-
var _utf8len = new utils.Buf8(256);
|
|
1882
|
-
for (var q = 0; q < 256; q++) {
|
|
1883
|
-
_utf8len[q] = q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1;
|
|
1884
|
-
}
|
|
1885
|
-
_utf8len[254] = _utf8len[254] = 1;
|
|
1886
|
-
strings.string2buf = function(str) {
|
|
1887
|
-
var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;
|
|
1888
|
-
for (m_pos = 0; m_pos < str_len; m_pos++) {
|
|
1889
|
-
c = str.charCodeAt(m_pos);
|
|
1890
|
-
if ((c & 64512) === 55296 && m_pos + 1 < str_len) {
|
|
1891
|
-
c2 = str.charCodeAt(m_pos + 1);
|
|
1892
|
-
if ((c2 & 64512) === 56320) {
|
|
1893
|
-
c = 65536 + (c - 55296 << 10) + (c2 - 56320);
|
|
1894
|
-
m_pos++;
|
|
1895
|
-
}
|
|
1896
|
-
}
|
|
1897
|
-
buf_len += c < 128 ? 1 : c < 2048 ? 2 : c < 65536 ? 3 : 4;
|
|
1898
|
-
}
|
|
1899
|
-
buf = new utils.Buf8(buf_len);
|
|
1900
|
-
for (i = 0, m_pos = 0; i < buf_len; m_pos++) {
|
|
1901
|
-
c = str.charCodeAt(m_pos);
|
|
1902
|
-
if ((c & 64512) === 55296 && m_pos + 1 < str_len) {
|
|
1903
|
-
c2 = str.charCodeAt(m_pos + 1);
|
|
1904
|
-
if ((c2 & 64512) === 56320) {
|
|
1905
|
-
c = 65536 + (c - 55296 << 10) + (c2 - 56320);
|
|
1906
|
-
m_pos++;
|
|
1907
|
-
}
|
|
1908
|
-
}
|
|
1909
|
-
if (c < 128) {
|
|
1910
|
-
buf[i++] = c;
|
|
1911
|
-
} else if (c < 2048) {
|
|
1912
|
-
buf[i++] = 192 | c >>> 6;
|
|
1913
|
-
buf[i++] = 128 | c & 63;
|
|
1914
|
-
} else if (c < 65536) {
|
|
1915
|
-
buf[i++] = 224 | c >>> 12;
|
|
1916
|
-
buf[i++] = 128 | c >>> 6 & 63;
|
|
1917
|
-
buf[i++] = 128 | c & 63;
|
|
1918
|
-
} else {
|
|
1919
|
-
buf[i++] = 240 | c >>> 18;
|
|
1920
|
-
buf[i++] = 128 | c >>> 12 & 63;
|
|
1921
|
-
buf[i++] = 128 | c >>> 6 & 63;
|
|
1922
|
-
buf[i++] = 128 | c & 63;
|
|
1923
|
-
}
|
|
1924
|
-
}
|
|
1925
|
-
return buf;
|
|
1926
|
-
};
|
|
1927
|
-
function buf2binstring(buf, len) {
|
|
1928
|
-
if (len < 65534) {
|
|
1929
|
-
if (buf.subarray && STR_APPLY_UIA_OK || !buf.subarray && STR_APPLY_OK) {
|
|
1930
|
-
return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));
|
|
1931
|
-
}
|
|
1932
|
-
}
|
|
1933
|
-
var result = "";
|
|
1934
|
-
for (var i = 0; i < len; i++) {
|
|
1935
|
-
result += String.fromCharCode(buf[i]);
|
|
1936
|
-
}
|
|
1937
|
-
return result;
|
|
1938
|
-
}
|
|
1939
|
-
strings.buf2binstring = function(buf) {
|
|
1940
|
-
return buf2binstring(buf, buf.length);
|
|
1941
|
-
};
|
|
1942
|
-
strings.binstring2buf = function(str) {
|
|
1943
|
-
var buf = new utils.Buf8(str.length);
|
|
1944
|
-
for (var i = 0, len = buf.length; i < len; i++) {
|
|
1945
|
-
buf[i] = str.charCodeAt(i);
|
|
1946
|
-
}
|
|
1947
|
-
return buf;
|
|
1948
|
-
};
|
|
1949
|
-
strings.buf2string = function(buf, max) {
|
|
1950
|
-
var i, out, c, c_len;
|
|
1951
|
-
var len = max || buf.length;
|
|
1952
|
-
var utf16buf = new Array(len * 2);
|
|
1953
|
-
for (out = 0, i = 0; i < len; ) {
|
|
1954
|
-
c = buf[i++];
|
|
1955
|
-
if (c < 128) {
|
|
1956
|
-
utf16buf[out++] = c;
|
|
1957
|
-
continue;
|
|
1958
|
-
}
|
|
1959
|
-
c_len = _utf8len[c];
|
|
1960
|
-
if (c_len > 4) {
|
|
1961
|
-
utf16buf[out++] = 65533;
|
|
1962
|
-
i += c_len - 1;
|
|
1963
|
-
continue;
|
|
1964
|
-
}
|
|
1965
|
-
c &= c_len === 2 ? 31 : c_len === 3 ? 15 : 7;
|
|
1966
|
-
while (c_len > 1 && i < len) {
|
|
1967
|
-
c = c << 6 | buf[i++] & 63;
|
|
1968
|
-
c_len--;
|
|
1969
|
-
}
|
|
1970
|
-
if (c_len > 1) {
|
|
1971
|
-
utf16buf[out++] = 65533;
|
|
1972
|
-
continue;
|
|
1973
|
-
}
|
|
1974
|
-
if (c < 65536) {
|
|
1975
|
-
utf16buf[out++] = c;
|
|
1976
|
-
} else {
|
|
1977
|
-
c -= 65536;
|
|
1978
|
-
utf16buf[out++] = 55296 | c >> 10 & 1023;
|
|
1979
|
-
utf16buf[out++] = 56320 | c & 1023;
|
|
1980
|
-
}
|
|
1981
|
-
}
|
|
1982
|
-
return buf2binstring(utf16buf, out);
|
|
1983
|
-
};
|
|
1984
|
-
strings.utf8border = function(buf, max) {
|
|
1985
|
-
var pos;
|
|
1986
|
-
max = max || buf.length;
|
|
1987
|
-
if (max > buf.length) {
|
|
1988
|
-
max = buf.length;
|
|
1989
|
-
}
|
|
1990
|
-
pos = max - 1;
|
|
1991
|
-
while (pos >= 0 && (buf[pos] & 192) === 128) {
|
|
1992
|
-
pos--;
|
|
1993
|
-
}
|
|
1994
|
-
if (pos < 0) {
|
|
1995
|
-
return max;
|
|
1996
|
-
}
|
|
1997
|
-
if (pos === 0) {
|
|
1998
|
-
return max;
|
|
1999
|
-
}
|
|
2000
|
-
return pos + _utf8len[buf[pos]] > max ? pos : max;
|
|
2001
|
-
};
|
|
2002
|
-
return strings;
|
|
2003
|
-
}
|
|
2004
|
-
var zstream;
|
|
2005
|
-
var hasRequiredZstream;
|
|
2006
|
-
function requireZstream() {
|
|
2007
|
-
if (hasRequiredZstream) return zstream;
|
|
2008
|
-
hasRequiredZstream = 1;
|
|
2009
|
-
function ZStream() {
|
|
2010
|
-
this.input = null;
|
|
2011
|
-
this.next_in = 0;
|
|
2012
|
-
this.avail_in = 0;
|
|
2013
|
-
this.total_in = 0;
|
|
2014
|
-
this.output = null;
|
|
2015
|
-
this.next_out = 0;
|
|
2016
|
-
this.avail_out = 0;
|
|
2017
|
-
this.total_out = 0;
|
|
2018
|
-
this.msg = "";
|
|
2019
|
-
this.state = null;
|
|
2020
|
-
this.data_type = 2;
|
|
2021
|
-
this.adler = 0;
|
|
2022
|
-
}
|
|
2023
|
-
zstream = ZStream;
|
|
2024
|
-
return zstream;
|
|
2025
|
-
}
|
|
2026
|
-
var hasRequiredDeflate;
|
|
2027
|
-
function requireDeflate() {
|
|
2028
|
-
if (hasRequiredDeflate) return deflate$1;
|
|
2029
|
-
hasRequiredDeflate = 1;
|
|
2030
|
-
var zlib_deflate = requireDeflate$1();
|
|
2031
|
-
var utils = requireCommon();
|
|
2032
|
-
var strings2 = requireStrings();
|
|
2033
|
-
var msg = requireMessages();
|
|
2034
|
-
var ZStream = requireZstream();
|
|
2035
|
-
var toString = Object.prototype.toString;
|
|
2036
|
-
var Z_NO_FLUSH = 0;
|
|
2037
|
-
var Z_FINISH = 4;
|
|
2038
|
-
var Z_OK = 0;
|
|
2039
|
-
var Z_STREAM_END = 1;
|
|
2040
|
-
var Z_SYNC_FLUSH = 2;
|
|
2041
|
-
var Z_DEFAULT_COMPRESSION = -1;
|
|
2042
|
-
var Z_DEFAULT_STRATEGY = 0;
|
|
2043
|
-
var Z_DEFLATED = 8;
|
|
2044
|
-
function Deflate(options) {
|
|
2045
|
-
if (!(this instanceof Deflate)) return new Deflate(options);
|
|
2046
|
-
this.options = utils.assign({
|
|
2047
|
-
level: Z_DEFAULT_COMPRESSION,
|
|
2048
|
-
method: Z_DEFLATED,
|
|
2049
|
-
chunkSize: 16384,
|
|
2050
|
-
windowBits: 15,
|
|
2051
|
-
memLevel: 8,
|
|
2052
|
-
strategy: Z_DEFAULT_STRATEGY,
|
|
2053
|
-
to: ""
|
|
2054
|
-
}, options || {});
|
|
2055
|
-
var opt = this.options;
|
|
2056
|
-
if (opt.raw && opt.windowBits > 0) {
|
|
2057
|
-
opt.windowBits = -opt.windowBits;
|
|
2058
|
-
} else if (opt.gzip && opt.windowBits > 0 && opt.windowBits < 16) {
|
|
2059
|
-
opt.windowBits += 16;
|
|
2060
|
-
}
|
|
2061
|
-
this.err = 0;
|
|
2062
|
-
this.msg = "";
|
|
2063
|
-
this.ended = false;
|
|
2064
|
-
this.chunks = [];
|
|
2065
|
-
this.strm = new ZStream();
|
|
2066
|
-
this.strm.avail_out = 0;
|
|
2067
|
-
var status = zlib_deflate.deflateInit2(
|
|
2068
|
-
this.strm,
|
|
2069
|
-
opt.level,
|
|
2070
|
-
opt.method,
|
|
2071
|
-
opt.windowBits,
|
|
2072
|
-
opt.memLevel,
|
|
2073
|
-
opt.strategy
|
|
2074
|
-
);
|
|
2075
|
-
if (status !== Z_OK) {
|
|
2076
|
-
throw new Error(msg[status]);
|
|
2077
|
-
}
|
|
2078
|
-
if (opt.header) {
|
|
2079
|
-
zlib_deflate.deflateSetHeader(this.strm, opt.header);
|
|
2080
|
-
}
|
|
2081
|
-
if (opt.dictionary) {
|
|
2082
|
-
var dict;
|
|
2083
|
-
if (typeof opt.dictionary === "string") {
|
|
2084
|
-
dict = strings2.string2buf(opt.dictionary);
|
|
2085
|
-
} else if (toString.call(opt.dictionary) === "[object ArrayBuffer]") {
|
|
2086
|
-
dict = new Uint8Array(opt.dictionary);
|
|
2087
|
-
} else {
|
|
2088
|
-
dict = opt.dictionary;
|
|
2089
|
-
}
|
|
2090
|
-
status = zlib_deflate.deflateSetDictionary(this.strm, dict);
|
|
2091
|
-
if (status !== Z_OK) {
|
|
2092
|
-
throw new Error(msg[status]);
|
|
2093
|
-
}
|
|
2094
|
-
this._dict_set = true;
|
|
2095
|
-
}
|
|
2096
|
-
}
|
|
2097
|
-
Deflate.prototype.push = function(data, mode) {
|
|
2098
|
-
var strm = this.strm;
|
|
2099
|
-
var chunkSize = this.options.chunkSize;
|
|
2100
|
-
var status, _mode;
|
|
2101
|
-
if (this.ended) {
|
|
2102
|
-
return false;
|
|
2103
|
-
}
|
|
2104
|
-
_mode = mode === ~~mode ? mode : mode === true ? Z_FINISH : Z_NO_FLUSH;
|
|
2105
|
-
if (typeof data === "string") {
|
|
2106
|
-
strm.input = strings2.string2buf(data);
|
|
2107
|
-
} else if (toString.call(data) === "[object ArrayBuffer]") {
|
|
2108
|
-
strm.input = new Uint8Array(data);
|
|
2109
|
-
} else {
|
|
2110
|
-
strm.input = data;
|
|
2111
|
-
}
|
|
2112
|
-
strm.next_in = 0;
|
|
2113
|
-
strm.avail_in = strm.input.length;
|
|
2114
|
-
do {
|
|
2115
|
-
if (strm.avail_out === 0) {
|
|
2116
|
-
strm.output = new utils.Buf8(chunkSize);
|
|
2117
|
-
strm.next_out = 0;
|
|
2118
|
-
strm.avail_out = chunkSize;
|
|
2119
|
-
}
|
|
2120
|
-
status = zlib_deflate.deflate(strm, _mode);
|
|
2121
|
-
if (status !== Z_STREAM_END && status !== Z_OK) {
|
|
2122
|
-
this.onEnd(status);
|
|
2123
|
-
this.ended = true;
|
|
2124
|
-
return false;
|
|
2125
|
-
}
|
|
2126
|
-
if (strm.avail_out === 0 || strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH)) {
|
|
2127
|
-
if (this.options.to === "string") {
|
|
2128
|
-
this.onData(strings2.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));
|
|
2129
|
-
} else {
|
|
2130
|
-
this.onData(utils.shrinkBuf(strm.output, strm.next_out));
|
|
2131
|
-
}
|
|
2132
|
-
}
|
|
2133
|
-
} while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END);
|
|
2134
|
-
if (_mode === Z_FINISH) {
|
|
2135
|
-
status = zlib_deflate.deflateEnd(this.strm);
|
|
2136
|
-
this.onEnd(status);
|
|
2137
|
-
this.ended = true;
|
|
2138
|
-
return status === Z_OK;
|
|
2139
|
-
}
|
|
2140
|
-
if (_mode === Z_SYNC_FLUSH) {
|
|
2141
|
-
this.onEnd(Z_OK);
|
|
2142
|
-
strm.avail_out = 0;
|
|
2143
|
-
return true;
|
|
2144
|
-
}
|
|
2145
|
-
return true;
|
|
2146
|
-
};
|
|
2147
|
-
Deflate.prototype.onData = function(chunk) {
|
|
2148
|
-
this.chunks.push(chunk);
|
|
2149
|
-
};
|
|
2150
|
-
Deflate.prototype.onEnd = function(status) {
|
|
2151
|
-
if (status === Z_OK) {
|
|
2152
|
-
if (this.options.to === "string") {
|
|
2153
|
-
this.result = this.chunks.join("");
|
|
2154
|
-
} else {
|
|
2155
|
-
this.result = utils.flattenChunks(this.chunks);
|
|
2156
|
-
}
|
|
2157
|
-
}
|
|
2158
|
-
this.chunks = [];
|
|
2159
|
-
this.err = status;
|
|
2160
|
-
this.msg = this.strm.msg;
|
|
2161
|
-
};
|
|
2162
|
-
function deflate2(input, options) {
|
|
2163
|
-
var deflator = new Deflate(options);
|
|
2164
|
-
deflator.push(input, true);
|
|
2165
|
-
if (deflator.err) {
|
|
2166
|
-
throw deflator.msg || msg[deflator.err];
|
|
2167
|
-
}
|
|
2168
|
-
return deflator.result;
|
|
2169
|
-
}
|
|
2170
|
-
function deflateRaw(input, options) {
|
|
2171
|
-
options = options || {};
|
|
2172
|
-
options.raw = true;
|
|
2173
|
-
return deflate2(input, options);
|
|
2174
|
-
}
|
|
2175
|
-
function gzip(input, options) {
|
|
2176
|
-
options = options || {};
|
|
2177
|
-
options.gzip = true;
|
|
2178
|
-
return deflate2(input, options);
|
|
2179
|
-
}
|
|
2180
|
-
deflate$1.Deflate = Deflate;
|
|
2181
|
-
deflate$1.deflate = deflate2;
|
|
2182
|
-
deflate$1.deflateRaw = deflateRaw;
|
|
2183
|
-
deflate$1.gzip = gzip;
|
|
2184
|
-
return deflate$1;
|
|
2185
|
-
}
|
|
2186
|
-
var inflate$1 = {};
|
|
2187
|
-
var inflate = {};
|
|
2188
|
-
var inffast;
|
|
2189
|
-
var hasRequiredInffast;
|
|
2190
|
-
function requireInffast() {
|
|
2191
|
-
if (hasRequiredInffast) return inffast;
|
|
2192
|
-
hasRequiredInffast = 1;
|
|
2193
|
-
var BAD = 30;
|
|
2194
|
-
var TYPE = 12;
|
|
2195
|
-
inffast = function inflate_fast(strm, start) {
|
|
2196
|
-
var state;
|
|
2197
|
-
var _in;
|
|
2198
|
-
var last;
|
|
2199
|
-
var _out;
|
|
2200
|
-
var beg;
|
|
2201
|
-
var end;
|
|
2202
|
-
var dmax;
|
|
2203
|
-
var wsize;
|
|
2204
|
-
var whave;
|
|
2205
|
-
var wnext;
|
|
2206
|
-
var s_window;
|
|
2207
|
-
var hold;
|
|
2208
|
-
var bits;
|
|
2209
|
-
var lcode;
|
|
2210
|
-
var dcode;
|
|
2211
|
-
var lmask;
|
|
2212
|
-
var dmask;
|
|
2213
|
-
var here;
|
|
2214
|
-
var op;
|
|
2215
|
-
var len;
|
|
2216
|
-
var dist;
|
|
2217
|
-
var from;
|
|
2218
|
-
var from_source;
|
|
2219
|
-
var input, output;
|
|
2220
|
-
state = strm.state;
|
|
2221
|
-
_in = strm.next_in;
|
|
2222
|
-
input = strm.input;
|
|
2223
|
-
last = _in + (strm.avail_in - 5);
|
|
2224
|
-
_out = strm.next_out;
|
|
2225
|
-
output = strm.output;
|
|
2226
|
-
beg = _out - (start - strm.avail_out);
|
|
2227
|
-
end = _out + (strm.avail_out - 257);
|
|
2228
|
-
dmax = state.dmax;
|
|
2229
|
-
wsize = state.wsize;
|
|
2230
|
-
whave = state.whave;
|
|
2231
|
-
wnext = state.wnext;
|
|
2232
|
-
s_window = state.window;
|
|
2233
|
-
hold = state.hold;
|
|
2234
|
-
bits = state.bits;
|
|
2235
|
-
lcode = state.lencode;
|
|
2236
|
-
dcode = state.distcode;
|
|
2237
|
-
lmask = (1 << state.lenbits) - 1;
|
|
2238
|
-
dmask = (1 << state.distbits) - 1;
|
|
2239
|
-
top:
|
|
2240
|
-
do {
|
|
2241
|
-
if (bits < 15) {
|
|
2242
|
-
hold += input[_in++] << bits;
|
|
2243
|
-
bits += 8;
|
|
2244
|
-
hold += input[_in++] << bits;
|
|
2245
|
-
bits += 8;
|
|
2246
|
-
}
|
|
2247
|
-
here = lcode[hold & lmask];
|
|
2248
|
-
dolen:
|
|
2249
|
-
for (; ; ) {
|
|
2250
|
-
op = here >>> 24;
|
|
2251
|
-
hold >>>= op;
|
|
2252
|
-
bits -= op;
|
|
2253
|
-
op = here >>> 16 & 255;
|
|
2254
|
-
if (op === 0) {
|
|
2255
|
-
output[_out++] = here & 65535;
|
|
2256
|
-
} else if (op & 16) {
|
|
2257
|
-
len = here & 65535;
|
|
2258
|
-
op &= 15;
|
|
2259
|
-
if (op) {
|
|
2260
|
-
if (bits < op) {
|
|
2261
|
-
hold += input[_in++] << bits;
|
|
2262
|
-
bits += 8;
|
|
2263
|
-
}
|
|
2264
|
-
len += hold & (1 << op) - 1;
|
|
2265
|
-
hold >>>= op;
|
|
2266
|
-
bits -= op;
|
|
2267
|
-
}
|
|
2268
|
-
if (bits < 15) {
|
|
2269
|
-
hold += input[_in++] << bits;
|
|
2270
|
-
bits += 8;
|
|
2271
|
-
hold += input[_in++] << bits;
|
|
2272
|
-
bits += 8;
|
|
2273
|
-
}
|
|
2274
|
-
here = dcode[hold & dmask];
|
|
2275
|
-
dodist:
|
|
2276
|
-
for (; ; ) {
|
|
2277
|
-
op = here >>> 24;
|
|
2278
|
-
hold >>>= op;
|
|
2279
|
-
bits -= op;
|
|
2280
|
-
op = here >>> 16 & 255;
|
|
2281
|
-
if (op & 16) {
|
|
2282
|
-
dist = here & 65535;
|
|
2283
|
-
op &= 15;
|
|
2284
|
-
if (bits < op) {
|
|
2285
|
-
hold += input[_in++] << bits;
|
|
2286
|
-
bits += 8;
|
|
2287
|
-
if (bits < op) {
|
|
2288
|
-
hold += input[_in++] << bits;
|
|
2289
|
-
bits += 8;
|
|
2290
|
-
}
|
|
2291
|
-
}
|
|
2292
|
-
dist += hold & (1 << op) - 1;
|
|
2293
|
-
if (dist > dmax) {
|
|
2294
|
-
strm.msg = "invalid distance too far back";
|
|
2295
|
-
state.mode = BAD;
|
|
2296
|
-
break top;
|
|
2297
|
-
}
|
|
2298
|
-
hold >>>= op;
|
|
2299
|
-
bits -= op;
|
|
2300
|
-
op = _out - beg;
|
|
2301
|
-
if (dist > op) {
|
|
2302
|
-
op = dist - op;
|
|
2303
|
-
if (op > whave) {
|
|
2304
|
-
if (state.sane) {
|
|
2305
|
-
strm.msg = "invalid distance too far back";
|
|
2306
|
-
state.mode = BAD;
|
|
2307
|
-
break top;
|
|
2308
|
-
}
|
|
2309
|
-
}
|
|
2310
|
-
from = 0;
|
|
2311
|
-
from_source = s_window;
|
|
2312
|
-
if (wnext === 0) {
|
|
2313
|
-
from += wsize - op;
|
|
2314
|
-
if (op < len) {
|
|
2315
|
-
len -= op;
|
|
2316
|
-
do {
|
|
2317
|
-
output[_out++] = s_window[from++];
|
|
2318
|
-
} while (--op);
|
|
2319
|
-
from = _out - dist;
|
|
2320
|
-
from_source = output;
|
|
2321
|
-
}
|
|
2322
|
-
} else if (wnext < op) {
|
|
2323
|
-
from += wsize + wnext - op;
|
|
2324
|
-
op -= wnext;
|
|
2325
|
-
if (op < len) {
|
|
2326
|
-
len -= op;
|
|
2327
|
-
do {
|
|
2328
|
-
output[_out++] = s_window[from++];
|
|
2329
|
-
} while (--op);
|
|
2330
|
-
from = 0;
|
|
2331
|
-
if (wnext < len) {
|
|
2332
|
-
op = wnext;
|
|
2333
|
-
len -= op;
|
|
2334
|
-
do {
|
|
2335
|
-
output[_out++] = s_window[from++];
|
|
2336
|
-
} while (--op);
|
|
2337
|
-
from = _out - dist;
|
|
2338
|
-
from_source = output;
|
|
2339
|
-
}
|
|
2340
|
-
}
|
|
2341
|
-
} else {
|
|
2342
|
-
from += wnext - op;
|
|
2343
|
-
if (op < len) {
|
|
2344
|
-
len -= op;
|
|
2345
|
-
do {
|
|
2346
|
-
output[_out++] = s_window[from++];
|
|
2347
|
-
} while (--op);
|
|
2348
|
-
from = _out - dist;
|
|
2349
|
-
from_source = output;
|
|
2350
|
-
}
|
|
2351
|
-
}
|
|
2352
|
-
while (len > 2) {
|
|
2353
|
-
output[_out++] = from_source[from++];
|
|
2354
|
-
output[_out++] = from_source[from++];
|
|
2355
|
-
output[_out++] = from_source[from++];
|
|
2356
|
-
len -= 3;
|
|
2357
|
-
}
|
|
2358
|
-
if (len) {
|
|
2359
|
-
output[_out++] = from_source[from++];
|
|
2360
|
-
if (len > 1) {
|
|
2361
|
-
output[_out++] = from_source[from++];
|
|
2362
|
-
}
|
|
2363
|
-
}
|
|
2364
|
-
} else {
|
|
2365
|
-
from = _out - dist;
|
|
2366
|
-
do {
|
|
2367
|
-
output[_out++] = output[from++];
|
|
2368
|
-
output[_out++] = output[from++];
|
|
2369
|
-
output[_out++] = output[from++];
|
|
2370
|
-
len -= 3;
|
|
2371
|
-
} while (len > 2);
|
|
2372
|
-
if (len) {
|
|
2373
|
-
output[_out++] = output[from++];
|
|
2374
|
-
if (len > 1) {
|
|
2375
|
-
output[_out++] = output[from++];
|
|
2376
|
-
}
|
|
2377
|
-
}
|
|
2378
|
-
}
|
|
2379
|
-
} else if ((op & 64) === 0) {
|
|
2380
|
-
here = dcode[(here & 65535) + (hold & (1 << op) - 1)];
|
|
2381
|
-
continue dodist;
|
|
2382
|
-
} else {
|
|
2383
|
-
strm.msg = "invalid distance code";
|
|
2384
|
-
state.mode = BAD;
|
|
2385
|
-
break top;
|
|
2386
|
-
}
|
|
2387
|
-
break;
|
|
2388
|
-
}
|
|
2389
|
-
} else if ((op & 64) === 0) {
|
|
2390
|
-
here = lcode[(here & 65535) + (hold & (1 << op) - 1)];
|
|
2391
|
-
continue dolen;
|
|
2392
|
-
} else if (op & 32) {
|
|
2393
|
-
state.mode = TYPE;
|
|
2394
|
-
break top;
|
|
2395
|
-
} else {
|
|
2396
|
-
strm.msg = "invalid literal/length code";
|
|
2397
|
-
state.mode = BAD;
|
|
2398
|
-
break top;
|
|
2399
|
-
}
|
|
2400
|
-
break;
|
|
2401
|
-
}
|
|
2402
|
-
} while (_in < last && _out < end);
|
|
2403
|
-
len = bits >> 3;
|
|
2404
|
-
_in -= len;
|
|
2405
|
-
bits -= len << 3;
|
|
2406
|
-
hold &= (1 << bits) - 1;
|
|
2407
|
-
strm.next_in = _in;
|
|
2408
|
-
strm.next_out = _out;
|
|
2409
|
-
strm.avail_in = _in < last ? 5 + (last - _in) : 5 - (_in - last);
|
|
2410
|
-
strm.avail_out = _out < end ? 257 + (end - _out) : 257 - (_out - end);
|
|
2411
|
-
state.hold = hold;
|
|
2412
|
-
state.bits = bits;
|
|
2413
|
-
return;
|
|
2414
|
-
};
|
|
2415
|
-
return inffast;
|
|
2416
|
-
}
|
|
2417
|
-
var inftrees;
|
|
2418
|
-
var hasRequiredInftrees;
|
|
2419
|
-
function requireInftrees() {
|
|
2420
|
-
if (hasRequiredInftrees) return inftrees;
|
|
2421
|
-
hasRequiredInftrees = 1;
|
|
2422
|
-
var utils = requireCommon();
|
|
2423
|
-
var MAXBITS = 15;
|
|
2424
|
-
var ENOUGH_LENS = 852;
|
|
2425
|
-
var ENOUGH_DISTS = 592;
|
|
2426
|
-
var CODES = 0;
|
|
2427
|
-
var LENS = 1;
|
|
2428
|
-
var DISTS = 2;
|
|
2429
|
-
var lbase = [
|
|
2430
|
-
/* Length codes 257..285 base */
|
|
2431
|
-
3,
|
|
2432
|
-
4,
|
|
2433
|
-
5,
|
|
2434
|
-
6,
|
|
2435
|
-
7,
|
|
2436
|
-
8,
|
|
2437
|
-
9,
|
|
2438
|
-
10,
|
|
2439
|
-
11,
|
|
2440
|
-
13,
|
|
2441
|
-
15,
|
|
2442
|
-
17,
|
|
2443
|
-
19,
|
|
2444
|
-
23,
|
|
2445
|
-
27,
|
|
2446
|
-
31,
|
|
2447
|
-
35,
|
|
2448
|
-
43,
|
|
2449
|
-
51,
|
|
2450
|
-
59,
|
|
2451
|
-
67,
|
|
2452
|
-
83,
|
|
2453
|
-
99,
|
|
2454
|
-
115,
|
|
2455
|
-
131,
|
|
2456
|
-
163,
|
|
2457
|
-
195,
|
|
2458
|
-
227,
|
|
2459
|
-
258,
|
|
2460
|
-
0,
|
|
2461
|
-
0
|
|
2462
|
-
];
|
|
2463
|
-
var lext = [
|
|
2464
|
-
/* Length codes 257..285 extra */
|
|
2465
|
-
16,
|
|
2466
|
-
16,
|
|
2467
|
-
16,
|
|
2468
|
-
16,
|
|
2469
|
-
16,
|
|
2470
|
-
16,
|
|
2471
|
-
16,
|
|
2472
|
-
16,
|
|
2473
|
-
17,
|
|
2474
|
-
17,
|
|
2475
|
-
17,
|
|
2476
|
-
17,
|
|
2477
|
-
18,
|
|
2478
|
-
18,
|
|
2479
|
-
18,
|
|
2480
|
-
18,
|
|
2481
|
-
19,
|
|
2482
|
-
19,
|
|
2483
|
-
19,
|
|
2484
|
-
19,
|
|
2485
|
-
20,
|
|
2486
|
-
20,
|
|
2487
|
-
20,
|
|
2488
|
-
20,
|
|
2489
|
-
21,
|
|
2490
|
-
21,
|
|
2491
|
-
21,
|
|
2492
|
-
21,
|
|
2493
|
-
16,
|
|
2494
|
-
72,
|
|
2495
|
-
78
|
|
2496
|
-
];
|
|
2497
|
-
var dbase = [
|
|
2498
|
-
/* Distance codes 0..29 base */
|
|
2499
|
-
1,
|
|
2500
|
-
2,
|
|
2501
|
-
3,
|
|
2502
|
-
4,
|
|
2503
|
-
5,
|
|
2504
|
-
7,
|
|
2505
|
-
9,
|
|
2506
|
-
13,
|
|
2507
|
-
17,
|
|
2508
|
-
25,
|
|
2509
|
-
33,
|
|
2510
|
-
49,
|
|
2511
|
-
65,
|
|
2512
|
-
97,
|
|
2513
|
-
129,
|
|
2514
|
-
193,
|
|
2515
|
-
257,
|
|
2516
|
-
385,
|
|
2517
|
-
513,
|
|
2518
|
-
769,
|
|
2519
|
-
1025,
|
|
2520
|
-
1537,
|
|
2521
|
-
2049,
|
|
2522
|
-
3073,
|
|
2523
|
-
4097,
|
|
2524
|
-
6145,
|
|
2525
|
-
8193,
|
|
2526
|
-
12289,
|
|
2527
|
-
16385,
|
|
2528
|
-
24577,
|
|
2529
|
-
0,
|
|
2530
|
-
0
|
|
2531
|
-
];
|
|
2532
|
-
var dext = [
|
|
2533
|
-
/* Distance codes 0..29 extra */
|
|
2534
|
-
16,
|
|
2535
|
-
16,
|
|
2536
|
-
16,
|
|
2537
|
-
16,
|
|
2538
|
-
17,
|
|
2539
|
-
17,
|
|
2540
|
-
18,
|
|
2541
|
-
18,
|
|
2542
|
-
19,
|
|
2543
|
-
19,
|
|
2544
|
-
20,
|
|
2545
|
-
20,
|
|
2546
|
-
21,
|
|
2547
|
-
21,
|
|
2548
|
-
22,
|
|
2549
|
-
22,
|
|
2550
|
-
23,
|
|
2551
|
-
23,
|
|
2552
|
-
24,
|
|
2553
|
-
24,
|
|
2554
|
-
25,
|
|
2555
|
-
25,
|
|
2556
|
-
26,
|
|
2557
|
-
26,
|
|
2558
|
-
27,
|
|
2559
|
-
27,
|
|
2560
|
-
28,
|
|
2561
|
-
28,
|
|
2562
|
-
29,
|
|
2563
|
-
29,
|
|
2564
|
-
64,
|
|
2565
|
-
64
|
|
2566
|
-
];
|
|
2567
|
-
inftrees = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) {
|
|
2568
|
-
var bits = opts.bits;
|
|
2569
|
-
var len = 0;
|
|
2570
|
-
var sym = 0;
|
|
2571
|
-
var min = 0, max = 0;
|
|
2572
|
-
var root = 0;
|
|
2573
|
-
var curr = 0;
|
|
2574
|
-
var drop = 0;
|
|
2575
|
-
var left = 0;
|
|
2576
|
-
var used = 0;
|
|
2577
|
-
var huff = 0;
|
|
2578
|
-
var incr;
|
|
2579
|
-
var fill;
|
|
2580
|
-
var low;
|
|
2581
|
-
var mask;
|
|
2582
|
-
var next;
|
|
2583
|
-
var base = null;
|
|
2584
|
-
var base_index = 0;
|
|
2585
|
-
var end;
|
|
2586
|
-
var count = new utils.Buf16(MAXBITS + 1);
|
|
2587
|
-
var offs = new utils.Buf16(MAXBITS + 1);
|
|
2588
|
-
var extra = null;
|
|
2589
|
-
var extra_index = 0;
|
|
2590
|
-
var here_bits, here_op, here_val;
|
|
2591
|
-
for (len = 0; len <= MAXBITS; len++) {
|
|
2592
|
-
count[len] = 0;
|
|
2593
|
-
}
|
|
2594
|
-
for (sym = 0; sym < codes; sym++) {
|
|
2595
|
-
count[lens[lens_index + sym]]++;
|
|
2596
|
-
}
|
|
2597
|
-
root = bits;
|
|
2598
|
-
for (max = MAXBITS; max >= 1; max--) {
|
|
2599
|
-
if (count[max] !== 0) {
|
|
2600
|
-
break;
|
|
2601
|
-
}
|
|
2602
|
-
}
|
|
2603
|
-
if (root > max) {
|
|
2604
|
-
root = max;
|
|
2605
|
-
}
|
|
2606
|
-
if (max === 0) {
|
|
2607
|
-
table[table_index++] = 1 << 24 | 64 << 16 | 0;
|
|
2608
|
-
table[table_index++] = 1 << 24 | 64 << 16 | 0;
|
|
2609
|
-
opts.bits = 1;
|
|
2610
|
-
return 0;
|
|
2611
|
-
}
|
|
2612
|
-
for (min = 1; min < max; min++) {
|
|
2613
|
-
if (count[min] !== 0) {
|
|
2614
|
-
break;
|
|
2615
|
-
}
|
|
2616
|
-
}
|
|
2617
|
-
if (root < min) {
|
|
2618
|
-
root = min;
|
|
2619
|
-
}
|
|
2620
|
-
left = 1;
|
|
2621
|
-
for (len = 1; len <= MAXBITS; len++) {
|
|
2622
|
-
left <<= 1;
|
|
2623
|
-
left -= count[len];
|
|
2624
|
-
if (left < 0) {
|
|
2625
|
-
return -1;
|
|
2626
|
-
}
|
|
2627
|
-
}
|
|
2628
|
-
if (left > 0 && (type === CODES || max !== 1)) {
|
|
2629
|
-
return -1;
|
|
2630
|
-
}
|
|
2631
|
-
offs[1] = 0;
|
|
2632
|
-
for (len = 1; len < MAXBITS; len++) {
|
|
2633
|
-
offs[len + 1] = offs[len] + count[len];
|
|
2634
|
-
}
|
|
2635
|
-
for (sym = 0; sym < codes; sym++) {
|
|
2636
|
-
if (lens[lens_index + sym] !== 0) {
|
|
2637
|
-
work[offs[lens[lens_index + sym]]++] = sym;
|
|
2638
|
-
}
|
|
2639
|
-
}
|
|
2640
|
-
if (type === CODES) {
|
|
2641
|
-
base = extra = work;
|
|
2642
|
-
end = 19;
|
|
2643
|
-
} else if (type === LENS) {
|
|
2644
|
-
base = lbase;
|
|
2645
|
-
base_index -= 257;
|
|
2646
|
-
extra = lext;
|
|
2647
|
-
extra_index -= 257;
|
|
2648
|
-
end = 256;
|
|
2649
|
-
} else {
|
|
2650
|
-
base = dbase;
|
|
2651
|
-
extra = dext;
|
|
2652
|
-
end = -1;
|
|
2653
|
-
}
|
|
2654
|
-
huff = 0;
|
|
2655
|
-
sym = 0;
|
|
2656
|
-
len = min;
|
|
2657
|
-
next = table_index;
|
|
2658
|
-
curr = root;
|
|
2659
|
-
drop = 0;
|
|
2660
|
-
low = -1;
|
|
2661
|
-
used = 1 << root;
|
|
2662
|
-
mask = used - 1;
|
|
2663
|
-
if (type === LENS && used > ENOUGH_LENS || type === DISTS && used > ENOUGH_DISTS) {
|
|
2664
|
-
return 1;
|
|
2665
|
-
}
|
|
2666
|
-
for (; ; ) {
|
|
2667
|
-
here_bits = len - drop;
|
|
2668
|
-
if (work[sym] < end) {
|
|
2669
|
-
here_op = 0;
|
|
2670
|
-
here_val = work[sym];
|
|
2671
|
-
} else if (work[sym] > end) {
|
|
2672
|
-
here_op = extra[extra_index + work[sym]];
|
|
2673
|
-
here_val = base[base_index + work[sym]];
|
|
2674
|
-
} else {
|
|
2675
|
-
here_op = 32 + 64;
|
|
2676
|
-
here_val = 0;
|
|
2677
|
-
}
|
|
2678
|
-
incr = 1 << len - drop;
|
|
2679
|
-
fill = 1 << curr;
|
|
2680
|
-
min = fill;
|
|
2681
|
-
do {
|
|
2682
|
-
fill -= incr;
|
|
2683
|
-
table[next + (huff >> drop) + fill] = here_bits << 24 | here_op << 16 | here_val | 0;
|
|
2684
|
-
} while (fill !== 0);
|
|
2685
|
-
incr = 1 << len - 1;
|
|
2686
|
-
while (huff & incr) {
|
|
2687
|
-
incr >>= 1;
|
|
2688
|
-
}
|
|
2689
|
-
if (incr !== 0) {
|
|
2690
|
-
huff &= incr - 1;
|
|
2691
|
-
huff += incr;
|
|
2692
|
-
} else {
|
|
2693
|
-
huff = 0;
|
|
2694
|
-
}
|
|
2695
|
-
sym++;
|
|
2696
|
-
if (--count[len] === 0) {
|
|
2697
|
-
if (len === max) {
|
|
2698
|
-
break;
|
|
2699
|
-
}
|
|
2700
|
-
len = lens[lens_index + work[sym]];
|
|
2701
|
-
}
|
|
2702
|
-
if (len > root && (huff & mask) !== low) {
|
|
2703
|
-
if (drop === 0) {
|
|
2704
|
-
drop = root;
|
|
2705
|
-
}
|
|
2706
|
-
next += min;
|
|
2707
|
-
curr = len - drop;
|
|
2708
|
-
left = 1 << curr;
|
|
2709
|
-
while (curr + drop < max) {
|
|
2710
|
-
left -= count[curr + drop];
|
|
2711
|
-
if (left <= 0) {
|
|
2712
|
-
break;
|
|
2713
|
-
}
|
|
2714
|
-
curr++;
|
|
2715
|
-
left <<= 1;
|
|
2716
|
-
}
|
|
2717
|
-
used += 1 << curr;
|
|
2718
|
-
if (type === LENS && used > ENOUGH_LENS || type === DISTS && used > ENOUGH_DISTS) {
|
|
2719
|
-
return 1;
|
|
2720
|
-
}
|
|
2721
|
-
low = huff & mask;
|
|
2722
|
-
table[low] = root << 24 | curr << 16 | next - table_index | 0;
|
|
2723
|
-
}
|
|
2724
|
-
}
|
|
2725
|
-
if (huff !== 0) {
|
|
2726
|
-
table[next + huff] = len - drop << 24 | 64 << 16 | 0;
|
|
2727
|
-
}
|
|
2728
|
-
opts.bits = root;
|
|
2729
|
-
return 0;
|
|
2730
|
-
};
|
|
2731
|
-
return inftrees;
|
|
2732
|
-
}
|
|
2733
|
-
var hasRequiredInflate$1;
|
|
2734
|
-
function requireInflate$1() {
|
|
2735
|
-
if (hasRequiredInflate$1) return inflate;
|
|
2736
|
-
hasRequiredInflate$1 = 1;
|
|
2737
|
-
var utils = requireCommon();
|
|
2738
|
-
var adler32 = requireAdler32();
|
|
2739
|
-
var crc32 = requireCrc32();
|
|
2740
|
-
var inflate_fast = requireInffast();
|
|
2741
|
-
var inflate_table = requireInftrees();
|
|
2742
|
-
var CODES = 0;
|
|
2743
|
-
var LENS = 1;
|
|
2744
|
-
var DISTS = 2;
|
|
2745
|
-
var Z_FINISH = 4;
|
|
2746
|
-
var Z_BLOCK = 5;
|
|
2747
|
-
var Z_TREES = 6;
|
|
2748
|
-
var Z_OK = 0;
|
|
2749
|
-
var Z_STREAM_END = 1;
|
|
2750
|
-
var Z_NEED_DICT = 2;
|
|
2751
|
-
var Z_STREAM_ERROR = -2;
|
|
2752
|
-
var Z_DATA_ERROR = -3;
|
|
2753
|
-
var Z_MEM_ERROR = -4;
|
|
2754
|
-
var Z_BUF_ERROR = -5;
|
|
2755
|
-
var Z_DEFLATED = 8;
|
|
2756
|
-
var HEAD = 1;
|
|
2757
|
-
var FLAGS = 2;
|
|
2758
|
-
var TIME = 3;
|
|
2759
|
-
var OS = 4;
|
|
2760
|
-
var EXLEN = 5;
|
|
2761
|
-
var EXTRA = 6;
|
|
2762
|
-
var NAME = 7;
|
|
2763
|
-
var COMMENT = 8;
|
|
2764
|
-
var HCRC = 9;
|
|
2765
|
-
var DICTID = 10;
|
|
2766
|
-
var DICT = 11;
|
|
2767
|
-
var TYPE = 12;
|
|
2768
|
-
var TYPEDO = 13;
|
|
2769
|
-
var STORED = 14;
|
|
2770
|
-
var COPY_ = 15;
|
|
2771
|
-
var COPY = 16;
|
|
2772
|
-
var TABLE = 17;
|
|
2773
|
-
var LENLENS = 18;
|
|
2774
|
-
var CODELENS = 19;
|
|
2775
|
-
var LEN_ = 20;
|
|
2776
|
-
var LEN = 21;
|
|
2777
|
-
var LENEXT = 22;
|
|
2778
|
-
var DIST = 23;
|
|
2779
|
-
var DISTEXT = 24;
|
|
2780
|
-
var MATCH = 25;
|
|
2781
|
-
var LIT = 26;
|
|
2782
|
-
var CHECK = 27;
|
|
2783
|
-
var LENGTH = 28;
|
|
2784
|
-
var DONE = 29;
|
|
2785
|
-
var BAD = 30;
|
|
2786
|
-
var MEM = 31;
|
|
2787
|
-
var SYNC = 32;
|
|
2788
|
-
var ENOUGH_LENS = 852;
|
|
2789
|
-
var ENOUGH_DISTS = 592;
|
|
2790
|
-
var MAX_WBITS = 15;
|
|
2791
|
-
var DEF_WBITS = MAX_WBITS;
|
|
2792
|
-
function zswap32(q) {
|
|
2793
|
-
return (q >>> 24 & 255) + (q >>> 8 & 65280) + ((q & 65280) << 8) + ((q & 255) << 24);
|
|
2794
|
-
}
|
|
2795
|
-
function InflateState() {
|
|
2796
|
-
this.mode = 0;
|
|
2797
|
-
this.last = false;
|
|
2798
|
-
this.wrap = 0;
|
|
2799
|
-
this.havedict = false;
|
|
2800
|
-
this.flags = 0;
|
|
2801
|
-
this.dmax = 0;
|
|
2802
|
-
this.check = 0;
|
|
2803
|
-
this.total = 0;
|
|
2804
|
-
this.head = null;
|
|
2805
|
-
this.wbits = 0;
|
|
2806
|
-
this.wsize = 0;
|
|
2807
|
-
this.whave = 0;
|
|
2808
|
-
this.wnext = 0;
|
|
2809
|
-
this.window = null;
|
|
2810
|
-
this.hold = 0;
|
|
2811
|
-
this.bits = 0;
|
|
2812
|
-
this.length = 0;
|
|
2813
|
-
this.offset = 0;
|
|
2814
|
-
this.extra = 0;
|
|
2815
|
-
this.lencode = null;
|
|
2816
|
-
this.distcode = null;
|
|
2817
|
-
this.lenbits = 0;
|
|
2818
|
-
this.distbits = 0;
|
|
2819
|
-
this.ncode = 0;
|
|
2820
|
-
this.nlen = 0;
|
|
2821
|
-
this.ndist = 0;
|
|
2822
|
-
this.have = 0;
|
|
2823
|
-
this.next = null;
|
|
2824
|
-
this.lens = new utils.Buf16(320);
|
|
2825
|
-
this.work = new utils.Buf16(288);
|
|
2826
|
-
this.lendyn = null;
|
|
2827
|
-
this.distdyn = null;
|
|
2828
|
-
this.sane = 0;
|
|
2829
|
-
this.back = 0;
|
|
2830
|
-
this.was = 0;
|
|
2831
|
-
}
|
|
2832
|
-
function inflateResetKeep(strm) {
|
|
2833
|
-
var state;
|
|
2834
|
-
if (!strm || !strm.state) {
|
|
2835
|
-
return Z_STREAM_ERROR;
|
|
2836
|
-
}
|
|
2837
|
-
state = strm.state;
|
|
2838
|
-
strm.total_in = strm.total_out = state.total = 0;
|
|
2839
|
-
strm.msg = "";
|
|
2840
|
-
if (state.wrap) {
|
|
2841
|
-
strm.adler = state.wrap & 1;
|
|
2842
|
-
}
|
|
2843
|
-
state.mode = HEAD;
|
|
2844
|
-
state.last = 0;
|
|
2845
|
-
state.havedict = 0;
|
|
2846
|
-
state.dmax = 32768;
|
|
2847
|
-
state.head = null;
|
|
2848
|
-
state.hold = 0;
|
|
2849
|
-
state.bits = 0;
|
|
2850
|
-
state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);
|
|
2851
|
-
state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);
|
|
2852
|
-
state.sane = 1;
|
|
2853
|
-
state.back = -1;
|
|
2854
|
-
return Z_OK;
|
|
2855
|
-
}
|
|
2856
|
-
function inflateReset(strm) {
|
|
2857
|
-
var state;
|
|
2858
|
-
if (!strm || !strm.state) {
|
|
2859
|
-
return Z_STREAM_ERROR;
|
|
2860
|
-
}
|
|
2861
|
-
state = strm.state;
|
|
2862
|
-
state.wsize = 0;
|
|
2863
|
-
state.whave = 0;
|
|
2864
|
-
state.wnext = 0;
|
|
2865
|
-
return inflateResetKeep(strm);
|
|
2866
|
-
}
|
|
2867
|
-
function inflateReset2(strm, windowBits) {
|
|
2868
|
-
var wrap;
|
|
2869
|
-
var state;
|
|
2870
|
-
if (!strm || !strm.state) {
|
|
2871
|
-
return Z_STREAM_ERROR;
|
|
2872
|
-
}
|
|
2873
|
-
state = strm.state;
|
|
2874
|
-
if (windowBits < 0) {
|
|
2875
|
-
wrap = 0;
|
|
2876
|
-
windowBits = -windowBits;
|
|
2877
|
-
} else {
|
|
2878
|
-
wrap = (windowBits >> 4) + 1;
|
|
2879
|
-
if (windowBits < 48) {
|
|
2880
|
-
windowBits &= 15;
|
|
2881
|
-
}
|
|
2882
|
-
}
|
|
2883
|
-
if (windowBits && (windowBits < 8 || windowBits > 15)) {
|
|
2884
|
-
return Z_STREAM_ERROR;
|
|
2885
|
-
}
|
|
2886
|
-
if (state.window !== null && state.wbits !== windowBits) {
|
|
2887
|
-
state.window = null;
|
|
2888
|
-
}
|
|
2889
|
-
state.wrap = wrap;
|
|
2890
|
-
state.wbits = windowBits;
|
|
2891
|
-
return inflateReset(strm);
|
|
2892
|
-
}
|
|
2893
|
-
function inflateInit2(strm, windowBits) {
|
|
2894
|
-
var ret;
|
|
2895
|
-
var state;
|
|
2896
|
-
if (!strm) {
|
|
2897
|
-
return Z_STREAM_ERROR;
|
|
2898
|
-
}
|
|
2899
|
-
state = new InflateState();
|
|
2900
|
-
strm.state = state;
|
|
2901
|
-
state.window = null;
|
|
2902
|
-
ret = inflateReset2(strm, windowBits);
|
|
2903
|
-
if (ret !== Z_OK) {
|
|
2904
|
-
strm.state = null;
|
|
2905
|
-
}
|
|
2906
|
-
return ret;
|
|
2907
|
-
}
|
|
2908
|
-
function inflateInit(strm) {
|
|
2909
|
-
return inflateInit2(strm, DEF_WBITS);
|
|
2910
|
-
}
|
|
2911
|
-
var virgin = true;
|
|
2912
|
-
var lenfix, distfix;
|
|
2913
|
-
function fixedtables(state) {
|
|
2914
|
-
if (virgin) {
|
|
2915
|
-
var sym;
|
|
2916
|
-
lenfix = new utils.Buf32(512);
|
|
2917
|
-
distfix = new utils.Buf32(32);
|
|
2918
|
-
sym = 0;
|
|
2919
|
-
while (sym < 144) {
|
|
2920
|
-
state.lens[sym++] = 8;
|
|
2921
|
-
}
|
|
2922
|
-
while (sym < 256) {
|
|
2923
|
-
state.lens[sym++] = 9;
|
|
2924
|
-
}
|
|
2925
|
-
while (sym < 280) {
|
|
2926
|
-
state.lens[sym++] = 7;
|
|
2927
|
-
}
|
|
2928
|
-
while (sym < 288) {
|
|
2929
|
-
state.lens[sym++] = 8;
|
|
2930
|
-
}
|
|
2931
|
-
inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });
|
|
2932
|
-
sym = 0;
|
|
2933
|
-
while (sym < 32) {
|
|
2934
|
-
state.lens[sym++] = 5;
|
|
2935
|
-
}
|
|
2936
|
-
inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });
|
|
2937
|
-
virgin = false;
|
|
2938
|
-
}
|
|
2939
|
-
state.lencode = lenfix;
|
|
2940
|
-
state.lenbits = 9;
|
|
2941
|
-
state.distcode = distfix;
|
|
2942
|
-
state.distbits = 5;
|
|
2943
|
-
}
|
|
2944
|
-
function updatewindow(strm, src, end, copy) {
|
|
2945
|
-
var dist;
|
|
2946
|
-
var state = strm.state;
|
|
2947
|
-
if (state.window === null) {
|
|
2948
|
-
state.wsize = 1 << state.wbits;
|
|
2949
|
-
state.wnext = 0;
|
|
2950
|
-
state.whave = 0;
|
|
2951
|
-
state.window = new utils.Buf8(state.wsize);
|
|
2952
|
-
}
|
|
2953
|
-
if (copy >= state.wsize) {
|
|
2954
|
-
utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);
|
|
2955
|
-
state.wnext = 0;
|
|
2956
|
-
state.whave = state.wsize;
|
|
2957
|
-
} else {
|
|
2958
|
-
dist = state.wsize - state.wnext;
|
|
2959
|
-
if (dist > copy) {
|
|
2960
|
-
dist = copy;
|
|
2961
|
-
}
|
|
2962
|
-
utils.arraySet(state.window, src, end - copy, dist, state.wnext);
|
|
2963
|
-
copy -= dist;
|
|
2964
|
-
if (copy) {
|
|
2965
|
-
utils.arraySet(state.window, src, end - copy, copy, 0);
|
|
2966
|
-
state.wnext = copy;
|
|
2967
|
-
state.whave = state.wsize;
|
|
2968
|
-
} else {
|
|
2969
|
-
state.wnext += dist;
|
|
2970
|
-
if (state.wnext === state.wsize) {
|
|
2971
|
-
state.wnext = 0;
|
|
2972
|
-
}
|
|
2973
|
-
if (state.whave < state.wsize) {
|
|
2974
|
-
state.whave += dist;
|
|
2975
|
-
}
|
|
2976
|
-
}
|
|
2977
|
-
}
|
|
2978
|
-
return 0;
|
|
2979
|
-
}
|
|
2980
|
-
function inflate$12(strm, flush) {
|
|
2981
|
-
var state;
|
|
2982
|
-
var input, output;
|
|
2983
|
-
var next;
|
|
2984
|
-
var put;
|
|
2985
|
-
var have, left;
|
|
2986
|
-
var hold;
|
|
2987
|
-
var bits;
|
|
2988
|
-
var _in, _out;
|
|
2989
|
-
var copy;
|
|
2990
|
-
var from;
|
|
2991
|
-
var from_source;
|
|
2992
|
-
var here = 0;
|
|
2993
|
-
var here_bits, here_op, here_val;
|
|
2994
|
-
var last_bits, last_op, last_val;
|
|
2995
|
-
var len;
|
|
2996
|
-
var ret;
|
|
2997
|
-
var hbuf = new utils.Buf8(4);
|
|
2998
|
-
var opts;
|
|
2999
|
-
var n;
|
|
3000
|
-
var order = (
|
|
3001
|
-
/* permutation of code lengths */
|
|
3002
|
-
[16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]
|
|
3003
|
-
);
|
|
3004
|
-
if (!strm || !strm.state || !strm.output || !strm.input && strm.avail_in !== 0) {
|
|
3005
|
-
return Z_STREAM_ERROR;
|
|
3006
|
-
}
|
|
3007
|
-
state = strm.state;
|
|
3008
|
-
if (state.mode === TYPE) {
|
|
3009
|
-
state.mode = TYPEDO;
|
|
3010
|
-
}
|
|
3011
|
-
put = strm.next_out;
|
|
3012
|
-
output = strm.output;
|
|
3013
|
-
left = strm.avail_out;
|
|
3014
|
-
next = strm.next_in;
|
|
3015
|
-
input = strm.input;
|
|
3016
|
-
have = strm.avail_in;
|
|
3017
|
-
hold = state.hold;
|
|
3018
|
-
bits = state.bits;
|
|
3019
|
-
_in = have;
|
|
3020
|
-
_out = left;
|
|
3021
|
-
ret = Z_OK;
|
|
3022
|
-
inf_leave:
|
|
3023
|
-
for (; ; ) {
|
|
3024
|
-
switch (state.mode) {
|
|
3025
|
-
case HEAD:
|
|
3026
|
-
if (state.wrap === 0) {
|
|
3027
|
-
state.mode = TYPEDO;
|
|
3028
|
-
break;
|
|
3029
|
-
}
|
|
3030
|
-
while (bits < 16) {
|
|
3031
|
-
if (have === 0) {
|
|
3032
|
-
break inf_leave;
|
|
3033
|
-
}
|
|
3034
|
-
have--;
|
|
3035
|
-
hold += input[next++] << bits;
|
|
3036
|
-
bits += 8;
|
|
3037
|
-
}
|
|
3038
|
-
if (state.wrap & 2 && hold === 35615) {
|
|
3039
|
-
state.check = 0;
|
|
3040
|
-
hbuf[0] = hold & 255;
|
|
3041
|
-
hbuf[1] = hold >>> 8 & 255;
|
|
3042
|
-
state.check = crc32(state.check, hbuf, 2, 0);
|
|
3043
|
-
hold = 0;
|
|
3044
|
-
bits = 0;
|
|
3045
|
-
state.mode = FLAGS;
|
|
3046
|
-
break;
|
|
3047
|
-
}
|
|
3048
|
-
state.flags = 0;
|
|
3049
|
-
if (state.head) {
|
|
3050
|
-
state.head.done = false;
|
|
3051
|
-
}
|
|
3052
|
-
if (!(state.wrap & 1) || /* check if zlib header allowed */
|
|
3053
|
-
(((hold & 255) << 8) + (hold >> 8)) % 31) {
|
|
3054
|
-
strm.msg = "incorrect header check";
|
|
3055
|
-
state.mode = BAD;
|
|
3056
|
-
break;
|
|
3057
|
-
}
|
|
3058
|
-
if ((hold & 15) !== Z_DEFLATED) {
|
|
3059
|
-
strm.msg = "unknown compression method";
|
|
3060
|
-
state.mode = BAD;
|
|
3061
|
-
break;
|
|
3062
|
-
}
|
|
3063
|
-
hold >>>= 4;
|
|
3064
|
-
bits -= 4;
|
|
3065
|
-
len = (hold & 15) + 8;
|
|
3066
|
-
if (state.wbits === 0) {
|
|
3067
|
-
state.wbits = len;
|
|
3068
|
-
} else if (len > state.wbits) {
|
|
3069
|
-
strm.msg = "invalid window size";
|
|
3070
|
-
state.mode = BAD;
|
|
3071
|
-
break;
|
|
3072
|
-
}
|
|
3073
|
-
state.dmax = 1 << len;
|
|
3074
|
-
strm.adler = state.check = 1;
|
|
3075
|
-
state.mode = hold & 512 ? DICTID : TYPE;
|
|
3076
|
-
hold = 0;
|
|
3077
|
-
bits = 0;
|
|
3078
|
-
break;
|
|
3079
|
-
case FLAGS:
|
|
3080
|
-
while (bits < 16) {
|
|
3081
|
-
if (have === 0) {
|
|
3082
|
-
break inf_leave;
|
|
3083
|
-
}
|
|
3084
|
-
have--;
|
|
3085
|
-
hold += input[next++] << bits;
|
|
3086
|
-
bits += 8;
|
|
3087
|
-
}
|
|
3088
|
-
state.flags = hold;
|
|
3089
|
-
if ((state.flags & 255) !== Z_DEFLATED) {
|
|
3090
|
-
strm.msg = "unknown compression method";
|
|
3091
|
-
state.mode = BAD;
|
|
3092
|
-
break;
|
|
3093
|
-
}
|
|
3094
|
-
if (state.flags & 57344) {
|
|
3095
|
-
strm.msg = "unknown header flags set";
|
|
3096
|
-
state.mode = BAD;
|
|
3097
|
-
break;
|
|
3098
|
-
}
|
|
3099
|
-
if (state.head) {
|
|
3100
|
-
state.head.text = hold >> 8 & 1;
|
|
3101
|
-
}
|
|
3102
|
-
if (state.flags & 512) {
|
|
3103
|
-
hbuf[0] = hold & 255;
|
|
3104
|
-
hbuf[1] = hold >>> 8 & 255;
|
|
3105
|
-
state.check = crc32(state.check, hbuf, 2, 0);
|
|
3106
|
-
}
|
|
3107
|
-
hold = 0;
|
|
3108
|
-
bits = 0;
|
|
3109
|
-
state.mode = TIME;
|
|
3110
|
-
/* falls through */
|
|
3111
|
-
case TIME:
|
|
3112
|
-
while (bits < 32) {
|
|
3113
|
-
if (have === 0) {
|
|
3114
|
-
break inf_leave;
|
|
3115
|
-
}
|
|
3116
|
-
have--;
|
|
3117
|
-
hold += input[next++] << bits;
|
|
3118
|
-
bits += 8;
|
|
3119
|
-
}
|
|
3120
|
-
if (state.head) {
|
|
3121
|
-
state.head.time = hold;
|
|
3122
|
-
}
|
|
3123
|
-
if (state.flags & 512) {
|
|
3124
|
-
hbuf[0] = hold & 255;
|
|
3125
|
-
hbuf[1] = hold >>> 8 & 255;
|
|
3126
|
-
hbuf[2] = hold >>> 16 & 255;
|
|
3127
|
-
hbuf[3] = hold >>> 24 & 255;
|
|
3128
|
-
state.check = crc32(state.check, hbuf, 4, 0);
|
|
3129
|
-
}
|
|
3130
|
-
hold = 0;
|
|
3131
|
-
bits = 0;
|
|
3132
|
-
state.mode = OS;
|
|
3133
|
-
/* falls through */
|
|
3134
|
-
case OS:
|
|
3135
|
-
while (bits < 16) {
|
|
3136
|
-
if (have === 0) {
|
|
3137
|
-
break inf_leave;
|
|
3138
|
-
}
|
|
3139
|
-
have--;
|
|
3140
|
-
hold += input[next++] << bits;
|
|
3141
|
-
bits += 8;
|
|
3142
|
-
}
|
|
3143
|
-
if (state.head) {
|
|
3144
|
-
state.head.xflags = hold & 255;
|
|
3145
|
-
state.head.os = hold >> 8;
|
|
3146
|
-
}
|
|
3147
|
-
if (state.flags & 512) {
|
|
3148
|
-
hbuf[0] = hold & 255;
|
|
3149
|
-
hbuf[1] = hold >>> 8 & 255;
|
|
3150
|
-
state.check = crc32(state.check, hbuf, 2, 0);
|
|
3151
|
-
}
|
|
3152
|
-
hold = 0;
|
|
3153
|
-
bits = 0;
|
|
3154
|
-
state.mode = EXLEN;
|
|
3155
|
-
/* falls through */
|
|
3156
|
-
case EXLEN:
|
|
3157
|
-
if (state.flags & 1024) {
|
|
3158
|
-
while (bits < 16) {
|
|
3159
|
-
if (have === 0) {
|
|
3160
|
-
break inf_leave;
|
|
3161
|
-
}
|
|
3162
|
-
have--;
|
|
3163
|
-
hold += input[next++] << bits;
|
|
3164
|
-
bits += 8;
|
|
3165
|
-
}
|
|
3166
|
-
state.length = hold;
|
|
3167
|
-
if (state.head) {
|
|
3168
|
-
state.head.extra_len = hold;
|
|
3169
|
-
}
|
|
3170
|
-
if (state.flags & 512) {
|
|
3171
|
-
hbuf[0] = hold & 255;
|
|
3172
|
-
hbuf[1] = hold >>> 8 & 255;
|
|
3173
|
-
state.check = crc32(state.check, hbuf, 2, 0);
|
|
3174
|
-
}
|
|
3175
|
-
hold = 0;
|
|
3176
|
-
bits = 0;
|
|
3177
|
-
} else if (state.head) {
|
|
3178
|
-
state.head.extra = null;
|
|
3179
|
-
}
|
|
3180
|
-
state.mode = EXTRA;
|
|
3181
|
-
/* falls through */
|
|
3182
|
-
case EXTRA:
|
|
3183
|
-
if (state.flags & 1024) {
|
|
3184
|
-
copy = state.length;
|
|
3185
|
-
if (copy > have) {
|
|
3186
|
-
copy = have;
|
|
3187
|
-
}
|
|
3188
|
-
if (copy) {
|
|
3189
|
-
if (state.head) {
|
|
3190
|
-
len = state.head.extra_len - state.length;
|
|
3191
|
-
if (!state.head.extra) {
|
|
3192
|
-
state.head.extra = new Array(state.head.extra_len);
|
|
3193
|
-
}
|
|
3194
|
-
utils.arraySet(
|
|
3195
|
-
state.head.extra,
|
|
3196
|
-
input,
|
|
3197
|
-
next,
|
|
3198
|
-
// extra field is limited to 65536 bytes
|
|
3199
|
-
// - no need for additional size check
|
|
3200
|
-
copy,
|
|
3201
|
-
/*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
|
|
3202
|
-
len
|
|
3203
|
-
);
|
|
3204
|
-
}
|
|
3205
|
-
if (state.flags & 512) {
|
|
3206
|
-
state.check = crc32(state.check, input, copy, next);
|
|
3207
|
-
}
|
|
3208
|
-
have -= copy;
|
|
3209
|
-
next += copy;
|
|
3210
|
-
state.length -= copy;
|
|
3211
|
-
}
|
|
3212
|
-
if (state.length) {
|
|
3213
|
-
break inf_leave;
|
|
3214
|
-
}
|
|
3215
|
-
}
|
|
3216
|
-
state.length = 0;
|
|
3217
|
-
state.mode = NAME;
|
|
3218
|
-
/* falls through */
|
|
3219
|
-
case NAME:
|
|
3220
|
-
if (state.flags & 2048) {
|
|
3221
|
-
if (have === 0) {
|
|
3222
|
-
break inf_leave;
|
|
3223
|
-
}
|
|
3224
|
-
copy = 0;
|
|
3225
|
-
do {
|
|
3226
|
-
len = input[next + copy++];
|
|
3227
|
-
if (state.head && len && state.length < 65536) {
|
|
3228
|
-
state.head.name += String.fromCharCode(len);
|
|
3229
|
-
}
|
|
3230
|
-
} while (len && copy < have);
|
|
3231
|
-
if (state.flags & 512) {
|
|
3232
|
-
state.check = crc32(state.check, input, copy, next);
|
|
3233
|
-
}
|
|
3234
|
-
have -= copy;
|
|
3235
|
-
next += copy;
|
|
3236
|
-
if (len) {
|
|
3237
|
-
break inf_leave;
|
|
3238
|
-
}
|
|
3239
|
-
} else if (state.head) {
|
|
3240
|
-
state.head.name = null;
|
|
3241
|
-
}
|
|
3242
|
-
state.length = 0;
|
|
3243
|
-
state.mode = COMMENT;
|
|
3244
|
-
/* falls through */
|
|
3245
|
-
case COMMENT:
|
|
3246
|
-
if (state.flags & 4096) {
|
|
3247
|
-
if (have === 0) {
|
|
3248
|
-
break inf_leave;
|
|
3249
|
-
}
|
|
3250
|
-
copy = 0;
|
|
3251
|
-
do {
|
|
3252
|
-
len = input[next + copy++];
|
|
3253
|
-
if (state.head && len && state.length < 65536) {
|
|
3254
|
-
state.head.comment += String.fromCharCode(len);
|
|
3255
|
-
}
|
|
3256
|
-
} while (len && copy < have);
|
|
3257
|
-
if (state.flags & 512) {
|
|
3258
|
-
state.check = crc32(state.check, input, copy, next);
|
|
3259
|
-
}
|
|
3260
|
-
have -= copy;
|
|
3261
|
-
next += copy;
|
|
3262
|
-
if (len) {
|
|
3263
|
-
break inf_leave;
|
|
3264
|
-
}
|
|
3265
|
-
} else if (state.head) {
|
|
3266
|
-
state.head.comment = null;
|
|
3267
|
-
}
|
|
3268
|
-
state.mode = HCRC;
|
|
3269
|
-
/* falls through */
|
|
3270
|
-
case HCRC:
|
|
3271
|
-
if (state.flags & 512) {
|
|
3272
|
-
while (bits < 16) {
|
|
3273
|
-
if (have === 0) {
|
|
3274
|
-
break inf_leave;
|
|
3275
|
-
}
|
|
3276
|
-
have--;
|
|
3277
|
-
hold += input[next++] << bits;
|
|
3278
|
-
bits += 8;
|
|
3279
|
-
}
|
|
3280
|
-
if (hold !== (state.check & 65535)) {
|
|
3281
|
-
strm.msg = "header crc mismatch";
|
|
3282
|
-
state.mode = BAD;
|
|
3283
|
-
break;
|
|
3284
|
-
}
|
|
3285
|
-
hold = 0;
|
|
3286
|
-
bits = 0;
|
|
3287
|
-
}
|
|
3288
|
-
if (state.head) {
|
|
3289
|
-
state.head.hcrc = state.flags >> 9 & 1;
|
|
3290
|
-
state.head.done = true;
|
|
3291
|
-
}
|
|
3292
|
-
strm.adler = state.check = 0;
|
|
3293
|
-
state.mode = TYPE;
|
|
3294
|
-
break;
|
|
3295
|
-
case DICTID:
|
|
3296
|
-
while (bits < 32) {
|
|
3297
|
-
if (have === 0) {
|
|
3298
|
-
break inf_leave;
|
|
3299
|
-
}
|
|
3300
|
-
have--;
|
|
3301
|
-
hold += input[next++] << bits;
|
|
3302
|
-
bits += 8;
|
|
3303
|
-
}
|
|
3304
|
-
strm.adler = state.check = zswap32(hold);
|
|
3305
|
-
hold = 0;
|
|
3306
|
-
bits = 0;
|
|
3307
|
-
state.mode = DICT;
|
|
3308
|
-
/* falls through */
|
|
3309
|
-
case DICT:
|
|
3310
|
-
if (state.havedict === 0) {
|
|
3311
|
-
strm.next_out = put;
|
|
3312
|
-
strm.avail_out = left;
|
|
3313
|
-
strm.next_in = next;
|
|
3314
|
-
strm.avail_in = have;
|
|
3315
|
-
state.hold = hold;
|
|
3316
|
-
state.bits = bits;
|
|
3317
|
-
return Z_NEED_DICT;
|
|
3318
|
-
}
|
|
3319
|
-
strm.adler = state.check = 1;
|
|
3320
|
-
state.mode = TYPE;
|
|
3321
|
-
/* falls through */
|
|
3322
|
-
case TYPE:
|
|
3323
|
-
if (flush === Z_BLOCK || flush === Z_TREES) {
|
|
3324
|
-
break inf_leave;
|
|
3325
|
-
}
|
|
3326
|
-
/* falls through */
|
|
3327
|
-
case TYPEDO:
|
|
3328
|
-
if (state.last) {
|
|
3329
|
-
hold >>>= bits & 7;
|
|
3330
|
-
bits -= bits & 7;
|
|
3331
|
-
state.mode = CHECK;
|
|
3332
|
-
break;
|
|
3333
|
-
}
|
|
3334
|
-
while (bits < 3) {
|
|
3335
|
-
if (have === 0) {
|
|
3336
|
-
break inf_leave;
|
|
3337
|
-
}
|
|
3338
|
-
have--;
|
|
3339
|
-
hold += input[next++] << bits;
|
|
3340
|
-
bits += 8;
|
|
3341
|
-
}
|
|
3342
|
-
state.last = hold & 1;
|
|
3343
|
-
hold >>>= 1;
|
|
3344
|
-
bits -= 1;
|
|
3345
|
-
switch (hold & 3) {
|
|
3346
|
-
case 0:
|
|
3347
|
-
state.mode = STORED;
|
|
3348
|
-
break;
|
|
3349
|
-
case 1:
|
|
3350
|
-
fixedtables(state);
|
|
3351
|
-
state.mode = LEN_;
|
|
3352
|
-
if (flush === Z_TREES) {
|
|
3353
|
-
hold >>>= 2;
|
|
3354
|
-
bits -= 2;
|
|
3355
|
-
break inf_leave;
|
|
3356
|
-
}
|
|
3357
|
-
break;
|
|
3358
|
-
case 2:
|
|
3359
|
-
state.mode = TABLE;
|
|
3360
|
-
break;
|
|
3361
|
-
case 3:
|
|
3362
|
-
strm.msg = "invalid block type";
|
|
3363
|
-
state.mode = BAD;
|
|
3364
|
-
}
|
|
3365
|
-
hold >>>= 2;
|
|
3366
|
-
bits -= 2;
|
|
3367
|
-
break;
|
|
3368
|
-
case STORED:
|
|
3369
|
-
hold >>>= bits & 7;
|
|
3370
|
-
bits -= bits & 7;
|
|
3371
|
-
while (bits < 32) {
|
|
3372
|
-
if (have === 0) {
|
|
3373
|
-
break inf_leave;
|
|
3374
|
-
}
|
|
3375
|
-
have--;
|
|
3376
|
-
hold += input[next++] << bits;
|
|
3377
|
-
bits += 8;
|
|
3378
|
-
}
|
|
3379
|
-
if ((hold & 65535) !== (hold >>> 16 ^ 65535)) {
|
|
3380
|
-
strm.msg = "invalid stored block lengths";
|
|
3381
|
-
state.mode = BAD;
|
|
3382
|
-
break;
|
|
3383
|
-
}
|
|
3384
|
-
state.length = hold & 65535;
|
|
3385
|
-
hold = 0;
|
|
3386
|
-
bits = 0;
|
|
3387
|
-
state.mode = COPY_;
|
|
3388
|
-
if (flush === Z_TREES) {
|
|
3389
|
-
break inf_leave;
|
|
3390
|
-
}
|
|
3391
|
-
/* falls through */
|
|
3392
|
-
case COPY_:
|
|
3393
|
-
state.mode = COPY;
|
|
3394
|
-
/* falls through */
|
|
3395
|
-
case COPY:
|
|
3396
|
-
copy = state.length;
|
|
3397
|
-
if (copy) {
|
|
3398
|
-
if (copy > have) {
|
|
3399
|
-
copy = have;
|
|
3400
|
-
}
|
|
3401
|
-
if (copy > left) {
|
|
3402
|
-
copy = left;
|
|
3403
|
-
}
|
|
3404
|
-
if (copy === 0) {
|
|
3405
|
-
break inf_leave;
|
|
3406
|
-
}
|
|
3407
|
-
utils.arraySet(output, input, next, copy, put);
|
|
3408
|
-
have -= copy;
|
|
3409
|
-
next += copy;
|
|
3410
|
-
left -= copy;
|
|
3411
|
-
put += copy;
|
|
3412
|
-
state.length -= copy;
|
|
3413
|
-
break;
|
|
3414
|
-
}
|
|
3415
|
-
state.mode = TYPE;
|
|
3416
|
-
break;
|
|
3417
|
-
case TABLE:
|
|
3418
|
-
while (bits < 14) {
|
|
3419
|
-
if (have === 0) {
|
|
3420
|
-
break inf_leave;
|
|
3421
|
-
}
|
|
3422
|
-
have--;
|
|
3423
|
-
hold += input[next++] << bits;
|
|
3424
|
-
bits += 8;
|
|
3425
|
-
}
|
|
3426
|
-
state.nlen = (hold & 31) + 257;
|
|
3427
|
-
hold >>>= 5;
|
|
3428
|
-
bits -= 5;
|
|
3429
|
-
state.ndist = (hold & 31) + 1;
|
|
3430
|
-
hold >>>= 5;
|
|
3431
|
-
bits -= 5;
|
|
3432
|
-
state.ncode = (hold & 15) + 4;
|
|
3433
|
-
hold >>>= 4;
|
|
3434
|
-
bits -= 4;
|
|
3435
|
-
if (state.nlen > 286 || state.ndist > 30) {
|
|
3436
|
-
strm.msg = "too many length or distance symbols";
|
|
3437
|
-
state.mode = BAD;
|
|
3438
|
-
break;
|
|
3439
|
-
}
|
|
3440
|
-
state.have = 0;
|
|
3441
|
-
state.mode = LENLENS;
|
|
3442
|
-
/* falls through */
|
|
3443
|
-
case LENLENS:
|
|
3444
|
-
while (state.have < state.ncode) {
|
|
3445
|
-
while (bits < 3) {
|
|
3446
|
-
if (have === 0) {
|
|
3447
|
-
break inf_leave;
|
|
3448
|
-
}
|
|
3449
|
-
have--;
|
|
3450
|
-
hold += input[next++] << bits;
|
|
3451
|
-
bits += 8;
|
|
3452
|
-
}
|
|
3453
|
-
state.lens[order[state.have++]] = hold & 7;
|
|
3454
|
-
hold >>>= 3;
|
|
3455
|
-
bits -= 3;
|
|
3456
|
-
}
|
|
3457
|
-
while (state.have < 19) {
|
|
3458
|
-
state.lens[order[state.have++]] = 0;
|
|
3459
|
-
}
|
|
3460
|
-
state.lencode = state.lendyn;
|
|
3461
|
-
state.lenbits = 7;
|
|
3462
|
-
opts = { bits: state.lenbits };
|
|
3463
|
-
ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);
|
|
3464
|
-
state.lenbits = opts.bits;
|
|
3465
|
-
if (ret) {
|
|
3466
|
-
strm.msg = "invalid code lengths set";
|
|
3467
|
-
state.mode = BAD;
|
|
3468
|
-
break;
|
|
3469
|
-
}
|
|
3470
|
-
state.have = 0;
|
|
3471
|
-
state.mode = CODELENS;
|
|
3472
|
-
/* falls through */
|
|
3473
|
-
case CODELENS:
|
|
3474
|
-
while (state.have < state.nlen + state.ndist) {
|
|
3475
|
-
for (; ; ) {
|
|
3476
|
-
here = state.lencode[hold & (1 << state.lenbits) - 1];
|
|
3477
|
-
here_bits = here >>> 24;
|
|
3478
|
-
here_op = here >>> 16 & 255;
|
|
3479
|
-
here_val = here & 65535;
|
|
3480
|
-
if (here_bits <= bits) {
|
|
3481
|
-
break;
|
|
3482
|
-
}
|
|
3483
|
-
if (have === 0) {
|
|
3484
|
-
break inf_leave;
|
|
3485
|
-
}
|
|
3486
|
-
have--;
|
|
3487
|
-
hold += input[next++] << bits;
|
|
3488
|
-
bits += 8;
|
|
3489
|
-
}
|
|
3490
|
-
if (here_val < 16) {
|
|
3491
|
-
hold >>>= here_bits;
|
|
3492
|
-
bits -= here_bits;
|
|
3493
|
-
state.lens[state.have++] = here_val;
|
|
3494
|
-
} else {
|
|
3495
|
-
if (here_val === 16) {
|
|
3496
|
-
n = here_bits + 2;
|
|
3497
|
-
while (bits < n) {
|
|
3498
|
-
if (have === 0) {
|
|
3499
|
-
break inf_leave;
|
|
3500
|
-
}
|
|
3501
|
-
have--;
|
|
3502
|
-
hold += input[next++] << bits;
|
|
3503
|
-
bits += 8;
|
|
3504
|
-
}
|
|
3505
|
-
hold >>>= here_bits;
|
|
3506
|
-
bits -= here_bits;
|
|
3507
|
-
if (state.have === 0) {
|
|
3508
|
-
strm.msg = "invalid bit length repeat";
|
|
3509
|
-
state.mode = BAD;
|
|
3510
|
-
break;
|
|
3511
|
-
}
|
|
3512
|
-
len = state.lens[state.have - 1];
|
|
3513
|
-
copy = 3 + (hold & 3);
|
|
3514
|
-
hold >>>= 2;
|
|
3515
|
-
bits -= 2;
|
|
3516
|
-
} else if (here_val === 17) {
|
|
3517
|
-
n = here_bits + 3;
|
|
3518
|
-
while (bits < n) {
|
|
3519
|
-
if (have === 0) {
|
|
3520
|
-
break inf_leave;
|
|
3521
|
-
}
|
|
3522
|
-
have--;
|
|
3523
|
-
hold += input[next++] << bits;
|
|
3524
|
-
bits += 8;
|
|
3525
|
-
}
|
|
3526
|
-
hold >>>= here_bits;
|
|
3527
|
-
bits -= here_bits;
|
|
3528
|
-
len = 0;
|
|
3529
|
-
copy = 3 + (hold & 7);
|
|
3530
|
-
hold >>>= 3;
|
|
3531
|
-
bits -= 3;
|
|
3532
|
-
} else {
|
|
3533
|
-
n = here_bits + 7;
|
|
3534
|
-
while (bits < n) {
|
|
3535
|
-
if (have === 0) {
|
|
3536
|
-
break inf_leave;
|
|
3537
|
-
}
|
|
3538
|
-
have--;
|
|
3539
|
-
hold += input[next++] << bits;
|
|
3540
|
-
bits += 8;
|
|
3541
|
-
}
|
|
3542
|
-
hold >>>= here_bits;
|
|
3543
|
-
bits -= here_bits;
|
|
3544
|
-
len = 0;
|
|
3545
|
-
copy = 11 + (hold & 127);
|
|
3546
|
-
hold >>>= 7;
|
|
3547
|
-
bits -= 7;
|
|
3548
|
-
}
|
|
3549
|
-
if (state.have + copy > state.nlen + state.ndist) {
|
|
3550
|
-
strm.msg = "invalid bit length repeat";
|
|
3551
|
-
state.mode = BAD;
|
|
3552
|
-
break;
|
|
3553
|
-
}
|
|
3554
|
-
while (copy--) {
|
|
3555
|
-
state.lens[state.have++] = len;
|
|
3556
|
-
}
|
|
3557
|
-
}
|
|
3558
|
-
}
|
|
3559
|
-
if (state.mode === BAD) {
|
|
3560
|
-
break;
|
|
3561
|
-
}
|
|
3562
|
-
if (state.lens[256] === 0) {
|
|
3563
|
-
strm.msg = "invalid code -- missing end-of-block";
|
|
3564
|
-
state.mode = BAD;
|
|
3565
|
-
break;
|
|
3566
|
-
}
|
|
3567
|
-
state.lenbits = 9;
|
|
3568
|
-
opts = { bits: state.lenbits };
|
|
3569
|
-
ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);
|
|
3570
|
-
state.lenbits = opts.bits;
|
|
3571
|
-
if (ret) {
|
|
3572
|
-
strm.msg = "invalid literal/lengths set";
|
|
3573
|
-
state.mode = BAD;
|
|
3574
|
-
break;
|
|
3575
|
-
}
|
|
3576
|
-
state.distbits = 6;
|
|
3577
|
-
state.distcode = state.distdyn;
|
|
3578
|
-
opts = { bits: state.distbits };
|
|
3579
|
-
ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);
|
|
3580
|
-
state.distbits = opts.bits;
|
|
3581
|
-
if (ret) {
|
|
3582
|
-
strm.msg = "invalid distances set";
|
|
3583
|
-
state.mode = BAD;
|
|
3584
|
-
break;
|
|
3585
|
-
}
|
|
3586
|
-
state.mode = LEN_;
|
|
3587
|
-
if (flush === Z_TREES) {
|
|
3588
|
-
break inf_leave;
|
|
3589
|
-
}
|
|
3590
|
-
/* falls through */
|
|
3591
|
-
case LEN_:
|
|
3592
|
-
state.mode = LEN;
|
|
3593
|
-
/* falls through */
|
|
3594
|
-
case LEN:
|
|
3595
|
-
if (have >= 6 && left >= 258) {
|
|
3596
|
-
strm.next_out = put;
|
|
3597
|
-
strm.avail_out = left;
|
|
3598
|
-
strm.next_in = next;
|
|
3599
|
-
strm.avail_in = have;
|
|
3600
|
-
state.hold = hold;
|
|
3601
|
-
state.bits = bits;
|
|
3602
|
-
inflate_fast(strm, _out);
|
|
3603
|
-
put = strm.next_out;
|
|
3604
|
-
output = strm.output;
|
|
3605
|
-
left = strm.avail_out;
|
|
3606
|
-
next = strm.next_in;
|
|
3607
|
-
input = strm.input;
|
|
3608
|
-
have = strm.avail_in;
|
|
3609
|
-
hold = state.hold;
|
|
3610
|
-
bits = state.bits;
|
|
3611
|
-
if (state.mode === TYPE) {
|
|
3612
|
-
state.back = -1;
|
|
3613
|
-
}
|
|
3614
|
-
break;
|
|
3615
|
-
}
|
|
3616
|
-
state.back = 0;
|
|
3617
|
-
for (; ; ) {
|
|
3618
|
-
here = state.lencode[hold & (1 << state.lenbits) - 1];
|
|
3619
|
-
here_bits = here >>> 24;
|
|
3620
|
-
here_op = here >>> 16 & 255;
|
|
3621
|
-
here_val = here & 65535;
|
|
3622
|
-
if (here_bits <= bits) {
|
|
3623
|
-
break;
|
|
3624
|
-
}
|
|
3625
|
-
if (have === 0) {
|
|
3626
|
-
break inf_leave;
|
|
3627
|
-
}
|
|
3628
|
-
have--;
|
|
3629
|
-
hold += input[next++] << bits;
|
|
3630
|
-
bits += 8;
|
|
3631
|
-
}
|
|
3632
|
-
if (here_op && (here_op & 240) === 0) {
|
|
3633
|
-
last_bits = here_bits;
|
|
3634
|
-
last_op = here_op;
|
|
3635
|
-
last_val = here_val;
|
|
3636
|
-
for (; ; ) {
|
|
3637
|
-
here = state.lencode[last_val + ((hold & (1 << last_bits + last_op) - 1) >> last_bits)];
|
|
3638
|
-
here_bits = here >>> 24;
|
|
3639
|
-
here_op = here >>> 16 & 255;
|
|
3640
|
-
here_val = here & 65535;
|
|
3641
|
-
if (last_bits + here_bits <= bits) {
|
|
3642
|
-
break;
|
|
3643
|
-
}
|
|
3644
|
-
if (have === 0) {
|
|
3645
|
-
break inf_leave;
|
|
3646
|
-
}
|
|
3647
|
-
have--;
|
|
3648
|
-
hold += input[next++] << bits;
|
|
3649
|
-
bits += 8;
|
|
3650
|
-
}
|
|
3651
|
-
hold >>>= last_bits;
|
|
3652
|
-
bits -= last_bits;
|
|
3653
|
-
state.back += last_bits;
|
|
3654
|
-
}
|
|
3655
|
-
hold >>>= here_bits;
|
|
3656
|
-
bits -= here_bits;
|
|
3657
|
-
state.back += here_bits;
|
|
3658
|
-
state.length = here_val;
|
|
3659
|
-
if (here_op === 0) {
|
|
3660
|
-
state.mode = LIT;
|
|
3661
|
-
break;
|
|
3662
|
-
}
|
|
3663
|
-
if (here_op & 32) {
|
|
3664
|
-
state.back = -1;
|
|
3665
|
-
state.mode = TYPE;
|
|
3666
|
-
break;
|
|
3667
|
-
}
|
|
3668
|
-
if (here_op & 64) {
|
|
3669
|
-
strm.msg = "invalid literal/length code";
|
|
3670
|
-
state.mode = BAD;
|
|
3671
|
-
break;
|
|
3672
|
-
}
|
|
3673
|
-
state.extra = here_op & 15;
|
|
3674
|
-
state.mode = LENEXT;
|
|
3675
|
-
/* falls through */
|
|
3676
|
-
case LENEXT:
|
|
3677
|
-
if (state.extra) {
|
|
3678
|
-
n = state.extra;
|
|
3679
|
-
while (bits < n) {
|
|
3680
|
-
if (have === 0) {
|
|
3681
|
-
break inf_leave;
|
|
3682
|
-
}
|
|
3683
|
-
have--;
|
|
3684
|
-
hold += input[next++] << bits;
|
|
3685
|
-
bits += 8;
|
|
3686
|
-
}
|
|
3687
|
-
state.length += hold & (1 << state.extra) - 1;
|
|
3688
|
-
hold >>>= state.extra;
|
|
3689
|
-
bits -= state.extra;
|
|
3690
|
-
state.back += state.extra;
|
|
3691
|
-
}
|
|
3692
|
-
state.was = state.length;
|
|
3693
|
-
state.mode = DIST;
|
|
3694
|
-
/* falls through */
|
|
3695
|
-
case DIST:
|
|
3696
|
-
for (; ; ) {
|
|
3697
|
-
here = state.distcode[hold & (1 << state.distbits) - 1];
|
|
3698
|
-
here_bits = here >>> 24;
|
|
3699
|
-
here_op = here >>> 16 & 255;
|
|
3700
|
-
here_val = here & 65535;
|
|
3701
|
-
if (here_bits <= bits) {
|
|
3702
|
-
break;
|
|
3703
|
-
}
|
|
3704
|
-
if (have === 0) {
|
|
3705
|
-
break inf_leave;
|
|
3706
|
-
}
|
|
3707
|
-
have--;
|
|
3708
|
-
hold += input[next++] << bits;
|
|
3709
|
-
bits += 8;
|
|
3710
|
-
}
|
|
3711
|
-
if ((here_op & 240) === 0) {
|
|
3712
|
-
last_bits = here_bits;
|
|
3713
|
-
last_op = here_op;
|
|
3714
|
-
last_val = here_val;
|
|
3715
|
-
for (; ; ) {
|
|
3716
|
-
here = state.distcode[last_val + ((hold & (1 << last_bits + last_op) - 1) >> last_bits)];
|
|
3717
|
-
here_bits = here >>> 24;
|
|
3718
|
-
here_op = here >>> 16 & 255;
|
|
3719
|
-
here_val = here & 65535;
|
|
3720
|
-
if (last_bits + here_bits <= bits) {
|
|
3721
|
-
break;
|
|
3722
|
-
}
|
|
3723
|
-
if (have === 0) {
|
|
3724
|
-
break inf_leave;
|
|
3725
|
-
}
|
|
3726
|
-
have--;
|
|
3727
|
-
hold += input[next++] << bits;
|
|
3728
|
-
bits += 8;
|
|
3729
|
-
}
|
|
3730
|
-
hold >>>= last_bits;
|
|
3731
|
-
bits -= last_bits;
|
|
3732
|
-
state.back += last_bits;
|
|
3733
|
-
}
|
|
3734
|
-
hold >>>= here_bits;
|
|
3735
|
-
bits -= here_bits;
|
|
3736
|
-
state.back += here_bits;
|
|
3737
|
-
if (here_op & 64) {
|
|
3738
|
-
strm.msg = "invalid distance code";
|
|
3739
|
-
state.mode = BAD;
|
|
3740
|
-
break;
|
|
3741
|
-
}
|
|
3742
|
-
state.offset = here_val;
|
|
3743
|
-
state.extra = here_op & 15;
|
|
3744
|
-
state.mode = DISTEXT;
|
|
3745
|
-
/* falls through */
|
|
3746
|
-
case DISTEXT:
|
|
3747
|
-
if (state.extra) {
|
|
3748
|
-
n = state.extra;
|
|
3749
|
-
while (bits < n) {
|
|
3750
|
-
if (have === 0) {
|
|
3751
|
-
break inf_leave;
|
|
3752
|
-
}
|
|
3753
|
-
have--;
|
|
3754
|
-
hold += input[next++] << bits;
|
|
3755
|
-
bits += 8;
|
|
3756
|
-
}
|
|
3757
|
-
state.offset += hold & (1 << state.extra) - 1;
|
|
3758
|
-
hold >>>= state.extra;
|
|
3759
|
-
bits -= state.extra;
|
|
3760
|
-
state.back += state.extra;
|
|
3761
|
-
}
|
|
3762
|
-
if (state.offset > state.dmax) {
|
|
3763
|
-
strm.msg = "invalid distance too far back";
|
|
3764
|
-
state.mode = BAD;
|
|
3765
|
-
break;
|
|
3766
|
-
}
|
|
3767
|
-
state.mode = MATCH;
|
|
3768
|
-
/* falls through */
|
|
3769
|
-
case MATCH:
|
|
3770
|
-
if (left === 0) {
|
|
3771
|
-
break inf_leave;
|
|
3772
|
-
}
|
|
3773
|
-
copy = _out - left;
|
|
3774
|
-
if (state.offset > copy) {
|
|
3775
|
-
copy = state.offset - copy;
|
|
3776
|
-
if (copy > state.whave) {
|
|
3777
|
-
if (state.sane) {
|
|
3778
|
-
strm.msg = "invalid distance too far back";
|
|
3779
|
-
state.mode = BAD;
|
|
3780
|
-
break;
|
|
3781
|
-
}
|
|
3782
|
-
}
|
|
3783
|
-
if (copy > state.wnext) {
|
|
3784
|
-
copy -= state.wnext;
|
|
3785
|
-
from = state.wsize - copy;
|
|
3786
|
-
} else {
|
|
3787
|
-
from = state.wnext - copy;
|
|
3788
|
-
}
|
|
3789
|
-
if (copy > state.length) {
|
|
3790
|
-
copy = state.length;
|
|
3791
|
-
}
|
|
3792
|
-
from_source = state.window;
|
|
3793
|
-
} else {
|
|
3794
|
-
from_source = output;
|
|
3795
|
-
from = put - state.offset;
|
|
3796
|
-
copy = state.length;
|
|
3797
|
-
}
|
|
3798
|
-
if (copy > left) {
|
|
3799
|
-
copy = left;
|
|
3800
|
-
}
|
|
3801
|
-
left -= copy;
|
|
3802
|
-
state.length -= copy;
|
|
3803
|
-
do {
|
|
3804
|
-
output[put++] = from_source[from++];
|
|
3805
|
-
} while (--copy);
|
|
3806
|
-
if (state.length === 0) {
|
|
3807
|
-
state.mode = LEN;
|
|
3808
|
-
}
|
|
3809
|
-
break;
|
|
3810
|
-
case LIT:
|
|
3811
|
-
if (left === 0) {
|
|
3812
|
-
break inf_leave;
|
|
3813
|
-
}
|
|
3814
|
-
output[put++] = state.length;
|
|
3815
|
-
left--;
|
|
3816
|
-
state.mode = LEN;
|
|
3817
|
-
break;
|
|
3818
|
-
case CHECK:
|
|
3819
|
-
if (state.wrap) {
|
|
3820
|
-
while (bits < 32) {
|
|
3821
|
-
if (have === 0) {
|
|
3822
|
-
break inf_leave;
|
|
3823
|
-
}
|
|
3824
|
-
have--;
|
|
3825
|
-
hold |= input[next++] << bits;
|
|
3826
|
-
bits += 8;
|
|
3827
|
-
}
|
|
3828
|
-
_out -= left;
|
|
3829
|
-
strm.total_out += _out;
|
|
3830
|
-
state.total += _out;
|
|
3831
|
-
if (_out) {
|
|
3832
|
-
strm.adler = state.check = /*UPDATE(state.check, put - _out, _out);*/
|
|
3833
|
-
state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out);
|
|
3834
|
-
}
|
|
3835
|
-
_out = left;
|
|
3836
|
-
if ((state.flags ? hold : zswap32(hold)) !== state.check) {
|
|
3837
|
-
strm.msg = "incorrect data check";
|
|
3838
|
-
state.mode = BAD;
|
|
3839
|
-
break;
|
|
3840
|
-
}
|
|
3841
|
-
hold = 0;
|
|
3842
|
-
bits = 0;
|
|
3843
|
-
}
|
|
3844
|
-
state.mode = LENGTH;
|
|
3845
|
-
/* falls through */
|
|
3846
|
-
case LENGTH:
|
|
3847
|
-
if (state.wrap && state.flags) {
|
|
3848
|
-
while (bits < 32) {
|
|
3849
|
-
if (have === 0) {
|
|
3850
|
-
break inf_leave;
|
|
3851
|
-
}
|
|
3852
|
-
have--;
|
|
3853
|
-
hold += input[next++] << bits;
|
|
3854
|
-
bits += 8;
|
|
3855
|
-
}
|
|
3856
|
-
if (hold !== (state.total & 4294967295)) {
|
|
3857
|
-
strm.msg = "incorrect length check";
|
|
3858
|
-
state.mode = BAD;
|
|
3859
|
-
break;
|
|
3860
|
-
}
|
|
3861
|
-
hold = 0;
|
|
3862
|
-
bits = 0;
|
|
3863
|
-
}
|
|
3864
|
-
state.mode = DONE;
|
|
3865
|
-
/* falls through */
|
|
3866
|
-
case DONE:
|
|
3867
|
-
ret = Z_STREAM_END;
|
|
3868
|
-
break inf_leave;
|
|
3869
|
-
case BAD:
|
|
3870
|
-
ret = Z_DATA_ERROR;
|
|
3871
|
-
break inf_leave;
|
|
3872
|
-
case MEM:
|
|
3873
|
-
return Z_MEM_ERROR;
|
|
3874
|
-
case SYNC:
|
|
3875
|
-
/* falls through */
|
|
3876
|
-
default:
|
|
3877
|
-
return Z_STREAM_ERROR;
|
|
3878
|
-
}
|
|
3879
|
-
}
|
|
3880
|
-
strm.next_out = put;
|
|
3881
|
-
strm.avail_out = left;
|
|
3882
|
-
strm.next_in = next;
|
|
3883
|
-
strm.avail_in = have;
|
|
3884
|
-
state.hold = hold;
|
|
3885
|
-
state.bits = bits;
|
|
3886
|
-
if (state.wsize || _out !== strm.avail_out && state.mode < BAD && (state.mode < CHECK || flush !== Z_FINISH)) {
|
|
3887
|
-
if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;
|
|
3888
|
-
}
|
|
3889
|
-
_in -= strm.avail_in;
|
|
3890
|
-
_out -= strm.avail_out;
|
|
3891
|
-
strm.total_in += _in;
|
|
3892
|
-
strm.total_out += _out;
|
|
3893
|
-
state.total += _out;
|
|
3894
|
-
if (state.wrap && _out) {
|
|
3895
|
-
strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
|
|
3896
|
-
state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out);
|
|
3897
|
-
}
|
|
3898
|
-
strm.data_type = state.bits + (state.last ? 64 : 0) + (state.mode === TYPE ? 128 : 0) + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);
|
|
3899
|
-
if ((_in === 0 && _out === 0 || flush === Z_FINISH) && ret === Z_OK) {
|
|
3900
|
-
ret = Z_BUF_ERROR;
|
|
3901
|
-
}
|
|
3902
|
-
return ret;
|
|
3903
|
-
}
|
|
3904
|
-
function inflateEnd(strm) {
|
|
3905
|
-
if (!strm || !strm.state) {
|
|
3906
|
-
return Z_STREAM_ERROR;
|
|
3907
|
-
}
|
|
3908
|
-
var state = strm.state;
|
|
3909
|
-
if (state.window) {
|
|
3910
|
-
state.window = null;
|
|
3911
|
-
}
|
|
3912
|
-
strm.state = null;
|
|
3913
|
-
return Z_OK;
|
|
3914
|
-
}
|
|
3915
|
-
function inflateGetHeader(strm, head) {
|
|
3916
|
-
var state;
|
|
3917
|
-
if (!strm || !strm.state) {
|
|
3918
|
-
return Z_STREAM_ERROR;
|
|
3919
|
-
}
|
|
3920
|
-
state = strm.state;
|
|
3921
|
-
if ((state.wrap & 2) === 0) {
|
|
3922
|
-
return Z_STREAM_ERROR;
|
|
3923
|
-
}
|
|
3924
|
-
state.head = head;
|
|
3925
|
-
head.done = false;
|
|
3926
|
-
return Z_OK;
|
|
3927
|
-
}
|
|
3928
|
-
function inflateSetDictionary(strm, dictionary) {
|
|
3929
|
-
var dictLength = dictionary.length;
|
|
3930
|
-
var state;
|
|
3931
|
-
var dictid;
|
|
3932
|
-
var ret;
|
|
3933
|
-
if (!strm || !strm.state) {
|
|
3934
|
-
return Z_STREAM_ERROR;
|
|
3935
|
-
}
|
|
3936
|
-
state = strm.state;
|
|
3937
|
-
if (state.wrap !== 0 && state.mode !== DICT) {
|
|
3938
|
-
return Z_STREAM_ERROR;
|
|
3939
|
-
}
|
|
3940
|
-
if (state.mode === DICT) {
|
|
3941
|
-
dictid = 1;
|
|
3942
|
-
dictid = adler32(dictid, dictionary, dictLength, 0);
|
|
3943
|
-
if (dictid !== state.check) {
|
|
3944
|
-
return Z_DATA_ERROR;
|
|
3945
|
-
}
|
|
3946
|
-
}
|
|
3947
|
-
ret = updatewindow(strm, dictionary, dictLength, dictLength);
|
|
3948
|
-
if (ret) {
|
|
3949
|
-
state.mode = MEM;
|
|
3950
|
-
return Z_MEM_ERROR;
|
|
3951
|
-
}
|
|
3952
|
-
state.havedict = 1;
|
|
3953
|
-
return Z_OK;
|
|
3954
|
-
}
|
|
3955
|
-
inflate.inflateReset = inflateReset;
|
|
3956
|
-
inflate.inflateReset2 = inflateReset2;
|
|
3957
|
-
inflate.inflateResetKeep = inflateResetKeep;
|
|
3958
|
-
inflate.inflateInit = inflateInit;
|
|
3959
|
-
inflate.inflateInit2 = inflateInit2;
|
|
3960
|
-
inflate.inflate = inflate$12;
|
|
3961
|
-
inflate.inflateEnd = inflateEnd;
|
|
3962
|
-
inflate.inflateGetHeader = inflateGetHeader;
|
|
3963
|
-
inflate.inflateSetDictionary = inflateSetDictionary;
|
|
3964
|
-
inflate.inflateInfo = "pako inflate (from Nodeca project)";
|
|
3965
|
-
return inflate;
|
|
3966
|
-
}
|
|
3967
|
-
var constants;
|
|
3968
|
-
var hasRequiredConstants;
|
|
3969
|
-
function requireConstants() {
|
|
3970
|
-
if (hasRequiredConstants) return constants;
|
|
3971
|
-
hasRequiredConstants = 1;
|
|
3972
|
-
constants = {
|
|
3973
|
-
/* Allowed flush values; see deflate() and inflate() below for details */
|
|
3974
|
-
Z_NO_FLUSH: 0,
|
|
3975
|
-
Z_PARTIAL_FLUSH: 1,
|
|
3976
|
-
Z_SYNC_FLUSH: 2,
|
|
3977
|
-
Z_FULL_FLUSH: 3,
|
|
3978
|
-
Z_FINISH: 4,
|
|
3979
|
-
Z_BLOCK: 5,
|
|
3980
|
-
Z_TREES: 6,
|
|
3981
|
-
/* Return codes for the compression/decompression functions. Negative values
|
|
3982
|
-
* are errors, positive values are used for special but normal events.
|
|
3983
|
-
*/
|
|
3984
|
-
Z_OK: 0,
|
|
3985
|
-
Z_STREAM_END: 1,
|
|
3986
|
-
Z_NEED_DICT: 2,
|
|
3987
|
-
Z_ERRNO: -1,
|
|
3988
|
-
Z_STREAM_ERROR: -2,
|
|
3989
|
-
Z_DATA_ERROR: -3,
|
|
3990
|
-
//Z_MEM_ERROR: -4,
|
|
3991
|
-
Z_BUF_ERROR: -5,
|
|
3992
|
-
//Z_VERSION_ERROR: -6,
|
|
3993
|
-
/* compression levels */
|
|
3994
|
-
Z_NO_COMPRESSION: 0,
|
|
3995
|
-
Z_BEST_SPEED: 1,
|
|
3996
|
-
Z_BEST_COMPRESSION: 9,
|
|
3997
|
-
Z_DEFAULT_COMPRESSION: -1,
|
|
3998
|
-
Z_FILTERED: 1,
|
|
3999
|
-
Z_HUFFMAN_ONLY: 2,
|
|
4000
|
-
Z_RLE: 3,
|
|
4001
|
-
Z_FIXED: 4,
|
|
4002
|
-
Z_DEFAULT_STRATEGY: 0,
|
|
4003
|
-
/* Possible values of the data_type field (though see inflate()) */
|
|
4004
|
-
Z_BINARY: 0,
|
|
4005
|
-
Z_TEXT: 1,
|
|
4006
|
-
//Z_ASCII: 1, // = Z_TEXT (deprecated)
|
|
4007
|
-
Z_UNKNOWN: 2,
|
|
4008
|
-
/* The deflate compression method */
|
|
4009
|
-
Z_DEFLATED: 8
|
|
4010
|
-
//Z_NULL: null // Use -1 or null inline, depending on var type
|
|
4011
|
-
};
|
|
4012
|
-
return constants;
|
|
4013
|
-
}
|
|
4014
|
-
var gzheader;
|
|
4015
|
-
var hasRequiredGzheader;
|
|
4016
|
-
function requireGzheader() {
|
|
4017
|
-
if (hasRequiredGzheader) return gzheader;
|
|
4018
|
-
hasRequiredGzheader = 1;
|
|
4019
|
-
function GZheader() {
|
|
4020
|
-
this.text = 0;
|
|
4021
|
-
this.time = 0;
|
|
4022
|
-
this.xflags = 0;
|
|
4023
|
-
this.os = 0;
|
|
4024
|
-
this.extra = null;
|
|
4025
|
-
this.extra_len = 0;
|
|
4026
|
-
this.name = "";
|
|
4027
|
-
this.comment = "";
|
|
4028
|
-
this.hcrc = 0;
|
|
4029
|
-
this.done = false;
|
|
4030
|
-
}
|
|
4031
|
-
gzheader = GZheader;
|
|
4032
|
-
return gzheader;
|
|
4033
|
-
}
|
|
4034
|
-
var hasRequiredInflate;
|
|
4035
|
-
function requireInflate() {
|
|
4036
|
-
if (hasRequiredInflate) return inflate$1;
|
|
4037
|
-
hasRequiredInflate = 1;
|
|
4038
|
-
var zlib_inflate = requireInflate$1();
|
|
4039
|
-
var utils = requireCommon();
|
|
4040
|
-
var strings2 = requireStrings();
|
|
4041
|
-
var c = requireConstants();
|
|
4042
|
-
var msg = requireMessages();
|
|
4043
|
-
var ZStream = requireZstream();
|
|
4044
|
-
var GZheader = requireGzheader();
|
|
4045
|
-
var toString = Object.prototype.toString;
|
|
4046
|
-
function Inflate(options) {
|
|
4047
|
-
if (!(this instanceof Inflate)) return new Inflate(options);
|
|
4048
|
-
this.options = utils.assign({
|
|
4049
|
-
chunkSize: 16384,
|
|
4050
|
-
windowBits: 0,
|
|
4051
|
-
to: ""
|
|
4052
|
-
}, options || {});
|
|
4053
|
-
var opt = this.options;
|
|
4054
|
-
if (opt.raw && opt.windowBits >= 0 && opt.windowBits < 16) {
|
|
4055
|
-
opt.windowBits = -opt.windowBits;
|
|
4056
|
-
if (opt.windowBits === 0) {
|
|
4057
|
-
opt.windowBits = -15;
|
|
4058
|
-
}
|
|
4059
|
-
}
|
|
4060
|
-
if (opt.windowBits >= 0 && opt.windowBits < 16 && !(options && options.windowBits)) {
|
|
4061
|
-
opt.windowBits += 32;
|
|
4062
|
-
}
|
|
4063
|
-
if (opt.windowBits > 15 && opt.windowBits < 48) {
|
|
4064
|
-
if ((opt.windowBits & 15) === 0) {
|
|
4065
|
-
opt.windowBits |= 15;
|
|
4066
|
-
}
|
|
4067
|
-
}
|
|
4068
|
-
this.err = 0;
|
|
4069
|
-
this.msg = "";
|
|
4070
|
-
this.ended = false;
|
|
4071
|
-
this.chunks = [];
|
|
4072
|
-
this.strm = new ZStream();
|
|
4073
|
-
this.strm.avail_out = 0;
|
|
4074
|
-
var status = zlib_inflate.inflateInit2(
|
|
4075
|
-
this.strm,
|
|
4076
|
-
opt.windowBits
|
|
4077
|
-
);
|
|
4078
|
-
if (status !== c.Z_OK) {
|
|
4079
|
-
throw new Error(msg[status]);
|
|
4080
|
-
}
|
|
4081
|
-
this.header = new GZheader();
|
|
4082
|
-
zlib_inflate.inflateGetHeader(this.strm, this.header);
|
|
4083
|
-
if (opt.dictionary) {
|
|
4084
|
-
if (typeof opt.dictionary === "string") {
|
|
4085
|
-
opt.dictionary = strings2.string2buf(opt.dictionary);
|
|
4086
|
-
} else if (toString.call(opt.dictionary) === "[object ArrayBuffer]") {
|
|
4087
|
-
opt.dictionary = new Uint8Array(opt.dictionary);
|
|
4088
|
-
}
|
|
4089
|
-
if (opt.raw) {
|
|
4090
|
-
status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);
|
|
4091
|
-
if (status !== c.Z_OK) {
|
|
4092
|
-
throw new Error(msg[status]);
|
|
4093
|
-
}
|
|
4094
|
-
}
|
|
4095
|
-
}
|
|
4096
|
-
}
|
|
4097
|
-
Inflate.prototype.push = function(data, mode) {
|
|
4098
|
-
var strm = this.strm;
|
|
4099
|
-
var chunkSize = this.options.chunkSize;
|
|
4100
|
-
var dictionary = this.options.dictionary;
|
|
4101
|
-
var status, _mode;
|
|
4102
|
-
var next_out_utf8, tail, utf8str;
|
|
4103
|
-
var allowBufError = false;
|
|
4104
|
-
if (this.ended) {
|
|
4105
|
-
return false;
|
|
4106
|
-
}
|
|
4107
|
-
_mode = mode === ~~mode ? mode : mode === true ? c.Z_FINISH : c.Z_NO_FLUSH;
|
|
4108
|
-
if (typeof data === "string") {
|
|
4109
|
-
strm.input = strings2.binstring2buf(data);
|
|
4110
|
-
} else if (toString.call(data) === "[object ArrayBuffer]") {
|
|
4111
|
-
strm.input = new Uint8Array(data);
|
|
4112
|
-
} else {
|
|
4113
|
-
strm.input = data;
|
|
4114
|
-
}
|
|
4115
|
-
strm.next_in = 0;
|
|
4116
|
-
strm.avail_in = strm.input.length;
|
|
4117
|
-
do {
|
|
4118
|
-
if (strm.avail_out === 0) {
|
|
4119
|
-
strm.output = new utils.Buf8(chunkSize);
|
|
4120
|
-
strm.next_out = 0;
|
|
4121
|
-
strm.avail_out = chunkSize;
|
|
4122
|
-
}
|
|
4123
|
-
status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH);
|
|
4124
|
-
if (status === c.Z_NEED_DICT && dictionary) {
|
|
4125
|
-
status = zlib_inflate.inflateSetDictionary(this.strm, dictionary);
|
|
4126
|
-
}
|
|
4127
|
-
if (status === c.Z_BUF_ERROR && allowBufError === true) {
|
|
4128
|
-
status = c.Z_OK;
|
|
4129
|
-
allowBufError = false;
|
|
4130
|
-
}
|
|
4131
|
-
if (status !== c.Z_STREAM_END && status !== c.Z_OK) {
|
|
4132
|
-
this.onEnd(status);
|
|
4133
|
-
this.ended = true;
|
|
4134
|
-
return false;
|
|
4135
|
-
}
|
|
4136
|
-
if (strm.next_out) {
|
|
4137
|
-
if (strm.avail_out === 0 || status === c.Z_STREAM_END || strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH)) {
|
|
4138
|
-
if (this.options.to === "string") {
|
|
4139
|
-
next_out_utf8 = strings2.utf8border(strm.output, strm.next_out);
|
|
4140
|
-
tail = strm.next_out - next_out_utf8;
|
|
4141
|
-
utf8str = strings2.buf2string(strm.output, next_out_utf8);
|
|
4142
|
-
strm.next_out = tail;
|
|
4143
|
-
strm.avail_out = chunkSize - tail;
|
|
4144
|
-
if (tail) {
|
|
4145
|
-
utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0);
|
|
4146
|
-
}
|
|
4147
|
-
this.onData(utf8str);
|
|
4148
|
-
} else {
|
|
4149
|
-
this.onData(utils.shrinkBuf(strm.output, strm.next_out));
|
|
4150
|
-
}
|
|
4151
|
-
}
|
|
4152
|
-
}
|
|
4153
|
-
if (strm.avail_in === 0 && strm.avail_out === 0) {
|
|
4154
|
-
allowBufError = true;
|
|
4155
|
-
}
|
|
4156
|
-
} while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);
|
|
4157
|
-
if (status === c.Z_STREAM_END) {
|
|
4158
|
-
_mode = c.Z_FINISH;
|
|
4159
|
-
}
|
|
4160
|
-
if (_mode === c.Z_FINISH) {
|
|
4161
|
-
status = zlib_inflate.inflateEnd(this.strm);
|
|
4162
|
-
this.onEnd(status);
|
|
4163
|
-
this.ended = true;
|
|
4164
|
-
return status === c.Z_OK;
|
|
4165
|
-
}
|
|
4166
|
-
if (_mode === c.Z_SYNC_FLUSH) {
|
|
4167
|
-
this.onEnd(c.Z_OK);
|
|
4168
|
-
strm.avail_out = 0;
|
|
4169
|
-
return true;
|
|
4170
|
-
}
|
|
4171
|
-
return true;
|
|
4172
|
-
};
|
|
4173
|
-
Inflate.prototype.onData = function(chunk) {
|
|
4174
|
-
this.chunks.push(chunk);
|
|
4175
|
-
};
|
|
4176
|
-
Inflate.prototype.onEnd = function(status) {
|
|
4177
|
-
if (status === c.Z_OK) {
|
|
4178
|
-
if (this.options.to === "string") {
|
|
4179
|
-
this.result = this.chunks.join("");
|
|
4180
|
-
} else {
|
|
4181
|
-
this.result = utils.flattenChunks(this.chunks);
|
|
4182
|
-
}
|
|
4183
|
-
}
|
|
4184
|
-
this.chunks = [];
|
|
4185
|
-
this.err = status;
|
|
4186
|
-
this.msg = this.strm.msg;
|
|
4187
|
-
};
|
|
4188
|
-
function inflate2(input, options) {
|
|
4189
|
-
var inflator = new Inflate(options);
|
|
4190
|
-
inflator.push(input, true);
|
|
4191
|
-
if (inflator.err) {
|
|
4192
|
-
throw inflator.msg || msg[inflator.err];
|
|
4193
|
-
}
|
|
4194
|
-
return inflator.result;
|
|
4195
|
-
}
|
|
4196
|
-
function inflateRaw(input, options) {
|
|
4197
|
-
options = options || {};
|
|
4198
|
-
options.raw = true;
|
|
4199
|
-
return inflate2(input, options);
|
|
4200
|
-
}
|
|
4201
|
-
inflate$1.Inflate = Inflate;
|
|
4202
|
-
inflate$1.inflate = inflate2;
|
|
4203
|
-
inflate$1.inflateRaw = inflateRaw;
|
|
4204
|
-
inflate$1.ungzip = inflate2;
|
|
4205
|
-
return inflate$1;
|
|
4206
|
-
}
|
|
4207
|
-
var pako_1;
|
|
4208
|
-
var hasRequiredPako;
|
|
4209
|
-
function requirePako() {
|
|
4210
|
-
if (hasRequiredPako) return pako_1;
|
|
4211
|
-
hasRequiredPako = 1;
|
|
4212
|
-
var assign = requireCommon().assign;
|
|
4213
|
-
var deflate2 = requireDeflate();
|
|
4214
|
-
var inflate2 = requireInflate();
|
|
4215
|
-
var constants2 = requireConstants();
|
|
4216
|
-
var pako = {};
|
|
4217
|
-
assign(pako, deflate2, inflate2, constants2);
|
|
4218
|
-
pako_1 = pako;
|
|
4219
|
-
return pako_1;
|
|
4220
|
-
}
|
|
4221
|
-
export {
|
|
4222
|
-
requirePako as r
|
|
4223
|
-
};
|
|
1
|
+
var Qe={},oa;function He(){return oa||(oa=1,(function(w){var I=typeof Uint8Array<"u"&&typeof Uint16Array<"u"&&typeof Int32Array<"u";function P(s,v){return Object.prototype.hasOwnProperty.call(s,v)}w.assign=function(s){for(var v=Array.prototype.slice.call(arguments,1);v.length;){var g=v.shift();if(g){if(typeof g!="object")throw new TypeError(g+"must be non-object");for(var _ in g)P(g,_)&&(s[_]=g[_])}}return s},w.shrinkBuf=function(s,v){return s.length===v?s:s.subarray?s.subarray(0,v):(s.length=v,s)};var b={arraySet:function(s,v,g,_,D){if(v.subarray&&s.subarray){s.set(v.subarray(g,g+_),D);return}for(var E=0;E<_;E++)s[D+E]=v[g+E]},flattenChunks:function(s){var v,g,_,D,E,z;for(_=0,v=0,g=s.length;v<g;v++)_+=s[v].length;for(z=new Uint8Array(_),D=0,v=0,g=s.length;v<g;v++)E=s[v],z.set(E,D),D+=E.length;return z}},K={arraySet:function(s,v,g,_,D){for(var E=0;E<_;E++)s[D+E]=v[g+E]},flattenChunks:function(s){return[].concat.apply([],s)}};w.setTyped=function(s){s?(w.Buf8=Uint8Array,w.Buf16=Uint16Array,w.Buf32=Int32Array,w.assign(w,b)):(w.Buf8=Array,w.Buf16=Array,w.Buf32=Array,w.assign(w,K))},w.setTyped(I)})(Qe)),Qe}var je={},Ie={},Ke={},da;function Za(){if(da)return Ke;da=1;var w=He(),I=4,P=0,b=1,K=2;function s(i){for(var d=i.length;--d>=0;)i[d]=0}var v=0,g=1,_=2,D=3,E=258,z=29,p=256,k=p+1+z,O=30,ae=19,N=2*k+1,R=15,H=16,T=7,B=256,M=16,Z=17,x=18,U=[0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0],j=[0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13],q=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7],V=[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15],ee=512,C=new Array((k+2)*2);s(C);var J=new Array(O*2);s(J);var le=new Array(ee);s(le);var ce=new Array(E-D+1);s(ce);var F=new Array(z);s(F);var he=new Array(O);s(he);function te(i,d,c,m,n){this.static_tree=i,this.extra_bits=d,this.extra_base=c,this.elems=m,this.max_length=n,this.has_stree=i&&i.length}var Se,ke,ue;function re(i,d){this.dyn_tree=i,this.max_code=0,this.stat_desc=d}function ge(i){return i<256?le[i]:le[256+(i>>>7)]}function de(i,d){i.pending_buf[i.pending++]=d&255,i.pending_buf[i.pending++]=d>>>8&255}function Q(i,d,c){i.bi_valid>H-c?(i.bi_buf|=d<<i.bi_valid&65535,de(i,i.bi_buf),i.bi_buf=d>>H-i.bi_valid,i.bi_valid+=c-H):(i.bi_buf|=d<<i.bi_valid&65535,i.bi_valid+=c)}function ne(i,d,c){Q(i,c[d*2],c[d*2+1])}function W(i,d){var c=0;do c|=i&1,i>>>=1,c<<=1;while(--d>0);return c>>>1}function se(i){i.bi_valid===16?(de(i,i.bi_buf),i.bi_buf=0,i.bi_valid=0):i.bi_valid>=8&&(i.pending_buf[i.pending++]=i.bi_buf&255,i.bi_buf>>=8,i.bi_valid-=8)}function ye(i,d){var c=d.dyn_tree,m=d.max_code,n=d.stat_desc.static_tree,o=d.stat_desc.has_stree,a=d.stat_desc.extra_bits,u=d.stat_desc.extra_base,L=d.stat_desc.max_length,e,l,h,t,r,f,A=0;for(t=0;t<=R;t++)i.bl_count[t]=0;for(c[i.heap[i.heap_max]*2+1]=0,e=i.heap_max+1;e<N;e++)l=i.heap[e],t=c[c[l*2+1]*2+1]+1,t>L&&(t=L,A++),c[l*2+1]=t,!(l>m)&&(i.bl_count[t]++,r=0,l>=u&&(r=a[l-u]),f=c[l*2],i.opt_len+=f*(t+r),o&&(i.static_len+=f*(n[l*2+1]+r)));if(A!==0){do{for(t=L-1;i.bl_count[t]===0;)t--;i.bl_count[t]--,i.bl_count[t+1]+=2,i.bl_count[L]--,A-=2}while(A>0);for(t=L;t!==0;t--)for(l=i.bl_count[t];l!==0;)h=i.heap[--e],!(h>m)&&(c[h*2+1]!==t&&(i.opt_len+=(t-c[h*2+1])*c[h*2],c[h*2+1]=t),l--)}}function ze(i,d,c){var m=new Array(R+1),n=0,o,a;for(o=1;o<=R;o++)m[o]=n=n+c[o-1]<<1;for(a=0;a<=d;a++){var u=i[a*2+1];u!==0&&(i[a*2]=W(m[u]++,u))}}function $(){var i,d,c,m,n,o=new Array(R+1);for(c=0,m=0;m<z-1;m++)for(F[m]=c,i=0;i<1<<U[m];i++)ce[c++]=m;for(ce[c-1]=m,n=0,m=0;m<16;m++)for(he[m]=n,i=0;i<1<<j[m];i++)le[n++]=m;for(n>>=7;m<O;m++)for(he[m]=n<<7,i=0;i<1<<j[m]-7;i++)le[256+n++]=m;for(d=0;d<=R;d++)o[d]=0;for(i=0;i<=143;)C[i*2+1]=8,i++,o[8]++;for(;i<=255;)C[i*2+1]=9,i++,o[9]++;for(;i<=279;)C[i*2+1]=7,i++,o[7]++;for(;i<=287;)C[i*2+1]=8,i++,o[8]++;for(ze(C,k+1,o),i=0;i<O;i++)J[i*2+1]=5,J[i*2]=W(i,5);Se=new te(C,U,p+1,k,R),ke=new te(J,j,0,O,R),ue=new te(new Array(0),q,0,ae,T)}function pe(i){var d;for(d=0;d<k;d++)i.dyn_ltree[d*2]=0;for(d=0;d<O;d++)i.dyn_dtree[d*2]=0;for(d=0;d<ae;d++)i.bl_tree[d*2]=0;i.dyn_ltree[B*2]=1,i.opt_len=i.static_len=0,i.last_lit=i.matches=0}function Ue(i){i.bi_valid>8?de(i,i.bi_buf):i.bi_valid>0&&(i.pending_buf[i.pending++]=i.bi_buf),i.bi_buf=0,i.bi_valid=0}function me(i,d,c,m){Ue(i),de(i,c),de(i,~c),w.arraySet(i.pending_buf,i.window,d,c,i.pending),i.pending+=c}function Ee(i,d,c,m){var n=d*2,o=c*2;return i[n]<i[o]||i[n]===i[o]&&m[d]<=m[c]}function ie(i,d,c){for(var m=i.heap[c],n=c<<1;n<=i.heap_len&&(n<i.heap_len&&Ee(d,i.heap[n+1],i.heap[n],i.depth)&&n++,!Ee(d,m,i.heap[n],i.depth));)i.heap[c]=i.heap[n],c=n,n<<=1;i.heap[c]=m}function Y(i,d,c){var m,n,o=0,a,u;if(i.last_lit!==0)do m=i.pending_buf[i.d_buf+o*2]<<8|i.pending_buf[i.d_buf+o*2+1],n=i.pending_buf[i.l_buf+o],o++,m===0?ne(i,n,d):(a=ce[n],ne(i,a+p+1,d),u=U[a],u!==0&&(n-=F[a],Q(i,n,u)),m--,a=ge(m),ne(i,a,c),u=j[a],u!==0&&(m-=he[a],Q(i,m,u)));while(o<i.last_lit);ne(i,B,d)}function Te(i,d){var c=d.dyn_tree,m=d.stat_desc.static_tree,n=d.stat_desc.has_stree,o=d.stat_desc.elems,a,u,L=-1,e;for(i.heap_len=0,i.heap_max=N,a=0;a<o;a++)c[a*2]!==0?(i.heap[++i.heap_len]=L=a,i.depth[a]=0):c[a*2+1]=0;for(;i.heap_len<2;)e=i.heap[++i.heap_len]=L<2?++L:0,c[e*2]=1,i.depth[e]=0,i.opt_len--,n&&(i.static_len-=m[e*2+1]);for(d.max_code=L,a=i.heap_len>>1;a>=1;a--)ie(i,c,a);e=o;do a=i.heap[1],i.heap[1]=i.heap[i.heap_len--],ie(i,c,1),u=i.heap[1],i.heap[--i.heap_max]=a,i.heap[--i.heap_max]=u,c[e*2]=c[a*2]+c[u*2],i.depth[e]=(i.depth[a]>=i.depth[u]?i.depth[a]:i.depth[u])+1,c[a*2+1]=c[u*2+1]=e,i.heap[1]=e++,ie(i,c,1);while(i.heap_len>=2);i.heap[--i.heap_max]=i.heap[1],ye(i,d),ze(c,L,i.bl_count)}function qe(i,d,c){var m,n=-1,o,a=d[1],u=0,L=7,e=4;for(a===0&&(L=138,e=3),d[(c+1)*2+1]=65535,m=0;m<=c;m++)o=a,a=d[(m+1)*2+1],!(++u<L&&o===a)&&(u<e?i.bl_tree[o*2]+=u:o!==0?(o!==n&&i.bl_tree[o*2]++,i.bl_tree[M*2]++):u<=10?i.bl_tree[Z*2]++:i.bl_tree[x*2]++,u=0,n=o,a===0?(L=138,e=3):o===a?(L=6,e=3):(L=7,e=4))}function Le(i,d,c){var m,n=-1,o,a=d[1],u=0,L=7,e=4;for(a===0&&(L=138,e=3),m=0;m<=c;m++)if(o=a,a=d[(m+1)*2+1],!(++u<L&&o===a)){if(u<e)do ne(i,o,i.bl_tree);while(--u!==0);else o!==0?(o!==n&&(ne(i,o,i.bl_tree),u--),ne(i,M,i.bl_tree),Q(i,u-3,2)):u<=10?(ne(i,Z,i.bl_tree),Q(i,u-3,3)):(ne(i,x,i.bl_tree),Q(i,u-11,7));u=0,n=o,a===0?(L=138,e=3):o===a?(L=6,e=3):(L=7,e=4)}}function Ae(i){var d;for(qe(i,i.dyn_ltree,i.l_desc.max_code),qe(i,i.dyn_dtree,i.d_desc.max_code),Te(i,i.bl_desc),d=ae-1;d>=3&&i.bl_tree[V[d]*2+1]===0;d--);return i.opt_len+=3*(d+1)+5+5+4,d}function Ye(i,d,c,m){var n;for(Q(i,d-257,5),Q(i,c-1,5),Q(i,m-4,4),n=0;n<m;n++)Q(i,i.bl_tree[V[n]*2+1],3);Le(i,i.dyn_ltree,d-1),Le(i,i.dyn_dtree,c-1)}function Fe(i){var d=4093624447,c;for(c=0;c<=31;c++,d>>>=1)if(d&1&&i.dyn_ltree[c*2]!==0)return P;if(i.dyn_ltree[18]!==0||i.dyn_ltree[20]!==0||i.dyn_ltree[26]!==0)return b;for(c=32;c<p;c++)if(i.dyn_ltree[c*2]!==0)return b;return P}var Ze=!1;function Xe(i){Ze||($(),Ze=!0),i.l_desc=new re(i.dyn_ltree,Se),i.d_desc=new re(i.dyn_dtree,ke),i.bl_desc=new re(i.bl_tree,ue),i.bi_buf=0,i.bi_valid=0,pe(i)}function Me(i,d,c,m){Q(i,(v<<1)+(m?1:0),3),me(i,d,c)}function be(i){Q(i,g<<1,3),ne(i,B,C),se(i)}function Ne(i,d,c,m){var n,o,a=0;i.level>0?(i.strm.data_type===K&&(i.strm.data_type=Fe(i)),Te(i,i.l_desc),Te(i,i.d_desc),a=Ae(i),n=i.opt_len+3+7>>>3,o=i.static_len+3+7>>>3,o<=n&&(n=o)):n=o=c+5,c+4<=n&&d!==-1?Me(i,d,c,m):i.strategy===I||o===n?(Q(i,(g<<1)+(m?1:0),3),Y(i,C,J)):(Q(i,(_<<1)+(m?1:0),3),Ye(i,i.l_desc.max_code+1,i.d_desc.max_code+1,a+1),Y(i,i.dyn_ltree,i.dyn_dtree)),pe(i),m&&Ue(i)}function Ge(i,d,c){return i.pending_buf[i.d_buf+i.last_lit*2]=d>>>8&255,i.pending_buf[i.d_buf+i.last_lit*2+1]=d&255,i.pending_buf[i.l_buf+i.last_lit]=c&255,i.last_lit++,d===0?i.dyn_ltree[c*2]++:(i.matches++,d--,i.dyn_ltree[(ce[c]+p+1)*2]++,i.dyn_dtree[ge(d)*2]++),i.last_lit===i.lit_bufsize-1}return Ke._tr_init=Xe,Ke._tr_stored_block=Me,Ke._tr_flush_block=Ne,Ke._tr_tally=Ge,Ke._tr_align=be,Ke}var $e,ua;function ma(){if(ua)return $e;ua=1;function w(I,P,b,K){for(var s=I&65535|0,v=I>>>16&65535|0,g=0;b!==0;){g=b>2e3?2e3:b,b-=g;do s=s+P[K++]|0,v=v+s|0;while(--g);s%=65521,v%=65521}return s|v<<16|0}return $e=w,$e}var ea,va;function Ta(){if(va)return ea;va=1;function w(){for(var b,K=[],s=0;s<256;s++){b=s;for(var v=0;v<8;v++)b=b&1?3988292384^b>>>1:b>>>1;K[s]=b}return K}var I=w();function P(b,K,s,v){var g=I,_=v+s;b^=-1;for(var D=v;D<_;D++)b=b>>>8^g[(b^K[D])&255];return b^-1}return ea=P,ea}var aa,ca;function ha(){return ca||(ca=1,aa={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"}),aa}var sa;function Ia(){if(sa)return Ie;sa=1;var w=He(),I=Za(),P=ma(),b=Ta(),K=ha(),s=0,v=1,g=3,_=4,D=5,E=0,z=1,p=-2,k=-3,O=-5,ae=-1,N=1,R=2,H=3,T=4,B=0,M=2,Z=8,x=9,U=15,j=8,q=29,V=256,ee=V+1+q,C=30,J=19,le=2*ee+1,ce=15,F=3,he=258,te=he+F+1,Se=32,ke=42,ue=69,re=73,ge=91,de=103,Q=113,ne=666,W=1,se=2,ye=3,ze=4,$=3;function pe(e,l){return e.msg=K[l],l}function Ue(e){return(e<<1)-(e>4?9:0)}function me(e){for(var l=e.length;--l>=0;)e[l]=0}function Ee(e){var l=e.state,h=l.pending;h>e.avail_out&&(h=e.avail_out),h!==0&&(w.arraySet(e.output,l.pending_buf,l.pending_out,h,e.next_out),e.next_out+=h,l.pending_out+=h,e.total_out+=h,e.avail_out-=h,l.pending-=h,l.pending===0&&(l.pending_out=0))}function ie(e,l){I._tr_flush_block(e,e.block_start>=0?e.block_start:-1,e.strstart-e.block_start,l),e.block_start=e.strstart,Ee(e.strm)}function Y(e,l){e.pending_buf[e.pending++]=l}function Te(e,l){e.pending_buf[e.pending++]=l>>>8&255,e.pending_buf[e.pending++]=l&255}function qe(e,l,h,t){var r=e.avail_in;return r>t&&(r=t),r===0?0:(e.avail_in-=r,w.arraySet(l,e.input,e.next_in,r,h),e.state.wrap===1?e.adler=P(e.adler,l,r,h):e.state.wrap===2&&(e.adler=b(e.adler,l,r,h)),e.next_in+=r,e.total_in+=r,r)}function Le(e,l){var h=e.max_chain_length,t=e.strstart,r,f,A=e.prev_length,S=e.nice_match,y=e.strstart>e.w_size-te?e.strstart-(e.w_size-te):0,X=e.window,Be=e.w_mask,fe=e.prev,G=e.strstart+he,oe=X[t+A-1],we=X[t+A];e.prev_length>=e.good_match&&(h>>=2),S>e.lookahead&&(S=e.lookahead);do if(r=l,!(X[r+A]!==we||X[r+A-1]!==oe||X[r]!==X[t]||X[++r]!==X[t+1])){t+=2,r++;do;while(X[++t]===X[++r]&&X[++t]===X[++r]&&X[++t]===X[++r]&&X[++t]===X[++r]&&X[++t]===X[++r]&&X[++t]===X[++r]&&X[++t]===X[++r]&&X[++t]===X[++r]&&t<G);if(f=he-(G-t),t=G-he,f>A){if(e.match_start=l,A=f,f>=S)break;oe=X[t+A-1],we=X[t+A]}}while((l=fe[l&Be])>y&&--h!==0);return A<=e.lookahead?A:e.lookahead}function Ae(e){var l=e.w_size,h,t,r,f,A;do{if(f=e.window_size-e.lookahead-e.strstart,e.strstart>=l+(l-te)){w.arraySet(e.window,e.window,l,l,0),e.match_start-=l,e.strstart-=l,e.block_start-=l,t=e.hash_size,h=t;do r=e.head[--h],e.head[h]=r>=l?r-l:0;while(--t);t=l,h=t;do r=e.prev[--h],e.prev[h]=r>=l?r-l:0;while(--t);f+=l}if(e.strm.avail_in===0)break;if(t=qe(e.strm,e.window,e.strstart+e.lookahead,f),e.lookahead+=t,e.lookahead+e.insert>=F)for(A=e.strstart-e.insert,e.ins_h=e.window[A],e.ins_h=(e.ins_h<<e.hash_shift^e.window[A+1])&e.hash_mask;e.insert&&(e.ins_h=(e.ins_h<<e.hash_shift^e.window[A+F-1])&e.hash_mask,e.prev[A&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=A,A++,e.insert--,!(e.lookahead+e.insert<F)););}while(e.lookahead<te&&e.strm.avail_in!==0)}function Ye(e,l){var h=65535;for(h>e.pending_buf_size-5&&(h=e.pending_buf_size-5);;){if(e.lookahead<=1){if(Ae(e),e.lookahead===0&&l===s)return W;if(e.lookahead===0)break}e.strstart+=e.lookahead,e.lookahead=0;var t=e.block_start+h;if((e.strstart===0||e.strstart>=t)&&(e.lookahead=e.strstart-t,e.strstart=t,ie(e,!1),e.strm.avail_out===0)||e.strstart-e.block_start>=e.w_size-te&&(ie(e,!1),e.strm.avail_out===0))return W}return e.insert=0,l===_?(ie(e,!0),e.strm.avail_out===0?ye:ze):(e.strstart>e.block_start&&(ie(e,!1),e.strm.avail_out===0),W)}function Fe(e,l){for(var h,t;;){if(e.lookahead<te){if(Ae(e),e.lookahead<te&&l===s)return W;if(e.lookahead===0)break}if(h=0,e.lookahead>=F&&(e.ins_h=(e.ins_h<<e.hash_shift^e.window[e.strstart+F-1])&e.hash_mask,h=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart),h!==0&&e.strstart-h<=e.w_size-te&&(e.match_length=Le(e,h)),e.match_length>=F)if(t=I._tr_tally(e,e.strstart-e.match_start,e.match_length-F),e.lookahead-=e.match_length,e.match_length<=e.max_lazy_match&&e.lookahead>=F){e.match_length--;do e.strstart++,e.ins_h=(e.ins_h<<e.hash_shift^e.window[e.strstart+F-1])&e.hash_mask,h=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart;while(--e.match_length!==0);e.strstart++}else e.strstart+=e.match_length,e.match_length=0,e.ins_h=e.window[e.strstart],e.ins_h=(e.ins_h<<e.hash_shift^e.window[e.strstart+1])&e.hash_mask;else t=I._tr_tally(e,0,e.window[e.strstart]),e.lookahead--,e.strstart++;if(t&&(ie(e,!1),e.strm.avail_out===0))return W}return e.insert=e.strstart<F-1?e.strstart:F-1,l===_?(ie(e,!0),e.strm.avail_out===0?ye:ze):e.last_lit&&(ie(e,!1),e.strm.avail_out===0)?W:se}function Ze(e,l){for(var h,t,r;;){if(e.lookahead<te){if(Ae(e),e.lookahead<te&&l===s)return W;if(e.lookahead===0)break}if(h=0,e.lookahead>=F&&(e.ins_h=(e.ins_h<<e.hash_shift^e.window[e.strstart+F-1])&e.hash_mask,h=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart),e.prev_length=e.match_length,e.prev_match=e.match_start,e.match_length=F-1,h!==0&&e.prev_length<e.max_lazy_match&&e.strstart-h<=e.w_size-te&&(e.match_length=Le(e,h),e.match_length<=5&&(e.strategy===N||e.match_length===F&&e.strstart-e.match_start>4096)&&(e.match_length=F-1)),e.prev_length>=F&&e.match_length<=e.prev_length){r=e.strstart+e.lookahead-F,t=I._tr_tally(e,e.strstart-1-e.prev_match,e.prev_length-F),e.lookahead-=e.prev_length-1,e.prev_length-=2;do++e.strstart<=r&&(e.ins_h=(e.ins_h<<e.hash_shift^e.window[e.strstart+F-1])&e.hash_mask,h=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart);while(--e.prev_length!==0);if(e.match_available=0,e.match_length=F-1,e.strstart++,t&&(ie(e,!1),e.strm.avail_out===0))return W}else if(e.match_available){if(t=I._tr_tally(e,0,e.window[e.strstart-1]),t&&ie(e,!1),e.strstart++,e.lookahead--,e.strm.avail_out===0)return W}else e.match_available=1,e.strstart++,e.lookahead--}return e.match_available&&(t=I._tr_tally(e,0,e.window[e.strstart-1]),e.match_available=0),e.insert=e.strstart<F-1?e.strstart:F-1,l===_?(ie(e,!0),e.strm.avail_out===0?ye:ze):e.last_lit&&(ie(e,!1),e.strm.avail_out===0)?W:se}function Xe(e,l){for(var h,t,r,f,A=e.window;;){if(e.lookahead<=he){if(Ae(e),e.lookahead<=he&&l===s)return W;if(e.lookahead===0)break}if(e.match_length=0,e.lookahead>=F&&e.strstart>0&&(r=e.strstart-1,t=A[r],t===A[++r]&&t===A[++r]&&t===A[++r])){f=e.strstart+he;do;while(t===A[++r]&&t===A[++r]&&t===A[++r]&&t===A[++r]&&t===A[++r]&&t===A[++r]&&t===A[++r]&&t===A[++r]&&r<f);e.match_length=he-(f-r),e.match_length>e.lookahead&&(e.match_length=e.lookahead)}if(e.match_length>=F?(h=I._tr_tally(e,1,e.match_length-F),e.lookahead-=e.match_length,e.strstart+=e.match_length,e.match_length=0):(h=I._tr_tally(e,0,e.window[e.strstart]),e.lookahead--,e.strstart++),h&&(ie(e,!1),e.strm.avail_out===0))return W}return e.insert=0,l===_?(ie(e,!0),e.strm.avail_out===0?ye:ze):e.last_lit&&(ie(e,!1),e.strm.avail_out===0)?W:se}function Me(e,l){for(var h;;){if(e.lookahead===0&&(Ae(e),e.lookahead===0)){if(l===s)return W;break}if(e.match_length=0,h=I._tr_tally(e,0,e.window[e.strstart]),e.lookahead--,e.strstart++,h&&(ie(e,!1),e.strm.avail_out===0))return W}return e.insert=0,l===_?(ie(e,!0),e.strm.avail_out===0?ye:ze):e.last_lit&&(ie(e,!1),e.strm.avail_out===0)?W:se}function be(e,l,h,t,r){this.good_length=e,this.max_lazy=l,this.nice_length=h,this.max_chain=t,this.func=r}var Ne;Ne=[new be(0,0,0,0,Ye),new be(4,4,8,4,Fe),new be(4,5,16,8,Fe),new be(4,6,32,32,Fe),new be(4,4,16,16,Ze),new be(8,16,32,32,Ze),new be(8,16,128,128,Ze),new be(8,32,128,256,Ze),new be(32,128,258,1024,Ze),new be(32,258,258,4096,Ze)];function Ge(e){e.window_size=2*e.w_size,me(e.head),e.max_lazy_match=Ne[e.level].max_lazy,e.good_match=Ne[e.level].good_length,e.nice_match=Ne[e.level].nice_length,e.max_chain_length=Ne[e.level].max_chain,e.strstart=0,e.block_start=0,e.lookahead=0,e.insert=0,e.match_length=e.prev_length=F-1,e.match_available=0,e.ins_h=0}function i(){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=Z,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 w.Buf16(le*2),this.dyn_dtree=new w.Buf16((2*C+1)*2),this.bl_tree=new w.Buf16((2*J+1)*2),me(this.dyn_ltree),me(this.dyn_dtree),me(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new w.Buf16(ce+1),this.heap=new w.Buf16(2*ee+1),me(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new w.Buf16(2*ee+1),me(this.depth),this.l_buf=0,this.lit_bufsize=0,this.last_lit=0,this.d_buf=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0}function d(e){var l;return!e||!e.state?pe(e,p):(e.total_in=e.total_out=0,e.data_type=M,l=e.state,l.pending=0,l.pending_out=0,l.wrap<0&&(l.wrap=-l.wrap),l.status=l.wrap?ke:Q,e.adler=l.wrap===2?0:1,l.last_flush=s,I._tr_init(l),E)}function c(e){var l=d(e);return l===E&&Ge(e.state),l}function m(e,l){return!e||!e.state||e.state.wrap!==2?p:(e.state.gzhead=l,E)}function n(e,l,h,t,r,f){if(!e)return p;var A=1;if(l===ae&&(l=6),t<0?(A=0,t=-t):t>15&&(A=2,t-=16),r<1||r>x||h!==Z||t<8||t>15||l<0||l>9||f<0||f>T)return pe(e,p);t===8&&(t=9);var S=new i;return e.state=S,S.strm=e,S.wrap=A,S.gzhead=null,S.w_bits=t,S.w_size=1<<S.w_bits,S.w_mask=S.w_size-1,S.hash_bits=r+7,S.hash_size=1<<S.hash_bits,S.hash_mask=S.hash_size-1,S.hash_shift=~~((S.hash_bits+F-1)/F),S.window=new w.Buf8(S.w_size*2),S.head=new w.Buf16(S.hash_size),S.prev=new w.Buf16(S.w_size),S.lit_bufsize=1<<r+6,S.pending_buf_size=S.lit_bufsize*4,S.pending_buf=new w.Buf8(S.pending_buf_size),S.d_buf=1*S.lit_bufsize,S.l_buf=3*S.lit_bufsize,S.level=l,S.strategy=f,S.method=h,c(e)}function o(e,l){return n(e,l,Z,U,j,B)}function a(e,l){var h,t,r,f;if(!e||!e.state||l>D||l<0)return e?pe(e,p):p;if(t=e.state,!e.output||!e.input&&e.avail_in!==0||t.status===ne&&l!==_)return pe(e,e.avail_out===0?O:p);if(t.strm=e,h=t.last_flush,t.last_flush=l,t.status===ke)if(t.wrap===2)e.adler=0,Y(t,31),Y(t,139),Y(t,8),t.gzhead?(Y(t,(t.gzhead.text?1:0)+(t.gzhead.hcrc?2:0)+(t.gzhead.extra?4:0)+(t.gzhead.name?8:0)+(t.gzhead.comment?16:0)),Y(t,t.gzhead.time&255),Y(t,t.gzhead.time>>8&255),Y(t,t.gzhead.time>>16&255),Y(t,t.gzhead.time>>24&255),Y(t,t.level===9?2:t.strategy>=R||t.level<2?4:0),Y(t,t.gzhead.os&255),t.gzhead.extra&&t.gzhead.extra.length&&(Y(t,t.gzhead.extra.length&255),Y(t,t.gzhead.extra.length>>8&255)),t.gzhead.hcrc&&(e.adler=b(e.adler,t.pending_buf,t.pending,0)),t.gzindex=0,t.status=ue):(Y(t,0),Y(t,0),Y(t,0),Y(t,0),Y(t,0),Y(t,t.level===9?2:t.strategy>=R||t.level<2?4:0),Y(t,$),t.status=Q);else{var A=Z+(t.w_bits-8<<4)<<8,S=-1;t.strategy>=R||t.level<2?S=0:t.level<6?S=1:t.level===6?S=2:S=3,A|=S<<6,t.strstart!==0&&(A|=Se),A+=31-A%31,t.status=Q,Te(t,A),t.strstart!==0&&(Te(t,e.adler>>>16),Te(t,e.adler&65535)),e.adler=1}if(t.status===ue)if(t.gzhead.extra){for(r=t.pending;t.gzindex<(t.gzhead.extra.length&65535)&&!(t.pending===t.pending_buf_size&&(t.gzhead.hcrc&&t.pending>r&&(e.adler=b(e.adler,t.pending_buf,t.pending-r,r)),Ee(e),r=t.pending,t.pending===t.pending_buf_size));)Y(t,t.gzhead.extra[t.gzindex]&255),t.gzindex++;t.gzhead.hcrc&&t.pending>r&&(e.adler=b(e.adler,t.pending_buf,t.pending-r,r)),t.gzindex===t.gzhead.extra.length&&(t.gzindex=0,t.status=re)}else t.status=re;if(t.status===re)if(t.gzhead.name){r=t.pending;do{if(t.pending===t.pending_buf_size&&(t.gzhead.hcrc&&t.pending>r&&(e.adler=b(e.adler,t.pending_buf,t.pending-r,r)),Ee(e),r=t.pending,t.pending===t.pending_buf_size)){f=1;break}t.gzindex<t.gzhead.name.length?f=t.gzhead.name.charCodeAt(t.gzindex++)&255:f=0,Y(t,f)}while(f!==0);t.gzhead.hcrc&&t.pending>r&&(e.adler=b(e.adler,t.pending_buf,t.pending-r,r)),f===0&&(t.gzindex=0,t.status=ge)}else t.status=ge;if(t.status===ge)if(t.gzhead.comment){r=t.pending;do{if(t.pending===t.pending_buf_size&&(t.gzhead.hcrc&&t.pending>r&&(e.adler=b(e.adler,t.pending_buf,t.pending-r,r)),Ee(e),r=t.pending,t.pending===t.pending_buf_size)){f=1;break}t.gzindex<t.gzhead.comment.length?f=t.gzhead.comment.charCodeAt(t.gzindex++)&255:f=0,Y(t,f)}while(f!==0);t.gzhead.hcrc&&t.pending>r&&(e.adler=b(e.adler,t.pending_buf,t.pending-r,r)),f===0&&(t.status=de)}else t.status=de;if(t.status===de&&(t.gzhead.hcrc?(t.pending+2>t.pending_buf_size&&Ee(e),t.pending+2<=t.pending_buf_size&&(Y(t,e.adler&255),Y(t,e.adler>>8&255),e.adler=0,t.status=Q)):t.status=Q),t.pending!==0){if(Ee(e),e.avail_out===0)return t.last_flush=-1,E}else if(e.avail_in===0&&Ue(l)<=Ue(h)&&l!==_)return pe(e,O);if(t.status===ne&&e.avail_in!==0)return pe(e,O);if(e.avail_in!==0||t.lookahead!==0||l!==s&&t.status!==ne){var y=t.strategy===R?Me(t,l):t.strategy===H?Xe(t,l):Ne[t.level].func(t,l);if((y===ye||y===ze)&&(t.status=ne),y===W||y===ye)return e.avail_out===0&&(t.last_flush=-1),E;if(y===se&&(l===v?I._tr_align(t):l!==D&&(I._tr_stored_block(t,0,0,!1),l===g&&(me(t.head),t.lookahead===0&&(t.strstart=0,t.block_start=0,t.insert=0))),Ee(e),e.avail_out===0))return t.last_flush=-1,E}return l!==_?E:t.wrap<=0?z:(t.wrap===2?(Y(t,e.adler&255),Y(t,e.adler>>8&255),Y(t,e.adler>>16&255),Y(t,e.adler>>24&255),Y(t,e.total_in&255),Y(t,e.total_in>>8&255),Y(t,e.total_in>>16&255),Y(t,e.total_in>>24&255)):(Te(t,e.adler>>>16),Te(t,e.adler&65535)),Ee(e),t.wrap>0&&(t.wrap=-t.wrap),t.pending!==0?E:z)}function u(e){var l;return!e||!e.state?p:(l=e.state.status,l!==ke&&l!==ue&&l!==re&&l!==ge&&l!==de&&l!==Q&&l!==ne?pe(e,p):(e.state=null,l===Q?pe(e,k):E))}function L(e,l){var h=l.length,t,r,f,A,S,y,X,Be;if(!e||!e.state||(t=e.state,A=t.wrap,A===2||A===1&&t.status!==ke||t.lookahead))return p;for(A===1&&(e.adler=P(e.adler,l,h,0)),t.wrap=0,h>=t.w_size&&(A===0&&(me(t.head),t.strstart=0,t.block_start=0,t.insert=0),Be=new w.Buf8(t.w_size),w.arraySet(Be,l,h-t.w_size,t.w_size,0),l=Be,h=t.w_size),S=e.avail_in,y=e.next_in,X=e.input,e.avail_in=h,e.next_in=0,e.input=l,Ae(t);t.lookahead>=F;){r=t.strstart,f=t.lookahead-(F-1);do t.ins_h=(t.ins_h<<t.hash_shift^t.window[r+F-1])&t.hash_mask,t.prev[r&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=r,r++;while(--f);t.strstart=r,t.lookahead=F-1,Ae(t)}return t.strstart+=t.lookahead,t.block_start=t.strstart,t.insert=t.lookahead,t.lookahead=0,t.match_length=t.prev_length=F-1,t.match_available=0,e.next_in=y,e.input=X,e.avail_in=S,t.wrap=A,E}return Ie.deflateInit=o,Ie.deflateInit2=n,Ie.deflateReset=c,Ie.deflateResetKeep=d,Ie.deflateSetHeader=m,Ie.deflate=a,Ie.deflateEnd=u,Ie.deflateSetDictionary=L,Ie.deflateInfo="pako deflate (from Nodeca project)",Ie}var Pe={},ba;function Aa(){if(ba)return Pe;ba=1;var w=He(),I=!0,P=!0;try{String.fromCharCode.apply(null,[0])}catch{I=!1}try{String.fromCharCode.apply(null,new Uint8Array(1))}catch{P=!1}for(var b=new w.Buf8(256),K=0;K<256;K++)b[K]=K>=252?6:K>=248?5:K>=240?4:K>=224?3:K>=192?2:1;b[254]=b[254]=1,Pe.string2buf=function(v){var g,_,D,E,z,p=v.length,k=0;for(E=0;E<p;E++)_=v.charCodeAt(E),(_&64512)===55296&&E+1<p&&(D=v.charCodeAt(E+1),(D&64512)===56320&&(_=65536+(_-55296<<10)+(D-56320),E++)),k+=_<128?1:_<2048?2:_<65536?3:4;for(g=new w.Buf8(k),z=0,E=0;z<k;E++)_=v.charCodeAt(E),(_&64512)===55296&&E+1<p&&(D=v.charCodeAt(E+1),(D&64512)===56320&&(_=65536+(_-55296<<10)+(D-56320),E++)),_<128?g[z++]=_:_<2048?(g[z++]=192|_>>>6,g[z++]=128|_&63):_<65536?(g[z++]=224|_>>>12,g[z++]=128|_>>>6&63,g[z++]=128|_&63):(g[z++]=240|_>>>18,g[z++]=128|_>>>12&63,g[z++]=128|_>>>6&63,g[z++]=128|_&63);return g};function s(v,g){if(g<65534&&(v.subarray&&P||!v.subarray&&I))return String.fromCharCode.apply(null,w.shrinkBuf(v,g));for(var _="",D=0;D<g;D++)_+=String.fromCharCode(v[D]);return _}return Pe.buf2binstring=function(v){return s(v,v.length)},Pe.binstring2buf=function(v){for(var g=new w.Buf8(v.length),_=0,D=g.length;_<D;_++)g[_]=v.charCodeAt(_);return g},Pe.buf2string=function(v,g){var _,D,E,z,p=g||v.length,k=new Array(p*2);for(D=0,_=0;_<p;){if(E=v[_++],E<128){k[D++]=E;continue}if(z=b[E],z>4){k[D++]=65533,_+=z-1;continue}for(E&=z===2?31:z===3?15:7;z>1&&_<p;)E=E<<6|v[_++]&63,z--;if(z>1){k[D++]=65533;continue}E<65536?k[D++]=E:(E-=65536,k[D++]=55296|E>>10&1023,k[D++]=56320|E&1023)}return s(k,D)},Pe.utf8border=function(v,g){var _;for(g=g||v.length,g>v.length&&(g=v.length),_=g-1;_>=0&&(v[_]&192)===128;)_--;return _<0||_===0?g:_+b[v[_]]>g?_:g},Pe}var ta,wa;function Ra(){if(wa)return ta;wa=1;function w(){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}return ta=w,ta}var ga;function Na(){if(ga)return je;ga=1;var w=Ia(),I=He(),P=Aa(),b=ha(),K=Ra(),s=Object.prototype.toString,v=0,g=4,_=0,D=1,E=2,z=-1,p=0,k=8;function O(H){if(!(this instanceof O))return new O(H);this.options=I.assign({level:z,method:k,chunkSize:16384,windowBits:15,memLevel:8,strategy:p,to:""},H||{});var T=this.options;T.raw&&T.windowBits>0?T.windowBits=-T.windowBits:T.gzip&&T.windowBits>0&&T.windowBits<16&&(T.windowBits+=16),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new K,this.strm.avail_out=0;var B=w.deflateInit2(this.strm,T.level,T.method,T.windowBits,T.memLevel,T.strategy);if(B!==_)throw new Error(b[B]);if(T.header&&w.deflateSetHeader(this.strm,T.header),T.dictionary){var M;if(typeof T.dictionary=="string"?M=P.string2buf(T.dictionary):s.call(T.dictionary)==="[object ArrayBuffer]"?M=new Uint8Array(T.dictionary):M=T.dictionary,B=w.deflateSetDictionary(this.strm,M),B!==_)throw new Error(b[B]);this._dict_set=!0}}O.prototype.push=function(H,T){var B=this.strm,M=this.options.chunkSize,Z,x;if(this.ended)return!1;x=T===~~T?T:T===!0?g:v,typeof H=="string"?B.input=P.string2buf(H):s.call(H)==="[object ArrayBuffer]"?B.input=new Uint8Array(H):B.input=H,B.next_in=0,B.avail_in=B.input.length;do{if(B.avail_out===0&&(B.output=new I.Buf8(M),B.next_out=0,B.avail_out=M),Z=w.deflate(B,x),Z!==D&&Z!==_)return this.onEnd(Z),this.ended=!0,!1;(B.avail_out===0||B.avail_in===0&&(x===g||x===E))&&(this.options.to==="string"?this.onData(P.buf2binstring(I.shrinkBuf(B.output,B.next_out))):this.onData(I.shrinkBuf(B.output,B.next_out)))}while((B.avail_in>0||B.avail_out===0)&&Z!==D);return x===g?(Z=w.deflateEnd(this.strm),this.onEnd(Z),this.ended=!0,Z===_):(x===E&&(this.onEnd(_),B.avail_out=0),!0)},O.prototype.onData=function(H){this.chunks.push(H)},O.prototype.onEnd=function(H){H===_&&(this.options.to==="string"?this.result=this.chunks.join(""):this.result=I.flattenChunks(this.chunks)),this.chunks=[],this.err=H,this.msg=this.strm.msg};function ae(H,T){var B=new O(T);if(B.push(H,!0),B.err)throw B.msg||b[B.err];return B.result}function N(H,T){return T=T||{},T.raw=!0,ae(H,T)}function R(H,T){return T=T||{},T.gzip=!0,ae(H,T)}return je.Deflate=O,je.deflate=ae,je.deflateRaw=N,je.gzip=R,je}var We={},De={},ia,pa;function Oa(){if(pa)return ia;pa=1;var w=30,I=12;return ia=function(b,K){var s,v,g,_,D,E,z,p,k,O,ae,N,R,H,T,B,M,Z,x,U,j,q,V,ee,C;s=b.state,v=b.next_in,ee=b.input,g=v+(b.avail_in-5),_=b.next_out,C=b.output,D=_-(K-b.avail_out),E=_+(b.avail_out-257),z=s.dmax,p=s.wsize,k=s.whave,O=s.wnext,ae=s.window,N=s.hold,R=s.bits,H=s.lencode,T=s.distcode,B=(1<<s.lenbits)-1,M=(1<<s.distbits)-1;e:do{R<15&&(N+=ee[v++]<<R,R+=8,N+=ee[v++]<<R,R+=8),Z=H[N&B];a:for(;;){if(x=Z>>>24,N>>>=x,R-=x,x=Z>>>16&255,x===0)C[_++]=Z&65535;else if(x&16){U=Z&65535,x&=15,x&&(R<x&&(N+=ee[v++]<<R,R+=8),U+=N&(1<<x)-1,N>>>=x,R-=x),R<15&&(N+=ee[v++]<<R,R+=8,N+=ee[v++]<<R,R+=8),Z=T[N&M];t:for(;;){if(x=Z>>>24,N>>>=x,R-=x,x=Z>>>16&255,x&16){if(j=Z&65535,x&=15,R<x&&(N+=ee[v++]<<R,R+=8,R<x&&(N+=ee[v++]<<R,R+=8)),j+=N&(1<<x)-1,j>z){b.msg="invalid distance too far back",s.mode=w;break e}if(N>>>=x,R-=x,x=_-D,j>x){if(x=j-x,x>k&&s.sane){b.msg="invalid distance too far back",s.mode=w;break e}if(q=0,V=ae,O===0){if(q+=p-x,x<U){U-=x;do C[_++]=ae[q++];while(--x);q=_-j,V=C}}else if(O<x){if(q+=p+O-x,x-=O,x<U){U-=x;do C[_++]=ae[q++];while(--x);if(q=0,O<U){x=O,U-=x;do C[_++]=ae[q++];while(--x);q=_-j,V=C}}}else if(q+=O-x,x<U){U-=x;do C[_++]=ae[q++];while(--x);q=_-j,V=C}for(;U>2;)C[_++]=V[q++],C[_++]=V[q++],C[_++]=V[q++],U-=3;U&&(C[_++]=V[q++],U>1&&(C[_++]=V[q++]))}else{q=_-j;do C[_++]=C[q++],C[_++]=C[q++],C[_++]=C[q++],U-=3;while(U>2);U&&(C[_++]=C[q++],U>1&&(C[_++]=C[q++]))}}else if((x&64)===0){Z=T[(Z&65535)+(N&(1<<x)-1)];continue t}else{b.msg="invalid distance code",s.mode=w;break e}break}}else if((x&64)===0){Z=H[(Z&65535)+(N&(1<<x)-1)];continue a}else if(x&32){s.mode=I;break e}else{b.msg="invalid literal/length code",s.mode=w;break e}break}}while(v<g&&_<E);U=R>>3,v-=U,R-=U<<3,N&=(1<<R)-1,b.next_in=v,b.next_out=_,b.avail_in=v<g?5+(g-v):5-(v-g),b.avail_out=_<E?257+(E-_):257-(_-E),s.hold=N,s.bits=R},ia}var ra,xa;function Ba(){if(xa)return ra;xa=1;var w=He(),I=15,P=852,b=592,K=0,s=1,v=2,g=[3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258,0,0],_=[16,16,16,16,16,16,16,16,17,17,17,17,18,18,18,18,19,19,19,19,20,20,20,20,21,21,21,21,16,72,78],D=[1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577,0,0],E=[16,16,16,16,17,17,18,18,19,19,20,20,21,21,22,22,23,23,24,24,25,25,26,26,27,27,28,28,29,29,64,64];return ra=function(p,k,O,ae,N,R,H,T){var B=T.bits,M=0,Z=0,x=0,U=0,j=0,q=0,V=0,ee=0,C=0,J=0,le,ce,F,he,te,Se=null,ke=0,ue,re=new w.Buf16(I+1),ge=new w.Buf16(I+1),de=null,Q=0,ne,W,se;for(M=0;M<=I;M++)re[M]=0;for(Z=0;Z<ae;Z++)re[k[O+Z]]++;for(j=B,U=I;U>=1&&re[U]===0;U--);if(j>U&&(j=U),U===0)return N[R++]=1<<24|64<<16|0,N[R++]=1<<24|64<<16|0,T.bits=1,0;for(x=1;x<U&&re[x]===0;x++);for(j<x&&(j=x),ee=1,M=1;M<=I;M++)if(ee<<=1,ee-=re[M],ee<0)return-1;if(ee>0&&(p===K||U!==1))return-1;for(ge[1]=0,M=1;M<I;M++)ge[M+1]=ge[M]+re[M];for(Z=0;Z<ae;Z++)k[O+Z]!==0&&(H[ge[k[O+Z]]++]=Z);if(p===K?(Se=de=H,ue=19):p===s?(Se=g,ke-=257,de=_,Q-=257,ue=256):(Se=D,de=E,ue=-1),J=0,Z=0,M=x,te=R,q=j,V=0,F=-1,C=1<<j,he=C-1,p===s&&C>P||p===v&&C>b)return 1;for(;;){ne=M-V,H[Z]<ue?(W=0,se=H[Z]):H[Z]>ue?(W=de[Q+H[Z]],se=Se[ke+H[Z]]):(W=96,se=0),le=1<<M-V,ce=1<<q,x=ce;do ce-=le,N[te+(J>>V)+ce]=ne<<24|W<<16|se|0;while(ce!==0);for(le=1<<M-1;J≤)le>>=1;if(le!==0?(J&=le-1,J+=le):J=0,Z++,--re[M]===0){if(M===U)break;M=k[O+H[Z]]}if(M>j&&(J&he)!==F){for(V===0&&(V=j),te+=x,q=M-V,ee=1<<q;q+V<U&&(ee-=re[q+V],!(ee<=0));)q++,ee<<=1;if(C+=1<<q,p===s&&C>P||p===v&&C>b)return 1;F=J&he,N[F]=j<<24|q<<16|te-R|0}}return J!==0&&(N[te+J]=M-V<<24|64<<16|0),T.bits=j,0},ra}var ka;function Ca(){if(ka)return De;ka=1;var w=He(),I=ma(),P=Ta(),b=Oa(),K=Ba(),s=0,v=1,g=2,_=4,D=5,E=6,z=0,p=1,k=2,O=-2,ae=-3,N=-4,R=-5,H=8,T=1,B=2,M=3,Z=4,x=5,U=6,j=7,q=8,V=9,ee=10,C=11,J=12,le=13,ce=14,F=15,he=16,te=17,Se=18,ke=19,ue=20,re=21,ge=22,de=23,Q=24,ne=25,W=26,se=27,ye=28,ze=29,$=30,pe=31,Ue=32,me=852,Ee=592,ie=15,Y=ie;function Te(n){return(n>>>24&255)+(n>>>8&65280)+((n&65280)<<8)+((n&255)<<24)}function qe(){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 w.Buf16(320),this.work=new w.Buf16(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0}function Le(n){var o;return!n||!n.state?O:(o=n.state,n.total_in=n.total_out=o.total=0,n.msg="",o.wrap&&(n.adler=o.wrap&1),o.mode=T,o.last=0,o.havedict=0,o.dmax=32768,o.head=null,o.hold=0,o.bits=0,o.lencode=o.lendyn=new w.Buf32(me),o.distcode=o.distdyn=new w.Buf32(Ee),o.sane=1,o.back=-1,z)}function Ae(n){var o;return!n||!n.state?O:(o=n.state,o.wsize=0,o.whave=0,o.wnext=0,Le(n))}function Ye(n,o){var a,u;return!n||!n.state||(u=n.state,o<0?(a=0,o=-o):(a=(o>>4)+1,o<48&&(o&=15)),o&&(o<8||o>15))?O:(u.window!==null&&u.wbits!==o&&(u.window=null),u.wrap=a,u.wbits=o,Ae(n))}function Fe(n,o){var a,u;return n?(u=new qe,n.state=u,u.window=null,a=Ye(n,o),a!==z&&(n.state=null),a):O}function Ze(n){return Fe(n,Y)}var Xe=!0,Me,be;function Ne(n){if(Xe){var o;for(Me=new w.Buf32(512),be=new w.Buf32(32),o=0;o<144;)n.lens[o++]=8;for(;o<256;)n.lens[o++]=9;for(;o<280;)n.lens[o++]=7;for(;o<288;)n.lens[o++]=8;for(K(v,n.lens,0,288,Me,0,n.work,{bits:9}),o=0;o<32;)n.lens[o++]=5;K(g,n.lens,0,32,be,0,n.work,{bits:5}),Xe=!1}n.lencode=Me,n.lenbits=9,n.distcode=be,n.distbits=5}function Ge(n,o,a,u){var L,e=n.state;return e.window===null&&(e.wsize=1<<e.wbits,e.wnext=0,e.whave=0,e.window=new w.Buf8(e.wsize)),u>=e.wsize?(w.arraySet(e.window,o,a-e.wsize,e.wsize,0),e.wnext=0,e.whave=e.wsize):(L=e.wsize-e.wnext,L>u&&(L=u),w.arraySet(e.window,o,a-u,L,e.wnext),u-=L,u?(w.arraySet(e.window,o,a-u,u,0),e.wnext=u,e.whave=e.wsize):(e.wnext+=L,e.wnext===e.wsize&&(e.wnext=0),e.whave<e.wsize&&(e.whave+=L))),0}function i(n,o){var a,u,L,e,l,h,t,r,f,A,S,y,X,Be,fe=0,G,oe,we,xe,Ve,Je,_e,Re,ve=new w.Buf8(4),Ce,Oe,_a=[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];if(!n||!n.state||!n.output||!n.input&&n.avail_in!==0)return O;a=n.state,a.mode===J&&(a.mode=le),l=n.next_out,L=n.output,t=n.avail_out,e=n.next_in,u=n.input,h=n.avail_in,r=a.hold,f=a.bits,A=h,S=t,Re=z;e:for(;;)switch(a.mode){case T:if(a.wrap===0){a.mode=le;break}for(;f<16;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}if(a.wrap&2&&r===35615){a.check=0,ve[0]=r&255,ve[1]=r>>>8&255,a.check=P(a.check,ve,2,0),r=0,f=0,a.mode=B;break}if(a.flags=0,a.head&&(a.head.done=!1),!(a.wrap&1)||(((r&255)<<8)+(r>>8))%31){n.msg="incorrect header check",a.mode=$;break}if((r&15)!==H){n.msg="unknown compression method",a.mode=$;break}if(r>>>=4,f-=4,_e=(r&15)+8,a.wbits===0)a.wbits=_e;else if(_e>a.wbits){n.msg="invalid window size",a.mode=$;break}a.dmax=1<<_e,n.adler=a.check=1,a.mode=r&512?ee:J,r=0,f=0;break;case B:for(;f<16;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}if(a.flags=r,(a.flags&255)!==H){n.msg="unknown compression method",a.mode=$;break}if(a.flags&57344){n.msg="unknown header flags set",a.mode=$;break}a.head&&(a.head.text=r>>8&1),a.flags&512&&(ve[0]=r&255,ve[1]=r>>>8&255,a.check=P(a.check,ve,2,0)),r=0,f=0,a.mode=M;case M:for(;f<32;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}a.head&&(a.head.time=r),a.flags&512&&(ve[0]=r&255,ve[1]=r>>>8&255,ve[2]=r>>>16&255,ve[3]=r>>>24&255,a.check=P(a.check,ve,4,0)),r=0,f=0,a.mode=Z;case Z:for(;f<16;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}a.head&&(a.head.xflags=r&255,a.head.os=r>>8),a.flags&512&&(ve[0]=r&255,ve[1]=r>>>8&255,a.check=P(a.check,ve,2,0)),r=0,f=0,a.mode=x;case x:if(a.flags&1024){for(;f<16;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}a.length=r,a.head&&(a.head.extra_len=r),a.flags&512&&(ve[0]=r&255,ve[1]=r>>>8&255,a.check=P(a.check,ve,2,0)),r=0,f=0}else a.head&&(a.head.extra=null);a.mode=U;case U:if(a.flags&1024&&(y=a.length,y>h&&(y=h),y&&(a.head&&(_e=a.head.extra_len-a.length,a.head.extra||(a.head.extra=new Array(a.head.extra_len)),w.arraySet(a.head.extra,u,e,y,_e)),a.flags&512&&(a.check=P(a.check,u,y,e)),h-=y,e+=y,a.length-=y),a.length))break e;a.length=0,a.mode=j;case j:if(a.flags&2048){if(h===0)break e;y=0;do _e=u[e+y++],a.head&&_e&&a.length<65536&&(a.head.name+=String.fromCharCode(_e));while(_e&&y<h);if(a.flags&512&&(a.check=P(a.check,u,y,e)),h-=y,e+=y,_e)break e}else a.head&&(a.head.name=null);a.length=0,a.mode=q;case q:if(a.flags&4096){if(h===0)break e;y=0;do _e=u[e+y++],a.head&&_e&&a.length<65536&&(a.head.comment+=String.fromCharCode(_e));while(_e&&y<h);if(a.flags&512&&(a.check=P(a.check,u,y,e)),h-=y,e+=y,_e)break e}else a.head&&(a.head.comment=null);a.mode=V;case V:if(a.flags&512){for(;f<16;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}if(r!==(a.check&65535)){n.msg="header crc mismatch",a.mode=$;break}r=0,f=0}a.head&&(a.head.hcrc=a.flags>>9&1,a.head.done=!0),n.adler=a.check=0,a.mode=J;break;case ee:for(;f<32;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}n.adler=a.check=Te(r),r=0,f=0,a.mode=C;case C:if(a.havedict===0)return n.next_out=l,n.avail_out=t,n.next_in=e,n.avail_in=h,a.hold=r,a.bits=f,k;n.adler=a.check=1,a.mode=J;case J:if(o===D||o===E)break e;case le:if(a.last){r>>>=f&7,f-=f&7,a.mode=se;break}for(;f<3;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}switch(a.last=r&1,r>>>=1,f-=1,r&3){case 0:a.mode=ce;break;case 1:if(Ne(a),a.mode=ue,o===E){r>>>=2,f-=2;break e}break;case 2:a.mode=te;break;case 3:n.msg="invalid block type",a.mode=$}r>>>=2,f-=2;break;case ce:for(r>>>=f&7,f-=f&7;f<32;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}if((r&65535)!==(r>>>16^65535)){n.msg="invalid stored block lengths",a.mode=$;break}if(a.length=r&65535,r=0,f=0,a.mode=F,o===E)break e;case F:a.mode=he;case he:if(y=a.length,y){if(y>h&&(y=h),y>t&&(y=t),y===0)break e;w.arraySet(L,u,e,y,l),h-=y,e+=y,t-=y,l+=y,a.length-=y;break}a.mode=J;break;case te:for(;f<14;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}if(a.nlen=(r&31)+257,r>>>=5,f-=5,a.ndist=(r&31)+1,r>>>=5,f-=5,a.ncode=(r&15)+4,r>>>=4,f-=4,a.nlen>286||a.ndist>30){n.msg="too many length or distance symbols",a.mode=$;break}a.have=0,a.mode=Se;case Se:for(;a.have<a.ncode;){for(;f<3;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}a.lens[_a[a.have++]]=r&7,r>>>=3,f-=3}for(;a.have<19;)a.lens[_a[a.have++]]=0;if(a.lencode=a.lendyn,a.lenbits=7,Ce={bits:a.lenbits},Re=K(s,a.lens,0,19,a.lencode,0,a.work,Ce),a.lenbits=Ce.bits,Re){n.msg="invalid code lengths set",a.mode=$;break}a.have=0,a.mode=ke;case ke:for(;a.have<a.nlen+a.ndist;){for(;fe=a.lencode[r&(1<<a.lenbits)-1],G=fe>>>24,oe=fe>>>16&255,we=fe&65535,!(G<=f);){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}if(we<16)r>>>=G,f-=G,a.lens[a.have++]=we;else{if(we===16){for(Oe=G+2;f<Oe;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}if(r>>>=G,f-=G,a.have===0){n.msg="invalid bit length repeat",a.mode=$;break}_e=a.lens[a.have-1],y=3+(r&3),r>>>=2,f-=2}else if(we===17){for(Oe=G+3;f<Oe;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}r>>>=G,f-=G,_e=0,y=3+(r&7),r>>>=3,f-=3}else{for(Oe=G+7;f<Oe;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}r>>>=G,f-=G,_e=0,y=11+(r&127),r>>>=7,f-=7}if(a.have+y>a.nlen+a.ndist){n.msg="invalid bit length repeat",a.mode=$;break}for(;y--;)a.lens[a.have++]=_e}}if(a.mode===$)break;if(a.lens[256]===0){n.msg="invalid code -- missing end-of-block",a.mode=$;break}if(a.lenbits=9,Ce={bits:a.lenbits},Re=K(v,a.lens,0,a.nlen,a.lencode,0,a.work,Ce),a.lenbits=Ce.bits,Re){n.msg="invalid literal/lengths set",a.mode=$;break}if(a.distbits=6,a.distcode=a.distdyn,Ce={bits:a.distbits},Re=K(g,a.lens,a.nlen,a.ndist,a.distcode,0,a.work,Ce),a.distbits=Ce.bits,Re){n.msg="invalid distances set",a.mode=$;break}if(a.mode=ue,o===E)break e;case ue:a.mode=re;case re:if(h>=6&&t>=258){n.next_out=l,n.avail_out=t,n.next_in=e,n.avail_in=h,a.hold=r,a.bits=f,b(n,S),l=n.next_out,L=n.output,t=n.avail_out,e=n.next_in,u=n.input,h=n.avail_in,r=a.hold,f=a.bits,a.mode===J&&(a.back=-1);break}for(a.back=0;fe=a.lencode[r&(1<<a.lenbits)-1],G=fe>>>24,oe=fe>>>16&255,we=fe&65535,!(G<=f);){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}if(oe&&(oe&240)===0){for(xe=G,Ve=oe,Je=we;fe=a.lencode[Je+((r&(1<<xe+Ve)-1)>>xe)],G=fe>>>24,oe=fe>>>16&255,we=fe&65535,!(xe+G<=f);){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}r>>>=xe,f-=xe,a.back+=xe}if(r>>>=G,f-=G,a.back+=G,a.length=we,oe===0){a.mode=W;break}if(oe&32){a.back=-1,a.mode=J;break}if(oe&64){n.msg="invalid literal/length code",a.mode=$;break}a.extra=oe&15,a.mode=ge;case ge:if(a.extra){for(Oe=a.extra;f<Oe;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}a.length+=r&(1<<a.extra)-1,r>>>=a.extra,f-=a.extra,a.back+=a.extra}a.was=a.length,a.mode=de;case de:for(;fe=a.distcode[r&(1<<a.distbits)-1],G=fe>>>24,oe=fe>>>16&255,we=fe&65535,!(G<=f);){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}if((oe&240)===0){for(xe=G,Ve=oe,Je=we;fe=a.distcode[Je+((r&(1<<xe+Ve)-1)>>xe)],G=fe>>>24,oe=fe>>>16&255,we=fe&65535,!(xe+G<=f);){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}r>>>=xe,f-=xe,a.back+=xe}if(r>>>=G,f-=G,a.back+=G,oe&64){n.msg="invalid distance code",a.mode=$;break}a.offset=we,a.extra=oe&15,a.mode=Q;case Q:if(a.extra){for(Oe=a.extra;f<Oe;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}a.offset+=r&(1<<a.extra)-1,r>>>=a.extra,f-=a.extra,a.back+=a.extra}if(a.offset>a.dmax){n.msg="invalid distance too far back",a.mode=$;break}a.mode=ne;case ne:if(t===0)break e;if(y=S-t,a.offset>y){if(y=a.offset-y,y>a.whave&&a.sane){n.msg="invalid distance too far back",a.mode=$;break}y>a.wnext?(y-=a.wnext,X=a.wsize-y):X=a.wnext-y,y>a.length&&(y=a.length),Be=a.window}else Be=L,X=l-a.offset,y=a.length;y>t&&(y=t),t-=y,a.length-=y;do L[l++]=Be[X++];while(--y);a.length===0&&(a.mode=re);break;case W:if(t===0)break e;L[l++]=a.length,t--,a.mode=re;break;case se:if(a.wrap){for(;f<32;){if(h===0)break e;h--,r|=u[e++]<<f,f+=8}if(S-=t,n.total_out+=S,a.total+=S,S&&(n.adler=a.check=a.flags?P(a.check,L,S,l-S):I(a.check,L,S,l-S)),S=t,(a.flags?r:Te(r))!==a.check){n.msg="incorrect data check",a.mode=$;break}r=0,f=0}a.mode=ye;case ye:if(a.wrap&&a.flags){for(;f<32;){if(h===0)break e;h--,r+=u[e++]<<f,f+=8}if(r!==(a.total&4294967295)){n.msg="incorrect length check",a.mode=$;break}r=0,f=0}a.mode=ze;case ze:Re=p;break e;case $:Re=ae;break e;case pe:return N;case Ue:default:return O}return n.next_out=l,n.avail_out=t,n.next_in=e,n.avail_in=h,a.hold=r,a.bits=f,(a.wsize||S!==n.avail_out&&a.mode<$&&(a.mode<se||o!==_))&&Ge(n,n.output,n.next_out,S-n.avail_out),A-=n.avail_in,S-=n.avail_out,n.total_in+=A,n.total_out+=S,a.total+=S,a.wrap&&S&&(n.adler=a.check=a.flags?P(a.check,L,S,n.next_out-S):I(a.check,L,S,n.next_out-S)),n.data_type=a.bits+(a.last?64:0)+(a.mode===J?128:0)+(a.mode===ue||a.mode===F?256:0),(A===0&&S===0||o===_)&&Re===z&&(Re=R),Re}function d(n){if(!n||!n.state)return O;var o=n.state;return o.window&&(o.window=null),n.state=null,z}function c(n,o){var a;return!n||!n.state||(a=n.state,(a.wrap&2)===0)?O:(a.head=o,o.done=!1,z)}function m(n,o){var a=o.length,u,L,e;return!n||!n.state||(u=n.state,u.wrap!==0&&u.mode!==C)?O:u.mode===C&&(L=1,L=I(L,o,a,0),L!==u.check)?ae:(e=Ge(n,o,a,a),e?(u.mode=pe,N):(u.havedict=1,z))}return De.inflateReset=Ae,De.inflateReset2=Ye,De.inflateResetKeep=Le,De.inflateInit=Ze,De.inflateInit2=Fe,De.inflate=i,De.inflateEnd=d,De.inflateGetHeader=c,De.inflateSetDictionary=m,De.inflateInfo="pako inflate (from Nodeca project)",De}var na,Ea;function Da(){return Ea||(Ea=1,na={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8}),na}var fa,Sa;function La(){if(Sa)return fa;Sa=1;function w(){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}return fa=w,fa}var ya;function Fa(){if(ya)return We;ya=1;var w=Ca(),I=He(),P=Aa(),b=Da(),K=ha(),s=Ra(),v=La(),g=Object.prototype.toString;function _(z){if(!(this instanceof _))return new _(z);this.options=I.assign({chunkSize:16384,windowBits:0,to:""},z||{});var p=this.options;p.raw&&p.windowBits>=0&&p.windowBits<16&&(p.windowBits=-p.windowBits,p.windowBits===0&&(p.windowBits=-15)),p.windowBits>=0&&p.windowBits<16&&!(z&&z.windowBits)&&(p.windowBits+=32),p.windowBits>15&&p.windowBits<48&&(p.windowBits&15)===0&&(p.windowBits|=15),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new s,this.strm.avail_out=0;var k=w.inflateInit2(this.strm,p.windowBits);if(k!==b.Z_OK)throw new Error(K[k]);if(this.header=new v,w.inflateGetHeader(this.strm,this.header),p.dictionary&&(typeof p.dictionary=="string"?p.dictionary=P.string2buf(p.dictionary):g.call(p.dictionary)==="[object ArrayBuffer]"&&(p.dictionary=new Uint8Array(p.dictionary)),p.raw&&(k=w.inflateSetDictionary(this.strm,p.dictionary),k!==b.Z_OK)))throw new Error(K[k])}_.prototype.push=function(z,p){var k=this.strm,O=this.options.chunkSize,ae=this.options.dictionary,N,R,H,T,B,M=!1;if(this.ended)return!1;R=p===~~p?p:p===!0?b.Z_FINISH:b.Z_NO_FLUSH,typeof z=="string"?k.input=P.binstring2buf(z):g.call(z)==="[object ArrayBuffer]"?k.input=new Uint8Array(z):k.input=z,k.next_in=0,k.avail_in=k.input.length;do{if(k.avail_out===0&&(k.output=new I.Buf8(O),k.next_out=0,k.avail_out=O),N=w.inflate(k,b.Z_NO_FLUSH),N===b.Z_NEED_DICT&&ae&&(N=w.inflateSetDictionary(this.strm,ae)),N===b.Z_BUF_ERROR&&M===!0&&(N=b.Z_OK,M=!1),N!==b.Z_STREAM_END&&N!==b.Z_OK)return this.onEnd(N),this.ended=!0,!1;k.next_out&&(k.avail_out===0||N===b.Z_STREAM_END||k.avail_in===0&&(R===b.Z_FINISH||R===b.Z_SYNC_FLUSH))&&(this.options.to==="string"?(H=P.utf8border(k.output,k.next_out),T=k.next_out-H,B=P.buf2string(k.output,H),k.next_out=T,k.avail_out=O-T,T&&I.arraySet(k.output,k.output,H,T,0),this.onData(B)):this.onData(I.shrinkBuf(k.output,k.next_out))),k.avail_in===0&&k.avail_out===0&&(M=!0)}while((k.avail_in>0||k.avail_out===0)&&N!==b.Z_STREAM_END);return N===b.Z_STREAM_END&&(R=b.Z_FINISH),R===b.Z_FINISH?(N=w.inflateEnd(this.strm),this.onEnd(N),this.ended=!0,N===b.Z_OK):(R===b.Z_SYNC_FLUSH&&(this.onEnd(b.Z_OK),k.avail_out=0),!0)},_.prototype.onData=function(z){this.chunks.push(z)},_.prototype.onEnd=function(z){z===b.Z_OK&&(this.options.to==="string"?this.result=this.chunks.join(""):this.result=I.flattenChunks(this.chunks)),this.chunks=[],this.err=z,this.msg=this.strm.msg};function D(z,p){var k=new _(p);if(k.push(z,!0),k.err)throw k.msg||K[k.err];return k.result}function E(z,p){return p=p||{},p.raw=!0,D(z,p)}return We.Inflate=_,We.inflate=D,We.inflateRaw=E,We.ungzip=D,We}var la,za;function Ma(){if(za)return la;za=1;var w=He().assign,I=Na(),P=Fa(),b=Da(),K={};return w(K,I,P,b),la=K,la}export{Ma as r};
|