ppt-dsl-renderer 1.1.2 → 1.1.3

package/dist/cli.js

@@ -1,43 +1,45 @@
 #!/usr/bin/env node
-import { parseArgs as j } from "node:util";
-import { readFile as $, mkdir as T, writeFile as D, rename as I, rm as B } from "node:fs/promises";
-import { resolve as w, dirname as P, join as S } from "node:path";
-import { fileURLToPath as L } from "node:url";
-import { randomUUID as C } from "node:crypto";
-function J(t) {
-  const e = { status: "loading", errors: [] };
-  t.__PPT_DSL_RENDER__ = e;
-  const s = (i) => {
-    e.status = "error", e.errors.push(i);
+import { parseArgs as ae } from "node:util";
+import { readFile as xt, mkdir as Pt, writeFile as Lt, rename as Xt, rm as Yt, stat as Bt, readdir as se } from "node:fs/promises";
+import Mt, { resolve as ft, dirname as Tt, join as St, extname as Zt } from "node:path";
+import { fileURLToPath as Ut, pathToFileURL as qt } from "node:url";
+import { randomUUID as Kt } from "node:crypto";
+import { createRequire as oe } from "node:module";
+import Jt from "node:fs";
+function le(E) {
+  const P = { status: "loading", errors: [] };
+  E.__PPT_DSL_RENDER__ = P;
+  const n = (S) => {
+    P.status = "error", P.errors.push(S);
   };
-  t.addEventListener("error", (i) => {
-    var a;
-    i.message ? s(i.message) : (a = i.target) != null && a.src && s(`资源加载失败：${i.target.src}`);
-  }, !0), t.addEventListener("unhandledrejection", (i) => {
-    var a;
-    s(((a = i.reason) == null ? void 0 : a.message) || String(i.reason));
-  }), t.setTimeout(() => {
-    e.status === "loading" && s("渲染超过 30 秒仍未完成");
+  E.addEventListener("error", (S) => {
+    var g;
+    S.message ? n(S.message) : (g = S.target) != null && g.src && n(`资源加载失败：${S.target.src}`);
+  }, !0), E.addEventListener("unhandledrejection", (S) => {
+    var g;
+    n(((g = S.reason) == null ? void 0 : g.message) || String(S.reason));
+  }), E.setTimeout(() => {
+    P.status === "loading" && n("渲染超过 30 秒仍未完成");
   }, 3e4);
 }
-function H(t) {
-  const { width: e, height: s } = JSON.parse(t.document.getElementById("ppt-dsl-data").textContent), i = t.document.getElementById("ppt-stage"), a = t.document.getElementById("ppt-root");
-  a.style.width = `${e}px`, a.style.height = `${s}px`;
+function he(E) {
+  const { width: P, height: n } = JSON.parse(E.document.getElementById("ppt-dsl-data").textContent), S = E.document.getElementById("ppt-stage"), g = E.document.getElementById("ppt-root");
+  g.style.width = `${P}px`, g.style.height = `${n}px`;
   const l = () => {
-    const d = Math.min(1, t.innerWidth / e, t.innerHeight / s);
-    i.style.width = `${e * d}px`, i.style.height = `${s * d}px`, a.style.transform = `scale(${d})`;
+    const o = Math.min(1, E.innerWidth / P, E.innerHeight / n);
+    S.style.width = `${P * o}px`, S.style.height = `${n * o}px`, g.style.transform = `scale(${o})`;
   };
-  l(), t.addEventListener("resize", l);
+  l(), E.addEventListener("resize", l);
 }
-function X(t, e, s) {
-  const i = t.replaceAll("<", "\\u003c").replaceAll("\u2028", "\\u2028").replaceAll("\u2029", "\\u2029");
+function ce(E, P, n) {
+  const S = E.replaceAll("<", "\\u003c").replaceAll("\u2028", "\\u2028").replaceAll("\u2029", "\\u2029");
   return `<!doctype html>
 <html lang="zh-CN">
 <head>
 <meta charset="utf-8">
 <meta name="viewport" content="width=device-width, initial-scale=1">
 <title>PPT DSL</title>
-<style>${s.replace(/<\/style/gi, "<\\/style")}
+<style>${n.replace(/<\/style/gi, "<\\/style")}
 html, body { width: 100%; height: 100%; overflow: hidden; }
 #ppt-viewport { position: fixed; inset: 0; display: grid; place-items: center; background: #f2f4f6; }
 #ppt-stage { position: relative; }
@@ -46,200 +48,3556 @@ html, body { width: 100%; height: 100%; overflow: hidden; }
 </head>
 <body>
 <div id="ppt-viewport"><div id="ppt-stage"><div id="ppt-root"></div></div></div>
-<script id="ppt-dsl-data" type="application/json">${i}<\/script>
-<script>(${J.toString()})(window);(${H.toString()})(window);<\/script>
-<script>${e.replace(/<\/script/gi, "<\\/script")}<\/script>
+<script id="ppt-dsl-data" type="application/json">${S}<\/script>
+<script>(${le.toString()})(window);(${he.toString()})(window);<\/script>
+<script>${P.replace(/<\/script/gi, "<\\/script")}<\/script>
 </body>
 </html>`;
 }
-const M = /* @__PURE__ */ new Set(["text", "image", "shape", "line", "chart", "table", "latex", "video", "audio"]), z = /* @__PURE__ */ new Set(["area", "bar", "column", "line", "pie", "radar", "ring", "scatter"]), b = (t) => t !== null && typeof t == "object" && !Array.isArray(t), u = (t) => typeof t == "string", E = (t) => Array.isArray(t) && t.length === 2 && t.every(Number.isFinite);
-function n(t, e) {
-  if (!t)
-    throw new Error(e);
-}
-function N(t, e) {
-  n(u(t) && /^(https?:\/\/|data:)/i.test(t), `${e} 必须使用 HTTP(S) URL 或 data URL`);
-  const s = new URL(t);
-  n(["http:", "https:", "data:"].includes(s.protocol), `${e} 资源协议不受支持`);
-}
-function k(t) {
-  n(b(t), "DSL 顶层必须是对象"), n(u(t.title) && t.title.length > 0, "DSL 缺少 title"), n(Number.isFinite(t.width) && t.width > 0, "DSL width 必须是大于 0 的有限数值"), n(Number.isFinite(t.height) && t.height > 0, "DSL height 必须是大于 0 的有限数值"), n(Array.isArray(t.slides) && t.slides.length > 0, "DSL slides 不能为空"), t.slides.forEach((e, s) => {
-    var l, d;
-    const i = `第 ${s + 1} 页`;
-    n(b(e) && u(e.id) && e.id && Array.isArray(e.elements), `${i}结构无效`), ((l = e.background) == null ? void 0 : l.type) === "image" && N((d = e.background.image) == null ? void 0 : d.src, `${i}背景图`);
-    const a = /* @__PURE__ */ new Set();
-    e.elements.forEach((r) => {
-      var g;
-      n(b(r) && u(r.id) && r.id && M.has(r.type), `${i}存在无效元素`);
-      const p = `${i}元素 ${r.id}`;
-      n(!a.has(r.id), `${p} ID 重复`), a.add(r.id), n([r.left, r.top].every(Number.isFinite), `${p}缺少有效坐标`);
-      for (const o of ["width", "height", "rotate", "opacity"])
-        r[o] !== void 0 && n(Number.isFinite(r[o]), `${p}.${o} 必须是有限数值`);
-      switch (r.type) {
+const ue = /* @__PURE__ */ new Set(["text", "image", "shape", "line", "chart", "table", "latex", "video", "audio"]), de = /* @__PURE__ */ new Set(["area", "bar", "column", "line", "pie", "radar", "ring", "scatter"]), vt = (E) => E !== null && typeof E == "object" && !Array.isArray(E), ut = (E) => typeof E == "string", Ft = (E) => Array.isArray(E) && E.length === 2 && E.every(Number.isFinite);
+function at(E, P) {
+  if (!E)
+    throw new Error(P);
+}
+function Rt(E, P) {
+  at(ut(E) && /^(https?:\/\/|data:)/i.test(E), `${P} 必须使用 HTTP(S) URL 或 data URL`);
+  const n = new URL(E);
+  at(["http:", "https:", "data:"].includes(n.protocol), `${P} 资源协议不受支持`);
+}
+function Vt(E) {
+  at(vt(E), "DSL 顶层必须是对象"), at(ut(E.title) && E.title.length > 0, "DSL 缺少 title"), at(Number.isFinite(E.width) && E.width > 0, "DSL width 必须是大于 0 的有限数值"), at(Number.isFinite(E.height) && E.height > 0, "DSL height 必须是大于 0 的有限数值"), at(Array.isArray(E.slides) && E.slides.length > 0, "DSL slides 不能为空"), E.slides.forEach((P, n) => {
+    var l, o;
+    const S = `第 ${n + 1} 页`;
+    at(vt(P) && ut(P.id) && P.id && Array.isArray(P.elements), `${S}结构无效`), ((l = P.background) == null ? void 0 : l.type) === "image" && Rt((o = P.background.image) == null ? void 0 : o.src, `${S}背景图`);
+    const g = /* @__PURE__ */ new Set();
+    P.elements.forEach((e) => {
+      var d;
+      at(vt(e) && ut(e.id) && e.id && ue.has(e.type), `${S}存在无效元素`);
+      const a = `${S}元素 ${e.id}`;
+      at(!g.has(e.id), `${a} ID 重复`), g.add(e.id), at([e.left, e.top].every(Number.isFinite), `${a}缺少有效坐标`);
+      for (const c of ["width", "height", "rotate", "opacity"])
+        e[c] !== void 0 && at(Number.isFinite(e[c]), `${a}.${c} 必须是有限数值`);
+      switch (e.type) {
         case "text":
-          n(u(r.content), `${p}.content 必须是字符串`);
+          at(ut(e.content), `${a}.content 必须是字符串`);
           break;
         case "image":
         case "audio":
         case "video":
-          N(r.src, `${p}.src`), r.poster !== void 0 && N(r.poster, `${p}.poster`);
+          Rt(e.src, `${a}.src`), e.poster !== void 0 && Rt(e.poster, `${a}.poster`);
           break;
         case "shape":
-          n(u(r.path) && E(r.viewBox), `${p}缺少 path 或有效 viewBox`), r.text !== void 0 && n(u((g = r.text) == null ? void 0 : g.content), `${p}.text.content 必须是字符串`);
+          at(ut(e.path) && Ft(e.viewBox), `${a}缺少 path 或有效 viewBox`), e.text !== void 0 && at(ut((d = e.text) == null ? void 0 : d.content), `${a}.text.content 必须是字符串`);
           break;
         case "line":
-          n(E(r.start) && E(r.end) && u(r.color), `${p}缺少 start、end 或 color`);
+          at(Ft(e.start) && Ft(e.end) && ut(e.color), `${a}缺少 start、end 或 color`);
           break;
         case "chart": {
-          const o = r.data;
-          n(z.has(r.chartType), `${p}.chartType 不受支持`), n(b(o) && Array.isArray(o.labels) && o.labels.every(u) && Array.isArray(o.legends) && o.legends.every(u) && Array.isArray(o.series) && o.series.every((h) => Array.isArray(h) && h.every(Number.isFinite)), `${p}.data 结构无效`);
+          const c = e.data;
+          at(de.has(e.chartType), `${a}.chartType 不受支持`), at(vt(c) && Array.isArray(c.labels) && c.labels.every(ut) && Array.isArray(c.legends) && c.legends.every(ut) && Array.isArray(c.series) && c.series.every((_) => Array.isArray(_) && _.every(Number.isFinite)), `${a}.data 结构无效`);
           break;
         }
         case "table":
-          n(Array.isArray(r.data) && r.data.every((o) => Array.isArray(o) && o.every((h) => b(h) && u(h.id) && h.id && u(h.text))), `${p}.data 结构无效`);
+          at(Array.isArray(e.data) && e.data.every((c) => Array.isArray(c) && c.every((_) => vt(_) && ut(_.id) && _.id && ut(_.text))), `${a}.data 结构无效`);
           break;
         case "latex":
-          n(u(r.latex), `${p}.latex 必须是字符串`);
+          at(ut(e.latex), `${a}.latex 必须是字符串`);
           break;
       }
     });
   });
 }
-function F(t, e) {
-  return e === void 0 ? Array.from({ length: t }, (s, i) => i + 1) : (n(Array.isArray(e) && e.length > 0, "pages 必须是非空页码数组"), n(e.every((s) => Number.isInteger(s) && s >= 1 && s <= t), `页码必须是 1 到 ${t} 的整数`), [...new Set(e)].sort((s, i) => s - i));
-}
-const v = w(P(L(import.meta.url)), "..");
-async function q(t, e = {}) {
-  k(t);
-  const i = F(t.slides.length, e.pages).map((d) => ({
-    pageNumber: d,
-    slideId: t.slides[d - 1].id,
-    width: t.width,
-    height: t.height,
+function Qt(E, P) {
+  return P === void 0 ? Array.from({ length: E }, (n, S) => S + 1) : (at(Array.isArray(P) && P.length > 0, "pages 必须是非空页码数组"), at(P.every((n) => Number.isInteger(n) && n >= 1 && n <= E), `页码必须是 1 到 ${E} 的整数`), [...new Set(P)].sort((n, S) => n - S));
+}
+const $t = ft(Tt(Ut(import.meta.url)), "..");
+async function fe(E, P = {}) {
+  Vt(E);
+  const S = Qt(E.slides.length, P.pages).map((o) => ({
+    pageNumber: o,
+    slideId: E.slides[o - 1].id,
+    width: E.width,
+    height: E.height,
     payload: JSON.stringify({
-      title: t.title,
-      width: t.width,
-      height: t.height,
-      pageNumber: d,
-      slide: t.slides[d - 1]
+      title: E.title,
+      width: E.width,
+      height: E.height,
+      pageNumber: o,
+      slide: E.slides[o - 1]
     })
   }));
-  let a, l;
+  let g, l;
   try {
-    [a, l] = await Promise.all([
-      $(S(v, "dist/browser/renderer.js"), "utf8"),
-      $(S(v, "dist/browser/renderer.css"), "utf8")
+    [g, l] = await Promise.all([
+      xt(St($t, "dist/browser/renderer.js"), "utf8"),
+      xt(St($t, "dist/browser/renderer.css"), "utf8")
     ]);
-  } catch (d) {
-    throw d.code !== "ENOENT" ? d : new Error("缺少预编译浏览器资源。源码仓库请先显式执行 yarn build；npm 安装包应包含 dist/browser。", { cause: d });
+  } catch (o) {
+    throw o.code !== "ENOENT" ? o : new Error("缺少预编译浏览器资源。源码仓库请先显式执行 yarn build；npm 安装包应包含 dist/browser。", { cause: o });
   }
-  return i.map(({ payload: d, ...r }) => ({
-    ...r,
-    html: X(d, a, l)
+  return S.map(({ payload: o, ...e }) => ({
+    ...e,
+    html: ce(o, g, l)
   }));
 }
-const V = w(P(L(import.meta.url)), "..");
-async function W(t, e, { pages: s, executablePath: i, timeout: a = 12e4 } = {}) {
-  k(t);
-  const l = F(t.slides.length, s), d = await $(S(V, "dist/pptx/exporter.js"), "utf8").catch((c) => {
-    throw c.code !== "ENOENT" ? c : new Error("安装包缺少 PPTX 运行产物，请使用完整构建的 ppt-dsl-renderer 包。", { cause: c });
-  }), { chromium: r } = await import("playwright-core").catch((c) => {
-    throw c.code !== "ERR_MODULE_NOT_FOUND" ? c : new Error("PPTX 导出需要显式安装 playwright-core@1.61.1。", { cause: c });
-  }), p = await r.launch({ headless: !0, ...i ? { executablePath: i } : { channel: "chrome" }, timeout: a });
-  let g, o;
+const pe = ft(Tt(Ut(import.meta.url)), "..");
+async function me(E, P, { pages: n, executablePath: S, timeout: g = 12e4 } = {}) {
+  Vt(E);
+  const l = Qt(E.slides.length, n), o = await xt(St(pe, "dist/pptx/exporter.js"), "utf8").catch((v) => {
+    throw v.code !== "ENOENT" ? v : new Error("安装包缺少 PPTX 运行产物，请使用完整构建的 ppt-dsl-renderer 包。", { cause: v });
+  }), { chromium: e } = await import("playwright-core").catch((v) => {
+    throw v.code !== "ERR_MODULE_NOT_FOUND" ? v : new Error("PPTX 导出需要显式安装 playwright-core@1.61.1。", { cause: v });
+  }), a = await e.launch({ headless: !0, ...S ? { executablePath: S } : { channel: "chrome" }, timeout: g });
+  let d, c;
   try {
-    const c = (async () => {
-      const f = await p.newPage();
-      f.on("console", (y) => console.error(y.text())), f.on("pageerror", (y) => console.error(y.message)), await f.addScriptTag({ content: d });
-      const A = await f.evaluate(async ({ document: y, pages: O }) => {
-        const R = await window.exportToPptx(y, { pages: O });
-        return new Promise((U, _) => {
-          const m = new FileReader();
-          m.onload = () => U(m.result.split(",", 2)[1]), m.onerror = () => _(m.error), m.readAsDataURL(new Blob([R]));
+    const v = (async () => {
+      const s = await a.newPage();
+      s.on("console", (i) => console.error(i.text())), s.on("pageerror", (i) => console.error(i.message)), await s.addScriptTag({ content: o });
+      const m = await s.evaluate(async ({ document: i, pages: f }) => {
+        const h = await window.exportToPptx(i, { pages: f });
+        return new Promise((u, w) => {
+          const k = new FileReader();
+          k.onload = () => u(k.result.split(",", 2)[1]), k.onerror = () => w(k.error), k.readAsDataURL(new Blob([h]));
         });
-      }, { document: t, pages: l });
-      return Buffer.from(A, "base64");
+      }, { document: E, pages: l });
+      return Buffer.from(m, "base64");
     })();
-    o = await Promise.race([
-      c,
-      new Promise((f, A) => {
-        g = setTimeout(() => A(new Error(`PPTX 导出超时（${a}ms）`)), a);
+    c = await Promise.race([
+      v,
+      new Promise((s, m) => {
+        d = setTimeout(() => m(new Error(`PPTX 导出超时（${g}ms）`)), g);
       })
     ]);
   } finally {
-    clearTimeout(g), await p.close();
+    clearTimeout(d), await a.close();
   }
-  await T(P(e), { recursive: !0 });
-  const h = `${e}.${C()}.tmp`;
+  await Pt(Tt(P), { recursive: !0 });
+  const _ = `${P}.${Kt()}.tmp`;
   try {
-    await D(h, o, { flag: "wx" }), await I(h, e);
+    await Lt(_, c, { flag: "wx" }), await Xt(_, P);
   } finally {
-    await B(h, { force: !0 });
+    await Yt(_, { force: !0 });
   }
-  return { file: e, pages: l.map((c) => ({ pageNumber: c, slideId: t.slides[c - 1].id })), bytes: o.length };
+  return { file: P, pages: l.map((v) => ({ pageNumber: v, slideId: E.slides[v - 1].id })), bytes: c.length };
 }
-const x = `Usage:
+const kt = `Usage:
   ppt-dsl-renderer render <deck.json> --out-dir <directory> [--pages 1,3]
   ppt-dsl-renderer export-pptx <deck.json> --out <file.pptx> [--pages 1,3]
+  ppt-dsl-renderer export-html-pptx <file.html|directory> --out <file.pptx> [--selector <css>] [--assets-root <directory>]
 
 PPTX options:
   --browser-executable <path>  Use an existing Chromium executable (default: installed Chrome).
-  --timeout <milliseconds>     Browser launch/export timeout (default: 120000).
+  --timeout <milliseconds>     DSL export browser launch/export timeout (default: 120000).
+
+HTML PPTX options:
+  --selector <css>             Select the slide root; otherwise detect common roots or use body.
+  --assets-root <directory>    Resolve missing local images; unresolved images become blank placeholders.
 
 Page numbers start at 1. Success writes a JSON file manifest to stdout.
 Errors and browser diagnostics go to stderr; failure exits with code 1.
 render generates HTML without launching a browser.
-export-pptx requires Chrome or Chromium installed at deployment time; it never downloads a browser.`;
-async function G() {
-  var g;
-  const { values: t, positionals: e } = j({
+export-pptx requires Chrome or Chromium installed at deployment time; it never downloads a browser.
+export-html-pptx has the same browser requirement; a directory reads direct .html children in natural order.`;
+async function ge() {
+  var d;
+  const { values: E, positionals: P } = ae({
     allowPositionals: !0,
     options: {
       "out-dir": { type: "string" },
       out: { type: "string" },
       pages: { type: "string" },
       "browser-executable": { type: "string" },
+      selector: { type: "string" },
+      "assets-root": { type: "string" },
       timeout: { type: "string" },
       help: { type: "boolean", short: "h" }
     }
   });
-  if (t.help) {
-    console.log(x);
+  if (E.help) {
+    console.log(kt);
     return;
   }
-  const [s, i] = e;
-  if (e.length !== 2 || !["render", "export-pptx"].includes(s))
-    throw new Error(x);
-  if (s === "render" && (!t["out-dir"] || t.out !== void 0 || t["browser-executable"] !== void 0 || t.timeout !== void 0))
-    throw new Error(x);
-  if (s === "export-pptx" && (!t.out || t["out-dir"] !== void 0))
-    throw new Error(x);
-  if (t.pages !== void 0 && !/^\d+(,\d+)*$/.test(t.pages))
+  const [n, S] = P;
+  if (P.length !== 2 || !["render", "export-pptx", "export-html-pptx"].includes(n))
+    throw new Error(kt);
+  if (n === "render" && (!E["out-dir"] || E.out !== void 0 || E["browser-executable"] !== void 0 || E.timeout !== void 0 || E.selector !== void 0 || E["assets-root"] !== void 0))
+    throw new Error(kt);
+  if (n === "export-pptx" && (!E.out || E["out-dir"] !== void 0 || E.selector !== void 0 || E["assets-root"] !== void 0))
+    throw new Error(kt);
+  if (n === "export-html-pptx" && (!E.out || E["out-dir"] !== void 0 || E.pages !== void 0 || E.timeout !== void 0))
+    throw new Error(kt);
+  if (E.pages !== void 0 && !/^\d+(,\d+)*$/.test(E.pages))
     throw new Error("--pages 格式必须为 1,3 这样的页码列表");
-  const a = (g = t.pages) == null ? void 0 : g.split(",").map(Number);
-  if (t.timeout !== void 0 && (!/^\d+$/.test(t.timeout) || !Number.isSafeInteger(Number(t.timeout)) || Number(t.timeout) <= 0))
+  const g = (d = E.pages) == null ? void 0 : d.split(",").map(Number);
+  if (E.timeout !== void 0 && (!/^\d+$/.test(E.timeout) || !Number.isSafeInteger(Number(E.timeout)) || Number(E.timeout) <= 0))
     throw new Error("--timeout 必须是正整数毫秒");
-  if (s === "export-pptx" && w(i) === w(t.out))
-    throw new Error("--out 不能覆盖输入 DSL 文件");
-  const l = JSON.parse(await $(w(i), "utf8"));
-  if (s === "export-pptx") {
-    const o = await W(l, w(t.out), {
-      pages: a,
-      executablePath: t["browser-executable"] ? w(t["browser-executable"]) : void 0,
-      timeout: t.timeout === void 0 ? void 0 : Number(t.timeout)
+  if (n !== "render" && ft(S) === ft(E.out))
+    throw new Error("--out 不能覆盖输入文件");
+  if (n === "export-html-pptx") {
+    const { exportHtmlToPptxFile: c } = await Promise.resolve().then(() => Oe), _ = await c(S, ft(E.out), {
+      selector: E.selector,
+      browserExecutable: E["browser-executable"] ? ft(E["browser-executable"]) : void 0,
+      assetsRoot: E["assets-root"] ? ft(E["assets-root"]) : void 0
+    });
+    console.log(JSON.stringify(_, null, 2));
+    return;
+  }
+  const l = JSON.parse(await xt(ft(S), "utf8"));
+  if (n === "export-pptx") {
+    const c = await me(l, ft(E.out), {
+      pages: g,
+      executablePath: E["browser-executable"] ? ft(E["browser-executable"]) : void 0,
+      timeout: E.timeout === void 0 ? void 0 : Number(E.timeout)
     });
-    console.log(JSON.stringify(o, null, 2));
+    console.log(JSON.stringify(c, null, 2));
     return;
   }
-  const d = await q(l, { pages: a }), r = w(t["out-dir"]);
-  await T(r, { recursive: !0 });
-  const p = [];
-  for (const { html: o, ...h } of d) {
-    const c = S(r, `slide-${String(h.pageNumber).padStart(3, "0")}.html`);
-    await D(c, o, "utf8"), p.push({ ...h, file: c });
+  const o = await fe(l, { pages: g }), e = ft(E["out-dir"]);
+  await Pt(e, { recursive: !0 });
+  const a = [];
+  for (const { html: c, ..._ } of o) {
+    const v = St(e, `slide-${String(_.pageNumber).padStart(3, "0")}.html`);
+    await Lt(v, c, "utf8"), a.push({ ..._, file: v });
   }
-  console.log(JSON.stringify({ pages: p }, null, 2));
+  console.log(JSON.stringify({ pages: a }, null, 2));
 }
-G().catch((t) => {
-  console.error(t.message), process.exitCode = 1;
+ge().catch((E) => {
+  console.error(E.message), process.exitCode = 1;
 });
+var At = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function _e(E) {
+  return E && E.__esModule && Object.prototype.hasOwnProperty.call(E, "default") ? E.default : E;
+}
+function zt(E) {
+  throw new Error('Could not dynamically require "' + E + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+}
+var te = { exports: {} };
+/*!
+
+JSZip v3.10.1 - A JavaScript class for generating and reading zip files
+<http://stuartk.com/jszip>
+
+(c) 2009-2016 Stuart Knightley <stuart [at] stuartk.com>
+Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/main/LICENSE.markdown.
+
+JSZip uses the library pako released under the MIT license :
+https://github.com/nodeca/pako/blob/main/LICENSE
+*/
+(function(E, P) {
+  (function(n) {
+    E.exports = n();
+  })(function() {
+    return function n(S, g, l) {
+      function o(d, c) {
+        if (!g[d]) {
+          if (!S[d]) {
+            var _ = typeof zt == "function" && zt;
+            if (!c && _)
+              return _(d, !0);
+            if (e)
+              return e(d, !0);
+            var v = new Error("Cannot find module '" + d + "'");
+            throw v.code = "MODULE_NOT_FOUND", v;
+          }
+          var s = g[d] = { exports: {} };
+          S[d][0].call(s.exports, function(m) {
+            var i = S[d][1][m];
+            return o(i || m);
+          }, s, s.exports, n, S, g, l);
+        }
+        return g[d].exports;
+      }
+      for (var e = typeof zt == "function" && zt, a = 0; a < l.length; a++)
+        o(l[a]);
+      return o;
+    }({ 1: [function(n, S, g) {
+      var l = n("./utils"), o = n("./support"), e = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
+      g.encode = function(a) {
+        for (var d, c, _, v, s, m, i, f = [], h = 0, u = a.length, w = u, k = l.getTypeOf(a) !== "string"; h < a.length; )
+          w = u - h, _ = k ? (d = a[h++], c = h < u ? a[h++] : 0, h < u ? a[h++] : 0) : (d = a.charCodeAt(h++), c = h < u ? a.charCodeAt(h++) : 0, h < u ? a.charCodeAt(h++) : 0), v = d >> 2, s = (3 & d) << 4 | c >> 4, m = 1 < w ? (15 & c) << 2 | _ >> 6 : 64, i = 2 < w ? 63 & _ : 64, f.push(e.charAt(v) + e.charAt(s) + e.charAt(m) + e.charAt(i));
+        return f.join("");
+      }, g.decode = function(a) {
+        var d, c, _, v, s, m, i = 0, f = 0, h = "data:";
+        if (a.substr(0, h.length) === h)
+          throw new Error("Invalid base64 input, it looks like a data url.");
+        var u, w = 3 * (a = a.replace(/[^A-Za-z0-9+/=]/g, "")).length / 4;
+        if (a.charAt(a.length - 1) === e.charAt(64) && w--, a.charAt(a.length - 2) === e.charAt(64) && w--, w % 1 != 0)
+          throw new Error("Invalid base64 input, bad content length.");
+        for (u = o.uint8array ? new Uint8Array(0 | w) : new Array(0 | w); i < a.length; )
+          d = e.indexOf(a.charAt(i++)) << 2 | (v = e.indexOf(a.charAt(i++))) >> 4, c = (15 & v) << 4 | (s = e.indexOf(a.charAt(i++))) >> 2, _ = (3 & s) << 6 | (m = e.indexOf(a.charAt(i++))), u[f++] = d, s !== 64 && (u[f++] = c), m !== 64 && (u[f++] = _);
+        return u;
+      };
+    }, { "./support": 30, "./utils": 32 }], 2: [function(n, S, g) {
+      var l = n("./external"), o = n("./stream/DataWorker"), e = n("./stream/Crc32Probe"), a = n("./stream/DataLengthProbe");
+      function d(c, _, v, s, m) {
+        this.compressedSize = c, this.uncompressedSize = _, this.crc32 = v, this.compression = s, this.compressedContent = m;
+      }
+      d.prototype = { getContentWorker: function() {
+        var c = new o(l.Promise.resolve(this.compressedContent)).pipe(this.compression.uncompressWorker()).pipe(new a("data_length")), _ = this;
+        return c.on("end", function() {
+          if (this.streamInfo.data_length !== _.uncompressedSize)
+            throw new Error("Bug : uncompressed data size mismatch");
+        }), c;
+      }, getCompressedWorker: function() {
+        return new o(l.Promise.resolve(this.compressedContent)).withStreamInfo("compressedSize", this.compressedSize).withStreamInfo("uncompressedSize", this.uncompressedSize).withStreamInfo("crc32", this.crc32).withStreamInfo("compression", this.compression);
+      } }, d.createWorkerFrom = function(c, _, v) {
+        return c.pipe(new e()).pipe(new a("uncompressedSize")).pipe(_.compressWorker(v)).pipe(new a("compressedSize")).withStreamInfo("compression", _);
+      }, S.exports = d;
+    }, { "./external": 6, "./stream/Crc32Probe": 25, "./stream/DataLengthProbe": 26, "./stream/DataWorker": 27 }], 3: [function(n, S, g) {
+      var l = n("./stream/GenericWorker");
+      g.STORE = { magic: "\0\0", compressWorker: function() {
+        return new l("STORE compression");
+      }, uncompressWorker: function() {
+        return new l("STORE decompression");
+      } }, g.DEFLATE = n("./flate");
+    }, { "./flate": 7, "./stream/GenericWorker": 28 }], 4: [function(n, S, g) {
+      var l = n("./utils"), o = function() {
+        for (var e, a = [], d = 0; d < 256; d++) {
+          e = d;
+          for (var c = 0; c < 8; c++)
+            e = 1 & e ? 3988292384 ^ e >>> 1 : e >>> 1;
+          a[d] = e;
+        }
+        return a;
+      }();
+      S.exports = function(e, a) {
+        return e !== void 0 && e.length ? l.getTypeOf(e) !== "string" ? function(d, c, _, v) {
+          var s = o, m = v + _;
+          d ^= -1;
+          for (var i = v; i < m; i++)
+            d = d >>> 8 ^ s[255 & (d ^ c[i])];
+          return -1 ^ d;
+        }(0 | a, e, e.length, 0) : function(d, c, _, v) {
+          var s = o, m = v + _;
+          d ^= -1;
+          for (var i = v; i < m; i++)
+            d = d >>> 8 ^ s[255 & (d ^ c.charCodeAt(i))];
+          return -1 ^ d;
+        }(0 | a, e, e.length, 0) : 0;
+      };
+    }, { "./utils": 32 }], 5: [function(n, S, g) {
+      g.base64 = !1, g.binary = !1, g.dir = !1, g.createFolders = !0, g.date = null, g.compression = null, g.compressionOptions = null, g.comment = null, g.unixPermissions = null, g.dosPermissions = null;
+    }, {}], 6: [function(n, S, g) {
+      var l = null;
+      l = typeof Promise < "u" ? Promise : n("lie"), S.exports = { Promise: l };
+    }, { lie: 37 }], 7: [function(n, S, g) {
+      var l = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Uint32Array < "u", o = n("pako"), e = n("./utils"), a = n("./stream/GenericWorker"), d = l ? "uint8array" : "array";
+      function c(_, v) {
+        a.call(this, "FlateWorker/" + _), this._pako = null, this._pakoAction = _, this._pakoOptions = v, this.meta = {};
+      }
+      g.magic = "\b\0", e.inherits(c, a), c.prototype.processChunk = function(_) {
+        this.meta = _.meta, this._pako === null && this._createPako(), this._pako.push(e.transformTo(d, _.data), !1);
+      }, c.prototype.flush = function() {
+        a.prototype.flush.call(this), this._pako === null && this._createPako(), this._pako.push([], !0);
+      }, c.prototype.cleanUp = function() {
+        a.prototype.cleanUp.call(this), this._pako = null;
+      }, c.prototype._createPako = function() {
+        this._pako = new o[this._pakoAction]({ raw: !0, level: this._pakoOptions.level || -1 });
+        var _ = this;
+        this._pako.onData = function(v) {
+          _.push({ data: v, meta: _.meta });
+        };
+      }, g.compressWorker = function(_) {
+        return new c("Deflate", _);
+      }, g.uncompressWorker = function() {
+        return new c("Inflate", {});
+      };
+    }, { "./stream/GenericWorker": 28, "./utils": 32, pako: 38 }], 8: [function(n, S, g) {
+      function l(s, m) {
+        var i, f = "";
+        for (i = 0; i < m; i++)
+          f += String.fromCharCode(255 & s), s >>>= 8;
+        return f;
+      }
+      function o(s, m, i, f, h, u) {
+        var w, k, x = s.file, O = s.compression, T = u !== d.utf8encode, M = e.transformTo("string", u(x.name)), z = e.transformTo("string", d.utf8encode(x.name)), W = x.comment, j = e.transformTo("string", u(W)), b = e.transformTo("string", d.utf8encode(W)), F = z.length !== x.name.length, r = b.length !== W.length, N = "", Q = "", $ = "", Y = x.dir, L = x.date, K = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+        m && !i || (K.crc32 = s.crc32, K.compressedSize = s.compressedSize, K.uncompressedSize = s.uncompressedSize);
+        var I = 0;
+        m && (I |= 8), T || !F && !r || (I |= 2048);
+        var B = 0, tt = 0;
+        Y && (B |= 16), h === "UNIX" ? (tt = 798, B |= function(X, st) {
+          var ct = X;
+          return X || (ct = st ? 16893 : 33204), (65535 & ct) << 16;
+        }(x.unixPermissions, Y)) : (tt = 20, B |= function(X) {
+          return 63 & (X || 0);
+        }(x.dosPermissions)), w = L.getUTCHours(), w <<= 6, w |= L.getUTCMinutes(), w <<= 5, w |= L.getUTCSeconds() / 2, k = L.getUTCFullYear() - 1980, k <<= 4, k |= L.getUTCMonth() + 1, k <<= 5, k |= L.getUTCDate(), F && (Q = l(1, 1) + l(c(M), 4) + z, N += "up" + l(Q.length, 2) + Q), r && ($ = l(1, 1) + l(c(j), 4) + b, N += "uc" + l($.length, 2) + $);
+        var q = "";
+        return q += `
+\0`, q += l(I, 2), q += O.magic, q += l(w, 2), q += l(k, 2), q += l(K.crc32, 4), q += l(K.compressedSize, 4), q += l(K.uncompressedSize, 4), q += l(M.length, 2), q += l(N.length, 2), { fileRecord: _.LOCAL_FILE_HEADER + q + M + N, dirRecord: _.CENTRAL_FILE_HEADER + l(tt, 2) + q + l(j.length, 2) + "\0\0\0\0" + l(B, 4) + l(f, 4) + M + N + j };
+      }
+      var e = n("../utils"), a = n("../stream/GenericWorker"), d = n("../utf8"), c = n("../crc32"), _ = n("../signature");
+      function v(s, m, i, f) {
+        a.call(this, "ZipFileWorker"), this.bytesWritten = 0, this.zipComment = m, this.zipPlatform = i, this.encodeFileName = f, this.streamFiles = s, this.accumulate = !1, this.contentBuffer = [], this.dirRecords = [], this.currentSourceOffset = 0, this.entriesCount = 0, this.currentFile = null, this._sources = [];
+      }
+      e.inherits(v, a), v.prototype.push = function(s) {
+        var m = s.meta.percent || 0, i = this.entriesCount, f = this._sources.length;
+        this.accumulate ? this.contentBuffer.push(s) : (this.bytesWritten += s.data.length, a.prototype.push.call(this, { data: s.data, meta: { currentFile: this.currentFile, percent: i ? (m + 100 * (i - f - 1)) / i : 100 } }));
+      }, v.prototype.openedSource = function(s) {
+        this.currentSourceOffset = this.bytesWritten, this.currentFile = s.file.name;
+        var m = this.streamFiles && !s.file.dir;
+        if (m) {
+          var i = o(s, m, !1, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
+          this.push({ data: i.fileRecord, meta: { percent: 0 } });
+        } else
+          this.accumulate = !0;
+      }, v.prototype.closedSource = function(s) {
+        this.accumulate = !1;
+        var m = this.streamFiles && !s.file.dir, i = o(s, m, !0, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
+        if (this.dirRecords.push(i.dirRecord), m)
+          this.push({ data: function(f) {
+            return _.DATA_DESCRIPTOR + l(f.crc32, 4) + l(f.compressedSize, 4) + l(f.uncompressedSize, 4);
+          }(s), meta: { percent: 100 } });
+        else
+          for (this.push({ data: i.fileRecord, meta: { percent: 0 } }); this.contentBuffer.length; )
+            this.push(this.contentBuffer.shift());
+        this.currentFile = null;
+      }, v.prototype.flush = function() {
+        for (var s = this.bytesWritten, m = 0; m < this.dirRecords.length; m++)
+          this.push({ data: this.dirRecords[m], meta: { percent: 100 } });
+        var i = this.bytesWritten - s, f = function(h, u, w, k, x) {
+          var O = e.transformTo("string", x(k));
+          return _.CENTRAL_DIRECTORY_END + "\0\0\0\0" + l(h, 2) + l(h, 2) + l(u, 4) + l(w, 4) + l(O.length, 2) + O;
+        }(this.dirRecords.length, i, s, this.zipComment, this.encodeFileName);
+        this.push({ data: f, meta: { percent: 100 } });
+      }, v.prototype.prepareNextSource = function() {
+        this.previous = this._sources.shift(), this.openedSource(this.previous.streamInfo), this.isPaused ? this.previous.pause() : this.previous.resume();
+      }, v.prototype.registerPrevious = function(s) {
+        this._sources.push(s);
+        var m = this;
+        return s.on("data", function(i) {
+          m.processChunk(i);
+        }), s.on("end", function() {
+          m.closedSource(m.previous.streamInfo), m._sources.length ? m.prepareNextSource() : m.end();
+        }), s.on("error", function(i) {
+          m.error(i);
+        }), this;
+      }, v.prototype.resume = function() {
+        return !!a.prototype.resume.call(this) && (!this.previous && this._sources.length ? (this.prepareNextSource(), !0) : this.previous || this._sources.length || this.generatedError ? void 0 : (this.end(), !0));
+      }, v.prototype.error = function(s) {
+        var m = this._sources;
+        if (!a.prototype.error.call(this, s))
+          return !1;
+        for (var i = 0; i < m.length; i++)
+          try {
+            m[i].error(s);
+          } catch {
+          }
+        return !0;
+      }, v.prototype.lock = function() {
+        a.prototype.lock.call(this);
+        for (var s = this._sources, m = 0; m < s.length; m++)
+          s[m].lock();
+      }, S.exports = v;
+    }, { "../crc32": 4, "../signature": 23, "../stream/GenericWorker": 28, "../utf8": 31, "../utils": 32 }], 9: [function(n, S, g) {
+      var l = n("../compressions"), o = n("./ZipFileWorker");
+      g.generateWorker = function(e, a, d) {
+        var c = new o(a.streamFiles, d, a.platform, a.encodeFileName), _ = 0;
+        try {
+          e.forEach(function(v, s) {
+            _++;
+            var m = function(u, w) {
+              var k = u || w, x = l[k];
+              if (!x)
+                throw new Error(k + " is not a valid compression method !");
+              return x;
+            }(s.options.compression, a.compression), i = s.options.compressionOptions || a.compressionOptions || {}, f = s.dir, h = s.date;
+            s._compressWorker(m, i).withStreamInfo("file", { name: v, dir: f, date: h, comment: s.comment || "", unixPermissions: s.unixPermissions, dosPermissions: s.dosPermissions }).pipe(c);
+          }), c.entriesCount = _;
+        } catch (v) {
+          c.error(v);
+        }
+        return c;
+      };
+    }, { "../compressions": 3, "./ZipFileWorker": 8 }], 10: [function(n, S, g) {
+      function l() {
+        if (!(this instanceof l))
+          return new l();
+        if (arguments.length)
+          throw new Error("The constructor with parameters has been removed in JSZip 3.0, please check the upgrade guide.");
+        this.files = /* @__PURE__ */ Object.create(null), this.comment = null, this.root = "", this.clone = function() {
+          var o = new l();
+          for (var e in this)
+            typeof this[e] != "function" && (o[e] = this[e]);
+          return o;
+        };
+      }
+      (l.prototype = n("./object")).loadAsync = n("./load"), l.support = n("./support"), l.defaults = n("./defaults"), l.version = "3.10.1", l.loadAsync = function(o, e) {
+        return new l().loadAsync(o, e);
+      }, l.external = n("./external"), S.exports = l;
+    }, { "./defaults": 5, "./external": 6, "./load": 11, "./object": 15, "./support": 30 }], 11: [function(n, S, g) {
+      var l = n("./utils"), o = n("./external"), e = n("./utf8"), a = n("./zipEntries"), d = n("./stream/Crc32Probe"), c = n("./nodejsUtils");
+      function _(v) {
+        return new o.Promise(function(s, m) {
+          var i = v.decompressed.getContentWorker().pipe(new d());
+          i.on("error", function(f) {
+            m(f);
+          }).on("end", function() {
+            i.streamInfo.crc32 !== v.decompressed.crc32 ? m(new Error("Corrupted zip : CRC32 mismatch")) : s();
+          }).resume();
+        });
+      }
+      S.exports = function(v, s) {
+        var m = this;
+        return s = l.extend(s || {}, { base64: !1, checkCRC32: !1, optimizedBinaryString: !1, createFolders: !1, decodeFileName: e.utf8decode }), c.isNode && c.isStream(v) ? o.Promise.reject(new Error("JSZip can't accept a stream when loading a zip file.")) : l.prepareContent("the loaded zip file", v, !0, s.optimizedBinaryString, s.base64).then(function(i) {
+          var f = new a(s);
+          return f.load(i), f;
+        }).then(function(i) {
+          var f = [o.Promise.resolve(i)], h = i.files;
+          if (s.checkCRC32)
+            for (var u = 0; u < h.length; u++)
+              f.push(_(h[u]));
+          return o.Promise.all(f);
+        }).then(function(i) {
+          for (var f = i.shift(), h = f.files, u = 0; u < h.length; u++) {
+            var w = h[u], k = w.fileNameStr, x = l.resolve(w.fileNameStr);
+            m.file(x, w.decompressed, { binary: !0, optimizedBinaryString: !0, date: w.date, dir: w.dir, comment: w.fileCommentStr.length ? w.fileCommentStr : null, unixPermissions: w.unixPermissions, dosPermissions: w.dosPermissions, createFolders: s.createFolders }), w.dir || (m.file(x).unsafeOriginalName = k);
+          }
+          return f.zipComment.length && (m.comment = f.zipComment), m;
+        });
+      };
+    }, { "./external": 6, "./nodejsUtils": 14, "./stream/Crc32Probe": 25, "./utf8": 31, "./utils": 32, "./zipEntries": 33 }], 12: [function(n, S, g) {
+      var l = n("../utils"), o = n("../stream/GenericWorker");
+      function e(a, d) {
+        o.call(this, "Nodejs stream input adapter for " + a), this._upstreamEnded = !1, this._bindStream(d);
+      }
+      l.inherits(e, o), e.prototype._bindStream = function(a) {
+        var d = this;
+        (this._stream = a).pause(), a.on("data", function(c) {
+          d.push({ data: c, meta: { percent: 0 } });
+        }).on("error", function(c) {
+          d.isPaused ? this.generatedError = c : d.error(c);
+        }).on("end", function() {
+          d.isPaused ? d._upstreamEnded = !0 : d.end();
+        });
+      }, e.prototype.pause = function() {
+        return !!o.prototype.pause.call(this) && (this._stream.pause(), !0);
+      }, e.prototype.resume = function() {
+        return !!o.prototype.resume.call(this) && (this._upstreamEnded ? this.end() : this._stream.resume(), !0);
+      }, S.exports = e;
+    }, { "../stream/GenericWorker": 28, "../utils": 32 }], 13: [function(n, S, g) {
+      var l = n("readable-stream").Readable;
+      function o(e, a, d) {
+        l.call(this, a), this._helper = e;
+        var c = this;
+        e.on("data", function(_, v) {
+          c.push(_) || c._helper.pause(), d && d(v);
+        }).on("error", function(_) {
+          c.emit("error", _);
+        }).on("end", function() {
+          c.push(null);
+        });
+      }
+      n("../utils").inherits(o, l), o.prototype._read = function() {
+        this._helper.resume();
+      }, S.exports = o;
+    }, { "../utils": 32, "readable-stream": 16 }], 14: [function(n, S, g) {
+      S.exports = { isNode: typeof Buffer < "u", newBufferFrom: function(l, o) {
+        if (Buffer.from && Buffer.from !== Uint8Array.from)
+          return Buffer.from(l, o);
+        if (typeof l == "number")
+          throw new Error('The "data" argument must not be a number');
+        return new Buffer(l, o);
+      }, allocBuffer: function(l) {
+        if (Buffer.alloc)
+          return Buffer.alloc(l);
+        var o = new Buffer(l);
+        return o.fill(0), o;
+      }, isBuffer: function(l) {
+        return Buffer.isBuffer(l);
+      }, isStream: function(l) {
+        return l && typeof l.on == "function" && typeof l.pause == "function" && typeof l.resume == "function";
+      } };
+    }, {}], 15: [function(n, S, g) {
+      function l(x, O, T) {
+        var M, z = e.getTypeOf(O), W = e.extend(T || {}, c);
+        W.date = W.date || /* @__PURE__ */ new Date(), W.compression !== null && (W.compression = W.compression.toUpperCase()), typeof W.unixPermissions == "string" && (W.unixPermissions = parseInt(W.unixPermissions, 8)), W.unixPermissions && 16384 & W.unixPermissions && (W.dir = !0), W.dosPermissions && 16 & W.dosPermissions && (W.dir = !0), W.dir && (x = h(x)), W.createFolders && (M = f(x)) && u.call(this, M, !0);
+        var j = z === "string" && W.binary === !1 && W.base64 === !1;
+        T && T.binary !== void 0 || (W.binary = !j), (O instanceof _ && O.uncompressedSize === 0 || W.dir || !O || O.length === 0) && (W.base64 = !1, W.binary = !0, O = "", W.compression = "STORE", z = "string");
+        var b = null;
+        b = O instanceof _ || O instanceof a ? O : m.isNode && m.isStream(O) ? new i(x, O) : e.prepareContent(x, O, W.binary, W.optimizedBinaryString, W.base64);
+        var F = new v(x, b, W);
+        this.files[x] = F;
+      }
+      var o = n("./utf8"), e = n("./utils"), a = n("./stream/GenericWorker"), d = n("./stream/StreamHelper"), c = n("./defaults"), _ = n("./compressedObject"), v = n("./zipObject"), s = n("./generate"), m = n("./nodejsUtils"), i = n("./nodejs/NodejsStreamInputAdapter"), f = function(x) {
+        x.slice(-1) === "/" && (x = x.substring(0, x.length - 1));
+        var O = x.lastIndexOf("/");
+        return 0 < O ? x.substring(0, O) : "";
+      }, h = function(x) {
+        return x.slice(-1) !== "/" && (x += "/"), x;
+      }, u = function(x, O) {
+        return O = O !== void 0 ? O : c.createFolders, x = h(x), this.files[x] || l.call(this, x, null, { dir: !0, createFolders: O }), this.files[x];
+      };
+      function w(x) {
+        return Object.prototype.toString.call(x) === "[object RegExp]";
+      }
+      var k = { load: function() {
+        throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
+      }, forEach: function(x) {
+        var O, T, M;
+        for (O in this.files)
+          M = this.files[O], (T = O.slice(this.root.length, O.length)) && O.slice(0, this.root.length) === this.root && x(T, M);
+      }, filter: function(x) {
+        var O = [];
+        return this.forEach(function(T, M) {
+          x(T, M) && O.push(M);
+        }), O;
+      }, file: function(x, O, T) {
+        if (arguments.length !== 1)
+          return x = this.root + x, l.call(this, x, O, T), this;
+        if (w(x)) {
+          var M = x;
+          return this.filter(function(W, j) {
+            return !j.dir && M.test(W);
+          });
+        }
+        var z = this.files[this.root + x];
+        return z && !z.dir ? z : null;
+      }, folder: function(x) {
+        if (!x)
+          return this;
+        if (w(x))
+          return this.filter(function(z, W) {
+            return W.dir && x.test(z);
+          });
+        var O = this.root + x, T = u.call(this, O), M = this.clone();
+        return M.root = T.name, M;
+      }, remove: function(x) {
+        x = this.root + x;
+        var O = this.files[x];
+        if (O || (x.slice(-1) !== "/" && (x += "/"), O = this.files[x]), O && !O.dir)
+          delete this.files[x];
+        else
+          for (var T = this.filter(function(z, W) {
+            return W.name.slice(0, x.length) === x;
+          }), M = 0; M < T.length; M++)
+            delete this.files[T[M].name];
+        return this;
+      }, generate: function() {
+        throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
+      }, generateInternalStream: function(x) {
+        var O, T = {};
+        try {
+          if ((T = e.extend(x || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: o.utf8encode })).type = T.type.toLowerCase(), T.compression = T.compression.toUpperCase(), T.type === "binarystring" && (T.type = "string"), !T.type)
+            throw new Error("No output type specified.");
+          e.checkSupport(T.type), T.platform !== "darwin" && T.platform !== "freebsd" && T.platform !== "linux" && T.platform !== "sunos" || (T.platform = "UNIX"), T.platform === "win32" && (T.platform = "DOS");
+          var M = T.comment || this.comment || "";
+          O = s.generateWorker(this, T, M);
+        } catch (z) {
+          (O = new a("error")).error(z);
+        }
+        return new d(O, T.type || "string", T.mimeType);
+      }, generateAsync: function(x, O) {
+        return this.generateInternalStream(x).accumulate(O);
+      }, generateNodeStream: function(x, O) {
+        return (x = x || {}).type || (x.type = "nodebuffer"), this.generateInternalStream(x).toNodejsStream(O);
+      } };
+      S.exports = k;
+    }, { "./compressedObject": 2, "./defaults": 5, "./generate": 9, "./nodejs/NodejsStreamInputAdapter": 12, "./nodejsUtils": 14, "./stream/GenericWorker": 28, "./stream/StreamHelper": 29, "./utf8": 31, "./utils": 32, "./zipObject": 35 }], 16: [function(n, S, g) {
+      S.exports = n("stream");
+    }, { stream: void 0 }], 17: [function(n, S, g) {
+      var l = n("./DataReader");
+      function o(e) {
+        l.call(this, e);
+        for (var a = 0; a < this.data.length; a++)
+          e[a] = 255 & e[a];
+      }
+      n("../utils").inherits(o, l), o.prototype.byteAt = function(e) {
+        return this.data[this.zero + e];
+      }, o.prototype.lastIndexOfSignature = function(e) {
+        for (var a = e.charCodeAt(0), d = e.charCodeAt(1), c = e.charCodeAt(2), _ = e.charCodeAt(3), v = this.length - 4; 0 <= v; --v)
+          if (this.data[v] === a && this.data[v + 1] === d && this.data[v + 2] === c && this.data[v + 3] === _)
+            return v - this.zero;
+        return -1;
+      }, o.prototype.readAndCheckSignature = function(e) {
+        var a = e.charCodeAt(0), d = e.charCodeAt(1), c = e.charCodeAt(2), _ = e.charCodeAt(3), v = this.readData(4);
+        return a === v[0] && d === v[1] && c === v[2] && _ === v[3];
+      }, o.prototype.readData = function(e) {
+        if (this.checkOffset(e), e === 0)
+          return [];
+        var a = this.data.slice(this.zero + this.index, this.zero + this.index + e);
+        return this.index += e, a;
+      }, S.exports = o;
+    }, { "../utils": 32, "./DataReader": 18 }], 18: [function(n, S, g) {
+      var l = n("../utils");
+      function o(e) {
+        this.data = e, this.length = e.length, this.index = 0, this.zero = 0;
+      }
+      o.prototype = { checkOffset: function(e) {
+        this.checkIndex(this.index + e);
+      }, checkIndex: function(e) {
+        if (this.length < this.zero + e || e < 0)
+          throw new Error("End of data reached (data length = " + this.length + ", asked index = " + e + "). Corrupted zip ?");
+      }, setIndex: function(e) {
+        this.checkIndex(e), this.index = e;
+      }, skip: function(e) {
+        this.setIndex(this.index + e);
+      }, byteAt: function() {
+      }, readInt: function(e) {
+        var a, d = 0;
+        for (this.checkOffset(e), a = this.index + e - 1; a >= this.index; a--)
+          d = (d << 8) + this.byteAt(a);
+        return this.index += e, d;
+      }, readString: function(e) {
+        return l.transformTo("string", this.readData(e));
+      }, readData: function() {
+      }, lastIndexOfSignature: function() {
+      }, readAndCheckSignature: function() {
+      }, readDate: function() {
+        var e = this.readInt(4);
+        return new Date(Date.UTC(1980 + (e >> 25 & 127), (e >> 21 & 15) - 1, e >> 16 & 31, e >> 11 & 31, e >> 5 & 63, (31 & e) << 1));
+      } }, S.exports = o;
+    }, { "../utils": 32 }], 19: [function(n, S, g) {
+      var l = n("./Uint8ArrayReader");
+      function o(e) {
+        l.call(this, e);
+      }
+      n("../utils").inherits(o, l), o.prototype.readData = function(e) {
+        this.checkOffset(e);
+        var a = this.data.slice(this.zero + this.index, this.zero + this.index + e);
+        return this.index += e, a;
+      }, S.exports = o;
+    }, { "../utils": 32, "./Uint8ArrayReader": 21 }], 20: [function(n, S, g) {
+      var l = n("./DataReader");
+      function o(e) {
+        l.call(this, e);
+      }
+      n("../utils").inherits(o, l), o.prototype.byteAt = function(e) {
+        return this.data.charCodeAt(this.zero + e);
+      }, o.prototype.lastIndexOfSignature = function(e) {
+        return this.data.lastIndexOf(e) - this.zero;
+      }, o.prototype.readAndCheckSignature = function(e) {
+        return e === this.readData(4);
+      }, o.prototype.readData = function(e) {
+        this.checkOffset(e);
+        var a = this.data.slice(this.zero + this.index, this.zero + this.index + e);
+        return this.index += e, a;
+      }, S.exports = o;
+    }, { "../utils": 32, "./DataReader": 18 }], 21: [function(n, S, g) {
+      var l = n("./ArrayReader");
+      function o(e) {
+        l.call(this, e);
+      }
+      n("../utils").inherits(o, l), o.prototype.readData = function(e) {
+        if (this.checkOffset(e), e === 0)
+          return new Uint8Array(0);
+        var a = this.data.subarray(this.zero + this.index, this.zero + this.index + e);
+        return this.index += e, a;
+      }, S.exports = o;
+    }, { "../utils": 32, "./ArrayReader": 17 }], 22: [function(n, S, g) {
+      var l = n("../utils"), o = n("../support"), e = n("./ArrayReader"), a = n("./StringReader"), d = n("./NodeBufferReader"), c = n("./Uint8ArrayReader");
+      S.exports = function(_) {
+        var v = l.getTypeOf(_);
+        return l.checkSupport(v), v !== "string" || o.uint8array ? v === "nodebuffer" ? new d(_) : o.uint8array ? new c(l.transformTo("uint8array", _)) : new e(l.transformTo("array", _)) : new a(_);
+      };
+    }, { "../support": 30, "../utils": 32, "./ArrayReader": 17, "./NodeBufferReader": 19, "./StringReader": 20, "./Uint8ArrayReader": 21 }], 23: [function(n, S, g) {
+      g.LOCAL_FILE_HEADER = "PK", g.CENTRAL_FILE_HEADER = "PK
", g.CENTRAL_DIRECTORY_END = "PK", g.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x07", g.ZIP64_CENTRAL_DIRECTORY_END = "PK", g.DATA_DESCRIPTOR = "PK\x07\b";
+    }, {}], 24: [function(n, S, g) {
+      var l = n("./GenericWorker"), o = n("../utils");
+      function e(a) {
+        l.call(this, "ConvertWorker to " + a), this.destType = a;
+      }
+      o.inherits(e, l), e.prototype.processChunk = function(a) {
+        this.push({ data: o.transformTo(this.destType, a.data), meta: a.meta });
+      }, S.exports = e;
+    }, { "../utils": 32, "./GenericWorker": 28 }], 25: [function(n, S, g) {
+      var l = n("./GenericWorker"), o = n("../crc32");
+      function e() {
+        l.call(this, "Crc32Probe"), this.withStreamInfo("crc32", 0);
+      }
+      n("../utils").inherits(e, l), e.prototype.processChunk = function(a) {
+        this.streamInfo.crc32 = o(a.data, this.streamInfo.crc32 || 0), this.push(a);
+      }, S.exports = e;
+    }, { "../crc32": 4, "../utils": 32, "./GenericWorker": 28 }], 26: [function(n, S, g) {
+      var l = n("../utils"), o = n("./GenericWorker");
+      function e(a) {
+        o.call(this, "DataLengthProbe for " + a), this.propName = a, this.withStreamInfo(a, 0);
+      }
+      l.inherits(e, o), e.prototype.processChunk = function(a) {
+        if (a) {
+          var d = this.streamInfo[this.propName] || 0;
+          this.streamInfo[this.propName] = d + a.data.length;
+        }
+        o.prototype.processChunk.call(this, a);
+      }, S.exports = e;
+    }, { "../utils": 32, "./GenericWorker": 28 }], 27: [function(n, S, g) {
+      var l = n("../utils"), o = n("./GenericWorker");
+      function e(a) {
+        o.call(this, "DataWorker");
+        var d = this;
+        this.dataIsReady = !1, this.index = 0, this.max = 0, this.data = null, this.type = "", this._tickScheduled = !1, a.then(function(c) {
+          d.dataIsReady = !0, d.data = c, d.max = c && c.length || 0, d.type = l.getTypeOf(c), d.isPaused || d._tickAndRepeat();
+        }, function(c) {
+          d.error(c);
+        });
+      }
+      l.inherits(e, o), e.prototype.cleanUp = function() {
+        o.prototype.cleanUp.call(this), this.data = null;
+      }, e.prototype.resume = function() {
+        return !!o.prototype.resume.call(this) && (!this._tickScheduled && this.dataIsReady && (this._tickScheduled = !0, l.delay(this._tickAndRepeat, [], this)), !0);
+      }, e.prototype._tickAndRepeat = function() {
+        this._tickScheduled = !1, this.isPaused || this.isFinished || (this._tick(), this.isFinished || (l.delay(this._tickAndRepeat, [], this), this._tickScheduled = !0));
+      }, e.prototype._tick = function() {
+        if (this.isPaused || this.isFinished)
+          return !1;
+        var a = null, d = Math.min(this.max, this.index + 16384);
+        if (this.index >= this.max)
+          return this.end();
+        switch (this.type) {
+          case "string":
+            a = this.data.substring(this.index, d);
+            break;
+          case "uint8array":
+            a = this.data.subarray(this.index, d);
+            break;
+          case "array":
+          case "nodebuffer":
+            a = this.data.slice(this.index, d);
+        }
+        return this.index = d, this.push({ data: a, meta: { percent: this.max ? this.index / this.max * 100 : 0 } });
+      }, S.exports = e;
+    }, { "../utils": 32, "./GenericWorker": 28 }], 28: [function(n, S, g) {
+      function l(o) {
+        this.name = o || "default", this.streamInfo = {}, this.generatedError = null, this.extraStreamInfo = {}, this.isPaused = !0, this.isFinished = !1, this.isLocked = !1, this._listeners = { data: [], end: [], error: [] }, this.previous = null;
+      }
+      l.prototype = { push: function(o) {
+        this.emit("data", o);
+      }, end: function() {
+        if (this.isFinished)
+          return !1;
+        this.flush();
+        try {
+          this.emit("end"), this.cleanUp(), this.isFinished = !0;
+        } catch (o) {
+          this.emit("error", o);
+        }
+        return !0;
+      }, error: function(o) {
+        return !this.isFinished && (this.isPaused ? this.generatedError = o : (this.isFinished = !0, this.emit("error", o), this.previous && this.previous.error(o), this.cleanUp()), !0);
+      }, on: function(o, e) {
+        return this._listeners[o].push(e), this;
+      }, cleanUp: function() {
+        this.streamInfo = this.generatedError = this.extraStreamInfo = null, this._listeners = [];
+      }, emit: function(o, e) {
+        if (this._listeners[o])
+          for (var a = 0; a < this._listeners[o].length; a++)
+            this._listeners[o][a].call(this, e);
+      }, pipe: function(o) {
+        return o.registerPrevious(this);
+      }, registerPrevious: function(o) {
+        if (this.isLocked)
+          throw new Error("The stream '" + this + "' has already been used.");
+        this.streamInfo = o.streamInfo, this.mergeStreamInfo(), this.previous = o;
+        var e = this;
+        return o.on("data", function(a) {
+          e.processChunk(a);
+        }), o.on("end", function() {
+          e.end();
+        }), o.on("error", function(a) {
+          e.error(a);
+        }), this;
+      }, pause: function() {
+        return !this.isPaused && !this.isFinished && (this.isPaused = !0, this.previous && this.previous.pause(), !0);
+      }, resume: function() {
+        if (!this.isPaused || this.isFinished)
+          return !1;
+        var o = this.isPaused = !1;
+        return this.generatedError && (this.error(this.generatedError), o = !0), this.previous && this.previous.resume(), !o;
+      }, flush: function() {
+      }, processChunk: function(o) {
+        this.push(o);
+      }, withStreamInfo: function(o, e) {
+        return this.extraStreamInfo[o] = e, this.mergeStreamInfo(), this;
+      }, mergeStreamInfo: function() {
+        for (var o in this.extraStreamInfo)
+          Object.prototype.hasOwnProperty.call(this.extraStreamInfo, o) && (this.streamInfo[o] = this.extraStreamInfo[o]);
+      }, lock: function() {
+        if (this.isLocked)
+          throw new Error("The stream '" + this + "' has already been used.");
+        this.isLocked = !0, this.previous && this.previous.lock();
+      }, toString: function() {
+        var o = "Worker " + this.name;
+        return this.previous ? this.previous + " -> " + o : o;
+      } }, S.exports = l;
+    }, {}], 29: [function(n, S, g) {
+      var l = n("../utils"), o = n("./ConvertWorker"), e = n("./GenericWorker"), a = n("../base64"), d = n("../support"), c = n("../external"), _ = null;
+      if (d.nodestream)
+        try {
+          _ = n("../nodejs/NodejsStreamOutputAdapter");
+        } catch {
+        }
+      function v(m, i) {
+        return new c.Promise(function(f, h) {
+          var u = [], w = m._internalType, k = m._outputType, x = m._mimeType;
+          m.on("data", function(O, T) {
+            u.push(O), i && i(T);
+          }).on("error", function(O) {
+            u = [], h(O);
+          }).on("end", function() {
+            try {
+              var O = function(T, M, z) {
+                switch (T) {
+                  case "blob":
+                    return l.newBlob(l.transformTo("arraybuffer", M), z);
+                  case "base64":
+                    return a.encode(M);
+                  default:
+                    return l.transformTo(T, M);
+                }
+              }(k, function(T, M) {
+                var z, W = 0, j = null, b = 0;
+                for (z = 0; z < M.length; z++)
+                  b += M[z].length;
+                switch (T) {
+                  case "string":
+                    return M.join("");
+                  case "array":
+                    return Array.prototype.concat.apply([], M);
+                  case "uint8array":
+                    for (j = new Uint8Array(b), z = 0; z < M.length; z++)
+                      j.set(M[z], W), W += M[z].length;
+                    return j;
+                  case "nodebuffer":
+                    return Buffer.concat(M);
+                  default:
+                    throw new Error("concat : unsupported type '" + T + "'");
+                }
+              }(w, u), x);
+              f(O);
+            } catch (T) {
+              h(T);
+            }
+            u = [];
+          }).resume();
+        });
+      }
+      function s(m, i, f) {
+        var h = i;
+        switch (i) {
+          case "blob":
+          case "arraybuffer":
+            h = "uint8array";
+            break;
+          case "base64":
+            h = "string";
+        }
+        try {
+          this._internalType = h, this._outputType = i, this._mimeType = f, l.checkSupport(h), this._worker = m.pipe(new o(h)), m.lock();
+        } catch (u) {
+          this._worker = new e("error"), this._worker.error(u);
+        }
+      }
+      s.prototype = { accumulate: function(m) {
+        return v(this, m);
+      }, on: function(m, i) {
+        var f = this;
+        return m === "data" ? this._worker.on(m, function(h) {
+          i.call(f, h.data, h.meta);
+        }) : this._worker.on(m, function() {
+          l.delay(i, arguments, f);
+        }), this;
+      }, resume: function() {
+        return l.delay(this._worker.resume, [], this._worker), this;
+      }, pause: function() {
+        return this._worker.pause(), this;
+      }, toNodejsStream: function(m) {
+        if (l.checkSupport("nodestream"), this._outputType !== "nodebuffer")
+          throw new Error(this._outputType + " is not supported by this method");
+        return new _(this, { objectMode: this._outputType !== "nodebuffer" }, m);
+      } }, S.exports = s;
+    }, { "../base64": 1, "../external": 6, "../nodejs/NodejsStreamOutputAdapter": 13, "../support": 30, "../utils": 32, "./ConvertWorker": 24, "./GenericWorker": 28 }], 30: [function(n, S, g) {
+      if (g.base64 = !0, g.array = !0, g.string = !0, g.arraybuffer = typeof ArrayBuffer < "u" && typeof Uint8Array < "u", g.nodebuffer = typeof Buffer < "u", g.uint8array = typeof Uint8Array < "u", typeof ArrayBuffer > "u")
+        g.blob = !1;
+      else {
+        var l = new ArrayBuffer(0);
+        try {
+          g.blob = new Blob([l], { type: "application/zip" }).size === 0;
+        } catch {
+          try {
+            var o = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
+            o.append(l), g.blob = o.getBlob("application/zip").size === 0;
+          } catch {
+            g.blob = !1;
+          }
+        }
+      }
+      try {
+        g.nodestream = !!n("readable-stream").Readable;
+      } catch {
+        g.nodestream = !1;
+      }
+    }, { "readable-stream": 16 }], 31: [function(n, S, g) {
+      for (var l = n("./utils"), o = n("./support"), e = n("./nodejsUtils"), a = n("./stream/GenericWorker"), d = new Array(256), c = 0; c < 256; c++)
+        d[c] = 252 <= c ? 6 : 248 <= c ? 5 : 240 <= c ? 4 : 224 <= c ? 3 : 192 <= c ? 2 : 1;
+      d[254] = d[254] = 1;
+      function _() {
+        a.call(this, "utf-8 decode"), this.leftOver = null;
+      }
+      function v() {
+        a.call(this, "utf-8 encode");
+      }
+      g.utf8encode = function(s) {
+        return o.nodebuffer ? e.newBufferFrom(s, "utf-8") : function(m) {
+          var i, f, h, u, w, k = m.length, x = 0;
+          for (u = 0; u < k; u++)
+            (64512 & (f = m.charCodeAt(u))) == 55296 && u + 1 < k && (64512 & (h = m.charCodeAt(u + 1))) == 56320 && (f = 65536 + (f - 55296 << 10) + (h - 56320), u++), x += f < 128 ? 1 : f < 2048 ? 2 : f < 65536 ? 3 : 4;
+          for (i = o.uint8array ? new Uint8Array(x) : new Array(x), u = w = 0; w < x; u++)
+            (64512 & (f = m.charCodeAt(u))) == 55296 && u + 1 < k && (64512 & (h = m.charCodeAt(u + 1))) == 56320 && (f = 65536 + (f - 55296 << 10) + (h - 56320), u++), f < 128 ? i[w++] = f : (f < 2048 ? i[w++] = 192 | f >>> 6 : (f < 65536 ? i[w++] = 224 | f >>> 12 : (i[w++] = 240 | f >>> 18, i[w++] = 128 | f >>> 12 & 63), i[w++] = 128 | f >>> 6 & 63), i[w++] = 128 | 63 & f);
+          return i;
+        }(s);
+      }, g.utf8decode = function(s) {
+        return o.nodebuffer ? l.transformTo("nodebuffer", s).toString("utf-8") : function(m) {
+          var i, f, h, u, w = m.length, k = new Array(2 * w);
+          for (i = f = 0; i < w; )
+            if ((h = m[i++]) < 128)
+              k[f++] = h;
+            else if (4 < (u = d[h]))
+              k[f++] = 65533, i += u - 1;
+            else {
+              for (h &= u === 2 ? 31 : u === 3 ? 15 : 7; 1 < u && i < w; )
+                h = h << 6 | 63 & m[i++], u--;
+              1 < u ? k[f++] = 65533 : h < 65536 ? k[f++] = h : (h -= 65536, k[f++] = 55296 | h >> 10 & 1023, k[f++] = 56320 | 1023 & h);
+            }
+          return k.length !== f && (k.subarray ? k = k.subarray(0, f) : k.length = f), l.applyFromCharCode(k);
+        }(s = l.transformTo(o.uint8array ? "uint8array" : "array", s));
+      }, l.inherits(_, a), _.prototype.processChunk = function(s) {
+        var m = l.transformTo(o.uint8array ? "uint8array" : "array", s.data);
+        if (this.leftOver && this.leftOver.length) {
+          if (o.uint8array) {
+            var i = m;
+            (m = new Uint8Array(i.length + this.leftOver.length)).set(this.leftOver, 0), m.set(i, this.leftOver.length);
+          } else
+            m = this.leftOver.concat(m);
+          this.leftOver = null;
+        }
+        var f = function(u, w) {
+          var k;
+          for ((w = w || u.length) > u.length && (w = u.length), k = w - 1; 0 <= k && (192 & u[k]) == 128; )
+            k--;
+          return k < 0 || k === 0 ? w : k + d[u[k]] > w ? k : w;
+        }(m), h = m;
+        f !== m.length && (o.uint8array ? (h = m.subarray(0, f), this.leftOver = m.subarray(f, m.length)) : (h = m.slice(0, f), this.leftOver = m.slice(f, m.length))), this.push({ data: g.utf8decode(h), meta: s.meta });
+      }, _.prototype.flush = function() {
+        this.leftOver && this.leftOver.length && (this.push({ data: g.utf8decode(this.leftOver), meta: {} }), this.leftOver = null);
+      }, g.Utf8DecodeWorker = _, l.inherits(v, a), v.prototype.processChunk = function(s) {
+        this.push({ data: g.utf8encode(s.data), meta: s.meta });
+      }, g.Utf8EncodeWorker = v;
+    }, { "./nodejsUtils": 14, "./stream/GenericWorker": 28, "./support": 30, "./utils": 32 }], 32: [function(n, S, g) {
+      var l = n("./support"), o = n("./base64"), e = n("./nodejsUtils"), a = n("./external");
+      function d(i) {
+        return i;
+      }
+      function c(i, f) {
+        for (var h = 0; h < i.length; ++h)
+          f[h] = 255 & i.charCodeAt(h);
+        return f;
+      }
+      n("setimmediate"), g.newBlob = function(i, f) {
+        g.checkSupport("blob");
+        try {
+          return new Blob([i], { type: f });
+        } catch {
+          try {
+            var h = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
+            return h.append(i), h.getBlob(f);
+          } catch {
+            throw new Error("Bug : can't construct the Blob.");
+          }
+        }
+      };
+      var _ = { stringifyByChunk: function(i, f, h) {
+        var u = [], w = 0, k = i.length;
+        if (k <= h)
+          return String.fromCharCode.apply(null, i);
+        for (; w < k; )
+          f === "array" || f === "nodebuffer" ? u.push(String.fromCharCode.apply(null, i.slice(w, Math.min(w + h, k)))) : u.push(String.fromCharCode.apply(null, i.subarray(w, Math.min(w + h, k)))), w += h;
+        return u.join("");
+      }, stringifyByChar: function(i) {
+        for (var f = "", h = 0; h < i.length; h++)
+          f += String.fromCharCode(i[h]);
+        return f;
+      }, applyCanBeUsed: { uint8array: function() {
+        try {
+          return l.uint8array && String.fromCharCode.apply(null, new Uint8Array(1)).length === 1;
+        } catch {
+          return !1;
+        }
+      }(), nodebuffer: function() {
+        try {
+          return l.nodebuffer && String.fromCharCode.apply(null, e.allocBuffer(1)).length === 1;
+        } catch {
+          return !1;
+        }
+      }() } };
+      function v(i) {
+        var f = 65536, h = g.getTypeOf(i), u = !0;
+        if (h === "uint8array" ? u = _.applyCanBeUsed.uint8array : h === "nodebuffer" && (u = _.applyCanBeUsed.nodebuffer), u)
+          for (; 1 < f; )
+            try {
+              return _.stringifyByChunk(i, h, f);
+            } catch {
+              f = Math.floor(f / 2);
+            }
+        return _.stringifyByChar(i);
+      }
+      function s(i, f) {
+        for (var h = 0; h < i.length; h++)
+          f[h] = i[h];
+        return f;
+      }
+      g.applyFromCharCode = v;
+      var m = {};
+      m.string = { string: d, array: function(i) {
+        return c(i, new Array(i.length));
+      }, arraybuffer: function(i) {
+        return m.string.uint8array(i).buffer;
+      }, uint8array: function(i) {
+        return c(i, new Uint8Array(i.length));
+      }, nodebuffer: function(i) {
+        return c(i, e.allocBuffer(i.length));
+      } }, m.array = { string: v, array: d, arraybuffer: function(i) {
+        return new Uint8Array(i).buffer;
+      }, uint8array: function(i) {
+        return new Uint8Array(i);
+      }, nodebuffer: function(i) {
+        return e.newBufferFrom(i);
+      } }, m.arraybuffer = { string: function(i) {
+        return v(new Uint8Array(i));
+      }, array: function(i) {
+        return s(new Uint8Array(i), new Array(i.byteLength));
+      }, arraybuffer: d, uint8array: function(i) {
+        return new Uint8Array(i);
+      }, nodebuffer: function(i) {
+        return e.newBufferFrom(new Uint8Array(i));
+      } }, m.uint8array = { string: v, array: function(i) {
+        return s(i, new Array(i.length));
+      }, arraybuffer: function(i) {
+        return i.buffer;
+      }, uint8array: d, nodebuffer: function(i) {
+        return e.newBufferFrom(i);
+      } }, m.nodebuffer = { string: v, array: function(i) {
+        return s(i, new Array(i.length));
+      }, arraybuffer: function(i) {
+        return m.nodebuffer.uint8array(i).buffer;
+      }, uint8array: function(i) {
+        return s(i, new Uint8Array(i.length));
+      }, nodebuffer: d }, g.transformTo = function(i, f) {
+        if (f = f || "", !i)
+          return f;
+        g.checkSupport(i);
+        var h = g.getTypeOf(f);
+        return m[h][i](f);
+      }, g.resolve = function(i) {
+        for (var f = i.split("/"), h = [], u = 0; u < f.length; u++) {
+          var w = f[u];
+          w === "." || w === "" && u !== 0 && u !== f.length - 1 || (w === ".." ? h.pop() : h.push(w));
+        }
+        return h.join("/");
+      }, g.getTypeOf = function(i) {
+        return typeof i == "string" ? "string" : Object.prototype.toString.call(i) === "[object Array]" ? "array" : l.nodebuffer && e.isBuffer(i) ? "nodebuffer" : l.uint8array && i instanceof Uint8Array ? "uint8array" : l.arraybuffer && i instanceof ArrayBuffer ? "arraybuffer" : void 0;
+      }, g.checkSupport = function(i) {
+        if (!l[i.toLowerCase()])
+          throw new Error(i + " is not supported by this platform");
+      }, g.MAX_VALUE_16BITS = 65535, g.MAX_VALUE_32BITS = -1, g.pretty = function(i) {
+        var f, h, u = "";
+        for (h = 0; h < (i || "").length; h++)
+          u += "\\x" + ((f = i.charCodeAt(h)) < 16 ? "0" : "") + f.toString(16).toUpperCase();
+        return u;
+      }, g.delay = function(i, f, h) {
+        setImmediate(function() {
+          i.apply(h || null, f || []);
+        });
+      }, g.inherits = function(i, f) {
+        function h() {
+        }
+        h.prototype = f.prototype, i.prototype = new h();
+      }, g.extend = function() {
+        var i, f, h = {};
+        for (i = 0; i < arguments.length; i++)
+          for (f in arguments[i])
+            Object.prototype.hasOwnProperty.call(arguments[i], f) && h[f] === void 0 && (h[f] = arguments[i][f]);
+        return h;
+      }, g.prepareContent = function(i, f, h, u, w) {
+        return a.Promise.resolve(f).then(function(k) {
+          return l.blob && (k instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(k)) !== -1) && typeof FileReader < "u" ? new a.Promise(function(x, O) {
+            var T = new FileReader();
+            T.onload = function(M) {
+              x(M.target.result);
+            }, T.onerror = function(M) {
+              O(M.target.error);
+            }, T.readAsArrayBuffer(k);
+          }) : k;
+        }).then(function(k) {
+          var x = g.getTypeOf(k);
+          return x ? (x === "arraybuffer" ? k = g.transformTo("uint8array", k) : x === "string" && (w ? k = o.decode(k) : h && u !== !0 && (k = function(O) {
+            return c(O, l.uint8array ? new Uint8Array(O.length) : new Array(O.length));
+          }(k))), k) : a.Promise.reject(new Error("Can't read the data of '" + i + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
+        });
+      };
+    }, { "./base64": 1, "./external": 6, "./nodejsUtils": 14, "./support": 30, setimmediate: 54 }], 33: [function(n, S, g) {
+      var l = n("./reader/readerFor"), o = n("./utils"), e = n("./signature"), a = n("./zipEntry"), d = n("./support");
+      function c(_) {
+        this.files = [], this.loadOptions = _;
+      }
+      c.prototype = { checkSignature: function(_) {
+        if (!this.reader.readAndCheckSignature(_)) {
+          this.reader.index -= 4;
+          var v = this.reader.readString(4);
+          throw new Error("Corrupted zip or bug: unexpected signature (" + o.pretty(v) + ", expected " + o.pretty(_) + ")");
+        }
+      }, isSignature: function(_, v) {
+        var s = this.reader.index;
+        this.reader.setIndex(_);
+        var m = this.reader.readString(4) === v;
+        return this.reader.setIndex(s), m;
+      }, readBlockEndOfCentral: function() {
+        this.diskNumber = this.reader.readInt(2), this.diskWithCentralDirStart = this.reader.readInt(2), this.centralDirRecordsOnThisDisk = this.reader.readInt(2), this.centralDirRecords = this.reader.readInt(2), this.centralDirSize = this.reader.readInt(4), this.centralDirOffset = this.reader.readInt(4), this.zipCommentLength = this.reader.readInt(2);
+        var _ = this.reader.readData(this.zipCommentLength), v = d.uint8array ? "uint8array" : "array", s = o.transformTo(v, _);
+        this.zipComment = this.loadOptions.decodeFileName(s);
+      }, readBlockZip64EndOfCentral: function() {
+        this.zip64EndOfCentralSize = this.reader.readInt(8), this.reader.skip(4), this.diskNumber = this.reader.readInt(4), this.diskWithCentralDirStart = this.reader.readInt(4), this.centralDirRecordsOnThisDisk = this.reader.readInt(8), this.centralDirRecords = this.reader.readInt(8), this.centralDirSize = this.reader.readInt(8), this.centralDirOffset = this.reader.readInt(8), this.zip64ExtensibleData = {};
+        for (var _, v, s, m = this.zip64EndOfCentralSize - 44; 0 < m; )
+          _ = this.reader.readInt(2), v = this.reader.readInt(4), s = this.reader.readData(v), this.zip64ExtensibleData[_] = { id: _, length: v, value: s };
+      }, readBlockZip64EndOfCentralLocator: function() {
+        if (this.diskWithZip64CentralDirStart = this.reader.readInt(4), this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8), this.disksCount = this.reader.readInt(4), 1 < this.disksCount)
+          throw new Error("Multi-volumes zip are not supported");
+      }, readLocalFiles: function() {
+        var _, v;
+        for (_ = 0; _ < this.files.length; _++)
+          v = this.files[_], this.reader.setIndex(v.localHeaderOffset), this.checkSignature(e.LOCAL_FILE_HEADER), v.readLocalPart(this.reader), v.handleUTF8(), v.processAttributes();
+      }, readCentralDir: function() {
+        var _;
+        for (this.reader.setIndex(this.centralDirOffset); this.reader.readAndCheckSignature(e.CENTRAL_FILE_HEADER); )
+          (_ = new a({ zip64: this.zip64 }, this.loadOptions)).readCentralPart(this.reader), this.files.push(_);
+        if (this.centralDirRecords !== this.files.length && this.centralDirRecords !== 0 && this.files.length === 0)
+          throw new Error("Corrupted zip or bug: expected " + this.centralDirRecords + " records in central dir, got " + this.files.length);
+      }, readEndOfCentral: function() {
+        var _ = this.reader.lastIndexOfSignature(e.CENTRAL_DIRECTORY_END);
+        if (_ < 0)
+          throw this.isSignature(0, e.LOCAL_FILE_HEADER) ? new Error("Corrupted zip: can't find end of central directory") : new Error("Can't find end of central directory : is this a zip file ? If it is, see https://stuk.github.io/jszip/documentation/howto/read_zip.html");
+        this.reader.setIndex(_);
+        var v = _;
+        if (this.checkSignature(e.CENTRAL_DIRECTORY_END), this.readBlockEndOfCentral(), this.diskNumber === o.MAX_VALUE_16BITS || this.diskWithCentralDirStart === o.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === o.MAX_VALUE_16BITS || this.centralDirRecords === o.MAX_VALUE_16BITS || this.centralDirSize === o.MAX_VALUE_32BITS || this.centralDirOffset === o.MAX_VALUE_32BITS) {
+          if (this.zip64 = !0, (_ = this.reader.lastIndexOfSignature(e.ZIP64_CENTRAL_DIRECTORY_LOCATOR)) < 0)
+            throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator");
+          if (this.reader.setIndex(_), this.checkSignature(e.ZIP64_CENTRAL_DIRECTORY_LOCATOR), this.readBlockZip64EndOfCentralLocator(), !this.isSignature(this.relativeOffsetEndOfZip64CentralDir, e.ZIP64_CENTRAL_DIRECTORY_END) && (this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(e.ZIP64_CENTRAL_DIRECTORY_END), this.relativeOffsetEndOfZip64CentralDir < 0))
+            throw new Error("Corrupted zip: can't find the ZIP64 end of central directory");
+          this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir), this.checkSignature(e.ZIP64_CENTRAL_DIRECTORY_END), this.readBlockZip64EndOfCentral();
+        }
+        var s = this.centralDirOffset + this.centralDirSize;
+        this.zip64 && (s += 20, s += 12 + this.zip64EndOfCentralSize);
+        var m = v - s;
+        if (0 < m)
+          this.isSignature(v, e.CENTRAL_FILE_HEADER) || (this.reader.zero = m);
+        else if (m < 0)
+          throw new Error("Corrupted zip: missing " + Math.abs(m) + " bytes.");
+      }, prepareReader: function(_) {
+        this.reader = l(_);
+      }, load: function(_) {
+        this.prepareReader(_), this.readEndOfCentral(), this.readCentralDir(), this.readLocalFiles();
+      } }, S.exports = c;
+    }, { "./reader/readerFor": 22, "./signature": 23, "./support": 30, "./utils": 32, "./zipEntry": 34 }], 34: [function(n, S, g) {
+      var l = n("./reader/readerFor"), o = n("./utils"), e = n("./compressedObject"), a = n("./crc32"), d = n("./utf8"), c = n("./compressions"), _ = n("./support");
+      function v(s, m) {
+        this.options = s, this.loadOptions = m;
+      }
+      v.prototype = { isEncrypted: function() {
+        return (1 & this.bitFlag) == 1;
+      }, useUTF8: function() {
+        return (2048 & this.bitFlag) == 2048;
+      }, readLocalPart: function(s) {
+        var m, i;
+        if (s.skip(22), this.fileNameLength = s.readInt(2), i = s.readInt(2), this.fileName = s.readData(this.fileNameLength), s.skip(i), this.compressedSize === -1 || this.uncompressedSize === -1)
+          throw new Error("Bug or corrupted zip : didn't get enough information from the central directory (compressedSize === -1 || uncompressedSize === -1)");
+        if ((m = function(f) {
+          for (var h in c)
+            if (Object.prototype.hasOwnProperty.call(c, h) && c[h].magic === f)
+              return c[h];
+          return null;
+        }(this.compressionMethod)) === null)
+          throw new Error("Corrupted zip : compression " + o.pretty(this.compressionMethod) + " unknown (inner file : " + o.transformTo("string", this.fileName) + ")");
+        this.decompressed = new e(this.compressedSize, this.uncompressedSize, this.crc32, m, s.readData(this.compressedSize));
+      }, readCentralPart: function(s) {
+        this.versionMadeBy = s.readInt(2), s.skip(2), this.bitFlag = s.readInt(2), this.compressionMethod = s.readString(2), this.date = s.readDate(), this.crc32 = s.readInt(4), this.compressedSize = s.readInt(4), this.uncompressedSize = s.readInt(4);
+        var m = s.readInt(2);
+        if (this.extraFieldsLength = s.readInt(2), this.fileCommentLength = s.readInt(2), this.diskNumberStart = s.readInt(2), this.internalFileAttributes = s.readInt(2), this.externalFileAttributes = s.readInt(4), this.localHeaderOffset = s.readInt(4), this.isEncrypted())
+          throw new Error("Encrypted zip are not supported");
+        s.skip(m), this.readExtraFields(s), this.parseZIP64ExtraField(s), this.fileComment = s.readData(this.fileCommentLength);
+      }, processAttributes: function() {
+        this.unixPermissions = null, this.dosPermissions = null;
+        var s = this.versionMadeBy >> 8;
+        this.dir = !!(16 & this.externalFileAttributes), s == 0 && (this.dosPermissions = 63 & this.externalFileAttributes), s == 3 && (this.unixPermissions = this.externalFileAttributes >> 16 & 65535), this.dir || this.fileNameStr.slice(-1) !== "/" || (this.dir = !0);
+      }, parseZIP64ExtraField: function() {
+        if (this.extraFields[1]) {
+          var s = l(this.extraFields[1].value);
+          this.uncompressedSize === o.MAX_VALUE_32BITS && (this.uncompressedSize = s.readInt(8)), this.compressedSize === o.MAX_VALUE_32BITS && (this.compressedSize = s.readInt(8)), this.localHeaderOffset === o.MAX_VALUE_32BITS && (this.localHeaderOffset = s.readInt(8)), this.diskNumberStart === o.MAX_VALUE_32BITS && (this.diskNumberStart = s.readInt(4));
+        }
+      }, readExtraFields: function(s) {
+        var m, i, f, h = s.index + this.extraFieldsLength;
+        for (this.extraFields || (this.extraFields = {}); s.index + 4 < h; )
+          m = s.readInt(2), i = s.readInt(2), f = s.readData(i), this.extraFields[m] = { id: m, length: i, value: f };
+        s.setIndex(h);
+      }, handleUTF8: function() {
+        var s = _.uint8array ? "uint8array" : "array";
+        if (this.useUTF8())
+          this.fileNameStr = d.utf8decode(this.fileName), this.fileCommentStr = d.utf8decode(this.fileComment);
+        else {
+          var m = this.findExtraFieldUnicodePath();
+          if (m !== null)
+            this.fileNameStr = m;
+          else {
+            var i = o.transformTo(s, this.fileName);
+            this.fileNameStr = this.loadOptions.decodeFileName(i);
+          }
+          var f = this.findExtraFieldUnicodeComment();
+          if (f !== null)
+            this.fileCommentStr = f;
+          else {
+            var h = o.transformTo(s, this.fileComment);
+            this.fileCommentStr = this.loadOptions.decodeFileName(h);
+          }
+        }
+      }, findExtraFieldUnicodePath: function() {
+        var s = this.extraFields[28789];
+        if (s) {
+          var m = l(s.value);
+          return m.readInt(1) !== 1 || a(this.fileName) !== m.readInt(4) ? null : d.utf8decode(m.readData(s.length - 5));
+        }
+        return null;
+      }, findExtraFieldUnicodeComment: function() {
+        var s = this.extraFields[25461];
+        if (s) {
+          var m = l(s.value);
+          return m.readInt(1) !== 1 || a(this.fileComment) !== m.readInt(4) ? null : d.utf8decode(m.readData(s.length - 5));
+        }
+        return null;
+      } }, S.exports = v;
+    }, { "./compressedObject": 2, "./compressions": 3, "./crc32": 4, "./reader/readerFor": 22, "./support": 30, "./utf8": 31, "./utils": 32 }], 35: [function(n, S, g) {
+      function l(m, i, f) {
+        this.name = m, this.dir = f.dir, this.date = f.date, this.comment = f.comment, this.unixPermissions = f.unixPermissions, this.dosPermissions = f.dosPermissions, this._data = i, this._dataBinary = f.binary, this.options = { compression: f.compression, compressionOptions: f.compressionOptions };
+      }
+      var o = n("./stream/StreamHelper"), e = n("./stream/DataWorker"), a = n("./utf8"), d = n("./compressedObject"), c = n("./stream/GenericWorker");
+      l.prototype = { internalStream: function(m) {
+        var i = null, f = "string";
+        try {
+          if (!m)
+            throw new Error("No output type specified.");
+          var h = (f = m.toLowerCase()) === "string" || f === "text";
+          f !== "binarystring" && f !== "text" || (f = "string"), i = this._decompressWorker();
+          var u = !this._dataBinary;
+          u && !h && (i = i.pipe(new a.Utf8EncodeWorker())), !u && h && (i = i.pipe(new a.Utf8DecodeWorker()));
+        } catch (w) {
+          (i = new c("error")).error(w);
+        }
+        return new o(i, f, "");
+      }, async: function(m, i) {
+        return this.internalStream(m).accumulate(i);
+      }, nodeStream: function(m, i) {
+        return this.internalStream(m || "nodebuffer").toNodejsStream(i);
+      }, _compressWorker: function(m, i) {
+        if (this._data instanceof d && this._data.compression.magic === m.magic)
+          return this._data.getCompressedWorker();
+        var f = this._decompressWorker();
+        return this._dataBinary || (f = f.pipe(new a.Utf8EncodeWorker())), d.createWorkerFrom(f, m, i);
+      }, _decompressWorker: function() {
+        return this._data instanceof d ? this._data.getContentWorker() : this._data instanceof c ? this._data : new e(this._data);
+      } };
+      for (var _ = ["asText", "asBinary", "asNodeBuffer", "asUint8Array", "asArrayBuffer"], v = function() {
+        throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
+      }, s = 0; s < _.length; s++)
+        l.prototype[_[s]] = v;
+      S.exports = l;
+    }, { "./compressedObject": 2, "./stream/DataWorker": 27, "./stream/GenericWorker": 28, "./stream/StreamHelper": 29, "./utf8": 31 }], 36: [function(n, S, g) {
+      (function(l) {
+        var o, e, a = l.MutationObserver || l.WebKitMutationObserver;
+        if (a) {
+          var d = 0, c = new a(m), _ = l.document.createTextNode("");
+          c.observe(_, { characterData: !0 }), o = function() {
+            _.data = d = ++d % 2;
+          };
+        } else if (l.setImmediate || l.MessageChannel === void 0)
+          o = "document" in l && "onreadystatechange" in l.document.createElement("script") ? function() {
+            var i = l.document.createElement("script");
+            i.onreadystatechange = function() {
+              m(), i.onreadystatechange = null, i.parentNode.removeChild(i), i = null;
+            }, l.document.documentElement.appendChild(i);
+          } : function() {
+            setTimeout(m, 0);
+          };
+        else {
+          var v = new l.MessageChannel();
+          v.port1.onmessage = m, o = function() {
+            v.port2.postMessage(0);
+          };
+        }
+        var s = [];
+        function m() {
+          var i, f;
+          e = !0;
+          for (var h = s.length; h; ) {
+            for (f = s, s = [], i = -1; ++i < h; )
+              f[i]();
+            h = s.length;
+          }
+          e = !1;
+        }
+        S.exports = function(i) {
+          s.push(i) !== 1 || e || o();
+        };
+      }).call(this, typeof At < "u" ? At : typeof self < "u" ? self : typeof window < "u" ? window : {});
+    }, {}], 37: [function(n, S, g) {
+      var l = n("immediate");
+      function o() {
+      }
+      var e = {}, a = ["REJECTED"], d = ["FULFILLED"], c = ["PENDING"];
+      function _(h) {
+        if (typeof h != "function")
+          throw new TypeError("resolver must be a function");
+        this.state = c, this.queue = [], this.outcome = void 0, h !== o && i(this, h);
+      }
+      function v(h, u, w) {
+        this.promise = h, typeof u == "function" && (this.onFulfilled = u, this.callFulfilled = this.otherCallFulfilled), typeof w == "function" && (this.onRejected = w, this.callRejected = this.otherCallRejected);
+      }
+      function s(h, u, w) {
+        l(function() {
+          var k;
+          try {
+            k = u(w);
+          } catch (x) {
+            return e.reject(h, x);
+          }
+          k === h ? e.reject(h, new TypeError("Cannot resolve promise with itself")) : e.resolve(h, k);
+        });
+      }
+      function m(h) {
+        var u = h && h.then;
+        if (h && (typeof h == "object" || typeof h == "function") && typeof u == "function")
+          return function() {
+            u.apply(h, arguments);
+          };
+      }
+      function i(h, u) {
+        var w = !1;
+        function k(T) {
+          w || (w = !0, e.reject(h, T));
+        }
+        function x(T) {
+          w || (w = !0, e.resolve(h, T));
+        }
+        var O = f(function() {
+          u(x, k);
+        });
+        O.status === "error" && k(O.value);
+      }
+      function f(h, u) {
+        var w = {};
+        try {
+          w.value = h(u), w.status = "success";
+        } catch (k) {
+          w.status = "error", w.value = k;
+        }
+        return w;
+      }
+      (S.exports = _).prototype.finally = function(h) {
+        if (typeof h != "function")
+          return this;
+        var u = this.constructor;
+        return this.then(function(w) {
+          return u.resolve(h()).then(function() {
+            return w;
+          });
+        }, function(w) {
+          return u.resolve(h()).then(function() {
+            throw w;
+          });
+        });
+      }, _.prototype.catch = function(h) {
+        return this.then(null, h);
+      }, _.prototype.then = function(h, u) {
+        if (typeof h != "function" && this.state === d || typeof u != "function" && this.state === a)
+          return this;
+        var w = new this.constructor(o);
+        return this.state !== c ? s(w, this.state === d ? h : u, this.outcome) : this.queue.push(new v(w, h, u)), w;
+      }, v.prototype.callFulfilled = function(h) {
+        e.resolve(this.promise, h);
+      }, v.prototype.otherCallFulfilled = function(h) {
+        s(this.promise, this.onFulfilled, h);
+      }, v.prototype.callRejected = function(h) {
+        e.reject(this.promise, h);
+      }, v.prototype.otherCallRejected = function(h) {
+        s(this.promise, this.onRejected, h);
+      }, e.resolve = function(h, u) {
+        var w = f(m, u);
+        if (w.status === "error")
+          return e.reject(h, w.value);
+        var k = w.value;
+        if (k)
+          i(h, k);
+        else {
+          h.state = d, h.outcome = u;
+          for (var x = -1, O = h.queue.length; ++x < O; )
+            h.queue[x].callFulfilled(u);
+        }
+        return h;
+      }, e.reject = function(h, u) {
+        h.state = a, h.outcome = u;
+        for (var w = -1, k = h.queue.length; ++w < k; )
+          h.queue[w].callRejected(u);
+        return h;
+      }, _.resolve = function(h) {
+        return h instanceof this ? h : e.resolve(new this(o), h);
+      }, _.reject = function(h) {
+        var u = new this(o);
+        return e.reject(u, h);
+      }, _.all = function(h) {
+        var u = this;
+        if (Object.prototype.toString.call(h) !== "[object Array]")
+          return this.reject(new TypeError("must be an array"));
+        var w = h.length, k = !1;
+        if (!w)
+          return this.resolve([]);
+        for (var x = new Array(w), O = 0, T = -1, M = new this(o); ++T < w; )
+          z(h[T], T);
+        return M;
+        function z(W, j) {
+          u.resolve(W).then(function(b) {
+            x[j] = b, ++O !== w || k || (k = !0, e.resolve(M, x));
+          }, function(b) {
+            k || (k = !0, e.reject(M, b));
+          });
+        }
+      }, _.race = function(h) {
+        var u = this;
+        if (Object.prototype.toString.call(h) !== "[object Array]")
+          return this.reject(new TypeError("must be an array"));
+        var w = h.length, k = !1;
+        if (!w)
+          return this.resolve([]);
+        for (var x = -1, O = new this(o); ++x < w; )
+          T = h[x], u.resolve(T).then(function(M) {
+            k || (k = !0, e.resolve(O, M));
+          }, function(M) {
+            k || (k = !0, e.reject(O, M));
+          });
+        var T;
+        return O;
+      };
+    }, { immediate: 36 }], 38: [function(n, S, g) {
+      var l = {};
+      (0, n("./lib/utils/common").assign)(l, n("./lib/deflate"), n("./lib/inflate"), n("./lib/zlib/constants")), S.exports = l;
+    }, { "./lib/deflate": 39, "./lib/inflate": 40, "./lib/utils/common": 41, "./lib/zlib/constants": 44 }], 39: [function(n, S, g) {
+      var l = n("./zlib/deflate"), o = n("./utils/common"), e = n("./utils/strings"), a = n("./zlib/messages"), d = n("./zlib/zstream"), c = Object.prototype.toString, _ = 0, v = -1, s = 0, m = 8;
+      function i(h) {
+        if (!(this instanceof i))
+          return new i(h);
+        this.options = o.assign({ level: v, method: m, chunkSize: 16384, windowBits: 15, memLevel: 8, strategy: s, to: "" }, h || {});
+        var u = this.options;
+        u.raw && 0 < u.windowBits ? u.windowBits = -u.windowBits : u.gzip && 0 < u.windowBits && u.windowBits < 16 && (u.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new d(), this.strm.avail_out = 0;
+        var w = l.deflateInit2(this.strm, u.level, u.method, u.windowBits, u.memLevel, u.strategy);
+        if (w !== _)
+          throw new Error(a[w]);
+        if (u.header && l.deflateSetHeader(this.strm, u.header), u.dictionary) {
+          var k;
+          if (k = typeof u.dictionary == "string" ? e.string2buf(u.dictionary) : c.call(u.dictionary) === "[object ArrayBuffer]" ? new Uint8Array(u.dictionary) : u.dictionary, (w = l.deflateSetDictionary(this.strm, k)) !== _)
+            throw new Error(a[w]);
+          this._dict_set = !0;
+        }
+      }
+      function f(h, u) {
+        var w = new i(u);
+        if (w.push(h, !0), w.err)
+          throw w.msg || a[w.err];
+        return w.result;
+      }
+      i.prototype.push = function(h, u) {
+        var w, k, x = this.strm, O = this.options.chunkSize;
+        if (this.ended)
+          return !1;
+        k = u === ~~u ? u : u === !0 ? 4 : 0, typeof h == "string" ? x.input = e.string2buf(h) : c.call(h) === "[object ArrayBuffer]" ? x.input = new Uint8Array(h) : x.input = h, x.next_in = 0, x.avail_in = x.input.length;
+        do {
+          if (x.avail_out === 0 && (x.output = new o.Buf8(O), x.next_out = 0, x.avail_out = O), (w = l.deflate(x, k)) !== 1 && w !== _)
+            return this.onEnd(w), !(this.ended = !0);
+          x.avail_out !== 0 && (x.avail_in !== 0 || k !== 4 && k !== 2) || (this.options.to === "string" ? this.onData(e.buf2binstring(o.shrinkBuf(x.output, x.next_out))) : this.onData(o.shrinkBuf(x.output, x.next_out)));
+        } while ((0 < x.avail_in || x.avail_out === 0) && w !== 1);
+        return k === 4 ? (w = l.deflateEnd(this.strm), this.onEnd(w), this.ended = !0, w === _) : k !== 2 || (this.onEnd(_), !(x.avail_out = 0));
+      }, i.prototype.onData = function(h) {
+        this.chunks.push(h);
+      }, i.prototype.onEnd = function(h) {
+        h === _ && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = o.flattenChunks(this.chunks)), this.chunks = [], this.err = h, this.msg = this.strm.msg;
+      }, g.Deflate = i, g.deflate = f, g.deflateRaw = function(h, u) {
+        return (u = u || {}).raw = !0, f(h, u);
+      }, g.gzip = function(h, u) {
+        return (u = u || {}).gzip = !0, f(h, u);
+      };
+    }, { "./utils/common": 41, "./utils/strings": 42, "./zlib/deflate": 46, "./zlib/messages": 51, "./zlib/zstream": 53 }], 40: [function(n, S, g) {
+      var l = n("./zlib/inflate"), o = n("./utils/common"), e = n("./utils/strings"), a = n("./zlib/constants"), d = n("./zlib/messages"), c = n("./zlib/zstream"), _ = n("./zlib/gzheader"), v = Object.prototype.toString;
+      function s(i) {
+        if (!(this instanceof s))
+          return new s(i);
+        this.options = o.assign({ chunkSize: 16384, windowBits: 0, to: "" }, i || {});
+        var f = this.options;
+        f.raw && 0 <= f.windowBits && f.windowBits < 16 && (f.windowBits = -f.windowBits, f.windowBits === 0 && (f.windowBits = -15)), !(0 <= f.windowBits && f.windowBits < 16) || i && i.windowBits || (f.windowBits += 32), 15 < f.windowBits && f.windowBits < 48 && !(15 & f.windowBits) && (f.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new c(), this.strm.avail_out = 0;
+        var h = l.inflateInit2(this.strm, f.windowBits);
+        if (h !== a.Z_OK)
+          throw new Error(d[h]);
+        this.header = new _(), l.inflateGetHeader(this.strm, this.header);
+      }
+      function m(i, f) {
+        var h = new s(f);
+        if (h.push(i, !0), h.err)
+          throw h.msg || d[h.err];
+        return h.result;
+      }
+      s.prototype.push = function(i, f) {
+        var h, u, w, k, x, O, T = this.strm, M = this.options.chunkSize, z = this.options.dictionary, W = !1;
+        if (this.ended)
+          return !1;
+        u = f === ~~f ? f : f === !0 ? a.Z_FINISH : a.Z_NO_FLUSH, typeof i == "string" ? T.input = e.binstring2buf(i) : v.call(i) === "[object ArrayBuffer]" ? T.input = new Uint8Array(i) : T.input = i, T.next_in = 0, T.avail_in = T.input.length;
+        do {
+          if (T.avail_out === 0 && (T.output = new o.Buf8(M), T.next_out = 0, T.avail_out = M), (h = l.inflate(T, a.Z_NO_FLUSH)) === a.Z_NEED_DICT && z && (O = typeof z == "string" ? e.string2buf(z) : v.call(z) === "[object ArrayBuffer]" ? new Uint8Array(z) : z, h = l.inflateSetDictionary(this.strm, O)), h === a.Z_BUF_ERROR && W === !0 && (h = a.Z_OK, W = !1), h !== a.Z_STREAM_END && h !== a.Z_OK)
+            return this.onEnd(h), !(this.ended = !0);
+          T.next_out && (T.avail_out !== 0 && h !== a.Z_STREAM_END && (T.avail_in !== 0 || u !== a.Z_FINISH && u !== a.Z_SYNC_FLUSH) || (this.options.to === "string" ? (w = e.utf8border(T.output, T.next_out), k = T.next_out - w, x = e.buf2string(T.output, w), T.next_out = k, T.avail_out = M - k, k && o.arraySet(T.output, T.output, w, k, 0), this.onData(x)) : this.onData(o.shrinkBuf(T.output, T.next_out)))), T.avail_in === 0 && T.avail_out === 0 && (W = !0);
+        } while ((0 < T.avail_in || T.avail_out === 0) && h !== a.Z_STREAM_END);
+        return h === a.Z_STREAM_END && (u = a.Z_FINISH), u === a.Z_FINISH ? (h = l.inflateEnd(this.strm), this.onEnd(h), this.ended = !0, h === a.Z_OK) : u !== a.Z_SYNC_FLUSH || (this.onEnd(a.Z_OK), !(T.avail_out = 0));
+      }, s.prototype.onData = function(i) {
+        this.chunks.push(i);
+      }, s.prototype.onEnd = function(i) {
+        i === a.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = o.flattenChunks(this.chunks)), this.chunks = [], this.err = i, this.msg = this.strm.msg;
+      }, g.Inflate = s, g.inflate = m, g.inflateRaw = function(i, f) {
+        return (f = f || {}).raw = !0, m(i, f);
+      }, g.ungzip = m;
+    }, { "./utils/common": 41, "./utils/strings": 42, "./zlib/constants": 44, "./zlib/gzheader": 47, "./zlib/inflate": 49, "./zlib/messages": 51, "./zlib/zstream": 53 }], 41: [function(n, S, g) {
+      var l = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Int32Array < "u";
+      g.assign = function(a) {
+        for (var d = Array.prototype.slice.call(arguments, 1); d.length; ) {
+          var c = d.shift();
+          if (c) {
+            if (typeof c != "object")
+              throw new TypeError(c + "must be non-object");
+            for (var _ in c)
+              c.hasOwnProperty(_) && (a[_] = c[_]);
+          }
+        }
+        return a;
+      }, g.shrinkBuf = function(a, d) {
+        return a.length === d ? a : a.subarray ? a.subarray(0, d) : (a.length = d, a);
+      };
+      var o = { arraySet: function(a, d, c, _, v) {
+        if (d.subarray && a.subarray)
+          a.set(d.subarray(c, c + _), v);
+        else
+          for (var s = 0; s < _; s++)
+            a[v + s] = d[c + s];
+      }, flattenChunks: function(a) {
+        var d, c, _, v, s, m;
+        for (d = _ = 0, c = a.length; d < c; d++)
+          _ += a[d].length;
+        for (m = new Uint8Array(_), d = v = 0, c = a.length; d < c; d++)
+          s = a[d], m.set(s, v), v += s.length;
+        return m;
+      } }, e = { arraySet: function(a, d, c, _, v) {
+        for (var s = 0; s < _; s++)
+          a[v + s] = d[c + s];
+      }, flattenChunks: function(a) {
+        return [].concat.apply([], a);
+      } };
+      g.setTyped = function(a) {
+        a ? (g.Buf8 = Uint8Array, g.Buf16 = Uint16Array, g.Buf32 = Int32Array, g.assign(g, o)) : (g.Buf8 = Array, g.Buf16 = Array, g.Buf32 = Array, g.assign(g, e));
+      }, g.setTyped(l);
+    }, {}], 42: [function(n, S, g) {
+      var l = n("./common"), o = !0, e = !0;
+      try {
+        String.fromCharCode.apply(null, [0]);
+      } catch {
+        o = !1;
+      }
+      try {
+        String.fromCharCode.apply(null, new Uint8Array(1));
+      } catch {
+        e = !1;
+      }
+      for (var a = new l.Buf8(256), d = 0; d < 256; d++)
+        a[d] = 252 <= d ? 6 : 248 <= d ? 5 : 240 <= d ? 4 : 224 <= d ? 3 : 192 <= d ? 2 : 1;
+      function c(_, v) {
+        if (v < 65537 && (_.subarray && e || !_.subarray && o))
+          return String.fromCharCode.apply(null, l.shrinkBuf(_, v));
+        for (var s = "", m = 0; m < v; m++)
+          s += String.fromCharCode(_[m]);
+        return s;
+      }
+      a[254] = a[254] = 1, g.string2buf = function(_) {
+        var v, s, m, i, f, h = _.length, u = 0;
+        for (i = 0; i < h; i++)
+          (64512 & (s = _.charCodeAt(i))) == 55296 && i + 1 < h && (64512 & (m = _.charCodeAt(i + 1))) == 56320 && (s = 65536 + (s - 55296 << 10) + (m - 56320), i++), u += s < 128 ? 1 : s < 2048 ? 2 : s < 65536 ? 3 : 4;
+        for (v = new l.Buf8(u), i = f = 0; f < u; i++)
+          (64512 & (s = _.charCodeAt(i))) == 55296 && i + 1 < h && (64512 & (m = _.charCodeAt(i + 1))) == 56320 && (s = 65536 + (s - 55296 << 10) + (m - 56320), i++), s < 128 ? v[f++] = s : (s < 2048 ? v[f++] = 192 | s >>> 6 : (s < 65536 ? v[f++] = 224 | s >>> 12 : (v[f++] = 240 | s >>> 18, v[f++] = 128 | s >>> 12 & 63), v[f++] = 128 | s >>> 6 & 63), v[f++] = 128 | 63 & s);
+        return v;
+      }, g.buf2binstring = function(_) {
+        return c(_, _.length);
+      }, g.binstring2buf = function(_) {
+        for (var v = new l.Buf8(_.length), s = 0, m = v.length; s < m; s++)
+          v[s] = _.charCodeAt(s);
+        return v;
+      }, g.buf2string = function(_, v) {
+        var s, m, i, f, h = v || _.length, u = new Array(2 * h);
+        for (s = m = 0; s < h; )
+          if ((i = _[s++]) < 128)
+            u[m++] = i;
+          else if (4 < (f = a[i]))
+            u[m++] = 65533, s += f - 1;
+          else {
+            for (i &= f === 2 ? 31 : f === 3 ? 15 : 7; 1 < f && s < h; )
+              i = i << 6 | 63 & _[s++], f--;
+            1 < f ? u[m++] = 65533 : i < 65536 ? u[m++] = i : (i -= 65536, u[m++] = 55296 | i >> 10 & 1023, u[m++] = 56320 | 1023 & i);
+          }
+        return c(u, m);
+      }, g.utf8border = function(_, v) {
+        var s;
+        for ((v = v || _.length) > _.length && (v = _.length), s = v - 1; 0 <= s && (192 & _[s]) == 128; )
+          s--;
+        return s < 0 || s === 0 ? v : s + a[_[s]] > v ? s : v;
+      };
+    }, { "./common": 41 }], 43: [function(n, S, g) {
+      S.exports = function(l, o, e, a) {
+        for (var d = 65535 & l | 0, c = l >>> 16 & 65535 | 0, _ = 0; e !== 0; ) {
+          for (e -= _ = 2e3 < e ? 2e3 : e; c = c + (d = d + o[a++] | 0) | 0, --_; )
+            ;
+          d %= 65521, c %= 65521;
+        }
+        return d | c << 16 | 0;
+      };
+    }, {}], 44: [function(n, S, g) {
+      S.exports = { Z_NO_FLUSH: 0, Z_PARTIAL_FLUSH: 1, Z_SYNC_FLUSH: 2, Z_FULL_FLUSH: 3, Z_FINISH: 4, Z_BLOCK: 5, Z_TREES: 6, Z_OK: 0, Z_STREAM_END: 1, Z_NEED_DICT: 2, Z_ERRNO: -1, Z_STREAM_ERROR: -2, Z_DATA_ERROR: -3, Z_BUF_ERROR: -5, Z_NO_COMPRESSION: 0, Z_BEST_SPEED: 1, Z_BEST_COMPRESSION: 9, Z_DEFAULT_COMPRESSION: -1, Z_FILTERED: 1, Z_HUFFMAN_ONLY: 2, Z_RLE: 3, Z_FIXED: 4, Z_DEFAULT_STRATEGY: 0, Z_BINARY: 0, Z_TEXT: 1, Z_UNKNOWN: 2, Z_DEFLATED: 8 };
+    }, {}], 45: [function(n, S, g) {
+      var l = function() {
+        for (var o, e = [], a = 0; a < 256; a++) {
+          o = a;
+          for (var d = 0; d < 8; d++)
+            o = 1 & o ? 3988292384 ^ o >>> 1 : o >>> 1;
+          e[a] = o;
+        }
+        return e;
+      }();
+      S.exports = function(o, e, a, d) {
+        var c = l, _ = d + a;
+        o ^= -1;
+        for (var v = d; v < _; v++)
+          o = o >>> 8 ^ c[255 & (o ^ e[v])];
+        return -1 ^ o;
+      };
+    }, {}], 46: [function(n, S, g) {
+      var l, o = n("../utils/common"), e = n("./trees"), a = n("./adler32"), d = n("./crc32"), c = n("./messages"), _ = 0, v = 4, s = 0, m = -2, i = -1, f = 4, h = 2, u = 8, w = 9, k = 286, x = 30, O = 19, T = 2 * k + 1, M = 15, z = 3, W = 258, j = W + z + 1, b = 42, F = 113, r = 1, N = 2, Q = 3, $ = 4;
+      function Y(t, D) {
+        return t.msg = c[D], D;
+      }
+      function L(t) {
+        return (t << 1) - (4 < t ? 9 : 0);
+      }
+      function K(t) {
+        for (var D = t.length; 0 <= --D; )
+          t[D] = 0;
+      }
+      function I(t) {
+        var D = t.state, R = D.pending;
+        R > t.avail_out && (R = t.avail_out), R !== 0 && (o.arraySet(t.output, D.pending_buf, D.pending_out, R, t.next_out), t.next_out += R, D.pending_out += R, t.total_out += R, t.avail_out -= R, D.pending -= R, D.pending === 0 && (D.pending_out = 0));
+      }
+      function B(t, D) {
+        e._tr_flush_block(t, 0 <= t.block_start ? t.block_start : -1, t.strstart - t.block_start, D), t.block_start = t.strstart, I(t.strm);
+      }
+      function tt(t, D) {
+        t.pending_buf[t.pending++] = D;
+      }
+      function q(t, D) {
+        t.pending_buf[t.pending++] = D >>> 8 & 255, t.pending_buf[t.pending++] = 255 & D;
+      }
+      function X(t, D) {
+        var R, y, p = t.max_chain_length, C = t.strstart, U = t.prev_length, Z = t.nice_match, A = t.strstart > t.w_size - j ? t.strstart - (t.w_size - j) : 0, H = t.window, J = t.w_mask, G = t.prev, V = t.strstart + W, it = H[C + U - 1], rt = H[C + U];
+        t.prev_length >= t.good_match && (p >>= 2), Z > t.lookahead && (Z = t.lookahead);
+        do
+          if (H[(R = D) + U] === rt && H[R + U - 1] === it && H[R] === H[C] && H[++R] === H[C + 1]) {
+            C += 2, R++;
+            do
+              ;
+            while (H[++C] === H[++R] && H[++C] === H[++R] && H[++C] === H[++R] && H[++C] === H[++R] && H[++C] === H[++R] && H[++C] === H[++R] && H[++C] === H[++R] && H[++C] === H[++R] && C < V);
+            if (y = W - (V - C), C = V - W, U < y) {
+              if (t.match_start = D, Z <= (U = y))
+                break;
+              it = H[C + U - 1], rt = H[C + U];
+            }
+          }
+        while ((D = G[D & J]) > A && --p != 0);
+        return U <= t.lookahead ? U : t.lookahead;
+      }
+      function st(t) {
+        var D, R, y, p, C, U, Z, A, H, J, G = t.w_size;
+        do {
+          if (p = t.window_size - t.lookahead - t.strstart, t.strstart >= G + (G - j)) {
+            for (o.arraySet(t.window, t.window, G, G, 0), t.match_start -= G, t.strstart -= G, t.block_start -= G, D = R = t.hash_size; y = t.head[--D], t.head[D] = G <= y ? y - G : 0, --R; )
+              ;
+            for (D = R = G; y = t.prev[--D], t.prev[D] = G <= y ? y - G : 0, --R; )
+              ;
+            p += G;
+          }
+          if (t.strm.avail_in === 0)
+            break;
+          if (U = t.strm, Z = t.window, A = t.strstart + t.lookahead, H = p, J = void 0, J = U.avail_in, H < J && (J = H), R = J === 0 ? 0 : (U.avail_in -= J, o.arraySet(Z, U.input, U.next_in, J, A), U.state.wrap === 1 ? U.adler = a(U.adler, Z, J, A) : U.state.wrap === 2 && (U.adler = d(U.adler, Z, J, A)), U.next_in += J, U.total_in += J, J), t.lookahead += R, t.lookahead + t.insert >= z)
+            for (C = t.strstart - t.insert, t.ins_h = t.window[C], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[C + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[C + z - 1]) & t.hash_mask, t.prev[C & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = C, C++, t.insert--, !(t.lookahead + t.insert < z)); )
+              ;
+        } while (t.lookahead < j && t.strm.avail_in !== 0);
+      }
+      function ct(t, D) {
+        for (var R, y; ; ) {
+          if (t.lookahead < j) {
+            if (st(t), t.lookahead < j && D === _)
+              return r;
+            if (t.lookahead === 0)
+              break;
+          }
+          if (R = 0, t.lookahead >= z && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + z - 1]) & t.hash_mask, R = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), R !== 0 && t.strstart - R <= t.w_size - j && (t.match_length = X(t, R)), t.match_length >= z)
+            if (y = e._tr_tally(t, t.strstart - t.match_start, t.match_length - z), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= z) {
+              for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + z - 1]) & t.hash_mask, R = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart, --t.match_length != 0; )
+                ;
+              t.strstart++;
+            } else
+              t.strstart += t.match_length, t.match_length = 0, t.ins_h = t.window[t.strstart], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + 1]) & t.hash_mask;
+          else
+            y = e._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++;
+          if (y && (B(t, !1), t.strm.avail_out === 0))
+            return r;
+        }
+        return t.insert = t.strstart < z - 1 ? t.strstart : z - 1, D === v ? (B(t, !0), t.strm.avail_out === 0 ? Q : $) : t.last_lit && (B(t, !1), t.strm.avail_out === 0) ? r : N;
+      }
+      function et(t, D) {
+        for (var R, y, p; ; ) {
+          if (t.lookahead < j) {
+            if (st(t), t.lookahead < j && D === _)
+              return r;
+            if (t.lookahead === 0)
+              break;
+          }
+          if (R = 0, t.lookahead >= z && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + z - 1]) & t.hash_mask, R = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), t.prev_length = t.match_length, t.prev_match = t.match_start, t.match_length = z - 1, R !== 0 && t.prev_length < t.max_lazy_match && t.strstart - R <= t.w_size - j && (t.match_length = X(t, R), t.match_length <= 5 && (t.strategy === 1 || t.match_length === z && 4096 < t.strstart - t.match_start) && (t.match_length = z - 1)), t.prev_length >= z && t.match_length <= t.prev_length) {
+            for (p = t.strstart + t.lookahead - z, y = e._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - z), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= p && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + z - 1]) & t.hash_mask, R = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), --t.prev_length != 0; )
+              ;
+            if (t.match_available = 0, t.match_length = z - 1, t.strstart++, y && (B(t, !1), t.strm.avail_out === 0))
+              return r;
+          } else if (t.match_available) {
+            if ((y = e._tr_tally(t, 0, t.window[t.strstart - 1])) && B(t, !1), t.strstart++, t.lookahead--, t.strm.avail_out === 0)
+              return r;
+          } else
+            t.match_available = 1, t.strstart++, t.lookahead--;
+        }
+        return t.match_available && (y = e._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < z - 1 ? t.strstart : z - 1, D === v ? (B(t, !0), t.strm.avail_out === 0 ? Q : $) : t.last_lit && (B(t, !1), t.strm.avail_out === 0) ? r : N;
+      }
+      function nt(t, D, R, y, p) {
+        this.good_length = t, this.max_lazy = D, this.nice_length = R, this.max_chain = y, this.func = p;
+      }
+      function ht() {
+        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 = u, 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 o.Buf16(2 * T), this.dyn_dtree = new o.Buf16(2 * (2 * x + 1)), this.bl_tree = new o.Buf16(2 * (2 * O + 1)), K(this.dyn_ltree), K(this.dyn_dtree), K(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new o.Buf16(M + 1), this.heap = new o.Buf16(2 * k + 1), K(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new o.Buf16(2 * k + 1), K(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 ot(t) {
+        var D;
+        return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = h, (D = t.state).pending = 0, D.pending_out = 0, D.wrap < 0 && (D.wrap = -D.wrap), D.status = D.wrap ? b : F, t.adler = D.wrap === 2 ? 0 : 1, D.last_flush = _, e._tr_init(D), s) : Y(t, m);
+      }
+      function mt(t) {
+        var D = ot(t);
+        return D === s && function(R) {
+          R.window_size = 2 * R.w_size, K(R.head), R.max_lazy_match = l[R.level].max_lazy, R.good_match = l[R.level].good_length, R.nice_match = l[R.level].nice_length, R.max_chain_length = l[R.level].max_chain, R.strstart = 0, R.block_start = 0, R.lookahead = 0, R.insert = 0, R.match_length = R.prev_length = z - 1, R.match_available = 0, R.ins_h = 0;
+        }(t.state), D;
+      }
+      function pt(t, D, R, y, p, C) {
+        if (!t)
+          return m;
+        var U = 1;
+        if (D === i && (D = 6), y < 0 ? (U = 0, y = -y) : 15 < y && (U = 2, y -= 16), p < 1 || w < p || R !== u || y < 8 || 15 < y || D < 0 || 9 < D || C < 0 || f < C)
+          return Y(t, m);
+        y === 8 && (y = 9);
+        var Z = new ht();
+        return (t.state = Z).strm = t, Z.wrap = U, Z.gzhead = null, Z.w_bits = y, Z.w_size = 1 << Z.w_bits, Z.w_mask = Z.w_size - 1, Z.hash_bits = p + 7, Z.hash_size = 1 << Z.hash_bits, Z.hash_mask = Z.hash_size - 1, Z.hash_shift = ~~((Z.hash_bits + z - 1) / z), Z.window = new o.Buf8(2 * Z.w_size), Z.head = new o.Buf16(Z.hash_size), Z.prev = new o.Buf16(Z.w_size), Z.lit_bufsize = 1 << p + 6, Z.pending_buf_size = 4 * Z.lit_bufsize, Z.pending_buf = new o.Buf8(Z.pending_buf_size), Z.d_buf = 1 * Z.lit_bufsize, Z.l_buf = 3 * Z.lit_bufsize, Z.level = D, Z.strategy = C, Z.method = R, mt(t);
+      }
+      l = [new nt(0, 0, 0, 0, function(t, D) {
+        var R = 65535;
+        for (R > t.pending_buf_size - 5 && (R = t.pending_buf_size - 5); ; ) {
+          if (t.lookahead <= 1) {
+            if (st(t), t.lookahead === 0 && D === _)
+              return r;
+            if (t.lookahead === 0)
+              break;
+          }
+          t.strstart += t.lookahead, t.lookahead = 0;
+          var y = t.block_start + R;
+          if ((t.strstart === 0 || t.strstart >= y) && (t.lookahead = t.strstart - y, t.strstart = y, B(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - j && (B(t, !1), t.strm.avail_out === 0))
+            return r;
+        }
+        return t.insert = 0, D === v ? (B(t, !0), t.strm.avail_out === 0 ? Q : $) : (t.strstart > t.block_start && (B(t, !1), t.strm.avail_out), r);
+      }), new nt(4, 4, 8, 4, ct), new nt(4, 5, 16, 8, ct), new nt(4, 6, 32, 32, ct), new nt(4, 4, 16, 16, et), new nt(8, 16, 32, 32, et), new nt(8, 16, 128, 128, et), new nt(8, 32, 128, 256, et), new nt(32, 128, 258, 1024, et), new nt(32, 258, 258, 4096, et)], g.deflateInit = function(t, D) {
+        return pt(t, D, u, 15, 8, 0);
+      }, g.deflateInit2 = pt, g.deflateReset = mt, g.deflateResetKeep = ot, g.deflateSetHeader = function(t, D) {
+        return t && t.state ? t.state.wrap !== 2 ? m : (t.state.gzhead = D, s) : m;
+      }, g.deflate = function(t, D) {
+        var R, y, p, C;
+        if (!t || !t.state || 5 < D || D < 0)
+          return t ? Y(t, m) : m;
+        if (y = t.state, !t.output || !t.input && t.avail_in !== 0 || y.status === 666 && D !== v)
+          return Y(t, t.avail_out === 0 ? -5 : m);
+        if (y.strm = t, R = y.last_flush, y.last_flush = D, y.status === b)
+          if (y.wrap === 2)
+            t.adler = 0, tt(y, 31), tt(y, 139), tt(y, 8), y.gzhead ? (tt(y, (y.gzhead.text ? 1 : 0) + (y.gzhead.hcrc ? 2 : 0) + (y.gzhead.extra ? 4 : 0) + (y.gzhead.name ? 8 : 0) + (y.gzhead.comment ? 16 : 0)), tt(y, 255 & y.gzhead.time), tt(y, y.gzhead.time >> 8 & 255), tt(y, y.gzhead.time >> 16 & 255), tt(y, y.gzhead.time >> 24 & 255), tt(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), tt(y, 255 & y.gzhead.os), y.gzhead.extra && y.gzhead.extra.length && (tt(y, 255 & y.gzhead.extra.length), tt(y, y.gzhead.extra.length >> 8 & 255)), y.gzhead.hcrc && (t.adler = d(t.adler, y.pending_buf, y.pending, 0)), y.gzindex = 0, y.status = 69) : (tt(y, 0), tt(y, 0), tt(y, 0), tt(y, 0), tt(y, 0), tt(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), tt(y, 3), y.status = F);
+          else {
+            var U = u + (y.w_bits - 8 << 4) << 8;
+            U |= (2 <= y.strategy || y.level < 2 ? 0 : y.level < 6 ? 1 : y.level === 6 ? 2 : 3) << 6, y.strstart !== 0 && (U |= 32), U += 31 - U % 31, y.status = F, q(y, U), y.strstart !== 0 && (q(y, t.adler >>> 16), q(y, 65535 & t.adler)), t.adler = 1;
+          }
+        if (y.status === 69)
+          if (y.gzhead.extra) {
+            for (p = y.pending; y.gzindex < (65535 & y.gzhead.extra.length) && (y.pending !== y.pending_buf_size || (y.gzhead.hcrc && y.pending > p && (t.adler = d(t.adler, y.pending_buf, y.pending - p, p)), I(t), p = y.pending, y.pending !== y.pending_buf_size)); )
+              tt(y, 255 & y.gzhead.extra[y.gzindex]), y.gzindex++;
+            y.gzhead.hcrc && y.pending > p && (t.adler = d(t.adler, y.pending_buf, y.pending - p, p)), y.gzindex === y.gzhead.extra.length && (y.gzindex = 0, y.status = 73);
+          } else
+            y.status = 73;
+        if (y.status === 73)
+          if (y.gzhead.name) {
+            p = y.pending;
+            do {
+              if (y.pending === y.pending_buf_size && (y.gzhead.hcrc && y.pending > p && (t.adler = d(t.adler, y.pending_buf, y.pending - p, p)), I(t), p = y.pending, y.pending === y.pending_buf_size)) {
+                C = 1;
+                break;
+              }
+              C = y.gzindex < y.gzhead.name.length ? 255 & y.gzhead.name.charCodeAt(y.gzindex++) : 0, tt(y, C);
+            } while (C !== 0);
+            y.gzhead.hcrc && y.pending > p && (t.adler = d(t.adler, y.pending_buf, y.pending - p, p)), C === 0 && (y.gzindex = 0, y.status = 91);
+          } else
+            y.status = 91;
+        if (y.status === 91)
+          if (y.gzhead.comment) {
+            p = y.pending;
+            do {
+              if (y.pending === y.pending_buf_size && (y.gzhead.hcrc && y.pending > p && (t.adler = d(t.adler, y.pending_buf, y.pending - p, p)), I(t), p = y.pending, y.pending === y.pending_buf_size)) {
+                C = 1;
+                break;
+              }
+              C = y.gzindex < y.gzhead.comment.length ? 255 & y.gzhead.comment.charCodeAt(y.gzindex++) : 0, tt(y, C);
+            } while (C !== 0);
+            y.gzhead.hcrc && y.pending > p && (t.adler = d(t.adler, y.pending_buf, y.pending - p, p)), C === 0 && (y.status = 103);
+          } else
+            y.status = 103;
+        if (y.status === 103 && (y.gzhead.hcrc ? (y.pending + 2 > y.pending_buf_size && I(t), y.pending + 2 <= y.pending_buf_size && (tt(y, 255 & t.adler), tt(y, t.adler >> 8 & 255), t.adler = 0, y.status = F)) : y.status = F), y.pending !== 0) {
+          if (I(t), t.avail_out === 0)
+            return y.last_flush = -1, s;
+        } else if (t.avail_in === 0 && L(D) <= L(R) && D !== v)
+          return Y(t, -5);
+        if (y.status === 666 && t.avail_in !== 0)
+          return Y(t, -5);
+        if (t.avail_in !== 0 || y.lookahead !== 0 || D !== _ && y.status !== 666) {
+          var Z = y.strategy === 2 ? function(A, H) {
+            for (var J; ; ) {
+              if (A.lookahead === 0 && (st(A), A.lookahead === 0)) {
+                if (H === _)
+                  return r;
+                break;
+              }
+              if (A.match_length = 0, J = e._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++, J && (B(A, !1), A.strm.avail_out === 0))
+                return r;
+            }
+            return A.insert = 0, H === v ? (B(A, !0), A.strm.avail_out === 0 ? Q : $) : A.last_lit && (B(A, !1), A.strm.avail_out === 0) ? r : N;
+          }(y, D) : y.strategy === 3 ? function(A, H) {
+            for (var J, G, V, it, rt = A.window; ; ) {
+              if (A.lookahead <= W) {
+                if (st(A), A.lookahead <= W && H === _)
+                  return r;
+                if (A.lookahead === 0)
+                  break;
+              }
+              if (A.match_length = 0, A.lookahead >= z && 0 < A.strstart && (G = rt[V = A.strstart - 1]) === rt[++V] && G === rt[++V] && G === rt[++V]) {
+                it = A.strstart + W;
+                do
+                  ;
+                while (G === rt[++V] && G === rt[++V] && G === rt[++V] && G === rt[++V] && G === rt[++V] && G === rt[++V] && G === rt[++V] && G === rt[++V] && V < it);
+                A.match_length = W - (it - V), A.match_length > A.lookahead && (A.match_length = A.lookahead);
+              }
+              if (A.match_length >= z ? (J = e._tr_tally(A, 1, A.match_length - z), A.lookahead -= A.match_length, A.strstart += A.match_length, A.match_length = 0) : (J = e._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++), J && (B(A, !1), A.strm.avail_out === 0))
+                return r;
+            }
+            return A.insert = 0, H === v ? (B(A, !0), A.strm.avail_out === 0 ? Q : $) : A.last_lit && (B(A, !1), A.strm.avail_out === 0) ? r : N;
+          }(y, D) : l[y.level].func(y, D);
+          if (Z !== Q && Z !== $ || (y.status = 666), Z === r || Z === Q)
+            return t.avail_out === 0 && (y.last_flush = -1), s;
+          if (Z === N && (D === 1 ? e._tr_align(y) : D !== 5 && (e._tr_stored_block(y, 0, 0, !1), D === 3 && (K(y.head), y.lookahead === 0 && (y.strstart = 0, y.block_start = 0, y.insert = 0))), I(t), t.avail_out === 0))
+            return y.last_flush = -1, s;
+        }
+        return D !== v ? s : y.wrap <= 0 ? 1 : (y.wrap === 2 ? (tt(y, 255 & t.adler), tt(y, t.adler >> 8 & 255), tt(y, t.adler >> 16 & 255), tt(y, t.adler >> 24 & 255), tt(y, 255 & t.total_in), tt(y, t.total_in >> 8 & 255), tt(y, t.total_in >> 16 & 255), tt(y, t.total_in >> 24 & 255)) : (q(y, t.adler >>> 16), q(y, 65535 & t.adler)), I(t), 0 < y.wrap && (y.wrap = -y.wrap), y.pending !== 0 ? s : 1);
+      }, g.deflateEnd = function(t) {
+        var D;
+        return t && t.state ? (D = t.state.status) !== b && D !== 69 && D !== 73 && D !== 91 && D !== 103 && D !== F && D !== 666 ? Y(t, m) : (t.state = null, D === F ? Y(t, -3) : s) : m;
+      }, g.deflateSetDictionary = function(t, D) {
+        var R, y, p, C, U, Z, A, H, J = D.length;
+        if (!t || !t.state || (C = (R = t.state).wrap) === 2 || C === 1 && R.status !== b || R.lookahead)
+          return m;
+        for (C === 1 && (t.adler = a(t.adler, D, J, 0)), R.wrap = 0, J >= R.w_size && (C === 0 && (K(R.head), R.strstart = 0, R.block_start = 0, R.insert = 0), H = new o.Buf8(R.w_size), o.arraySet(H, D, J - R.w_size, R.w_size, 0), D = H, J = R.w_size), U = t.avail_in, Z = t.next_in, A = t.input, t.avail_in = J, t.next_in = 0, t.input = D, st(R); R.lookahead >= z; ) {
+          for (y = R.strstart, p = R.lookahead - (z - 1); R.ins_h = (R.ins_h << R.hash_shift ^ R.window[y + z - 1]) & R.hash_mask, R.prev[y & R.w_mask] = R.head[R.ins_h], R.head[R.ins_h] = y, y++, --p; )
+            ;
+          R.strstart = y, R.lookahead = z - 1, st(R);
+        }
+        return R.strstart += R.lookahead, R.block_start = R.strstart, R.insert = R.lookahead, R.lookahead = 0, R.match_length = R.prev_length = z - 1, R.match_available = 0, t.next_in = Z, t.input = A, t.avail_in = U, R.wrap = C, s;
+      }, g.deflateInfo = "pako deflate (from Nodeca project)";
+    }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(n, S, g) {
+      S.exports = function() {
+        this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1;
+      };
+    }, {}], 48: [function(n, S, g) {
+      S.exports = function(l, o) {
+        var e, a, d, c, _, v, s, m, i, f, h, u, w, k, x, O, T, M, z, W, j, b, F, r, N;
+        e = l.state, a = l.next_in, r = l.input, d = a + (l.avail_in - 5), c = l.next_out, N = l.output, _ = c - (o - l.avail_out), v = c + (l.avail_out - 257), s = e.dmax, m = e.wsize, i = e.whave, f = e.wnext, h = e.window, u = e.hold, w = e.bits, k = e.lencode, x = e.distcode, O = (1 << e.lenbits) - 1, T = (1 << e.distbits) - 1;
+        t:
+          do {
+            w < 15 && (u += r[a++] << w, w += 8, u += r[a++] << w, w += 8), M = k[u & O];
+            e:
+              for (; ; ) {
+                if (u >>>= z = M >>> 24, w -= z, (z = M >>> 16 & 255) === 0)
+                  N[c++] = 65535 & M;
+                else {
+                  if (!(16 & z)) {
+                    if (!(64 & z)) {
+                      M = k[(65535 & M) + (u & (1 << z) - 1)];
+                      continue e;
+                    }
+                    if (32 & z) {
+                      e.mode = 12;
+                      break t;
+                    }
+                    l.msg = "invalid literal/length code", e.mode = 30;
+                    break t;
+                  }
+                  W = 65535 & M, (z &= 15) && (w < z && (u += r[a++] << w, w += 8), W += u & (1 << z) - 1, u >>>= z, w -= z), w < 15 && (u += r[a++] << w, w += 8, u += r[a++] << w, w += 8), M = x[u & T];
+                  r:
+                    for (; ; ) {
+                      if (u >>>= z = M >>> 24, w -= z, !(16 & (z = M >>> 16 & 255))) {
+                        if (!(64 & z)) {
+                          M = x[(65535 & M) + (u & (1 << z) - 1)];
+                          continue r;
+                        }
+                        l.msg = "invalid distance code", e.mode = 30;
+                        break t;
+                      }
+                      if (j = 65535 & M, w < (z &= 15) && (u += r[a++] << w, (w += 8) < z && (u += r[a++] << w, w += 8)), s < (j += u & (1 << z) - 1)) {
+                        l.msg = "invalid distance too far back", e.mode = 30;
+                        break t;
+                      }
+                      if (u >>>= z, w -= z, (z = c - _) < j) {
+                        if (i < (z = j - z) && e.sane) {
+                          l.msg = "invalid distance too far back", e.mode = 30;
+                          break t;
+                        }
+                        if (F = h, (b = 0) === f) {
+                          if (b += m - z, z < W) {
+                            for (W -= z; N[c++] = h[b++], --z; )
+                              ;
+                            b = c - j, F = N;
+                          }
+                        } else if (f < z) {
+                          if (b += m + f - z, (z -= f) < W) {
+                            for (W -= z; N[c++] = h[b++], --z; )
+                              ;
+                            if (b = 0, f < W) {
+                              for (W -= z = f; N[c++] = h[b++], --z; )
+                                ;
+                              b = c - j, F = N;
+                            }
+                          }
+                        } else if (b += f - z, z < W) {
+                          for (W -= z; N[c++] = h[b++], --z; )
+                            ;
+                          b = c - j, F = N;
+                        }
+                        for (; 2 < W; )
+                          N[c++] = F[b++], N[c++] = F[b++], N[c++] = F[b++], W -= 3;
+                        W && (N[c++] = F[b++], 1 < W && (N[c++] = F[b++]));
+                      } else {
+                        for (b = c - j; N[c++] = N[b++], N[c++] = N[b++], N[c++] = N[b++], 2 < (W -= 3); )
+                          ;
+                        W && (N[c++] = N[b++], 1 < W && (N[c++] = N[b++]));
+                      }
+                      break;
+                    }
+                }
+                break;
+              }
+          } while (a < d && c < v);
+        a -= W = w >> 3, u &= (1 << (w -= W << 3)) - 1, l.next_in = a, l.next_out = c, l.avail_in = a < d ? d - a + 5 : 5 - (a - d), l.avail_out = c < v ? v - c + 257 : 257 - (c - v), e.hold = u, e.bits = w;
+      };
+    }, {}], 49: [function(n, S, g) {
+      var l = n("../utils/common"), o = n("./adler32"), e = n("./crc32"), a = n("./inffast"), d = n("./inftrees"), c = 1, _ = 2, v = 0, s = -2, m = 1, i = 852, f = 592;
+      function h(b) {
+        return (b >>> 24 & 255) + (b >>> 8 & 65280) + ((65280 & b) << 8) + ((255 & b) << 24);
+      }
+      function u() {
+        this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new l.Buf16(320), this.work = new l.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
+      }
+      function w(b) {
+        var F;
+        return b && b.state ? (F = b.state, b.total_in = b.total_out = F.total = 0, b.msg = "", F.wrap && (b.adler = 1 & F.wrap), F.mode = m, F.last = 0, F.havedict = 0, F.dmax = 32768, F.head = null, F.hold = 0, F.bits = 0, F.lencode = F.lendyn = new l.Buf32(i), F.distcode = F.distdyn = new l.Buf32(f), F.sane = 1, F.back = -1, v) : s;
+      }
+      function k(b) {
+        var F;
+        return b && b.state ? ((F = b.state).wsize = 0, F.whave = 0, F.wnext = 0, w(b)) : s;
+      }
+      function x(b, F) {
+        var r, N;
+        return b && b.state ? (N = b.state, F < 0 ? (r = 0, F = -F) : (r = 1 + (F >> 4), F < 48 && (F &= 15)), F && (F < 8 || 15 < F) ? s : (N.window !== null && N.wbits !== F && (N.window = null), N.wrap = r, N.wbits = F, k(b))) : s;
+      }
+      function O(b, F) {
+        var r, N;
+        return b ? (N = new u(), (b.state = N).window = null, (r = x(b, F)) !== v && (b.state = null), r) : s;
+      }
+      var T, M, z = !0;
+      function W(b) {
+        if (z) {
+          var F;
+          for (T = new l.Buf32(512), M = new l.Buf32(32), F = 0; F < 144; )
+            b.lens[F++] = 8;
+          for (; F < 256; )
+            b.lens[F++] = 9;
+          for (; F < 280; )
+            b.lens[F++] = 7;
+          for (; F < 288; )
+            b.lens[F++] = 8;
+          for (d(c, b.lens, 0, 288, T, 0, b.work, { bits: 9 }), F = 0; F < 32; )
+            b.lens[F++] = 5;
+          d(_, b.lens, 0, 32, M, 0, b.work, { bits: 5 }), z = !1;
+        }
+        b.lencode = T, b.lenbits = 9, b.distcode = M, b.distbits = 5;
+      }
+      function j(b, F, r, N) {
+        var Q, $ = b.state;
+        return $.window === null && ($.wsize = 1 << $.wbits, $.wnext = 0, $.whave = 0, $.window = new l.Buf8($.wsize)), N >= $.wsize ? (l.arraySet($.window, F, r - $.wsize, $.wsize, 0), $.wnext = 0, $.whave = $.wsize) : (N < (Q = $.wsize - $.wnext) && (Q = N), l.arraySet($.window, F, r - N, Q, $.wnext), (N -= Q) ? (l.arraySet($.window, F, r - N, N, 0), $.wnext = N, $.whave = $.wsize) : ($.wnext += Q, $.wnext === $.wsize && ($.wnext = 0), $.whave < $.wsize && ($.whave += Q))), 0;
+      }
+      g.inflateReset = k, g.inflateReset2 = x, g.inflateResetKeep = w, g.inflateInit = function(b) {
+        return O(b, 15);
+      }, g.inflateInit2 = O, g.inflate = function(b, F) {
+        var r, N, Q, $, Y, L, K, I, B, tt, q, X, st, ct, et, nt, ht, ot, mt, pt, t, D, R, y, p = 0, C = new l.Buf8(4), U = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+        if (!b || !b.state || !b.output || !b.input && b.avail_in !== 0)
+          return s;
+        (r = b.state).mode === 12 && (r.mode = 13), Y = b.next_out, Q = b.output, K = b.avail_out, $ = b.next_in, N = b.input, L = b.avail_in, I = r.hold, B = r.bits, tt = L, q = K, D = v;
+        t:
+          for (; ; )
+            switch (r.mode) {
+              case m:
+                if (r.wrap === 0) {
+                  r.mode = 13;
+                  break;
+                }
+                for (; B < 16; ) {
+                  if (L === 0)
+                    break t;
+                  L--, I += N[$++] << B, B += 8;
+                }
+                if (2 & r.wrap && I === 35615) {
+                  C[r.check = 0] = 255 & I, C[1] = I >>> 8 & 255, r.check = e(r.check, C, 2, 0), B = I = 0, r.mode = 2;
+                  break;
+                }
+                if (r.flags = 0, r.head && (r.head.done = !1), !(1 & r.wrap) || (((255 & I) << 8) + (I >> 8)) % 31) {
+                  b.msg = "incorrect header check", r.mode = 30;
+                  break;
+                }
+                if ((15 & I) != 8) {
+                  b.msg = "unknown compression method", r.mode = 30;
+                  break;
+                }
+                if (B -= 4, t = 8 + (15 & (I >>>= 4)), r.wbits === 0)
+                  r.wbits = t;
+                else if (t > r.wbits) {
+                  b.msg = "invalid window size", r.mode = 30;
+                  break;
+                }
+                r.dmax = 1 << t, b.adler = r.check = 1, r.mode = 512 & I ? 10 : 12, B = I = 0;
+                break;
+              case 2:
+                for (; B < 16; ) {
+                  if (L === 0)
+                    break t;
+                  L--, I += N[$++] << B, B += 8;
+                }
+                if (r.flags = I, (255 & r.flags) != 8) {
+                  b.msg = "unknown compression method", r.mode = 30;
+                  break;
+                }
+                if (57344 & r.flags) {
+                  b.msg = "unknown header flags set", r.mode = 30;
+                  break;
+                }
+                r.head && (r.head.text = I >> 8 & 1), 512 & r.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, r.check = e(r.check, C, 2, 0)), B = I = 0, r.mode = 3;
+              case 3:
+                for (; B < 32; ) {
+                  if (L === 0)
+                    break t;
+                  L--, I += N[$++] << B, B += 8;
+                }
+                r.head && (r.head.time = I), 512 & r.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, C[2] = I >>> 16 & 255, C[3] = I >>> 24 & 255, r.check = e(r.check, C, 4, 0)), B = I = 0, r.mode = 4;
+              case 4:
+                for (; B < 16; ) {
+                  if (L === 0)
+                    break t;
+                  L--, I += N[$++] << B, B += 8;
+                }
+                r.head && (r.head.xflags = 255 & I, r.head.os = I >> 8), 512 & r.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, r.check = e(r.check, C, 2, 0)), B = I = 0, r.mode = 5;
+              case 5:
+                if (1024 & r.flags) {
+                  for (; B < 16; ) {
+                    if (L === 0)
+                      break t;
+                    L--, I += N[$++] << B, B += 8;
+                  }
+                  r.length = I, r.head && (r.head.extra_len = I), 512 & r.flags && (C[0] = 255 & I, C[1] = I >>> 8 & 255, r.check = e(r.check, C, 2, 0)), B = I = 0;
+                } else
+                  r.head && (r.head.extra = null);
+                r.mode = 6;
+              case 6:
+                if (1024 & r.flags && (L < (X = r.length) && (X = L), X && (r.head && (t = r.head.extra_len - r.length, r.head.extra || (r.head.extra = new Array(r.head.extra_len)), l.arraySet(r.head.extra, N, $, X, t)), 512 & r.flags && (r.check = e(r.check, N, X, $)), L -= X, $ += X, r.length -= X), r.length))
+                  break t;
+                r.length = 0, r.mode = 7;
+              case 7:
+                if (2048 & r.flags) {
+                  if (L === 0)
+                    break t;
+                  for (X = 0; t = N[$ + X++], r.head && t && r.length < 65536 && (r.head.name += String.fromCharCode(t)), t && X < L; )
+                    ;
+                  if (512 & r.flags && (r.check = e(r.check, N, X, $)), L -= X, $ += X, t)
+                    break t;
+                } else
+                  r.head && (r.head.name = null);
+                r.length = 0, r.mode = 8;
+              case 8:
+                if (4096 & r.flags) {
+                  if (L === 0)
+                    break t;
+                  for (X = 0; t = N[$ + X++], r.head && t && r.length < 65536 && (r.head.comment += String.fromCharCode(t)), t && X < L; )
+                    ;
+                  if (512 & r.flags && (r.check = e(r.check, N, X, $)), L -= X, $ += X, t)
+                    break t;
+                } else
+                  r.head && (r.head.comment = null);
+                r.mode = 9;
+              case 9:
+                if (512 & r.flags) {
+                  for (; B < 16; ) {
+                    if (L === 0)
+                      break t;
+                    L--, I += N[$++] << B, B += 8;
+                  }
+                  if (I !== (65535 & r.check)) {
+                    b.msg = "header crc mismatch", r.mode = 30;
+                    break;
+                  }
+                  B = I = 0;
+                }
+                r.head && (r.head.hcrc = r.flags >> 9 & 1, r.head.done = !0), b.adler = r.check = 0, r.mode = 12;
+                break;
+              case 10:
+                for (; B < 32; ) {
+                  if (L === 0)
+                    break t;
+                  L--, I += N[$++] << B, B += 8;
+                }
+                b.adler = r.check = h(I), B = I = 0, r.mode = 11;
+              case 11:
+                if (r.havedict === 0)
+                  return b.next_out = Y, b.avail_out = K, b.next_in = $, b.avail_in = L, r.hold = I, r.bits = B, 2;
+                b.adler = r.check = 1, r.mode = 12;
+              case 12:
+                if (F === 5 || F === 6)
+                  break t;
+              case 13:
+                if (r.last) {
+                  I >>>= 7 & B, B -= 7 & B, r.mode = 27;
+                  break;
+                }
+                for (; B < 3; ) {
+                  if (L === 0)
+                    break t;
+                  L--, I += N[$++] << B, B += 8;
+                }
+                switch (r.last = 1 & I, B -= 1, 3 & (I >>>= 1)) {
+                  case 0:
+                    r.mode = 14;
+                    break;
+                  case 1:
+                    if (W(r), r.mode = 20, F !== 6)
+                      break;
+                    I >>>= 2, B -= 2;
+                    break t;
+                  case 2:
+                    r.mode = 17;
+                    break;
+                  case 3:
+                    b.msg = "invalid block type", r.mode = 30;
+                }
+                I >>>= 2, B -= 2;
+                break;
+              case 14:
+                for (I >>>= 7 & B, B -= 7 & B; B < 32; ) {
+                  if (L === 0)
+                    break t;
+                  L--, I += N[$++] << B, B += 8;
+                }
+                if ((65535 & I) != (I >>> 16 ^ 65535)) {
+                  b.msg = "invalid stored block lengths", r.mode = 30;
+                  break;
+                }
+                if (r.length = 65535 & I, B = I = 0, r.mode = 15, F === 6)
+                  break t;
+              case 15:
+                r.mode = 16;
+              case 16:
+                if (X = r.length) {
+                  if (L < X && (X = L), K < X && (X = K), X === 0)
+                    break t;
+                  l.arraySet(Q, N, $, X, Y), L -= X, $ += X, K -= X, Y += X, r.length -= X;
+                  break;
+                }
+                r.mode = 12;
+                break;
+              case 17:
+                for (; B < 14; ) {
+                  if (L === 0)
+                    break t;
+                  L--, I += N[$++] << B, B += 8;
+                }
+                if (r.nlen = 257 + (31 & I), I >>>= 5, B -= 5, r.ndist = 1 + (31 & I), I >>>= 5, B -= 5, r.ncode = 4 + (15 & I), I >>>= 4, B -= 4, 286 < r.nlen || 30 < r.ndist) {
+                  b.msg = "too many length or distance symbols", r.mode = 30;
+                  break;
+                }
+                r.have = 0, r.mode = 18;
+              case 18:
+                for (; r.have < r.ncode; ) {
+                  for (; B < 3; ) {
+                    if (L === 0)
+                      break t;
+                    L--, I += N[$++] << B, B += 8;
+                  }
+                  r.lens[U[r.have++]] = 7 & I, I >>>= 3, B -= 3;
+                }
+                for (; r.have < 19; )
+                  r.lens[U[r.have++]] = 0;
+                if (r.lencode = r.lendyn, r.lenbits = 7, R = { bits: r.lenbits }, D = d(0, r.lens, 0, 19, r.lencode, 0, r.work, R), r.lenbits = R.bits, D) {
+                  b.msg = "invalid code lengths set", r.mode = 30;
+                  break;
+                }
+                r.have = 0, r.mode = 19;
+              case 19:
+                for (; r.have < r.nlen + r.ndist; ) {
+                  for (; nt = (p = r.lencode[I & (1 << r.lenbits) - 1]) >>> 16 & 255, ht = 65535 & p, !((et = p >>> 24) <= B); ) {
+                    if (L === 0)
+                      break t;
+                    L--, I += N[$++] << B, B += 8;
+                  }
+                  if (ht < 16)
+                    I >>>= et, B -= et, r.lens[r.have++] = ht;
+                  else {
+                    if (ht === 16) {
+                      for (y = et + 2; B < y; ) {
+                        if (L === 0)
+                          break t;
+                        L--, I += N[$++] << B, B += 8;
+                      }
+                      if (I >>>= et, B -= et, r.have === 0) {
+                        b.msg = "invalid bit length repeat", r.mode = 30;
+                        break;
+                      }
+                      t = r.lens[r.have - 1], X = 3 + (3 & I), I >>>= 2, B -= 2;
+                    } else if (ht === 17) {
+                      for (y = et + 3; B < y; ) {
+                        if (L === 0)
+                          break t;
+                        L--, I += N[$++] << B, B += 8;
+                      }
+                      B -= et, t = 0, X = 3 + (7 & (I >>>= et)), I >>>= 3, B -= 3;
+                    } else {
+                      for (y = et + 7; B < y; ) {
+                        if (L === 0)
+                          break t;
+                        L--, I += N[$++] << B, B += 8;
+                      }
+                      B -= et, t = 0, X = 11 + (127 & (I >>>= et)), I >>>= 7, B -= 7;
+                    }
+                    if (r.have + X > r.nlen + r.ndist) {
+                      b.msg = "invalid bit length repeat", r.mode = 30;
+                      break;
+                    }
+                    for (; X--; )
+                      r.lens[r.have++] = t;
+                  }
+                }
+                if (r.mode === 30)
+                  break;
+                if (r.lens[256] === 0) {
+                  b.msg = "invalid code -- missing end-of-block", r.mode = 30;
+                  break;
+                }
+                if (r.lenbits = 9, R = { bits: r.lenbits }, D = d(c, r.lens, 0, r.nlen, r.lencode, 0, r.work, R), r.lenbits = R.bits, D) {
+                  b.msg = "invalid literal/lengths set", r.mode = 30;
+                  break;
+                }
+                if (r.distbits = 6, r.distcode = r.distdyn, R = { bits: r.distbits }, D = d(_, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, R), r.distbits = R.bits, D) {
+                  b.msg = "invalid distances set", r.mode = 30;
+                  break;
+                }
+                if (r.mode = 20, F === 6)
+                  break t;
+              case 20:
+                r.mode = 21;
+              case 21:
+                if (6 <= L && 258 <= K) {
+                  b.next_out = Y, b.avail_out = K, b.next_in = $, b.avail_in = L, r.hold = I, r.bits = B, a(b, q), Y = b.next_out, Q = b.output, K = b.avail_out, $ = b.next_in, N = b.input, L = b.avail_in, I = r.hold, B = r.bits, r.mode === 12 && (r.back = -1);
+                  break;
+                }
+                for (r.back = 0; nt = (p = r.lencode[I & (1 << r.lenbits) - 1]) >>> 16 & 255, ht = 65535 & p, !((et = p >>> 24) <= B); ) {
+                  if (L === 0)
+                    break t;
+                  L--, I += N[$++] << B, B += 8;
+                }
+                if (nt && !(240 & nt)) {
+                  for (ot = et, mt = nt, pt = ht; nt = (p = r.lencode[pt + ((I & (1 << ot + mt) - 1) >> ot)]) >>> 16 & 255, ht = 65535 & p, !(ot + (et = p >>> 24) <= B); ) {
+                    if (L === 0)
+                      break t;
+                    L--, I += N[$++] << B, B += 8;
+                  }
+                  I >>>= ot, B -= ot, r.back += ot;
+                }
+                if (I >>>= et, B -= et, r.back += et, r.length = ht, nt === 0) {
+                  r.mode = 26;
+                  break;
+                }
+                if (32 & nt) {
+                  r.back = -1, r.mode = 12;
+                  break;
+                }
+                if (64 & nt) {
+                  b.msg = "invalid literal/length code", r.mode = 30;
+                  break;
+                }
+                r.extra = 15 & nt, r.mode = 22;
+              case 22:
+                if (r.extra) {
+                  for (y = r.extra; B < y; ) {
+                    if (L === 0)
+                      break t;
+                    L--, I += N[$++] << B, B += 8;
+                  }
+                  r.length += I & (1 << r.extra) - 1, I >>>= r.extra, B -= r.extra, r.back += r.extra;
+                }
+                r.was = r.length, r.mode = 23;
+              case 23:
+                for (; nt = (p = r.distcode[I & (1 << r.distbits) - 1]) >>> 16 & 255, ht = 65535 & p, !((et = p >>> 24) <= B); ) {
+                  if (L === 0)
+                    break t;
+                  L--, I += N[$++] << B, B += 8;
+                }
+                if (!(240 & nt)) {
+                  for (ot = et, mt = nt, pt = ht; nt = (p = r.distcode[pt + ((I & (1 << ot + mt) - 1) >> ot)]) >>> 16 & 255, ht = 65535 & p, !(ot + (et = p >>> 24) <= B); ) {
+                    if (L === 0)
+                      break t;
+                    L--, I += N[$++] << B, B += 8;
+                  }
+                  I >>>= ot, B -= ot, r.back += ot;
+                }
+                if (I >>>= et, B -= et, r.back += et, 64 & nt) {
+                  b.msg = "invalid distance code", r.mode = 30;
+                  break;
+                }
+                r.offset = ht, r.extra = 15 & nt, r.mode = 24;
+              case 24:
+                if (r.extra) {
+                  for (y = r.extra; B < y; ) {
+                    if (L === 0)
+                      break t;
+                    L--, I += N[$++] << B, B += 8;
+                  }
+                  r.offset += I & (1 << r.extra) - 1, I >>>= r.extra, B -= r.extra, r.back += r.extra;
+                }
+                if (r.offset > r.dmax) {
+                  b.msg = "invalid distance too far back", r.mode = 30;
+                  break;
+                }
+                r.mode = 25;
+              case 25:
+                if (K === 0)
+                  break t;
+                if (X = q - K, r.offset > X) {
+                  if ((X = r.offset - X) > r.whave && r.sane) {
+                    b.msg = "invalid distance too far back", r.mode = 30;
+                    break;
+                  }
+                  st = X > r.wnext ? (X -= r.wnext, r.wsize - X) : r.wnext - X, X > r.length && (X = r.length), ct = r.window;
+                } else
+                  ct = Q, st = Y - r.offset, X = r.length;
+                for (K < X && (X = K), K -= X, r.length -= X; Q[Y++] = ct[st++], --X; )
+                  ;
+                r.length === 0 && (r.mode = 21);
+                break;
+              case 26:
+                if (K === 0)
+                  break t;
+                Q[Y++] = r.length, K--, r.mode = 21;
+                break;
+              case 27:
+                if (r.wrap) {
+                  for (; B < 32; ) {
+                    if (L === 0)
+                      break t;
+                    L--, I |= N[$++] << B, B += 8;
+                  }
+                  if (q -= K, b.total_out += q, r.total += q, q && (b.adler = r.check = r.flags ? e(r.check, Q, q, Y - q) : o(r.check, Q, q, Y - q)), q = K, (r.flags ? I : h(I)) !== r.check) {
+                    b.msg = "incorrect data check", r.mode = 30;
+                    break;
+                  }
+                  B = I = 0;
+                }
+                r.mode = 28;
+              case 28:
+                if (r.wrap && r.flags) {
+                  for (; B < 32; ) {
+                    if (L === 0)
+                      break t;
+                    L--, I += N[$++] << B, B += 8;
+                  }
+                  if (I !== (4294967295 & r.total)) {
+                    b.msg = "incorrect length check", r.mode = 30;
+                    break;
+                  }
+                  B = I = 0;
+                }
+                r.mode = 29;
+              case 29:
+                D = 1;
+                break t;
+              case 30:
+                D = -3;
+                break t;
+              case 31:
+                return -4;
+              case 32:
+              default:
+                return s;
+            }
+        return b.next_out = Y, b.avail_out = K, b.next_in = $, b.avail_in = L, r.hold = I, r.bits = B, (r.wsize || q !== b.avail_out && r.mode < 30 && (r.mode < 27 || F !== 4)) && j(b, b.output, b.next_out, q - b.avail_out) ? (r.mode = 31, -4) : (tt -= b.avail_in, q -= b.avail_out, b.total_in += tt, b.total_out += q, r.total += q, r.wrap && q && (b.adler = r.check = r.flags ? e(r.check, Q, q, b.next_out - q) : o(r.check, Q, q, b.next_out - q)), b.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === 12 ? 128 : 0) + (r.mode === 20 || r.mode === 15 ? 256 : 0), (tt == 0 && q === 0 || F === 4) && D === v && (D = -5), D);
+      }, g.inflateEnd = function(b) {
+        if (!b || !b.state)
+          return s;
+        var F = b.state;
+        return F.window && (F.window = null), b.state = null, v;
+      }, g.inflateGetHeader = function(b, F) {
+        var r;
+        return b && b.state && 2 & (r = b.state).wrap ? ((r.head = F).done = !1, v) : s;
+      }, g.inflateSetDictionary = function(b, F) {
+        var r, N = F.length;
+        return b && b.state ? (r = b.state).wrap !== 0 && r.mode !== 11 ? s : r.mode === 11 && o(1, F, N, 0) !== r.check ? -3 : j(b, F, N, N) ? (r.mode = 31, -4) : (r.havedict = 1, v) : s;
+      }, g.inflateInfo = "pako inflate (from Nodeca project)";
+    }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(n, S, g) {
+      var l = n("../utils/common"), o = [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], e = [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], d = [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];
+      S.exports = function(c, _, v, s, m, i, f, h) {
+        var u, w, k, x, O, T, M, z, W, j = h.bits, b = 0, F = 0, r = 0, N = 0, Q = 0, $ = 0, Y = 0, L = 0, K = 0, I = 0, B = null, tt = 0, q = new l.Buf16(16), X = new l.Buf16(16), st = null, ct = 0;
+        for (b = 0; b <= 15; b++)
+          q[b] = 0;
+        for (F = 0; F < s; F++)
+          q[_[v + F]]++;
+        for (Q = j, N = 15; 1 <= N && q[N] === 0; N--)
+          ;
+        if (N < Q && (Q = N), N === 0)
+          return m[i++] = 20971520, m[i++] = 20971520, h.bits = 1, 0;
+        for (r = 1; r < N && q[r] === 0; r++)
+          ;
+        for (Q < r && (Q = r), b = L = 1; b <= 15; b++)
+          if (L <<= 1, (L -= q[b]) < 0)
+            return -1;
+        if (0 < L && (c === 0 || N !== 1))
+          return -1;
+        for (X[1] = 0, b = 1; b < 15; b++)
+          X[b + 1] = X[b] + q[b];
+        for (F = 0; F < s; F++)
+          _[v + F] !== 0 && (f[X[_[v + F]]++] = F);
+        if (T = c === 0 ? (B = st = f, 19) : c === 1 ? (B = o, tt -= 257, st = e, ct -= 257, 256) : (B = a, st = d, -1), b = r, O = i, Y = F = I = 0, k = -1, x = (K = 1 << ($ = Q)) - 1, c === 1 && 852 < K || c === 2 && 592 < K)
+          return 1;
+        for (; ; ) {
+          for (M = b - Y, W = f[F] < T ? (z = 0, f[F]) : f[F] > T ? (z = st[ct + f[F]], B[tt + f[F]]) : (z = 96, 0), u = 1 << b - Y, r = w = 1 << $; m[O + (I >> Y) + (w -= u)] = M << 24 | z << 16 | W | 0, w !== 0; )
+            ;
+          for (u = 1 << b - 1; I & u; )
+            u >>= 1;
+          if (u !== 0 ? (I &= u - 1, I += u) : I = 0, F++, --q[b] == 0) {
+            if (b === N)
+              break;
+            b = _[v + f[F]];
+          }
+          if (Q < b && (I & x) !== k) {
+            for (Y === 0 && (Y = Q), O += r, L = 1 << ($ = b - Y); $ + Y < N && !((L -= q[$ + Y]) <= 0); )
+              $++, L <<= 1;
+            if (K += 1 << $, c === 1 && 852 < K || c === 2 && 592 < K)
+              return 1;
+            m[k = I & x] = Q << 24 | $ << 16 | O - i | 0;
+          }
+        }
+        return I !== 0 && (m[O + I] = b - Y << 24 | 64 << 16 | 0), h.bits = Q, 0;
+      };
+    }, { "../utils/common": 41 }], 51: [function(n, S, g) {
+      S.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" };
+    }, {}], 52: [function(n, S, g) {
+      var l = n("../utils/common"), o = 0, e = 1;
+      function a(p) {
+        for (var C = p.length; 0 <= --C; )
+          p[C] = 0;
+      }
+      var d = 0, c = 29, _ = 256, v = _ + 1 + c, s = 30, m = 19, i = 2 * v + 1, f = 15, h = 16, u = 7, w = 256, k = 16, x = 17, O = 18, T = [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], M = [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], z = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], W = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], j = new Array(2 * (v + 2));
+      a(j);
+      var b = new Array(2 * s);
+      a(b);
+      var F = new Array(512);
+      a(F);
+      var r = new Array(256);
+      a(r);
+      var N = new Array(c);
+      a(N);
+      var Q, $, Y, L = new Array(s);
+      function K(p, C, U, Z, A) {
+        this.static_tree = p, this.extra_bits = C, this.extra_base = U, this.elems = Z, this.max_length = A, this.has_stree = p && p.length;
+      }
+      function I(p, C) {
+        this.dyn_tree = p, this.max_code = 0, this.stat_desc = C;
+      }
+      function B(p) {
+        return p < 256 ? F[p] : F[256 + (p >>> 7)];
+      }
+      function tt(p, C) {
+        p.pending_buf[p.pending++] = 255 & C, p.pending_buf[p.pending++] = C >>> 8 & 255;
+      }
+      function q(p, C, U) {
+        p.bi_valid > h - U ? (p.bi_buf |= C << p.bi_valid & 65535, tt(p, p.bi_buf), p.bi_buf = C >> h - p.bi_valid, p.bi_valid += U - h) : (p.bi_buf |= C << p.bi_valid & 65535, p.bi_valid += U);
+      }
+      function X(p, C, U) {
+        q(p, U[2 * C], U[2 * C + 1]);
+      }
+      function st(p, C) {
+        for (var U = 0; U |= 1 & p, p >>>= 1, U <<= 1, 0 < --C; )
+          ;
+        return U >>> 1;
+      }
+      function ct(p, C, U) {
+        var Z, A, H = new Array(f + 1), J = 0;
+        for (Z = 1; Z <= f; Z++)
+          H[Z] = J = J + U[Z - 1] << 1;
+        for (A = 0; A <= C; A++) {
+          var G = p[2 * A + 1];
+          G !== 0 && (p[2 * A] = st(H[G]++, G));
+        }
+      }
+      function et(p) {
+        var C;
+        for (C = 0; C < v; C++)
+          p.dyn_ltree[2 * C] = 0;
+        for (C = 0; C < s; C++)
+          p.dyn_dtree[2 * C] = 0;
+        for (C = 0; C < m; C++)
+          p.bl_tree[2 * C] = 0;
+        p.dyn_ltree[2 * w] = 1, p.opt_len = p.static_len = 0, p.last_lit = p.matches = 0;
+      }
+      function nt(p) {
+        8 < p.bi_valid ? tt(p, p.bi_buf) : 0 < p.bi_valid && (p.pending_buf[p.pending++] = p.bi_buf), p.bi_buf = 0, p.bi_valid = 0;
+      }
+      function ht(p, C, U, Z) {
+        var A = 2 * C, H = 2 * U;
+        return p[A] < p[H] || p[A] === p[H] && Z[C] <= Z[U];
+      }
+      function ot(p, C, U) {
+        for (var Z = p.heap[U], A = U << 1; A <= p.heap_len && (A < p.heap_len && ht(C, p.heap[A + 1], p.heap[A], p.depth) && A++, !ht(C, Z, p.heap[A], p.depth)); )
+          p.heap[U] = p.heap[A], U = A, A <<= 1;
+        p.heap[U] = Z;
+      }
+      function mt(p, C, U) {
+        var Z, A, H, J, G = 0;
+        if (p.last_lit !== 0)
+          for (; Z = p.pending_buf[p.d_buf + 2 * G] << 8 | p.pending_buf[p.d_buf + 2 * G + 1], A = p.pending_buf[p.l_buf + G], G++, Z === 0 ? X(p, A, C) : (X(p, (H = r[A]) + _ + 1, C), (J = T[H]) !== 0 && q(p, A -= N[H], J), X(p, H = B(--Z), U), (J = M[H]) !== 0 && q(p, Z -= L[H], J)), G < p.last_lit; )
+            ;
+        X(p, w, C);
+      }
+      function pt(p, C) {
+        var U, Z, A, H = C.dyn_tree, J = C.stat_desc.static_tree, G = C.stat_desc.has_stree, V = C.stat_desc.elems, it = -1;
+        for (p.heap_len = 0, p.heap_max = i, U = 0; U < V; U++)
+          H[2 * U] !== 0 ? (p.heap[++p.heap_len] = it = U, p.depth[U] = 0) : H[2 * U + 1] = 0;
+        for (; p.heap_len < 2; )
+          H[2 * (A = p.heap[++p.heap_len] = it < 2 ? ++it : 0)] = 1, p.depth[A] = 0, p.opt_len--, G && (p.static_len -= J[2 * A + 1]);
+        for (C.max_code = it, U = p.heap_len >> 1; 1 <= U; U--)
+          ot(p, H, U);
+        for (A = V; U = p.heap[1], p.heap[1] = p.heap[p.heap_len--], ot(p, H, 1), Z = p.heap[1], p.heap[--p.heap_max] = U, p.heap[--p.heap_max] = Z, H[2 * A] = H[2 * U] + H[2 * Z], p.depth[A] = (p.depth[U] >= p.depth[Z] ? p.depth[U] : p.depth[Z]) + 1, H[2 * U + 1] = H[2 * Z + 1] = A, p.heap[1] = A++, ot(p, H, 1), 2 <= p.heap_len; )
+          ;
+        p.heap[--p.heap_max] = p.heap[1], function(rt, dt) {
+          var bt, gt, wt, lt, Et, Ot, _t = dt.dyn_tree, jt = dt.max_code, re = dt.stat_desc.static_tree, ne = dt.stat_desc.has_stree, ie = dt.stat_desc.extra_bits, Wt = dt.stat_desc.extra_base, yt = dt.stat_desc.max_length, Ct = 0;
+          for (lt = 0; lt <= f; lt++)
+            rt.bl_count[lt] = 0;
+          for (_t[2 * rt.heap[rt.heap_max] + 1] = 0, bt = rt.heap_max + 1; bt < i; bt++)
+            yt < (lt = _t[2 * _t[2 * (gt = rt.heap[bt]) + 1] + 1] + 1) && (lt = yt, Ct++), _t[2 * gt + 1] = lt, jt < gt || (rt.bl_count[lt]++, Et = 0, Wt <= gt && (Et = ie[gt - Wt]), Ot = _t[2 * gt], rt.opt_len += Ot * (lt + Et), ne && (rt.static_len += Ot * (re[2 * gt + 1] + Et)));
+          if (Ct !== 0) {
+            do {
+              for (lt = yt - 1; rt.bl_count[lt] === 0; )
+                lt--;
+              rt.bl_count[lt]--, rt.bl_count[lt + 1] += 2, rt.bl_count[yt]--, Ct -= 2;
+            } while (0 < Ct);
+            for (lt = yt; lt !== 0; lt--)
+              for (gt = rt.bl_count[lt]; gt !== 0; )
+                jt < (wt = rt.heap[--bt]) || (_t[2 * wt + 1] !== lt && (rt.opt_len += (lt - _t[2 * wt + 1]) * _t[2 * wt], _t[2 * wt + 1] = lt), gt--);
+          }
+        }(p, C), ct(H, it, p.bl_count);
+      }
+      function t(p, C, U) {
+        var Z, A, H = -1, J = C[1], G = 0, V = 7, it = 4;
+        for (J === 0 && (V = 138, it = 3), C[2 * (U + 1) + 1] = 65535, Z = 0; Z <= U; Z++)
+          A = J, J = C[2 * (Z + 1) + 1], ++G < V && A === J || (G < it ? p.bl_tree[2 * A] += G : A !== 0 ? (A !== H && p.bl_tree[2 * A]++, p.bl_tree[2 * k]++) : G <= 10 ? p.bl_tree[2 * x]++ : p.bl_tree[2 * O]++, H = A, it = (G = 0) === J ? (V = 138, 3) : A === J ? (V = 6, 3) : (V = 7, 4));
+      }
+      function D(p, C, U) {
+        var Z, A, H = -1, J = C[1], G = 0, V = 7, it = 4;
+        for (J === 0 && (V = 138, it = 3), Z = 0; Z <= U; Z++)
+          if (A = J, J = C[2 * (Z + 1) + 1], !(++G < V && A === J)) {
+            if (G < it)
+              for (; X(p, A, p.bl_tree), --G != 0; )
+                ;
+            else
+              A !== 0 ? (A !== H && (X(p, A, p.bl_tree), G--), X(p, k, p.bl_tree), q(p, G - 3, 2)) : G <= 10 ? (X(p, x, p.bl_tree), q(p, G - 3, 3)) : (X(p, O, p.bl_tree), q(p, G - 11, 7));
+            H = A, it = (G = 0) === J ? (V = 138, 3) : A === J ? (V = 6, 3) : (V = 7, 4);
+          }
+      }
+      a(L);
+      var R = !1;
+      function y(p, C, U, Z) {
+        q(p, (d << 1) + (Z ? 1 : 0), 3), function(A, H, J, G) {
+          nt(A), G && (tt(A, J), tt(A, ~J)), l.arraySet(A.pending_buf, A.window, H, J, A.pending), A.pending += J;
+        }(p, C, U, !0);
+      }
+      g._tr_init = function(p) {
+        R || (function() {
+          var C, U, Z, A, H, J = new Array(f + 1);
+          for (A = Z = 0; A < c - 1; A++)
+            for (N[A] = Z, C = 0; C < 1 << T[A]; C++)
+              r[Z++] = A;
+          for (r[Z - 1] = A, A = H = 0; A < 16; A++)
+            for (L[A] = H, C = 0; C < 1 << M[A]; C++)
+              F[H++] = A;
+          for (H >>= 7; A < s; A++)
+            for (L[A] = H << 7, C = 0; C < 1 << M[A] - 7; C++)
+              F[256 + H++] = A;
+          for (U = 0; U <= f; U++)
+            J[U] = 0;
+          for (C = 0; C <= 143; )
+            j[2 * C + 1] = 8, C++, J[8]++;
+          for (; C <= 255; )
+            j[2 * C + 1] = 9, C++, J[9]++;
+          for (; C <= 279; )
+            j[2 * C + 1] = 7, C++, J[7]++;
+          for (; C <= 287; )
+            j[2 * C + 1] = 8, C++, J[8]++;
+          for (ct(j, v + 1, J), C = 0; C < s; C++)
+            b[2 * C + 1] = 5, b[2 * C] = st(C, 5);
+          Q = new K(j, T, _ + 1, v, f), $ = new K(b, M, 0, s, f), Y = new K(new Array(0), z, 0, m, u);
+        }(), R = !0), p.l_desc = new I(p.dyn_ltree, Q), p.d_desc = new I(p.dyn_dtree, $), p.bl_desc = new I(p.bl_tree, Y), p.bi_buf = 0, p.bi_valid = 0, et(p);
+      }, g._tr_stored_block = y, g._tr_flush_block = function(p, C, U, Z) {
+        var A, H, J = 0;
+        0 < p.level ? (p.strm.data_type === 2 && (p.strm.data_type = function(G) {
+          var V, it = 4093624447;
+          for (V = 0; V <= 31; V++, it >>>= 1)
+            if (1 & it && G.dyn_ltree[2 * V] !== 0)
+              return o;
+          if (G.dyn_ltree[18] !== 0 || G.dyn_ltree[20] !== 0 || G.dyn_ltree[26] !== 0)
+            return e;
+          for (V = 32; V < _; V++)
+            if (G.dyn_ltree[2 * V] !== 0)
+              return e;
+          return o;
+        }(p)), pt(p, p.l_desc), pt(p, p.d_desc), J = function(G) {
+          var V;
+          for (t(G, G.dyn_ltree, G.l_desc.max_code), t(G, G.dyn_dtree, G.d_desc.max_code), pt(G, G.bl_desc), V = m - 1; 3 <= V && G.bl_tree[2 * W[V] + 1] === 0; V--)
+            ;
+          return G.opt_len += 3 * (V + 1) + 5 + 5 + 4, V;
+        }(p), A = p.opt_len + 3 + 7 >>> 3, (H = p.static_len + 3 + 7 >>> 3) <= A && (A = H)) : A = H = U + 5, U + 4 <= A && C !== -1 ? y(p, C, U, Z) : p.strategy === 4 || H === A ? (q(p, 2 + (Z ? 1 : 0), 3), mt(p, j, b)) : (q(p, 4 + (Z ? 1 : 0), 3), function(G, V, it, rt) {
+          var dt;
+          for (q(G, V - 257, 5), q(G, it - 1, 5), q(G, rt - 4, 4), dt = 0; dt < rt; dt++)
+            q(G, G.bl_tree[2 * W[dt] + 1], 3);
+          D(G, G.dyn_ltree, V - 1), D(G, G.dyn_dtree, it - 1);
+        }(p, p.l_desc.max_code + 1, p.d_desc.max_code + 1, J + 1), mt(p, p.dyn_ltree, p.dyn_dtree)), et(p), Z && nt(p);
+      }, g._tr_tally = function(p, C, U) {
+        return p.pending_buf[p.d_buf + 2 * p.last_lit] = C >>> 8 & 255, p.pending_buf[p.d_buf + 2 * p.last_lit + 1] = 255 & C, p.pending_buf[p.l_buf + p.last_lit] = 255 & U, p.last_lit++, C === 0 ? p.dyn_ltree[2 * U]++ : (p.matches++, C--, p.dyn_ltree[2 * (r[U] + _ + 1)]++, p.dyn_dtree[2 * B(C)]++), p.last_lit === p.lit_bufsize - 1;
+      }, g._tr_align = function(p) {
+        q(p, 2, 3), X(p, w, j), function(C) {
+          C.bi_valid === 16 ? (tt(C, C.bi_buf), C.bi_buf = 0, C.bi_valid = 0) : 8 <= C.bi_valid && (C.pending_buf[C.pending++] = 255 & C.bi_buf, C.bi_buf >>= 8, C.bi_valid -= 8);
+        }(p);
+      };
+    }, { "../utils/common": 41 }], 53: [function(n, S, g) {
+      S.exports = function() {
+        this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
+      };
+    }, {}], 54: [function(n, S, g) {
+      (function(l) {
+        (function(o, e) {
+          if (!o.setImmediate) {
+            var a, d, c, _, v = 1, s = {}, m = !1, i = o.document, f = Object.getPrototypeOf && Object.getPrototypeOf(o);
+            f = f && f.setTimeout ? f : o, a = {}.toString.call(o.process) === "[object process]" ? function(k) {
+              process.nextTick(function() {
+                u(k);
+              });
+            } : function() {
+              if (o.postMessage && !o.importScripts) {
+                var k = !0, x = o.onmessage;
+                return o.onmessage = function() {
+                  k = !1;
+                }, o.postMessage("", "*"), o.onmessage = x, k;
+              }
+            }() ? (_ = "setImmediate$" + Math.random() + "$", o.addEventListener ? o.addEventListener("message", w, !1) : o.attachEvent("onmessage", w), function(k) {
+              o.postMessage(_ + k, "*");
+            }) : o.MessageChannel ? ((c = new MessageChannel()).port1.onmessage = function(k) {
+              u(k.data);
+            }, function(k) {
+              c.port2.postMessage(k);
+            }) : i && "onreadystatechange" in i.createElement("script") ? (d = i.documentElement, function(k) {
+              var x = i.createElement("script");
+              x.onreadystatechange = function() {
+                u(k), x.onreadystatechange = null, d.removeChild(x), x = null;
+              }, d.appendChild(x);
+            }) : function(k) {
+              setTimeout(u, 0, k);
+            }, f.setImmediate = function(k) {
+              typeof k != "function" && (k = new Function("" + k));
+              for (var x = new Array(arguments.length - 1), O = 0; O < x.length; O++)
+                x[O] = arguments[O + 1];
+              var T = { callback: k, args: x };
+              return s[v] = T, a(v), v++;
+            }, f.clearImmediate = h;
+          }
+          function h(k) {
+            delete s[k];
+          }
+          function u(k) {
+            if (m)
+              setTimeout(u, 0, k);
+            else {
+              var x = s[k];
+              if (x) {
+                m = !0;
+                try {
+                  (function(O) {
+                    var T = O.callback, M = O.args;
+                    switch (M.length) {
+                      case 0:
+                        T();
+                        break;
+                      case 1:
+                        T(M[0]);
+                        break;
+                      case 2:
+                        T(M[0], M[1]);
+                        break;
+                      case 3:
+                        T(M[0], M[1], M[2]);
+                        break;
+                      default:
+                        T.apply(e, M);
+                    }
+                  })(x);
+                } finally {
+                  h(k), m = !1;
+                }
+              }
+            }
+          }
+          function w(k) {
+            k.source === o && typeof k.data == "string" && k.data.indexOf(_) === 0 && u(+k.data.slice(_.length));
+          }
+        })(typeof self > "u" ? l === void 0 ? this : l : self);
+      }).call(this, typeof At < "u" ? At : typeof self < "u" ? self : typeof window < "u" ? window : {});
+    }, {}] }, {}, [10])(10);
+  });
+})(te);
+var be = te.exports;
+const we = /* @__PURE__ */ _e(be), Ht = 914400, It = "data:image/svg+xml,%3Csvg%20xmlns=%22http://www.w3.org/2000/svg%22%20width=%221%22%20height=%221%22/%3E";
+function ee(E, P, n = 5) {
+  return n < 0 ? [] : Jt.readdirSync(E, { withFileTypes: !0 }).sort((g, l) => g.name.localeCompare(l.name)).flatMap((g) => {
+    const l = Mt.join(E, g.name);
+    return g.isFile() ? g.name === P ? [l] : [] : g.isDirectory() ? ee(l, P, n - 1) : [];
+  });
+}
+async function Nt(E, P, n) {
+  await E.evaluate(({ kind: S, index: g, src: l, replacement: o, placeholder: e }) => {
+    var a;
+    if (S === "img") {
+      const d = document.querySelector('[data-html2pptx-image="' + g + '"]');
+      if (e) {
+        const c = d.getBoundingClientRect(), _ = getComputedStyle(d);
+        c.width && (d.style.width = _.width === "auto" ? c.width + "px" : _.width), c.height && (d.style.height = _.height === "auto" ? c.height + "px" : _.height);
+      }
+      if (((a = d.parentElement) == null ? void 0 : a.tagName) === "PICTURE")
+        for (const c of d.parentElement.querySelectorAll("source"))
+          c.removeAttribute("srcset");
+      d.removeAttribute("srcset"), d.src = o;
+    } else {
+      const d = document.querySelector('[data-html2pptx-background="' + g + '"]');
+      d.style.backgroundImage = getComputedStyle(d).backgroundImage.replace(l, o);
+    }
+  }, { ...P, replacement: n, placeholder: n === It });
+}
+async function ye(E, P) {
+  var o;
+  const n = [], S = /* @__PURE__ */ new Map(), g = await E.evaluate(() => {
+    const e = [...document.images].map((d, c) => (d.dataset.html2pptxImage = String(c), { kind: "img", index: c, src: d.currentSrc || d.src })), a = [];
+    for (const d of document.querySelectorAll("*")) {
+      const c = getComputedStyle(d).backgroundImage;
+      if (!c.includes("url("))
+        continue;
+      const _ = a.length;
+      d.dataset.html2pptxBackground = String(_);
+      for (const v of c.matchAll(/url\((?:"([^"]*)"|'([^']*)'|([^)]*))\)/g))
+        a.push({ kind: "background", index: _, src: v[1] || v[2] || v[3] });
+    }
+    return [...e, ...a];
+  });
+  for (const e of g) {
+    if (!((o = e.src) != null && o.startsWith("file:")))
+      continue;
+    let a;
+    try {
+      a = Ut(e.src);
+    } catch {
+      n.push({ src: e.src, reason: "invalid_path" }), await Nt(E, e, It);
+      continue;
+    }
+    if (Jt.existsSync(a))
+      continue;
+    const d = Mt.basename(a), c = P ? ee(P, d) : [];
+    c.length !== 1 && n.push({ src: e.src, reason: c.length ? "ambiguous" : "not_found" });
+    const _ = c.length === 1 ? qt(c[0]).href : It;
+    c.length === 1 && S.set(_, e.src), await Nt(E, e, _);
+  }
+  const l = await E.evaluate(async () => {
+    await Promise.all([...document.images].map((d) => d.decode().catch(() => {
+    })));
+    const e = [...document.images].filter((d) => !d.naturalWidth).map((d) => ({ kind: "img", index: Number(d.dataset.html2pptxImage), src: d.currentSrc || d.src })), a = [...document.querySelectorAll("[data-html2pptx-background]")].flatMap((d) => [...getComputedStyle(d).backgroundImage.matchAll(/url\((?:"([^"]*)"|'([^']*)'|([^)]*))\)/g)].map((c) => ({
+      kind: "background",
+      index: Number(d.dataset.html2pptxBackground),
+      src: c[1] || c[2] || c[3]
+    })));
+    return await Promise.all(a.map((d) => new Promise((c) => {
+      const _ = new Image();
+      _.onload = () => c(), _.onerror = () => {
+        e.push(d), c();
+      }, _.src = d.src;
+    }))), e;
+  });
+  for (const e of l)
+    n.push({ src: S.get(e.src) || e.src, reason: "load_failed" }), await Nt(E, e, It);
+  return n;
+}
+function ve() {
+  const E = document.createElement("style");
+  E.textContent = "[data-html2pptx-hide-before]::before, [data-html2pptx-hide-after]::after { content: none !important }", document.head.appendChild(E);
+  for (const P of [...document.querySelectorAll("*")])
+    for (const n of ["before", "after"]) {
+      const S = getComputedStyle(P, "::" + n), g = parseFloat(S.width), l = parseFloat(S.height);
+      if (S.content === "none" || S.content === "normal" || !(g >= 8 && l > 0 && l <= 3 || l >= 8 && g > 0 && g <= 3) || ["transparent", "rgba(0, 0, 0, 0)"].includes(S.backgroundColor) && S.backgroundImage === "none")
+        continue;
+      const o = document.createElement("span");
+      for (let e = 0; e < S.length; e++) {
+        const a = S[e];
+        a.startsWith("animation") || a.startsWith("transition") || o.style.setProperty(a, S.getPropertyValue(a));
+      }
+      o.setAttribute("aria-hidden", "true"), P.setAttribute("data-html2pptx-hide-" + n, ""), n === "before" ? P.prepend(o) : P.append(o);
+    }
+}
+function Gt(E) {
+  const P = document.querySelector(E) || document.body, n = P.getBoundingClientRect(), S = P === document.body ? {
+    left: n.left,
+    top: n.top,
+    width: Math.max(n.width, document.body.scrollWidth, window.innerWidth),
+    height: Math.max(n.height, document.body.scrollHeight, window.innerHeight)
+  } : n, g = [];
+  let l = 0;
+  const o = (u) => parseFloat(u) || 0, e = (u) => {
+    const w = String(u || "").match(/rgba?\(\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)(?:\s*,\s*([\d.]+))?/i);
+    return w ? { hex: w.slice(1, 4).map((k) => Number(k).toString(16).padStart(2, "0")).join("").toUpperCase(), alpha: w[4] === void 0 ? 1 : Number(w[4]) } : null;
+  }, a = (u) => {
+    const w = e(u);
+    return w && w.alpha > 0 ? w : null;
+  }, d = (u, w) => {
+    if (!u.startsWith("linear-gradient(") || !u.endsWith(")"))
+      return null;
+    const k = [];
+    let x = 0, O = 0;
+    const T = u.slice(16, -1);
+    for (let b = 0; b < T.length; b++)
+      T[b] === "(" ? x++ : T[b] === ")" ? x-- : T[b] === "," && x === 0 && (k.push(T.slice(O, b).trim()), O = b + 1);
+    k.push(T.slice(O).trim());
+    let M = 180;
+    if (/^-?[\d.]+deg$/.test(k[0]))
+      M = parseFloat(k.shift());
+    else if (/^to (right|bottom|left|top)$/.test(k[0]))
+      M = { right: 90, bottom: 180, left: 270, top: 0 }[k.shift().slice(3)];
+    else if (k[0].startsWith("to "))
+      return null;
+    const z = M * Math.PI / 180, W = Math.abs(w.w * Math.sin(z)) + Math.abs(w.h * Math.cos(z)), j = k.map((b) => {
+      const F = b.match(/^(rgba?\([^)]+\)|#[0-9a-f]{3,8}|transparent)(?:\s+(-?[\d.]+)(%|px))?$/i);
+      if (!F)
+        return null;
+      let r = e(F[1]);
+      if (F[1].toLowerCase() === "transparent")
+        r = { hex: "000000", alpha: 0 };
+      else if (F[1][0] === "#") {
+        const N = F[1].slice(1);
+        r = {
+          hex: (N.length <= 4 ? [...N.slice(0, 3)].map((Q) => Q + Q).join("") : N.slice(0, 6)).toUpperCase(),
+          alpha: N.length === 4 ? parseInt(N[3] + N[3], 16) / 255 : N.length === 8 ? parseInt(N.slice(-2), 16) / 255 : 1
+        };
+      }
+      return r ? { ...r, position: F[2] === void 0 ? null : Number(F[2]) * (F[3] === "%" ? 0.01 : 1 / W) } : null;
+    });
+    if (j.length < 2 || j.some((b) => !b))
+      return null;
+    j[0].position === null && (j[0].position = 0), j.at(-1).position === null && (j.at(-1).position = 1);
+    for (let b = 1; b < j.length; b++)
+      if (j[b].position !== null)
+        j[b].position = Math.max(j[b].position, j[b - 1].position);
+      else {
+        let F = b + 1;
+        for (; j[F].position === null; )
+          F++;
+        const r = (Math.max(j[F].position, j[b - 1].position) - j[b - 1].position) / (F - b + 1);
+        for (let N = b; N < F; N++)
+          j[N].position = j[b - 1].position + r * (N - b + 1);
+      }
+    return { angle: M, stops: j };
+  }, c = (u) => {
+    const w = u.getBoundingClientRect();
+    return { x: w.left - S.left, y: w.top - S.top, w: w.width, h: w.height };
+  }, _ = (u, w) => ["TopLeft", "TopRight", "BottomRight", "BottomLeft"].map((k, x) => {
+    const O = u[`border${k}Radius`];
+    return O.includes("%") ? Math.min(w.w, w.h) * o(O) / 100 : o(O);
+  }), v = (u) => {
+    const w = a(u.color);
+    if (w)
+      return w;
+    if (u.backgroundClip === "text" || u.webkitBackgroundClip === "text") {
+      const k = u.backgroundImage.match(/#[0-9a-fA-F]{3,8}|rgba?\([^)]+\)/g);
+      if (k && k.length) {
+        const x = k[Math.floor(k.length / 2)];
+        if (x.startsWith("#")) {
+          const O = x.slice(1);
+          return { hex: O.length === 3 ? O.split("").map((T) => T + T).join("").toUpperCase() : O.slice(0, 6).toUpperCase(), alpha: 1 };
+        }
+        return a(x);
+      }
+    }
+    return { hex: "000000", alpha: 1 };
+  }, s = (u, w, k) => {
+    var $;
+    let x = k, O = 0;
+    const T = ($ = w.transform.match(/^matrix\(([^)]+)\)$/)) == null ? void 0 : $[1].split(",").map(Number);
+    (T == null ? void 0 : T.length) === 6 && Math.abs(Math.hypot(T[0], T[1]) - 1) < 0.01 && Math.abs(Math.hypot(T[2], T[3]) - 1) < 0.01 && (O = Math.atan2(T[1], T[0]) * 180 / Math.PI, Math.abs(O) > 0.1 && (x = {
+      x: k.x + (k.w - u.offsetWidth) / 2,
+      y: k.y + (k.h - u.offsetHeight) / 2,
+      w: u.offsetWidth,
+      h: u.offsetHeight
+    }));
+    const M = a(w.backgroundColor), z = ["Top", "Right", "Bottom", "Left"].map((Y) => ({
+      width: o(w[`border${Y}Width`]),
+      color: a(w[`border${Y}Color`])
+    })), W = z.some((Y) => Y.width && Y.color), j = _(w, x);
+    for (let Y = u.parentElement; Y && Y !== P; Y = Y.parentElement) {
+      const L = getComputedStyle(Y);
+      if (L.overflow !== "hidden")
+        continue;
+      const K = Y.getBoundingClientRect(), I = u.getBoundingClientRect(), B = _(L, c(Y));
+      [
+        Math.abs(I.left - K.left) < 3 && Math.abs(I.top - K.top) < 3,
+        Math.abs(I.right - K.right) < 3 && Math.abs(I.top - K.top) < 3,
+        Math.abs(I.right - K.right) < 3 && Math.abs(I.bottom - K.bottom) < 3,
+        Math.abs(I.left - K.left) < 3 && Math.abs(I.bottom - K.bottom) < 3
+      ].forEach((q, X) => {
+        q && (j[X] = Math.max(j[X], B[X]));
+      });
+    }
+    const b = w.clipPath.match(/^polygon\((.*)\)$/), F = z.map((Y, L) => ({ ...Y, index: L })).filter((Y) => Y.width && Y.color);
+    if (u.clientWidth === 0 && u.clientHeight === 0 && F.length === 1) {
+      const Y = F[0], L = [
+        [[0, 0], [x.w, 0], [x.w / 2, x.h]],
+        [[x.w, 0], [x.w, x.h], [0, x.h / 2]],
+        [[x.w / 2, 0], [x.w, x.h], [0, x.h]],
+        [[0, 0], [x.w, x.h / 2], [0, x.h]]
+      ][Y.index];
+      g.push({ type: "polygon", points: L, fill: Y.color, ...x });
+      return;
+    }
+    const r = x.w >= 8 && x.h <= 3 || x.h >= 8 && x.w <= 3, N = r ? d(w.backgroundImage, x) : null;
+    if (r && (N || w.backgroundImage === "none" && M)) {
+      g.push({ type: "line", ...x, color: M, gradient: N, rotate: O });
+      return;
+    }
+    if (w.backgroundImage !== "none" && w.backgroundClip !== "text" && w.webkitBackgroundClip !== "text") {
+      const Y = ++l;
+      u.setAttribute("data-html2pptx-capture", String(Y)), g.push({ type: "capture-background", id: Y, rotate: O, ...x });
+      return;
+    }
+    if (!M && !W)
+      return;
+    if (b) {
+      const Y = b[1].replace(/^(evenodd|nonzero),\s*/, "").split(",").map((L) => L.trim().split(/\s+/).map((K, I) => K.endsWith("%") ? o(K) * (I ? x.h : x.w) / 100 : o(K)));
+      if (Y.length >= 3 && Y.every((L) => L.length === 2 && L.every(Number.isFinite))) {
+        g.push({ type: "polygon", points: Y, fill: M, ...x });
+        return;
+      }
+    }
+    const Q = z.every((Y) => {
+      var L, K;
+      return Math.abs(Y.width - z[0].width) < 0.1 && (((L = Y.color) == null ? void 0 : L.hex) || "") === (((K = z[0].color) == null ? void 0 : K.hex) || "");
+    });
+    g.push({
+      type: "shape",
+      ...x,
+      fill: M,
+      border: Q ? z[0] : null,
+      radius: Math.max(...j),
+      radii: j,
+      rotate: O,
+      shadow: w.boxShadow
+    }), Q || z.forEach((Y, L) => {
+      Y.width && Y.color && g.push({
+        type: "border-strip",
+        ...x,
+        side: L,
+        widths: z.map((K) => K.width),
+        color: Y.color,
+        radii: j
+      });
+    });
+  }, m = (u, w) => {
+    if (!u.textContent.trim())
+      return;
+    const k = getComputedStyle(w), x = u.textContent, O = document.createRange(), T = [];
+    for (let j = 0; j < x.length; j++) {
+      O.setStart(u, j), O.setEnd(u, j + 1);
+      const b = O.getBoundingClientRect();
+      if (b.width < 0.2 || b.height < 0.2)
+        continue;
+      const F = /\s/.test(x[j]) && !k.whiteSpace.startsWith("pre") ? " " : x[j];
+      let r = T[T.length - 1];
+      F === " " && (!r || !r.text) || ((!r || Math.abs(r.y - b.top) > 3) && (r = { text: "", x: b.left, y: b.top, right: b.right, h: b.height }, T.push(r)), (F !== " " || r.text && !r.text.endsWith(" ")) && (r.text += F), r.right = b.right, r.h = Math.max(r.h, b.height));
+    }
+    const M = k.fontFamily.split(",")[0].trim().replace(/^['"]|['"]$/g, ""), z = v(k), W = (() => {
+      for (let j = w; j && j !== P; j = j.parentElement) {
+        const b = getComputedStyle(j);
+        if (b.display.includes("flex") && !(b.justifyContent !== "center" && b.alignItems !== "center") && j.innerText.trim() === x.trim())
+          return c(j).y + c(j).h / 2;
+      }
+      return null;
+    })();
+    for (const j of T) {
+      const b = j.text.trim();
+      b && g.push({
+        type: "rendered-text",
+        text: b,
+        x: j.x - S.left,
+        y: j.y - S.top,
+        w: j.right - j.x,
+        h: j.h,
+        fontSize: o(k.fontSize),
+        fontFace: M,
+        color: z,
+        bold: parseInt(k.fontWeight, 10) >= 600 || k.fontWeight === "bold",
+        italic: k.fontStyle === "italic",
+        underline: k.textDecorationLine.includes("underline"),
+        strike: k.textDecorationLine.includes("line-through"),
+        letterSpacing: k.letterSpacing === "normal" ? 0 : o(k.letterSpacing),
+        centerY: T.length === 1 ? W : null,
+        align: k.textAlign
+      });
+    }
+  }, i = (u) => {
+    const w = getComputedStyle(u);
+    if (w.display === "none" || w.visibility === "hidden" || o(w.opacity) === 0)
+      return;
+    const k = c(u);
+    if (k.w <= 0 || k.h <= 0)
+      return;
+    const x = u.tagName.toLowerCase();
+    if (x === "img" || x === "svg" || x === "canvas") {
+      const O = ++l;
+      u.setAttribute("data-html2pptx-capture", String(O)), g.push({ type: "capture-element", id: O, ...k });
+      return;
+    }
+    s(u, w, k);
+    for (const O of u.childNodes)
+      O.nodeType === Node.TEXT_NODE ? m(O, u) : O.nodeType === Node.ELEMENT_NODE && i(O);
+  }, f = getComputedStyle(P), h = a(f.backgroundColor) || a(getComputedStyle(document.body).backgroundColor);
+  s(P, f, { x: 0, y: 0, w: S.width, h: S.height });
+  for (const u of P.childNodes)
+    u.nodeType === Node.TEXT_NODE ? m(u, P) : u.nodeType === Node.ELEMENT_NODE && i(u);
+  for (const u of g.filter((w) => w.type === "rendered-text" && /^\d{1,3}$/.test(w.text))) {
+    const w = g.find((k) => k.type === "shape" && k.radius >= Math.min(k.w, k.h) * 0.45 && Math.abs(k.x + k.w / 2 - u.x - u.w / 2) < k.w * 0.12 && Math.abs(k.y + k.h / 2 - u.y - u.h / 2) < k.h * 0.12);
+    w && (u.centerY = w.y + w.h / 2);
+  }
+  return { elements: g, background: h, width: S.width, height: S.height };
+}
+function ke(E, P, n, S, g) {
+  const [l, o, e, a] = n.map((_) => Math.max(0, Math.min(_, E / 2, P / 2))), d = 0.5522847498, c = (_, v, s) => ({
+    x: _ * S,
+    y: v * g,
+    ...s ? { curve: {
+      type: "cubic",
+      x1: s[0] * S,
+      y1: s[1] * g,
+      x2: s[2] * S,
+      y2: s[3] * g
+    } } : {}
+  });
+  return [
+    c(l, 0),
+    c(E - o, 0),
+    c(E, o, [E - o + o * d, 0, E, o - o * d]),
+    c(E, P - e),
+    c(E - e, P, [E, P - e + e * d, E - e + e * d, P]),
+    c(a, P),
+    c(0, P - a, [a - a * d, P, 0, P - a + a * d]),
+    c(0, l),
+    c(l, 0, [0, l - l * d, l - l * d, 0]),
+    { close: !0 }
+  ];
+}
+function xe(E, P, n) {
+  const [S, g, l, o] = E.radii.map((z) => Math.max(0, Math.min(z, E.w / 2, E.h / 2))), [e, a, d, c] = E.widths, _ = [
+    {
+      w: E.h,
+      h: E.w,
+      top: S,
+      bottom: g,
+      width: e,
+      before: c,
+      after: a,
+      transform: (z, W) => [W, z]
+    },
+    {
+      w: E.w,
+      h: E.h,
+      top: g,
+      bottom: l,
+      width: a,
+      before: e,
+      after: d,
+      transform: (z, W) => [E.w - z, W]
+    },
+    {
+      w: E.h,
+      h: E.w,
+      top: o,
+      bottom: l,
+      width: d,
+      before: c,
+      after: a,
+      transform: (z, W) => [W, E.h - z]
+    },
+    {
+      w: E.w,
+      h: E.h,
+      top: S,
+      bottom: o,
+      width: c,
+      before: e,
+      after: d,
+      transform: (z, W) => [z, W]
+    }
+  ], { h: v, top: s, bottom: m, width: i, before: f, after: h, transform: u } = _[E.side], w = 0.5522847498, k = Math.max(0, s - i), x = Math.max(0, s - f), O = Math.max(0, m - i), T = Math.max(0, m - h);
+  return [
+    [s, 0],
+    [0, s, s - s * w, 0, 0, s - s * w],
+    [0, v - m],
+    [m, v, 0, v - m + m * w, m - m * w, v],
+    [i + O, v - h],
+    [
+      i,
+      v - h - T,
+      i + O - O * w,
+      v - h,
+      i,
+      v - h - T + T * w
+    ],
+    [i, f + x],
+    [
+      i + k,
+      f,
+      i,
+      f + x - x * w,
+      i + k - k * w,
+      f
+    ]
+  ].map(([z, W, j, b, F, r]) => {
+    const [N, Q] = u(z, W), $ = { x: N * P, y: Q * n };
+    if (j !== void 0) {
+      const [Y, L] = u(j, b), [K, I] = u(F, r);
+      $.curve = { type: "cubic", x1: Y * P, y1: L * n, x2: K * P, y2: I * n };
+    }
+    return $;
+  });
+}
+function Dt(E) {
+  return E ? { color: E.hex, transparency: Math.round((1 - E.alpha) * 100) } : { color: "FFFFFF", transparency: 100 };
+}
+function Se(E, P) {
+  var l;
+  if (!E || E === "none" || E.includes("inset"))
+    return null;
+  const n = E.match(/rgba?\([^)]+\)/), S = ((l = E.replace((n == null ? void 0 : n[0]) || "", "").match(/-?[\d.]+px/g)) == null ? void 0 : l.map(parseFloat)) || [];
+  if (S.length < 2)
+    return null;
+  const g = n == null ? void 0 : n[0].match(/rgba?\((\d+),\s*(\d+),\s*(\d+)(?:,\s*([\d.]+))?/);
+  return {
+    type: "outer",
+    color: g ? [1, 2, 3].map((o) => Number(g[o]).toString(16).padStart(2, "0")).join("") : "000000",
+    opacity: g != null && g[4] ? Number(g[4]) : 0.35,
+    angle: (Math.atan2(S[1], S[0]) * 180 / Math.PI + 360) % 360,
+    blur: (S[2] || 0) * P * 72,
+    offset: Math.hypot(S[0], S[1]) * P * 72
+  };
+}
+function Ee(E, P, n, S, g, l) {
+  var e;
+  const o = { x: n.x * S, y: n.y * g, w: n.w * S, h: n.h * g };
+  if (n.type === "line") {
+    if (n.gradient) {
+      const d = `html2pptx-gradient-${l.length + 1}`;
+      E.addShape(P.ShapeType.rect, {
+        ...o,
+        objectName: d,
+        fill: Dt(n.gradient.stops[0]),
+        line: { color: "FFFFFF", transparency: 100 },
+        ...n.rotate ? { rotate: n.rotate } : {}
+      }), l.push({ name: d, ...n.gradient });
+      return;
+    }
+    const a = n.w >= n.h;
+    E.addShape(P.ShapeType.line, {
+      x: (n.x + (a ? 0 : n.w / 2)) * S,
+      y: (n.y + (a ? n.h / 2 : 0)) * g,
+      w: a ? o.w : 0,
+      h: a ? 0 : o.h,
+      line: {
+        color: n.color.hex,
+        transparency: Math.round((1 - n.color.alpha) * 100),
+        width: Math.max(0.75, (a ? o.h : o.w) * 72)
+      },
+      ...n.rotate ? { rotate: n.rotate } : {}
+    });
+    return;
+  }
+  if (n.type === "capture-element" || n.type === "capture-background") {
+    E.addImage({ data: n.data, ...o, ...n.rotate ? { rotate: n.rotate } : {} });
+    return;
+  }
+  if (n.type === "rendered-text") {
+    const a = n.fontSize * S * 72, d = Math.max(12, n.fontSize * 0.8), c = n.centerY == null ? n.y : n.centerY - n.h / 2 + (n.fontSize >= 100 ? 0 : Math.min(2, n.fontSize * 0.05));
+    E.addText(n.text, {
+      x: o.x,
+      y: c * g,
+      w: (n.w + d) * S,
+      h: o.h,
+      fontFace: n.fontFace,
+      fontSize: a,
+      color: n.color.hex,
+      transparency: Math.round((1 - n.color.alpha) * 100),
+      bold: n.bold,
+      italic: n.italic,
+      underline: n.underline,
+      strike: n.strike,
+      charSpacing: n.letterSpacing * S * 72,
+      margin: 0,
+      breakLine: !1,
+      valign: "middle",
+      fit: "shrink",
+      align: "left"
+    });
+    return;
+  }
+  if (n.type === "polygon" || n.type === "border-strip") {
+    const a = n.type === "polygon" ? n.points.map(([d, c]) => ({ x: d * S, y: c * g })) : xe(n, S, g);
+    E.addShape(P.ShapeType.custGeom, {
+      ...o,
+      points: [...a, { close: !0 }],
+      fill: Dt(n.type === "polygon" ? n.fill : n.color),
+      line: { color: "FFFFFF", transparency: 100 }
+    });
+    return;
+  }
+  if (n.type === "shape") {
+    const a = n.radii || [n.radius, n.radius, n.radius, n.radius], d = a.some((m) => Math.abs(m - a[0]) > 0.1), c = n.radius >= Math.min(n.w, n.h) * 0.45 && Math.abs(n.w - n.h) < 1, _ = d ? P.ShapeType.custGeom : c ? P.ShapeType.ellipse : n.radius >= 1 ? P.ShapeType.roundRect : P.ShapeType.rect, v = { ...o, fill: Dt(n.fill), line: (e = n.border) != null && e.width && n.border.color ? {
+      color: n.border.color.hex,
+      width: n.border.width * S * 72,
+      transparency: Math.round((1 - n.border.color.alpha) * 100)
+    } : { color: "FFFFFF", transparency: 100 } };
+    n.rotate && (v.rotate = n.rotate), _ === P.ShapeType.custGeom && (v.points = ke(n.w, n.h, a, S, g)), _ === P.ShapeType.roundRect && (v.rectRadius = n.radius * S);
+    const s = Se(n.shadow, S);
+    s && (v.shadow = s), E.addShape(_, v);
+  }
+}
+async function Ce(E, P) {
+  const n = E.locator(`[data-html2pptx-capture="${P.id}"]`);
+  let S;
+  if (P.type === "capture-background") {
+    await n.evaluate((g) => {
+      const l = getComputedStyle(g), o = g.getBoundingClientRect(), e = document.createElement("div");
+      e.id = "__html2pptx_background_clone", Object.assign(e.style, {
+        position: "fixed",
+        left: "0",
+        top: "0",
+        width: `${o.width}px`,
+        height: `${o.height}px`,
+        boxSizing: "border-box",
+        background: l.background,
+        border: l.border,
+        borderRadius: l.borderRadius,
+        clipPath: l.clipPath,
+        opacity: l.opacity
+      }), document.body.appendChild(e), document.documentElement.classList.add("__html2pptx_background_isolate");
+    });
+    try {
+      S = await E.locator("#__html2pptx_background_clone").screenshot({ omitBackground: !0 });
+    } finally {
+      await E.locator("#__html2pptx_background_clone").evaluate((g) => {
+        document.documentElement.classList.remove("__html2pptx_background_isolate"), g.remove();
+      });
+    }
+  } else {
+    await n.evaluate((g) => {
+      document.documentElement.classList.add("__html2pptx_isolate"), g.classList.add("__html2pptx_active");
+    });
+    try {
+      S = await n.screenshot({ omitBackground: !0 });
+    } finally {
+      await n.evaluate((g) => {
+        document.documentElement.classList.remove("__html2pptx_isolate"), g.classList.remove("__html2pptx_active");
+      });
+    }
+  }
+  P.data = `data:image/png;base64,${S.toString("base64")}`;
+}
+async function Ae(E, P, n) {
+  const S = Mt.resolve(E), g = { headless: !0, ...n.browserExecutable ? { executablePath: n.browserExecutable } : process.platform === "darwin" ? { channel: "chrome" } : {} }, { chromium: l } = await import("playwright-core").catch((e) => {
+    throw e.code !== "ERR_MODULE_NOT_FOUND" ? e : new Error("HTML PPTX 导出需要显式安装 playwright-core@1.61.1。", { cause: e });
+  }), o = await l.launch(g);
+  try {
+    const e = await o.newPage({ viewport: { width: 1920, height: 1080 }, deviceScaleFactor: 2, reducedMotion: "reduce" });
+    if (await e.goto(qt(S).href, { waitUntil: "load" }), n.selector && !await e.locator(n.selector).count())
+      throw new Error(`HTML 中找不到 --selector 指定的节点：${n.selector}`);
+    await e.evaluate(async () => {
+      var i;
+      (i = document.fonts) != null && i.ready && await document.fonts.ready;
+    });
+    const a = await ye(e, n.assetsRoot);
+    await e.evaluate(() => {
+      var i;
+      for (const f of document.getAnimations())
+        Number.isFinite((i = f.effect) == null ? void 0 : i.getComputedTiming().endTime) && f.finish();
+    }), await e.evaluate(ve), await e.addStyleTag({ content: `
+      html.__html2pptx_isolate,
+      html.__html2pptx_isolate body { background: transparent !important }
+      html.__html2pptx_isolate body * { visibility: hidden !important }
+      html.__html2pptx_isolate .__html2pptx_active,
+      html.__html2pptx_isolate .__html2pptx_active * { visibility: visible !important }
+      html.__html2pptx_background_isolate,
+      html.__html2pptx_background_isolate body { background: transparent !important }
+      html.__html2pptx_background_isolate body > *:not(#__html2pptx_background_clone) { visibility: hidden !important }
+    ` });
+    const d = n.selector || "#ppt-canvas, [data-ppt-canvas], .pptd-slide, .slide, .s, section";
+    let c = await e.evaluate(Gt, d);
+    await e.setViewportSize({ width: Math.max(1, Math.ceil(c.width)), height: Math.max(1, Math.ceil(c.height)) }), c = await e.evaluate(Gt, d);
+    for (const i of c.elements)
+      (i.type === "capture-element" || i.type === "capture-background") && await Ce(e, i);
+    (!P.presLayout || n.autoLayout) && (P.defineLayout({ name: `HTML_${Math.round(c.width)}x${Math.round(c.height)}`, width: c.width / 96, height: c.height / 96 }), P.layout = `HTML_${Math.round(c.width)}x${Math.round(c.height)}`);
+    const _ = P.presLayout.width / Ht / c.width, v = P.presLayout.height / Ht / c.height, s = n.slide || P.addSlide();
+    c.background && (s.background = { color: c.background.hex });
+    const m = [];
+    for (const i of c.elements)
+      Ee(s, P, i, _, v, m);
+    return { slide: s, placeholders: [], warnings: a, gradients: m, stats: c.elements.reduce((i, f) => (i[f.type] = (i[f.type] || 0) + 1, i), {}) };
+  } finally {
+    await o.close();
+  }
+}
+const ze = oe(import.meta.url);
+function Ie({ angle: E, stops: P }) {
+  const n = P.map((e, a) => {
+    if (e.alpha)
+      return e;
+    const d = P.slice(a + 1).find((c) => c.alpha) || P.slice(0, a).reverse().find((c) => c.alpha);
+    return { ...e, hex: (d == null ? void 0 : d.hex) || e.hex };
+  }), S = (e) => {
+    let a = n[0];
+    if (e <= a.position)
+      return { ...a, position: e };
+    for (const d of n.slice(1)) {
+      if (e < d.position) {
+        const c = (e - a.position) / (d.position - a.position), _ = a.alpha + (d.alpha - a.alpha) * c, v = [0, 2, 4].map((s) => {
+          const m = parseInt(a.hex.slice(s, s + 2), 16), i = parseInt(d.hex.slice(s, s + 2), 16);
+          return _ ? Math.round((m * a.alpha * (1 - c) + i * d.alpha * c) / _) : 0;
+        });
+        return { position: e, alpha: _, hex: v.map((s) => s.toString(16).padStart(2, "0")).join("").toUpperCase() };
+      }
+      a = d;
+    }
+    return { ...n.at(-1), position: e };
+  }, l = [S(0), ...n.filter((e) => e.position > 0 && e.position < 1), S(1)].map((e) => `<a:gs pos="${Math.round(e.position * 1e5)}"><a:srgbClr val="${e.hex}"><a:alpha val="${Math.round(e.alpha * 1e5)}"/></a:srgbClr></a:gs>`).join(""), o = ((E - 90) % 360 + 360) % 360;
+  return `<a:gradFill rotWithShape="1"><a:gsLst>${l}</a:gsLst><a:lin ang="${Math.round(o * 6e4)}" scaled="1"/></a:gradFill>`;
+}
+async function Te(E, P, { selector: n, browserExecutable: S, assetsRoot: g } = {}) {
+  const l = ft(E), e = (await Bt(l)).isDirectory() ? (await se(l)).filter((m) => Zt(m).toLowerCase() === ".html").sort((m, i) => m.localeCompare(i, "zh-CN", { numeric: !0 })).map((m) => St(l, m)) : [l];
+  if (!e.length || e.some((m) => Zt(m).toLowerCase() !== ".html"))
+    throw new Error(`没有找到 HTML 文件：${l}`);
+  if (g && !(await Bt(g)).isDirectory())
+    throw new Error(`--assets-root 不是目录：${g}`);
+  const a = ze("pptxgenjs-html"), d = new a(), c = {}, _ = [], v = [];
+  for (const [m, i] of e.entries()) {
+    const f = await Ae(i, d, {
+      autoLayout: m === 0,
+      selector: n,
+      browserExecutable: S,
+      assetsRoot: g
+    });
+    for (const [h, u] of Object.entries(f.stats))
+      c[h] = (c[h] || 0) + u;
+    for (const h of f.warnings)
+      _.push({ pageNumber: m + 1, sourceFile: i, ...h });
+    f.gradients.length && v.push({ pageNumber: m + 1, gradients: f.gradients });
+  }
+  await Pt(Tt(P), { recursive: !0 });
+  const s = `${P}.${Kt()}.pptx`;
+  try {
+    if (await d.writeFile({ fileName: s }), v.length) {
+      const i = await we.loadAsync(await xt(s));
+      for (const { pageNumber: f, gradients: h } of v) {
+        const u = `ppt/slides/slide${f}.xml`;
+        let w = await i.file(u).async("string");
+        for (const k of h) {
+          let x = 0;
+          if (w = w.replace(/<p:sp>.*?<\/p:sp>/g, (O) => {
+            if (!O.includes(`name="${k.name}"`))
+              return O;
+            if (x++, !O.includes('prst="rect"') || !O.includes("<a:solidFill>"))
+              throw new Error(`无法写入第 ${f} 页渐变形状：${k.name}`);
+            return O.replace(/<a:solidFill>.*?<\/a:solidFill>/, Ie(k));
+          }), x !== 1)
+            throw new Error(`第 ${f} 页渐变形状数量异常：${k.name}`);
+        }
+        i.file(u, w);
+      }
+      await Lt(s, await i.generateAsync({ type: "nodebuffer", compression: "DEFLATE" }));
+    }
+    const m = (await Bt(s)).size;
+    return await Xt(s, P), {
+      file: P,
+      pages: e.map((i, f) => ({ pageNumber: f + 1, sourceFile: i })),
+      bytes: m,
+      objects: c,
+      imagePlaceholders: _
+    };
+  } finally {
+    await Yt(s, { force: !0 });
+  }
+}
+const Oe = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  exportHtmlToPptxFile: Te
+}, Symbol.toStringTag, { value: "Module" }));