imagescript 1.3.1 → 3.1.0
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/LICENSE +4 -1
- package/README.md +76 -26
- package/THIRD_PARTY_NOTICES.md +156 -0
- package/dist/animation.d.ts +55 -0
- package/dist/animation.js +167 -0
- package/dist/codecs/crc.d.ts +9 -0
- package/dist/codecs/crc.js +29 -0
- package/dist/codecs/exif.d.ts +11 -0
- package/dist/codecs/exif.js +27 -0
- package/dist/codecs/gif.d.ts +44 -0
- package/dist/codecs/gif.js +401 -0
- package/dist/codecs/jpeg.d.ts +35 -0
- package/dist/codecs/jpeg.js +980 -0
- package/dist/codecs/png.d.ts +97 -0
- package/dist/codecs/png.js +664 -0
- package/dist/codecs/quantize.d.ts +25 -0
- package/dist/codecs/quantize.js +302 -0
- package/dist/codecs/tga.d.ts +16 -0
- package/dist/codecs/tga.js +203 -0
- package/dist/codecs/tiff.d.ts +6 -0
- package/dist/codecs/tiff.js +546 -0
- package/dist/codecs/vp8-tables.d.ts +10 -0
- package/dist/codecs/vp8-tables.js +17 -0
- package/dist/codecs/vp8.d.ts +8 -0
- package/dist/codecs/vp8.js +711 -0
- package/dist/codecs/vp8l.d.ts +62 -0
- package/dist/codecs/vp8l.js +909 -0
- package/dist/codecs/webp.d.ts +67 -0
- package/dist/codecs/webp.js +280 -0
- package/dist/codecs/zlib.d.ts +22 -0
- package/dist/codecs/zlib.js +607 -0
- package/dist/frame.d.ts +57 -0
- package/dist/frame.js +65 -0
- package/dist/gif.d.ts +31 -0
- package/dist/gif.js +20 -0
- package/dist/image-type.d.ts +24 -0
- package/dist/image-type.js +64 -0
- package/dist/image.d.ts +553 -0
- package/dist/image.js +1156 -0
- package/dist/index.d.ts +23 -0
- package/dist/index.js +20 -0
- package/dist/package.json +1 -0
- package/dist/render/font.d.ts +92 -0
- package/dist/render/font.js +954 -0
- package/dist/render/hinting.d.ts +110 -0
- package/dist/render/hinting.js +1236 -0
- package/dist/render/svg.d.ts +11 -0
- package/dist/render/svg.js +1717 -0
- package/dist/render/text.d.ts +63 -0
- package/dist/render/text.js +342 -0
- package/dist/text-layout.d.ts +46 -0
- package/dist/text-layout.js +35 -0
- package/dist/util/blur.d.ts +13 -0
- package/dist/util/blur.js +146 -0
- package/dist/util/mem.d.ts +10 -0
- package/dist/util/mem.js +23 -0
- package/dist/util/resample.d.ts +12 -0
- package/dist/util/resample.js +99 -0
- package/dist/util/utf8.d.ts +5 -0
- package/dist/util/utf8.js +55 -0
- package/dist/version.d.ts +1 -0
- package/dist/version.js +1 -0
- package/licenses/Apache-2.0.txt +202 -0
- package/licenses/FTL.txt +169 -0
- package/licenses/README.ijg +260 -0
- package/package.json +31 -7
- package/ImageScript.d.ts +0 -954
- package/ImageScript.js +0 -1669
- package/bench/_.mjs +0 -166
- package/bench/all.mjs +0 -4
- package/bench/blur.mjs +0 -59
- package/bench/flip.mjs +0 -63
- package/bench/overlay.mjs +0 -35
- package/bench/package.json +0 -7
- package/bench/readme.md +0 -64
- package/bench/resize.mjs +0 -52
- package/codecs/LICENSE +0 -21
- package/codecs/lib.d.ts +0 -50
- package/codecs/lib.js +0 -6
- package/codecs/lib.mjs +0 -1
- package/codecs/node/bin/arm64-darwin.node +0 -0
- package/codecs/node/bin/arm64-linux.node +0 -0
- package/codecs/node/bin/x64-darwin.node +0 -0
- package/codecs/node/bin/x64-linux.node +0 -0
- package/codecs/node/bin/x64-win32.node +0 -0
- package/codecs/node/index.js +0 -3
- package/codecs/node/index.mjs +0 -6
- package/codecs/package.json +0 -14
- package/codecs/readme.md +0 -38
- package/codecs/wasm/bin/codecs.wasm +0 -0
- package/codecs/wasm/bin/simd.wasm +0 -0
- package/codecs/wasm/bundle/browser.js +0 -1
- package/codecs/wasm/index.js +0 -1
- package/codecs/wasm/index.mjs +0 -1
- package/png/README.md +0 -1
- package/png/node.js +0 -1137
- package/png/src/crc.mjs +0 -49
- package/png/src/mem.mjs +0 -24
- package/png/src/png.mjs +0 -254
- package/png/src/zlib.mjs +0 -618
- package/tsconfig.json +0 -21
- package/utils/mem.js +0 -26
- package/v2/codecs/magic.js +0 -25
- package/v2/framebuffer.d.ts +0 -67
- package/v2/framebuffer.js +0 -2352
- package/v2/framebuffer.mjs +0 -126
- package/v2/framebuffer.rs +0 -1264
- package/v2/index.d.ts +0 -84
- package/v2/index.js +0 -261
- package/v2/ops/blur.mjs +0 -303
- package/v2/ops/color.mjs +0 -277
- package/v2/ops/crop.mjs +0 -64
- package/v2/ops/fill.mjs +0 -33
- package/v2/ops/flip.mjs +0 -33
- package/v2/ops/index.mjs +0 -9
- package/v2/ops/iterator.mjs +0 -34
- package/v2/ops/overlay.mjs +0 -63
- package/v2/ops/resize.mjs +0 -166
- package/v2/ops/rotate.mjs +0 -117
- package/v2/util/mem.mjs +0 -24
- package/wasm/any/font.wasm +0 -0
- package/wasm/any/gif.wasm +0 -0
- package/wasm/any/jpeg.wasm +0 -0
- package/wasm/any/png.wasm +0 -0
- package/wasm/any/svg.wasm +0 -0
- package/wasm/any/tiff.wasm +0 -0
- package/wasm/node/font.js +0 -142
- package/wasm/node/gif.js +0 -76
- package/wasm/node/jpeg.js +0 -92
- package/wasm/node/png.js +0 -49
- package/wasm/node/svg.js +0 -56
- package/wasm/node/tiff.js +0 -47
package/png/node.js
DELETED
|
@@ -1,1137 +0,0 @@
|
|
|
1
|
-
var __defProp = Object.defineProperty;
|
|
2
|
-
var __markAsModule = (target) => __defProp(target, "__esModule", {value: true});
|
|
3
|
-
var __export = (target, all) => {
|
|
4
|
-
for (var name in all)
|
|
5
|
-
__defProp(target, name, {get: all[name], enumerable: true});
|
|
6
|
-
};
|
|
7
|
-
|
|
8
|
-
// ../../Users/evan/GitHub/ImageScript/png/src/png.js
|
|
9
|
-
__markAsModule(exports);
|
|
10
|
-
__export(exports, {
|
|
11
|
-
decode: () => decode,
|
|
12
|
-
encode: () => encode
|
|
13
|
-
});
|
|
14
|
-
|
|
15
|
-
// ../../Users/evan/GitHub/ImageScript/png/src/crc.js
|
|
16
|
-
var table = new Uint32Array([
|
|
17
|
-
0,
|
|
18
|
-
1996959894,
|
|
19
|
-
3993919788,
|
|
20
|
-
2567524794,
|
|
21
|
-
124634137,
|
|
22
|
-
1886057615,
|
|
23
|
-
3915621685,
|
|
24
|
-
2657392035,
|
|
25
|
-
249268274,
|
|
26
|
-
2044508324,
|
|
27
|
-
3772115230,
|
|
28
|
-
2547177864,
|
|
29
|
-
162941995,
|
|
30
|
-
2125561021,
|
|
31
|
-
3887607047,
|
|
32
|
-
2428444049,
|
|
33
|
-
498536548,
|
|
34
|
-
1789927666,
|
|
35
|
-
4089016648,
|
|
36
|
-
2227061214,
|
|
37
|
-
450548861,
|
|
38
|
-
1843258603,
|
|
39
|
-
4107580753,
|
|
40
|
-
2211677639,
|
|
41
|
-
325883990,
|
|
42
|
-
1684777152,
|
|
43
|
-
4251122042,
|
|
44
|
-
2321926636,
|
|
45
|
-
335633487,
|
|
46
|
-
1661365465,
|
|
47
|
-
4195302755,
|
|
48
|
-
2366115317,
|
|
49
|
-
997073096,
|
|
50
|
-
1281953886,
|
|
51
|
-
3579855332,
|
|
52
|
-
2724688242,
|
|
53
|
-
1006888145,
|
|
54
|
-
1258607687,
|
|
55
|
-
3524101629,
|
|
56
|
-
2768942443,
|
|
57
|
-
901097722,
|
|
58
|
-
1119000684,
|
|
59
|
-
3686517206,
|
|
60
|
-
2898065728,
|
|
61
|
-
853044451,
|
|
62
|
-
1172266101,
|
|
63
|
-
3705015759,
|
|
64
|
-
2882616665,
|
|
65
|
-
651767980,
|
|
66
|
-
1373503546,
|
|
67
|
-
3369554304,
|
|
68
|
-
3218104598,
|
|
69
|
-
565507253,
|
|
70
|
-
1454621731,
|
|
71
|
-
3485111705,
|
|
72
|
-
3099436303,
|
|
73
|
-
671266974,
|
|
74
|
-
1594198024,
|
|
75
|
-
3322730930,
|
|
76
|
-
2970347812,
|
|
77
|
-
795835527,
|
|
78
|
-
1483230225,
|
|
79
|
-
3244367275,
|
|
80
|
-
3060149565,
|
|
81
|
-
1994146192,
|
|
82
|
-
31158534,
|
|
83
|
-
2563907772,
|
|
84
|
-
4023717930,
|
|
85
|
-
1907459465,
|
|
86
|
-
112637215,
|
|
87
|
-
2680153253,
|
|
88
|
-
3904427059,
|
|
89
|
-
2013776290,
|
|
90
|
-
251722036,
|
|
91
|
-
2517215374,
|
|
92
|
-
3775830040,
|
|
93
|
-
2137656763,
|
|
94
|
-
141376813,
|
|
95
|
-
2439277719,
|
|
96
|
-
3865271297,
|
|
97
|
-
1802195444,
|
|
98
|
-
476864866,
|
|
99
|
-
2238001368,
|
|
100
|
-
4066508878,
|
|
101
|
-
1812370925,
|
|
102
|
-
453092731,
|
|
103
|
-
2181625025,
|
|
104
|
-
4111451223,
|
|
105
|
-
1706088902,
|
|
106
|
-
314042704,
|
|
107
|
-
2344532202,
|
|
108
|
-
4240017532,
|
|
109
|
-
1658658271,
|
|
110
|
-
366619977,
|
|
111
|
-
2362670323,
|
|
112
|
-
4224994405,
|
|
113
|
-
1303535960,
|
|
114
|
-
984961486,
|
|
115
|
-
2747007092,
|
|
116
|
-
3569037538,
|
|
117
|
-
1256170817,
|
|
118
|
-
1037604311,
|
|
119
|
-
2765210733,
|
|
120
|
-
3554079995,
|
|
121
|
-
1131014506,
|
|
122
|
-
879679996,
|
|
123
|
-
2909243462,
|
|
124
|
-
3663771856,
|
|
125
|
-
1141124467,
|
|
126
|
-
855842277,
|
|
127
|
-
2852801631,
|
|
128
|
-
3708648649,
|
|
129
|
-
1342533948,
|
|
130
|
-
654459306,
|
|
131
|
-
3188396048,
|
|
132
|
-
3373015174,
|
|
133
|
-
1466479909,
|
|
134
|
-
544179635,
|
|
135
|
-
3110523913,
|
|
136
|
-
3462522015,
|
|
137
|
-
1591671054,
|
|
138
|
-
702138776,
|
|
139
|
-
2966460450,
|
|
140
|
-
3352799412,
|
|
141
|
-
1504918807,
|
|
142
|
-
783551873,
|
|
143
|
-
3082640443,
|
|
144
|
-
3233442989,
|
|
145
|
-
3988292384,
|
|
146
|
-
2596254646,
|
|
147
|
-
62317068,
|
|
148
|
-
1957810842,
|
|
149
|
-
3939845945,
|
|
150
|
-
2647816111,
|
|
151
|
-
81470997,
|
|
152
|
-
1943803523,
|
|
153
|
-
3814918930,
|
|
154
|
-
2489596804,
|
|
155
|
-
225274430,
|
|
156
|
-
2053790376,
|
|
157
|
-
3826175755,
|
|
158
|
-
2466906013,
|
|
159
|
-
167816743,
|
|
160
|
-
2097651377,
|
|
161
|
-
4027552580,
|
|
162
|
-
2265490386,
|
|
163
|
-
503444072,
|
|
164
|
-
1762050814,
|
|
165
|
-
4150417245,
|
|
166
|
-
2154129355,
|
|
167
|
-
426522225,
|
|
168
|
-
1852507879,
|
|
169
|
-
4275313526,
|
|
170
|
-
2312317920,
|
|
171
|
-
282753626,
|
|
172
|
-
1742555852,
|
|
173
|
-
4189708143,
|
|
174
|
-
2394877945,
|
|
175
|
-
397917763,
|
|
176
|
-
1622183637,
|
|
177
|
-
3604390888,
|
|
178
|
-
2714866558,
|
|
179
|
-
953729732,
|
|
180
|
-
1340076626,
|
|
181
|
-
3518719985,
|
|
182
|
-
2797360999,
|
|
183
|
-
1068828381,
|
|
184
|
-
1219638859,
|
|
185
|
-
3624741850,
|
|
186
|
-
2936675148,
|
|
187
|
-
906185462,
|
|
188
|
-
1090812512,
|
|
189
|
-
3747672003,
|
|
190
|
-
2825379669,
|
|
191
|
-
829329135,
|
|
192
|
-
1181335161,
|
|
193
|
-
3412177804,
|
|
194
|
-
3160834842,
|
|
195
|
-
628085408,
|
|
196
|
-
1382605366,
|
|
197
|
-
3423369109,
|
|
198
|
-
3138078467,
|
|
199
|
-
570562233,
|
|
200
|
-
1426400815,
|
|
201
|
-
3317316542,
|
|
202
|
-
2998733608,
|
|
203
|
-
733239954,
|
|
204
|
-
1555261956,
|
|
205
|
-
3268935591,
|
|
206
|
-
3050360625,
|
|
207
|
-
752459403,
|
|
208
|
-
1541320221,
|
|
209
|
-
2607071920,
|
|
210
|
-
3965973030,
|
|
211
|
-
1969922972,
|
|
212
|
-
40735498,
|
|
213
|
-
2617837225,
|
|
214
|
-
3943577151,
|
|
215
|
-
1913087877,
|
|
216
|
-
83908371,
|
|
217
|
-
2512341634,
|
|
218
|
-
3803740692,
|
|
219
|
-
2075208622,
|
|
220
|
-
213261112,
|
|
221
|
-
2463272603,
|
|
222
|
-
3855990285,
|
|
223
|
-
2094854071,
|
|
224
|
-
198958881,
|
|
225
|
-
2262029012,
|
|
226
|
-
4057260610,
|
|
227
|
-
1759359992,
|
|
228
|
-
534414190,
|
|
229
|
-
2176718541,
|
|
230
|
-
4139329115,
|
|
231
|
-
1873836001,
|
|
232
|
-
414664567,
|
|
233
|
-
2282248934,
|
|
234
|
-
4279200368,
|
|
235
|
-
1711684554,
|
|
236
|
-
285281116,
|
|
237
|
-
2405801727,
|
|
238
|
-
4167216745,
|
|
239
|
-
1634467795,
|
|
240
|
-
376229701,
|
|
241
|
-
2685067896,
|
|
242
|
-
3608007406,
|
|
243
|
-
1308918612,
|
|
244
|
-
956543938,
|
|
245
|
-
2808555105,
|
|
246
|
-
3495958263,
|
|
247
|
-
1231636301,
|
|
248
|
-
1047427035,
|
|
249
|
-
2932959818,
|
|
250
|
-
3654703836,
|
|
251
|
-
1088359270,
|
|
252
|
-
936918e3,
|
|
253
|
-
2847714899,
|
|
254
|
-
3736837829,
|
|
255
|
-
1202900863,
|
|
256
|
-
817233897,
|
|
257
|
-
3183342108,
|
|
258
|
-
3401237130,
|
|
259
|
-
1404277552,
|
|
260
|
-
615818150,
|
|
261
|
-
3134207493,
|
|
262
|
-
3453421203,
|
|
263
|
-
1423857449,
|
|
264
|
-
601450431,
|
|
265
|
-
3009837614,
|
|
266
|
-
3294710456,
|
|
267
|
-
1567103746,
|
|
268
|
-
711928724,
|
|
269
|
-
3020668471,
|
|
270
|
-
3272380065,
|
|
271
|
-
1510334235,
|
|
272
|
-
755167117
|
|
273
|
-
]);
|
|
274
|
-
function crc32(buffer) {
|
|
275
|
-
let offset = 0 | 0;
|
|
276
|
-
let crc = 4294967295 | 0;
|
|
277
|
-
const bl = buffer.length - 4 | 0;
|
|
278
|
-
while (bl > offset) {
|
|
279
|
-
crc = table[(crc ^ buffer[offset++]) & 255] ^ crc >>> 8;
|
|
280
|
-
crc = table[(crc ^ buffer[offset++]) & 255] ^ crc >>> 8;
|
|
281
|
-
crc = table[(crc ^ buffer[offset++]) & 255] ^ crc >>> 8;
|
|
282
|
-
crc = table[(crc ^ buffer[offset++]) & 255] ^ crc >>> 8;
|
|
283
|
-
}
|
|
284
|
-
while (offset < buffer.length) {
|
|
285
|
-
crc = table[(crc ^ buffer[offset++]) & 255] ^ crc >>> 8;
|
|
286
|
-
}
|
|
287
|
-
return (crc ^ 4294967295) >>> 0;
|
|
288
|
-
}
|
|
289
|
-
|
|
290
|
-
// ../../Users/evan/GitHub/ImageScript/png/src/mem.js
|
|
291
|
-
function view(buffer, shared = false) {
|
|
292
|
-
if (buffer instanceof ArrayBuffer)
|
|
293
|
-
return new Uint8Array(buffer);
|
|
294
|
-
if (shared && buffer instanceof SharedArrayBuffer)
|
|
295
|
-
return new Uint8Array(buffer);
|
|
296
|
-
if (ArrayBuffer.isView(buffer))
|
|
297
|
-
return new Uint8Array(buffer.buffer, buffer.byteOffset, buffer.byteLength);
|
|
298
|
-
throw new TypeError("The provided value is not of type '(ArrayBuffer or ArrayBufferView)'");
|
|
299
|
-
}
|
|
300
|
-
function from_parts(buffers, shared = false) {
|
|
301
|
-
let length = 0;
|
|
302
|
-
let offset = 0;
|
|
303
|
-
buffers.forEach((buffer) => length += buffer.byteLength == null ? buffer.length : buffer.byteLength);
|
|
304
|
-
const u82 = new Uint8Array(shared ? new SharedArrayBuffer(length) : length);
|
|
305
|
-
buffers.forEach((buffer) => {
|
|
306
|
-
const ref = Array.isArray(buffer) ? buffer : view(buffer, true);
|
|
307
|
-
u82.set(ref, offset);
|
|
308
|
-
offset += ref.length;
|
|
309
|
-
});
|
|
310
|
-
return u82;
|
|
311
|
-
}
|
|
312
|
-
|
|
313
|
-
// ../../Users/evan/GitHub/ImageScript/png/src/zlib.js
|
|
314
|
-
var u8 = Uint8Array;
|
|
315
|
-
var u16 = Uint16Array;
|
|
316
|
-
var u32 = Uint32Array;
|
|
317
|
-
var clim = u8.of(16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15);
|
|
318
|
-
var fleb = u8.of(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, 0, 0, 0);
|
|
319
|
-
var fdeb = u8.of(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, 0, 0);
|
|
320
|
-
var freb = function(eb, start) {
|
|
321
|
-
var b = new u16(31);
|
|
322
|
-
for (var i = 0; i < 31; ++i) {
|
|
323
|
-
b[i] = start += 1 << eb[i - 1];
|
|
324
|
-
}
|
|
325
|
-
var r = new u32(b[30]);
|
|
326
|
-
for (var i = 1; i < 30; ++i) {
|
|
327
|
-
for (var j = b[i]; j < b[i + 1]; ++j) {
|
|
328
|
-
r[j] = j - b[i] << 5 | i;
|
|
329
|
-
}
|
|
330
|
-
}
|
|
331
|
-
return [b, r];
|
|
332
|
-
};
|
|
333
|
-
var _a = freb(fleb, 2);
|
|
334
|
-
var fl = _a[0];
|
|
335
|
-
var revfl = _a[1];
|
|
336
|
-
fl[28] = 258, revfl[258] = 28;
|
|
337
|
-
var _b = freb(fdeb, 0);
|
|
338
|
-
var fd = _b[0];
|
|
339
|
-
var revfd = _b[1];
|
|
340
|
-
var rev = new u16(32768);
|
|
341
|
-
for (var i = 0; i < 32768; ++i) {
|
|
342
|
-
x = (i & 43690) >>> 1 | (i & 21845) << 1;
|
|
343
|
-
x = (x & 52428) >>> 2 | (x & 13107) << 2;
|
|
344
|
-
x = (x & 61680) >>> 4 | (x & 3855) << 4;
|
|
345
|
-
rev[i] = ((x & 65280) >>> 8 | (x & 255) << 8) >>> 1;
|
|
346
|
-
}
|
|
347
|
-
var x;
|
|
348
|
-
var hMap = function(cd, mb, r) {
|
|
349
|
-
var s = cd.length;
|
|
350
|
-
var i = 0;
|
|
351
|
-
var l = new u16(mb);
|
|
352
|
-
for (; i < s; ++i)
|
|
353
|
-
++l[cd[i] - 1];
|
|
354
|
-
var le = new u16(mb);
|
|
355
|
-
for (i = 0; i < mb; ++i) {
|
|
356
|
-
le[i] = le[i - 1] + l[i - 1] << 1;
|
|
357
|
-
}
|
|
358
|
-
var co;
|
|
359
|
-
if (r) {
|
|
360
|
-
co = new u16(1 << mb);
|
|
361
|
-
var rvb = 15 - mb;
|
|
362
|
-
for (i = 0; i < s; ++i) {
|
|
363
|
-
if (cd[i]) {
|
|
364
|
-
var sv = i << 4 | cd[i];
|
|
365
|
-
var r_1 = mb - cd[i];
|
|
366
|
-
var v = le[cd[i] - 1]++ << r_1;
|
|
367
|
-
for (var m = v | (1 << r_1) - 1; v <= m; ++v) {
|
|
368
|
-
co[rev[v] >>> rvb] = sv;
|
|
369
|
-
}
|
|
370
|
-
}
|
|
371
|
-
}
|
|
372
|
-
} else {
|
|
373
|
-
co = new u16(s);
|
|
374
|
-
for (i = 0; i < s; ++i) {
|
|
375
|
-
if (cd[i]) {
|
|
376
|
-
co[i] = rev[le[cd[i] - 1]++] >>> 15 - cd[i];
|
|
377
|
-
}
|
|
378
|
-
}
|
|
379
|
-
}
|
|
380
|
-
return co;
|
|
381
|
-
};
|
|
382
|
-
var flt = new u8(288);
|
|
383
|
-
for (var i = 0; i < 144; ++i)
|
|
384
|
-
flt[i] = 8;
|
|
385
|
-
for (var i = 144; i < 256; ++i)
|
|
386
|
-
flt[i] = 9;
|
|
387
|
-
for (var i = 256; i < 280; ++i)
|
|
388
|
-
flt[i] = 7;
|
|
389
|
-
for (var i = 280; i < 288; ++i)
|
|
390
|
-
flt[i] = 8;
|
|
391
|
-
var fdt = new u8(32);
|
|
392
|
-
for (var i = 0; i < 32; ++i)
|
|
393
|
-
fdt[i] = 5;
|
|
394
|
-
var flm = hMap(flt, 9, 0);
|
|
395
|
-
var flrm = hMap(flt, 9, 1);
|
|
396
|
-
var fdm = hMap(fdt, 5, 0);
|
|
397
|
-
var fdrm = hMap(fdt, 5, 1);
|
|
398
|
-
var max = function(a) {
|
|
399
|
-
var m = a[0];
|
|
400
|
-
for (var i = 1; i < a.length; ++i) {
|
|
401
|
-
if (a[i] > m)
|
|
402
|
-
m = a[i];
|
|
403
|
-
}
|
|
404
|
-
return m;
|
|
405
|
-
};
|
|
406
|
-
var bits = function(d, p, m) {
|
|
407
|
-
var o = p >> 3 | 0;
|
|
408
|
-
return (d[o] | d[o + 1] << 8) >> (p & 7) & m;
|
|
409
|
-
};
|
|
410
|
-
var bits16 = function(d, p) {
|
|
411
|
-
var o = p >> 3 | 0;
|
|
412
|
-
return (d[o] | d[o + 1] << 8 | d[o + 2] << 16) >> (p & 7);
|
|
413
|
-
};
|
|
414
|
-
var shft = function(p) {
|
|
415
|
-
return (p >> 3 | 0) + (p & 7 && 1);
|
|
416
|
-
};
|
|
417
|
-
var slc = function(v, s, e) {
|
|
418
|
-
if (s == null || s < 0)
|
|
419
|
-
s = 0;
|
|
420
|
-
if (e == null || e > v.length)
|
|
421
|
-
e = v.length;
|
|
422
|
-
var n = new (v instanceof u16 ? u16 : v instanceof u32 ? u32 : u8)(e - s);
|
|
423
|
-
n.set(v.subarray(s, e));
|
|
424
|
-
return n;
|
|
425
|
-
};
|
|
426
|
-
var inflt = function(dat, buf, st) {
|
|
427
|
-
var sl = dat.length;
|
|
428
|
-
if (!sl || st && !st.l && sl < 5)
|
|
429
|
-
return buf || new u8(0);
|
|
430
|
-
var noBuf = !buf || st;
|
|
431
|
-
var noSt = !st || st.i;
|
|
432
|
-
if (!st)
|
|
433
|
-
st = {};
|
|
434
|
-
if (!buf)
|
|
435
|
-
buf = new u8(sl * 3);
|
|
436
|
-
var cbuf = function(l2) {
|
|
437
|
-
var bl = buf.length;
|
|
438
|
-
if (l2 > bl) {
|
|
439
|
-
var nbuf = new u8(Math.max(bl * 2, l2));
|
|
440
|
-
nbuf.set(buf);
|
|
441
|
-
buf = nbuf;
|
|
442
|
-
}
|
|
443
|
-
};
|
|
444
|
-
var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;
|
|
445
|
-
var tbts = sl * 8;
|
|
446
|
-
do {
|
|
447
|
-
if (!lm) {
|
|
448
|
-
st.f = final = bits(dat, pos, 1);
|
|
449
|
-
var type = bits(dat, pos + 1, 3);
|
|
450
|
-
pos += 3;
|
|
451
|
-
if (!type) {
|
|
452
|
-
var s = shft(pos) + 4, l = dat[s - 4] | dat[s - 3] << 8, t = s + l;
|
|
453
|
-
if (t > sl) {
|
|
454
|
-
if (noSt)
|
|
455
|
-
throw "unexpected EOF";
|
|
456
|
-
break;
|
|
457
|
-
}
|
|
458
|
-
if (noBuf)
|
|
459
|
-
cbuf(bt + l);
|
|
460
|
-
buf.set(dat.subarray(s, t), bt);
|
|
461
|
-
st.b = bt += l, st.p = pos = t * 8;
|
|
462
|
-
continue;
|
|
463
|
-
} else if (type === 1)
|
|
464
|
-
lm = flrm, dm = fdrm, lbt = 9, dbt = 5;
|
|
465
|
-
else if (type === 2) {
|
|
466
|
-
var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;
|
|
467
|
-
var tl = hLit + bits(dat, pos + 5, 31) + 1;
|
|
468
|
-
pos += 14;
|
|
469
|
-
var ldt = new u8(tl);
|
|
470
|
-
var clt = new u8(19);
|
|
471
|
-
for (var i = 0; i < hcLen; ++i) {
|
|
472
|
-
clt[clim[i]] = bits(dat, pos + i * 3, 7);
|
|
473
|
-
}
|
|
474
|
-
pos += hcLen * 3;
|
|
475
|
-
var clb = max(clt), clbmsk = (1 << clb) - 1;
|
|
476
|
-
var clm = hMap(clt, clb, 1);
|
|
477
|
-
for (var i = 0; i < tl; ) {
|
|
478
|
-
var r = clm[bits(dat, pos, clbmsk)];
|
|
479
|
-
pos += r & 15;
|
|
480
|
-
var s = r >>> 4;
|
|
481
|
-
if (s < 16) {
|
|
482
|
-
ldt[i++] = s;
|
|
483
|
-
} else {
|
|
484
|
-
var c = 0, n = 0;
|
|
485
|
-
if (s === 16)
|
|
486
|
-
n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];
|
|
487
|
-
else if (s === 17)
|
|
488
|
-
n = 3 + bits(dat, pos, 7), pos += 3;
|
|
489
|
-
else if (s === 18)
|
|
490
|
-
n = 11 + bits(dat, pos, 127), pos += 7;
|
|
491
|
-
while (n--)
|
|
492
|
-
ldt[i++] = c;
|
|
493
|
-
}
|
|
494
|
-
}
|
|
495
|
-
var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);
|
|
496
|
-
lbt = max(lt);
|
|
497
|
-
dbt = max(dt);
|
|
498
|
-
lm = hMap(lt, lbt, 1);
|
|
499
|
-
dm = hMap(dt, dbt, 1);
|
|
500
|
-
} else
|
|
501
|
-
throw "invalid block type";
|
|
502
|
-
if (pos > tbts) {
|
|
503
|
-
if (noSt)
|
|
504
|
-
throw "unexpected EOF";
|
|
505
|
-
break;
|
|
506
|
-
}
|
|
507
|
-
}
|
|
508
|
-
if (noBuf)
|
|
509
|
-
cbuf(bt + 131072);
|
|
510
|
-
var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;
|
|
511
|
-
var lpos = pos;
|
|
512
|
-
for (; ; lpos = pos) {
|
|
513
|
-
var c = lm[bits16(dat, pos) & lms], sym = c >>> 4;
|
|
514
|
-
pos += c & 15;
|
|
515
|
-
if (pos > tbts) {
|
|
516
|
-
if (noSt)
|
|
517
|
-
throw "unexpected EOF";
|
|
518
|
-
break;
|
|
519
|
-
}
|
|
520
|
-
if (!c)
|
|
521
|
-
throw "invalid length/literal";
|
|
522
|
-
if (sym < 256)
|
|
523
|
-
buf[bt++] = sym;
|
|
524
|
-
else if (sym === 256) {
|
|
525
|
-
lpos = pos, lm = null;
|
|
526
|
-
break;
|
|
527
|
-
} else {
|
|
528
|
-
var add = sym - 254;
|
|
529
|
-
if (sym > 264) {
|
|
530
|
-
var i = sym - 257, b = fleb[i];
|
|
531
|
-
add = bits(dat, pos, (1 << b) - 1) + fl[i];
|
|
532
|
-
pos += b;
|
|
533
|
-
}
|
|
534
|
-
var d = dm[bits16(dat, pos) & dms], dsym = d >>> 4;
|
|
535
|
-
if (!d)
|
|
536
|
-
throw "invalid distance";
|
|
537
|
-
pos += d & 15;
|
|
538
|
-
var dt = fd[dsym];
|
|
539
|
-
if (dsym > 3) {
|
|
540
|
-
var b = fdeb[dsym];
|
|
541
|
-
dt += bits16(dat, pos) & (1 << b) - 1, pos += b;
|
|
542
|
-
}
|
|
543
|
-
if (pos > tbts) {
|
|
544
|
-
if (noSt)
|
|
545
|
-
throw "unexpected EOF";
|
|
546
|
-
break;
|
|
547
|
-
}
|
|
548
|
-
if (noBuf)
|
|
549
|
-
cbuf(bt + 131072);
|
|
550
|
-
var end = bt + add;
|
|
551
|
-
for (; bt < end; bt += 4) {
|
|
552
|
-
buf[bt] = buf[bt - dt];
|
|
553
|
-
buf[bt + 1] = buf[bt + 1 - dt];
|
|
554
|
-
buf[bt + 2] = buf[bt + 2 - dt];
|
|
555
|
-
buf[bt + 3] = buf[bt + 3 - dt];
|
|
556
|
-
}
|
|
557
|
-
bt = end;
|
|
558
|
-
}
|
|
559
|
-
}
|
|
560
|
-
st.l = lm, st.p = lpos, st.b = bt;
|
|
561
|
-
if (lm)
|
|
562
|
-
final = 1, st.m = lbt, st.d = dm, st.n = dbt;
|
|
563
|
-
} while (!final);
|
|
564
|
-
return bt === buf.length ? buf : slc(buf, 0, bt);
|
|
565
|
-
};
|
|
566
|
-
var wbits = function(d, p, v) {
|
|
567
|
-
v <<= p & 7;
|
|
568
|
-
var o = p >> 3 | 0;
|
|
569
|
-
d[o] |= v;
|
|
570
|
-
d[o + 1] |= v >>> 8;
|
|
571
|
-
};
|
|
572
|
-
var wbits16 = function(d, p, v) {
|
|
573
|
-
v <<= p & 7;
|
|
574
|
-
var o = p >> 3 | 0;
|
|
575
|
-
d[o] |= v;
|
|
576
|
-
d[o + 1] |= v >>> 8;
|
|
577
|
-
d[o + 2] |= v >>> 16;
|
|
578
|
-
};
|
|
579
|
-
var hTree = function(d, mb) {
|
|
580
|
-
var t = [];
|
|
581
|
-
for (var i = 0; i < d.length; ++i) {
|
|
582
|
-
if (d[i])
|
|
583
|
-
t.push({s: i, f: d[i]});
|
|
584
|
-
}
|
|
585
|
-
var s = t.length;
|
|
586
|
-
var t2 = t.slice();
|
|
587
|
-
if (!s)
|
|
588
|
-
return [et, 0];
|
|
589
|
-
if (s === 1) {
|
|
590
|
-
var v = new u8(t[0].s + 1);
|
|
591
|
-
v[t[0].s] = 1;
|
|
592
|
-
return [v, 1];
|
|
593
|
-
}
|
|
594
|
-
t.sort(function(a, b) {
|
|
595
|
-
return a.f - b.f;
|
|
596
|
-
});
|
|
597
|
-
t.push({s: -1, f: 25001});
|
|
598
|
-
var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;
|
|
599
|
-
t[0] = {s: -1, f: l.f + r.f, l, r};
|
|
600
|
-
while (i1 !== s - 1) {
|
|
601
|
-
l = t[t[i0].f < t[i2].f ? i0++ : i2++];
|
|
602
|
-
r = t[i0 !== i1 && t[i0].f < t[i2].f ? i0++ : i2++];
|
|
603
|
-
t[i1++] = {s: -1, f: l.f + r.f, l, r};
|
|
604
|
-
}
|
|
605
|
-
var maxSym = t2[0].s;
|
|
606
|
-
for (var i = 1; i < s; ++i) {
|
|
607
|
-
if (t2[i].s > maxSym)
|
|
608
|
-
maxSym = t2[i].s;
|
|
609
|
-
}
|
|
610
|
-
var tr = new u16(maxSym + 1);
|
|
611
|
-
var mbt = ln(t[i1 - 1], tr, 0);
|
|
612
|
-
if (mbt > mb) {
|
|
613
|
-
var i = 0, dt = 0;
|
|
614
|
-
var lft = mbt - mb, cst = 1 << lft;
|
|
615
|
-
t2.sort(function(a, b) {
|
|
616
|
-
return tr[b.s] - tr[a.s] || a.f - b.f;
|
|
617
|
-
});
|
|
618
|
-
for (; i < s; ++i) {
|
|
619
|
-
var i2_1 = t2[i].s;
|
|
620
|
-
if (tr[i2_1] > mb) {
|
|
621
|
-
dt += cst - (1 << mbt - tr[i2_1]);
|
|
622
|
-
tr[i2_1] = mb;
|
|
623
|
-
} else
|
|
624
|
-
break;
|
|
625
|
-
}
|
|
626
|
-
dt >>>= lft;
|
|
627
|
-
while (dt > 0) {
|
|
628
|
-
var i2_2 = t2[i].s;
|
|
629
|
-
if (tr[i2_2] < mb)
|
|
630
|
-
dt -= 1 << mb - tr[i2_2]++ - 1;
|
|
631
|
-
else
|
|
632
|
-
++i;
|
|
633
|
-
}
|
|
634
|
-
for (; i >= 0 && dt; --i) {
|
|
635
|
-
var i2_3 = t2[i].s;
|
|
636
|
-
if (tr[i2_3] === mb) {
|
|
637
|
-
--tr[i2_3];
|
|
638
|
-
++dt;
|
|
639
|
-
}
|
|
640
|
-
}
|
|
641
|
-
mbt = mb;
|
|
642
|
-
}
|
|
643
|
-
return [new u8(tr), mbt];
|
|
644
|
-
};
|
|
645
|
-
var ln = function(n, l, d) {
|
|
646
|
-
return n.s === -1 ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1)) : l[n.s] = d;
|
|
647
|
-
};
|
|
648
|
-
var lc = function(c) {
|
|
649
|
-
var s = c.length;
|
|
650
|
-
while (s && !c[--s])
|
|
651
|
-
;
|
|
652
|
-
var cl = new u16(++s);
|
|
653
|
-
var cli = 0, cln = c[0], cls = 1;
|
|
654
|
-
var w = function(v) {
|
|
655
|
-
cl[cli++] = v;
|
|
656
|
-
};
|
|
657
|
-
for (var i = 1; i <= s; ++i) {
|
|
658
|
-
if (c[i] === cln && i !== s)
|
|
659
|
-
++cls;
|
|
660
|
-
else {
|
|
661
|
-
if (!cln && cls > 2) {
|
|
662
|
-
for (; cls > 138; cls -= 138)
|
|
663
|
-
w(32754);
|
|
664
|
-
if (cls > 2) {
|
|
665
|
-
w(cls > 10 ? cls - 11 << 5 | 28690 : cls - 3 << 5 | 12305);
|
|
666
|
-
cls = 0;
|
|
667
|
-
}
|
|
668
|
-
} else if (cls > 3) {
|
|
669
|
-
w(cln), --cls;
|
|
670
|
-
for (; cls > 6; cls -= 6)
|
|
671
|
-
w(8304);
|
|
672
|
-
if (cls > 2)
|
|
673
|
-
w(cls - 3 << 5 | 8208), cls = 0;
|
|
674
|
-
}
|
|
675
|
-
while (cls--)
|
|
676
|
-
w(cln);
|
|
677
|
-
cls = 1;
|
|
678
|
-
cln = c[i];
|
|
679
|
-
}
|
|
680
|
-
}
|
|
681
|
-
return [cl.subarray(0, cli), s];
|
|
682
|
-
};
|
|
683
|
-
var clen = function(cf, cl) {
|
|
684
|
-
var l = 0;
|
|
685
|
-
for (var i = 0; i < cl.length; ++i)
|
|
686
|
-
l += cf[i] * cl[i];
|
|
687
|
-
return l;
|
|
688
|
-
};
|
|
689
|
-
var wfblk = function(out, pos, dat) {
|
|
690
|
-
var s = dat.length;
|
|
691
|
-
var o = shft(pos + 2);
|
|
692
|
-
out[o] = s & 255;
|
|
693
|
-
out[o + 1] = s >>> 8;
|
|
694
|
-
out[o + 2] = out[o] ^ 255;
|
|
695
|
-
out[o + 3] = out[o + 1] ^ 255;
|
|
696
|
-
for (var i = 0; i < s; ++i)
|
|
697
|
-
out[o + i + 4] = dat[i];
|
|
698
|
-
return (o + 4 + s) * 8;
|
|
699
|
-
};
|
|
700
|
-
var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
|
|
701
|
-
wbits(out, p++, final);
|
|
702
|
-
++lf[256];
|
|
703
|
-
var _a2 = hTree(lf, 15), dlt = _a2[0], mlb = _a2[1];
|
|
704
|
-
var _b2 = hTree(df, 15), ddt = _b2[0], mdb = _b2[1];
|
|
705
|
-
var _c = lc(dlt), lclt = _c[0], nlc = _c[1];
|
|
706
|
-
var _d = lc(ddt), lcdt = _d[0], ndc = _d[1];
|
|
707
|
-
var lcfreq = new u16(19);
|
|
708
|
-
for (var i = 0; i < lclt.length; ++i)
|
|
709
|
-
lcfreq[lclt[i] & 31]++;
|
|
710
|
-
for (var i = 0; i < lcdt.length; ++i)
|
|
711
|
-
lcfreq[lcdt[i] & 31]++;
|
|
712
|
-
var _e = hTree(lcfreq, 7), lct = _e[0], mlcb = _e[1];
|
|
713
|
-
var nlcc = 19;
|
|
714
|
-
for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)
|
|
715
|
-
;
|
|
716
|
-
var flen = bl + 5 << 3;
|
|
717
|
-
var ftlen = clen(lf, flt) + clen(df, fdt) + eb;
|
|
718
|
-
var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + (2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18]);
|
|
719
|
-
if (flen <= ftlen && flen <= dtlen)
|
|
720
|
-
return wfblk(out, p, dat.subarray(bs, bs + bl));
|
|
721
|
-
var lm, ll, dm, dl;
|
|
722
|
-
wbits(out, p, 1 + (dtlen < ftlen)), p += 2;
|
|
723
|
-
if (dtlen < ftlen) {
|
|
724
|
-
lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;
|
|
725
|
-
var llm = hMap(lct, mlcb, 0);
|
|
726
|
-
wbits(out, p, nlc - 257);
|
|
727
|
-
wbits(out, p + 5, ndc - 1);
|
|
728
|
-
wbits(out, p + 10, nlcc - 4);
|
|
729
|
-
p += 14;
|
|
730
|
-
for (var i = 0; i < nlcc; ++i)
|
|
731
|
-
wbits(out, p + 3 * i, lct[clim[i]]);
|
|
732
|
-
p += 3 * nlcc;
|
|
733
|
-
var lcts = [lclt, lcdt];
|
|
734
|
-
for (var it = 0; it < 2; ++it) {
|
|
735
|
-
var clct = lcts[it];
|
|
736
|
-
for (var i = 0; i < clct.length; ++i) {
|
|
737
|
-
var len = clct[i] & 31;
|
|
738
|
-
wbits(out, p, llm[len]), p += lct[len];
|
|
739
|
-
if (len > 15)
|
|
740
|
-
wbits(out, p, clct[i] >>> 5 & 127), p += clct[i] >>> 12;
|
|
741
|
-
}
|
|
742
|
-
}
|
|
743
|
-
} else {
|
|
744
|
-
lm = flm, ll = flt, dm = fdm, dl = fdt;
|
|
745
|
-
}
|
|
746
|
-
for (var i = 0; i < li; ++i) {
|
|
747
|
-
if (syms[i] > 255) {
|
|
748
|
-
var len = syms[i] >>> 18 & 31;
|
|
749
|
-
wbits16(out, p, lm[len + 257]), p += ll[len + 257];
|
|
750
|
-
if (len > 7)
|
|
751
|
-
wbits(out, p, syms[i] >>> 23 & 31), p += fleb[len];
|
|
752
|
-
var dst = syms[i] & 31;
|
|
753
|
-
wbits16(out, p, dm[dst]), p += dl[dst];
|
|
754
|
-
if (dst > 3)
|
|
755
|
-
wbits16(out, p, syms[i] >>> 5 & 8191), p += fdeb[dst];
|
|
756
|
-
} else {
|
|
757
|
-
wbits16(out, p, lm[syms[i]]), p += ll[syms[i]];
|
|
758
|
-
}
|
|
759
|
-
}
|
|
760
|
-
wbits16(out, p, lm[256]);
|
|
761
|
-
return p + ll[256];
|
|
762
|
-
};
|
|
763
|
-
var deo = u32.of(65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632);
|
|
764
|
-
var et = new u8(0);
|
|
765
|
-
var dflt = function(dat, lvl, plvl, pre, post, lst) {
|
|
766
|
-
var s = dat.length;
|
|
767
|
-
var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7e3)) + post);
|
|
768
|
-
var w = o.subarray(pre, o.length - post);
|
|
769
|
-
var pos = 0;
|
|
770
|
-
if (!lvl || s < 8) {
|
|
771
|
-
for (var i = 0; i <= s; i += 65535) {
|
|
772
|
-
var e = i + 65535;
|
|
773
|
-
if (e < s) {
|
|
774
|
-
pos = wfblk(w, pos, dat.subarray(i, e));
|
|
775
|
-
} else {
|
|
776
|
-
w[i] = lst;
|
|
777
|
-
pos = wfblk(w, pos, dat.subarray(i, s));
|
|
778
|
-
}
|
|
779
|
-
}
|
|
780
|
-
} else {
|
|
781
|
-
var opt = deo[lvl - 1];
|
|
782
|
-
var n = opt >>> 13, c = opt & 8191;
|
|
783
|
-
var msk_1 = (1 << plvl) - 1;
|
|
784
|
-
var prev = new u16(32768), head = new u16(msk_1 + 1);
|
|
785
|
-
var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;
|
|
786
|
-
var hsh = function(i2) {
|
|
787
|
-
return (dat[i2] ^ dat[i2 + 1] << bs1_1 ^ dat[i2 + 2] << bs2_1) & msk_1;
|
|
788
|
-
};
|
|
789
|
-
var syms = new u32(25e3);
|
|
790
|
-
var lf = new u16(288), df = new u16(32);
|
|
791
|
-
var lc_1 = 0, eb = 0, i = 0, li = 0, wi = 0, bs = 0;
|
|
792
|
-
for (; i < s; ++i) {
|
|
793
|
-
var hv = hsh(i);
|
|
794
|
-
var imod = i & 32767, pimod = head[hv];
|
|
795
|
-
prev[imod] = pimod;
|
|
796
|
-
head[hv] = imod;
|
|
797
|
-
if (wi <= i) {
|
|
798
|
-
var rem = s - i;
|
|
799
|
-
if ((lc_1 > 7e3 || li > 24576) && rem > 423) {
|
|
800
|
-
pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);
|
|
801
|
-
li = lc_1 = eb = 0, bs = i;
|
|
802
|
-
for (var j = 0; j < 286; ++j)
|
|
803
|
-
lf[j] = 0;
|
|
804
|
-
for (var j = 0; j < 30; ++j)
|
|
805
|
-
df[j] = 0;
|
|
806
|
-
}
|
|
807
|
-
var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;
|
|
808
|
-
if (rem > 2 && hv === hsh(i - dif)) {
|
|
809
|
-
var maxn = Math.min(n, rem) - 1;
|
|
810
|
-
var maxd = Math.min(32767, i);
|
|
811
|
-
var ml = Math.min(258, rem);
|
|
812
|
-
while (dif <= maxd && --ch_1 && imod !== pimod) {
|
|
813
|
-
if (dat[i + l] === dat[i + l - dif]) {
|
|
814
|
-
var nl = 0;
|
|
815
|
-
for (; nl < ml && dat[i + nl] === dat[i + nl - dif]; ++nl)
|
|
816
|
-
;
|
|
817
|
-
if (nl > l) {
|
|
818
|
-
l = nl, d = dif;
|
|
819
|
-
if (nl > maxn)
|
|
820
|
-
break;
|
|
821
|
-
var mmd = Math.min(dif, nl - 2);
|
|
822
|
-
var md = 0;
|
|
823
|
-
for (var j = 0; j < mmd; ++j) {
|
|
824
|
-
var ti = i - dif + j + 32768 & 32767;
|
|
825
|
-
var pti = prev[ti];
|
|
826
|
-
var cd = ti - pti + 32768 & 32767;
|
|
827
|
-
if (cd > md)
|
|
828
|
-
md = cd, pimod = ti;
|
|
829
|
-
}
|
|
830
|
-
}
|
|
831
|
-
}
|
|
832
|
-
imod = pimod, pimod = prev[imod];
|
|
833
|
-
dif += imod - pimod + 32768 & 32767;
|
|
834
|
-
}
|
|
835
|
-
}
|
|
836
|
-
if (d) {
|
|
837
|
-
syms[li++] = 268435456 | revfl[l] << 18 | revfd[d];
|
|
838
|
-
var lin = revfl[l] & 31, din = revfd[d] & 31;
|
|
839
|
-
eb += fleb[lin] + fdeb[din];
|
|
840
|
-
++lf[257 + lin];
|
|
841
|
-
++df[din];
|
|
842
|
-
wi = i + l;
|
|
843
|
-
++lc_1;
|
|
844
|
-
} else {
|
|
845
|
-
syms[li++] = dat[i];
|
|
846
|
-
++lf[dat[i]];
|
|
847
|
-
}
|
|
848
|
-
}
|
|
849
|
-
}
|
|
850
|
-
pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);
|
|
851
|
-
if (!lst && pos & 7)
|
|
852
|
-
pos = wfblk(w, pos + 1, et);
|
|
853
|
-
}
|
|
854
|
-
return slc(o, 0, pre + shft(pos) + post);
|
|
855
|
-
};
|
|
856
|
-
var adler = function() {
|
|
857
|
-
var a = 1, b = 0;
|
|
858
|
-
return {
|
|
859
|
-
p: function(d) {
|
|
860
|
-
var n = a, m = b;
|
|
861
|
-
var l = d.length | 0;
|
|
862
|
-
for (var i = 0; i !== l; ) {
|
|
863
|
-
var e = Math.min(i + 2655, l);
|
|
864
|
-
for (; i < e; ++i)
|
|
865
|
-
m += n += d[i];
|
|
866
|
-
n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);
|
|
867
|
-
}
|
|
868
|
-
a = n, b = m;
|
|
869
|
-
},
|
|
870
|
-
d: function() {
|
|
871
|
-
a %= 65521, b %= 65521;
|
|
872
|
-
return (a & 255) << 24 | a >>> 8 << 16 | (b & 255) << 8 | b >>> 8;
|
|
873
|
-
}
|
|
874
|
-
};
|
|
875
|
-
};
|
|
876
|
-
var dopt = function(dat, opt, pre, post, st) {
|
|
877
|
-
return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 12 + opt.mem, pre, post, !st);
|
|
878
|
-
};
|
|
879
|
-
var wbytes = function(d, b, v) {
|
|
880
|
-
for (; v; ++b)
|
|
881
|
-
d[b] = v, v >>>= 8;
|
|
882
|
-
};
|
|
883
|
-
var zlh = function(c, o) {
|
|
884
|
-
var lv = o.level, fl2 = lv === 0 ? 0 : lv < 6 ? 1 : lv === 9 ? 3 : 2;
|
|
885
|
-
c[0] = 120, c[1] = fl2 << 6 | (fl2 ? 32 - 2 * fl2 : 1);
|
|
886
|
-
};
|
|
887
|
-
var zlv = function(d) {
|
|
888
|
-
if ((d[0] & 15) !== 8 || d[0] >>> 4 > 7 || (d[0] << 8 | d[1]) % 31)
|
|
889
|
-
throw "invalid zlib data";
|
|
890
|
-
if (d[1] & 32)
|
|
891
|
-
throw "invalid zlib data: preset dictionaries not supported";
|
|
892
|
-
};
|
|
893
|
-
function zlibSync(data, opts) {
|
|
894
|
-
if (!opts)
|
|
895
|
-
opts = {};
|
|
896
|
-
var a = adler();
|
|
897
|
-
a.p(data);
|
|
898
|
-
var d = dopt(data, opts, 2, 4);
|
|
899
|
-
return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;
|
|
900
|
-
}
|
|
901
|
-
function unzlibSync(data, out) {
|
|
902
|
-
return inflt((zlv(data), data.subarray(2, -4)), out);
|
|
903
|
-
}
|
|
904
|
-
function compress(buf, level) {
|
|
905
|
-
return zlibSync(buf, {level});
|
|
906
|
-
}
|
|
907
|
-
function decompress(buf, limit) {
|
|
908
|
-
try {
|
|
909
|
-
return unzlibSync(buf, new Uint8Array(limit));
|
|
910
|
-
} catch (err) {
|
|
911
|
-
throw err.message ? err : new Error(err);
|
|
912
|
-
}
|
|
913
|
-
}
|
|
914
|
-
|
|
915
|
-
// ../../Users/evan/GitHub/ImageScript/png/src/png.js
|
|
916
|
-
var __IHDR__ = new Uint8Array([73, 72, 68, 82]);
|
|
917
|
-
var __IDAT__ = new Uint8Array([73, 68, 65, 84]);
|
|
918
|
-
var __IEND__ = new Uint8Array([73, 69, 78, 68]);
|
|
919
|
-
var __IEND_CRC__ = crc32(new Uint8Array([73, 69, 78, 68]));
|
|
920
|
-
var HEAD = new Uint8Array([137, 80, 78, 71, 13, 10, 26, 10]);
|
|
921
|
-
var color_types = {
|
|
922
|
-
GREYSCALE: 0,
|
|
923
|
-
TRUECOLOR: 2,
|
|
924
|
-
INDEXED_COLOR: 3,
|
|
925
|
-
GREYSCALE_ALPHA: 4,
|
|
926
|
-
TRUECOLOR_ALPHA: 6
|
|
927
|
-
};
|
|
928
|
-
var channels_to_color_type = {
|
|
929
|
-
1: color_types.GREYSCALE,
|
|
930
|
-
2: color_types.GREYSCALE_ALPHA,
|
|
931
|
-
3: color_types.TRUECOLOR,
|
|
932
|
-
4: color_types.TRUECOLOR_ALPHA
|
|
933
|
-
};
|
|
934
|
-
var utf8encoder = new TextEncoder();
|
|
935
|
-
function encode(data, {text, width, height, channels, depth = 8, level = 0}) {
|
|
936
|
-
let offset = 0;
|
|
937
|
-
let tmp_offset = 0;
|
|
938
|
-
const row_length = width * channels;
|
|
939
|
-
const tmp = new Uint8Array(height + data.length);
|
|
940
|
-
while (offset < data.length) {
|
|
941
|
-
tmp[tmp_offset++] = 0;
|
|
942
|
-
tmp.set(data.subarray(offset, offset += row_length), tmp_offset);
|
|
943
|
-
tmp_offset += row_length;
|
|
944
|
-
}
|
|
945
|
-
if (text) {
|
|
946
|
-
let chunks = [];
|
|
947
|
-
for (const key in text) {
|
|
948
|
-
if (!text[key])
|
|
949
|
-
continue;
|
|
950
|
-
const kb = utf8encoder.encode(key);
|
|
951
|
-
const tb = utf8encoder.encode(text[key]);
|
|
952
|
-
const chunk = new Uint8Array(1 + 12 + kb.length + tb.length);
|
|
953
|
-
const view3 = new DataView(chunk.buffer);
|
|
954
|
-
chunk[4] = 116;
|
|
955
|
-
chunk[5] = 69;
|
|
956
|
-
chunk[6] = 88;
|
|
957
|
-
chunk[7] = 116;
|
|
958
|
-
chunk.set(kb, 8);
|
|
959
|
-
chunks.push(chunk);
|
|
960
|
-
chunk.set(tb, 9 + kb.length);
|
|
961
|
-
view3.setUint32(0, chunk.length - 12);
|
|
962
|
-
view3.setUint32(chunk.length - 4, crc32(chunk.subarray(4, chunk.length - 4)));
|
|
963
|
-
}
|
|
964
|
-
text = from_parts(chunks);
|
|
965
|
-
}
|
|
966
|
-
offset = text ? text.length : 0;
|
|
967
|
-
const compressed = compress(tmp, level);
|
|
968
|
-
const array = new Uint8Array(49 + offset + HEAD.length + compressed.length);
|
|
969
|
-
array[26] = 0;
|
|
970
|
-
array[27] = 0;
|
|
971
|
-
array[28] = 0;
|
|
972
|
-
array[24] = depth;
|
|
973
|
-
array.set(HEAD, 0);
|
|
974
|
-
array.set(__IHDR__, 12);
|
|
975
|
-
array.set(__IDAT__, 37);
|
|
976
|
-
array.set(compressed, 41);
|
|
977
|
-
array[25] = channels_to_color_type[channels];
|
|
978
|
-
if (text)
|
|
979
|
-
array.set(text, 45 + compressed.length);
|
|
980
|
-
array.set(__IEND__, 49 + offset + compressed.length);
|
|
981
|
-
const view2 = new DataView(array.buffer);
|
|
982
|
-
view2.setUint32(8, 13);
|
|
983
|
-
view2.setUint32(16, width);
|
|
984
|
-
view2.setUint32(20, height);
|
|
985
|
-
view2.setUint32(33, compressed.length);
|
|
986
|
-
view2.setUint32(45 + offset + compressed.length, 0);
|
|
987
|
-
view2.setUint32(53 + offset + compressed.length, __IEND_CRC__);
|
|
988
|
-
view2.setUint32(29, crc32(new Uint8Array(array.buffer, 12, 17)));
|
|
989
|
-
view2.setUint32(41 + compressed.length, crc32(new Uint8Array(array.buffer, 37, 4 + compressed.length)));
|
|
990
|
-
return array;
|
|
991
|
-
}
|
|
992
|
-
function decode(array) {
|
|
993
|
-
let view2 = new DataView(array.buffer, array.byteOffset, array.byteLength);
|
|
994
|
-
const width = view2.getUint32(16);
|
|
995
|
-
const height = view2.getUint32(20);
|
|
996
|
-
const bpc = array[24];
|
|
997
|
-
const pixel_type = array[25];
|
|
998
|
-
let channels = {3: 1, 0: 1, 4: 2, 2: 3, 6: 4}[pixel_type];
|
|
999
|
-
const bytespp = channels * bpc / 8;
|
|
1000
|
-
const row_length = width * bytespp;
|
|
1001
|
-
let pixels = new Uint8Array(height * row_length);
|
|
1002
|
-
let offset = 0;
|
|
1003
|
-
let p_offset = 0;
|
|
1004
|
-
let c_offset = 33;
|
|
1005
|
-
const chunks = [];
|
|
1006
|
-
let palette, alphaPalette;
|
|
1007
|
-
const maxSearchOffset = array.length - 5;
|
|
1008
|
-
let type;
|
|
1009
|
-
while ((type = view2.getUint32(4 + c_offset)) !== 1229278788) {
|
|
1010
|
-
if (type === 1229209940)
|
|
1011
|
-
chunks.push(array.subarray(8 + c_offset, 8 + c_offset + view2.getUint32(c_offset)));
|
|
1012
|
-
else if (type === 1347179589) {
|
|
1013
|
-
if (palette)
|
|
1014
|
-
throw new Error("PLTE can only occur once in an image");
|
|
1015
|
-
palette = new Uint32Array(view2.getUint32(c_offset));
|
|
1016
|
-
for (let pxlOffset = 0; pxlOffset < palette.length * 8; pxlOffset += 3)
|
|
1017
|
-
palette[pxlOffset / 3] = array[8 + c_offset + pxlOffset] << 24 | array[8 + c_offset + pxlOffset + 1] << 16 | array[8 + c_offset + pxlOffset + 2] << 8 | 255;
|
|
1018
|
-
} else if (type === 1951551059) {
|
|
1019
|
-
if (alphaPalette)
|
|
1020
|
-
throw new Error("tRNS can only occur once in an image");
|
|
1021
|
-
alphaPalette = new Uint8Array(view2.getUint32(c_offset));
|
|
1022
|
-
for (let i = 0; i < alphaPalette.length; i++)
|
|
1023
|
-
alphaPalette[i] = array[8 + c_offset + i];
|
|
1024
|
-
}
|
|
1025
|
-
c_offset += 4 + 4 + 4 + view2.getUint32(c_offset);
|
|
1026
|
-
if (c_offset > maxSearchOffset)
|
|
1027
|
-
break;
|
|
1028
|
-
}
|
|
1029
|
-
array = decompress(chunks.length === 1 ? chunks[0] : from_parts(chunks), height + height * row_length);
|
|
1030
|
-
while (offset < array.byteLength) {
|
|
1031
|
-
const filter = array[offset++];
|
|
1032
|
-
const slice = array.subarray(offset, offset += row_length);
|
|
1033
|
-
if (filter === 0)
|
|
1034
|
-
pixels.set(slice, p_offset);
|
|
1035
|
-
else if (filter === 1)
|
|
1036
|
-
filter_1(slice, pixels, p_offset, bytespp, row_length);
|
|
1037
|
-
else if (filter === 2)
|
|
1038
|
-
filter_2(slice, pixels, p_offset, bytespp, row_length);
|
|
1039
|
-
else if (filter === 3)
|
|
1040
|
-
filter_3(slice, pixels, p_offset, bytespp, row_length);
|
|
1041
|
-
else if (filter === 4)
|
|
1042
|
-
filter_4(slice, pixels, p_offset, bytespp, row_length);
|
|
1043
|
-
p_offset += row_length;
|
|
1044
|
-
}
|
|
1045
|
-
if (pixel_type === 3) {
|
|
1046
|
-
if (!palette)
|
|
1047
|
-
throw new Error("Indexed color PNG has no PLTE");
|
|
1048
|
-
if (alphaPalette)
|
|
1049
|
-
for (let i = 0; i < alphaPalette.length; i++)
|
|
1050
|
-
palette[i] &= 4294967040 | alphaPalette[i];
|
|
1051
|
-
channels = 4;
|
|
1052
|
-
const newPixels = new Uint8Array(width * height * 4);
|
|
1053
|
-
const pixelView = new DataView(newPixels.buffer, newPixels.byteOffset, newPixels.byteLength);
|
|
1054
|
-
for (let i = 0; i < pixels.length; i++)
|
|
1055
|
-
pixelView.setUint32(i * 4, palette[pixels[i]], false);
|
|
1056
|
-
pixels = newPixels;
|
|
1057
|
-
}
|
|
1058
|
-
if (bpc !== 8) {
|
|
1059
|
-
const newPixels = new Uint8Array(pixels.length / bpc * 8);
|
|
1060
|
-
for (let i = 0; i < pixels.length; i += 2)
|
|
1061
|
-
newPixels[i / 2] = pixels[i];
|
|
1062
|
-
pixels = newPixels;
|
|
1063
|
-
}
|
|
1064
|
-
if (channels !== 4) {
|
|
1065
|
-
const newPixels = new Uint8Array(width * height * 4);
|
|
1066
|
-
const view3 = new DataView(newPixels.buffer);
|
|
1067
|
-
if (channels === 1) {
|
|
1068
|
-
for (let i = 0; i < width * height; i++) {
|
|
1069
|
-
const pixel = pixels[i];
|
|
1070
|
-
view3.setUint32(i * 4, pixel << 24 | pixel << 16 | pixel << 8 | 255, false);
|
|
1071
|
-
}
|
|
1072
|
-
} else if (channels === 2) {
|
|
1073
|
-
for (let i = 0; i < width * height * 2; i += 2) {
|
|
1074
|
-
const pixel = pixels[i];
|
|
1075
|
-
view3.setUint32(i * 2, pixel << 24 | pixel << 16 | pixel << 8 | pixels[i + 1], false);
|
|
1076
|
-
}
|
|
1077
|
-
} else if (channels === 3) {
|
|
1078
|
-
newPixels.fill(255);
|
|
1079
|
-
for (let i = 0; i < width * height; i++)
|
|
1080
|
-
newPixels.set(pixels.subarray(i * 3, i * 3 + 3), i * 4);
|
|
1081
|
-
}
|
|
1082
|
-
pixels = newPixels;
|
|
1083
|
-
}
|
|
1084
|
-
return {width, height, pixels};
|
|
1085
|
-
}
|
|
1086
|
-
function filter_1(slice, pixels, p_offset, bytespp, row_length) {
|
|
1087
|
-
let i = 0;
|
|
1088
|
-
while (i < bytespp)
|
|
1089
|
-
pixels[i + p_offset] = slice[i++];
|
|
1090
|
-
while (i < row_length)
|
|
1091
|
-
pixels[i + p_offset] = slice[i] + pixels[i++ + p_offset - bytespp];
|
|
1092
|
-
}
|
|
1093
|
-
function filter_2(slice, pixels, p_offset, bytespp, row_length) {
|
|
1094
|
-
if (p_offset === 0)
|
|
1095
|
-
pixels.set(slice, p_offset);
|
|
1096
|
-
else {
|
|
1097
|
-
let i = 0;
|
|
1098
|
-
while (i < row_length)
|
|
1099
|
-
pixels[i + p_offset] = slice[i] + pixels[i++ + p_offset - row_length];
|
|
1100
|
-
}
|
|
1101
|
-
}
|
|
1102
|
-
function filter_3(slice, pixels, p_offset, bytespp, row_length) {
|
|
1103
|
-
let i = 0;
|
|
1104
|
-
if (p_offset === 0) {
|
|
1105
|
-
while (i < bytespp)
|
|
1106
|
-
pixels[i] = slice[i++];
|
|
1107
|
-
while (i < row_length)
|
|
1108
|
-
pixels[i] = slice[i] + (pixels[i++ - bytespp] >> 1);
|
|
1109
|
-
} else {
|
|
1110
|
-
while (i < bytespp)
|
|
1111
|
-
pixels[i + p_offset] = slice[i] + (pixels[i++ + p_offset - row_length] >> 1);
|
|
1112
|
-
while (i < row_length)
|
|
1113
|
-
pixels[i + p_offset] = slice[i] + (pixels[i + p_offset - bytespp] + pixels[i++ + p_offset - row_length] >> 1);
|
|
1114
|
-
}
|
|
1115
|
-
}
|
|
1116
|
-
function filter_4(slice, pixels, p_offset, bytespp, row_length) {
|
|
1117
|
-
let i = 0;
|
|
1118
|
-
if (p_offset === 0) {
|
|
1119
|
-
while (i < bytespp)
|
|
1120
|
-
pixels[i] = slice[i++];
|
|
1121
|
-
while (i < row_length)
|
|
1122
|
-
pixels[i] = slice[i] + pixels[i++ - bytespp];
|
|
1123
|
-
} else {
|
|
1124
|
-
while (i < bytespp)
|
|
1125
|
-
pixels[i + p_offset] = slice[i] + pixels[i++ + p_offset - row_length];
|
|
1126
|
-
while (i < row_length) {
|
|
1127
|
-
const a = pixels[i + p_offset - bytespp];
|
|
1128
|
-
const b = pixels[i + p_offset - row_length];
|
|
1129
|
-
const c = pixels[i + p_offset - bytespp - row_length];
|
|
1130
|
-
const p = a + b - c;
|
|
1131
|
-
const pa = Math.abs(p - a);
|
|
1132
|
-
const pb = Math.abs(p - b);
|
|
1133
|
-
const pc = Math.abs(p - c);
|
|
1134
|
-
pixels[i + p_offset] = slice[i++] + (pa <= pb && pa <= pc ? a : pb <= pc ? b : c);
|
|
1135
|
-
}
|
|
1136
|
-
}
|
|
1137
|
-
}
|