@pretextbook/import 0.0.1

package/dist/import-mode-iBDd9oQY.js

@@ -0,0 +1,3862 @@
+import { formatPretext as me } from "@pretextbook/format";
+import { latexToPretext as ge } from "@pretextbook/latex-pretext";
+import { markdownToPretext as _e } from "@pretextbook/remark-pretext";
+const be = [
+  "\\documentclass",
+  "\\begin{document}",
+  "\\begin{",
+  "\\section",
+  "\\chapter",
+  "\\title",
+  "\\author"
+], ye = ["# ", "## ", "### ", "#### "];
+function ie(d) {
+  const c = d.trim();
+  return !c || c.startsWith("<") ? "pretext" : be.some((e) => c.includes(e)) ? "latex" : ye.some((e) => c.startsWith(e)) ? "markdown" : "pretext";
+}
+const ve = [
+  {
+    kind: "presentation",
+    category: "latex_fonts",
+    macros: ["textrm", "textit", "textbf", "textsc", "texttt"]
+  }
+], Mt = {
+  kind: "presentation",
+  category: "tex_fonts",
+  pairs: [
+    { from: "rm", to: "textrm" },
+    { from: "em", to: "emph" },
+    { from: "it", to: "textit" },
+    { from: "itshape", to: "textit" },
+    { from: "bf", to: "textbf" },
+    { from: "bfseries", to: "textbf" },
+    { from: "sf", to: "textsf" },
+    { from: "sffamily", to: "textss" },
+    { from: "textsl", to: "testsl" }
+  ]
+}, we = [
+  {
+    kind: "accessibility",
+    category: "consistency",
+    macros: ["renewcommand"]
+  }
+], xe = [
+  {
+    kind: "unused",
+    category: "conditionals",
+    macros: ["if", "fi", "iffalse", "then", "else", "loop", "repeat"]
+  },
+  {
+    kind: "presentation",
+    category: "font_size",
+    macros: [
+      "tiny",
+      "scriptsize",
+      "footnotesize",
+      "small",
+      "normalsize",
+      "large",
+      "Large",
+      "LARGE",
+      "huge",
+      "Huge",
+      "normalfont"
+    ]
+  },
+  {
+    kind: "presentation",
+    category: "spacing_vertical",
+    macros: ["smallskip", "medskip", "bigskip", "vfil", "vfill"]
+  },
+  {
+    kind: "presentation",
+    category: "archaic_tex",
+    macros: ["centerline", "centering", "noindent", "par", "linebreak"]
+  },
+  {
+    kind: "mistake",
+    category: "nonstructural",
+    macros: ["ensuremath"]
+  },
+  {
+    kind: "archaic",
+    category: "low_level_tex",
+    macros: [
+      "relax",
+      "makeatletter",
+      "makeatother",
+      "csname",
+      "endcsname",
+      "shipout",
+      "noexpand",
+      "expandafter",
+      "clearpage"
+    ]
+  },
+  {
+    kind: "archaic",
+    category: "file_manipulation",
+    macros: [
+      "newwrite",
+      "newread",
+      "immediate",
+      "write",
+      "write18",
+      "read",
+      "readline",
+      "readfile",
+      "openin",
+      "openout",
+      "jobname"
+    ]
+  }
+], ke = [
+  {
+    kind: "archaic",
+    category: "low_level_tex",
+    macros: ["catcode", "newtheorem", "maketitle", "setlength"]
+  }
+], Se = [
+  {
+    kind: "publisher",
+    category: "zzzzz",
+    macros: [
+      "theoremstyle",
+      "makeindex",
+      "allowdisplaybreaks",
+      "frontmatter",
+      "mainmatter",
+      "appendix",
+      "numberwithin",
+      "setcounter",
+      "tableofcontents",
+      "FloatBarrier"
+    ]
+  }
+], ze = [
+  {
+    kind: "archaic",
+    category: "use_newcommand_only",
+    macros: ["def", "let", "edef", "gdef", "xdef", "global", "long"]
+  }
+], Ee = [
+  {
+    kind: "presentation",
+    category: "spacing_horizontal",
+    macros: [{ name: "hspace", arity: 1 }]
+  },
+  {
+    kind: "other",
+    category: "other",
+    macros: [{ name: "date", arity: 1 }]
+  },
+  {
+    kind: "accessibility",
+    category: "colors",
+    macros: [
+      { name: "color", arity: 1 },
+      { name: "textcolor", arity: 1 },
+      { name: "mathcolor", arity: 1 },
+      { name: "definecolor", arity: 3 }
+    ]
+  }
+], Ce = [
+  {
+    kind: "presentation",
+    category: "nonstructural",
+    environments: ["center", "minipage"]
+  }
+];
+function Zt(d) {
+  return d.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+function Ht(d, c) {
+  let e = d;
+  const f = [];
+  for (const { from: a, to: n } of c.pairs) {
+    let r, i;
+    c.category === "tex_fonts" ? (r = `\\{ *\\\\${Zt(a)}\\b *`, i = `\\${n}{`) : (r = `\\\\${Zt(a)}\\b *`, i = `\\${n}`);
+    const l = new RegExp(r, "g"), p = e.match(l);
+    p && (f.push({
+      action: "replace",
+      severity: "info",
+      kind: c.kind,
+      category: c.category,
+      macro: a,
+      replacement: n,
+      occurrences: p.length
+    }), e = e.replace(l, i));
+  }
+  return { output: e, warnings: f };
+}
+function Ae(d) {
+  let c = d;
+  const e = [], f = c.match(/\(\\ref\{([^{}]+)\}\)/g);
+  f && (e.push({
+    action: "rewrite",
+    severity: "info",
+    kind: "presentation",
+    category: "math_refs",
+    macro: "(\\ref{...})",
+    replacement: "\\eqref{...}",
+    occurrences: f.length
+  }), c = c.replace(/\(\\ref\{([^{}]+)\}\)/g, "\\eqref{$1}")), c = c.replace(/(\\vfil)l\b/g, "$1"), c = c.replace(/(\\vfil)(\s*\\vfil\b)+\b/g, "$1");
+  const a = c.match(/(\\vfil)\b/g);
+  return a && (e.push({
+    action: "rewrite",
+    severity: "info",
+    kind: "presentation",
+    category: "spacing_vertical",
+    macro: "vfil",
+    replacement: "\\vspace{1in}",
+    occurrences: a.length
+  }), c = c.replace(/(\\vfil)\b/g, "\\vspace{1in}")), c = c.replace(
+    /\\vskip\*? *([0-9]+|-) *([a-zA-Z]+).*/g,
+    "\\vspace{$1$2}"
+  ), c = c.replace(/(\\vspace)\*? */g, "$1"), c = c.replace(
+    /(\\vspace) *\{([0-9]+|-) *([a-zA-Z]+).*?\}/g,
+    "$1{$2$3}"
+  ), { output: c, warnings: e };
+}
+function Ie(d) {
+  const c = d.split("\\begin{document}");
+  if (c.length < 2)
+    return { preamble: "", body: d, bibliography: "" };
+  const e = c[0];
+  let f = c.slice(1).join("\\begin{document}"), a = "";
+  if (/\\begin\{thebibliography\}/.test(f)) {
+    const [n, ...r] = f.split("\\begin{thebibliography}");
+    f = n, a = r.join("\\begin{thebibliography}");
+  }
+  return { preamble: e, body: f, bibliography: a };
+}
+function se(d) {
+  return d.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+function Oe(d, c, e) {
+  const f = se(d);
+  if (c === "hasarg") {
+    let a = `\\\\${f}\\b\\*?`;
+    for (let n = 0; n < e; n += 1)
+      a += "\\{[^{}]*\\}";
+    return new RegExp(`(${a})`, "g");
+  }
+  return c === "line" ? new RegExp(`(\\\\${f}\\b.*)`, "g") : new RegExp(`(\\\\${f}\\b)`, "g");
+}
+function ut(d, c, e, f) {
+  const { type: a = "", action: n = "mark", extra: r = "", save: i = !1 } = e;
+  "macros" in c && c.macros[0];
+  let l = d;
+  const p = c.macros;
+  for (const w of p) {
+    const v = typeof w == "string" ? w : w.name, x = typeof w == "string" ? 0 : w.arity, u = Oe(v, a, x), _ = l.match(u);
+    !_ || _.length === 0 || (i && f.push({
+      action: "save",
+      severity: "warning",
+      kind: c.kind,
+      category: c.category,
+      macro: v,
+      occurrences: _.length,
+      examples: _.slice(0, 5),
+      message: r || void 0
+    }), n === "delete" ? (f.push({
+      action: "delete",
+      severity: "info",
+      kind: c.kind,
+      category: c.category,
+      macro: v,
+      occurrences: _.length,
+      message: r || void 0
+    }), l = l.replace(u, "")) : f.push({
+      action: "anomaly",
+      severity: "warning",
+      kind: c.kind,
+      category: c.category,
+      macro: v,
+      occurrences: _.length,
+      message: r || void 0,
+      examples: _.slice(0, 5)
+    }));
+  }
+  return l;
+}
+function Te(d, c, e) {
+  let f = d;
+  for (const a of c.environments) {
+    const n = se(a), r = new RegExp(`(\\\\(begin|end)\\{\\s*${n}\\})`, "g"), i = f.match(r);
+    i && i.length > 0 && (e.push({
+      action: "delete",
+      severity: "info",
+      kind: c.kind,
+      category: c.category,
+      macro: a,
+      occurrences: i.length
+    }), f = f.replace(r, ""));
+  }
+  return f;
+}
+function Re(d) {
+  const c = [], e = Ie(d);
+  let { preamble: f, body: a } = e;
+  const { bibliography: n } = e;
+  for (const p of xe)
+    f = ut(f, p, { action: "delete" }, c), a = ut(a, p, { action: "delete" }, c);
+  for (const p of we)
+    f = ut(
+      f,
+      p,
+      { type: "line", action: "delete", extra: "in the preamble", save: !0 },
+      c
+    ), a = ut(
+      a,
+      p,
+      { type: "line", action: "delete", extra: "in the main text", save: !0 },
+      c
+    );
+  for (const p of ze)
+    f = ut(
+      f,
+      p,
+      { type: "line", action: "delete", extra: "in the preamble", save: !0 },
+      c
+    ), a = ut(
+      a,
+      p,
+      { type: "line", action: "delete", extra: "in the main text", save: !0 },
+      c
+    );
+  for (const p of Ee)
+    f = ut(
+      f,
+      p,
+      { type: "hasarg", action: "delete" },
+      c
+    ), a = ut(
+      a,
+      p,
+      { type: "hasarg", action: "delete" },
+      c
+    );
+  for (const p of ke)
+    f = ut(
+      f,
+      p,
+      { type: "line", action: "delete" },
+      c
+    ), a = ut(a, p, { type: "line", action: "delete" }, c);
+  for (const p of Se)
+    f = ut(
+      f,
+      p,
+      {
+        type: "line",
+        action: "delete",
+        extra: "this is a publisher choice in PreTeXt"
+      },
+      c
+    ), a = ut(
+      a,
+      p,
+      {
+        type: "line",
+        action: "delete",
+        extra: "this is a publisher choice in PreTeXt"
+      },
+      c
+    );
+  for (const p of ve)
+    a = ut(a, p, { action: "mark" }, c);
+  for (const p of Ce)
+    a = Te(a, p, c);
+  const r = d.includes("\\begin{document}"), i = n.length > 0;
+  let l = f;
+  return r ? l += `\\begin{document}
+` + a : l = a, i && (l += `\\begin{thebibliography}
+` + n), { output: l, warnings: c };
+}
+function Be(d) {
+  let c = d;
+  return c = c.replace(/\s+%.*/g, ""), c = c.replace(/([^\\])%.*/g, "$1"), c = c.replace(/^%.*/, ""), c;
+}
+function Pe(d) {
+  return d.replace(/(.*\{)([^{}]+)(\}.*)/, (c, e, f, a) => {
+    const n = String(f).replace(/\s/g, "_").replace(/[^a-zA-Z0-9_]/g, "-");
+    return `${e}${n}${a}`;
+  });
+}
+function Fe(d) {
+  let c = d;
+  return c = c.replace(/> */g, "\\gt "), c = c.replace(/< */g, "\\lt "), c = c.replace(
+    /(\\(ref|eqref|cref|Cref|label)\{([^{}]+)\})/g,
+    Pe
+  ), c;
+}
+function De(d) {
+  let c = d;
+  return c = c.replace(/\\begin +/g, "\\begin"), c = c.replace(/\\chapter +/g, "\\chapter"), c = c.replace(/\\section +/g, "\\section"), c = c.replace(/\\section\*/g, "\\section"), c = Be(c), c = Fe(c), c = c.replace(/\\end\{document\}.*/s, ""), c = c.replace(/^\s+/, ""), c = c.replace(/\n{3,}/g, `
+
+`), c;
+}
+function Xt(d, c = 0, e = "{", f = "}") {
+  let a = d.trimStart();
+  if (!a)
+    return ["", ""];
+  let n = "", r = "", i = c;
+  if (i === 0 && a[0] !== e)
+    return ["", a];
+  for (i === 0 && (r = e, i = 1, a = a.substring(1)); i > 0 && a; ) {
+    const l = a[0];
+    l === e && n !== "\\" ? i += 1 : l === f && n !== "\\" && (i -= 1), r += l, n === "\\" && l === "\\" ? n = `
+` : n = l, a = a.substring(1);
+  }
+  return i === 0 ? [r, a] : ["", r.substring(1)];
+}
+function je(d) {
+  const c = [];
+  let e = De(d).replace(/(\n *){3,}/g, `
+
+`);
+  const f = Ae(e);
+  e = f.output, c.push(...f.warnings);
+  const a = Ht(e, Mt);
+  e = a.output, c.push(...a.warnings);
+  const n = Ht(e, Mt);
+  e = n.output, c.push(...n.warnings);
+  const r = Re(e);
+  return e = r.output.replace(/(\n *){3,}/g, `
+
+`), c.push(...r.warnings), { output: e, warnings: c };
+}
+function Ne(d) {
+  const c = "\\begin{document}", e = "\\end{document}", f = d.indexOf(c);
+  if (f === -1)
+    return { preamble: "", body: d };
+  const a = d.slice(0, f).trim(), n = d.slice(f + c.length), r = n.indexOf(e), i = (r === -1 ? n : n.slice(0, r)).trim();
+  return { preamble: a, body: i };
+}
+function Gt(d, c) {
+  const f = new RegExp(`\\\\${c}(?![a-zA-Z])`).exec(d);
+  if (!f) return "";
+  let a = d.slice(f.index + f[0].length).trimStart();
+  if (a.startsWith("[")) {
+    const [r, i] = Xt(a, 0, "[", "]");
+    r && (a = i.trimStart());
+  }
+  const [n] = Xt(a);
+  return n ? n.slice(1, -1).trim() : "";
+}
+const $e = /^[ \t]*(\\(?:new|renew|provide)command\*?|\\DeclareMathOperator\*?|\\newenvironment\*?)\b/;
+function Kt(d) {
+  let c = 0;
+  for (let e = 0; e < d.length; e++) {
+    if (d[e] === "\\") {
+      e++;
+      continue;
+    }
+    d[e] === "{" ? c++ : d[e] === "}" && c--;
+  }
+  return c;
+}
+function Le(d) {
+  const c = d.split(`
+`), e = [];
+  let f = 0;
+  for (; f < c.length; ) {
+    if (!$e.test(c[f])) {
+      f++;
+      continue;
+    }
+    let a = c[f], n = Kt(c[f]);
+    for (f++; n > 0 && f < c.length; )
+      a += `
+` + c[f], n += Kt(c[f]), f++;
+    e.push(a.trim());
+  }
+  return e.join(`
+`);
+}
+function Ue(d) {
+  const c = /\\documentclass(?:\[[^\]]*\])?\{([^}]+)\}/.exec(d);
+  return c ? c[1].trim() : "article";
+}
+function We(d) {
+  const c = d.replace(/(^|[^\\])%[^\n]*/gm, "$1");
+  return {
+    documentClass: Ue(c),
+    title: Gt(c, "title"),
+    author: Gt(c, "author"),
+    macros: Le(c)
+  };
+}
+function Me(d) {
+  if (typeof d == "string")
+    return d;
+  if (typeof d == "object" && d !== null && "value" in d) {
+    const c = d.value;
+    if (typeof c == "string")
+      return c;
+    if (c != null)
+      return String(c);
+  }
+  return String(d);
+}
+function ae(d) {
+  return d.replace(/&/g, "&amp;").replace(/</g, "&lt;").replace(/>/g, "&gt;");
+}
+function oe(d) {
+  return d.replace(/\\LaTeX\b/g, "LaTeX").replace(/\\TeX\b/g, "TeX").replace(/\\thanks\{[^{}]*(?:\{[^{}]*\}[^{}]*)?\}/g, "").replace(/\\inst\{[^{}]*\}/g, "").replace(/\\email\{[^{}]*\}/g, "").replace(/\\[a-zA-Z]+\{([^{}]*)\}/g, "$1").replace(/\\\s/g, " ").replace(/~/g, " ").replace(/\s+/g, " ").trim();
+}
+function Ze(d) {
+  const c = [];
+  if (d.macros) {
+    const e = d.macros.split(`
+`).map((f) => `    ${f}`).join(`
+`);
+    c.push(`  <macros>
+${e}
+  </macros>`);
+  }
+  if (d.author) {
+    const e = d.author.split(/\s+\\and\s+/)[0].trim(), f = ae(oe(e));
+    f && c.push(
+      `  <author>
+    <personname>${f}</personname>
+  </author>`
+    );
+  }
+  return c.length === 0 ? "" : `<docinfo>
+${c.join(`
+`)}
+</docinfo>`;
+}
+function He(d, c) {
+  const e = d.replace(/^\s*<p\s*\/>\s*/g, "").replace(/^\s*<p>\s*<\/p>\s*/g, "").trim();
+  if (!e) return "";
+  const a = /<chapter[\s>]/.test(e) ? "book" : "article", n = Ze(c), r = c.title ? `  <title>${ae(oe(c.title))}</title>
+` : "", i = `<${a}>
+${r}${e}
+</${a}>`;
+  return `<pretext>
+${[n, i].filter(Boolean).join(`
+`)}
+</pretext>`;
+}
+function Lt(d) {
+  const c = d.trim();
+  return c ? me(c) : "";
+}
+function Xe(d) {
+  const c = d.trim();
+  if (!c)
+    return { pretext: "", cleanedLatex: "", warnings: [] };
+  const { preamble: e, body: f } = Ne(c), a = We(e), n = f ? [
+    `\\documentclass{${a.documentClass}}`,
+    a.macros,
+    "\\begin{document}",
+    f,
+    "\\end{document}"
+  ].filter(Boolean).join(`
+`) : c, { output: r, warnings: i } = je(n);
+  if (!r.trim())
+    return { pretext: "", cleanedLatex: r, warnings: i };
+  const l = f ? r + `
+\\end{document}` : r, p = Me(ge(l)).trim();
+  if (!p)
+    return { pretext: "", cleanedLatex: r, warnings: i };
+  const w = He(p, a);
+  return { pretext: w ? Lt(w) : "", cleanedLatex: r, warnings: i };
+}
+function Ge(d) {
+  const c = d.trim();
+  if (!c)
+    return { pretext: "", cleanedMarkdown: "" };
+  const e = String(_e(c)).trim();
+  return { pretext: e ? Lt(e) : "", cleanedMarkdown: c };
+}
+function Ke(d) {
+  return d instanceof Error && d.message.trim() ? d.message.trim() : "Could not convert source content to PreTeXt.";
+}
+function Ye(d, c) {
+  const e = ie(d), f = c ?? e;
+  try {
+    if (f === "pretext")
+      return {
+        sourceFormat: f,
+        detectedSourceFormat: e,
+        pretextSource: Lt(d),
+        warnings: []
+      };
+    if (f === "markdown") {
+      const { pretext: i, cleanedMarkdown: l } = Ge(d);
+      return {
+        sourceFormat: f,
+        detectedSourceFormat: e,
+        pretextSource: i,
+        cleanedNativeSource: l,
+        warnings: []
+      };
+    }
+    const { pretext: a, cleanedLatex: n, warnings: r } = Xe(d);
+    return {
+      sourceFormat: f,
+      detectedSourceFormat: e,
+      pretextSource: a,
+      cleanedNativeSource: n,
+      warnings: r
+    };
+  } catch (a) {
+    return {
+      sourceFormat: f,
+      detectedSourceFormat: e,
+      pretextError: Ke(a),
+      warnings: []
+    };
+  }
+}
+var zt = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function Ve(d) {
+  return d && d.__esModule && Object.prototype.hasOwnProperty.call(d, "default") ? d.default : d;
+}
+function Et(d) {
+  throw new Error('Could not dynamically require "' + d + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+}
+var Ot = { exports: {} };
+var Yt;
+function Je() {
+  return Yt || (Yt = 1, (function(d, c) {
+    (function(e) {
+      d.exports = e();
+    })(function() {
+      return (function e(f, a, n) {
+        function r(p, w) {
+          if (!a[p]) {
+            if (!f[p]) {
+              var v = typeof Et == "function" && Et;
+              if (!w && v) return v(p, !0);
+              if (i) return i(p, !0);
+              var x = new Error("Cannot find module '" + p + "'");
+              throw x.code = "MODULE_NOT_FOUND", x;
+            }
+            var u = a[p] = { exports: {} };
+            f[p][0].call(u.exports, function(_) {
+              var o = f[p][1][_];
+              return r(o || _);
+            }, u, u.exports, e, f, a, n);
+          }
+          return a[p].exports;
+        }
+        for (var i = typeof Et == "function" && Et, l = 0; l < n.length; l++) r(n[l]);
+        return r;
+      })({ 1: [function(e, f, a) {
+        var n = e("./utils"), r = e("./support"), i = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
+        a.encode = function(l) {
+          for (var p, w, v, x, u, _, o, g = [], h = 0, b = l.length, S = b, z = n.getTypeOf(l) !== "string"; h < l.length; ) S = b - h, v = z ? (p = l[h++], w = h < b ? l[h++] : 0, h < b ? l[h++] : 0) : (p = l.charCodeAt(h++), w = h < b ? l.charCodeAt(h++) : 0, h < b ? l.charCodeAt(h++) : 0), x = p >> 2, u = (3 & p) << 4 | w >> 4, _ = 1 < S ? (15 & w) << 2 | v >> 6 : 64, o = 2 < S ? 63 & v : 64, g.push(i.charAt(x) + i.charAt(u) + i.charAt(_) + i.charAt(o));
+          return g.join("");
+        }, a.decode = function(l) {
+          var p, w, v, x, u, _, o = 0, g = 0, h = "data:";
+          if (l.substr(0, h.length) === h) throw new Error("Invalid base64 input, it looks like a data url.");
+          var b, S = 3 * (l = l.replace(/[^A-Za-z0-9+/=]/g, "")).length / 4;
+          if (l.charAt(l.length - 1) === i.charAt(64) && S--, l.charAt(l.length - 2) === i.charAt(64) && S--, S % 1 != 0) throw new Error("Invalid base64 input, bad content length.");
+          for (b = r.uint8array ? new Uint8Array(0 | S) : new Array(0 | S); o < l.length; ) p = i.indexOf(l.charAt(o++)) << 2 | (x = i.indexOf(l.charAt(o++))) >> 4, w = (15 & x) << 4 | (u = i.indexOf(l.charAt(o++))) >> 2, v = (3 & u) << 6 | (_ = i.indexOf(l.charAt(o++))), b[g++] = p, u !== 64 && (b[g++] = w), _ !== 64 && (b[g++] = v);
+          return b;
+        };
+      }, { "./support": 30, "./utils": 32 }], 2: [function(e, f, a) {
+        var n = e("./external"), r = e("./stream/DataWorker"), i = e("./stream/Crc32Probe"), l = e("./stream/DataLengthProbe");
+        function p(w, v, x, u, _) {
+          this.compressedSize = w, this.uncompressedSize = v, this.crc32 = x, this.compression = u, this.compressedContent = _;
+        }
+        p.prototype = { getContentWorker: function() {
+          var w = new r(n.Promise.resolve(this.compressedContent)).pipe(this.compression.uncompressWorker()).pipe(new l("data_length")), v = this;
+          return w.on("end", function() {
+            if (this.streamInfo.data_length !== v.uncompressedSize) throw new Error("Bug : uncompressed data size mismatch");
+          }), w;
+        }, getCompressedWorker: function() {
+          return new r(n.Promise.resolve(this.compressedContent)).withStreamInfo("compressedSize", this.compressedSize).withStreamInfo("uncompressedSize", this.uncompressedSize).withStreamInfo("crc32", this.crc32).withStreamInfo("compression", this.compression);
+        } }, p.createWorkerFrom = function(w, v, x) {
+          return w.pipe(new i()).pipe(new l("uncompressedSize")).pipe(v.compressWorker(x)).pipe(new l("compressedSize")).withStreamInfo("compression", v);
+        }, f.exports = p;
+      }, { "./external": 6, "./stream/Crc32Probe": 25, "./stream/DataLengthProbe": 26, "./stream/DataWorker": 27 }], 3: [function(e, f, a) {
+        var n = e("./stream/GenericWorker");
+        a.STORE = { magic: "\0\0", compressWorker: function() {
+          return new n("STORE compression");
+        }, uncompressWorker: function() {
+          return new n("STORE decompression");
+        } }, a.DEFLATE = e("./flate");
+      }, { "./flate": 7, "./stream/GenericWorker": 28 }], 4: [function(e, f, a) {
+        var n = e("./utils"), r = (function() {
+          for (var i, l = [], p = 0; p < 256; p++) {
+            i = p;
+            for (var w = 0; w < 8; w++) i = 1 & i ? 3988292384 ^ i >>> 1 : i >>> 1;
+            l[p] = i;
+          }
+          return l;
+        })();
+        f.exports = function(i, l) {
+          return i !== void 0 && i.length ? n.getTypeOf(i) !== "string" ? (function(p, w, v, x) {
+            var u = r, _ = x + v;
+            p ^= -1;
+            for (var o = x; o < _; o++) p = p >>> 8 ^ u[255 & (p ^ w[o])];
+            return -1 ^ p;
+          })(0 | l, i, i.length, 0) : (function(p, w, v, x) {
+            var u = r, _ = x + v;
+            p ^= -1;
+            for (var o = x; o < _; o++) p = p >>> 8 ^ u[255 & (p ^ w.charCodeAt(o))];
+            return -1 ^ p;
+          })(0 | l, i, i.length, 0) : 0;
+        };
+      }, { "./utils": 32 }], 5: [function(e, f, a) {
+        a.base64 = !1, a.binary = !1, a.dir = !1, a.createFolders = !0, a.date = null, a.compression = null, a.compressionOptions = null, a.comment = null, a.unixPermissions = null, a.dosPermissions = null;
+      }, {}], 6: [function(e, f, a) {
+        var n = null;
+        n = typeof Promise < "u" ? Promise : e("lie"), f.exports = { Promise: n };
+      }, { lie: 37 }], 7: [function(e, f, a) {
+        var n = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Uint32Array < "u", r = e("pako"), i = e("./utils"), l = e("./stream/GenericWorker"), p = n ? "uint8array" : "array";
+        function w(v, x) {
+          l.call(this, "FlateWorker/" + v), this._pako = null, this._pakoAction = v, this._pakoOptions = x, this.meta = {};
+        }
+        a.magic = "\b\0", i.inherits(w, l), w.prototype.processChunk = function(v) {
+          this.meta = v.meta, this._pako === null && this._createPako(), this._pako.push(i.transformTo(p, v.data), !1);
+        }, w.prototype.flush = function() {
+          l.prototype.flush.call(this), this._pako === null && this._createPako(), this._pako.push([], !0);
+        }, w.prototype.cleanUp = function() {
+          l.prototype.cleanUp.call(this), this._pako = null;
+        }, w.prototype._createPako = function() {
+          this._pako = new r[this._pakoAction]({ raw: !0, level: this._pakoOptions.level || -1 });
+          var v = this;
+          this._pako.onData = function(x) {
+            v.push({ data: x, meta: v.meta });
+          };
+        }, a.compressWorker = function(v) {
+          return new w("Deflate", v);
+        }, a.uncompressWorker = function() {
+          return new w("Inflate", {});
+        };
+      }, { "./stream/GenericWorker": 28, "./utils": 32, pako: 38 }], 8: [function(e, f, a) {
+        function n(u, _) {
+          var o, g = "";
+          for (o = 0; o < _; o++) g += String.fromCharCode(255 & u), u >>>= 8;
+          return g;
+        }
+        function r(u, _, o, g, h, b) {
+          var S, z, E = u.file, R = u.compression, B = b !== p.utf8encode, L = i.transformTo("string", b(E.name)), P = i.transformTo("string", p.utf8encode(E.name)), W = E.comment, Y = i.transformTo("string", b(W)), k = i.transformTo("string", p.utf8encode(W)), F = P.length !== E.name.length, s = k.length !== W.length, j = "", Q = "", U = "", tt = E.dir, M = E.date, q = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
+          _ && !o || (q.crc32 = u.crc32, q.compressedSize = u.compressedSize, q.uncompressedSize = u.uncompressedSize);
+          var O = 0;
+          _ && (O |= 8), B || !F && !s || (O |= 2048);
+          var I = 0, J = 0;
+          tt && (I |= 16), h === "UNIX" ? (J = 798, I |= (function(X, st) {
+            var lt = X;
+            return X || (lt = st ? 16893 : 33204), (65535 & lt) << 16;
+          })(E.unixPermissions, tt)) : (J = 20, I |= (function(X) {
+            return 63 & (X || 0);
+          })(E.dosPermissions)), S = M.getUTCHours(), S <<= 6, S |= M.getUTCMinutes(), S <<= 5, S |= M.getUTCSeconds() / 2, z = M.getUTCFullYear() - 1980, z <<= 4, z |= M.getUTCMonth() + 1, z <<= 5, z |= M.getUTCDate(), F && (Q = n(1, 1) + n(w(L), 4) + P, j += "up" + n(Q.length, 2) + Q), s && (U = n(1, 1) + n(w(Y), 4) + k, j += "uc" + n(U.length, 2) + U);
+          var G = "";
+          return G += `
+\0`, G += n(O, 2), G += R.magic, G += n(S, 2), G += n(z, 2), G += n(q.crc32, 4), G += n(q.compressedSize, 4), G += n(q.uncompressedSize, 4), G += n(L.length, 2), G += n(j.length, 2), { fileRecord: v.LOCAL_FILE_HEADER + G + L + j, dirRecord: v.CENTRAL_FILE_HEADER + n(J, 2) + G + n(Y.length, 2) + "\0\0\0\0" + n(I, 4) + n(g, 4) + L + j + Y };
+        }
+        var i = e("../utils"), l = e("../stream/GenericWorker"), p = e("../utf8"), w = e("../crc32"), v = e("../signature");
+        function x(u, _, o, g) {
+          l.call(this, "ZipFileWorker"), this.bytesWritten = 0, this.zipComment = _, this.zipPlatform = o, this.encodeFileName = g, this.streamFiles = u, this.accumulate = !1, this.contentBuffer = [], this.dirRecords = [], this.currentSourceOffset = 0, this.entriesCount = 0, this.currentFile = null, this._sources = [];
+        }
+        i.inherits(x, l), x.prototype.push = function(u) {
+          var _ = u.meta.percent || 0, o = this.entriesCount, g = this._sources.length;
+          this.accumulate ? this.contentBuffer.push(u) : (this.bytesWritten += u.data.length, l.prototype.push.call(this, { data: u.data, meta: { currentFile: this.currentFile, percent: o ? (_ + 100 * (o - g - 1)) / o : 100 } }));
+        }, x.prototype.openedSource = function(u) {
+          this.currentSourceOffset = this.bytesWritten, this.currentFile = u.file.name;
+          var _ = this.streamFiles && !u.file.dir;
+          if (_) {
+            var o = r(u, _, !1, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
+            this.push({ data: o.fileRecord, meta: { percent: 0 } });
+          } else this.accumulate = !0;
+        }, x.prototype.closedSource = function(u) {
+          this.accumulate = !1;
+          var _ = this.streamFiles && !u.file.dir, o = r(u, _, !0, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
+          if (this.dirRecords.push(o.dirRecord), _) this.push({ data: (function(g) {
+            return v.DATA_DESCRIPTOR + n(g.crc32, 4) + n(g.compressedSize, 4) + n(g.uncompressedSize, 4);
+          })(u), meta: { percent: 100 } });
+          else for (this.push({ data: o.fileRecord, meta: { percent: 0 } }); this.contentBuffer.length; ) this.push(this.contentBuffer.shift());
+          this.currentFile = null;
+        }, x.prototype.flush = function() {
+          for (var u = this.bytesWritten, _ = 0; _ < this.dirRecords.length; _++) this.push({ data: this.dirRecords[_], meta: { percent: 100 } });
+          var o = this.bytesWritten - u, g = (function(h, b, S, z, E) {
+            var R = i.transformTo("string", E(z));
+            return v.CENTRAL_DIRECTORY_END + "\0\0\0\0" + n(h, 2) + n(h, 2) + n(b, 4) + n(S, 4) + n(R.length, 2) + R;
+          })(this.dirRecords.length, o, u, this.zipComment, this.encodeFileName);
+          this.push({ data: g, meta: { percent: 100 } });
+        }, x.prototype.prepareNextSource = function() {
+          this.previous = this._sources.shift(), this.openedSource(this.previous.streamInfo), this.isPaused ? this.previous.pause() : this.previous.resume();
+        }, x.prototype.registerPrevious = function(u) {
+          this._sources.push(u);
+          var _ = this;
+          return u.on("data", function(o) {
+            _.processChunk(o);
+          }), u.on("end", function() {
+            _.closedSource(_.previous.streamInfo), _._sources.length ? _.prepareNextSource() : _.end();
+          }), u.on("error", function(o) {
+            _.error(o);
+          }), this;
+        }, x.prototype.resume = function() {
+          return !!l.prototype.resume.call(this) && (!this.previous && this._sources.length ? (this.prepareNextSource(), !0) : this.previous || this._sources.length || this.generatedError ? void 0 : (this.end(), !0));
+        }, x.prototype.error = function(u) {
+          var _ = this._sources;
+          if (!l.prototype.error.call(this, u)) return !1;
+          for (var o = 0; o < _.length; o++) try {
+            _[o].error(u);
+          } catch {
+          }
+          return !0;
+        }, x.prototype.lock = function() {
+          l.prototype.lock.call(this);
+          for (var u = this._sources, _ = 0; _ < u.length; _++) u[_].lock();
+        }, f.exports = x;
+      }, { "../crc32": 4, "../signature": 23, "../stream/GenericWorker": 28, "../utf8": 31, "../utils": 32 }], 9: [function(e, f, a) {
+        var n = e("../compressions"), r = e("./ZipFileWorker");
+        a.generateWorker = function(i, l, p) {
+          var w = new r(l.streamFiles, p, l.platform, l.encodeFileName), v = 0;
+          try {
+            i.forEach(function(x, u) {
+              v++;
+              var _ = (function(b, S) {
+                var z = b || S, E = n[z];
+                if (!E) throw new Error(z + " is not a valid compression method !");
+                return E;
+              })(u.options.compression, l.compression), o = u.options.compressionOptions || l.compressionOptions || {}, g = u.dir, h = u.date;
+              u._compressWorker(_, o).withStreamInfo("file", { name: x, dir: g, date: h, comment: u.comment || "", unixPermissions: u.unixPermissions, dosPermissions: u.dosPermissions }).pipe(w);
+            }), w.entriesCount = v;
+          } catch (x) {
+            w.error(x);
+          }
+          return w;
+        };
+      }, { "../compressions": 3, "./ZipFileWorker": 8 }], 10: [function(e, f, a) {
+        function n() {
+          if (!(this instanceof n)) return new n();
+          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 r = new n();
+            for (var i in this) typeof this[i] != "function" && (r[i] = this[i]);
+            return r;
+          };
+        }
+        (n.prototype = e("./object")).loadAsync = e("./load"), n.support = e("./support"), n.defaults = e("./defaults"), n.version = "3.10.1", n.loadAsync = function(r, i) {
+          return new n().loadAsync(r, i);
+        }, n.external = e("./external"), f.exports = n;
+      }, { "./defaults": 5, "./external": 6, "./load": 11, "./object": 15, "./support": 30 }], 11: [function(e, f, a) {
+        var n = e("./utils"), r = e("./external"), i = e("./utf8"), l = e("./zipEntries"), p = e("./stream/Crc32Probe"), w = e("./nodejsUtils");
+        function v(x) {
+          return new r.Promise(function(u, _) {
+            var o = x.decompressed.getContentWorker().pipe(new p());
+            o.on("error", function(g) {
+              _(g);
+            }).on("end", function() {
+              o.streamInfo.crc32 !== x.decompressed.crc32 ? _(new Error("Corrupted zip : CRC32 mismatch")) : u();
+            }).resume();
+          });
+        }
+        f.exports = function(x, u) {
+          var _ = this;
+          return u = n.extend(u || {}, { base64: !1, checkCRC32: !1, optimizedBinaryString: !1, createFolders: !1, decodeFileName: i.utf8decode }), w.isNode && w.isStream(x) ? r.Promise.reject(new Error("JSZip can't accept a stream when loading a zip file.")) : n.prepareContent("the loaded zip file", x, !0, u.optimizedBinaryString, u.base64).then(function(o) {
+            var g = new l(u);
+            return g.load(o), g;
+          }).then(function(o) {
+            var g = [r.Promise.resolve(o)], h = o.files;
+            if (u.checkCRC32) for (var b = 0; b < h.length; b++) g.push(v(h[b]));
+            return r.Promise.all(g);
+          }).then(function(o) {
+            for (var g = o.shift(), h = g.files, b = 0; b < h.length; b++) {
+              var S = h[b], z = S.fileNameStr, E = n.resolve(S.fileNameStr);
+              _.file(E, S.decompressed, { binary: !0, optimizedBinaryString: !0, date: S.date, dir: S.dir, comment: S.fileCommentStr.length ? S.fileCommentStr : null, unixPermissions: S.unixPermissions, dosPermissions: S.dosPermissions, createFolders: u.createFolders }), S.dir || (_.file(E).unsafeOriginalName = z);
+            }
+            return g.zipComment.length && (_.comment = g.zipComment), _;
+          });
+        };
+      }, { "./external": 6, "./nodejsUtils": 14, "./stream/Crc32Probe": 25, "./utf8": 31, "./utils": 32, "./zipEntries": 33 }], 12: [function(e, f, a) {
+        var n = e("../utils"), r = e("../stream/GenericWorker");
+        function i(l, p) {
+          r.call(this, "Nodejs stream input adapter for " + l), this._upstreamEnded = !1, this._bindStream(p);
+        }
+        n.inherits(i, r), i.prototype._bindStream = function(l) {
+          var p = this;
+          (this._stream = l).pause(), l.on("data", function(w) {
+            p.push({ data: w, meta: { percent: 0 } });
+          }).on("error", function(w) {
+            p.isPaused ? this.generatedError = w : p.error(w);
+          }).on("end", function() {
+            p.isPaused ? p._upstreamEnded = !0 : p.end();
+          });
+        }, i.prototype.pause = function() {
+          return !!r.prototype.pause.call(this) && (this._stream.pause(), !0);
+        }, i.prototype.resume = function() {
+          return !!r.prototype.resume.call(this) && (this._upstreamEnded ? this.end() : this._stream.resume(), !0);
+        }, f.exports = i;
+      }, { "../stream/GenericWorker": 28, "../utils": 32 }], 13: [function(e, f, a) {
+        var n = e("readable-stream").Readable;
+        function r(i, l, p) {
+          n.call(this, l), this._helper = i;
+          var w = this;
+          i.on("data", function(v, x) {
+            w.push(v) || w._helper.pause(), p && p(x);
+          }).on("error", function(v) {
+            w.emit("error", v);
+          }).on("end", function() {
+            w.push(null);
+          });
+        }
+        e("../utils").inherits(r, n), r.prototype._read = function() {
+          this._helper.resume();
+        }, f.exports = r;
+      }, { "../utils": 32, "readable-stream": 16 }], 14: [function(e, f, a) {
+        f.exports = { isNode: typeof Buffer < "u", newBufferFrom: function(n, r) {
+          if (Buffer.from && Buffer.from !== Uint8Array.from) return Buffer.from(n, r);
+          if (typeof n == "number") throw new Error('The "data" argument must not be a number');
+          return new Buffer(n, r);
+        }, allocBuffer: function(n) {
+          if (Buffer.alloc) return Buffer.alloc(n);
+          var r = new Buffer(n);
+          return r.fill(0), r;
+        }, isBuffer: function(n) {
+          return Buffer.isBuffer(n);
+        }, isStream: function(n) {
+          return n && typeof n.on == "function" && typeof n.pause == "function" && typeof n.resume == "function";
+        } };
+      }, {}], 15: [function(e, f, a) {
+        function n(E, R, B) {
+          var L, P = i.getTypeOf(R), W = i.extend(B || {}, w);
+          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 && (E = h(E)), W.createFolders && (L = g(E)) && b.call(this, L, !0);
+          var Y = P === "string" && W.binary === !1 && W.base64 === !1;
+          B && B.binary !== void 0 || (W.binary = !Y), (R instanceof v && R.uncompressedSize === 0 || W.dir || !R || R.length === 0) && (W.base64 = !1, W.binary = !0, R = "", W.compression = "STORE", P = "string");
+          var k = null;
+          k = R instanceof v || R instanceof l ? R : _.isNode && _.isStream(R) ? new o(E, R) : i.prepareContent(E, R, W.binary, W.optimizedBinaryString, W.base64);
+          var F = new x(E, k, W);
+          this.files[E] = F;
+        }
+        var r = e("./utf8"), i = e("./utils"), l = e("./stream/GenericWorker"), p = e("./stream/StreamHelper"), w = e("./defaults"), v = e("./compressedObject"), x = e("./zipObject"), u = e("./generate"), _ = e("./nodejsUtils"), o = e("./nodejs/NodejsStreamInputAdapter"), g = function(E) {
+          E.slice(-1) === "/" && (E = E.substring(0, E.length - 1));
+          var R = E.lastIndexOf("/");
+          return 0 < R ? E.substring(0, R) : "";
+        }, h = function(E) {
+          return E.slice(-1) !== "/" && (E += "/"), E;
+        }, b = function(E, R) {
+          return R = R !== void 0 ? R : w.createFolders, E = h(E), this.files[E] || n.call(this, E, null, { dir: !0, createFolders: R }), this.files[E];
+        };
+        function S(E) {
+          return Object.prototype.toString.call(E) === "[object RegExp]";
+        }
+        var z = { load: function() {
+          throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
+        }, forEach: function(E) {
+          var R, B, L;
+          for (R in this.files) L = this.files[R], (B = R.slice(this.root.length, R.length)) && R.slice(0, this.root.length) === this.root && E(B, L);
+        }, filter: function(E) {
+          var R = [];
+          return this.forEach(function(B, L) {
+            E(B, L) && R.push(L);
+          }), R;
+        }, file: function(E, R, B) {
+          if (arguments.length !== 1) return E = this.root + E, n.call(this, E, R, B), this;
+          if (S(E)) {
+            var L = E;
+            return this.filter(function(W, Y) {
+              return !Y.dir && L.test(W);
+            });
+          }
+          var P = this.files[this.root + E];
+          return P && !P.dir ? P : null;
+        }, folder: function(E) {
+          if (!E) return this;
+          if (S(E)) return this.filter(function(P, W) {
+            return W.dir && E.test(P);
+          });
+          var R = this.root + E, B = b.call(this, R), L = this.clone();
+          return L.root = B.name, L;
+        }, remove: function(E) {
+          E = this.root + E;
+          var R = this.files[E];
+          if (R || (E.slice(-1) !== "/" && (E += "/"), R = this.files[E]), R && !R.dir) delete this.files[E];
+          else for (var B = this.filter(function(P, W) {
+            return W.name.slice(0, E.length) === E;
+          }), L = 0; L < B.length; L++) delete this.files[B[L].name];
+          return this;
+        }, generate: function() {
+          throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
+        }, generateInternalStream: function(E) {
+          var R, B = {};
+          try {
+            if ((B = i.extend(E || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: r.utf8encode })).type = B.type.toLowerCase(), B.compression = B.compression.toUpperCase(), B.type === "binarystring" && (B.type = "string"), !B.type) throw new Error("No output type specified.");
+            i.checkSupport(B.type), B.platform !== "darwin" && B.platform !== "freebsd" && B.platform !== "linux" && B.platform !== "sunos" || (B.platform = "UNIX"), B.platform === "win32" && (B.platform = "DOS");
+            var L = B.comment || this.comment || "";
+            R = u.generateWorker(this, B, L);
+          } catch (P) {
+            (R = new l("error")).error(P);
+          }
+          return new p(R, B.type || "string", B.mimeType);
+        }, generateAsync: function(E, R) {
+          return this.generateInternalStream(E).accumulate(R);
+        }, generateNodeStream: function(E, R) {
+          return (E = E || {}).type || (E.type = "nodebuffer"), this.generateInternalStream(E).toNodejsStream(R);
+        } };
+        f.exports = z;
+      }, { "./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(e, f, a) {
+        f.exports = e("stream");
+      }, { stream: void 0 }], 17: [function(e, f, a) {
+        var n = e("./DataReader");
+        function r(i) {
+          n.call(this, i);
+          for (var l = 0; l < this.data.length; l++) i[l] = 255 & i[l];
+        }
+        e("../utils").inherits(r, n), r.prototype.byteAt = function(i) {
+          return this.data[this.zero + i];
+        }, r.prototype.lastIndexOfSignature = function(i) {
+          for (var l = i.charCodeAt(0), p = i.charCodeAt(1), w = i.charCodeAt(2), v = i.charCodeAt(3), x = this.length - 4; 0 <= x; --x) if (this.data[x] === l && this.data[x + 1] === p && this.data[x + 2] === w && this.data[x + 3] === v) return x - this.zero;
+          return -1;
+        }, r.prototype.readAndCheckSignature = function(i) {
+          var l = i.charCodeAt(0), p = i.charCodeAt(1), w = i.charCodeAt(2), v = i.charCodeAt(3), x = this.readData(4);
+          return l === x[0] && p === x[1] && w === x[2] && v === x[3];
+        }, r.prototype.readData = function(i) {
+          if (this.checkOffset(i), i === 0) return [];
+          var l = this.data.slice(this.zero + this.index, this.zero + this.index + i);
+          return this.index += i, l;
+        }, f.exports = r;
+      }, { "../utils": 32, "./DataReader": 18 }], 18: [function(e, f, a) {
+        var n = e("../utils");
+        function r(i) {
+          this.data = i, this.length = i.length, this.index = 0, this.zero = 0;
+        }
+        r.prototype = { checkOffset: function(i) {
+          this.checkIndex(this.index + i);
+        }, checkIndex: function(i) {
+          if (this.length < this.zero + i || i < 0) throw new Error("End of data reached (data length = " + this.length + ", asked index = " + i + "). Corrupted zip ?");
+        }, setIndex: function(i) {
+          this.checkIndex(i), this.index = i;
+        }, skip: function(i) {
+          this.setIndex(this.index + i);
+        }, byteAt: function() {
+        }, readInt: function(i) {
+          var l, p = 0;
+          for (this.checkOffset(i), l = this.index + i - 1; l >= this.index; l--) p = (p << 8) + this.byteAt(l);
+          return this.index += i, p;
+        }, readString: function(i) {
+          return n.transformTo("string", this.readData(i));
+        }, readData: function() {
+        }, lastIndexOfSignature: function() {
+        }, readAndCheckSignature: function() {
+        }, readDate: function() {
+          var i = this.readInt(4);
+          return new Date(Date.UTC(1980 + (i >> 25 & 127), (i >> 21 & 15) - 1, i >> 16 & 31, i >> 11 & 31, i >> 5 & 63, (31 & i) << 1));
+        } }, f.exports = r;
+      }, { "../utils": 32 }], 19: [function(e, f, a) {
+        var n = e("./Uint8ArrayReader");
+        function r(i) {
+          n.call(this, i);
+        }
+        e("../utils").inherits(r, n), r.prototype.readData = function(i) {
+          this.checkOffset(i);
+          var l = this.data.slice(this.zero + this.index, this.zero + this.index + i);
+          return this.index += i, l;
+        }, f.exports = r;
+      }, { "../utils": 32, "./Uint8ArrayReader": 21 }], 20: [function(e, f, a) {
+        var n = e("./DataReader");
+        function r(i) {
+          n.call(this, i);
+        }
+        e("../utils").inherits(r, n), r.prototype.byteAt = function(i) {
+          return this.data.charCodeAt(this.zero + i);
+        }, r.prototype.lastIndexOfSignature = function(i) {
+          return this.data.lastIndexOf(i) - this.zero;
+        }, r.prototype.readAndCheckSignature = function(i) {
+          return i === this.readData(4);
+        }, r.prototype.readData = function(i) {
+          this.checkOffset(i);
+          var l = this.data.slice(this.zero + this.index, this.zero + this.index + i);
+          return this.index += i, l;
+        }, f.exports = r;
+      }, { "../utils": 32, "./DataReader": 18 }], 21: [function(e, f, a) {
+        var n = e("./ArrayReader");
+        function r(i) {
+          n.call(this, i);
+        }
+        e("../utils").inherits(r, n), r.prototype.readData = function(i) {
+          if (this.checkOffset(i), i === 0) return new Uint8Array(0);
+          var l = this.data.subarray(this.zero + this.index, this.zero + this.index + i);
+          return this.index += i, l;
+        }, f.exports = r;
+      }, { "../utils": 32, "./ArrayReader": 17 }], 22: [function(e, f, a) {
+        var n = e("../utils"), r = e("../support"), i = e("./ArrayReader"), l = e("./StringReader"), p = e("./NodeBufferReader"), w = e("./Uint8ArrayReader");
+        f.exports = function(v) {
+          var x = n.getTypeOf(v);
+          return n.checkSupport(x), x !== "string" || r.uint8array ? x === "nodebuffer" ? new p(v) : r.uint8array ? new w(n.transformTo("uint8array", v)) : new i(n.transformTo("array", v)) : new l(v);
+        };
+      }, { "../support": 30, "../utils": 32, "./ArrayReader": 17, "./NodeBufferReader": 19, "./StringReader": 20, "./Uint8ArrayReader": 21 }], 23: [function(e, f, a) {
+        a.LOCAL_FILE_HEADER = "PK", a.CENTRAL_FILE_HEADER = "PK
", a.CENTRAL_DIRECTORY_END = "PK", a.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x07", a.ZIP64_CENTRAL_DIRECTORY_END = "PK", a.DATA_DESCRIPTOR = "PK\x07\b";
+      }, {}], 24: [function(e, f, a) {
+        var n = e("./GenericWorker"), r = e("../utils");
+        function i(l) {
+          n.call(this, "ConvertWorker to " + l), this.destType = l;
+        }
+        r.inherits(i, n), i.prototype.processChunk = function(l) {
+          this.push({ data: r.transformTo(this.destType, l.data), meta: l.meta });
+        }, f.exports = i;
+      }, { "../utils": 32, "./GenericWorker": 28 }], 25: [function(e, f, a) {
+        var n = e("./GenericWorker"), r = e("../crc32");
+        function i() {
+          n.call(this, "Crc32Probe"), this.withStreamInfo("crc32", 0);
+        }
+        e("../utils").inherits(i, n), i.prototype.processChunk = function(l) {
+          this.streamInfo.crc32 = r(l.data, this.streamInfo.crc32 || 0), this.push(l);
+        }, f.exports = i;
+      }, { "../crc32": 4, "../utils": 32, "./GenericWorker": 28 }], 26: [function(e, f, a) {
+        var n = e("../utils"), r = e("./GenericWorker");
+        function i(l) {
+          r.call(this, "DataLengthProbe for " + l), this.propName = l, this.withStreamInfo(l, 0);
+        }
+        n.inherits(i, r), i.prototype.processChunk = function(l) {
+          if (l) {
+            var p = this.streamInfo[this.propName] || 0;
+            this.streamInfo[this.propName] = p + l.data.length;
+          }
+          r.prototype.processChunk.call(this, l);
+        }, f.exports = i;
+      }, { "../utils": 32, "./GenericWorker": 28 }], 27: [function(e, f, a) {
+        var n = e("../utils"), r = e("./GenericWorker");
+        function i(l) {
+          r.call(this, "DataWorker");
+          var p = this;
+          this.dataIsReady = !1, this.index = 0, this.max = 0, this.data = null, this.type = "", this._tickScheduled = !1, l.then(function(w) {
+            p.dataIsReady = !0, p.data = w, p.max = w && w.length || 0, p.type = n.getTypeOf(w), p.isPaused || p._tickAndRepeat();
+          }, function(w) {
+            p.error(w);
+          });
+        }
+        n.inherits(i, r), i.prototype.cleanUp = function() {
+          r.prototype.cleanUp.call(this), this.data = null;
+        }, i.prototype.resume = function() {
+          return !!r.prototype.resume.call(this) && (!this._tickScheduled && this.dataIsReady && (this._tickScheduled = !0, n.delay(this._tickAndRepeat, [], this)), !0);
+        }, i.prototype._tickAndRepeat = function() {
+          this._tickScheduled = !1, this.isPaused || this.isFinished || (this._tick(), this.isFinished || (n.delay(this._tickAndRepeat, [], this), this._tickScheduled = !0));
+        }, i.prototype._tick = function() {
+          if (this.isPaused || this.isFinished) return !1;
+          var l = null, p = Math.min(this.max, this.index + 16384);
+          if (this.index >= this.max) return this.end();
+          switch (this.type) {
+            case "string":
+              l = this.data.substring(this.index, p);
+              break;
+            case "uint8array":
+              l = this.data.subarray(this.index, p);
+              break;
+            case "array":
+            case "nodebuffer":
+              l = this.data.slice(this.index, p);
+          }
+          return this.index = p, this.push({ data: l, meta: { percent: this.max ? this.index / this.max * 100 : 0 } });
+        }, f.exports = i;
+      }, { "../utils": 32, "./GenericWorker": 28 }], 28: [function(e, f, a) {
+        function n(r) {
+          this.name = r || "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;
+        }
+        n.prototype = { push: function(r) {
+          this.emit("data", r);
+        }, end: function() {
+          if (this.isFinished) return !1;
+          this.flush();
+          try {
+            this.emit("end"), this.cleanUp(), this.isFinished = !0;
+          } catch (r) {
+            this.emit("error", r);
+          }
+          return !0;
+        }, error: function(r) {
+          return !this.isFinished && (this.isPaused ? this.generatedError = r : (this.isFinished = !0, this.emit("error", r), this.previous && this.previous.error(r), this.cleanUp()), !0);
+        }, on: function(r, i) {
+          return this._listeners[r].push(i), this;
+        }, cleanUp: function() {
+          this.streamInfo = this.generatedError = this.extraStreamInfo = null, this._listeners = [];
+        }, emit: function(r, i) {
+          if (this._listeners[r]) for (var l = 0; l < this._listeners[r].length; l++) this._listeners[r][l].call(this, i);
+        }, pipe: function(r) {
+          return r.registerPrevious(this);
+        }, registerPrevious: function(r) {
+          if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
+          this.streamInfo = r.streamInfo, this.mergeStreamInfo(), this.previous = r;
+          var i = this;
+          return r.on("data", function(l) {
+            i.processChunk(l);
+          }), r.on("end", function() {
+            i.end();
+          }), r.on("error", function(l) {
+            i.error(l);
+          }), 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 r = this.isPaused = !1;
+          return this.generatedError && (this.error(this.generatedError), r = !0), this.previous && this.previous.resume(), !r;
+        }, flush: function() {
+        }, processChunk: function(r) {
+          this.push(r);
+        }, withStreamInfo: function(r, i) {
+          return this.extraStreamInfo[r] = i, this.mergeStreamInfo(), this;
+        }, mergeStreamInfo: function() {
+          for (var r in this.extraStreamInfo) Object.prototype.hasOwnProperty.call(this.extraStreamInfo, r) && (this.streamInfo[r] = this.extraStreamInfo[r]);
+        }, 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 r = "Worker " + this.name;
+          return this.previous ? this.previous + " -> " + r : r;
+        } }, f.exports = n;
+      }, {}], 29: [function(e, f, a) {
+        var n = e("../utils"), r = e("./ConvertWorker"), i = e("./GenericWorker"), l = e("../base64"), p = e("../support"), w = e("../external"), v = null;
+        if (p.nodestream) try {
+          v = e("../nodejs/NodejsStreamOutputAdapter");
+        } catch {
+        }
+        function x(_, o) {
+          return new w.Promise(function(g, h) {
+            var b = [], S = _._internalType, z = _._outputType, E = _._mimeType;
+            _.on("data", function(R, B) {
+              b.push(R), o && o(B);
+            }).on("error", function(R) {
+              b = [], h(R);
+            }).on("end", function() {
+              try {
+                var R = (function(B, L, P) {
+                  switch (B) {
+                    case "blob":
+                      return n.newBlob(n.transformTo("arraybuffer", L), P);
+                    case "base64":
+                      return l.encode(L);
+                    default:
+                      return n.transformTo(B, L);
+                  }
+                })(z, (function(B, L) {
+                  var P, W = 0, Y = null, k = 0;
+                  for (P = 0; P < L.length; P++) k += L[P].length;
+                  switch (B) {
+                    case "string":
+                      return L.join("");
+                    case "array":
+                      return Array.prototype.concat.apply([], L);
+                    case "uint8array":
+                      for (Y = new Uint8Array(k), P = 0; P < L.length; P++) Y.set(L[P], W), W += L[P].length;
+                      return Y;
+                    case "nodebuffer":
+                      return Buffer.concat(L);
+                    default:
+                      throw new Error("concat : unsupported type '" + B + "'");
+                  }
+                })(S, b), E);
+                g(R);
+              } catch (B) {
+                h(B);
+              }
+              b = [];
+            }).resume();
+          });
+        }
+        function u(_, o, g) {
+          var h = o;
+          switch (o) {
+            case "blob":
+            case "arraybuffer":
+              h = "uint8array";
+              break;
+            case "base64":
+              h = "string";
+          }
+          try {
+            this._internalType = h, this._outputType = o, this._mimeType = g, n.checkSupport(h), this._worker = _.pipe(new r(h)), _.lock();
+          } catch (b) {
+            this._worker = new i("error"), this._worker.error(b);
+          }
+        }
+        u.prototype = { accumulate: function(_) {
+          return x(this, _);
+        }, on: function(_, o) {
+          var g = this;
+          return _ === "data" ? this._worker.on(_, function(h) {
+            o.call(g, h.data, h.meta);
+          }) : this._worker.on(_, function() {
+            n.delay(o, arguments, g);
+          }), this;
+        }, resume: function() {
+          return n.delay(this._worker.resume, [], this._worker), this;
+        }, pause: function() {
+          return this._worker.pause(), this;
+        }, toNodejsStream: function(_) {
+          if (n.checkSupport("nodestream"), this._outputType !== "nodebuffer") throw new Error(this._outputType + " is not supported by this method");
+          return new v(this, { objectMode: this._outputType !== "nodebuffer" }, _);
+        } }, f.exports = u;
+      }, { "../base64": 1, "../external": 6, "../nodejs/NodejsStreamOutputAdapter": 13, "../support": 30, "../utils": 32, "./ConvertWorker": 24, "./GenericWorker": 28 }], 30: [function(e, f, a) {
+        if (a.base64 = !0, a.array = !0, a.string = !0, a.arraybuffer = typeof ArrayBuffer < "u" && typeof Uint8Array < "u", a.nodebuffer = typeof Buffer < "u", a.uint8array = typeof Uint8Array < "u", typeof ArrayBuffer > "u") a.blob = !1;
+        else {
+          var n = new ArrayBuffer(0);
+          try {
+            a.blob = new Blob([n], { type: "application/zip" }).size === 0;
+          } catch {
+            try {
+              var r = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
+              r.append(n), a.blob = r.getBlob("application/zip").size === 0;
+            } catch {
+              a.blob = !1;
+            }
+          }
+        }
+        try {
+          a.nodestream = !!e("readable-stream").Readable;
+        } catch {
+          a.nodestream = !1;
+        }
+      }, { "readable-stream": 16 }], 31: [function(e, f, a) {
+        for (var n = e("./utils"), r = e("./support"), i = e("./nodejsUtils"), l = e("./stream/GenericWorker"), p = new Array(256), w = 0; w < 256; w++) p[w] = 252 <= w ? 6 : 248 <= w ? 5 : 240 <= w ? 4 : 224 <= w ? 3 : 192 <= w ? 2 : 1;
+        p[254] = p[254] = 1;
+        function v() {
+          l.call(this, "utf-8 decode"), this.leftOver = null;
+        }
+        function x() {
+          l.call(this, "utf-8 encode");
+        }
+        a.utf8encode = function(u) {
+          return r.nodebuffer ? i.newBufferFrom(u, "utf-8") : (function(_) {
+            var o, g, h, b, S, z = _.length, E = 0;
+            for (b = 0; b < z; b++) (64512 & (g = _.charCodeAt(b))) == 55296 && b + 1 < z && (64512 & (h = _.charCodeAt(b + 1))) == 56320 && (g = 65536 + (g - 55296 << 10) + (h - 56320), b++), E += g < 128 ? 1 : g < 2048 ? 2 : g < 65536 ? 3 : 4;
+            for (o = r.uint8array ? new Uint8Array(E) : new Array(E), b = S = 0; S < E; b++) (64512 & (g = _.charCodeAt(b))) == 55296 && b + 1 < z && (64512 & (h = _.charCodeAt(b + 1))) == 56320 && (g = 65536 + (g - 55296 << 10) + (h - 56320), b++), g < 128 ? o[S++] = g : (g < 2048 ? o[S++] = 192 | g >>> 6 : (g < 65536 ? o[S++] = 224 | g >>> 12 : (o[S++] = 240 | g >>> 18, o[S++] = 128 | g >>> 12 & 63), o[S++] = 128 | g >>> 6 & 63), o[S++] = 128 | 63 & g);
+            return o;
+          })(u);
+        }, a.utf8decode = function(u) {
+          return r.nodebuffer ? n.transformTo("nodebuffer", u).toString("utf-8") : (function(_) {
+            var o, g, h, b, S = _.length, z = new Array(2 * S);
+            for (o = g = 0; o < S; ) if ((h = _[o++]) < 128) z[g++] = h;
+            else if (4 < (b = p[h])) z[g++] = 65533, o += b - 1;
+            else {
+              for (h &= b === 2 ? 31 : b === 3 ? 15 : 7; 1 < b && o < S; ) h = h << 6 | 63 & _[o++], b--;
+              1 < b ? z[g++] = 65533 : h < 65536 ? z[g++] = h : (h -= 65536, z[g++] = 55296 | h >> 10 & 1023, z[g++] = 56320 | 1023 & h);
+            }
+            return z.length !== g && (z.subarray ? z = z.subarray(0, g) : z.length = g), n.applyFromCharCode(z);
+          })(u = n.transformTo(r.uint8array ? "uint8array" : "array", u));
+        }, n.inherits(v, l), v.prototype.processChunk = function(u) {
+          var _ = n.transformTo(r.uint8array ? "uint8array" : "array", u.data);
+          if (this.leftOver && this.leftOver.length) {
+            if (r.uint8array) {
+              var o = _;
+              (_ = new Uint8Array(o.length + this.leftOver.length)).set(this.leftOver, 0), _.set(o, this.leftOver.length);
+            } else _ = this.leftOver.concat(_);
+            this.leftOver = null;
+          }
+          var g = (function(b, S) {
+            var z;
+            for ((S = S || b.length) > b.length && (S = b.length), z = S - 1; 0 <= z && (192 & b[z]) == 128; ) z--;
+            return z < 0 || z === 0 ? S : z + p[b[z]] > S ? z : S;
+          })(_), h = _;
+          g !== _.length && (r.uint8array ? (h = _.subarray(0, g), this.leftOver = _.subarray(g, _.length)) : (h = _.slice(0, g), this.leftOver = _.slice(g, _.length))), this.push({ data: a.utf8decode(h), meta: u.meta });
+        }, v.prototype.flush = function() {
+          this.leftOver && this.leftOver.length && (this.push({ data: a.utf8decode(this.leftOver), meta: {} }), this.leftOver = null);
+        }, a.Utf8DecodeWorker = v, n.inherits(x, l), x.prototype.processChunk = function(u) {
+          this.push({ data: a.utf8encode(u.data), meta: u.meta });
+        }, a.Utf8EncodeWorker = x;
+      }, { "./nodejsUtils": 14, "./stream/GenericWorker": 28, "./support": 30, "./utils": 32 }], 32: [function(e, f, a) {
+        var n = e("./support"), r = e("./base64"), i = e("./nodejsUtils"), l = e("./external");
+        function p(o) {
+          return o;
+        }
+        function w(o, g) {
+          for (var h = 0; h < o.length; ++h) g[h] = 255 & o.charCodeAt(h);
+          return g;
+        }
+        e("setimmediate"), a.newBlob = function(o, g) {
+          a.checkSupport("blob");
+          try {
+            return new Blob([o], { type: g });
+          } catch {
+            try {
+              var h = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
+              return h.append(o), h.getBlob(g);
+            } catch {
+              throw new Error("Bug : can't construct the Blob.");
+            }
+          }
+        };
+        var v = { stringifyByChunk: function(o, g, h) {
+          var b = [], S = 0, z = o.length;
+          if (z <= h) return String.fromCharCode.apply(null, o);
+          for (; S < z; ) g === "array" || g === "nodebuffer" ? b.push(String.fromCharCode.apply(null, o.slice(S, Math.min(S + h, z)))) : b.push(String.fromCharCode.apply(null, o.subarray(S, Math.min(S + h, z)))), S += h;
+          return b.join("");
+        }, stringifyByChar: function(o) {
+          for (var g = "", h = 0; h < o.length; h++) g += String.fromCharCode(o[h]);
+          return g;
+        }, applyCanBeUsed: { uint8array: (function() {
+          try {
+            return n.uint8array && String.fromCharCode.apply(null, new Uint8Array(1)).length === 1;
+          } catch {
+            return !1;
+          }
+        })(), nodebuffer: (function() {
+          try {
+            return n.nodebuffer && String.fromCharCode.apply(null, i.allocBuffer(1)).length === 1;
+          } catch {
+            return !1;
+          }
+        })() } };
+        function x(o) {
+          var g = 65536, h = a.getTypeOf(o), b = !0;
+          if (h === "uint8array" ? b = v.applyCanBeUsed.uint8array : h === "nodebuffer" && (b = v.applyCanBeUsed.nodebuffer), b) for (; 1 < g; ) try {
+            return v.stringifyByChunk(o, h, g);
+          } catch {
+            g = Math.floor(g / 2);
+          }
+          return v.stringifyByChar(o);
+        }
+        function u(o, g) {
+          for (var h = 0; h < o.length; h++) g[h] = o[h];
+          return g;
+        }
+        a.applyFromCharCode = x;
+        var _ = {};
+        _.string = { string: p, array: function(o) {
+          return w(o, new Array(o.length));
+        }, arraybuffer: function(o) {
+          return _.string.uint8array(o).buffer;
+        }, uint8array: function(o) {
+          return w(o, new Uint8Array(o.length));
+        }, nodebuffer: function(o) {
+          return w(o, i.allocBuffer(o.length));
+        } }, _.array = { string: x, array: p, arraybuffer: function(o) {
+          return new Uint8Array(o).buffer;
+        }, uint8array: function(o) {
+          return new Uint8Array(o);
+        }, nodebuffer: function(o) {
+          return i.newBufferFrom(o);
+        } }, _.arraybuffer = { string: function(o) {
+          return x(new Uint8Array(o));
+        }, array: function(o) {
+          return u(new Uint8Array(o), new Array(o.byteLength));
+        }, arraybuffer: p, uint8array: function(o) {
+          return new Uint8Array(o);
+        }, nodebuffer: function(o) {
+          return i.newBufferFrom(new Uint8Array(o));
+        } }, _.uint8array = { string: x, array: function(o) {
+          return u(o, new Array(o.length));
+        }, arraybuffer: function(o) {
+          return o.buffer;
+        }, uint8array: p, nodebuffer: function(o) {
+          return i.newBufferFrom(o);
+        } }, _.nodebuffer = { string: x, array: function(o) {
+          return u(o, new Array(o.length));
+        }, arraybuffer: function(o) {
+          return _.nodebuffer.uint8array(o).buffer;
+        }, uint8array: function(o) {
+          return u(o, new Uint8Array(o.length));
+        }, nodebuffer: p }, a.transformTo = function(o, g) {
+          if (g = g || "", !o) return g;
+          a.checkSupport(o);
+          var h = a.getTypeOf(g);
+          return _[h][o](g);
+        }, a.resolve = function(o) {
+          for (var g = o.split("/"), h = [], b = 0; b < g.length; b++) {
+            var S = g[b];
+            S === "." || S === "" && b !== 0 && b !== g.length - 1 || (S === ".." ? h.pop() : h.push(S));
+          }
+          return h.join("/");
+        }, a.getTypeOf = function(o) {
+          return typeof o == "string" ? "string" : Object.prototype.toString.call(o) === "[object Array]" ? "array" : n.nodebuffer && i.isBuffer(o) ? "nodebuffer" : n.uint8array && o instanceof Uint8Array ? "uint8array" : n.arraybuffer && o instanceof ArrayBuffer ? "arraybuffer" : void 0;
+        }, a.checkSupport = function(o) {
+          if (!n[o.toLowerCase()]) throw new Error(o + " is not supported by this platform");
+        }, a.MAX_VALUE_16BITS = 65535, a.MAX_VALUE_32BITS = -1, a.pretty = function(o) {
+          var g, h, b = "";
+          for (h = 0; h < (o || "").length; h++) b += "\\x" + ((g = o.charCodeAt(h)) < 16 ? "0" : "") + g.toString(16).toUpperCase();
+          return b;
+        }, a.delay = function(o, g, h) {
+          setImmediate(function() {
+            o.apply(h || null, g || []);
+          });
+        }, a.inherits = function(o, g) {
+          function h() {
+          }
+          h.prototype = g.prototype, o.prototype = new h();
+        }, a.extend = function() {
+          var o, g, h = {};
+          for (o = 0; o < arguments.length; o++) for (g in arguments[o]) Object.prototype.hasOwnProperty.call(arguments[o], g) && h[g] === void 0 && (h[g] = arguments[o][g]);
+          return h;
+        }, a.prepareContent = function(o, g, h, b, S) {
+          return l.Promise.resolve(g).then(function(z) {
+            return n.blob && (z instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(z)) !== -1) && typeof FileReader < "u" ? new l.Promise(function(E, R) {
+              var B = new FileReader();
+              B.onload = function(L) {
+                E(L.target.result);
+              }, B.onerror = function(L) {
+                R(L.target.error);
+              }, B.readAsArrayBuffer(z);
+            }) : z;
+          }).then(function(z) {
+            var E = a.getTypeOf(z);
+            return E ? (E === "arraybuffer" ? z = a.transformTo("uint8array", z) : E === "string" && (S ? z = r.decode(z) : h && b !== !0 && (z = (function(R) {
+              return w(R, n.uint8array ? new Uint8Array(R.length) : new Array(R.length));
+            })(z))), z) : l.Promise.reject(new Error("Can't read the data of '" + o + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
+          });
+        };
+      }, { "./base64": 1, "./external": 6, "./nodejsUtils": 14, "./support": 30, setimmediate: 54 }], 33: [function(e, f, a) {
+        var n = e("./reader/readerFor"), r = e("./utils"), i = e("./signature"), l = e("./zipEntry"), p = e("./support");
+        function w(v) {
+          this.files = [], this.loadOptions = v;
+        }
+        w.prototype = { checkSignature: function(v) {
+          if (!this.reader.readAndCheckSignature(v)) {
+            this.reader.index -= 4;
+            var x = this.reader.readString(4);
+            throw new Error("Corrupted zip or bug: unexpected signature (" + r.pretty(x) + ", expected " + r.pretty(v) + ")");
+          }
+        }, isSignature: function(v, x) {
+          var u = this.reader.index;
+          this.reader.setIndex(v);
+          var _ = this.reader.readString(4) === x;
+          return this.reader.setIndex(u), _;
+        }, 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 v = this.reader.readData(this.zipCommentLength), x = p.uint8array ? "uint8array" : "array", u = r.transformTo(x, v);
+          this.zipComment = this.loadOptions.decodeFileName(u);
+        }, 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, x, u, _ = this.zip64EndOfCentralSize - 44; 0 < _; ) v = this.reader.readInt(2), x = this.reader.readInt(4), u = this.reader.readData(x), this.zip64ExtensibleData[v] = { id: v, length: x, value: u };
+        }, 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, x;
+          for (v = 0; v < this.files.length; v++) x = this.files[v], this.reader.setIndex(x.localHeaderOffset), this.checkSignature(i.LOCAL_FILE_HEADER), x.readLocalPart(this.reader), x.handleUTF8(), x.processAttributes();
+        }, readCentralDir: function() {
+          var v;
+          for (this.reader.setIndex(this.centralDirOffset); this.reader.readAndCheckSignature(i.CENTRAL_FILE_HEADER); ) (v = new l({ zip64: this.zip64 }, this.loadOptions)).readCentralPart(this.reader), this.files.push(v);
+          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 v = this.reader.lastIndexOfSignature(i.CENTRAL_DIRECTORY_END);
+          if (v < 0) throw this.isSignature(0, i.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(v);
+          var x = v;
+          if (this.checkSignature(i.CENTRAL_DIRECTORY_END), this.readBlockEndOfCentral(), this.diskNumber === r.MAX_VALUE_16BITS || this.diskWithCentralDirStart === r.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === r.MAX_VALUE_16BITS || this.centralDirRecords === r.MAX_VALUE_16BITS || this.centralDirSize === r.MAX_VALUE_32BITS || this.centralDirOffset === r.MAX_VALUE_32BITS) {
+            if (this.zip64 = !0, (v = this.reader.lastIndexOfSignature(i.ZIP64_CENTRAL_DIRECTORY_LOCATOR)) < 0) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator");
+            if (this.reader.setIndex(v), this.checkSignature(i.ZIP64_CENTRAL_DIRECTORY_LOCATOR), this.readBlockZip64EndOfCentralLocator(), !this.isSignature(this.relativeOffsetEndOfZip64CentralDir, i.ZIP64_CENTRAL_DIRECTORY_END) && (this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(i.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(i.ZIP64_CENTRAL_DIRECTORY_END), this.readBlockZip64EndOfCentral();
+          }
+          var u = this.centralDirOffset + this.centralDirSize;
+          this.zip64 && (u += 20, u += 12 + this.zip64EndOfCentralSize);
+          var _ = x - u;
+          if (0 < _) this.isSignature(x, i.CENTRAL_FILE_HEADER) || (this.reader.zero = _);
+          else if (_ < 0) throw new Error("Corrupted zip: missing " + Math.abs(_) + " bytes.");
+        }, prepareReader: function(v) {
+          this.reader = n(v);
+        }, load: function(v) {
+          this.prepareReader(v), this.readEndOfCentral(), this.readCentralDir(), this.readLocalFiles();
+        } }, f.exports = w;
+      }, { "./reader/readerFor": 22, "./signature": 23, "./support": 30, "./utils": 32, "./zipEntry": 34 }], 34: [function(e, f, a) {
+        var n = e("./reader/readerFor"), r = e("./utils"), i = e("./compressedObject"), l = e("./crc32"), p = e("./utf8"), w = e("./compressions"), v = e("./support");
+        function x(u, _) {
+          this.options = u, this.loadOptions = _;
+        }
+        x.prototype = { isEncrypted: function() {
+          return (1 & this.bitFlag) == 1;
+        }, useUTF8: function() {
+          return (2048 & this.bitFlag) == 2048;
+        }, readLocalPart: function(u) {
+          var _, o;
+          if (u.skip(22), this.fileNameLength = u.readInt(2), o = u.readInt(2), this.fileName = u.readData(this.fileNameLength), u.skip(o), 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 ((_ = (function(g) {
+            for (var h in w) if (Object.prototype.hasOwnProperty.call(w, h) && w[h].magic === g) return w[h];
+            return null;
+          })(this.compressionMethod)) === null) throw new Error("Corrupted zip : compression " + r.pretty(this.compressionMethod) + " unknown (inner file : " + r.transformTo("string", this.fileName) + ")");
+          this.decompressed = new i(this.compressedSize, this.uncompressedSize, this.crc32, _, u.readData(this.compressedSize));
+        }, readCentralPart: function(u) {
+          this.versionMadeBy = u.readInt(2), u.skip(2), this.bitFlag = u.readInt(2), this.compressionMethod = u.readString(2), this.date = u.readDate(), this.crc32 = u.readInt(4), this.compressedSize = u.readInt(4), this.uncompressedSize = u.readInt(4);
+          var _ = u.readInt(2);
+          if (this.extraFieldsLength = u.readInt(2), this.fileCommentLength = u.readInt(2), this.diskNumberStart = u.readInt(2), this.internalFileAttributes = u.readInt(2), this.externalFileAttributes = u.readInt(4), this.localHeaderOffset = u.readInt(4), this.isEncrypted()) throw new Error("Encrypted zip are not supported");
+          u.skip(_), this.readExtraFields(u), this.parseZIP64ExtraField(u), this.fileComment = u.readData(this.fileCommentLength);
+        }, processAttributes: function() {
+          this.unixPermissions = null, this.dosPermissions = null;
+          var u = this.versionMadeBy >> 8;
+          this.dir = !!(16 & this.externalFileAttributes), u == 0 && (this.dosPermissions = 63 & this.externalFileAttributes), u == 3 && (this.unixPermissions = this.externalFileAttributes >> 16 & 65535), this.dir || this.fileNameStr.slice(-1) !== "/" || (this.dir = !0);
+        }, parseZIP64ExtraField: function() {
+          if (this.extraFields[1]) {
+            var u = n(this.extraFields[1].value);
+            this.uncompressedSize === r.MAX_VALUE_32BITS && (this.uncompressedSize = u.readInt(8)), this.compressedSize === r.MAX_VALUE_32BITS && (this.compressedSize = u.readInt(8)), this.localHeaderOffset === r.MAX_VALUE_32BITS && (this.localHeaderOffset = u.readInt(8)), this.diskNumberStart === r.MAX_VALUE_32BITS && (this.diskNumberStart = u.readInt(4));
+          }
+        }, readExtraFields: function(u) {
+          var _, o, g, h = u.index + this.extraFieldsLength;
+          for (this.extraFields || (this.extraFields = {}); u.index + 4 < h; ) _ = u.readInt(2), o = u.readInt(2), g = u.readData(o), this.extraFields[_] = { id: _, length: o, value: g };
+          u.setIndex(h);
+        }, handleUTF8: function() {
+          var u = v.uint8array ? "uint8array" : "array";
+          if (this.useUTF8()) this.fileNameStr = p.utf8decode(this.fileName), this.fileCommentStr = p.utf8decode(this.fileComment);
+          else {
+            var _ = this.findExtraFieldUnicodePath();
+            if (_ !== null) this.fileNameStr = _;
+            else {
+              var o = r.transformTo(u, this.fileName);
+              this.fileNameStr = this.loadOptions.decodeFileName(o);
+            }
+            var g = this.findExtraFieldUnicodeComment();
+            if (g !== null) this.fileCommentStr = g;
+            else {
+              var h = r.transformTo(u, this.fileComment);
+              this.fileCommentStr = this.loadOptions.decodeFileName(h);
+            }
+          }
+        }, findExtraFieldUnicodePath: function() {
+          var u = this.extraFields[28789];
+          if (u) {
+            var _ = n(u.value);
+            return _.readInt(1) !== 1 || l(this.fileName) !== _.readInt(4) ? null : p.utf8decode(_.readData(u.length - 5));
+          }
+          return null;
+        }, findExtraFieldUnicodeComment: function() {
+          var u = this.extraFields[25461];
+          if (u) {
+            var _ = n(u.value);
+            return _.readInt(1) !== 1 || l(this.fileComment) !== _.readInt(4) ? null : p.utf8decode(_.readData(u.length - 5));
+          }
+          return null;
+        } }, f.exports = x;
+      }, { "./compressedObject": 2, "./compressions": 3, "./crc32": 4, "./reader/readerFor": 22, "./support": 30, "./utf8": 31, "./utils": 32 }], 35: [function(e, f, a) {
+        function n(_, o, g) {
+          this.name = _, this.dir = g.dir, this.date = g.date, this.comment = g.comment, this.unixPermissions = g.unixPermissions, this.dosPermissions = g.dosPermissions, this._data = o, this._dataBinary = g.binary, this.options = { compression: g.compression, compressionOptions: g.compressionOptions };
+        }
+        var r = e("./stream/StreamHelper"), i = e("./stream/DataWorker"), l = e("./utf8"), p = e("./compressedObject"), w = e("./stream/GenericWorker");
+        n.prototype = { internalStream: function(_) {
+          var o = null, g = "string";
+          try {
+            if (!_) throw new Error("No output type specified.");
+            var h = (g = _.toLowerCase()) === "string" || g === "text";
+            g !== "binarystring" && g !== "text" || (g = "string"), o = this._decompressWorker();
+            var b = !this._dataBinary;
+            b && !h && (o = o.pipe(new l.Utf8EncodeWorker())), !b && h && (o = o.pipe(new l.Utf8DecodeWorker()));
+          } catch (S) {
+            (o = new w("error")).error(S);
+          }
+          return new r(o, g, "");
+        }, async: function(_, o) {
+          return this.internalStream(_).accumulate(o);
+        }, nodeStream: function(_, o) {
+          return this.internalStream(_ || "nodebuffer").toNodejsStream(o);
+        }, _compressWorker: function(_, o) {
+          if (this._data instanceof p && this._data.compression.magic === _.magic) return this._data.getCompressedWorker();
+          var g = this._decompressWorker();
+          return this._dataBinary || (g = g.pipe(new l.Utf8EncodeWorker())), p.createWorkerFrom(g, _, o);
+        }, _decompressWorker: function() {
+          return this._data instanceof p ? this._data.getContentWorker() : this._data instanceof w ? this._data : new i(this._data);
+        } };
+        for (var v = ["asText", "asBinary", "asNodeBuffer", "asUint8Array", "asArrayBuffer"], x = function() {
+          throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
+        }, u = 0; u < v.length; u++) n.prototype[v[u]] = x;
+        f.exports = n;
+      }, { "./compressedObject": 2, "./stream/DataWorker": 27, "./stream/GenericWorker": 28, "./stream/StreamHelper": 29, "./utf8": 31 }], 36: [function(e, f, a) {
+        (function(n) {
+          var r, i, l = n.MutationObserver || n.WebKitMutationObserver;
+          if (l) {
+            var p = 0, w = new l(_), v = n.document.createTextNode("");
+            w.observe(v, { characterData: !0 }), r = function() {
+              v.data = p = ++p % 2;
+            };
+          } else if (n.setImmediate || n.MessageChannel === void 0) r = "document" in n && "onreadystatechange" in n.document.createElement("script") ? function() {
+            var o = n.document.createElement("script");
+            o.onreadystatechange = function() {
+              _(), o.onreadystatechange = null, o.parentNode.removeChild(o), o = null;
+            }, n.document.documentElement.appendChild(o);
+          } : function() {
+            setTimeout(_, 0);
+          };
+          else {
+            var x = new n.MessageChannel();
+            x.port1.onmessage = _, r = function() {
+              x.port2.postMessage(0);
+            };
+          }
+          var u = [];
+          function _() {
+            var o, g;
+            i = !0;
+            for (var h = u.length; h; ) {
+              for (g = u, u = [], o = -1; ++o < h; ) g[o]();
+              h = u.length;
+            }
+            i = !1;
+          }
+          f.exports = function(o) {
+            u.push(o) !== 1 || i || r();
+          };
+        }).call(this, typeof zt < "u" ? zt : typeof self < "u" ? self : typeof window < "u" ? window : {});
+      }, {}], 37: [function(e, f, a) {
+        var n = e("immediate");
+        function r() {
+        }
+        var i = {}, l = ["REJECTED"], p = ["FULFILLED"], w = ["PENDING"];
+        function v(h) {
+          if (typeof h != "function") throw new TypeError("resolver must be a function");
+          this.state = w, this.queue = [], this.outcome = void 0, h !== r && o(this, h);
+        }
+        function x(h, b, S) {
+          this.promise = h, typeof b == "function" && (this.onFulfilled = b, this.callFulfilled = this.otherCallFulfilled), typeof S == "function" && (this.onRejected = S, this.callRejected = this.otherCallRejected);
+        }
+        function u(h, b, S) {
+          n(function() {
+            var z;
+            try {
+              z = b(S);
+            } catch (E) {
+              return i.reject(h, E);
+            }
+            z === h ? i.reject(h, new TypeError("Cannot resolve promise with itself")) : i.resolve(h, z);
+          });
+        }
+        function _(h) {
+          var b = h && h.then;
+          if (h && (typeof h == "object" || typeof h == "function") && typeof b == "function") return function() {
+            b.apply(h, arguments);
+          };
+        }
+        function o(h, b) {
+          var S = !1;
+          function z(B) {
+            S || (S = !0, i.reject(h, B));
+          }
+          function E(B) {
+            S || (S = !0, i.resolve(h, B));
+          }
+          var R = g(function() {
+            b(E, z);
+          });
+          R.status === "error" && z(R.value);
+        }
+        function g(h, b) {
+          var S = {};
+          try {
+            S.value = h(b), S.status = "success";
+          } catch (z) {
+            S.status = "error", S.value = z;
+          }
+          return S;
+        }
+        (f.exports = v).prototype.finally = function(h) {
+          if (typeof h != "function") return this;
+          var b = this.constructor;
+          return this.then(function(S) {
+            return b.resolve(h()).then(function() {
+              return S;
+            });
+          }, function(S) {
+            return b.resolve(h()).then(function() {
+              throw S;
+            });
+          });
+        }, v.prototype.catch = function(h) {
+          return this.then(null, h);
+        }, v.prototype.then = function(h, b) {
+          if (typeof h != "function" && this.state === p || typeof b != "function" && this.state === l) return this;
+          var S = new this.constructor(r);
+          return this.state !== w ? u(S, this.state === p ? h : b, this.outcome) : this.queue.push(new x(S, h, b)), S;
+        }, x.prototype.callFulfilled = function(h) {
+          i.resolve(this.promise, h);
+        }, x.prototype.otherCallFulfilled = function(h) {
+          u(this.promise, this.onFulfilled, h);
+        }, x.prototype.callRejected = function(h) {
+          i.reject(this.promise, h);
+        }, x.prototype.otherCallRejected = function(h) {
+          u(this.promise, this.onRejected, h);
+        }, i.resolve = function(h, b) {
+          var S = g(_, b);
+          if (S.status === "error") return i.reject(h, S.value);
+          var z = S.value;
+          if (z) o(h, z);
+          else {
+            h.state = p, h.outcome = b;
+            for (var E = -1, R = h.queue.length; ++E < R; ) h.queue[E].callFulfilled(b);
+          }
+          return h;
+        }, i.reject = function(h, b) {
+          h.state = l, h.outcome = b;
+          for (var S = -1, z = h.queue.length; ++S < z; ) h.queue[S].callRejected(b);
+          return h;
+        }, v.resolve = function(h) {
+          return h instanceof this ? h : i.resolve(new this(r), h);
+        }, v.reject = function(h) {
+          var b = new this(r);
+          return i.reject(b, h);
+        }, v.all = function(h) {
+          var b = this;
+          if (Object.prototype.toString.call(h) !== "[object Array]") return this.reject(new TypeError("must be an array"));
+          var S = h.length, z = !1;
+          if (!S) return this.resolve([]);
+          for (var E = new Array(S), R = 0, B = -1, L = new this(r); ++B < S; ) P(h[B], B);
+          return L;
+          function P(W, Y) {
+            b.resolve(W).then(function(k) {
+              E[Y] = k, ++R !== S || z || (z = !0, i.resolve(L, E));
+            }, function(k) {
+              z || (z = !0, i.reject(L, k));
+            });
+          }
+        }, v.race = function(h) {
+          var b = this;
+          if (Object.prototype.toString.call(h) !== "[object Array]") return this.reject(new TypeError("must be an array"));
+          var S = h.length, z = !1;
+          if (!S) return this.resolve([]);
+          for (var E = -1, R = new this(r); ++E < S; ) B = h[E], b.resolve(B).then(function(L) {
+            z || (z = !0, i.resolve(R, L));
+          }, function(L) {
+            z || (z = !0, i.reject(R, L));
+          });
+          var B;
+          return R;
+        };
+      }, { immediate: 36 }], 38: [function(e, f, a) {
+        var n = {};
+        (0, e("./lib/utils/common").assign)(n, e("./lib/deflate"), e("./lib/inflate"), e("./lib/zlib/constants")), f.exports = n;
+      }, { "./lib/deflate": 39, "./lib/inflate": 40, "./lib/utils/common": 41, "./lib/zlib/constants": 44 }], 39: [function(e, f, a) {
+        var n = e("./zlib/deflate"), r = e("./utils/common"), i = e("./utils/strings"), l = e("./zlib/messages"), p = e("./zlib/zstream"), w = Object.prototype.toString, v = 0, x = -1, u = 0, _ = 8;
+        function o(h) {
+          if (!(this instanceof o)) return new o(h);
+          this.options = r.assign({ level: x, method: _, chunkSize: 16384, windowBits: 15, memLevel: 8, strategy: u, to: "" }, h || {});
+          var b = this.options;
+          b.raw && 0 < b.windowBits ? b.windowBits = -b.windowBits : b.gzip && 0 < b.windowBits && b.windowBits < 16 && (b.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new p(), this.strm.avail_out = 0;
+          var S = n.deflateInit2(this.strm, b.level, b.method, b.windowBits, b.memLevel, b.strategy);
+          if (S !== v) throw new Error(l[S]);
+          if (b.header && n.deflateSetHeader(this.strm, b.header), b.dictionary) {
+            var z;
+            if (z = typeof b.dictionary == "string" ? i.string2buf(b.dictionary) : w.call(b.dictionary) === "[object ArrayBuffer]" ? new Uint8Array(b.dictionary) : b.dictionary, (S = n.deflateSetDictionary(this.strm, z)) !== v) throw new Error(l[S]);
+            this._dict_set = !0;
+          }
+        }
+        function g(h, b) {
+          var S = new o(b);
+          if (S.push(h, !0), S.err) throw S.msg || l[S.err];
+          return S.result;
+        }
+        o.prototype.push = function(h, b) {
+          var S, z, E = this.strm, R = this.options.chunkSize;
+          if (this.ended) return !1;
+          z = b === ~~b ? b : b === !0 ? 4 : 0, typeof h == "string" ? E.input = i.string2buf(h) : w.call(h) === "[object ArrayBuffer]" ? E.input = new Uint8Array(h) : E.input = h, E.next_in = 0, E.avail_in = E.input.length;
+          do {
+            if (E.avail_out === 0 && (E.output = new r.Buf8(R), E.next_out = 0, E.avail_out = R), (S = n.deflate(E, z)) !== 1 && S !== v) return this.onEnd(S), !(this.ended = !0);
+            E.avail_out !== 0 && (E.avail_in !== 0 || z !== 4 && z !== 2) || (this.options.to === "string" ? this.onData(i.buf2binstring(r.shrinkBuf(E.output, E.next_out))) : this.onData(r.shrinkBuf(E.output, E.next_out)));
+          } while ((0 < E.avail_in || E.avail_out === 0) && S !== 1);
+          return z === 4 ? (S = n.deflateEnd(this.strm), this.onEnd(S), this.ended = !0, S === v) : z !== 2 || (this.onEnd(v), !(E.avail_out = 0));
+        }, o.prototype.onData = function(h) {
+          this.chunks.push(h);
+        }, o.prototype.onEnd = function(h) {
+          h === v && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = r.flattenChunks(this.chunks)), this.chunks = [], this.err = h, this.msg = this.strm.msg;
+        }, a.Deflate = o, a.deflate = g, a.deflateRaw = function(h, b) {
+          return (b = b || {}).raw = !0, g(h, b);
+        }, a.gzip = function(h, b) {
+          return (b = b || {}).gzip = !0, g(h, b);
+        };
+      }, { "./utils/common": 41, "./utils/strings": 42, "./zlib/deflate": 46, "./zlib/messages": 51, "./zlib/zstream": 53 }], 40: [function(e, f, a) {
+        var n = e("./zlib/inflate"), r = e("./utils/common"), i = e("./utils/strings"), l = e("./zlib/constants"), p = e("./zlib/messages"), w = e("./zlib/zstream"), v = e("./zlib/gzheader"), x = Object.prototype.toString;
+        function u(o) {
+          if (!(this instanceof u)) return new u(o);
+          this.options = r.assign({ chunkSize: 16384, windowBits: 0, to: "" }, o || {});
+          var g = this.options;
+          g.raw && 0 <= g.windowBits && g.windowBits < 16 && (g.windowBits = -g.windowBits, g.windowBits === 0 && (g.windowBits = -15)), !(0 <= g.windowBits && g.windowBits < 16) || o && o.windowBits || (g.windowBits += 32), 15 < g.windowBits && g.windowBits < 48 && (15 & g.windowBits) == 0 && (g.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new w(), this.strm.avail_out = 0;
+          var h = n.inflateInit2(this.strm, g.windowBits);
+          if (h !== l.Z_OK) throw new Error(p[h]);
+          this.header = new v(), n.inflateGetHeader(this.strm, this.header);
+        }
+        function _(o, g) {
+          var h = new u(g);
+          if (h.push(o, !0), h.err) throw h.msg || p[h.err];
+          return h.result;
+        }
+        u.prototype.push = function(o, g) {
+          var h, b, S, z, E, R, B = this.strm, L = this.options.chunkSize, P = this.options.dictionary, W = !1;
+          if (this.ended) return !1;
+          b = g === ~~g ? g : g === !0 ? l.Z_FINISH : l.Z_NO_FLUSH, typeof o == "string" ? B.input = i.binstring2buf(o) : x.call(o) === "[object ArrayBuffer]" ? B.input = new Uint8Array(o) : B.input = o, B.next_in = 0, B.avail_in = B.input.length;
+          do {
+            if (B.avail_out === 0 && (B.output = new r.Buf8(L), B.next_out = 0, B.avail_out = L), (h = n.inflate(B, l.Z_NO_FLUSH)) === l.Z_NEED_DICT && P && (R = typeof P == "string" ? i.string2buf(P) : x.call(P) === "[object ArrayBuffer]" ? new Uint8Array(P) : P, h = n.inflateSetDictionary(this.strm, R)), h === l.Z_BUF_ERROR && W === !0 && (h = l.Z_OK, W = !1), h !== l.Z_STREAM_END && h !== l.Z_OK) return this.onEnd(h), !(this.ended = !0);
+            B.next_out && (B.avail_out !== 0 && h !== l.Z_STREAM_END && (B.avail_in !== 0 || b !== l.Z_FINISH && b !== l.Z_SYNC_FLUSH) || (this.options.to === "string" ? (S = i.utf8border(B.output, B.next_out), z = B.next_out - S, E = i.buf2string(B.output, S), B.next_out = z, B.avail_out = L - z, z && r.arraySet(B.output, B.output, S, z, 0), this.onData(E)) : this.onData(r.shrinkBuf(B.output, B.next_out)))), B.avail_in === 0 && B.avail_out === 0 && (W = !0);
+          } while ((0 < B.avail_in || B.avail_out === 0) && h !== l.Z_STREAM_END);
+          return h === l.Z_STREAM_END && (b = l.Z_FINISH), b === l.Z_FINISH ? (h = n.inflateEnd(this.strm), this.onEnd(h), this.ended = !0, h === l.Z_OK) : b !== l.Z_SYNC_FLUSH || (this.onEnd(l.Z_OK), !(B.avail_out = 0));
+        }, u.prototype.onData = function(o) {
+          this.chunks.push(o);
+        }, u.prototype.onEnd = function(o) {
+          o === l.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = r.flattenChunks(this.chunks)), this.chunks = [], this.err = o, this.msg = this.strm.msg;
+        }, a.Inflate = u, a.inflate = _, a.inflateRaw = function(o, g) {
+          return (g = g || {}).raw = !0, _(o, g);
+        }, a.ungzip = _;
+      }, { "./utils/common": 41, "./utils/strings": 42, "./zlib/constants": 44, "./zlib/gzheader": 47, "./zlib/inflate": 49, "./zlib/messages": 51, "./zlib/zstream": 53 }], 41: [function(e, f, a) {
+        var n = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Int32Array < "u";
+        a.assign = function(l) {
+          for (var p = Array.prototype.slice.call(arguments, 1); p.length; ) {
+            var w = p.shift();
+            if (w) {
+              if (typeof w != "object") throw new TypeError(w + "must be non-object");
+              for (var v in w) w.hasOwnProperty(v) && (l[v] = w[v]);
+            }
+          }
+          return l;
+        }, a.shrinkBuf = function(l, p) {
+          return l.length === p ? l : l.subarray ? l.subarray(0, p) : (l.length = p, l);
+        };
+        var r = { arraySet: function(l, p, w, v, x) {
+          if (p.subarray && l.subarray) l.set(p.subarray(w, w + v), x);
+          else for (var u = 0; u < v; u++) l[x + u] = p[w + u];
+        }, flattenChunks: function(l) {
+          var p, w, v, x, u, _;
+          for (p = v = 0, w = l.length; p < w; p++) v += l[p].length;
+          for (_ = new Uint8Array(v), p = x = 0, w = l.length; p < w; p++) u = l[p], _.set(u, x), x += u.length;
+          return _;
+        } }, i = { arraySet: function(l, p, w, v, x) {
+          for (var u = 0; u < v; u++) l[x + u] = p[w + u];
+        }, flattenChunks: function(l) {
+          return [].concat.apply([], l);
+        } };
+        a.setTyped = function(l) {
+          l ? (a.Buf8 = Uint8Array, a.Buf16 = Uint16Array, a.Buf32 = Int32Array, a.assign(a, r)) : (a.Buf8 = Array, a.Buf16 = Array, a.Buf32 = Array, a.assign(a, i));
+        }, a.setTyped(n);
+      }, {}], 42: [function(e, f, a) {
+        var n = e("./common"), r = !0, i = !0;
+        try {
+          String.fromCharCode.apply(null, [0]);
+        } catch {
+          r = !1;
+        }
+        try {
+          String.fromCharCode.apply(null, new Uint8Array(1));
+        } catch {
+          i = !1;
+        }
+        for (var l = new n.Buf8(256), p = 0; p < 256; p++) l[p] = 252 <= p ? 6 : 248 <= p ? 5 : 240 <= p ? 4 : 224 <= p ? 3 : 192 <= p ? 2 : 1;
+        function w(v, x) {
+          if (x < 65537 && (v.subarray && i || !v.subarray && r)) return String.fromCharCode.apply(null, n.shrinkBuf(v, x));
+          for (var u = "", _ = 0; _ < x; _++) u += String.fromCharCode(v[_]);
+          return u;
+        }
+        l[254] = l[254] = 1, a.string2buf = function(v) {
+          var x, u, _, o, g, h = v.length, b = 0;
+          for (o = 0; o < h; o++) (64512 & (u = v.charCodeAt(o))) == 55296 && o + 1 < h && (64512 & (_ = v.charCodeAt(o + 1))) == 56320 && (u = 65536 + (u - 55296 << 10) + (_ - 56320), o++), b += u < 128 ? 1 : u < 2048 ? 2 : u < 65536 ? 3 : 4;
+          for (x = new n.Buf8(b), o = g = 0; g < b; o++) (64512 & (u = v.charCodeAt(o))) == 55296 && o + 1 < h && (64512 & (_ = v.charCodeAt(o + 1))) == 56320 && (u = 65536 + (u - 55296 << 10) + (_ - 56320), o++), u < 128 ? x[g++] = u : (u < 2048 ? x[g++] = 192 | u >>> 6 : (u < 65536 ? x[g++] = 224 | u >>> 12 : (x[g++] = 240 | u >>> 18, x[g++] = 128 | u >>> 12 & 63), x[g++] = 128 | u >>> 6 & 63), x[g++] = 128 | 63 & u);
+          return x;
+        }, a.buf2binstring = function(v) {
+          return w(v, v.length);
+        }, a.binstring2buf = function(v) {
+          for (var x = new n.Buf8(v.length), u = 0, _ = x.length; u < _; u++) x[u] = v.charCodeAt(u);
+          return x;
+        }, a.buf2string = function(v, x) {
+          var u, _, o, g, h = x || v.length, b = new Array(2 * h);
+          for (u = _ = 0; u < h; ) if ((o = v[u++]) < 128) b[_++] = o;
+          else if (4 < (g = l[o])) b[_++] = 65533, u += g - 1;
+          else {
+            for (o &= g === 2 ? 31 : g === 3 ? 15 : 7; 1 < g && u < h; ) o = o << 6 | 63 & v[u++], g--;
+            1 < g ? b[_++] = 65533 : o < 65536 ? b[_++] = o : (o -= 65536, b[_++] = 55296 | o >> 10 & 1023, b[_++] = 56320 | 1023 & o);
+          }
+          return w(b, _);
+        }, a.utf8border = function(v, x) {
+          var u;
+          for ((x = x || v.length) > v.length && (x = v.length), u = x - 1; 0 <= u && (192 & v[u]) == 128; ) u--;
+          return u < 0 || u === 0 ? x : u + l[v[u]] > x ? u : x;
+        };
+      }, { "./common": 41 }], 43: [function(e, f, a) {
+        f.exports = function(n, r, i, l) {
+          for (var p = 65535 & n | 0, w = n >>> 16 & 65535 | 0, v = 0; i !== 0; ) {
+            for (i -= v = 2e3 < i ? 2e3 : i; w = w + (p = p + r[l++] | 0) | 0, --v; ) ;
+            p %= 65521, w %= 65521;
+          }
+          return p | w << 16 | 0;
+        };
+      }, {}], 44: [function(e, f, a) {
+        f.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(e, f, a) {
+        var n = (function() {
+          for (var r, i = [], l = 0; l < 256; l++) {
+            r = l;
+            for (var p = 0; p < 8; p++) r = 1 & r ? 3988292384 ^ r >>> 1 : r >>> 1;
+            i[l] = r;
+          }
+          return i;
+        })();
+        f.exports = function(r, i, l, p) {
+          var w = n, v = p + l;
+          r ^= -1;
+          for (var x = p; x < v; x++) r = r >>> 8 ^ w[255 & (r ^ i[x])];
+          return -1 ^ r;
+        };
+      }, {}], 46: [function(e, f, a) {
+        var n, r = e("../utils/common"), i = e("./trees"), l = e("./adler32"), p = e("./crc32"), w = e("./messages"), v = 0, x = 4, u = 0, _ = -2, o = -1, g = 4, h = 2, b = 8, S = 9, z = 286, E = 30, R = 19, B = 2 * z + 1, L = 15, P = 3, W = 258, Y = W + P + 1, k = 42, F = 113, s = 1, j = 2, Q = 3, U = 4;
+        function tt(t, D) {
+          return t.msg = w[D], D;
+        }
+        function M(t) {
+          return (t << 1) - (4 < t ? 9 : 0);
+        }
+        function q(t) {
+          for (var D = t.length; 0 <= --D; ) t[D] = 0;
+        }
+        function O(t) {
+          var D = t.state, T = D.pending;
+          T > t.avail_out && (T = t.avail_out), T !== 0 && (r.arraySet(t.output, D.pending_buf, D.pending_out, T, t.next_out), t.next_out += T, D.pending_out += T, t.total_out += T, t.avail_out -= T, D.pending -= T, D.pending === 0 && (D.pending_out = 0));
+        }
+        function I(t, D) {
+          i._tr_flush_block(t, 0 <= t.block_start ? t.block_start : -1, t.strstart - t.block_start, D), t.block_start = t.strstart, O(t.strm);
+        }
+        function J(t, D) {
+          t.pending_buf[t.pending++] = D;
+        }
+        function G(t, D) {
+          t.pending_buf[t.pending++] = D >>> 8 & 255, t.pending_buf[t.pending++] = 255 & D;
+        }
+        function X(t, D) {
+          var T, y, m = t.max_chain_length, C = t.strstart, N = t.prev_length, $ = t.nice_match, A = t.strstart > t.w_size - Y ? t.strstart - (t.w_size - Y) : 0, Z = t.window, K = t.w_mask, H = t.prev, V = t.strstart + W, it = Z[C + N - 1], rt = Z[C + N];
+          t.prev_length >= t.good_match && (m >>= 2), $ > t.lookahead && ($ = t.lookahead);
+          do
+            if (Z[(T = D) + N] === rt && Z[T + N - 1] === it && Z[T] === Z[C] && Z[++T] === Z[C + 1]) {
+              C += 2, T++;
+              do
+                ;
+              while (Z[++C] === Z[++T] && Z[++C] === Z[++T] && Z[++C] === Z[++T] && Z[++C] === Z[++T] && Z[++C] === Z[++T] && Z[++C] === Z[++T] && Z[++C] === Z[++T] && Z[++C] === Z[++T] && C < V);
+              if (y = W - (V - C), C = V - W, N < y) {
+                if (t.match_start = D, $ <= (N = y)) break;
+                it = Z[C + N - 1], rt = Z[C + N];
+              }
+            }
+          while ((D = H[D & K]) > A && --m != 0);
+          return N <= t.lookahead ? N : t.lookahead;
+        }
+        function st(t) {
+          var D, T, y, m, C, N, $, A, Z, K, H = t.w_size;
+          do {
+            if (m = t.window_size - t.lookahead - t.strstart, t.strstart >= H + (H - Y)) {
+              for (r.arraySet(t.window, t.window, H, H, 0), t.match_start -= H, t.strstart -= H, t.block_start -= H, D = T = t.hash_size; y = t.head[--D], t.head[D] = H <= y ? y - H : 0, --T; ) ;
+              for (D = T = H; y = t.prev[--D], t.prev[D] = H <= y ? y - H : 0, --T; ) ;
+              m += H;
+            }
+            if (t.strm.avail_in === 0) break;
+            if (N = t.strm, $ = t.window, A = t.strstart + t.lookahead, Z = m, K = void 0, K = N.avail_in, Z < K && (K = Z), T = K === 0 ? 0 : (N.avail_in -= K, r.arraySet($, N.input, N.next_in, K, A), N.state.wrap === 1 ? N.adler = l(N.adler, $, K, A) : N.state.wrap === 2 && (N.adler = p(N.adler, $, K, A)), N.next_in += K, N.total_in += K, K), t.lookahead += T, t.lookahead + t.insert >= P) 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 + P - 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 < P)); ) ;
+          } while (t.lookahead < Y && t.strm.avail_in !== 0);
+        }
+        function lt(t, D) {
+          for (var T, y; ; ) {
+            if (t.lookahead < Y) {
+              if (st(t), t.lookahead < Y && D === v) return s;
+              if (t.lookahead === 0) break;
+            }
+            if (T = 0, t.lookahead >= P && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + P - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), T !== 0 && t.strstart - T <= t.w_size - Y && (t.match_length = X(t, T)), t.match_length >= P) if (y = i._tr_tally(t, t.strstart - t.match_start, t.match_length - P), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= P) {
+              for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + P - 1]) & t.hash_mask, T = 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 = i._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++;
+            if (y && (I(t, !1), t.strm.avail_out === 0)) return s;
+          }
+          return t.insert = t.strstart < P - 1 ? t.strstart : P - 1, D === x ? (I(t, !0), t.strm.avail_out === 0 ? Q : U) : t.last_lit && (I(t, !1), t.strm.avail_out === 0) ? s : j;
+        }
+        function et(t, D) {
+          for (var T, y, m; ; ) {
+            if (t.lookahead < Y) {
+              if (st(t), t.lookahead < Y && D === v) return s;
+              if (t.lookahead === 0) break;
+            }
+            if (T = 0, t.lookahead >= P && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + P - 1]) & t.hash_mask, T = 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 = P - 1, T !== 0 && t.prev_length < t.max_lazy_match && t.strstart - T <= t.w_size - Y && (t.match_length = X(t, T), t.match_length <= 5 && (t.strategy === 1 || t.match_length === P && 4096 < t.strstart - t.match_start) && (t.match_length = P - 1)), t.prev_length >= P && t.match_length <= t.prev_length) {
+              for (m = t.strstart + t.lookahead - P, y = i._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - P), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= m && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + P - 1]) & t.hash_mask, T = 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 = P - 1, t.strstart++, y && (I(t, !1), t.strm.avail_out === 0)) return s;
+            } else if (t.match_available) {
+              if ((y = i._tr_tally(t, 0, t.window[t.strstart - 1])) && I(t, !1), t.strstart++, t.lookahead--, t.strm.avail_out === 0) return s;
+            } else t.match_available = 1, t.strstart++, t.lookahead--;
+          }
+          return t.match_available && (y = i._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < P - 1 ? t.strstart : P - 1, D === x ? (I(t, !0), t.strm.avail_out === 0 ? Q : U) : t.last_lit && (I(t, !1), t.strm.avail_out === 0) ? s : j;
+        }
+        function nt(t, D, T, y, m) {
+          this.good_length = t, this.max_lazy = D, this.nice_length = T, this.max_chain = y, this.func = m;
+        }
+        function ct() {
+          this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = b, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new r.Buf16(2 * B), this.dyn_dtree = new r.Buf16(2 * (2 * E + 1)), this.bl_tree = new r.Buf16(2 * (2 * R + 1)), q(this.dyn_ltree), q(this.dyn_dtree), q(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new r.Buf16(L + 1), this.heap = new r.Buf16(2 * z + 1), q(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new r.Buf16(2 * z + 1), q(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 at(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 ? k : F, t.adler = D.wrap === 2 ? 0 : 1, D.last_flush = v, i._tr_init(D), u) : tt(t, _);
+        }
+        function dt(t) {
+          var D = at(t);
+          return D === u && (function(T) {
+            T.window_size = 2 * T.w_size, q(T.head), T.max_lazy_match = n[T.level].max_lazy, T.good_match = n[T.level].good_length, T.nice_match = n[T.level].nice_length, T.max_chain_length = n[T.level].max_chain, T.strstart = 0, T.block_start = 0, T.lookahead = 0, T.insert = 0, T.match_length = T.prev_length = P - 1, T.match_available = 0, T.ins_h = 0;
+          })(t.state), D;
+        }
+        function ht(t, D, T, y, m, C) {
+          if (!t) return _;
+          var N = 1;
+          if (D === o && (D = 6), y < 0 ? (N = 0, y = -y) : 15 < y && (N = 2, y -= 16), m < 1 || S < m || T !== b || y < 8 || 15 < y || D < 0 || 9 < D || C < 0 || g < C) return tt(t, _);
+          y === 8 && (y = 9);
+          var $ = new ct();
+          return (t.state = $).strm = t, $.wrap = N, $.gzhead = null, $.w_bits = y, $.w_size = 1 << $.w_bits, $.w_mask = $.w_size - 1, $.hash_bits = m + 7, $.hash_size = 1 << $.hash_bits, $.hash_mask = $.hash_size - 1, $.hash_shift = ~~(($.hash_bits + P - 1) / P), $.window = new r.Buf8(2 * $.w_size), $.head = new r.Buf16($.hash_size), $.prev = new r.Buf16($.w_size), $.lit_bufsize = 1 << m + 6, $.pending_buf_size = 4 * $.lit_bufsize, $.pending_buf = new r.Buf8($.pending_buf_size), $.d_buf = 1 * $.lit_bufsize, $.l_buf = 3 * $.lit_bufsize, $.level = D, $.strategy = C, $.method = T, dt(t);
+        }
+        n = [new nt(0, 0, 0, 0, function(t, D) {
+          var T = 65535;
+          for (T > t.pending_buf_size - 5 && (T = t.pending_buf_size - 5); ; ) {
+            if (t.lookahead <= 1) {
+              if (st(t), t.lookahead === 0 && D === v) return s;
+              if (t.lookahead === 0) break;
+            }
+            t.strstart += t.lookahead, t.lookahead = 0;
+            var y = t.block_start + T;
+            if ((t.strstart === 0 || t.strstart >= y) && (t.lookahead = t.strstart - y, t.strstart = y, I(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - Y && (I(t, !1), t.strm.avail_out === 0)) return s;
+          }
+          return t.insert = 0, D === x ? (I(t, !0), t.strm.avail_out === 0 ? Q : U) : (t.strstart > t.block_start && (I(t, !1), t.strm.avail_out), s);
+        }), new nt(4, 4, 8, 4, lt), new nt(4, 5, 16, 8, lt), new nt(4, 6, 32, 32, lt), 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)], a.deflateInit = function(t, D) {
+          return ht(t, D, b, 15, 8, 0);
+        }, a.deflateInit2 = ht, a.deflateReset = dt, a.deflateResetKeep = at, a.deflateSetHeader = function(t, D) {
+          return t && t.state ? t.state.wrap !== 2 ? _ : (t.state.gzhead = D, u) : _;
+        }, a.deflate = function(t, D) {
+          var T, y, m, C;
+          if (!t || !t.state || 5 < D || D < 0) return t ? tt(t, _) : _;
+          if (y = t.state, !t.output || !t.input && t.avail_in !== 0 || y.status === 666 && D !== x) return tt(t, t.avail_out === 0 ? -5 : _);
+          if (y.strm = t, T = y.last_flush, y.last_flush = D, y.status === k) if (y.wrap === 2) t.adler = 0, J(y, 31), J(y, 139), J(y, 8), y.gzhead ? (J(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)), J(y, 255 & y.gzhead.time), J(y, y.gzhead.time >> 8 & 255), J(y, y.gzhead.time >> 16 & 255), J(y, y.gzhead.time >> 24 & 255), J(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), J(y, 255 & y.gzhead.os), y.gzhead.extra && y.gzhead.extra.length && (J(y, 255 & y.gzhead.extra.length), J(y, y.gzhead.extra.length >> 8 & 255)), y.gzhead.hcrc && (t.adler = p(t.adler, y.pending_buf, y.pending, 0)), y.gzindex = 0, y.status = 69) : (J(y, 0), J(y, 0), J(y, 0), J(y, 0), J(y, 0), J(y, y.level === 9 ? 2 : 2 <= y.strategy || y.level < 2 ? 4 : 0), J(y, 3), y.status = F);
+          else {
+            var N = b + (y.w_bits - 8 << 4) << 8;
+            N |= (2 <= y.strategy || y.level < 2 ? 0 : y.level < 6 ? 1 : y.level === 6 ? 2 : 3) << 6, y.strstart !== 0 && (N |= 32), N += 31 - N % 31, y.status = F, G(y, N), y.strstart !== 0 && (G(y, t.adler >>> 16), G(y, 65535 & t.adler)), t.adler = 1;
+          }
+          if (y.status === 69) if (y.gzhead.extra) {
+            for (m = y.pending; y.gzindex < (65535 & y.gzhead.extra.length) && (y.pending !== y.pending_buf_size || (y.gzhead.hcrc && y.pending > m && (t.adler = p(t.adler, y.pending_buf, y.pending - m, m)), O(t), m = y.pending, y.pending !== y.pending_buf_size)); ) J(y, 255 & y.gzhead.extra[y.gzindex]), y.gzindex++;
+            y.gzhead.hcrc && y.pending > m && (t.adler = p(t.adler, y.pending_buf, y.pending - m, m)), y.gzindex === y.gzhead.extra.length && (y.gzindex = 0, y.status = 73);
+          } else y.status = 73;
+          if (y.status === 73) if (y.gzhead.name) {
+            m = y.pending;
+            do {
+              if (y.pending === y.pending_buf_size && (y.gzhead.hcrc && y.pending > m && (t.adler = p(t.adler, y.pending_buf, y.pending - m, m)), O(t), m = 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, J(y, C);
+            } while (C !== 0);
+            y.gzhead.hcrc && y.pending > m && (t.adler = p(t.adler, y.pending_buf, y.pending - m, m)), C === 0 && (y.gzindex = 0, y.status = 91);
+          } else y.status = 91;
+          if (y.status === 91) if (y.gzhead.comment) {
+            m = y.pending;
+            do {
+              if (y.pending === y.pending_buf_size && (y.gzhead.hcrc && y.pending > m && (t.adler = p(t.adler, y.pending_buf, y.pending - m, m)), O(t), m = 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, J(y, C);
+            } while (C !== 0);
+            y.gzhead.hcrc && y.pending > m && (t.adler = p(t.adler, y.pending_buf, y.pending - m, m)), C === 0 && (y.status = 103);
+          } else y.status = 103;
+          if (y.status === 103 && (y.gzhead.hcrc ? (y.pending + 2 > y.pending_buf_size && O(t), y.pending + 2 <= y.pending_buf_size && (J(y, 255 & t.adler), J(y, t.adler >> 8 & 255), t.adler = 0, y.status = F)) : y.status = F), y.pending !== 0) {
+            if (O(t), t.avail_out === 0) return y.last_flush = -1, u;
+          } else if (t.avail_in === 0 && M(D) <= M(T) && D !== x) return tt(t, -5);
+          if (y.status === 666 && t.avail_in !== 0) return tt(t, -5);
+          if (t.avail_in !== 0 || y.lookahead !== 0 || D !== v && y.status !== 666) {
+            var $ = y.strategy === 2 ? (function(A, Z) {
+              for (var K; ; ) {
+                if (A.lookahead === 0 && (st(A), A.lookahead === 0)) {
+                  if (Z === v) return s;
+                  break;
+                }
+                if (A.match_length = 0, K = i._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++, K && (I(A, !1), A.strm.avail_out === 0)) return s;
+              }
+              return A.insert = 0, Z === x ? (I(A, !0), A.strm.avail_out === 0 ? Q : U) : A.last_lit && (I(A, !1), A.strm.avail_out === 0) ? s : j;
+            })(y, D) : y.strategy === 3 ? (function(A, Z) {
+              for (var K, H, V, it, rt = A.window; ; ) {
+                if (A.lookahead <= W) {
+                  if (st(A), A.lookahead <= W && Z === v) return s;
+                  if (A.lookahead === 0) break;
+                }
+                if (A.match_length = 0, A.lookahead >= P && 0 < A.strstart && (H = rt[V = A.strstart - 1]) === rt[++V] && H === rt[++V] && H === rt[++V]) {
+                  it = A.strstart + W;
+                  do
+                    ;
+                  while (H === rt[++V] && H === rt[++V] && H === rt[++V] && H === rt[++V] && H === rt[++V] && H === rt[++V] && H === rt[++V] && H === rt[++V] && V < it);
+                  A.match_length = W - (it - V), A.match_length > A.lookahead && (A.match_length = A.lookahead);
+                }
+                if (A.match_length >= P ? (K = i._tr_tally(A, 1, A.match_length - P), A.lookahead -= A.match_length, A.strstart += A.match_length, A.match_length = 0) : (K = i._tr_tally(A, 0, A.window[A.strstart]), A.lookahead--, A.strstart++), K && (I(A, !1), A.strm.avail_out === 0)) return s;
+              }
+              return A.insert = 0, Z === x ? (I(A, !0), A.strm.avail_out === 0 ? Q : U) : A.last_lit && (I(A, !1), A.strm.avail_out === 0) ? s : j;
+            })(y, D) : n[y.level].func(y, D);
+            if ($ !== Q && $ !== U || (y.status = 666), $ === s || $ === Q) return t.avail_out === 0 && (y.last_flush = -1), u;
+            if ($ === j && (D === 1 ? i._tr_align(y) : D !== 5 && (i._tr_stored_block(y, 0, 0, !1), D === 3 && (q(y.head), y.lookahead === 0 && (y.strstart = 0, y.block_start = 0, y.insert = 0))), O(t), t.avail_out === 0)) return y.last_flush = -1, u;
+          }
+          return D !== x ? u : y.wrap <= 0 ? 1 : (y.wrap === 2 ? (J(y, 255 & t.adler), J(y, t.adler >> 8 & 255), J(y, t.adler >> 16 & 255), J(y, t.adler >> 24 & 255), J(y, 255 & t.total_in), J(y, t.total_in >> 8 & 255), J(y, t.total_in >> 16 & 255), J(y, t.total_in >> 24 & 255)) : (G(y, t.adler >>> 16), G(y, 65535 & t.adler)), O(t), 0 < y.wrap && (y.wrap = -y.wrap), y.pending !== 0 ? u : 1);
+        }, a.deflateEnd = function(t) {
+          var D;
+          return t && t.state ? (D = t.state.status) !== k && D !== 69 && D !== 73 && D !== 91 && D !== 103 && D !== F && D !== 666 ? tt(t, _) : (t.state = null, D === F ? tt(t, -3) : u) : _;
+        }, a.deflateSetDictionary = function(t, D) {
+          var T, y, m, C, N, $, A, Z, K = D.length;
+          if (!t || !t.state || (C = (T = t.state).wrap) === 2 || C === 1 && T.status !== k || T.lookahead) return _;
+          for (C === 1 && (t.adler = l(t.adler, D, K, 0)), T.wrap = 0, K >= T.w_size && (C === 0 && (q(T.head), T.strstart = 0, T.block_start = 0, T.insert = 0), Z = new r.Buf8(T.w_size), r.arraySet(Z, D, K - T.w_size, T.w_size, 0), D = Z, K = T.w_size), N = t.avail_in, $ = t.next_in, A = t.input, t.avail_in = K, t.next_in = 0, t.input = D, st(T); T.lookahead >= P; ) {
+            for (y = T.strstart, m = T.lookahead - (P - 1); T.ins_h = (T.ins_h << T.hash_shift ^ T.window[y + P - 1]) & T.hash_mask, T.prev[y & T.w_mask] = T.head[T.ins_h], T.head[T.ins_h] = y, y++, --m; ) ;
+            T.strstart = y, T.lookahead = P - 1, st(T);
+          }
+          return T.strstart += T.lookahead, T.block_start = T.strstart, T.insert = T.lookahead, T.lookahead = 0, T.match_length = T.prev_length = P - 1, T.match_available = 0, t.next_in = $, t.input = A, t.avail_in = N, T.wrap = C, u;
+        }, a.deflateInfo = "pako deflate (from Nodeca project)";
+      }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(e, f, a) {
+        f.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(e, f, a) {
+        f.exports = function(n, r) {
+          var i, l, p, w, v, x, u, _, o, g, h, b, S, z, E, R, B, L, P, W, Y, k, F, s, j;
+          i = n.state, l = n.next_in, s = n.input, p = l + (n.avail_in - 5), w = n.next_out, j = n.output, v = w - (r - n.avail_out), x = w + (n.avail_out - 257), u = i.dmax, _ = i.wsize, o = i.whave, g = i.wnext, h = i.window, b = i.hold, S = i.bits, z = i.lencode, E = i.distcode, R = (1 << i.lenbits) - 1, B = (1 << i.distbits) - 1;
+          t: do {
+            S < 15 && (b += s[l++] << S, S += 8, b += s[l++] << S, S += 8), L = z[b & R];
+            e: for (; ; ) {
+              if (b >>>= P = L >>> 24, S -= P, (P = L >>> 16 & 255) === 0) j[w++] = 65535 & L;
+              else {
+                if (!(16 & P)) {
+                  if ((64 & P) == 0) {
+                    L = z[(65535 & L) + (b & (1 << P) - 1)];
+                    continue e;
+                  }
+                  if (32 & P) {
+                    i.mode = 12;
+                    break t;
+                  }
+                  n.msg = "invalid literal/length code", i.mode = 30;
+                  break t;
+                }
+                W = 65535 & L, (P &= 15) && (S < P && (b += s[l++] << S, S += 8), W += b & (1 << P) - 1, b >>>= P, S -= P), S < 15 && (b += s[l++] << S, S += 8, b += s[l++] << S, S += 8), L = E[b & B];
+                r: for (; ; ) {
+                  if (b >>>= P = L >>> 24, S -= P, !(16 & (P = L >>> 16 & 255))) {
+                    if ((64 & P) == 0) {
+                      L = E[(65535 & L) + (b & (1 << P) - 1)];
+                      continue r;
+                    }
+                    n.msg = "invalid distance code", i.mode = 30;
+                    break t;
+                  }
+                  if (Y = 65535 & L, S < (P &= 15) && (b += s[l++] << S, (S += 8) < P && (b += s[l++] << S, S += 8)), u < (Y += b & (1 << P) - 1)) {
+                    n.msg = "invalid distance too far back", i.mode = 30;
+                    break t;
+                  }
+                  if (b >>>= P, S -= P, (P = w - v) < Y) {
+                    if (o < (P = Y - P) && i.sane) {
+                      n.msg = "invalid distance too far back", i.mode = 30;
+                      break t;
+                    }
+                    if (F = h, (k = 0) === g) {
+                      if (k += _ - P, P < W) {
+                        for (W -= P; j[w++] = h[k++], --P; ) ;
+                        k = w - Y, F = j;
+                      }
+                    } else if (g < P) {
+                      if (k += _ + g - P, (P -= g) < W) {
+                        for (W -= P; j[w++] = h[k++], --P; ) ;
+                        if (k = 0, g < W) {
+                          for (W -= P = g; j[w++] = h[k++], --P; ) ;
+                          k = w - Y, F = j;
+                        }
+                      }
+                    } else if (k += g - P, P < W) {
+                      for (W -= P; j[w++] = h[k++], --P; ) ;
+                      k = w - Y, F = j;
+                    }
+                    for (; 2 < W; ) j[w++] = F[k++], j[w++] = F[k++], j[w++] = F[k++], W -= 3;
+                    W && (j[w++] = F[k++], 1 < W && (j[w++] = F[k++]));
+                  } else {
+                    for (k = w - Y; j[w++] = j[k++], j[w++] = j[k++], j[w++] = j[k++], 2 < (W -= 3); ) ;
+                    W && (j[w++] = j[k++], 1 < W && (j[w++] = j[k++]));
+                  }
+                  break;
+                }
+              }
+              break;
+            }
+          } while (l < p && w < x);
+          l -= W = S >> 3, b &= (1 << (S -= W << 3)) - 1, n.next_in = l, n.next_out = w, n.avail_in = l < p ? p - l + 5 : 5 - (l - p), n.avail_out = w < x ? x - w + 257 : 257 - (w - x), i.hold = b, i.bits = S;
+        };
+      }, {}], 49: [function(e, f, a) {
+        var n = e("../utils/common"), r = e("./adler32"), i = e("./crc32"), l = e("./inffast"), p = e("./inftrees"), w = 1, v = 2, x = 0, u = -2, _ = 1, o = 852, g = 592;
+        function h(k) {
+          return (k >>> 24 & 255) + (k >>> 8 & 65280) + ((65280 & k) << 8) + ((255 & k) << 24);
+        }
+        function b() {
+          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 n.Buf16(320), this.work = new n.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
+        }
+        function S(k) {
+          var F;
+          return k && k.state ? (F = k.state, k.total_in = k.total_out = F.total = 0, k.msg = "", F.wrap && (k.adler = 1 & F.wrap), F.mode = _, F.last = 0, F.havedict = 0, F.dmax = 32768, F.head = null, F.hold = 0, F.bits = 0, F.lencode = F.lendyn = new n.Buf32(o), F.distcode = F.distdyn = new n.Buf32(g), F.sane = 1, F.back = -1, x) : u;
+        }
+        function z(k) {
+          var F;
+          return k && k.state ? ((F = k.state).wsize = 0, F.whave = 0, F.wnext = 0, S(k)) : u;
+        }
+        function E(k, F) {
+          var s, j;
+          return k && k.state ? (j = k.state, F < 0 ? (s = 0, F = -F) : (s = 1 + (F >> 4), F < 48 && (F &= 15)), F && (F < 8 || 15 < F) ? u : (j.window !== null && j.wbits !== F && (j.window = null), j.wrap = s, j.wbits = F, z(k))) : u;
+        }
+        function R(k, F) {
+          var s, j;
+          return k ? (j = new b(), (k.state = j).window = null, (s = E(k, F)) !== x && (k.state = null), s) : u;
+        }
+        var B, L, P = !0;
+        function W(k) {
+          if (P) {
+            var F;
+            for (B = new n.Buf32(512), L = new n.Buf32(32), F = 0; F < 144; ) k.lens[F++] = 8;
+            for (; F < 256; ) k.lens[F++] = 9;
+            for (; F < 280; ) k.lens[F++] = 7;
+            for (; F < 288; ) k.lens[F++] = 8;
+            for (p(w, k.lens, 0, 288, B, 0, k.work, { bits: 9 }), F = 0; F < 32; ) k.lens[F++] = 5;
+            p(v, k.lens, 0, 32, L, 0, k.work, { bits: 5 }), P = !1;
+          }
+          k.lencode = B, k.lenbits = 9, k.distcode = L, k.distbits = 5;
+        }
+        function Y(k, F, s, j) {
+          var Q, U = k.state;
+          return U.window === null && (U.wsize = 1 << U.wbits, U.wnext = 0, U.whave = 0, U.window = new n.Buf8(U.wsize)), j >= U.wsize ? (n.arraySet(U.window, F, s - U.wsize, U.wsize, 0), U.wnext = 0, U.whave = U.wsize) : (j < (Q = U.wsize - U.wnext) && (Q = j), n.arraySet(U.window, F, s - j, Q, U.wnext), (j -= Q) ? (n.arraySet(U.window, F, s - j, j, 0), U.wnext = j, U.whave = U.wsize) : (U.wnext += Q, U.wnext === U.wsize && (U.wnext = 0), U.whave < U.wsize && (U.whave += Q))), 0;
+        }
+        a.inflateReset = z, a.inflateReset2 = E, a.inflateResetKeep = S, a.inflateInit = function(k) {
+          return R(k, 15);
+        }, a.inflateInit2 = R, a.inflate = function(k, F) {
+          var s, j, Q, U, tt, M, q, O, I, J, G, X, st, lt, et, nt, ct, at, dt, ht, t, D, T, y, m = 0, C = new n.Buf8(4), N = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
+          if (!k || !k.state || !k.output || !k.input && k.avail_in !== 0) return u;
+          (s = k.state).mode === 12 && (s.mode = 13), tt = k.next_out, Q = k.output, q = k.avail_out, U = k.next_in, j = k.input, M = k.avail_in, O = s.hold, I = s.bits, J = M, G = q, D = x;
+          t: for (; ; ) switch (s.mode) {
+            case _:
+              if (s.wrap === 0) {
+                s.mode = 13;
+                break;
+              }
+              for (; I < 16; ) {
+                if (M === 0) break t;
+                M--, O += j[U++] << I, I += 8;
+              }
+              if (2 & s.wrap && O === 35615) {
+                C[s.check = 0] = 255 & O, C[1] = O >>> 8 & 255, s.check = i(s.check, C, 2, 0), I = O = 0, s.mode = 2;
+                break;
+              }
+              if (s.flags = 0, s.head && (s.head.done = !1), !(1 & s.wrap) || (((255 & O) << 8) + (O >> 8)) % 31) {
+                k.msg = "incorrect header check", s.mode = 30;
+                break;
+              }
+              if ((15 & O) != 8) {
+                k.msg = "unknown compression method", s.mode = 30;
+                break;
+              }
+              if (I -= 4, t = 8 + (15 & (O >>>= 4)), s.wbits === 0) s.wbits = t;
+              else if (t > s.wbits) {
+                k.msg = "invalid window size", s.mode = 30;
+                break;
+              }
+              s.dmax = 1 << t, k.adler = s.check = 1, s.mode = 512 & O ? 10 : 12, I = O = 0;
+              break;
+            case 2:
+              for (; I < 16; ) {
+                if (M === 0) break t;
+                M--, O += j[U++] << I, I += 8;
+              }
+              if (s.flags = O, (255 & s.flags) != 8) {
+                k.msg = "unknown compression method", s.mode = 30;
+                break;
+              }
+              if (57344 & s.flags) {
+                k.msg = "unknown header flags set", s.mode = 30;
+                break;
+              }
+              s.head && (s.head.text = O >> 8 & 1), 512 & s.flags && (C[0] = 255 & O, C[1] = O >>> 8 & 255, s.check = i(s.check, C, 2, 0)), I = O = 0, s.mode = 3;
+            case 3:
+              for (; I < 32; ) {
+                if (M === 0) break t;
+                M--, O += j[U++] << I, I += 8;
+              }
+              s.head && (s.head.time = O), 512 & s.flags && (C[0] = 255 & O, C[1] = O >>> 8 & 255, C[2] = O >>> 16 & 255, C[3] = O >>> 24 & 255, s.check = i(s.check, C, 4, 0)), I = O = 0, s.mode = 4;
+            case 4:
+              for (; I < 16; ) {
+                if (M === 0) break t;
+                M--, O += j[U++] << I, I += 8;
+              }
+              s.head && (s.head.xflags = 255 & O, s.head.os = O >> 8), 512 & s.flags && (C[0] = 255 & O, C[1] = O >>> 8 & 255, s.check = i(s.check, C, 2, 0)), I = O = 0, s.mode = 5;
+            case 5:
+              if (1024 & s.flags) {
+                for (; I < 16; ) {
+                  if (M === 0) break t;
+                  M--, O += j[U++] << I, I += 8;
+                }
+                s.length = O, s.head && (s.head.extra_len = O), 512 & s.flags && (C[0] = 255 & O, C[1] = O >>> 8 & 255, s.check = i(s.check, C, 2, 0)), I = O = 0;
+              } else s.head && (s.head.extra = null);
+              s.mode = 6;
+            case 6:
+              if (1024 & s.flags && (M < (X = s.length) && (X = M), X && (s.head && (t = s.head.extra_len - s.length, s.head.extra || (s.head.extra = new Array(s.head.extra_len)), n.arraySet(s.head.extra, j, U, X, t)), 512 & s.flags && (s.check = i(s.check, j, X, U)), M -= X, U += X, s.length -= X), s.length)) break t;
+              s.length = 0, s.mode = 7;
+            case 7:
+              if (2048 & s.flags) {
+                if (M === 0) break t;
+                for (X = 0; t = j[U + X++], s.head && t && s.length < 65536 && (s.head.name += String.fromCharCode(t)), t && X < M; ) ;
+                if (512 & s.flags && (s.check = i(s.check, j, X, U)), M -= X, U += X, t) break t;
+              } else s.head && (s.head.name = null);
+              s.length = 0, s.mode = 8;
+            case 8:
+              if (4096 & s.flags) {
+                if (M === 0) break t;
+                for (X = 0; t = j[U + X++], s.head && t && s.length < 65536 && (s.head.comment += String.fromCharCode(t)), t && X < M; ) ;
+                if (512 & s.flags && (s.check = i(s.check, j, X, U)), M -= X, U += X, t) break t;
+              } else s.head && (s.head.comment = null);
+              s.mode = 9;
+            case 9:
+              if (512 & s.flags) {
+                for (; I < 16; ) {
+                  if (M === 0) break t;
+                  M--, O += j[U++] << I, I += 8;
+                }
+                if (O !== (65535 & s.check)) {
+                  k.msg = "header crc mismatch", s.mode = 30;
+                  break;
+                }
+                I = O = 0;
+              }
+              s.head && (s.head.hcrc = s.flags >> 9 & 1, s.head.done = !0), k.adler = s.check = 0, s.mode = 12;
+              break;
+            case 10:
+              for (; I < 32; ) {
+                if (M === 0) break t;
+                M--, O += j[U++] << I, I += 8;
+              }
+              k.adler = s.check = h(O), I = O = 0, s.mode = 11;
+            case 11:
+              if (s.havedict === 0) return k.next_out = tt, k.avail_out = q, k.next_in = U, k.avail_in = M, s.hold = O, s.bits = I, 2;
+              k.adler = s.check = 1, s.mode = 12;
+            case 12:
+              if (F === 5 || F === 6) break t;
+            case 13:
+              if (s.last) {
+                O >>>= 7 & I, I -= 7 & I, s.mode = 27;
+                break;
+              }
+              for (; I < 3; ) {
+                if (M === 0) break t;
+                M--, O += j[U++] << I, I += 8;
+              }
+              switch (s.last = 1 & O, I -= 1, 3 & (O >>>= 1)) {
+                case 0:
+                  s.mode = 14;
+                  break;
+                case 1:
+                  if (W(s), s.mode = 20, F !== 6) break;
+                  O >>>= 2, I -= 2;
+                  break t;
+                case 2:
+                  s.mode = 17;
+                  break;
+                case 3:
+                  k.msg = "invalid block type", s.mode = 30;
+              }
+              O >>>= 2, I -= 2;
+              break;
+            case 14:
+              for (O >>>= 7 & I, I -= 7 & I; I < 32; ) {
+                if (M === 0) break t;
+                M--, O += j[U++] << I, I += 8;
+              }
+              if ((65535 & O) != (O >>> 16 ^ 65535)) {
+                k.msg = "invalid stored block lengths", s.mode = 30;
+                break;
+              }
+              if (s.length = 65535 & O, I = O = 0, s.mode = 15, F === 6) break t;
+            case 15:
+              s.mode = 16;
+            case 16:
+              if (X = s.length) {
+                if (M < X && (X = M), q < X && (X = q), X === 0) break t;
+                n.arraySet(Q, j, U, X, tt), M -= X, U += X, q -= X, tt += X, s.length -= X;
+                break;
+              }
+              s.mode = 12;
+              break;
+            case 17:
+              for (; I < 14; ) {
+                if (M === 0) break t;
+                M--, O += j[U++] << I, I += 8;
+              }
+              if (s.nlen = 257 + (31 & O), O >>>= 5, I -= 5, s.ndist = 1 + (31 & O), O >>>= 5, I -= 5, s.ncode = 4 + (15 & O), O >>>= 4, I -= 4, 286 < s.nlen || 30 < s.ndist) {
+                k.msg = "too many length or distance symbols", s.mode = 30;
+                break;
+              }
+              s.have = 0, s.mode = 18;
+            case 18:
+              for (; s.have < s.ncode; ) {
+                for (; I < 3; ) {
+                  if (M === 0) break t;
+                  M--, O += j[U++] << I, I += 8;
+                }
+                s.lens[N[s.have++]] = 7 & O, O >>>= 3, I -= 3;
+              }
+              for (; s.have < 19; ) s.lens[N[s.have++]] = 0;
+              if (s.lencode = s.lendyn, s.lenbits = 7, T = { bits: s.lenbits }, D = p(0, s.lens, 0, 19, s.lencode, 0, s.work, T), s.lenbits = T.bits, D) {
+                k.msg = "invalid code lengths set", s.mode = 30;
+                break;
+              }
+              s.have = 0, s.mode = 19;
+            case 19:
+              for (; s.have < s.nlen + s.ndist; ) {
+                for (; nt = (m = s.lencode[O & (1 << s.lenbits) - 1]) >>> 16 & 255, ct = 65535 & m, !((et = m >>> 24) <= I); ) {
+                  if (M === 0) break t;
+                  M--, O += j[U++] << I, I += 8;
+                }
+                if (ct < 16) O >>>= et, I -= et, s.lens[s.have++] = ct;
+                else {
+                  if (ct === 16) {
+                    for (y = et + 2; I < y; ) {
+                      if (M === 0) break t;
+                      M--, O += j[U++] << I, I += 8;
+                    }
+                    if (O >>>= et, I -= et, s.have === 0) {
+                      k.msg = "invalid bit length repeat", s.mode = 30;
+                      break;
+                    }
+                    t = s.lens[s.have - 1], X = 3 + (3 & O), O >>>= 2, I -= 2;
+                  } else if (ct === 17) {
+                    for (y = et + 3; I < y; ) {
+                      if (M === 0) break t;
+                      M--, O += j[U++] << I, I += 8;
+                    }
+                    I -= et, t = 0, X = 3 + (7 & (O >>>= et)), O >>>= 3, I -= 3;
+                  } else {
+                    for (y = et + 7; I < y; ) {
+                      if (M === 0) break t;
+                      M--, O += j[U++] << I, I += 8;
+                    }
+                    I -= et, t = 0, X = 11 + (127 & (O >>>= et)), O >>>= 7, I -= 7;
+                  }
+                  if (s.have + X > s.nlen + s.ndist) {
+                    k.msg = "invalid bit length repeat", s.mode = 30;
+                    break;
+                  }
+                  for (; X--; ) s.lens[s.have++] = t;
+                }
+              }
+              if (s.mode === 30) break;
+              if (s.lens[256] === 0) {
+                k.msg = "invalid code -- missing end-of-block", s.mode = 30;
+                break;
+              }
+              if (s.lenbits = 9, T = { bits: s.lenbits }, D = p(w, s.lens, 0, s.nlen, s.lencode, 0, s.work, T), s.lenbits = T.bits, D) {
+                k.msg = "invalid literal/lengths set", s.mode = 30;
+                break;
+              }
+              if (s.distbits = 6, s.distcode = s.distdyn, T = { bits: s.distbits }, D = p(v, s.lens, s.nlen, s.ndist, s.distcode, 0, s.work, T), s.distbits = T.bits, D) {
+                k.msg = "invalid distances set", s.mode = 30;
+                break;
+              }
+              if (s.mode = 20, F === 6) break t;
+            case 20:
+              s.mode = 21;
+            case 21:
+              if (6 <= M && 258 <= q) {
+                k.next_out = tt, k.avail_out = q, k.next_in = U, k.avail_in = M, s.hold = O, s.bits = I, l(k, G), tt = k.next_out, Q = k.output, q = k.avail_out, U = k.next_in, j = k.input, M = k.avail_in, O = s.hold, I = s.bits, s.mode === 12 && (s.back = -1);
+                break;
+              }
+              for (s.back = 0; nt = (m = s.lencode[O & (1 << s.lenbits) - 1]) >>> 16 & 255, ct = 65535 & m, !((et = m >>> 24) <= I); ) {
+                if (M === 0) break t;
+                M--, O += j[U++] << I, I += 8;
+              }
+              if (nt && (240 & nt) == 0) {
+                for (at = et, dt = nt, ht = ct; nt = (m = s.lencode[ht + ((O & (1 << at + dt) - 1) >> at)]) >>> 16 & 255, ct = 65535 & m, !(at + (et = m >>> 24) <= I); ) {
+                  if (M === 0) break t;
+                  M--, O += j[U++] << I, I += 8;
+                }
+                O >>>= at, I -= at, s.back += at;
+              }
+              if (O >>>= et, I -= et, s.back += et, s.length = ct, nt === 0) {
+                s.mode = 26;
+                break;
+              }
+              if (32 & nt) {
+                s.back = -1, s.mode = 12;
+                break;
+              }
+              if (64 & nt) {
+                k.msg = "invalid literal/length code", s.mode = 30;
+                break;
+              }
+              s.extra = 15 & nt, s.mode = 22;
+            case 22:
+              if (s.extra) {
+                for (y = s.extra; I < y; ) {
+                  if (M === 0) break t;
+                  M--, O += j[U++] << I, I += 8;
+                }
+                s.length += O & (1 << s.extra) - 1, O >>>= s.extra, I -= s.extra, s.back += s.extra;
+              }
+              s.was = s.length, s.mode = 23;
+            case 23:
+              for (; nt = (m = s.distcode[O & (1 << s.distbits) - 1]) >>> 16 & 255, ct = 65535 & m, !((et = m >>> 24) <= I); ) {
+                if (M === 0) break t;
+                M--, O += j[U++] << I, I += 8;
+              }
+              if ((240 & nt) == 0) {
+                for (at = et, dt = nt, ht = ct; nt = (m = s.distcode[ht + ((O & (1 << at + dt) - 1) >> at)]) >>> 16 & 255, ct = 65535 & m, !(at + (et = m >>> 24) <= I); ) {
+                  if (M === 0) break t;
+                  M--, O += j[U++] << I, I += 8;
+                }
+                O >>>= at, I -= at, s.back += at;
+              }
+              if (O >>>= et, I -= et, s.back += et, 64 & nt) {
+                k.msg = "invalid distance code", s.mode = 30;
+                break;
+              }
+              s.offset = ct, s.extra = 15 & nt, s.mode = 24;
+            case 24:
+              if (s.extra) {
+                for (y = s.extra; I < y; ) {
+                  if (M === 0) break t;
+                  M--, O += j[U++] << I, I += 8;
+                }
+                s.offset += O & (1 << s.extra) - 1, O >>>= s.extra, I -= s.extra, s.back += s.extra;
+              }
+              if (s.offset > s.dmax) {
+                k.msg = "invalid distance too far back", s.mode = 30;
+                break;
+              }
+              s.mode = 25;
+            case 25:
+              if (q === 0) break t;
+              if (X = G - q, s.offset > X) {
+                if ((X = s.offset - X) > s.whave && s.sane) {
+                  k.msg = "invalid distance too far back", s.mode = 30;
+                  break;
+                }
+                st = X > s.wnext ? (X -= s.wnext, s.wsize - X) : s.wnext - X, X > s.length && (X = s.length), lt = s.window;
+              } else lt = Q, st = tt - s.offset, X = s.length;
+              for (q < X && (X = q), q -= X, s.length -= X; Q[tt++] = lt[st++], --X; ) ;
+              s.length === 0 && (s.mode = 21);
+              break;
+            case 26:
+              if (q === 0) break t;
+              Q[tt++] = s.length, q--, s.mode = 21;
+              break;
+            case 27:
+              if (s.wrap) {
+                for (; I < 32; ) {
+                  if (M === 0) break t;
+                  M--, O |= j[U++] << I, I += 8;
+                }
+                if (G -= q, k.total_out += G, s.total += G, G && (k.adler = s.check = s.flags ? i(s.check, Q, G, tt - G) : r(s.check, Q, G, tt - G)), G = q, (s.flags ? O : h(O)) !== s.check) {
+                  k.msg = "incorrect data check", s.mode = 30;
+                  break;
+                }
+                I = O = 0;
+              }
+              s.mode = 28;
+            case 28:
+              if (s.wrap && s.flags) {
+                for (; I < 32; ) {
+                  if (M === 0) break t;
+                  M--, O += j[U++] << I, I += 8;
+                }
+                if (O !== (4294967295 & s.total)) {
+                  k.msg = "incorrect length check", s.mode = 30;
+                  break;
+                }
+                I = O = 0;
+              }
+              s.mode = 29;
+            case 29:
+              D = 1;
+              break t;
+            case 30:
+              D = -3;
+              break t;
+            case 31:
+              return -4;
+            default:
+              return u;
+          }
+          return k.next_out = tt, k.avail_out = q, k.next_in = U, k.avail_in = M, s.hold = O, s.bits = I, (s.wsize || G !== k.avail_out && s.mode < 30 && (s.mode < 27 || F !== 4)) && Y(k, k.output, k.next_out, G - k.avail_out) ? (s.mode = 31, -4) : (J -= k.avail_in, G -= k.avail_out, k.total_in += J, k.total_out += G, s.total += G, s.wrap && G && (k.adler = s.check = s.flags ? i(s.check, Q, G, k.next_out - G) : r(s.check, Q, G, k.next_out - G)), k.data_type = s.bits + (s.last ? 64 : 0) + (s.mode === 12 ? 128 : 0) + (s.mode === 20 || s.mode === 15 ? 256 : 0), (J == 0 && G === 0 || F === 4) && D === x && (D = -5), D);
+        }, a.inflateEnd = function(k) {
+          if (!k || !k.state) return u;
+          var F = k.state;
+          return F.window && (F.window = null), k.state = null, x;
+        }, a.inflateGetHeader = function(k, F) {
+          var s;
+          return k && k.state ? (2 & (s = k.state).wrap) == 0 ? u : ((s.head = F).done = !1, x) : u;
+        }, a.inflateSetDictionary = function(k, F) {
+          var s, j = F.length;
+          return k && k.state ? (s = k.state).wrap !== 0 && s.mode !== 11 ? u : s.mode === 11 && r(1, F, j, 0) !== s.check ? -3 : Y(k, F, j, j) ? (s.mode = 31, -4) : (s.havedict = 1, x) : u;
+        }, a.inflateInfo = "pako inflate (from Nodeca project)";
+      }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(e, f, a) {
+        var n = e("../utils/common"), r = [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], i = [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], l = [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], p = [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];
+        f.exports = function(w, v, x, u, _, o, g, h) {
+          var b, S, z, E, R, B, L, P, W, Y = h.bits, k = 0, F = 0, s = 0, j = 0, Q = 0, U = 0, tt = 0, M = 0, q = 0, O = 0, I = null, J = 0, G = new n.Buf16(16), X = new n.Buf16(16), st = null, lt = 0;
+          for (k = 0; k <= 15; k++) G[k] = 0;
+          for (F = 0; F < u; F++) G[v[x + F]]++;
+          for (Q = Y, j = 15; 1 <= j && G[j] === 0; j--) ;
+          if (j < Q && (Q = j), j === 0) return _[o++] = 20971520, _[o++] = 20971520, h.bits = 1, 0;
+          for (s = 1; s < j && G[s] === 0; s++) ;
+          for (Q < s && (Q = s), k = M = 1; k <= 15; k++) if (M <<= 1, (M -= G[k]) < 0) return -1;
+          if (0 < M && (w === 0 || j !== 1)) return -1;
+          for (X[1] = 0, k = 1; k < 15; k++) X[k + 1] = X[k] + G[k];
+          for (F = 0; F < u; F++) v[x + F] !== 0 && (g[X[v[x + F]]++] = F);
+          if (B = w === 0 ? (I = st = g, 19) : w === 1 ? (I = r, J -= 257, st = i, lt -= 257, 256) : (I = l, st = p, -1), k = s, R = o, tt = F = O = 0, z = -1, E = (q = 1 << (U = Q)) - 1, w === 1 && 852 < q || w === 2 && 592 < q) return 1;
+          for (; ; ) {
+            for (L = k - tt, W = g[F] < B ? (P = 0, g[F]) : g[F] > B ? (P = st[lt + g[F]], I[J + g[F]]) : (P = 96, 0), b = 1 << k - tt, s = S = 1 << U; _[R + (O >> tt) + (S -= b)] = L << 24 | P << 16 | W | 0, S !== 0; ) ;
+            for (b = 1 << k - 1; O & b; ) b >>= 1;
+            if (b !== 0 ? (O &= b - 1, O += b) : O = 0, F++, --G[k] == 0) {
+              if (k === j) break;
+              k = v[x + g[F]];
+            }
+            if (Q < k && (O & E) !== z) {
+              for (tt === 0 && (tt = Q), R += s, M = 1 << (U = k - tt); U + tt < j && !((M -= G[U + tt]) <= 0); ) U++, M <<= 1;
+              if (q += 1 << U, w === 1 && 852 < q || w === 2 && 592 < q) return 1;
+              _[z = O & E] = Q << 24 | U << 16 | R - o | 0;
+            }
+          }
+          return O !== 0 && (_[R + O] = k - tt << 24 | 64 << 16 | 0), h.bits = Q, 0;
+        };
+      }, { "../utils/common": 41 }], 51: [function(e, f, a) {
+        f.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(e, f, a) {
+        var n = e("../utils/common"), r = 0, i = 1;
+        function l(m) {
+          for (var C = m.length; 0 <= --C; ) m[C] = 0;
+        }
+        var p = 0, w = 29, v = 256, x = v + 1 + w, u = 30, _ = 19, o = 2 * x + 1, g = 15, h = 16, b = 7, S = 256, z = 16, E = 17, R = 18, B = [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], L = [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], P = [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], Y = new Array(2 * (x + 2));
+        l(Y);
+        var k = new Array(2 * u);
+        l(k);
+        var F = new Array(512);
+        l(F);
+        var s = new Array(256);
+        l(s);
+        var j = new Array(w);
+        l(j);
+        var Q, U, tt, M = new Array(u);
+        function q(m, C, N, $, A) {
+          this.static_tree = m, this.extra_bits = C, this.extra_base = N, this.elems = $, this.max_length = A, this.has_stree = m && m.length;
+        }
+        function O(m, C) {
+          this.dyn_tree = m, this.max_code = 0, this.stat_desc = C;
+        }
+        function I(m) {
+          return m < 256 ? F[m] : F[256 + (m >>> 7)];
+        }
+        function J(m, C) {
+          m.pending_buf[m.pending++] = 255 & C, m.pending_buf[m.pending++] = C >>> 8 & 255;
+        }
+        function G(m, C, N) {
+          m.bi_valid > h - N ? (m.bi_buf |= C << m.bi_valid & 65535, J(m, m.bi_buf), m.bi_buf = C >> h - m.bi_valid, m.bi_valid += N - h) : (m.bi_buf |= C << m.bi_valid & 65535, m.bi_valid += N);
+        }
+        function X(m, C, N) {
+          G(m, N[2 * C], N[2 * C + 1]);
+        }
+        function st(m, C) {
+          for (var N = 0; N |= 1 & m, m >>>= 1, N <<= 1, 0 < --C; ) ;
+          return N >>> 1;
+        }
+        function lt(m, C, N) {
+          var $, A, Z = new Array(g + 1), K = 0;
+          for ($ = 1; $ <= g; $++) Z[$] = K = K + N[$ - 1] << 1;
+          for (A = 0; A <= C; A++) {
+            var H = m[2 * A + 1];
+            H !== 0 && (m[2 * A] = st(Z[H]++, H));
+          }
+        }
+        function et(m) {
+          var C;
+          for (C = 0; C < x; C++) m.dyn_ltree[2 * C] = 0;
+          for (C = 0; C < u; C++) m.dyn_dtree[2 * C] = 0;
+          for (C = 0; C < _; C++) m.bl_tree[2 * C] = 0;
+          m.dyn_ltree[2 * S] = 1, m.opt_len = m.static_len = 0, m.last_lit = m.matches = 0;
+        }
+        function nt(m) {
+          8 < m.bi_valid ? J(m, m.bi_buf) : 0 < m.bi_valid && (m.pending_buf[m.pending++] = m.bi_buf), m.bi_buf = 0, m.bi_valid = 0;
+        }
+        function ct(m, C, N, $) {
+          var A = 2 * C, Z = 2 * N;
+          return m[A] < m[Z] || m[A] === m[Z] && $[C] <= $[N];
+        }
+        function at(m, C, N) {
+          for (var $ = m.heap[N], A = N << 1; A <= m.heap_len && (A < m.heap_len && ct(C, m.heap[A + 1], m.heap[A], m.depth) && A++, !ct(C, $, m.heap[A], m.depth)); ) m.heap[N] = m.heap[A], N = A, A <<= 1;
+          m.heap[N] = $;
+        }
+        function dt(m, C, N) {
+          var $, A, Z, K, H = 0;
+          if (m.last_lit !== 0) for (; $ = m.pending_buf[m.d_buf + 2 * H] << 8 | m.pending_buf[m.d_buf + 2 * H + 1], A = m.pending_buf[m.l_buf + H], H++, $ === 0 ? X(m, A, C) : (X(m, (Z = s[A]) + v + 1, C), (K = B[Z]) !== 0 && G(m, A -= j[Z], K), X(m, Z = I(--$), N), (K = L[Z]) !== 0 && G(m, $ -= M[Z], K)), H < m.last_lit; ) ;
+          X(m, S, C);
+        }
+        function ht(m, C) {
+          var N, $, A, Z = C.dyn_tree, K = C.stat_desc.static_tree, H = C.stat_desc.has_stree, V = C.stat_desc.elems, it = -1;
+          for (m.heap_len = 0, m.heap_max = o, N = 0; N < V; N++) Z[2 * N] !== 0 ? (m.heap[++m.heap_len] = it = N, m.depth[N] = 0) : Z[2 * N + 1] = 0;
+          for (; m.heap_len < 2; ) Z[2 * (A = m.heap[++m.heap_len] = it < 2 ? ++it : 0)] = 1, m.depth[A] = 0, m.opt_len--, H && (m.static_len -= K[2 * A + 1]);
+          for (C.max_code = it, N = m.heap_len >> 1; 1 <= N; N--) at(m, Z, N);
+          for (A = V; N = m.heap[1], m.heap[1] = m.heap[m.heap_len--], at(m, Z, 1), $ = m.heap[1], m.heap[--m.heap_max] = N, m.heap[--m.heap_max] = $, Z[2 * A] = Z[2 * N] + Z[2 * $], m.depth[A] = (m.depth[N] >= m.depth[$] ? m.depth[N] : m.depth[$]) + 1, Z[2 * N + 1] = Z[2 * $ + 1] = A, m.heap[1] = A++, at(m, Z, 1), 2 <= m.heap_len; ) ;
+          m.heap[--m.heap_max] = m.heap[1], (function(rt, ft) {
+            var bt, pt, yt, ot, kt, It, mt = ft.dyn_tree, Ut = ft.max_code, he = ft.stat_desc.static_tree, de = ft.stat_desc.has_stree, pe = ft.stat_desc.extra_bits, Wt = ft.stat_desc.extra_base, vt = ft.stat_desc.max_length, St = 0;
+            for (ot = 0; ot <= g; ot++) rt.bl_count[ot] = 0;
+            for (mt[2 * rt.heap[rt.heap_max] + 1] = 0, bt = rt.heap_max + 1; bt < o; bt++) vt < (ot = mt[2 * mt[2 * (pt = rt.heap[bt]) + 1] + 1] + 1) && (ot = vt, St++), mt[2 * pt + 1] = ot, Ut < pt || (rt.bl_count[ot]++, kt = 0, Wt <= pt && (kt = pe[pt - Wt]), It = mt[2 * pt], rt.opt_len += It * (ot + kt), de && (rt.static_len += It * (he[2 * pt + 1] + kt)));
+            if (St !== 0) {
+              do {
+                for (ot = vt - 1; rt.bl_count[ot] === 0; ) ot--;
+                rt.bl_count[ot]--, rt.bl_count[ot + 1] += 2, rt.bl_count[vt]--, St -= 2;
+              } while (0 < St);
+              for (ot = vt; ot !== 0; ot--) for (pt = rt.bl_count[ot]; pt !== 0; ) Ut < (yt = rt.heap[--bt]) || (mt[2 * yt + 1] !== ot && (rt.opt_len += (ot - mt[2 * yt + 1]) * mt[2 * yt], mt[2 * yt + 1] = ot), pt--);
+            }
+          })(m, C), lt(Z, it, m.bl_count);
+        }
+        function t(m, C, N) {
+          var $, A, Z = -1, K = C[1], H = 0, V = 7, it = 4;
+          for (K === 0 && (V = 138, it = 3), C[2 * (N + 1) + 1] = 65535, $ = 0; $ <= N; $++) A = K, K = C[2 * ($ + 1) + 1], ++H < V && A === K || (H < it ? m.bl_tree[2 * A] += H : A !== 0 ? (A !== Z && m.bl_tree[2 * A]++, m.bl_tree[2 * z]++) : H <= 10 ? m.bl_tree[2 * E]++ : m.bl_tree[2 * R]++, Z = A, it = (H = 0) === K ? (V = 138, 3) : A === K ? (V = 6, 3) : (V = 7, 4));
+        }
+        function D(m, C, N) {
+          var $, A, Z = -1, K = C[1], H = 0, V = 7, it = 4;
+          for (K === 0 && (V = 138, it = 3), $ = 0; $ <= N; $++) if (A = K, K = C[2 * ($ + 1) + 1], !(++H < V && A === K)) {
+            if (H < it) for (; X(m, A, m.bl_tree), --H != 0; ) ;
+            else A !== 0 ? (A !== Z && (X(m, A, m.bl_tree), H--), X(m, z, m.bl_tree), G(m, H - 3, 2)) : H <= 10 ? (X(m, E, m.bl_tree), G(m, H - 3, 3)) : (X(m, R, m.bl_tree), G(m, H - 11, 7));
+            Z = A, it = (H = 0) === K ? (V = 138, 3) : A === K ? (V = 6, 3) : (V = 7, 4);
+          }
+        }
+        l(M);
+        var T = !1;
+        function y(m, C, N, $) {
+          G(m, (p << 1) + ($ ? 1 : 0), 3), (function(A, Z, K, H) {
+            nt(A), J(A, K), J(A, ~K), n.arraySet(A.pending_buf, A.window, Z, K, A.pending), A.pending += K;
+          })(m, C, N);
+        }
+        a._tr_init = function(m) {
+          T || ((function() {
+            var C, N, $, A, Z, K = new Array(g + 1);
+            for (A = $ = 0; A < w - 1; A++) for (j[A] = $, C = 0; C < 1 << B[A]; C++) s[$++] = A;
+            for (s[$ - 1] = A, A = Z = 0; A < 16; A++) for (M[A] = Z, C = 0; C < 1 << L[A]; C++) F[Z++] = A;
+            for (Z >>= 7; A < u; A++) for (M[A] = Z << 7, C = 0; C < 1 << L[A] - 7; C++) F[256 + Z++] = A;
+            for (N = 0; N <= g; N++) K[N] = 0;
+            for (C = 0; C <= 143; ) Y[2 * C + 1] = 8, C++, K[8]++;
+            for (; C <= 255; ) Y[2 * C + 1] = 9, C++, K[9]++;
+            for (; C <= 279; ) Y[2 * C + 1] = 7, C++, K[7]++;
+            for (; C <= 287; ) Y[2 * C + 1] = 8, C++, K[8]++;
+            for (lt(Y, x + 1, K), C = 0; C < u; C++) k[2 * C + 1] = 5, k[2 * C] = st(C, 5);
+            Q = new q(Y, B, v + 1, x, g), U = new q(k, L, 0, u, g), tt = new q(new Array(0), P, 0, _, b);
+          })(), T = !0), m.l_desc = new O(m.dyn_ltree, Q), m.d_desc = new O(m.dyn_dtree, U), m.bl_desc = new O(m.bl_tree, tt), m.bi_buf = 0, m.bi_valid = 0, et(m);
+        }, a._tr_stored_block = y, a._tr_flush_block = function(m, C, N, $) {
+          var A, Z, K = 0;
+          0 < m.level ? (m.strm.data_type === 2 && (m.strm.data_type = (function(H) {
+            var V, it = 4093624447;
+            for (V = 0; V <= 31; V++, it >>>= 1) if (1 & it && H.dyn_ltree[2 * V] !== 0) return r;
+            if (H.dyn_ltree[18] !== 0 || H.dyn_ltree[20] !== 0 || H.dyn_ltree[26] !== 0) return i;
+            for (V = 32; V < v; V++) if (H.dyn_ltree[2 * V] !== 0) return i;
+            return r;
+          })(m)), ht(m, m.l_desc), ht(m, m.d_desc), K = (function(H) {
+            var V;
+            for (t(H, H.dyn_ltree, H.l_desc.max_code), t(H, H.dyn_dtree, H.d_desc.max_code), ht(H, H.bl_desc), V = _ - 1; 3 <= V && H.bl_tree[2 * W[V] + 1] === 0; V--) ;
+            return H.opt_len += 3 * (V + 1) + 5 + 5 + 4, V;
+          })(m), A = m.opt_len + 3 + 7 >>> 3, (Z = m.static_len + 3 + 7 >>> 3) <= A && (A = Z)) : A = Z = N + 5, N + 4 <= A && C !== -1 ? y(m, C, N, $) : m.strategy === 4 || Z === A ? (G(m, 2 + ($ ? 1 : 0), 3), dt(m, Y, k)) : (G(m, 4 + ($ ? 1 : 0), 3), (function(H, V, it, rt) {
+            var ft;
+            for (G(H, V - 257, 5), G(H, it - 1, 5), G(H, rt - 4, 4), ft = 0; ft < rt; ft++) G(H, H.bl_tree[2 * W[ft] + 1], 3);
+            D(H, H.dyn_ltree, V - 1), D(H, H.dyn_dtree, it - 1);
+          })(m, m.l_desc.max_code + 1, m.d_desc.max_code + 1, K + 1), dt(m, m.dyn_ltree, m.dyn_dtree)), et(m), $ && nt(m);
+        }, a._tr_tally = function(m, C, N) {
+          return m.pending_buf[m.d_buf + 2 * m.last_lit] = C >>> 8 & 255, m.pending_buf[m.d_buf + 2 * m.last_lit + 1] = 255 & C, m.pending_buf[m.l_buf + m.last_lit] = 255 & N, m.last_lit++, C === 0 ? m.dyn_ltree[2 * N]++ : (m.matches++, C--, m.dyn_ltree[2 * (s[N] + v + 1)]++, m.dyn_dtree[2 * I(C)]++), m.last_lit === m.lit_bufsize - 1;
+        }, a._tr_align = function(m) {
+          G(m, 2, 3), X(m, S, Y), (function(C) {
+            C.bi_valid === 16 ? (J(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);
+          })(m);
+        };
+      }, { "../utils/common": 41 }], 53: [function(e, f, a) {
+        f.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(e, f, a) {
+        (function(n) {
+          (function(r, i) {
+            if (!r.setImmediate) {
+              var l, p, w, v, x = 1, u = {}, _ = !1, o = r.document, g = Object.getPrototypeOf && Object.getPrototypeOf(r);
+              g = g && g.setTimeout ? g : r, l = {}.toString.call(r.process) === "[object process]" ? function(z) {
+                process.nextTick(function() {
+                  b(z);
+                });
+              } : (function() {
+                if (r.postMessage && !r.importScripts) {
+                  var z = !0, E = r.onmessage;
+                  return r.onmessage = function() {
+                    z = !1;
+                  }, r.postMessage("", "*"), r.onmessage = E, z;
+                }
+              })() ? (v = "setImmediate$" + Math.random() + "$", r.addEventListener ? r.addEventListener("message", S, !1) : r.attachEvent("onmessage", S), function(z) {
+                r.postMessage(v + z, "*");
+              }) : r.MessageChannel ? ((w = new MessageChannel()).port1.onmessage = function(z) {
+                b(z.data);
+              }, function(z) {
+                w.port2.postMessage(z);
+              }) : o && "onreadystatechange" in o.createElement("script") ? (p = o.documentElement, function(z) {
+                var E = o.createElement("script");
+                E.onreadystatechange = function() {
+                  b(z), E.onreadystatechange = null, p.removeChild(E), E = null;
+                }, p.appendChild(E);
+              }) : function(z) {
+                setTimeout(b, 0, z);
+              }, g.setImmediate = function(z) {
+                typeof z != "function" && (z = new Function("" + z));
+                for (var E = new Array(arguments.length - 1), R = 0; R < E.length; R++) E[R] = arguments[R + 1];
+                var B = { callback: z, args: E };
+                return u[x] = B, l(x), x++;
+              }, g.clearImmediate = h;
+            }
+            function h(z) {
+              delete u[z];
+            }
+            function b(z) {
+              if (_) setTimeout(b, 0, z);
+              else {
+                var E = u[z];
+                if (E) {
+                  _ = !0;
+                  try {
+                    (function(R) {
+                      var B = R.callback, L = R.args;
+                      switch (L.length) {
+                        case 0:
+                          B();
+                          break;
+                        case 1:
+                          B(L[0]);
+                          break;
+                        case 2:
+                          B(L[0], L[1]);
+                          break;
+                        case 3:
+                          B(L[0], L[1], L[2]);
+                          break;
+                        default:
+                          B.apply(i, L);
+                      }
+                    })(E);
+                  } finally {
+                    h(z), _ = !1;
+                  }
+                }
+              }
+            }
+            function S(z) {
+              z.source === r && typeof z.data == "string" && z.data.indexOf(v) === 0 && b(+z.data.slice(v.length));
+            }
+          })(typeof self > "u" ? n === void 0 ? this : n : self);
+        }).call(this, typeof zt < "u" ? zt : typeof self < "u" ? self : typeof window < "u" ? window : {});
+      }, {}] }, {}, [10])(10);
+    });
+  })(Ot)), Ot.exports;
+}
+var qe = Je();
+const Qe = /* @__PURE__ */ Ve(qe), tr = /<xi:include\b[^>]*\bhref\s*=\s*(?:"([^"]+)"|'([^']+)')[^>]*\/>/g;
+function er(d) {
+  const c = d.lastIndexOf("/");
+  return c >= 0 ? d.slice(0, c) : "";
+}
+function rr(d) {
+  return d.replace(/\\/g, "/").replace(/^\.\//, "");
+}
+function nr(d, c, e) {
+  const f = er(c), a = [
+    d,
+    `${d}.ptx`,
+    `${d}.xml`,
+    f ? `${f}/${d}` : null,
+    f ? `${f}/${d}.ptx` : `${d}.ptx`,
+    f ? `${f}/${d}.xml` : `${d}.xml`
+  ].filter((n) => n !== null);
+  for (const n of a) {
+    const r = rr(n);
+    if (r in e)
+      return r;
+  }
+  return null;
+}
+function ir(d) {
+  return d.replace(/^\s*<\?xml[^?]*\?>\s*/, "");
+}
+function sr(d, c, e, f = 5) {
+  let a = 0;
+  const n = [], r = [], i = (p, w) => {
+    let v = !1;
+    return { output: p.replace(
+      tr,
+      (u, _, o) => {
+        const g = _ ?? o ?? "", h = nr(g, w, e);
+        return h ? r.includes(h) ? u : (v = !0, a += 1, ir(e[h])) : (n.includes(g) || n.push(g), u);
+      }
+    ), changed: v };
+  };
+  let l = d;
+  for (let p = 0; p < f; p += 1) {
+    r.push(c);
+    const { output: w, changed: v } = i(l, c);
+    if (r.pop(), l = w, !v)
+      break;
+  }
+  return {
+    expandedText: l,
+    expandedCount: a,
+    missingIncludes: n
+  };
+}
+const ar = /<(pretext|book|article)\b/;
+function or(d) {
+  const c = Object.keys(d).filter((f) => /\.(ptx|xml)$/i.test(f)).sort();
+  return c.length === 0 ? null : c.find((f) => ar.test(d[f])) ?? c[0];
+}
+const Vt = /([a-zA-Z_:][\w:.-]*)\s*=\s*(?:"([^"]*)"|'([^']*)')/g;
+function At(d) {
+  const c = {};
+  let e;
+  for (Vt.lastIndex = 0; (e = Vt.exec(d)) !== null; )
+    c[e[1]] = e[2] ?? e[3] ?? "";
+  return c;
+}
+function ce(d) {
+  const c = [];
+  let e = 0;
+  const f = d.length;
+  for (; e < f; ) {
+    const a = d.indexOf("<", e);
+    if (a < 0) break;
+    if (d.startsWith("<!--", a)) {
+      const o = d.indexOf("-->", a + 4);
+      e = o < 0 ? f : o + 3;
+      continue;
+    }
+    if (d.startsWith("<![CDATA[", a)) {
+      const o = d.indexOf("]]>", a + 9);
+      e = o < 0 ? f : o + 3;
+      continue;
+    }
+    if (d.startsWith("<?", a)) {
+      const o = d.indexOf("?>", a + 2);
+      e = o < 0 ? f : o + 2;
+      continue;
+    }
+    if (d.startsWith("<!", a)) {
+      const o = d.indexOf(">", a + 2);
+      e = o < 0 ? f : o + 1;
+      continue;
+    }
+    let n = a + 1, r = !1;
+    d[n] === "/" && (r = !0, n += 1);
+    const i = /^[a-zA-Z_:][\w:.-]*/.exec(d.slice(n));
+    if (!i) {
+      e = a + 1;
+      continue;
+    }
+    const l = i[0];
+    n += l.length;
+    let p = n, w = null;
+    for (; n < f; ) {
+      const o = d[n];
+      if (w) {
+        o === w && (w = null), n += 1;
+        continue;
+      }
+      if (o === '"' || o === "'") {
+        w = o, n += 1;
+        continue;
+      }
+      if (o === ">")
+        break;
+      n += 1;
+    }
+    if (n >= f) break;
+    const v = n + 1, x = d.slice(p, n), u = !r && x.trimEnd().endsWith("/"), _ = u ? x.replace(/\/\s*$/, "") : x;
+    r ? c.push({ kind: "close", name: l, pos: a, end: v }) : u ? c.push({ kind: "selfclose", name: l, attrs: _, pos: a, end: v }) : c.push({ kind: "open", name: l, attrs: _, pos: a, end: v }), e = v;
+  }
+  return c;
+}
+function Nt(d, c) {
+  const e = ce(d), f = [];
+  let a = 0, n = null;
+  for (const r of e) {
+    if (r.kind === "selfclose") {
+      a === 0 && r.name === c && f.push({
+        name: c,
+        start: r.pos,
+        startTagEnd: r.end,
+        contentEnd: r.end,
+        end: r.end,
+        inner: "",
+        outer: d.slice(r.pos, r.end),
+        attributes: At(r.attrs)
+      });
+      continue;
+    }
+    if (r.kind === "open") {
+      a === 0 && r.name === c && !n && (n = r), a += 1;
+      continue;
+    }
+    a -= 1, a < 0 && (a = 0), n && a === 0 && r.name === c && (f.push({
+      name: c,
+      start: n.pos,
+      startTagEnd: n.end,
+      contentEnd: r.pos,
+      end: r.end,
+      inner: d.slice(n.end, r.pos),
+      outer: d.slice(n.pos, r.end),
+      attributes: At(
+        n.attrs
+      )
+    }), n = null);
+  }
+  return f;
+}
+function wt(d, c) {
+  return Nt(d, c)[0] ?? null;
+}
+function Ct(d, c) {
+  const e = ce(d);
+  let f = 0, a = null, n = -1;
+  for (const r of e) {
+    if (r.kind === "selfclose") {
+      if (!a && r.name === c)
+        return {
+          name: c,
+          start: r.pos,
+          startTagEnd: r.end,
+          contentEnd: r.end,
+          end: r.end,
+          inner: "",
+          outer: d.slice(r.pos, r.end),
+          attributes: At(r.attrs)
+        };
+      continue;
+    }
+    if (r.kind === "open") {
+      !a && r.name === c && (a = r, n = f), f += 1;
+      continue;
+    }
+    if (f -= 1, f < 0 && (f = 0), a && r.name === c && f === n) {
+      const i = a.attrs;
+      return {
+        name: c,
+        start: a.pos,
+        startTagEnd: a.end,
+        contentEnd: r.pos,
+        end: r.end,
+        inner: d.slice(a.end, r.pos),
+        outer: d.slice(a.pos, r.end),
+        attributes: At(i)
+      };
+    }
+  }
+  return null;
+}
+function cr(d) {
+  return Ct(d, "book") ? "book" : Ct(d, "article") ? "article" : Ct(d, "chapter") ? "book" : "article";
+}
+function lr(d) {
+  const { mainSource: c, publication: e, outputBase: f = "output" } = d;
+  return `<?xml version="1.0" encoding="UTF-8"?>
+<project ptx-version="2">
+  <targets>
+    <target name="web">
+      <format>html</format>
+      <source>${c}</source>
+      <publication>${e}</publication>
+      <output-dir>${f}/web</output-dir>
+    </target>
+    <target name="print">
+      <format>pdf</format>
+      <source>${c}</source>
+      <publication>${e}</publication>
+      <output-dir>${f}/print</output-dir>
+    </target>
+  </targets>
+</project>
+`;
+}
+function ur() {
+  return `<?xml version="1.0" encoding="UTF-8"?>
+<publication>
+  <source>
+    <directories external="external" generated="generated"/>
+  </source>
+  <common>
+    <chunking level="1"/>
+  </common>
+</publication>
+`;
+}
+function fr() {
+  return `<?xml version="1.0" encoding="UTF-8"?>
+`;
+}
+const hr = "http://www.w3.org/2001/XInclude";
+function dr(d) {
+  return d.toLowerCase().replace(/[^a-z0-9]+/g, "-").replace(/^-+|-+$/g, "").slice(0, 60);
+}
+function Jt(d, c) {
+  const e = String(c).length;
+  return String(d).padStart(Math.max(e, 2), "0");
+}
+function qt(d, c) {
+  const e = [...c].sort((n, r) => n.start - r.start);
+  let f = "", a = 0;
+  for (const n of e)
+    f += d.slice(a, n.start), f += n.replacement, a = n.end;
+  return f += d.slice(a), f;
+}
+function Qt(d) {
+  return d.replace(
+    /<(pretext|book|article|chapter)\b([^>]*)>/,
+    (c, e, f) => /\bxmlns:xi\s*=/.test(f) ? c : `<${e}${f} xmlns:xi="${hr}">`
+  );
+}
+function te(d) {
+  return d.startsWith("<?xml") ? d : fr() + d;
+}
+function le(d) {
+  return d.trim().replace(/[^a-zA-Z0-9\-_]+/g, "-").replace(/^[^a-zA-Z_]+/, "").replace(/-+$/, "");
+}
+class pr {
+  used = /* @__PURE__ */ new Set();
+  claim(c) {
+    let e = c, f = 2;
+    for (; this.used.has(e); )
+      e = `${c}-${f}`, f += 1;
+    return this.used.add(e), e;
+  }
+  has(c) {
+    return this.used.has(c);
+  }
+}
+function Tt(d, c, e) {
+  const f = d.slice(0, c), a = d.slice(c);
+  return /\bxml:id\s*=\s*(?:"[^"]*"|'[^']*')/.test(f) ? f.replace(
+    /\bxml:id\s*=\s*(?:"[^"]*"|'[^']*')/,
+    `xml:id="${e}"`
+  ) + a : f.replace(/^<([a-zA-Z_:][\w:.-]*)/, `<$1 xml:id="${e}"`) + a;
+}
+function Rt(d) {
+  const c = wt(d, "title");
+  return c ? c.inner.replace(/<[^>]+>/g, "").replace(/\s+/g, " ").trim() : "";
+}
+function Bt(d, c, e) {
+  const f = d.attributes["xml:id"];
+  if (f) {
+    const a = le(f) || e, n = c.claim(a);
+    return n !== f ? { ref: n, renamedFrom: f, generated: !1 } : { ref: n, generated: !1 };
+  }
+  return { ref: c.claim(e), generated: !0 };
+}
+function Pt(d, c, e, f) {
+  c.renamedFrom !== void 0 ? d.push({
+    action: "anomaly",
+    severity: "warning",
+    kind: "structure",
+    category: "renamed_xml_id",
+    macro: e,
+    occurrences: 1,
+    message: `<${e}> xml:id \`${c.renamedFrom}\` is not a valid ref (or collides with another); renamed to \`${c.ref}\`. Cross-references to the old id will break.`
+  }) : c.generated && d.push({
+    action: "anomaly",
+    severity: "info",
+    kind: "structure",
+    category: "missing_xml_id",
+    macro: e,
+    occurrences: 1,
+    message: `<${e}> at position ${f} has no xml:id; assigned \`${c.ref}\`.`
+  });
+}
+function ee(d, c) {
+  const e = d.outer.slice(0, d.startTagEnd - d.start), f = d.outer.slice(d.contentEnd - d.start);
+  return e + c + f;
+}
+function mr(d, c) {
+  return Object.entries(d).map(([e, f]) => {
+    const a = e.split("/").pop() ?? e, n = a.replace(/\.[^.]+$/, "");
+    return { ref: c.claim(le(n) || "asset"), fileName: a, data: f };
+  });
+}
+function gr(d, c = {}) {
+  const e = [], f = c.documentKind ?? cr(d), a = c.splitChapters ?? f === "book", n = c.splitSections ?? !1, r = Ct(d, "pretext"), i = r ? r.inner : d, l = wt(i, "docinfo"), p = l?.outer.trim() ?? "";
+  let w = wt(i, "book") ?? wt(i, "article");
+  if (!w) {
+    const b = f === "book" ? "book" : "article", S = (l ? i.slice(0, l.start) + i.slice(l.end) : i).trim();
+    w = wt(
+      `<${b}>
+${S}
+</${b}>`,
+      b
+    );
+  }
+  if (!w)
+    throw new Error("Could not locate a root element for the division pool.");
+  f === "book" && w.name !== "book" && e.push({
+    action: "anomaly",
+    severity: "warning",
+    kind: "structure",
+    category: "missing_root",
+    macro: "book",
+    occurrences: 1,
+    message: "Document was treated as a book but no <book> element found; importing with the existing root."
+  });
+  const v = new pr(), x = [], u = Bt(w, v, "document");
+  u.renamedFrom !== void 0 && Pt(e, u, w.name, 1);
+  const _ = Rt(w.inner);
+  let o = w.inner;
+  if (a && f === "book") {
+    const b = Nt(w.inner, "chapter"), S = b.map((z, E) => {
+      const R = Bt(
+        z,
+        v,
+        `ch-${Jt(E + 1, b.length)}`
+      );
+      Pt(e, R, "chapter", E + 1);
+      let B = z.inner;
+      if (n) {
+        const L = Nt(z.inner, "section"), P = L.map((W, Y) => {
+          const k = Bt(
+            W,
+            v,
+            `${R.ref}-sec-${Jt(Y + 1, L.length)}`
+          );
+          return Pt(e, k, "section", Y + 1), x.push({
+            xmlId: k.ref,
+            type: "section",
+            title: Rt(W.inner),
+            sourceFormat: "pretext",
+            content: Tt(
+              W.outer,
+              W.startTagEnd - W.start,
+              k.ref
+            ),
+            isRoot: !1
+          }), {
+            start: W.start,
+            end: W.end,
+            replacement: `<plus:section ref="${k.ref}"/>`
+          };
+        });
+        B = qt(z.inner, P);
+      }
+      return x.push({
+        xmlId: R.ref,
+        type: "chapter",
+        title: Rt(z.inner),
+        sourceFormat: "pretext",
+        content: Tt(
+          ee(z, B),
+          z.startTagEnd - z.start,
+          R.ref
+        ),
+        isRoot: !1
+      }), {
+        start: z.start,
+        end: z.end,
+        replacement: `<plus:chapter ref="${R.ref}"/>`
+      };
+    });
+    o = qt(w.inner, S);
+  }
+  const g = {
+    xmlId: u.ref,
+    type: w.name === "book" ? "book" : "article",
+    title: _,
+    sourceFormat: "pretext",
+    content: Tt(
+      ee(w, o),
+      w.startTagEnd - w.start,
+      u.ref
+    ),
+    isRoot: !0
+  };
+  x.unshift(g);
+  const h = mr(c.assets ?? {}, v);
+  return {
+    project: {
+      title: _,
+      docinfo: p,
+      documentKind: f,
+      divisions: x,
+      assets: h
+    },
+    warnings: e
+  };
+}
+const Ft = {
+  mainSourcePath: "source/main.ptx",
+  publicationPath: "publication/publication.ptx",
+  projectFilePath: "project.ptx"
+}, $t = /<plus:([a-zA-Z][a-zA-Z-]*)\s+ref="([^"]+)"\s*\/>/g;
+function re(d) {
+  const c = [];
+  $t.lastIndex = 0;
+  let e;
+  for (; (e = $t.exec(d)) !== null; )
+    c.push(e[2]);
+  return c;
+}
+function Dt(d, c) {
+  const e = dr(d) || "division";
+  return e.startsWith(`${c}-`) ? e : `${c}-${e}`;
+}
+function jt(d, c) {
+  let e = c, f = 2;
+  for (; d.has(e); )
+    e = `${c}-${f}`, f += 1;
+  return d.add(e), e;
+}
+function _r(d, c) {
+  const e = `${c}-`;
+  return d.startsWith(e) ? d.slice(e.length) : d;
+}
+function ne(d, c) {
+  return d.replace($t, (e, f, a) => {
+    const n = c.get(a);
+    return n ? `<xi:include href="${n}"/>` : e;
+  });
+}
+function br(d, c = {}) {
+  const e = c.mainSourcePath ?? Ft.mainSourcePath, f = c.publicationPath ?? Ft.publicationPath, a = c.projectFilePath ?? Ft.projectFilePath, n = c.includeScaffold ?? !0, r = {}, i = new Map(
+    d.divisions.map((h) => [h.xmlId, h])
+  ), l = d.divisions.find((h) => h.isRoot);
+  if (!l)
+    throw new Error("Division pool has no root division.");
+  const p = /* @__PURE__ */ new Set(), w = /* @__PURE__ */ new Map(), v = e.includes("/") ? e.slice(0, e.lastIndexOf("/") + 1) : "", x = [];
+  for (const h of re(l.content)) {
+    const b = i.get(h);
+    if (!b) continue;
+    const S = jt(
+      p,
+      Dt(b.xmlId, "ch")
+    );
+    w.set(b.xmlId, `${S}.ptx`), x.push({
+      division: b,
+      filePath: `${v}${S}.ptx`
+    });
+    const z = /* @__PURE__ */ new Set();
+    for (const E of re(b.content)) {
+      const R = i.get(E);
+      if (!R) continue;
+      const B = jt(
+        z,
+        Dt(_r(R.xmlId, b.xmlId), "sec")
+      );
+      w.set(R.xmlId, `${S}/${B}.ptx`), x.push({
+        division: R,
+        filePath: `${v}${S}/${B}.ptx`
+      });
+    }
+  }
+  const u = new Set(x.map((h) => h.division.xmlId));
+  for (const h of d.divisions) {
+    if (h.isRoot || u.has(h.xmlId)) continue;
+    const b = h.type === "section" ? "sec" : "ch", S = jt(p, Dt(h.xmlId, b));
+    w.set(h.xmlId, `${S}.ptx`), x.push({ division: h, filePath: `${v}${S}.ptx` });
+  }
+  for (const { division: h, filePath: b } of x) {
+    const S = ne(h.content, w), z = S === h.content ? S : Qt(S);
+    r[b] = te(z);
+  }
+  const _ = ne(l.content, w), g = `<pretext>
+${d.docinfo ? `${d.docinfo}
+` : ""}${_}
+</pretext>`;
+  return r[e] = te(
+    _ === l.content ? g : Qt(g)
+  ), n && (r[a] = lr({
+    mainSource: e,
+    publication: f
+  }), r[f] = ur()), { files: r };
+}
+const yr = /\.(tex|zip|md|markdown|ptx|xml|tar\.gz|tgz)$/i, vr = [
+  "tex",
+  "md",
+  "markdown",
+  "ptx",
+  "xml",
+  "bib",
+  "sty",
+  "txt",
+  "pdf",
+  "eps",
+  "png",
+  "ps",
+  "bbl"
+], wr = /* @__PURE__ */ new Set([
+  "png",
+  "jpg",
+  "jpeg",
+  "gif",
+  "pdf",
+  "eps",
+  "ps",
+  "bmp",
+  "tiff",
+  "tif",
+  "webp",
+  "ico"
+]), xr = /* @__PURE__ */ new Set([
+  "png",
+  "jpg",
+  "jpeg",
+  "gif",
+  "svg",
+  "bmp",
+  "tiff",
+  "tif",
+  "webp",
+  "ico",
+  "pdf",
+  "eps",
+  "ps"
+]);
+function ue(d) {
+  return wr.has(d.toLowerCase());
+}
+function fe(d) {
+  return d.split("/").pop() ?? d;
+}
+function kr(d) {
+  const c = fe(d), e = gt(c);
+  return xr.has(e) ? `source/assets/${c}` : null;
+}
+function Sr(d) {
+  const c = fe(d);
+  return gt(c) === "bib" ? `source/${c}` : null;
+}
+function xt(d) {
+  return d.replace(/\r\n?/g, `
+`).replace(/(\n *){3,}/g, `
+
+`);
+}
+function _t(d) {
+  return d.replace(/\\/g, "/").replace(/^\.\//, "");
+}
+function zr(d) {
+  const c = d.toLowerCase();
+  return c.endsWith(".tar.gz") || c.endsWith(".tgz") ? "tar.gz" : c.endsWith(".zip") ? "zip" : c.endsWith(".tex") ? "tex" : c.endsWith(".md") || c.endsWith(".markdown") ? "markdown" : c.endsWith(".ptx") || c.endsWith(".xml") ? "pretext" : null;
+}
+function Er(d) {
+  const c = (e, f) => new TextDecoder().decode(d.slice(e, f)).split("\0")[0];
+  return {
+    name: c(0, 100),
+    size: parseInt(c(124, 136), 8) || 0,
+    type: c(156, 157)
+  };
+}
+async function Cr(d) {
+  if (typeof DecompressionStream > "u")
+    throw new Error("This runtime does not support gzip decompression.");
+  const f = new ReadableStream({
+    start(l) {
+      l.enqueue(new Uint8Array(d)), l.close();
+    }
+  }).pipeThrough(
+    new DecompressionStream("gzip")
+  ).getReader(), a = [];
+  for (; ; ) {
+    const { done: l, value: p } = await f.read();
+    if (l)
+      break;
+    a.push(p);
+  }
+  const n = a.reduce((l, p) => l + p.length, 0), r = new Uint8Array(n);
+  let i = 0;
+  for (const l of a)
+    r.set(l, i), i += l.length;
+  return r.buffer;
+}
+function Ar(d) {
+  const c = {}, e = {};
+  let f = 0;
+  for (; f < d.length && !(f + 512 > d.length); ) {
+    const a = d.slice(f, f + 512), n = Er(a);
+    if (!n.name)
+      break;
+    f += 512;
+    const r = n.size, i = Math.ceil(r / 512) * 512;
+    if (n.type === "0" || n.type === "") {
+      const l = d.slice(f, f + r), p = _t(n.name);
+      if (ue(gt(p)))
+        e[p] = l;
+      else {
+        const w = new TextDecoder().decode(l);
+        c[p] = xt(w);
+      }
+    }
+    f += i;
+  }
+  return { files: c, assets: e };
+}
+async function Ir(d) {
+  const c = zr(d.name);
+  if (!c)
+    throw new Error(
+      "File format not supported: please upload .tex, .md, .ptx, .xml, .zip, or .tar.gz."
+    );
+  if (c === "tex" || c === "markdown" || c === "pretext") {
+    const a = await d.text();
+    return {
+      files: { [_t(d.name)]: xt(a) },
+      assets: {}
+    };
+  }
+  if (c === "zip") {
+    const n = await new Qe().loadAsync(d), r = {}, i = {};
+    for (const [l, p] of Object.entries(n.files)) {
+      if (p.dir)
+        continue;
+      const w = _t(l);
+      if (ue(gt(w)))
+        i[w] = await p.async("uint8array");
+      else {
+        const v = await p.async("string");
+        r[w] = xt(v);
+      }
+    }
+    return { files: r, assets: i };
+  }
+  const e = await d.arrayBuffer(), f = await Cr(e);
+  return Ar(new Uint8Array(f));
+}
+function gt(d) {
+  const c = d.toLowerCase().match(/\.([^.\/]+)$/);
+  return c ? c[1] : "";
+}
+function Or(d) {
+  const c = Object.keys(d).filter((f) => gt(f) === "tex").sort();
+  return c.length === 0 ? null : c.find(
+    (f) => /\\begin *\{document\}/.test(d[f])
+  ) ?? c[0];
+}
+function Tr(d) {
+  const c = d.lastIndexOf("/");
+  return c >= 0 ? d.slice(0, c) : "";
+}
+function Rr(d, c, e) {
+  const f = Tr(c);
+  return [
+    d,
+    `${d}.tex`,
+    f ? `${f}/${d}` : d,
+    f ? `${f}/${d}.tex` : `${d}.tex`
+  ].map(_t).find((n) => n in e) ?? null;
+}
+function Br(d, c, e) {
+  let f = 0;
+  const a = [], n = (i) => {
+    let l = !1;
+    return { output: i.replace(
+      /(\\(input|include) *\{([^{}]+)\})/g,
+      (w, v, x, u) => {
+        const _ = Rr(u, c, e);
+        return _ ? (l = !0, f += 1, e[_]) : (a.includes(u) || a.push(u), w);
+      }
+    ), changed: l };
+  };
+  let r = d;
+  for (let i = 0; i < 3; i += 1) {
+    const { output: l, changed: p } = n(r);
+    if (r = l, !p)
+      break;
+  }
+  return { expandedText: xt(r), expandedCount: f, missingInputs: a };
+}
+function Pr(d) {
+  const c = Or(d);
+  if (c)
+    return { sourcePath: c, sourceType: "tex" };
+  const e = Object.keys(d).sort(), f = e.find((i) => {
+    const l = gt(i);
+    return l === "md" || l === "markdown";
+  });
+  if (f)
+    return { sourcePath: f, sourceType: "markdown" };
+  const a = or(d);
+  if (a)
+    return { sourcePath: a, sourceType: "pretext" };
+  if (e.length === 0)
+    throw new Error("No files were found in the uploaded source.");
+  const n = e[0], r = ie(d[n]);
+  return {
+    sourcePath: n,
+    sourceType: r === "latex" ? "tex" : r
+  };
+}
+function Fr(d) {
+  const c = { other: 0 };
+  for (const e of vr)
+    c[e] = 0;
+  for (const e of Object.keys(d)) {
+    const f = gt(e);
+    f in c ? c[f] += 1 : c.other += 1;
+  }
+  return c;
+}
+function Dr(d, c) {
+  const e = Fr(c);
+  d.push({ type: "success", message: "File types:" });
+  for (const f of Object.keys(e).sort())
+    e[f] && d.push({ type: "success", message: `${f}: ${e[f]}` });
+}
+function jr(d) {
+  return d === "tex" ? "latex" : d === "markdown" ? "markdown" : "pretext";
+}
+function Nr(d, c = {}) {
+  const e = [];
+  try {
+    const f = Object.fromEntries(
+      Object.entries(d).map(([z, E]) => [
+        _t(z),
+        xt(E)
+      ])
+    ), a = Object.keys(f).length;
+    e.push({
+      type: "success",
+      message: `Found ${a} file${a === 1 ? "" : "s"}.`
+    }), Dr(e, f);
+    const { sourcePath: n, sourceType: r } = Pr(f);
+    let i = f[n] ?? "";
+    if (r === "tex") {
+      const z = Object.fromEntries(
+        Object.entries(f).filter(
+          ([L]) => gt(L) === "tex"
+        )
+      ), { expandedText: E, expandedCount: R, missingInputs: B } = Br(
+        i,
+        n,
+        z
+      );
+      i = E, R > 0 && e.push({
+        type: "success",
+        message: `Expanded ${R} input/include reference${R === 1 ? "" : "s"}.`
+      }), B.length > 0 && e.push({
+        type: "error",
+        message: `Missing input/include files: ${B.join(", ")}.`
+      });
+    } else if (r === "pretext") {
+      const z = Object.fromEntries(
+        Object.entries(f).filter(([L]) => {
+          const P = gt(L);
+          return P === "ptx" || P === "xml";
+        })
+      ), { expandedText: E, expandedCount: R, missingIncludes: B } = sr(i, n, z);
+      i = E, R > 0 && e.push({
+        type: "success",
+        message: `Expanded ${R} xi:include reference${R === 1 ? "" : "s"}.`
+      }), B.length > 0 && e.push({
+        type: "error",
+        message: `Missing xi:include targets: ${B.join(", ")}.`
+      });
+    }
+    e.push({
+      type: "success",
+      message: `Main source file: ${n}`
+    });
+    const l = jr(r), p = Ye(i, l);
+    if ("pretextError" in p)
+      return {
+        pretextError: p.pretextError,
+        statusMessages: e,
+        warnings: p.warnings
+      };
+    const {
+      buildLayout: w = !0,
+      assets: v = {},
+      ...x
+    } = c, u = {}, _ = {};
+    for (const [z, E] of Object.entries(v)) {
+      const R = kr(z);
+      R && (u[R] = E, _[z] = E);
+    }
+    const o = gr(p.pretextSource, {
+      documentKind: x.documentKind,
+      splitChapters: w ? x.splitChapters : !1,
+      splitSections: w ? x.splitSections : !1,
+      assets: _
+    }), g = w ? br(o.project, {
+      mainSourcePath: x.mainSourcePath,
+      publicationPath: x.publicationPath,
+      projectFilePath: x.projectFilePath
+    }).files : { "source/main.ptx": p.pretextSource };
+    for (const [z, E] of Object.entries(f)) {
+      const R = Sr(z);
+      R && !(R in g) && (g[R] = E);
+    }
+    const h = o.project.documentKind, b = [...p.warnings, ...o.warnings];
+    let S;
+    return p.cleanedNativeSource !== void 0 && p.cleanedNativeSource.length > 0 && (p.sourceFormat === "latex" ? S = { "source/main.tex": p.cleanedNativeSource } : p.sourceFormat === "markdown" && (S = { "source/main.md": p.cleanedNativeSource })), Object.keys(v).length > 0 && e.push({
+      type: "success",
+      message: `Routed ${Object.keys(u).length} binary asset${Object.keys(u).length === 1 ? "" : "s"}.`
+    }), {
+      ...p,
+      warnings: b,
+      sourcePath: n,
+      sourceName: n.split("/").pop() ?? n,
+      sourceType: r,
+      project: o.project,
+      files: f,
+      assets: v,
+      outputFiles: g,
+      outputAssets: u,
+      nativeOutputFiles: S,
+      documentKind: h,
+      statusMessages: e
+    };
+  } catch (f) {
+    const a = f instanceof Error ? f.message : String(f);
+    return e.push({ type: "error", message: a }), {
+      pretextError: a,
+      statusMessages: e,
+      warnings: []
+    };
+  }
+}
+async function Wr(d, c = {}) {
+  const e = [], f = _t(d.name);
+  if (!yr.test(f.toLowerCase()))
+    return {
+      pretextError: "File format not supported: please upload .tex, .md, .ptx, .xml, .zip, or .tar.gz.",
+      statusMessages: [
+        {
+          type: "error",
+          message: "File format not supported: please upload .tex, .md, .ptx, .xml, .zip, or .tar.gz."
+        }
+      ],
+      warnings: []
+    };
+  e.push({
+    type: "loading",
+    message: `Processing ${f}...`
+  });
+  try {
+    const { files: a, assets: n } = await Ir(d), r = Nr(a, { ...c, assets: n });
+    return {
+      ...r,
+      statusMessages: [...e, ...r.statusMessages]
+    };
+  } catch (a) {
+    const n = a instanceof Error ? a.message : String(a);
+    return {
+      pretextError: n,
+      statusMessages: [...e, { type: "error", message: n }],
+      warnings: []
+    };
+  }
+}
+function Mr(d, c) {
+  return c === "converted" ? d.outputFiles : d.nativeOutputFiles ?? d.files;
+}
+function Zr(d, c) {
+  return c === "converted" ? d.outputAssets : d.assets;
+}
+function Hr(d) {
+  const c = d.action === "replace" || d.action === "rewrite" ? `replaced with \`${d.replacement}\`` : d.message ?? d.action, e = d.occurrences > 1 ? ` (x${d.occurrences})` : "";
+  return `[${d.severity}] ${d.macro}: ${c}${e}`;
+}
+export {
+  br as A,
+  be as L,
+  ye as M,
+  ur as a,
+  Nt as b,
+  dr as c,
+  cr as d,
+  Qt as e,
+  Ct as f,
+  Zr as g,
+  gr as h,
+  je as i,
+  Xe as j,
+  Ge as k,
+  Ye as l,
+  ie as m,
+  re as n,
+  sr as o,
+  Jt as p,
+  Mr as q,
+  lr as r,
+  qt as s,
+  Hr as t,
+  Ke as u,
+  Wr as v,
+  te as w,
+  Nr as x,
+  Lt as y,
+  le as z
+};