@rtzh/engine 0.0.9 → 0.0.11
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/Build/ThirdParty/Workers/zip-web-worker.js +586 -480
- package/Build/Workers/chunk-3CD4WIF4.js +101 -0
- package/Build/Workers/chunk-3PWX65TL.js +398 -0
- package/Build/Workers/chunk-4CQDMEZY.js +2058 -0
- package/Build/Workers/chunk-4GZLJPDW.js +8366 -0
- package/Build/Workers/chunk-5WKGRIN6.js +114 -0
- package/Build/Workers/chunk-6BNIWSFA.js +940 -0
- package/Build/Workers/chunk-6TWMNB7Q.js +455 -0
- package/Build/Workers/chunk-72Q33KL6.js +280 -0
- package/Build/Workers/chunk-74HENCNJ.js +171 -0
- package/Build/Workers/chunk-7C2MOK27.js +57 -0
- package/Build/Workers/chunk-7EFYX4FL.js +642 -0
- package/Build/Workers/chunk-7RAUHLDW.js +497 -0
- package/Build/Workers/chunk-B3FJJGCH.js +305 -0
- package/Build/Workers/chunk-BIJHMMCD.js +138 -0
- package/Build/Workers/chunk-CGAHG2LR.js +163 -0
- package/Build/Workers/chunk-CQ5PWUMS.js +37 -0
- package/Build/Workers/chunk-CQB3KRGK.js +198 -0
- package/Build/Workers/chunk-DHWZGIOA.js +139 -0
- package/Build/Workers/chunk-EDFDPOY6.js +55 -0
- package/Build/Workers/chunk-F2BQY3GT.js +1317 -0
- package/Build/Workers/chunk-FARHIBOA.js +75 -0
- package/Build/Workers/chunk-G6PDJHNG.js +476 -0
- package/Build/Workers/chunk-GCPD37SU.js +1054 -0
- package/Build/Workers/chunk-GDHDJK32.js +1045 -0
- package/Build/Workers/chunk-GNGGEDZK.js +352 -0
- package/Build/Workers/chunk-GNGZG6C6.js +162 -0
- package/Build/Workers/chunk-HFCJLXTG.js +55 -0
- package/Build/Workers/chunk-HKII76UV.js +1800 -0
- package/Build/Workers/chunk-HWUHUN7Z.js +387 -0
- package/Build/Workers/chunk-I3VVEQQ6.js +439 -0
- package/Build/Workers/chunk-IKMU6YHA.js +288 -0
- package/Build/Workers/chunk-J4PNHKWO.js +2719 -0
- package/Build/Workers/chunk-JFLJS4QU.js +1443 -0
- package/Build/Workers/chunk-JJWMDUOJ.js +44 -0
- package/Build/Workers/chunk-JOQFYJZ2.js +692 -0
- package/Build/Workers/chunk-JUJONRWD.js +788 -0
- package/Build/Workers/chunk-MCJRXFRL.js +102 -0
- package/Build/Workers/chunk-MLL4AAXV.js +1460 -0
- package/Build/Workers/chunk-MPCZC3G6.js +414 -0
- package/Build/Workers/chunk-MPHEIDPB.js +629 -0
- package/Build/Workers/chunk-NXZJKIYD.js +97 -0
- package/Build/Workers/chunk-OD7UYXFV.js +352 -0
- package/Build/Workers/chunk-R2AFDOIY.js +778 -0
- package/Build/Workers/chunk-RBLCJVK6.js +73 -0
- package/Build/Workers/chunk-SCF2OVAZ.js +219 -0
- package/Build/Workers/chunk-SJX7UJNW.js +241 -0
- package/Build/Workers/chunk-SZQC2TUH.js +368 -0
- package/Build/Workers/chunk-TAWVKT4B.js +58 -0
- package/Build/Workers/chunk-U267N6IJ.js +299 -0
- package/Build/Workers/chunk-UZXJSLDO.js +3514 -0
- package/Build/Workers/chunk-VP2OAU4C.js +124 -0
- package/Build/Workers/chunk-XMIENZET.js +256 -0
- package/Build/Workers/chunk-XXD3TQVI.js +837 -0
- package/Build/Workers/chunk-YCTK62TY.js +1483 -0
- package/Build/Workers/chunk-YWSB7PZP.js +511 -0
- package/Build/Workers/chunk-ZVXETFPZ.js +1067 -0
- package/Build/Workers/chunk-ZXZTWDTN.js +682 -0
- package/Build/Workers/combineGeometry.js +24 -24
- package/Build/Workers/createBoxGeometry.js +18 -18
- package/Build/Workers/createBoxOutlineGeometry.js +16 -16
- package/Build/Workers/createCircleGeometry.js +26 -26
- package/Build/Workers/createCircleOutlineGeometry.js +19 -19
- package/Build/Workers/createCoplanarPolygonGeometry.js +33 -33
- package/Build/Workers/createCoplanarPolygonOutlineGeometry.js +31 -31
- package/Build/Workers/createCorridorGeometry.js +29 -29
- package/Build/Workers/createCorridorOutlineGeometry.js +28 -28
- package/Build/Workers/createCylinderGeometry.js +20 -20
- package/Build/Workers/createCylinderOutlineGeometry.js +18 -18
- package/Build/Workers/createEllipseGeometry.js +26 -26
- package/Build/Workers/createEllipseOutlineGeometry.js +19 -19
- package/Build/Workers/createEllipsoidGeometry.js +19 -19
- package/Build/Workers/createEllipsoidOutlineGeometry.js +18 -18
- package/Build/Workers/createFrustumGeometry.js +18 -18
- package/Build/Workers/createFrustumOutlineGeometry.js +18 -18
- package/Build/Workers/createGeometry.js +24 -24
- package/Build/Workers/createGroundPolylineGeometry.js +22 -22
- package/Build/Workers/createPlaneGeometry.js +16 -16
- package/Build/Workers/createPlaneOutlineGeometry.js +15 -15
- package/Build/Workers/createPolygonGeometry.js +32 -32
- package/Build/Workers/createPolygonOutlineGeometry.js +30 -30
- package/Build/Workers/createPolylineGeometry.js +25 -25
- package/Build/Workers/createPolylineVolumeGeometry.js +31 -31
- package/Build/Workers/createPolylineVolumeOutlineGeometry.js +27 -27
- package/Build/Workers/createRectangleGeometry.js +27 -27
- package/Build/Workers/createRectangleOutlineGeometry.js +20 -20
- package/Build/Workers/createSimplePolylineGeometry.js +23 -23
- package/Build/Workers/createSphereGeometry.js +19 -19
- package/Build/Workers/createSphereOutlineGeometry.js +18 -18
- package/Build/Workers/createTaskProcessorWorker.js +3 -3
- package/Build/Workers/createVectorTileClampedPolylines.js +14 -14
- package/Build/Workers/createVectorTileGeometries.js +24 -24
- package/Build/Workers/createVectorTilePoints.js +13 -13
- package/Build/Workers/createVectorTilePolygons.js +22 -22
- package/Build/Workers/createVectorTilePolylines.js +14 -14
- package/Build/Workers/createVerticesFromCesium3DTilesTerrain.js +25 -25
- package/Build/Workers/createVerticesFromGoogleEarthEnterpriseBuffer.js +22 -22
- package/Build/Workers/createVerticesFromHeightmap.js +22 -22
- package/Build/Workers/createVerticesFromQuantizedTerrainMesh.js +20 -20
- package/Build/Workers/createWallGeometry.js +24 -24
- package/Build/Workers/createWallOutlineGeometry.js +23 -23
- package/Build/Workers/decodeDraco.js +10 -10
- package/Build/Workers/decodeGoogleEarthEnterprisePacket.js +5 -5
- package/Build/Workers/decodeI3S.js +10 -10
- package/Build/Workers/gaussianSplatSorter.js +4 -4
- package/Build/Workers/gaussianSplatTextureGenerator.js +4 -4
- package/Build/Workers/incrementallyBuildTerrainPicker.js +10 -10
- package/Build/Workers/transcodeKTX2.js +6 -6
- package/Build/Workers/transferTypedArrayTest.js +1 -1
- package/Build/Workers/upsampleQuantizedTerrainMesh.js +22 -22
- package/Build/Workers/upsampleVerticesFromCesium3DTilesTerrain.js +25 -25
- package/README.md +69 -9
- package/Source/Renderer/AutomaticUniforms.js +76 -1
- package/Source/Renderer/UniformState.js +108 -1
- package/Source/Scene/Cesium3DTileset.js +4157 -4157
- package/Source/Scene/Model/BarycentricWireframePipelineStage.js +462 -414
- package/Source/Scene/Model/LightingPipelineStage.js +17 -2
- package/Source/Scene/Model/MaterialPipelineStage.js +50 -0
- package/Source/Scene/Model/Model.js +3646 -3631
- package/Source/Scene/Model/Model3DTileContent.js +568 -568
- package/Source/Scene/Model/ModelRuntimePrimitive.js +391 -391
- package/Source/Scene/Model/WireframePipelineStage.js +122 -122
- package/Source/Scene/PointLight.js +36 -0
- package/Source/Scene/Scene.js +9 -1
- package/Source/Shaders/Model/LightingStageFS.glsl +33 -0
- package/Source/Shaders/Model/LightingStageFS.js +33 -0
- package/Source/ThirdParty/Workers/zip-web-worker.js +1 -1
- package/Source/ThirdParty/zip-module.wasm +0 -0
- package/index.d.ts +809 -779
- package/index.js +11 -10
- package/package.json +1 -1
|
@@ -1,639 +1,745 @@
|
|
|
1
1
|
!(function() {
|
|
2
2
|
"use strict";
|
|
3
|
-
const { Array:
|
|
4
|
-
for (let
|
|
5
|
-
let
|
|
6
|
-
for (let
|
|
7
|
-
|
|
8
|
-
}
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
this.
|
|
3
|
+
const { Array: t, Object: e, Number: n, Math: s, Error: r, Uint8Array: o, Uint16Array: i, Uint32Array: a, Int32Array: c, Map: l, DataView: f, Promise: w, TextEncoder: u, crypto: h, postMessage: p, TransformStream: d, ReadableStream: y, WritableStream: m, CompressionStream: g, DecompressionStream: S } = self, b = void 0, k = "undefined", v = "function", z = new o(), C = [[], [], [], [], [], [], [], []];
|
|
4
|
+
for (let t2 = 0; 256 > t2; t2++) {
|
|
5
|
+
let e2 = t2;
|
|
6
|
+
for (let t3 = 0; 8 > t3; t3++) e2 = 1 & e2 ? e2 >>> 1 ^ 3988292384 : e2 >>> 1;
|
|
7
|
+
C[0][t2] = e2;
|
|
8
|
+
}
|
|
9
|
+
for (let t2 = 0; 256 > t2; t2++) for (let e2 = 1; 8 > e2; e2++) {
|
|
10
|
+
const n2 = C[e2 - 1][t2];
|
|
11
|
+
C[e2][t2] = n2 >>> 8 ^ C[0][255 & n2];
|
|
12
|
+
}
|
|
13
|
+
const [I, A, x, P, R, U, W, D] = C;
|
|
14
|
+
class M {
|
|
15
|
+
constructor(t2) {
|
|
16
|
+
this.t = t2 || -1;
|
|
17
|
+
}
|
|
18
|
+
append(t2) {
|
|
19
|
+
let e2 = 0 | this.t;
|
|
20
|
+
const n2 = 0 | t2.length;
|
|
21
|
+
let s2 = 0;
|
|
22
|
+
if (n2 >= 8 && t2.buffer) {
|
|
23
|
+
const r2 = new f(t2.buffer, t2.byteOffset, n2), o2 = n2 - 8;
|
|
24
|
+
for (; o2 >= s2; s2 += 8) {
|
|
25
|
+
const t3 = e2 ^ r2.getInt32(s2, true), n3 = r2.getInt32(s2 + 4, true);
|
|
26
|
+
e2 = D[255 & t3] ^ W[t3 >>> 8 & 255] ^ U[t3 >>> 16 & 255] ^ R[t3 >>> 24 & 255] ^ P[255 & n3] ^ x[n3 >>> 8 & 255] ^ A[n3 >>> 16 & 255] ^ I[n3 >>> 24 & 255];
|
|
27
|
+
}
|
|
28
|
+
}
|
|
29
|
+
for (; n2 > s2; s2++) e2 = e2 >>> 8 ^ I[255 & (e2 ^ t2[s2])];
|
|
30
|
+
this.t = e2;
|
|
17
31
|
}
|
|
18
32
|
get() {
|
|
19
|
-
return ~this.
|
|
33
|
+
return ~this.t;
|
|
20
34
|
}
|
|
21
35
|
}
|
|
22
|
-
class
|
|
36
|
+
class _ extends d {
|
|
23
37
|
constructor() {
|
|
24
|
-
let
|
|
25
|
-
const
|
|
26
|
-
super({ transform(
|
|
27
|
-
|
|
38
|
+
let t2;
|
|
39
|
+
const e2 = new M();
|
|
40
|
+
super({ transform(t3, n2) {
|
|
41
|
+
e2.append(t3), n2.enqueue(t3);
|
|
28
42
|
}, flush() {
|
|
29
|
-
const n2 = new
|
|
30
|
-
new
|
|
31
|
-
} }),
|
|
32
|
-
}
|
|
33
|
-
}
|
|
34
|
-
const
|
|
35
|
-
if (0 ===
|
|
36
|
-
const n2 =
|
|
37
|
-
return 32 === s2 ?
|
|
38
|
-
},
|
|
39
|
-
const
|
|
40
|
-
if (0 ===
|
|
41
|
-
const n2 = e2
|
|
42
|
-
return 32 * (
|
|
43
|
-
},
|
|
44
|
-
if (32 *
|
|
45
|
-
const n2 = (
|
|
46
|
-
return
|
|
47
|
-
},
|
|
48
|
-
for (void 0 === s2 && (s2 = []);
|
|
49
|
-
if (0 ===
|
|
50
|
-
for (let r3 = 0; r3 <
|
|
51
|
-
const r2 =
|
|
52
|
-
return s2.push(
|
|
53
|
-
} },
|
|
54
|
-
const
|
|
43
|
+
const n2 = new o(4);
|
|
44
|
+
new f(n2.buffer).setUint32(0, e2.get()), t2.value = n2;
|
|
45
|
+
} }), t2 = this;
|
|
46
|
+
}
|
|
47
|
+
}
|
|
48
|
+
const B = { concat(t2, e2) {
|
|
49
|
+
if (0 === t2.length || 0 === e2.length) return t2.concat(e2);
|
|
50
|
+
const n2 = t2[t2.length - 1], s2 = B.o(n2);
|
|
51
|
+
return 32 === s2 ? t2.concat(e2) : B.i(e2, s2, 0 | n2, t2.slice(0, t2.length - 1));
|
|
52
|
+
}, l(t2) {
|
|
53
|
+
const e2 = t2.length;
|
|
54
|
+
if (0 === e2) return 0;
|
|
55
|
+
const n2 = t2[e2 - 1];
|
|
56
|
+
return 32 * (e2 - 1) + B.o(n2);
|
|
57
|
+
}, u(t2, e2) {
|
|
58
|
+
if (32 * t2.length < e2) return t2;
|
|
59
|
+
const n2 = (t2 = t2.slice(0, s.ceil(e2 / 32))).length;
|
|
60
|
+
return e2 &= 31, n2 > 0 && e2 && (t2[n2 - 1] = B.h(e2, t2[n2 - 1] & 2147483648 >> e2 - 1, 1)), t2;
|
|
61
|
+
}, h: (t2, e2, n2) => 32 === t2 ? e2 : (n2 ? 0 | e2 : e2 << 32 - t2) + 1099511627776 * t2, o: (t2) => s.round(t2 / 1099511627776) || 32, i(t2, e2, n2, s2) {
|
|
62
|
+
for (void 0 === s2 && (s2 = []); e2 >= 32; e2 -= 32) s2.push(n2), n2 = 0;
|
|
63
|
+
if (0 === e2) return s2.concat(t2);
|
|
64
|
+
for (let r3 = 0; r3 < t2.length; r3++) s2.push(n2 | t2[r3] >>> e2), n2 = t2[r3] << 32 - e2;
|
|
65
|
+
const r2 = t2.length ? t2[t2.length - 1] : 0, o2 = B.o(r2);
|
|
66
|
+
return s2.push(B.h(e2 + o2 & 31, e2 + o2 > 32 ? n2 : s2.pop(), 1)), s2;
|
|
67
|
+
} }, T = { bytes: { p(t2) {
|
|
68
|
+
const e2 = B.l(t2) / 8, n2 = new o(e2);
|
|
55
69
|
let s2;
|
|
56
|
-
for (let r2 = 0;
|
|
70
|
+
for (let r2 = 0; e2 > r2; r2++) 3 & r2 || (s2 = t2[r2 / 4]), n2[r2] = s2 >>> 24, s2 <<= 8;
|
|
57
71
|
return n2;
|
|
58
|
-
},
|
|
59
|
-
const
|
|
72
|
+
}, m(t2) {
|
|
73
|
+
const e2 = [];
|
|
60
74
|
let n2, s2 = 0;
|
|
61
|
-
for (n2 = 0; n2 <
|
|
62
|
-
return 3 & n2 &&
|
|
63
|
-
} } },
|
|
64
|
-
constructor(
|
|
65
|
-
const t2 = this;
|
|
66
|
-
t2.blockSize = 512, t2._init = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], t2._key = [1518500249, 1859775393, 2400959708, 3395469782], e2 ? (t2._h = e2._h.slice(0), t2._buffer = e2._buffer.slice(0), t2._length = e2._length) : t2.reset();
|
|
67
|
-
}
|
|
68
|
-
reset() {
|
|
75
|
+
for (n2 = 0; n2 < t2.length; n2++) s2 = s2 << 8 | t2[n2], 3 & ~n2 || (e2.push(s2), s2 = 0);
|
|
76
|
+
return 3 & n2 && e2.push(B.h(8 * (3 & n2), s2)), e2;
|
|
77
|
+
} } }, V = class {
|
|
78
|
+
constructor(t2) {
|
|
69
79
|
const e2 = this;
|
|
70
|
-
|
|
80
|
+
e2.blockSize = 512, e2.S = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], e2.k = [1518500249, 1859775393, 2400959708, 3395469782], t2 ? (e2.v = t2.v.slice(0), e2.C = t2.C.slice(0), e2.I = t2.I) : e2.reset();
|
|
71
81
|
}
|
|
72
|
-
|
|
82
|
+
reset() {
|
|
73
83
|
const t2 = this;
|
|
74
|
-
|
|
75
|
-
const n2 = t2._buffer = C.concat(t2._buffer, e2), s2 = t2._length, i2 = t2._length = s2 + C.bitLength(e2);
|
|
76
|
-
if (i2 > 9007199254740991) throw new r("Cannot hash more than 2^53 - 1 bits");
|
|
77
|
-
const a2 = new o(n2);
|
|
78
|
-
let c2 = 0;
|
|
79
|
-
for (let e3 = t2.blockSize + s2 - (t2.blockSize + s2 & t2.blockSize - 1); i2 >= e3; e3 += t2.blockSize) t2._block(a2.subarray(16 * c2, 16 * (c2 + 1))), c2 += 1;
|
|
80
|
-
return n2.splice(0, 16 * c2), t2;
|
|
84
|
+
return t2.v = t2.S.slice(0), t2.C = [], t2.I = 0, t2;
|
|
81
85
|
}
|
|
82
|
-
|
|
86
|
+
update(t2) {
|
|
83
87
|
const e2 = this;
|
|
84
|
-
|
|
85
|
-
const n2 = e2.
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
88
|
+
"string" == typeof t2 && (t2 = T.A.m(t2));
|
|
89
|
+
const n2 = e2.C = B.concat(e2.C, t2), s2 = e2.I, o2 = e2.I = s2 + B.l(t2);
|
|
90
|
+
if (o2 > 9007199254740991) throw new r("Cannot hash more than 2^53 - 1 bits");
|
|
91
|
+
const i2 = new a(n2);
|
|
92
|
+
let c2 = 0;
|
|
93
|
+
for (let t3 = e2.blockSize + s2 - (e2.blockSize + s2 & e2.blockSize - 1); o2 >= t3; t3 += e2.blockSize) e2.P(i2.subarray(16 * c2, 16 * (c2 + 1))), c2 += 1;
|
|
94
|
+
return n2.splice(0, 16 * c2), e2;
|
|
95
|
+
}
|
|
96
|
+
R() {
|
|
97
|
+
const t2 = this;
|
|
98
|
+
let e2 = t2.C;
|
|
99
|
+
const n2 = t2.v;
|
|
100
|
+
e2 = B.concat(e2, [B.h(1, 1)]);
|
|
101
|
+
for (let t3 = e2.length + 2; 15 & t3; t3++) e2.push(0);
|
|
102
|
+
for (e2.push(s.floor(t2.I / 4294967296)), e2.push(0 | t2.I); e2.length; ) t2.P(e2.splice(0, 16));
|
|
103
|
+
return t2.reset(), n2;
|
|
104
|
+
}
|
|
105
|
+
U(t2, e2, n2, s2) {
|
|
106
|
+
return t2 > 19 ? t2 > 39 ? t2 > 59 ? t2 > 79 ? void 0 : e2 ^ n2 ^ s2 : e2 & n2 | e2 & s2 | n2 & s2 : e2 ^ n2 ^ s2 : e2 & n2 | ~e2 & s2;
|
|
107
|
+
}
|
|
108
|
+
W(t2, e2) {
|
|
109
|
+
return e2 << t2 | e2 >>> 32 - t2;
|
|
110
|
+
}
|
|
111
|
+
P(e2) {
|
|
112
|
+
const n2 = this, r2 = n2.v, o2 = t(80);
|
|
113
|
+
for (let t2 = 0; 16 > t2; t2++) o2[t2] = e2[t2];
|
|
114
|
+
let i2 = r2[0], a2 = r2[1], c2 = r2[2], l2 = r2[3], f2 = r2[4];
|
|
115
|
+
for (let t2 = 0; 79 >= t2; t2++) {
|
|
116
|
+
16 > t2 || (o2[t2] = n2.W(1, o2[t2 - 3] ^ o2[t2 - 8] ^ o2[t2 - 14] ^ o2[t2 - 16]));
|
|
117
|
+
const e3 = n2.W(5, i2) + n2.U(t2, a2, c2, l2) + f2 + o2[t2] + n2.k[s.floor(t2 / 20)] | 0;
|
|
118
|
+
f2 = l2, l2 = c2, c2 = n2.W(30, a2), a2 = i2, i2 = e3;
|
|
105
119
|
}
|
|
106
|
-
r2[0] = r2[0] +
|
|
107
|
-
}
|
|
108
|
-
},
|
|
109
|
-
const t2 = new o(e2.buffer), n2 = (e3) => {
|
|
110
|
-
let t3 = 987654321;
|
|
111
|
-
const n3 = 4294967295;
|
|
112
|
-
return () => (t3 = 36969 * (65535 & t3) + (t3 >> 16) & n3, (((t3 << 16) + (e3 = 18e3 * (65535 & e3) + (e3 >> 16) & n3) & n3) / 4294967296 + 0.5) * (s.random() > 0.5 ? 1 : -1));
|
|
113
|
-
};
|
|
114
|
-
for (let r2, i2 = 0; i2 < e2.length; i2 += 4) {
|
|
115
|
-
const e3 = n2(4294967296 * (r2 || s.random()));
|
|
116
|
-
r2 = 987654071 * e3(), t2[i2 / 4] = 4294967296 * e3() | 0;
|
|
117
|
-
}
|
|
118
|
-
return e2;
|
|
119
|
-
} }, I = { importKey: (e2) => new I.hmacSha1(B.bytes.toBits(e2)), pbkdf2(e2, t2, n2, s2) {
|
|
120
|
+
r2[0] = r2[0] + i2 | 0, r2[1] = r2[1] + a2 | 0, r2[2] = r2[2] + c2 | 0, r2[3] = r2[3] + l2 | 0, r2[4] = r2[4] + f2 | 0;
|
|
121
|
+
}
|
|
122
|
+
}, K = { importKey: (t2) => new K.D(T.bytes.m(t2)), M(t2, e2, n2, s2) {
|
|
120
123
|
if (n2 = n2 || 1e4, 0 > s2 || 0 > n2) throw new r("invalid params to pbkdf2");
|
|
121
|
-
const
|
|
122
|
-
let
|
|
123
|
-
const
|
|
124
|
-
let
|
|
125
|
-
const
|
|
126
|
-
for (
|
|
127
|
-
for (
|
|
128
|
-
for (c2 = 0; (
|
|
129
|
-
}
|
|
130
|
-
return
|
|
131
|
-
},
|
|
132
|
-
constructor(
|
|
133
|
-
const
|
|
134
|
-
|
|
135
|
-
const r2 =
|
|
136
|
-
|
|
137
|
-
for (let
|
|
138
|
-
|
|
124
|
+
const o2 = 1 + (s2 >> 5) << 2;
|
|
125
|
+
let i2, a2, c2, l2, w2;
|
|
126
|
+
const u2 = new ArrayBuffer(o2), h2 = new f(u2);
|
|
127
|
+
let p2 = 0;
|
|
128
|
+
const d2 = B;
|
|
129
|
+
for (e2 = T.bytes.m(e2), w2 = 1; (o2 || 1) > p2; w2++) {
|
|
130
|
+
for (i2 = a2 = t2.encrypt(d2.concat(e2, [w2])), c2 = 1; n2 > c2; c2++) for (a2 = t2.encrypt(a2), l2 = 0; l2 < a2.length; l2++) i2[l2] ^= a2[l2];
|
|
131
|
+
for (c2 = 0; (o2 || 1) > p2 && c2 < i2.length; c2++) h2.setInt32(p2, i2[c2]), p2 += 4;
|
|
132
|
+
}
|
|
133
|
+
return u2.slice(0, s2 / 8);
|
|
134
|
+
}, D: class {
|
|
135
|
+
constructor(t2) {
|
|
136
|
+
const e2 = this, n2 = e2._ = V, s2 = [[], []];
|
|
137
|
+
e2.B = [new n2(), new n2()];
|
|
138
|
+
const r2 = e2.B[0].blockSize / 32;
|
|
139
|
+
t2.length > r2 && (t2 = new n2().update(t2).R());
|
|
140
|
+
for (let e3 = 0; r2 > e3; e3++) s2[0][e3] = 909522486 ^ t2[e3], s2[1][e3] = 1549556828 ^ t2[e3];
|
|
141
|
+
e2.B[0].update(s2[0]), e2.B[1].update(s2[1]), e2.T = new n2(e2.B[0]);
|
|
139
142
|
}
|
|
140
143
|
reset() {
|
|
141
|
-
const
|
|
142
|
-
|
|
144
|
+
const t2 = this;
|
|
145
|
+
t2.T = new t2._(t2.B[0]), t2.V = false;
|
|
143
146
|
}
|
|
144
|
-
update(
|
|
145
|
-
this.
|
|
147
|
+
update(t2) {
|
|
148
|
+
this.V = true, this.T.update(t2);
|
|
146
149
|
}
|
|
147
150
|
digest() {
|
|
148
|
-
const
|
|
149
|
-
return
|
|
151
|
+
const t2 = this, e2 = t2.T.R(), n2 = new t2._(t2.B[1]).update(e2).R();
|
|
152
|
+
return t2.reset(), n2;
|
|
150
153
|
}
|
|
151
|
-
encrypt(
|
|
152
|
-
if (this.
|
|
153
|
-
return this.update(
|
|
154
|
+
encrypt(t2) {
|
|
155
|
+
if (this.V) throw new r("encrypt on already updated hmac called!");
|
|
156
|
+
return this.update(t2), this.digest(t2);
|
|
154
157
|
}
|
|
155
|
-
} },
|
|
156
|
-
function
|
|
157
|
-
|
|
158
|
+
} }, j = typeof h != k && typeof h.getRandomValues == v, E = "Invalid password", L = "Invalid signature", O = "zipjs-abort-check-password";
|
|
159
|
+
function H(t2) {
|
|
160
|
+
if (j) return h.getRandomValues(t2);
|
|
161
|
+
throw new r("Crypto API not supported");
|
|
158
162
|
}
|
|
159
|
-
const
|
|
160
|
-
constructor(
|
|
161
|
-
const
|
|
162
|
-
|
|
163
|
-
const n2 =
|
|
164
|
-
let
|
|
165
|
-
if (4 !==
|
|
166
|
-
for (
|
|
167
|
-
let
|
|
168
|
-
(
|
|
163
|
+
const Z = 16, F = { name: "PBKDF2" }, N = e.assign({ hash: { name: "HMAC" } }, F), q = e.assign({ iterations: 1e3, hash: { name: "SHA-1" } }, F), G = ["deriveBits"], J = [8, 12, 16], Q = [16, 24, 32], X = 10, Y = [0, 0, 0, 0], $ = typeof h != k, tt = $ && h.subtle, et = $ && typeof tt != k, nt = T.bytes, st = class {
|
|
164
|
+
constructor(t2) {
|
|
165
|
+
const e2 = this;
|
|
166
|
+
e2.K = [[[], [], [], [], []], [[], [], [], [], []]], e2.K[0][0][0] || e2.j();
|
|
167
|
+
const n2 = e2.K[0][4], s2 = e2.K[1], o2 = t2.length;
|
|
168
|
+
let i2, a2, c2, l2 = 1;
|
|
169
|
+
if (4 !== o2 && 6 !== o2 && 8 !== o2) throw new r("invalid aes key size");
|
|
170
|
+
for (e2.k = [a2 = t2.slice(0), c2 = []], i2 = o2; 4 * o2 + 28 > i2; i2++) {
|
|
171
|
+
let t3 = a2[i2 - 1];
|
|
172
|
+
(i2 % o2 === 0 || 8 === o2 && i2 % o2 === 4) && (t3 = n2[t3 >>> 24] << 24 ^ n2[t3 >> 16 & 255] << 16 ^ n2[t3 >> 8 & 255] << 8 ^ n2[255 & t3], i2 % o2 === 0 && (t3 = t3 << 8 ^ t3 >>> 24 ^ l2 << 24, l2 = l2 << 1 ^ 283 * (l2 >> 7))), a2[i2] = a2[i2 - o2] ^ t3;
|
|
169
173
|
}
|
|
170
|
-
for (let
|
|
171
|
-
const
|
|
172
|
-
c2[
|
|
174
|
+
for (let t3 = 0; i2; t3++, i2--) {
|
|
175
|
+
const e3 = a2[3 & t3 ? i2 : i2 - 4];
|
|
176
|
+
c2[t3] = 4 >= i2 || 4 > t3 ? e3 : s2[0][n2[e3 >>> 24]] ^ s2[1][n2[e3 >> 16 & 255]] ^ s2[2][n2[e3 >> 8 & 255]] ^ s2[3][n2[255 & e3]];
|
|
173
177
|
}
|
|
174
178
|
}
|
|
175
|
-
encrypt(
|
|
176
|
-
return this.
|
|
177
|
-
}
|
|
178
|
-
decrypt(
|
|
179
|
-
return this.
|
|
180
|
-
}
|
|
181
|
-
|
|
182
|
-
const
|
|
183
|
-
let
|
|
184
|
-
for (let
|
|
185
|
-
for (let
|
|
186
|
-
let
|
|
187
|
-
|
|
188
|
-
let
|
|
189
|
-
for (let n3 = 0; 4 > n3; n3++)
|
|
179
|
+
encrypt(t2) {
|
|
180
|
+
return this.L(t2, 0);
|
|
181
|
+
}
|
|
182
|
+
decrypt(t2) {
|
|
183
|
+
return this.L(t2, 1);
|
|
184
|
+
}
|
|
185
|
+
j() {
|
|
186
|
+
const t2 = this.K[0], e2 = this.K[1], n2 = t2[4], s2 = e2[4], r2 = [], o2 = [];
|
|
187
|
+
let i2, a2, c2, l2;
|
|
188
|
+
for (let t3 = 0; 256 > t3; t3++) o2[(r2[t3] = t3 << 1 ^ 283 * (t3 >> 7)) ^ t3] = t3;
|
|
189
|
+
for (let f2 = i2 = 0; !n2[f2]; f2 ^= a2 || 1, i2 = o2[i2] || 1) {
|
|
190
|
+
let o3 = i2 ^ i2 << 1 ^ i2 << 2 ^ i2 << 3 ^ i2 << 4;
|
|
191
|
+
o3 = o3 >> 8 ^ 255 & o3 ^ 99, n2[f2] = o3, s2[o3] = f2, l2 = r2[c2 = r2[a2 = r2[f2]]];
|
|
192
|
+
let w2 = 16843009 * l2 ^ 65537 * c2 ^ 257 * a2 ^ 16843008 * f2, u2 = 257 * r2[o3] ^ 16843008 * o3;
|
|
193
|
+
for (let n3 = 0; 4 > n3; n3++) t2[n3][f2] = u2 = u2 << 24 ^ u2 >>> 8, e2[n3][o3] = w2 = w2 << 24 ^ w2 >>> 8;
|
|
190
194
|
}
|
|
191
|
-
for (let n3 = 0; 5 > n3; n3++)
|
|
195
|
+
for (let n3 = 0; 5 > n3; n3++) t2[n3] = t2[n3].slice(0), e2[n3] = e2[n3].slice(0);
|
|
192
196
|
}
|
|
193
|
-
|
|
194
|
-
if (4 !==
|
|
195
|
-
const n2 = this.
|
|
196
|
-
let
|
|
197
|
-
for (let
|
|
198
|
-
for (let
|
|
199
|
-
return
|
|
197
|
+
L(t2, e2) {
|
|
198
|
+
if (4 !== t2.length) throw new r("invalid aes block size");
|
|
199
|
+
const n2 = this.k[e2], s2 = n2.length / 4 - 2, o2 = [0, 0, 0, 0], i2 = this.K[e2], a2 = i2[0], c2 = i2[1], l2 = i2[2], f2 = i2[3], w2 = i2[4];
|
|
200
|
+
let u2, h2, p2, d2 = t2[0] ^ n2[0], y2 = t2[e2 ? 3 : 1] ^ n2[1], m2 = t2[2] ^ n2[2], g2 = t2[e2 ? 1 : 3] ^ n2[3], S2 = 4;
|
|
201
|
+
for (let t3 = 0; s2 > t3; t3++) u2 = a2[d2 >>> 24] ^ c2[y2 >> 16 & 255] ^ l2[m2 >> 8 & 255] ^ f2[255 & g2] ^ n2[S2], h2 = a2[y2 >>> 24] ^ c2[m2 >> 16 & 255] ^ l2[g2 >> 8 & 255] ^ f2[255 & d2] ^ n2[S2 + 1], p2 = a2[m2 >>> 24] ^ c2[g2 >> 16 & 255] ^ l2[d2 >> 8 & 255] ^ f2[255 & y2] ^ n2[S2 + 2], g2 = a2[g2 >>> 24] ^ c2[d2 >> 16 & 255] ^ l2[y2 >> 8 & 255] ^ f2[255 & m2] ^ n2[S2 + 3], S2 += 4, d2 = u2, y2 = h2, m2 = p2;
|
|
202
|
+
for (let t3 = 0; 4 > t3; t3++) o2[e2 ? 3 & -t3 : t3] = w2[d2 >>> 24] << 24 ^ w2[y2 >> 16 & 255] << 16 ^ w2[m2 >> 8 & 255] << 8 ^ w2[255 & g2] ^ n2[S2++], u2 = d2, d2 = y2, y2 = m2, m2 = g2, g2 = u2;
|
|
203
|
+
return o2;
|
|
200
204
|
}
|
|
201
|
-
},
|
|
202
|
-
constructor(
|
|
203
|
-
this.
|
|
205
|
+
}, rt = class {
|
|
206
|
+
constructor(t2, e2) {
|
|
207
|
+
this.O = t2, this.H = e2, this.Z = e2;
|
|
204
208
|
}
|
|
205
209
|
reset() {
|
|
206
|
-
this.
|
|
210
|
+
this.Z = this.H;
|
|
207
211
|
}
|
|
208
|
-
update(
|
|
209
|
-
return this.
|
|
212
|
+
update(t2) {
|
|
213
|
+
return this.F(this.O, t2, this.Z);
|
|
210
214
|
}
|
|
211
|
-
|
|
212
|
-
if (255 & ~(
|
|
215
|
+
N(t2) {
|
|
216
|
+
if (255 & ~(t2 >> 24)) t2 += 1 << 24;
|
|
213
217
|
else {
|
|
214
|
-
let
|
|
215
|
-
255 ===
|
|
218
|
+
let e2 = t2 >> 16 & 255, n2 = t2 >> 8 & 255, s2 = 255 & t2;
|
|
219
|
+
255 === e2 ? (e2 = 0, 255 === n2 ? (n2 = 0, 255 === s2 ? s2 = 0 : ++s2) : ++n2) : ++e2, t2 = 0, t2 += e2 << 16, t2 += n2 << 8, t2 += s2;
|
|
216
220
|
}
|
|
217
|
-
return
|
|
221
|
+
return t2;
|
|
218
222
|
}
|
|
219
|
-
|
|
220
|
-
0 === (
|
|
223
|
+
q(t2) {
|
|
224
|
+
0 === (t2[0] = this.N(t2[0])) && (t2[1] = this.N(t2[1]));
|
|
221
225
|
}
|
|
222
|
-
|
|
226
|
+
F(t2, e2, n2) {
|
|
223
227
|
let s2;
|
|
224
|
-
if (!(s2 =
|
|
225
|
-
const r2 =
|
|
228
|
+
if (!(s2 = e2.length)) return [];
|
|
229
|
+
const r2 = B.l(e2);
|
|
226
230
|
for (let r3 = 0; s2 > r3; r3 += 4) {
|
|
227
|
-
this.
|
|
228
|
-
const s3 =
|
|
229
|
-
|
|
231
|
+
this.q(n2);
|
|
232
|
+
const s3 = t2.encrypt(n2);
|
|
233
|
+
e2[r3] ^= s3[0], e2[r3 + 1] ^= s3[1], e2[r3 + 2] ^= s3[2], e2[r3 + 3] ^= s3[3];
|
|
230
234
|
}
|
|
231
|
-
return
|
|
235
|
+
return B.u(e2, r2);
|
|
232
236
|
}
|
|
233
|
-
},
|
|
234
|
-
let
|
|
235
|
-
class
|
|
236
|
-
constructor({ password:
|
|
237
|
+
}, ot = K.D;
|
|
238
|
+
let it = $ && et && typeof tt.importKey == v, at = $ && et && typeof tt.deriveBits == v;
|
|
239
|
+
class ct extends d {
|
|
240
|
+
constructor({ password: t2, rawPassword: e2, encryptionStrength: n2, checkPasswordOnly: s2 }) {
|
|
237
241
|
super({ start() {
|
|
238
|
-
|
|
239
|
-
}, async transform(
|
|
240
|
-
const n3 = this, { password:
|
|
241
|
-
|
|
242
|
-
const
|
|
243
|
-
if (
|
|
244
|
-
})(n3,
|
|
245
|
-
const
|
|
246
|
-
|
|
247
|
-
}, async flush(
|
|
248
|
-
const {
|
|
249
|
-
if (
|
|
250
|
-
await
|
|
251
|
-
const
|
|
252
|
-
let
|
|
253
|
-
if (
|
|
254
|
-
const
|
|
255
|
-
|
|
256
|
-
const
|
|
257
|
-
|
|
242
|
+
ft(this, t2, e2, n2);
|
|
243
|
+
}, async transform(t3, e3) {
|
|
244
|
+
const n3 = this, { password: i2, strength: a2, G: c2, ready: l2 } = n3;
|
|
245
|
+
i2 ? (await (async (t4, e4, n4, s3) => {
|
|
246
|
+
const o2 = await ut(t4, e4, n4, dt(s3, 0, J[e4])), i3 = dt(s3, J[e4]);
|
|
247
|
+
if (o2[0] != i3[0] || o2[1] != i3[1]) throw new r(E);
|
|
248
|
+
})(n3, a2, i2, dt(t3, 0, J[a2] + 2)), t3 = dt(t3, J[a2] + 2), s2 ? e3.error(new r(O)) : c2()) : await l2;
|
|
249
|
+
const f2 = new o(t3.length - X - (t3.length - X) % Z);
|
|
250
|
+
e3.enqueue(wt(n3, t3, f2, 0, X, true));
|
|
251
|
+
}, async flush(t3) {
|
|
252
|
+
const { J: e3, X: n3, pending: s3, ready: o2 } = this;
|
|
253
|
+
if (n3 && e3) {
|
|
254
|
+
await o2;
|
|
255
|
+
const i2 = dt(s3, 0, s3.length - X), a2 = dt(s3, s3.length - X);
|
|
256
|
+
let c2 = z;
|
|
257
|
+
if (i2.length) {
|
|
258
|
+
const t4 = mt(nt, i2);
|
|
259
|
+
n3.update(t4);
|
|
260
|
+
const s4 = e3.update(t4);
|
|
261
|
+
c2 = yt(nt, s4);
|
|
258
262
|
}
|
|
259
|
-
|
|
260
|
-
|
|
261
|
-
|
|
262
|
-
|
|
263
|
-
|
|
263
|
+
const l2 = dt(yt(nt, n3.digest()), 0, X);
|
|
264
|
+
let f2 = s3.length < X ? 1 : 0;
|
|
265
|
+
for (let t4 = 0; X > t4; t4++) f2 |= l2[t4] ^ a2[t4];
|
|
266
|
+
if (f2) throw new r(L);
|
|
267
|
+
t3.enqueue(c2);
|
|
264
268
|
}
|
|
265
269
|
} });
|
|
266
270
|
}
|
|
267
271
|
}
|
|
268
|
-
class
|
|
269
|
-
constructor({ password:
|
|
270
|
-
let
|
|
272
|
+
class lt extends d {
|
|
273
|
+
constructor({ password: t2, rawPassword: e2, encryptionStrength: n2 }) {
|
|
274
|
+
let s2;
|
|
271
275
|
super({ start() {
|
|
272
|
-
|
|
273
|
-
}, async transform(
|
|
274
|
-
const n3 = this, { password: s3, strength:
|
|
275
|
-
let c2 =
|
|
276
|
-
s3 ? (c2 = await (async (
|
|
277
|
-
const s4 =
|
|
278
|
-
return
|
|
279
|
-
})(n3,
|
|
280
|
-
const l2 = new
|
|
281
|
-
l2.set(c2, 0),
|
|
282
|
-
}, async flush(
|
|
283
|
-
const {
|
|
284
|
-
if (n3 &&
|
|
285
|
-
await
|
|
286
|
-
let
|
|
287
|
-
if (
|
|
288
|
-
const
|
|
289
|
-
n3.update(
|
|
276
|
+
ft(this, t2, e2, n2);
|
|
277
|
+
}, async transform(t3, e3) {
|
|
278
|
+
const n3 = this, { password: s3, strength: r2, G: i2, ready: a2 } = n3;
|
|
279
|
+
let c2 = z;
|
|
280
|
+
s3 ? (c2 = await (async (t4, e4, n4) => {
|
|
281
|
+
const s4 = H(new o(J[e4]));
|
|
282
|
+
return pt(s4, await ut(t4, e4, n4, s4));
|
|
283
|
+
})(n3, r2, s3), i2()) : await a2;
|
|
284
|
+
const l2 = new o(c2.length + t3.length - t3.length % Z);
|
|
285
|
+
l2.set(c2, 0), e3.enqueue(wt(n3, t3, l2, c2.length, 0));
|
|
286
|
+
}, async flush(t3) {
|
|
287
|
+
const { J: e3, X: n3, pending: r2, ready: o2 } = this;
|
|
288
|
+
if (n3 && e3) {
|
|
289
|
+
await o2;
|
|
290
|
+
let i2 = z;
|
|
291
|
+
if (r2.length) {
|
|
292
|
+
const t4 = e3.update(mt(nt, r2));
|
|
293
|
+
n3.update(t4), i2 = yt(nt, t4);
|
|
290
294
|
}
|
|
291
|
-
|
|
295
|
+
s2.signature = yt(nt, n3.digest()).slice(0, X), t3.enqueue(pt(i2, s2.signature));
|
|
292
296
|
}
|
|
293
|
-
} }),
|
|
297
|
+
} }), s2 = this;
|
|
294
298
|
}
|
|
295
299
|
}
|
|
296
|
-
function
|
|
297
|
-
|
|
298
|
-
|
|
299
|
-
|
|
300
|
-
|
|
301
|
-
|
|
302
|
-
|
|
300
|
+
function ft(t2, n2, s2, r2) {
|
|
301
|
+
e.assign(t2, { ready: new w((e2) => t2.G = e2), password: ht(n2, s2), strength: r2 - 1, pending: z });
|
|
302
|
+
}
|
|
303
|
+
function wt(t2, e2, n2, s2, r2, i2) {
|
|
304
|
+
const { J: a2, X: c2, pending: l2 } = t2;
|
|
305
|
+
l2.length && (e2 = pt(l2, e2));
|
|
306
|
+
const f2 = e2.length - r2;
|
|
307
|
+
let w2;
|
|
308
|
+
for (n2 = ((t3, e3) => {
|
|
309
|
+
if (e3 && e3 > t3.length) {
|
|
310
|
+
const n3 = t3;
|
|
311
|
+
(t3 = new o(e3)).set(n3, 0);
|
|
303
312
|
}
|
|
304
|
-
return
|
|
305
|
-
})(n2,
|
|
306
|
-
const
|
|
307
|
-
|
|
308
|
-
const r3 =
|
|
309
|
-
|
|
313
|
+
return t3;
|
|
314
|
+
})(n2, s2 + (f2 - f2 % Z)), w2 = 0; f2 - Z >= w2; w2 += Z) {
|
|
315
|
+
const t3 = mt(nt, dt(e2, w2, w2 + Z));
|
|
316
|
+
i2 && c2.update(t3);
|
|
317
|
+
const r3 = a2.update(t3);
|
|
318
|
+
i2 || c2.update(r3), n2.set(yt(nt, r3), w2 + s2);
|
|
310
319
|
}
|
|
311
|
-
return
|
|
320
|
+
return t2.pending = dt(e2, w2), n2;
|
|
312
321
|
}
|
|
313
|
-
async function
|
|
322
|
+
async function ut(n2, s2, r2, i2) {
|
|
314
323
|
n2.password = null;
|
|
315
|
-
const
|
|
316
|
-
if (!
|
|
324
|
+
const a2 = await (async (t2, e2, n3, s3, r3) => {
|
|
325
|
+
if (!it) return K.importKey(e2);
|
|
317
326
|
try {
|
|
318
|
-
return await
|
|
327
|
+
return await tt.importKey("raw", e2, n3, false, r3);
|
|
319
328
|
} catch {
|
|
320
|
-
return
|
|
329
|
+
return it = false, K.importKey(e2);
|
|
321
330
|
}
|
|
322
|
-
})(0, r2,
|
|
323
|
-
if (
|
|
331
|
+
})(0, r2, N, 0, G), c2 = await (async (t2, e2, n3) => {
|
|
332
|
+
if (!at) return K.M(e2, t2.salt, q.iterations, n3);
|
|
324
333
|
try {
|
|
325
|
-
return await
|
|
334
|
+
return await tt.deriveBits(t2, e2, n3);
|
|
326
335
|
} catch {
|
|
327
|
-
return
|
|
336
|
+
return at = false, K.M(e2, t2.salt, q.iterations, n3);
|
|
328
337
|
}
|
|
329
|
-
})(
|
|
330
|
-
return
|
|
331
|
-
}
|
|
332
|
-
function
|
|
333
|
-
return
|
|
334
|
-
if (typeof
|
|
335
|
-
const
|
|
336
|
-
for (let n2 = 0; n2 <
|
|
337
|
-
return
|
|
338
|
+
})(e.assign({ salt: i2 }, q), a2, 8 * (2 * Q[s2] + 2)), l2 = new o(c2), f2 = mt(nt, dt(l2, 0, Q[s2])), w2 = mt(nt, dt(l2, Q[s2], 2 * Q[s2])), u2 = dt(l2, 2 * Q[s2]);
|
|
339
|
+
return e.assign(n2, { keys: { key: f2, Y: w2, passwordVerification: u2 }, J: new rt(new st(f2), t.from(Y)), X: new ot(w2) }), u2;
|
|
340
|
+
}
|
|
341
|
+
function ht(t2, e2) {
|
|
342
|
+
return e2 === b ? ((t3) => {
|
|
343
|
+
if (typeof u == k) {
|
|
344
|
+
const e3 = new o((t3 = unescape(encodeURIComponent(t3))).length);
|
|
345
|
+
for (let n2 = 0; n2 < e3.length; n2++) e3[n2] = t3.charCodeAt(n2);
|
|
346
|
+
return e3;
|
|
338
347
|
}
|
|
339
|
-
return new
|
|
340
|
-
})(
|
|
348
|
+
return new u().encode(t3);
|
|
349
|
+
})(t2) : e2;
|
|
341
350
|
}
|
|
342
|
-
function
|
|
343
|
-
let n2 =
|
|
344
|
-
return
|
|
351
|
+
function pt(t2, e2) {
|
|
352
|
+
let n2 = t2;
|
|
353
|
+
return t2.length + e2.length && (n2 = new o(t2.length + e2.length), n2.set(t2, 0), n2.set(e2, t2.length)), n2;
|
|
345
354
|
}
|
|
346
|
-
function
|
|
347
|
-
return
|
|
355
|
+
function dt(t2, e2, n2) {
|
|
356
|
+
return t2.subarray(e2, n2);
|
|
348
357
|
}
|
|
349
|
-
function
|
|
350
|
-
return
|
|
358
|
+
function yt(t2, e2) {
|
|
359
|
+
return t2.p(e2);
|
|
351
360
|
}
|
|
352
|
-
function
|
|
353
|
-
return
|
|
361
|
+
function mt(t2, e2) {
|
|
362
|
+
return t2.m(e2);
|
|
354
363
|
}
|
|
355
|
-
class
|
|
356
|
-
constructor({ password: e2, passwordVerification: n2, checkPasswordOnly: s2 }) {
|
|
364
|
+
class gt extends d {
|
|
365
|
+
constructor({ password: t2, rawPassword: e2, passwordVerification: n2, checkPasswordOnly: s2 }) {
|
|
357
366
|
super({ start() {
|
|
358
|
-
|
|
359
|
-
}, transform(
|
|
367
|
+
bt(this, t2, e2, n2);
|
|
368
|
+
}, transform(t3, e3) {
|
|
360
369
|
const n3 = this;
|
|
361
|
-
if (n3.password) {
|
|
362
|
-
const
|
|
363
|
-
if (n3.password = null,
|
|
364
|
-
|
|
370
|
+
if (n3.password || n3.rawPassword) {
|
|
371
|
+
const e4 = kt(n3, t3.subarray(0, 12));
|
|
372
|
+
if (n3.password = n3.rawPassword = null, 0 != (e4.at(-1) ^ n3.passwordVerification)) throw new r(E);
|
|
373
|
+
t3 = t3.subarray(12);
|
|
365
374
|
}
|
|
366
|
-
s2 ?
|
|
375
|
+
s2 ? e3.error(new r(O)) : e3.enqueue(kt(n3, t3));
|
|
367
376
|
} });
|
|
368
377
|
}
|
|
369
378
|
}
|
|
370
|
-
class
|
|
371
|
-
constructor({ password: e2, passwordVerification: n2 }) {
|
|
379
|
+
class St extends d {
|
|
380
|
+
constructor({ password: t2, rawPassword: e2, passwordVerification: n2 }) {
|
|
372
381
|
super({ start() {
|
|
373
|
-
|
|
374
|
-
}, transform(
|
|
382
|
+
bt(this, t2, e2, n2);
|
|
383
|
+
}, transform(t3, e3) {
|
|
375
384
|
const n3 = this;
|
|
376
385
|
let s2, r2;
|
|
377
|
-
if (n3.password) {
|
|
378
|
-
n3.password = null;
|
|
379
|
-
const
|
|
380
|
-
|
|
381
|
-
} else s2 = new
|
|
382
|
-
s2.set(
|
|
386
|
+
if (n3.password || n3.rawPassword) {
|
|
387
|
+
n3.password = n3.rawPassword = null;
|
|
388
|
+
const e4 = H(new o(12));
|
|
389
|
+
e4[11] = n3.passwordVerification, s2 = new o(t3.length + e4.length), s2.set(vt(n3, e4), 0), r2 = 12;
|
|
390
|
+
} else s2 = new o(t3.length), r2 = 0;
|
|
391
|
+
s2.set(vt(n3, t3), r2), e3.enqueue(s2);
|
|
383
392
|
} });
|
|
384
393
|
}
|
|
385
394
|
}
|
|
386
|
-
function
|
|
387
|
-
|
|
388
|
-
|
|
389
|
-
|
|
395
|
+
function bt(t2, n2, s2, r2) {
|
|
396
|
+
e.assign(t2, { password: n2, rawPassword: s2, passwordVerification: r2 }), ((t3, n3, s3) => {
|
|
397
|
+
const r3 = [305419896, 591751049, 878082192];
|
|
398
|
+
if (e.assign(t3, { keys: r3, $: new M(r3[0]), tt: new M(r3[2]) }), s3) for (let e2 = 0; e2 < s3.length; e2++) zt(t3, s3[e2]);
|
|
399
|
+
else for (let e2 = 0; e2 < n3.length; e2++) zt(t3, n3.charCodeAt(e2));
|
|
400
|
+
})(t2, n2, s2);
|
|
390
401
|
}
|
|
391
|
-
function
|
|
392
|
-
const n2 = new
|
|
393
|
-
for (let s2 = 0; s2 <
|
|
402
|
+
function kt(t2, e2) {
|
|
403
|
+
const n2 = new o(e2.length);
|
|
404
|
+
for (let s2 = 0; s2 < e2.length; s2++) n2[s2] = Ct(t2) ^ e2[s2], zt(t2, n2[s2]);
|
|
394
405
|
return n2;
|
|
395
406
|
}
|
|
396
|
-
function
|
|
397
|
-
const
|
|
398
|
-
|
|
399
|
-
|
|
407
|
+
function vt(t2, e2) {
|
|
408
|
+
const n2 = new o(e2.length);
|
|
409
|
+
for (let s2 = 0; s2 < e2.length; s2++) n2[s2] = Ct(t2) ^ e2[s2], zt(t2, e2[s2]);
|
|
410
|
+
return n2;
|
|
400
411
|
}
|
|
401
|
-
function
|
|
402
|
-
let [
|
|
403
|
-
|
|
412
|
+
function zt(t2, e2) {
|
|
413
|
+
let [, n2] = t2.keys;
|
|
414
|
+
t2.$.append([e2]);
|
|
415
|
+
const r2 = ~t2.$.get();
|
|
416
|
+
n2 = At(s.imul(At(n2 + It(r2)), 134775813) + 1), t2.tt.append([n2 >>> 24]);
|
|
417
|
+
const o2 = ~t2.tt.get();
|
|
418
|
+
t2.keys = [r2, n2, o2];
|
|
404
419
|
}
|
|
405
|
-
function
|
|
406
|
-
const
|
|
407
|
-
return
|
|
420
|
+
function Ct(t2) {
|
|
421
|
+
const e2 = 2 | t2.keys[2];
|
|
422
|
+
return It(s.imul(e2, 1 ^ e2) >>> 8);
|
|
408
423
|
}
|
|
409
|
-
function
|
|
410
|
-
return 255 &
|
|
424
|
+
function It(t2) {
|
|
425
|
+
return 255 & t2;
|
|
411
426
|
}
|
|
412
|
-
function
|
|
413
|
-
return 4294967295 &
|
|
427
|
+
function At(t2) {
|
|
428
|
+
return 4294967295 & t2;
|
|
414
429
|
}
|
|
415
|
-
class
|
|
416
|
-
constructor(
|
|
430
|
+
class xt extends d {
|
|
431
|
+
constructor(t2, { chunkSize: e2, CompressionStreamZlib: n2, CompressionStream: s2 }) {
|
|
417
432
|
super({});
|
|
418
|
-
const { compressed: r2, encrypted:
|
|
419
|
-
let
|
|
420
|
-
|
|
421
|
-
|
|
422
|
-
|
|
433
|
+
const { compressed: r2, encrypted: o2, useCompressionStream: i2, zipCrypto: a2, signed: c2, level: l2, deflate64: w2 } = t2, u2 = this;
|
|
434
|
+
let h2, p2, d2, y2 = super.readable;
|
|
435
|
+
const m2 = c2 && r2 && !w2 && (!o2 || a2) && !(!i2 || !s2);
|
|
436
|
+
o2 && !a2 || !c2 || m2 || (h2 = new _(), y2 = Dt(y2, h2)), r2 && (m2 ? (d2 = new Pt(), y2 = Mt(y2, new s2("gzip")), y2 = Dt(y2, d2)) : y2 = Wt(y2, i2, { level: l2, chunkSize: e2 }, s2, n2, s2)), o2 && (a2 ? y2 = Dt(y2, new St(t2)) : (p2 = new lt(t2), y2 = Dt(y2, p2))), Ut(u2, y2, () => {
|
|
437
|
+
let t3;
|
|
438
|
+
o2 && !a2 && (t3 = p2.signature), o2 && !a2 || !c2 || (t3 = m2 ? d2.signature : new f(h2.value.buffer).getUint32(0)), u2.signature = t3;
|
|
423
439
|
});
|
|
424
440
|
}
|
|
425
441
|
}
|
|
426
|
-
class
|
|
427
|
-
constructor(
|
|
442
|
+
class Pt extends d {
|
|
443
|
+
constructor() {
|
|
444
|
+
let t2, e2 = 10, n2 = new o(0);
|
|
445
|
+
super({ transform(t3, r2) {
|
|
446
|
+
if (e2) {
|
|
447
|
+
const n3 = s.min(e2, t3.length);
|
|
448
|
+
if (e2 -= n3, !(t3 = t3.subarray(n3)).length) return;
|
|
449
|
+
}
|
|
450
|
+
const i2 = n2.length + t3.length;
|
|
451
|
+
if (8 >= i2) {
|
|
452
|
+
const e3 = new o(i2);
|
|
453
|
+
return e3.set(n2), e3.set(t3, n2.length), void (n2 = e3);
|
|
454
|
+
}
|
|
455
|
+
const a2 = i2 - 8, c2 = new o(a2), l2 = s.min(a2, n2.length);
|
|
456
|
+
c2.set(n2.subarray(0, l2), 0), a2 > l2 && c2.set(t3.subarray(0, a2 - l2), l2), r2.enqueue(c2);
|
|
457
|
+
const f2 = new o(8), w2 = n2.length - l2;
|
|
458
|
+
w2 && f2.set(n2.subarray(l2), 0), f2.set(t3.subarray(a2 - l2), w2), n2 = f2;
|
|
459
|
+
}, flush() {
|
|
460
|
+
const e3 = new f(n2.buffer, n2.byteOffset, n2.byteLength);
|
|
461
|
+
t2.signature = e3.getUint32(0, true), t2.uncompressedSize = e3.getUint32(4, true);
|
|
462
|
+
} }), t2 = this;
|
|
463
|
+
}
|
|
464
|
+
}
|
|
465
|
+
class Rt extends d {
|
|
466
|
+
constructor(t2, { chunkSize: e2, DecompressionStreamZlib: n2, DecompressionStream: s2 }) {
|
|
428
467
|
super({});
|
|
429
|
-
const { zipCrypto:
|
|
430
|
-
let p2, d2
|
|
431
|
-
|
|
432
|
-
|
|
433
|
-
|
|
434
|
-
|
|
468
|
+
const { zipCrypto: o2, encrypted: i2, signed: a2, signature: c2, compressed: l2, useCompressionStream: w2, deflate64: u2 } = t2;
|
|
469
|
+
let h2, p2, d2 = super.readable;
|
|
470
|
+
i2 && (o2 ? d2 = Dt(d2, new gt(t2)) : (p2 = new ct(t2), d2 = Dt(d2, p2))), l2 && (d2 = Wt(d2, w2, { chunkSize: e2, deflate64: u2 }, s2, n2, s2), d2 = ((t3) => {
|
|
471
|
+
const e3 = t3.getReader();
|
|
472
|
+
return new y({ async pull(t4) {
|
|
473
|
+
let n3;
|
|
474
|
+
try {
|
|
475
|
+
n3 = await e3.read();
|
|
476
|
+
} catch (t5) {
|
|
477
|
+
if (t5 && t5.message) throw t5;
|
|
478
|
+
const e4 = new r("Invalid compressed data");
|
|
479
|
+
throw e4.cause = t5, e4;
|
|
480
|
+
}
|
|
481
|
+
const { value: s3, done: o3 } = n3;
|
|
482
|
+
o3 ? t4.close() : t4.enqueue(s3);
|
|
483
|
+
}, cancel: (t4) => e3.cancel(t4) });
|
|
484
|
+
})(d2)), i2 && !o2 || !a2 || (h2 = new _(), d2 = Dt(d2, h2)), Ut(this, d2, () => {
|
|
485
|
+
if ((!i2 || o2) && a2) {
|
|
486
|
+
const t3 = new f(h2.value.buffer);
|
|
487
|
+
if (c2 != t3.getUint32(0, false)) throw new r(L);
|
|
435
488
|
}
|
|
436
489
|
});
|
|
437
490
|
}
|
|
438
491
|
}
|
|
439
|
-
function
|
|
440
|
-
n2 =
|
|
492
|
+
function Ut(t2, n2, s2) {
|
|
493
|
+
n2 = Dt(n2, new d({ flush: s2 })), e.defineProperty(t2, "readable", { get: () => n2 });
|
|
441
494
|
}
|
|
442
|
-
function
|
|
443
|
-
const
|
|
495
|
+
function Wt(t2, e2, n2, s2, r2, o2) {
|
|
496
|
+
const i2 = e2 && s2 ? s2 : r2 || o2, a2 = n2.deflate64 ? "deflate64-raw" : "deflate-raw";
|
|
497
|
+
let c2;
|
|
444
498
|
try {
|
|
445
|
-
|
|
446
|
-
} catch (
|
|
447
|
-
if (!
|
|
448
|
-
if (r2)
|
|
499
|
+
c2 = new i2(a2, n2);
|
|
500
|
+
} catch (t3) {
|
|
501
|
+
if (!e2) throw t3;
|
|
502
|
+
if (r2) c2 = new r2(a2, n2);
|
|
449
503
|
else {
|
|
450
|
-
if (!
|
|
451
|
-
|
|
504
|
+
if (!o2) throw t3;
|
|
505
|
+
c2 = new o2(a2, n2);
|
|
452
506
|
}
|
|
453
507
|
}
|
|
454
|
-
return
|
|
508
|
+
return Mt(t2, c2);
|
|
509
|
+
}
|
|
510
|
+
function Dt(t2, e2) {
|
|
511
|
+
return t2.pipeThrough(e2);
|
|
455
512
|
}
|
|
456
|
-
function
|
|
457
|
-
|
|
513
|
+
function Mt(t2, e2) {
|
|
514
|
+
const n2 = e2.writable.getWriter(), s2 = t2.getReader();
|
|
515
|
+
return (async () => {
|
|
516
|
+
try {
|
|
517
|
+
for (; ; ) {
|
|
518
|
+
await n2.ready;
|
|
519
|
+
const t3 = await s2.read();
|
|
520
|
+
if (t3.done) {
|
|
521
|
+
await n2.close();
|
|
522
|
+
break;
|
|
523
|
+
}
|
|
524
|
+
await n2.write(t3.value);
|
|
525
|
+
}
|
|
526
|
+
} catch (t3) {
|
|
527
|
+
await (async (t4, e3) => {
|
|
528
|
+
try {
|
|
529
|
+
await t4.abort(e3);
|
|
530
|
+
} catch {
|
|
531
|
+
}
|
|
532
|
+
})(n2, t3), await (async (t4, e3) => {
|
|
533
|
+
try {
|
|
534
|
+
await t4.cancel(e3);
|
|
535
|
+
} catch {
|
|
536
|
+
}
|
|
537
|
+
})(s2, t3);
|
|
538
|
+
}
|
|
539
|
+
})(), e2.readable;
|
|
458
540
|
}
|
|
459
|
-
const
|
|
460
|
-
class
|
|
461
|
-
constructor(
|
|
541
|
+
const _t = "data", Bt = "close";
|
|
542
|
+
class Tt extends d {
|
|
543
|
+
constructor(t2, n2) {
|
|
462
544
|
super({});
|
|
463
|
-
const s2 = this, { codecType:
|
|
464
|
-
let
|
|
465
|
-
|
|
466
|
-
let
|
|
467
|
-
const c2 = new
|
|
468
|
-
|
|
545
|
+
const s2 = this, { codecType: o2 } = t2;
|
|
546
|
+
let i2;
|
|
547
|
+
o2.startsWith("deflate") ? i2 = xt : o2.startsWith("inflate") && (i2 = Rt), s2.outputSize = 0;
|
|
548
|
+
let a2 = 0;
|
|
549
|
+
const c2 = new i2(t2, n2), l2 = super.readable, f2 = new d({ transform(t3, e2) {
|
|
550
|
+
t3 && t3.length && (a2 += t3.length, e2.enqueue(t3));
|
|
469
551
|
}, flush() {
|
|
470
|
-
|
|
471
|
-
} }),
|
|
472
|
-
if (
|
|
552
|
+
e.assign(s2, { inputSize: a2 });
|
|
553
|
+
} }), w2 = new d({ transform(e2, n3) {
|
|
554
|
+
if (e2 && e2.length && (n3.enqueue(e2), s2.outputSize += e2.length, t2.outputSize !== b && s2.outputSize > t2.outputSize)) throw new r("Invalid uncompressed size");
|
|
473
555
|
}, flush() {
|
|
474
|
-
const { signature:
|
|
475
|
-
|
|
556
|
+
const { signature: t3 } = c2;
|
|
557
|
+
e.assign(s2, { signature: t3, inputSize: a2 });
|
|
476
558
|
} });
|
|
477
|
-
|
|
559
|
+
e.defineProperty(s2, "readable", { get: () => l2.pipeThrough(f2).pipeThrough(c2).pipeThrough(w2) });
|
|
478
560
|
}
|
|
479
561
|
}
|
|
480
|
-
class
|
|
481
|
-
constructor(
|
|
482
|
-
let
|
|
483
|
-
super({ transform:
|
|
484
|
-
if (
|
|
485
|
-
const
|
|
486
|
-
|
|
562
|
+
class Vt extends d {
|
|
563
|
+
constructor(t2) {
|
|
564
|
+
let e2;
|
|
565
|
+
1 > t2 && (t2 = 65536), super({ transform: (n2, s2) => {
|
|
566
|
+
if (e2) {
|
|
567
|
+
const t3 = new o(e2.length + n2.length);
|
|
568
|
+
t3.set(e2), t3.set(n2, e2.length), n2 = t3, e2 = null;
|
|
487
569
|
}
|
|
488
|
-
|
|
489
|
-
|
|
490
|
-
|
|
570
|
+
let r2 = 0;
|
|
571
|
+
for (; n2.length - r2 > t2; ) s2.enqueue(n2.slice(r2, r2 + t2)), r2 += t2;
|
|
572
|
+
e2 = r2 ? n2.slice(r2) : n2;
|
|
573
|
+
}, flush(t3) {
|
|
574
|
+
e2 && e2.length && t3.enqueue(e2);
|
|
491
575
|
} });
|
|
492
576
|
}
|
|
493
577
|
}
|
|
494
|
-
|
|
495
|
-
|
|
496
|
-
|
|
578
|
+
let Kt = 2;
|
|
579
|
+
try {
|
|
580
|
+
typeof navigator != k && navigator.hardwareConcurrency && (Kt = navigator.hardwareConcurrency);
|
|
581
|
+
} catch {
|
|
582
|
+
}
|
|
583
|
+
const jt = { workerURI: "./core/web-worker-wasm.js", wasmURI: "./core/streams/zlib-wasm/zlib-streams.wasm", chunkSize: 65536, maxWorkers: Kt, terminateWorkerTimeout: 5e3, workerStarvationTimeout: 5e3, useWebWorkers: true, useCompressionStream: true, CompressionStream: typeof g != k && g, DecompressionStream: typeof S != k && S };
|
|
584
|
+
e.assign({}, jt);
|
|
585
|
+
const Et = new l(), Lt = new l();
|
|
586
|
+
let Ot, Ht, Zt, Ft, Nt, qt = 0;
|
|
587
|
+
async function Gt(t2) {
|
|
588
|
+
let e2, r2;
|
|
497
589
|
try {
|
|
498
|
-
const { options:
|
|
499
|
-
if (!
|
|
500
|
-
await self.initModule(
|
|
590
|
+
const { options: o2, config: i2 } = t2;
|
|
591
|
+
if (!o2.useCompressionStream) try {
|
|
592
|
+
await self.initModule(t2.config);
|
|
501
593
|
} catch {
|
|
502
|
-
|
|
594
|
+
o2.useCompressionStream = true;
|
|
503
595
|
}
|
|
504
|
-
|
|
505
|
-
const
|
|
506
|
-
const
|
|
507
|
-
|
|
508
|
-
const { value:
|
|
509
|
-
|
|
510
|
-
} },
|
|
511
|
-
|
|
512
|
-
|
|
513
|
-
|
|
514
|
-
|
|
515
|
-
|
|
516
|
-
const { signal:
|
|
517
|
-
await
|
|
518
|
-
const { signature:
|
|
519
|
-
|
|
520
|
-
} catch (
|
|
521
|
-
|
|
522
|
-
|
|
523
|
-
|
|
524
|
-
|
|
525
|
-
|
|
526
|
-
|
|
527
|
-
|
|
596
|
+
i2.CompressionStream = self.CompressionStream, i2.DecompressionStream = self.DecompressionStream;
|
|
597
|
+
const a2 = { highWaterMark: 1 }, c2 = t2.readable || new y({ async pull(t3) {
|
|
598
|
+
const e3 = new w((t4) => Et.set(qt, t4));
|
|
599
|
+
Jt({ type: "pull", messageId: qt }), qt = (qt + 1) % n.MAX_SAFE_INTEGER;
|
|
600
|
+
const { value: s2, done: r3 } = await e3;
|
|
601
|
+
t3.enqueue(s2), r3 && t3.close();
|
|
602
|
+
} }, a2);
|
|
603
|
+
r2 = t2.writable || new m({ async write(t3) {
|
|
604
|
+
let e3;
|
|
605
|
+
const s2 = new w((t4) => e3 = t4);
|
|
606
|
+
Lt.set(qt, e3), Jt({ type: _t, value: t3, messageId: qt }), qt = (qt + 1) % n.MAX_SAFE_INTEGER, await s2;
|
|
607
|
+
} }, a2), e2 = new Tt(o2, i2), Ot = new AbortController();
|
|
608
|
+
const { signal: l2 } = Ot;
|
|
609
|
+
await c2.pipeThrough(e2).pipeThrough(new Vt(((t3) => s.max(t3.chunkSize, 64))(i2))).pipeTo(r2, { signal: l2, preventClose: true, preventAbort: true }), await r2.getWriter().close();
|
|
610
|
+
const { signature: f2, inputSize: u2, outputSize: h2 } = e2;
|
|
611
|
+
Jt({ type: Bt, result: { signature: f2, inputSize: u2, outputSize: h2 } });
|
|
612
|
+
} catch (t3) {
|
|
613
|
+
if (t3.outputSize = e2 ? e2.outputSize : 0, r2 && !r2.locked) try {
|
|
614
|
+
await r2.getWriter().close();
|
|
615
|
+
} catch {
|
|
616
|
+
}
|
|
617
|
+
Qt(t3);
|
|
618
|
+
}
|
|
619
|
+
}
|
|
620
|
+
function Jt(t2) {
|
|
621
|
+
let { value: e2 } = t2;
|
|
622
|
+
if (e2) if (e2.length) try {
|
|
623
|
+
e2 = new o(e2), t2.value = e2.buffer, p(t2, [t2.value]);
|
|
528
624
|
} catch {
|
|
529
|
-
|
|
625
|
+
p(t2);
|
|
530
626
|
}
|
|
531
|
-
else
|
|
532
|
-
else
|
|
627
|
+
else p(t2);
|
|
628
|
+
else p(t2);
|
|
533
629
|
}
|
|
534
|
-
function
|
|
535
|
-
const { message:
|
|
536
|
-
|
|
630
|
+
function Qt(t2 = new r("Unknown error")) {
|
|
631
|
+
const { message: e2, stack: n2, code: s2, name: o2, outputSize: i2 } = t2;
|
|
632
|
+
p({ error: { message: e2, stack: n2, code: s2, name: o2, outputSize: i2 } });
|
|
537
633
|
}
|
|
538
|
-
function
|
|
539
|
-
const
|
|
540
|
-
return new
|
|
541
|
-
let n3;
|
|
542
|
-
if (this.out = qe(o2), this.in = qe(c2), this.inBufferSize = c2, this._scratch = new i(o2), e2 ? (this._process = Ie.deflate_process, this._last_consumed = Ie.deflate_last_consumed, this._end = Ie.deflate_end, this.streamHandle = Ie.deflate_new(), n3 = "gzip" === t2 ? Ie.deflate_init_gzip(this.streamHandle, a2) : "deflate-raw" === t2 ? Ie.deflate_init_raw(this.streamHandle, a2) : Ie.deflate_init(this.streamHandle, a2)) : "deflate64-raw" === t2 ? (this._process = Ie.inflate9_process, this._last_consumed = Ie.inflate9_last_consumed, this._end = Ie.inflate9_end, this.streamHandle = Ie.inflate9_new(), n3 = Ie.inflate9_init_raw(this.streamHandle)) : (this._process = Ie.inflate_process, this._last_consumed = Ie.inflate_last_consumed, this._end = Ie.inflate_end, this.streamHandle = Ie.inflate_new(), n3 = "deflate-raw" === t2 ? Ie.inflate_init_raw(this.streamHandle) : "gzip" === t2 ? Ie.inflate_init_gzip(this.streamHandle) : Ie.inflate_init(this.streamHandle)), 0 !== n3) throw new r("init failed:" + n3);
|
|
543
|
-
}, transform(t3, n3) {
|
|
634
|
+
function Xt(t2, e2, n2 = {}) {
|
|
635
|
+
const i2 = "number" == typeof n2.level ? n2.level : -1, a2 = "number" == typeof n2.outBuffer ? n2.outBuffer : 65536, c2 = "number" == typeof n2.inBufferSize ? n2.inBufferSize : 65536;
|
|
636
|
+
return new d({ start() {
|
|
544
637
|
try {
|
|
545
|
-
|
|
546
|
-
|
|
547
|
-
|
|
548
|
-
|
|
549
|
-
|
|
550
|
-
|
|
551
|
-
|
|
552
|
-
|
|
553
|
-
|
|
638
|
+
let n3;
|
|
639
|
+
if (this.et = Zt(a2), this.in = Zt(c2), this.inBufferSize = c2, !this.et || !this.in) throw new r("allocation failed");
|
|
640
|
+
if (this.nt = new o(a2), t2 ? (this.st = Ht.deflate_process, this.rt = Ht.deflate_last_consumed, this.ot = Ht.deflate_end, this.it = Ht.deflate_new(), n3 = "gzip" === e2 ? Ht.deflate_init_gzip(this.it, i2) : "deflate-raw" === e2 ? Ht.deflate_init_raw(this.it, i2) : Ht.deflate_init(this.it, i2)) : "deflate64-raw" === e2 ? (this.st = Ht.inflate9_process, this.rt = Ht.inflate9_last_consumed, this.ot = Ht.inflate9_end, this.it = Ht.inflate9_new(), n3 = Ht.inflate9_init_raw(this.it)) : (this.st = Ht.inflate_process, this.rt = Ht.inflate_last_consumed, this.ot = Ht.inflate_end, this.it = Ht.inflate_new(), n3 = "deflate-raw" === e2 ? Ht.inflate_init_raw(this.it) : "gzip" === e2 ? Ht.inflate_init_gzip(this.it) : Ht.inflate_init(this.it)), 0 !== n3) throw new r("init failed:" + n3);
|
|
641
|
+
} catch (t3) {
|
|
642
|
+
throw l2(this), t3;
|
|
643
|
+
}
|
|
644
|
+
}, transform(e3, n3) {
|
|
645
|
+
try {
|
|
646
|
+
const i3 = e3, c3 = new o(Nt.buffer), l3 = this.st, f2 = this.rt, w2 = this.et, u2 = this.nt;
|
|
647
|
+
let h2 = 0;
|
|
648
|
+
for (; h2 < i3.length; ) {
|
|
649
|
+
const e4 = s.min(i3.length - h2, 32768);
|
|
650
|
+
if ((!this.in || this.inBufferSize < e4) && (this.in && Ft && (Ft(this.in), this.in = 0), this.in = Zt(e4), this.inBufferSize = e4, !this.in)) throw new r("allocation failed");
|
|
651
|
+
c3.set(i3.subarray(h2, h2 + e4), this.in);
|
|
652
|
+
const o2 = l3(this.it, this.in, e4, w2, a2, 0), p2 = 16777215 & o2;
|
|
653
|
+
if (p2 && (u2.set(c3.subarray(w2, w2 + p2), 0), n3.enqueue(u2.slice(0, p2))), !t2) {
|
|
654
|
+
const t3 = o2 >> 24 & 255, e5 = 128 & t3 ? t3 - 256 : t3;
|
|
655
|
+
if (0 > e5) throw new r("process error:" + e5);
|
|
554
656
|
}
|
|
555
|
-
const
|
|
556
|
-
if (0 ===
|
|
557
|
-
|
|
657
|
+
const d2 = f2(this.it);
|
|
658
|
+
if (0 === d2) break;
|
|
659
|
+
h2 += d2;
|
|
558
660
|
}
|
|
559
|
-
} catch (
|
|
560
|
-
|
|
661
|
+
} catch (t3) {
|
|
662
|
+
l2(this), n3.error(t3);
|
|
561
663
|
}
|
|
562
|
-
}, flush(
|
|
664
|
+
}, flush(e3) {
|
|
563
665
|
try {
|
|
564
|
-
const n3 = new
|
|
666
|
+
const n3 = new o(Nt.buffer), s2 = this.st, i3 = this.et, c3 = this.nt;
|
|
565
667
|
for (; ; ) {
|
|
566
|
-
const
|
|
567
|
-
if (!
|
|
568
|
-
const
|
|
569
|
-
if (0 >
|
|
668
|
+
const o2 = s2(this.it, 0, 0, i3, a2, 4), l3 = 16777215 & o2, f2 = o2 >> 24 & 255;
|
|
669
|
+
if (!t2) {
|
|
670
|
+
const t3 = 128 & f2 ? f2 - 256 : f2;
|
|
671
|
+
if (0 > t3) throw new r("process error:" + t3);
|
|
570
672
|
}
|
|
571
|
-
if (
|
|
673
|
+
if (l3 && (c3.set(n3.subarray(i3, i3 + l3), 0), e3.enqueue(c3.slice(0, l3))), 1 === f2 || 0 === l3) break;
|
|
572
674
|
}
|
|
573
|
-
} catch (
|
|
574
|
-
|
|
675
|
+
} catch (t3) {
|
|
676
|
+
e3.error(t3);
|
|
575
677
|
} finally {
|
|
576
|
-
|
|
577
|
-
|
|
578
|
-
0 !== e3 && t3.error(new r("end error:" + e3));
|
|
579
|
-
}
|
|
580
|
-
this.in && Ke && Ke(this.in), this.out && Ke && Ke(this.out);
|
|
678
|
+
const t3 = l2(this);
|
|
679
|
+
0 !== t3 && e3.error(new r("end error:" + t3));
|
|
581
680
|
}
|
|
681
|
+
}, cancel() {
|
|
682
|
+
l2(this);
|
|
582
683
|
} });
|
|
684
|
+
function l2(t3) {
|
|
685
|
+
let e3 = 0;
|
|
686
|
+
return t3.it && t3.ot && (e3 = t3.ot(t3.it)), t3.it = 0, t3.in && Ft && Ft(t3.in), t3.in = 0, t3.et && Ft && Ft(t3.et), t3.et = 0, e3;
|
|
687
|
+
}
|
|
583
688
|
}
|
|
584
|
-
addEventListener("message", ({ data:
|
|
585
|
-
const { type:
|
|
689
|
+
addEventListener("message", ({ data: t2 }) => {
|
|
690
|
+
const { type: e2, messageId: n2, value: s2, done: r2 } = t2;
|
|
586
691
|
try {
|
|
587
|
-
if ("start" ==
|
|
588
|
-
const
|
|
589
|
-
|
|
692
|
+
if ("start" == e2 && Gt(t2), e2 == _t) {
|
|
693
|
+
const t3 = Et.get(n2);
|
|
694
|
+
Et.delete(n2), t3({ value: new o(s2), done: r2 });
|
|
590
695
|
}
|
|
591
|
-
if ("ack" ==
|
|
592
|
-
const
|
|
593
|
-
|
|
696
|
+
if ("ack" == e2) {
|
|
697
|
+
const t3 = Lt.get(n2);
|
|
698
|
+
Lt.delete(n2), t3();
|
|
594
699
|
}
|
|
595
|
-
|
|
596
|
-
} catch (
|
|
597
|
-
|
|
700
|
+
e2 == Bt && Ot.abort();
|
|
701
|
+
} catch (t3) {
|
|
702
|
+
Qt(t3);
|
|
598
703
|
}
|
|
599
704
|
});
|
|
600
|
-
class
|
|
601
|
-
constructor(
|
|
602
|
-
return
|
|
705
|
+
class Yt {
|
|
706
|
+
constructor(t2 = "deflate", e2) {
|
|
707
|
+
return Xt(true, t2, e2);
|
|
603
708
|
}
|
|
604
709
|
}
|
|
605
|
-
class
|
|
606
|
-
constructor(
|
|
607
|
-
return
|
|
710
|
+
class $t {
|
|
711
|
+
constructor(t2 = "deflate", e2) {
|
|
712
|
+
return Xt(false, t2, e2);
|
|
608
713
|
}
|
|
609
714
|
}
|
|
610
|
-
|
|
611
|
-
|
|
715
|
+
Yt.ct = true, $t.ct = true;
|
|
716
|
+
let te = false;
|
|
717
|
+
self.initModule = async (t2) => {
|
|
612
718
|
try {
|
|
613
|
-
const
|
|
614
|
-
if (!
|
|
719
|
+
const e2 = await (async (t3, { baseURI: e3 }) => {
|
|
720
|
+
if (!te) {
|
|
615
721
|
let n2, s2;
|
|
616
722
|
try {
|
|
617
723
|
try {
|
|
618
|
-
s2 = new URL(
|
|
724
|
+
s2 = new URL(t3, e3);
|
|
619
725
|
} catch {
|
|
620
726
|
}
|
|
621
727
|
const r2 = await fetch(s2);
|
|
622
728
|
n2 = await r2.arrayBuffer();
|
|
623
|
-
} catch (
|
|
624
|
-
if (!
|
|
625
|
-
n2 = ((
|
|
626
|
-
const
|
|
627
|
-
for (let
|
|
729
|
+
} catch (e4) {
|
|
730
|
+
if (!t3.startsWith("data:application/wasm;base64,")) throw e4;
|
|
731
|
+
n2 = ((t4) => {
|
|
732
|
+
const e5 = t4.split(",")[1], n3 = atob(e5), s3 = n3.length, r2 = new o(s3);
|
|
733
|
+
for (let t5 = 0; s3 > t5; ++t5) r2[t5] = n3.charCodeAt(t5);
|
|
628
734
|
return r2.buffer;
|
|
629
|
-
})(
|
|
735
|
+
})(t3);
|
|
630
736
|
}
|
|
631
|
-
((
|
|
632
|
-
if (
|
|
633
|
-
})((await WebAssembly.instantiate(n2)).instance.exports),
|
|
737
|
+
((t4) => {
|
|
738
|
+
if (Ht = t4, { malloc: Zt, free: Ft, memory: Nt } = Ht, "function" != typeof Zt || "function" != typeof Ft || !Nt) throw Ht = Zt = Ft = Nt = null, new r("Invalid WASM module");
|
|
739
|
+
})((await WebAssembly.instantiate(n2)).instance.exports), te = true;
|
|
634
740
|
}
|
|
635
|
-
})(
|
|
636
|
-
return
|
|
741
|
+
})(t2.wasmURI, t2);
|
|
742
|
+
return t2.CompressionStreamZlib = Yt, t2.DecompressionStreamZlib = $t, e2;
|
|
637
743
|
} catch {
|
|
638
744
|
}
|
|
639
745
|
};
|