vue-book-reader 1.2.5 → 1.2.7

package/dist/vue-book-reader.es.js

@@ -1613,6 +1613,9 @@ const _sfc_main$2 = /* @__PURE__ */ defineComponent({
     location: {
       type: [String, Number]
     },
+    initOption: {
+      type: Object
+    },
     tocChanged: Function,
     getRendition: Function
   },
@@ -1630,7 +1633,7 @@ const _sfc_main$2 = /* @__PURE__ */ defineComponent({
         };
     }
     const props = __props;
-    const { tocChanged, getRendition } = props;
+    const { tocChanged, getRendition, initOption } = props;
     const { url, location } = toRefs(props);
     const emit = __emit;
     let view$1 = null;
@@ -1648,20 +1651,20 @@ const _sfc_main$2 = /* @__PURE__ */ defineComponent({
           }
           await view$1.open(url.value);
           getRendition && getRendition(view$1);
-          initReader();
+          await initReader();
         }
       } catch (error) {
         console.error("Error opening book:", error);
         isError.value = true;
       }
     };
-    const initReader = () => {
+    const initReader = async () => {
       isLoaded.value = true;
       const { book } = view$1;
       registerEvents();
       tocChanged && tocChanged(book.toc);
-      if (location && location.value) {
-        view$1 == null ? void 0 : view$1.goTo(location.value);
+      if (initOption) {
+        await view$1.init(initOption);
       } else {
         view$1.renderer.next();
       }
@@ -1728,7 +1731,7 @@ const _export_sfc = (sfc, props) => {
   }
   return target;
 };
-const BookView = /* @__PURE__ */ _export_sfc(_sfc_main$2, [["__scopeId", "data-v-cbfdb46e"]]);
+const BookView = /* @__PURE__ */ _export_sfc(_sfc_main$2, [["__scopeId", "data-v-0c743b16"]]);
 const _hoisted_1$1 = ["onClick"];
 const _hoisted_2$1 = { key: 0 };
 const _sfc_main$1 = /* @__PURE__ */ defineComponent({
@@ -1933,8 +1936,8 @@ const _sfc_main = /* @__PURE__ */ defineComponent({
 });
 const VueReader = /* @__PURE__ */ _export_sfc(_sfc_main, [["__scopeId", "data-v-ce33d15c"]]);
 const findIndices = (arr, f2) => arr.map((x2, i2, a2) => f2(x2, i2, a2) ? i2 : null).filter((x2) => x2 != null);
-const splitAt = (arr, is) => [-1, ...is, arr.length].reduce(({ xs, a: a2 }, b2) => ({ xs: (xs == null ? void 0 : xs.concat([arr.slice(a2 + 1, b2)])) ?? [], a: b2 }), {}).xs;
-const concatArrays = (a2, b2) => a2.slice(0, -1).concat([a2[a2.length - 1].concat(b2[0])]).concat(b2.slice(1));
+const splitAt = (arr, is) => [-1, ...is, arr.length].reduce(({ xs, a: a2 }, b3) => ({ xs: (xs == null ? void 0 : xs.concat([arr.slice(a2 + 1, b3)])) ?? [], a: b3 }), {}).xs;
+const concatArrays = (a2, b3) => a2.slice(0, -1).concat([a2[a2.length - 1].concat(b3[0])]).concat(b3.slice(1));
 const isNumber = /\d/;
 const isCFI = /^epubcfi\((.*)\)$/;
 const escapeCFI = (str) => str.replace(/[\^[\](),;=]/g, "^$&");
@@ -2055,12 +2058,12 @@ const buildRange = (from, to) => {
   let pushToParent = true;
   const len = Math.max(localFrom.length, localTo.length);
   for (let i2 = 0; i2 < len; i2++) {
-    const a2 = localFrom[i2], b2 = localTo[i2];
-    pushToParent &&= (a2 == null ? void 0 : a2.index) === (b2 == null ? void 0 : b2.index) && !(a2 == null ? void 0 : a2.offset) && !(b2 == null ? void 0 : b2.offset);
+    const a2 = localFrom[i2], b3 = localTo[i2];
+    pushToParent &&= (a2 == null ? void 0 : a2.index) === (b3 == null ? void 0 : b3.index) && !(a2 == null ? void 0 : a2.offset) && !(b3 == null ? void 0 : b3.offset);
     if (pushToParent) localParent.push(a2);
     else {
       if (a2) localStart.push(a2);
-      if (b2) localEnd.push(b2);
+      if (b3) localEnd.push(b3);
     }
   }
   const parent = from.slice(0, -1).concat([localParent]);
@@ -2121,7 +2124,9 @@ const partsToNode = (node, parts, filter2) => {
   }
 };
 const nodeToParts = (node, offset, filter2) => {
-  const { parentNode, id } = node;
+  let { id, parentNode } = node;
+  while (filter2)
+    parentNode = parentNode.parentNode;
   const indexed = indexChildNodes(parentNode, filter2);
   const index = indexed.findIndex((x2) => Array.isArray(x2) ? x2.some((x3) => x3 === node) : x2 === node);
   const chunk = indexed[index];
@@ -2233,7 +2238,7 @@ class SectionProgress {
     this.sizes = sections.map((s2) => s2.linear != "no" && s2.size > 0 ? s2.size : 0);
     this.sizePerLoc = sizePerLoc;
     this.sizePerTimeUnit = sizePerTimeUnit;
-    this.sizeTotal = this.sizes.reduce((a2, b2) => a2 + b2, 0);
+    this.sizeTotal = this.sizes.reduce((a2, b3) => a2 + b3, 0);
     this.sectionFractions = this.#getSectionFractions();
   }
   #getSectionFractions() {
@@ -2247,7 +2252,7 @@ class SectionProgress {
   getProgress(index, fractionInSection, pageFraction = 0) {
     const { sizes, sizePerLoc, sizePerTimeUnit, sizeTotal } = this;
     const sizeInSection = sizes[index] ?? 0;
-    const sizeBefore = sizes.slice(0, index).reduce((a2, b2) => a2 + b2, 0);
+    const sizeBefore = sizes.slice(0, index).reduce((a2, b3) => a2 + b3, 0);
     const size = sizeBefore + fractionInSection * sizeInSection;
     const nextSize = size + pageFraction * sizeInSection;
     const remainingTotal = sizeTotal - size;
@@ -2324,12 +2329,12 @@ class Overlayer {
       obj.rects = rects;
     }
   }
-  hitTest({ x: x2, y: y2 }) {
+  hitTest({ x: x2, y: y3 }) {
     const arr = Array.from(this.#map.entries());
     for (let i2 = arr.length - 1; i2 >= 0; i2--) {
       const [key, obj] = arr[i2];
       for (const { left, top, right, bottom } of obj.rects)
-        if (top <= y2 && left <= x2 && bottom > y2 && right > x2)
+        if (top <= y3 && left <= x2 && bottom > y3 && right > x2)
           return [key, obj.range];
     }
     return [];
@@ -2490,7 +2495,7 @@ const textWalker = function* (x2, func, filterFunc) {
   const walker = document.createTreeWalker(root, filter$1, { acceptNode: filterFunc || acceptNode });
   const walk = x2.commonAncestorContainer ? walkRange : walkDocument;
   const nodes = walk(x2, walker);
-  const strs = nodes.map((node) => node.nodeValue);
+  const strs = nodes.map((node) => node.nodeValue ?? "");
   const makeRange2 = (startIndex, startOffset, endIndex, endOffset) => {
     const range = document.createRange();
     range.setStart(nodes[startIndex], startOffset);
@@ -2697,6 +2702,8 @@ let View$1 = class View extends HTMLElement {
   #tocProgress;
   #pageProgress;
   #searchResults = /* @__PURE__ */ new Map();
+  #searchDraw;
+  #searchDrawOptions;
   #cursorAutohider = new CursorAutohider(this, () => this.hasAttribute("autohide-cursor"));
   isFixedLayout = false;
   lastLocation;
@@ -2799,6 +2806,17 @@ let View$1 = class View extends HTMLElement {
       await this.next();
     }
   }
+  getLabelByFraction(fraction) {
+    if (!this.#sectionProgress || !this.#tocProgress) return null;
+    try {
+      const [index] = this.#sectionProgress.getSection(fraction);
+      if (index == null) return null;
+      const tocItem = this.#tocProgress.getProgress(index, null);
+      return (tocItem == null ? void 0 : tocItem.label) || null;
+    } catch (e2) {
+      return null;
+    }
+  }
   #emit(name, detail, cancelable) {
     return this.dispatchEvent(new CustomEvent(name, { detail, cancelable }));
   }
@@ -2850,7 +2868,7 @@ let View$1 = class View extends HTMLElement {
           return;
         }
         const range = doc ? anchor2(doc) : anchor2;
-        overlayer.add(value, range, Overlayer.outline);
+        overlayer.add(value, range, this.#searchDraw, this.#searchDrawOptions);
       }
       return;
     }
@@ -3011,6 +3029,8 @@ let View$1 = class View extends HTMLElement {
   async *search(opts) {
     var _a;
     this.clearSearch();
+    this.#searchDraw = opts.draw ?? Overlayer.outline;
+    this.#searchDrawOptions = opts.drawOptions;
     const { searchMatcher: searchMatcher2 } = await Promise.resolve().then(() => search$1);
     const { query, index } = opts;
     const matcher = searchMatcher2(
@@ -3065,511 +3085,81 @@ const view = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty
   View: View$1,
   makeBook
 }, Symbol.toStringTag, { value: "Module" }));
-const e$1 = -2, t$1 = -3, n$1 = -5, i$1 = [0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535], r$1 = [96, 7, 256, 0, 8, 80, 0, 8, 16, 84, 8, 115, 82, 7, 31, 0, 8, 112, 0, 8, 48, 0, 9, 192, 80, 7, 10, 0, 8, 96, 0, 8, 32, 0, 9, 160, 0, 8, 0, 0, 8, 128, 0, 8, 64, 0, 9, 224, 80, 7, 6, 0, 8, 88, 0, 8, 24, 0, 9, 144, 83, 7, 59, 0, 8, 120, 0, 8, 56, 0, 9, 208, 81, 7, 17, 0, 8, 104, 0, 8, 40, 0, 9, 176, 0, 8, 8, 0, 8, 136, 0, 8, 72, 0, 9, 240, 80, 7, 4, 0, 8, 84, 0, 8, 20, 85, 8, 227, 83, 7, 43, 0, 8, 116, 0, 8, 52, 0, 9, 200, 81, 7, 13, 0, 8, 100, 0, 8, 36, 0, 9, 168, 0, 8, 4, 0, 8, 132, 0, 8, 68, 0, 9, 232, 80, 7, 8, 0, 8, 92, 0, 8, 28, 0, 9, 152, 84, 7, 83, 0, 8, 124, 0, 8, 60, 0, 9, 216, 82, 7, 23, 0, 8, 108, 0, 8, 44, 0, 9, 184, 0, 8, 12, 0, 8, 140, 0, 8, 76, 0, 9, 248, 80, 7, 3, 0, 8, 82, 0, 8, 18, 85, 8, 163, 83, 7, 35, 0, 8, 114, 0, 8, 50, 0, 9, 196, 81, 7, 11, 0, 8, 98, 0, 8, 34, 0, 9, 164, 0, 8, 2, 0, 8, 130, 0, 8, 66, 0, 9, 228, 80, 7, 7, 0, 8, 90, 0, 8, 26, 0, 9, 148, 84, 7, 67, 0, 8, 122, 0, 8, 58, 0, 9, 212, 82, 7, 19, 0, 8, 106, 0, 8, 42, 0, 9, 180, 0, 8, 10, 0, 8, 138, 0, 8, 74, 0, 9, 244, 80, 7, 5, 0, 8, 86, 0, 8, 22, 192, 8, 0, 83, 7, 51, 0, 8, 118, 0, 8, 54, 0, 9, 204, 81, 7, 15, 0, 8, 102, 0, 8, 38, 0, 9, 172, 0, 8, 6, 0, 8, 134, 0, 8, 70, 0, 9, 236, 80, 7, 9, 0, 8, 94, 0, 8, 30, 0, 9, 156, 84, 7, 99, 0, 8, 126, 0, 8, 62, 0, 9, 220, 82, 7, 27, 0, 8, 110, 0, 8, 46, 0, 9, 188, 0, 8, 14, 0, 8, 142, 0, 8, 78, 0, 9, 252, 96, 7, 256, 0, 8, 81, 0, 8, 17, 85, 8, 131, 82, 7, 31, 0, 8, 113, 0, 8, 49, 0, 9, 194, 80, 7, 10, 0, 8, 97, 0, 8, 33, 0, 9, 162, 0, 8, 1, 0, 8, 129, 0, 8, 65, 0, 9, 226, 80, 7, 6, 0, 8, 89, 0, 8, 25, 0, 9, 146, 83, 7, 59, 0, 8, 121, 0, 8, 57, 0, 9, 210, 81, 7, 17, 0, 8, 105, 0, 8, 41, 0, 9, 178, 0, 8, 9, 0, 8, 137, 0, 8, 73, 0, 9, 242, 80, 7, 4, 0, 8, 85, 0, 8, 21, 80, 8, 258, 83, 7, 43, 0, 8, 117, 0, 8, 53, 0, 9, 202, 81, 7, 13, 0, 8, 101, 0, 8, 37, 0, 9, 170, 0, 8, 5, 0, 8, 133, 0, 8, 69, 0, 9, 234, 80, 7, 8, 0, 8, 93, 0, 8, 29, 0, 9, 154, 84, 7, 83, 0, 8, 125, 0, 8, 61, 0, 9, 218, 82, 7, 23, 0, 8, 109, 0, 8, 45, 0, 9, 186, 0, 8, 13, 0, 8, 141, 0, 8, 77, 0, 9, 250, 80, 7, 3, 0, 8, 83, 0, 8, 19, 85, 8, 195, 83, 7, 35, 0, 8, 115, 0, 8, 51, 0, 9, 198, 81, 7, 11, 0, 8, 99, 0, 8, 35, 0, 9, 166, 0, 8, 3, 0, 8, 131, 0, 8, 67, 0, 9, 230, 80, 7, 7, 0, 8, 91, 0, 8, 27, 0, 9, 150, 84, 7, 67, 0, 8, 123, 0, 8, 59, 0, 9, 214, 82, 7, 19, 0, 8, 107, 0, 8, 43, 0, 9, 182, 0, 8, 11, 0, 8, 139, 0, 8, 75, 0, 9, 246, 80, 7, 5, 0, 8, 87, 0, 8, 23, 192, 8, 0, 83, 7, 51, 0, 8, 119, 0, 8, 55, 0, 9, 206, 81, 7, 15, 0, 8, 103, 0, 8, 39, 0, 9, 174, 0, 8, 7, 0, 8, 135, 0, 8, 71, 0, 9, 238, 80, 7, 9, 0, 8, 95, 0, 8, 31, 0, 9, 158, 84, 7, 99, 0, 8, 127, 0, 8, 63, 0, 9, 222, 82, 7, 27, 0, 8, 111, 0, 8, 47, 0, 9, 190, 0, 8, 15, 0, 8, 143, 0, 8, 79, 0, 9, 254, 96, 7, 256, 0, 8, 80, 0, 8, 16, 84, 8, 115, 82, 7, 31, 0, 8, 112, 0, 8, 48, 0, 9, 193, 80, 7, 10, 0, 8, 96, 0, 8, 32, 0, 9, 161, 0, 8, 0, 0, 8, 128, 0, 8, 64, 0, 9, 225, 80, 7, 6, 0, 8, 88, 0, 8, 24, 0, 9, 145, 83, 7, 59, 0, 8, 120, 0, 8, 56, 0, 9, 209, 81, 7, 17, 0, 8, 104, 0, 8, 40, 0, 9, 177, 0, 8, 8, 0, 8, 136, 0, 8, 72, 0, 9, 241, 80, 7, 4, 0, 8, 84, 0, 8, 20, 85, 8, 227, 83, 7, 43, 0, 8, 116, 0, 8, 52, 0, 9, 201, 81, 7, 13, 0, 8, 100, 0, 8, 36, 0, 9, 169, 0, 8, 4, 0, 8, 132, 0, 8, 68, 0, 9, 233, 80, 7, 8, 0, 8, 92, 0, 8, 28, 0, 9, 153, 84, 7, 83, 0, 8, 124, 0, 8, 60, 0, 9, 217, 82, 7, 23, 0, 8, 108, 0, 8, 44, 0, 9, 185, 0, 8, 12, 0, 8, 140, 0, 8, 76, 0, 9, 249, 80, 7, 3, 0, 8, 82, 0, 8, 18, 85, 8, 163, 83, 7, 35, 0, 8, 114, 0, 8, 50, 0, 9, 197, 81, 7, 11, 0, 8, 98, 0, 8, 34, 0, 9, 165, 0, 8, 2, 0, 8, 130, 0, 8, 66, 0, 9, 229, 80, 7, 7, 0, 8, 90, 0, 8, 26, 0, 9, 149, 84, 7, 67, 0, 8, 122, 0, 8, 58, 0, 9, 213, 82, 7, 19, 0, 8, 106, 0, 8, 42, 0, 9, 181, 0, 8, 10, 0, 8, 138, 0, 8, 74, 0, 9, 245, 80, 7, 5, 0, 8, 86, 0, 8, 22, 192, 8, 0, 83, 7, 51, 0, 8, 118, 0, 8, 54, 0, 9, 205, 81, 7, 15, 0, 8, 102, 0, 8, 38, 0, 9, 173, 0, 8, 6, 0, 8, 134, 0, 8, 70, 0, 9, 237, 80, 7, 9, 0, 8, 94, 0, 8, 30, 0, 9, 157, 84, 7, 99, 0, 8, 126, 0, 8, 62, 0, 9, 221, 82, 7, 27, 0, 8, 110, 0, 8, 46, 0, 9, 189, 0, 8, 14, 0, 8, 142, 0, 8, 78, 0, 9, 253, 96, 7, 256, 0, 8, 81, 0, 8, 17, 85, 8, 131, 82, 7, 31, 0, 8, 113, 0, 8, 49, 0, 9, 195, 80, 7, 10, 0, 8, 97, 0, 8, 33, 0, 9, 163, 0, 8, 1, 0, 8, 129, 0, 8, 65, 0, 9, 227, 80, 7, 6, 0, 8, 89, 0, 8, 25, 0, 9, 147, 83, 7, 59, 0, 8, 121, 0, 8, 57, 0, 9, 211, 81, 7, 17, 0, 8, 105, 0, 8, 41, 0, 9, 179, 0, 8, 9, 0, 8, 137, 0, 8, 73, 0, 9, 243, 80, 7, 4, 0, 8, 85, 0, 8, 21, 80, 8, 258, 83, 7, 43, 0, 8, 117, 0, 8, 53, 0, 9, 203, 81, 7, 13, 0, 8, 101, 0, 8, 37, 0, 9, 171, 0, 8, 5, 0, 8, 133, 0, 8, 69, 0, 9, 235, 80, 7, 8, 0, 8, 93, 0, 8, 29, 0, 9, 155, 84, 7, 83, 0, 8, 125, 0, 8, 61, 0, 9, 219, 82, 7, 23, 0, 8, 109, 0, 8, 45, 0, 9, 187, 0, 8, 13, 0, 8, 141, 0, 8, 77, 0, 9, 251, 80, 7, 3, 0, 8, 83, 0, 8, 19, 85, 8, 195, 83, 7, 35, 0, 8, 115, 0, 8, 51, 0, 9, 199, 81, 7, 11, 0, 8, 99, 0, 8, 35, 0, 9, 167, 0, 8, 3, 0, 8, 131, 0, 8, 67, 0, 9, 231, 80, 7, 7, 0, 8, 91, 0, 8, 27, 0, 9, 151, 84, 7, 67, 0, 8, 123, 0, 8, 59, 0, 9, 215, 82, 7, 19, 0, 8, 107, 0, 8, 43, 0, 9, 183, 0, 8, 11, 0, 8, 139, 0, 8, 75, 0, 9, 247, 80, 7, 5, 0, 8, 87, 0, 8, 23, 192, 8, 0, 83, 7, 51, 0, 8, 119, 0, 8, 55, 0, 9, 207, 81, 7, 15, 0, 8, 103, 0, 8, 39, 0, 9, 175, 0, 8, 7, 0, 8, 135, 0, 8, 71, 0, 9, 239, 80, 7, 9, 0, 8, 95, 0, 8, 31, 0, 9, 159, 84, 7, 99, 0, 8, 127, 0, 8, 63, 0, 9, 223, 82, 7, 27, 0, 8, 111, 0, 8, 47, 0, 9, 191, 0, 8, 15, 0, 8, 143, 0, 8, 79, 0, 9, 255], a$1 = [80, 5, 1, 87, 5, 257, 83, 5, 17, 91, 5, 4097, 81, 5, 5, 89, 5, 1025, 85, 5, 65, 93, 5, 16385, 80, 5, 3, 88, 5, 513, 84, 5, 33, 92, 5, 8193, 82, 5, 9, 90, 5, 2049, 86, 5, 129, 192, 5, 24577, 80, 5, 2, 87, 5, 385, 83, 5, 25, 91, 5, 6145, 81, 5, 7, 89, 5, 1537, 85, 5, 97, 93, 5, 24577, 80, 5, 4, 88, 5, 769, 84, 5, 49, 92, 5, 12289, 82, 5, 13, 90, 5, 3073, 86, 5, 193, 192, 5, 24577], s$1 = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0], o$1 = [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, 112, 112], l$1 = [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], c$1 = [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], u$1 = 15;
-function d$1() {
-  let e2, i2, r2, a2, d, f2;
-  function h2(e3, i3, s2, o2, l2, c, h3, w2, _2, b2, p2) {
-    let m2, g2, y2, x2, k2, v2, S2, z2, A2, U3, D2, E2, T2, F2, O2;
-    U3 = 0, k2 = s2;
-    do {
-      r2[e3[i3 + U3]]++, U3++, k2--;
-    } while (0 !== k2);
-    if (r2[0] == s2) return h3[0] = -1, w2[0] = 0, 0;
-    for (z2 = w2[0], v2 = 1; v2 <= u$1 && 0 === r2[v2]; v2++) ;
-    for (S2 = v2, z2 < v2 && (z2 = v2), k2 = u$1; 0 !== k2 && 0 === r2[k2]; k2--) ;
-    for (y2 = k2, z2 > k2 && (z2 = k2), w2[0] = z2, F2 = 1 << v2; v2 < k2; v2++, F2 <<= 1) if ((F2 -= r2[v2]) < 0) return t$1;
-    if ((F2 -= r2[k2]) < 0) return t$1;
-    for (r2[k2] += F2, f2[1] = v2 = 0, U3 = 1, T2 = 2; 0 != --k2; ) f2[T2] = v2 += r2[U3], T2++, U3++;
-    k2 = 0, U3 = 0;
-    do {
-      0 !== (v2 = e3[i3 + U3]) && (p2[f2[v2]++] = k2), U3++;
-    } while (++k2 < s2);
-    for (s2 = f2[y2], f2[0] = k2 = 0, U3 = 0, x2 = -1, E2 = -z2, d[0] = 0, D2 = 0, O2 = 0; S2 <= y2; S2++) for (m2 = r2[S2]; 0 != m2--; ) {
-      for (; S2 > E2 + z2; ) {
-        if (x2++, E2 += z2, O2 = y2 - E2, O2 = O2 > z2 ? z2 : O2, (g2 = 1 << (v2 = S2 - E2)) > m2 + 1 && (g2 -= m2 + 1, T2 = S2, v2 < O2)) for (; ++v2 < O2 && !((g2 <<= 1) <= r2[++T2]); ) g2 -= r2[T2];
-        if (O2 = 1 << v2, b2[0] + O2 > 1440) return t$1;
-        d[x2] = D2 = b2[0], b2[0] += O2, 0 !== x2 ? (f2[x2] = k2, a2[0] = v2, a2[1] = z2, v2 = k2 >>> E2 - z2, a2[2] = D2 - d[x2 - 1] - v2, _2.set(a2, 3 * (d[x2 - 1] + v2))) : h3[0] = D2;
-      }
-      for (a2[1] = S2 - E2, U3 >= s2 ? a2[0] = 192 : p2[U3] < o2 ? (a2[0] = p2[U3] < 256 ? 0 : 96, a2[2] = p2[U3++]) : (a2[0] = c[p2[U3] - o2] + 16 + 64, a2[2] = l2[p2[U3++] - o2]), g2 = 1 << S2 - E2, v2 = k2 >>> E2; v2 < O2; v2 += g2) _2.set(a2, 3 * (D2 + v2));
-      for (v2 = 1 << S2 - 1; k2 & v2; v2 >>>= 1) k2 ^= v2;
-      for (k2 ^= v2, A2 = (1 << E2) - 1; (k2 & A2) != f2[x2]; ) x2--, E2 -= z2, A2 = (1 << E2) - 1;
-    }
-    return 0 !== F2 && 1 != y2 ? n$1 : 0;
-  }
-  function w(t2) {
-    let n2;
-    for (e2 || (e2 = [], i2 = [], r2 = new Int32Array(16), a2 = [], d = new Int32Array(u$1), f2 = new Int32Array(16)), i2.length < t2 && (i2 = []), n2 = 0; n2 < t2; n2++) i2[n2] = 0;
-    for (n2 = 0; n2 < 16; n2++) r2[n2] = 0;
-    for (n2 = 0; n2 < 3; n2++) a2[n2] = 0;
-    d.set(r2.subarray(0, u$1), 0), f2.set(r2.subarray(0, 16), 0);
-  }
-  this.inflate_trees_bits = function(r3, a3, s2, o2, l2) {
-    let c;
-    return w(19), e2[0] = 0, c = h2(r3, 0, 19, 19, null, null, s2, a3, o2, e2, i2), c == t$1 ? l2.msg = "oversubscribed dynamic bit lengths tree" : c != n$1 && 0 !== a3[0] || (l2.msg = "incomplete dynamic bit lengths tree", c = t$1), c;
-  }, this.inflate_trees_dynamic = function(r3, a3, u, d2, f3, _2, b2, p2, m2) {
-    let g2;
-    return w(288), e2[0] = 0, g2 = h2(u, 0, r3, 257, s$1, o$1, _2, d2, p2, e2, i2), 0 != g2 || 0 === d2[0] ? (g2 == t$1 ? m2.msg = "oversubscribed literal/length tree" : -4 != g2 && (m2.msg = "incomplete literal/length tree", g2 = t$1), g2) : (w(288), g2 = h2(u, r3, a3, 0, l$1, c$1, b2, f3, p2, e2, i2), 0 != g2 || 0 === f3[0] && r3 > 257 ? (g2 == t$1 ? m2.msg = "oversubscribed distance tree" : g2 == n$1 ? (m2.msg = "incomplete distance tree", g2 = t$1) : -4 != g2 && (m2.msg = "empty distance tree with lengths", g2 = t$1), g2) : 0);
-  };
-}
-d$1.inflate_trees_fixed = function(e2, t2, n2, i2) {
-  return e2[0] = 9, t2[0] = 5, n2[0] = r$1, i2[0] = a$1, 0;
-};
-function f$1() {
-  const n2 = this;
-  let r2, a2, s2, o2, l2 = 0, c = 0, u = 0, d = 0, f2 = 0, h2 = 0, w = 0, _2 = 0, b2 = 0, p2 = 0;
-  function m2(e2, n3, r3, a3, s3, o3, l3, c2) {
-    let u2, d2, f3, h3, w2, _3, b3, p3, m3, g2, y2, x2, k2, v2, S2, z2;
-    b3 = c2.next_in_index, p3 = c2.avail_in, w2 = l3.bitb, _3 = l3.bitk, m3 = l3.write, g2 = m3 < l3.read ? l3.read - m3 - 1 : l3.end - m3, y2 = i$1[e2], x2 = i$1[n3];
-    do {
-      for (; _3 < 20; ) p3--, w2 |= (255 & c2.read_byte(b3++)) << _3, _3 += 8;
-      if (u2 = w2 & y2, d2 = r3, f3 = a3, z2 = 3 * (f3 + u2), 0 !== (h3 = d2[z2])) for (; ; ) {
-        if (w2 >>= d2[z2 + 1], _3 -= d2[z2 + 1], 16 & h3) {
-          for (h3 &= 15, k2 = d2[z2 + 2] + (w2 & i$1[h3]), w2 >>= h3, _3 -= h3; _3 < 15; ) p3--, w2 |= (255 & c2.read_byte(b3++)) << _3, _3 += 8;
-          for (u2 = w2 & x2, d2 = s3, f3 = o3, z2 = 3 * (f3 + u2), h3 = d2[z2]; ; ) {
-            if (w2 >>= d2[z2 + 1], _3 -= d2[z2 + 1], 16 & h3) {
-              for (h3 &= 15; _3 < h3; ) p3--, w2 |= (255 & c2.read_byte(b3++)) << _3, _3 += 8;
-              if (v2 = d2[z2 + 2] + (w2 & i$1[h3]), w2 >>= h3, _3 -= h3, g2 -= k2, m3 >= v2) S2 = m3 - v2, m3 - S2 > 0 && 2 > m3 - S2 ? (l3.win[m3++] = l3.win[S2++], l3.win[m3++] = l3.win[S2++], k2 -= 2) : (l3.win.set(l3.win.subarray(S2, S2 + 2), m3), m3 += 2, S2 += 2, k2 -= 2);
-              else {
-                S2 = m3 - v2;
-                do {
-                  S2 += l3.end;
-                } while (S2 < 0);
-                if (h3 = l3.end - S2, k2 > h3) {
-                  if (k2 -= h3, m3 - S2 > 0 && h3 > m3 - S2) do {
-                    l3.win[m3++] = l3.win[S2++];
-                  } while (0 != --h3);
-                  else l3.win.set(l3.win.subarray(S2, S2 + h3), m3), m3 += h3, S2 += h3, h3 = 0;
-                  S2 = 0;
-                }
-              }
-              if (m3 - S2 > 0 && k2 > m3 - S2) do {
-                l3.win[m3++] = l3.win[S2++];
-              } while (0 != --k2);
-              else l3.win.set(l3.win.subarray(S2, S2 + k2), m3), m3 += k2, S2 += k2, k2 = 0;
-              break;
-            }
-            if (64 & h3) return c2.msg = "invalid distance code", k2 = c2.avail_in - p3, k2 = _3 >> 3 < k2 ? _3 >> 3 : k2, p3 += k2, b3 -= k2, _3 -= k2 << 3, l3.bitb = w2, l3.bitk = _3, c2.avail_in = p3, c2.total_in += b3 - c2.next_in_index, c2.next_in_index = b3, l3.write = m3, t$1;
-            u2 += d2[z2 + 2], u2 += w2 & i$1[h3], z2 = 3 * (f3 + u2), h3 = d2[z2];
-          }
-          break;
-        }
-        if (64 & h3) return 32 & h3 ? (k2 = c2.avail_in - p3, k2 = _3 >> 3 < k2 ? _3 >> 3 : k2, p3 += k2, b3 -= k2, _3 -= k2 << 3, l3.bitb = w2, l3.bitk = _3, c2.avail_in = p3, c2.total_in += b3 - c2.next_in_index, c2.next_in_index = b3, l3.write = m3, 1) : (c2.msg = "invalid literal/length code", k2 = c2.avail_in - p3, k2 = _3 >> 3 < k2 ? _3 >> 3 : k2, p3 += k2, b3 -= k2, _3 -= k2 << 3, l3.bitb = w2, l3.bitk = _3, c2.avail_in = p3, c2.total_in += b3 - c2.next_in_index, c2.next_in_index = b3, l3.write = m3, t$1);
-        if (u2 += d2[z2 + 2], u2 += w2 & i$1[h3], z2 = 3 * (f3 + u2), 0 === (h3 = d2[z2])) {
-          w2 >>= d2[z2 + 1], _3 -= d2[z2 + 1], l3.win[m3++] = d2[z2 + 2], g2--;
-          break;
-        }
-      }
-      else w2 >>= d2[z2 + 1], _3 -= d2[z2 + 1], l3.win[m3++] = d2[z2 + 2], g2--;
-    } while (g2 >= 258 && p3 >= 10);
-    return k2 = c2.avail_in - p3, k2 = _3 >> 3 < k2 ? _3 >> 3 : k2, p3 += k2, b3 -= k2, _3 -= k2 << 3, l3.bitb = w2, l3.bitk = _3, c2.avail_in = p3, c2.total_in += b3 - c2.next_in_index, c2.next_in_index = b3, l3.write = m3, 0;
-  }
-  n2.init = function(e2, t2, n3, i2, l3, c2) {
-    r2 = 0, w = e2, _2 = t2, s2 = n3, b2 = i2, o2 = l3, p2 = c2, a2 = null;
-  }, n2.proc = function(n3, g2, y2) {
-    let x2, k2, v2, S2, z2, A2, U3, D2 = 0, E2 = 0, T2 = 0;
-    for (T2 = g2.next_in_index, S2 = g2.avail_in, D2 = n3.bitb, E2 = n3.bitk, z2 = n3.write, A2 = z2 < n3.read ? n3.read - z2 - 1 : n3.end - z2; ; ) switch (r2) {
-      case 0:
-        if (A2 >= 258 && S2 >= 10 && (n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, y2 = m2(w, _2, s2, b2, o2, p2, n3, g2), T2 = g2.next_in_index, S2 = g2.avail_in, D2 = n3.bitb, E2 = n3.bitk, z2 = n3.write, A2 = z2 < n3.read ? n3.read - z2 - 1 : n3.end - z2, 0 != y2)) {
-          r2 = 1 == y2 ? 7 : 9;
-          break;
-        }
-        u = w, a2 = s2, c = b2, r2 = 1;
-      case 1:
-        for (x2 = u; E2 < x2; ) {
-          if (0 === S2) return n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-          y2 = 0, S2--, D2 |= (255 & g2.read_byte(T2++)) << E2, E2 += 8;
-        }
-        if (k2 = 3 * (c + (D2 & i$1[x2])), D2 >>>= a2[k2 + 1], E2 -= a2[k2 + 1], v2 = a2[k2], 0 === v2) {
-          d = a2[k2 + 2], r2 = 6;
-          break;
-        }
-        if (16 & v2) {
-          f2 = 15 & v2, l2 = a2[k2 + 2], r2 = 2;
-          break;
-        }
-        if (!(64 & v2)) {
-          u = v2, c = k2 / 3 + a2[k2 + 2];
-          break;
-        }
-        if (32 & v2) {
-          r2 = 7;
-          break;
-        }
-        return r2 = 9, g2.msg = "invalid literal/length code", y2 = t$1, n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-      case 2:
-        for (x2 = f2; E2 < x2; ) {
-          if (0 === S2) return n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-          y2 = 0, S2--, D2 |= (255 & g2.read_byte(T2++)) << E2, E2 += 8;
-        }
-        l2 += D2 & i$1[x2], D2 >>= x2, E2 -= x2, u = _2, a2 = o2, c = p2, r2 = 3;
-      case 3:
-        for (x2 = u; E2 < x2; ) {
-          if (0 === S2) return n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-          y2 = 0, S2--, D2 |= (255 & g2.read_byte(T2++)) << E2, E2 += 8;
-        }
-        if (k2 = 3 * (c + (D2 & i$1[x2])), D2 >>= a2[k2 + 1], E2 -= a2[k2 + 1], v2 = a2[k2], 16 & v2) {
-          f2 = 15 & v2, h2 = a2[k2 + 2], r2 = 4;
-          break;
-        }
-        if (!(64 & v2)) {
-          u = v2, c = k2 / 3 + a2[k2 + 2];
-          break;
-        }
-        return r2 = 9, g2.msg = "invalid distance code", y2 = t$1, n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-      case 4:
-        for (x2 = f2; E2 < x2; ) {
-          if (0 === S2) return n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-          y2 = 0, S2--, D2 |= (255 & g2.read_byte(T2++)) << E2, E2 += 8;
-        }
-        h2 += D2 & i$1[x2], D2 >>= x2, E2 -= x2, r2 = 5;
-      case 5:
-        for (U3 = z2 - h2; U3 < 0; ) U3 += n3.end;
-        for (; 0 !== l2; ) {
-          if (0 === A2 && (z2 == n3.end && 0 !== n3.read && (z2 = 0, A2 = z2 < n3.read ? n3.read - z2 - 1 : n3.end - z2), 0 === A2 && (n3.write = z2, y2 = n3.inflate_flush(g2, y2), z2 = n3.write, A2 = z2 < n3.read ? n3.read - z2 - 1 : n3.end - z2, z2 == n3.end && 0 !== n3.read && (z2 = 0, A2 = z2 < n3.read ? n3.read - z2 - 1 : n3.end - z2), 0 === A2))) return n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-          n3.win[z2++] = n3.win[U3++], A2--, U3 == n3.end && (U3 = 0), l2--;
-        }
-        r2 = 0;
-        break;
-      case 6:
-        if (0 === A2 && (z2 == n3.end && 0 !== n3.read && (z2 = 0, A2 = z2 < n3.read ? n3.read - z2 - 1 : n3.end - z2), 0 === A2 && (n3.write = z2, y2 = n3.inflate_flush(g2, y2), z2 = n3.write, A2 = z2 < n3.read ? n3.read - z2 - 1 : n3.end - z2, z2 == n3.end && 0 !== n3.read && (z2 = 0, A2 = z2 < n3.read ? n3.read - z2 - 1 : n3.end - z2), 0 === A2))) return n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-        y2 = 0, n3.win[z2++] = d, A2--, r2 = 0;
-        break;
-      case 7:
-        if (E2 > 7 && (E2 -= 8, S2++, T2--), n3.write = z2, y2 = n3.inflate_flush(g2, y2), z2 = n3.write, A2 = z2 < n3.read ? n3.read - z2 - 1 : n3.end - z2, n3.read != n3.write) return n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-        r2 = 8;
-      case 8:
-        return y2 = 1, n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-      case 9:
-        return y2 = t$1, n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-      default:
-        return y2 = e$1, n3.bitb = D2, n3.bitk = E2, g2.avail_in = S2, g2.total_in += T2 - g2.next_in_index, g2.next_in_index = T2, n3.write = z2, n3.inflate_flush(g2, y2);
-    }
-  }, n2.free = function() {
-  };
-}
-const h$1 = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
-function w$1(r2, a2) {
-  const s2 = this;
-  let o2, l2 = 0, c = 0, u = 0, w = 0;
-  const _2 = [0], b2 = [0], p2 = new f$1();
-  let m2 = 0, g2 = new Int32Array(4320);
-  const y2 = new d$1();
-  s2.bitk = 0, s2.bitb = 0, s2.win = new Uint8Array(a2), s2.end = a2, s2.read = 0, s2.write = 0, s2.reset = function(e2, t2) {
-    t2 && (t2[0] = 0), 6 == l2 && p2.free(e2), l2 = 0, s2.bitk = 0, s2.bitb = 0, s2.read = s2.write = 0;
-  }, s2.reset(r2, null), s2.inflate_flush = function(e2, t2) {
-    let i2, r3, a3;
-    return r3 = e2.next_out_index, a3 = s2.read, i2 = (a3 <= s2.write ? s2.write : s2.end) - a3, i2 > e2.avail_out && (i2 = e2.avail_out), 0 !== i2 && t2 == n$1 && (t2 = 0), e2.avail_out -= i2, e2.total_out += i2, e2.next_out.set(s2.win.subarray(a3, a3 + i2), r3), r3 += i2, a3 += i2, a3 == s2.end && (a3 = 0, s2.write == s2.end && (s2.write = 0), i2 = s2.write - a3, i2 > e2.avail_out && (i2 = e2.avail_out), 0 !== i2 && t2 == n$1 && (t2 = 0), e2.avail_out -= i2, e2.total_out += i2, e2.next_out.set(s2.win.subarray(a3, a3 + i2), r3), r3 += i2, a3 += i2), e2.next_out_index = r3, s2.read = a3, t2;
-  }, s2.proc = function(n2, r3) {
-    let a3, f2, x2, k2, v2, S2, z2, A2;
-    for (k2 = n2.next_in_index, v2 = n2.avail_in, f2 = s2.bitb, x2 = s2.bitk, S2 = s2.write, z2 = S2 < s2.read ? s2.read - S2 - 1 : s2.end - S2; ; ) {
-      let U3, D2, E2, T2, F2, O2, C2, W2;
-      switch (l2) {
-        case 0:
-          for (; x2 < 3; ) {
-            if (0 === v2) return s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-            r3 = 0, v2--, f2 |= (255 & n2.read_byte(k2++)) << x2, x2 += 8;
-          }
-          switch (a3 = 7 & f2, m2 = 1 & a3, a3 >>> 1) {
-            case 0:
-              f2 >>>= 3, x2 -= 3, a3 = 7 & x2, f2 >>>= a3, x2 -= a3, l2 = 1;
-              break;
-            case 1:
-              U3 = [], D2 = [], E2 = [[]], T2 = [[]], d$1.inflate_trees_fixed(U3, D2, E2, T2), p2.init(U3[0], D2[0], E2[0], 0, T2[0], 0), f2 >>>= 3, x2 -= 3, l2 = 6;
-              break;
-            case 2:
-              f2 >>>= 3, x2 -= 3, l2 = 3;
-              break;
-            case 3:
-              return f2 >>>= 3, x2 -= 3, l2 = 9, n2.msg = "invalid block type", r3 = t$1, s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-          }
-          break;
-        case 1:
-          for (; x2 < 32; ) {
-            if (0 === v2) return s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-            r3 = 0, v2--, f2 |= (255 & n2.read_byte(k2++)) << x2, x2 += 8;
-          }
-          if ((~f2 >>> 16 & 65535) != (65535 & f2)) return l2 = 9, n2.msg = "invalid stored block lengths", r3 = t$1, s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-          c = 65535 & f2, f2 = x2 = 0, l2 = 0 !== c ? 2 : 0 !== m2 ? 7 : 0;
-          break;
-        case 2:
-          if (0 === v2) return s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-          if (0 === z2 && (S2 == s2.end && 0 !== s2.read && (S2 = 0, z2 = S2 < s2.read ? s2.read - S2 - 1 : s2.end - S2), 0 === z2 && (s2.write = S2, r3 = s2.inflate_flush(n2, r3), S2 = s2.write, z2 = S2 < s2.read ? s2.read - S2 - 1 : s2.end - S2, S2 == s2.end && 0 !== s2.read && (S2 = 0, z2 = S2 < s2.read ? s2.read - S2 - 1 : s2.end - S2), 0 === z2))) return s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-          if (r3 = 0, a3 = c, a3 > v2 && (a3 = v2), a3 > z2 && (a3 = z2), s2.win.set(n2.read_buf(k2, a3), S2), k2 += a3, v2 -= a3, S2 += a3, z2 -= a3, 0 != (c -= a3)) break;
-          l2 = 0 !== m2 ? 7 : 0;
-          break;
-        case 3:
-          for (; x2 < 14; ) {
-            if (0 === v2) return s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-            r3 = 0, v2--, f2 |= (255 & n2.read_byte(k2++)) << x2, x2 += 8;
-          }
-          if (u = a3 = 16383 & f2, (31 & a3) > 29 || (a3 >> 5 & 31) > 29) return l2 = 9, n2.msg = "too many length or distance symbols", r3 = t$1, s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-          if (a3 = 258 + (31 & a3) + (a3 >> 5 & 31), !o2 || o2.length < a3) o2 = [];
-          else for (A2 = 0; A2 < a3; A2++) o2[A2] = 0;
-          f2 >>>= 14, x2 -= 14, w = 0, l2 = 4;
-        case 4:
-          for (; w < 4 + (u >>> 10); ) {
-            for (; x2 < 3; ) {
-              if (0 === v2) return s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-              r3 = 0, v2--, f2 |= (255 & n2.read_byte(k2++)) << x2, x2 += 8;
-            }
-            o2[h$1[w++]] = 7 & f2, f2 >>>= 3, x2 -= 3;
-          }
-          for (; w < 19; ) o2[h$1[w++]] = 0;
-          if (_2[0] = 7, a3 = y2.inflate_trees_bits(o2, _2, b2, g2, n2), 0 != a3) return (r3 = a3) == t$1 && (o2 = null, l2 = 9), s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-          w = 0, l2 = 5;
-        case 5:
-          for (; a3 = u, !(w >= 258 + (31 & a3) + (a3 >> 5 & 31)); ) {
-            let e2, c2;
-            for (a3 = _2[0]; x2 < a3; ) {
-              if (0 === v2) return s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-              r3 = 0, v2--, f2 |= (255 & n2.read_byte(k2++)) << x2, x2 += 8;
-            }
-            if (a3 = g2[3 * (b2[0] + (f2 & i$1[a3])) + 1], c2 = g2[3 * (b2[0] + (f2 & i$1[a3])) + 2], c2 < 16) f2 >>>= a3, x2 -= a3, o2[w++] = c2;
-            else {
-              for (A2 = 18 == c2 ? 7 : c2 - 14, e2 = 18 == c2 ? 11 : 3; x2 < a3 + A2; ) {
-                if (0 === v2) return s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-                r3 = 0, v2--, f2 |= (255 & n2.read_byte(k2++)) << x2, x2 += 8;
-              }
-              if (f2 >>>= a3, x2 -= a3, e2 += f2 & i$1[A2], f2 >>>= A2, x2 -= A2, A2 = w, a3 = u, A2 + e2 > 258 + (31 & a3) + (a3 >> 5 & 31) || 16 == c2 && A2 < 1) return o2 = null, l2 = 9, n2.msg = "invalid bit length repeat", r3 = t$1, s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-              c2 = 16 == c2 ? o2[A2 - 1] : 0;
-              do {
-                o2[A2++] = c2;
-              } while (0 != --e2);
-              w = A2;
-            }
-          }
-          if (b2[0] = -1, F2 = [], O2 = [], C2 = [], W2 = [], F2[0] = 9, O2[0] = 6, a3 = u, a3 = y2.inflate_trees_dynamic(257 + (31 & a3), 1 + (a3 >> 5 & 31), o2, F2, O2, C2, W2, g2, n2), 0 != a3) return a3 == t$1 && (o2 = null, l2 = 9), r3 = a3, s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-          p2.init(F2[0], O2[0], g2, C2[0], g2, W2[0]), l2 = 6;
-        case 6:
-          if (s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, 1 != (r3 = p2.proc(s2, n2, r3))) return s2.inflate_flush(n2, r3);
-          if (r3 = 0, p2.free(n2), k2 = n2.next_in_index, v2 = n2.avail_in, f2 = s2.bitb, x2 = s2.bitk, S2 = s2.write, z2 = S2 < s2.read ? s2.read - S2 - 1 : s2.end - S2, 0 === m2) {
-            l2 = 0;
-            break;
-          }
-          l2 = 7;
-        case 7:
-          if (s2.write = S2, r3 = s2.inflate_flush(n2, r3), S2 = s2.write, z2 = S2 < s2.read ? s2.read - S2 - 1 : s2.end - S2, s2.read != s2.write) return s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-          l2 = 8;
-        case 8:
-          return r3 = 1, s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-        case 9:
-          return r3 = t$1, s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-        default:
-          return r3 = e$1, s2.bitb = f2, s2.bitk = x2, n2.avail_in = v2, n2.total_in += k2 - n2.next_in_index, n2.next_in_index = k2, s2.write = S2, s2.inflate_flush(n2, r3);
-      }
-    }
-  }, s2.free = function(e2) {
-    s2.reset(e2, null), s2.win = null, g2 = null;
-  }, s2.set_dictionary = function(e2, t2, n2) {
-    s2.win.set(e2.subarray(t2, t2 + n2), 0), s2.read = s2.write = n2;
-  }, s2.sync_point = function() {
-    return 1 == l2 ? 1 : 0;
-  };
-}
-const _ = 13, b$1 = [0, 0, 255, 255];
-function p$1() {
-  const i2 = this;
-  function r2(t2) {
-    return t2 && t2.istate ? (t2.total_in = t2.total_out = 0, t2.msg = null, t2.istate.mode = 7, t2.istate.blocks.reset(t2, null), 0) : e$1;
-  }
-  i2.mode = 0, i2.method = 0, i2.was = [0], i2.need = 0, i2.marker = 0, i2.wbits = 0, i2.inflateEnd = function(e2) {
-    return i2.blocks && i2.blocks.free(e2), i2.blocks = null, 0;
-  }, i2.inflateInit = function(t2, n2) {
-    return t2.msg = null, i2.blocks = null, n2 < 8 || n2 > 15 ? (i2.inflateEnd(t2), e$1) : (i2.wbits = n2, t2.istate.blocks = new w$1(t2, 1 << n2), r2(t2), 0);
-  }, i2.inflate = function(i3, r3) {
-    let a2, s2;
-    if (!i3 || !i3.istate || !i3.next_in) return e$1;
-    const o2 = i3.istate;
-    for (r3 = 4 == r3 ? n$1 : 0, a2 = n$1; ; ) switch (o2.mode) {
-      case 0:
-        if (0 === i3.avail_in) return a2;
-        if (a2 = r3, i3.avail_in--, i3.total_in++, 8 != (15 & (o2.method = i3.read_byte(i3.next_in_index++)))) {
-          o2.mode = _, i3.msg = "unknown compression method", o2.marker = 5;
-          break;
-        }
-        if (8 + (o2.method >> 4) > o2.wbits) {
-          o2.mode = _, i3.msg = "invalid win size", o2.marker = 5;
-          break;
-        }
-        o2.mode = 1;
-      case 1:
-        if (0 === i3.avail_in) return a2;
-        if (a2 = r3, i3.avail_in--, i3.total_in++, s2 = 255 & i3.read_byte(i3.next_in_index++), ((o2.method << 8) + s2) % 31 != 0) {
-          o2.mode = _, i3.msg = "incorrect header check", o2.marker = 5;
-          break;
-        }
-        if (!(32 & s2)) {
-          o2.mode = 7;
-          break;
-        }
-        o2.mode = 2;
-      case 2:
-        if (0 === i3.avail_in) return a2;
-        a2 = r3, i3.avail_in--, i3.total_in++, o2.need = (255 & i3.read_byte(i3.next_in_index++)) << 24 & 4278190080, o2.mode = 3;
-      case 3:
-        if (0 === i3.avail_in) return a2;
-        a2 = r3, i3.avail_in--, i3.total_in++, o2.need += (255 & i3.read_byte(i3.next_in_index++)) << 16 & 16711680, o2.mode = 4;
-      case 4:
-        if (0 === i3.avail_in) return a2;
-        a2 = r3, i3.avail_in--, i3.total_in++, o2.need += (255 & i3.read_byte(i3.next_in_index++)) << 8 & 65280, o2.mode = 5;
-      case 5:
-        return 0 === i3.avail_in ? a2 : (a2 = r3, i3.avail_in--, i3.total_in++, o2.need += 255 & i3.read_byte(i3.next_in_index++), o2.mode = 6, 2);
-      case 6:
-        return o2.mode = _, i3.msg = "need dictionary", o2.marker = 0, e$1;
-      case 7:
-        if (a2 = o2.blocks.proc(i3, a2), a2 == t$1) {
-          o2.mode = _, o2.marker = 0;
-          break;
-        }
-        if (0 == a2 && (a2 = r3), 1 != a2) return a2;
-        a2 = r3, o2.blocks.reset(i3, o2.was), o2.mode = 12;
-      case 12:
-        return i3.avail_in = 0, 1;
-      case _:
-        return t$1;
-      default:
-        return e$1;
-    }
-  }, i2.inflateSetDictionary = function(t2, n2, i3) {
-    let r3 = 0, a2 = i3;
-    if (!t2 || !t2.istate || 6 != t2.istate.mode) return e$1;
-    const s2 = t2.istate;
-    return a2 >= 1 << s2.wbits && (a2 = (1 << s2.wbits) - 1, r3 = i3 - a2), s2.blocks.set_dictionary(n2, r3, a2), s2.mode = 7, 0;
-  }, i2.inflateSync = function(i3) {
-    let a2, s2, o2, l2, c;
-    if (!i3 || !i3.istate) return e$1;
-    const u = i3.istate;
-    if (u.mode != _ && (u.mode = _, u.marker = 0), 0 === (a2 = i3.avail_in)) return n$1;
-    for (s2 = i3.next_in_index, o2 = u.marker; 0 !== a2 && o2 < 4; ) i3.read_byte(s2) == b$1[o2] ? o2++ : o2 = 0 !== i3.read_byte(s2) ? 0 : 4 - o2, s2++, a2--;
-    return i3.total_in += s2 - i3.next_in_index, i3.next_in_index = s2, i3.avail_in = a2, u.marker = o2, 4 != o2 ? t$1 : (l2 = i3.total_in, c = i3.total_out, r2(i3), i3.total_in = l2, i3.total_out = c, u.mode = 7, 0);
-  }, i2.inflateSyncPoint = function(t2) {
-    return t2 && t2.istate && t2.istate.blocks ? t2.istate.blocks.sync_point() : e$1;
-  };
-}
-function m$1() {
-}
-m$1.prototype = { inflateInit(e2) {
-  const t2 = this;
-  return t2.istate = new p$1(), e2 || (e2 = 15), t2.istate.inflateInit(t2, e2);
-}, inflate(t2) {
-  const n2 = this;
-  return n2.istate ? n2.istate.inflate(n2, t2) : e$1;
-}, inflateEnd() {
-  const t2 = this;
-  if (!t2.istate) return e$1;
-  const n2 = t2.istate.inflateEnd(t2);
-  return t2.istate = null, n2;
-}, inflateSync() {
-  const t2 = this;
-  return t2.istate ? t2.istate.inflateSync(t2) : e$1;
-}, inflateSetDictionary(t2, n2) {
-  const i2 = this;
-  return i2.istate ? i2.istate.inflateSetDictionary(i2, t2, n2) : e$1;
-}, read_byte(e2) {
-  return this.next_in[e2];
-}, read_buf(e2, t2) {
-  return this.next_in.subarray(e2, e2 + t2);
-} };
-const g$1 = 4294967295, y$1 = 65535, x$1 = 33639248, k$1 = 101075792, v$1 = 22, S = void 0, z$1 = "undefined", A$1 = "function";
-let U$1 = class U {
-  constructor(e2) {
-    return class extends TransformStream {
-      constructor(t2, n2) {
-        const i2 = new e2(n2);
-        super({ transform(e3, t3) {
-          t3.enqueue(i2.append(e3));
-        }, flush(e3) {
-          const t3 = i2.flush();
-          t3 && e3.enqueue(t3);
-        } });
-      }
-    };
-  }
-};
-let D = 2;
+const e$1 = 4294967295, t$1 = 65535, r$1 = 134695760, n$1 = r$1, s$1 = 33639248, a$1 = 101075792, i$1 = 22, o$1 = 16384, c$1 = void 0, l$1 = 1 / 0, u$1 = "undefined", d$1 = "function";
+let f$1 = 2;
 try {
-  typeof navigator != z$1 && navigator.hardwareConcurrency && (D = navigator.hardwareConcurrency);
-} catch (e2) {
+  typeof navigator != u$1 && navigator.hardwareConcurrency && (f$1 = navigator.hardwareConcurrency);
+} catch {
 }
-const E$1 = { chunkSize: 524288, maxWorkers: D, terminateWorkerTimeout: 5e3, useWebWorkers: true, useCompressionStream: true, workerScripts: S, CompressionStreamNative: typeof CompressionStream != z$1 && CompressionStream, DecompressionStreamNative: typeof DecompressionStream != z$1 && DecompressionStream }, T$1 = Object.assign({}, E$1);
-function F(e2) {
-  const { baseURL: t2, chunkSize: n2, maxWorkers: i2, terminateWorkerTimeout: r2, useCompressionStream: a2, useWebWorkers: s2, Deflate: o2, Inflate: l2, CompressionStream: c, DecompressionStream: u, workerScripts: d } = e2;
-  if (O("baseURL", t2), O("chunkSize", n2), O("maxWorkers", i2), O("terminateWorkerTimeout", r2), O("useCompressionStream", a2), O("useWebWorkers", s2), o2 && (T$1.CompressionStream = new U$1(o2)), l2 && (T$1.DecompressionStream = new U$1(l2)), O("CompressionStream", c), O("DecompressionStream", u), d !== S) {
-    const { deflate: e3, inflate: t3 } = d;
-    if ((e3 || t3) && (T$1.workerScripts || (T$1.workerScripts = {})), e3) {
-      if (!Array.isArray(e3)) throw new Error("workerScripts.deflate must be an array");
-      T$1.workerScripts.deflate = e3;
-    }
-    if (t3) {
-      if (!Array.isArray(t3)) throw new Error("workerScripts.inflate must be an array");
-      T$1.workerScripts.inflate = t3;
-    }
-  }
+const h$1 = { workerURI: "./core/web-worker-wasm.js", wasmURI: "./core/streams/zlib-wasm/zlib-streams.wasm", chunkSize: 65536, maxWorkers: f$1, terminateWorkerTimeout: 5e3, useWebWorkers: true, useCompressionStream: true, CompressionStream: typeof CompressionStream != u$1 && CompressionStream, DecompressionStream: typeof DecompressionStream != u$1 && DecompressionStream }, p$1 = Object.assign({}, h$1);
+function w$1(e2) {
+  const { baseURI: t2, chunkSize: r2, maxWorkers: n2, terminateWorkerTimeout: s2, useCompressionStream: a2, useWebWorkers: i2, CompressionStream: o2, DecompressionStream: c, CompressionStreamZlib: l2, DecompressionStreamZlib: u, workerURI: d, wasmURI: f2 } = e2;
+  g$1("baseURI", t2), g$1("wasmURI", f2), g$1("workerURI", d), g$1("chunkSize", r2), g$1("maxWorkers", n2), g$1("terminateWorkerTimeout", s2), g$1("useCompressionStream", a2), g$1("useWebWorkers", i2), g$1("CompressionStream", o2), g$1("DecompressionStream", c), g$1("CompressionStreamZlib", l2), g$1("DecompressionStreamZlib", u);
 }
-function O(e2, t2) {
-  t2 !== S && (T$1[e2] = t2);
+function g$1(e2, t2) {
+  t2 !== c$1 && (p$1[e2] = t2);
 }
-const C = [];
+const m$1 = [];
 for (let e2 = 0; e2 < 256; e2++) {
   let t2 = e2;
   for (let e3 = 0; e3 < 8; e3++) 1 & t2 ? t2 = t2 >>> 1 ^ 3988292384 : t2 >>>= 1;
-  C[e2] = t2;
+  m$1[e2] = t2;
 }
-class W {
+let y$1 = class y {
   constructor(e2) {
     this.crc = e2 || -1;
   }
   append(e2) {
     let t2 = 0 | this.crc;
-    for (let n2 = 0, i2 = 0 | e2.length; n2 < i2; n2++) t2 = t2 >>> 8 ^ C[255 & (t2 ^ e2[n2])];
+    for (let r2 = 0, n2 = 0 | e2.length; r2 < n2; r2++) t2 = t2 >>> 8 ^ m$1[255 & (t2 ^ e2[r2])];
     this.crc = t2;
   }
   get() {
     return ~this.crc;
   }
-}
-class j extends TransformStream {
+};
+let b$1 = class b extends TransformStream {
   constructor() {
     let e2;
-    const t2 = new W();
-    super({ transform(e3, n2) {
-      t2.append(e3), n2.enqueue(e3);
+    const t2 = new y$1();
+    super({ transform(e3, r2) {
+      t2.append(e3), r2.enqueue(e3);
     }, flush() {
-      const n2 = new Uint8Array(4);
-      new DataView(n2.buffer).setUint32(0, t2.get()), e2.value = n2;
+      const r2 = new Uint8Array(4);
+      new DataView(r2.buffer).setUint32(0, t2.get()), e2.value = r2;
     } }), e2 = this;
   }
-}
-const M = { concat(e2, t2) {
+};
+const S = { concat(e2, t2) {
   if (0 === e2.length || 0 === t2.length) return e2.concat(t2);
-  const n2 = e2[e2.length - 1], i2 = M.getPartial(n2);
-  return 32 === i2 ? e2.concat(t2) : M._shiftRight(t2, i2, 0 | n2, e2.slice(0, e2.length - 1));
+  const r2 = e2[e2.length - 1], n2 = S.getPartial(r2);
+  return 32 === n2 ? e2.concat(t2) : S._shiftRight(t2, n2, 0 | r2, e2.slice(0, e2.length - 1));
 }, bitLength(e2) {
   const t2 = e2.length;
   if (0 === t2) return 0;
-  const n2 = e2[t2 - 1];
-  return 32 * (t2 - 1) + M.getPartial(n2);
+  const r2 = e2[t2 - 1];
+  return 32 * (t2 - 1) + S.getPartial(r2);
 }, clamp(e2, t2) {
   if (32 * e2.length < t2) return e2;
-  const n2 = (e2 = e2.slice(0, Math.ceil(t2 / 32))).length;
-  return t2 &= 31, n2 > 0 && t2 && (e2[n2 - 1] = M.partial(t2, e2[n2 - 1] & 2147483648 >> t2 - 1, 1)), e2;
-}, partial: (e2, t2, n2) => 32 === e2 ? t2 : (n2 ? 0 | t2 : t2 << 32 - e2) + 1099511627776 * e2, getPartial: (e2) => Math.round(e2 / 1099511627776) || 32, _shiftRight(e2, t2, n2, i2) {
-  for (void 0 === i2 && (i2 = []); t2 >= 32; t2 -= 32) i2.push(n2), n2 = 0;
-  if (0 === t2) return i2.concat(e2);
-  for (let r3 = 0; r3 < e2.length; r3++) i2.push(n2 | e2[r3] >>> t2), n2 = e2[r3] << 32 - t2;
-  const r2 = e2.length ? e2[e2.length - 1] : 0, a2 = M.getPartial(r2);
-  return i2.push(M.partial(t2 + a2 & 31, t2 + a2 > 32 ? n2 : i2.pop(), 1)), i2;
-} }, L = { bytes: { fromBits(e2) {
-  const t2 = M.bitLength(e2) / 8, n2 = new Uint8Array(t2);
-  let i2;
-  for (let r2 = 0; r2 < t2; r2++) 3 & r2 || (i2 = e2[r2 / 4]), n2[r2] = i2 >>> 24, i2 <<= 8;
-  return n2;
+  const r2 = (e2 = e2.slice(0, Math.ceil(t2 / 32))).length;
+  return t2 &= 31, r2 > 0 && t2 && (e2[r2 - 1] = S.partial(t2, e2[r2 - 1] & 2147483648 >> t2 - 1, 1)), e2;
+}, partial: (e2, t2, r2) => 32 === e2 ? t2 : (r2 ? 0 | t2 : t2 << 32 - e2) + 1099511627776 * e2, getPartial: (e2) => Math.round(e2 / 1099511627776) || 32, _shiftRight(e2, t2, r2, n2) {
+  for (void 0 === n2 && (n2 = []); t2 >= 32; t2 -= 32) n2.push(r2), r2 = 0;
+  if (0 === t2) return n2.concat(e2);
+  for (let s3 = 0; s3 < e2.length; s3++) n2.push(r2 | e2[s3] >>> t2), r2 = e2[s3] << 32 - t2;
+  const s2 = e2.length ? e2[e2.length - 1] : 0, a2 = S.getPartial(s2);
+  return n2.push(S.partial(t2 + a2 & 31, t2 + a2 > 32 ? r2 : n2.pop(), 1)), n2;
+} }, k$1 = { bytes: { fromBits(e2) {
+  const t2 = S.bitLength(e2) / 8, r2 = new Uint8Array(t2);
+  let n2;
+  for (let s2 = 0; s2 < t2; s2++) 3 & s2 || (n2 = e2[s2 / 4]), r2[s2] = n2 >>> 24, n2 <<= 8;
+  return r2;
 }, toBits(e2) {
   const t2 = [];
-  let n2, i2 = 0;
-  for (n2 = 0; n2 < e2.length; n2++) i2 = i2 << 8 | e2[n2], 3 & ~n2 || (t2.push(i2), i2 = 0);
-  return 3 & n2 && t2.push(M.partial(8 * (3 & n2), i2)), t2;
-} } }, P = { sha1: class {
+  let r2, n2 = 0;
+  for (r2 = 0; r2 < e2.length; r2++) n2 = n2 << 8 | e2[r2], 3 & ~r2 || (t2.push(n2), n2 = 0);
+  return 3 & r2 && t2.push(S.partial(8 * (3 & r2), n2)), t2;
+} } }, z$1 = { sha1: class {
   constructor(e2) {
     const t2 = this;
     t2.blockSize = 512, t2._init = [1732584193, 4023233417, 2562383102, 271733878, 3285377520], t2._key = [1518500249, 1859775393, 2400959708, 3395469782], e2 ? (t2._h = e2._h.slice(0), t2._buffer = e2._buffer.slice(0), t2._length = e2._length) : t2.reset();
@@ -3580,54 +3170,54 @@ const M = { concat(e2, t2) {
   }
   update(e2) {
     const t2 = this;
-    "string" == typeof e2 && (e2 = L.utf8String.toBits(e2));
-    const n2 = t2._buffer = M.concat(t2._buffer, e2), i2 = t2._length, r2 = t2._length = i2 + M.bitLength(e2);
-    if (r2 > 9007199254740991) throw new Error("Cannot hash more than 2^53 - 1 bits");
-    const a2 = new Uint32Array(n2);
-    let s2 = 0;
-    for (let e3 = t2.blockSize + i2 - (t2.blockSize + i2 & t2.blockSize - 1); e3 <= r2; e3 += t2.blockSize) t2._block(a2.subarray(16 * s2, 16 * (s2 + 1))), s2 += 1;
-    return n2.splice(0, 16 * s2), t2;
+    "string" == typeof e2 && (e2 = k$1.utf8String.toBits(e2));
+    const r2 = t2._buffer = S.concat(t2._buffer, e2), n2 = t2._length, s2 = t2._length = n2 + S.bitLength(e2);
+    if (s2 > 9007199254740991) throw new Error("Cannot hash more than 2^53 - 1 bits");
+    const a2 = new Uint32Array(r2);
+    let i2 = 0;
+    for (let e3 = t2.blockSize + n2 - (t2.blockSize + n2 & t2.blockSize - 1); e3 <= s2; e3 += t2.blockSize) t2._block(a2.subarray(16 * i2, 16 * (i2 + 1))), i2 += 1;
+    return r2.splice(0, 16 * i2), t2;
   }
   finalize() {
     const e2 = this;
     let t2 = e2._buffer;
-    const n2 = e2._h;
-    t2 = M.concat(t2, [M.partial(1, 1)]);
+    const r2 = e2._h;
+    t2 = S.concat(t2, [S.partial(1, 1)]);
     for (let e3 = t2.length + 2; 15 & e3; e3++) t2.push(0);
     for (t2.push(Math.floor(e2._length / 4294967296)), t2.push(0 | e2._length); t2.length; ) e2._block(t2.splice(0, 16));
-    return e2.reset(), n2;
+    return e2.reset(), r2;
   }
-  _f(e2, t2, n2, i2) {
-    return e2 <= 19 ? t2 & n2 | ~t2 & i2 : e2 <= 39 ? t2 ^ n2 ^ i2 : e2 <= 59 ? t2 & n2 | t2 & i2 | n2 & i2 : e2 <= 79 ? t2 ^ n2 ^ i2 : void 0;
+  _f(e2, t2, r2, n2) {
+    return e2 <= 19 ? t2 & r2 | ~t2 & n2 : e2 <= 39 ? t2 ^ r2 ^ n2 : e2 <= 59 ? t2 & r2 | t2 & n2 | r2 & n2 : e2 <= 79 ? t2 ^ r2 ^ n2 : void 0;
   }
   _S(e2, t2) {
     return t2 << e2 | t2 >>> 32 - e2;
   }
   _block(e2) {
-    const t2 = this, n2 = t2._h, i2 = Array(80);
-    for (let t3 = 0; t3 < 16; t3++) i2[t3] = e2[t3];
-    let r2 = n2[0], a2 = n2[1], s2 = n2[2], o2 = n2[3], l2 = n2[4];
+    const t2 = this, r2 = t2._h, n2 = Array(80);
+    for (let t3 = 0; t3 < 16; t3++) n2[t3] = e2[t3];
+    let s2 = r2[0], a2 = r2[1], i2 = r2[2], o2 = r2[3], c = r2[4];
     for (let e3 = 0; e3 <= 79; e3++) {
-      e3 >= 16 && (i2[e3] = t2._S(1, i2[e3 - 3] ^ i2[e3 - 8] ^ i2[e3 - 14] ^ i2[e3 - 16]));
-      const n3 = t2._S(5, r2) + t2._f(e3, a2, s2, o2) + l2 + i2[e3] + t2._key[Math.floor(e3 / 20)] | 0;
-      l2 = o2, o2 = s2, s2 = t2._S(30, a2), a2 = r2, r2 = n3;
+      e3 >= 16 && (n2[e3] = t2._S(1, n2[e3 - 3] ^ n2[e3 - 8] ^ n2[e3 - 14] ^ n2[e3 - 16]));
+      const r3 = t2._S(5, s2) + t2._f(e3, a2, i2, o2) + c + n2[e3] + t2._key[Math.floor(e3 / 20)] | 0;
+      c = o2, o2 = i2, i2 = t2._S(30, a2), a2 = s2, s2 = r3;
     }
-    n2[0] = n2[0] + r2 | 0, n2[1] = n2[1] + a2 | 0, n2[2] = n2[2] + s2 | 0, n2[3] = n2[3] + o2 | 0, n2[4] = n2[4] + l2 | 0;
+    r2[0] = r2[0] + s2 | 0, r2[1] = r2[1] + a2 | 0, r2[2] = r2[2] + i2 | 0, r2[3] = r2[3] + o2 | 0, r2[4] = r2[4] + c | 0;
   }
-} }, R = { aes: class {
+} }, x$1 = { aes: class {
   constructor(e2) {
     const t2 = this;
     t2._tables = [[[], [], [], [], []], [[], [], [], [], []]], t2._tables[0][0][0] || t2._precompute();
-    const n2 = t2._tables[0][4], i2 = t2._tables[1], r2 = e2.length;
-    let a2, s2, o2, l2 = 1;
-    if (4 !== r2 && 6 !== r2 && 8 !== r2) throw new Error("invalid aes key size");
-    for (t2._key = [s2 = e2.slice(0), o2 = []], a2 = r2; a2 < 4 * r2 + 28; a2++) {
-      let e3 = s2[a2 - 1];
-      (a2 % r2 == 0 || 8 === r2 && a2 % r2 == 4) && (e3 = n2[e3 >>> 24] << 24 ^ n2[e3 >> 16 & 255] << 16 ^ n2[e3 >> 8 & 255] << 8 ^ n2[255 & e3], a2 % r2 == 0 && (e3 = e3 << 8 ^ e3 >>> 24 ^ l2 << 24, l2 = l2 << 1 ^ 283 * (l2 >> 7))), s2[a2] = s2[a2 - r2] ^ e3;
+    const r2 = t2._tables[0][4], n2 = t2._tables[1], s2 = e2.length;
+    let a2, i2, o2, c = 1;
+    if (4 !== s2 && 6 !== s2 && 8 !== s2) throw new Error("invalid aes key size");
+    for (t2._key = [i2 = e2.slice(0), o2 = []], a2 = s2; a2 < 4 * s2 + 28; a2++) {
+      let e3 = i2[a2 - 1];
+      (a2 % s2 === 0 || 8 === s2 && a2 % s2 === 4) && (e3 = r2[e3 >>> 24] << 24 ^ r2[e3 >> 16 & 255] << 16 ^ r2[e3 >> 8 & 255] << 8 ^ r2[255 & e3], a2 % s2 === 0 && (e3 = e3 << 8 ^ e3 >>> 24 ^ c << 24, c = c << 1 ^ 283 * (c >> 7))), i2[a2] = i2[a2 - s2] ^ e3;
     }
     for (let e3 = 0; a2; e3++, a2--) {
-      const t3 = s2[3 & e3 ? a2 : a2 - 4];
-      o2[e3] = a2 <= 4 || e3 < 4 ? t3 : i2[0][n2[t3 >>> 24]] ^ i2[1][n2[t3 >> 16 & 255]] ^ i2[2][n2[t3 >> 8 & 255]] ^ i2[3][n2[255 & t3]];
+      const t3 = i2[3 & e3 ? a2 : a2 - 4];
+      o2[e3] = a2 <= 4 || e3 < 4 ? t3 : n2[0][r2[t3 >>> 24]] ^ n2[1][r2[t3 >> 16 & 255]] ^ n2[2][r2[t3 >> 8 & 255]] ^ n2[3][r2[255 & t3]];
     }
   }
   encrypt(e2) {
@@ -3637,40 +3227,40 @@ const M = { concat(e2, t2) {
     return this._crypt(e2, 1);
   }
   _precompute() {
-    const e2 = this._tables[0], t2 = this._tables[1], n2 = e2[4], i2 = t2[4], r2 = [], a2 = [];
-    let s2, o2, l2, c;
-    for (let e3 = 0; e3 < 256; e3++) a2[(r2[e3] = e3 << 1 ^ 283 * (e3 >> 7)) ^ e3] = e3;
-    for (let u = s2 = 0; !n2[u]; u ^= o2 || 1, s2 = a2[s2] || 1) {
-      let a3 = s2 ^ s2 << 1 ^ s2 << 2 ^ s2 << 3 ^ s2 << 4;
-      a3 = a3 >> 8 ^ 255 & a3 ^ 99, n2[u] = a3, i2[a3] = u, c = r2[l2 = r2[o2 = r2[u]]];
-      let d = 16843009 * c ^ 65537 * l2 ^ 257 * o2 ^ 16843008 * u, f2 = 257 * r2[a3] ^ 16843008 * a3;
-      for (let n3 = 0; n3 < 4; n3++) e2[n3][u] = f2 = f2 << 24 ^ f2 >>> 8, t2[n3][a3] = d = d << 24 ^ d >>> 8;
+    const e2 = this._tables[0], t2 = this._tables[1], r2 = e2[4], n2 = t2[4], s2 = [], a2 = [];
+    let i2, o2, c, l2;
+    for (let e3 = 0; e3 < 256; e3++) a2[(s2[e3] = e3 << 1 ^ 283 * (e3 >> 7)) ^ e3] = e3;
+    for (let u = i2 = 0; !r2[u]; u ^= o2 || 1, i2 = a2[i2] || 1) {
+      let a3 = i2 ^ i2 << 1 ^ i2 << 2 ^ i2 << 3 ^ i2 << 4;
+      a3 = a3 >> 8 ^ 255 & a3 ^ 99, r2[u] = a3, n2[a3] = u, l2 = s2[c = s2[o2 = s2[u]]];
+      let d = 16843009 * l2 ^ 65537 * c ^ 257 * o2 ^ 16843008 * u, f2 = 257 * s2[a3] ^ 16843008 * a3;
+      for (let r3 = 0; r3 < 4; r3++) e2[r3][u] = f2 = f2 << 24 ^ f2 >>> 8, t2[r3][a3] = d = d << 24 ^ d >>> 8;
     }
-    for (let n3 = 0; n3 < 5; n3++) e2[n3] = e2[n3].slice(0), t2[n3] = t2[n3].slice(0);
+    for (let r3 = 0; r3 < 5; r3++) e2[r3] = e2[r3].slice(0), t2[r3] = t2[r3].slice(0);
   }
   _crypt(e2, t2) {
     if (4 !== e2.length) throw new Error("invalid aes block size");
-    const n2 = this._key[t2], i2 = n2.length / 4 - 2, r2 = [0, 0, 0, 0], a2 = this._tables[t2], s2 = a2[0], o2 = a2[1], l2 = a2[2], c = a2[3], u = a2[4];
-    let d, f2, h2, w = e2[0] ^ n2[0], _2 = e2[t2 ? 3 : 1] ^ n2[1], b2 = e2[2] ^ n2[2], p2 = e2[t2 ? 1 : 3] ^ n2[3], m2 = 4;
-    for (let e3 = 0; e3 < i2; e3++) d = s2[w >>> 24] ^ o2[_2 >> 16 & 255] ^ l2[b2 >> 8 & 255] ^ c[255 & p2] ^ n2[m2], f2 = s2[_2 >>> 24] ^ o2[b2 >> 16 & 255] ^ l2[p2 >> 8 & 255] ^ c[255 & w] ^ n2[m2 + 1], h2 = s2[b2 >>> 24] ^ o2[p2 >> 16 & 255] ^ l2[w >> 8 & 255] ^ c[255 & _2] ^ n2[m2 + 2], p2 = s2[p2 >>> 24] ^ o2[w >> 16 & 255] ^ l2[_2 >> 8 & 255] ^ c[255 & b2] ^ n2[m2 + 3], m2 += 4, w = d, _2 = f2, b2 = h2;
-    for (let e3 = 0; e3 < 4; e3++) r2[t2 ? 3 & -e3 : e3] = u[w >>> 24] << 24 ^ u[_2 >> 16 & 255] << 16 ^ u[b2 >> 8 & 255] << 8 ^ u[255 & p2] ^ n2[m2++], d = w, w = _2, _2 = b2, b2 = p2, p2 = d;
-    return r2;
-  }
-} }, B = { getRandomValues(e2) {
-  const t2 = new Uint32Array(e2.buffer), n2 = (e3) => {
+    const r2 = this._key[t2], n2 = r2.length / 4 - 2, s2 = [0, 0, 0, 0], a2 = this._tables[t2], i2 = a2[0], o2 = a2[1], c = a2[2], l2 = a2[3], u = a2[4];
+    let d, f2, h2, p2 = e2[0] ^ r2[0], w = e2[t2 ? 3 : 1] ^ r2[1], g2 = e2[2] ^ r2[2], m2 = e2[t2 ? 1 : 3] ^ r2[3], y3 = 4;
+    for (let e3 = 0; e3 < n2; e3++) d = i2[p2 >>> 24] ^ o2[w >> 16 & 255] ^ c[g2 >> 8 & 255] ^ l2[255 & m2] ^ r2[y3], f2 = i2[w >>> 24] ^ o2[g2 >> 16 & 255] ^ c[m2 >> 8 & 255] ^ l2[255 & p2] ^ r2[y3 + 1], h2 = i2[g2 >>> 24] ^ o2[m2 >> 16 & 255] ^ c[p2 >> 8 & 255] ^ l2[255 & w] ^ r2[y3 + 2], m2 = i2[m2 >>> 24] ^ o2[p2 >> 16 & 255] ^ c[w >> 8 & 255] ^ l2[255 & g2] ^ r2[y3 + 3], y3 += 4, p2 = d, w = f2, g2 = h2;
+    for (let e3 = 0; e3 < 4; e3++) s2[t2 ? 3 & -e3 : e3] = u[p2 >>> 24] << 24 ^ u[w >> 16 & 255] << 16 ^ u[g2 >> 8 & 255] << 8 ^ u[255 & m2] ^ r2[y3++], d = p2, p2 = w, w = g2, g2 = m2, m2 = d;
+    return s2;
+  }
+} }, U$1 = { getRandomValues(e2) {
+  const t2 = new Uint32Array(e2.buffer), r2 = (e3) => {
     let t3 = 987654321;
-    const n3 = 4294967295;
+    const r3 = 4294967295;
     return function() {
-      t3 = 36969 * (65535 & t3) + (t3 >> 16) & n3;
-      return (((t3 << 16) + (e3 = 18e3 * (65535 & e3) + (e3 >> 16) & n3) & n3) / 4294967296 + 0.5) * (Math.random() > 0.5 ? 1 : -1);
+      t3 = 36969 * (65535 & t3) + (t3 >> 16) & r3;
+      return (((t3 << 16) + (e3 = 18e3 * (65535 & e3) + (e3 >> 16) & r3) & r3) / 4294967296 + 0.5) * (Math.random() > 0.5 ? 1 : -1);
     };
   };
-  for (let i2, r2 = 0; r2 < e2.length; r2 += 4) {
-    const e3 = n2(4294967296 * (i2 || Math.random()));
-    i2 = 987654071 * e3(), t2[r2 / 4] = 4294967296 * e3() | 0;
+  for (let n2, s2 = 0; s2 < e2.length; s2 += 4) {
+    const e3 = r2(4294967296 * (n2 || Math.random()));
+    n2 = 987654071 * e3(), t2[s2 / 4] = 4294967296 * e3() | 0;
   }
   return e2;
-} }, I = { ctrGladman: class {
+} }, A$1 = { ctrGladman: class {
   constructor(e2, t2) {
     this._prf = e2, this._initIv = t2, this._iv = t2;
   }
@@ -3683,45 +3273,45 @@ const M = { concat(e2, t2) {
   incWord(e2) {
     if (255 & ~(e2 >> 24)) e2 += 1 << 24;
     else {
-      let t2 = e2 >> 16 & 255, n2 = e2 >> 8 & 255, i2 = 255 & e2;
-      255 === t2 ? (t2 = 0, 255 === n2 ? (n2 = 0, 255 === i2 ? i2 = 0 : ++i2) : ++n2) : ++t2, e2 = 0, e2 += t2 << 16, e2 += n2 << 8, e2 += i2;
+      let t2 = e2 >> 16 & 255, r2 = e2 >> 8 & 255, n2 = 255 & e2;
+      255 === t2 ? (t2 = 0, 255 === r2 ? (r2 = 0, 255 === n2 ? n2 = 0 : ++n2) : ++r2) : ++t2, e2 = 0, e2 += t2 << 16, e2 += r2 << 8, e2 += n2;
     }
     return e2;
   }
   incCounter(e2) {
     0 === (e2[0] = this.incWord(e2[0])) && (e2[1] = this.incWord(e2[1]));
   }
-  calculate(e2, t2, n2) {
-    let i2;
-    if (!(i2 = t2.length)) return [];
-    const r2 = M.bitLength(t2);
-    for (let r3 = 0; r3 < i2; r3 += 4) {
-      this.incCounter(n2);
-      const i3 = e2.encrypt(n2);
-      t2[r3] ^= i3[0], t2[r3 + 1] ^= i3[1], t2[r3 + 2] ^= i3[2], t2[r3 + 3] ^= i3[3];
-    }
-    return M.clamp(t2, r2);
-  }
-} }, N = { importKey: (e2) => new N.hmacSha1(L.bytes.toBits(e2)), pbkdf2(e2, t2, n2, i2) {
-  if (n2 = n2 || 1e4, i2 < 0 || n2 < 0) throw new Error("invalid params to pbkdf2");
-  const r2 = 1 + (i2 >> 5) << 2;
-  let a2, s2, o2, l2, c;
-  const u = new ArrayBuffer(r2), d = new DataView(u);
+  calculate(e2, t2, r2) {
+    let n2;
+    if (!(n2 = t2.length)) return [];
+    const s2 = S.bitLength(t2);
+    for (let s3 = 0; s3 < n2; s3 += 4) {
+      this.incCounter(r2);
+      const n3 = e2.encrypt(r2);
+      t2[s3] ^= n3[0], t2[s3 + 1] ^= n3[1], t2[s3 + 2] ^= n3[2], t2[s3 + 3] ^= n3[3];
+    }
+    return S.clamp(t2, s2);
+  }
+} }, v$1 = { importKey: (e2) => new v$1.hmacSha1(k$1.bytes.toBits(e2)), pbkdf2(e2, t2, r2, n2) {
+  if (r2 = r2 || 1e4, n2 < 0 || r2 < 0) throw new Error("invalid params to pbkdf2");
+  const s2 = 1 + (n2 >> 5) << 2;
+  let a2, i2, o2, c, l2;
+  const u = new ArrayBuffer(s2), d = new DataView(u);
   let f2 = 0;
-  const h2 = M;
-  for (t2 = L.bytes.toBits(t2), c = 1; f2 < (r2 || 1); c++) {
-    for (a2 = s2 = e2.encrypt(h2.concat(t2, [c])), o2 = 1; o2 < n2; o2++) for (s2 = e2.encrypt(s2), l2 = 0; l2 < s2.length; l2++) a2[l2] ^= s2[l2];
-    for (o2 = 0; f2 < (r2 || 1) && o2 < a2.length; o2++) d.setInt32(f2, a2[o2]), f2 += 4;
+  const h2 = S;
+  for (t2 = k$1.bytes.toBits(t2), l2 = 1; f2 < (s2 || 1); l2++) {
+    for (a2 = i2 = e2.encrypt(h2.concat(t2, [l2])), o2 = 1; o2 < r2; o2++) for (i2 = e2.encrypt(i2), c = 0; c < i2.length; c++) a2[c] ^= i2[c];
+    for (o2 = 0; f2 < (s2 || 1) && o2 < a2.length; o2++) d.setInt32(f2, a2[o2]), f2 += 4;
   }
-  return u.slice(0, i2 / 8);
+  return u.slice(0, n2 / 8);
 }, hmacSha1: class {
   constructor(e2) {
-    const t2 = this, n2 = t2._hash = P.sha1, i2 = [[], []];
-    t2._baseHash = [new n2(), new n2()];
-    const r2 = t2._baseHash[0].blockSize / 32;
-    e2.length > r2 && (e2 = new n2().update(e2).finalize());
-    for (let t3 = 0; t3 < r2; t3++) i2[0][t3] = 909522486 ^ e2[t3], i2[1][t3] = 1549556828 ^ e2[t3];
-    t2._baseHash[0].update(i2[0]), t2._baseHash[1].update(i2[1]), t2._resultHash = new n2(t2._baseHash[0]);
+    const t2 = this, r2 = t2._hash = z$1.sha1, n2 = [[], []];
+    t2._baseHash = [new r2(), new r2()];
+    const s2 = t2._baseHash[0].blockSize / 32;
+    e2.length > s2 && (e2 = new r2().update(e2).finalize());
+    for (let t3 = 0; t3 < s2; t3++) n2[0][t3] = 909522486 ^ e2[t3], n2[1][t3] = 1549556828 ^ e2[t3];
+    t2._baseHash[0].update(n2[0]), t2._baseHash[1].update(n2[1]), t2._resultHash = new r2(t2._baseHash[0]);
   }
   reset() {
     const e2 = this;
@@ -3731,449 +3321,470 @@ const M = { concat(e2, t2) {
     this._updated = true, this._resultHash.update(e2);
   }
   digest() {
-    const e2 = this, t2 = e2._resultHash.finalize(), n2 = new e2._hash(e2._baseHash[1]).update(t2).finalize();
-    return e2.reset(), n2;
+    const e2 = this, t2 = e2._resultHash.finalize(), r2 = new e2._hash(e2._baseHash[1]).update(t2).finalize();
+    return e2.reset(), r2;
   }
   encrypt(e2) {
     if (this._updated) throw new Error("encrypt on already updated hmac called!");
     return this.update(e2), this.digest(e2);
   }
-} }, V = typeof crypto != z$1 && typeof crypto.getRandomValues == A$1, q = "Invalid password", H = "Invalid signature", K = "zipjs-abort-check-password";
-function Z(e2) {
-  return V ? crypto.getRandomValues(e2) : B.getRandomValues(e2);
+} }, D$1 = typeof crypto != u$1 && typeof crypto.getRandomValues == d$1, _ = "Invalid password", F = "Invalid signature", O = "zipjs-abort-check-password";
+function E$1(e2) {
+  return D$1 ? crypto.getRandomValues(e2) : U$1.getRandomValues(e2);
 }
-const G = 16, J = { name: "PBKDF2" }, Q = Object.assign({ hash: { name: "HMAC" } }, J), X = Object.assign({ iterations: 1e3, hash: { name: "SHA-1" } }, J), Y = ["deriveBits"], $ = [8, 12, 16], ee = [16, 24, 32], te = 10, ne = [0, 0, 0, 0], ie = typeof crypto != z$1, re = ie && crypto.subtle, ae = ie && typeof re != z$1, se = L.bytes, oe = R.aes, le = I.ctrGladman, ce = N.hmacSha1;
-let ue = ie && ae && typeof re.importKey == A$1, de = ie && ae && typeof re.deriveBits == A$1;
-class fe extends TransformStream {
-  constructor({ password: e2, rawPassword: t2, signed: n2, encryptionStrength: i2, checkPasswordOnly: r2 }) {
+const T$1 = 16, C = { name: "PBKDF2" }, R = Object.assign({ hash: { name: "HMAC" } }, C), W = Object.assign({ iterations: 1e3, hash: { name: "SHA-1" } }, C), M = ["deriveBits"], j = [8, 12, 16], I = [16, 24, 32], B = 10, P = [0, 0, 0, 0], L = typeof crypto != u$1, V = L && crypto.subtle, N = L && typeof V != u$1, Z = k$1.bytes, q = x$1.aes, H = A$1.ctrGladman, K = v$1.hmacSha1;
+let G = L && N && typeof V.importKey == d$1, J = L && N && typeof V.deriveBits == d$1;
+class Q extends TransformStream {
+  constructor({ password: e2, rawPassword: t2, signed: r2, encryptionStrength: n2, checkPasswordOnly: s2 }) {
     super({ start() {
-      Object.assign(this, { ready: new Promise(((e3) => this.resolveReady = e3)), password: be(e2, t2), signed: n2, strength: i2 - 1, pending: new Uint8Array() });
+      Object.assign(this, { ready: new Promise((e3) => this.resolveReady = e3), password: ee(e2, t2), signed: r2, strength: n2 - 1, pending: new Uint8Array() });
     }, async transform(e3, t3) {
-      const n3 = this, { password: i3, strength: a2, resolveReady: s2, ready: o2 } = n3;
-      i3 ? (await (async function(e4, t4, n4, i4) {
-        const r3 = await _e(e4, t4, n4, me(i4, 0, $[t4])), a3 = me(i4, $[t4]);
-        if (r3[0] != a3[0] || r3[1] != a3[1]) throw new Error(q);
-      })(n3, a2, i3, me(e3, 0, $[a2] + 2)), e3 = me(e3, $[a2] + 2), r2 ? t3.error(new Error(K)) : s2()) : await o2;
-      const l2 = new Uint8Array(e3.length - te - (e3.length - te) % G);
-      t3.enqueue(we(n3, e3, l2, 0, te, true));
+      const r3 = this, { password: n3, strength: a2, resolveReady: i2, ready: o2 } = r3;
+      n3 ? (await (async function(e4, t4, r4, n4) {
+        const s3 = await $(e4, t4, r4, re(n4, 0, j[t4])), a3 = re(n4, j[t4]);
+        if (s3[0] != a3[0] || s3[1] != a3[1]) throw new Error(_);
+      })(r3, a2, n3, re(e3, 0, j[a2] + 2)), e3 = re(e3, j[a2] + 2), s2 ? t3.error(new Error(O)) : i2()) : await o2;
+      const c = new Uint8Array(e3.length - B - (e3.length - B) % T$1);
+      t3.enqueue(Y(r3, e3, c, 0, B, true));
     }, async flush(e3) {
-      const { signed: t3, ctr: n3, hmac: i3, pending: r3, ready: a2 } = this;
-      if (i3 && n3) {
+      const { signed: t3, ctr: r3, hmac: n3, pending: s3, ready: a2 } = this;
+      if (n3 && r3) {
         await a2;
-        const s2 = me(r3, 0, r3.length - te), o2 = me(r3, r3.length - te);
-        let l2 = new Uint8Array();
-        if (s2.length) {
-          const e4 = ye(se, s2);
-          i3.update(e4);
-          const t4 = n3.update(e4);
-          l2 = ge(se, t4);
+        const i2 = re(s3, 0, s3.length - B), o2 = re(s3, s3.length - B);
+        let c = new Uint8Array();
+        if (i2.length) {
+          const e4 = se(Z, i2);
+          n3.update(e4);
+          const t4 = r3.update(e4);
+          c = ne(Z, t4);
         }
         if (t3) {
-          const e4 = me(ge(se, i3.digest()), 0, te);
-          for (let t4 = 0; t4 < te; t4++) if (e4[t4] != o2[t4]) throw new Error(H);
+          const e4 = re(ne(Z, n3.digest()), 0, B);
+          for (let t4 = 0; t4 < B; t4++) if (e4[t4] != o2[t4]) throw new Error(F);
         }
-        e3.enqueue(l2);
+        e3.enqueue(c);
       }
     } });
   }
 }
-class he extends TransformStream {
-  constructor({ password: e2, rawPassword: t2, encryptionStrength: n2 }) {
-    let i2;
+class X extends TransformStream {
+  constructor({ password: e2, rawPassword: t2, encryptionStrength: r2 }) {
+    let n2;
     super({ start() {
-      Object.assign(this, { ready: new Promise(((e3) => this.resolveReady = e3)), password: be(e2, t2), strength: n2 - 1, pending: new Uint8Array() });
+      Object.assign(this, { ready: new Promise((e3) => this.resolveReady = e3), password: ee(e2, t2), strength: r2 - 1, pending: new Uint8Array() });
     }, async transform(e3, t3) {
-      const n3 = this, { password: i3, strength: r2, resolveReady: a2, ready: s2 } = n3;
+      const r3 = this, { password: n3, strength: s2, resolveReady: a2, ready: i2 } = r3;
       let o2 = new Uint8Array();
-      i3 ? (o2 = await (async function(e4, t4, n4) {
-        const i4 = Z(new Uint8Array($[t4])), r3 = await _e(e4, t4, n4, i4);
-        return pe(i4, r3);
-      })(n3, r2, i3), a2()) : await s2;
-      const l2 = new Uint8Array(o2.length + e3.length - e3.length % G);
-      l2.set(o2, 0), t3.enqueue(we(n3, e3, l2, o2.length, 0));
+      n3 ? (o2 = await (async function(e4, t4, r4) {
+        const n4 = E$1(new Uint8Array(j[t4])), s3 = await $(e4, t4, r4, n4);
+        return te(n4, s3);
+      })(r3, s2, n3), a2()) : await i2;
+      const c = new Uint8Array(o2.length + e3.length - e3.length % T$1);
+      c.set(o2, 0), t3.enqueue(Y(r3, e3, c, o2.length, 0));
     }, async flush(e3) {
-      const { ctr: t3, hmac: n3, pending: r2, ready: a2 } = this;
-      if (n3 && t3) {
+      const { ctr: t3, hmac: r3, pending: s2, ready: a2 } = this;
+      if (r3 && t3) {
         await a2;
-        let s2 = new Uint8Array();
-        if (r2.length) {
-          const e4 = t3.update(ye(se, r2));
-          n3.update(e4), s2 = ge(se, e4);
+        let i2 = new Uint8Array();
+        if (s2.length) {
+          const e4 = t3.update(se(Z, s2));
+          r3.update(e4), i2 = ne(Z, e4);
         }
-        i2.signature = ge(se, n3.digest()).slice(0, te), e3.enqueue(pe(s2, i2.signature));
+        n2.signature = ne(Z, r3.digest()).slice(0, B), e3.enqueue(te(i2, n2.signature));
       }
-    } }), i2 = this;
+    } }), n2 = this;
   }
 }
-function we(e2, t2, n2, i2, r2, a2) {
-  const { ctr: s2, hmac: o2, pending: l2 } = e2, c = t2.length - r2;
+function Y(e2, t2, r2, n2, s2, a2) {
+  const { ctr: i2, hmac: o2, pending: c } = e2, l2 = t2.length - s2;
   let u;
-  for (l2.length && (t2 = pe(l2, t2), n2 = (function(e3, t3) {
+  for (c.length && (t2 = te(c, t2), r2 = (function(e3, t3) {
     if (t3 && t3 > e3.length) {
-      const n3 = e3;
-      (e3 = new Uint8Array(t3)).set(n3, 0);
+      const r3 = e3;
+      (e3 = new Uint8Array(t3)).set(r3, 0);
     }
     return e3;
-  })(n2, c - c % G)), u = 0; u <= c - G; u += G) {
-    const e3 = ye(se, me(t2, u, u + G));
+  })(r2, l2 - l2 % T$1)), u = 0; u <= l2 - T$1; u += T$1) {
+    const e3 = se(Z, re(t2, u, u + T$1));
     a2 && o2.update(e3);
-    const r3 = s2.update(e3);
-    a2 || o2.update(r3), n2.set(ge(se, r3), u + i2);
+    const s3 = i2.update(e3);
+    a2 || o2.update(s3), r2.set(ne(Z, s3), u + n2);
   }
-  return e2.pending = me(t2, u), n2;
+  return e2.pending = re(t2, u), r2;
 }
-async function _e(e2, t2, n2, i2) {
+async function $(e2, t2, r2, n2) {
   e2.password = null;
-  const r2 = await (async function(e3, t3, n3, i3, r3) {
-    if (!ue) return N.importKey(t3);
+  const s2 = await (async function(e3, t3, r3, n3, s3) {
+    if (!G) return v$1.importKey(t3);
     try {
-      return await re.importKey(e3, t3, n3, i3, r3);
-    } catch (e4) {
-      return ue = false, N.importKey(t3);
+      return await V.importKey(e3, t3, r3, n3, s3);
+    } catch {
+      return G = false, v$1.importKey(t3);
     }
-  })("raw", n2, Q, false, Y), a2 = await (async function(e3, t3, n3) {
-    if (!de) return N.pbkdf2(t3, e3.salt, X.iterations, n3);
+  })("raw", r2, R, false, M), a2 = await (async function(e3, t3, r3) {
+    if (!J) return v$1.pbkdf2(t3, e3.salt, W.iterations, r3);
     try {
-      return await re.deriveBits(e3, t3, n3);
-    } catch (i3) {
-      return de = false, N.pbkdf2(t3, e3.salt, X.iterations, n3);
+      return await V.deriveBits(e3, t3, r3);
+    } catch {
+      return J = false, v$1.pbkdf2(t3, e3.salt, W.iterations, r3);
     }
-  })(Object.assign({ salt: i2 }, X), r2, 8 * (2 * ee[t2] + 2)), s2 = new Uint8Array(a2), o2 = ye(se, me(s2, 0, ee[t2])), l2 = ye(se, me(s2, ee[t2], 2 * ee[t2])), c = me(s2, 2 * ee[t2]);
-  return Object.assign(e2, { keys: { key: o2, authentication: l2, passwordVerification: c }, ctr: new le(new oe(o2), Array.from(ne)), hmac: new ce(l2) }), c;
+  })(Object.assign({ salt: n2 }, W), s2, 8 * (2 * I[t2] + 2)), i2 = new Uint8Array(a2), o2 = se(Z, re(i2, 0, I[t2])), c = se(Z, re(i2, I[t2], 2 * I[t2])), l2 = re(i2, 2 * I[t2]);
+  return Object.assign(e2, { keys: { key: o2, authentication: c, passwordVerification: l2 }, ctr: new H(new q(o2), Array.from(P)), hmac: new K(c) }), l2;
 }
-function be(e2, t2) {
-  return t2 === S ? (function(e3) {
-    if (typeof TextEncoder == z$1) {
+function ee(e2, t2) {
+  return t2 === c$1 ? (function(e3) {
+    if (typeof TextEncoder == u$1) {
       e3 = unescape(encodeURIComponent(e3));
       const t3 = new Uint8Array(e3.length);
-      for (let n2 = 0; n2 < t3.length; n2++) t3[n2] = e3.charCodeAt(n2);
+      for (let r2 = 0; r2 < t3.length; r2++) t3[r2] = e3.charCodeAt(r2);
       return t3;
     }
     return new TextEncoder().encode(e3);
   })(e2) : t2;
 }
-function pe(e2, t2) {
-  let n2 = e2;
-  return e2.length + t2.length && (n2 = new Uint8Array(e2.length + t2.length), n2.set(e2, 0), n2.set(t2, e2.length)), n2;
+function te(e2, t2) {
+  let r2 = e2;
+  return e2.length + t2.length && (r2 = new Uint8Array(e2.length + t2.length), r2.set(e2, 0), r2.set(t2, e2.length)), r2;
 }
-function me(e2, t2, n2) {
-  return e2.subarray(t2, n2);
+function re(e2, t2, r2) {
+  return e2.subarray(t2, r2);
 }
-function ge(e2, t2) {
+function ne(e2, t2) {
   return e2.fromBits(t2);
 }
-function ye(e2, t2) {
+function se(e2, t2) {
   return e2.toBits(t2);
 }
-const xe = 12;
-class ke extends TransformStream {
-  constructor({ password: e2, passwordVerification: t2, checkPasswordOnly: n2 }) {
+class ae extends TransformStream {
+  constructor({ password: e2, passwordVerification: t2, checkPasswordOnly: r2 }) {
     super({ start() {
-      Object.assign(this, { password: e2, passwordVerification: t2 }), Ae(this, e2);
+      Object.assign(this, { password: e2, passwordVerification: t2 }), le(this, e2);
     }, transform(e3, t3) {
-      const i2 = this;
-      if (i2.password) {
-        const t4 = Se(i2, e3.subarray(0, xe));
-        if (i2.password = null, t4[11] != i2.passwordVerification) throw new Error(q);
-        e3 = e3.subarray(xe);
+      const n2 = this;
+      if (n2.password) {
+        const t4 = oe(n2, e3.subarray(0, 12));
+        if (n2.password = null, t4.at(-1) != n2.passwordVerification) throw new Error(_);
+        e3 = e3.subarray(12);
       }
-      n2 ? t3.error(new Error(K)) : t3.enqueue(Se(i2, e3));
+      r2 ? t3.error(new Error(O)) : t3.enqueue(oe(n2, e3));
     } });
   }
 }
-class ve extends TransformStream {
+class ie extends TransformStream {
   constructor({ password: e2, passwordVerification: t2 }) {
     super({ start() {
-      Object.assign(this, { password: e2, passwordVerification: t2 }), Ae(this, e2);
+      Object.assign(this, { password: e2, passwordVerification: t2 }), le(this, e2);
     }, transform(e3, t3) {
-      const n2 = this;
-      let i2, r2;
-      if (n2.password) {
-        n2.password = null;
-        const t4 = Z(new Uint8Array(xe));
-        t4[11] = n2.passwordVerification, i2 = new Uint8Array(e3.length + t4.length), i2.set(ze(n2, t4), 0), r2 = xe;
-      } else i2 = new Uint8Array(e3.length), r2 = 0;
-      i2.set(ze(n2, e3), r2), t3.enqueue(i2);
+      const r2 = this;
+      let n2, s2;
+      if (r2.password) {
+        r2.password = null;
+        const t4 = E$1(new Uint8Array(12));
+        t4[11] = r2.passwordVerification, n2 = new Uint8Array(e3.length + t4.length), n2.set(ce(r2, t4), 0), s2 = 12;
+      } else n2 = new Uint8Array(e3.length), s2 = 0;
+      n2.set(ce(r2, e3), s2), t3.enqueue(n2);
     } });
   }
 }
-function Se(e2, t2) {
-  const n2 = new Uint8Array(t2.length);
-  for (let i2 = 0; i2 < t2.length; i2++) n2[i2] = De(e2) ^ t2[i2], Ue(e2, n2[i2]);
-  return n2;
+function oe(e2, t2) {
+  const r2 = new Uint8Array(t2.length);
+  for (let n2 = 0; n2 < t2.length; n2++) r2[n2] = de(e2) ^ t2[n2], ue(e2, r2[n2]);
+  return r2;
 }
-function ze(e2, t2) {
-  const n2 = new Uint8Array(t2.length);
-  for (let i2 = 0; i2 < t2.length; i2++) n2[i2] = De(e2) ^ t2[i2], Ue(e2, t2[i2]);
-  return n2;
+function ce(e2, t2) {
+  const r2 = new Uint8Array(t2.length);
+  for (let n2 = 0; n2 < t2.length; n2++) r2[n2] = de(e2) ^ t2[n2], ue(e2, t2[n2]);
+  return r2;
 }
-function Ae(e2, t2) {
-  const n2 = [305419896, 591751049, 878082192];
-  Object.assign(e2, { keys: n2, crcKey0: new W(n2[0]), crcKey2: new W(n2[2]) });
-  for (let n3 = 0; n3 < t2.length; n3++) Ue(e2, t2.charCodeAt(n3));
+function le(e2, t2) {
+  const r2 = [305419896, 591751049, 878082192];
+  Object.assign(e2, { keys: r2, crcKey0: new y$1(r2[0]), crcKey2: new y$1(r2[2]) });
+  for (let r3 = 0; r3 < t2.length; r3++) ue(e2, t2.charCodeAt(r3));
 }
-function Ue(e2, t2) {
-  let [n2, i2, r2] = e2.keys;
-  e2.crcKey0.append([t2]), n2 = ~e2.crcKey0.get(), i2 = Te(Math.imul(Te(i2 + Ee(n2)), 134775813) + 1), e2.crcKey2.append([i2 >>> 24]), r2 = ~e2.crcKey2.get(), e2.keys = [n2, i2, r2];
+function ue(e2, t2) {
+  let [r2, n2, s2] = e2.keys;
+  e2.crcKey0.append([t2]), r2 = ~e2.crcKey0.get(), n2 = he(Math.imul(he(n2 + fe(r2)), 134775813) + 1), e2.crcKey2.append([n2 >>> 24]), s2 = ~e2.crcKey2.get(), e2.keys = [r2, n2, s2];
 }
-function De(e2) {
+function de(e2) {
   const t2 = 2 | e2.keys[2];
-  return Ee(Math.imul(t2, 1 ^ t2) >>> 8);
+  return fe(Math.imul(t2, 1 ^ t2) >>> 8);
 }
-function Ee(e2) {
+function fe(e2) {
   return 255 & e2;
 }
-function Te(e2) {
+function he(e2) {
   return 4294967295 & e2;
 }
-const Fe = "deflate-raw";
-class Oe extends TransformStream {
-  constructor(e2, { chunkSize: t2, CompressionStream: n2, CompressionStreamNative: i2 }) {
+const pe = "Invalid uncompressed size";
+class we extends TransformStream {
+  constructor(e2, { chunkSize: t2, CompressionStreamZlib: r2, CompressionStream: n2 }) {
     super({});
-    const { compressed: r2, encrypted: a2, useCompressionStream: s2, zipCrypto: o2, signed: l2, level: c } = e2, u = this;
-    let d, f2, h2 = We(super.readable);
-    a2 && !o2 || !l2 || (d = new j(), h2 = Le(h2, d)), r2 && (h2 = Me(h2, s2, { level: c, chunkSize: t2 }, i2, n2)), a2 && (o2 ? h2 = Le(h2, new ve(e2)) : (f2 = new he(e2), h2 = Le(h2, f2))), je(u, h2, (() => {
+    const { compressed: s2, encrypted: a2, useCompressionStream: i2, zipCrypto: o2, signed: c, level: l2 } = e2, u = this;
+    let d, f2, h2 = super.readable;
+    a2 && !o2 || !c || (d = new b$1(), h2 = be(h2, d)), s2 && (h2 = ye(h2, i2, { level: l2, chunkSize: t2 }, n2, r2, n2)), a2 && (o2 ? h2 = be(h2, new ie(e2)) : (f2 = new X(e2), h2 = be(h2, f2))), me(u, h2, () => {
       let e3;
-      a2 && !o2 && (e3 = f2.signature), a2 && !o2 || !l2 || (e3 = new DataView(d.value.buffer).getUint32(0)), u.signature = e3;
-    }));
+      a2 && !o2 && (e3 = f2.signature), a2 && !o2 || !c || (e3 = new DataView(d.value.buffer).getUint32(0)), u.signature = e3;
+    });
   }
 }
-class Ce extends TransformStream {
-  constructor(e2, { chunkSize: t2, DecompressionStream: n2, DecompressionStreamNative: i2 }) {
+class ge extends TransformStream {
+  constructor(e2, { chunkSize: t2, DecompressionStreamZlib: r2, DecompressionStream: n2 }) {
     super({});
-    const { zipCrypto: r2, encrypted: a2, signed: s2, signature: o2, compressed: l2, useCompressionStream: c } = e2;
-    let u, d, f2 = We(super.readable);
-    a2 && (r2 ? f2 = Le(f2, new ke(e2)) : (d = new fe(e2), f2 = Le(f2, d))), l2 && (f2 = Me(f2, c, { chunkSize: t2 }, i2, n2)), a2 && !r2 || !s2 || (u = new j(), f2 = Le(f2, u)), je(this, f2, (() => {
-      if ((!a2 || r2) && s2) {
-        const e3 = new DataView(u.value.buffer);
-        if (o2 != e3.getUint32(0, false)) throw new Error(H);
+    const { zipCrypto: s2, encrypted: a2, signed: i2, signature: o2, compressed: c, useCompressionStream: l2, deflate64: u } = e2;
+    let d, f2, h2 = super.readable;
+    a2 && (s2 ? h2 = be(h2, new ae(e2)) : (f2 = new Q(e2), h2 = be(h2, f2))), c && (h2 = ye(h2, l2, { chunkSize: t2, deflate64: u }, n2, r2, n2)), a2 && !s2 || !i2 || (d = new b$1(), h2 = be(h2, d)), me(this, h2, () => {
+      if ((!a2 || s2) && i2) {
+        const e3 = new DataView(d.value.buffer);
+        if (o2 != e3.getUint32(0, false)) throw new Error(F);
       }
-    }));
+    });
   }
 }
-function We(e2) {
-  return Le(e2, new TransformStream({ transform(e3, t2) {
-    e3 && e3.length && t2.enqueue(e3);
-  } }));
-}
-function je(e2, t2, n2) {
-  t2 = Le(t2, new TransformStream({ flush: n2 })), Object.defineProperty(e2, "readable", { get: () => t2 });
+function me(e2, t2, r2) {
+  t2 = be(t2, new TransformStream({ flush: r2 })), Object.defineProperty(e2, "readable", { get: () => t2 });
 }
-function Me(e2, t2, n2, i2, r2) {
+function ye(e2, t2, r2, n2, s2, a2) {
+  const i2 = t2 && n2 ? n2 : s2 || a2, o2 = r2.deflate64 ? "deflate64-raw" : "deflate-raw";
   try {
-    e2 = Le(e2, new (t2 && i2 ? i2 : r2)(Fe, n2));
-  } catch (i3) {
-    if (!t2) return e2;
-    try {
-      e2 = Le(e2, new r2(Fe, n2));
-    } catch (t3) {
-      return e2;
+    e2 = be(e2, new i2(o2, r2));
+  } catch (n3) {
+    if (!t2) throw n3;
+    if (s2) e2 = be(e2, new s2(o2, r2));
+    else {
+      if (!a2) throw n3;
+      e2 = be(e2, new a2(o2, r2));
     }
   }
   return e2;
 }
-function Le(e2, t2) {
+function be(e2, t2) {
   return e2.pipeThrough(t2);
 }
-const Pe = "message", Re = "start", Be = "pull", Ie = "data", Ne = "close", Ve = "inflate";
-class qe extends TransformStream {
+const Se = "start", ke = "pull", ze = "data", xe = "close", Ue = "inflate";
+class Ae extends TransformStream {
   constructor(e2, t2) {
     super({});
-    const n2 = this, { codecType: i2 } = e2;
-    let r2;
-    i2.startsWith("deflate") ? r2 = Oe : i2.startsWith(Ve) && (r2 = Ce);
-    let a2 = 0, s2 = 0;
-    const o2 = new r2(e2, t2), l2 = super.readable, c = new TransformStream({ transform(e3, t3) {
-      e3 && e3.length && (s2 += e3.length, t3.enqueue(e3));
-    }, flush() {
-      Object.assign(n2, { inputSize: s2 });
-    } }), u = new TransformStream({ transform(e3, t3) {
+    const r2 = this, { codecType: n2 } = e2;
+    let s2;
+    n2.startsWith("deflate") ? s2 = we : n2.startsWith(Ue) && (s2 = ge), r2.outputSize = 0;
+    let a2 = 0;
+    const i2 = new s2(e2, t2), o2 = super.readable, l2 = new TransformStream({ transform(e3, t3) {
       e3 && e3.length && (a2 += e3.length, t3.enqueue(e3));
     }, flush() {
-      const { signature: e3 } = o2;
-      Object.assign(n2, { signature: e3, outputSize: a2, inputSize: s2 });
+      Object.assign(r2, { inputSize: a2 });
+    } }), u = new TransformStream({ transform(t3, n3) {
+      if (t3 && t3.length && (n3.enqueue(t3), r2.outputSize += t3.length, e2.outputSize !== c$1 && r2.outputSize > e2.outputSize)) throw new Error(pe);
+    }, flush() {
+      const { signature: e3 } = i2;
+      Object.assign(r2, { signature: e3, inputSize: a2 });
     } });
-    Object.defineProperty(n2, "readable", { get: () => l2.pipeThrough(c).pipeThrough(o2).pipeThrough(u) });
+    Object.defineProperty(r2, "readable", { get: () => o2.pipeThrough(l2).pipeThrough(i2).pipeThrough(u) });
   }
 }
-class He extends TransformStream {
+class ve extends TransformStream {
   constructor(e2) {
     let t2;
-    super({ transform: function n2(i2, r2) {
+    super({ transform: function r2(n2, s2) {
       if (t2) {
-        const e3 = new Uint8Array(t2.length + i2.length);
-        e3.set(t2), e3.set(i2, t2.length), i2 = e3, t2 = null;
+        const e3 = new Uint8Array(t2.length + n2.length);
+        e3.set(t2), e3.set(n2, t2.length), n2 = e3, t2 = null;
       }
-      i2.length > e2 ? (r2.enqueue(i2.slice(0, e2)), n2(i2.slice(e2), r2)) : t2 = i2;
+      n2.length > e2 ? (s2.enqueue(n2.slice(0, e2)), r2(n2.slice(e2), s2)) : t2 = n2;
     }, flush(e3) {
       t2 && t2.length && e3.enqueue(t2);
     } });
   }
 }
-let Ke = typeof Worker != z$1;
-class Ze {
-  constructor(e2, { readable: t2, writable: n2 }, { options: i2, config: r2, streamOptions: a2, useWebWorkers: s2, transferStreams: o2, scripts: l2 }, c) {
-    const { signal: u } = a2;
-    return Object.assign(e2, { busy: true, readable: t2.pipeThrough(new He(r2.chunkSize)).pipeThrough(new Ge(t2, a2), { signal: u }), writable: n2, options: Object.assign({}, i2), scripts: l2, transferStreams: o2, terminate: () => new Promise(((t3) => {
-      const { worker: n3, busy: i3 } = e2;
-      n3 ? (i3 ? e2.resolveTerminated = t3 : (n3.terminate(), t3()), e2.interface = null) : t3();
-    })), onTaskFinished() {
+const De = { type: "module" };
+let _e, Fe, Oe, Ee = true;
+try {
+  Ee = typeof structuredClone == d$1 && structuredClone(new DOMException("", "AbortError")).code !== c$1;
+} catch {
+}
+class Te {
+  constructor(e2, { readable: t2, writable: r2 }, { options: n2, config: s2, streamOptions: a2, useWebWorkers: i2, transferStreams: o2, workerURI: l2 }, d) {
+    const { signal: f2 } = a2;
+    return Object.assign(e2, { busy: true, readable: t2.pipeThrough(new ve(s2.chunkSize)).pipeThrough(new Ce(a2), { signal: f2 }), writable: r2, options: Object.assign({}, n2), workerURI: l2, transferStreams: o2, terminate: () => new Promise((t3) => {
+      const { worker: r3, busy: n3 } = e2;
+      r3 ? (n3 ? e2.resolveTerminated = t3 : (r3.terminate(), t3()), e2.interface = null) : t3();
+    }), onTaskFinished() {
       const { resolveTerminated: t3 } = e2;
-      t3 && (e2.resolveTerminated = null, e2.terminated = true, e2.worker.terminate(), t3()), e2.busy = false, c(e2);
-    } }), (s2 && Ke ? Xe : Qe)(e2, r2);
+      t3 && (e2.resolveTerminated = null, e2.terminated = true, e2.worker.terminate(), t3()), e2.busy = false, d(e2);
+    } }), _e === c$1 && (_e = typeof Worker != u$1), (i2 && _e ? Me : We)(e2, s2);
   }
 }
-class Ge extends TransformStream {
-  constructor(e2, { onstart: t2, onprogress: n2, size: i2, onend: r2 }) {
-    let a2 = 0;
+class Ce extends TransformStream {
+  constructor({ onstart: e2, onprogress: t2, size: r2, onend: n2 }) {
+    let s2 = 0;
     super({ async start() {
-      t2 && await Je(t2, i2);
-    }, async transform(e3, t3) {
-      a2 += e3.length, n2 && await Je(n2, a2, i2), t3.enqueue(e3);
+      e2 && await Re(e2, r2);
+    }, async transform(e3, n3) {
+      s2 += e3.length, t2 && await Re(t2, s2, r2), n3.enqueue(e3);
     }, async flush() {
-      e2.size = a2, r2 && await Je(r2, a2);
+      n2 && await Re(n2, s2);
     } });
   }
 }
-async function Je(e2, ...t2) {
+async function Re(e2, ...t2) {
   try {
     await e2(...t2);
-  } catch (e3) {
+  } catch {
   }
 }
-function Qe(e2, t2) {
-  return { run: () => (async function({ options: e3, readable: t3, writable: n2, onTaskFinished: i2 }, r2) {
+function We(e2, t2) {
+  return { run: () => (async function({ options: e3, readable: t3, writable: r2, onTaskFinished: n2 }, s2) {
+    let a2;
     try {
-      const i3 = new qe(e3, r2);
-      await t3.pipeThrough(i3).pipeTo(n2, { preventClose: true, preventAbort: true });
-      const { signature: a2, inputSize: s2, outputSize: o2 } = i3;
-      return { signature: a2, inputSize: s2, outputSize: o2 };
+      if (!e3.useCompressionStream) try {
+        await void 0;
+      } catch {
+        e3.useCompressionStream = true;
+      }
+      a2 = new Ae(e3, s2), await t3.pipeThrough(a2).pipeTo(r2, { preventClose: true, preventAbort: true });
+      const { signature: n3, inputSize: i2, outputSize: o2 } = a2;
+      return { signature: n3, inputSize: i2, outputSize: o2 };
+    } catch (e4) {
+      throw a2 && (e4.outputSize = a2.outputSize), e4;
     } finally {
-      i2();
+      n2();
     }
   })(e2, t2) };
 }
-function Xe(e2, t2) {
-  const { baseURL: n2, chunkSize: i2 } = t2;
+function Me(e2, t2) {
+  const { baseURI: r2, chunkSize: n2 } = t2;
+  let { wasmURI: s2 } = t2;
   if (!e2.interface) {
-    let r2;
+    let a2;
+    typeof s2 == d$1 && (s2 = s2());
     try {
-      r2 = (function(e3, t3, n3) {
-        const i3 = { type: "module" };
-        let r3, a2;
-        typeof e3 == A$1 && (e3 = e3());
-        try {
-          r3 = new URL(e3, t3);
-        } catch (t4) {
-          r3 = e3;
-        }
-        if (Ye) try {
-          a2 = new Worker(r3);
-        } catch (e4) {
-          Ye = false, a2 = new Worker(r3, i3);
-        }
-        else a2 = new Worker(r3, i3);
-        return a2.addEventListener(Pe, ((e4) => (async function({ data: e5 }, t4) {
-          const { type: n4, value: i4, messageId: r4, result: a3, error: s2 } = e5, { reader: o2, writer: l2, resolveResult: c, rejectResult: u, onTaskFinished: d } = t4;
-          try {
-            if (s2) {
-              const { message: e6, stack: t5, code: n5, name: i5 } = s2, r5 = new Error(e6);
-              Object.assign(r5, { stack: t5, code: n5, name: i5 }), f2(r5);
-            } else {
-              if (n4 == Be) {
-                const { value: e6, done: n5 } = await o2.read();
-                et({ type: Ie, value: e6, done: n5, messageId: r4 }, t4);
-              }
-              n4 == Ie && (await l2.ready, await l2.write(new Uint8Array(i4)), et({ type: "ack", messageId: r4 }, t4)), n4 == Ne && f2(null, a3);
-            }
-          } catch (s3) {
-            et({ type: Ne, messageId: r4 }, t4), f2(s3);
-          }
-          function f2(e6, t5) {
-            e6 ? u(e6) : c(t5), l2 && l2.releaseLock(), d();
-          }
-        })(e4, n3))), a2;
-      })(e2.scripts[0], n2, e2);
-    } catch (n3) {
-      return Ke = false, Qe(e2, t2);
-    }
-    Object.assign(e2, { worker: r2, interface: { run: () => (async function(e3, t3) {
-      let n3, i3;
-      const r3 = new Promise(((e4, t4) => {
-        n3 = e4, i3 = t4;
-      }));
-      Object.assign(e3, { reader: null, writer: null, resolveResult: n3, rejectResult: i3, result: r3 });
-      const { readable: a2, options: s2, scripts: o2 } = e3, { writable: l2, closed: c } = (function(e4) {
-        let t4;
-        const n4 = new Promise(((e5) => t4 = e5)), i4 = new WritableStream({ async write(t5) {
-          const n5 = e4.getWriter();
-          await n5.ready, await n5.write(t5), n5.releaseLock();
-        }, close() {
-          t4();
-        }, abort: (t5) => e4.getWriter().abort(t5) });
-        return { writable: i4, closed: n4 };
-      })(e3.writable), u = et({ type: Re, scripts: o2.slice(1), options: s2, config: t3, readable: a2, writable: l2 }, e3);
-      u || Object.assign(e3, { reader: a2.getReader(), writer: l2.getWriter() });
-      const d = await r3;
-      u || await l2.getWriter().close();
-      return await c, d;
-    })(e2, { chunkSize: i2 }) } });
+      a2 = je(e2.workerURI, r2, e2);
+    } catch {
+      return _e = false, We(e2, t2);
+    }
+    Object.assign(e2, { worker: a2, interface: { run: () => (async function(e3, t3) {
+      let r3, n3;
+      const s3 = new Promise((e4, t4) => {
+        r3 = e4, n3 = t4;
+      });
+      Object.assign(e3, { reader: null, writer: null, resolveResult: r3, rejectResult: n3, result: s3 });
+      const { readable: a3, options: i2 } = e3, { writable: o2, closed: c } = (function(e4) {
+        const { writable: t4, readable: r4 } = new TransformStream(), n4 = r4.pipeTo(e4, { preventClose: true });
+        return { writable: t4, closed: n4 };
+      })(e3.writable), l2 = Ie({ type: Se, options: i2, config: t3, readable: a3, writable: o2 }, e3);
+      l2 || Object.assign(e3, { reader: a3.getReader(), writer: o2.getWriter() });
+      const u = await s3;
+      l2 || await o2.getWriter().close();
+      return await c, u;
+    })(e2, { chunkSize: n2, wasmURI: s2, baseURI: r2 }) } });
   }
   return e2.interface;
 }
-let Ye = true, $e = true;
-function et(e2, { worker: t2, writer: n2, onTaskFinished: i2, transferStreams: r2 }) {
+function je(e2, t2, r2, n2, s2 = true) {
+  let a2, i2, o2;
+  if (Fe === c$1) {
+    const l2 = typeof e2 == d$1;
+    i2 = l2 ? e2(s2) : e2;
+    const u = i2.startsWith("data:"), f2 = i2.startsWith("blob:");
+    if (u || f2) {
+      n2 === c$1 && (n2 = false), n2 && (o2 = De);
+      try {
+        a2 = new Worker(i2, o2);
+      } catch (s3) {
+        if (f2) try {
+          URL.revokeObjectURL(i2);
+        } catch {
+        }
+        if (l2 && f2) return je(e2, t2, r2, n2, false);
+        if (n2) throw s3;
+        return je(e2, t2, r2, true, false);
+      }
+    } else {
+      n2 === c$1 && (n2 = true), n2 && (o2 = De);
+      try {
+        i2 = new URL(i2, t2);
+      } catch {
+      }
+      try {
+        a2 = new Worker(i2, o2);
+      } catch (a3) {
+        if (n2) throw a3;
+        return je(e2, t2, r2, false, s2);
+      }
+    }
+    Fe = i2, Oe = o2;
+  } else a2 = new Worker(Fe, Oe);
+  return a2.addEventListener("message", (e3) => (async function({ data: e4 }, t3) {
+    const { type: r3, value: n3, messageId: s3, result: a3, error: i3 } = e4, { reader: o3, writer: c, resolveResult: l2, rejectResult: u, onTaskFinished: d } = t3;
+    try {
+      if (i3) {
+        const { message: e5, stack: t4, code: r4, name: n4, outputSize: s4 } = i3, a4 = new Error(e5);
+        Object.assign(a4, { stack: t4, code: r4, name: n4, outputSize: s4 }), f2(a4);
+      } else {
+        if (r3 == ke) {
+          const { value: e5, done: r4 } = await o3.read();
+          Ie({ type: ze, value: e5, done: r4, messageId: s3 }, t3);
+        }
+        r3 == ze && (await c.ready, await c.write(new Uint8Array(n3)), Ie({ type: "ack", messageId: s3 }, t3)), r3 == xe && f2(null, a3);
+      }
+    } catch (i4) {
+      Ie({ type: xe, messageId: s3 }, t3), f2(i4);
+    }
+    function f2(e5, t4) {
+      e5 ? u(e5) : l2(t4), c && c.releaseLock(), d();
+    }
+  })(e3, r2)), a2;
+}
+function Ie(e2, { worker: t2, writer: r2, onTaskFinished: n2, transferStreams: s2 }) {
   try {
-    let { value: n3, readable: i3, writable: a2 } = e2;
-    const s2 = [];
-    if (n3 && (n3.byteLength < n3.buffer.byteLength ? e2.value = n3.buffer.slice(0, n3.byteLength) : e2.value = n3.buffer, s2.push(e2.value)), r2 && $e ? (i3 && s2.push(i3), a2 && s2.push(a2)) : e2.readable = e2.writable = null, s2.length) try {
-      return t2.postMessage(e2, s2), true;
-    } catch (n4) {
-      $e = false, e2.readable = e2.writable = null, t2.postMessage(e2);
+    const { value: r3, readable: n3, writable: a2 } = e2, i2 = [];
+    if (r3 && (e2.value = r3, i2.push(e2.value.buffer)), s2 && Ee ? (n3 && i2.push(n3), a2 && i2.push(a2)) : e2.readable = e2.writable = null, i2.length) try {
+      return t2.postMessage(e2, i2), true;
+    } catch {
+      Ee = false, e2.readable = e2.writable = null, t2.postMessage(e2);
     }
     else t2.postMessage(e2);
   } catch (e3) {
-    throw n2 && n2.releaseLock(), i2(), e3;
-  }
-}
-let tt = [];
-const nt = [];
-let it = 0;
-async function rt(e2, t2) {
-  const { options: n2, config: i2 } = t2, { transferStreams: r2, useWebWorkers: a2, useCompressionStream: s2, codecType: o2, compressed: l2, signed: c, encrypted: u } = n2, { workerScripts: d, maxWorkers: f2 } = i2;
-  t2.transferStreams = r2 || r2 === S;
-  const h2 = !(l2 || c || u || t2.transferStreams);
-  return t2.useWebWorkers = !h2 && (a2 || a2 === S && i2.useWebWorkers), t2.scripts = t2.useWebWorkers && d ? d[o2] : [], n2.useCompressionStream = s2 || s2 === S && i2.useCompressionStream, (await (async function() {
-    const n3 = tt.find(((e3) => !e3.busy));
-    if (n3) return at(n3), new Ze(n3, e2, t2, w);
-    if (tt.length < f2) {
-      const n4 = { indexWorker: it };
-      return it++, tt.push(n4), new Ze(n4, e2, t2, w);
-    }
-    return new Promise(((n4) => nt.push({ resolve: n4, stream: e2, workerOptions: t2 })));
+    throw r2 && r2.releaseLock(), n2(), e3;
+  }
+}
+let Be = [];
+const Pe = [];
+let Le = 0;
+async function Ve(e2, t2) {
+  const { options: r2, config: n2 } = t2, { transferStreams: s2, useWebWorkers: a2, useCompressionStream: i2, compressed: o2, signed: l2, encrypted: u } = r2, { workerURI: d, maxWorkers: f2 } = n2;
+  t2.transferStreams = s2 || s2 === c$1;
+  const h2 = !(o2 || l2 || u || t2.transferStreams);
+  return t2.useWebWorkers = !h2 && (a2 || a2 === c$1 && n2.useWebWorkers), t2.workerURI = t2.useWebWorkers && d ? d : c$1, r2.useCompressionStream = i2 || i2 === c$1 && n2.useCompressionStream, (await (async function() {
+    const r3 = Be.find((e3) => !e3.busy);
+    if (r3) return Ne(r3), new Te(r3, e2, t2, p2);
+    if (Be.length < f2) {
+      const r4 = { indexWorker: Le };
+      return Le++, Be.push(r4), new Te(r4, e2, t2, p2);
+    }
+    return new Promise((r4) => Pe.push({ resolve: r4, stream: e2, workerOptions: t2 }));
   })()).run();
-  function w(e3) {
-    if (nt.length) {
-      const [{ resolve: t3, stream: n3, workerOptions: i3 }] = nt.splice(0, 1);
-      t3(new Ze(e3, n3, i3, w));
-    } else e3.worker ? (at(e3), (function(e4, t3) {
-      const { config: n3 } = t3, { terminateWorkerTimeout: i3 } = n3;
-      Number.isFinite(i3) && i3 >= 0 && (e4.terminated ? e4.terminated = false : e4.terminateTimeout = setTimeout((async () => {
-        tt = tt.filter(((t4) => t4 != e4));
+  function p2(e3) {
+    if (Pe.length) {
+      const [{ resolve: t3, stream: r3, workerOptions: n3 }] = Pe.splice(0, 1);
+      t3(new Te(e3, r3, n3, p2));
+    } else e3.worker ? (Ne(e3), (function(e4, t3) {
+      const { config: r3 } = t3, { terminateWorkerTimeout: n3 } = r3;
+      Number.isFinite(n3) && n3 >= 0 && (e4.terminated ? e4.terminated = false : e4.terminateTimeout = setTimeout(async () => {
+        Be = Be.filter((t4) => t4 != e4);
         try {
           await e4.terminate();
-        } catch (e5) {
+        } catch {
         }
-      }), i3));
-    })(e3, t2)) : tt = tt.filter(((t3) => t3 != e3));
+      }, n3));
+    })(e3, t2)) : Be = Be.filter((t3) => t3 != e3);
   }
 }
-function at(e2) {
+function Ne(e2) {
   const { terminateTimeout: t2 } = e2;
   t2 && (clearTimeout(t2), e2.terminateTimeout = null);
 }
-const st = 65536, ot = "writable";
-class lt {
+const Ze = 65536, qe = "writable";
+class He {
   constructor() {
     this.size = 0;
   }
@@ -4181,403 +3792,461 @@ class lt {
     this.initialized = true;
   }
 }
-class ct extends lt {
+class Ke extends He {
   get readable() {
-    const e2 = this, { chunkSize: t2 = st } = e2, n2 = new ReadableStream({ start() {
+    const e2 = this, { chunkSize: t2 = Ze } = e2, r2 = new ReadableStream({ start() {
       this.chunkOffset = 0;
-    }, async pull(i2) {
-      const { offset: r2 = 0, size: a2, diskNumberStart: s2 } = n2, { chunkOffset: o2 } = this;
-      i2.enqueue(await pt(e2, r2 + o2, Math.min(t2, a2 - o2), s2)), o2 + t2 > a2 ? i2.close() : this.chunkOffset += t2;
+    }, async pull(n2) {
+      const { offset: s2 = 0, size: a2, diskNumberStart: i2 } = r2, { chunkOffset: o2 } = this, l2 = a2 === c$1 ? t2 : Math.min(t2, a2 - o2), u = await rt(e2, s2 + o2, l2, i2);
+      n2.enqueue(u), o2 + t2 > a2 || a2 === c$1 && !u.length && l2 ? n2.close() : this.chunkOffset += t2;
     } });
-    return n2;
+    return r2;
   }
 }
-class ut extends ct {
+class Ge extends Ke {
   constructor(e2) {
     super(), Object.assign(this, { blob: e2, size: e2.size });
   }
   async readUint8Array(e2, t2) {
-    const n2 = this, i2 = e2 + t2, r2 = e2 || i2 < n2.size ? n2.blob.slice(e2, i2) : n2.blob;
-    let a2 = await r2.arrayBuffer();
-    return a2.byteLength > t2 && (a2 = a2.slice(e2, i2)), new Uint8Array(a2);
+    const r2 = this, n2 = e2 + t2, s2 = e2 || n2 < r2.size ? r2.blob.slice(e2, n2) : r2.blob;
+    let a2 = await s2.arrayBuffer();
+    return a2.byteLength > t2 && (a2 = a2.slice(e2, n2)), new Uint8Array(a2);
   }
 }
-class dt extends lt {
+class Je extends He {
   constructor(e2) {
     super();
-    const t2 = new TransformStream(), n2 = [];
-    e2 && n2.push(["Content-Type", e2]), Object.defineProperty(this, ot, { get: () => t2.writable }), this.blob = new Response(t2.readable, { headers: n2 }).blob();
+    const t2 = new TransformStream(), r2 = [];
+    e2 && r2.push(["Content-Type", e2]), Object.defineProperty(this, qe, { get: () => t2.writable }), this.blob = new Response(t2.readable, { headers: r2 }).blob();
   }
   getData() {
     return this.blob;
   }
 }
-class ft extends dt {
+class Qe extends Je {
   constructor(e2) {
     super(e2), Object.assign(this, { encoding: e2, utf8: !e2 || "utf-8" == e2.toLowerCase() });
   }
   async getData() {
-    const { encoding: e2, utf8: t2 } = this, n2 = await super.getData();
-    if (n2.text && t2) return n2.text();
+    const { encoding: e2, utf8: t2 } = this, r2 = await super.getData();
+    if (r2.text && t2) return r2.text();
     {
       const t3 = new FileReader();
-      return new Promise(((i2, r2) => {
-        Object.assign(t3, { onload: ({ target: e3 }) => i2(e3.result), onerror: () => r2(t3.error) }), t3.readAsText(n2, e2);
-      }));
+      return new Promise((n2, s2) => {
+        Object.assign(t3, { onload: ({ target: e3 }) => n2(e3.result), onerror: () => s2(t3.error) }), t3.readAsText(r2, e2);
+      });
     }
   }
 }
-class ht extends ct {
+class Xe extends Ke {
   constructor(e2) {
     super(), this.readers = e2;
   }
   async init() {
     const e2 = this, { readers: t2 } = e2;
-    e2.lastDiskNumber = 0, e2.lastDiskOffset = 0, await Promise.all(t2.map((async (n2, i2) => {
-      await n2.init(), i2 != t2.length - 1 && (e2.lastDiskOffset += n2.size), e2.size += n2.size;
-    }))), super.init();
-  }
-  async readUint8Array(e2, t2, n2 = 0) {
-    const i2 = this, { readers: r2 } = this;
-    let a2, s2 = n2;
-    -1 == s2 && (s2 = r2.length - 1);
+    e2.lastDiskNumber = 0, e2.lastDiskOffset = 0, await Promise.all(t2.map(async (r2, n2) => {
+      await r2.init(), n2 != t2.length - 1 && (e2.lastDiskOffset += r2.size), e2.size += r2.size;
+    })), super.init();
+  }
+  async readUint8Array(e2, t2, r2 = 0) {
+    const n2 = this, { readers: s2 } = this;
+    let a2, i2 = r2;
+    -1 == i2 && (i2 = s2.length - 1);
     let o2 = e2;
-    for (; o2 >= r2[s2].size; ) o2 -= r2[s2].size, s2++;
-    const l2 = r2[s2], c = l2.size;
-    if (o2 + t2 <= c) a2 = await pt(l2, o2, t2);
-    else {
-      const r3 = c - o2;
-      a2 = new Uint8Array(t2), a2.set(await pt(l2, o2, r3)), a2.set(await i2.readUint8Array(e2 + r3, t2 - r3, n2), r3);
-    }
-    return i2.lastDiskNumber = Math.max(s2, i2.lastDiskNumber), a2;
+    for (; s2[i2] && o2 >= s2[i2].size; ) o2 -= s2[i2].size, i2++;
+    const c = s2[i2];
+    if (c) {
+      const s3 = c.size;
+      if (o2 + t2 <= s3) a2 = await rt(c, o2, t2);
+      else {
+        const i3 = s3 - o2;
+        a2 = new Uint8Array(t2);
+        const l2 = await rt(c, o2, i3);
+        a2.set(l2, 0);
+        const u = await n2.readUint8Array(e2 + i3, t2 - i3, r2);
+        a2.set(u, i3), l2.length + u.length < t2 && (a2 = a2.subarray(0, l2.length + u.length));
+      }
+    } else a2 = new Uint8Array();
+    return n2.lastDiskNumber = Math.max(i2, n2.lastDiskNumber), a2;
   }
 }
-class wt extends lt {
+class Ye extends He {
   constructor(e2, t2 = 4294967295) {
     super();
-    const n2 = this;
-    let i2, r2, a2;
-    Object.assign(n2, { diskNumber: 0, diskOffset: 0, size: 0, maxSize: t2, availableSize: t2 });
-    const s2 = new WritableStream({ async write(t3) {
-      const { availableSize: s3 } = n2;
-      if (a2) t3.length >= s3 ? (await o2(t3.slice(0, s3)), await l2(), n2.diskOffset += i2.size, n2.diskNumber++, a2 = null, await this.write(t3.slice(s3))) : await o2(t3);
+    const r2 = this;
+    let n2, s2, a2;
+    Object.assign(r2, { diskNumber: 0, diskOffset: 0, size: 0, maxSize: t2, availableSize: t2 });
+    const i2 = new WritableStream({ async write(t3) {
+      const { availableSize: i3 } = r2;
+      if (a2) t3.length >= i3 ? (await o2(t3.subarray(0, i3)), await c(), r2.diskOffset += n2.size, r2.diskNumber++, a2 = null, await this.write(t3.subarray(i3))) : await o2(t3);
       else {
-        const { value: s4, done: o3 } = await e2.next();
-        if (o3 && !s4) throw new Error("Writer iterator completed too soon");
-        i2 = s4, i2.size = 0, i2.maxSize && (n2.maxSize = i2.maxSize), n2.availableSize = n2.maxSize, await _t(i2), r2 = s4.writable, a2 = r2.getWriter(), await this.write(t3);
+        const { value: i4, done: o3 } = await e2.next();
+        if (o3 && !i4) throw new Error("Writer iterator completed too soon");
+        n2 = i4, n2.size = 0, n2.maxSize && (r2.maxSize = n2.maxSize), r2.availableSize = r2.maxSize, await tt(n2), s2 = i4.writable, a2 = s2.getWriter(), await this.write(t3);
       }
     }, async close() {
-      await a2.ready, await l2();
+      await a2.ready, await c();
     } });
     async function o2(e3) {
       const t3 = e3.length;
-      t3 && (await a2.ready, await a2.write(e3), i2.size += t3, n2.size += t3, n2.availableSize -= t3);
+      t3 && (await a2.ready, await a2.write(e3), n2.size += t3, r2.size += t3, r2.availableSize -= t3);
     }
-    async function l2() {
-      r2.size = i2.size, await a2.close();
+    async function c() {
+      await a2.close();
     }
-    Object.defineProperty(n2, ot, { get: () => s2 });
+    Object.defineProperty(r2, qe, { get: () => i2 });
+  }
+}
+class $e {
+  constructor(e2) {
+    return Array.isArray(e2) && (e2 = new Xe(e2)), e2 instanceof ReadableStream && (e2 = { readable: e2 }), e2;
   }
 }
-async function _t(e2, t2) {
+class et {
+  constructor(e2) {
+    return e2.writable === c$1 && typeof e2.next == d$1 && (e2 = new Ye(e2)), e2 instanceof WritableStream && (e2 = { writable: e2 }), e2.size === c$1 && (e2.size = 0), e2 instanceof Ye || Object.assign(e2, { diskNumber: 0, diskOffset: 0, availableSize: l$1, maxSize: l$1 }), e2;
+  }
+}
+async function tt(e2, t2) {
   if (!e2.init || e2.initialized) return Promise.resolve();
   await e2.init(t2);
 }
-function bt(e2) {
-  return Array.isArray(e2) && (e2 = new ht(e2)), e2 instanceof ReadableStream && (e2 = { readable: e2 }), e2;
-}
-function pt(e2, t2, n2, i2) {
-  return e2.readUint8Array(t2, n2, i2);
+function rt(e2, t2, r2, n2) {
+  return e2.readUint8Array(t2, r2, n2);
 }
-const mt = "\0☺☻♥♦♣♠•◘○◙♂♀♪♫☼►◄↕‼¶§▬↨↑↓→←∟↔▲▼ !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~⌂ÇüéâäàåçêëèïîìÄÅÉæÆôöòûùÿÖÜ¢£¥₧ƒáíóúñѪº¿⌐¬½¼¡«»░▒▓│┤╡╢╖╕╣║╗╝╜╛┐└┴┬├─┼╞╟╚╔╩╦╠═╬╧╨╤╥╙╘╒╓╫╪┘┌█▄▌▐▀αßΓπΣσµτΦΘΩδ∞φε∩≡±≥≤⌠⌡÷≈°∙·√ⁿ²■ ".split(""), gt = 256 == mt.length;
-function yt(e2, t2) {
+const nt = "\0☺☻♥♦♣♠•◘○◙♂♀♪♫☼►◄↕‼¶§▬↨↑↓→←∟↔▲▼ !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~⌂ÇüéâäàåçêëèïîìÄÅÉæÆôöòûùÿÖÜ¢£¥₧ƒáíóúñѪº¿⌐¬½¼¡«»░▒▓│┤╡╢╖╕╣║╗╝╜╛┐└┴┬├─┼╞╟╚╔╩╦╠═╬╧╨╤╥╙╘╒╓╫╪┘┌█▄▌▐▀αßΓπΣσµτΦΘΩδ∞φε∩≡±≥≤⌠⌡÷≈°∙·√ⁿ²■ ".split(""), st = 256 == nt.length;
+function at(e2, t2) {
   return t2 && "cp437" == t2.trim().toLowerCase() ? (function(e3) {
-    if (gt) {
+    if (st) {
       let t3 = "";
-      for (let n2 = 0; n2 < e3.length; n2++) t3 += mt[e3[n2]];
+      for (let r2 = 0; r2 < e3.length; r2++) t3 += nt[e3[r2]];
       return t3;
     }
     return new TextDecoder().decode(e3);
   })(e2) : new TextDecoder(t2).decode(e2);
 }
-const xt = "filename", kt = "rawFilename", vt = "comment", St = "rawComment", zt = "uncompressedSize", At = "compressedSize", Ut = "offset", Dt = "diskNumberStart", Et = "lastModDate", Tt = "rawLastModDate", Ft = "lastAccessDate", Ot = "rawLastAccessDate", Ct = "creationDate", Wt = "rawCreationDate", jt = [xt, kt, At, zt, Et, Tt, vt, St, Ft, Ct, Ut, Dt, Dt, "internalFileAttribute", "externalFileAttribute", "msDosCompatible", "zip64", "encrypted", "version", "versionMadeBy", "zipCrypto", "directory", "bitFlag", "signature", "filenameUTF8", "commentUTF8", "compressionMethod", "extraField", "rawExtraField", "extraFieldZip64", "extraFieldUnicodePath", "extraFieldUnicodeComment", "extraFieldAES", "extraFieldNTFS", "extraFieldExtendedTimestamp"];
-class Mt {
+const it = "filename", ot = "rawFilename", ct = "comment", lt = "rawComment", ut = "uncompressedSize", dt = "compressedSize", ft = "offset", ht = "diskNumberStart", pt = "lastModDate", wt = "rawLastModDate", gt = "lastAccessDate", mt = "rawLastAccessDate", yt = "creationDate", bt = "rawCreationDate", St = [it, ot, ut, dt, pt, wt, ct, lt, gt, yt, bt, ft, ht, "internalFileAttributes", "externalFileAttributes", "msdosAttributesRaw", "msdosAttributes", "msDosCompatible", "zip64", "encrypted", "version", "versionMadeBy", "zipCrypto", "directory", "executable", "compressionMethod", "signature", "extraField", "extraFieldUnix", "extraFieldInfoZip", "uid", "gid", "unixMode", "setuid", "setgid", "sticky", "bitFlag", "filenameUTF8", "commentUTF8", "rawExtraField", "extraFieldZip64", "extraFieldUnicodePath", "extraFieldUnicodeComment", "extraFieldAES", "extraFieldNTFS", "extraFieldExtendedTimestamp"];
+class kt {
   constructor(e2) {
-    jt.forEach(((t2) => this[t2] = e2[t2]));
+    St.forEach((t2) => this[t2] = e2[t2]);
   }
 }
-const Lt = "File format is not recognized", Pt = "Zip64 extra field not found", Rt = "Compression method not supported", Bt = "Split zip file", It = "utf-8", Nt = "cp437", Vt = [[zt, g$1], [At, g$1], [Ut, g$1], [Dt, y$1]], qt = { [y$1]: { getValue: tn, bytes: 4 }, [g$1]: { getValue: nn, bytes: 8 } };
-class Ht {
+const zt = "File format is not recognized", xt = "Zip64 extra field not found", Ut = "Compression method not supported", At = "Split zip file", vt = "Overlapping entry found", Dt = "utf-8", _t = "cp437", Ft = [[ut, e$1], [dt, e$1], [ft, e$1], [ht, t$1]], Ot = { [t$1]: { getValue: Nt, bytes: 4 }, [e$1]: { getValue: Zt, bytes: 8 } };
+class Et {
   constructor(e2, t2 = {}) {
-    Object.assign(this, { reader: bt(e2), options: t2, config: T$1 });
-  }
-  async *getEntriesGenerator(e2 = {}) {
-    const t2 = this;
-    let { reader: n2 } = t2;
-    const { config: i2 } = t2;
-    if (await _t(n2), n2.size !== S && n2.readUint8Array || (n2 = new ut(await new Response(n2.readable).blob()), await _t(n2)), n2.size < v$1) throw new Error(Lt);
-    n2.chunkSize = (function(e3) {
-      return Math.max(e3.chunkSize, 64);
-    })(i2);
-    const r2 = await (async function(e3, t3, n3, i3, r3) {
-      const a3 = new Uint8Array(4);
-      !(function(e4, t4, n4) {
-        e4.setUint32(t4, n4, true);
-      })(rn(a3), 0, t3);
-      const s3 = i3 + r3;
-      return await o3(i3) || await o3(Math.min(s3, n3));
-      async function o3(t4) {
-        const r4 = n3 - t4, s4 = await pt(e3, r4, t4);
-        for (let e4 = s4.length - i3; e4 >= 0; e4--) if (s4[e4] == a3[0] && s4[e4 + 1] == a3[1] && s4[e4 + 2] == a3[2] && s4[e4 + 3] == a3[3]) return { offset: r4 + e4, buffer: s4.slice(e4, e4 + i3).buffer };
+    Object.assign(this, { reader: new $e(e2), options: t2, config: p$1, readRanges: [] });
+  }
+  async *getEntriesGenerator(n2 = {}) {
+    const l2 = this;
+    let { reader: u } = l2;
+    const { config: d } = l2;
+    if (await tt(u), u.size !== c$1 && u.readUint8Array || (u = new Ge(await new Response(u.readable).blob()), await tt(u)), u.size < i$1) throw new Error(zt);
+    u.chunkSize = (function(e2) {
+      return Math.max(e2.chunkSize, 64);
+    })(d);
+    const f2 = await (async function(e2, t2, r2, n3, s2) {
+      const a2 = new Uint8Array(4);
+      !(function(e3, t3, r3) {
+        e3.setUint32(t3, r3, true);
+      })(qt(a2), 0, t2);
+      const i2 = n3 + s2;
+      return await o2(n3) || await o2(Math.min(i2, r2));
+      async function o2(t3) {
+        const s3 = r2 - t3, i3 = await rt(e2, s3, t3);
+        for (let e3 = i3.length - n3; e3 >= 0; e3--) if (i3[e3] == a2[0] && i3[e3 + 1] == a2[1] && i3[e3 + 2] == a2[2] && i3[e3 + 3] == a2[3]) return { offset: s3 + e3, buffer: i3.slice(e3, e3 + n3).buffer };
       }
-    })(n2, 101010256, n2.size, v$1, 1048560);
-    if (!r2) {
-      throw 134695760 == tn(rn(await pt(n2, 0, 4))) ? new Error(Bt) : new Error("End of central directory not found");
-    }
-    const a2 = rn(r2);
-    let s2 = tn(a2, 12), o2 = tn(a2, 16);
-    const l2 = r2.offset, c = en(a2, 20), u = l2 + v$1 + c;
-    let d = en(a2, 4);
-    const f2 = n2.lastDiskNumber || 0;
-    let h2 = en(a2, 6), w = en(a2, 8), _2 = 0, b2 = 0;
-    if (o2 == g$1 || s2 == g$1 || w == y$1 || h2 == y$1) {
-      const e3 = rn(await pt(n2, r2.offset - 20, 20));
-      if (117853008 == tn(e3, 0)) {
-        o2 = nn(e3, 8);
-        let t3 = await pt(n2, o2, 56, -1), i3 = rn(t3);
-        const a3 = r2.offset - 20 - 56;
-        if (tn(i3, 0) != k$1 && o2 != a3) {
-          const e4 = o2;
-          o2 = a3, _2 = o2 - e4, t3 = await pt(n2, o2, 56, -1), i3 = rn(t3);
+    })(u, 101010256, u.size, i$1, 1048560);
+    if (!f2) {
+      throw Nt(qt(await rt(u, 0, 4))) == r$1 ? new Error(At) : new Error("End of central directory not found");
+    }
+    const h2 = qt(f2);
+    let p2 = Nt(h2, 12), w = Nt(h2, 16);
+    const g2 = f2.offset, m2 = Vt(h2, 20), y3 = g2 + i$1 + m2;
+    let b3 = Vt(h2, 4);
+    const S2 = u.lastDiskNumber || 0;
+    let k2 = Vt(h2, 6), z2 = Vt(h2, 8), x2 = 0, U2 = 0;
+    if (w == e$1 || p2 == e$1 || z2 == t$1 || k2 == t$1) {
+      const r2 = qt(await rt(u, f2.offset - 20, 20));
+      if (117853008 == Nt(r2, 0)) {
+        w = Zt(r2, 8);
+        let n3 = await rt(u, w, 56, -1), s2 = qt(n3);
+        const i2 = f2.offset - 20 - 56;
+        if (Nt(s2, 0) != a$1 && w != i2) {
+          const e2 = w;
+          w = i2, w > e2 && (x2 = w - e2), n3 = await rt(u, w, 56, -1), s2 = qt(n3);
         }
-        if (tn(i3, 0) != k$1) throw new Error("End of Zip64 central directory locator not found");
-        d == y$1 && (d = tn(i3, 16)), h2 == y$1 && (h2 = tn(i3, 20)), w == y$1 && (w = nn(i3, 32)), s2 == g$1 && (s2 = nn(i3, 40)), o2 -= s2;
+        if (Nt(s2, 0) != a$1) throw new Error("End of Zip64 central directory locator not found");
+        b3 == t$1 && (b3 = Nt(s2, 16)), k2 == t$1 && (k2 = Nt(s2, 20)), z2 == t$1 && (z2 = Zt(s2, 32)), p2 == e$1 && (p2 = Zt(s2, 40)), w -= p2;
       }
     }
-    if (o2 >= n2.size && (_2 = n2.size - o2 - s2 - v$1, o2 = n2.size - s2 - v$1), f2 != d) throw new Error(Bt);
-    if (o2 < 0) throw new Error(Lt);
-    let p2 = 0, m2 = await pt(n2, o2, s2, h2), z2 = rn(m2);
-    if (s2) {
-      const e3 = r2.offset - s2;
-      if (tn(z2, p2) != x$1 && o2 != e3) {
-        const t3 = o2;
-        o2 = e3, _2 += o2 - t3, m2 = await pt(n2, o2, s2, h2), z2 = rn(m2);
+    if (w >= u.size && (x2 = u.size - w - p2 - i$1, w = u.size - p2 - i$1), S2 != b3) throw new Error(At);
+    if (w < 0) throw new Error(zt);
+    let A2 = 0, v2 = await rt(u, w, p2, k2), D2 = qt(v2);
+    if (p2) {
+      const e2 = f2.offset - p2;
+      if (Nt(D2, A2) != s$1 && w != e2) {
+        const t2 = w;
+        w = e2, w > t2 && (x2 += w - t2), v2 = await rt(u, w, p2, k2), D2 = qt(v2);
       }
     }
-    const A2 = r2.offset - o2 - (n2.lastDiskOffset || 0);
-    if (s2 != A2 && A2 >= 0 && (s2 = A2, m2 = await pt(n2, o2, s2, h2), z2 = rn(m2)), o2 < 0 || o2 >= n2.size) throw new Error(Lt);
-    const U3 = Qt(t2, e2, "filenameEncoding"), D2 = Qt(t2, e2, "commentEncoding");
-    for (let r3 = 0; r3 < w; r3++) {
-      const a3 = new Kt(n2, i2, t2.options);
-      if (tn(z2, p2) != x$1) throw new Error("Central directory header not found");
-      Zt(a3, z2, p2 + 6);
-      const s3 = Boolean(a3.bitFlag.languageEncodingFlag), o3 = p2 + 46, l3 = o3 + a3.filenameLength, c2 = l3 + a3.extraFieldLength, u2 = en(z2, p2 + 4), d2 = true, f3 = m2.subarray(o3, l3), h3 = en(z2, p2 + 32), g2 = c2 + h3, y2 = m2.subarray(c2, g2), k2 = s3, v2 = s3, A3 = !(16 & ~$t(z2, p2 + 38)), E3 = tn(z2, p2 + 42) + _2;
-      Object.assign(a3, { versionMadeBy: u2, msDosCompatible: d2, compressedSize: 0, uncompressedSize: 0, commentLength: h3, directory: A3, offset: E3, diskNumberStart: en(z2, p2 + 34), internalFileAttribute: en(z2, p2 + 36), externalFileAttribute: tn(z2, p2 + 38), rawFilename: f3, filenameUTF8: k2, commentUTF8: v2, rawExtraField: m2.subarray(l3, c2) });
-      const T3 = Qt(t2, e2, "decodeText") || yt, F2 = k2 ? It : U3 || Nt, O2 = v2 ? It : D2 || Nt;
-      let C2 = T3(f3, F2);
-      C2 === S && (C2 = yt(f3, F2));
-      let W2 = T3(y2, O2);
-      W2 === S && (W2 = yt(y2, O2)), Object.assign(a3, { rawComment: y2, filename: C2, comment: W2, directory: A3 || C2.endsWith("/") }), b2 = Math.max(E3, b2), await Gt(a3, a3, z2, p2 + 6), a3.zipCrypto = a3.encrypted && !a3.extraFieldAES;
-      const j2 = new Mt(a3);
-      j2.getData = (e3, t3) => a3.getData(e3, j2, t3), p2 = g2;
-      const { onprogress: M2 } = e2;
-      if (M2) try {
-        await M2(r3 + 1, w, new Mt(a3));
-      } catch (e3) {
+    const _2 = f2.offset - w - (u.lastDiskOffset || 0);
+    if (p2 != _2 && _2 >= 0 && (p2 = _2, v2 = await rt(u, w, p2, k2), D2 = qt(v2)), w < 0 || w >= u.size) throw new Error(zt);
+    const F2 = It(l2, n2, "filenameEncoding"), O2 = It(l2, n2, "commentEncoding");
+    for (let e2 = 0; e2 < z2; e2++) {
+      const r2 = new Tt(u, d, l2.options);
+      if (Nt(D2, A2) != s$1) throw new Error("Central directory header not found");
+      Ct(r2, D2, A2 + 6);
+      const a2 = Boolean(r2.bitFlag.languageEncodingFlag), i2 = A2 + 46, f3 = i2 + r2.filenameLength, h3 = f3 + r2.extraFieldLength, p3 = Vt(D2, A2 + 4), w2 = !(p3 >> 8), g3 = p3 >> 8 == 3, m3 = v2.subarray(i2, f3), y4 = Vt(D2, A2 + 32), b4 = h3 + y4, S3 = v2.subarray(h3, b4), k3 = a2, _3 = a2, E3 = Nt(D2, A2 + 38), T3 = 255 & E3, C2 = { readOnly: Boolean(1 & T3), hidden: Boolean(2 & T3), system: Boolean(4 & T3), directory: Boolean(16 & T3), archive: Boolean(32 & T3) }, R2 = Nt(D2, A2 + 42) + x2, W2 = It(l2, n2, "decodeText") || at, M2 = k3 ? Dt : F2 || _t, j2 = _3 ? Dt : O2 || _t;
+      let I2 = W2(m3, M2);
+      I2 === c$1 && (I2 = at(m3, M2));
+      let B2 = W2(S3, j2);
+      B2 === c$1 && (B2 = at(S3, j2)), Object.assign(r2, { versionMadeBy: p3, msDosCompatible: w2, compressedSize: 0, uncompressedSize: 0, commentLength: y4, offset: R2, diskNumberStart: Vt(D2, A2 + 34), internalFileAttributes: Vt(D2, A2 + 36), externalFileAttributes: E3, msdosAttributesRaw: T3, msdosAttributes: C2, rawFilename: m3, filenameUTF8: k3, commentUTF8: _3, rawExtraField: v2.subarray(f3, h3), rawComment: S3, filename: I2, comment: B2 }), U2 = Math.max(R2, U2), Rt(r2, r2, D2, A2 + 6);
+      const P2 = r2.externalFileAttributes >> 16 & t$1;
+      r2.unixMode === c$1 && 16877 & P2 && (r2.unixMode = P2);
+      const L2 = Boolean(2048 & r2.unixMode), V2 = Boolean(1024 & r2.unixMode), N2 = Boolean(512 & r2.unixMode), Z2 = r2.unixMode !== c$1 ? !!(73 & r2.unixMode) : g3 && !!(73 & P2), q2 = r2.unixMode !== c$1 && (61440 & r2.unixMode) == o$1, H2 = (61440 & P2) == o$1;
+      Object.assign(r2, { setuid: L2, setgid: V2, sticky: N2, unixExternalUpper: P2, internalFileAttribute: r2.internalFileAttributes, externalFileAttribute: r2.externalFileAttributes, executable: Z2, directory: q2 || H2 || w2 && C2.directory || I2.endsWith("/") && !r2.uncompressedSize, zipCrypto: r2.encrypted && !r2.extraFieldAES });
+      const K2 = new kt(r2);
+      K2.getData = (e3, t2) => r2.getData(e3, K2, l2.readRanges, t2), K2.arrayBuffer = async (e3) => {
+        const t2 = new TransformStream(), [n3] = await Promise.all([new Response(t2.readable).arrayBuffer(), r2.getData(t2, K2, l2.readRanges, e3)]);
+        return n3;
+      }, A2 = b4;
+      const { onprogress: G2 } = n2;
+      if (G2) try {
+        await G2(e2 + 1, z2, new kt(r2));
+      } catch {
       }
-      yield j2;
+      yield K2;
     }
-    const E2 = Qt(t2, e2, "extractPrependedData"), T2 = Qt(t2, e2, "extractAppendedData");
-    return E2 && (t2.prependedData = b2 > 0 ? await pt(n2, 0, b2) : new Uint8Array()), t2.comment = c ? await pt(n2, l2 + v$1, c) : new Uint8Array(), T2 && (t2.appendedData = u < n2.size ? await pt(n2, u, n2.size - u) : new Uint8Array()), true;
+    const E2 = It(l2, n2, "extractPrependedData"), T2 = It(l2, n2, "extractAppendedData");
+    return E2 && (l2.prependedData = U2 > 0 ? await rt(u, 0, U2) : new Uint8Array()), l2.comment = m2 ? await rt(u, g2 + i$1, m2) : new Uint8Array(), T2 && (l2.appendedData = y3 < u.size ? await rt(u, y3, u.size - y3) : new Uint8Array()), true;
   }
   async getEntries(e2 = {}) {
     const t2 = [];
-    for await (const n2 of this.getEntriesGenerator(e2)) t2.push(n2);
+    for await (const r2 of this.getEntriesGenerator(e2)) t2.push(r2);
     return t2;
   }
   async close() {
   }
 }
-class Kt {
-  constructor(e2, t2, n2) {
-    Object.assign(this, { reader: e2, config: t2, options: n2 });
-  }
-  async getData(e2, t2, n2 = {}) {
-    const i2 = this, { reader: r2, offset: a2, diskNumberStart: s2, extraFieldAES: o2, compressionMethod: l2, config: c, bitFlag: u, signature: d, rawLastModDate: f2, uncompressedSize: h2, compressedSize: w } = i2, _2 = t2.localDirectory = {}, b2 = rn(await pt(r2, a2, 30, s2));
-    let p2 = Qt(i2, n2, "password"), m2 = Qt(i2, n2, "rawPassword");
-    const g2 = Qt(i2, n2, "passThrough");
-    if (p2 = p2 && p2.length && p2, m2 = m2 && m2.length && m2, o2 && 99 != o2.originalCompressionMethod) throw new Error(Rt);
-    if (0 != l2 && 8 != l2 && !g2) throw new Error(Rt);
-    if (67324752 != tn(b2, 0)) throw new Error("Local file header not found");
-    Zt(_2, b2, 4), _2.rawExtraField = _2.extraFieldLength ? await pt(r2, a2 + 30 + _2.filenameLength, _2.extraFieldLength, s2) : new Uint8Array(), await Gt(i2, _2, b2, 4, true), Object.assign(t2, { lastAccessDate: _2.lastAccessDate, creationDate: _2.creationDate });
-    const y2 = i2.encrypted && _2.encrypted && !g2, x2 = y2 && !o2;
-    if (g2 || (t2.zipCrypto = x2), y2) {
-      if (!x2 && o2.strength === S) throw new Error("Encryption method not supported");
-      if (!p2 && !m2) throw new Error("File contains encrypted entry");
-    }
-    const k2 = a2 + 30 + _2.filenameLength + _2.extraFieldLength, v2 = w, z2 = r2.readable;
-    Object.assign(z2, { diskNumberStart: s2, offset: k2, size: v2 });
-    const U3 = Qt(i2, n2, "signal"), D2 = Qt(i2, n2, "checkPasswordOnly");
-    D2 && (e2 = new WritableStream()), e2 = (function(e3) {
-      e3.writable === S && typeof e3.next == A$1 && (e3 = new wt(e3)), e3 instanceof WritableStream && (e3 = { writable: e3 });
-      const { writable: t3 } = e3;
-      return t3.size === S && (t3.size = 0), e3 instanceof wt || Object.assign(e3, { diskNumber: 0, diskOffset: 0, availableSize: 1 / 0, maxSize: 1 / 0 }), e3;
-    })(e2), await _t(e2, g2 ? w : h2);
-    const { writable: E2 } = e2, { onstart: T2, onprogress: F2, onend: O2 } = n2, C2 = { options: { codecType: Ve, password: p2, rawPassword: m2, zipCrypto: x2, encryptionStrength: o2 && o2.strength, signed: Qt(i2, n2, "checkSignature") && !g2, passwordVerification: x2 && (u.dataDescriptor ? f2 >>> 8 & 255 : d >>> 24 & 255), signature: d, compressed: 0 != l2 && !g2, encrypted: i2.encrypted && !g2, useWebWorkers: Qt(i2, n2, "useWebWorkers"), useCompressionStream: Qt(i2, n2, "useCompressionStream"), transferStreams: Qt(i2, n2, "transferStreams"), checkPasswordOnly: D2 }, config: c, streamOptions: { signal: U3, size: v2, onstart: T2, onprogress: F2, onend: O2 } };
-    let W2 = 0;
+class Tt {
+  constructor(e2, t2, r2) {
+    Object.assign(this, { reader: e2, config: t2, options: r2 });
+  }
+  async getData(e2, t2, r2, s2 = {}) {
+    const a2 = this, { reader: i2, offset: o2, diskNumberStart: l2, extraFieldAES: u, extraFieldZip64: d, compressionMethod: f2, config: h2, bitFlag: p2, signature: w, rawLastModDate: g2, uncompressedSize: m2, compressedSize: y3 } = a2, { dataDescriptor: b3 } = p2, S2 = t2.localDirectory = {}, k2 = qt(await rt(i2, o2, 30, l2));
+    let z2 = It(a2, s2, "password"), x2 = It(a2, s2, "rawPassword");
+    const U2 = It(a2, s2, "passThrough");
+    if (z2 = z2 && z2.length && z2, x2 = x2 && x2.length && x2, u && 99 != u.originalCompressionMethod) throw new Error(Ut);
+    if (0 != f2 && 8 != f2 && 9 != f2 && !U2) throw new Error(Ut);
+    if (67324752 != Nt(k2, 0)) throw new Error("Local file header not found");
+    Ct(S2, k2, 4);
+    const { extraFieldLength: A2, filenameLength: v2, lastAccessDate: D2, creationDate: _2 } = S2;
+    S2.rawExtraField = A2 ? await rt(i2, o2 + 30 + v2, A2, l2) : new Uint8Array(), Rt(a2, S2, k2, 4, true), Object.assign(t2, { lastAccessDate: D2, creationDate: _2 });
+    const F2 = a2.encrypted && S2.encrypted && !U2, E2 = F2 && !u;
+    if (U2 || (t2.zipCrypto = E2), F2) {
+      if (!E2 && u.strength === c$1) throw new Error("Encryption method not supported");
+      if (!z2 && !x2) throw new Error("File contains encrypted entry");
+    }
+    const T2 = o2 + 30 + v2 + A2, C2 = y3, R2 = i2.readable;
+    Object.assign(R2, { diskNumberStart: l2, offset: T2, size: C2 });
+    const W2 = It(a2, s2, "signal"), M2 = It(a2, s2, "checkPasswordOnly");
+    let j2 = It(a2, s2, "checkOverlappingEntry");
+    const I2 = It(a2, s2, "checkOverlappingEntryOnly");
+    I2 && (j2 = true);
+    const { onstart: B2, onprogress: P2, onend: L2 } = s2, V2 = 9 == f2;
+    let N2 = It(a2, s2, "useCompressionStream");
+    V2 && (N2 = false);
+    const Z2 = { options: { codecType: Ue, password: z2, rawPassword: x2, zipCrypto: E2, encryptionStrength: u && u.strength, signed: It(a2, s2, "checkSignature") && !U2, passwordVerification: E2 && (b3 ? g2 >>> 8 & 255 : w >>> 24 & 255), outputSize: U2 ? y3 : m2, signature: w, compressed: 0 != f2 && !U2, encrypted: a2.encrypted && !U2, useWebWorkers: It(a2, s2, "useWebWorkers"), useCompressionStream: N2, transferStreams: It(a2, s2, "transferStreams"), deflate64: V2, checkPasswordOnly: M2 }, config: h2, streamOptions: { signal: W2, size: C2, onstart: B2, onprogress: P2, onend: L2 } };
+    let q2;
+    j2 && await (async function({ reader: e3, fileEntry: t3, offset: r3, diskNumberStart: s3, signature: a3, compressedSize: i3, uncompressedSize: o3, dataOffset: c, dataDescriptor: l3, extraFieldZip64: u2, readRanges: d2 }) {
+      let f3 = 0;
+      if (s3) for (let t4 = 0; t4 < s3; t4++) {
+        f3 += e3.readers[t4].size;
+      }
+      let h3 = 0;
+      l3 && (h3 = u2 ? 20 : 12);
+      if (h3) {
+        const r4 = await rt(e3, c + i3, h3 + 4, s3);
+        if (Nt(qt(r4), 0) == n$1) {
+          const e4 = Nt(qt(r4), 4);
+          let n2, s4;
+          u2 ? (n2 = Zt(qt(r4), 8), s4 = Zt(qt(r4), 16)) : (n2 = Nt(qt(r4), 8), s4 = Nt(qt(r4), 12));
+          (t3.encrypted && !t3.zipCrypto || e4 == a3) && n2 == i3 && s4 == o3 && (h3 += 4);
+        }
+      }
+      const p3 = { start: f3 + r3, end: f3 + c + i3 + h3, fileEntry: t3 };
+      for (const e4 of d2) if (e4.fileEntry != t3 && p3.start >= e4.start && p3.start < e4.end) {
+        const t4 = new Error(vt);
+        throw t4.overlappingEntry = e4.fileEntry, t4;
+      }
+      d2.push(p3);
+    })({ reader: i2, fileEntry: t2, offset: o2, diskNumberStart: l2, signature: w, compressedSize: y3, uncompressedSize: m2, dataOffset: T2, dataDescriptor: b3 || S2.bitFlag.dataDescriptor, extraFieldZip64: d || S2.extraFieldZip64, readRanges: r2 });
     try {
-      ({ outputSize: W2 } = await rt({ readable: z2, writable: E2 }, C2));
-    } catch (e3) {
-      if (!D2 || e3.message != K) throw e3;
+      if (!I2) {
+        M2 && (e2 = new WritableStream()), e2 = new et(e2), await tt(e2, U2 ? y3 : m2), { writable: q2 } = e2;
+        const { outputSize: t3 } = await Ve({ readable: R2, writable: q2 }, Z2);
+        if (e2.size += t3, t3 != (U2 ? y3 : m2)) throw new Error(pe);
+      }
+    } catch (t3) {
+      if (t3.outputSize !== c$1 && (e2.size += t3.outputSize), !M2 || t3.message != O) throw t3;
     } finally {
-      const e3 = Qt(i2, n2, "preventClose");
-      E2.size += W2, e3 || E2.locked || await E2.getWriter().close();
+      It(a2, s2, "preventClose") || !q2 || q2.locked || await q2.getWriter().close();
     }
-    return D2 ? S : e2.getData ? e2.getData() : E2;
+    return M2 || I2 ? c$1 : e2.getData ? e2.getData() : q2;
   }
 }
-function Zt(e2, t2, n2) {
-  const i2 = e2.rawBitFlag = en(t2, n2 + 2), r2 = !(1 & ~i2), a2 = tn(t2, n2 + 6);
-  Object.assign(e2, { encrypted: r2, version: en(t2, n2), bitFlag: { level: (6 & i2) >> 1, dataDescriptor: !(8 & ~i2), languageEncodingFlag: !(2048 & ~i2) }, rawLastModDate: a2, lastModDate: Xt(a2), filenameLength: en(t2, n2 + 22), extraFieldLength: en(t2, n2 + 24) });
+function Ct(e2, t2, r2) {
+  const n2 = e2.rawBitFlag = Vt(t2, r2 + 2), s2 = !(1 & ~n2), a2 = Nt(t2, r2 + 6);
+  Object.assign(e2, { encrypted: s2, version: Vt(t2, r2), bitFlag: { level: (6 & n2) >> 1, dataDescriptor: !(8 & ~n2), languageEncodingFlag: !(2048 & ~n2) }, rawLastModDate: a2, lastModDate: Bt(a2), filenameLength: Vt(t2, r2 + 22), extraFieldLength: Vt(t2, r2 + 24) });
 }
-async function Gt(e2, t2, n2, i2, r2) {
-  const { rawExtraField: a2 } = t2, s2 = t2.extraField = /* @__PURE__ */ new Map(), o2 = rn(new Uint8Array(a2));
-  let l2 = 0;
+function Rt(e2, t2, r2, n2, s2) {
+  const { rawExtraField: a2 } = t2, i2 = t2.extraField = /* @__PURE__ */ new Map(), o2 = qt(new Uint8Array(a2));
+  let c = 0;
   try {
-    for (; l2 < a2.length; ) {
-      const e3 = en(o2, l2), t3 = en(o2, l2 + 2);
-      s2.set(e3, { type: e3, data: a2.slice(l2 + 4, l2 + 4 + t3) }), l2 += 4 + t3;
+    for (; c < a2.length; ) {
+      const e3 = Vt(o2, c), t3 = Vt(o2, c + 2);
+      i2.set(e3, { type: e3, data: a2.slice(c + 4, c + 4 + t3) }), c += 4 + t3;
     }
-  } catch (e3) {
+  } catch {
   }
-  const c = en(n2, i2 + 4);
-  Object.assign(t2, { signature: tn(n2, i2 + 10), uncompressedSize: tn(n2, i2 + 18), compressedSize: tn(n2, i2 + 14) });
-  const u = s2.get(1);
+  const l2 = Vt(r2, n2 + 4);
+  Object.assign(t2, { signature: Nt(r2, n2 + 10), compressedSize: Nt(r2, n2 + 14), uncompressedSize: Nt(r2, n2 + 18) });
+  const u = i2.get(1);
   u && (!(function(e3, t3) {
     t3.zip64 = true;
-    const n3 = rn(e3.data), i3 = Vt.filter((([e4, n4]) => t3[e4] == n4));
-    for (let r3 = 0, a3 = 0; r3 < i3.length; r3++) {
-      const [s3, o3] = i3[r3];
-      if (t3[s3] == o3) {
-        const i4 = qt[o3];
-        t3[s3] = e3[s3] = i4.getValue(n3, a3), a3 += i4.bytes;
-      } else if (e3[s3]) throw new Error(Pt);
+    const r3 = qt(e3.data), n3 = Ft.filter(([e4, r4]) => t3[e4] == r4);
+    for (let s3 = 0, a3 = 0; s3 < n3.length; s3++) {
+      const [i3, o3] = n3[s3];
+      if (t3[i3] == o3) {
+        const n4 = Ot[o3];
+        t3[i3] = e3[i3] = n4.getValue(r3, a3), a3 += n4.bytes;
+      } else if (e3[i3]) throw new Error(xt);
     }
   })(u, t2), t2.extraFieldZip64 = u);
-  const d = s2.get(28789);
-  d && (await Jt(d, xt, kt, t2, e2), t2.extraFieldUnicodePath = d);
-  const f2 = s2.get(25461);
-  f2 && (await Jt(f2, vt, St, t2, e2), t2.extraFieldUnicodeComment = f2);
-  const h2 = s2.get(39169);
-  h2 ? (!(function(e3, t3, n3) {
-    const i3 = rn(e3.data), r3 = $t(i3, 4);
-    Object.assign(e3, { vendorVersion: $t(i3, 0), vendorId: $t(i3, 2), strength: r3, originalCompressionMethod: n3, compressionMethod: en(i3, 5) }), t3.compressionMethod = e3.compressionMethod;
-  })(h2, t2, c), t2.extraFieldAES = h2) : t2.compressionMethod = c;
-  const w = s2.get(10);
-  w && (!(function(e3, t3) {
-    const n3 = rn(e3.data);
-    let i3, r3 = 4;
+  const d = i2.get(28789);
+  d && (Wt(d, it, ot, t2, e2), t2.extraFieldUnicodePath = d);
+  const f2 = i2.get(25461);
+  f2 && (Wt(f2, ct, lt, t2, e2), t2.extraFieldUnicodeComment = f2);
+  const h2 = i2.get(39169);
+  h2 ? (!(function(e3, t3, r3) {
+    const n3 = qt(e3.data), s3 = Lt(n3, 4);
+    Object.assign(e3, { vendorVersion: Lt(n3, 0), vendorId: Lt(n3, 2), strength: s3, originalCompressionMethod: r3, compressionMethod: Vt(n3, 5) }), t3.compressionMethod = e3.compressionMethod;
+  })(h2, t2, l2), t2.extraFieldAES = h2) : t2.compressionMethod = l2;
+  const p2 = i2.get(10);
+  p2 && (!(function(e3, t3) {
+    const r3 = qt(e3.data);
+    let n3, s3 = 4;
     try {
-      for (; r3 < e3.data.length && !i3; ) {
-        const t4 = en(n3, r3), a3 = en(n3, r3 + 2);
-        1 == t4 && (i3 = e3.data.slice(r3 + 4, r3 + 4 + a3)), r3 += 4 + a3;
+      for (; s3 < e3.data.length && !n3; ) {
+        const t4 = Vt(r3, s3), a3 = Vt(r3, s3 + 2);
+        1 == t4 && (n3 = e3.data.slice(s3 + 4, s3 + 4 + a3)), s3 += 4 + a3;
       }
-    } catch (e4) {
+    } catch {
     }
     try {
-      if (i3 && 24 == i3.length) {
-        const n4 = rn(i3), r4 = n4.getBigUint64(0, true), a3 = n4.getBigUint64(8, true), s3 = n4.getBigUint64(16, true);
-        Object.assign(e3, { rawLastModDate: r4, rawLastAccessDate: a3, rawCreationDate: s3 });
-        const o3 = Yt(r4), l3 = Yt(a3), c2 = { lastModDate: o3, lastAccessDate: l3, creationDate: Yt(s3) };
-        Object.assign(e3, c2), Object.assign(t3, c2);
+      if (n3 && 24 == n3.length) {
+        const r4 = qt(n3), s4 = r4.getBigUint64(0, true), a3 = r4.getBigUint64(8, true), i3 = r4.getBigUint64(16, true);
+        Object.assign(e3, { rawLastModDate: s4, rawLastAccessDate: a3, rawCreationDate: i3 });
+        const o3 = Pt(s4), c2 = Pt(a3), l3 = { lastModDate: o3, lastAccessDate: c2, creationDate: Pt(i3) };
+        Object.assign(e3, l3), Object.assign(t3, l3);
       }
-    } catch (e4) {
+    } catch {
     }
-  })(w, t2), t2.extraFieldNTFS = w);
-  const _2 = s2.get(21589);
-  _2 && (!(function(e3, t3, n3) {
-    const i3 = rn(e3.data), r3 = $t(i3, 0), a3 = [], s3 = [];
-    n3 ? (1 & ~r3 || (a3.push(Et), s3.push(Tt)), 2 & ~r3 || (a3.push(Ft), s3.push(Ot)), 4 & ~r3 || (a3.push(Ct), s3.push(Wt))) : e3.data.length >= 5 && (a3.push(Et), s3.push(Tt));
+  })(p2, t2), t2.extraFieldNTFS = p2);
+  const w = i2.get(30805);
+  if (w) Mt(w, t2, false), t2.extraFieldUnix = w;
+  else {
+    const e3 = i2.get(30837);
+    e3 && (Mt(e3, t2, true), t2.extraFieldInfoZip = e3);
+  }
+  const g2 = i2.get(21589);
+  g2 && (!(function(e3, t3, r3) {
+    const n3 = qt(e3.data), s3 = Lt(n3, 0), a3 = [], i3 = [];
+    r3 ? (1 & ~s3 || (a3.push(pt), i3.push(wt)), 2 & ~s3 || (a3.push(gt), i3.push(mt)), 4 & ~s3 || (a3.push(yt), i3.push(bt))) : e3.data.length >= 5 && (a3.push(pt), i3.push(wt));
     let o3 = 1;
-    a3.forEach(((n4, r4) => {
+    a3.forEach((r4, s4) => {
       if (e3.data.length >= o3 + 4) {
-        const a4 = tn(i3, o3);
-        t3[n4] = e3[n4] = new Date(1e3 * a4);
-        const l3 = s3[r4];
-        e3[l3] = a4;
+        const a4 = Nt(n3, o3);
+        t3[r4] = e3[r4] = new Date(1e3 * a4);
+        const c2 = i3[s4];
+        e3[c2] = a4;
       }
       o3 += 4;
-    }));
-  })(_2, t2, r2), t2.extraFieldExtendedTimestamp = _2);
-  const b2 = s2.get(6534);
-  b2 && (t2.extraFieldUSDZ = b2);
-}
-async function Jt(e2, t2, n2, i2, r2) {
-  const a2 = rn(e2.data), s2 = new W();
-  s2.append(r2[n2]);
-  const o2 = rn(new Uint8Array(4));
-  o2.setUint32(0, s2.get(), true);
-  const l2 = tn(a2, 1);
-  Object.assign(e2, { version: $t(a2, 0), [t2]: yt(e2.data.subarray(5)), valid: !r2.bitFlag.languageEncodingFlag && l2 == tn(o2, 0) }), e2.valid && (i2[t2] = e2[t2], i2[t2 + "UTF8"] = true);
-}
-function Qt(e2, t2, n2) {
-  return t2[n2] === S ? e2.options[n2] : t2[n2];
-}
-function Xt(e2) {
-  const t2 = (4294901760 & e2) >> 16, n2 = 65535 & e2;
+    });
+  })(g2, t2, s2), t2.extraFieldExtendedTimestamp = g2);
+  const m2 = i2.get(6534);
+  m2 && (t2.extraFieldUSDZ = m2);
+}
+function Wt(e2, t2, r2, n2, s2) {
+  const a2 = qt(e2.data), i2 = new y$1();
+  i2.append(s2[r2]);
+  const o2 = qt(new Uint8Array(4));
+  o2.setUint32(0, i2.get(), true);
+  const c = Nt(a2, 1);
+  Object.assign(e2, { version: Lt(a2, 0), [t2]: at(e2.data.subarray(5)), valid: !s2.bitFlag.languageEncodingFlag && c == Nt(o2, 0) }), e2.valid && (n2[t2] = e2[t2], n2[t2 + "UTF8"] = true);
+}
+function Mt(e2, t2, r2) {
   try {
-    return new Date(1980 + ((65024 & t2) >> 9), ((480 & t2) >> 5) - 1, 31 & t2, (63488 & n2) >> 11, (2016 & n2) >> 5, 2 * (31 & n2), 0);
-  } catch (e3) {
+    const n2 = qt(new Uint8Array(e2.data));
+    let s2 = 0;
+    const a2 = Lt(n2, s2++), i2 = Lt(n2, s2++), o2 = e2.data.subarray(s2, s2 + i2);
+    s2 += i2;
+    const l2 = jt(o2), u = Lt(n2, s2++), d = e2.data.subarray(s2, s2 + u);
+    s2 += u;
+    const f2 = jt(d);
+    let h2 = c$1;
+    if (!r2 && s2 + 2 <= e2.data.length) {
+      const t3 = e2.data;
+      h2 = new DataView(t3.buffer, t3.byteOffset + s2, 2).getUint16(0, true);
+    }
+    Object.assign(e2, { version: a2, uid: l2, gid: f2, unixMode: h2 }), l2 !== c$1 && (t2.uid = l2), f2 !== c$1 && (t2.gid = f2), h2 !== c$1 && (t2.unixMode = h2);
+  } catch {
+  }
+}
+function jt(e2) {
+  const t2 = new Uint8Array(4);
+  t2.set(e2, 0);
+  return new DataView(t2.buffer, t2.byteOffset, 4).getUint32(0, true);
+}
+function It(e2, t2, r2) {
+  return t2[r2] === c$1 ? e2.options[r2] : t2[r2];
+}
+function Bt(e2) {
+  const r2 = (4294901760 & e2) >> 16, n2 = e2 & t$1;
+  try {
+    return new Date(1980 + ((65024 & r2) >> 9), ((480 & r2) >> 5) - 1, 31 & r2, (63488 & n2) >> 11, (2016 & n2) >> 5, 2 * (31 & n2), 0);
+  } catch {
   }
 }
-function Yt(e2) {
+function Pt(e2) {
   return new Date(Number(e2 / BigInt(1e4) - BigInt(116444736e5)));
 }
-function $t(e2, t2) {
+function Lt(e2, t2) {
   return e2.getUint8(t2);
 }
-function en(e2, t2) {
+function Vt(e2, t2) {
   return e2.getUint16(t2, true);
 }
-function tn(e2, t2) {
+function Nt(e2, t2) {
   return e2.getUint32(t2, true);
 }
-function nn(e2, t2) {
+function Zt(e2, t2) {
   return Number(e2.getBigUint64(t2, true));
 }
-function rn(e2) {
+function qt(e2) {
   return new DataView(e2.buffer);
 }
-F({ Inflate: function(e2) {
-  const t2 = new m$1(), i2 = e2 && e2.chunkSize ? Math.floor(2 * e2.chunkSize) : 131072, r2 = new Uint8Array(i2);
-  let a2 = false;
-  t2.inflateInit(), t2.next_out = r2, this.append = function(e3, s2) {
-    const o2 = [];
-    let l2, c, u = 0, d = 0, f2 = 0;
-    if (0 !== e3.length) {
-      t2.next_in_index = 0, t2.next_in = e3, t2.avail_in = e3.length;
-      do {
-        if (t2.next_out_index = 0, t2.avail_out = i2, 0 !== t2.avail_in || a2 || (t2.next_in_index = 0, a2 = true), l2 = t2.inflate(0), a2 && l2 === n$1) {
-          if (0 !== t2.avail_in) throw new Error("inflating: bad input");
-        } else if (0 !== l2 && 1 !== l2) throw new Error("inflating: " + t2.msg);
-        if ((a2 || 1 === l2) && t2.avail_in === e3.length) throw new Error("inflating: bad input");
-        t2.next_out_index && (t2.next_out_index === i2 ? o2.push(new Uint8Array(r2)) : o2.push(r2.subarray(0, t2.next_out_index))), f2 += t2.next_out_index, s2 && t2.next_in_index > 0 && t2.next_in_index != u && (s2(t2.next_in_index), u = t2.next_in_index);
-      } while (t2.avail_in > 0 || 0 === t2.avail_out);
-      return o2.length > 1 ? (c = new Uint8Array(f2), o2.forEach((function(e4) {
-        c.set(e4, d), d += e4.length;
-      }))) : c = o2[0] ? new Uint8Array(o2[0]) : new Uint8Array(), c;
-    }
-  }, this.flush = function() {
-    t2.inflateEnd();
-  };
-} });
+try {
+  w$1({ baseURI: import.meta.url });
+} catch {
+}
 const zip = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  BlobReader: ut,
-  BlobWriter: dt,
-  TextWriter: ft,
-  ZipReader: Ht,
-  configure: F
+  BlobReader: Ge,
+  BlobWriter: Je,
+  TextWriter: Qe,
+  ZipReader: Et,
+  configure: w$1
 }, Symbol.toStringTag, { value: "Module" }));
 const NS$2 = {
   CONTAINER: "urn:oasis:names:tc:opendocument:xmlns:container",
@@ -4697,9 +4366,9 @@ const getPrefixes = (doc) => {
 };
 const getPropertyURL = (value, prefixes) => {
   if (!value) return null;
-  const [a2, b2] = value.split(":");
-  const prefix = b2 ? a2 : null;
-  const reference = b2 ? b2 : a2;
+  const [a2, b3] = value.split(":");
+  const prefix = b3 ? a2 : null;
+  const reference = b3 ? b3 : a2;
   const baseURL = prefixes.get(prefix);
   return baseURL ? baseURL + reference : null;
 };
@@ -4748,7 +4417,7 @@ const getMetadata = (opf) => {
     if (!alts.length && (!x2.lang || x2.lang === baseLang) && !altRep) return x2.value;
     const map = { [x2.lang ?? baseLang]: x2.value };
     if (altRep) map[x2.attrs["alt-rep-lang"]] = altRep;
-    for (const y2 of alts) map[y2.lang] ??= y2.value;
+    for (const y3 of alts) map[y3.lang] ??= y3.value;
     return map;
   };
   const makeContributor = (x2) => {
@@ -4799,7 +4468,7 @@ const getMetadata = (opf) => {
     subtitle: (_h = (_g = dc.title) == null ? void 0 : _g.find((x2) => prop(x2, "title-type") === "subtitle")) == null ? void 0 : _h.value,
     language: (_i = dc.language) == null ? void 0 : _i.map((x2) => x2.value),
     description: one(dc.description),
-    publisher: makeContributor((_j = dc.publisher) == null ? void 0 : _j[0]),
+    publisher: (_j = dc.publisher) == null ? void 0 : _j.map(makeContributor),
     published: ((_l = (_k = dc.date) == null ? void 0 : _k.find((x2) => x2.attrs.event === "publication")) == null ? void 0 : _l.value) ?? one(dc.date),
     modified: one(properties[PREFIX.dcterms + "modified"]) ?? ((_n = (_m = dc.date) == null ? void 0 : _m.find((x2) => x2.attrs.event === "modification")) == null ? void 0 : _n.value),
     subject: (_o = dc.subject) == null ? void 0 : _o.map(makeContributor),
@@ -4813,7 +4482,9 @@ const getMetadata = (opf) => {
     altIdentifier: (_r = dc.identifier) == null ? void 0 : _r.map(makeAltIdentifier),
     source: (_s = dc.source) == null ? void 0 : _s.map(makeAltIdentifier),
     // NOTE: not in webpub schema
-    rights: one(dc.rights)
+    rights: one(dc.rights),
+    // NOTE: not in webpub schema
+    pageBreakSource: one(properties["pageBreakSource"])
     // NOTE: not in webpub schema
   };
   const remapContributor = (defaultKey) => (x2) => {
@@ -5568,7 +5239,7 @@ const makeComicBook = ({ entries, loadBlob, getSize }, file) => {
     cache.delete(name);
   };
   const exts = [".jpg", ".jpeg", ".png", ".gif", ".bmp", ".webp", ".svg", ".jxl", ".avif"];
-  const files = entries.map((entry) => entry.filename).filter((name) => exts.some((ext) => name.endsWith(ext))).sort();
+  const files = entries.map((entry) => entry.filename).filter((name) => exts.some((ext) => name.endsWith(ext))).sort(new Intl.Collator([], { numeric: true }).compare);
   if (!files.length) throw new Error("No supported image files in archive");
   const book = {};
   book.getCover = () => loadBlob(files[0]);
@@ -5879,7 +5550,7 @@ const makeFB2 = async (blob) => {
           var _a2;
           return ((_a2 = el2.getAttribute("src")) == null ? void 0 : _a2.length) ?? 0;
         }
-      ).reduce((a2, b2) => a2 + b2, 0),
+      ).reduce((a2, b3) => a2 + b3, 0),
       linear
     };
   });
@@ -5901,8 +5572,8 @@ const makeFB2 = async (blob) => {
     };
   }).filter((item) => item);
   book.resolveHref = (href) => {
-    const [a2, b2] = href.split("#");
-    return a2 ? { index: Number(a2), anchor: (doc2) => doc2.querySelector(`[${dataID}="${b2}"]`) } : { index: idMap.get(b2), anchor: (doc2) => doc2.getElementById(b2) };
+    const [a2, b3] = href.split("#");
+    return a2 ? { index: Number(a2), anchor: (doc2) => doc2.querySelector(`[${dataID}="${b3}"]`) } : { index: idMap.get(b3), anchor: (doc2) => doc2.getElementById(b3) };
   };
   book.splitTOCHref = (href) => {
     var _a;
@@ -5918,6 +5589,415 @@ const fb2 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty(
   __proto__: null,
   makeFB2
 }, Symbol.toStringTag, { value: "Module" }));
+const textLayerBuilderCSS = '/* Copyright 2014 Mozilla Foundation\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the "License");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *     http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an "AS IS" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n\r\n.textLayer {\r\n  color-scheme: only light;\r\n\r\n  position: absolute;\r\n  text-align: initial;\r\n  inset: 0;\r\n  overflow: clip;\r\n  opacity: 1;\r\n  line-height: 1;\r\n  text-size-adjust: none;\r\n  forced-color-adjust: none;\r\n  transform-origin: 0 0;\r\n  caret-color: CanvasText;\r\n  z-index: 0;\r\n\r\n  &.highlighting {\r\n    touch-action: none;\r\n  }\r\n\r\n  :is(span, br) {\r\n    color: transparent;\r\n    position: absolute;\r\n    white-space: pre;\r\n    cursor: text;\r\n    transform-origin: 0% 0%;\r\n  }\r\n\r\n  /* We multiply the font size by --min-font-size, and then scale the text\r\n   * elements by 1/--min-font-size. This allows us to effectively ignore the\r\n   * minimum font size enforced by the browser, so that the text layer <span>s\r\n   * can always match the size of the text in the canvas. */\r\n  --min-font-size: 1;\r\n  --text-scale-factor: calc(var(--total-scale-factor) * var(--min-font-size));\r\n  --min-font-size-inv: calc(1 / var(--min-font-size));\r\n\r\n  > :not(.markedContent),\r\n  .markedContent span:not(.markedContent) {\r\n    z-index: 1;\r\n\r\n    --font-height: 0; /* set by text_layer.js */\r\n    font-size: calc(var(--text-scale-factor) * var(--font-height));\r\n\r\n    --scale-x: 1;\r\n    --rotate: 0deg;\r\n    transform: rotate(var(--rotate)) scaleX(var(--scale-x))\r\n      scale(var(--min-font-size-inv));\r\n  }\r\n\r\n  .markedContent {\r\n    display: contents;\r\n  }\r\n\r\n  span[role="img"] {\r\n    user-select: none;\r\n    cursor: default;\r\n  }\r\n\r\n  .highlight {\r\n    --highlight-bg-color: rgb(180 0 170 / 0.25);\r\n    --highlight-selected-bg-color: rgb(0 100 0 / 0.25);\r\n    --highlight-backdrop-filter: none;\r\n    --highlight-selected-backdrop-filter: none;\r\n\r\n    @media screen and (forced-colors: active) {\r\n      --highlight-bg-color: transparent;\r\n      --highlight-selected-bg-color: transparent;\r\n      --highlight-backdrop-filter: var(--hcm-highlight-filter);\r\n      --highlight-selected-backdrop-filter: var(\r\n        --hcm-highlight-selected-filter\r\n      );\r\n    }\r\n\r\n    margin: -1px;\r\n    padding: 1px;\r\n    background-color: var(--highlight-bg-color);\r\n    backdrop-filter: var(--highlight-backdrop-filter);\r\n    border-radius: 4px;\r\n\r\n    &.appended {\r\n      position: initial;\r\n    }\r\n\r\n    &.begin {\r\n      border-radius: 4px 0 0 4px;\r\n    }\r\n\r\n    &.end {\r\n      border-radius: 0 4px 4px 0;\r\n    }\r\n\r\n    &.middle {\r\n      border-radius: 0;\r\n    }\r\n\r\n    &.selected {\r\n      background-color: var(--highlight-selected-bg-color);\r\n      backdrop-filter: var(--highlight-selected-backdrop-filter);\r\n    }\r\n  }\r\n\r\n  ::selection {\r\n    /* stylelint-disable declaration-block-no-duplicate-properties */\r\n    /*#if !MOZCENTRAL*/\r\n    background: rgba(0 0 255 / 0.25);\r\n    /*#endif*/\r\n    /* stylelint-enable declaration-block-no-duplicate-properties */\r\n    background: color-mix(in srgb, AccentColor, transparent 75%);\r\n  }\r\n\r\n  /* Avoids https://github.com/mozilla/pdf.js/issues/13840 in Chrome */\r\n  /*#if !MOZCENTRAL*/\r\n  br::selection {\r\n    background: transparent;\r\n  }\r\n  /*#endif*/\r\n\r\n  .endOfContent {\r\n    display: block;\r\n    position: absolute;\r\n    inset: 100% 0 0;\r\n    z-index: 0;\r\n    cursor: default;\r\n    user-select: none;\r\n  }\r\n\r\n  &.selecting .endOfContent {\r\n    top: 0;\r\n  }\r\n}\r\n';
+const annotationLayerBuilderCSS = `/* Copyright 2014 Mozilla Foundation\r
+ *\r
+ * Licensed under the Apache License, Version 2.0 (the "License");\r
+ * you may not use this file except in compliance with the License.\r
+ * You may obtain a copy of the License at\r
+ *\r
+ *     http://www.apache.org/licenses/LICENSE-2.0\r
+ *\r
+ * Unless required by applicable law or agreed to in writing, software\r
+ * distributed under the License is distributed on an "AS IS" BASIS,\r
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r
+ * See the License for the specific language governing permissions and\r
+ * limitations under the License.\r
+ */\r
+\r
+.annotationLayer {\r
+  color-scheme: only light;\r
+\r
+  --annotation-unfocused-field-background: url("data:image/svg+xml;charset=UTF-8,<svg width='1px' height='1px' xmlns='http://www.w3.org/2000/svg'><rect width='100%' height='100%' style='fill:rgba(0, 54, 255, 0.13);'/></svg>");\r
+  --input-focus-border-color: Highlight;\r
+  --input-focus-outline: 1px solid Canvas;\r
+  --input-unfocused-border-color: transparent;\r
+  --input-disabled-border-color: transparent;\r
+  --input-hover-border-color: black;\r
+  --link-outline: none;\r
+\r
+  @media screen and (forced-colors: active) {\r
+    --input-focus-border-color: CanvasText;\r
+    --input-unfocused-border-color: ActiveText;\r
+    --input-disabled-border-color: GrayText;\r
+    --input-hover-border-color: Highlight;\r
+    --link-outline: 1.5px solid LinkText;\r
+\r
+    .textWidgetAnnotation :is(input, textarea):required,\r
+    .choiceWidgetAnnotation select:required,\r
+    .buttonWidgetAnnotation:is(.checkBox, .radioButton) input:required {\r
+      outline: 1.5px solid selectedItem;\r
+    }\r
+\r
+    .linkAnnotation {\r
+      outline: var(--link-outline);\r
+\r
+      &:hover {\r
+        backdrop-filter: var(--hcm-highlight-filter);\r
+      }\r
+\r
+      & > a:hover {\r
+        opacity: 0 !important;\r
+        background: none !important;\r
+        box-shadow: none;\r
+      }\r
+    }\r
+\r
+    .popupAnnotation .popup {\r
+      outline: calc(1.5px * var(--total-scale-factor)) solid CanvasText !important;\r
+      background-color: ButtonFace !important;\r
+      color: ButtonText !important;\r
+    }\r
+\r
+    .highlightArea:hover::after {\r
+      position: absolute;\r
+      top: 0;\r
+      left: 0;\r
+      width: 100%;\r
+      height: 100%;\r
+      backdrop-filter: var(--hcm-highlight-filter);\r
+      content: "";\r
+      pointer-events: none;\r
+    }\r
+\r
+    .popupAnnotation.focused .popup {\r
+      outline: calc(3px * var(--total-scale-factor)) solid Highlight !important;\r
+    }\r
+  }\r
+\r
+  position: absolute;\r
+  top: 0;\r
+  left: 0;\r
+  pointer-events: none;\r
+  transform-origin: 0 0;\r
+\r
+  &[data-main-rotation="90"] .norotate {\r
+    transform: rotate(270deg) translateX(-100%);\r
+  }\r
+  &[data-main-rotation="180"] .norotate {\r
+    transform: rotate(180deg) translate(-100%, -100%);\r
+  }\r
+  &[data-main-rotation="270"] .norotate {\r
+    transform: rotate(90deg) translateY(-100%);\r
+  }\r
+\r
+  &.disabled {\r
+    section,\r
+    .popup {\r
+      pointer-events: none;\r
+    }\r
+  }\r
+\r
+  .annotationContent {\r
+    position: absolute;\r
+    width: 100%;\r
+    height: 100%;\r
+    pointer-events: none;\r
+\r
+    &.freetext {\r
+      background: transparent;\r
+      border: none;\r
+      inset: 0;\r
+      overflow: visible;\r
+      white-space: nowrap;\r
+      font: 10px sans-serif;\r
+      line-height: 1.35;\r
+    }\r
+  }\r
+\r
+  section {\r
+    position: absolute;\r
+    text-align: initial;\r
+    pointer-events: auto;\r
+    box-sizing: border-box;\r
+    transform-origin: 0 0;\r
+    user-select: none;\r
+\r
+    &:has(div.annotationContent) {\r
+      canvas.annotationContent {\r
+        display: none;\r
+      }\r
+    }\r
+\r
+    .overlaidText {\r
+      position: absolute;\r
+      top: 0;\r
+      left: 0;\r
+      width: 0;\r
+      height: 0;\r
+      display: inline-block;\r
+      overflow: hidden;\r
+    }\r
+  }\r
+\r
+  .textLayer.selecting ~ & section {\r
+    pointer-events: none;\r
+  }\r
+\r
+  :is(.linkAnnotation, .buttonWidgetAnnotation.pushButton) > a {\r
+    position: absolute;\r
+    font-size: 1em;\r
+    top: 0;\r
+    left: 0;\r
+    width: 100%;\r
+    height: 100%;\r
+  }\r
+\r
+  :is(.linkAnnotation, .buttonWidgetAnnotation.pushButton):not(.hasBorder)\r
+    > a:hover {\r
+    opacity: 0.2;\r
+    background-color: rgb(255 255 0);\r
+  }\r
+\r
+  .linkAnnotation.hasBorder:hover {\r
+    background-color: rgb(255 255 0 / 0.2);\r
+  }\r
+\r
+  .hasBorder {\r
+    background-size: 100% 100%;\r
+  }\r
+\r
+  .textAnnotation img {\r
+    position: absolute;\r
+    cursor: pointer;\r
+    width: 100%;\r
+    height: 100%;\r
+    top: 0;\r
+    left: 0;\r
+  }\r
+\r
+  .textWidgetAnnotation :is(input, textarea),\r
+  .choiceWidgetAnnotation select,\r
+  .buttonWidgetAnnotation:is(.checkBox, .radioButton) input {\r
+    background-image: var(--annotation-unfocused-field-background);\r
+    border: 2px solid var(--input-unfocused-border-color);\r
+    box-sizing: border-box;\r
+    font: calc(9px * var(--total-scale-factor)) sans-serif;\r
+    height: 100%;\r
+    margin: 0;\r
+    vertical-align: top;\r
+    width: 100%;\r
+  }\r
+\r
+  .textWidgetAnnotation :is(input, textarea):required,\r
+  .choiceWidgetAnnotation select:required,\r
+  .buttonWidgetAnnotation:is(.checkBox, .radioButton) input:required {\r
+    outline: 1.5px solid red;\r
+  }\r
+\r
+  .choiceWidgetAnnotation select option {\r
+    padding: 0;\r
+  }\r
+\r
+  .buttonWidgetAnnotation.radioButton input {\r
+    border-radius: 50%;\r
+  }\r
+\r
+  .textWidgetAnnotation textarea {\r
+    resize: none;\r
+  }\r
+\r
+  .textWidgetAnnotation :is(input, textarea)[disabled],\r
+  .choiceWidgetAnnotation select[disabled],\r
+  .buttonWidgetAnnotation:is(.checkBox, .radioButton) input[disabled] {\r
+    background: none;\r
+    border: 2px solid var(--input-disabled-border-color);\r
+    cursor: not-allowed;\r
+  }\r
+\r
+  .textWidgetAnnotation :is(input, textarea):hover,\r
+  .choiceWidgetAnnotation select:hover,\r
+  .buttonWidgetAnnotation:is(.checkBox, .radioButton) input:hover {\r
+    border: 2px solid var(--input-hover-border-color);\r
+  }\r
+  .textWidgetAnnotation :is(input, textarea):hover,\r
+  .choiceWidgetAnnotation select:hover,\r
+  .buttonWidgetAnnotation.checkBox input:hover {\r
+    border-radius: 2px;\r
+  }\r
+\r
+  .textWidgetAnnotation :is(input, textarea):focus,\r
+  .choiceWidgetAnnotation select:focus {\r
+    background: none;\r
+    border: 2px solid var(--input-focus-border-color);\r
+    border-radius: 2px;\r
+    outline: var(--input-focus-outline);\r
+  }\r
+\r
+  .buttonWidgetAnnotation:is(.checkBox, .radioButton) :focus {\r
+    background-image: none;\r
+    background-color: transparent;\r
+  }\r
+\r
+  .buttonWidgetAnnotation.checkBox :focus {\r
+    border: 2px solid var(--input-focus-border-color);\r
+    border-radius: 2px;\r
+    outline: var(--input-focus-outline);\r
+  }\r
+\r
+  .buttonWidgetAnnotation.radioButton :focus {\r
+    border: 2px solid var(--input-focus-border-color);\r
+    outline: var(--input-focus-outline);\r
+  }\r
+\r
+  .buttonWidgetAnnotation.checkBox input:checked::before,\r
+  .buttonWidgetAnnotation.checkBox input:checked::after,\r
+  .buttonWidgetAnnotation.radioButton input:checked::before {\r
+    background-color: CanvasText;\r
+    content: "";\r
+    display: block;\r
+    position: absolute;\r
+  }\r
+\r
+  .buttonWidgetAnnotation.checkBox input:checked::before,\r
+  .buttonWidgetAnnotation.checkBox input:checked::after {\r
+    height: 80%;\r
+    left: 45%;\r
+    width: 1px;\r
+  }\r
+\r
+  .buttonWidgetAnnotation.checkBox input:checked::before {\r
+    transform: rotate(45deg);\r
+  }\r
+\r
+  .buttonWidgetAnnotation.checkBox input:checked::after {\r
+    transform: rotate(-45deg);\r
+  }\r
+\r
+  .buttonWidgetAnnotation.radioButton input:checked::before {\r
+    border-radius: 50%;\r
+    height: 50%;\r
+    left: 25%;\r
+    top: 25%;\r
+    width: 50%;\r
+  }\r
+\r
+  .textWidgetAnnotation input.comb {\r
+    font-family: monospace;\r
+    padding-left: 2px;\r
+    padding-right: 0;\r
+  }\r
+\r
+  .textWidgetAnnotation input.comb:focus {\r
+    /*\r
+     * Letter spacing is placed on the right side of each character. Hence, the\r
+     * letter spacing of the last character may be placed outside the visible\r
+     * area, causing horizontal scrolling. We avoid this by extending the width\r
+     * when the element has focus and revert this when it loses focus.\r
+     */\r
+    width: 103%;\r
+  }\r
+\r
+  .buttonWidgetAnnotation:is(.checkBox, .radioButton) input {\r
+    appearance: none;\r
+  }\r
+\r
+  .fileAttachmentAnnotation .popupTriggerArea {\r
+    height: 100%;\r
+    width: 100%;\r
+  }\r
+\r
+  .popupAnnotation {\r
+    position: absolute;\r
+    font-size: calc(9px * var(--total-scale-factor));\r
+    pointer-events: none;\r
+    width: max-content;\r
+    max-width: 45%;\r
+    height: auto;\r
+  }\r
+\r
+  .popup {\r
+    background-color: rgb(255 255 153);\r
+    color: black;\r
+    box-shadow: 0 calc(2px * var(--total-scale-factor))\r
+      calc(5px * var(--total-scale-factor)) rgb(136 136 136);\r
+    border-radius: calc(2px * var(--total-scale-factor));\r
+    outline: 1.5px solid rgb(255 255 74);\r
+    padding: calc(6px * var(--total-scale-factor));\r
+    cursor: pointer;\r
+    font: message-box;\r
+    white-space: normal;\r
+    word-wrap: break-word;\r
+    pointer-events: auto;\r
+    user-select: text;\r
+  }\r
+\r
+  .popupAnnotation.focused .popup {\r
+    outline-width: 3px;\r
+  }\r
+\r
+  .popup * {\r
+    font-size: calc(9px * var(--total-scale-factor));\r
+  }\r
+\r
+  .popup > .header {\r
+    display: inline-block;\r
+  }\r
+\r
+  .popup > .header > .title {\r
+    display: inline;\r
+    font-weight: bold;\r
+  }\r
+\r
+  .popup > .header .popupDate {\r
+    display: inline-block;\r
+    margin-left: calc(5px * var(--total-scale-factor));\r
+    width: fit-content;\r
+  }\r
+\r
+  .popupContent {\r
+    border-top: 1px solid rgb(51 51 51);\r
+    margin-top: calc(2px * var(--total-scale-factor));\r
+    padding-top: calc(2px * var(--total-scale-factor));\r
+  }\r
+\r
+  .richText > * {\r
+    white-space: pre-wrap;\r
+    font-size: calc(9px * var(--total-scale-factor));\r
+  }\r
+\r
+  .popupTriggerArea {\r
+    cursor: pointer;\r
+\r
+    &:hover {\r
+      backdrop-filter: var(--hcm-highlight-filter);\r
+    }\r
+  }\r
+\r
+  section svg {\r
+    position: absolute;\r
+    width: 100%;\r
+    height: 100%;\r
+    top: 0;\r
+    left: 0;\r
+  }\r
+\r
+  .annotationTextContent {\r
+    position: absolute;\r
+    width: 100%;\r
+    height: 100%;\r
+    opacity: 0;\r
+    color: transparent;\r
+    user-select: none;\r
+    pointer-events: none;\r
+\r
+    span {\r
+      width: 100%;\r
+      display: inline-block;\r
+    }\r
+  }\r
+\r
+  svg.quadrilateralsContainer {\r
+    contain: strict;\r
+    width: 0;\r
+    height: 0;\r
+    position: absolute;\r
+    top: 0;\r
+    left: 0;\r
+    z-index: -1;\r
+  }\r
+}\r
+`;
 const render = async (page, doc, zoom) => {
   const scale = zoom * devicePixelRatio;
   doc.documentElement.style.transform = `scale(${1 / devicePixelRatio})`;
@@ -5952,15 +6032,13 @@ const render = async (page, doc, zoom) => {
   container.onpointerdown = () => container.classList.add("selecting");
   container.onpointerup = () => container.classList.remove("selecting");
   const div = doc.querySelector(".annotationLayer");
-  await new pdfjsLib.AnnotationLayer({ page, viewport, div }).render({
-    annotations: await page.getAnnotations(),
-    linkService: {
-      goToDestination: () => {
-      },
-      getDestinationHash: (dest) => JSON.stringify(dest),
-      addLinkAttributes: (link, url) => link.href = url
-    }
-  });
+  const linkService = {
+    goToDestination: () => {
+    },
+    getDestinationHash: (dest) => JSON.stringify(dest),
+    addLinkAttributes: (link, url) => link.href = url
+  };
+  await new pdfjsLib.AnnotationLayer({ page, viewport, div, linkService }).render({ annotations: await page.getAnnotations() });
 };
 const renderPage = async (page, getImageBlob) => {
   const viewport = page.getViewport({ scale: 1 });
@@ -5982,6 +6060,17 @@ const renderPage = async (page, getImageBlob) => {
             margin: 0;
             padding: 0;
         }
+        /*
+        https://github.com/mozilla/pdf.js/commit/bd05b255fabfc313b194bfe9a17ccded4d90fb5a
+        */
+        :root {
+          --user-unit: 1;
+          --total-scale-factor: calc(var(--scale-factor) * var(--user-unit));
+          --scale-round-x: 1px;
+          --scale-round-y: 1px;
+        }
+        ${textLayerBuilderCSS}
+        ${annotationLayerBuilderCSS}
         </style>
         <div id="canvas"></div>
         <div class="textLayer"></div>
@@ -6004,8 +6093,8 @@ const makePDF = async (file) => {
   };
   const pdf2 = await pdfjsLib.getDocument({
     range: transport,
-    // cMapUrl: pdfjsPath('cmaps/'),
-    // standardFontDataUrl: pdfjsPath('standard_fonts/'),
+    cMapUrl: pdfjsPath("cmaps/"),
+    standardFontDataUrl: pdfjsPath("standard_fonts/"),
     isEvalSupported: false
   }).promise;
   const book = { rendition: { layout: "pre-paginated" } };
@@ -6319,17 +6408,17 @@ const MOBI_LANG = {
   97: ["ne"],
   98: ["fy"]
 };
-const concatTypedArray = (a2, b2) => {
-  const result = new a2.constructor(a2.length + b2.length);
+const concatTypedArray = (a2, b3) => {
+  const result = new a2.constructor(a2.length + b3.length);
   result.set(a2);
-  result.set(b2, a2.length);
+  result.set(b3, a2.length);
   return result;
 };
-const concatTypedArray3 = (a2, b2, c) => {
-  const result = new a2.constructor(a2.length + b2.length + c.length);
+const concatTypedArray3 = (a2, b3, c) => {
+  const result = new a2.constructor(a2.length + b3.length + c.length);
   result.set(a2);
-  result.set(b2, a2.length);
-  result.set(c, a2.length + b2.length);
+  result.set(b3, a2.length);
+  result.set(c, a2.length + b3.length);
   return result;
 };
 const decoder = new TextDecoder();
@@ -6801,6 +6890,9 @@ class MOBI6 {
       createDocument: () => this.createDocument(section),
       size: section.end - section.start
     }));
+    this.#fileposList = [...new Set(
+      Array.from(str.matchAll(fileposRegex), (m2) => m2[1])
+    )].map((filepos) => ({ filepos, number: Number(filepos) })).sort((a2, b3) => a2.number - b3.number);
     try {
       this.landmarks = await this.getGuide();
       const tocHref = (_a = this.landmarks.find(({ type }) => type == null ? void 0 : type.includes("toc"))) == null ? void 0 : _a.href;
@@ -6841,9 +6933,6 @@ class MOBI6 {
     } catch (e2) {
       console.warn(e2);
     }
-    this.#fileposList = [...new Set(
-      Array.from(str.matchAll(fileposRegex), (m2) => m2[1])
-    )].map((filepos) => ({ filepos, number: Number(filepos) })).sort((a2, b2) => a2.number - b2.number);
     this.metadata = this.mobi.getMetadata();
     this.getCover = this.mobi.getCover.bind(this.mobi);
     return this;
@@ -7047,7 +7136,7 @@ class KF8 {
       const last = arr[arr.length - 1];
       const fragStart = (last == null ? void 0 : last.fragEnd) ?? 0, fragEnd = fragStart + skel.numFrag;
       const frags = fragTable.slice(fragStart, fragEnd);
-      const length = skel.length + frags.map((f2) => f2.length).reduce((a2, b2) => a2 + b2, 0);
+      const length = skel.length + frags.map((f2) => f2.length).reduce((a2, b3) => a2 + b3, 0);
       const totalLength = ((last == null ? void 0 : last.totalLength) ?? 0) + length;
       return arr.concat({ skel, frags, fragEnd, length, totalLength });
     }, []);
@@ -7281,25 +7370,25 @@ const mobi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty
   MOBI,
   isMOBI
 }, Symbol.toStringTag, { value: "Module" }));
-var r = Uint8Array, a = Uint16Array, e = Int32Array, n = new r([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, 0, 0, 0]), i = new r([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, 0, 0]), t = new r([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), f = function(r2, n2) {
-  for (var i2 = new a(31), t2 = 0; t2 < 31; ++t2) i2[t2] = n2 += 1 << r2[t2 - 1];
-  var f2 = new e(i2[30]);
+var r = Uint8Array, n = Uint16Array, a = Int32Array, e = new r([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, 0, 0, 0]), i = new r([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, 0, 0]), t = new r([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), f = function(r2, e2) {
+  for (var i2 = new n(31), t2 = 0; t2 < 31; ++t2) i2[t2] = e2 += 1 << r2[t2 - 1];
+  var f2 = new a(i2[30]);
   for (t2 = 1; t2 < 30; ++t2) for (var o2 = i2[t2]; o2 < i2[t2 + 1]; ++o2) f2[o2] = o2 - i2[t2] << 5 | t2;
   return { b: i2, r: f2 };
-}, o = f(n, 2), v = o.b, l = o.r;
+}, o = f(e, 2), v = o.b, l = o.r;
 v[28] = 258, l[258] = 28;
-for (var u = f(i, 0).b, c = new a(32768), d = 0; d < 32768; ++d) {
+for (var u = f(i, 0).b, c = new n(32768), d = 0; d < 32768; ++d) {
   var w = (43690 & d) >> 1 | (21845 & d) << 1;
   w = (61680 & (w = (52428 & w) >> 2 | (13107 & w) << 2)) >> 4 | (3855 & w) << 4, c[d] = ((65280 & w) >> 8 | (255 & w) << 8) >> 1;
 }
-var b = function(r2, e2, n2) {
-  for (var i2 = r2.length, t2 = 0, f2 = new a(e2); t2 < i2; ++t2) r2[t2] && ++f2[r2[t2] - 1];
-  var o2, v2 = new a(e2);
-  for (t2 = 1; t2 < e2; ++t2) v2[t2] = v2[t2 - 1] + f2[t2 - 1] << 1;
+var b2 = function(r2, a2, e2) {
+  for (var i2 = r2.length, t2 = 0, f2 = new n(a2); t2 < i2; ++t2) r2[t2] && ++f2[r2[t2] - 1];
+  var o2, v2 = new n(a2);
+  for (t2 = 1; t2 < a2; ++t2) v2[t2] = v2[t2 - 1] + f2[t2 - 1] << 1;
   {
-    o2 = new a(1 << e2);
-    var l2 = 15 - e2;
-    for (t2 = 0; t2 < i2; ++t2) if (r2[t2]) for (var u = t2 << 4 | r2[t2], d = e2 - r2[t2], w = v2[r2[t2] - 1]++ << d, b2 = w | (1 << d) - 1; w <= b2; ++w) o2[c[w] >> l2] = u;
+    o2 = new n(1 << a2);
+    var l2 = 15 - a2;
+    for (t2 = 0; t2 < i2; ++t2) if (r2[t2]) for (var u = t2 << 4 | r2[t2], d = a2 - r2[t2], w = v2[r2[t2] - 1]++ << d, b3 = w | (1 << d) - 1; w <= b3; ++w) o2[c[w] >> l2] = u;
   }
   return o2;
 }, s = new r(288);
@@ -7309,123 +7398,125 @@ for (d = 256; d < 280; ++d) s[d] = 7;
 for (d = 280; d < 288; ++d) s[d] = 8;
 var h = new r(32);
 for (d = 0; d < 32; ++d) h[d] = 5;
-var y = b(s, 9), g = b(h, 5), p = function(r2) {
-  for (var a2 = r2[0], e2 = 1; e2 < r2.length; ++e2) r2[e2] > a2 && (a2 = r2[e2]);
-  return a2;
-}, k = function(r2, a2, e2) {
-  var n2 = a2 / 8 | 0;
-  return (r2[n2] | r2[n2 + 1] << 8) >> (7 & a2) & e2;
-}, m = function(r2, a2) {
-  var e2 = a2 / 8 | 0;
-  return (r2[e2] | r2[e2 + 1] << 8 | r2[e2 + 2] << 16) >> (7 & a2);
-}, x = ["unexpected EOF", "invalid block type", "invalid length/literal", "invalid distance", "stream finished", "no stream handler", , "no callback", "invalid UTF-8 data", "extra field too long", "date not in range 1980-2099", "filename too long", "stream finishing", "invalid zip data"], T = function(r2, a2, e2) {
-  var n2 = new Error(a2 || x[r2]);
-  if (n2.code = r2, Error.captureStackTrace && Error.captureStackTrace(n2, T), !e2) throw n2;
+var y2 = b2(s, 9), g = b2(h, 5), p = function(r2) {
+  for (var n2 = r2[0], a2 = 1; a2 < r2.length; ++a2) r2[a2] > n2 && (n2 = r2[a2]);
   return n2;
-}, E = function(a2, e2, f2, o2) {
-  var l2 = a2.length, c = o2 ? o2.length : 0;
-  if (!l2 || e2.f && !e2.l) return f2 || new r(0);
-  var d = !f2, w = d || 2 != e2.i, s2 = e2.i;
+}, k = function(r2, n2, a2) {
+  var e2 = n2 / 8 | 0;
+  return (r2[e2] | r2[e2 + 1] << 8) >> (7 & n2) & a2;
+}, m = function(r2, n2) {
+  var a2 = n2 / 8 | 0;
+  return (r2[a2] | r2[a2 + 1] << 8 | r2[a2 + 2] << 16) >> (7 & n2);
+}, x = function(r2) {
+  return (r2 + 7) / 8 | 0;
+}, T = ["unexpected EOF", "invalid block type", "invalid length/literal", "invalid distance", "stream finished", "no stream handler", , "no callback", "invalid UTF-8 data", "extra field too long", "date not in range 1980-2099", "filename too long", "stream finishing", "invalid zip data"], E = function(r2, n2, a2) {
+  var e2 = new Error(n2 || T[r2]);
+  if (e2.code = r2, Error.captureStackTrace && Error.captureStackTrace(e2, E), !a2) throw e2;
+  return e2;
+}, z = function(n2, a2, f2, o2) {
+  var l2 = n2.length, c = o2 ? o2.length : 0;
+  if (!l2 || a2.f && !a2.l) return f2 || new r(0);
+  var d = !f2, w = d || 2 != a2.i, s2 = a2.i;
   d && (f2 = new r(3 * l2));
-  var h2 = function(a3) {
-    var e3 = f2.length;
-    if (a3 > e3) {
-      var n2 = new r(Math.max(2 * e3, a3));
-      n2.set(f2), f2 = n2;
+  var h2 = function(n3) {
+    var a3 = f2.length;
+    if (n3 > a3) {
+      var e2 = new r(Math.max(2 * a3, n3));
+      e2.set(f2), f2 = e2;
     }
-  }, x2 = e2.f || 0, E2 = e2.p || 0, z2 = e2.b || 0, A2 = e2.l, U3 = e2.d, D2 = e2.m, F2 = e2.n, M2 = 8 * l2;
+  }, T2 = a2.f || 0, z2 = a2.p || 0, A2 = a2.b || 0, U2 = a2.l, D2 = a2.d, F2 = a2.m, M2 = a2.n, S2 = 8 * l2;
   do {
-    if (!A2) {
-      x2 = k(a2, E2, 1);
-      var S2 = k(a2, E2 + 1, 3);
-      if (E2 += 3, !S2) {
-        var I2 = a2[(N2 = 4 + ((E2 + 7) / 8 | 0)) - 4] | a2[N2 - 3] << 8, O2 = N2 + I2;
-        if (O2 > l2) {
-          s2 && T(0);
+    if (!U2) {
+      T2 = k(n2, z2, 1);
+      var I2 = k(n2, z2 + 1, 3);
+      if (z2 += 3, !I2) {
+        var O2 = n2[(P2 = x(z2) + 4) - 4] | n2[P2 - 3] << 8, j2 = P2 + O2;
+        if (j2 > l2) {
+          s2 && E(0);
           break;
         }
-        w && h2(z2 + I2), f2.set(a2.subarray(N2, O2), z2), e2.b = z2 += I2, e2.p = E2 = 8 * O2, e2.f = x2;
+        w && h2(A2 + O2), f2.set(n2.subarray(P2, j2), A2), a2.b = A2 += O2, a2.p = z2 = 8 * j2, a2.f = T2;
         continue;
       }
-      if (1 == S2) A2 = y, U3 = g, D2 = 9, F2 = 5;
-      else if (2 == S2) {
-        var j2 = k(a2, E2, 31) + 257, q2 = k(a2, E2 + 10, 15) + 4, B2 = j2 + k(a2, E2 + 5, 31) + 1;
-        E2 += 14;
-        for (var C2 = new r(B2), G2 = new r(19), H2 = 0; H2 < q2; ++H2) G2[t[H2]] = k(a2, E2 + 3 * H2, 7);
-        E2 += 3 * q2;
-        var J2 = p(G2), K2 = (1 << J2) - 1, L2 = b(G2, J2);
-        for (H2 = 0; H2 < B2; ) {
-          var N2, P2 = L2[k(a2, E2, K2)];
-          if (E2 += 15 & P2, (N2 = P2 >> 4) < 16) C2[H2++] = N2;
+      if (1 == I2) U2 = y2, D2 = g, F2 = 9, M2 = 5;
+      else if (2 == I2) {
+        var q2 = k(n2, z2, 31) + 257, B2 = k(n2, z2 + 10, 15) + 4, C2 = q2 + k(n2, z2 + 5, 31) + 1;
+        z2 += 14;
+        for (var G2 = new r(C2), H2 = new r(19), J2 = 0; J2 < B2; ++J2) H2[t[J2]] = k(n2, z2 + 3 * J2, 7);
+        z2 += 3 * B2;
+        var K2 = p(H2), L2 = (1 << K2) - 1, N2 = b2(H2, K2);
+        for (J2 = 0; J2 < C2; ) {
+          var P2, Q2 = N2[k(n2, z2, L2)];
+          if (z2 += 15 & Q2, (P2 = Q2 >> 4) < 16) G2[J2++] = P2;
           else {
-            var Q2 = 0, R2 = 0;
-            for (16 == N2 ? (R2 = 3 + k(a2, E2, 3), E2 += 2, Q2 = C2[H2 - 1]) : 17 == N2 ? (R2 = 3 + k(a2, E2, 7), E2 += 3) : 18 == N2 && (R2 = 11 + k(a2, E2, 127), E2 += 7); R2--; ) C2[H2++] = Q2;
+            var R2 = 0, V2 = 0;
+            for (16 == P2 ? (V2 = 3 + k(n2, z2, 3), z2 += 2, R2 = G2[J2 - 1]) : 17 == P2 ? (V2 = 3 + k(n2, z2, 7), z2 += 3) : 18 == P2 && (V2 = 11 + k(n2, z2, 127), z2 += 7); V2--; ) G2[J2++] = R2;
           }
         }
-        var V2 = C2.subarray(0, j2), W2 = C2.subarray(j2);
-        D2 = p(V2), F2 = p(W2), A2 = b(V2, D2), U3 = b(W2, F2);
-      } else T(1);
-      if (E2 > M2) {
-        s2 && T(0);
+        var W2 = G2.subarray(0, q2), X2 = G2.subarray(q2);
+        F2 = p(W2), M2 = p(X2), U2 = b2(W2, F2), D2 = b2(X2, M2);
+      } else E(1);
+      if (z2 > S2) {
+        s2 && E(0);
         break;
       }
     }
-    w && h2(z2 + 131072);
-    for (var X2 = (1 << D2) - 1, Y2 = (1 << F2) - 1, Z2 = E2; ; Z2 = E2) {
-      var $2 = (Q2 = A2[m(a2, E2) & X2]) >> 4;
-      if ((E2 += 15 & Q2) > M2) {
-        s2 && T(0);
+    w && h2(A2 + 131072);
+    for (var Y2 = (1 << F2) - 1, Z2 = (1 << M2) - 1, $2 = z2; ; $2 = z2) {
+      var _2 = (R2 = U2[m(n2, z2) & Y2]) >> 4;
+      if ((z2 += 15 & R2) > S2) {
+        s2 && E(0);
         break;
       }
-      if (Q2 || T(2), $2 < 256) f2[z2++] = $2;
+      if (R2 || E(2), _2 < 256) f2[A2++] = _2;
       else {
-        if (256 == $2) {
-          Z2 = E2, A2 = null;
+        if (256 == _2) {
+          $2 = z2, U2 = null;
           break;
         }
-        var _2 = $2 - 254;
-        if ($2 > 264) {
-          var rr = n[H2 = $2 - 257];
-          _2 = k(a2, E2, (1 << rr) - 1) + v[H2], E2 += rr;
+        var rr = _2 - 254;
+        if (_2 > 264) {
+          var nr = e[J2 = _2 - 257];
+          rr = k(n2, z2, (1 << nr) - 1) + v[J2], z2 += nr;
         }
-        var ar = U3[m(a2, E2) & Y2], er = ar >> 4;
-        ar || T(3), E2 += 15 & ar;
-        W2 = u[er];
+        var ar = D2[m(n2, z2) & Z2], er = ar >> 4;
+        ar || E(3), z2 += 15 & ar;
+        X2 = u[er];
         if (er > 3) {
-          rr = i[er];
-          W2 += m(a2, E2) & (1 << rr) - 1, E2 += rr;
+          nr = i[er];
+          X2 += m(n2, z2) & (1 << nr) - 1, z2 += nr;
         }
-        if (E2 > M2) {
-          s2 && T(0);
+        if (z2 > S2) {
+          s2 && E(0);
           break;
         }
-        w && h2(z2 + 131072);
-        var nr = z2 + _2;
-        if (z2 < W2) {
-          var ir = c - W2, tr = Math.min(W2, nr);
-          for (ir + z2 < 0 && T(3); z2 < tr; ++z2) f2[z2] = o2[ir + z2];
+        w && h2(A2 + 131072);
+        var ir = A2 + rr;
+        if (A2 < X2) {
+          var tr = c - X2, fr = Math.min(X2, ir);
+          for (tr + A2 < 0 && E(3); A2 < fr; ++A2) f2[A2] = o2[tr + A2];
         }
-        for (; z2 < nr; ++z2) f2[z2] = f2[z2 - W2];
+        for (; A2 < ir; ++A2) f2[A2] = f2[A2 - X2];
       }
     }
-    e2.l = A2, e2.p = Z2, e2.b = z2, e2.f = x2, A2 && (x2 = 1, e2.m = D2, e2.d = U3, e2.n = F2);
-  } while (!x2);
-  return z2 != f2.length && d ? (function(a3, e3, n2) {
-    return (null == n2 || n2 > a3.length) && (n2 = a3.length), new r(a3.subarray(e3, n2));
-  })(f2, 0, z2) : f2.subarray(0, z2);
-}, z = new r(0);
-function A(r2, a2) {
-  return E(r2.subarray((e2 = r2, n2 = a2 && a2.dictionary, (8 != (15 & e2[0]) || e2[0] >> 4 > 7 || (e2[0] << 8 | e2[1]) % 31) && T(6, "invalid zlib data"), (e2[1] >> 5 & 1) == +!n2 && T(6, "invalid zlib data: " + (32 & e2[1] ? "need" : "unexpected") + " dictionary"), 2 + (e2[1] >> 3 & 4)), -4), { i: 2 }, a2 && a2.out, a2 && a2.dictionary);
-  var e2, n2;
-}
-var U2 = "undefined" != typeof TextDecoder && new TextDecoder();
+    a2.l = U2, a2.p = $2, a2.b = A2, a2.f = T2, U2 && (T2 = 1, a2.m = F2, a2.d = D2, a2.n = M2);
+  } while (!T2);
+  return A2 != f2.length && d ? (function(n3, a3, e2) {
+    return (null == e2 || e2 > n3.length) && (e2 = n3.length), new r(n3.subarray(a3, e2));
+  })(f2, 0, A2) : f2.subarray(0, A2);
+}, A = new r(0);
+function U(r2, n2) {
+  return z(r2.subarray((a2 = r2, e2 = n2 && n2.dictionary, (8 != (15 & a2[0]) || a2[0] >> 4 > 7 || (a2[0] << 8 | a2[1]) % 31) && E(6, "invalid zlib data"), (a2[1] >> 5 & 1) == +!e2 && E(6, "invalid zlib data: " + (32 & a2[1] ? "need" : "unexpected") + " dictionary"), 2 + (a2[1] >> 3 & 4)), -4), { i: 2 }, n2 && n2.out, n2 && n2.dictionary);
+  var a2, e2;
+}
+var D = "undefined" != typeof TextDecoder && new TextDecoder();
 try {
-  U2.decode(z, { stream: true });
+  D.decode(A, { stream: true });
 } catch (r2) {
 }
 const fflate = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  unzlibSync: A
+  unzlibSync: U
 }, Symbol.toStringTag, { value: "Module" }));
 const parseViewport = (str) => {
   var _a, _b;
@@ -7731,21 +7822,21 @@ const debounce = (f2, wait2, immediate) => {
 };
 const lerp = (min, max, x2) => x2 * (max - min) + min;
 const easeOutQuad = (x2) => 1 - (1 - x2) * (1 - x2);
-const animate = (a2, b2, duration, ease, render2) => new Promise((resolve) => {
+const animate = (a2, b3, duration, ease, render2) => new Promise((resolve) => {
   let start;
   const step = (now) => {
     if (document.hidden) {
-      render2(lerp(a2, b2, 1));
+      render2(lerp(a2, b3, 1));
       return resolve();
     }
     start ??= now;
     const fraction = Math.min(1, (now - start) / duration);
-    render2(lerp(a2, b2, ease(fraction)));
+    render2(lerp(a2, b3, ease(fraction)));
     if (fraction < 1) requestAnimationFrame(step);
     else resolve();
   };
   if (document.hidden) {
-    render2(lerp(a2, b2, 1));
+    render2(lerp(a2, b3, 1));
     return resolve();
   }
   requestAnimationFrame(step);
@@ -7821,15 +7912,15 @@ const getVisibleRange = (doc, start, end, mapRect) => {
     nodes.push(node);
   const from = nodes[0] ?? doc.body;
   const to = nodes[nodes.length - 1] ?? from;
-  const startOffset = from.nodeType === 1 ? 0 : bisectNode(doc, from, (a2, b2) => {
+  const startOffset = from.nodeType === 1 ? 0 : bisectNode(doc, from, (a2, b3) => {
     const p2 = mapRect(getBoundingClientRect(a2));
-    const q2 = mapRect(getBoundingClientRect(b2));
+    const q2 = mapRect(getBoundingClientRect(b3));
     if (p2.right < start && q2.left > start) return 0;
     return q2.left > start ? -1 : 1;
   });
-  const endOffset = to.nodeType === 1 ? 0 : bisectNode(doc, to, (a2, b2) => {
+  const endOffset = to.nodeType === 1 ? 0 : bisectNode(doc, to, (a2, b3) => {
     const p2 = mapRect(getBoundingClientRect(a2));
-    const q2 = mapRect(getBoundingClientRect(b2));
+    const q2 = mapRect(getBoundingClientRect(b3));
     if (p2.right < end && q2.left > end) return 0;
     return q2.left > end ? -1 : 1;
   });
@@ -8310,7 +8401,7 @@ class Paginator extends HTMLElement {
       if (detail.type !== "text/css") return;
       const w = innerWidth;
       const h2 = innerHeight;
-      detail.data = Promise.resolve(detail.data).then((data) => data.replace(new RegExp("(?<=[{\\s;])-epub-", "gi"), "").replace(/(\d*\.?\d+)vw/gi, (_2, d) => parseFloat(d) * w / 100 + "px").replace(/(\d*\.?\d+)vh/gi, (_2, d) => parseFloat(d) * h2 / 100 + "px").replace(/page-break-(after|before|inside)\s*:/gi, (_2, x2) => `-webkit-column-break-${x2}:`).replace(/break-(after|before|inside)\s*:\s*(avoid-)?page/gi, (_2, x2, y2) => `break-${x2}: ${y2 ?? ""}column`));
+      detail.data = Promise.resolve(detail.data).then((data) => data.replace(new RegExp("(?<=[{\\s;])-epub-", "gi"), "").replace(/(\d*\.?\d+)vw/gi, (_2, d) => parseFloat(d) * w / 100 + "px").replace(/(\d*\.?\d+)vh/gi, (_2, d) => parseFloat(d) * h2 / 100 + "px").replace(/page-break-(after|before|inside)\s*:/gi, (_2, x2) => `-webkit-column-break-${x2}:`).replace(/break-(after|before|inside)\s*:\s*(avoid-)?page/gi, (_2, x2, y3) => `break-${x2}: ${y3 ?? ""}column`));
     });
   }
   #createView() {
@@ -8410,10 +8501,10 @@ class Paginator extends HTMLElement {
     const delta = this.#vertical ? dy : dx;
     const element = this.#container;
     const { scrollProp } = this;
-    const [offset, a2, b2] = this.#scrollBounds;
+    const [offset, a2, b3] = this.#scrollBounds;
     const rtl = this.#rtl;
-    const min = rtl ? offset - b2 : offset - a2;
-    const max = rtl ? offset + a2 : offset + b2;
+    const min = rtl ? offset - b3 : offset - a2;
+    const max = rtl ? offset + a2 : offset + b3;
     element[scrollProp] = Math.max(min, Math.min(
       max,
       element[scrollProp] + delta
@@ -8421,10 +8512,10 @@ class Paginator extends HTMLElement {
   }
   snap(vx, vy) {
     const velocity = this.#vertical ? vy : vx;
-    const [offset, a2, b2] = this.#scrollBounds;
+    const [offset, a2, b3] = this.#scrollBounds;
     const { start, end, pages, size } = this;
     const min = Math.abs(offset) - a2;
-    const max = Math.abs(offset) + b2;
+    const max = Math.abs(offset) + b3;
     const d = velocity * (this.#rtl ? -size : size);
     const page = Math.floor(
       Math.max(min, Math.min(max, (start + end) / 2 + (isNaN(d) ? 0 : d))) / size
@@ -8458,11 +8549,11 @@ class Paginator extends HTMLElement {
     }
     e2.preventDefault();
     const touch = e2.changedTouches[0];
-    const x2 = touch.screenX, y2 = touch.screenY;
-    const dx = state.x - x2, dy = state.y - y2;
+    const x2 = touch.screenX, y3 = touch.screenY;
+    const dx = state.x - x2, dy = state.y - y3;
     const dt2 = e2.timeStamp - state.t;
     state.x = x2;
-    state.y = y2;
+    state.y = y3;
     state.t = e2.timeStamp;
     state.vx = dx / dt2;
     state.vy = dy / dt2;
@@ -8940,10 +9031,11 @@ const fragmentToSSML = (fragment, inherited) => {
   const { lang } = inherited;
   if (lang) ssml.documentElement.setAttributeNS(NS.XML, "lang", lang);
   const convert = (node, parent, inheritedAlphabet) => {
+    var _a, _b, _c;
     if (!node) return;
     if (node.nodeType === 3) return ssml.createTextNode(node.textContent);
     if (node.nodeType === 4) return ssml.createCDATASection(node.textContent);
-    if (node.nodeType !== 1) return;
+    if (node.nodeType !== 1 && node.nodeType !== 11) return;
     let el;
     const nodeName = node.nodeName.toLowerCase();
     if (nodeName === "foliate-mark") {
@@ -8953,14 +9045,14 @@ const fragmentToSSML = (fragment, inherited) => {
       el = ssml.createElementNS(NS.SSML, "break");
     else if (nodeName === "em" || nodeName === "strong")
       el = ssml.createElementNS(NS.SSML, "emphasis");
-    const lang2 = node.lang || node.getAttributeNS(NS.XML, "lang");
+    const lang2 = node.lang || ((_a = node.getAttributeNS) == null ? void 0 : _a.call(node, NS.XML, "lang"));
     if (lang2) {
       if (!el) el = ssml.createElementNS(NS.SSML, "lang");
       el.setAttributeNS(NS.XML, "lang", lang2);
     }
-    const alphabet = node.getAttributeNS(NS.SSML, "alphabet") || inheritedAlphabet;
+    const alphabet = ((_b = node.getAttributeNS) == null ? void 0 : _b.call(node, NS.SSML, "alphabet")) || inheritedAlphabet;
     if (!el) {
-      const ph = node.getAttributeNS(NS.SSML, "ph");
+      const ph = (_c = node.getAttributeNS) == null ? void 0 : _c.call(node, NS.SSML, "ph");
       if (ph) {
         el = ssml.createElementNS(NS.SSML, "phoneme");
         if (alphabet) el.setAttribute("alphabet", alphabet);
@@ -8976,7 +9068,7 @@ const fragmentToSSML = (fragment, inherited) => {
     }
     return el;
   };
-  convert(fragment.firstChild, ssml.documentElement, inherited.alphabet);
+  convert(fragment, ssml.documentElement, inherited.alphabet);
   return ssml;
 };
 const getFragmentWithMarks = (range, textWalker2, granularity) => {