@cesium/engine 20.0.2-ion.0 → 21.0.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.
Files changed (182) hide show
  1. package/Build/ThirdParty/Workers/zip-web-worker.js +637 -0
  2. package/Build/Workers/{chunk-WZKTQZUW.js → chunk-2T4WAVWX.js} +6 -6
  3. package/Build/Workers/{chunk-6LULWCX3.js → chunk-3G5XEUPY.js} +1 -1
  4. package/Build/Workers/{chunk-OIMV4OE5.js → chunk-3MSNTCHW.js} +9 -9
  5. package/Build/Workers/{chunk-VZNF2GT7.js → chunk-3OPG2FGI.js} +4 -4
  6. package/Build/Workers/{chunk-MTBXKKSQ.js → chunk-3PUG3T2H.js} +12 -12
  7. package/Build/Workers/{chunk-XWRUYDF6.js → chunk-4PH27XAL.js} +2 -2
  8. package/Build/Workers/{chunk-P2V7PVDH.js → chunk-4VJYMLR6.js} +8 -8
  9. package/Build/Workers/{chunk-MFXTB5I4.js → chunk-5B3PGBQW.js} +11 -11
  10. package/Build/Workers/{chunk-USK6ZAY2.js → chunk-5GHCWGC4.js} +1 -1
  11. package/Build/Workers/{chunk-AHFTST3Q.js → chunk-5PEQUMCB.js} +12 -12
  12. package/Build/Workers/{chunk-23B3EYUM.js → chunk-64WSG7AT.js} +4 -4
  13. package/Build/Workers/{chunk-CEA3L7M7.js → chunk-6J6WGCWP.js} +4 -4
  14. package/Build/Workers/{chunk-VSMKMGX4.js → chunk-75B34CC6.js} +5 -5
  15. package/Build/Workers/{chunk-IS5FETN7.js → chunk-7PLX65MV.js} +5 -5
  16. package/Build/Workers/{chunk-FNUSHLOY.js → chunk-AR2FUSG6.js} +1 -1
  17. package/Build/Workers/{chunk-VLGVUVJY.js → chunk-ARYRHDEB.js} +6 -6
  18. package/Build/Workers/{chunk-FHLPYFIW.js → chunk-B7INTBBB.js} +13 -13
  19. package/Build/Workers/{chunk-BHAATGZA.js → chunk-BDPSQXLX.js} +5 -5
  20. package/Build/Workers/{chunk-QZGZIAK2.js → chunk-BU4CGMHO.js} +6 -6
  21. package/Build/Workers/{chunk-YNPZU55A.js → chunk-BUBVUXDO.js} +6 -6
  22. package/Build/Workers/{chunk-LS63ERFB.js → chunk-CF72FAKC.js} +4 -4
  23. package/Build/Workers/{chunk-D4XRQNUO.js → chunk-DJ4ROETJ.js} +5 -5
  24. package/Build/Workers/{chunk-ABTG74AR.js → chunk-E5XCZVIY.js} +1 -1
  25. package/Build/Workers/{chunk-AFKNTEMH.js → chunk-EAYW4CFP.js} +16 -16
  26. package/Build/Workers/{chunk-YXTWHLJA.js → chunk-EHFMZFVC.js} +4 -4
  27. package/Build/Workers/{chunk-H7HFDM3G.js → chunk-FFCKCQPK.js} +5 -5
  28. package/Build/Workers/{chunk-V6ZGOX4I.js → chunk-GKCZ2G36.js} +7 -7
  29. package/Build/Workers/{chunk-VODCZKV2.js → chunk-HJ7IZBEI.js} +4 -4
  30. package/Build/Workers/{chunk-66MGJQFZ.js → chunk-JJZWDROM.js} +2 -2
  31. package/Build/Workers/{chunk-F4PS6RFF.js → chunk-JUOEBO4F.js} +10 -10
  32. package/Build/Workers/{chunk-WORBFT5H.js → chunk-K4IDXMIZ.js} +9 -9
  33. package/Build/Workers/{chunk-Q3OWKSC5.js → chunk-LL6HN3W4.js} +10 -10
  34. package/Build/Workers/{chunk-YUHWFX5H.js → chunk-LNTUIO55.js} +2 -2
  35. package/Build/Workers/{chunk-VA7LWA5Q.js → chunk-LWOCFJEH.js} +9 -9
  36. package/Build/Workers/{chunk-5DF5RVIO.js → chunk-MMUISYW4.js} +16 -16
  37. package/Build/Workers/{chunk-K6THSIDU.js → chunk-MXYW4BQ3.js} +2 -2
  38. package/Build/Workers/{chunk-X55ZOYMS.js → chunk-N6DVKXZD.js} +12 -12
  39. package/Build/Workers/{chunk-NKKNQMEH.js → chunk-NP46ZIBY.js} +3 -3
  40. package/Build/Workers/{chunk-QID3DXQA.js → chunk-OW6F6CPZ.js} +7 -7
  41. package/Build/Workers/{chunk-CYC7JX3P.js → chunk-P6OAOFBU.js} +8 -8
  42. package/Build/Workers/{chunk-FYYP46TF.js → chunk-PXDMWXO5.js} +2 -2
  43. package/Build/Workers/{chunk-TZDR2BAP.js → chunk-QS7623NH.js} +6 -6
  44. package/Build/Workers/{chunk-D5X2LOJ2.js → chunk-ROH45IXJ.js} +7 -7
  45. package/Build/Workers/{chunk-UR36KLNW.js → chunk-S2P6LCIB.js} +4 -4
  46. package/Build/Workers/{chunk-Z2W7ZIGV.js → chunk-S4NZVXU6.js} +2 -2
  47. package/Build/Workers/{chunk-YSDOO7AG.js → chunk-SGGO5WVA.js} +5 -5
  48. package/Build/Workers/{chunk-H5IQLAJP.js → chunk-TG7N7TPY.js} +47 -50
  49. package/Build/Workers/{chunk-XIDMFHR4.js → chunk-TUZQG4RW.js} +14 -14
  50. package/Build/Workers/{chunk-JVG6T2WE.js → chunk-UHVE7V65.js} +12 -12
  51. package/Build/Workers/{chunk-FAQ2XNFV.js → chunk-UY2HVPDL.js} +5 -5
  52. package/Build/Workers/{chunk-CUU3WGXJ.js → chunk-YNLPRFUQ.js} +6 -6
  53. package/Build/Workers/{chunk-X6GXYB3M.js → chunk-ZYOHBCCE.js} +1 -1
  54. package/Build/Workers/combineGeometry.js +21 -21
  55. package/Build/Workers/createBoxGeometry.js +15 -15
  56. package/Build/Workers/createBoxOutlineGeometry.js +13 -13
  57. package/Build/Workers/createCircleGeometry.js +23 -23
  58. package/Build/Workers/createCircleOutlineGeometry.js +16 -16
  59. package/Build/Workers/createCoplanarPolygonGeometry.js +30 -30
  60. package/Build/Workers/createCoplanarPolygonOutlineGeometry.js +28 -28
  61. package/Build/Workers/createCorridorGeometry.js +26 -26
  62. package/Build/Workers/createCorridorOutlineGeometry.js +25 -25
  63. package/Build/Workers/createCylinderGeometry.js +17 -17
  64. package/Build/Workers/createCylinderOutlineGeometry.js +15 -15
  65. package/Build/Workers/createEllipseGeometry.js +23 -23
  66. package/Build/Workers/createEllipseOutlineGeometry.js +16 -16
  67. package/Build/Workers/createEllipsoidGeometry.js +16 -16
  68. package/Build/Workers/createEllipsoidOutlineGeometry.js +15 -15
  69. package/Build/Workers/createFrustumGeometry.js +15 -15
  70. package/Build/Workers/createFrustumOutlineGeometry.js +15 -15
  71. package/Build/Workers/createGeometry.js +21 -21
  72. package/Build/Workers/createGroundPolylineGeometry.js +19 -19
  73. package/Build/Workers/createPlaneGeometry.js +13 -13
  74. package/Build/Workers/createPlaneOutlineGeometry.js +12 -12
  75. package/Build/Workers/createPolygonGeometry.js +29 -29
  76. package/Build/Workers/createPolygonOutlineGeometry.js +27 -27
  77. package/Build/Workers/createPolylineGeometry.js +22 -22
  78. package/Build/Workers/createPolylineVolumeGeometry.js +28 -28
  79. package/Build/Workers/createPolylineVolumeOutlineGeometry.js +24 -24
  80. package/Build/Workers/createRectangleGeometry.js +24 -24
  81. package/Build/Workers/createRectangleOutlineGeometry.js +17 -17
  82. package/Build/Workers/createSimplePolylineGeometry.js +20 -20
  83. package/Build/Workers/createSphereGeometry.js +16 -16
  84. package/Build/Workers/createSphereOutlineGeometry.js +15 -15
  85. package/Build/Workers/createTaskProcessorWorker.js +3 -3
  86. package/Build/Workers/createVectorTileClampedPolylines.js +12 -12
  87. package/Build/Workers/createVectorTileGeometries.js +21 -21
  88. package/Build/Workers/createVectorTilePoints.js +11 -11
  89. package/Build/Workers/createVectorTilePolygons.js +19 -19
  90. package/Build/Workers/createVectorTilePolylines.js +12 -12
  91. package/Build/Workers/createVerticesFromGoogleEarthEnterpriseBuffer.js +19 -19
  92. package/Build/Workers/createVerticesFromHeightmap.js +19 -19
  93. package/Build/Workers/createVerticesFromQuantizedTerrainMesh.js +16 -16
  94. package/Build/Workers/createWallGeometry.js +21 -21
  95. package/Build/Workers/createWallOutlineGeometry.js +20 -20
  96. package/Build/Workers/decodeDraco.js +10 -10
  97. package/Build/Workers/decodeGoogleEarthEnterprisePacket.js +5 -5
  98. package/Build/Workers/decodeI3S.js +9 -9
  99. package/Build/Workers/gaussianSplatSorter.js +4 -4
  100. package/Build/Workers/gaussianSplatTextureGenerator.js +4 -4
  101. package/Build/Workers/transcodeKTX2.js +6 -6
  102. package/Build/Workers/transferTypedArrayTest.js +1 -1
  103. package/Build/Workers/upsampleQuantizedTerrainMesh.js +19 -19
  104. package/Source/Core/Event.js +41 -49
  105. package/Source/Core/GoogleMaps.js +2 -2
  106. package/Source/Core/Ion.js +1 -1
  107. package/Source/Core/IonResource.js +30 -4
  108. package/Source/Core/Resource.js +5 -1
  109. package/Source/DataSources/KmlDataSource.js +62 -63
  110. package/Source/DataSources/exportKml.js +27 -30
  111. package/Source/Scene/ArcGisMapService.js +1 -1
  112. package/Source/Scene/Azure2DImageryProvider.js +308 -0
  113. package/Source/Scene/Billboard.js +4 -0
  114. package/Source/Scene/BillboardCollection.js +9 -2
  115. package/Source/Scene/ClippingPlaneCollection.js +3 -3
  116. package/Source/Scene/ClippingPolygon.js +91 -2
  117. package/Source/Scene/CreditDisplay.js +1 -1
  118. package/Source/Scene/GaussianSplat3DTileContent.js +54 -9
  119. package/Source/Scene/GaussianSplatPrimitive.js +49 -50
  120. package/Source/Scene/Google2DImageryProvider.js +614 -0
  121. package/Source/Scene/IonImageryProvider.js +22 -1
  122. package/Source/Scene/LabelCollection.js +1 -0
  123. package/Source/Scene/Material.js +248 -80
  124. package/Source/Scene/Primitive.js +6 -0
  125. package/Source/Scene/PrimitiveState.js +123 -0
  126. package/Source/Scene/Scene.js +2 -2
  127. package/Source/Scene/VoxelBoundsCollection.js +494 -0
  128. package/Source/Scene/VoxelBoxShape.js +236 -101
  129. package/Source/Scene/VoxelCylinderShape.js +315 -204
  130. package/Source/Scene/VoxelEllipsoidShape.js +402 -119
  131. package/Source/Scene/VoxelPrimitive.js +119 -84
  132. package/Source/Scene/VoxelRenderResources.js +17 -10
  133. package/Source/Scene/VoxelShape.js +21 -6
  134. package/Source/Scene/buildVoxelDrawCommands.js +61 -20
  135. package/Source/Scene/createGooglePhotorealistic3DTileset.js +1 -1
  136. package/Source/Scene/getClippingFunction.js +79 -88
  137. package/Source/Shaders/BillboardCollectionVS.glsl +2 -0
  138. package/Source/Shaders/BillboardCollectionVS.js +2 -0
  139. package/Source/Shaders/Voxels/IntersectBox.glsl +20 -33
  140. package/Source/Shaders/Voxels/IntersectBox.js +20 -33
  141. package/Source/Shaders/Voxels/IntersectCylinder.glsl +28 -32
  142. package/Source/Shaders/Voxels/IntersectCylinder.js +28 -32
  143. package/Source/Shaders/Voxels/IntersectDepth.glsl +1 -4
  144. package/Source/Shaders/Voxels/IntersectDepth.js +1 -4
  145. package/Source/Shaders/Voxels/IntersectEllipsoid.glsl +12 -20
  146. package/Source/Shaders/Voxels/IntersectEllipsoid.js +12 -20
  147. package/Source/Shaders/Voxels/IntersectLongitude.glsl +21 -9
  148. package/Source/Shaders/Voxels/IntersectLongitude.js +21 -9
  149. package/Source/Shaders/Voxels/{IntersectClippingPlanes.glsl → IntersectPlane.glsl} +5 -3
  150. package/Source/Shaders/Voxels/{IntersectClippingPlanes.js → IntersectPlane.js} +5 -3
  151. package/Source/Shaders/Voxels/Intersection.glsl +3 -3
  152. package/Source/Shaders/Voxels/Intersection.js +3 -3
  153. package/Source/Shaders/Voxels/Octree.glsl +46 -51
  154. package/Source/Shaders/Voxels/Octree.js +46 -51
  155. package/Source/Shaders/Voxels/VoxelFS.glsl +50 -48
  156. package/Source/Shaders/Voxels/VoxelFS.js +50 -48
  157. package/Source/Shaders/Voxels/VoxelUtils.glsl +0 -19
  158. package/Source/Shaders/Voxels/VoxelUtils.js +0 -19
  159. package/Source/Shaders/Voxels/convertLocalToBoxUv.glsl +30 -0
  160. package/Source/Shaders/Voxels/convertLocalToBoxUv.js +32 -0
  161. package/Source/Shaders/Voxels/convertLocalToCylinderUv.glsl +97 -0
  162. package/Source/Shaders/Voxels/convertLocalToCylinderUv.js +99 -0
  163. package/Source/Shaders/Voxels/convertLocalToEllipsoidUv.glsl +193 -0
  164. package/Source/Shaders/Voxels/convertLocalToEllipsoidUv.js +195 -0
  165. package/Source/ThirdParty/Workers/zip-web-worker.js +1 -0
  166. package/Source/ThirdParty/zip-module.wasm +0 -0
  167. package/index.d.ts +317 -14
  168. package/index.js +141 -139
  169. package/package.json +2 -2
  170. package/Build/ThirdParty/Workers/pako_deflate.min.js +0 -503
  171. package/Build/ThirdParty/Workers/pako_inflate.min.js +0 -698
  172. package/Build/ThirdParty/Workers/z-worker-pako.js +0 -601
  173. package/Source/Core/defaultValue.js +0 -48
  174. package/Source/Shaders/Voxels/convertUvToBox.glsl +0 -45
  175. package/Source/Shaders/Voxels/convertUvToBox.js +0 -46
  176. package/Source/Shaders/Voxels/convertUvToCylinder.glsl +0 -99
  177. package/Source/Shaders/Voxels/convertUvToCylinder.js +0 -101
  178. package/Source/Shaders/Voxels/convertUvToEllipsoid.glsl +0 -139
  179. package/Source/Shaders/Voxels/convertUvToEllipsoid.js +0 -141
  180. package/Source/ThirdParty/Workers/pako_deflate.min.js +0 -2
  181. package/Source/ThirdParty/Workers/pako_inflate.min.js +0 -2
  182. package/Source/ThirdParty/Workers/z-worker-pako.js +0 -1
@@ -1,698 +0,0 @@
1
- /*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */
2
- !(function(e, t) {
3
- "object" == typeof exports && "undefined" != typeof module ? t(exports) : "function" == typeof define && define.amd ? define(["exports"], t) : t((e = "undefined" != typeof globalThis ? globalThis : e || self).pako = {});
4
- })(this, (function(e) {
5
- "use strict";
6
- var t = (e2, t2, i2, n2) => {
7
- let a2 = 65535 & e2 | 0, r2 = e2 >>> 16 & 65535 | 0, o2 = 0;
8
- for (; 0 !== i2; ) {
9
- o2 = i2 > 2e3 ? 2e3 : i2, i2 -= o2;
10
- do {
11
- a2 = a2 + t2[n2++] | 0, r2 = r2 + a2 | 0;
12
- } while (--o2);
13
- a2 %= 65521, r2 %= 65521;
14
- }
15
- return a2 | r2 << 16 | 0;
16
- };
17
- const i = new Uint32Array((() => {
18
- let e2, t2 = [];
19
- for (var i2 = 0; i2 < 256; i2++) {
20
- e2 = i2;
21
- for (var n2 = 0; n2 < 8; n2++) e2 = 1 & e2 ? 3988292384 ^ e2 >>> 1 : e2 >>> 1;
22
- t2[i2] = e2;
23
- }
24
- return t2;
25
- })());
26
- var n = (e2, t2, n2, a2) => {
27
- const r2 = i, o2 = a2 + n2;
28
- e2 ^= -1;
29
- for (let i2 = a2; i2 < o2; i2++) e2 = e2 >>> 8 ^ r2[255 & (e2 ^ t2[i2])];
30
- return -1 ^ e2;
31
- };
32
- const a = 16209;
33
- var r = function(e2, t2) {
34
- let i2, n2, r2, o2, s2, l2, d2, f2, c2, h2, u2, w2, b2, m2, k2, _2, g2, p2, v2, x2, y2, E2, R2, A2;
35
- const Z2 = e2.state;
36
- i2 = e2.next_in, R2 = e2.input, n2 = i2 + (e2.avail_in - 5), r2 = e2.next_out, A2 = e2.output, o2 = r2 - (t2 - e2.avail_out), s2 = r2 + (e2.avail_out - 257), l2 = Z2.dmax, d2 = Z2.wsize, f2 = Z2.whave, c2 = Z2.wnext, h2 = Z2.window, u2 = Z2.hold, w2 = Z2.bits, b2 = Z2.lencode, m2 = Z2.distcode, k2 = (1 << Z2.lenbits) - 1, _2 = (1 << Z2.distbits) - 1;
37
- e: do {
38
- w2 < 15 && (u2 += R2[i2++] << w2, w2 += 8, u2 += R2[i2++] << w2, w2 += 8), g2 = b2[u2 & k2];
39
- t: for (; ; ) {
40
- if (p2 = g2 >>> 24, u2 >>>= p2, w2 -= p2, p2 = g2 >>> 16 & 255, 0 === p2) A2[r2++] = 65535 & g2;
41
- else {
42
- if (!(16 & p2)) {
43
- if (0 == (64 & p2)) {
44
- g2 = b2[(65535 & g2) + (u2 & (1 << p2) - 1)];
45
- continue t;
46
- }
47
- if (32 & p2) {
48
- Z2.mode = 16191;
49
- break e;
50
- }
51
- e2.msg = "invalid literal/length code", Z2.mode = a;
52
- break e;
53
- }
54
- v2 = 65535 & g2, p2 &= 15, p2 && (w2 < p2 && (u2 += R2[i2++] << w2, w2 += 8), v2 += u2 & (1 << p2) - 1, u2 >>>= p2, w2 -= p2), w2 < 15 && (u2 += R2[i2++] << w2, w2 += 8, u2 += R2[i2++] << w2, w2 += 8), g2 = m2[u2 & _2];
55
- i: for (; ; ) {
56
- if (p2 = g2 >>> 24, u2 >>>= p2, w2 -= p2, p2 = g2 >>> 16 & 255, !(16 & p2)) {
57
- if (0 == (64 & p2)) {
58
- g2 = m2[(65535 & g2) + (u2 & (1 << p2) - 1)];
59
- continue i;
60
- }
61
- e2.msg = "invalid distance code", Z2.mode = a;
62
- break e;
63
- }
64
- if (x2 = 65535 & g2, p2 &= 15, w2 < p2 && (u2 += R2[i2++] << w2, w2 += 8, w2 < p2 && (u2 += R2[i2++] << w2, w2 += 8)), x2 += u2 & (1 << p2) - 1, x2 > l2) {
65
- e2.msg = "invalid distance too far back", Z2.mode = a;
66
- break e;
67
- }
68
- if (u2 >>>= p2, w2 -= p2, p2 = r2 - o2, x2 > p2) {
69
- if (p2 = x2 - p2, p2 > f2 && Z2.sane) {
70
- e2.msg = "invalid distance too far back", Z2.mode = a;
71
- break e;
72
- }
73
- if (y2 = 0, E2 = h2, 0 === c2) {
74
- if (y2 += d2 - p2, p2 < v2) {
75
- v2 -= p2;
76
- do {
77
- A2[r2++] = h2[y2++];
78
- } while (--p2);
79
- y2 = r2 - x2, E2 = A2;
80
- }
81
- } else if (c2 < p2) {
82
- if (y2 += d2 + c2 - p2, p2 -= c2, p2 < v2) {
83
- v2 -= p2;
84
- do {
85
- A2[r2++] = h2[y2++];
86
- } while (--p2);
87
- if (y2 = 0, c2 < v2) {
88
- p2 = c2, v2 -= p2;
89
- do {
90
- A2[r2++] = h2[y2++];
91
- } while (--p2);
92
- y2 = r2 - x2, E2 = A2;
93
- }
94
- }
95
- } else if (y2 += c2 - p2, p2 < v2) {
96
- v2 -= p2;
97
- do {
98
- A2[r2++] = h2[y2++];
99
- } while (--p2);
100
- y2 = r2 - x2, E2 = A2;
101
- }
102
- for (; v2 > 2; ) A2[r2++] = E2[y2++], A2[r2++] = E2[y2++], A2[r2++] = E2[y2++], v2 -= 3;
103
- v2 && (A2[r2++] = E2[y2++], v2 > 1 && (A2[r2++] = E2[y2++]));
104
- } else {
105
- y2 = r2 - x2;
106
- do {
107
- A2[r2++] = A2[y2++], A2[r2++] = A2[y2++], A2[r2++] = A2[y2++], v2 -= 3;
108
- } while (v2 > 2);
109
- v2 && (A2[r2++] = A2[y2++], v2 > 1 && (A2[r2++] = A2[y2++]));
110
- }
111
- break;
112
- }
113
- }
114
- break;
115
- }
116
- } while (i2 < n2 && r2 < s2);
117
- v2 = w2 >> 3, i2 -= v2, w2 -= v2 << 3, u2 &= (1 << w2) - 1, e2.next_in = i2, e2.next_out = r2, e2.avail_in = i2 < n2 ? n2 - i2 + 5 : 5 - (i2 - n2), e2.avail_out = r2 < s2 ? s2 - r2 + 257 : 257 - (r2 - s2), Z2.hold = u2, Z2.bits = w2;
118
- };
119
- const o = 15, s = new Uint16Array([3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0]), l = new Uint8Array([16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78]), d = new Uint16Array([1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0]), f = new Uint8Array([16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64]);
120
- var c = (e2, t2, i2, n2, a2, r2, c2, h2) => {
121
- const u2 = h2.bits;
122
- let w2, b2, m2, k2, _2, g2, p2 = 0, v2 = 0, x2 = 0, y2 = 0, E2 = 0, R2 = 0, A2 = 0, Z2 = 0, S2 = 0, T2 = 0, O2 = null;
123
- const U2 = new Uint16Array(16), D2 = new Uint16Array(16);
124
- let I2, B2, N2, C2 = null;
125
- for (p2 = 0; p2 <= o; p2++) U2[p2] = 0;
126
- for (v2 = 0; v2 < n2; v2++) U2[t2[i2 + v2]]++;
127
- for (E2 = u2, y2 = o; y2 >= 1 && 0 === U2[y2]; y2--) ;
128
- if (E2 > y2 && (E2 = y2), 0 === y2) return a2[r2++] = 20971520, a2[r2++] = 20971520, h2.bits = 1, 0;
129
- for (x2 = 1; x2 < y2 && 0 === U2[x2]; x2++) ;
130
- for (E2 < x2 && (E2 = x2), Z2 = 1, p2 = 1; p2 <= o; p2++) if (Z2 <<= 1, Z2 -= U2[p2], Z2 < 0) return -1;
131
- if (Z2 > 0 && (0 === e2 || 1 !== y2)) return -1;
132
- for (D2[1] = 0, p2 = 1; p2 < o; p2++) D2[p2 + 1] = D2[p2] + U2[p2];
133
- for (v2 = 0; v2 < n2; v2++) 0 !== t2[i2 + v2] && (c2[D2[t2[i2 + v2]]++] = v2);
134
- if (0 === e2 ? (O2 = C2 = c2, g2 = 20) : 1 === e2 ? (O2 = s, C2 = l, g2 = 257) : (O2 = d, C2 = f, g2 = 0), T2 = 0, v2 = 0, p2 = x2, _2 = r2, R2 = E2, A2 = 0, m2 = -1, S2 = 1 << E2, k2 = S2 - 1, 1 === e2 && S2 > 852 || 2 === e2 && S2 > 592) return 1;
135
- for (; ; ) {
136
- I2 = p2 - A2, c2[v2] + 1 < g2 ? (B2 = 0, N2 = c2[v2]) : c2[v2] >= g2 ? (B2 = C2[c2[v2] - g2], N2 = O2[c2[v2] - g2]) : (B2 = 96, N2 = 0), w2 = 1 << p2 - A2, b2 = 1 << R2, x2 = b2;
137
- do {
138
- b2 -= w2, a2[_2 + (T2 >> A2) + b2] = I2 << 24 | B2 << 16 | N2 | 0;
139
- } while (0 !== b2);
140
- for (w2 = 1 << p2 - 1; T2 & w2; ) w2 >>= 1;
141
- if (0 !== w2 ? (T2 &= w2 - 1, T2 += w2) : T2 = 0, v2++, 0 == --U2[p2]) {
142
- if (p2 === y2) break;
143
- p2 = t2[i2 + c2[v2]];
144
- }
145
- if (p2 > E2 && (T2 & k2) !== m2) {
146
- for (0 === A2 && (A2 = E2), _2 += x2, R2 = p2 - A2, Z2 = 1 << R2; R2 + A2 < y2 && (Z2 -= U2[R2 + A2], !(Z2 <= 0)); ) R2++, Z2 <<= 1;
147
- if (S2 += 1 << R2, 1 === e2 && S2 > 852 || 2 === e2 && S2 > 592) return 1;
148
- m2 = T2 & k2, a2[m2] = E2 << 24 | R2 << 16 | _2 - r2 | 0;
149
- }
150
- }
151
- return 0 !== T2 && (a2[_2 + T2] = p2 - A2 << 24 | 64 << 16 | 0), h2.bits = E2, 0;
152
- }, h = { Z_NO_FLUSH: 0, Z_PARTIAL_FLUSH: 1, Z_SYNC_FLUSH: 2, Z_FULL_FLUSH: 3, Z_FINISH: 4, Z_BLOCK: 5, Z_TREES: 6, Z_OK: 0, Z_STREAM_END: 1, Z_NEED_DICT: 2, Z_ERRNO: -1, Z_STREAM_ERROR: -2, Z_DATA_ERROR: -3, Z_MEM_ERROR: -4, Z_BUF_ERROR: -5, Z_NO_COMPRESSION: 0, Z_BEST_SPEED: 1, Z_BEST_COMPRESSION: 9, Z_DEFAULT_COMPRESSION: -1, Z_FILTERED: 1, Z_HUFFMAN_ONLY: 2, Z_RLE: 3, Z_FIXED: 4, Z_DEFAULT_STRATEGY: 0, Z_BINARY: 0, Z_TEXT: 1, Z_UNKNOWN: 2, Z_DEFLATED: 8 };
153
- const { Z_FINISH: u, Z_BLOCK: w, Z_TREES: b, Z_OK: m, Z_STREAM_END: k, Z_NEED_DICT: _, Z_STREAM_ERROR: g, Z_DATA_ERROR: p, Z_MEM_ERROR: v, Z_BUF_ERROR: x, Z_DEFLATED: y } = h, E = 16180, R = 16190, A = 16191, Z = 16192, S = 16194, T = 16199, O = 16200, U = 16206, D = 16209, I = (e2) => (e2 >>> 24 & 255) + (e2 >>> 8 & 65280) + ((65280 & e2) << 8) + ((255 & e2) << 24);
154
- function B() {
155
- this.strm = null, this.mode = 0, this.last = false, this.wrap = 0, this.havedict = false, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
156
- }
157
- const N = (e2) => {
158
- if (!e2) return 1;
159
- const t2 = e2.state;
160
- return !t2 || t2.strm !== e2 || t2.mode < E || t2.mode > 16211 ? 1 : 0;
161
- }, C = (e2) => {
162
- if (N(e2)) return g;
163
- const t2 = e2.state;
164
- return e2.total_in = e2.total_out = t2.total = 0, e2.msg = "", t2.wrap && (e2.adler = 1 & t2.wrap), t2.mode = E, t2.last = 0, t2.havedict = 0, t2.flags = -1, t2.dmax = 32768, t2.head = null, t2.hold = 0, t2.bits = 0, t2.lencode = t2.lendyn = new Int32Array(852), t2.distcode = t2.distdyn = new Int32Array(592), t2.sane = 1, t2.back = -1, m;
165
- }, z = (e2) => {
166
- if (N(e2)) return g;
167
- const t2 = e2.state;
168
- return t2.wsize = 0, t2.whave = 0, t2.wnext = 0, C(e2);
169
- }, F = (e2, t2) => {
170
- let i2;
171
- if (N(e2)) return g;
172
- const n2 = e2.state;
173
- return t2 < 0 ? (i2 = 0, t2 = -t2) : (i2 = 5 + (t2 >> 4), t2 < 48 && (t2 &= 15)), t2 && (t2 < 8 || t2 > 15) ? g : (null !== n2.window && n2.wbits !== t2 && (n2.window = null), n2.wrap = i2, n2.wbits = t2, z(e2));
174
- }, L = (e2, t2) => {
175
- if (!e2) return g;
176
- const i2 = new B();
177
- e2.state = i2, i2.strm = e2, i2.window = null, i2.mode = E;
178
- const n2 = F(e2, t2);
179
- return n2 !== m && (e2.state = null), n2;
180
- };
181
- let M, H, j = true;
182
- const K = (e2) => {
183
- if (j) {
184
- M = new Int32Array(512), H = new Int32Array(32);
185
- let t2 = 0;
186
- for (; t2 < 144; ) e2.lens[t2++] = 8;
187
- for (; t2 < 256; ) e2.lens[t2++] = 9;
188
- for (; t2 < 280; ) e2.lens[t2++] = 7;
189
- for (; t2 < 288; ) e2.lens[t2++] = 8;
190
- for (c(1, e2.lens, 0, 288, M, 0, e2.work, { bits: 9 }), t2 = 0; t2 < 32; ) e2.lens[t2++] = 5;
191
- c(2, e2.lens, 0, 32, H, 0, e2.work, { bits: 5 }), j = false;
192
- }
193
- e2.lencode = M, e2.lenbits = 9, e2.distcode = H, e2.distbits = 5;
194
- }, P = (e2, t2, i2, n2) => {
195
- let a2;
196
- const r2 = e2.state;
197
- return null === r2.window && (r2.wsize = 1 << r2.wbits, r2.wnext = 0, r2.whave = 0, r2.window = new Uint8Array(r2.wsize)), n2 >= r2.wsize ? (r2.window.set(t2.subarray(i2 - r2.wsize, i2), 0), r2.wnext = 0, r2.whave = r2.wsize) : (a2 = r2.wsize - r2.wnext, a2 > n2 && (a2 = n2), r2.window.set(t2.subarray(i2 - n2, i2 - n2 + a2), r2.wnext), (n2 -= a2) ? (r2.window.set(t2.subarray(i2 - n2, i2), 0), r2.wnext = n2, r2.whave = r2.wsize) : (r2.wnext += a2, r2.wnext === r2.wsize && (r2.wnext = 0), r2.whave < r2.wsize && (r2.whave += a2))), 0;
198
- };
199
- var Y = { inflateReset: z, inflateReset2: F, inflateResetKeep: C, inflateInit: (e2) => L(e2, 15), inflateInit2: L, inflate: (e2, i2) => {
200
- let a2, o2, s2, l2, d2, f2, h2, B2, C2, z2, F2, L2, M2, H2, j2, Y2, G2, X2, W2, q2, J2, Q2, V2 = 0;
201
- const $2 = new Uint8Array(4);
202
- let ee2, te2;
203
- const ie2 = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
204
- if (N(e2) || !e2.output || !e2.input && 0 !== e2.avail_in) return g;
205
- a2 = e2.state, a2.mode === A && (a2.mode = Z), d2 = e2.next_out, s2 = e2.output, h2 = e2.avail_out, l2 = e2.next_in, o2 = e2.input, f2 = e2.avail_in, B2 = a2.hold, C2 = a2.bits, z2 = f2, F2 = h2, Q2 = m;
206
- e: for (; ; ) switch (a2.mode) {
207
- case E:
208
- if (0 === a2.wrap) {
209
- a2.mode = Z;
210
- break;
211
- }
212
- for (; C2 < 16; ) {
213
- if (0 === f2) break e;
214
- f2--, B2 += o2[l2++] << C2, C2 += 8;
215
- }
216
- if (2 & a2.wrap && 35615 === B2) {
217
- 0 === a2.wbits && (a2.wbits = 15), a2.check = 0, $2[0] = 255 & B2, $2[1] = B2 >>> 8 & 255, a2.check = n(a2.check, $2, 2, 0), B2 = 0, C2 = 0, a2.mode = 16181;
218
- break;
219
- }
220
- if (a2.head && (a2.head.done = false), !(1 & a2.wrap) || (((255 & B2) << 8) + (B2 >> 8)) % 31) {
221
- e2.msg = "incorrect header check", a2.mode = D;
222
- break;
223
- }
224
- if ((15 & B2) !== y) {
225
- e2.msg = "unknown compression method", a2.mode = D;
226
- break;
227
- }
228
- if (B2 >>>= 4, C2 -= 4, J2 = 8 + (15 & B2), 0 === a2.wbits && (a2.wbits = J2), J2 > 15 || J2 > a2.wbits) {
229
- e2.msg = "invalid window size", a2.mode = D;
230
- break;
231
- }
232
- a2.dmax = 1 << a2.wbits, a2.flags = 0, e2.adler = a2.check = 1, a2.mode = 512 & B2 ? 16189 : A, B2 = 0, C2 = 0;
233
- break;
234
- case 16181:
235
- for (; C2 < 16; ) {
236
- if (0 === f2) break e;
237
- f2--, B2 += o2[l2++] << C2, C2 += 8;
238
- }
239
- if (a2.flags = B2, (255 & a2.flags) !== y) {
240
- e2.msg = "unknown compression method", a2.mode = D;
241
- break;
242
- }
243
- if (57344 & a2.flags) {
244
- e2.msg = "unknown header flags set", a2.mode = D;
245
- break;
246
- }
247
- a2.head && (a2.head.text = B2 >> 8 & 1), 512 & a2.flags && 4 & a2.wrap && ($2[0] = 255 & B2, $2[1] = B2 >>> 8 & 255, a2.check = n(a2.check, $2, 2, 0)), B2 = 0, C2 = 0, a2.mode = 16182;
248
- case 16182:
249
- for (; C2 < 32; ) {
250
- if (0 === f2) break e;
251
- f2--, B2 += o2[l2++] << C2, C2 += 8;
252
- }
253
- a2.head && (a2.head.time = B2), 512 & a2.flags && 4 & a2.wrap && ($2[0] = 255 & B2, $2[1] = B2 >>> 8 & 255, $2[2] = B2 >>> 16 & 255, $2[3] = B2 >>> 24 & 255, a2.check = n(a2.check, $2, 4, 0)), B2 = 0, C2 = 0, a2.mode = 16183;
254
- case 16183:
255
- for (; C2 < 16; ) {
256
- if (0 === f2) break e;
257
- f2--, B2 += o2[l2++] << C2, C2 += 8;
258
- }
259
- a2.head && (a2.head.xflags = 255 & B2, a2.head.os = B2 >> 8), 512 & a2.flags && 4 & a2.wrap && ($2[0] = 255 & B2, $2[1] = B2 >>> 8 & 255, a2.check = n(a2.check, $2, 2, 0)), B2 = 0, C2 = 0, a2.mode = 16184;
260
- case 16184:
261
- if (1024 & a2.flags) {
262
- for (; C2 < 16; ) {
263
- if (0 === f2) break e;
264
- f2--, B2 += o2[l2++] << C2, C2 += 8;
265
- }
266
- a2.length = B2, a2.head && (a2.head.extra_len = B2), 512 & a2.flags && 4 & a2.wrap && ($2[0] = 255 & B2, $2[1] = B2 >>> 8 & 255, a2.check = n(a2.check, $2, 2, 0)), B2 = 0, C2 = 0;
267
- } else a2.head && (a2.head.extra = null);
268
- a2.mode = 16185;
269
- case 16185:
270
- if (1024 & a2.flags && (L2 = a2.length, L2 > f2 && (L2 = f2), L2 && (a2.head && (J2 = a2.head.extra_len - a2.length, a2.head.extra || (a2.head.extra = new Uint8Array(a2.head.extra_len)), a2.head.extra.set(o2.subarray(l2, l2 + L2), J2)), 512 & a2.flags && 4 & a2.wrap && (a2.check = n(a2.check, o2, L2, l2)), f2 -= L2, l2 += L2, a2.length -= L2), a2.length)) break e;
271
- a2.length = 0, a2.mode = 16186;
272
- case 16186:
273
- if (2048 & a2.flags) {
274
- if (0 === f2) break e;
275
- L2 = 0;
276
- do {
277
- J2 = o2[l2 + L2++], a2.head && J2 && a2.length < 65536 && (a2.head.name += String.fromCharCode(J2));
278
- } while (J2 && L2 < f2);
279
- if (512 & a2.flags && 4 & a2.wrap && (a2.check = n(a2.check, o2, L2, l2)), f2 -= L2, l2 += L2, J2) break e;
280
- } else a2.head && (a2.head.name = null);
281
- a2.length = 0, a2.mode = 16187;
282
- case 16187:
283
- if (4096 & a2.flags) {
284
- if (0 === f2) break e;
285
- L2 = 0;
286
- do {
287
- J2 = o2[l2 + L2++], a2.head && J2 && a2.length < 65536 && (a2.head.comment += String.fromCharCode(J2));
288
- } while (J2 && L2 < f2);
289
- if (512 & a2.flags && 4 & a2.wrap && (a2.check = n(a2.check, o2, L2, l2)), f2 -= L2, l2 += L2, J2) break e;
290
- } else a2.head && (a2.head.comment = null);
291
- a2.mode = 16188;
292
- case 16188:
293
- if (512 & a2.flags) {
294
- for (; C2 < 16; ) {
295
- if (0 === f2) break e;
296
- f2--, B2 += o2[l2++] << C2, C2 += 8;
297
- }
298
- if (4 & a2.wrap && B2 !== (65535 & a2.check)) {
299
- e2.msg = "header crc mismatch", a2.mode = D;
300
- break;
301
- }
302
- B2 = 0, C2 = 0;
303
- }
304
- a2.head && (a2.head.hcrc = a2.flags >> 9 & 1, a2.head.done = true), e2.adler = a2.check = 0, a2.mode = A;
305
- break;
306
- case 16189:
307
- for (; C2 < 32; ) {
308
- if (0 === f2) break e;
309
- f2--, B2 += o2[l2++] << C2, C2 += 8;
310
- }
311
- e2.adler = a2.check = I(B2), B2 = 0, C2 = 0, a2.mode = R;
312
- case R:
313
- if (0 === a2.havedict) return e2.next_out = d2, e2.avail_out = h2, e2.next_in = l2, e2.avail_in = f2, a2.hold = B2, a2.bits = C2, _;
314
- e2.adler = a2.check = 1, a2.mode = A;
315
- case A:
316
- if (i2 === w || i2 === b) break e;
317
- case Z:
318
- if (a2.last) {
319
- B2 >>>= 7 & C2, C2 -= 7 & C2, a2.mode = U;
320
- break;
321
- }
322
- for (; C2 < 3; ) {
323
- if (0 === f2) break e;
324
- f2--, B2 += o2[l2++] << C2, C2 += 8;
325
- }
326
- switch (a2.last = 1 & B2, B2 >>>= 1, C2 -= 1, 3 & B2) {
327
- case 0:
328
- a2.mode = 16193;
329
- break;
330
- case 1:
331
- if (K(a2), a2.mode = T, i2 === b) {
332
- B2 >>>= 2, C2 -= 2;
333
- break e;
334
- }
335
- break;
336
- case 2:
337
- a2.mode = 16196;
338
- break;
339
- case 3:
340
- e2.msg = "invalid block type", a2.mode = D;
341
- }
342
- B2 >>>= 2, C2 -= 2;
343
- break;
344
- case 16193:
345
- for (B2 >>>= 7 & C2, C2 -= 7 & C2; C2 < 32; ) {
346
- if (0 === f2) break e;
347
- f2--, B2 += o2[l2++] << C2, C2 += 8;
348
- }
349
- if ((65535 & B2) != (B2 >>> 16 ^ 65535)) {
350
- e2.msg = "invalid stored block lengths", a2.mode = D;
351
- break;
352
- }
353
- if (a2.length = 65535 & B2, B2 = 0, C2 = 0, a2.mode = S, i2 === b) break e;
354
- case S:
355
- a2.mode = 16195;
356
- case 16195:
357
- if (L2 = a2.length, L2) {
358
- if (L2 > f2 && (L2 = f2), L2 > h2 && (L2 = h2), 0 === L2) break e;
359
- s2.set(o2.subarray(l2, l2 + L2), d2), f2 -= L2, l2 += L2, h2 -= L2, d2 += L2, a2.length -= L2;
360
- break;
361
- }
362
- a2.mode = A;
363
- break;
364
- case 16196:
365
- for (; C2 < 14; ) {
366
- if (0 === f2) break e;
367
- f2--, B2 += o2[l2++] << C2, C2 += 8;
368
- }
369
- if (a2.nlen = 257 + (31 & B2), B2 >>>= 5, C2 -= 5, a2.ndist = 1 + (31 & B2), B2 >>>= 5, C2 -= 5, a2.ncode = 4 + (15 & B2), B2 >>>= 4, C2 -= 4, a2.nlen > 286 || a2.ndist > 30) {
370
- e2.msg = "too many length or distance symbols", a2.mode = D;
371
- break;
372
- }
373
- a2.have = 0, a2.mode = 16197;
374
- case 16197:
375
- for (; a2.have < a2.ncode; ) {
376
- for (; C2 < 3; ) {
377
- if (0 === f2) break e;
378
- f2--, B2 += o2[l2++] << C2, C2 += 8;
379
- }
380
- a2.lens[ie2[a2.have++]] = 7 & B2, B2 >>>= 3, C2 -= 3;
381
- }
382
- for (; a2.have < 19; ) a2.lens[ie2[a2.have++]] = 0;
383
- if (a2.lencode = a2.lendyn, a2.lenbits = 7, ee2 = { bits: a2.lenbits }, Q2 = c(0, a2.lens, 0, 19, a2.lencode, 0, a2.work, ee2), a2.lenbits = ee2.bits, Q2) {
384
- e2.msg = "invalid code lengths set", a2.mode = D;
385
- break;
386
- }
387
- a2.have = 0, a2.mode = 16198;
388
- case 16198:
389
- for (; a2.have < a2.nlen + a2.ndist; ) {
390
- for (; V2 = a2.lencode[B2 & (1 << a2.lenbits) - 1], j2 = V2 >>> 24, Y2 = V2 >>> 16 & 255, G2 = 65535 & V2, !(j2 <= C2); ) {
391
- if (0 === f2) break e;
392
- f2--, B2 += o2[l2++] << C2, C2 += 8;
393
- }
394
- if (G2 < 16) B2 >>>= j2, C2 -= j2, a2.lens[a2.have++] = G2;
395
- else {
396
- if (16 === G2) {
397
- for (te2 = j2 + 2; C2 < te2; ) {
398
- if (0 === f2) break e;
399
- f2--, B2 += o2[l2++] << C2, C2 += 8;
400
- }
401
- if (B2 >>>= j2, C2 -= j2, 0 === a2.have) {
402
- e2.msg = "invalid bit length repeat", a2.mode = D;
403
- break;
404
- }
405
- J2 = a2.lens[a2.have - 1], L2 = 3 + (3 & B2), B2 >>>= 2, C2 -= 2;
406
- } else if (17 === G2) {
407
- for (te2 = j2 + 3; C2 < te2; ) {
408
- if (0 === f2) break e;
409
- f2--, B2 += o2[l2++] << C2, C2 += 8;
410
- }
411
- B2 >>>= j2, C2 -= j2, J2 = 0, L2 = 3 + (7 & B2), B2 >>>= 3, C2 -= 3;
412
- } else {
413
- for (te2 = j2 + 7; C2 < te2; ) {
414
- if (0 === f2) break e;
415
- f2--, B2 += o2[l2++] << C2, C2 += 8;
416
- }
417
- B2 >>>= j2, C2 -= j2, J2 = 0, L2 = 11 + (127 & B2), B2 >>>= 7, C2 -= 7;
418
- }
419
- if (a2.have + L2 > a2.nlen + a2.ndist) {
420
- e2.msg = "invalid bit length repeat", a2.mode = D;
421
- break;
422
- }
423
- for (; L2--; ) a2.lens[a2.have++] = J2;
424
- }
425
- }
426
- if (a2.mode === D) break;
427
- if (0 === a2.lens[256]) {
428
- e2.msg = "invalid code -- missing end-of-block", a2.mode = D;
429
- break;
430
- }
431
- if (a2.lenbits = 9, ee2 = { bits: a2.lenbits }, Q2 = c(1, a2.lens, 0, a2.nlen, a2.lencode, 0, a2.work, ee2), a2.lenbits = ee2.bits, Q2) {
432
- e2.msg = "invalid literal/lengths set", a2.mode = D;
433
- break;
434
- }
435
- if (a2.distbits = 6, a2.distcode = a2.distdyn, ee2 = { bits: a2.distbits }, Q2 = c(2, a2.lens, a2.nlen, a2.ndist, a2.distcode, 0, a2.work, ee2), a2.distbits = ee2.bits, Q2) {
436
- e2.msg = "invalid distances set", a2.mode = D;
437
- break;
438
- }
439
- if (a2.mode = T, i2 === b) break e;
440
- case T:
441
- a2.mode = O;
442
- case O:
443
- if (f2 >= 6 && h2 >= 258) {
444
- e2.next_out = d2, e2.avail_out = h2, e2.next_in = l2, e2.avail_in = f2, a2.hold = B2, a2.bits = C2, r(e2, F2), d2 = e2.next_out, s2 = e2.output, h2 = e2.avail_out, l2 = e2.next_in, o2 = e2.input, f2 = e2.avail_in, B2 = a2.hold, C2 = a2.bits, a2.mode === A && (a2.back = -1);
445
- break;
446
- }
447
- for (a2.back = 0; V2 = a2.lencode[B2 & (1 << a2.lenbits) - 1], j2 = V2 >>> 24, Y2 = V2 >>> 16 & 255, G2 = 65535 & V2, !(j2 <= C2); ) {
448
- if (0 === f2) break e;
449
- f2--, B2 += o2[l2++] << C2, C2 += 8;
450
- }
451
- if (Y2 && 0 == (240 & Y2)) {
452
- for (X2 = j2, W2 = Y2, q2 = G2; V2 = a2.lencode[q2 + ((B2 & (1 << X2 + W2) - 1) >> X2)], j2 = V2 >>> 24, Y2 = V2 >>> 16 & 255, G2 = 65535 & V2, !(X2 + j2 <= C2); ) {
453
- if (0 === f2) break e;
454
- f2--, B2 += o2[l2++] << C2, C2 += 8;
455
- }
456
- B2 >>>= X2, C2 -= X2, a2.back += X2;
457
- }
458
- if (B2 >>>= j2, C2 -= j2, a2.back += j2, a2.length = G2, 0 === Y2) {
459
- a2.mode = 16205;
460
- break;
461
- }
462
- if (32 & Y2) {
463
- a2.back = -1, a2.mode = A;
464
- break;
465
- }
466
- if (64 & Y2) {
467
- e2.msg = "invalid literal/length code", a2.mode = D;
468
- break;
469
- }
470
- a2.extra = 15 & Y2, a2.mode = 16201;
471
- case 16201:
472
- if (a2.extra) {
473
- for (te2 = a2.extra; C2 < te2; ) {
474
- if (0 === f2) break e;
475
- f2--, B2 += o2[l2++] << C2, C2 += 8;
476
- }
477
- a2.length += B2 & (1 << a2.extra) - 1, B2 >>>= a2.extra, C2 -= a2.extra, a2.back += a2.extra;
478
- }
479
- a2.was = a2.length, a2.mode = 16202;
480
- case 16202:
481
- for (; V2 = a2.distcode[B2 & (1 << a2.distbits) - 1], j2 = V2 >>> 24, Y2 = V2 >>> 16 & 255, G2 = 65535 & V2, !(j2 <= C2); ) {
482
- if (0 === f2) break e;
483
- f2--, B2 += o2[l2++] << C2, C2 += 8;
484
- }
485
- if (0 == (240 & Y2)) {
486
- for (X2 = j2, W2 = Y2, q2 = G2; V2 = a2.distcode[q2 + ((B2 & (1 << X2 + W2) - 1) >> X2)], j2 = V2 >>> 24, Y2 = V2 >>> 16 & 255, G2 = 65535 & V2, !(X2 + j2 <= C2); ) {
487
- if (0 === f2) break e;
488
- f2--, B2 += o2[l2++] << C2, C2 += 8;
489
- }
490
- B2 >>>= X2, C2 -= X2, a2.back += X2;
491
- }
492
- if (B2 >>>= j2, C2 -= j2, a2.back += j2, 64 & Y2) {
493
- e2.msg = "invalid distance code", a2.mode = D;
494
- break;
495
- }
496
- a2.offset = G2, a2.extra = 15 & Y2, a2.mode = 16203;
497
- case 16203:
498
- if (a2.extra) {
499
- for (te2 = a2.extra; C2 < te2; ) {
500
- if (0 === f2) break e;
501
- f2--, B2 += o2[l2++] << C2, C2 += 8;
502
- }
503
- a2.offset += B2 & (1 << a2.extra) - 1, B2 >>>= a2.extra, C2 -= a2.extra, a2.back += a2.extra;
504
- }
505
- if (a2.offset > a2.dmax) {
506
- e2.msg = "invalid distance too far back", a2.mode = D;
507
- break;
508
- }
509
- a2.mode = 16204;
510
- case 16204:
511
- if (0 === h2) break e;
512
- if (L2 = F2 - h2, a2.offset > L2) {
513
- if (L2 = a2.offset - L2, L2 > a2.whave && a2.sane) {
514
- e2.msg = "invalid distance too far back", a2.mode = D;
515
- break;
516
- }
517
- L2 > a2.wnext ? (L2 -= a2.wnext, M2 = a2.wsize - L2) : M2 = a2.wnext - L2, L2 > a2.length && (L2 = a2.length), H2 = a2.window;
518
- } else H2 = s2, M2 = d2 - a2.offset, L2 = a2.length;
519
- L2 > h2 && (L2 = h2), h2 -= L2, a2.length -= L2;
520
- do {
521
- s2[d2++] = H2[M2++];
522
- } while (--L2);
523
- 0 === a2.length && (a2.mode = O);
524
- break;
525
- case 16205:
526
- if (0 === h2) break e;
527
- s2[d2++] = a2.length, h2--, a2.mode = O;
528
- break;
529
- case U:
530
- if (a2.wrap) {
531
- for (; C2 < 32; ) {
532
- if (0 === f2) break e;
533
- f2--, B2 |= o2[l2++] << C2, C2 += 8;
534
- }
535
- if (F2 -= h2, e2.total_out += F2, a2.total += F2, 4 & a2.wrap && F2 && (e2.adler = a2.check = a2.flags ? n(a2.check, s2, F2, d2 - F2) : t(a2.check, s2, F2, d2 - F2)), F2 = h2, 4 & a2.wrap && (a2.flags ? B2 : I(B2)) !== a2.check) {
536
- e2.msg = "incorrect data check", a2.mode = D;
537
- break;
538
- }
539
- B2 = 0, C2 = 0;
540
- }
541
- a2.mode = 16207;
542
- case 16207:
543
- if (a2.wrap && a2.flags) {
544
- for (; C2 < 32; ) {
545
- if (0 === f2) break e;
546
- f2--, B2 += o2[l2++] << C2, C2 += 8;
547
- }
548
- if (4 & a2.wrap && B2 !== (4294967295 & a2.total)) {
549
- e2.msg = "incorrect length check", a2.mode = D;
550
- break;
551
- }
552
- B2 = 0, C2 = 0;
553
- }
554
- a2.mode = 16208;
555
- case 16208:
556
- Q2 = k;
557
- break e;
558
- case D:
559
- Q2 = p;
560
- break e;
561
- case 16210:
562
- return v;
563
- default:
564
- return g;
565
- }
566
- return e2.next_out = d2, e2.avail_out = h2, e2.next_in = l2, e2.avail_in = f2, a2.hold = B2, a2.bits = C2, (a2.wsize || F2 !== e2.avail_out && a2.mode < D && (a2.mode < U || i2 !== u)) && P(e2, e2.output, e2.next_out, F2 - e2.avail_out), z2 -= e2.avail_in, F2 -= e2.avail_out, e2.total_in += z2, e2.total_out += F2, a2.total += F2, 4 & a2.wrap && F2 && (e2.adler = a2.check = a2.flags ? n(a2.check, s2, F2, e2.next_out - F2) : t(a2.check, s2, F2, e2.next_out - F2)), e2.data_type = a2.bits + (a2.last ? 64 : 0) + (a2.mode === A ? 128 : 0) + (a2.mode === T || a2.mode === S ? 256 : 0), (0 === z2 && 0 === F2 || i2 === u) && Q2 === m && (Q2 = x), Q2;
567
- }, inflateEnd: (e2) => {
568
- if (N(e2)) return g;
569
- let t2 = e2.state;
570
- return t2.window && (t2.window = null), e2.state = null, m;
571
- }, inflateGetHeader: (e2, t2) => {
572
- if (N(e2)) return g;
573
- const i2 = e2.state;
574
- return 0 == (2 & i2.wrap) ? g : (i2.head = t2, t2.done = false, m);
575
- }, inflateSetDictionary: (e2, i2) => {
576
- const n2 = i2.length;
577
- let a2, r2, o2;
578
- return N(e2) ? g : (a2 = e2.state, 0 !== a2.wrap && a2.mode !== R ? g : a2.mode === R && (r2 = 1, r2 = t(r2, i2, n2, 0), r2 !== a2.check) ? p : (o2 = P(e2, i2, n2, n2), o2 ? (a2.mode = 16210, v) : (a2.havedict = 1, m)));
579
- }, inflateInfo: "pako inflate (from Nodeca project)" };
580
- const G = (e2, t2) => Object.prototype.hasOwnProperty.call(e2, t2);
581
- var X = function(e2) {
582
- const t2 = Array.prototype.slice.call(arguments, 1);
583
- for (; t2.length; ) {
584
- const i2 = t2.shift();
585
- if (i2) {
586
- if ("object" != typeof i2) throw new TypeError(i2 + "must be non-object");
587
- for (const t3 in i2) G(i2, t3) && (e2[t3] = i2[t3]);
588
- }
589
- }
590
- return e2;
591
- }, W = (e2) => {
592
- let t2 = 0;
593
- for (let i3 = 0, n2 = e2.length; i3 < n2; i3++) t2 += e2[i3].length;
594
- const i2 = new Uint8Array(t2);
595
- for (let t3 = 0, n2 = 0, a2 = e2.length; t3 < a2; t3++) {
596
- let a3 = e2[t3];
597
- i2.set(a3, n2), n2 += a3.length;
598
- }
599
- return i2;
600
- };
601
- let q = true;
602
- try {
603
- String.fromCharCode.apply(null, new Uint8Array(1));
604
- } catch (e2) {
605
- q = false;
606
- }
607
- const J = new Uint8Array(256);
608
- for (let e2 = 0; e2 < 256; e2++) J[e2] = e2 >= 252 ? 6 : e2 >= 248 ? 5 : e2 >= 240 ? 4 : e2 >= 224 ? 3 : e2 >= 192 ? 2 : 1;
609
- J[254] = J[254] = 1;
610
- var Q = (e2) => {
611
- if ("function" == typeof TextEncoder && TextEncoder.prototype.encode) return new TextEncoder().encode(e2);
612
- let t2, i2, n2, a2, r2, o2 = e2.length, s2 = 0;
613
- for (a2 = 0; a2 < o2; a2++) i2 = e2.charCodeAt(a2), 55296 == (64512 & i2) && a2 + 1 < o2 && (n2 = e2.charCodeAt(a2 + 1), 56320 == (64512 & n2) && (i2 = 65536 + (i2 - 55296 << 10) + (n2 - 56320), a2++)), s2 += i2 < 128 ? 1 : i2 < 2048 ? 2 : i2 < 65536 ? 3 : 4;
614
- for (t2 = new Uint8Array(s2), r2 = 0, a2 = 0; r2 < s2; a2++) i2 = e2.charCodeAt(a2), 55296 == (64512 & i2) && a2 + 1 < o2 && (n2 = e2.charCodeAt(a2 + 1), 56320 == (64512 & n2) && (i2 = 65536 + (i2 - 55296 << 10) + (n2 - 56320), a2++)), i2 < 128 ? t2[r2++] = i2 : i2 < 2048 ? (t2[r2++] = 192 | i2 >>> 6, t2[r2++] = 128 | 63 & i2) : i2 < 65536 ? (t2[r2++] = 224 | i2 >>> 12, t2[r2++] = 128 | i2 >>> 6 & 63, t2[r2++] = 128 | 63 & i2) : (t2[r2++] = 240 | i2 >>> 18, t2[r2++] = 128 | i2 >>> 12 & 63, t2[r2++] = 128 | i2 >>> 6 & 63, t2[r2++] = 128 | 63 & i2);
615
- return t2;
616
- }, V = (e2, t2) => {
617
- const i2 = t2 || e2.length;
618
- if ("function" == typeof TextDecoder && TextDecoder.prototype.decode) return new TextDecoder().decode(e2.subarray(0, t2));
619
- let n2, a2;
620
- const r2 = new Array(2 * i2);
621
- for (a2 = 0, n2 = 0; n2 < i2; ) {
622
- let t3 = e2[n2++];
623
- if (t3 < 128) {
624
- r2[a2++] = t3;
625
- continue;
626
- }
627
- let o2 = J[t3];
628
- if (o2 > 4) r2[a2++] = 65533, n2 += o2 - 1;
629
- else {
630
- for (t3 &= 2 === o2 ? 31 : 3 === o2 ? 15 : 7; o2 > 1 && n2 < i2; ) t3 = t3 << 6 | 63 & e2[n2++], o2--;
631
- o2 > 1 ? r2[a2++] = 65533 : t3 < 65536 ? r2[a2++] = t3 : (t3 -= 65536, r2[a2++] = 55296 | t3 >> 10 & 1023, r2[a2++] = 56320 | 1023 & t3);
632
- }
633
- }
634
- return ((e3, t3) => {
635
- if (t3 < 65534 && e3.subarray && q) return String.fromCharCode.apply(null, e3.length === t3 ? e3 : e3.subarray(0, t3));
636
- let i3 = "";
637
- for (let n3 = 0; n3 < t3; n3++) i3 += String.fromCharCode(e3[n3]);
638
- return i3;
639
- })(r2, a2);
640
- }, $ = (e2, t2) => {
641
- (t2 = t2 || e2.length) > e2.length && (t2 = e2.length);
642
- let i2 = t2 - 1;
643
- for (; i2 >= 0 && 128 == (192 & e2[i2]); ) i2--;
644
- return i2 < 0 || 0 === i2 ? t2 : i2 + J[e2[i2]] > t2 ? i2 : t2;
645
- }, ee = { 2: "need dictionary", 1: "stream end", 0: "", "-1": "file error", "-2": "stream error", "-3": "data error", "-4": "insufficient memory", "-5": "buffer error", "-6": "incompatible version" };
646
- var te = function() {
647
- this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
648
- };
649
- var ie = function() {
650
- this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = false;
651
- };
652
- const ne = Object.prototype.toString, { Z_NO_FLUSH: ae, Z_FINISH: re, Z_OK: oe, Z_STREAM_END: se, Z_NEED_DICT: le, Z_STREAM_ERROR: de, Z_DATA_ERROR: fe, Z_MEM_ERROR: ce } = h;
653
- function he(e2) {
654
- this.options = X({ chunkSize: 65536, windowBits: 15, to: "" }, e2 || {});
655
- const t2 = this.options;
656
- t2.raw && t2.windowBits >= 0 && t2.windowBits < 16 && (t2.windowBits = -t2.windowBits, 0 === t2.windowBits && (t2.windowBits = -15)), !(t2.windowBits >= 0 && t2.windowBits < 16) || e2 && e2.windowBits || (t2.windowBits += 32), t2.windowBits > 15 && t2.windowBits < 48 && 0 == (15 & t2.windowBits) && (t2.windowBits |= 15), this.err = 0, this.msg = "", this.ended = false, this.chunks = [], this.strm = new te(), this.strm.avail_out = 0;
657
- let i2 = Y.inflateInit2(this.strm, t2.windowBits);
658
- if (i2 !== oe) throw new Error(ee[i2]);
659
- if (this.header = new ie(), Y.inflateGetHeader(this.strm, this.header), t2.dictionary && ("string" == typeof t2.dictionary ? t2.dictionary = Q(t2.dictionary) : "[object ArrayBuffer]" === ne.call(t2.dictionary) && (t2.dictionary = new Uint8Array(t2.dictionary)), t2.raw && (i2 = Y.inflateSetDictionary(this.strm, t2.dictionary), i2 !== oe))) throw new Error(ee[i2]);
660
- }
661
- function ue(e2, t2) {
662
- const i2 = new he(t2);
663
- if (i2.push(e2), i2.err) throw i2.msg || ee[i2.err];
664
- return i2.result;
665
- }
666
- he.prototype.push = function(e2, t2) {
667
- const i2 = this.strm, n2 = this.options.chunkSize, a2 = this.options.dictionary;
668
- let r2, o2, s2;
669
- if (this.ended) return false;
670
- for (o2 = t2 === ~~t2 ? t2 : true === t2 ? re : ae, "[object ArrayBuffer]" === ne.call(e2) ? i2.input = new Uint8Array(e2) : i2.input = e2, i2.next_in = 0, i2.avail_in = i2.input.length; ; ) {
671
- for (0 === i2.avail_out && (i2.output = new Uint8Array(n2), i2.next_out = 0, i2.avail_out = n2), r2 = Y.inflate(i2, o2), r2 === le && a2 && (r2 = Y.inflateSetDictionary(i2, a2), r2 === oe ? r2 = Y.inflate(i2, o2) : r2 === fe && (r2 = le)); i2.avail_in > 0 && r2 === se && i2.state.wrap > 0 && 0 !== e2[i2.next_in]; ) Y.inflateReset(i2), r2 = Y.inflate(i2, o2);
672
- switch (r2) {
673
- case de:
674
- case fe:
675
- case le:
676
- case ce:
677
- return this.onEnd(r2), this.ended = true, false;
678
- }
679
- if (s2 = i2.avail_out, i2.next_out && (0 === i2.avail_out || r2 === se)) if ("string" === this.options.to) {
680
- let e3 = $(i2.output, i2.next_out), t3 = i2.next_out - e3, a3 = V(i2.output, e3);
681
- i2.next_out = t3, i2.avail_out = n2 - t3, t3 && i2.output.set(i2.output.subarray(e3, e3 + t3), 0), this.onData(a3);
682
- } else this.onData(i2.output.length === i2.next_out ? i2.output : i2.output.subarray(0, i2.next_out));
683
- if (r2 !== oe || 0 !== s2) {
684
- if (r2 === se) return r2 = Y.inflateEnd(this.strm), this.onEnd(r2), this.ended = true, true;
685
- if (0 === i2.avail_in) break;
686
- }
687
- }
688
- return true;
689
- }, he.prototype.onData = function(e2) {
690
- this.chunks.push(e2);
691
- }, he.prototype.onEnd = function(e2) {
692
- e2 === oe && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = W(this.chunks)), this.chunks = [], this.err = e2, this.msg = this.strm.msg;
693
- };
694
- var we = he, be = ue, me = function(e2, t2) {
695
- return (t2 = t2 || {}).raw = true, ue(e2, t2);
696
- }, ke = ue, _e = h, ge = { Inflate: we, inflate: be, inflateRaw: me, ungzip: ke, constants: _e };
697
- e.Inflate = we, e.constants = _e, e.default = ge, e.inflate = be, e.inflateRaw = me, e.ungzip = ke, Object.defineProperty(e, "__esModule", { value: true });
698
- }));