iflow-engine-base 3.9.16 → 3.9.162

package/dist2d/dwg-preview.es.js

@@ -1,16 +1,16 @@
 import * as _ from "three";
-import { Loader as dt, FileLoader as ut, ShapePath as ft, Vector4 as Pe, Vector3 as Ne, Curve as pt, BufferGeometry as mt, BufferAttribute as gt } from "three";
-import * as yt from "opentype.js";
-var Ae = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+import { Loader as ct, FileLoader as dt, ShapePath as ut, Vector4 as Pe, Vector3 as Ne, Curve as ft, BufferGeometry as pt, BufferAttribute as mt } from "three";
+import * as gt from "opentype.js";
+var Te = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
 function Je(M) {
   return M && M.__esModule && Object.prototype.hasOwnProperty.call(M, "default") ? M.default : M;
 }
-var Ie = { exports: {} }, vt = Ie.exports, Fe;
-function bt() {
+var Le = { exports: {} }, yt = Le.exports, Fe;
+function vt() {
   return Fe || (Fe = 1, (function(M, e) {
     (function(t, i) {
       M.exports = i();
-    })(vt, function() {
+    })(yt, function() {
       var t = function() {
         function i(d) {
           return s.appendChild(d.dom), d;
@@ -48,12 +48,12 @@ function bt() {
         } };
       }, t;
     });
-  })(Ie)), Ie.exports;
+  })(Le)), Le.exports;
 }
-var wt = bt();
-const xt = /* @__PURE__ */ Je(wt);
+var bt = vt();
+const wt = /* @__PURE__ */ Je(bt);
 var fe = /* @__PURE__ */ ((M) => (M.ModelLoadStart = "model-load-start", M.ModelLoadProgress = "model-load-progress", M.ModelLoaded = "model-loaded", M.ModelLoadError = "model-load-error", M.RenderStart = "render-start", M.RenderEnd = "render-end", M.CameraChanged = "camera-changed", M.CameraReset = "camera-reset", M.SelectionChanged = "selection-changed", M.HoverChanged = "hover-changed", M.EntityClick = "entity-click", M.LayerVisibilityChanged = "layer-visibility-changed", M.LayerColorChanged = "layer-color-changed", M.ViewZoomChanged = "view-zoom-changed", M.ViewPanChanged = "view-pan-changed", M.ToolActivated = "tool-activated", M.ToolDeactivated = "tool-deactivated", M.Error = "error", M.Warning = "warning", M))(fe || {});
-class kt {
+class xt {
   listeners = /* @__PURE__ */ new Map();
   onceListeners = /* @__PURE__ */ new Map();
   debugMode = !1;
@@ -165,7 +165,7 @@ class kt {
     this.removeAllListeners(), this.listeners.clear(), this.onceListeners.clear(), this.debugMode && console.log("[EventModule2d] Disposed");
   }
 }
-const Mt = `
+const kt = `
   varying vec2 vWorldPos;
 
   void main() {
@@ -173,7 +173,7 @@ const Mt = `
     vWorldPos = worldPosition.xy;
     gl_Position = projectionMatrix * viewMatrix * worldPosition;
   }
-`, _t = `
+`, Mt = `
   precision highp float;
 
   varying vec2 vWorldPos;
@@ -229,7 +229,7 @@ const Mt = `
     gl_FragColor = vec4(color, alpha);
   }
 `;
-class Et {
+class _t {
   scene;
   camera;
   container;
@@ -282,8 +282,8 @@ class Et {
   createGridMesh() {
     this.gridGeometry = new _.PlaneGeometry(1, 1, 1, 1), this.gridMaterial = new _.ShaderMaterial({
       uniforms: this.gridUniforms,
-      vertexShader: Mt,
-      fragmentShader: _t,
+      vertexShader: kt,
+      fragmentShader: Mt,
       transparent: !0,
       depthWrite: !1,
       depthTest: !1,
@@ -329,8 +329,8 @@ class Et {
       return;
     const t = Math.max(1, this.container.clientWidth), i = Math.max(1, this.container.clientHeight), n = this.camera.zoom, r = this.camera.right - this.camera.left, s = this.camera.top - this.camera.bottom, o = Math.max(this.minSpacing, r / n), a = Math.max(this.minSpacing, s / n), l = this.camera.position.x, c = this.camera.position.y, f = o / t, p = a / i, d = f * this.desiredMinorPixelSize, y = this.normalizeSpacing(d), h = this.lastState;
     if (!e) {
-      const b = Math.abs(n - h.zoom) / Math.max(1e-4, h.zoom || 1) > 0.02, k = Math.abs(y - h.minorSpacing) > h.minorSpacing * 0.05, S = Math.abs(l - h.centerX) > Math.max(y * 0.5, 0.01), C = Math.abs(c - h.centerY) > Math.max(y * 0.5, 0.01), R = Math.abs(o - h.viewWidth) > h.viewWidth * 0.01, z = Math.abs(a - h.viewHeight) > h.viewHeight * 0.01, W = t !== h.containerWidth || i !== h.containerHeight;
-      if (!(b || k || S || C || R || z || W))
+      const b = Math.abs(n - h.zoom) / Math.max(1e-4, h.zoom || 1) > 0.02, k = Math.abs(y - h.minorSpacing) > h.minorSpacing * 0.05, S = Math.abs(l - h.centerX) > Math.max(y * 0.5, 0.01), C = Math.abs(c - h.centerY) > Math.max(y * 0.5, 0.01), R = Math.abs(o - h.viewWidth) > h.viewWidth * 0.01, z = Math.abs(a - h.viewHeight) > h.viewHeight * 0.01, U = t !== h.containerWidth || i !== h.containerHeight;
+      if (!(b || k || S || C || R || z || U))
         return;
     }
     const g = o * this.coverageMultiplier, v = a * this.coverageMultiplier;
@@ -372,7 +372,7 @@ class Et {
     this.stopMonitoring(), this.teardownResizeObserver(), this.gridMesh && this.gridGroup.remove(this.gridMesh), this.gridGeometry && (this.gridGeometry.dispose(), this.gridGeometry = void 0), this.gridMaterial && (this.gridMaterial.dispose(), this.gridMaterial = void 0), this.gridMesh = void 0;
   }
 }
-class Ct {
+class Et {
   engine;
   scene;
   options;
@@ -405,7 +405,7 @@ class Ct {
    * 创建网格辅助（自适应网格）
    */
   createGrid(e = 1e3, t = 50) {
-    this.adaptiveGrid && (this.adaptiveGrid.dispose(), this.adaptiveGrid = void 0), this.adaptiveGrid = new Et(
+    this.adaptiveGrid && (this.adaptiveGrid.dispose(), this.adaptiveGrid = void 0), this.adaptiveGrid = new _t(
       this.scene,
       this.engine.cameraModule2d.orthographicCamera,
       this.engine.renderModule2d.container
@@ -507,7 +507,7 @@ class Ct {
     this.clearScene(), this.adaptiveGrid && (this.adaptiveGrid.dispose(), this.adaptiveGrid = void 0), this.axesHelper && (this.scene.remove(this.axesHelper), this.axesHelper = void 0), this.scene.clear();
   }
 }
-class St {
+class Ct {
   engine;
   isFree;
   // 高亮模型
@@ -523,7 +523,7 @@ class St {
     this.engine = e, this.isFree = !0, this.highlightModels = [], this.hideModels = [], this.translucentModels = [], this.highlightHoverModels = [], this.models = [];
   }
 }
-class Tt {
+class St {
   engine;
   orthographicCamera;
   container;
@@ -755,7 +755,7 @@ class Tt {
     this.animationId !== null && (cancelAnimationFrame(this.animationId), this.animationId = null), this.orthographicCamera = null;
   }
 }
-class At {
+class Tt {
   engine;
   renderer;
   container;
@@ -887,7 +887,7 @@ class At {
     window.removeEventListener("resize", this.onWindowResize.bind(this)), this.renderer.dispose(), this.container.contains(this.renderer.domElement) && this.container.removeChild(this.renderer.domElement), this.renderer = null;
   }
 }
-class Lt extends _.EventDispatcher {
+class At extends _.EventDispatcher {
   object;
   domElement;
   enabled = !0;
@@ -1097,7 +1097,7 @@ class Lt extends _.EventDispatcher {
     this.enabled = !1, this.domElement.removeEventListener("mousedown", this.onMouseDown.bind(this)), this.domElement.removeEventListener("mousemove", this.onMouseMove.bind(this)), this.domElement.removeEventListener("mouseup", this.onMouseUp.bind(this)), this.domElement.removeEventListener("mouseleave", this.onMouseUp.bind(this)), this.domElement.removeEventListener("wheel", this.onWheel.bind(this)), this.domElement.removeEventListener("dblclick", this.onDoubleClick.bind(this)), this.domElement.removeEventListener("click", this.onClick.bind(this)), this.domElement.removeEventListener("touchstart", this.onTouchStart.bind(this)), this.domElement.removeEventListener("touchmove", this.onTouchMove.bind(this)), this.domElement.removeEventListener("touchend", this.onTouchEnd.bind(this));
   }
 }
-class It {
+class Lt {
   engine;
   panControls;
   isActive = !0;
@@ -1114,7 +1114,7 @@ class It {
    * 创建 2D 平移控制器
    */
   createPanControls() {
-    const e = new Lt(
+    const e = new At(
       this.engine.camera,
       this.engine.renderer.domElement
     );
@@ -1230,7 +1230,7 @@ class It {
     this.panControls.dispose(), this.panControls = null;
   }
 }
-class Pt extends dt {
+class Pt extends ct {
   /**
    * Constructs a new font loader.
    *
@@ -1249,7 +1249,7 @@ class Pt extends dt {
    * @param {onErrorCallback} onError - Executed when errors occur.
    */
   load(e, t, i, n) {
-    const r = this, s = new ut(this.manager);
+    const r = this, s = new dt(this.manager);
     s.setPath(this.path), s.setRequestHeader(this.requestHeader), s.setWithCredentials(this.withCredentials), s.load(e, function(o) {
       const a = r.parse(JSON.parse(o));
       t && t(a);
@@ -1262,10 +1262,10 @@ class Pt extends dt {
    * @return {Font} The font.
    */
   parse(e) {
-    return new zt(e);
+    return new It(e);
   }
 }
-class zt {
+class It {
   /**
    * Constructs a new font.
    *
@@ -1284,13 +1284,13 @@ class zt {
    * @return {Array<Shape>} An array of shapes representing the text.
    */
   generateShapes(e, t = 100, i = "ltr") {
-    const n = [], r = Dt(e, t, this.data, i);
+    const n = [], r = zt(e, t, this.data, i);
     for (let s = 0, o = r.length; s < o; s++)
       n.push(...r[s].toShapes());
     return n;
   }
 }
-function Dt(M, e, t, i) {
+function zt(M, e, t, i) {
   const n = Array.from(M), r = e / t.resolution, s = (t.boundingBox.yMax - t.boundingBox.yMin + t.underlineThickness) * r, o = [];
   let a = 0, l = 0;
   (i == "rtl" || i == "tb") && n.reverse();
@@ -1300,19 +1300,19 @@ function Dt(M, e, t, i) {
 `)
       a = 0, l -= s;
     else {
-      const p = Bt(f, r, a, l, t);
+      const p = Dt(f, r, a, l, t);
       i == "tb" ? (a = 0, l += t.ascender * r) : a += p.offsetX, o.push(p.path);
     }
   }
   return o;
 }
-function Bt(M, e, t, i, n) {
+function Dt(M, e, t, i, n) {
   const r = n.glyphs[M] || n.glyphs["?"];
   if (!r) {
     console.error('THREE.Font: character "' + M + '" does not exists in font family ' + n.familyName + ".");
     return;
   }
-  const s = new ft();
+  const s = new ut();
   let o, a, l, c, f, p, d, y;
   if (r.o) {
     const h = r._cachedOutline || (r._cachedOutline = r.o.split(" "));
@@ -1344,7 +1344,7 @@ class ce {
   }
   /** 从 ArrayBuffer 解析字体，生成 typeface.json。 */
   static fromArrayBuffer(e, t) {
-    const i = yt.parse(e);
+    const i = gt.parse(e);
     return ce._convert(i, t?.chars);
   }
   /** 将 typeface.json 转为 Three.js Font 对象，可直接用于文字几何。 */
@@ -1487,7 +1487,76 @@ class ce {
     return i;
   }
 }
-class Rt {
+const Bt = "__BIM_ENGINE_SDK_ASSET_BASE__", Rt = "https://unpkg.com/iflow-engine-base@3.9.16/dist/";
+function Nt() {
+  return typeof globalThis < "u" ? globalThis : null;
+}
+function Ve(M) {
+  return M.endsWith("/") ? M : `${M}/`;
+}
+function et(M) {
+  return /^(?:[a-z][a-z\d+\-.]*:)?\/\//i.test(M) || /^(?:data|blob):/i.test(M);
+}
+function Ot(M) {
+  return M.startsWith("./") || M.startsWith("../");
+}
+function Ie(M, e) {
+  try {
+    return e ? new URL(M, e).toString() : new URL(M).toString();
+  } catch {
+    return null;
+  }
+}
+function tt() {
+  return typeof document < "u" && document.baseURI ? document.baseURI : typeof location < "u" && location.href ? location.href : null;
+}
+function Vt(M, e) {
+  const t = Ve(M);
+  if (et(t))
+    return t;
+  const i = ze(e) || jt() || tt();
+  return Ie(t, i || void 0) || t;
+}
+function ze(M) {
+  if (!M)
+    return null;
+  try {
+    const e = tt(), t = Ie(M, e || void 0) || M, i = new URL(".", t), n = i.pathname.replace(/\\/g, "/");
+    return n.endsWith("/chunks/") ? new URL("../", i).toString() : e && /\/src\//.test(n) ? Ve(e) : i.toString();
+  } catch {
+    return null;
+  }
+}
+function jt() {
+  if (typeof document > "u")
+    return null;
+  const M = document.currentScript;
+  if (M?.src)
+    return ze(M.src);
+  const e = document.getElementsByTagName("script");
+  for (let t = e.length - 1; t >= 0; t -= 1) {
+    const i = e[t]?.src;
+    if (i && /(?:bim-engine-sdk|iflow-engine-base|dwg-preview|gaussian)\.(?:es|umd)\.js(?:[?#].*)?$/.test(i))
+      return ze(i);
+  }
+  return null;
+}
+function Ut(M) {
+  const t = Nt()?.[Bt];
+  return typeof t == "string" && t.length > 0 ? Vt(t, M) : Ve(Rt);
+}
+function be(M, e) {
+  if (et(M))
+    return M;
+  if (Ot(M)) {
+    const n = Ie(M, ze(e) || void 0);
+    if (n)
+      return n;
+  }
+  const t = M.replace(/^\/+/, ""), i = Ut(e);
+  return Ie(t, i) || t;
+}
+class Wt {
   panel = null;
   listEl = null;
   isVisible = !1;
@@ -1634,14 +1703,14 @@ class Rt {
     this.panel?.remove(), this.panel = null, this.listEl = null;
   }
 }
-class et {
+class it {
   engine;
   layerMap = /* @__PURE__ */ new Map();
   panelUI = null;
   constructor(e) {
     this.engine = e;
     const t = document.getElementById(e?.options?.containerId ?? "") ?? e?.container ?? null;
-    t && (this.panelUI = new Rt(t, this));
+    t && (this.panelUI = new Wt(t, this));
   }
   // ─── 数据 ──────────────────────────────────────────────
   _loadLayers(e = this.engine.dwgData?.layers ?? []) {
@@ -1768,7 +1837,7 @@ class et {
     this.panelUI?.dispose(), this.panelUI = null, this.layerMap.clear();
   }
 }
-function be(M) {
+function we(M) {
   return Array.isArray(M) ? new _.Vector3(M[0] ?? 0, M[1] ?? 0, M[2] ?? 0) : new _.Vector3(M?.x ?? 0, M?.y ?? 0, M?.z ?? 0);
 }
 function xe(M) {
@@ -1781,14 +1850,14 @@ function Oe(M, e, t) {
   const i = new _.Vector3(M[0] ?? 0, M[1] ?? 0, M[2] ?? 0), n = new _.Euler(0, 0, t ?? 0), r = new _.Vector3(e[0] ?? 1, e[1] ?? 1, e[2] ?? 1), s = new _.Quaternion().setFromEuler(n);
   return new _.Matrix4().compose(i, s, r);
 }
-function Nt(M) {
+function Ft(M) {
   return Array.isArray(M?.transformMatrix) && M.transformMatrix.length === 16 ? new _.Matrix4().fromArray(M.transformMatrix) : Oe(
     M.position ?? [0, 0, 0],
     M.scale ?? [1, 1, 1],
     M.rotation ?? 0
   );
 }
-function tt(M) {
+function nt(M) {
   if (M.length === 0)
     return { min: new _.Vector3(), max: new _.Vector3() };
   const e = new _.Vector3(Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY), t = new _.Vector3(Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY);
@@ -1843,7 +1912,7 @@ class Ge {
     for (const n of e)
       if (n?.visible !== !1) {
         if (n.type === "INSERT") {
-          const r = this.getBlockItems(n.blockId, i + 1), s = t.clone().multiply(Nt(n)), o = this.getClipPolygon(n, t);
+          const r = this.getBlockItems(n.blockId, i + 1), s = t.clone().multiply(Ft(n)), o = this.getClipPolygon(n, t);
           for (const a of r) {
             const l = this.cloneRenderItem(a, s, n), c = o ? this.clipRenderItem(l, o) : l;
             c && (yield c);
@@ -2057,12 +2126,12 @@ class Ge {
     };
   }
 }
-function Le(M) {
+function Ae(M) {
   throw new Error('Could not dynamically require "' + M + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
 }
 var Be = { exports: {} };
 var He;
-function Ot() {
+function Gt() {
   return He || (He = 1, (function(M, e) {
     (function(t) {
       M.exports = t();
@@ -2071,7 +2140,7 @@ function Ot() {
         function s(l, c) {
           if (!n[l]) {
             if (!i[l]) {
-              var f = typeof Le == "function" && Le;
+              var f = typeof Ae == "function" && Ae;
               if (!c && f) return f(l, !0);
               if (o) return o(l, !0);
               var p = new Error("Cannot find module '" + l + "'");
@@ -2085,7 +2154,7 @@ function Ot() {
           }
           return n[l].exports;
         }
-        for (var o = typeof Le == "function" && Le, a = 0; a < r.length; a++) s(r[a]);
+        for (var o = typeof Ae == "function" && Ae, a = 0; a < r.length; a++) s(r[a]);
         return s;
       })({ 1: [function(t, i, n) {
         var r = t("./utils"), s = t("./support"), o = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
@@ -2178,20 +2247,20 @@ function Ot() {
           return g;
         }
         function s(d, y, h, g, v, b) {
-          var k, S, C = d.file, R = d.compression, z = b !== l.utf8encode, W = o.transformTo("string", b(C.name)), D = o.transformTo("string", l.utf8encode(C.name)), H = C.comment, q = o.transformTo("string", b(H)), E = o.transformTo("string", l.utf8encode(H)), B = D.length !== C.name.length, m = E.length !== H.length, O = "", ee = "", U = "", te = C.dir, F = C.date, J = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+          var k, S, C = d.file, R = d.compression, z = b !== l.utf8encode, U = o.transformTo("string", b(C.name)), D = o.transformTo("string", l.utf8encode(C.name)), H = C.comment, q = o.transformTo("string", b(H)), E = o.transformTo("string", l.utf8encode(H)), B = D.length !== C.name.length, m = E.length !== H.length, O = "", ee = "", W = "", te = C.dir, F = C.date, J = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
           y && !h || (J.crc32 = d.crc32, J.compressedSize = d.compressedSize, J.uncompressedSize = d.uncompressedSize);
-          var I = 0;
-          y && (I |= 8), z || !B && !m || (I |= 2048);
+          var P = 0;
+          y && (P |= 8), z || !B && !m || (P |= 2048);
           var L = 0, Q = 0;
           te && (L |= 16), v === "UNIX" ? (Q = 798, L |= (function(Z, ae) {
             var ue = Z;
             return Z || (ue = ae ? 16893 : 33204), (65535 & ue) << 16;
           })(C.unixPermissions, te)) : (Q = 20, L |= (function(Z) {
             return 63 & (Z || 0);
-          })(C.dosPermissions)), k = F.getUTCHours(), k <<= 6, k |= F.getUTCMinutes(), k <<= 5, k |= F.getUTCSeconds() / 2, S = F.getUTCFullYear() - 1980, S <<= 4, S |= F.getUTCMonth() + 1, S <<= 5, S |= F.getUTCDate(), B && (ee = r(1, 1) + r(c(W), 4) + D, O += "up" + r(ee.length, 2) + ee), m && (U = r(1, 1) + r(c(q), 4) + E, O += "uc" + r(U.length, 2) + U);
+          })(C.dosPermissions)), k = F.getUTCHours(), k <<= 6, k |= F.getUTCMinutes(), k <<= 5, k |= F.getUTCSeconds() / 2, S = F.getUTCFullYear() - 1980, S <<= 4, S |= F.getUTCMonth() + 1, S <<= 5, S |= F.getUTCDate(), B && (ee = r(1, 1) + r(c(U), 4) + D, O += "up" + r(ee.length, 2) + ee), m && (W = r(1, 1) + r(c(q), 4) + E, O += "uc" + r(W.length, 2) + W);
           var Y = "";
           return Y += `
-\0`, Y += r(I, 2), Y += R.magic, Y += r(k, 2), Y += r(S, 2), Y += r(J.crc32, 4), Y += r(J.compressedSize, 4), Y += r(J.uncompressedSize, 4), Y += r(W.length, 2), Y += r(O.length, 2), { fileRecord: f.LOCAL_FILE_HEADER + Y + W + O, dirRecord: f.CENTRAL_FILE_HEADER + r(Q, 2) + Y + r(q.length, 2) + "\0\0\0\0" + r(L, 4) + r(g, 4) + W + O + q };
+\0`, Y += r(P, 2), Y += R.magic, Y += r(k, 2), Y += r(S, 2), Y += r(J.crc32, 4), Y += r(J.compressedSize, 4), Y += r(J.uncompressedSize, 4), Y += r(U.length, 2), Y += r(O.length, 2), { fileRecord: f.LOCAL_FILE_HEADER + Y + U + O, dirRecord: f.CENTRAL_FILE_HEADER + r(Q, 2) + Y + r(q.length, 2) + "\0\0\0\0" + r(L, 4) + r(g, 4) + U + O + q };
         }
         var o = t("../utils"), a = t("../stream/GenericWorker"), l = t("../utf8"), c = t("../crc32"), f = t("../signature");
         function p(d, y, h, g) {
@@ -2360,8 +2429,8 @@ function Ot() {
         } };
       }, {}], 15: [function(t, i, n) {
         function r(C, R, z) {
-          var W, D = o.getTypeOf(R), H = o.extend(z || {}, c);
-          H.date = H.date || /* @__PURE__ */ new Date(), H.compression !== null && (H.compression = H.compression.toUpperCase()), typeof H.unixPermissions == "string" && (H.unixPermissions = parseInt(H.unixPermissions, 8)), H.unixPermissions && 16384 & H.unixPermissions && (H.dir = !0), H.dosPermissions && 16 & H.dosPermissions && (H.dir = !0), H.dir && (C = v(C)), H.createFolders && (W = g(C)) && b.call(this, W, !0);
+          var U, D = o.getTypeOf(R), H = o.extend(z || {}, c);
+          H.date = H.date || /* @__PURE__ */ new Date(), H.compression !== null && (H.compression = H.compression.toUpperCase()), typeof H.unixPermissions == "string" && (H.unixPermissions = parseInt(H.unixPermissions, 8)), H.unixPermissions && 16384 & H.unixPermissions && (H.dir = !0), H.dosPermissions && 16 & H.dosPermissions && (H.dir = !0), H.dir && (C = v(C)), H.createFolders && (U = g(C)) && b.call(this, U, !0);
           var q = D === "string" && H.binary === !1 && H.base64 === !1;
           z && z.binary !== void 0 || (H.binary = !q), (R instanceof f && R.uncompressedSize === 0 || H.dir || !R || R.length === 0) && (H.base64 = !1, H.binary = !0, R = "", H.compression = "STORE", D = "string");
           var E = null;
@@ -2384,19 +2453,19 @@ function Ot() {
         var S = { load: function() {
           throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
         }, forEach: function(C) {
-          var R, z, W;
-          for (R in this.files) W = this.files[R], (z = R.slice(this.root.length, R.length)) && R.slice(0, this.root.length) === this.root && C(z, W);
+          var R, z, U;
+          for (R in this.files) U = this.files[R], (z = R.slice(this.root.length, R.length)) && R.slice(0, this.root.length) === this.root && C(z, U);
         }, filter: function(C) {
           var R = [];
-          return this.forEach(function(z, W) {
-            C(z, W) && R.push(W);
+          return this.forEach(function(z, U) {
+            C(z, U) && R.push(U);
           }), R;
         }, file: function(C, R, z) {
           if (arguments.length !== 1) return C = this.root + C, r.call(this, C, R, z), this;
           if (k(C)) {
-            var W = C;
+            var U = C;
             return this.filter(function(H, q) {
-              return !q.dir && W.test(H);
+              return !q.dir && U.test(H);
             });
           }
           var D = this.files[this.root + C];
@@ -2406,15 +2475,15 @@ function Ot() {
           if (k(C)) return this.filter(function(D, H) {
             return H.dir && C.test(D);
           });
-          var R = this.root + C, z = b.call(this, R), W = this.clone();
-          return W.root = z.name, W;
+          var R = this.root + C, z = b.call(this, R), U = this.clone();
+          return U.root = z.name, U;
         }, remove: function(C) {
           C = this.root + C;
           var R = this.files[C];
           if (R || (C.slice(-1) !== "/" && (C += "/"), R = this.files[C]), R && !R.dir) delete this.files[C];
           else for (var z = this.filter(function(D, H) {
             return H.name.slice(0, C.length) === C;
-          }), W = 0; W < z.length; W++) delete this.files[z[W].name];
+          }), U = 0; U < z.length; U++) delete this.files[z[U].name];
           return this;
         }, generate: function() {
           throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
@@ -2423,8 +2492,8 @@ function Ot() {
           try {
             if ((z = o.extend(C || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: s.utf8encode })).type = z.type.toLowerCase(), z.compression = z.compression.toUpperCase(), z.type === "binarystring" && (z.type = "string"), !z.type) throw new Error("No output type specified.");
             o.checkSupport(z.type), z.platform !== "darwin" && z.platform !== "freebsd" && z.platform !== "linux" && z.platform !== "sunos" || (z.platform = "UNIX"), z.platform === "win32" && (z.platform = "DOS");
-            var W = z.comment || this.comment || "";
-            R = d.generateWorker(this, z, W);
+            var U = z.comment || this.comment || "";
+            R = d.generateWorker(this, z, U);
           } catch (D) {
             (R = new a("error")).error(D);
           }
@@ -2660,28 +2729,28 @@ function Ot() {
               b = [], v(R);
             }).on("end", function() {
               try {
-                var R = (function(z, W, D) {
+                var R = (function(z, U, D) {
                   switch (z) {
                     case "blob":
-                      return r.newBlob(r.transformTo("arraybuffer", W), D);
+                      return r.newBlob(r.transformTo("arraybuffer", U), D);
                     case "base64":
-                      return a.encode(W);
+                      return a.encode(U);
                     default:
-                      return r.transformTo(z, W);
+                      return r.transformTo(z, U);
                   }
-                })(S, (function(z, W) {
+                })(S, (function(z, U) {
                   var D, H = 0, q = null, E = 0;
-                  for (D = 0; D < W.length; D++) E += W[D].length;
+                  for (D = 0; D < U.length; D++) E += U[D].length;
                   switch (z) {
                     case "string":
-                      return W.join("");
+                      return U.join("");
                     case "array":
-                      return Array.prototype.concat.apply([], W);
+                      return Array.prototype.concat.apply([], U);
                     case "uint8array":
-                      for (q = new Uint8Array(E), D = 0; D < W.length; D++) q.set(W[D], H), H += W[D].length;
+                      for (q = new Uint8Array(E), D = 0; D < U.length; D++) q.set(U[D], H), H += U[D].length;
                       return q;
                     case "nodebuffer":
-                      return Buffer.concat(W);
+                      return Buffer.concat(U);
                     default:
                       throw new Error("concat : unsupported type '" + z + "'");
                   }
@@ -2921,10 +2990,10 @@ function Ot() {
           return a.Promise.resolve(g).then(function(S) {
             return r.blob && (S instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(S)) !== -1) && typeof FileReader < "u" ? new a.Promise(function(C, R) {
               var z = new FileReader();
-              z.onload = function(W) {
-                C(W.target.result);
-              }, z.onerror = function(W) {
-                R(W.target.error);
+              z.onload = function(U) {
+                C(U.target.result);
+              }, z.onerror = function(U) {
+                R(U.target.error);
               }, z.readAsArrayBuffer(S);
             }) : S;
           }).then(function(S) {
@@ -3120,7 +3189,7 @@ function Ot() {
           i.exports = function(h) {
             d.push(h) !== 1 || o || s();
           };
-        }).call(this, typeof Ae < "u" ? Ae : typeof self < "u" ? self : typeof window < "u" ? window : {});
+        }).call(this, typeof Te < "u" ? Te : typeof self < "u" ? self : typeof window < "u" ? window : {});
       }, {}], 37: [function(t, i, n) {
         var r = t("immediate");
         function s() {
@@ -3222,13 +3291,13 @@ function Ot() {
           if (Object.prototype.toString.call(v) !== "[object Array]") return this.reject(new TypeError("must be an array"));
           var k = v.length, S = !1;
           if (!k) return this.resolve([]);
-          for (var C = new Array(k), R = 0, z = -1, W = new this(s); ++z < k; ) D(v[z], z);
-          return W;
+          for (var C = new Array(k), R = 0, z = -1, U = new this(s); ++z < k; ) D(v[z], z);
+          return U;
           function D(H, q) {
             b.resolve(H).then(function(E) {
-              C[q] = E, ++R !== k || S || (S = !0, o.resolve(W, C));
+              C[q] = E, ++R !== k || S || (S = !0, o.resolve(U, C));
             }, function(E) {
-              S || (S = !0, o.reject(W, E));
+              S || (S = !0, o.reject(U, E));
             });
           }
         }, f.race = function(v) {
@@ -3236,10 +3305,10 @@ function Ot() {
           if (Object.prototype.toString.call(v) !== "[object Array]") return this.reject(new TypeError("must be an array"));
           var k = v.length, S = !1;
           if (!k) return this.resolve([]);
-          for (var C = -1, R = new this(s); ++C < k; ) z = v[C], b.resolve(z).then(function(W) {
-            S || (S = !0, o.resolve(R, W));
-          }, function(W) {
-            S || (S = !0, o.reject(R, W));
+          for (var C = -1, R = new this(s); ++C < k; ) z = v[C], b.resolve(z).then(function(U) {
+            S || (S = !0, o.resolve(R, U));
+          }, function(U) {
+            S || (S = !0, o.reject(R, U));
           });
           var z;
           return R;
@@ -3302,12 +3371,12 @@ function Ot() {
           return v.result;
         }
         d.prototype.push = function(h, g) {
-          var v, b, k, S, C, R, z = this.strm, W = this.options.chunkSize, D = this.options.dictionary, H = !1;
+          var v, b, k, S, C, R, z = this.strm, U = this.options.chunkSize, D = this.options.dictionary, H = !1;
           if (this.ended) return !1;
           b = g === ~~g ? g : g === !0 ? a.Z_FINISH : a.Z_NO_FLUSH, typeof h == "string" ? z.input = o.binstring2buf(h) : p.call(h) === "[object ArrayBuffer]" ? z.input = new Uint8Array(h) : z.input = h, z.next_in = 0, z.avail_in = z.input.length;
           do {
-            if (z.avail_out === 0 && (z.output = new s.Buf8(W), z.next_out = 0, z.avail_out = W), (v = r.inflate(z, a.Z_NO_FLUSH)) === a.Z_NEED_DICT && D && (R = typeof D == "string" ? o.string2buf(D) : p.call(D) === "[object ArrayBuffer]" ? new Uint8Array(D) : D, v = r.inflateSetDictionary(this.strm, R)), v === a.Z_BUF_ERROR && H === !0 && (v = a.Z_OK, H = !1), v !== a.Z_STREAM_END && v !== a.Z_OK) return this.onEnd(v), !(this.ended = !0);
-            z.next_out && (z.avail_out !== 0 && v !== a.Z_STREAM_END && (z.avail_in !== 0 || b !== a.Z_FINISH && b !== a.Z_SYNC_FLUSH) || (this.options.to === "string" ? (k = o.utf8border(z.output, z.next_out), S = z.next_out - k, C = o.buf2string(z.output, k), z.next_out = S, z.avail_out = W - S, S && s.arraySet(z.output, z.output, k, S, 0), this.onData(C)) : this.onData(s.shrinkBuf(z.output, z.next_out)))), z.avail_in === 0 && z.avail_out === 0 && (H = !0);
+            if (z.avail_out === 0 && (z.output = new s.Buf8(U), z.next_out = 0, z.avail_out = U), (v = r.inflate(z, a.Z_NO_FLUSH)) === a.Z_NEED_DICT && D && (R = typeof D == "string" ? o.string2buf(D) : p.call(D) === "[object ArrayBuffer]" ? new Uint8Array(D) : D, v = r.inflateSetDictionary(this.strm, R)), v === a.Z_BUF_ERROR && H === !0 && (v = a.Z_OK, H = !1), v !== a.Z_STREAM_END && v !== a.Z_OK) return this.onEnd(v), !(this.ended = !0);
+            z.next_out && (z.avail_out !== 0 && v !== a.Z_STREAM_END && (z.avail_in !== 0 || b !== a.Z_FINISH && b !== a.Z_SYNC_FLUSH) || (this.options.to === "string" ? (k = o.utf8border(z.output, z.next_out), S = z.next_out - k, C = o.buf2string(z.output, k), z.next_out = S, z.avail_out = U - S, S && s.arraySet(z.output, z.output, k, S, 0), this.onData(C)) : this.onData(s.shrinkBuf(z.output, z.next_out)))), z.avail_in === 0 && z.avail_out === 0 && (H = !0);
           } while ((0 < z.avail_in || z.avail_out === 0) && v !== a.Z_STREAM_END);
           return v === a.Z_STREAM_END && (b = a.Z_FINISH), b === a.Z_FINISH ? (v = r.inflateEnd(this.strm), this.onEnd(v), this.ended = !0, v === a.Z_OK) : b !== a.Z_SYNC_FLUSH || (this.onEnd(a.Z_OK), !(z.avail_out = 0));
         }, d.prototype.onData = function(h) {
@@ -3415,7 +3484,7 @@ function Ot() {
           return -1 ^ s;
         };
       }, {}], 46: [function(t, i, n) {
-        var r, s = t("../utils/common"), o = t("./trees"), a = t("./adler32"), l = t("./crc32"), c = t("./messages"), f = 0, p = 4, d = 0, y = -2, h = -1, g = 4, v = 2, b = 8, k = 9, S = 286, C = 30, R = 19, z = 2 * S + 1, W = 15, D = 3, H = 258, q = H + D + 1, E = 42, B = 113, m = 1, O = 2, ee = 3, U = 4;
+        var r, s = t("../utils/common"), o = t("./trees"), a = t("./adler32"), l = t("./crc32"), c = t("./messages"), f = 0, p = 4, d = 0, y = -2, h = -1, g = 4, v = 2, b = 8, k = 9, S = 286, C = 30, R = 19, z = 2 * S + 1, U = 15, D = 3, H = 258, q = H + D + 1, E = 42, B = 113, m = 1, O = 2, ee = 3, W = 4;
         function te(u, N) {
           return u.msg = c[N], N;
         }
@@ -3425,12 +3494,12 @@ function Ot() {
         function J(u) {
           for (var N = u.length; 0 <= --N; ) u[N] = 0;
         }
-        function I(u) {
-          var N = u.state, P = N.pending;
-          P > u.avail_out && (P = u.avail_out), P !== 0 && (s.arraySet(u.output, N.pending_buf, N.pending_out, P, u.next_out), u.next_out += P, N.pending_out += P, u.total_out += P, u.avail_out -= P, N.pending -= P, N.pending === 0 && (N.pending_out = 0));
+        function P(u) {
+          var N = u.state, I = N.pending;
+          I > u.avail_out && (I = u.avail_out), I !== 0 && (s.arraySet(u.output, N.pending_buf, N.pending_out, I, u.next_out), u.next_out += I, N.pending_out += I, u.total_out += I, u.avail_out -= I, N.pending -= I, N.pending === 0 && (N.pending_out = 0));
         }
         function L(u, N) {
-          o._tr_flush_block(u, 0 <= u.block_start ? u.block_start : -1, u.strstart - u.block_start, N), u.block_start = u.strstart, I(u.strm);
+          o._tr_flush_block(u, 0 <= u.block_start ? u.block_start : -1, u.strstart - u.block_start, N), u.block_start = u.strstart, P(u.strm);
         }
         function Q(u, N) {
           u.pending_buf[u.pending++] = N;
@@ -3439,14 +3508,14 @@ function Ot() {
           u.pending_buf[u.pending++] = N >>> 8 & 255, u.pending_buf[u.pending++] = 255 & N;
         }
         function Z(u, N) {
-          var P, x, w = u.max_chain_length, T = u.strstart, V = u.prev_length, j = u.nice_match, A = u.strstart > u.w_size - q ? u.strstart - (u.w_size - q) : 0, G = u.window, X = u.w_mask, $ = u.prev, K = u.strstart + H, se = G[T + V - 1], ne = G[T + V];
+          var I, x, w = u.max_chain_length, T = u.strstart, V = u.prev_length, j = u.nice_match, A = u.strstart > u.w_size - q ? u.strstart - (u.w_size - q) : 0, G = u.window, X = u.w_mask, $ = u.prev, K = u.strstart + H, se = G[T + V - 1], ne = G[T + V];
           u.prev_length >= u.good_match && (w >>= 2), j > u.lookahead && (j = u.lookahead);
           do
-            if (G[(P = N) + V] === ne && G[P + V - 1] === se && G[P] === G[T] && G[++P] === G[T + 1]) {
-              T += 2, P++;
+            if (G[(I = N) + V] === ne && G[I + V - 1] === se && G[I] === G[T] && G[++I] === G[T + 1]) {
+              T += 2, I++;
               do
                 ;
-              while (G[++T] === G[++P] && G[++T] === G[++P] && G[++T] === G[++P] && G[++T] === G[++P] && G[++T] === G[++P] && G[++T] === G[++P] && G[++T] === G[++P] && G[++T] === G[++P] && T < K);
+              while (G[++T] === G[++I] && G[++T] === G[++I] && G[++T] === G[++I] && G[++T] === G[++I] && G[++T] === G[++I] && G[++T] === G[++I] && G[++T] === G[++I] && G[++T] === G[++I] && T < K);
               if (x = H - (K - T), T = K - H, V < x) {
                 if (u.match_start = N, j <= (V = x)) break;
                 se = G[T + V - 1], ne = G[T + V];
@@ -3456,52 +3525,52 @@ function Ot() {
           return V <= u.lookahead ? V : u.lookahead;
         }
         function ae(u) {
-          var N, P, x, w, T, V, j, A, G, X, $ = u.w_size;
+          var N, I, x, w, T, V, j, A, G, X, $ = u.w_size;
           do {
             if (w = u.window_size - u.lookahead - u.strstart, u.strstart >= $ + ($ - q)) {
-              for (s.arraySet(u.window, u.window, $, $, 0), u.match_start -= $, u.strstart -= $, u.block_start -= $, N = P = u.hash_size; x = u.head[--N], u.head[N] = $ <= x ? x - $ : 0, --P; ) ;
-              for (N = P = $; x = u.prev[--N], u.prev[N] = $ <= x ? x - $ : 0, --P; ) ;
+              for (s.arraySet(u.window, u.window, $, $, 0), u.match_start -= $, u.strstart -= $, u.block_start -= $, N = I = u.hash_size; x = u.head[--N], u.head[N] = $ <= x ? x - $ : 0, --I; ) ;
+              for (N = I = $; x = u.prev[--N], u.prev[N] = $ <= x ? x - $ : 0, --I; ) ;
               w += $;
             }
             if (u.strm.avail_in === 0) break;
-            if (V = u.strm, j = u.window, A = u.strstart + u.lookahead, G = w, X = void 0, X = V.avail_in, G < X && (X = G), P = X === 0 ? 0 : (V.avail_in -= X, s.arraySet(j, V.input, V.next_in, X, A), V.state.wrap === 1 ? V.adler = a(V.adler, j, X, A) : V.state.wrap === 2 && (V.adler = l(V.adler, j, X, A)), V.next_in += X, V.total_in += X, X), u.lookahead += P, u.lookahead + u.insert >= D) for (T = u.strstart - u.insert, u.ins_h = u.window[T], u.ins_h = (u.ins_h << u.hash_shift ^ u.window[T + 1]) & u.hash_mask; u.insert && (u.ins_h = (u.ins_h << u.hash_shift ^ u.window[T + D - 1]) & u.hash_mask, u.prev[T & u.w_mask] = u.head[u.ins_h], u.head[u.ins_h] = T, T++, u.insert--, !(u.lookahead + u.insert < D)); ) ;
+            if (V = u.strm, j = u.window, A = u.strstart + u.lookahead, G = w, X = void 0, X = V.avail_in, G < X && (X = G), I = X === 0 ? 0 : (V.avail_in -= X, s.arraySet(j, V.input, V.next_in, X, A), V.state.wrap === 1 ? V.adler = a(V.adler, j, X, A) : V.state.wrap === 2 && (V.adler = l(V.adler, j, X, A)), V.next_in += X, V.total_in += X, X), u.lookahead += I, u.lookahead + u.insert >= D) for (T = u.strstart - u.insert, u.ins_h = u.window[T], u.ins_h = (u.ins_h << u.hash_shift ^ u.window[T + 1]) & u.hash_mask; u.insert && (u.ins_h = (u.ins_h << u.hash_shift ^ u.window[T + D - 1]) & u.hash_mask, u.prev[T & u.w_mask] = u.head[u.ins_h], u.head[u.ins_h] = T, T++, u.insert--, !(u.lookahead + u.insert < D)); ) ;
           } while (u.lookahead < q && u.strm.avail_in !== 0);
         }
         function ue(u, N) {
-          for (var P, x; ; ) {
+          for (var I, x; ; ) {
             if (u.lookahead < q) {
               if (ae(u), u.lookahead < q && N === f) return m;
               if (u.lookahead === 0) break;
             }
-            if (P = 0, u.lookahead >= D && (u.ins_h = (u.ins_h << u.hash_shift ^ u.window[u.strstart + D - 1]) & u.hash_mask, P = u.prev[u.strstart & u.w_mask] = u.head[u.ins_h], u.head[u.ins_h] = u.strstart), P !== 0 && u.strstart - P <= u.w_size - q && (u.match_length = Z(u, P)), u.match_length >= D) if (x = o._tr_tally(u, u.strstart - u.match_start, u.match_length - D), u.lookahead -= u.match_length, u.match_length <= u.max_lazy_match && u.lookahead >= D) {
-              for (u.match_length--; u.strstart++, u.ins_h = (u.ins_h << u.hash_shift ^ u.window[u.strstart + D - 1]) & u.hash_mask, P = u.prev[u.strstart & u.w_mask] = u.head[u.ins_h], u.head[u.ins_h] = u.strstart, --u.match_length != 0; ) ;
+            if (I = 0, u.lookahead >= D && (u.ins_h = (u.ins_h << u.hash_shift ^ u.window[u.strstart + D - 1]) & u.hash_mask, I = u.prev[u.strstart & u.w_mask] = u.head[u.ins_h], u.head[u.ins_h] = u.strstart), I !== 0 && u.strstart - I <= u.w_size - q && (u.match_length = Z(u, I)), u.match_length >= D) if (x = o._tr_tally(u, u.strstart - u.match_start, u.match_length - D), u.lookahead -= u.match_length, u.match_length <= u.max_lazy_match && u.lookahead >= D) {
+              for (u.match_length--; u.strstart++, u.ins_h = (u.ins_h << u.hash_shift ^ u.window[u.strstart + D - 1]) & u.hash_mask, I = u.prev[u.strstart & u.w_mask] = u.head[u.ins_h], u.head[u.ins_h] = u.strstart, --u.match_length != 0; ) ;
               u.strstart++;
             } else u.strstart += u.match_length, u.match_length = 0, u.ins_h = u.window[u.strstart], u.ins_h = (u.ins_h << u.hash_shift ^ u.window[u.strstart + 1]) & u.hash_mask;
             else x = o._tr_tally(u, 0, u.window[u.strstart]), u.lookahead--, u.strstart++;
             if (x && (L(u, !1), u.strm.avail_out === 0)) return m;
           }
-          return u.insert = u.strstart < D - 1 ? u.strstart : D - 1, N === p ? (L(u, !0), u.strm.avail_out === 0 ? ee : U) : u.last_lit && (L(u, !1), u.strm.avail_out === 0) ? m : O;
+          return u.insert = u.strstart < D - 1 ? u.strstart : D - 1, N === p ? (L(u, !0), u.strm.avail_out === 0 ? ee : W) : u.last_lit && (L(u, !1), u.strm.avail_out === 0) ? m : O;
         }
         function ie(u, N) {
-          for (var P, x, w; ; ) {
+          for (var I, x, w; ; ) {
             if (u.lookahead < q) {
               if (ae(u), u.lookahead < q && N === f) return m;
               if (u.lookahead === 0) break;
             }
-            if (P = 0, u.lookahead >= D && (u.ins_h = (u.ins_h << u.hash_shift ^ u.window[u.strstart + D - 1]) & u.hash_mask, P = u.prev[u.strstart & u.w_mask] = u.head[u.ins_h], u.head[u.ins_h] = u.strstart), u.prev_length = u.match_length, u.prev_match = u.match_start, u.match_length = D - 1, P !== 0 && u.prev_length < u.max_lazy_match && u.strstart - P <= u.w_size - q && (u.match_length = Z(u, P), u.match_length <= 5 && (u.strategy === 1 || u.match_length === D && 4096 < u.strstart - u.match_start) && (u.match_length = D - 1)), u.prev_length >= D && u.match_length <= u.prev_length) {
-              for (w = u.strstart + u.lookahead - D, x = o._tr_tally(u, u.strstart - 1 - u.prev_match, u.prev_length - D), u.lookahead -= u.prev_length - 1, u.prev_length -= 2; ++u.strstart <= w && (u.ins_h = (u.ins_h << u.hash_shift ^ u.window[u.strstart + D - 1]) & u.hash_mask, P = u.prev[u.strstart & u.w_mask] = u.head[u.ins_h], u.head[u.ins_h] = u.strstart), --u.prev_length != 0; ) ;
+            if (I = 0, u.lookahead >= D && (u.ins_h = (u.ins_h << u.hash_shift ^ u.window[u.strstart + D - 1]) & u.hash_mask, I = u.prev[u.strstart & u.w_mask] = u.head[u.ins_h], u.head[u.ins_h] = u.strstart), u.prev_length = u.match_length, u.prev_match = u.match_start, u.match_length = D - 1, I !== 0 && u.prev_length < u.max_lazy_match && u.strstart - I <= u.w_size - q && (u.match_length = Z(u, I), u.match_length <= 5 && (u.strategy === 1 || u.match_length === D && 4096 < u.strstart - u.match_start) && (u.match_length = D - 1)), u.prev_length >= D && u.match_length <= u.prev_length) {
+              for (w = u.strstart + u.lookahead - D, x = o._tr_tally(u, u.strstart - 1 - u.prev_match, u.prev_length - D), u.lookahead -= u.prev_length - 1, u.prev_length -= 2; ++u.strstart <= w && (u.ins_h = (u.ins_h << u.hash_shift ^ u.window[u.strstart + D - 1]) & u.hash_mask, I = u.prev[u.strstart & u.w_mask] = u.head[u.ins_h], u.head[u.ins_h] = u.strstart), --u.prev_length != 0; ) ;
               if (u.match_available = 0, u.match_length = D - 1, u.strstart++, x && (L(u, !1), u.strm.avail_out === 0)) return m;
             } else if (u.match_available) {
               if ((x = o._tr_tally(u, 0, u.window[u.strstart - 1])) && L(u, !1), u.strstart++, u.lookahead--, u.strm.avail_out === 0) return m;
             } else u.match_available = 1, u.strstart++, u.lookahead--;
           }
-          return u.match_available && (x = o._tr_tally(u, 0, u.window[u.strstart - 1]), u.match_available = 0), u.insert = u.strstart < D - 1 ? u.strstart : D - 1, N === p ? (L(u, !0), u.strm.avail_out === 0 ? ee : U) : u.last_lit && (L(u, !1), u.strm.avail_out === 0) ? m : O;
+          return u.match_available && (x = o._tr_tally(u, 0, u.window[u.strstart - 1]), u.match_available = 0), u.insert = u.strstart < D - 1 ? u.strstart : D - 1, N === p ? (L(u, !0), u.strm.avail_out === 0 ? ee : W) : u.last_lit && (L(u, !1), u.strm.avail_out === 0) ? m : O;
         }
-        function re(u, N, P, x, w) {
-          this.good_length = u, this.max_lazy = N, this.nice_length = P, this.max_chain = x, this.func = w;
+        function re(u, N, I, x, w) {
+          this.good_length = u, this.max_lazy = N, this.nice_length = I, this.max_chain = x, this.func = w;
         }
         function de() {
-          this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = b, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new s.Buf16(2 * z), this.dyn_dtree = new s.Buf16(2 * (2 * C + 1)), this.bl_tree = new s.Buf16(2 * (2 * R + 1)), J(this.dyn_ltree), J(this.dyn_dtree), J(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new s.Buf16(W + 1), this.heap = new s.Buf16(2 * S + 1), J(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new s.Buf16(2 * S + 1), J(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+          this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = b, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new s.Buf16(2 * z), this.dyn_dtree = new s.Buf16(2 * (2 * C + 1)), this.bl_tree = new s.Buf16(2 * (2 * R + 1)), J(this.dyn_ltree), J(this.dyn_dtree), J(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new s.Buf16(U + 1), this.heap = new s.Buf16(2 * S + 1), J(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new s.Buf16(2 * S + 1), J(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
         }
         function le(u) {
           var N;
@@ -3509,51 +3578,51 @@ function Ot() {
         }
         function ge(u) {
           var N = le(u);
-          return N === d && (function(P) {
-            P.window_size = 2 * P.w_size, J(P.head), P.max_lazy_match = r[P.level].max_lazy, P.good_match = r[P.level].good_length, P.nice_match = r[P.level].nice_length, P.max_chain_length = r[P.level].max_chain, P.strstart = 0, P.block_start = 0, P.lookahead = 0, P.insert = 0, P.match_length = P.prev_length = D - 1, P.match_available = 0, P.ins_h = 0;
+          return N === d && (function(I) {
+            I.window_size = 2 * I.w_size, J(I.head), I.max_lazy_match = r[I.level].max_lazy, I.good_match = r[I.level].good_length, I.nice_match = r[I.level].nice_length, I.max_chain_length = r[I.level].max_chain, I.strstart = 0, I.block_start = 0, I.lookahead = 0, I.insert = 0, I.match_length = I.prev_length = D - 1, I.match_available = 0, I.ins_h = 0;
           })(u.state), N;
         }
-        function me(u, N, P, x, w, T) {
+        function me(u, N, I, x, w, T) {
           if (!u) return y;
           var V = 1;
-          if (N === h && (N = 6), x < 0 ? (V = 0, x = -x) : 15 < x && (V = 2, x -= 16), w < 1 || k < w || P !== b || x < 8 || 15 < x || N < 0 || 9 < N || T < 0 || g < T) return te(u, y);
+          if (N === h && (N = 6), x < 0 ? (V = 0, x = -x) : 15 < x && (V = 2, x -= 16), w < 1 || k < w || I !== b || x < 8 || 15 < x || N < 0 || 9 < N || T < 0 || g < T) return te(u, y);
           x === 8 && (x = 9);
           var j = new de();
-          return (u.state = j).strm = u, j.wrap = V, j.gzhead = null, j.w_bits = x, j.w_size = 1 << j.w_bits, j.w_mask = j.w_size - 1, j.hash_bits = w + 7, j.hash_size = 1 << j.hash_bits, j.hash_mask = j.hash_size - 1, j.hash_shift = ~~((j.hash_bits + D - 1) / D), j.window = new s.Buf8(2 * j.w_size), j.head = new s.Buf16(j.hash_size), j.prev = new s.Buf16(j.w_size), j.lit_bufsize = 1 << w + 6, j.pending_buf_size = 4 * j.lit_bufsize, j.pending_buf = new s.Buf8(j.pending_buf_size), j.d_buf = 1 * j.lit_bufsize, j.l_buf = 3 * j.lit_bufsize, j.level = N, j.strategy = T, j.method = P, ge(u);
+          return (u.state = j).strm = u, j.wrap = V, j.gzhead = null, j.w_bits = x, j.w_size = 1 << j.w_bits, j.w_mask = j.w_size - 1, j.hash_bits = w + 7, j.hash_size = 1 << j.hash_bits, j.hash_mask = j.hash_size - 1, j.hash_shift = ~~((j.hash_bits + D - 1) / D), j.window = new s.Buf8(2 * j.w_size), j.head = new s.Buf16(j.hash_size), j.prev = new s.Buf16(j.w_size), j.lit_bufsize = 1 << w + 6, j.pending_buf_size = 4 * j.lit_bufsize, j.pending_buf = new s.Buf8(j.pending_buf_size), j.d_buf = 1 * j.lit_bufsize, j.l_buf = 3 * j.lit_bufsize, j.level = N, j.strategy = T, j.method = I, ge(u);
         }
         r = [new re(0, 0, 0, 0, function(u, N) {
-          var P = 65535;
-          for (P > u.pending_buf_size - 5 && (P = u.pending_buf_size - 5); ; ) {
+          var I = 65535;
+          for (I > u.pending_buf_size - 5 && (I = u.pending_buf_size - 5); ; ) {
             if (u.lookahead <= 1) {
               if (ae(u), u.lookahead === 0 && N === f) return m;
               if (u.lookahead === 0) break;
             }
             u.strstart += u.lookahead, u.lookahead = 0;
-            var x = u.block_start + P;
+            var x = u.block_start + I;
             if ((u.strstart === 0 || u.strstart >= x) && (u.lookahead = u.strstart - x, u.strstart = x, L(u, !1), u.strm.avail_out === 0) || u.strstart - u.block_start >= u.w_size - q && (L(u, !1), u.strm.avail_out === 0)) return m;
           }
-          return u.insert = 0, N === p ? (L(u, !0), u.strm.avail_out === 0 ? ee : U) : (u.strstart > u.block_start && (L(u, !1), u.strm.avail_out), m);
+          return u.insert = 0, N === p ? (L(u, !0), u.strm.avail_out === 0 ? ee : W) : (u.strstart > u.block_start && (L(u, !1), u.strm.avail_out), m);
         }), new re(4, 4, 8, 4, ue), new re(4, 5, 16, 8, ue), new re(4, 6, 32, 32, ue), new re(4, 4, 16, 16, ie), new re(8, 16, 32, 32, ie), new re(8, 16, 128, 128, ie), new re(8, 32, 128, 256, ie), new re(32, 128, 258, 1024, ie), new re(32, 258, 258, 4096, ie)], n.deflateInit = function(u, N) {
           return me(u, N, b, 15, 8, 0);
         }, n.deflateInit2 = me, n.deflateReset = ge, n.deflateResetKeep = le, n.deflateSetHeader = function(u, N) {
           return u && u.state ? u.state.wrap !== 2 ? y : (u.state.gzhead = N, d) : y;
         }, n.deflate = function(u, N) {
-          var P, x, w, T;
+          var I, x, w, T;
           if (!u || !u.state || 5 < N || N < 0) return u ? te(u, y) : y;
           if (x = u.state, !u.output || !u.input && u.avail_in !== 0 || x.status === 666 && N !== p) return te(u, u.avail_out === 0 ? -5 : y);
-          if (x.strm = u, P = x.last_flush, x.last_flush = N, x.status === E) if (x.wrap === 2) u.adler = 0, Q(x, 31), Q(x, 139), Q(x, 8), x.gzhead ? (Q(x, (x.gzhead.text ? 1 : 0) + (x.gzhead.hcrc ? 2 : 0) + (x.gzhead.extra ? 4 : 0) + (x.gzhead.name ? 8 : 0) + (x.gzhead.comment ? 16 : 0)), Q(x, 255 & x.gzhead.time), Q(x, x.gzhead.time >> 8 & 255), Q(x, x.gzhead.time >> 16 & 255), Q(x, x.gzhead.time >> 24 & 255), Q(x, x.level === 9 ? 2 : 2 <= x.strategy || x.level < 2 ? 4 : 0), Q(x, 255 & x.gzhead.os), x.gzhead.extra && x.gzhead.extra.length && (Q(x, 255 & x.gzhead.extra.length), Q(x, x.gzhead.extra.length >> 8 & 255)), x.gzhead.hcrc && (u.adler = l(u.adler, x.pending_buf, x.pending, 0)), x.gzindex = 0, x.status = 69) : (Q(x, 0), Q(x, 0), Q(x, 0), Q(x, 0), Q(x, 0), Q(x, x.level === 9 ? 2 : 2 <= x.strategy || x.level < 2 ? 4 : 0), Q(x, 3), x.status = B);
+          if (x.strm = u, I = x.last_flush, x.last_flush = N, x.status === E) if (x.wrap === 2) u.adler = 0, Q(x, 31), Q(x, 139), Q(x, 8), x.gzhead ? (Q(x, (x.gzhead.text ? 1 : 0) + (x.gzhead.hcrc ? 2 : 0) + (x.gzhead.extra ? 4 : 0) + (x.gzhead.name ? 8 : 0) + (x.gzhead.comment ? 16 : 0)), Q(x, 255 & x.gzhead.time), Q(x, x.gzhead.time >> 8 & 255), Q(x, x.gzhead.time >> 16 & 255), Q(x, x.gzhead.time >> 24 & 255), Q(x, x.level === 9 ? 2 : 2 <= x.strategy || x.level < 2 ? 4 : 0), Q(x, 255 & x.gzhead.os), x.gzhead.extra && x.gzhead.extra.length && (Q(x, 255 & x.gzhead.extra.length), Q(x, x.gzhead.extra.length >> 8 & 255)), x.gzhead.hcrc && (u.adler = l(u.adler, x.pending_buf, x.pending, 0)), x.gzindex = 0, x.status = 69) : (Q(x, 0), Q(x, 0), Q(x, 0), Q(x, 0), Q(x, 0), Q(x, x.level === 9 ? 2 : 2 <= x.strategy || x.level < 2 ? 4 : 0), Q(x, 3), x.status = B);
           else {
             var V = b + (x.w_bits - 8 << 4) << 8;
             V |= (2 <= x.strategy || x.level < 2 ? 0 : x.level < 6 ? 1 : x.level === 6 ? 2 : 3) << 6, x.strstart !== 0 && (V |= 32), V += 31 - V % 31, x.status = B, Y(x, V), x.strstart !== 0 && (Y(x, u.adler >>> 16), Y(x, 65535 & u.adler)), u.adler = 1;
           }
           if (x.status === 69) if (x.gzhead.extra) {
-            for (w = x.pending; x.gzindex < (65535 & x.gzhead.extra.length) && (x.pending !== x.pending_buf_size || (x.gzhead.hcrc && x.pending > w && (u.adler = l(u.adler, x.pending_buf, x.pending - w, w)), I(u), w = x.pending, x.pending !== x.pending_buf_size)); ) Q(x, 255 & x.gzhead.extra[x.gzindex]), x.gzindex++;
+            for (w = x.pending; x.gzindex < (65535 & x.gzhead.extra.length) && (x.pending !== x.pending_buf_size || (x.gzhead.hcrc && x.pending > w && (u.adler = l(u.adler, x.pending_buf, x.pending - w, w)), P(u), w = x.pending, x.pending !== x.pending_buf_size)); ) Q(x, 255 & x.gzhead.extra[x.gzindex]), x.gzindex++;
             x.gzhead.hcrc && x.pending > w && (u.adler = l(u.adler, x.pending_buf, x.pending - w, w)), x.gzindex === x.gzhead.extra.length && (x.gzindex = 0, x.status = 73);
           } else x.status = 73;
           if (x.status === 73) if (x.gzhead.name) {
             w = x.pending;
             do {
-              if (x.pending === x.pending_buf_size && (x.gzhead.hcrc && x.pending > w && (u.adler = l(u.adler, x.pending_buf, x.pending - w, w)), I(u), w = x.pending, x.pending === x.pending_buf_size)) {
+              if (x.pending === x.pending_buf_size && (x.gzhead.hcrc && x.pending > w && (u.adler = l(u.adler, x.pending_buf, x.pending - w, w)), P(u), w = x.pending, x.pending === x.pending_buf_size)) {
                 T = 1;
                 break;
               }
@@ -3564,7 +3633,7 @@ function Ot() {
           if (x.status === 91) if (x.gzhead.comment) {
             w = x.pending;
             do {
-              if (x.pending === x.pending_buf_size && (x.gzhead.hcrc && x.pending > w && (u.adler = l(u.adler, x.pending_buf, x.pending - w, w)), I(u), w = x.pending, x.pending === x.pending_buf_size)) {
+              if (x.pending === x.pending_buf_size && (x.gzhead.hcrc && x.pending > w && (u.adler = l(u.adler, x.pending_buf, x.pending - w, w)), P(u), w = x.pending, x.pending === x.pending_buf_size)) {
                 T = 1;
                 break;
               }
@@ -3572,9 +3641,9 @@ function Ot() {
             } while (T !== 0);
             x.gzhead.hcrc && x.pending > w && (u.adler = l(u.adler, x.pending_buf, x.pending - w, w)), T === 0 && (x.status = 103);
           } else x.status = 103;
-          if (x.status === 103 && (x.gzhead.hcrc ? (x.pending + 2 > x.pending_buf_size && I(u), x.pending + 2 <= x.pending_buf_size && (Q(x, 255 & u.adler), Q(x, u.adler >> 8 & 255), u.adler = 0, x.status = B)) : x.status = B), x.pending !== 0) {
-            if (I(u), u.avail_out === 0) return x.last_flush = -1, d;
-          } else if (u.avail_in === 0 && F(N) <= F(P) && N !== p) return te(u, -5);
+          if (x.status === 103 && (x.gzhead.hcrc ? (x.pending + 2 > x.pending_buf_size && P(u), x.pending + 2 <= x.pending_buf_size && (Q(x, 255 & u.adler), Q(x, u.adler >> 8 & 255), u.adler = 0, x.status = B)) : x.status = B), x.pending !== 0) {
+            if (P(u), u.avail_out === 0) return x.last_flush = -1, d;
+          } else if (u.avail_in === 0 && F(N) <= F(I) && N !== p) return te(u, -5);
           if (x.status === 666 && u.avail_in !== 0) return te(u, -5);
           if (u.avail_in !== 0 || x.lookahead !== 0 || N !== f && x.status !== 666) {
             var j = x.strategy === 2 ? (function(A, G) {
@@ -3585,7 +3654,7 @@ function Ot() {
                 }
                 if (A.match_length = 0, X = o._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++, X && (L(A, !1), A.strm.avail_out === 0)) return m;
               }
-              return A.insert = 0, G === p ? (L(A, !0), A.strm.avail_out === 0 ? ee : U) : A.last_lit && (L(A, !1), A.strm.avail_out === 0) ? m : O;
+              return A.insert = 0, G === p ? (L(A, !0), A.strm.avail_out === 0 ? ee : W) : A.last_lit && (L(A, !1), A.strm.avail_out === 0) ? m : O;
             })(x, N) : x.strategy === 3 ? (function(A, G) {
               for (var X, $, K, se, ne = A.window; ; ) {
                 if (A.lookahead <= H) {
@@ -3601,23 +3670,23 @@ function Ot() {
                 }
                 if (A.match_length >= D ? (X = o._tr_tally(A, 1, A.match_length - D), A.lookahead -= A.match_length, A.strstart += A.match_length, A.match_length = 0) : (X = o._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++), X && (L(A, !1), A.strm.avail_out === 0)) return m;
               }
-              return A.insert = 0, G === p ? (L(A, !0), A.strm.avail_out === 0 ? ee : U) : A.last_lit && (L(A, !1), A.strm.avail_out === 0) ? m : O;
+              return A.insert = 0, G === p ? (L(A, !0), A.strm.avail_out === 0 ? ee : W) : A.last_lit && (L(A, !1), A.strm.avail_out === 0) ? m : O;
             })(x, N) : r[x.level].func(x, N);
-            if (j !== ee && j !== U || (x.status = 666), j === m || j === ee) return u.avail_out === 0 && (x.last_flush = -1), d;
-            if (j === O && (N === 1 ? o._tr_align(x) : N !== 5 && (o._tr_stored_block(x, 0, 0, !1), N === 3 && (J(x.head), x.lookahead === 0 && (x.strstart = 0, x.block_start = 0, x.insert = 0))), I(u), u.avail_out === 0)) return x.last_flush = -1, d;
+            if (j !== ee && j !== W || (x.status = 666), j === m || j === ee) return u.avail_out === 0 && (x.last_flush = -1), d;
+            if (j === O && (N === 1 ? o._tr_align(x) : N !== 5 && (o._tr_stored_block(x, 0, 0, !1), N === 3 && (J(x.head), x.lookahead === 0 && (x.strstart = 0, x.block_start = 0, x.insert = 0))), P(u), u.avail_out === 0)) return x.last_flush = -1, d;
           }
-          return N !== p ? d : x.wrap <= 0 ? 1 : (x.wrap === 2 ? (Q(x, 255 & u.adler), Q(x, u.adler >> 8 & 255), Q(x, u.adler >> 16 & 255), Q(x, u.adler >> 24 & 255), Q(x, 255 & u.total_in), Q(x, u.total_in >> 8 & 255), Q(x, u.total_in >> 16 & 255), Q(x, u.total_in >> 24 & 255)) : (Y(x, u.adler >>> 16), Y(x, 65535 & u.adler)), I(u), 0 < x.wrap && (x.wrap = -x.wrap), x.pending !== 0 ? d : 1);
+          return N !== p ? d : x.wrap <= 0 ? 1 : (x.wrap === 2 ? (Q(x, 255 & u.adler), Q(x, u.adler >> 8 & 255), Q(x, u.adler >> 16 & 255), Q(x, u.adler >> 24 & 255), Q(x, 255 & u.total_in), Q(x, u.total_in >> 8 & 255), Q(x, u.total_in >> 16 & 255), Q(x, u.total_in >> 24 & 255)) : (Y(x, u.adler >>> 16), Y(x, 65535 & u.adler)), P(u), 0 < x.wrap && (x.wrap = -x.wrap), x.pending !== 0 ? d : 1);
         }, n.deflateEnd = function(u) {
           var N;
           return u && u.state ? (N = u.state.status) !== E && N !== 69 && N !== 73 && N !== 91 && N !== 103 && N !== B && N !== 666 ? te(u, y) : (u.state = null, N === B ? te(u, -3) : d) : y;
         }, n.deflateSetDictionary = function(u, N) {
-          var P, x, w, T, V, j, A, G, X = N.length;
-          if (!u || !u.state || (T = (P = u.state).wrap) === 2 || T === 1 && P.status !== E || P.lookahead) return y;
-          for (T === 1 && (u.adler = a(u.adler, N, X, 0)), P.wrap = 0, X >= P.w_size && (T === 0 && (J(P.head), P.strstart = 0, P.block_start = 0, P.insert = 0), G = new s.Buf8(P.w_size), s.arraySet(G, N, X - P.w_size, P.w_size, 0), N = G, X = P.w_size), V = u.avail_in, j = u.next_in, A = u.input, u.avail_in = X, u.next_in = 0, u.input = N, ae(P); P.lookahead >= D; ) {
-            for (x = P.strstart, w = P.lookahead - (D - 1); P.ins_h = (P.ins_h << P.hash_shift ^ P.window[x + D - 1]) & P.hash_mask, P.prev[x & P.w_mask] = P.head[P.ins_h], P.head[P.ins_h] = x, x++, --w; ) ;
-            P.strstart = x, P.lookahead = D - 1, ae(P);
+          var I, x, w, T, V, j, A, G, X = N.length;
+          if (!u || !u.state || (T = (I = u.state).wrap) === 2 || T === 1 && I.status !== E || I.lookahead) return y;
+          for (T === 1 && (u.adler = a(u.adler, N, X, 0)), I.wrap = 0, X >= I.w_size && (T === 0 && (J(I.head), I.strstart = 0, I.block_start = 0, I.insert = 0), G = new s.Buf8(I.w_size), s.arraySet(G, N, X - I.w_size, I.w_size, 0), N = G, X = I.w_size), V = u.avail_in, j = u.next_in, A = u.input, u.avail_in = X, u.next_in = 0, u.input = N, ae(I); I.lookahead >= D; ) {
+            for (x = I.strstart, w = I.lookahead - (D - 1); I.ins_h = (I.ins_h << I.hash_shift ^ I.window[x + D - 1]) & I.hash_mask, I.prev[x & I.w_mask] = I.head[I.ins_h], I.head[I.ins_h] = x, x++, --w; ) ;
+            I.strstart = x, I.lookahead = D - 1, ae(I);
           }
-          return P.strstart += P.lookahead, P.block_start = P.strstart, P.insert = P.lookahead, P.lookahead = 0, P.match_length = P.prev_length = D - 1, P.match_available = 0, u.next_in = j, u.input = A, u.avail_in = V, P.wrap = T, d;
+          return I.strstart += I.lookahead, I.block_start = I.strstart, I.insert = I.lookahead, I.lookahead = 0, I.match_length = I.prev_length = D - 1, I.match_available = 0, u.next_in = j, u.input = A, u.avail_in = V, I.wrap = T, d;
         }, n.deflateInfo = "pako deflate (from Nodeca project)";
       }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(t, i, n) {
         i.exports = function() {
@@ -3625,16 +3694,16 @@ function Ot() {
         };
       }, {}], 48: [function(t, i, n) {
         i.exports = function(r, s) {
-          var o, a, l, c, f, p, d, y, h, g, v, b, k, S, C, R, z, W, D, H, q, E, B, m, O;
+          var o, a, l, c, f, p, d, y, h, g, v, b, k, S, C, R, z, U, D, H, q, E, B, m, O;
           o = r.state, a = r.next_in, m = r.input, l = a + (r.avail_in - 5), c = r.next_out, O = r.output, f = c - (s - r.avail_out), p = c + (r.avail_out - 257), d = o.dmax, y = o.wsize, h = o.whave, g = o.wnext, v = o.window, b = o.hold, k = o.bits, S = o.lencode, C = o.distcode, R = (1 << o.lenbits) - 1, z = (1 << o.distbits) - 1;
           e: do {
-            k < 15 && (b += m[a++] << k, k += 8, b += m[a++] << k, k += 8), W = S[b & R];
+            k < 15 && (b += m[a++] << k, k += 8, b += m[a++] << k, k += 8), U = S[b & R];
             t: for (; ; ) {
-              if (b >>>= D = W >>> 24, k -= D, (D = W >>> 16 & 255) === 0) O[c++] = 65535 & W;
+              if (b >>>= D = U >>> 24, k -= D, (D = U >>> 16 & 255) === 0) O[c++] = 65535 & U;
               else {
                 if (!(16 & D)) {
                   if ((64 & D) == 0) {
-                    W = S[(65535 & W) + (b & (1 << D) - 1)];
+                    U = S[(65535 & U) + (b & (1 << D) - 1)];
                     continue t;
                   }
                   if (32 & D) {
@@ -3644,17 +3713,17 @@ function Ot() {
                   r.msg = "invalid literal/length code", o.mode = 30;
                   break e;
                 }
-                H = 65535 & W, (D &= 15) && (k < D && (b += m[a++] << k, k += 8), H += b & (1 << D) - 1, b >>>= D, k -= D), k < 15 && (b += m[a++] << k, k += 8, b += m[a++] << k, k += 8), W = C[b & z];
+                H = 65535 & U, (D &= 15) && (k < D && (b += m[a++] << k, k += 8), H += b & (1 << D) - 1, b >>>= D, k -= D), k < 15 && (b += m[a++] << k, k += 8, b += m[a++] << k, k += 8), U = C[b & z];
                 i: for (; ; ) {
-                  if (b >>>= D = W >>> 24, k -= D, !(16 & (D = W >>> 16 & 255))) {
+                  if (b >>>= D = U >>> 24, k -= D, !(16 & (D = U >>> 16 & 255))) {
                     if ((64 & D) == 0) {
-                      W = C[(65535 & W) + (b & (1 << D) - 1)];
+                      U = C[(65535 & U) + (b & (1 << D) - 1)];
                       continue i;
                     }
                     r.msg = "invalid distance code", o.mode = 30;
                     break e;
                   }
-                  if (q = 65535 & W, k < (D &= 15) && (b += m[a++] << k, (k += 8) < D && (b += m[a++] << k, k += 8)), d < (q += b & (1 << D) - 1)) {
+                  if (q = 65535 & U, k < (D &= 15) && (b += m[a++] << k, (k += 8) < D && (b += m[a++] << k, k += 8)), d < (q += b & (1 << D) - 1)) {
                     r.msg = "invalid distance too far back", o.mode = 30;
                     break e;
                   }
@@ -3718,29 +3787,29 @@ function Ot() {
           var m, O;
           return E ? (O = new b(), (E.state = O).window = null, (m = C(E, B)) !== p && (E.state = null), m) : d;
         }
-        var z, W, D = !0;
+        var z, U, D = !0;
         function H(E) {
           if (D) {
             var B;
-            for (z = new r.Buf32(512), W = new r.Buf32(32), B = 0; B < 144; ) E.lens[B++] = 8;
+            for (z = new r.Buf32(512), U = new r.Buf32(32), B = 0; B < 144; ) E.lens[B++] = 8;
             for (; B < 256; ) E.lens[B++] = 9;
             for (; B < 280; ) E.lens[B++] = 7;
             for (; B < 288; ) E.lens[B++] = 8;
             for (l(c, E.lens, 0, 288, z, 0, E.work, { bits: 9 }), B = 0; B < 32; ) E.lens[B++] = 5;
-            l(f, E.lens, 0, 32, W, 0, E.work, { bits: 5 }), D = !1;
+            l(f, E.lens, 0, 32, U, 0, E.work, { bits: 5 }), D = !1;
           }
-          E.lencode = z, E.lenbits = 9, E.distcode = W, E.distbits = 5;
+          E.lencode = z, E.lenbits = 9, E.distcode = U, E.distbits = 5;
         }
         function q(E, B, m, O) {
-          var ee, U = E.state;
-          return U.window === null && (U.wsize = 1 << U.wbits, U.wnext = 0, U.whave = 0, U.window = new r.Buf8(U.wsize)), O >= U.wsize ? (r.arraySet(U.window, B, m - U.wsize, U.wsize, 0), U.wnext = 0, U.whave = U.wsize) : (O < (ee = U.wsize - U.wnext) && (ee = O), r.arraySet(U.window, B, m - O, ee, U.wnext), (O -= ee) ? (r.arraySet(U.window, B, m - O, O, 0), U.wnext = O, U.whave = U.wsize) : (U.wnext += ee, U.wnext === U.wsize && (U.wnext = 0), U.whave < U.wsize && (U.whave += ee))), 0;
+          var ee, W = E.state;
+          return W.window === null && (W.wsize = 1 << W.wbits, W.wnext = 0, W.whave = 0, W.window = new r.Buf8(W.wsize)), O >= W.wsize ? (r.arraySet(W.window, B, m - W.wsize, W.wsize, 0), W.wnext = 0, W.whave = W.wsize) : (O < (ee = W.wsize - W.wnext) && (ee = O), r.arraySet(W.window, B, m - O, ee, W.wnext), (O -= ee) ? (r.arraySet(W.window, B, m - O, O, 0), W.wnext = O, W.whave = W.wsize) : (W.wnext += ee, W.wnext === W.wsize && (W.wnext = 0), W.whave < W.wsize && (W.whave += ee))), 0;
         }
         n.inflateReset = S, n.inflateReset2 = C, n.inflateResetKeep = k, n.inflateInit = function(E) {
           return R(E, 15);
         }, n.inflateInit2 = R, n.inflate = function(E, B) {
-          var m, O, ee, U, te, F, J, I, L, Q, Y, Z, ae, ue, ie, re, de, le, ge, me, u, N, P, x, w = 0, T = new r.Buf8(4), V = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+          var m, O, ee, W, te, F, J, P, L, Q, Y, Z, ae, ue, ie, re, de, le, ge, me, u, N, I, x, w = 0, T = new r.Buf8(4), V = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
           if (!E || !E.state || !E.output || !E.input && E.avail_in !== 0) return d;
-          (m = E.state).mode === 12 && (m.mode = 13), te = E.next_out, ee = E.output, J = E.avail_out, U = E.next_in, O = E.input, F = E.avail_in, I = m.hold, L = m.bits, Q = F, Y = J, N = p;
+          (m = E.state).mode === 12 && (m.mode = 13), te = E.next_out, ee = E.output, J = E.avail_out, W = E.next_in, O = E.input, F = E.avail_in, P = m.hold, L = m.bits, Q = F, Y = J, N = p;
           e: for (; ; ) switch (m.mode) {
             case y:
               if (m.wrap === 0) {
@@ -3749,33 +3818,33 @@ function Ot() {
               }
               for (; L < 16; ) {
                 if (F === 0) break e;
-                F--, I += O[U++] << L, L += 8;
+                F--, P += O[W++] << L, L += 8;
               }
-              if (2 & m.wrap && I === 35615) {
-                T[m.check = 0] = 255 & I, T[1] = I >>> 8 & 255, m.check = o(m.check, T, 2, 0), L = I = 0, m.mode = 2;
+              if (2 & m.wrap && P === 35615) {
+                T[m.check = 0] = 255 & P, T[1] = P >>> 8 & 255, m.check = o(m.check, T, 2, 0), L = P = 0, m.mode = 2;
                 break;
               }
-              if (m.flags = 0, m.head && (m.head.done = !1), !(1 & m.wrap) || (((255 & I) << 8) + (I >> 8)) % 31) {
+              if (m.flags = 0, m.head && (m.head.done = !1), !(1 & m.wrap) || (((255 & P) << 8) + (P >> 8)) % 31) {
                 E.msg = "incorrect header check", m.mode = 30;
                 break;
               }
-              if ((15 & I) != 8) {
+              if ((15 & P) != 8) {
                 E.msg = "unknown compression method", m.mode = 30;
                 break;
               }
-              if (L -= 4, u = 8 + (15 & (I >>>= 4)), m.wbits === 0) m.wbits = u;
+              if (L -= 4, u = 8 + (15 & (P >>>= 4)), m.wbits === 0) m.wbits = u;
               else if (u > m.wbits) {
                 E.msg = "invalid window size", m.mode = 30;
                 break;
               }
-              m.dmax = 1 << u, E.adler = m.check = 1, m.mode = 512 & I ? 10 : 12, L = I = 0;
+              m.dmax = 1 << u, E.adler = m.check = 1, m.mode = 512 & P ? 10 : 12, L = P = 0;
               break;
             case 2:
               for (; L < 16; ) {
                 if (F === 0) break e;
-                F--, I += O[U++] << L, L += 8;
+                F--, P += O[W++] << L, L += 8;
               }
-              if (m.flags = I, (255 & m.flags) != 8) {
+              if (m.flags = P, (255 & m.flags) != 8) {
                 E.msg = "unknown compression method", m.mode = 30;
                 break;
               }
@@ -3783,86 +3852,86 @@ function Ot() {
                 E.msg = "unknown header flags set", m.mode = 30;
                 break;
               }
-              m.head && (m.head.text = I >> 8 & 1), 512 & m.flags && (T[0] = 255 & I, T[1] = I >>> 8 & 255, m.check = o(m.check, T, 2, 0)), L = I = 0, m.mode = 3;
+              m.head && (m.head.text = P >> 8 & 1), 512 & m.flags && (T[0] = 255 & P, T[1] = P >>> 8 & 255, m.check = o(m.check, T, 2, 0)), L = P = 0, m.mode = 3;
             case 3:
               for (; L < 32; ) {
                 if (F === 0) break e;
-                F--, I += O[U++] << L, L += 8;
+                F--, P += O[W++] << L, L += 8;
               }
-              m.head && (m.head.time = I), 512 & m.flags && (T[0] = 255 & I, T[1] = I >>> 8 & 255, T[2] = I >>> 16 & 255, T[3] = I >>> 24 & 255, m.check = o(m.check, T, 4, 0)), L = I = 0, m.mode = 4;
+              m.head && (m.head.time = P), 512 & m.flags && (T[0] = 255 & P, T[1] = P >>> 8 & 255, T[2] = P >>> 16 & 255, T[3] = P >>> 24 & 255, m.check = o(m.check, T, 4, 0)), L = P = 0, m.mode = 4;
             case 4:
               for (; L < 16; ) {
                 if (F === 0) break e;
-                F--, I += O[U++] << L, L += 8;
+                F--, P += O[W++] << L, L += 8;
               }
-              m.head && (m.head.xflags = 255 & I, m.head.os = I >> 8), 512 & m.flags && (T[0] = 255 & I, T[1] = I >>> 8 & 255, m.check = o(m.check, T, 2, 0)), L = I = 0, m.mode = 5;
+              m.head && (m.head.xflags = 255 & P, m.head.os = P >> 8), 512 & m.flags && (T[0] = 255 & P, T[1] = P >>> 8 & 255, m.check = o(m.check, T, 2, 0)), L = P = 0, m.mode = 5;
             case 5:
               if (1024 & m.flags) {
                 for (; L < 16; ) {
                   if (F === 0) break e;
-                  F--, I += O[U++] << L, L += 8;
+                  F--, P += O[W++] << L, L += 8;
                 }
-                m.length = I, m.head && (m.head.extra_len = I), 512 & m.flags && (T[0] = 255 & I, T[1] = I >>> 8 & 255, m.check = o(m.check, T, 2, 0)), L = I = 0;
+                m.length = P, m.head && (m.head.extra_len = P), 512 & m.flags && (T[0] = 255 & P, T[1] = P >>> 8 & 255, m.check = o(m.check, T, 2, 0)), L = P = 0;
               } else m.head && (m.head.extra = null);
               m.mode = 6;
             case 6:
-              if (1024 & m.flags && (F < (Z = m.length) && (Z = F), Z && (m.head && (u = m.head.extra_len - m.length, m.head.extra || (m.head.extra = new Array(m.head.extra_len)), r.arraySet(m.head.extra, O, U, Z, u)), 512 & m.flags && (m.check = o(m.check, O, Z, U)), F -= Z, U += Z, m.length -= Z), m.length)) break e;
+              if (1024 & m.flags && (F < (Z = m.length) && (Z = F), Z && (m.head && (u = m.head.extra_len - m.length, m.head.extra || (m.head.extra = new Array(m.head.extra_len)), r.arraySet(m.head.extra, O, W, Z, u)), 512 & m.flags && (m.check = o(m.check, O, Z, W)), F -= Z, W += Z, m.length -= Z), m.length)) break e;
               m.length = 0, m.mode = 7;
             case 7:
               if (2048 & m.flags) {
                 if (F === 0) break e;
-                for (Z = 0; u = O[U + Z++], m.head && u && m.length < 65536 && (m.head.name += String.fromCharCode(u)), u && Z < F; ) ;
-                if (512 & m.flags && (m.check = o(m.check, O, Z, U)), F -= Z, U += Z, u) break e;
+                for (Z = 0; u = O[W + Z++], m.head && u && m.length < 65536 && (m.head.name += String.fromCharCode(u)), u && Z < F; ) ;
+                if (512 & m.flags && (m.check = o(m.check, O, Z, W)), F -= Z, W += Z, u) break e;
               } else m.head && (m.head.name = null);
               m.length = 0, m.mode = 8;
             case 8:
               if (4096 & m.flags) {
                 if (F === 0) break e;
-                for (Z = 0; u = O[U + Z++], m.head && u && m.length < 65536 && (m.head.comment += String.fromCharCode(u)), u && Z < F; ) ;
-                if (512 & m.flags && (m.check = o(m.check, O, Z, U)), F -= Z, U += Z, u) break e;
+                for (Z = 0; u = O[W + Z++], m.head && u && m.length < 65536 && (m.head.comment += String.fromCharCode(u)), u && Z < F; ) ;
+                if (512 & m.flags && (m.check = o(m.check, O, Z, W)), F -= Z, W += Z, u) break e;
               } else m.head && (m.head.comment = null);
               m.mode = 9;
             case 9:
               if (512 & m.flags) {
                 for (; L < 16; ) {
                   if (F === 0) break e;
-                  F--, I += O[U++] << L, L += 8;
+                  F--, P += O[W++] << L, L += 8;
                 }
-                if (I !== (65535 & m.check)) {
+                if (P !== (65535 & m.check)) {
                   E.msg = "header crc mismatch", m.mode = 30;
                   break;
                 }
-                L = I = 0;
+                L = P = 0;
               }
               m.head && (m.head.hcrc = m.flags >> 9 & 1, m.head.done = !0), E.adler = m.check = 0, m.mode = 12;
               break;
             case 10:
               for (; L < 32; ) {
                 if (F === 0) break e;
-                F--, I += O[U++] << L, L += 8;
+                F--, P += O[W++] << L, L += 8;
               }
-              E.adler = m.check = v(I), L = I = 0, m.mode = 11;
+              E.adler = m.check = v(P), L = P = 0, m.mode = 11;
             case 11:
-              if (m.havedict === 0) return E.next_out = te, E.avail_out = J, E.next_in = U, E.avail_in = F, m.hold = I, m.bits = L, 2;
+              if (m.havedict === 0) return E.next_out = te, E.avail_out = J, E.next_in = W, E.avail_in = F, m.hold = P, m.bits = L, 2;
               E.adler = m.check = 1, m.mode = 12;
             case 12:
               if (B === 5 || B === 6) break e;
             case 13:
               if (m.last) {
-                I >>>= 7 & L, L -= 7 & L, m.mode = 27;
+                P >>>= 7 & L, L -= 7 & L, m.mode = 27;
                 break;
               }
               for (; L < 3; ) {
                 if (F === 0) break e;
-                F--, I += O[U++] << L, L += 8;
+                F--, P += O[W++] << L, L += 8;
               }
-              switch (m.last = 1 & I, L -= 1, 3 & (I >>>= 1)) {
+              switch (m.last = 1 & P, L -= 1, 3 & (P >>>= 1)) {
                 case 0:
                   m.mode = 14;
                   break;
                 case 1:
                   if (H(m), m.mode = 20, B !== 6) break;
-                  I >>>= 2, L -= 2;
+                  P >>>= 2, L -= 2;
                   break e;
                 case 2:
                   m.mode = 17;
@@ -3870,24 +3939,24 @@ function Ot() {
                 case 3:
                   E.msg = "invalid block type", m.mode = 30;
               }
-              I >>>= 2, L -= 2;
+              P >>>= 2, L -= 2;
               break;
             case 14:
-              for (I >>>= 7 & L, L -= 7 & L; L < 32; ) {
+              for (P >>>= 7 & L, L -= 7 & L; L < 32; ) {
                 if (F === 0) break e;
-                F--, I += O[U++] << L, L += 8;
+                F--, P += O[W++] << L, L += 8;
               }
-              if ((65535 & I) != (I >>> 16 ^ 65535)) {
+              if ((65535 & P) != (P >>> 16 ^ 65535)) {
                 E.msg = "invalid stored block lengths", m.mode = 30;
                 break;
               }
-              if (m.length = 65535 & I, L = I = 0, m.mode = 15, B === 6) break e;
+              if (m.length = 65535 & P, L = P = 0, m.mode = 15, B === 6) break e;
             case 15:
               m.mode = 16;
             case 16:
               if (Z = m.length) {
                 if (F < Z && (Z = F), J < Z && (Z = J), Z === 0) break e;
-                r.arraySet(ee, O, U, Z, te), F -= Z, U += Z, J -= Z, te += Z, m.length -= Z;
+                r.arraySet(ee, O, W, Z, te), F -= Z, W += Z, J -= Z, te += Z, m.length -= Z;
                 break;
               }
               m.mode = 12;
@@ -3895,9 +3964,9 @@ function Ot() {
             case 17:
               for (; L < 14; ) {
                 if (F === 0) break e;
-                F--, I += O[U++] << L, L += 8;
+                F--, P += O[W++] << L, L += 8;
               }
-              if (m.nlen = 257 + (31 & I), I >>>= 5, L -= 5, m.ndist = 1 + (31 & I), I >>>= 5, L -= 5, m.ncode = 4 + (15 & I), I >>>= 4, L -= 4, 286 < m.nlen || 30 < m.ndist) {
+              if (m.nlen = 257 + (31 & P), P >>>= 5, L -= 5, m.ndist = 1 + (31 & P), P >>>= 5, L -= 5, m.ncode = 4 + (15 & P), P >>>= 4, L -= 4, 286 < m.nlen || 30 < m.ndist) {
                 E.msg = "too many length or distance symbols", m.mode = 30;
                 break;
               }
@@ -3906,46 +3975,46 @@ function Ot() {
               for (; m.have < m.ncode; ) {
                 for (; L < 3; ) {
                   if (F === 0) break e;
-                  F--, I += O[U++] << L, L += 8;
+                  F--, P += O[W++] << L, L += 8;
                 }
-                m.lens[V[m.have++]] = 7 & I, I >>>= 3, L -= 3;
+                m.lens[V[m.have++]] = 7 & P, P >>>= 3, L -= 3;
               }
               for (; m.have < 19; ) m.lens[V[m.have++]] = 0;
-              if (m.lencode = m.lendyn, m.lenbits = 7, P = { bits: m.lenbits }, N = l(0, m.lens, 0, 19, m.lencode, 0, m.work, P), m.lenbits = P.bits, N) {
+              if (m.lencode = m.lendyn, m.lenbits = 7, I = { bits: m.lenbits }, N = l(0, m.lens, 0, 19, m.lencode, 0, m.work, I), m.lenbits = I.bits, N) {
                 E.msg = "invalid code lengths set", m.mode = 30;
                 break;
               }
               m.have = 0, m.mode = 19;
             case 19:
               for (; m.have < m.nlen + m.ndist; ) {
-                for (; re = (w = m.lencode[I & (1 << m.lenbits) - 1]) >>> 16 & 255, de = 65535 & w, !((ie = w >>> 24) <= L); ) {
+                for (; re = (w = m.lencode[P & (1 << m.lenbits) - 1]) >>> 16 & 255, de = 65535 & w, !((ie = w >>> 24) <= L); ) {
                   if (F === 0) break e;
-                  F--, I += O[U++] << L, L += 8;
+                  F--, P += O[W++] << L, L += 8;
                 }
-                if (de < 16) I >>>= ie, L -= ie, m.lens[m.have++] = de;
+                if (de < 16) P >>>= ie, L -= ie, m.lens[m.have++] = de;
                 else {
                   if (de === 16) {
                     for (x = ie + 2; L < x; ) {
                       if (F === 0) break e;
-                      F--, I += O[U++] << L, L += 8;
+                      F--, P += O[W++] << L, L += 8;
                     }
-                    if (I >>>= ie, L -= ie, m.have === 0) {
+                    if (P >>>= ie, L -= ie, m.have === 0) {
                       E.msg = "invalid bit length repeat", m.mode = 30;
                       break;
                     }
-                    u = m.lens[m.have - 1], Z = 3 + (3 & I), I >>>= 2, L -= 2;
+                    u = m.lens[m.have - 1], Z = 3 + (3 & P), P >>>= 2, L -= 2;
                   } else if (de === 17) {
                     for (x = ie + 3; L < x; ) {
                       if (F === 0) break e;
-                      F--, I += O[U++] << L, L += 8;
+                      F--, P += O[W++] << L, L += 8;
                     }
-                    L -= ie, u = 0, Z = 3 + (7 & (I >>>= ie)), I >>>= 3, L -= 3;
+                    L -= ie, u = 0, Z = 3 + (7 & (P >>>= ie)), P >>>= 3, L -= 3;
                   } else {
                     for (x = ie + 7; L < x; ) {
                       if (F === 0) break e;
-                      F--, I += O[U++] << L, L += 8;
+                      F--, P += O[W++] << L, L += 8;
                     }
-                    L -= ie, u = 0, Z = 11 + (127 & (I >>>= ie)), I >>>= 7, L -= 7;
+                    L -= ie, u = 0, Z = 11 + (127 & (P >>>= ie)), P >>>= 7, L -= 7;
                   }
                   if (m.have + Z > m.nlen + m.ndist) {
                     E.msg = "invalid bit length repeat", m.mode = 30;
@@ -3959,11 +4028,11 @@ function Ot() {
                 E.msg = "invalid code -- missing end-of-block", m.mode = 30;
                 break;
               }
-              if (m.lenbits = 9, P = { bits: m.lenbits }, N = l(c, m.lens, 0, m.nlen, m.lencode, 0, m.work, P), m.lenbits = P.bits, N) {
+              if (m.lenbits = 9, I = { bits: m.lenbits }, N = l(c, m.lens, 0, m.nlen, m.lencode, 0, m.work, I), m.lenbits = I.bits, N) {
                 E.msg = "invalid literal/lengths set", m.mode = 30;
                 break;
               }
-              if (m.distbits = 6, m.distcode = m.distdyn, P = { bits: m.distbits }, N = l(f, m.lens, m.nlen, m.ndist, m.distcode, 0, m.work, P), m.distbits = P.bits, N) {
+              if (m.distbits = 6, m.distcode = m.distdyn, I = { bits: m.distbits }, N = l(f, m.lens, m.nlen, m.ndist, m.distcode, 0, m.work, I), m.distbits = I.bits, N) {
                 E.msg = "invalid distances set", m.mode = 30;
                 break;
               }
@@ -3972,21 +4041,21 @@ function Ot() {
               m.mode = 21;
             case 21:
               if (6 <= F && 258 <= J) {
-                E.next_out = te, E.avail_out = J, E.next_in = U, E.avail_in = F, m.hold = I, m.bits = L, a(E, Y), te = E.next_out, ee = E.output, J = E.avail_out, U = E.next_in, O = E.input, F = E.avail_in, I = m.hold, L = m.bits, m.mode === 12 && (m.back = -1);
+                E.next_out = te, E.avail_out = J, E.next_in = W, E.avail_in = F, m.hold = P, m.bits = L, a(E, Y), te = E.next_out, ee = E.output, J = E.avail_out, W = E.next_in, O = E.input, F = E.avail_in, P = m.hold, L = m.bits, m.mode === 12 && (m.back = -1);
                 break;
               }
-              for (m.back = 0; re = (w = m.lencode[I & (1 << m.lenbits) - 1]) >>> 16 & 255, de = 65535 & w, !((ie = w >>> 24) <= L); ) {
+              for (m.back = 0; re = (w = m.lencode[P & (1 << m.lenbits) - 1]) >>> 16 & 255, de = 65535 & w, !((ie = w >>> 24) <= L); ) {
                 if (F === 0) break e;
-                F--, I += O[U++] << L, L += 8;
+                F--, P += O[W++] << L, L += 8;
               }
               if (re && (240 & re) == 0) {
-                for (le = ie, ge = re, me = de; re = (w = m.lencode[me + ((I & (1 << le + ge) - 1) >> le)]) >>> 16 & 255, de = 65535 & w, !(le + (ie = w >>> 24) <= L); ) {
+                for (le = ie, ge = re, me = de; re = (w = m.lencode[me + ((P & (1 << le + ge) - 1) >> le)]) >>> 16 & 255, de = 65535 & w, !(le + (ie = w >>> 24) <= L); ) {
                   if (F === 0) break e;
-                  F--, I += O[U++] << L, L += 8;
+                  F--, P += O[W++] << L, L += 8;
                 }
-                I >>>= le, L -= le, m.back += le;
+                P >>>= le, L -= le, m.back += le;
               }
-              if (I >>>= ie, L -= ie, m.back += ie, m.length = de, re === 0) {
+              if (P >>>= ie, L -= ie, m.back += ie, m.length = de, re === 0) {
                 m.mode = 26;
                 break;
               }
@@ -4003,24 +4072,24 @@ function Ot() {
               if (m.extra) {
                 for (x = m.extra; L < x; ) {
                   if (F === 0) break e;
-                  F--, I += O[U++] << L, L += 8;
+                  F--, P += O[W++] << L, L += 8;
                 }
-                m.length += I & (1 << m.extra) - 1, I >>>= m.extra, L -= m.extra, m.back += m.extra;
+                m.length += P & (1 << m.extra) - 1, P >>>= m.extra, L -= m.extra, m.back += m.extra;
               }
               m.was = m.length, m.mode = 23;
             case 23:
-              for (; re = (w = m.distcode[I & (1 << m.distbits) - 1]) >>> 16 & 255, de = 65535 & w, !((ie = w >>> 24) <= L); ) {
+              for (; re = (w = m.distcode[P & (1 << m.distbits) - 1]) >>> 16 & 255, de = 65535 & w, !((ie = w >>> 24) <= L); ) {
                 if (F === 0) break e;
-                F--, I += O[U++] << L, L += 8;
+                F--, P += O[W++] << L, L += 8;
               }
               if ((240 & re) == 0) {
-                for (le = ie, ge = re, me = de; re = (w = m.distcode[me + ((I & (1 << le + ge) - 1) >> le)]) >>> 16 & 255, de = 65535 & w, !(le + (ie = w >>> 24) <= L); ) {
+                for (le = ie, ge = re, me = de; re = (w = m.distcode[me + ((P & (1 << le + ge) - 1) >> le)]) >>> 16 & 255, de = 65535 & w, !(le + (ie = w >>> 24) <= L); ) {
                   if (F === 0) break e;
-                  F--, I += O[U++] << L, L += 8;
+                  F--, P += O[W++] << L, L += 8;
                 }
-                I >>>= le, L -= le, m.back += le;
+                P >>>= le, L -= le, m.back += le;
               }
-              if (I >>>= ie, L -= ie, m.back += ie, 64 & re) {
+              if (P >>>= ie, L -= ie, m.back += ie, 64 & re) {
                 E.msg = "invalid distance code", m.mode = 30;
                 break;
               }
@@ -4029,9 +4098,9 @@ function Ot() {
               if (m.extra) {
                 for (x = m.extra; L < x; ) {
                   if (F === 0) break e;
-                  F--, I += O[U++] << L, L += 8;
+                  F--, P += O[W++] << L, L += 8;
                 }
-                m.offset += I & (1 << m.extra) - 1, I >>>= m.extra, L -= m.extra, m.back += m.extra;
+                m.offset += P & (1 << m.extra) - 1, P >>>= m.extra, L -= m.extra, m.back += m.extra;
               }
               if (m.offset > m.dmax) {
                 E.msg = "invalid distance too far back", m.mode = 30;
@@ -4058,26 +4127,26 @@ function Ot() {
               if (m.wrap) {
                 for (; L < 32; ) {
                   if (F === 0) break e;
-                  F--, I |= O[U++] << L, L += 8;
+                  F--, P |= O[W++] << L, L += 8;
                 }
-                if (Y -= J, E.total_out += Y, m.total += Y, Y && (E.adler = m.check = m.flags ? o(m.check, ee, Y, te - Y) : s(m.check, ee, Y, te - Y)), Y = J, (m.flags ? I : v(I)) !== m.check) {
+                if (Y -= J, E.total_out += Y, m.total += Y, Y && (E.adler = m.check = m.flags ? o(m.check, ee, Y, te - Y) : s(m.check, ee, Y, te - Y)), Y = J, (m.flags ? P : v(P)) !== m.check) {
                   E.msg = "incorrect data check", m.mode = 30;
                   break;
                 }
-                L = I = 0;
+                L = P = 0;
               }
               m.mode = 28;
             case 28:
               if (m.wrap && m.flags) {
                 for (; L < 32; ) {
                   if (F === 0) break e;
-                  F--, I += O[U++] << L, L += 8;
+                  F--, P += O[W++] << L, L += 8;
                 }
-                if (I !== (4294967295 & m.total)) {
+                if (P !== (4294967295 & m.total)) {
                   E.msg = "incorrect length check", m.mode = 30;
                   break;
                 }
-                L = I = 0;
+                L = P = 0;
               }
               m.mode = 29;
             case 29:
@@ -4092,7 +4161,7 @@ function Ot() {
             default:
               return d;
           }
-          return E.next_out = te, E.avail_out = J, E.next_in = U, E.avail_in = F, m.hold = I, m.bits = L, (m.wsize || Y !== E.avail_out && m.mode < 30 && (m.mode < 27 || B !== 4)) && q(E, E.output, E.next_out, Y - E.avail_out) ? (m.mode = 31, -4) : (Q -= E.avail_in, Y -= E.avail_out, E.total_in += Q, E.total_out += Y, m.total += Y, m.wrap && Y && (E.adler = m.check = m.flags ? o(m.check, ee, Y, E.next_out - Y) : s(m.check, ee, Y, E.next_out - Y)), E.data_type = m.bits + (m.last ? 64 : 0) + (m.mode === 12 ? 128 : 0) + (m.mode === 20 || m.mode === 15 ? 256 : 0), (Q == 0 && Y === 0 || B === 4) && N === p && (N = -5), N);
+          return E.next_out = te, E.avail_out = J, E.next_in = W, E.avail_in = F, m.hold = P, m.bits = L, (m.wsize || Y !== E.avail_out && m.mode < 30 && (m.mode < 27 || B !== 4)) && q(E, E.output, E.next_out, Y - E.avail_out) ? (m.mode = 31, -4) : (Q -= E.avail_in, Y -= E.avail_out, E.total_in += Q, E.total_out += Y, m.total += Y, m.wrap && Y && (E.adler = m.check = m.flags ? o(m.check, ee, Y, E.next_out - Y) : s(m.check, ee, Y, E.next_out - Y)), E.data_type = m.bits + (m.last ? 64 : 0) + (m.mode === 12 ? 128 : 0) + (m.mode === 20 || m.mode === 15 ? 256 : 0), (Q == 0 && Y === 0 || B === 4) && N === p && (N = -5), N);
         }, n.inflateEnd = function(E) {
           if (!E || !E.state) return d;
           var B = E.state;
@@ -4107,7 +4176,7 @@ function Ot() {
       }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(t, i, n) {
         var r = t("../utils/common"), s = [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], o = [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], a = [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], l = [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];
         i.exports = function(c, f, p, d, y, h, g, v) {
-          var b, k, S, C, R, z, W, D, H, q = v.bits, E = 0, B = 0, m = 0, O = 0, ee = 0, U = 0, te = 0, F = 0, J = 0, I = 0, L = null, Q = 0, Y = new r.Buf16(16), Z = new r.Buf16(16), ae = null, ue = 0;
+          var b, k, S, C, R, z, U, D, H, q = v.bits, E = 0, B = 0, m = 0, O = 0, ee = 0, W = 0, te = 0, F = 0, J = 0, P = 0, L = null, Q = 0, Y = new r.Buf16(16), Z = new r.Buf16(16), ae = null, ue = 0;
           for (E = 0; E <= 15; E++) Y[E] = 0;
           for (B = 0; B < d; B++) Y[f[p + B]]++;
           for (ee = q, O = 15; 1 <= O && Y[O] === 0; O--) ;
@@ -4117,21 +4186,21 @@ function Ot() {
           if (0 < F && (c === 0 || O !== 1)) return -1;
           for (Z[1] = 0, E = 1; E < 15; E++) Z[E + 1] = Z[E] + Y[E];
           for (B = 0; B < d; B++) f[p + B] !== 0 && (g[Z[f[p + B]]++] = B);
-          if (z = c === 0 ? (L = ae = g, 19) : c === 1 ? (L = s, Q -= 257, ae = o, ue -= 257, 256) : (L = a, ae = l, -1), E = m, R = h, te = B = I = 0, S = -1, C = (J = 1 << (U = ee)) - 1, c === 1 && 852 < J || c === 2 && 592 < J) return 1;
+          if (z = c === 0 ? (L = ae = g, 19) : c === 1 ? (L = s, Q -= 257, ae = o, ue -= 257, 256) : (L = a, ae = l, -1), E = m, R = h, te = B = P = 0, S = -1, C = (J = 1 << (W = ee)) - 1, c === 1 && 852 < J || c === 2 && 592 < J) return 1;
           for (; ; ) {
-            for (W = E - te, H = g[B] < z ? (D = 0, g[B]) : g[B] > z ? (D = ae[ue + g[B]], L[Q + g[B]]) : (D = 96, 0), b = 1 << E - te, m = k = 1 << U; y[R + (I >> te) + (k -= b)] = W << 24 | D << 16 | H | 0, k !== 0; ) ;
-            for (b = 1 << E - 1; I & b; ) b >>= 1;
-            if (b !== 0 ? (I &= b - 1, I += b) : I = 0, B++, --Y[E] == 0) {
+            for (U = E - te, H = g[B] < z ? (D = 0, g[B]) : g[B] > z ? (D = ae[ue + g[B]], L[Q + g[B]]) : (D = 96, 0), b = 1 << E - te, m = k = 1 << W; y[R + (P >> te) + (k -= b)] = U << 24 | D << 16 | H | 0, k !== 0; ) ;
+            for (b = 1 << E - 1; P & b; ) b >>= 1;
+            if (b !== 0 ? (P &= b - 1, P += b) : P = 0, B++, --Y[E] == 0) {
               if (E === O) break;
               E = f[p + g[B]];
             }
-            if (ee < E && (I & C) !== S) {
-              for (te === 0 && (te = ee), R += m, F = 1 << (U = E - te); U + te < O && !((F -= Y[U + te]) <= 0); ) U++, F <<= 1;
-              if (J += 1 << U, c === 1 && 852 < J || c === 2 && 592 < J) return 1;
-              y[S = I & C] = ee << 24 | U << 16 | R - h | 0;
+            if (ee < E && (P & C) !== S) {
+              for (te === 0 && (te = ee), R += m, F = 1 << (W = E - te); W + te < O && !((F -= Y[W + te]) <= 0); ) W++, F <<= 1;
+              if (J += 1 << W, c === 1 && 852 < J || c === 2 && 592 < J) return 1;
+              y[S = P & C] = ee << 24 | W << 16 | R - h | 0;
             }
           }
-          return I !== 0 && (y[R + I] = E - te << 24 | 64 << 16 | 0), v.bits = ee, 0;
+          return P !== 0 && (y[R + P] = E - te << 24 | 64 << 16 | 0), v.bits = ee, 0;
         };
       }, { "../utils/common": 41 }], 51: [function(t, i, n) {
         i.exports = { 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" };
@@ -4140,7 +4209,7 @@ function Ot() {
         function a(w) {
           for (var T = w.length; 0 <= --T; ) w[T] = 0;
         }
-        var l = 0, c = 29, f = 256, p = f + 1 + c, d = 30, y = 19, h = 2 * p + 1, g = 15, v = 16, b = 7, k = 256, S = 16, C = 17, R = 18, z = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], W = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], D = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], H = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], q = new Array(2 * (p + 2));
+        var l = 0, c = 29, f = 256, p = f + 1 + c, d = 30, y = 19, h = 2 * p + 1, g = 15, v = 16, b = 7, k = 256, S = 16, C = 17, R = 18, z = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], U = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], D = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], H = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], q = new Array(2 * (p + 2));
         a(q);
         var E = new Array(2 * d);
         a(E);
@@ -4150,11 +4219,11 @@ function Ot() {
         a(m);
         var O = new Array(c);
         a(O);
-        var ee, U, te, F = new Array(d);
+        var ee, W, te, F = new Array(d);
         function J(w, T, V, j, A) {
           this.static_tree = w, this.extra_bits = T, this.extra_base = V, this.elems = j, this.max_length = A, this.has_stree = w && w.length;
         }
-        function I(w, T) {
+        function P(w, T) {
           this.dyn_tree = w, this.max_code = 0, this.stat_desc = T;
         }
         function L(w) {
@@ -4201,7 +4270,7 @@ function Ot() {
         }
         function ge(w, T, V) {
           var j, A, G, X, $ = 0;
-          if (w.last_lit !== 0) for (; j = w.pending_buf[w.d_buf + 2 * $] << 8 | w.pending_buf[w.d_buf + 2 * $ + 1], A = w.pending_buf[w.l_buf + $], $++, j === 0 ? Z(w, A, T) : (Z(w, (G = m[A]) + f + 1, T), (X = z[G]) !== 0 && Y(w, A -= O[G], X), Z(w, G = L(--j), V), (X = W[G]) !== 0 && Y(w, j -= F[G], X)), $ < w.last_lit; ) ;
+          if (w.last_lit !== 0) for (; j = w.pending_buf[w.d_buf + 2 * $] << 8 | w.pending_buf[w.d_buf + 2 * $ + 1], A = w.pending_buf[w.l_buf + $], $++, j === 0 ? Z(w, A, T) : (Z(w, (G = m[A]) + f + 1, T), (X = z[G]) !== 0 && Y(w, A -= O[G], X), Z(w, G = L(--j), V), (X = U[G]) !== 0 && Y(w, j -= F[G], X)), $ < w.last_lit; ) ;
           Z(w, k, T);
         }
         function me(w, T) {
@@ -4211,15 +4280,15 @@ function Ot() {
           for (T.max_code = se, V = w.heap_len >> 1; 1 <= V; V--) le(w, G, V);
           for (A = K; V = w.heap[1], w.heap[1] = w.heap[w.heap_len--], le(w, G, 1), j = w.heap[1], w.heap[--w.heap_max] = V, w.heap[--w.heap_max] = j, G[2 * A] = G[2 * V] + G[2 * j], w.depth[A] = (w.depth[V] >= w.depth[j] ? w.depth[V] : w.depth[j]) + 1, G[2 * V + 1] = G[2 * j + 1] = A, w.heap[1] = A++, le(w, G, 1), 2 <= w.heap_len; ) ;
           w.heap[--w.heap_max] = w.heap[1], (function(ne, pe) {
-            var ke, ye, Me, he, Se, De, ve = pe.dyn_tree, We = pe.max_code, lt = pe.stat_desc.static_tree, ht = pe.stat_desc.has_stree, ct = pe.stat_desc.extra_bits, Ue = pe.stat_desc.extra_base, _e = pe.stat_desc.max_length, Te = 0;
+            var ke, ye, Me, he, Ce, De, ve = pe.dyn_tree, Ue = pe.max_code, at = pe.stat_desc.static_tree, lt = pe.stat_desc.has_stree, ht = pe.stat_desc.extra_bits, We = pe.stat_desc.extra_base, _e = pe.stat_desc.max_length, Se = 0;
             for (he = 0; he <= g; he++) ne.bl_count[he] = 0;
-            for (ve[2 * ne.heap[ne.heap_max] + 1] = 0, ke = ne.heap_max + 1; ke < h; ke++) _e < (he = ve[2 * ve[2 * (ye = ne.heap[ke]) + 1] + 1] + 1) && (he = _e, Te++), ve[2 * ye + 1] = he, We < ye || (ne.bl_count[he]++, Se = 0, Ue <= ye && (Se = ct[ye - Ue]), De = ve[2 * ye], ne.opt_len += De * (he + Se), ht && (ne.static_len += De * (lt[2 * ye + 1] + Se)));
-            if (Te !== 0) {
+            for (ve[2 * ne.heap[ne.heap_max] + 1] = 0, ke = ne.heap_max + 1; ke < h; ke++) _e < (he = ve[2 * ve[2 * (ye = ne.heap[ke]) + 1] + 1] + 1) && (he = _e, Se++), ve[2 * ye + 1] = he, Ue < ye || (ne.bl_count[he]++, Ce = 0, We <= ye && (Ce = ht[ye - We]), De = ve[2 * ye], ne.opt_len += De * (he + Ce), lt && (ne.static_len += De * (at[2 * ye + 1] + Ce)));
+            if (Se !== 0) {
               do {
                 for (he = _e - 1; ne.bl_count[he] === 0; ) he--;
-                ne.bl_count[he]--, ne.bl_count[he + 1] += 2, ne.bl_count[_e]--, Te -= 2;
-              } while (0 < Te);
-              for (he = _e; he !== 0; he--) for (ye = ne.bl_count[he]; ye !== 0; ) We < (Me = ne.heap[--ke]) || (ve[2 * Me + 1] !== he && (ne.opt_len += (he - ve[2 * Me + 1]) * ve[2 * Me], ve[2 * Me + 1] = he), ye--);
+                ne.bl_count[he]--, ne.bl_count[he + 1] += 2, ne.bl_count[_e]--, Se -= 2;
+              } while (0 < Se);
+              for (he = _e; he !== 0; he--) for (ye = ne.bl_count[he]; ye !== 0; ) Ue < (Me = ne.heap[--ke]) || (ve[2 * Me + 1] !== he && (ne.opt_len += (he - ve[2 * Me + 1]) * ve[2 * Me], ve[2 * Me + 1] = he), ye--);
             }
           })(w, T), ue(G, se, w.bl_count);
         }
@@ -4236,26 +4305,26 @@ function Ot() {
           }
         }
         a(F);
-        var P = !1;
+        var I = !1;
         function x(w, T, V, j) {
           Y(w, (l << 1) + (j ? 1 : 0), 3), (function(A, G, X, $) {
             re(A), Q(A, X), Q(A, ~X), r.arraySet(A.pending_buf, A.window, G, X, A.pending), A.pending += X;
           })(w, T, V);
         }
         n._tr_init = function(w) {
-          P || ((function() {
+          I || ((function() {
             var T, V, j, A, G, X = new Array(g + 1);
             for (A = j = 0; A < c - 1; A++) for (O[A] = j, T = 0; T < 1 << z[A]; T++) m[j++] = A;
-            for (m[j - 1] = A, A = G = 0; A < 16; A++) for (F[A] = G, T = 0; T < 1 << W[A]; T++) B[G++] = A;
-            for (G >>= 7; A < d; A++) for (F[A] = G << 7, T = 0; T < 1 << W[A] - 7; T++) B[256 + G++] = A;
+            for (m[j - 1] = A, A = G = 0; A < 16; A++) for (F[A] = G, T = 0; T < 1 << U[A]; T++) B[G++] = A;
+            for (G >>= 7; A < d; A++) for (F[A] = G << 7, T = 0; T < 1 << U[A] - 7; T++) B[256 + G++] = A;
             for (V = 0; V <= g; V++) X[V] = 0;
             for (T = 0; T <= 143; ) q[2 * T + 1] = 8, T++, X[8]++;
             for (; T <= 255; ) q[2 * T + 1] = 9, T++, X[9]++;
             for (; T <= 279; ) q[2 * T + 1] = 7, T++, X[7]++;
             for (; T <= 287; ) q[2 * T + 1] = 8, T++, X[8]++;
             for (ue(q, p + 1, X), T = 0; T < d; T++) E[2 * T + 1] = 5, E[2 * T] = ae(T, 5);
-            ee = new J(q, z, f + 1, p, g), U = new J(E, W, 0, d, g), te = new J(new Array(0), D, 0, y, b);
-          })(), P = !0), w.l_desc = new I(w.dyn_ltree, ee), w.d_desc = new I(w.dyn_dtree, U), w.bl_desc = new I(w.bl_tree, te), w.bi_buf = 0, w.bi_valid = 0, ie(w);
+            ee = new J(q, z, f + 1, p, g), W = new J(E, U, 0, d, g), te = new J(new Array(0), D, 0, y, b);
+          })(), I = !0), w.l_desc = new P(w.dyn_ltree, ee), w.d_desc = new P(w.dyn_dtree, W), w.bl_desc = new P(w.bl_tree, te), w.bi_buf = 0, w.bi_valid = 0, ie(w);
         }, n._tr_stored_block = x, n._tr_flush_block = function(w, T, V, j) {
           var A, G, X = 0;
           0 < w.level ? (w.strm.data_type === 2 && (w.strm.data_type = (function($) {
@@ -4331,22 +4400,22 @@ function Ot() {
                   y = !0;
                   try {
                     (function(R) {
-                      var z = R.callback, W = R.args;
-                      switch (W.length) {
+                      var z = R.callback, U = R.args;
+                      switch (U.length) {
                         case 0:
                           z();
                           break;
                         case 1:
-                          z(W[0]);
+                          z(U[0]);
                           break;
                         case 2:
-                          z(W[0], W[1]);
+                          z(U[0], U[1]);
                           break;
                         case 3:
-                          z(W[0], W[1], W[2]);
+                          z(U[0], U[1], U[2]);
                           break;
                         default:
-                          z.apply(o, W);
+                          z.apply(o, U);
                       }
                     })(C);
                   } finally {
@@ -4359,14 +4428,14 @@ function Ot() {
               S.source === s && typeof S.data == "string" && S.data.indexOf(f) === 0 && b(+S.data.slice(f.length));
             }
           })(typeof self > "u" ? r === void 0 ? this : r : self);
-        }).call(this, typeof Ae < "u" ? Ae : typeof self < "u" ? self : typeof window < "u" ? window : {});
+        }).call(this, typeof Te < "u" ? Te : typeof self < "u" ? self : typeof window < "u" ? window : {});
       }, {}] }, {}, [10])(10);
     });
   })(Be)), Be.exports;
 }
-var Vt = Ot();
-const jt = /* @__PURE__ */ Je(Vt);
-class Wt {
+var Ht = Gt();
+const $t = /* @__PURE__ */ Je(Ht);
+class Zt {
   zipObjectUrls = [];
   /** 加载新版 manifest 分包数据，并返回 Loader 可消费的 DWGData 结构。 */
   async load(e) {
@@ -4512,7 +4581,7 @@ class Wt {
     const t = await fetch(e);
     if (!t.ok)
       throw new Error(`HTTP error! status: ${t.status}`);
-    const i = await jt.loadAsync(await t.arrayBuffer()), n = this.findZipManifestPath(i), r = await this.fetchZipJson(i, n);
+    const i = await $t.loadAsync(await t.arrayBuffer()), n = this.findZipManifestPath(i), r = await this.fetchZipJson(i, n);
     if (!this.isSplitManifest(r))
       throw new Error("[LoaderModule2d] Expected split CAD manifest data in .2d package.");
     const s = this.getZipBasePath(n);
@@ -4589,7 +4658,7 @@ class Wt {
     this.zipObjectUrls.forEach((e) => URL.revokeObjectURL(e)), this.zipObjectUrls = [];
   }
 }
-function it(M, e, t) {
+function rt(M, e, t) {
   const i = t.length - M - 1;
   if (e >= t[i])
     return i - 1;
@@ -4600,7 +4669,7 @@ function it(M, e, t) {
     e < t[s] ? r = s : n = s, s = Math.floor((n + r) / 2);
   return s;
 }
-function Ut(M, e, t, i) {
+function Yt(M, e, t, i) {
   const n = [], r = [], s = [];
   n[0] = 1;
   for (let o = 1; o <= t; ++o) {
@@ -4614,15 +4683,15 @@ function Ut(M, e, t, i) {
   }
   return n;
 }
-function Ft(M, e, t, i) {
-  const n = it(M, i, e), r = Ut(n, i, M, e), s = new Pe(0, 0, 0, 0);
+function Xt(M, e, t, i) {
+  const n = rt(M, i, e), r = Yt(n, i, M, e), s = new Pe(0, 0, 0, 0);
   for (let o = 0; o <= M; ++o) {
     const a = t[n - M + o], l = r[o], c = a.w * l;
     s.x += a.x * c, s.y += a.y * c, s.z += a.z * c, s.w += a.w * l;
   }
   return s;
 }
-function Gt(M, e, t, i, n) {
+function Kt(M, e, t, i, n) {
   const r = [];
   for (let f = 0; f <= t; ++f)
     r[f] = 0;
@@ -4673,8 +4742,8 @@ function Gt(M, e, t, i, n) {
   }
   return s;
 }
-function Ht(M, e, t, i, n) {
-  const r = n < M ? n : M, s = [], o = it(M, i, e), a = Gt(o, i, M, r, e), l = [];
+function qt(M, e, t, i, n) {
+  const r = n < M ? n : M, s = [], o = rt(M, i, e), a = Kt(o, i, M, r, e), l = [];
   for (let c = 0; c < t.length; ++c) {
     const f = t[c].clone(), p = f.w;
     f.x *= p, f.y *= p, f.z *= p, l[c] = f;
@@ -4689,7 +4758,7 @@ function Ht(M, e, t, i, n) {
     s[c] = new Pe(0, 0, 0);
   return s;
 }
-function $t(M, e) {
+function Qt(M, e) {
   let t = 1;
   for (let n = 2; n <= M; ++n)
     t *= n;
@@ -4700,7 +4769,7 @@ function $t(M, e) {
     i *= n;
   return t / i;
 }
-function Zt(M) {
+function Jt(M) {
   const e = M.length, t = [], i = [];
   for (let r = 0; r < e; ++r) {
     const s = M[r];
@@ -4710,16 +4779,16 @@ function Zt(M) {
   for (let r = 0; r < e; ++r) {
     const s = t[r].clone();
     for (let o = 1; o <= r; ++o)
-      s.sub(n[r - o].clone().multiplyScalar($t(r, o) * i[o]));
+      s.sub(n[r - o].clone().multiplyScalar(Qt(r, o) * i[o]));
     n[r] = s.divideScalar(i[0]);
   }
   return n;
 }
-function Yt(M, e, t, i, n) {
-  const r = Ht(M, e, t, i, n);
-  return Zt(r);
+function ei(M, e, t, i, n) {
+  const r = qt(M, e, t, i, n);
+  return Jt(r);
 }
-class Xt extends pt {
+class ti extends ft {
   /**
    * Constructs a new NURBS curve.
    *
@@ -4746,7 +4815,7 @@ class Xt extends pt {
    * @return {Vector3} The position on the curve.
    */
   getPoint(e, t = new Ne()) {
-    const i = t, n = this.knots[this.startKnot] + e * (this.knots[this.endKnot] - this.knots[this.startKnot]), r = Ft(this.degree, this.knots, this.controlPoints, n);
+    const i = t, n = this.knots[this.startKnot] + e * (this.knots[this.endKnot] - this.knots[this.startKnot]), r = Xt(this.degree, this.knots, this.controlPoints, n);
     return r.w !== 1 && r.divideScalar(r.w), i.set(r.x, r.y, r.z);
   }
   /**
@@ -4757,7 +4826,7 @@ class Xt extends pt {
    * @return {Vector3} The tangent vector.
    */
   getTangent(e, t = new Ne()) {
-    const i = t, n = this.knots[0] + e * (this.knots[this.knots.length - 1] - this.knots[0]), r = Yt(this.degree, this.knots, this.controlPoints, n, 1);
+    const i = t, n = this.knots[0] + e * (this.knots[this.knots.length - 1] - this.knots[0]), r = ei(this.degree, this.knots, this.controlPoints, n, 1);
     return i.copy(r[1]).normalize(), i;
   }
   toJSON() {
@@ -4769,7 +4838,7 @@ class Xt extends pt {
   }
 }
 function Ee(M, e = !1) {
-  const t = M[0].index !== null, i = new Set(Object.keys(M[0].attributes)), n = new Set(Object.keys(M[0].morphAttributes)), r = {}, s = {}, o = M[0].morphTargetsRelative, a = new mt();
+  const t = M[0].index !== null, i = new Set(Object.keys(M[0].attributes)), n = new Set(Object.keys(M[0].morphAttributes)), r = {}, s = {}, o = M[0].morphTargetsRelative, a = new pt();
   let l = 0;
   for (let c = 0; c < M.length; ++c) {
     const f = M[c];
@@ -4848,7 +4917,7 @@ function $e(M) {
       return console.error("THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.gpuType must be consistent across matching attributes."), null;
     r += c.count * t;
   }
-  const s = new e(r), o = new gt(s, t, i);
+  const s = new e(r), o = new mt(s, t, i);
   let a = 0;
   for (let l = 0; l < M.length; ++l) {
     const c = M[l];
@@ -4865,8 +4934,8 @@ function $e(M) {
   }
   return n !== void 0 && (o.gpuType = n), o;
 }
-const oe = 1e-8, Ze = 1e-3, Kt = 8421504;
-class qt {
+const oe = 1e-8, Ze = 1e-3, ii = 8421504;
+class ni {
   constructor(e) {
     this.engine = e;
   }
@@ -4879,7 +4948,7 @@ class qt {
     if (this.isSolidFill(e))
       return this.createSolidItems(e, t, i);
     const r = this.createPatternLineItem(e, t, i);
-    return r ? [r] : (this.warnUnknownPatternFallback(e), this.createSolidItems(e, t, i, Kt));
+    return r ? [r] : (this.warnUnknownPatternFallback(e), this.createSolidItems(e, t, i, ii));
   }
   /** 只有明确的 SOLID 才作为实心面；patternType=SolidFill 在当前导出数据里不可靠。 */
   isSolidFill(e) {
@@ -5087,7 +5156,7 @@ class qt {
     }
     if (n.length === 0) return null;
     n.forEach((a) => a.applyMatrix4(t));
-    const o = tt(n);
+    const o = nt(n);
     return {
       kind: "line",
       layer: e.layer ?? "0",
@@ -5111,10 +5180,10 @@ class qt {
       new _.Vector2(r.minX, r.maxY)
     ], h = f.dot(c), g = y.map((z) => z.dot(c) - h), v = Math.min(...g) - s, b = Math.max(...g) + s, k = Math.floor(Math.min(v / d, b / d)) - 2, S = Math.ceil(Math.max(v / d, b / d)) + 2, C = [], R = new _.Vector2((r.minX + r.maxX) / 2, (r.minY + r.maxY) / 2);
     for (let z = k; z <= S && C.length < o; z += 1) {
-      const W = f.clone().add(p.clone().multiplyScalar(z)), D = W.clone().add(l.clone().multiplyScalar(R.clone().sub(W).dot(l))), H = D.clone().add(l.clone().multiplyScalar(-s * 2)), q = D.clone().add(l.clone().multiplyScalar(s * 2));
+      const U = f.clone().add(p.clone().multiplyScalar(z)), D = U.clone().add(l.clone().multiplyScalar(R.clone().sub(U).dot(l))), H = D.clone().add(l.clone().multiplyScalar(-s * 2)), q = D.clone().add(l.clone().multiplyScalar(s * 2));
       this.clipLineByPolygon(H, q, i).forEach(([B, m]) => {
         this.subtractHoles(B, m, n).forEach(([O, ee]) => {
-          this.appendDashedSegment(C, O, ee, t.dashLengths, W, l);
+          this.appendDashedSegment(C, O, ee, t.dashLengths, U, l);
         });
       });
     }
@@ -5249,7 +5318,7 @@ class qt {
 }
 class Ye {
   constructor(e, t) {
-    this.engine = e, this.textFactory = t, this.hatchRenderer = new qt(e);
+    this.engine = e, this.textFactory = t, this.hatchRenderer = new ni(e);
   }
   hatchRenderer;
   /** 根据实体类型分发到线、文字、填充、图片等具体几何生成逻辑。 */
@@ -5293,7 +5362,7 @@ class Ye {
       case "LINE_GROUP":
         return this.getLineGroupPoints(e);
       case "LINE":
-        return [be(e.startPoint), be(e.endPoint)];
+        return [we(e.startPoint), we(e.endPoint)];
       case "CIRCLE":
         return this.getCirclePoints(e);
       case "POLYLINE":
@@ -5338,7 +5407,7 @@ class Ye {
   }
   /** 根据 bulge = tan(圆心角 / 4) 将单段多段线转换为直线或圆弧采样点对。 */
   getPolylineSegmentPoints(e, t) {
-    const i = be(e), n = be(t), r = Number(e?.bulge ?? 0);
+    const i = we(e), n = we(t), r = Number(e?.bulge ?? 0);
     if (!Number.isFinite(r) || Math.abs(r) < 1e-10) return [i, n];
     const s = n.clone().sub(i), o = s.length();
     if (o < 1e-12) return [i, n];
@@ -5351,7 +5420,7 @@ class Ye {
   }
   /** 样条线使用控制点生成平滑曲线，不强制穿过每一个控制点。 */
   getSplinePoints(e) {
-    const t = (e.points ?? []).map((n) => be(n));
+    const t = (e.points ?? []).map((n) => we(n));
     if (t.length < 2) return [];
     const i = t.length === 2 ? t : this.sampleSplineCurve(t, e);
     return this.pointsToSegments(i);
@@ -5363,7 +5432,7 @@ class Ye {
       return new _.Vector4(a.x, a.y, a.z, Number.isFinite(c) ? c : 1);
     });
     let s = (e.length - 1) * 2;
-    const o = new Xt(i, n, r).getPoints(s);
+    const o = new ti(i, n, r).getPoints(s);
     return t.closed === !0 && o.length > 1 && o.push(o[0].clone()), o;
   }
   /** 在缺少 knots 的数据里生成首尾夹紧的均匀节点向量。 */
@@ -5388,7 +5457,7 @@ class Ye {
   createImage(e, t) {
     const i = e.imageUrl || e.url;
     if (!i) return [];
-    const n = be(e.position), r = be(e.uVector), s = be(e.vVector), o = Number(e.pixelWidth ?? e.width ?? 1), a = Number(e.pixelHeight ?? e.height ?? 1);
+    const n = we(e.position), r = we(e.uVector), s = we(e.vVector), o = Number(e.pixelWidth ?? e.width ?? 1), a = Number(e.pixelHeight ?? e.height ?? 1);
     if (!Number.isFinite(o) || !Number.isFinite(a) || o === 0 || a === 0) return [];
     const l = r.multiplyScalar(o), c = s.multiplyScalar(a), f = n.clone(), p = n.clone().add(l), d = n.clone().add(l).add(c), y = n.clone().add(c);
     [f, p, d, y].forEach((b) => b.applyMatrix4(t));
@@ -5441,7 +5510,7 @@ class Ye {
     }];
   }
 }
-class Qt {
+class ri {
   constructor(e, t, i = e.modelGroup, n = {}) {
     this.model = t, this.targetGroup = i, this.options = n;
   }
@@ -5532,7 +5601,7 @@ class Qt {
       const l = this.targetGroup.children.length - 1;
       let c = 0;
       e.forEach((f, p) => {
-        const d = tt(f.points);
+        const d = nt(f.points);
         this.pushNodeMap(p, {
           indexes: [l, c, c + f.points.length * 3],
           object: o,
@@ -5758,13 +5827,13 @@ class Xe {
     return r.applyMatrix4(Oe([(t.min.x + t.max.x) / 2, (t.min.y + t.max.y) / 2, 0], [1, 1, 1], 0)), r;
   }
 }
-class Jt {
+class si {
   engine;
   data = null;
   enableValidation = !0;
   model = this.createEmptyModel();
   font = null;
-  dataSource = new Wt();
+  dataSource = new Zt();
   lastBuildOptions = {};
   activeWorkspace = { type: "model", name: "模型" };
   workspaceCache = /* @__PURE__ */ new Map();
@@ -5942,7 +6011,7 @@ class Jt {
     for (let a = 0; a < e.length; a += 1) {
       const l = e[a], c = this.createTileGroup(l, n.namePrefix);
       t.add(c);
-      const f = new Qt(this.engine, this.model, c, {
+      const f = new ri(this.engine, this.model, c, {
         interactive: n.interactive ?? !0
       }), p = /* @__PURE__ */ new Set();
       let d = 0, y = 0;
@@ -6177,7 +6246,7 @@ class Jt {
   }
   /** 按图纸实际文字裁剪字体字符集，降低字体转换成本。 */
   async loadFont(e) {
-    const t = this.engine.options?.fontUrl ?? "/fonts/simfang.ttf", i = await ce.fromUrl(t, { chars: this.collectTextChars(e) });
+    const t = this.engine.options?.fontUrl ?? be("/fonts/simfang.ttf", import.meta.url), i = await ce.fromUrl(t, { chars: this.collectTextChars(e) });
     return ce.toThreeFont(i);
   }
   /** 从 block 实体中收集需要转换的文字字符；根实体来自 tile insert，不包含真实文字。 */
@@ -6203,7 +6272,7 @@ class Jt {
       r && e ? this.engine.cameraModule2d?.fitToExtents(e) : r && this.engine.fitToView();
     } catch {
     }
-    this.engine.layerManager || (this.engine.layerManager = new et(this.engine)), this.engine.layerManager._loadLayers();
+    this.engine.layerManager || (this.engine.layerManager = new it(this.engine)), this.engine.layerManager._loadLayers();
     const i = this.engine.scene?.background, n = i instanceof _.Color ? i.getHex() : this.engine.options?.backgroundColor ?? 1710618;
     this.engine.modelToolModule2d?.updateColorsForBackground(n), this.engine.layerManager.refresh(), this.engine.events?.trigger(fe.ModelLoaded, {});
   }
@@ -6267,7 +6336,7 @@ class Jt {
     this.clear();
   }
 }
-class nt {
+class st {
   /**
    * 构造函数
    * @param camera - Three.js 相机对象（用于投影计算）
@@ -6379,7 +6448,7 @@ class nt {
     this.scene = e;
   }
 }
-class ei {
+class oi {
   engine;
   pickBoxElementIds = [];
   worldToScreen;
@@ -6387,7 +6456,7 @@ class ei {
   maxHoverLineCoordinateCount = 3e4;
   maxHoverMeshVertexCount = 3e4;
   constructor(e) {
-    this.engine = e, this.pickBoxElementIds = [], this.worldToScreen = new nt(e.camera, e.renderer, e.scene);
+    this.engine = e, this.pickBoxElementIds = [], this.worldToScreen = new st(e.camera, e.renderer, e.scene);
   }
   init() {
     this.pickBoxElementIds = [];
@@ -6516,7 +6585,7 @@ class ei {
     return e.distanceTo(a);
   }
 }
-class ti {
+class ai {
   engine;
   // 小组件容器
   widgetContainer = null;
@@ -6543,7 +6612,7 @@ class ti {
   // 是否启用状态
   enabled = !1;
   constructor(e) {
-    this.engine = e, this.worldToScreen = new nt(e.camera, e.renderer, e.scene), this.initWidget();
+    this.engine = e, this.worldToScreen = new st(e.camera, e.renderer, e.scene), this.initWidget();
     let t = this;
     this.engine.controlModule2d.panControls.addEventListener("change", () => {
       t.updateViewPoint();
@@ -6684,7 +6753,7 @@ class ti {
     return Math.atan2(e.clientX - i, n - e.clientY);
   }
 }
-class ii {
+class li {
   engine;
   enabled = !1;
   constructor(e) {
@@ -6737,7 +6806,7 @@ class ii {
     return e?.object ?? e?.group?.children?.[e.indexes?.[0]] ?? this.engine.modelGroup?.children?.[e.indexes?.[0]];
   }
 }
-class ni {
+class hi {
   engine;
   highlightMaterial;
   hideMaterial;
@@ -6997,7 +7066,7 @@ class ni {
     return !0;
   }
 }
-function ri(M) {
+function ci(M) {
   const e = {
     mouseMoveFrame: null,
     latestMouseMoveEvent: null,
@@ -7107,7 +7176,7 @@ function ri(M) {
   }
   return e;
 }
-class si {
+class di {
   el;
   xEl;
   yEl;
@@ -7126,8 +7195,8 @@ class si {
     this.el.parentElement?.removeChild(this.el);
   }
 }
-var rt = /* @__PURE__ */ ((M) => (M.ModelLoadStart = "model-load-start", M.ModelLoadProgress = "model-load-progress", M.ModelLoaded = "model-loaded", M.ModelError = "model-error", M.SelectionChanged = "selection-changed", M.HoverChanged = "hover-changed", M.Click = "click", M.MouseMove = "mouse-move", M.CameraChanged = "camera-changed", M.CameraIdle = "camera-idle", M.EngineFree = "engine-free", M.EngineBusy = "engine-busy", M.MeasureChanged = "measure-changed", M.MeasureClick = "measure-click", M.SectionMove = "section-move", M))(rt || {});
-class oi {
+var ot = /* @__PURE__ */ ((M) => (M.ModelLoadStart = "model-load-start", M.ModelLoadProgress = "model-load-progress", M.ModelLoaded = "model-loaded", M.ModelError = "model-error", M.SelectionChanged = "selection-changed", M.HoverChanged = "hover-changed", M.Click = "click", M.MouseMove = "mouse-move", M.CameraChanged = "camera-changed", M.CameraIdle = "camera-idle", M.EngineFree = "engine-free", M.EngineBusy = "engine-busy", M.MeasureChanged = "measure-changed", M.MeasureClick = "measure-click", M.SectionMove = "section-move", M))(ot || {});
+class ui {
   engine;
   behavior;
   mouseCoordUI = null;
@@ -7137,7 +7206,7 @@ class oi {
   init() {
     this.behavior = this.engine.handelBehaved2d, this.behavior.init(this);
     const e = this.engine.container;
-    e && this.engine.options?.showMouseCoordinates !== !1 && (this.mouseCoordUI = new si(e));
+    e && this.engine.options?.showMouseCoordinates !== !1 && (this.mouseCoordUI = new di(e));
   }
   active() {
     this.behavior.active();
@@ -7179,7 +7248,7 @@ class oi {
   handleMouseClick(e) {
     if (this.canHandleElementInteraction())
       if (e.catch != null && this.isModelInteractive(e.catch.id)) {
-        this.engine.modelToolModule2d.highlightModel([e.catch.id]), this.engine.events.trigger(rt.Click, e.catch.id);
+        this.engine.modelToolModule2d.highlightModel([e.catch.id]), this.engine.events.trigger(ot.Click, e.catch.id);
         let t = new CustomEvent("D2ElementClick", {
           detail: { id: e.catch.id }
         });
@@ -7204,7 +7273,7 @@ class oi {
     this.mouseCoordUI?.dispose(), this.mouseCoordUI = null;
   }
 }
-class ai {
+class fi {
   overlay;
   hLine;
   vLine;
@@ -7258,7 +7327,7 @@ const Ke = [
   { action: "linkElement2d3d", label: "模型联动", dividerBefore: !0 },
   { action: "linkView2d3d", label: "视角关联" }
 ];
-class li {
+class pi {
   menu;
   container;
   canvas;
@@ -7331,7 +7400,7 @@ class li {
     this.canvas.removeEventListener("contextmenu", this.onContextMenu), document.removeEventListener("mousedown", this.onDocMouseDown), document.removeEventListener("keydown", this.onEscape), this.menu.parentElement?.removeChild(this.menu);
   }
 }
-class hi {
+class mi {
   overlay = null;
   textEl = null;
   barEl = null;
@@ -7466,14 +7535,14 @@ class hi {
     this.overlay?.remove(), this.overlay = null, this.textEl = null, this.barEl = null, this.pctEl = null;
   }
 }
-const ci = `<svg width="16" height="16" viewBox="0 0 16 16" fill="none" xmlns="http://www.w3.org/2000/svg">
+const gi = `<svg width="16" height="16" viewBox="0 0 16 16" fill="none" xmlns="http://www.w3.org/2000/svg">
   <circle cx="6.5" cy="6.5" r="4.5" stroke="currentColor" stroke-width="1.5"/>
   <line x1="10" y1="10" x2="14" y2="14" stroke="currentColor" stroke-width="1.5" stroke-linecap="round"/>
-</svg>`, di = `<svg width="12" height="12" viewBox="0 0 12 12" fill="none" xmlns="http://www.w3.org/2000/svg">
+</svg>`, yi = `<svg width="12" height="12" viewBox="0 0 12 12" fill="none" xmlns="http://www.w3.org/2000/svg">
   <line x1="1" y1="1" x2="11" y2="11" stroke="currentColor" stroke-width="1.5" stroke-linecap="round"/>
   <line x1="11" y1="1" x2="1" y2="11" stroke="currentColor" stroke-width="1.5" stroke-linecap="round"/>
 </svg>`;
-class ui {
+class vi {
   manager;
   wrapper;
   input;
@@ -7492,7 +7561,7 @@ class ui {
     return e.className = "engine-2d-search", e.innerHTML = `
       <div class="engine-2d-search__box">
         <div class="engine-2d-search__input-row">
-          <span class="engine-2d-search__icon">${ci}</span>
+          <span class="engine-2d-search__icon">${gi}</span>
           <input
             class="engine-2d-search__input"
             type="text"
@@ -7500,7 +7569,7 @@ class ui {
             autocomplete="off"
             spellcheck="false"
           />
-          <button class="engine-2d-search__clear" title="清除">${di}</button>
+          <button class="engine-2d-search__clear" title="清除">${yi}</button>
         </div>
         <div class="engine-2d-search__divider"></div>
         <div class="engine-2d-search__status"></div>
@@ -7606,13 +7675,13 @@ class ui {
     this.input.removeEventListener("input", this.onInput), this.input.removeEventListener("keydown", this.onKeyDown), this.clearBtn.removeEventListener("click", this.onClear), document.removeEventListener("mousedown", this.onDocMouseDown), document.removeEventListener("keydown", this.onEscape), this.wrapper.parentElement?.removeChild(this.wrapper), this.debounceTimer !== null && clearTimeout(this.debounceTimer);
   }
 }
-class fi {
+class bi {
   engine;
   searchUI = null;
   constructor(e) {
     this.engine = e;
     const t = document.getElementById(e?.options?.containerId ?? "") ?? e?.container ?? null;
-    t && (this.searchUI = new ui(t, this));
+    t && (this.searchUI = new vi(t, this));
   }
   /** 只查询已加载的文字实体，支持连续包含和按字符顺序的模糊匹配。 */
   search(e) {
@@ -7789,7 +7858,7 @@ const qe = {
     "--e2d-coord-label": "rgba(0,0,0,0.50)"
   }
 };
-class pi {
+class wi {
   container;
   current;
   constructor(e, t = "dark") {
@@ -7822,7 +7891,7 @@ const Qe = {
   areaUnit: "m²",
   scale: 1
 };
-class Ve {
+class je {
   manager;
   points = [];
   constructor(e) {
@@ -7857,7 +7926,7 @@ class Ve {
     this.clearAllPoints();
   }
 }
-class mi extends Ve {
+class xi extends je {
   /** 两点完成一条距离测量。 */
   handleClick(e) {
     super.handleClick(e), this.points.length === 2 && (this.manager.addMeasurement("distance", this.points), this.clearAllPoints());
@@ -7866,7 +7935,7 @@ class mi extends Ve {
     this.points.length === 1 && this.manager.drawPreview("distance", [this.points[0], e]);
   }
 }
-class gi extends Ve {
+class ki extends je {
   /** 三点及以上可以闭合面积，双击或 Enter 结束。 */
   handleClick(e) {
     super.handleClick(e), this.manager.drawPreview("area", this.points);
@@ -7879,7 +7948,7 @@ class gi extends Ve {
     e.length >= 3 && this.manager.addMeasurement("area", e), this.clearAllPoints();
   }
 }
-class yi extends Ve {
+class Mi extends je {
   /** 三点完成角度测量，第二个点作为角点。 */
   handleClick(e) {
     super.handleClick(e), this.points.length === 3 && (this.manager.addMeasurement("angle", this.points), this.clearAllPoints());
@@ -7888,7 +7957,7 @@ class yi extends Ve {
     this.points.length >= 2 && this.manager.drawPreview("angle", [...this.points, e]);
   }
 }
-class vi {
+class _i {
   distanceMeasure;
   areaMeasure;
   angleMeasure;
@@ -7908,7 +7977,7 @@ class vi {
   hasDraggedAfterMouseDown = !1;
   currentWorkspaceKey = "model";
   constructor(e) {
-    this.engine = e, this.container = e.container, this.distanceMeasure = new mi(this), this.areaMeasure = new gi(this), this.angleMeasure = new yi(this), this.annotationContainer = document.createElement("div"), this.annotationContainer.className = "annotation-container", this.annotationContainer.style.pointerEvents = "none", this.annotationContainer.style.zIndex = "20", this.container.appendChild(this.annotationContainer);
+    this.engine = e, this.container = e.container, this.distanceMeasure = new xi(this), this.areaMeasure = new ki(this), this.angleMeasure = new Mi(this), this.annotationContainer = document.createElement("div"), this.annotationContainer.className = "annotation-container", this.annotationContainer.style.pointerEvents = "none", this.annotationContainer.style.zIndex = "20", this.container.appendChild(this.annotationContainer);
   }
   /** 开启 2D 测量事件；只停用图元点选，不停用 pan/zoom 视图控制。 */
   active() {
@@ -8161,92 +8230,23 @@ class vi {
     return `measure-2d-${Date.now()}-${Math.random().toString(16).slice(2)}`;
   }
 }
-const bi = "__BIM_ENGINE_SDK_ASSET_BASE__";
-function wi() {
-  return typeof globalThis < "u" ? globalThis : null;
-}
-function je(M) {
-  return M.endsWith("/") ? M : `${M}/`;
-}
-function st(M) {
-  return /^(?:[a-z][a-z\d+\-.]*:)?\/\//i.test(M) || /^(?:data|blob):/i.test(M);
-}
-function xi(M) {
-  return M.startsWith("./") || M.startsWith("../");
-}
-function ze(M, e) {
-  try {
-    return e ? new URL(M, e).toString() : new URL(M).toString();
-  } catch {
-    return null;
-  }
-}
-function ot() {
-  return typeof document < "u" && document.baseURI ? document.baseURI : typeof location < "u" && location.href ? location.href : null;
-}
-function ki(M, e) {
-  const t = je(M);
-  if (st(t))
-    return t;
-  const i = Ce(e) || at() || ot();
-  return ze(t, i || void 0) || t;
-}
-function Ce(M) {
-  if (!M)
-    return null;
-  try {
-    const e = ot(), t = ze(M, e || void 0) || M, i = new URL(".", t), n = i.pathname.replace(/\\/g, "/");
-    return n.endsWith("/chunks/") ? new URL("../", i).toString() : e && /\/src\//.test(n) ? je(e) : i.toString();
-  } catch {
-    return null;
-  }
-}
-function at() {
-  if (typeof document > "u")
-    return null;
-  const M = document.currentScript;
-  if (M?.src)
-    return Ce(M.src);
-  const e = document.getElementsByTagName("script");
-  for (let t = e.length - 1; t >= 0; t -= 1) {
-    const i = e[t]?.src;
-    if (i && /(?:bim-engine-sdk|iflow-engine-base|dwg-preview|gaussian)\.(?:es|umd)\.js(?:[?#].*)?$/.test(i))
-      return Ce(i);
-  }
-  return null;
-}
-function Mi(M) {
-  const t = wi()?.[bi];
-  return typeof t == "string" && t.length > 0 ? ki(t, M) : Ce(M) || at() || (typeof document < "u" ? je(document.baseURI) : "./");
-}
-function we(M, e) {
-  if (e?.includes("@fs") && (e = e.split("@")[0]), console.log("资源路径", M, e), st(M))
-    return M;
-  if (xi(M)) {
-    const n = ze(M, Ce(e) || void 0);
-    if (n)
-      return n;
-  }
-  const t = M.replace(/^\/+/, ""), i = Mi(e);
-  return ze(t, i) || t;
-}
 const Re = {
   stroke: "#ff4d4f",
   fill: "rgba(255, 77, 79, 0.08)",
   strokeWidth: 2,
   fontSize: 16,
   cloudRadius: 10
-}, _i = {
-  none: we("/assets/icon/选择.svg", import.meta.url),
-  line: we("/assets/icon/线.svg", import.meta.url),
-  arrow: we("/assets/icon/箭头.svg", import.meta.url),
-  rect: we("/assets/icon/矩形.svg", import.meta.url),
-  ellipse: we("/assets/icon/圆形.svg", import.meta.url),
-  polygon: we("/assets/icon/面积.svg", import.meta.url),
-  text: we("/assets/icon/文字.svg", import.meta.url),
-  cloudline: we("/assets/icon/云线.svg", import.meta.url)
-}, Ei = "data:image/svg+xml;utf8," + encodeURIComponent('<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24" fill="none" stroke="#1f2937" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M3 6h18"/><path d="M8 6V4h8v2"/><path d="M6 6l1 16h10l1-16"/><path d="M10 11v6"/><path d="M14 11v6"/></svg>'), Ci = "data:image/svg+xml;utf8," + encodeURIComponent('<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24" fill="none" stroke="#1f2937" stroke-width="2" stroke-linecap="round"><path d="M6 6l12 12"/><path d="M18 6L6 18"/></svg>');
-class Si {
+}, Ei = {
+  none: be("/assets/icon/选择.svg", import.meta.url),
+  line: be("/assets/icon/线.svg", import.meta.url),
+  arrow: be("/assets/icon/箭头.svg", import.meta.url),
+  rect: be("/assets/icon/矩形.svg", import.meta.url),
+  ellipse: be("/assets/icon/圆形.svg", import.meta.url),
+  polygon: be("/assets/icon/面积.svg", import.meta.url),
+  text: be("/assets/icon/文字.svg", import.meta.url),
+  cloudline: be("/assets/icon/云线.svg", import.meta.url)
+}, Ci = "data:image/svg+xml;utf8," + encodeURIComponent('<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24" fill="none" stroke="#1f2937" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M3 6h18"/><path d="M8 6V4h8v2"/><path d="M6 6l1 16h10l1-16"/><path d="M10 11v6"/><path d="M14 11v6"/></svg>'), Si = "data:image/svg+xml;utf8," + encodeURIComponent('<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24" fill="none" stroke="#1f2937" stroke-width="2" stroke-linecap="round"><path d="M6 6l12 12"/><path d="M18 6L6 18"/></svg>');
+class Ti {
   engine;
   container;
   layer;
@@ -8426,7 +8426,7 @@ class Si {
       { type: "cloudline", title: "云线，双击或 Enter 结束" },
       { type: "text", title: "文字" }
     ].forEach((a) => {
-      const l = this.createIconButton(a.title, _i[a.type]);
+      const l = this.createIconButton(a.title, Ei[a.type]);
       l.onclick = () => {
         this.active(), this.setDrawType(a.type);
       }, a.type !== "none" && (this.buttons[a.type] = l), e.appendChild(l);
@@ -8443,9 +8443,9 @@ class Si {
     r.type = "number", r.min = "10", r.max = "72", r.value = `${this.style.fontSize}`, r.title = "字号", r.onchange = () => {
       this.style.fontSize = this.normalizeNumber(r.valueAsNumber, 10, 72, Re.fontSize);
     }, e.appendChild(r), e.appendChild(this.createDivider());
-    const s = this.createIconButton("清空", Ei);
+    const s = this.createIconButton("清空", Ci);
     s.onclick = () => this.clearAll(), e.appendChild(s);
-    const o = this.createIconButton("关闭", Ci);
+    const o = this.createIconButton("关闭", Si);
     return o.onclick = () => {
       this.hideToolbar(), this.disActive();
     }, e.appendChild(o), e;
@@ -8646,7 +8646,7 @@ class Si {
     return `markup-2d-${Date.now()}-${Math.random().toString(16).slice(2)}`;
   }
 }
-class Ti {
+class Ai {
   container;
   labelContainer;
   projectCoordinate;
@@ -8845,11 +8845,11 @@ class Ti {
     e.stopImmediatePropagation();
   };
 }
-class Ai {
+class Li {
   engine;
   manager;
   constructor(e) {
-    this.engine = e, this.manager = new Ti({
+    this.engine = e, this.manager = new Ai({
       container: e.container,
       className: "bim-engine-label-container bim-engine-label-container-2d",
       projectCoordinate: (t) => this.projectCoordinate(t),
@@ -8912,7 +8912,7 @@ class Ai {
     return { x: i.x, y: i.y, z: 0 };
   }
 }
-class Li {
+class Pi {
   engine;
   mainViewPort = null;
   constructor(e) {
@@ -8987,10 +8987,10 @@ class Ii {
     this.unsubscribe(), this.el.remove();
   }
 }
-const Pi = "3.9.16", zi = {
-  version: Pi
-}, Di = zi.version;
-class Bi {
+const zi = "3.9.161", Di = {
+  version: zi
+}, Bi = Di.version;
+class Ri {
   // 配置选项
   options;
   container = null;
@@ -9035,7 +9035,7 @@ class Bi {
   renderer = null;
   // 数据
   dwgData = null;
-  version = Di;
+  version = Bi;
   constructor(e) {
     if (this.options = e, this.options.backgroundColor = this.options.backgroundColor ?? 1710618, this.options.enablePerformanceMonitoring = this.options.enablePerformanceMonitoring ?? !1, this.options.showMouseCoordinates = this.options.showMouseCoordinates ?? !1, this.options.loadingStyle = this.options.loadingStyle ?? 2, this.options.contextMenu = this.options.contextMenu ?? {
       items: [
@@ -9049,13 +9049,13 @@ class Bi {
       ]
     }, this.enablePerformanceMonitoring = e.enablePerformanceMonitoring ?? !1, this.container = document.getElementById(e.containerId), !this.container)
       throw new Error(`Container ${e.containerId} not found`);
-    this.initialize(), this.handelBehaved2d = ri(this), this.interactionModule2d = new oi(this), this.interactionModule2d.init(), this.interactionModule2d.active();
+    this.initialize(), this.handelBehaved2d = ci(this), this.interactionModule2d = new ui(this), this.interactionModule2d.init(), this.interactionModule2d.active();
   }
   /**
    * 初始化引擎
    */
   initialize() {
-    this.events = new kt(!1), this.sceneModule2d = new Ct(this, this.options), this.scene = this.sceneModule2d.scene, this.cameraModule2d = new Tt(this, this.container), this.camera = this.cameraModule2d.orthographicCamera, this.renderModule2d = new At(this, this.container, this.options), this.renderer = this.renderModule2d.renderer, this.controlModule2d = new It(this), this.loaderModule2d = new Jt(this), this.themeManager = new pi(this.container), this.layerManager = new et(this), this.searchManager = new fi(this), this.measure = new vi(this), this.markup = new Si(this), this.label = new Ai(this), this.viewCube = new Li(this), this.octreeBox2d = new ei(this), this.modelToolModule2d = new ni(this), this.engineStatus2d = new St(this), this.linkView2d3d = new ti(this), this.linkElement2d3d = new ii(this), this.sceneModule2d.initGrid(), this.cadCursorUI = new ai(this.container, this.renderer.domElement, this.options.cursorStyle ?? "short-crosshair"), this.cadCursorUI.setBackgroundColor(this.options.backgroundColor ?? 1710618), this.loadingUI = new hi(this.container, this.options.loadingStyle), this.events.on(fe.ModelLoadStart, () => this.loadingUI.show("正在加载...", 0)), this.events.on(fe.ModelLoadProgress, (e) => this.loadingUI.update(e.text, e.progress)), this.events.on(fe.ModelLoaded, () => this.loadingUI.hide()), this.events.on(fe.ModelLoadError, () => this.loadingUI.hide()), this.versionEl = document.createElement("div"), this.versionEl.className = "engine-2d-version-text", this.updateVersionDisplay(), this.container.appendChild(this.versionEl), this.workspaceTabsUI = new Ii(this.container, this), this.contextMenuUI = new li(
+    this.events = new xt(!1), this.sceneModule2d = new Et(this, this.options), this.scene = this.sceneModule2d.scene, this.cameraModule2d = new St(this, this.container), this.camera = this.cameraModule2d.orthographicCamera, this.renderModule2d = new Tt(this, this.container, this.options), this.renderer = this.renderModule2d.renderer, this.controlModule2d = new Lt(this), this.loaderModule2d = new si(this), this.themeManager = new wi(this.container), this.layerManager = new it(this), this.searchManager = new bi(this), this.measure = new _i(this), this.markup = new Ti(this), this.label = new Li(this), this.viewCube = new Pi(this), this.octreeBox2d = new oi(this), this.modelToolModule2d = new hi(this), this.engineStatus2d = new Ct(this), this.linkView2d3d = new ai(this), this.linkElement2d3d = new li(this), this.sceneModule2d.initGrid(), this.cadCursorUI = new fi(this.container, this.renderer.domElement, this.options.cursorStyle ?? "short-crosshair"), this.cadCursorUI.setBackgroundColor(this.options.backgroundColor ?? 1710618), this.loadingUI = new mi(this.container, this.options.loadingStyle), this.events.on(fe.ModelLoadStart, () => this.loadingUI.show("正在加载...", 0)), this.events.on(fe.ModelLoadProgress, (e) => this.loadingUI.update(e.text, e.progress)), this.events.on(fe.ModelLoaded, () => this.loadingUI.hide()), this.events.on(fe.ModelLoadError, () => this.loadingUI.hide()), this.versionEl = document.createElement("div"), this.versionEl.className = "engine-2d-version-text", this.updateVersionDisplay(), this.container.appendChild(this.versionEl), this.workspaceTabsUI = new Ii(this.container, this), this.contextMenuUI = new pi(
       this.container,
       this.renderer.domElement,
       (e) => {
@@ -9098,7 +9098,7 @@ class Bi {
   };
   /** 初始化 stats.js 性能监视器，showStats 优先控制可视面板，旧配置 enablePerformanceMonitoring 继续兼容。 */
   initStatsMonitor() {
-    !(this.options.showStats ?? this.enablePerformanceMonitoring) || !this.container || (this.stats = new xt(), this.stats.showPanel(0), this.stats.dom.className = "engine-2d-stats-monitor", this.stats.dom.style.position = "absolute", this.stats.dom.style.top = "0px", this.stats.dom.style.left = "0px", this.stats.dom.style.zIndex = "1000", this.container.appendChild(this.stats.dom));
+    !(this.options.showStats ?? this.enablePerformanceMonitoring) || !this.container || (this.stats = new wt(), this.stats.showPanel(0), this.stats.dom.className = "engine-2d-stats-monitor", this.stats.dom.style.position = "absolute", this.stats.dom.style.top = "0px", this.stats.dom.style.left = "0px", this.stats.dom.style.zIndex = "1000", this.container.appendChild(this.stats.dom));
   }
   /**
    * 更新性能统计
@@ -9317,11 +9317,11 @@ class Bi {
     console.log("[EngineKernel2d] Disposing engine..."), this.stopRendering(), this.cadCursorUI?.dispose(), this.contextMenuUI?.dispose(), this.loadingUI?.dispose(), this.workspaceTabsUI?.dispose(), this.versionEl?.parentElement?.removeChild(this.versionEl), this.searchManager?.dispose(), this.measure?.dispose(), this.markup?.dispose(), this.label?.dispose(), this.themeManager?.dispose(), this.loaderModule2d?.dispose(), this.controlModule2d?.dispose(), this.renderModule2d?.dispose(), this.cameraModule2d?.dispose(), this.sceneModule2d?.dispose(), this.events?.dispose(), this.stats?.dom?.parentElement && this.stats.dom.parentElement.removeChild(this.stats.dom), this.scene = null, this.camera = null, this.renderer = null, this.dwgData = null, this.stats = void 0, this.versionEl = null, console.log("[EngineKernel2d] Engine disposed");
   }
 }
-function Ni(M) {
-  return new Bi(M);
+function Oi(M) {
+  return new Ri(M);
 }
 export {
-  Bi as EngineKernel2d,
-  Ni as createEngine2d,
-  Ni as default
+  Ri as EngineKernel2d,
+  Oi as createEngine2d,
+  Oi as default
 };