@genome-spy/app 0.52.0 → 0.53.0

package/dist/{index-Sk-Wtwdn.js → index-BywMLhhd.js}

@@ -1,24 +1,23 @@
-import { b as Q } from "./index-C8lYPtq_.js";
-import { _ as Gn, L as Yn } from "./index-mihmTLo-.js";
+import { b as J } from "./index-B5cesONJ.js";
+import { _ as Gn, L as Yn } from "./index-uO0O4Uv-.js";
 import { L as nr } from "./__vite-browser-external-C--ziKoh.js";
-import { R as ir } from "./remoteFile-1_eCK3VV.js";
-import "./_commonjsHelpers-BIiJCwQW.js";
+import { R as ir } from "./remoteFile-BkTxwFub.js";
 const st = BigInt(32);
 function rr(e, n, t) {
-  const i = +!!t, r = +!t;
-  return BigInt(e.getInt32(n, t) * r + e.getInt32(n + 4, t) * i) << st | BigInt(e.getUint32(n, t) * i + e.getUint32(n + 4, t) * r);
+  const i = +!!t, a = +!t;
+  return BigInt(e.getInt32(n, t) * a + e.getInt32(n + 4, t) * i) << st | BigInt(e.getUint32(n, t) * i + e.getUint32(n + 4, t) * a);
 }
 function ar(e, n, t) {
-  const i = e.getUint32(n, t), r = e.getUint32(n + 4, t), a = +!!t, o = +!t;
-  return BigInt(i * o + r * a) << st | BigInt(i * a + r * o);
+  const i = e.getUint32(n, t), a = e.getUint32(n + 4, t), r = +!!t, o = +!t;
+  return BigInt(i * o + a * r) << st | BigInt(i * r + a * o);
 }
 function or(e, n, t, i) {
-  const r = Number(t >> st), a = Number(t & BigInt(4294967295));
-  i ? (e.setInt32(n + 4, r, i), e.setUint32(n, a, i)) : (e.setInt32(n, r, i), e.setUint32(n + 4, a, i));
+  const a = Number(t >> st), r = Number(t & BigInt(4294967295));
+  i ? (e.setInt32(n + 4, a, i), e.setUint32(n, r, i)) : (e.setInt32(n, a, i), e.setUint32(n + 4, r, i));
 }
 function sr(e, n, t, i) {
-  const r = Number(t >> st), a = Number(t & BigInt(4294967295));
-  i ? (e.setUint32(n + 4, r, i), e.setUint32(n, a, i)) : (e.setUint32(n, r, i), e.setUint32(n + 4, a, i));
+  const a = Number(t >> st), r = Number(t & BigInt(4294967295));
+  i ? (e.setUint32(n + 4, a, i), e.setUint32(n, r, i)) : (e.setUint32(n, a, i), e.setUint32(n + 4, r, i));
 }
 "getBigInt64" in DataView || (DataView.prototype.getBigInt64 = function(e, n) {
   return rr(this, e, n);
@@ -95,7 +94,7 @@ class lr {
     return Array.from(this.references).filter(([n, t]) => !t.resolved && !t.requested).map(([n, t]) => n);
   }
 }
-const x = /* @__PURE__ */ new Map(), oe = "___parser_", M = {
+const x = /* @__PURE__ */ new Map(), re = "___parser_", M = {
   uint8: 1,
   uint16le: 2,
   uint16be: 2,
@@ -161,8 +160,8 @@ class N {
     return new N();
   }
   primitiveGenerateN(n, t) {
-    const i = Ye[n], r = Ke[n];
-    t.pushCode(`${t.generateVariable(this.varName)} = dataView.get${i}(offset, ${r});`), t.pushCode(`offset += ${M[n]};`);
+    const i = Ye[n], a = Ke[n];
+    t.pushCode(`${t.generateVariable(this.varName)} = dataView.get${i}(offset, ${a});`), t.pushCode(`offset += ${M[n]};`);
   }
   primitiveN(n, t, i) {
     return this.setNextParser(n, t, i);
@@ -394,11 +393,11 @@ class N {
     if (!t.choices)
       throw new Error("choices is required for choice.");
     for (const i in t.choices) {
-      const r = parseInt(i, 10), a = t.choices[r];
-      if (isNaN(r))
+      const a = parseInt(i, 10), r = t.choices[a];
+      if (isNaN(a))
         throw new Error(`Choice key "${i}" is not a number.`);
-      if (typeof a == "string" && !x.has(a) && !(a in M))
-        throw new Error(`Choice type "${a}" is unkown.`);
+      if (typeof r == "string" && !x.has(r) && !(r in M))
+        throw new Error(`Choice type "${r}" is unkown.`);
     }
     return this.setNextParser("choice", n, t);
   }
@@ -449,23 +448,22 @@ class N {
   }
   getContext(n) {
     const t = new lr(n, this.useContextVariables);
-    return t.pushCode("var dataView = new DataView(buffer.buffer, buffer.byteOffset, buffer.length);"), this.alias ? (this.addAliasedCode(t), t.pushCode(`return ${oe + this.alias}(0).result;`)) : this.addRawCode(t), t;
+    return t.pushCode("var dataView = new DataView(buffer.buffer, buffer.byteOffset, buffer.length);"), this.alias ? (this.addAliasedCode(t), t.pushCode(`return ${re + this.alias}(0).result;`)) : this.addRawCode(t), t;
   }
   getCode() {
-    const n = "imports";
-    return this.getContext(n).code;
+    return this.getContext("imports").code;
   }
   addRawCode(n) {
     n.pushCode("var offset = 0;"), n.pushCode(`var vars = ${this.constructorFn ? "new constructorFn()" : "{}"};`), n.pushCode("vars.$parent = null;"), n.pushCode("vars.$root = vars;"), this.generate(n), this.resolveReferences(n), n.pushCode("delete vars.$parent;"), n.pushCode("delete vars.$root;"), n.pushCode("return vars;");
   }
   addAliasedCode(n) {
-    return n.pushCode(`function ${oe + this.alias}(offset, context) {`), n.pushCode(`var vars = ${this.constructorFn ? "new constructorFn()" : "{}"};`), n.pushCode("var ctx = Object.assign({$parent: null, $root: vars}, context || {});"), n.pushCode("vars = Object.assign(vars, ctx);"), this.generate(n), n.markResolved(this.alias), this.resolveReferences(n), n.pushCode("Object.keys(ctx).forEach(function (item) { delete vars[item]; });"), n.pushCode("return { offset: offset, result: vars };"), n.pushCode("}"), n;
+    return n.pushCode(`function ${re + this.alias}(offset, context) {`), n.pushCode(`var vars = ${this.constructorFn ? "new constructorFn()" : "{}"};`), n.pushCode("var ctx = Object.assign({$parent: null, $root: vars}, context || {});"), n.pushCode("vars = Object.assign(vars, ctx);"), this.generate(n), n.markResolved(this.alias), this.resolveReferences(n), n.pushCode("Object.keys(ctx).forEach(function (item) { delete vars[item]; });"), n.pushCode("return { offset: offset, result: vars };"), n.pushCode("}"), n;
   }
   resolveReferences(n) {
     const t = n.getUnresolvedReferences();
     n.markRequested(t), t.forEach((i) => {
-      var r;
-      (r = x.get(i)) === null || r === void 0 || r.addAliasedCode(n);
+      var a;
+      (a = x.get(i)) === null || a === void 0 || a.addAliasedCode(n);
     });
   }
   compile() {
@@ -492,8 +490,8 @@ class N {
     return this.compiled || this.compile(), this.compiled(n, this.constructorFn);
   }
   setNextParser(n, t, i) {
-    const r = new N();
-    return r.type = n, r.varName = t, r.options = i, r.endian = this.endian, this.head ? this.head.next = r : this.next = r, this.head = r, this;
+    const a = new N();
+    return a.type = n, a.varName = t, a.options = i, a.endian = this.endian, this.head ? this.head.next = a : this.next = a, this.head = a, this;
   }
   // Call code generator for this parser
   generate(n) {
@@ -586,30 +584,30 @@ class N {
     if (t.options = this.options, t.generateAssert = this.generateAssert.bind(this), t.generateFormatter = this.generateFormatter.bind(this), t.varName = n.generateVariable(t.varName), n.bitFields.push(t), !this.next || this.next && ["bit", "nest"].indexOf(this.next.type) < 0) {
       const i = n.generateTmpVariable();
       n.pushCode(`var ${i} = 0;`);
-      const r = (f = 0) => {
-        let d = 0;
+      const a = (f = 0) => {
+        let p = 0;
         for (let c = f; c < n.bitFields.length; c++) {
           const h = n.bitFields[c].options.length;
-          if (d + h > 32)
+          if (p + h > 32)
             break;
-          d += h;
+          p += h;
         }
-        return d;
-      }, a = (f) => (f <= 8 ? (n.pushCode(`${i} = dataView.getUint8(offset);`), f = 8) : f <= 16 ? (n.pushCode(`${i} = dataView.getUint16(offset);`), f = 16) : f <= 24 ? (n.pushCode(`${i} = (dataView.getUint16(offset) << 8) | dataView.getUint8(offset + 2);`), f = 24) : (n.pushCode(`${i} = dataView.getUint32(offset);`), f = 32), n.pushCode(`offset += ${f / 8};`), f);
+        return p;
+      }, r = (f) => (f <= 8 ? (n.pushCode(`${i} = dataView.getUint8(offset);`), f = 8) : f <= 16 ? (n.pushCode(`${i} = dataView.getUint16(offset);`), f = 16) : f <= 24 ? (n.pushCode(`${i} = (dataView.getUint16(offset) << 8) | dataView.getUint8(offset + 2);`), f = 24) : (n.pushCode(`${i} = dataView.getUint32(offset);`), f = 32), n.pushCode(`offset += ${f / 8};`), f);
       let o = 0;
-      const s = this.endian === "be";
-      let u = 0, l = 0;
-      n.bitFields.forEach((f, d) => {
+      const l = this.endian === "be";
+      let u = 0, s = 0;
+      n.bitFields.forEach((f, p) => {
         let c = f.options.length;
-        if (c > l) {
-          if (l) {
-            const g = -1 >>> 32 - l;
-            n.pushCode(`${f.varName} = (${i} & 0x${g.toString(16)}) << ${c - l};`), c -= l;
+        if (c > s) {
+          if (s) {
+            const g = -1 >>> 32 - s;
+            n.pushCode(`${f.varName} = (${i} & 0x${g.toString(16)}) << ${c - s};`), c -= s;
           }
-          o = 0, l = u = a(r(d) - l);
+          o = 0, s = u = r(a(p) - s);
         }
-        const h = s ? u - o - c : o, _ = -1 >>> 32 - c;
-        n.pushCode(`${f.varName} ${c < f.options.length ? "|=" : "="} ${i} >> ${h} & 0x${_.toString(16)};`), f.options.length === 32 && n.pushCode(`${f.varName} >>>= 0`), f.options.assert && f.generateAssert(n), f.options.formatter && f.generateFormatter(n, f.varName, f.options.formatter), o += c, l -= c;
+        const h = l ? u - o - c : o, _ = -1 >>> 32 - c;
+        n.pushCode(`${f.varName} ${c < f.options.length ? "|=" : "="} ${i} >> ${h} & 0x${_.toString(16)};`), f.options.length === 32 && n.pushCode(`${f.varName} >>>= 0`), f.options.assert && f.generateAssert(n), f.options.formatter && f.generateFormatter(n, f.varName, f.options.formatter), o += c, s -= c;
       }), n.bitFields = [];
     }
   }
@@ -618,26 +616,26 @@ class N {
     n.pushCode(`offset += ${t};`);
   }
   generateString(n) {
-    const t = n.generateVariable(this.varName), i = n.generateTmpVariable(), r = this.options.encoding, a = r.toLowerCase() === "hex", o = 'b => b.toString(16).padStart(2, "0")';
+    const t = n.generateVariable(this.varName), i = n.generateTmpVariable(), a = this.options.encoding, r = a.toLowerCase() === "hex", o = 'b => b.toString(16).padStart(2, "0")';
     if (this.options.length && this.options.zeroTerminated) {
-      const s = this.options.length;
-      n.pushCode(`var ${i} = offset;`), n.pushCode(`while(dataView.getUint8(offset++) !== 0 && offset - ${i} < ${s});`);
-      const u = `offset - ${i} < ${s} ? offset - 1 : offset`;
-      n.pushCode(a ? `${t} = Array.from(buffer.subarray(${i}, ${u}), ${o}).join('');` : `${t} = new TextDecoder('${r}').decode(buffer.subarray(${i}, ${u}));`);
+      const l = this.options.length;
+      n.pushCode(`var ${i} = offset;`), n.pushCode(`while(dataView.getUint8(offset++) !== 0 && offset - ${i} < ${l});`);
+      const u = `offset - ${i} < ${l} ? offset - 1 : offset`;
+      n.pushCode(r ? `${t} = Array.from(buffer.subarray(${i}, ${u}), ${o}).join('');` : `${t} = new TextDecoder('${a}').decode(buffer.subarray(${i}, ${u}));`);
     } else if (this.options.length) {
-      const s = n.generateOption(this.options.length);
-      n.pushCode(a ? `${t} = Array.from(buffer.subarray(offset, offset + ${s}), ${o}).join('');` : `${t} = new TextDecoder('${r}').decode(buffer.subarray(offset, offset + ${s}));`), n.pushCode(`offset += ${s};`);
+      const l = n.generateOption(this.options.length);
+      n.pushCode(r ? `${t} = Array.from(buffer.subarray(offset, offset + ${l}), ${o}).join('');` : `${t} = new TextDecoder('${a}').decode(buffer.subarray(offset, offset + ${l}));`), n.pushCode(`offset += ${l};`);
     } else
-      this.options.zeroTerminated ? (n.pushCode(`var ${i} = offset;`), n.pushCode("while(dataView.getUint8(offset++) !== 0);"), n.pushCode(a ? `${t} = Array.from(buffer.subarray(${i}, offset - 1), ${o}).join('');` : `${t} = new TextDecoder('${r}').decode(buffer.subarray(${i}, offset - 1));`)) : this.options.greedy && (n.pushCode(`var ${i} = offset;`), n.pushCode("while(buffer.length > offset++);"), n.pushCode(a ? `${t} = Array.from(buffer.subarray(${i}, offset), ${o}).join('');` : `${t} = new TextDecoder('${r}').decode(buffer.subarray(${i}, offset));`));
+      this.options.zeroTerminated ? (n.pushCode(`var ${i} = offset;`), n.pushCode("while(dataView.getUint8(offset++) !== 0);"), n.pushCode(r ? `${t} = Array.from(buffer.subarray(${i}, offset - 1), ${o}).join('');` : `${t} = new TextDecoder('${a}').decode(buffer.subarray(${i}, offset - 1));`)) : this.options.greedy && (n.pushCode(`var ${i} = offset;`), n.pushCode("while(buffer.length > offset++);"), n.pushCode(r ? `${t} = Array.from(buffer.subarray(${i}, offset), ${o}).join('');` : `${t} = new TextDecoder('${a}').decode(buffer.subarray(${i}, offset));`));
     this.options.stripNull && n.pushCode(`${t} = ${t}.replace(/\\x00+$/g, '')`);
   }
   generateBuffer(n) {
     const t = n.generateVariable(this.varName);
     if (typeof this.options.readUntil == "function") {
-      const i = this.options.readUntil, r = n.generateTmpVariable(), a = n.generateTmpVariable();
-      n.pushCode(`var ${r} = offset;`), n.pushCode(`var ${a} = 0;`), n.pushCode("while (offset < buffer.length) {"), n.pushCode(`${a} = dataView.getUint8(offset);`);
+      const i = this.options.readUntil, a = n.generateTmpVariable(), r = n.generateTmpVariable();
+      n.pushCode(`var ${a} = offset;`), n.pushCode(`var ${r} = 0;`), n.pushCode("while (offset < buffer.length) {"), n.pushCode(`${r} = dataView.getUint8(offset);`);
       const o = n.addImport(i);
-      n.pushCode(`if (${o}.call(${n.generateVariable()}, ${a}, buffer.subarray(offset))) break;`), n.pushCode("offset += 1;"), n.pushCode("}"), n.pushCode(`${t} = buffer.subarray(${r}, offset);`);
+      n.pushCode(`if (${o}.call(${n.generateVariable()}, ${r}, buffer.subarray(offset))) break;`), n.pushCode("offset += 1;"), n.pushCode("}"), n.pushCode(`${t} = buffer.subarray(${a}, offset);`);
     } else if (this.options.readUntil === "eof")
       n.pushCode(`${t} = buffer.subarray(offset);`);
     else {
@@ -647,38 +645,38 @@ class N {
     this.options.clone && n.pushCode(`${t} = buffer.constructor.from(${t});`);
   }
   generateArray(n) {
-    const t = n.generateOption(this.options.length), i = n.generateOption(this.options.lengthInBytes), r = this.options.type, a = n.generateTmpVariable(), o = n.generateVariable(this.varName), s = n.generateTmpVariable(), u = this.options.key, l = typeof u == "string";
-    if (l ? n.pushCode(`${o} = {};`) : n.pushCode(`${o} = [];`), typeof this.options.readUntil == "function" ? n.pushCode("do {") : this.options.readUntil === "eof" ? n.pushCode(`for (var ${a} = 0; offset < buffer.length; ${a}++) {`) : i !== void 0 ? n.pushCode(`for (var ${a} = offset + ${i}; offset < ${a}; ) {`) : n.pushCode(`for (var ${a} = ${t}; ${a} > 0; ${a}--) {`), typeof r == "string")
-      if (x.get(r)) {
+    const t = n.generateOption(this.options.length), i = n.generateOption(this.options.lengthInBytes), a = this.options.type, r = n.generateTmpVariable(), o = n.generateVariable(this.varName), l = n.generateTmpVariable(), u = this.options.key, s = typeof u == "string";
+    if (s ? n.pushCode(`${o} = {};`) : n.pushCode(`${o} = [];`), typeof this.options.readUntil == "function" ? n.pushCode("do {") : this.options.readUntil === "eof" ? n.pushCode(`for (var ${r} = 0; offset < buffer.length; ${r}++) {`) : i !== void 0 ? n.pushCode(`for (var ${r} = offset + ${i}; offset < ${r}; ) {`) : n.pushCode(`for (var ${r} = ${t}; ${r} > 0; ${r}--) {`), typeof a == "string")
+      if (x.get(a)) {
         const f = n.generateTmpVariable();
-        if (n.pushCode(`var ${f} = ${oe + r}(offset, {`), n.useContextVariables) {
-          const d = n.generateVariable();
-          n.pushCode(`$parent: ${d},`), n.pushCode(`$root: ${d}.$root,`), !this.options.readUntil && i === void 0 && n.pushCode(`$index: ${t} - ${a},`);
+        if (n.pushCode(`var ${f} = ${re + a}(offset, {`), n.useContextVariables) {
+          const p = n.generateVariable();
+          n.pushCode(`$parent: ${p},`), n.pushCode(`$root: ${p}.$root,`), !this.options.readUntil && i === void 0 && n.pushCode(`$index: ${t} - ${r},`);
         }
-        n.pushCode("});"), n.pushCode(`var ${s} = ${f}.result; offset = ${f}.offset;`), r !== this.alias && n.addReference(r);
+        n.pushCode("});"), n.pushCode(`var ${l} = ${f}.result; offset = ${f}.offset;`), a !== this.alias && n.addReference(a);
       } else {
-        const f = Ye[r], d = Ke[r];
-        n.pushCode(`var ${s} = dataView.get${f}(offset, ${d});`), n.pushCode(`offset += ${M[r]};`);
+        const f = Ye[a], p = Ke[a];
+        n.pushCode(`var ${l} = dataView.get${f}(offset, ${p});`), n.pushCode(`offset += ${M[a]};`);
       }
-    else if (r instanceof N) {
-      n.pushCode(`var ${s} = {};`);
+    else if (a instanceof N) {
+      n.pushCode(`var ${l} = {};`);
       const f = n.generateVariable();
-      n.pushScope(s), n.useContextVariables && (n.pushCode(`${s}.$parent = ${f};`), n.pushCode(`${s}.$root = ${f}.$root;`), !this.options.readUntil && i === void 0 && n.pushCode(`${s}.$index = ${t} - ${a};`)), r.generate(n), n.useContextVariables && (n.pushCode(`delete ${s}.$parent;`), n.pushCode(`delete ${s}.$root;`), n.pushCode(`delete ${s}.$index;`)), n.popScope();
+      n.pushScope(l), n.useContextVariables && (n.pushCode(`${l}.$parent = ${f};`), n.pushCode(`${l}.$root = ${f}.$root;`), !this.options.readUntil && i === void 0 && n.pushCode(`${l}.$index = ${t} - ${r};`)), a.generate(n), n.useContextVariables && (n.pushCode(`delete ${l}.$parent;`), n.pushCode(`delete ${l}.$root;`), n.pushCode(`delete ${l}.$index;`)), n.popScope();
     }
-    if (l ? n.pushCode(`${o}[${s}.${u}] = ${s};`) : n.pushCode(`${o}.push(${s});`), n.pushCode("}"), typeof this.options.readUntil == "function") {
-      const f = this.options.readUntil, d = n.addImport(f);
-      n.pushCode(`while (!${d}.call(${n.generateVariable()}, ${s}, buffer.subarray(offset)));`);
+    if (s ? n.pushCode(`${o}[${l}.${u}] = ${l};`) : n.pushCode(`${o}.push(${l});`), n.pushCode("}"), typeof this.options.readUntil == "function") {
+      const f = this.options.readUntil, p = n.addImport(f);
+      n.pushCode(`while (!${p}.call(${n.generateVariable()}, ${l}, buffer.subarray(offset)));`);
     }
   }
   generateChoiceCase(n, t, i) {
     if (typeof i == "string") {
-      const r = n.generateVariable(this.varName);
+      const a = n.generateVariable(this.varName);
       if (x.has(i)) {
-        const a = n.generateTmpVariable();
-        n.pushCode(`var ${a} = ${oe + i}(offset, {`), n.useContextVariables && (n.pushCode(`$parent: ${r}.$parent,`), n.pushCode(`$root: ${r}.$root,`)), n.pushCode("});"), n.pushCode(`${r} = ${a}.result; offset = ${a}.offset;`), i !== this.alias && n.addReference(i);
+        const r = n.generateTmpVariable();
+        n.pushCode(`var ${r} = ${re + i}(offset, {`), n.useContextVariables && (n.pushCode(`$parent: ${a}.$parent,`), n.pushCode(`$root: ${a}.$root,`)), n.pushCode("});"), n.pushCode(`${a} = ${r}.result; offset = ${r}.offset;`), i !== this.alias && n.addReference(i);
       } else {
-        const a = Ye[i], o = Ke[i];
-        n.pushCode(`${r} = dataView.get${a}(offset, ${o});`), n.pushCode(`offset += ${M[i]}`);
+        const r = Ye[i], o = Ke[i];
+        n.pushCode(`${a} = dataView.get${r}(offset, ${o});`), n.pushCode(`offset += ${M[i]}`);
       }
     } else
       i instanceof N && (n.pushPath(t), i.generate(n), n.popPath(t));
@@ -686,13 +684,13 @@ class N {
   generateChoice(n) {
     const t = n.generateOption(this.options.tag), i = n.generateVariable(this.varName);
     if (this.varName && (n.pushCode(`${i} = {};`), n.useContextVariables)) {
-      const r = n.generateVariable();
-      n.pushCode(`${i}.$parent = ${r};`), n.pushCode(`${i}.$root = ${r}.$root;`);
+      const a = n.generateVariable();
+      n.pushCode(`${i}.$parent = ${a};`), n.pushCode(`${i}.$root = ${a}.$root;`);
     }
     n.pushCode(`switch(${t}) {`);
-    for (const r in this.options.choices) {
-      const a = parseInt(r, 10), o = this.options.choices[a];
-      n.pushCode(`case ${a}:`), this.generateChoiceCase(n, this.varName, o), n.pushCode("break;");
+    for (const a in this.options.choices) {
+      const r = parseInt(a, 10), o = this.options.choices[r];
+      n.pushCode(`case ${r}:`), this.generateChoiceCase(n, this.varName, o), n.pushCode("break;");
     }
     n.pushCode("default:"), this.options.defaultChoice ? this.generateChoiceCase(n, this.varName, this.options.defaultChoice) : n.generateError(`"Met undefined tag value " + ${t} + " at choice"`), n.pushCode("}"), this.varName && n.useContextVariables && (n.pushCode(`delete ${i}.$parent;`), n.pushCode(`delete ${i}.$root;`));
   }
@@ -706,9 +704,9 @@ class N {
       n.pushPath(this.varName), this.options.type.generate(n), n.popPath(this.varName), this.varName && n.useContextVariables && n.useContextVariables && (n.pushCode(`delete ${t}.$parent;`), n.pushCode(`delete ${t}.$root;`));
     } else if (x.has(this.options.type)) {
       const i = n.generateTmpVariable();
-      if (n.pushCode(`var ${i} = ${oe + this.options.type}(offset, {`), n.useContextVariables) {
-        const r = n.generateVariable();
-        n.pushCode(`$parent: ${r},`), n.pushCode(`$root: ${r}.$root,`);
+      if (n.pushCode(`var ${i} = ${re + this.options.type}(offset, {`), n.useContextVariables) {
+        const a = n.generateVariable();
+        n.pushCode(`$parent: ${a},`), n.pushCode(`$root: ${a}.$root,`);
       }
       n.pushCode("});"), n.pushCode(`${t} = ${i}.result; offset = ${i}.offset;`), this.options.type !== this.alias && n.addReference(this.options.type);
     }
@@ -716,10 +714,10 @@ class N {
   generateWrapper(n) {
     const t = n.generateVariable(this.varName), i = n.generateTmpVariable();
     if (typeof this.options.readUntil == "function") {
-      const u = this.options.readUntil, l = n.generateTmpVariable(), f = n.generateTmpVariable();
-      n.pushCode(`var ${l} = offset;`), n.pushCode(`var ${f} = 0;`), n.pushCode("while (offset < buffer.length) {"), n.pushCode(`${f} = dataView.getUint8(offset);`);
-      const d = n.addImport(u);
-      n.pushCode(`if (${d}.call(${n.generateVariable()}, ${f}, buffer.subarray(offset))) break;`), n.pushCode("offset += 1;"), n.pushCode("}"), n.pushCode(`${i} = buffer.subarray(${l}, offset);`);
+      const u = this.options.readUntil, s = n.generateTmpVariable(), f = n.generateTmpVariable();
+      n.pushCode(`var ${s} = offset;`), n.pushCode(`var ${f} = 0;`), n.pushCode("while (offset < buffer.length) {"), n.pushCode(`${f} = dataView.getUint8(offset);`);
+      const p = n.addImport(u);
+      n.pushCode(`if (${p}.call(${n.generateVariable()}, ${f}, buffer.subarray(offset))) break;`), n.pushCode("offset += 1;"), n.pushCode("}"), n.pushCode(`${i} = buffer.subarray(${s}, offset);`);
     } else if (this.options.readUntil === "eof")
       n.pushCode(`${i} = buffer.subarray(offset);`);
     else {
@@ -727,107 +725,80 @@ class N {
       n.pushCode(`${i} = buffer.subarray(offset, offset + ${u});`), n.pushCode(`offset += ${u};`);
     }
     this.options.clone && n.pushCode(`${i} = buffer.constructor.from(${i});`);
-    const r = n.generateTmpVariable(), a = n.generateTmpVariable(), o = n.generateTmpVariable(), s = n.addImport(this.options.wrapper);
-    if (n.pushCode(`${i} = ${s}.call(this, ${i}).subarray(0);`), n.pushCode(`var ${r} = buffer;`), n.pushCode(`var ${a} = offset;`), n.pushCode(`var ${o} = dataView;`), n.pushCode(`buffer = ${i};`), n.pushCode("offset = 0;"), n.pushCode("dataView = new DataView(buffer.buffer, buffer.byteOffset, buffer.length);"), this.options.type instanceof N)
+    const a = n.generateTmpVariable(), r = n.generateTmpVariable(), o = n.generateTmpVariable(), l = n.addImport(this.options.wrapper);
+    if (n.pushCode(`${i} = ${l}.call(this, ${i}).subarray(0);`), n.pushCode(`var ${a} = buffer;`), n.pushCode(`var ${r} = offset;`), n.pushCode(`var ${o} = dataView;`), n.pushCode(`buffer = ${i};`), n.pushCode("offset = 0;"), n.pushCode("dataView = new DataView(buffer.buffer, buffer.byteOffset, buffer.length);"), this.options.type instanceof N)
       this.varName && n.pushCode(`${t} = {};`), n.pushPath(this.varName), this.options.type.generate(n), n.popPath(this.varName);
     else if (x.has(this.options.type)) {
       const u = n.generateTmpVariable();
-      n.pushCode(`var ${u} = ${oe + this.options.type}(0);`), n.pushCode(`${t} = ${u}.result;`), this.options.type !== this.alias && n.addReference(this.options.type);
+      n.pushCode(`var ${u} = ${re + this.options.type}(0);`), n.pushCode(`${t} = ${u}.result;`), this.options.type !== this.alias && n.addReference(this.options.type);
     }
-    n.pushCode(`buffer = ${r};`), n.pushCode(`dataView = ${o};`), n.pushCode(`offset = ${a};`);
+    n.pushCode(`buffer = ${a};`), n.pushCode(`dataView = ${o};`), n.pushCode(`offset = ${r};`);
   }
   generateFormatter(n, t, i) {
     if (typeof i == "function") {
-      const r = n.addImport(i);
-      n.pushCode(`${t} = ${r}.call(${n.generateVariable()}, ${t});`);
+      const a = n.addImport(i);
+      n.pushCode(`${t} = ${a}.call(${n.generateVariable()}, ${t});`);
     }
   }
   generatePointer(n) {
-    const t = this.options.type, i = n.generateOption(this.options.offset), r = n.generateTmpVariable(), a = n.generateVariable(this.varName);
-    if (n.pushCode(`var ${r} = offset;`), n.pushCode(`offset = ${i};`), this.options.type instanceof N) {
-      if (n.pushCode(`${a} = {};`), n.useContextVariables) {
+    const t = this.options.type, i = n.generateOption(this.options.offset), a = n.generateTmpVariable(), r = n.generateVariable(this.varName);
+    if (n.pushCode(`var ${a} = offset;`), n.pushCode(`offset = ${i};`), this.options.type instanceof N) {
+      if (n.pushCode(`${r} = {};`), n.useContextVariables) {
         const o = n.generateVariable();
-        n.pushCode(`${a}.$parent = ${o};`), n.pushCode(`${a}.$root = ${o}.$root;`);
+        n.pushCode(`${r}.$parent = ${o};`), n.pushCode(`${r}.$root = ${o}.$root;`);
       }
-      n.pushPath(this.varName), this.options.type.generate(n), n.popPath(this.varName), n.useContextVariables && (n.pushCode(`delete ${a}.$parent;`), n.pushCode(`delete ${a}.$root;`));
+      n.pushPath(this.varName), this.options.type.generate(n), n.popPath(this.varName), n.useContextVariables && (n.pushCode(`delete ${r}.$parent;`), n.pushCode(`delete ${r}.$root;`));
     } else if (x.has(this.options.type)) {
       const o = n.generateTmpVariable();
-      if (n.pushCode(`var ${o} = ${oe + this.options.type}(offset, {`), n.useContextVariables) {
-        const s = n.generateVariable();
-        n.pushCode(`$parent: ${s},`), n.pushCode(`$root: ${s}.$root,`);
+      if (n.pushCode(`var ${o} = ${re + this.options.type}(offset, {`), n.useContextVariables) {
+        const l = n.generateVariable();
+        n.pushCode(`$parent: ${l},`), n.pushCode(`$root: ${l}.$root,`);
       }
-      n.pushCode("});"), n.pushCode(`${a} = ${o}.result; offset = ${o}.offset;`), this.options.type !== this.alias && n.addReference(this.options.type);
+      n.pushCode("});"), n.pushCode(`${r} = ${o}.result; offset = ${o}.offset;`), this.options.type !== this.alias && n.addReference(this.options.type);
     } else if (Object.keys(M).indexOf(this.options.type) >= 0) {
-      const o = Ye[t], s = Ke[t];
-      n.pushCode(`${a} = dataView.get${o}(offset, ${s});`), n.pushCode(`offset += ${M[t]};`);
+      const o = Ye[t], l = Ke[t];
+      n.pushCode(`${r} = dataView.get${o}(offset, ${l});`), n.pushCode(`offset += ${M[t]};`);
     }
-    n.pushCode(`offset = ${r};`);
+    n.pushCode(`offset = ${a};`);
   }
   generateSaveOffset(n) {
     const t = n.generateVariable(this.varName);
     n.pushCode(`${t} = offset`);
   }
 }
-class q {
-  constructor(n, t) {
-    this.ranges = arguments.length === 2 ? [{ min: n, max: t }] : 0 in n ? Object.assign({}, n) : [n];
+class pe {
+  constructor(n) {
+    this.ranges = n;
   }
-  min() {
+  get min() {
     return this.ranges[0].min;
   }
-  max() {
+  get max() {
     return this.ranges[this.ranges.length - 1].max;
   }
   contains(n) {
-    for (let t = 0; t < this.ranges.length; t += 1) {
-      const i = this.ranges[t];
-      if (i.min <= n && i.max >= n)
+    for (const t of this.ranges)
+      if (t.min <= n && t.max >= n)
         return !0;
-    }
     return !1;
   }
   isContiguous() {
     return this.ranges.length > 1;
   }
   getRanges() {
-    return this.ranges.map((n) => new q(n.min, n.max));
+    return this.ranges.map((n) => new pe([{ min: n.min, max: n.max }]));
   }
   toString() {
     return this.ranges.map((n) => `[${n.min}-${n.max}]`).join(",");
   }
   union(n) {
-    const t = this.getRanges().concat(n.getRanges()).sort(this.rangeOrder), i = [];
-    let r = t[0];
-    for (let a = 1; a < t.length; a += 1) {
-      const o = t[a];
-      o.min() > r.max() + 1 ? (i.push(r), r = o) : o.max() > r.max() && (r = new q(r.min(), o.max()));
+    const t = [...this.getRanges(), ...n.getRanges()].sort((r, o) => r.min < o.min ? -1 : r.min > o.min ? 1 : r.max < o.max ? -1 : o.max > r.max ? 1 : 0), i = [];
+    let a = t[0];
+    for (let r = 1; r < t.length; r += 1) {
+      const o = t[r];
+      o.min > a.max + 1 ? (i.push(a), a = o) : o.max > a.max && (a = new pe([{ min: a.min, max: o.max }]));
     }
-    return i.push(r), i.length === 1 ? i[0] : new q(i);
-  }
-  intersection(n) {
-    let t = this, i = n;
-    const r = this.ranges(), a = i.ranges(), o = r.length, s = a.length;
-    let u = 0, l = 0;
-    const f = [];
-    for (; u < o && l < s; ) {
-      t = r[u], i = a[l];
-      const d = Math.max(t.min(), i.min()), c = Math.min(t.max(), i.max());
-      c >= d && f.push(new q(d, c)), t.max() > i.max() ? l += 1 : u += 1;
-    }
-    if (f.length === 0)
-      throw new Error("found range of length 0");
-    return f.length === 1 ? f[0] : new q(f);
-  }
-  coverage() {
-    let n = 0;
-    const t = this.ranges();
-    for (const i of t)
-      n += i.max() - i.min() + 1;
-    return n;
-  }
-  rangeOrder(n, t) {
-    let i = n, r = t;
-    return arguments.length < 2 && (r = i, i = this), i.min() < r.min() ? -1 : i.min() > r.min() ? 1 : i.max() < r.max() ? -1 : r.max() > i.max() ? 1 : 0;
+    return i.push(a), i.length === 1 ? i[0] : new pe(i);
   }
 }
 /*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */
@@ -837,7 +808,7 @@ function ye(e) {
   for (; --n >= 0; )
     e[n] = 0;
 }
-const hr = 0, Kn = 1, cr = 2, dr = 3, pr = 258, Zt = 29, Ze = 256, Oe = Ze + 1 + Zt, _e = 30, xt = 19, Wn = 2 * Oe + 1, se = 15, ht = 16, _r = 7, Mt = 256, Xn = 16, qn = 17, Jn = 18, Tt = (
+const hr = 0, Kn = 1, cr = 2, dr = 3, pr = 258, Zt = 29, Ze = 256, Oe = Ze + 1 + Zt, _e = 30, xt = 19, Wn = 2 * Oe + 1, ae = 15, ht = 16, _r = 7, Mt = 256, Xn = 16, qn = 17, Jn = 18, Tt = (
   /* extra bits for each length code */
   new Uint8Array([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])
 ), nt = (
@@ -858,8 +829,8 @@ const Ht = new Array(Zt);
 ye(Ht);
 const it = new Array(_e);
 ye(it);
-function ct(e, n, t, i, r) {
-  this.static_tree = e, this.extra_bits = n, this.extra_base = t, this.elems = i, this.max_length = r, this.has_stree = e && e.length;
+function ct(e, n, t, i, a) {
+  this.static_tree = e, this.extra_bits = n, this.extra_base = t, this.elems = i, this.max_length = a, this.has_stree = e && e.length;
 }
 let ei, ti, ni;
 function dt(e, n) {
@@ -885,12 +856,12 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
 }, wr = (e) => {
   e.bi_valid === 16 ? (Be(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
 }, mr = (e, n) => {
-  const t = n.dyn_tree, i = n.max_code, r = n.stat_desc.static_tree, a = n.stat_desc.has_stree, o = n.stat_desc.extra_bits, s = n.stat_desc.extra_base, u = n.stat_desc.max_length;
-  let l, f, d, c, h, _, g = 0;
-  for (c = 0; c <= se; c++)
+  const t = n.dyn_tree, i = n.max_code, a = n.stat_desc.static_tree, r = n.stat_desc.has_stree, o = n.stat_desc.extra_bits, l = n.stat_desc.extra_base, u = n.stat_desc.max_length;
+  let s, f, p, c, h, _, g = 0;
+  for (c = 0; c <= ae; c++)
     e.bl_count[c] = 0;
-  for (t[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < Wn; l++)
-    f = e.heap[l], c = t[t[f * 2 + 1] * 2 + 1] + 1, c > u && (c = u, g++), t[f * 2 + 1] = c, !(f > i) && (e.bl_count[c]++, h = 0, f >= s && (h = o[f - s]), _ = t[f * 2], e.opt_len += _ * (c + h), a && (e.static_len += _ * (r[f * 2 + 1] + h)));
+  for (t[e.heap[e.heap_max] * 2 + 1] = 0, s = e.heap_max + 1; s < Wn; s++)
+    f = e.heap[s], c = t[t[f * 2 + 1] * 2 + 1] + 1, c > u && (c = u, g++), t[f * 2 + 1] = c, !(f > i) && (e.bl_count[c]++, h = 0, f >= l && (h = o[f - l]), _ = t[f * 2], e.opt_len += _ * (c + h), r && (e.static_len += _ * (a[f * 2 + 1] + h)));
   if (g !== 0) {
     do {
       for (c = u - 1; e.bl_count[c] === 0; )
@@ -899,42 +870,42 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
     } while (g > 0);
     for (c = u; c !== 0; c--)
       for (f = e.bl_count[c]; f !== 0; )
-        d = e.heap[--l], !(d > i) && (t[d * 2 + 1] !== c && (e.opt_len += (c - t[d * 2 + 1]) * t[d * 2], t[d * 2 + 1] = c), f--);
+        p = e.heap[--s], !(p > i) && (t[p * 2 + 1] !== c && (e.opt_len += (c - t[p * 2 + 1]) * t[p * 2], t[p * 2 + 1] = c), f--);
   }
 }, ai = (e, n, t) => {
-  const i = new Array(se + 1);
-  let r = 0, a, o;
-  for (a = 1; a <= se; a++)
-    r = r + t[a - 1] << 1, i[a] = r;
+  const i = new Array(ae + 1);
+  let a = 0, r, o;
+  for (r = 1; r <= ae; r++)
+    a = a + t[r - 1] << 1, i[r] = a;
   for (o = 0; o <= n; o++) {
-    let s = e[o * 2 + 1];
-    s !== 0 && (e[o * 2] = ri(i[s]++, s));
+    let l = e[o * 2 + 1];
+    l !== 0 && (e[o * 2] = ri(i[l]++, l));
   }
 }, yr = () => {
-  let e, n, t, i, r;
-  const a = new Array(se + 1);
+  let e, n, t, i, a;
+  const r = new Array(ae + 1);
   for (t = 0, i = 0; i < Zt - 1; i++)
     for (Ht[i] = t, e = 0; e < 1 << Tt[i]; e++)
       Re[t++] = i;
-  for (Re[t - 1] = i, r = 0, i = 0; i < 16; i++)
-    for (it[i] = r, e = 0; e < 1 << nt[i]; e++)
-      ze[r++] = i;
-  for (r >>= 7; i < _e; i++)
-    for (it[i] = r << 7, e = 0; e < 1 << nt[i] - 7; e++)
-      ze[256 + r++] = i;
-  for (n = 0; n <= se; n++)
-    a[n] = 0;
+  for (Re[t - 1] = i, a = 0, i = 0; i < 16; i++)
+    for (it[i] = a, e = 0; e < 1 << nt[i]; e++)
+      ze[a++] = i;
+  for (a >>= 7; i < _e; i++)
+    for (it[i] = a << 7, e = 0; e < 1 << nt[i] - 7; e++)
+      ze[256 + a++] = i;
+  for (n = 0; n <= ae; n++)
+    r[n] = 0;
   for (e = 0; e <= 143; )
-    W[e * 2 + 1] = 8, e++, a[8]++;
+    W[e * 2 + 1] = 8, e++, r[8]++;
   for (; e <= 255; )
-    W[e * 2 + 1] = 9, e++, a[9]++;
+    W[e * 2 + 1] = 9, e++, r[9]++;
   for (; e <= 279; )
-    W[e * 2 + 1] = 7, e++, a[7]++;
+    W[e * 2 + 1] = 7, e++, r[7]++;
   for (; e <= 287; )
-    W[e * 2 + 1] = 8, e++, a[8]++;
-  for (ai(W, Oe + 1, a), e = 0; e < _e; e++)
+    W[e * 2 + 1] = 8, e++, r[8]++;
+  for (ai(W, Oe + 1, r), e = 0; e < _e; e++)
     Ie[e * 2 + 1] = 5, Ie[e * 2] = ri(e, 5);
-  ei = new ct(W, Tt, Ze + 1, Oe, se), ti = new ct(Ie, nt, 0, _e, se), ni = new ct(new Array(0), br, 0, xt, _r);
+  ei = new ct(W, Tt, Ze + 1, Oe, ae), ti = new ct(Ie, nt, 0, _e, ae), ni = new ct(new Array(0), br, 0, xt, _r);
 }, oi = (e) => {
   let n;
   for (n = 0; n < Oe; n++)
@@ -947,31 +918,31 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
 }, si = (e) => {
   e.bi_valid > 8 ? Be(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
 }, tn = (e, n, t, i) => {
-  const r = n * 2, a = t * 2;
-  return e[r] < e[a] || e[r] === e[a] && i[n] <= i[t];
+  const a = n * 2, r = t * 2;
+  return e[a] < e[r] || e[a] === e[r] && i[n] <= i[t];
 }, pt = (e, n, t) => {
   const i = e.heap[t];
-  let r = t << 1;
-  for (; r <= e.heap_len && (r < e.heap_len && tn(n, e.heap[r + 1], e.heap[r], e.depth) && r++, !tn(n, i, e.heap[r], e.depth)); )
-    e.heap[t] = e.heap[r], t = r, r <<= 1;
+  let a = t << 1;
+  for (; a <= e.heap_len && (a < e.heap_len && tn(n, e.heap[a + 1], e.heap[a], e.depth) && a++, !tn(n, i, e.heap[a], e.depth)); )
+    e.heap[t] = e.heap[a], t = a, a <<= 1;
   e.heap[t] = i;
 }, nn = (e, n, t) => {
-  let i, r, a = 0, o, s;
+  let i, a, r = 0, o, l;
   if (e.sym_next !== 0)
     do
-      i = e.pending_buf[e.sym_buf + a++] & 255, i += (e.pending_buf[e.sym_buf + a++] & 255) << 8, r = e.pending_buf[e.sym_buf + a++], i === 0 ? j(e, r, n) : (o = Re[r], j(e, o + Ze + 1, n), s = Tt[o], s !== 0 && (r -= Ht[o], D(e, r, s)), i--, o = ii(i), j(e, o, t), s = nt[o], s !== 0 && (i -= it[o], D(e, i, s)));
-    while (a < e.sym_next);
+      i = e.pending_buf[e.sym_buf + r++] & 255, i += (e.pending_buf[e.sym_buf + r++] & 255) << 8, a = e.pending_buf[e.sym_buf + r++], i === 0 ? j(e, a, n) : (o = Re[a], j(e, o + Ze + 1, n), l = Tt[o], l !== 0 && (a -= Ht[o], D(e, a, l)), i--, o = ii(i), j(e, o, t), l = nt[o], l !== 0 && (i -= it[o], D(e, i, l)));
+    while (r < e.sym_next);
   j(e, Mt, n);
 }, At = (e, n) => {
-  const t = n.dyn_tree, i = n.stat_desc.static_tree, r = n.stat_desc.has_stree, a = n.stat_desc.elems;
-  let o, s, u = -1, l;
-  for (e.heap_len = 0, e.heap_max = Wn, o = 0; o < a; o++)
+  const t = n.dyn_tree, i = n.stat_desc.static_tree, a = n.stat_desc.has_stree, r = n.stat_desc.elems;
+  let o, l, u = -1, s;
+  for (e.heap_len = 0, e.heap_max = Wn, o = 0; o < r; o++)
     t[o * 2] !== 0 ? (e.heap[++e.heap_len] = u = o, e.depth[o] = 0) : t[o * 2 + 1] = 0;
   for (; e.heap_len < 2; )
-    l = e.heap[++e.heap_len] = u < 2 ? ++u : 0, t[l * 2] = 1, e.depth[l] = 0, e.opt_len--, r && (e.static_len -= i[l * 2 + 1]);
+    s = e.heap[++e.heap_len] = u < 2 ? ++u : 0, t[s * 2] = 1, e.depth[s] = 0, e.opt_len--, a && (e.static_len -= i[s * 2 + 1]);
   for (n.max_code = u, o = e.heap_len >> 1; o >= 1; o--)
     pt(e, t, o);
-  l = a;
+  s = r;
   do
     o = e.heap[
       1
@@ -984,13 +955,13 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
       t,
       1
       /*SMALLEST*/
-    ), s = e.heap[
+    ), l = e.heap[
       1
       /*SMALLEST*/
-    ], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = s, t[l * 2] = t[o * 2] + t[s * 2], e.depth[l] = (e.depth[o] >= e.depth[s] ? e.depth[o] : e.depth[s]) + 1, t[o * 2 + 1] = t[s * 2 + 1] = l, e.heap[
+    ], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = l, t[s * 2] = t[o * 2] + t[l * 2], e.depth[s] = (e.depth[o] >= e.depth[l] ? e.depth[o] : e.depth[l]) + 1, t[o * 2 + 1] = t[l * 2 + 1] = s, e.heap[
       1
       /*SMALLEST*/
-    ] = l++, pt(
+    ] = s++, pt(
       e,
       t,
       1
@@ -1002,20 +973,20 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
     /*SMALLEST*/
   ], mr(e, n), ai(t, u, e.bl_count);
 }, rn = (e, n, t) => {
-  let i, r = -1, a, o = n[0 * 2 + 1], s = 0, u = 7, l = 4;
-  for (o === 0 && (u = 138, l = 3), n[(t + 1) * 2 + 1] = 65535, i = 0; i <= t; i++)
-    a = o, o = n[(i + 1) * 2 + 1], !(++s < u && a === o) && (s < l ? e.bl_tree[a * 2] += s : a !== 0 ? (a !== r && e.bl_tree[a * 2]++, e.bl_tree[Xn * 2]++) : s <= 10 ? e.bl_tree[qn * 2]++ : e.bl_tree[Jn * 2]++, s = 0, r = a, o === 0 ? (u = 138, l = 3) : a === o ? (u = 6, l = 3) : (u = 7, l = 4));
+  let i, a = -1, r, o = n[0 * 2 + 1], l = 0, u = 7, s = 4;
+  for (o === 0 && (u = 138, s = 3), n[(t + 1) * 2 + 1] = 65535, i = 0; i <= t; i++)
+    r = o, o = n[(i + 1) * 2 + 1], !(++l < u && r === o) && (l < s ? e.bl_tree[r * 2] += l : r !== 0 ? (r !== a && e.bl_tree[r * 2]++, e.bl_tree[Xn * 2]++) : l <= 10 ? e.bl_tree[qn * 2]++ : e.bl_tree[Jn * 2]++, l = 0, a = r, o === 0 ? (u = 138, s = 3) : r === o ? (u = 6, s = 3) : (u = 7, s = 4));
 }, an = (e, n, t) => {
-  let i, r = -1, a, o = n[0 * 2 + 1], s = 0, u = 7, l = 4;
-  for (o === 0 && (u = 138, l = 3), i = 0; i <= t; i++)
-    if (a = o, o = n[(i + 1) * 2 + 1], !(++s < u && a === o)) {
-      if (s < l)
+  let i, a = -1, r, o = n[0 * 2 + 1], l = 0, u = 7, s = 4;
+  for (o === 0 && (u = 138, s = 3), i = 0; i <= t; i++)
+    if (r = o, o = n[(i + 1) * 2 + 1], !(++l < u && r === o)) {
+      if (l < s)
         do
-          j(e, a, e.bl_tree);
-        while (--s !== 0);
+          j(e, r, e.bl_tree);
+        while (--l !== 0);
       else
-        a !== 0 ? (a !== r && (j(e, a, e.bl_tree), s--), j(e, Xn, e.bl_tree), D(e, s - 3, 2)) : s <= 10 ? (j(e, qn, e.bl_tree), D(e, s - 3, 3)) : (j(e, Jn, e.bl_tree), D(e, s - 11, 7));
-      s = 0, r = a, o === 0 ? (u = 138, l = 3) : a === o ? (u = 6, l = 3) : (u = 7, l = 4);
+        r !== 0 ? (r !== a && (j(e, r, e.bl_tree), l--), j(e, Xn, e.bl_tree), D(e, l - 3, 2)) : l <= 10 ? (j(e, qn, e.bl_tree), D(e, l - 3, 3)) : (j(e, Jn, e.bl_tree), D(e, l - 11, 7));
+      l = 0, a = r, o === 0 ? (u = 138, s = 3) : r === o ? (u = 6, s = 3) : (u = 7, s = 4);
     }
 }, vr = (e) => {
   let n;
@@ -1023,9 +994,9 @@ const ii = (e) => e < 256 ? ze[e] : ze[256 + (e >>> 7)], Be = (e, n) => {
     ;
   return e.opt_len += 3 * (n + 1) + 5 + 5 + 4, n;
 }, kr = (e, n, t, i) => {
-  let r;
-  for (D(e, n - 257, 5), D(e, t - 1, 5), D(e, i - 4, 4), r = 0; r < i; r++)
-    D(e, e.bl_tree[Qn[r] * 2 + 1], 3);
+  let a;
+  for (D(e, n - 257, 5), D(e, t - 1, 5), D(e, i - 4, 4), a = 0; a < i; a++)
+    D(e, e.bl_tree[Qn[a] * 2 + 1], 3);
   an(e, e.dyn_ltree, n - 1), an(e, e.dyn_dtree, t - 1);
 }, $r = (e) => {
   let n = 4093624447, t;
@@ -1047,8 +1018,8 @@ const Er = (e) => {
 }, Cr = (e) => {
   D(e, Kn << 1, 3), j(e, Mt, W), wr(e);
 }, Sr = (e, n, t, i) => {
-  let r, a, o = 0;
-  e.level > 0 ? (e.strm.data_type === ur && (e.strm.data_type = $r(e)), At(e, e.l_desc), At(e, e.d_desc), o = vr(e), r = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= r && (r = a)) : r = a = t + 5, t + 4 <= r && n !== -1 ? li(e, n, t, i) : e.strategy === fr || a === r ? (D(e, (Kn << 1) + (i ? 1 : 0), 3), nn(e, W, Ie)) : (D(e, (cr << 1) + (i ? 1 : 0), 3), kr(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), nn(e, e.dyn_ltree, e.dyn_dtree)), oi(e), i && si(e);
+  let a, r, o = 0;
+  e.level > 0 ? (e.strm.data_type === ur && (e.strm.data_type = $r(e)), At(e, e.l_desc), At(e, e.d_desc), o = vr(e), a = e.opt_len + 3 + 7 >>> 3, r = e.static_len + 3 + 7 >>> 3, r <= a && (a = r)) : a = r = t + 5, t + 4 <= a && n !== -1 ? li(e, n, t, i) : e.strategy === fr || r === a ? (D(e, (Kn << 1) + (i ? 1 : 0), 3), nn(e, W, Ie)) : (D(e, (cr << 1) + (i ? 1 : 0), 3), kr(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), nn(e, e.dyn_ltree, e.dyn_dtree)), oi(e), i && si(e);
 }, Nr = (e, n, t) => (e.pending_buf[e.sym_buf + e.sym_next++] = n, e.pending_buf[e.sym_buf + e.sym_next++] = n >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = t, n === 0 ? e.dyn_ltree[t * 2]++ : (e.matches++, n--, e.dyn_ltree[(Re[t] + Ze + 1) * 2]++, e.dyn_dtree[ii(n) * 2]++), e.sym_next === e.sym_end);
 var Ir = Er, Tr = li, Ar = Sr, Or = Nr, zr = Cr, Rr = {
   _tr_init: Ir,
@@ -1058,15 +1029,15 @@ var Ir = Er, Tr = li, Ar = Sr, Or = Nr, zr = Cr, Rr = {
   _tr_align: zr
 };
 const Br = (e, n, t, i) => {
-  let r = e & 65535 | 0, a = e >>> 16 & 65535 | 0, o = 0;
+  let a = e & 65535 | 0, r = e >>> 16 & 65535 | 0, o = 0;
   for (; t !== 0; ) {
     o = t > 2e3 ? 2e3 : t, t -= o;
     do
-      r = r + n[i++] | 0, a = a + r | 0;
+      a = a + n[i++] | 0, r = r + a | 0;
     while (--o);
-    r %= 65521, a %= 65521;
+    a %= 65521, r %= 65521;
   }
-  return r | a << 16 | 0;
+  return a | r << 16 | 0;
 };
 var Ue = Br;
 const Ur = () => {
@@ -1079,10 +1050,10 @@ const Ur = () => {
   }
   return n;
 }, Dr = new Uint32Array(Ur()), Vr = (e, n, t, i) => {
-  const r = Dr, a = i + t;
+  const a = Dr, r = i + t;
   e ^= -1;
-  for (let o = i; o < a; o++)
-    e = e >>> 8 ^ r[(e ^ n[o]) & 255];
+  for (let o = i; o < r; o++)
+    e = e >>> 8 ^ a[(e ^ n[o]) & 255];
   return e ^ -1;
 };
 var R = Vr, ge = {
@@ -1144,11 +1115,11 @@ var R = Vr, ge = {
   Z_DEFLATED: 8
   //Z_NULL:                 null // Use -1 or null inline, depending on var type
 };
-const { _tr_init: Lr, _tr_stored_block: Ot, _tr_flush_block: Fr, _tr_tally: te, _tr_align: Pr } = Rr, {
-  Z_NO_FLUSH: ne,
+const { _tr_init: Fr, _tr_stored_block: Ot, _tr_flush_block: Lr, _tr_tally: ee, _tr_align: Pr } = Rr, {
+  Z_NO_FLUSH: te,
   Z_PARTIAL_FLUSH: Zr,
   Z_FULL_FLUSH: xr,
-  Z_FINISH: F,
+  Z_FINISH: L,
   Z_BLOCK: sn,
   Z_OK: B,
   Z_STREAM_END: ln,
@@ -1163,155 +1134,155 @@ const { _tr_init: Lr, _tr_stored_block: Ot, _tr_flush_block: Fr, _tr_tally: te,
   Z_DEFAULT_STRATEGY: Kr,
   Z_UNKNOWN: Wr,
   Z_DEFLATED: lt
-} = xe, Xr = 9, qr = 15, Jr = 8, Qr = 29, ea = 256, zt = ea + 1 + Qr, ta = 30, na = 19, ia = 2 * zt + 1, ra = 15, T = 3, ee = 258, Y = ee + T + 1, aa = 32, we = 42, jt = 57, Rt = 69, Bt = 73, Ut = 91, Dt = 103, le = 113, Se = 666, U = 1, ve = 2, ue = 3, ke = 4, oa = 3, fe = (e, n) => (e.msg = ge[n], n), fn = (e) => e * 2 - (e > 4 ? 9 : 0), J = (e) => {
+} = xe, Xr = 9, qr = 15, Jr = 8, Qr = 29, ea = 256, zt = ea + 1 + Qr, ta = 30, na = 19, ia = 2 * zt + 1, ra = 15, T = 3, Q = 258, Y = Q + T + 1, aa = 32, we = 42, jt = 57, Rt = 69, Bt = 73, Ut = 91, Dt = 103, oe = 113, Se = 666, U = 1, ve = 2, fe = 3, ke = 4, oa = 3, se = (e, n) => (e.msg = ge[n], n), fn = (e) => e * 2 - (e > 4 ? 9 : 0), q = (e) => {
   let n = e.length;
   for (; --n >= 0; )
     e[n] = 0;
 }, sa = (e) => {
-  let n, t, i, r = e.w_size;
+  let n, t, i, a = e.w_size;
   n = e.hash_size, i = n;
   do
-    t = e.head[--i], e.head[i] = t >= r ? t - r : 0;
+    t = e.head[--i], e.head[i] = t >= a ? t - a : 0;
   while (--n);
-  n = r, i = n;
+  n = a, i = n;
   do
-    t = e.prev[--i], e.prev[i] = t >= r ? t - r : 0;
+    t = e.prev[--i], e.prev[i] = t >= a ? t - a : 0;
   while (--n);
 };
-let la = (e, n, t) => (n << e.hash_shift ^ t) & e.hash_mask, ie = la;
+let la = (e, n, t) => (n << e.hash_shift ^ t) & e.hash_mask, ne = la;
 const V = (e) => {
   const n = e.state;
   let t = n.pending;
   t > e.avail_out && (t = e.avail_out), t !== 0 && (e.output.set(n.pending_buf.subarray(n.pending_out, n.pending_out + t), e.next_out), e.next_out += t, n.pending_out += t, e.total_out += t, e.avail_out -= t, n.pending -= t, n.pending === 0 && (n.pending_out = 0));
-}, L = (e, n) => {
-  Fr(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, n), e.block_start = e.strstart, V(e.strm);
+}, F = (e, n) => {
+  Lr(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, n), e.block_start = e.strstart, V(e.strm);
 }, A = (e, n) => {
   e.pending_buf[e.pending++] = n;
 }, Ce = (e, n) => {
   e.pending_buf[e.pending++] = n >>> 8 & 255, e.pending_buf[e.pending++] = n & 255;
 }, Vt = (e, n, t, i) => {
-  let r = e.avail_in;
-  return r > i && (r = i), r === 0 ? 0 : (e.avail_in -= r, n.set(e.input.subarray(e.next_in, e.next_in + r), t), e.state.wrap === 1 ? e.adler = Ue(e.adler, n, r, t) : e.state.wrap === 2 && (e.adler = R(e.adler, n, r, t)), e.next_in += r, e.total_in += r, r);
+  let a = e.avail_in;
+  return a > i && (a = i), a === 0 ? 0 : (e.avail_in -= a, n.set(e.input.subarray(e.next_in, e.next_in + a), t), e.state.wrap === 1 ? e.adler = Ue(e.adler, n, a, t) : e.state.wrap === 2 && (e.adler = R(e.adler, n, a, t)), e.next_in += a, e.total_in += a, a);
 }, fi = (e, n) => {
-  let t = e.max_chain_length, i = e.strstart, r, a, o = e.prev_length, s = e.nice_match;
-  const u = e.strstart > e.w_size - Y ? e.strstart - (e.w_size - Y) : 0, l = e.window, f = e.w_mask, d = e.prev, c = e.strstart + ee;
-  let h = l[i + o - 1], _ = l[i + o];
-  e.prev_length >= e.good_match && (t >>= 2), s > e.lookahead && (s = e.lookahead);
+  let t = e.max_chain_length, i = e.strstart, a, r, o = e.prev_length, l = e.nice_match;
+  const u = e.strstart > e.w_size - Y ? e.strstart - (e.w_size - Y) : 0, s = e.window, f = e.w_mask, p = e.prev, c = e.strstart + Q;
+  let h = s[i + o - 1], _ = s[i + o];
+  e.prev_length >= e.good_match && (t >>= 2), l > e.lookahead && (l = e.lookahead);
   do
-    if (r = n, !(l[r + o] !== _ || l[r + o - 1] !== h || l[r] !== l[i] || l[++r] !== l[i + 1])) {
-      i += 2, r++;
+    if (a = n, !(s[a + o] !== _ || s[a + o - 1] !== h || s[a] !== s[i] || s[++a] !== s[i + 1])) {
+      i += 2, a++;
       do
         ;
-      while (l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && l[++i] === l[++r] && i < c);
-      if (a = ee - (c - i), i = c - ee, a > o) {
-        if (e.match_start = n, o = a, a >= s)
+      while (s[++i] === s[++a] && s[++i] === s[++a] && s[++i] === s[++a] && s[++i] === s[++a] && s[++i] === s[++a] && s[++i] === s[++a] && s[++i] === s[++a] && s[++i] === s[++a] && i < c);
+      if (r = Q - (c - i), i = c - Q, r > o) {
+        if (e.match_start = n, o = r, r >= l)
           break;
-        h = l[i + o - 1], _ = l[i + o];
+        h = s[i + o - 1], _ = s[i + o];
       }
     }
-  while ((n = d[n & f]) > u && --t !== 0);
+  while ((n = p[n & f]) > u && --t !== 0);
   return o <= e.lookahead ? o : e.lookahead;
 }, me = (e) => {
   const n = e.w_size;
-  let t, i, r;
+  let t, i, a;
   do {
     if (i = e.window_size - e.lookahead - e.strstart, e.strstart >= n + (n - Y) && (e.window.set(e.window.subarray(n, n + n - i), 0), e.match_start -= n, e.strstart -= n, e.block_start -= n, e.insert > e.strstart && (e.insert = e.strstart), sa(e), i += n), e.strm.avail_in === 0)
       break;
     if (t = Vt(e.strm, e.window, e.strstart + e.lookahead, i), e.lookahead += t, e.lookahead + e.insert >= T)
-      for (r = e.strstart - e.insert, e.ins_h = e.window[r], e.ins_h = ie(e, e.ins_h, e.window[r + 1]); e.insert && (e.ins_h = ie(e, e.ins_h, e.window[r + T - 1]), e.prev[r & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = r, r++, e.insert--, !(e.lookahead + e.insert < T)); )
+      for (a = e.strstart - e.insert, e.ins_h = e.window[a], e.ins_h = ne(e, e.ins_h, e.window[a + 1]); e.insert && (e.ins_h = ne(e, e.ins_h, e.window[a + T - 1]), e.prev[a & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = a, a++, e.insert--, !(e.lookahead + e.insert < T)); )
         ;
   } while (e.lookahead < Y && e.strm.avail_in !== 0);
 }, ui = (e, n) => {
-  let t = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, i, r, a, o = 0, s = e.strm.avail_in;
+  let t = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, i, a, r, o = 0, l = e.strm.avail_in;
   do {
-    if (i = 65535, a = e.bi_valid + 42 >> 3, e.strm.avail_out < a || (a = e.strm.avail_out - a, r = e.strstart - e.block_start, i > r + e.strm.avail_in && (i = r + e.strm.avail_in), i > a && (i = a), i < t && (i === 0 && n !== F || n === ne || i !== r + e.strm.avail_in)))
+    if (i = 65535, r = e.bi_valid + 42 >> 3, e.strm.avail_out < r || (r = e.strm.avail_out - r, a = e.strstart - e.block_start, i > a + e.strm.avail_in && (i = a + e.strm.avail_in), i > r && (i = r), i < t && (i === 0 && n !== L || n === te || i !== a + e.strm.avail_in)))
       break;
-    o = n === F && i === r + e.strm.avail_in ? 1 : 0, Ot(e, 0, 0, o), e.pending_buf[e.pending - 4] = i, e.pending_buf[e.pending - 3] = i >> 8, e.pending_buf[e.pending - 2] = ~i, e.pending_buf[e.pending - 1] = ~i >> 8, V(e.strm), r && (r > i && (r = i), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + r), e.strm.next_out), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r, e.block_start += r, i -= r), i && (Vt(e.strm, e.strm.output, e.strm.next_out, i), e.strm.next_out += i, e.strm.avail_out -= i, e.strm.total_out += i);
+    o = n === L && i === a + e.strm.avail_in ? 1 : 0, Ot(e, 0, 0, o), e.pending_buf[e.pending - 4] = i, e.pending_buf[e.pending - 3] = i >> 8, e.pending_buf[e.pending - 2] = ~i, e.pending_buf[e.pending - 1] = ~i >> 8, V(e.strm), a && (a > i && (a = i), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + a), e.strm.next_out), e.strm.next_out += a, e.strm.avail_out -= a, e.strm.total_out += a, e.block_start += a, i -= a), i && (Vt(e.strm, e.strm.output, e.strm.next_out, i), e.strm.next_out += i, e.strm.avail_out -= i, e.strm.total_out += i);
   } while (o === 0);
-  return s -= e.strm.avail_in, s && (s >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= s && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - s, e.strm.next_in), e.strstart), e.strstart += s, e.insert += s > e.w_size - e.insert ? e.w_size - e.insert : s), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), o ? ke : n !== ne && n !== F && e.strm.avail_in === 0 && e.strstart === e.block_start ? ve : (a = e.window_size - e.strstart, e.strm.avail_in > a && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, a += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), a > e.strm.avail_in && (a = e.strm.avail_in), a && (Vt(e.strm, e.window, e.strstart, a), e.strstart += a, e.insert += a > e.w_size - e.insert ? e.w_size - e.insert : a), e.high_water < e.strstart && (e.high_water = e.strstart), a = e.bi_valid + 42 >> 3, a = e.pending_buf_size - a > 65535 ? 65535 : e.pending_buf_size - a, t = a > e.w_size ? e.w_size : a, r = e.strstart - e.block_start, (r >= t || (r || n === F) && n !== ne && e.strm.avail_in === 0 && r <= a) && (i = r > a ? a : r, o = n === F && e.strm.avail_in === 0 && i === r ? 1 : 0, Ot(e, e.block_start, i, o), e.block_start += i, V(e.strm)), o ? ue : U);
+  return l -= e.strm.avail_in, l && (l >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= l && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - l, e.strm.next_in), e.strstart), e.strstart += l, e.insert += l > e.w_size - e.insert ? e.w_size - e.insert : l), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), o ? ke : n !== te && n !== L && e.strm.avail_in === 0 && e.strstart === e.block_start ? ve : (r = e.window_size - e.strstart, e.strm.avail_in > r && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, r += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), r > e.strm.avail_in && (r = e.strm.avail_in), r && (Vt(e.strm, e.window, e.strstart, r), e.strstart += r, e.insert += r > e.w_size - e.insert ? e.w_size - e.insert : r), e.high_water < e.strstart && (e.high_water = e.strstart), r = e.bi_valid + 42 >> 3, r = e.pending_buf_size - r > 65535 ? 65535 : e.pending_buf_size - r, t = r > e.w_size ? e.w_size : r, a = e.strstart - e.block_start, (a >= t || (a || n === L) && n !== te && e.strm.avail_in === 0 && a <= r) && (i = a > r ? r : a, o = n === L && e.strm.avail_in === 0 && i === a ? 1 : 0, Ot(e, e.block_start, i, o), e.block_start += i, V(e.strm)), o ? fe : U);
 }, bt = (e, n) => {
   let t, i;
   for (; ; ) {
     if (e.lookahead < Y) {
-      if (me(e), e.lookahead < Y && n === ne)
+      if (me(e), e.lookahead < Y && n === te)
         return U;
       if (e.lookahead === 0)
         break;
     }
-    if (t = 0, e.lookahead >= T && (e.ins_h = ie(e, e.ins_h, e.window[e.strstart + T - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), t !== 0 && e.strstart - t <= e.w_size - Y && (e.match_length = fi(e, t)), e.match_length >= T)
-      if (i = te(e, e.strstart - e.match_start, e.match_length - T), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= T) {
+    if (t = 0, e.lookahead >= T && (e.ins_h = ne(e, e.ins_h, e.window[e.strstart + T - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), t !== 0 && e.strstart - t <= e.w_size - Y && (e.match_length = fi(e, t)), e.match_length >= T)
+      if (i = ee(e, e.strstart - e.match_start, e.match_length - T), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= T) {
         e.match_length--;
         do
-          e.strstart++, e.ins_h = ie(e, e.ins_h, e.window[e.strstart + T - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
+          e.strstart++, e.ins_h = ne(e, e.ins_h, e.window[e.strstart + T - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
         while (--e.match_length !== 0);
         e.strstart++;
       } else
-        e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = ie(e, e.ins_h, e.window[e.strstart + 1]);
+        e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = ne(e, e.ins_h, e.window[e.strstart + 1]);
     else
-      i = te(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
-    if (i && (L(e, !1), e.strm.avail_out === 0))
+      i = ee(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+    if (i && (F(e, !1), e.strm.avail_out === 0))
       return U;
   }
-  return e.insert = e.strstart < T - 1 ? e.strstart : T - 1, n === F ? (L(e, !0), e.strm.avail_out === 0 ? ue : ke) : e.sym_next && (L(e, !1), e.strm.avail_out === 0) ? U : ve;
-}, de = (e, n) => {
-  let t, i, r;
+  return e.insert = e.strstart < T - 1 ? e.strstart : T - 1, n === L ? (F(e, !0), e.strm.avail_out === 0 ? fe : ke) : e.sym_next && (F(e, !1), e.strm.avail_out === 0) ? U : ve;
+}, ce = (e, n) => {
+  let t, i, a;
   for (; ; ) {
     if (e.lookahead < Y) {
-      if (me(e), e.lookahead < Y && n === ne)
+      if (me(e), e.lookahead < Y && n === te)
         return U;
       if (e.lookahead === 0)
         break;
     }
-    if (t = 0, e.lookahead >= T && (e.ins_h = ie(e, e.ins_h, e.window[e.strstart + T - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = T - 1, t !== 0 && e.prev_length < e.max_lazy_match && e.strstart - t <= e.w_size - Y && (e.match_length = fi(e, t), e.match_length <= 5 && (e.strategy === jr || e.match_length === T && e.strstart - e.match_start > 4096) && (e.match_length = T - 1)), e.prev_length >= T && e.match_length <= e.prev_length) {
-      r = e.strstart + e.lookahead - T, i = te(e, e.strstart - 1 - e.prev_match, e.prev_length - T), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+    if (t = 0, e.lookahead >= T && (e.ins_h = ne(e, e.ins_h, e.window[e.strstart + T - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = T - 1, t !== 0 && e.prev_length < e.max_lazy_match && e.strstart - t <= e.w_size - Y && (e.match_length = fi(e, t), e.match_length <= 5 && (e.strategy === jr || e.match_length === T && e.strstart - e.match_start > 4096) && (e.match_length = T - 1)), e.prev_length >= T && e.match_length <= e.prev_length) {
+      a = e.strstart + e.lookahead - T, i = ee(e, e.strstart - 1 - e.prev_match, e.prev_length - T), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
       do
-        ++e.strstart <= r && (e.ins_h = ie(e, e.ins_h, e.window[e.strstart + T - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
+        ++e.strstart <= a && (e.ins_h = ne(e, e.ins_h, e.window[e.strstart + T - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
       while (--e.prev_length !== 0);
-      if (e.match_available = 0, e.match_length = T - 1, e.strstart++, i && (L(e, !1), e.strm.avail_out === 0))
+      if (e.match_available = 0, e.match_length = T - 1, e.strstart++, i && (F(e, !1), e.strm.avail_out === 0))
         return U;
     } else if (e.match_available) {
-      if (i = te(e, 0, e.window[e.strstart - 1]), i && L(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
+      if (i = ee(e, 0, e.window[e.strstart - 1]), i && F(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
         return U;
     } else
       e.match_available = 1, e.strstart++, e.lookahead--;
   }
-  return e.match_available && (i = te(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < T - 1 ? e.strstart : T - 1, n === F ? (L(e, !0), e.strm.avail_out === 0 ? ue : ke) : e.sym_next && (L(e, !1), e.strm.avail_out === 0) ? U : ve;
+  return e.match_available && (i = ee(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < T - 1 ? e.strstart : T - 1, n === L ? (F(e, !0), e.strm.avail_out === 0 ? fe : ke) : e.sym_next && (F(e, !1), e.strm.avail_out === 0) ? U : ve;
 }, fa = (e, n) => {
-  let t, i, r, a;
+  let t, i, a, r;
   const o = e.window;
   for (; ; ) {
-    if (e.lookahead <= ee) {
-      if (me(e), e.lookahead <= ee && n === ne)
+    if (e.lookahead <= Q) {
+      if (me(e), e.lookahead <= Q && n === te)
         return U;
       if (e.lookahead === 0)
         break;
     }
-    if (e.match_length = 0, e.lookahead >= T && e.strstart > 0 && (r = e.strstart - 1, i = o[r], i === o[++r] && i === o[++r] && i === o[++r])) {
-      a = e.strstart + ee;
+    if (e.match_length = 0, e.lookahead >= T && e.strstart > 0 && (a = e.strstart - 1, i = o[a], i === o[++a] && i === o[++a] && i === o[++a])) {
+      r = e.strstart + Q;
       do
         ;
-      while (i === o[++r] && i === o[++r] && i === o[++r] && i === o[++r] && i === o[++r] && i === o[++r] && i === o[++r] && i === o[++r] && r < a);
-      e.match_length = ee - (a - r), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+      while (i === o[++a] && i === o[++a] && i === o[++a] && i === o[++a] && i === o[++a] && i === o[++a] && i === o[++a] && i === o[++a] && a < r);
+      e.match_length = Q - (r - a), e.match_length > e.lookahead && (e.match_length = e.lookahead);
     }
-    if (e.match_length >= T ? (t = te(e, 1, e.match_length - T), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (t = te(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), t && (L(e, !1), e.strm.avail_out === 0))
+    if (e.match_length >= T ? (t = ee(e, 1, e.match_length - T), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (t = ee(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), t && (F(e, !1), e.strm.avail_out === 0))
       return U;
   }
-  return e.insert = 0, n === F ? (L(e, !0), e.strm.avail_out === 0 ? ue : ke) : e.sym_next && (L(e, !1), e.strm.avail_out === 0) ? U : ve;
+  return e.insert = 0, n === L ? (F(e, !0), e.strm.avail_out === 0 ? fe : ke) : e.sym_next && (F(e, !1), e.strm.avail_out === 0) ? U : ve;
 }, ua = (e, n) => {
   let t;
   for (; ; ) {
     if (e.lookahead === 0 && (me(e), e.lookahead === 0)) {
-      if (n === ne)
+      if (n === te)
         return U;
       break;
     }
-    if (e.match_length = 0, t = te(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, t && (L(e, !1), e.strm.avail_out === 0))
+    if (e.match_length = 0, t = ee(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, t && (F(e, !1), e.strm.avail_out === 0))
       return U;
   }
-  return e.insert = 0, n === F ? (L(e, !0), e.strm.avail_out === 0 ? ue : ke) : e.sym_next && (L(e, !1), e.strm.avail_out === 0) ? U : ve;
+  return e.insert = 0, n === L ? (F(e, !0), e.strm.avail_out === 0 ? fe : ke) : e.sym_next && (F(e, !1), e.strm.avail_out === 0) ? U : ve;
 };
-function H(e, n, t, i, r) {
-  this.good_length = e, this.max_lazy = n, this.nice_length = t, this.max_chain = i, this.func = r;
+function H(e, n, t, i, a) {
+  this.good_length = e, this.max_lazy = n, this.nice_length = t, this.max_chain = i, this.func = a;
 }
 const Ne = [
   /*      good lazy nice chain */
@@ -1323,23 +1294,23 @@ const Ne = [
   /* 2 */
   new H(4, 6, 32, 32, bt),
   /* 3 */
-  new H(4, 4, 16, 16, de),
+  new H(4, 4, 16, 16, ce),
   /* 4 lazy matches */
-  new H(8, 16, 32, 32, de),
+  new H(8, 16, 32, 32, ce),
   /* 5 */
-  new H(8, 16, 128, 128, de),
+  new H(8, 16, 128, 128, ce),
   /* 6 */
-  new H(8, 32, 128, 256, de),
+  new H(8, 32, 128, 256, ce),
   /* 7 */
-  new H(32, 128, 258, 1024, de),
+  new H(32, 128, 258, 1024, ce),
   /* 8 */
-  new H(32, 258, 258, 4096, de)
+  new H(32, 258, 258, 4096, ce)
   /* 9 max compression */
 ], ha = (e) => {
-  e.window_size = 2 * e.w_size, J(e.head), e.max_lazy_match = Ne[e.level].max_lazy, e.good_match = Ne[e.level].good_length, e.nice_match = Ne[e.level].nice_length, e.max_chain_length = Ne[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = T - 1, e.match_available = 0, e.ins_h = 0;
+  e.window_size = 2 * e.w_size, q(e.head), e.max_lazy_match = Ne[e.level].max_lazy, e.good_match = Ne[e.level].good_length, e.nice_match = Ne[e.level].nice_length, e.max_chain_length = Ne[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = T - 1, e.match_available = 0, e.ins_h = 0;
 };
 function ca() {
-  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = lt, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(ia * 2), this.dyn_dtree = new Uint16Array((2 * ta + 1) * 2), this.bl_tree = new Uint16Array((2 * na + 1) * 2), J(this.dyn_ltree), J(this.dyn_dtree), J(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(ra + 1), this.heap = new Uint16Array(2 * zt + 1), J(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * zt + 1), J(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+  this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = lt, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(ia * 2), this.dyn_dtree = new Uint16Array((2 * ta + 1) * 2), this.bl_tree = new Uint16Array((2 * na + 1) * 2), q(this.dyn_ltree), q(this.dyn_dtree), q(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(ra + 1), this.heap = new Uint16Array(2 * zt + 1), q(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * zt + 1), q(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
 }
 const Me = (e) => {
   if (!e)
@@ -1347,46 +1318,46 @@ const Me = (e) => {
   const n = e.state;
   return !n || n.strm !== e || n.status !== we && //#ifdef GZIP
   n.status !== jt && //#endif
-  n.status !== Rt && n.status !== Bt && n.status !== Ut && n.status !== Dt && n.status !== le && n.status !== Se ? 1 : 0;
+  n.status !== Rt && n.status !== Bt && n.status !== Ut && n.status !== Dt && n.status !== oe && n.status !== Se ? 1 : 0;
 }, hi = (e) => {
   if (Me(e))
-    return fe(e, G);
+    return se(e, G);
   e.total_in = e.total_out = 0, e.data_type = Wr;
   const n = e.state;
   return n.pending = 0, n.pending_out = 0, n.wrap < 0 && (n.wrap = -n.wrap), n.status = //#ifdef GZIP
   n.wrap === 2 ? jt : (
     //#endif
-    n.wrap ? we : le
-  ), e.adler = n.wrap === 2 ? 0 : 1, n.last_flush = -2, Lr(n), B;
+    n.wrap ? we : oe
+  ), e.adler = n.wrap === 2 ? 0 : 1, n.last_flush = -2, Fr(n), B;
 }, ci = (e) => {
   const n = hi(e);
   return n === B && ha(e.state), n;
-}, da = (e, n) => Me(e) || e.state.wrap !== 2 ? G : (e.state.gzhead = n, B), di = (e, n, t, i, r, a) => {
+}, da = (e, n) => Me(e) || e.state.wrap !== 2 ? G : (e.state.gzhead = n, B), di = (e, n, t, i, a, r) => {
   if (!e)
     return G;
   let o = 1;
-  if (n === Hr && (n = 6), i < 0 ? (o = 0, i = -i) : i > 15 && (o = 2, i -= 16), r < 1 || r > Xr || t !== lt || i < 8 || i > 15 || n < 0 || n > 9 || a < 0 || a > Yr || i === 8 && o !== 1)
-    return fe(e, G);
+  if (n === Hr && (n = 6), i < 0 ? (o = 0, i = -i) : i > 15 && (o = 2, i -= 16), a < 1 || a > Xr || t !== lt || i < 8 || i > 15 || n < 0 || n > 9 || r < 0 || r > Yr || i === 8 && o !== 1)
+    return se(e, G);
   i === 8 && (i = 9);
-  const s = new ca();
-  return e.state = s, s.strm = e, s.status = we, s.wrap = o, s.gzhead = null, s.w_bits = i, s.w_size = 1 << s.w_bits, s.w_mask = s.w_size - 1, s.hash_bits = r + 7, s.hash_size = 1 << s.hash_bits, s.hash_mask = s.hash_size - 1, s.hash_shift = ~~((s.hash_bits + T - 1) / T), s.window = new Uint8Array(s.w_size * 2), s.head = new Uint16Array(s.hash_size), s.prev = new Uint16Array(s.w_size), s.lit_bufsize = 1 << r + 6, s.pending_buf_size = s.lit_bufsize * 4, s.pending_buf = new Uint8Array(s.pending_buf_size), s.sym_buf = s.lit_bufsize, s.sym_end = (s.lit_bufsize - 1) * 3, s.level = n, s.strategy = a, s.method = t, ci(e);
+  const l = new ca();
+  return e.state = l, l.strm = e, l.status = we, l.wrap = o, l.gzhead = null, l.w_bits = i, l.w_size = 1 << l.w_bits, l.w_mask = l.w_size - 1, l.hash_bits = a + 7, l.hash_size = 1 << l.hash_bits, l.hash_mask = l.hash_size - 1, l.hash_shift = ~~((l.hash_bits + T - 1) / T), l.window = new Uint8Array(l.w_size * 2), l.head = new Uint16Array(l.hash_size), l.prev = new Uint16Array(l.w_size), l.lit_bufsize = 1 << a + 6, l.pending_buf_size = l.lit_bufsize * 4, l.pending_buf = new Uint8Array(l.pending_buf_size), l.sym_buf = l.lit_bufsize, l.sym_end = (l.lit_bufsize - 1) * 3, l.level = n, l.strategy = r, l.method = t, ci(e);
 }, pa = (e, n) => di(e, n, lt, qr, Jr, Kr), _a = (e, n) => {
   if (Me(e) || n > sn || n < 0)
-    return e ? fe(e, G) : G;
+    return e ? se(e, G) : G;
   const t = e.state;
-  if (!e.output || e.avail_in !== 0 && !e.input || t.status === Se && n !== F)
-    return fe(e, e.avail_out === 0 ? _t : G);
+  if (!e.output || e.avail_in !== 0 && !e.input || t.status === Se && n !== L)
+    return se(e, e.avail_out === 0 ? _t : G);
   const i = t.last_flush;
   if (t.last_flush = n, t.pending !== 0) {
     if (V(e), e.avail_out === 0)
       return t.last_flush = -1, B;
-  } else if (e.avail_in === 0 && fn(n) <= fn(i) && n !== F)
-    return fe(e, _t);
+  } else if (e.avail_in === 0 && fn(n) <= fn(i) && n !== L)
+    return se(e, _t);
   if (t.status === Se && e.avail_in !== 0)
-    return fe(e, _t);
-  if (t.status === we && t.wrap === 0 && (t.status = le), t.status === we) {
-    let r = lt + (t.w_bits - 8 << 4) << 8, a = -1;
-    if (t.strategy >= We || t.level < 2 ? a = 0 : t.level < 6 ? a = 1 : t.level === 6 ? a = 2 : a = 3, r |= a << 6, t.strstart !== 0 && (r |= aa), r += 31 - r % 31, Ce(t, r), t.strstart !== 0 && (Ce(t, e.adler >>> 16), Ce(t, e.adler & 65535)), e.adler = 1, t.status = le, V(e), t.pending !== 0)
+    return se(e, _t);
+  if (t.status === we && t.wrap === 0 && (t.status = oe), t.status === we) {
+    let a = lt + (t.w_bits - 8 << 4) << 8, r = -1;
+    if (t.strategy >= We || t.level < 2 ? r = 0 : t.level < 6 ? r = 1 : t.level === 6 ? r = 2 : r = 3, a |= r << 6, t.strstart !== 0 && (a |= aa), a += 31 - a % 31, Ce(t, a), t.strstart !== 0 && (Ce(t, e.adler >>> 16), Ce(t, e.adler & 65535)), e.adler = 1, t.status = oe, V(e), t.pending !== 0)
       return t.last_flush = -1, B;
   }
   if (t.status === jt) {
@@ -1395,50 +1366,50 @@ const Me = (e) => {
         t,
         (t.gzhead.text ? 1 : 0) + (t.gzhead.hcrc ? 2 : 0) + (t.gzhead.extra ? 4 : 0) + (t.gzhead.name ? 8 : 0) + (t.gzhead.comment ? 16 : 0)
       ), A(t, t.gzhead.time & 255), A(t, t.gzhead.time >> 8 & 255), A(t, t.gzhead.time >> 16 & 255), A(t, t.gzhead.time >> 24 & 255), A(t, t.level === 9 ? 2 : t.strategy >= We || t.level < 2 ? 4 : 0), A(t, t.gzhead.os & 255), t.gzhead.extra && t.gzhead.extra.length && (A(t, t.gzhead.extra.length & 255), A(t, t.gzhead.extra.length >> 8 & 255)), t.gzhead.hcrc && (e.adler = R(e.adler, t.pending_buf, t.pending, 0)), t.gzindex = 0, t.status = Rt;
-    else if (A(t, 0), A(t, 0), A(t, 0), A(t, 0), A(t, 0), A(t, t.level === 9 ? 2 : t.strategy >= We || t.level < 2 ? 4 : 0), A(t, oa), t.status = le, V(e), t.pending !== 0)
+    else if (A(t, 0), A(t, 0), A(t, 0), A(t, 0), A(t, 0), A(t, t.level === 9 ? 2 : t.strategy >= We || t.level < 2 ? 4 : 0), A(t, oa), t.status = oe, V(e), t.pending !== 0)
       return t.last_flush = -1, B;
   }
   if (t.status === Rt) {
     if (t.gzhead.extra) {
-      let r = t.pending, a = (t.gzhead.extra.length & 65535) - t.gzindex;
-      for (; t.pending + a > t.pending_buf_size; ) {
-        let s = t.pending_buf_size - t.pending;
-        if (t.pending_buf.set(t.gzhead.extra.subarray(t.gzindex, t.gzindex + s), t.pending), t.pending = t.pending_buf_size, t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex += s, V(e), t.pending !== 0)
+      let a = t.pending, r = (t.gzhead.extra.length & 65535) - t.gzindex;
+      for (; t.pending + r > t.pending_buf_size; ) {
+        let l = t.pending_buf_size - t.pending;
+        if (t.pending_buf.set(t.gzhead.extra.subarray(t.gzindex, t.gzindex + l), t.pending), t.pending = t.pending_buf_size, t.gzhead.hcrc && t.pending > a && (e.adler = R(e.adler, t.pending_buf, t.pending - a, a)), t.gzindex += l, V(e), t.pending !== 0)
           return t.last_flush = -1, B;
-        r = 0, a -= s;
+        a = 0, r -= l;
       }
       let o = new Uint8Array(t.gzhead.extra);
-      t.pending_buf.set(o.subarray(t.gzindex, t.gzindex + a), t.pending), t.pending += a, t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex = 0;
+      t.pending_buf.set(o.subarray(t.gzindex, t.gzindex + r), t.pending), t.pending += r, t.gzhead.hcrc && t.pending > a && (e.adler = R(e.adler, t.pending_buf, t.pending - a, a)), t.gzindex = 0;
     }
     t.status = Bt;
   }
   if (t.status === Bt) {
     if (t.gzhead.name) {
-      let r = t.pending, a;
+      let a = t.pending, r;
       do {
         if (t.pending === t.pending_buf_size) {
-          if (t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r)), V(e), t.pending !== 0)
+          if (t.gzhead.hcrc && t.pending > a && (e.adler = R(e.adler, t.pending_buf, t.pending - a, a)), V(e), t.pending !== 0)
             return t.last_flush = -1, B;
-          r = 0;
+          a = 0;
         }
-        t.gzindex < t.gzhead.name.length ? a = t.gzhead.name.charCodeAt(t.gzindex++) & 255 : a = 0, A(t, a);
-      } while (a !== 0);
-      t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex = 0;
+        t.gzindex < t.gzhead.name.length ? r = t.gzhead.name.charCodeAt(t.gzindex++) & 255 : r = 0, A(t, r);
+      } while (r !== 0);
+      t.gzhead.hcrc && t.pending > a && (e.adler = R(e.adler, t.pending_buf, t.pending - a, a)), t.gzindex = 0;
     }
     t.status = Ut;
   }
   if (t.status === Ut) {
     if (t.gzhead.comment) {
-      let r = t.pending, a;
+      let a = t.pending, r;
       do {
         if (t.pending === t.pending_buf_size) {
-          if (t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r)), V(e), t.pending !== 0)
+          if (t.gzhead.hcrc && t.pending > a && (e.adler = R(e.adler, t.pending_buf, t.pending - a, a)), V(e), t.pending !== 0)
             return t.last_flush = -1, B;
-          r = 0;
+          a = 0;
         }
-        t.gzindex < t.gzhead.comment.length ? a = t.gzhead.comment.charCodeAt(t.gzindex++) & 255 : a = 0, A(t, a);
-      } while (a !== 0);
-      t.gzhead.hcrc && t.pending > r && (e.adler = R(e.adler, t.pending_buf, t.pending - r, r));
+        t.gzindex < t.gzhead.comment.length ? r = t.gzhead.comment.charCodeAt(t.gzindex++) & 255 : r = 0, A(t, r);
+      } while (r !== 0);
+      t.gzhead.hcrc && t.pending > a && (e.adler = R(e.adler, t.pending_buf, t.pending - a, a));
     }
     t.status = Dt;
   }
@@ -1448,43 +1419,43 @@ const Me = (e) => {
         return t.last_flush = -1, B;
       A(t, e.adler & 255), A(t, e.adler >> 8 & 255), e.adler = 0;
     }
-    if (t.status = le, V(e), t.pending !== 0)
+    if (t.status = oe, V(e), t.pending !== 0)
       return t.last_flush = -1, B;
   }
-  if (e.avail_in !== 0 || t.lookahead !== 0 || n !== ne && t.status !== Se) {
-    let r = t.level === 0 ? ui(t, n) : t.strategy === We ? ua(t, n) : t.strategy === Gr ? fa(t, n) : Ne[t.level].func(t, n);
-    if ((r === ue || r === ke) && (t.status = Se), r === U || r === ue)
+  if (e.avail_in !== 0 || t.lookahead !== 0 || n !== te && t.status !== Se) {
+    let a = t.level === 0 ? ui(t, n) : t.strategy === We ? ua(t, n) : t.strategy === Gr ? fa(t, n) : Ne[t.level].func(t, n);
+    if ((a === fe || a === ke) && (t.status = Se), a === U || a === fe)
       return e.avail_out === 0 && (t.last_flush = -1), B;
-    if (r === ve && (n === Zr ? Pr(t) : n !== sn && (Ot(t, 0, 0, !1), n === xr && (J(t.head), t.lookahead === 0 && (t.strstart = 0, t.block_start = 0, t.insert = 0))), V(e), e.avail_out === 0))
+    if (a === ve && (n === Zr ? Pr(t) : n !== sn && (Ot(t, 0, 0, !1), n === xr && (q(t.head), t.lookahead === 0 && (t.strstart = 0, t.block_start = 0, t.insert = 0))), V(e), e.avail_out === 0))
       return t.last_flush = -1, B;
   }
-  return n !== F ? B : t.wrap <= 0 ? ln : (t.wrap === 2 ? (A(t, e.adler & 255), A(t, e.adler >> 8 & 255), A(t, e.adler >> 16 & 255), A(t, e.adler >> 24 & 255), A(t, e.total_in & 255), A(t, e.total_in >> 8 & 255), A(t, e.total_in >> 16 & 255), A(t, e.total_in >> 24 & 255)) : (Ce(t, e.adler >>> 16), Ce(t, e.adler & 65535)), V(e), t.wrap > 0 && (t.wrap = -t.wrap), t.pending !== 0 ? B : ln);
+  return n !== L ? B : t.wrap <= 0 ? ln : (t.wrap === 2 ? (A(t, e.adler & 255), A(t, e.adler >> 8 & 255), A(t, e.adler >> 16 & 255), A(t, e.adler >> 24 & 255), A(t, e.total_in & 255), A(t, e.total_in >> 8 & 255), A(t, e.total_in >> 16 & 255), A(t, e.total_in >> 24 & 255)) : (Ce(t, e.adler >>> 16), Ce(t, e.adler & 65535)), V(e), t.wrap > 0 && (t.wrap = -t.wrap), t.pending !== 0 ? B : ln);
 }, ba = (e) => {
   if (Me(e))
     return G;
   const n = e.state.status;
-  return e.state = null, n === le ? fe(e, Mr) : B;
+  return e.state = null, n === oe ? se(e, Mr) : B;
 }, ga = (e, n) => {
   let t = n.length;
   if (Me(e))
     return G;
-  const i = e.state, r = i.wrap;
-  if (r === 2 || r === 1 && i.status !== we || i.lookahead)
+  const i = e.state, a = i.wrap;
+  if (a === 2 || a === 1 && i.status !== we || i.lookahead)
     return G;
-  if (r === 1 && (e.adler = Ue(e.adler, n, t, 0)), i.wrap = 0, t >= i.w_size) {
-    r === 0 && (J(i.head), i.strstart = 0, i.block_start = 0, i.insert = 0);
+  if (a === 1 && (e.adler = Ue(e.adler, n, t, 0)), i.wrap = 0, t >= i.w_size) {
+    a === 0 && (q(i.head), i.strstart = 0, i.block_start = 0, i.insert = 0);
     let u = new Uint8Array(i.w_size);
     u.set(n.subarray(t - i.w_size, t), 0), n = u, t = i.w_size;
   }
-  const a = e.avail_in, o = e.next_in, s = e.input;
+  const r = e.avail_in, o = e.next_in, l = e.input;
   for (e.avail_in = t, e.next_in = 0, e.input = n, me(i); i.lookahead >= T; ) {
-    let u = i.strstart, l = i.lookahead - (T - 1);
+    let u = i.strstart, s = i.lookahead - (T - 1);
     do
-      i.ins_h = ie(i, i.ins_h, i.window[u + T - 1]), i.prev[u & i.w_mask] = i.head[i.ins_h], i.head[i.ins_h] = u, u++;
-    while (--l);
+      i.ins_h = ne(i, i.ins_h, i.window[u + T - 1]), i.prev[u & i.w_mask] = i.head[i.ins_h], i.head[i.ins_h] = u, u++;
+    while (--s);
     i.strstart = u, i.lookahead = T - 1, me(i);
   }
-  return i.strstart += i.lookahead, i.block_start = i.strstart, i.insert = i.lookahead, i.lookahead = 0, i.match_length = i.prev_length = T - 1, i.match_available = 0, e.next_in = o, e.input = s, e.avail_in = a, i.wrap = r, B;
+  return i.strstart += i.lookahead, i.block_start = i.strstart, i.insert = i.lookahead, i.lookahead = 0, i.match_length = i.prev_length = T - 1, i.match_available = 0, e.next_in = o, e.input = l, e.avail_in = r, i.wrap = a, B;
 };
 var wa = pa, ma = di, ya = ci, va = hi, ka = da, $a = _a, Ea = ba, Ca = ga, Sa = "pako deflate (from Nodeca project)", Te = {
   deflateInit: wa,
@@ -1512,12 +1483,12 @@ var Ia = function(e) {
   return e;
 }, Ta = (e) => {
   let n = 0;
-  for (let i = 0, r = e.length; i < r; i++)
+  for (let i = 0, a = e.length; i < a; i++)
     n += e[i].length;
   const t = new Uint8Array(n);
-  for (let i = 0, r = 0, a = e.length; i < a; i++) {
+  for (let i = 0, a = 0, r = e.length; i < r; i++) {
     let o = e[i];
-    t.set(o, r), r += o.length;
+    t.set(o, a), a += o.length;
   }
   return t;
 }, ft = {
@@ -1537,11 +1508,11 @@ De[254] = De[254] = 1;
 var Aa = (e) => {
   if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
     return new TextEncoder().encode(e);
-  let n, t, i, r, a, o = e.length, s = 0;
-  for (r = 0; r < o; r++)
-    t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < o && (i = e.charCodeAt(r + 1), (i & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (i - 56320), r++)), s += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
-  for (n = new Uint8Array(s), a = 0, r = 0; a < s; r++)
-    t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < o && (i = e.charCodeAt(r + 1), (i & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (i - 56320), r++)), t < 128 ? n[a++] = t : t < 2048 ? (n[a++] = 192 | t >>> 6, n[a++] = 128 | t & 63) : t < 65536 ? (n[a++] = 224 | t >>> 12, n[a++] = 128 | t >>> 6 & 63, n[a++] = 128 | t & 63) : (n[a++] = 240 | t >>> 18, n[a++] = 128 | t >>> 12 & 63, n[a++] = 128 | t >>> 6 & 63, n[a++] = 128 | t & 63);
+  let n, t, i, a, r, o = e.length, l = 0;
+  for (a = 0; a < o; a++)
+    t = e.charCodeAt(a), (t & 64512) === 55296 && a + 1 < o && (i = e.charCodeAt(a + 1), (i & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (i - 56320), a++)), l += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
+  for (n = new Uint8Array(l), r = 0, a = 0; r < l; a++)
+    t = e.charCodeAt(a), (t & 64512) === 55296 && a + 1 < o && (i = e.charCodeAt(a + 1), (i & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (i - 56320), a++)), t < 128 ? n[r++] = t : t < 2048 ? (n[r++] = 192 | t >>> 6, n[r++] = 128 | t & 63) : t < 65536 ? (n[r++] = 224 | t >>> 12, n[r++] = 128 | t >>> 6 & 63, n[r++] = 128 | t & 63) : (n[r++] = 240 | t >>> 18, n[r++] = 128 | t >>> 12 & 63, n[r++] = 128 | t >>> 6 & 63, n[r++] = 128 | t & 63);
   return n;
 };
 const Oa = (e, n) => {
@@ -1556,28 +1527,28 @@ var za = (e, n) => {
   const t = n || e.length;
   if (typeof TextDecoder == "function" && TextDecoder.prototype.decode)
     return new TextDecoder().decode(e.subarray(0, n));
-  let i, r;
-  const a = new Array(t * 2);
-  for (r = 0, i = 0; i < t; ) {
+  let i, a;
+  const r = new Array(t * 2);
+  for (a = 0, i = 0; i < t; ) {
     let o = e[i++];
     if (o < 128) {
-      a[r++] = o;
+      r[a++] = o;
       continue;
     }
-    let s = De[o];
-    if (s > 4) {
-      a[r++] = 65533, i += s - 1;
+    let l = De[o];
+    if (l > 4) {
+      r[a++] = 65533, i += l - 1;
       continue;
     }
-    for (o &= s === 2 ? 31 : s === 3 ? 15 : 7; s > 1 && i < t; )
-      o = o << 6 | e[i++] & 63, s--;
-    if (s > 1) {
-      a[r++] = 65533;
+    for (o &= l === 2 ? 31 : l === 3 ? 15 : 7; l > 1 && i < t; )
+      o = o << 6 | e[i++] & 63, l--;
+    if (l > 1) {
+      r[a++] = 65533;
       continue;
     }
-    o < 65536 ? a[r++] = o : (o -= 65536, a[r++] = 55296 | o >> 10 & 1023, a[r++] = 56320 | o & 1023);
+    o < 65536 ? r[a++] = o : (o -= 65536, r[a++] = 55296 | o >> 10 & 1023, r[a++] = 56320 | o & 1023);
   }
-  return Oa(a, r);
+  return Oa(r, a);
 }, Ra = (e, n) => {
   n = n || e.length, n > e.length && (n = e.length);
   let t = n - 1;
@@ -1597,9 +1568,9 @@ const bi = Object.prototype.toString, {
   Z_NO_FLUSH: Ua,
   Z_SYNC_FLUSH: Da,
   Z_FULL_FLUSH: Va,
-  Z_FINISH: La,
+  Z_FINISH: Fa,
   Z_OK: rt,
-  Z_STREAM_END: Fa,
+  Z_STREAM_END: La,
   Z_DEFAULT_COMPRESSION: Pa,
   Z_DEFAULT_STRATEGY: Za,
   Z_DEFLATED: xa
@@ -1634,21 +1605,21 @@ function Gt(e) {
 }
 Gt.prototype.push = function(e, n) {
   const t = this.strm, i = this.options.chunkSize;
-  let r, a;
+  let a, r;
   if (this.ended)
     return !1;
-  for (n === ~~n ? a = n : a = n === !0 ? La : Ua, typeof e == "string" ? t.input = Ve.string2buf(e) : bi.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
-    if (t.avail_out === 0 && (t.output = new Uint8Array(i), t.next_out = 0, t.avail_out = i), (a === Da || a === Va) && t.avail_out <= 6) {
+  for (n === ~~n ? r = n : r = n === !0 ? Fa : Ua, typeof e == "string" ? t.input = Ve.string2buf(e) : bi.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
+    if (t.avail_out === 0 && (t.output = new Uint8Array(i), t.next_out = 0, t.avail_out = i), (r === Da || r === Va) && t.avail_out <= 6) {
       this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0;
       continue;
     }
-    if (r = Te.deflate(t, a), r === Fa)
-      return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), r = Te.deflateEnd(this.strm), this.onEnd(r), this.ended = !0, r === rt;
+    if (a = Te.deflate(t, r), a === La)
+      return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), a = Te.deflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === rt;
     if (t.avail_out === 0) {
       this.onData(t.output);
       continue;
     }
-    if (a > 0 && t.next_out > 0) {
+    if (r > 0 && t.next_out > 0) {
       this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0;
       continue;
     }
@@ -1665,80 +1636,80 @@ Gt.prototype.onEnd = function(e) {
 };
 const Xe = 16209, Ma = 16191;
 var Ha = function(n, t) {
-  let i, r, a, o, s, u, l, f, d, c, h, _, g, k, y, E, C, p, $, S, b, w, m, v;
+  let i, a, r, o, l, u, s, f, p, c, h, _, g, k, v, E, C, d, $, S, b, w, m, y;
   const I = n.state;
-  i = n.next_in, m = n.input, r = i + (n.avail_in - 5), a = n.next_out, v = n.output, o = a - (t - n.avail_out), s = a + (n.avail_out - 257), u = I.dmax, l = I.wsize, f = I.whave, d = I.wnext, c = I.window, h = I.hold, _ = I.bits, g = I.lencode, k = I.distcode, y = (1 << I.lenbits) - 1, E = (1 << I.distbits) - 1;
+  i = n.next_in, m = n.input, a = i + (n.avail_in - 5), r = n.next_out, y = n.output, o = r - (t - n.avail_out), l = r + (n.avail_out - 257), u = I.dmax, s = I.wsize, f = I.whave, p = I.wnext, c = I.window, h = I.hold, _ = I.bits, g = I.lencode, k = I.distcode, v = (1 << I.lenbits) - 1, E = (1 << I.distbits) - 1;
   e:
     do {
-      _ < 15 && (h += m[i++] << _, _ += 8, h += m[i++] << _, _ += 8), C = g[h & y];
+      _ < 15 && (h += m[i++] << _, _ += 8, h += m[i++] << _, _ += 8), C = g[h & v];
       t:
         for (; ; ) {
-          if (p = C >>> 24, h >>>= p, _ -= p, p = C >>> 16 & 255, p === 0)
-            v[a++] = C & 65535;
-          else if (p & 16) {
-            $ = C & 65535, p &= 15, p && (_ < p && (h += m[i++] << _, _ += 8), $ += h & (1 << p) - 1, h >>>= p, _ -= p), _ < 15 && (h += m[i++] << _, _ += 8, h += m[i++] << _, _ += 8), C = k[h & E];
+          if (d = C >>> 24, h >>>= d, _ -= d, d = C >>> 16 & 255, d === 0)
+            y[r++] = C & 65535;
+          else if (d & 16) {
+            $ = C & 65535, d &= 15, d && (_ < d && (h += m[i++] << _, _ += 8), $ += h & (1 << d) - 1, h >>>= d, _ -= d), _ < 15 && (h += m[i++] << _, _ += 8, h += m[i++] << _, _ += 8), C = k[h & E];
             n:
               for (; ; ) {
-                if (p = C >>> 24, h >>>= p, _ -= p, p = C >>> 16 & 255, p & 16) {
-                  if (S = C & 65535, p &= 15, _ < p && (h += m[i++] << _, _ += 8, _ < p && (h += m[i++] << _, _ += 8)), S += h & (1 << p) - 1, S > u) {
+                if (d = C >>> 24, h >>>= d, _ -= d, d = C >>> 16 & 255, d & 16) {
+                  if (S = C & 65535, d &= 15, _ < d && (h += m[i++] << _, _ += 8, _ < d && (h += m[i++] << _, _ += 8)), S += h & (1 << d) - 1, S > u) {
                     n.msg = "invalid distance too far back", I.mode = Xe;
                     break e;
                   }
-                  if (h >>>= p, _ -= p, p = a - o, S > p) {
-                    if (p = S - p, p > f && I.sane) {
+                  if (h >>>= d, _ -= d, d = r - o, S > d) {
+                    if (d = S - d, d > f && I.sane) {
                       n.msg = "invalid distance too far back", I.mode = Xe;
                       break e;
                     }
-                    if (b = 0, w = c, d === 0) {
-                      if (b += l - p, p < $) {
-                        $ -= p;
+                    if (b = 0, w = c, p === 0) {
+                      if (b += s - d, d < $) {
+                        $ -= d;
                         do
-                          v[a++] = c[b++];
-                        while (--p);
-                        b = a - S, w = v;
+                          y[r++] = c[b++];
+                        while (--d);
+                        b = r - S, w = y;
                       }
-                    } else if (d < p) {
-                      if (b += l + d - p, p -= d, p < $) {
-                        $ -= p;
+                    } else if (p < d) {
+                      if (b += s + p - d, d -= p, d < $) {
+                        $ -= d;
                         do
-                          v[a++] = c[b++];
-                        while (--p);
-                        if (b = 0, d < $) {
-                          p = d, $ -= p;
+                          y[r++] = c[b++];
+                        while (--d);
+                        if (b = 0, p < $) {
+                          d = p, $ -= d;
                           do
-                            v[a++] = c[b++];
-                          while (--p);
-                          b = a - S, w = v;
+                            y[r++] = c[b++];
+                          while (--d);
+                          b = r - S, w = y;
                         }
                       }
-                    } else if (b += d - p, p < $) {
-                      $ -= p;
+                    } else if (b += p - d, d < $) {
+                      $ -= d;
                       do
-                        v[a++] = c[b++];
-                      while (--p);
-                      b = a - S, w = v;
+                        y[r++] = c[b++];
+                      while (--d);
+                      b = r - S, w = y;
                     }
                     for (; $ > 2; )
-                      v[a++] = w[b++], v[a++] = w[b++], v[a++] = w[b++], $ -= 3;
-                    $ && (v[a++] = w[b++], $ > 1 && (v[a++] = w[b++]));
+                      y[r++] = w[b++], y[r++] = w[b++], y[r++] = w[b++], $ -= 3;
+                    $ && (y[r++] = w[b++], $ > 1 && (y[r++] = w[b++]));
                   } else {
-                    b = a - S;
+                    b = r - S;
                     do
-                      v[a++] = v[b++], v[a++] = v[b++], v[a++] = v[b++], $ -= 3;
+                      y[r++] = y[b++], y[r++] = y[b++], y[r++] = y[b++], $ -= 3;
                     while ($ > 2);
-                    $ && (v[a++] = v[b++], $ > 1 && (v[a++] = v[b++]));
+                    $ && (y[r++] = y[b++], $ > 1 && (y[r++] = y[b++]));
                   }
-                } else if (p & 64) {
+                } else if (d & 64) {
                   n.msg = "invalid distance code", I.mode = Xe;
                   break e;
                 } else {
-                  C = k[(C & 65535) + (h & (1 << p) - 1)];
+                  C = k[(C & 65535) + (h & (1 << d) - 1)];
                   continue n;
                 }
                 break;
               }
-          } else if (p & 64)
-            if (p & 32) {
+          } else if (d & 64)
+            if (d & 32) {
               I.mode = Ma;
               break e;
             } else {
@@ -1746,15 +1717,15 @@ var Ha = function(n, t) {
               break e;
             }
           else {
-            C = g[(C & 65535) + (h & (1 << p) - 1)];
+            C = g[(C & 65535) + (h & (1 << d) - 1)];
             continue t;
           }
           break;
         }
-    } while (i < r && a < s);
-  $ = _ >> 3, i -= $, _ -= $ << 3, h &= (1 << _) - 1, n.next_in = i, n.next_out = a, n.avail_in = i < r ? 5 + (r - i) : 5 - (i - r), n.avail_out = a < s ? 257 + (s - a) : 257 - (a - s), I.hold = h, I.bits = _;
+    } while (i < a && r < l);
+  $ = _ >> 3, i -= $, _ -= $ << 3, h &= (1 << _) - 1, n.next_in = i, n.next_out = r, n.avail_in = i < a ? 5 + (a - i) : 5 - (i - a), n.avail_out = r < l ? 257 + (l - r) : 257 - (r - l), I.hold = h, I.bits = _;
 };
-const pe = 15, un = 852, hn = 592, cn = 0, gt = 1, dn = 2, ja = new Uint16Array([
+const de = 15, un = 852, hn = 592, cn = 0, gt = 1, dn = 2, ja = new Uint16Array([
   /* Length codes 257..285 base */
   3,
   4,
@@ -1888,60 +1859,60 @@ const pe = 15, un = 852, hn = 592, cn = 0, gt = 1, dn = 2, ja = new Uint16Array(
   29,
   64,
   64
-]), Wa = (e, n, t, i, r, a, o, s) => {
-  const u = s.bits;
-  let l = 0, f = 0, d = 0, c = 0, h = 0, _ = 0, g = 0, k = 0, y = 0, E = 0, C, p, $, S, b, w = null, m;
-  const v = new Uint16Array(pe + 1), I = new Uint16Array(pe + 1);
-  let ae = null, Jt, je, Ge;
-  for (l = 0; l <= pe; l++)
-    v[l] = 0;
+]), Wa = (e, n, t, i, a, r, o, l) => {
+  const u = l.bits;
+  let s = 0, f = 0, p = 0, c = 0, h = 0, _ = 0, g = 0, k = 0, v = 0, E = 0, C, d, $, S, b, w = null, m;
+  const y = new Uint16Array(de + 1), I = new Uint16Array(de + 1);
+  let ie = null, Jt, je, Ge;
+  for (s = 0; s <= de; s++)
+    y[s] = 0;
   for (f = 0; f < i; f++)
-    v[n[t + f]]++;
-  for (h = u, c = pe; c >= 1 && v[c] === 0; c--)
+    y[n[t + f]]++;
+  for (h = u, c = de; c >= 1 && y[c] === 0; c--)
     ;
   if (h > c && (h = c), c === 0)
-    return r[a++] = 1 << 24 | 64 << 16 | 0, r[a++] = 1 << 24 | 64 << 16 | 0, s.bits = 1, 0;
-  for (d = 1; d < c && v[d] === 0; d++)
+    return a[r++] = 1 << 24 | 64 << 16 | 0, a[r++] = 1 << 24 | 64 << 16 | 0, l.bits = 1, 0;
+  for (p = 1; p < c && y[p] === 0; p++)
     ;
-  for (h < d && (h = d), k = 1, l = 1; l <= pe; l++)
-    if (k <<= 1, k -= v[l], k < 0)
+  for (h < p && (h = p), k = 1, s = 1; s <= de; s++)
+    if (k <<= 1, k -= y[s], k < 0)
       return -1;
   if (k > 0 && (e === cn || c !== 1))
     return -1;
-  for (I[1] = 0, l = 1; l < pe; l++)
-    I[l + 1] = I[l] + v[l];
+  for (I[1] = 0, s = 1; s < de; s++)
+    I[s + 1] = I[s] + y[s];
   for (f = 0; f < i; f++)
     n[t + f] !== 0 && (o[I[n[t + f]]++] = f);
-  if (e === cn ? (w = ae = o, m = 20) : e === gt ? (w = ja, ae = Ga, m = 257) : (w = Ya, ae = Ka, m = 0), E = 0, f = 0, l = d, b = a, _ = h, g = 0, $ = -1, y = 1 << h, S = y - 1, e === gt && y > un || e === dn && y > hn)
+  if (e === cn ? (w = ie = o, m = 20) : e === gt ? (w = ja, ie = Ga, m = 257) : (w = Ya, ie = Ka, m = 0), E = 0, f = 0, s = p, b = r, _ = h, g = 0, $ = -1, v = 1 << h, S = v - 1, e === gt && v > un || e === dn && v > hn)
     return 1;
   for (; ; ) {
-    Jt = l - g, o[f] + 1 < m ? (je = 0, Ge = o[f]) : o[f] >= m ? (je = ae[o[f] - m], Ge = w[o[f] - m]) : (je = 32 + 64, Ge = 0), C = 1 << l - g, p = 1 << _, d = p;
+    Jt = s - g, o[f] + 1 < m ? (je = 0, Ge = o[f]) : o[f] >= m ? (je = ie[o[f] - m], Ge = w[o[f] - m]) : (je = 96, Ge = 0), C = 1 << s - g, d = 1 << _, p = d;
     do
-      p -= C, r[b + (E >> g) + p] = Jt << 24 | je << 16 | Ge | 0;
-    while (p !== 0);
-    for (C = 1 << l - 1; E & C; )
+      d -= C, a[b + (E >> g) + d] = Jt << 24 | je << 16 | Ge | 0;
+    while (d !== 0);
+    for (C = 1 << s - 1; E & C; )
       C >>= 1;
-    if (C !== 0 ? (E &= C - 1, E += C) : E = 0, f++, --v[l] === 0) {
-      if (l === c)
+    if (C !== 0 ? (E &= C - 1, E += C) : E = 0, f++, --y[s] === 0) {
+      if (s === c)
         break;
-      l = n[t + o[f]];
+      s = n[t + o[f]];
     }
-    if (l > h && (E & S) !== $) {
-      for (g === 0 && (g = h), b += d, _ = l - g, k = 1 << _; _ + g < c && (k -= v[_ + g], !(k <= 0)); )
+    if (s > h && (E & S) !== $) {
+      for (g === 0 && (g = h), b += p, _ = s - g, k = 1 << _; _ + g < c && (k -= y[_ + g], !(k <= 0)); )
         _++, k <<= 1;
-      if (y += 1 << _, e === gt && y > un || e === dn && y > hn)
+      if (v += 1 << _, e === gt && v > un || e === dn && v > hn)
         return 1;
-      $ = E & S, r[$] = h << 24 | _ << 16 | b - a | 0;
+      $ = E & S, a[$] = h << 24 | _ << 16 | b - r | 0;
     }
   }
-  return E !== 0 && (r[b + E] = l - g << 24 | 64 << 16 | 0), s.bits = h, 0;
+  return E !== 0 && (a[b + E] = s - g << 24 | 64 << 16 | 0), l.bits = h, 0;
 };
 var Ae = Wa;
 const Xa = 0, gi = 1, wi = 2, {
   Z_FINISH: pn,
   Z_BLOCK: qa,
   Z_TREES: qe,
-  Z_OK: he,
+  Z_OK: ue,
   Z_STREAM_END: Ja,
   Z_NEED_DICT: Qa,
   Z_STREAM_ERROR: P,
@@ -1953,24 +1924,24 @@ const Xa = 0, gi = 1, wi = 2, {
 function ao() {
   this.strm = null, this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
 }
-const ce = (e) => {
+const he = (e) => {
   if (!e)
     return 1;
   const n = e.state;
   return !n || n.strm !== e || n.mode < ut || n.mode > ki ? 1 : 0;
 }, $i = (e) => {
-  if (ce(e))
+  if (he(e))
     return P;
   const n = e.state;
-  return e.total_in = e.total_out = n.total = 0, e.msg = "", n.wrap && (e.adler = n.wrap & 1), n.mode = ut, n.last = 0, n.havedict = 0, n.flags = -1, n.dmax = 32768, n.head = null, n.hold = 0, n.bits = 0, n.lencode = n.lendyn = new Int32Array(to), n.distcode = n.distdyn = new Int32Array(no), n.sane = 1, n.back = -1, he;
+  return e.total_in = e.total_out = n.total = 0, e.msg = "", n.wrap && (e.adler = n.wrap & 1), n.mode = ut, n.last = 0, n.havedict = 0, n.flags = -1, n.dmax = 32768, n.head = null, n.hold = 0, n.bits = 0, n.lencode = n.lendyn = new Int32Array(to), n.distcode = n.distdyn = new Int32Array(no), n.sane = 1, n.back = -1, ue;
 }, Ei = (e) => {
-  if (ce(e))
+  if (he(e))
     return P;
   const n = e.state;
   return n.wsize = 0, n.whave = 0, n.wnext = 0, $i(e);
 }, Ci = (e, n) => {
   let t;
-  if (ce(e))
+  if (he(e))
     return P;
   const i = e.state;
   return n < 0 ? (t = 0, n = -n) : (t = (n >> 4) + 5, n < 48 && (n &= 15)), n && (n < 8 || n > 15) ? P : (i.window !== null && i.wbits !== n && (i.window = null), i.wrap = t, i.wbits = n, Ei(e));
@@ -1980,11 +1951,11 @@ const ce = (e) => {
   const t = new ao();
   e.state = t, t.strm = e, t.window = null, t.mode = ut;
   const i = Ci(e, n);
-  return i !== he && (e.state = null), i;
+  return i !== ue && (e.state = null), i;
 }, oo = (e) => Si(e, ro);
-let Ln = !0, vt, kt;
+let Fn = !0, vt, kt;
 const so = (e) => {
-  if (Ln) {
+  if (Fn) {
     vt = new Int32Array(512), kt = new Int32Array(32);
     let n = 0;
     for (; n < 144; )
@@ -1997,24 +1968,24 @@ const so = (e) => {
       e.lens[n++] = 8;
     for (Ae(gi, e.lens, 0, 288, vt, 0, e.work, { bits: 9 }), n = 0; n < 32; )
       e.lens[n++] = 5;
-    Ae(wi, e.lens, 0, 32, kt, 0, e.work, { bits: 5 }), Ln = !1;
+    Ae(wi, e.lens, 0, 32, kt, 0, e.work, { bits: 5 }), Fn = !1;
   }
   e.lencode = vt, e.lenbits = 9, e.distcode = kt, e.distbits = 5;
 }, Ni = (e, n, t, i) => {
-  let r;
-  const a = e.state;
-  return a.window === null && (a.wsize = 1 << a.wbits, a.wnext = 0, a.whave = 0, a.window = new Uint8Array(a.wsize)), i >= a.wsize ? (a.window.set(n.subarray(t - a.wsize, t), 0), a.wnext = 0, a.whave = a.wsize) : (r = a.wsize - a.wnext, r > i && (r = i), a.window.set(n.subarray(t - i, t - i + r), a.wnext), i -= r, i ? (a.window.set(n.subarray(t - i, t), 0), a.wnext = i, a.whave = a.wsize) : (a.wnext += r, a.wnext === a.wsize && (a.wnext = 0), a.whave < a.wsize && (a.whave += r))), 0;
+  let a;
+  const r = e.state;
+  return r.window === null && (r.wsize = 1 << r.wbits, r.wnext = 0, r.whave = 0, r.window = new Uint8Array(r.wsize)), i >= r.wsize ? (r.window.set(n.subarray(t - r.wsize, t), 0), r.wnext = 0, r.whave = r.wsize) : (a = r.wsize - r.wnext, a > i && (a = i), r.window.set(n.subarray(t - i, t - i + a), r.wnext), i -= a, i ? (r.window.set(n.subarray(t - i, t), 0), r.wnext = i, r.whave = r.wsize) : (r.wnext += a, r.wnext === r.wsize && (r.wnext = 0), r.whave < r.wsize && (r.whave += a))), 0;
 }, lo = (e, n) => {
-  let t, i, r, a, o, s, u, l, f, d, c, h, _, g, k = 0, y, E, C, p, $, S, b, w;
+  let t, i, a, r, o, l, u, s, f, p, c, h, _, g, k = 0, v, E, C, d, $, S, b, w;
   const m = new Uint8Array(4);
-  let v, I;
-  const ae = (
+  let y, I;
+  const ie = (
     /* permutation of code lengths */
     new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15])
   );
-  if (ce(e) || !e.output || !e.input && e.avail_in !== 0)
+  if (he(e) || !e.output || !e.input && e.avail_in !== 0)
     return P;
-  t = e.state, t.mode === K && (t.mode = wt), o = e.next_out, r = e.output, u = e.avail_out, a = e.next_in, i = e.input, s = e.avail_in, l = t.hold, f = t.bits, d = s, c = u, w = he;
+  t = e.state, t.mode === K && (t.mode = wt), o = e.next_out, a = e.output, u = e.avail_out, r = e.next_in, i = e.input, l = e.avail_in, s = t.hold, f = t.bits, p = l, c = u, w = ue;
   e:
     for (; ; )
       switch (t.mode) {
@@ -2024,36 +1995,36 @@ const so = (e) => {
             break;
           }
           for (; f < 16; ) {
-            if (s === 0)
+            if (l === 0)
               break e;
-            s--, l += i[a++] << f, f += 8;
+            l--, s += i[r++] << f, f += 8;
           }
-          if (t.wrap & 2 && l === 35615) {
-            t.wbits === 0 && (t.wbits = 15), t.check = 0, m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = R(t.check, m, 2, 0), l = 0, f = 0, t.mode = bn;
+          if (t.wrap & 2 && s === 35615) {
+            t.wbits === 0 && (t.wbits = 15), t.check = 0, m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0), s = 0, f = 0, t.mode = bn;
             break;
           }
           if (t.head && (t.head.done = !1), !(t.wrap & 1) || /* check if zlib header allowed */
-          (((l & 255) << 8) + (l >> 8)) % 31) {
+          (((s & 255) << 8) + (s >> 8)) % 31) {
             e.msg = "incorrect header check", t.mode = O;
             break;
           }
-          if ((l & 15) !== _n) {
+          if ((s & 15) !== _n) {
             e.msg = "unknown compression method", t.mode = O;
             break;
           }
-          if (l >>>= 4, f -= 4, b = (l & 15) + 8, t.wbits === 0 && (t.wbits = b), b > 15 || b > t.wbits) {
+          if (s >>>= 4, f -= 4, b = (s & 15) + 8, t.wbits === 0 && (t.wbits = b), b > 15 || b > t.wbits) {
             e.msg = "invalid window size", t.mode = O;
             break;
           }
-          t.dmax = 1 << t.wbits, t.flags = 0, e.adler = t.check = 1, t.mode = l & 512 ? En : K, l = 0, f = 0;
+          t.dmax = 1 << t.wbits, t.flags = 0, e.adler = t.check = 1, t.mode = s & 512 ? En : K, s = 0, f = 0;
           break;
         case bn:
           for (; f < 16; ) {
-            if (s === 0)
+            if (l === 0)
               break e;
-            s--, l += i[a++] << f, f += 8;
+            l--, s += i[r++] << f, f += 8;
           }
-          if (t.flags = l, (t.flags & 255) !== _n) {
+          if (t.flags = s, (t.flags & 255) !== _n) {
             e.msg = "unknown compression method", t.mode = O;
             break;
           }
@@ -2061,67 +2032,67 @@ const so = (e) => {
             e.msg = "unknown header flags set", t.mode = O;
             break;
           }
-          t.head && (t.head.text = l >> 8 & 1), t.flags & 512 && t.wrap & 4 && (m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = R(t.check, m, 2, 0)), l = 0, f = 0, t.mode = gn;
+          t.head && (t.head.text = s >> 8 & 1), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0)), s = 0, f = 0, t.mode = gn;
         case gn:
           for (; f < 32; ) {
-            if (s === 0)
+            if (l === 0)
               break e;
-            s--, l += i[a++] << f, f += 8;
+            l--, s += i[r++] << f, f += 8;
           }
-          t.head && (t.head.time = l), t.flags & 512 && t.wrap & 4 && (m[0] = l & 255, m[1] = l >>> 8 & 255, m[2] = l >>> 16 & 255, m[3] = l >>> 24 & 255, t.check = R(t.check, m, 4, 0)), l = 0, f = 0, t.mode = wn;
+          t.head && (t.head.time = s), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, m[2] = s >>> 16 & 255, m[3] = s >>> 24 & 255, t.check = R(t.check, m, 4, 0)), s = 0, f = 0, t.mode = wn;
         case wn:
           for (; f < 16; ) {
-            if (s === 0)
+            if (l === 0)
               break e;
-            s--, l += i[a++] << f, f += 8;
+            l--, s += i[r++] << f, f += 8;
           }
-          t.head && (t.head.xflags = l & 255, t.head.os = l >> 8), t.flags & 512 && t.wrap & 4 && (m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = R(t.check, m, 2, 0)), l = 0, f = 0, t.mode = mn;
+          t.head && (t.head.xflags = s & 255, t.head.os = s >> 8), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0)), s = 0, f = 0, t.mode = mn;
         case mn:
           if (t.flags & 1024) {
             for (; f < 16; ) {
-              if (s === 0)
+              if (l === 0)
                 break e;
-              s--, l += i[a++] << f, f += 8;
+              l--, s += i[r++] << f, f += 8;
             }
-            t.length = l, t.head && (t.head.extra_len = l), t.flags & 512 && t.wrap & 4 && (m[0] = l & 255, m[1] = l >>> 8 & 255, t.check = R(t.check, m, 2, 0)), l = 0, f = 0;
+            t.length = s, t.head && (t.head.extra_len = s), t.flags & 512 && t.wrap & 4 && (m[0] = s & 255, m[1] = s >>> 8 & 255, t.check = R(t.check, m, 2, 0)), s = 0, f = 0;
           } else
             t.head && (t.head.extra = null);
           t.mode = yn;
         case yn:
-          if (t.flags & 1024 && (h = t.length, h > s && (h = s), h && (t.head && (b = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(
+          if (t.flags & 1024 && (h = t.length, h > l && (h = l), h && (t.head && (b = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(
             i.subarray(
-              a,
+              r,
               // extra field is limited to 65536 bytes
               // - no need for additional size check
-              a + h
+              r + h
             ),
             /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
             b
-          )), t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, a)), s -= h, a += h, t.length -= h), t.length))
+          )), t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, r)), l -= h, r += h, t.length -= h), t.length))
             break e;
           t.length = 0, t.mode = vn;
         case vn:
           if (t.flags & 2048) {
-            if (s === 0)
+            if (l === 0)
               break e;
             h = 0;
             do
-              b = i[a + h++], t.head && b && t.length < 65536 && (t.head.name += String.fromCharCode(b));
-            while (b && h < s);
-            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, a)), s -= h, a += h, b)
+              b = i[r + h++], t.head && b && t.length < 65536 && (t.head.name += String.fromCharCode(b));
+            while (b && h < l);
+            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, r)), l -= h, r += h, b)
               break e;
           } else
             t.head && (t.head.name = null);
           t.length = 0, t.mode = kn;
         case kn:
           if (t.flags & 4096) {
-            if (s === 0)
+            if (l === 0)
               break e;
             h = 0;
             do
-              b = i[a + h++], t.head && b && t.length < 65536 && (t.head.comment += String.fromCharCode(b));
-            while (b && h < s);
-            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, a)), s -= h, a += h, b)
+              b = i[r + h++], t.head && b && t.length < 65536 && (t.head.comment += String.fromCharCode(b));
+            while (b && h < l);
+            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, i, h, r)), l -= h, r += h, b)
               break e;
           } else
             t.head && (t.head.comment = null);
@@ -2129,49 +2100,49 @@ const so = (e) => {
         case $n:
           if (t.flags & 512) {
             for (; f < 16; ) {
-              if (s === 0)
+              if (l === 0)
                 break e;
-              s--, l += i[a++] << f, f += 8;
+              l--, s += i[r++] << f, f += 8;
             }
-            if (t.wrap & 4 && l !== (t.check & 65535)) {
+            if (t.wrap & 4 && s !== (t.check & 65535)) {
               e.msg = "header crc mismatch", t.mode = O;
               break;
             }
-            l = 0, f = 0;
+            s = 0, f = 0;
           }
           t.head && (t.head.hcrc = t.flags >> 9 & 1, t.head.done = !0), e.adler = t.check = 0, t.mode = K;
           break;
         case En:
           for (; f < 32; ) {
-            if (s === 0)
+            if (l === 0)
               break e;
-            s--, l += i[a++] << f, f += 8;
+            l--, s += i[r++] << f, f += 8;
           }
-          e.adler = t.check = Vn(l), l = 0, f = 0, t.mode = at;
+          e.adler = t.check = Vn(s), s = 0, f = 0, t.mode = at;
         case at:
           if (t.havedict === 0)
-            return e.next_out = o, e.avail_out = u, e.next_in = a, e.avail_in = s, t.hold = l, t.bits = f, Qa;
+            return e.next_out = o, e.avail_out = u, e.next_in = r, e.avail_in = l, t.hold = s, t.bits = f, Qa;
           e.adler = t.check = 1, t.mode = K;
         case K:
           if (n === qa || n === qe)
             break e;
         case wt:
           if (t.last) {
-            l >>>= f & 7, f -= f & 7, t.mode = yt;
+            s >>>= f & 7, f -= f & 7, t.mode = yt;
             break;
           }
           for (; f < 3; ) {
-            if (s === 0)
+            if (l === 0)
               break e;
-            s--, l += i[a++] << f, f += 8;
+            l--, s += i[r++] << f, f += 8;
           }
-          switch (t.last = l & 1, l >>>= 1, f -= 1, l & 3) {
+          switch (t.last = s & 1, s >>>= 1, f -= 1, s & 3) {
             case 0:
               t.mode = Cn;
               break;
             case 1:
               if (so(t), t.mode = Je, n === qe) {
-                l >>>= 2, f -= 2;
+                s >>>= 2, f -= 2;
                 break e;
               }
               break;
@@ -2181,38 +2152,38 @@ const so = (e) => {
             case 3:
               e.msg = "invalid block type", t.mode = O;
           }
-          l >>>= 2, f -= 2;
+          s >>>= 2, f -= 2;
           break;
         case Cn:
-          for (l >>>= f & 7, f -= f & 7; f < 32; ) {
-            if (s === 0)
+          for (s >>>= f & 7, f -= f & 7; f < 32; ) {
+            if (l === 0)
               break e;
-            s--, l += i[a++] << f, f += 8;
+            l--, s += i[r++] << f, f += 8;
           }
-          if ((l & 65535) !== (l >>> 16 ^ 65535)) {
+          if ((s & 65535) !== (s >>> 16 ^ 65535)) {
             e.msg = "invalid stored block lengths", t.mode = O;
             break;
           }
-          if (t.length = l & 65535, l = 0, f = 0, t.mode = mt, n === qe)
+          if (t.length = s & 65535, s = 0, f = 0, t.mode = mt, n === qe)
             break e;
         case mt:
           t.mode = Sn;
         case Sn:
           if (h = t.length, h) {
-            if (h > s && (h = s), h > u && (h = u), h === 0)
+            if (h > l && (h = l), h > u && (h = u), h === 0)
               break e;
-            r.set(i.subarray(a, a + h), o), s -= h, a += h, u -= h, o += h, t.length -= h;
+            a.set(i.subarray(r, r + h), o), l -= h, r += h, u -= h, o += h, t.length -= h;
             break;
           }
           t.mode = K;
           break;
         case Nn:
           for (; f < 14; ) {
-            if (s === 0)
+            if (l === 0)
               break e;
-            s--, l += i[a++] << f, f += 8;
+            l--, s += i[r++] << f, f += 8;
           }
-          if (t.nlen = (l & 31) + 257, l >>>= 5, f -= 5, t.ndist = (l & 31) + 1, l >>>= 5, f -= 5, t.ncode = (l & 15) + 4, l >>>= 4, f -= 4, t.nlen > 286 || t.ndist > 30) {
+          if (t.nlen = (s & 31) + 257, s >>>= 5, f -= 5, t.ndist = (s & 31) + 1, s >>>= 5, f -= 5, t.ncode = (s & 15) + 4, s >>>= 4, f -= 4, t.nlen > 286 || t.ndist > 30) {
             e.msg = "too many length or distance symbols", t.mode = O;
             break;
           }
@@ -2220,54 +2191,54 @@ const so = (e) => {
         case In:
           for (; t.have < t.ncode; ) {
             for (; f < 3; ) {
-              if (s === 0)
+              if (l === 0)
                 break e;
-              s--, l += i[a++] << f, f += 8;
+              l--, s += i[r++] << f, f += 8;
             }
-            t.lens[ae[t.have++]] = l & 7, l >>>= 3, f -= 3;
+            t.lens[ie[t.have++]] = s & 7, s >>>= 3, f -= 3;
           }
           for (; t.have < 19; )
-            t.lens[ae[t.have++]] = 0;
-          if (t.lencode = t.lendyn, t.lenbits = 7, v = { bits: t.lenbits }, w = Ae(Xa, t.lens, 0, 19, t.lencode, 0, t.work, v), t.lenbits = v.bits, w) {
+            t.lens[ie[t.have++]] = 0;
+          if (t.lencode = t.lendyn, t.lenbits = 7, y = { bits: t.lenbits }, w = Ae(Xa, t.lens, 0, 19, t.lencode, 0, t.work, y), t.lenbits = y.bits, w) {
             e.msg = "invalid code lengths set", t.mode = O;
             break;
           }
           t.have = 0, t.mode = Tn;
         case Tn:
           for (; t.have < t.nlen + t.ndist; ) {
-            for (; k = t.lencode[l & (1 << t.lenbits) - 1], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(y <= f); ) {
-              if (s === 0)
+            for (; k = t.lencode[s & (1 << t.lenbits) - 1], v = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(v <= f); ) {
+              if (l === 0)
                 break e;
-              s--, l += i[a++] << f, f += 8;
+              l--, s += i[r++] << f, f += 8;
             }
             if (C < 16)
-              l >>>= y, f -= y, t.lens[t.have++] = C;
+              s >>>= v, f -= v, t.lens[t.have++] = C;
             else {
               if (C === 16) {
-                for (I = y + 2; f < I; ) {
-                  if (s === 0)
+                for (I = v + 2; f < I; ) {
+                  if (l === 0)
                     break e;
-                  s--, l += i[a++] << f, f += 8;
+                  l--, s += i[r++] << f, f += 8;
                 }
-                if (l >>>= y, f -= y, t.have === 0) {
+                if (s >>>= v, f -= v, t.have === 0) {
                   e.msg = "invalid bit length repeat", t.mode = O;
                   break;
                 }
-                b = t.lens[t.have - 1], h = 3 + (l & 3), l >>>= 2, f -= 2;
+                b = t.lens[t.have - 1], h = 3 + (s & 3), s >>>= 2, f -= 2;
               } else if (C === 17) {
-                for (I = y + 3; f < I; ) {
-                  if (s === 0)
+                for (I = v + 3; f < I; ) {
+                  if (l === 0)
                     break e;
-                  s--, l += i[a++] << f, f += 8;
+                  l--, s += i[r++] << f, f += 8;
                 }
-                l >>>= y, f -= y, b = 0, h = 3 + (l & 7), l >>>= 3, f -= 3;
+                s >>>= v, f -= v, b = 0, h = 3 + (s & 7), s >>>= 3, f -= 3;
               } else {
-                for (I = y + 7; f < I; ) {
-                  if (s === 0)
+                for (I = v + 7; f < I; ) {
+                  if (l === 0)
                     break e;
-                  s--, l += i[a++] << f, f += 8;
+                  l--, s += i[r++] << f, f += 8;
                 }
-                l >>>= y, f -= y, b = 0, h = 11 + (l & 127), l >>>= 7, f -= 7;
+                s >>>= v, f -= v, b = 0, h = 11 + (s & 127), s >>>= 7, f -= 7;
               }
               if (t.have + h > t.nlen + t.ndist) {
                 e.msg = "invalid bit length repeat", t.mode = O;
@@ -2283,11 +2254,11 @@ const so = (e) => {
             e.msg = "invalid code -- missing end-of-block", t.mode = O;
             break;
           }
-          if (t.lenbits = 9, v = { bits: t.lenbits }, w = Ae(gi, t.lens, 0, t.nlen, t.lencode, 0, t.work, v), t.lenbits = v.bits, w) {
+          if (t.lenbits = 9, y = { bits: t.lenbits }, w = Ae(gi, t.lens, 0, t.nlen, t.lencode, 0, t.work, y), t.lenbits = y.bits, w) {
             e.msg = "invalid literal/lengths set", t.mode = O;
             break;
           }
-          if (t.distbits = 6, t.distcode = t.distdyn, v = { bits: t.distbits }, w = Ae(wi, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, v), t.distbits = v.bits, w) {
+          if (t.distbits = 6, t.distcode = t.distdyn, y = { bits: t.distbits }, w = Ae(wi, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, y), t.distbits = y.bits, w) {
             e.msg = "invalid distances set", t.mode = O;
             break;
           }
@@ -2296,24 +2267,24 @@ const so = (e) => {
         case Je:
           t.mode = Qe;
         case Qe:
-          if (s >= 6 && u >= 258) {
-            e.next_out = o, e.avail_out = u, e.next_in = a, e.avail_in = s, t.hold = l, t.bits = f, Ha(e, c), o = e.next_out, r = e.output, u = e.avail_out, a = e.next_in, i = e.input, s = e.avail_in, l = t.hold, f = t.bits, t.mode === K && (t.back = -1);
+          if (l >= 6 && u >= 258) {
+            e.next_out = o, e.avail_out = u, e.next_in = r, e.avail_in = l, t.hold = s, t.bits = f, Ha(e, c), o = e.next_out, a = e.output, u = e.avail_out, r = e.next_in, i = e.input, l = e.avail_in, s = t.hold, f = t.bits, t.mode === K && (t.back = -1);
             break;
           }
-          for (t.back = 0; k = t.lencode[l & (1 << t.lenbits) - 1], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(y <= f); ) {
-            if (s === 0)
+          for (t.back = 0; k = t.lencode[s & (1 << t.lenbits) - 1], v = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(v <= f); ) {
+            if (l === 0)
               break e;
-            s--, l += i[a++] << f, f += 8;
+            l--, s += i[r++] << f, f += 8;
           }
           if (E && !(E & 240)) {
-            for (p = y, $ = E, S = C; k = t.lencode[S + ((l & (1 << p + $) - 1) >> p)], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(p + y <= f); ) {
-              if (s === 0)
+            for (d = v, $ = E, S = C; k = t.lencode[S + ((s & (1 << d + $) - 1) >> d)], v = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(d + v <= f); ) {
+              if (l === 0)
                 break e;
-              s--, l += i[a++] << f, f += 8;
+              l--, s += i[r++] << f, f += 8;
             }
-            l >>>= p, f -= p, t.back += p;
+            s >>>= d, f -= d, t.back += d;
           }
-          if (l >>>= y, f -= y, t.back += y, t.length = C, E === 0) {
+          if (s >>>= v, f -= v, t.back += v, t.length = C, E === 0) {
             t.mode = Bn;
             break;
           }
@@ -2329,28 +2300,28 @@ const so = (e) => {
         case An:
           if (t.extra) {
             for (I = t.extra; f < I; ) {
-              if (s === 0)
+              if (l === 0)
                 break e;
-              s--, l += i[a++] << f, f += 8;
+              l--, s += i[r++] << f, f += 8;
             }
-            t.length += l & (1 << t.extra) - 1, l >>>= t.extra, f -= t.extra, t.back += t.extra;
+            t.length += s & (1 << t.extra) - 1, s >>>= t.extra, f -= t.extra, t.back += t.extra;
           }
           t.was = t.length, t.mode = On;
         case On:
-          for (; k = t.distcode[l & (1 << t.distbits) - 1], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(y <= f); ) {
-            if (s === 0)
+          for (; k = t.distcode[s & (1 << t.distbits) - 1], v = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(v <= f); ) {
+            if (l === 0)
               break e;
-            s--, l += i[a++] << f, f += 8;
+            l--, s += i[r++] << f, f += 8;
           }
           if (!(E & 240)) {
-            for (p = y, $ = E, S = C; k = t.distcode[S + ((l & (1 << p + $) - 1) >> p)], y = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(p + y <= f); ) {
-              if (s === 0)
+            for (d = v, $ = E, S = C; k = t.distcode[S + ((s & (1 << d + $) - 1) >> d)], v = k >>> 24, E = k >>> 16 & 255, C = k & 65535, !(d + v <= f); ) {
+              if (l === 0)
                 break e;
-              s--, l += i[a++] << f, f += 8;
+              l--, s += i[r++] << f, f += 8;
             }
-            l >>>= p, f -= p, t.back += p;
+            s >>>= d, f -= d, t.back += d;
           }
-          if (l >>>= y, f -= y, t.back += y, E & 64) {
+          if (s >>>= v, f -= v, t.back += v, E & 64) {
             e.msg = "invalid distance code", t.mode = O;
             break;
           }
@@ -2358,11 +2329,11 @@ const so = (e) => {
         case zn:
           if (t.extra) {
             for (I = t.extra; f < I; ) {
-              if (s === 0)
+              if (l === 0)
                 break e;
-              s--, l += i[a++] << f, f += 8;
+              l--, s += i[r++] << f, f += 8;
             }
-            t.offset += l & (1 << t.extra) - 1, l >>>= t.extra, f -= t.extra, t.back += t.extra;
+            t.offset += s & (1 << t.extra) - 1, s >>>= t.extra, f -= t.extra, t.back += t.extra;
           }
           if (t.offset > t.dmax) {
             e.msg = "invalid distance too far back", t.mode = O;
@@ -2379,45 +2350,45 @@ const so = (e) => {
             }
             h > t.wnext ? (h -= t.wnext, _ = t.wsize - h) : _ = t.wnext - h, h > t.length && (h = t.length), g = t.window;
           } else
-            g = r, _ = o - t.offset, h = t.length;
+            g = a, _ = o - t.offset, h = t.length;
           h > u && (h = u), u -= h, t.length -= h;
           do
-            r[o++] = g[_++];
+            a[o++] = g[_++];
           while (--h);
           t.length === 0 && (t.mode = Qe);
           break;
         case Bn:
           if (u === 0)
             break e;
-          r[o++] = t.length, u--, t.mode = Qe;
+          a[o++] = t.length, u--, t.mode = Qe;
           break;
         case yt:
           if (t.wrap) {
             for (; f < 32; ) {
-              if (s === 0)
+              if (l === 0)
                 break e;
-              s--, l |= i[a++] << f, f += 8;
+              l--, s |= i[r++] << f, f += 8;
             }
             if (c -= u, e.total_out += c, t.total += c, t.wrap & 4 && c && (e.adler = t.check = /*UPDATE_CHECK(state.check, put - _out, _out);*/
-            t.flags ? R(t.check, r, c, o - c) : Ue(t.check, r, c, o - c)), c = u, t.wrap & 4 && (t.flags ? l : Vn(l)) !== t.check) {
+            t.flags ? R(t.check, a, c, o - c) : Ue(t.check, a, c, o - c)), c = u, t.wrap & 4 && (t.flags ? s : Vn(s)) !== t.check) {
               e.msg = "incorrect data check", t.mode = O;
               break;
             }
-            l = 0, f = 0;
+            s = 0, f = 0;
           }
           t.mode = Un;
         case Un:
           if (t.wrap && t.flags) {
             for (; f < 32; ) {
-              if (s === 0)
+              if (l === 0)
                 break e;
-              s--, l += i[a++] << f, f += 8;
+              l--, s += i[r++] << f, f += 8;
             }
-            if (t.wrap & 4 && l !== (t.total & 4294967295)) {
+            if (t.wrap & 4 && s !== (t.total & 4294967295)) {
               e.msg = "incorrect length check", t.mode = O;
               break;
             }
-            l = 0, f = 0;
+            s = 0, f = 0;
           }
           t.mode = Dn;
         case Dn:
@@ -2432,22 +2403,22 @@ const so = (e) => {
         default:
           return P;
       }
-  return e.next_out = o, e.avail_out = u, e.next_in = a, e.avail_in = s, t.hold = l, t.bits = f, (t.wsize || c !== e.avail_out && t.mode < O && (t.mode < yt || n !== pn)) && Ni(e, e.output, e.next_out, c - e.avail_out), d -= e.avail_in, c -= e.avail_out, e.total_in += d, e.total_out += c, t.total += c, t.wrap & 4 && c && (e.adler = t.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
-  t.flags ? R(t.check, r, c, e.next_out - c) : Ue(t.check, r, c, e.next_out - c)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === K ? 128 : 0) + (t.mode === Je || t.mode === mt ? 256 : 0), (d === 0 && c === 0 || n === pn) && w === he && (w = eo), w;
+  return e.next_out = o, e.avail_out = u, e.next_in = r, e.avail_in = l, t.hold = s, t.bits = f, (t.wsize || c !== e.avail_out && t.mode < O && (t.mode < yt || n !== pn)) && Ni(e, e.output, e.next_out, c - e.avail_out), p -= e.avail_in, c -= e.avail_out, e.total_in += p, e.total_out += c, t.total += c, t.wrap & 4 && c && (e.adler = t.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
+  t.flags ? R(t.check, a, c, e.next_out - c) : Ue(t.check, a, c, e.next_out - c)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === K ? 128 : 0) + (t.mode === Je || t.mode === mt ? 256 : 0), (p === 0 && c === 0 || n === pn) && w === ue && (w = eo), w;
 }, fo = (e) => {
-  if (ce(e))
+  if (he(e))
     return P;
   let n = e.state;
-  return n.window && (n.window = null), e.state = null, he;
+  return n.window && (n.window = null), e.state = null, ue;
 }, uo = (e, n) => {
-  if (ce(e))
+  if (he(e))
     return P;
   const t = e.state;
-  return t.wrap & 2 ? (t.head = n, n.done = !1, he) : P;
+  return t.wrap & 2 ? (t.head = n, n.done = !1, ue) : P;
 }, ho = (e, n) => {
   const t = n.length;
-  let i, r, a;
-  return ce(e) || (i = e.state, i.wrap !== 0 && i.mode !== at) ? P : i.mode === at && (r = 1, r = Ue(r, n, t, 0), r !== i.check) ? mi : (a = Ni(e, n, t, t), a ? (i.mode = vi, yi) : (i.havedict = 1, he));
+  let i, a, r;
+  return he(e) || (i = e.state, i.wrap !== 0 && i.mode !== at) ? P : i.mode === at && (a = 1, a = Ue(a, n, t, 0), a !== i.check) ? mi : (r = Ni(e, n, t, t), r ? (i.mode = vi, yi) : (i.havedict = 1, ue));
 };
 var co = Ei, po = Ci, _o = $i, bo = oo, go = Si, wo = lo, mo = fo, yo = uo, vo = ho, ko = "pako inflate (from Nodeca project)", X = {
   inflateReset: co,
@@ -2468,11 +2439,11 @@ var Eo = $o;
 const Ii = Object.prototype.toString, {
   Z_NO_FLUSH: Co,
   Z_FINISH: So,
-  Z_OK: Le,
+  Z_OK: Fe,
   Z_STREAM_END: $t,
   Z_NEED_DICT: Et,
   Z_STREAM_ERROR: No,
-  Z_DATA_ERROR: Fn,
+  Z_DATA_ERROR: Ln,
   Z_MEM_ERROR: Io
 } = xe;
 function He(e) {
@@ -2487,35 +2458,35 @@ function He(e) {
     this.strm,
     n.windowBits
   );
-  if (t !== Le)
+  if (t !== Fe)
     throw new Error(ge[t]);
-  if (this.header = new Eo(), X.inflateGetHeader(this.strm, this.header), n.dictionary && (typeof n.dictionary == "string" ? n.dictionary = Ve.string2buf(n.dictionary) : Ii.call(n.dictionary) === "[object ArrayBuffer]" && (n.dictionary = new Uint8Array(n.dictionary)), n.raw && (t = X.inflateSetDictionary(this.strm, n.dictionary), t !== Le)))
+  if (this.header = new Eo(), X.inflateGetHeader(this.strm, this.header), n.dictionary && (typeof n.dictionary == "string" ? n.dictionary = Ve.string2buf(n.dictionary) : Ii.call(n.dictionary) === "[object ArrayBuffer]" && (n.dictionary = new Uint8Array(n.dictionary)), n.raw && (t = X.inflateSetDictionary(this.strm, n.dictionary), t !== Fe)))
     throw new Error(ge[t]);
 }
 He.prototype.push = function(e, n) {
-  const t = this.strm, i = this.options.chunkSize, r = this.options.dictionary;
-  let a, o, s;
+  const t = this.strm, i = this.options.chunkSize, a = this.options.dictionary;
+  let r, o, l;
   if (this.ended)
     return !1;
   for (n === ~~n ? o = n : o = n === !0 ? So : Co, Ii.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
-    for (t.avail_out === 0 && (t.output = new Uint8Array(i), t.next_out = 0, t.avail_out = i), a = X.inflate(t, o), a === Et && r && (a = X.inflateSetDictionary(t, r), a === Le ? a = X.inflate(t, o) : a === Fn && (a = Et)); t.avail_in > 0 && a === $t && t.state.wrap > 0 && e[t.next_in] !== 0; )
-      X.inflateReset(t), a = X.inflate(t, o);
-    switch (a) {
+    for (t.avail_out === 0 && (t.output = new Uint8Array(i), t.next_out = 0, t.avail_out = i), r = X.inflate(t, o), r === Et && a && (r = X.inflateSetDictionary(t, a), r === Fe ? r = X.inflate(t, o) : r === Ln && (r = Et)); t.avail_in > 0 && r === $t && t.state.wrap > 0 && e[t.next_in] !== 0; )
+      X.inflateReset(t), r = X.inflate(t, o);
+    switch (r) {
       case No:
-      case Fn:
+      case Ln:
       case Et:
       case Io:
-        return this.onEnd(a), this.ended = !0, !1;
+        return this.onEnd(r), this.ended = !0, !1;
     }
-    if (s = t.avail_out, t.next_out && (t.avail_out === 0 || a === $t))
+    if (l = t.avail_out, t.next_out && (t.avail_out === 0 || r === $t))
       if (this.options.to === "string") {
-        let u = Ve.utf8border(t.output, t.next_out), l = t.next_out - u, f = Ve.buf2string(t.output, u);
-        t.next_out = l, t.avail_out = i - l, l && t.output.set(t.output.subarray(u, u + l), 0), this.onData(f);
+        let u = Ve.utf8border(t.output, t.next_out), s = t.next_out - u, f = Ve.buf2string(t.output, u);
+        t.next_out = s, t.avail_out = i - s, s && t.output.set(t.output.subarray(u, u + s), 0), this.onData(f);
       } else
         this.onData(t.output.length === t.next_out ? t.output : t.output.subarray(0, t.next_out));
-    if (!(a === Le && s === 0)) {
-      if (a === $t)
-        return a = X.inflateEnd(this.strm), this.onEnd(a), this.ended = !0, !0;
+    if (!(r === Fe && l === 0)) {
+      if (r === $t)
+        return r = X.inflateEnd(this.strm), this.onEnd(r), this.ended = !0, !0;
       if (t.avail_in === 0)
         break;
     }
@@ -2526,7 +2497,7 @@ He.prototype.onData = function(e) {
   this.chunks.push(e);
 };
 He.prototype.onEnd = function(e) {
-  e === Le && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = ft.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+  e === Fe && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = ft.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
 function Yt(e, n) {
   const t = new He(n);
@@ -2544,32 +2515,32 @@ var Ao = He, Oo = Yt, zo = To, Ro = Yt, Bo = xe, Uo = {
   ungzip: Ro,
   constants: Bo
 };
-const { Inflate: Ds, inflate: Vs, inflateRaw: Do, ungzip: Ls } = Uo;
+const { Inflate: Us, inflate: Ds, inflateRaw: Do, ungzip: Vs } = Uo;
 var Vo = Do;
-function Lo(e) {
+function Fo(e) {
   return Vo(e.subarray(2));
 }
-class Fo extends Error {
+class Lo extends Error {
   constructor(n) {
     super(n), this.code = "ERR_ABORTED";
   }
 }
 function Po(e) {
-  e.sort((r, a) => Number(r.offset) - Number(a.offset));
+  e.sort((a, r) => Number(a.offset) - Number(r.offset));
   const n = [];
   let t, i;
-  for (const r of e)
-    t && i && Number(r.offset) - i <= 2e3 ? (t.length = BigInt(Number(t.length) + Number(r.length) - i + Number(r.offset)), t.blocks.push(r)) : n.push(t = {
-      blocks: [r],
-      length: r.length,
-      offset: r.offset
+  for (const a of e)
+    t && i && Number(a.offset) - i <= 2e3 ? (t.length = BigInt(Number(t.length) + Number(a.length) - i + Number(a.offset)), t.blocks.push(a)) : n.push(t = {
+      blocks: [a],
+      length: a.length,
+      offset: a.offset
     }), i = Number(t.offset) + Number(t.length);
   return n;
 }
 function et(e) {
   if (e && e.aborted)
     if (typeof DOMException > "u") {
-      const n = new Fo("aborted");
+      const n = new Lo("aborted");
       throw n.code = "ERR_ABORTED", n;
     } else
       throw new DOMException("aborted", "AbortError");
@@ -2591,7 +2562,7 @@ function Ho(e) {
         type: new N().endianess(n).uint32("startChrom").uint32("startBase").uint32("endChrom").uint32("endBase").uint64("blockOffset").saveOffset("offset")
       })
     }
-  }), r = new N().endianess(n).uint32("chromId").int32("start").int32("end").string("rest", {
+  }), a = new N().endianess(n).uint32("chromId").int32("start").int32("end").string("rest", {
     zeroTerminated: !0
   }).saveOffset("offset");
   return {
@@ -2612,157 +2583,164 @@ function Ho(e) {
         })
       }
     }),
-    bigBedParser: r,
+    bigBedParser: a,
     summaryParser: t,
     leafParser: i
   };
 }
 class Ti {
-  constructor(n, t, i, r, a, o) {
-    if (this.bbi = n, this.refsByName = t, this.cirTreeOffset = i, this.isBigEndian = r, this.isCompressed = a, this.blockType = o, this.featureCache = new Gn({
+  constructor(n, t, i, a, r, o) {
+    if (this.bbi = n, this.refsByName = t, this.cirTreeOffset = i, this.isBigEndian = a, this.isCompressed = r, this.blockType = o, this.featureCache = new Gn({
       cache: new Yn({ maxSize: 1e3 }),
-      fill: async (u, l) => {
-        const f = Number(u.length), d = Number(u.offset), { buffer: c } = await this.bbi.read(Q.Buffer.alloc(f), 0, f, d, {
-          signal: l
+      fill: async (u, s) => {
+        const f = Number(u.length), p = Number(u.offset), { buffer: c } = await this.bbi.read(J.Buffer.alloc(f), 0, f, p, {
+          signal: s
         });
         return c;
       }
     }), !(i >= 0))
       throw new Error("invalid cirTreeOffset!");
-    const s = Ho(r);
-    this.leafParser = s.leafParser, this.bigBedParser = s.bigBedParser;
+    const l = Ho(a);
+    this.leafParser = l.leafParser, this.bigBedParser = l.bigBedParser;
   }
-  async readWigData(n, t, i, r, a) {
+  async readWigData(n, t, i, a, r) {
     try {
-      const { refsByName: o, bbi: s, cirTreeOffset: u, isBigEndian: l } = this, f = o[n];
-      f === void 0 && r.complete();
-      const d = { chrId: f, start: t, end: i };
-      this.cirTreePromise || (this.cirTreePromise = s.read(Q.Buffer.alloc(48), 0, 48, Number(u), a));
-      const { buffer: c } = await this.cirTreePromise, h = l ? c.readUInt32BE(4) : c.readUInt32LE(4);
+      const { refsByName: o, bbi: l, cirTreeOffset: u, isBigEndian: s } = this, f = o[n];
+      f === void 0 && a.complete();
+      const p = { chrId: f, start: t, end: i };
+      this.cirTreePromise || (this.cirTreePromise = l.read(J.Buffer.alloc(48), 0, 48, Number(u), r));
+      const { buffer: c } = await this.cirTreePromise, h = s ? c.readUInt32BE(4) : c.readUInt32LE(4);
       let _ = [], g = 0;
-      const k = (p, $, S) => {
+      const k = (d, $, S) => {
         try {
-          const b = p.subarray($), w = this.leafParser.parse(b);
-          if (w.blocksToFetch && (_ = _.concat(w.blocksToFetch.filter((m) => y(m)).map((m) => ({
+          const b = d.subarray($), w = this.leafParser.parse(b);
+          if (w.blocksToFetch && (_ = _.concat(w.blocksToFetch.filter((m) => v(m)).map((m) => ({
             offset: m.blockOffset,
             length: m.blockSize
           })))), w.recurOffsets) {
-            const m = w.recurOffsets.filter((v) => y(v)).map((v) => Number(v.blockOffset));
+            const m = w.recurOffsets.filter((y) => v(y)).map((y) => Number(y.blockOffset));
             m.length > 0 && C(m, S + 1);
           }
         } catch (b) {
-          r.error(b);
+          a.error(b);
         }
-      }, y = (p) => {
-        const { startChrom: $, startBase: S, endChrom: b, endBase: w } = p;
+      }, v = (d) => {
+        const { startChrom: $, startBase: S, endChrom: b, endBase: w } = d;
         return ($ < f || $ === f && S <= i) && (b > f || b === f && w >= t);
-      }, E = async (p, $, S) => {
+      }, E = async (d, $, S) => {
         try {
-          const b = $.max() - $.min(), w = $.min(), m = await this.featureCache.get(`${b}_${w}`, { length: b, offset: w }, a == null ? void 0 : a.signal);
-          for (const v of p)
-            $.contains(v) && (k(m, v - w, S), g -= 1, g === 0 && this.readFeatures(r, _, { ...a, request: d }));
+          const b = $.max - $.min, w = $.min, m = await this.featureCache.get(`${b}_${w}`, { length: b, offset: w }, r == null ? void 0 : r.signal);
+          for (const y of d)
+            $.contains(y) && (k(m, y - w, S), g -= 1, g === 0 && this.readFeatures(a, _, {
+              ...r,
+              request: p
+            }).catch((I) => a.error(I)));
         } catch (b) {
-          r.error(b);
+          a.error(b);
         }
-      }, C = (p, $) => {
+      }, C = (d, $) => {
         try {
-          g += p.length;
+          g += d.length;
           const S = 4 + Number(h) * 32;
-          let b = new q(p[0], p[0] + S);
-          for (let w = 1; w < p.length; w += 1) {
-            const m = new q(p[w], p[w] + S);
+          let b = new pe([
+            { min: d[0], max: d[0] + S }
+          ]);
+          for (let w = 1; w < d.length; w += 1) {
+            const m = new pe([
+              { min: d[w], max: d[w] + S }
+            ]);
             b = b.union(m);
           }
-          b.getRanges().map((w) => E(p, w, $));
+          b.getRanges().map((w) => E(d, w, $));
         } catch (S) {
-          r.error(S);
+          a.error(S);
         }
       };
       return C([Number(u) + 48], 1);
     } catch (o) {
-      r.error(o);
+      a.error(o);
     }
   }
   parseSummaryBlock(n, t, i) {
-    const r = [];
-    let a = t;
+    const a = [];
+    let r = t;
     const o = new DataView(n.buffer, n.byteOffset, n.length);
-    for (; a < n.byteLength; ) {
-      const s = o.getUint32(a, !0);
-      a += 4;
-      const u = o.getUint32(a, !0);
-      a += 4;
-      const l = o.getUint32(a, !0);
-      a += 4;
-      const f = o.getUint32(a, !0);
-      a += 4;
-      const d = o.getFloat32(a, !0);
-      a += 4;
-      const c = o.getFloat32(a, !0);
-      a += 4;
-      const h = o.getFloat32(a, !0);
-      a += 4, a += 4, (!i || s === i.chrId && Ct(u, l, i.start, i.end)) && r.push({
+    for (; r < n.byteLength; ) {
+      const l = o.getUint32(r, !0);
+      r += 4;
+      const u = o.getUint32(r, !0);
+      r += 4;
+      const s = o.getUint32(r, !0);
+      r += 4;
+      const f = o.getUint32(r, !0);
+      r += 4;
+      const p = o.getFloat32(r, !0);
+      r += 4;
+      const c = o.getFloat32(r, !0);
+      r += 4;
+      const h = o.getFloat32(r, !0);
+      r += 4, r += 4, (!i || l === i.chrId && Ct(u, s, i.start, i.end)) && a.push({
         start: u,
-        end: l,
+        end: s,
         maxScore: c,
-        minScore: d,
+        minScore: p,
         summary: !0,
         score: h / (f || 1)
       });
     }
-    return r;
+    return a;
   }
-  parseBigBedBlock(n, t, i, r) {
-    const a = [];
+  parseBigBedBlock(n, t, i, a) {
+    const r = [];
     let o = t;
     for (; o < n.byteLength; ) {
-      const s = this.bigBedParser.parse(n.subarray(o));
-      s.uniqueId = `bb-${i + o}`, a.push(s), o += s.offset;
+      const l = this.bigBedParser.parse(n.subarray(o));
+      l.uniqueId = `bb-${i + o}`, r.push(l), o += l.offset;
     }
-    return r ? a.filter((s) => Ct(s.start, s.end, r.start, r.end)) : a;
+    return a ? r.filter((l) => Ct(l.start, l.end, a.start, a.end)) : r;
   }
   parseBigWigBlock(n, t, i) {
-    const r = n.subarray(t), a = new DataView(r.buffer, r.byteOffset, r.length);
+    const a = n.subarray(t), r = new DataView(a.buffer, a.byteOffset, a.length);
     let o = 0;
     o += 4;
-    const s = a.getInt32(o, !0);
+    const l = r.getInt32(o, !0);
     o += 8;
-    const u = a.getUint32(o, !0);
+    const u = r.getUint32(o, !0);
     o += 4;
-    const l = a.getUint32(o, !0);
+    const s = r.getUint32(o, !0);
     o += 4;
-    const f = a.getUint8(o);
+    const f = r.getUint8(o);
     o += 2;
-    const d = a.getUint16(o, !0);
+    const p = r.getUint16(o, !0);
     o += 2;
-    const c = new Array(d);
+    const c = new Array(p);
     switch (f) {
       case 1: {
-        for (let h = 0; h < d; h++) {
-          const _ = a.getInt32(o, !0);
+        for (let h = 0; h < p; h++) {
+          const _ = r.getInt32(o, !0);
           o += 4;
-          const g = a.getInt32(o, !0);
+          const g = r.getInt32(o, !0);
           o += 4;
-          const k = a.getFloat32(o, !0);
+          const k = r.getFloat32(o, !0);
           o += 4, c[h] = { start: _, end: g, score: k };
         }
         break;
       }
       case 2: {
-        for (let h = 0; h < d; h++) {
-          const _ = a.getInt32(o, !0);
+        for (let h = 0; h < p; h++) {
+          const _ = r.getInt32(o, !0);
           o += 4;
-          const g = a.getFloat32(o, !0);
-          o += 4, c[h] = { score: g, start: _, end: _ + l };
+          const g = r.getFloat32(o, !0);
+          o += 4, c[h] = { score: g, start: _, end: _ + s };
         }
         break;
       }
       case 3: {
-        for (let h = 0; h < d; h++) {
-          const _ = a.getFloat32(o, !0);
+        for (let h = 0; h < p; h++) {
+          const _ = r.getFloat32(o, !0);
           o += 4;
-          const g = s + h * u;
-          c[h] = { score: _, start: g, end: g + l };
+          const g = l + h * u;
+          c[h] = { score: _, start: g, end: g + s };
         }
         break;
       }
@@ -2771,146 +2749,146 @@ class Ti {
   }
   async readFeatures(n, t, i = {}) {
     try {
-      const { blockType: r, isCompressed: a } = this, { signal: o, request: s } = i, u = Po(t);
-      et(o), await Promise.all(u.map(async (l) => {
+      const { blockType: a, isCompressed: r } = this, { signal: o, request: l } = i, u = Po(t);
+      et(o), await Promise.all(u.map(async (s) => {
         et(o);
-        const { length: f, offset: d } = l, c = await this.featureCache.get(`${f}_${d}`, l, o);
-        for (const h of l.blocks) {
+        const { length: f, offset: p } = s, c = await this.featureCache.get(`${f}_${p}`, s, o);
+        for (const h of s.blocks) {
           et(o);
-          let _ = Number(h.offset) - Number(l.offset), g = c;
-          switch (a && (g = Lo(c.subarray(_)), _ = 0), et(o), r) {
+          let _ = Number(h.offset) - Number(s.offset), g = c;
+          switch (r && (g = Fo(c.subarray(_)), _ = 0), et(o), a) {
             case "summary": {
-              n.next(this.parseSummaryBlock(g, _, s));
+              n.next(this.parseSummaryBlock(g, _, l));
               break;
             }
             case "bigwig": {
-              n.next(this.parseBigWigBlock(g, _, s));
+              n.next(this.parseBigWigBlock(g, _, l));
               break;
             }
             case "bigbed": {
-              n.next(this.parseBigBedBlock(g, _, Number(h.offset) * 256, s));
+              n.next(this.parseBigBedBlock(g, _, Number(h.offset) * 256, l));
               break;
             }
             default:
-              console.warn(`Don't know what to do with ${r}`);
+              console.warn(`Don't know what to do with ${a}`);
           }
         }
       })), n.complete();
-    } catch (r) {
-      n.error(r);
+    } catch (a) {
+      n.error(a);
     }
   }
 }
-var Lt = function(e, n) {
-  return Lt = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(t, i) {
+var Ft = function(e, n) {
+  return Ft = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(t, i) {
     t.__proto__ = i;
   } || function(t, i) {
-    for (var r in i)
-      Object.prototype.hasOwnProperty.call(i, r) && (t[r] = i[r]);
-  }, Lt(e, n);
+    for (var a in i)
+      Object.prototype.hasOwnProperty.call(i, a) && (t[a] = i[a]);
+  }, Ft(e, n);
 };
 function Kt(e, n) {
   if (typeof n != "function" && n !== null)
     throw new TypeError("Class extends value " + String(n) + " is not a constructor or null");
-  Lt(e, n);
+  Ft(e, n);
   function t() {
     this.constructor = e;
   }
   e.prototype = n === null ? Object.create(n) : (t.prototype = n.prototype, new t());
 }
 function jo(e, n, t, i) {
-  function r(a) {
-    return a instanceof t ? a : new t(function(o) {
-      o(a);
+  function a(r) {
+    return r instanceof t ? r : new t(function(o) {
+      o(r);
     });
   }
-  return new (t || (t = Promise))(function(a, o) {
-    function s(f) {
+  return new (t || (t = Promise))(function(r, o) {
+    function l(f) {
       try {
-        l(i.next(f));
-      } catch (d) {
-        o(d);
+        s(i.next(f));
+      } catch (p) {
+        o(p);
       }
     }
     function u(f) {
       try {
-        l(i.throw(f));
-      } catch (d) {
-        o(d);
+        s(i.throw(f));
+      } catch (p) {
+        o(p);
       }
     }
-    function l(f) {
-      f.done ? a(f.value) : r(f.value).then(s, u);
+    function s(f) {
+      f.done ? r(f.value) : a(f.value).then(l, u);
     }
-    l((i = i.apply(e, n || [])).next());
+    s((i = i.apply(e, n || [])).next());
   });
 }
 function Ai(e, n) {
   var t = { label: 0, sent: function() {
-    if (a[0] & 1)
-      throw a[1];
-    return a[1];
-  }, trys: [], ops: [] }, i, r, a, o;
-  return o = { next: s(0), throw: s(1), return: s(2) }, typeof Symbol == "function" && (o[Symbol.iterator] = function() {
+    if (r[0] & 1)
+      throw r[1];
+    return r[1];
+  }, trys: [], ops: [] }, i, a, r, o;
+  return o = { next: l(0), throw: l(1), return: l(2) }, typeof Symbol == "function" && (o[Symbol.iterator] = function() {
     return this;
   }), o;
-  function s(l) {
+  function l(s) {
     return function(f) {
-      return u([l, f]);
+      return u([s, f]);
     };
   }
-  function u(l) {
+  function u(s) {
     if (i)
       throw new TypeError("Generator is already executing.");
-    for (; o && (o = 0, l[0] && (t = 0)), t; )
+    for (; o && (o = 0, s[0] && (t = 0)), t; )
       try {
-        if (i = 1, r && (a = l[0] & 2 ? r.return : l[0] ? r.throw || ((a = r.return) && a.call(r), 0) : r.next) && !(a = a.call(r, l[1])).done)
-          return a;
-        switch (r = 0, a && (l = [l[0] & 2, a.value]), l[0]) {
+        if (i = 1, a && (r = s[0] & 2 ? a.return : s[0] ? a.throw || ((r = a.return) && r.call(a), 0) : a.next) && !(r = r.call(a, s[1])).done)
+          return r;
+        switch (a = 0, r && (s = [s[0] & 2, r.value]), s[0]) {
           case 0:
           case 1:
-            a = l;
+            r = s;
             break;
           case 4:
-            return t.label++, { value: l[1], done: !1 };
+            return t.label++, { value: s[1], done: !1 };
           case 5:
-            t.label++, r = l[1], l = [0];
+            t.label++, a = s[1], s = [0];
             continue;
           case 7:
-            l = t.ops.pop(), t.trys.pop();
+            s = t.ops.pop(), t.trys.pop();
             continue;
           default:
-            if (a = t.trys, !(a = a.length > 0 && a[a.length - 1]) && (l[0] === 6 || l[0] === 2)) {
+            if (r = t.trys, !(r = r.length > 0 && r[r.length - 1]) && (s[0] === 6 || s[0] === 2)) {
               t = 0;
               continue;
             }
-            if (l[0] === 3 && (!a || l[1] > a[0] && l[1] < a[3])) {
-              t.label = l[1];
+            if (s[0] === 3 && (!r || s[1] > r[0] && s[1] < r[3])) {
+              t.label = s[1];
               break;
             }
-            if (l[0] === 6 && t.label < a[1]) {
-              t.label = a[1], a = l;
+            if (s[0] === 6 && t.label < r[1]) {
+              t.label = r[1], r = s;
               break;
             }
-            if (a && t.label < a[2]) {
-              t.label = a[2], t.ops.push(l);
+            if (r && t.label < r[2]) {
+              t.label = r[2], t.ops.push(s);
               break;
             }
-            a[2] && t.ops.pop(), t.trys.pop();
+            r[2] && t.ops.pop(), t.trys.pop();
             continue;
         }
-        l = n.call(e, t);
+        s = n.call(e, t);
       } catch (f) {
-        l = [6, f], r = 0;
+        s = [6, f], a = 0;
       } finally {
-        i = a = 0;
+        i = r = 0;
       }
-    if (l[0] & 5)
-      throw l[1];
-    return { value: l[0] ? l[1] : void 0, done: !0 };
+    if (s[0] & 5)
+      throw s[1];
+    return { value: s[0] ? s[1] : void 0, done: !0 };
   }
 }
-function Fe(e) {
+function Le(e) {
   var n = typeof Symbol == "function" && Symbol.iterator, t = n && e[n], i = 0;
   if (t)
     return t.call(e);
@@ -2922,31 +2900,31 @@ function Fe(e) {
     };
   throw new TypeError(n ? "Object is not iterable." : "Symbol.iterator is not defined.");
 }
-function Ft(e, n) {
+function Lt(e, n) {
   var t = typeof Symbol == "function" && e[Symbol.iterator];
   if (!t)
     return e;
-  var i = t.call(e), r, a = [], o;
+  var i = t.call(e), a, r = [], o;
   try {
-    for (; (n === void 0 || n-- > 0) && !(r = i.next()).done; )
-      a.push(r.value);
-  } catch (s) {
-    o = { error: s };
+    for (; (n === void 0 || n-- > 0) && !(a = i.next()).done; )
+      r.push(a.value);
+  } catch (l) {
+    o = { error: l };
   } finally {
     try {
-      r && !r.done && (t = i.return) && t.call(i);
+      a && !a.done && (t = i.return) && t.call(i);
     } finally {
       if (o)
         throw o.error;
     }
   }
-  return a;
+  return r;
 }
 function Pt(e, n, t) {
   if (t || arguments.length === 2)
-    for (var i = 0, r = n.length, a; i < r; i++)
-      (a || !(i in n)) && (a || (a = Array.prototype.slice.call(n, 0, i)), a[i] = n[i]);
-  return e.concat(a || Array.prototype.slice.call(n));
+    for (var i = 0, a = n.length, r; i < a; i++)
+      (r || !(i in n)) && (r || (r = Array.prototype.slice.call(n, 0, i)), r[i] = n[i]);
+  return e.concat(r || Array.prototype.slice.call(n));
 }
 function be(e) {
   return this instanceof be ? (this.v = e, this) : new be(e);
@@ -2954,54 +2932,54 @@ function be(e) {
 function Go(e, n, t) {
   if (!Symbol.asyncIterator)
     throw new TypeError("Symbol.asyncIterator is not defined.");
-  var i = t.apply(e, n || []), r, a = [];
-  return r = {}, o("next"), o("throw"), o("return"), r[Symbol.asyncIterator] = function() {
+  var i = t.apply(e, n || []), a, r = [];
+  return a = {}, o("next"), o("throw"), o("return"), a[Symbol.asyncIterator] = function() {
     return this;
-  }, r;
+  }, a;
   function o(c) {
-    i[c] && (r[c] = function(h) {
+    i[c] && (a[c] = function(h) {
       return new Promise(function(_, g) {
-        a.push([c, h, _, g]) > 1 || s(c, h);
+        r.push([c, h, _, g]) > 1 || l(c, h);
       });
     });
   }
-  function s(c, h) {
+  function l(c, h) {
     try {
       u(i[c](h));
     } catch (_) {
-      d(a[0][3], _);
+      p(r[0][3], _);
     }
   }
   function u(c) {
-    c.value instanceof be ? Promise.resolve(c.value.v).then(l, f) : d(a[0][2], c);
+    c.value instanceof be ? Promise.resolve(c.value.v).then(s, f) : p(r[0][2], c);
   }
-  function l(c) {
-    s("next", c);
+  function s(c) {
+    l("next", c);
   }
   function f(c) {
-    s("throw", c);
+    l("throw", c);
   }
-  function d(c, h) {
-    c(h), a.shift(), a.length && s(a[0][0], a[0][1]);
+  function p(c, h) {
+    c(h), r.shift(), r.length && l(r[0][0], r[0][1]);
   }
 }
 function Yo(e) {
   if (!Symbol.asyncIterator)
     throw new TypeError("Symbol.asyncIterator is not defined.");
   var n = e[Symbol.asyncIterator], t;
-  return n ? n.call(e) : (e = typeof Fe == "function" ? Fe(e) : e[Symbol.iterator](), t = {}, i("next"), i("throw"), i("return"), t[Symbol.asyncIterator] = function() {
+  return n ? n.call(e) : (e = typeof Le == "function" ? Le(e) : e[Symbol.iterator](), t = {}, i("next"), i("throw"), i("return"), t[Symbol.asyncIterator] = function() {
     return this;
   }, t);
-  function i(a) {
-    t[a] = e[a] && function(o) {
-      return new Promise(function(s, u) {
-        o = e[a](o), r(s, u, o.done, o.value);
+  function i(r) {
+    t[r] = e[r] && function(o) {
+      return new Promise(function(l, u) {
+        o = e[r](o), a(l, u, o.done, o.value);
       });
     };
   }
-  function r(a, o, s, u) {
-    Promise.resolve(u).then(function(l) {
-      a({ value: l, done: s });
+  function a(r, o, l, u) {
+    Promise.resolve(u).then(function(s) {
+      r({ value: s, done: l });
     }, o);
   }
 }
@@ -3017,8 +2995,8 @@ function Oi(e) {
 var St = Oi(function(e) {
   return function(t) {
     e(this), this.message = t ? t.length + ` errors occurred during unsubscription:
-` + t.map(function(i, r) {
-      return r + 1 + ") " + i.toString();
+` + t.map(function(i, a) {
+      return a + 1 + ") " + i.toString();
     }).join(`
   `) : "", this.name = "UnsubscriptionError", this.errors = t;
   };
@@ -3034,22 +3012,22 @@ var Wt = function() {
     this.initialTeardown = n, this.closed = !1, this._parentage = null, this._finalizers = null;
   }
   return e.prototype.unsubscribe = function() {
-    var n, t, i, r, a;
+    var n, t, i, a, r;
     if (!this.closed) {
       this.closed = !0;
       var o = this._parentage;
       if (o)
         if (this._parentage = null, Array.isArray(o))
           try {
-            for (var s = Fe(o), u = s.next(); !u.done; u = s.next()) {
-              var l = u.value;
-              l.remove(this);
+            for (var l = Le(o), u = l.next(); !u.done; u = l.next()) {
+              var s = u.value;
+              s.remove(this);
             }
           } catch (g) {
             n = { error: g };
           } finally {
             try {
-              u && !u.done && (t = s.return) && t.call(s);
+              u && !u.done && (t = l.return) && t.call(l);
             } finally {
               if (n)
                 throw n.error;
@@ -3062,33 +3040,33 @@ var Wt = function() {
         try {
           f();
         } catch (g) {
-          a = g instanceof St ? g.errors : [g];
+          r = g instanceof St ? g.errors : [g];
         }
-      var d = this._finalizers;
-      if (d) {
+      var p = this._finalizers;
+      if (p) {
         this._finalizers = null;
         try {
-          for (var c = Fe(d), h = c.next(); !h.done; h = c.next()) {
+          for (var c = Le(p), h = c.next(); !h.done; h = c.next()) {
             var _ = h.value;
             try {
               Zn(_);
             } catch (g) {
-              a = a ?? [], g instanceof St ? a = Pt(Pt([], Ft(a)), Ft(g.errors)) : a.push(g);
+              r = r ?? [], g instanceof St ? r = Pt(Pt([], Lt(r)), Lt(g.errors)) : r.push(g);
             }
           }
         } catch (g) {
           i = { error: g };
         } finally {
           try {
-            h && !h.done && (r = c.return) && r.call(c);
+            h && !h.done && (a = c.return) && a.call(c);
           } finally {
             if (i)
               throw i.error;
           }
         }
       }
-      if (a)
-        throw new St(a);
+      if (r)
+        throw new St(r);
     }
   }, e.prototype.add = function(n) {
     var t;
@@ -3137,7 +3115,7 @@ var Ri = {
   setTimeout: function(e, n) {
     for (var t = [], i = 2; i < arguments.length; i++)
       t[i - 2] = arguments[i];
-    return setTimeout.apply(void 0, Pt([e, n], Ft(t)));
+    return setTimeout.apply(void 0, Pt([e, n], Lt(t)));
   },
   clearTimeout: function(e) {
     var n = Bi.delegate;
@@ -3161,8 +3139,8 @@ var Xt = function(e) {
     var i = e.call(this) || this;
     return i.isStopped = !1, t ? (i.destination = t, zi(t) && t.add(i)) : i.destination = Jo, i;
   }
-  return n.create = function(t, i, r) {
-    return new ot(t, i, r);
+  return n.create = function(t, i, a) {
+    return new ot(t, i, a);
   }, n.prototype.next = function(t) {
     this.isStopped || this._next(t);
   }, n.prototype.error = function(t) {
@@ -3223,25 +3201,25 @@ var Xo = function() {
   }, e;
 }(), ot = function(e) {
   Kt(n, e);
-  function n(t, i, r) {
-    var a = e.call(this) || this, o;
+  function n(t, i, a) {
+    var r = e.call(this) || this, o;
     if (z(t) || !t)
       o = {
         next: t ?? void 0,
         error: i ?? void 0,
-        complete: r ?? void 0
+        complete: a ?? void 0
       };
     else {
-      var s;
-      a && Ri.useDeprecatedNextContext ? (s = Object.create(t), s.unsubscribe = function() {
-        return a.unsubscribe();
+      var l;
+      r && Ri.useDeprecatedNextContext ? (l = Object.create(t), l.unsubscribe = function() {
+        return r.unsubscribe();
       }, o = {
-        next: t.next && Nt(t.next, s),
-        error: t.error && Nt(t.error, s),
-        complete: t.complete && Nt(t.complete, s)
+        next: t.next && Nt(t.next, l),
+        error: t.error && Nt(t.error, l),
+        complete: t.complete && Nt(t.complete, l)
       }) : o = t;
     }
-    return a.destination = new Xo(o), a;
+    return r.destination = new Xo(o), r;
   }
   return n;
 }(Xt);
@@ -3264,8 +3242,8 @@ function Di(e) {
 }
 function Qo(e) {
   return e.length === 0 ? Di : e.length === 1 ? e[0] : function(t) {
-    return e.reduce(function(i, r) {
-      return r(i);
+    return e.reduce(function(i, a) {
+      return a(i);
     }, t);
   };
 }
@@ -3277,11 +3255,11 @@ var Z = function() {
     var t = new e();
     return t.source = this, t.operator = n, t;
   }, e.prototype.subscribe = function(n, t, i) {
-    var r = this, a = ts(n) ? n : new ot(n, t, i);
+    var a = this, r = ts(n) ? n : new ot(n, t, i);
     return Ko(function() {
-      var o = r, s = o.operator, u = o.source;
-      a.add(s ? s.call(a, u) : u ? r._subscribe(a) : r._trySubscribe(a));
-    }), a;
+      var o = a, l = o.operator, u = o.source;
+      r.add(l ? l.call(r, u) : u ? a._subscribe(r) : a._trySubscribe(r));
+    }), r;
   }, e.prototype._trySubscribe = function(n) {
     try {
       return this._subscribe(n);
@@ -3290,17 +3268,17 @@ var Z = function() {
     }
   }, e.prototype.forEach = function(n, t) {
     var i = this;
-    return t = Mn(t), new t(function(r, a) {
+    return t = Mn(t), new t(function(a, r) {
       var o = new ot({
-        next: function(s) {
+        next: function(l) {
           try {
-            n(s);
+            n(l);
           } catch (u) {
-            a(u), o.unsubscribe();
+            r(u), o.unsubscribe();
           }
         },
-        error: a,
-        complete: r
+        error: r,
+        complete: a
       });
       i.subscribe(o);
     });
@@ -3315,14 +3293,14 @@ var Z = function() {
     return Qo(n)(this);
   }, e.prototype.toPromise = function(n) {
     var t = this;
-    return n = Mn(n), new n(function(i, r) {
-      var a;
+    return n = Mn(n), new n(function(i, a) {
+      var r;
       t.subscribe(function(o) {
-        return a = o;
+        return r = o;
       }, function(o) {
-        return r(o);
+        return a(o);
       }, function() {
-        return i(a);
+        return i(r);
       });
     });
   }, e.create = function(n) {
@@ -3355,32 +3333,32 @@ function $e(e) {
     throw new TypeError("Unable to lift unknown Observable type");
   };
 }
-function Pe(e, n, t, i, r) {
-  return new is(e, n, t, i, r);
+function Pe(e, n, t, i, a) {
+  return new is(e, n, t, i, a);
 }
 var is = function(e) {
   Kt(n, e);
-  function n(t, i, r, a, o, s) {
+  function n(t, i, a, r, o, l) {
     var u = e.call(this, t) || this;
-    return u.onFinalize = o, u.shouldUnsubscribe = s, u._next = i ? function(l) {
+    return u.onFinalize = o, u.shouldUnsubscribe = l, u._next = i ? function(s) {
       try {
-        i(l);
+        i(s);
       } catch (f) {
         t.error(f);
       }
-    } : e.prototype._next, u._error = a ? function(l) {
+    } : e.prototype._next, u._error = r ? function(s) {
       try {
-        a(l);
+        r(s);
       } catch (f) {
         t.error(f);
       } finally {
         this.unsubscribe();
       }
-    } : e.prototype._error, u._complete = r ? function() {
+    } : e.prototype._error, u._complete = a ? function() {
       try {
-        r();
-      } catch (l) {
-        t.error(l);
+        a();
+      } catch (s) {
+        t.error(s);
       } finally {
         this.unsubscribe();
       }
@@ -3408,10 +3386,10 @@ function os(e) {
 function ss(e, n) {
   return typeof Vi(e) == "number" ? e.pop() : n;
 }
-var Li = function(e) {
+var Fi = function(e) {
   return e && typeof e.length == "number" && typeof e != "function";
 };
-function Fi(e) {
+function Li(e) {
   return z(e == null ? void 0 : e.then);
 }
 function Pi(e) {
@@ -3432,7 +3410,7 @@ function Hi(e) {
 }
 function ji(e) {
   return Go(this, arguments, function() {
-    var t, i, r, a;
+    var t, i, a, r;
     return Ai(this, function(o) {
       switch (o.label) {
         case 0:
@@ -3442,11 +3420,11 @@ function ji(e) {
         case 2:
           return [4, be(t.read())];
         case 3:
-          return i = o.sent(), r = i.value, a = i.done, a ? [4, be(void 0)] : [3, 5];
+          return i = o.sent(), a = i.value, r = i.done, r ? [4, be(void 0)] : [3, 5];
         case 4:
           return [2, o.sent()];
         case 5:
-          return [4, be(r)];
+          return [4, be(a)];
         case 6:
           return [4, o.sent()];
         case 7:
@@ -3470,9 +3448,9 @@ function Ee(e) {
   if (e != null) {
     if (Pi(e))
       return fs(e);
-    if (Li(e))
-      return us(e);
     if (Fi(e))
+      return us(e);
+    if (Li(e))
       return hs(e);
     if (Zi(e))
       return Yi(e);
@@ -3511,16 +3489,16 @@ function cs(e) {
   return new Z(function(n) {
     var t, i;
     try {
-      for (var r = Fe(e), a = r.next(); !a.done; a = r.next()) {
-        var o = a.value;
+      for (var a = Le(e), r = a.next(); !r.done; r = a.next()) {
+        var o = r.value;
         if (n.next(o), n.closed)
           return;
       }
-    } catch (s) {
-      t = { error: s };
+    } catch (l) {
+      t = { error: l };
     } finally {
       try {
-        a && !a.done && (i = r.return) && i.call(r);
+        r && !r.done && (i = a.return) && i.call(a);
       } finally {
         if (t)
           throw t.error;
@@ -3540,9 +3518,9 @@ function ds(e) {
   return Yi(ji(e));
 }
 function ps(e, n) {
-  var t, i, r, a;
+  var t, i, a, r;
   return jo(this, void 0, void 0, function() {
-    var o, s;
+    var o, l;
     return Ai(this, function(u) {
       switch (u.label) {
         case 0:
@@ -3560,16 +3538,16 @@ function ps(e, n) {
         case 4:
           return [3, 11];
         case 5:
-          return s = u.sent(), r = { error: s }, [3, 11];
+          return l = u.sent(), a = { error: l }, [3, 11];
         case 6:
-          return u.trys.push([6, , 9, 10]), i && !i.done && (a = t.return) ? [4, a.call(t)] : [3, 8];
+          return u.trys.push([6, , 9, 10]), i && !i.done && (r = t.return) ? [4, r.call(t)] : [3, 8];
         case 7:
           u.sent(), u.label = 8;
         case 8:
           return [3, 10];
         case 9:
-          if (r)
-            throw r.error;
+          if (a)
+            throw a.error;
           return [7];
         case 10:
           return [7];
@@ -3579,27 +3557,27 @@ function ps(e, n) {
     });
   });
 }
-function re(e, n, t, i, r) {
-  i === void 0 && (i = 0), r === void 0 && (r = !1);
-  var a = n.schedule(function() {
-    t(), r ? e.add(this.schedule(null, i)) : this.unsubscribe();
+function le(e, n, t, i, a) {
+  i === void 0 && (i = 0), a === void 0 && (a = !1);
+  var r = n.schedule(function() {
+    t(), a ? e.add(this.schedule(null, i)) : this.unsubscribe();
   }, i);
-  if (e.add(a), !r)
-    return a;
+  if (e.add(r), !a)
+    return r;
 }
 function Ki(e, n) {
   return n === void 0 && (n = 0), $e(function(t, i) {
-    t.subscribe(Pe(i, function(r) {
-      return re(i, e, function() {
-        return i.next(r);
+    t.subscribe(Pe(i, function(a) {
+      return le(i, e, function() {
+        return i.next(a);
       }, n);
     }, function() {
-      return re(i, e, function() {
+      return le(i, e, function() {
         return i.complete();
       }, n);
-    }, function(r) {
-      return re(i, e, function() {
-        return i.error(r);
+    }, function(a) {
+      return le(i, e, function() {
+        return i.error(a);
       }, n);
     }));
   });
@@ -3628,16 +3606,16 @@ function gs(e, n) {
 function ws(e, n) {
   return new Z(function(t) {
     var i;
-    return re(t, n, function() {
-      i = e[Mi](), re(t, n, function() {
-        var r, a, o;
+    return le(t, n, function() {
+      i = e[Mi](), le(t, n, function() {
+        var a, r, o;
         try {
-          r = i.next(), a = r.value, o = r.done;
-        } catch (s) {
-          t.error(s);
+          a = i.next(), r = a.value, o = a.done;
+        } catch (l) {
+          t.error(l);
           return;
         }
-        o ? t.complete() : t.next(a);
+        o ? t.complete() : t.next(r);
       }, 0, !0);
     }), function() {
       return z(i == null ? void 0 : i.return) && i.return();
@@ -3648,11 +3626,11 @@ function Xi(e, n) {
   if (!e)
     throw new Error("Iterable cannot be null");
   return new Z(function(t) {
-    re(t, n, function() {
+    le(t, n, function() {
       var i = e[Symbol.asyncIterator]();
-      re(t, n, function() {
-        i.next().then(function(r) {
-          r.done ? t.complete() : t.next(r.value);
+      le(t, n, function() {
+        i.next().then(function(a) {
+          a.done ? t.complete() : t.next(a.value);
         });
       }, 0, !0);
     });
@@ -3665,9 +3643,9 @@ function ys(e, n) {
   if (e != null) {
     if (Pi(e))
       return _s(e, n);
-    if (Li(e))
-      return gs(e, n);
     if (Fi(e))
+      return gs(e, n);
+    if (Li(e))
       return bs(e, n);
     if (Zi(e))
       return Xi(e, n);
@@ -3687,15 +3665,14 @@ var ks = Oi(function(e) {
   };
 });
 function qi(e, n) {
-  var t = typeof n == "object";
-  return new Promise(function(i, r) {
+  return new Promise(function(t, i) {
     var a = new ot({
-      next: function(o) {
-        i(o), a.unsubscribe();
+      next: function(r) {
+        t(r), a.unsubscribe();
       },
-      error: r,
+      error: i,
       complete: function() {
-        t ? i(n.defaultValue) : r(new ks());
+        i(new ks());
       }
     });
     e.subscribe(a);
@@ -3703,35 +3680,33 @@ function qi(e, n) {
 }
 function Ji(e, n) {
   return $e(function(t, i) {
-    var r = 0;
-    t.subscribe(Pe(i, function(a) {
-      i.next(e.call(n, a, r++));
+    var a = 0;
+    t.subscribe(Pe(i, function(r) {
+      i.next(e.call(n, r, a++));
     }));
   });
 }
-function $s(e, n, t, i, r, a, o, s) {
-  var u = [], l = 0, f = 0, d = !1, c = function() {
-    d && !u.length && !l && n.complete();
+function $s(e, n, t, i, a, r, o, l) {
+  var u = [], s = 0, f = 0, p = !1, c = function() {
+    p && !u.length && !s && n.complete();
   }, h = function(g) {
-    return l < i ? _(g) : u.push(g);
+    return s < i ? _(g) : u.push(g);
   }, _ = function(g) {
-    a && n.next(g), l++;
+    s++;
     var k = !1;
-    Ee(t(g, f++)).subscribe(Pe(n, function(y) {
-      r == null || r(y), a ? h(y) : n.next(y);
+    Ee(t(g, f++)).subscribe(Pe(n, function(v) {
+      n.next(v);
     }, function() {
       k = !0;
     }, void 0, function() {
       if (k)
         try {
-          l--;
-          for (var y = function() {
+          s--;
+          for (var v = function() {
             var E = u.shift();
-            o ? re(n, o, function() {
-              return _(E);
-            }) : _(E);
-          }; u.length && l < i; )
-            y();
+            o || _(E);
+          }; u.length && s < i; )
+            v();
           c();
         } catch (E) {
           n.error(E);
@@ -3739,18 +3714,17 @@ function $s(e, n, t, i, r, a, o, s) {
     }));
   };
   return e.subscribe(Pe(n, h, function() {
-    d = !0, c();
+    p = !0, c();
   })), function() {
-    s == null || s();
   };
 }
 function Qi(e, n, t) {
-  return t === void 0 && (t = 1 / 0), z(n) ? Qi(function(i, r) {
-    return Ji(function(a, o) {
-      return n(i, a, r, o);
-    })(Ee(e(i, r)));
-  }, t) : (typeof n == "number" && (t = n), $e(function(i, r) {
-    return $s(i, r, e, t);
+  return t === void 0 && (t = 1 / 0), z(n) ? Qi(function(i, a) {
+    return Ji(function(r, o) {
+      return n(i, r, a, o);
+    })(Ee(e(i, a)));
+  }, t) : (typeof n == "number" && (t = n), $e(function(i, a) {
+    return $s(i, a, e, t);
   }));
 }
 function Es(e) {
@@ -3759,17 +3733,17 @@ function Es(e) {
 function Cs() {
   for (var e = [], n = 0; n < arguments.length; n++)
     e[n] = arguments[n];
-  var t = os(e), i = ss(e, 1 / 0), r = e;
-  return r.length ? r.length === 1 ? Ee(r[0]) : Es(i)(vs(r, t)) : rs;
-}
-function Ss(e, n, t, i, r) {
-  return function(a, o) {
-    var s = t, u = n, l = 0;
-    a.subscribe(Pe(o, function(f) {
-      var d = l++;
-      u = s ? e(u, f, d) : (s = !0, f), i && o.next(u);
-    }, r && function() {
-      s && o.next(u), o.complete();
+  var t = os(e), i = ss(e, 1 / 0), a = e;
+  return a.length ? a.length === 1 ? Ee(a[0]) : Es(i)(vs(a, t)) : rs;
+}
+function Ss(e, n, t, i, a) {
+  return function(r, o) {
+    var l = t, u = n, s = 0;
+    r.subscribe(Pe(o, function(f) {
+      var p = s++;
+      u = l ? e(u, f, p) : (l = !0, f);
+    }, function() {
+      l && o.next(u), o.complete();
     }));
   };
 }
@@ -3792,12 +3766,12 @@ function jn(e) {
   const n = e ? "big" : "little", t = new N().endianess(n).int32("magic").uint16("version").uint16("numZoomLevels").uint64("chromTreeOffset").uint64("unzoomedDataOffset").uint64("unzoomedIndexOffset").uint16("fieldCount").uint16("definedFieldCount").uint64("asOffset").uint64("totalSummaryOffset").uint32("uncompressBufSize").uint64("extHeaderOffset").array("zoomLevels", {
     length: "numZoomLevels",
     type: new N().endianess(n).uint32("reductionLevel").uint32("reserved").uint64("dataOffset").uint64("indexOffset")
-  }), i = new N().endianess(n).uint64("basesCovered").doublele("scoreMin").doublele("scoreMax").doublele("scoreSum").doublele("scoreSumSquares"), r = new N().endianess(n).uint32("magic").uint32("blockSize").uint32("keySize").uint32("valSize").uint64("itemCount"), a = new N().endianess(n).uint8("isLeafNode").skip(1).uint16("cnt").saveOffset("offset");
+  }), i = new N().endianess(n).uint64("basesCovered").doublele("scoreMin").doublele("scoreMax").doublele("scoreSum").doublele("scoreSumSquares"), a = new N().endianess(n).uint32("magic").uint32("blockSize").uint32("keySize").uint32("valSize").uint64("itemCount"), r = new N().endianess(n).uint8("isLeafNode").skip(1).uint16("cnt").saveOffset("offset");
   return {
-    chromTreeParser: r,
+    chromTreeParser: a,
     totalSummaryParser: i,
     headerParser: t,
-    isLeafNode: a
+    isLeafNode: r
   };
 }
 class tr {
@@ -3821,13 +3795,13 @@ class tr {
    * sequences using a mapping function
    */
   constructor(n) {
-    const { filehandle: t, renameRefSeqs: i = (o) => o, path: r, url: a } = n;
+    const { filehandle: t, renameRefSeqs: i = (o) => o, path: a, url: r } = n;
     if (this.renameRefSeqs = i, t)
       this.bbi = t;
-    else if (a)
-      this.bbi = new ir(a);
     else if (r)
-      this.bbi = new nr(r);
+      this.bbi = new ir(r);
+    else if (a)
+      this.bbi = new nr(a);
     else
       throw new Error("no file given");
   }
@@ -3836,8 +3810,8 @@ class tr {
     return { ...t, ...i };
   }
   async _getMainHeader(n, t = 2e3) {
-    const { buffer: i } = await this.bbi.read(Q.Buffer.alloc(t), 0, t, 0, n), r = this._isBigEndian(i), a = jn(r), o = a.headerParser.parse(i), { magic: s, asOffset: u, totalSummaryOffset: l } = o;
-    if (o.fileType = s === It ? "bigbed" : "bigwig", u > t || l > t)
+    const { buffer: i } = await this.bbi.read(J.Buffer.alloc(t), 0, t, 0, n), a = this._isBigEndian(i), r = jn(a), o = r.headerParser.parse(i), { magic: l, asOffset: u, totalSummaryOffset: s } = o;
+    if (o.fileType = l === It ? "bigbed" : "bigwig", u > t || s > t)
       return this._getMainHeader(n, t * 2);
     if (u) {
       const f = Number(o.asOffset);
@@ -3846,10 +3820,10 @@ class tr {
     if (o.totalSummaryOffset > t - 8 * 5)
       return this._getMainHeader(n, t * 2);
     if (o.totalSummaryOffset) {
-      const f = i.subarray(Number(o.totalSummaryOffset)), d = a.totalSummaryParser.parse(f);
-      o.totalSummary = { ...d, basesCovered: Number(d.basesCovered) };
+      const f = i.subarray(Number(o.totalSummaryOffset)), p = r.totalSummaryParser.parse(f);
+      o.totalSummary = { ...p, basesCovered: Number(p.basesCovered) };
     }
-    return { ...o, isBigEndian: r };
+    return { ...o, isBigEndian: a };
   }
   _isBigEndian(n) {
     let t = n.readInt32LE(0);
@@ -3861,22 +3835,22 @@ class tr {
   }
   // todo: add progress if long running
   async _readChromTree(n, t) {
-    const i = n.isBigEndian, r = i ? "big" : "little", a = [], o = {};
-    let s = Number(n.unzoomedDataOffset);
+    const i = n.isBigEndian, a = i ? "big" : "little", r = [], o = {};
+    let l = Number(n.unzoomedDataOffset);
     const u = Number(n.chromTreeOffset);
-    for (; s % 4 !== 0; )
-      s += 1;
-    const l = s - u, { buffer: f } = await this.bbi.read(Q.Buffer.alloc(l), 0, l, Number(u), t), d = jn(i), { keySize: c } = d.chromTreeParser.parse(f), h = new N().endianess(r).string("key", { stripNull: !0, length: c }).uint32("refId").uint32("refSize").saveOffset("offset"), _ = new N().endianess(r).skip(c).uint64("childOffset").saveOffset("offset"), g = 32, k = async (y) => {
-      let E = y;
+    for (; l % 4 !== 0; )
+      l += 1;
+    const s = l - u, { buffer: f } = await this.bbi.read(J.Buffer.alloc(s), 0, s, Number(u), t), p = jn(i), { keySize: c } = p.chromTreeParser.parse(f), h = new N().endianess(a).string("key", { stripNull: !0, length: c }).uint32("refId").uint32("refSize").saveOffset("offset"), _ = new N().endianess(a).skip(c).uint64("childOffset").saveOffset("offset"), g = 32, k = async (v) => {
+      let E = v;
       if (E >= f.length)
         throw new Error("reading beyond end of buffer");
-      const C = d.isLeafNode.parse(f.subarray(E)), { isLeafNode: p, cnt: $ } = C;
-      if (E += C.offset, p)
+      const C = p.isLeafNode.parse(f.subarray(E)), { isLeafNode: d, cnt: $ } = C;
+      if (E += C.offset, d)
         for (let S = 0; S < $; S += 1) {
           const b = h.parse(f.subarray(E));
           E += b.offset;
-          const { key: w, refId: m, refSize: v } = b, I = { name: w, id: m, length: v };
-          o[this.renameRefSeqs(w)] = m, a[m] = I;
+          const { key: w, refId: m, refSize: y } = b, I = { name: w, id: m, length: y };
+          o[this.renameRefSeqs(w)] = m, r[m] = I;
         }
       else {
         const S = [];
@@ -3889,7 +3863,7 @@ class tr {
     };
     return await k(g), {
       refsByName: o,
-      refsByNumber: a
+      refsByNumber: r
     };
   }
   /*
@@ -3897,8 +3871,8 @@ class tr {
    * @param abortSignal - a signal to optionally abort this operation
    */
   async getUnzoomedView(n) {
-    const { unzoomedIndexOffset: t, refsByName: i, uncompressBufSize: r, isBigEndian: a, fileType: o } = await this.getHeader(n);
-    return new Ti(this.bbi, i, t, a, r > 0, o);
+    const { unzoomedIndexOffset: t, refsByName: i, uncompressBufSize: a, isBigEndian: r, fileType: o } = await this.getHeader(n);
+    return new Ti(this.bbi, i, t, r, a > 0, o);
   }
   /**
    * Gets features from a BigWig file
@@ -3908,18 +3882,18 @@ class tr {
    * @param end - The end of a region
    * @param opts - An object containing basesPerSpan (e.g. pixels per basepair) or scale used to infer the zoomLevel to use
    */
-  async getFeatureStream(n, t, i, r) {
-    await this.getHeader(r);
-    const a = this.renameRefSeqs(n);
+  async getFeatureStream(n, t, i, a) {
+    await this.getHeader(a);
+    const r = this.renameRefSeqs(n);
     let o;
-    const { basesPerSpan: s, scale: u } = r || {};
-    return s ? o = await this.getView(1 / s, r) : u ? o = await this.getView(u, r) : o = await this.getView(1, r), new Z((l) => {
-      o.readWigData(a, t, i, l, r);
+    const { basesPerSpan: l, scale: u } = a || {};
+    return l ? o = await this.getView(1 / l, a) : u ? o = await this.getView(u, a) : o = await this.getView(1, a), new Z((s) => {
+      o.readWigData(r, t, i, s, a);
     });
   }
-  async getFeatures(n, t, i, r) {
-    const a = await this.getFeatureStream(n, t, i, r);
-    return (await qi(a.pipe(Is()))).flat();
+  async getFeatures(n, t, i, a) {
+    const r = await this.getFeatureStream(n, t, i, a);
+    return (await qi(r.pipe(Is()))).flat();
   }
 }
 class Fs extends tr {
@@ -3930,14 +3904,14 @@ class Fs extends tr {
    * @param opts - An object containing basesPerSpan (e.g. pixels per basepair) or scale used to infer the zoomLevel to use
    */
   async getView(n, t) {
-    const { zoomLevels: i, refsByName: r, fileSize: a, isBigEndian: o, uncompressBufSize: s } = await this.getHeader(t), u = 1 / n;
-    let l = i.length;
-    a || (l -= 1);
-    for (let f = l; f >= 0; f -= 1) {
-      const d = i[f];
-      if (d && d.reductionLevel <= 2 * u) {
-        const c = Number(d.indexOffset);
-        return new Ti(this.bbi, r, c, o, s > 0, "summary");
+    const { zoomLevels: i, refsByName: a, fileSize: r, isBigEndian: o, uncompressBufSize: l } = await this.getHeader(t), u = 1 / n;
+    let s = i.length;
+    r || (s -= 1);
+    for (let f = s; f >= 0; f -= 1) {
+      const p = i[f];
+      if (p && p.reductionLevel <= 2 * u) {
+        const c = Number(p.indexOffset);
+        return new Ti(this.bbi, a, c, o, l > 0, "summary");
       }
     }
     return this.getUnzoomedView(t);
@@ -3946,7 +3920,7 @@ class Fs extends tr {
 function As(e) {
   return e.filter((n) => !!n);
 }
-class Ps extends tr {
+class Ls extends tr {
   constructor() {
     super(...arguments), this.readIndicesCache = new Gn({
       cache: new Yn({ maxSize: 1 }),
@@ -3969,12 +3943,12 @@ class Ps extends tr {
    * @return a Promise for an array of Index data structure since there can be multiple extraIndexes in a bigbed, see bedToBigBed documentation
    */
   async _readIndices(n) {
-    const { extHeaderOffset: t, isBigEndian: i } = await this.getHeader(n), { buffer: r } = await this.bbi.read(Q.Buffer.alloc(64), 0, 64, Number(t)), a = i ? "big" : "little", o = new N().endianess(a).uint16("size").uint16("count").uint64("offset").parse(r), { count: s, offset: u } = o;
-    if (s === 0)
+    const { extHeaderOffset: t, isBigEndian: i } = await this.getHeader(n), { buffer: a } = await this.bbi.read(J.Buffer.alloc(64), 0, 64, Number(t)), r = i ? "big" : "little", o = new N().endianess(r).uint16("size").uint16("count").uint64("offset").parse(a), { count: l, offset: u } = o;
+    if (l === 0)
       return [];
-    const l = 20, f = l * s, { buffer: d } = await this.bbi.read(Q.Buffer.alloc(f), 0, f, Number(u)), c = new N().endianess(a).int16("type").int16("fieldcount").uint64("offset").skip(4).int16("field"), h = [];
-    for (let _ = 0; _ < s; _ += 1)
-      h.push(c.parse(d.subarray(_ * l)));
+    const s = 20, f = s * l, { buffer: p } = await this.bbi.read(J.Buffer.alloc(f), 0, f, Number(u)), c = new N().endianess(r).int16("type").int16("fieldcount").uint64("offset").skip(4).int16("field"), h = [];
+    for (let _ = 0; _ < l; _ += 1)
+      h.push(c.parse(p.subarray(_ * s)));
     return h;
   }
   /*
@@ -3986,11 +3960,11 @@ class Ps extends tr {
    * @return a Promise for an array of bigbed block Loc entries
    */
   async searchExtraIndexBlocks(n, t = {}) {
-    const { isBigEndian: i } = await this.getHeader(t), r = await this.readIndices(t);
-    if (r.length === 0)
+    const { isBigEndian: i } = await this.getHeader(t), a = await this.readIndices(t);
+    if (a.length === 0)
       return [];
-    const a = r.map(async (o) => {
-      const { offset: s, field: u } = o, { buffer: l } = await this.bbi.read(Q.Buffer.alloc(32), 0, 32, Number(s), t), f = i ? "big" : "little", d = new N().endianess(f).int32("magic").int32("blockSize").int32("keySize").int32("valSize").uint64("itemCount"), { blockSize: c, keySize: h, valSize: _ } = d.parse(l), g = new N().endianess(f).int8("nodeType").skip(1).int16("cnt").choice({
+    const r = a.map(async (o) => {
+      const { offset: l, field: u } = o, { buffer: s } = await this.bbi.read(J.Buffer.alloc(32), 0, 32, Number(l), t), f = i ? "big" : "little", p = new N().endianess(f).int32("magic").int32("blockSize").int32("keySize").int32("valSize").uint64("itemCount"), { blockSize: c, keySize: h, valSize: _ } = p.parse(s), g = new N().endianess(f).int8("nodeType").skip(1).int16("cnt").choice({
         tag: "nodeType",
         choices: {
           0: new N().array("leafkeys", {
@@ -4003,7 +3977,7 @@ class Ps extends tr {
           })
         }
       }), k = async (E) => {
-        const C = Number(E), p = 4 + c * (h + _), { buffer: $ } = await this.bbi.read(Q.Buffer.alloc(p), 0, p, C, t), S = g.parse($);
+        const C = Number(E), d = 4 + c * (h + _), { buffer: $ } = await this.bbi.read(J.Buffer.alloc(d), 0, d, C, t), S = g.parse($);
         if (S.leafkeys) {
           let b;
           for (let w = 0; w < S.leafkeys.length; w += 1) {
@@ -4017,10 +3991,10 @@ class Ps extends tr {
         for (let b = 0; b < S.keys.length; b += 1)
           if (S.keys[b].key === n)
             return { ...S.keys[b], field: u };
-      }, y = 32;
-      return k(Number(s) + y);
+      };
+      return k(Number(l) + 32);
     });
-    return As(await Promise.all(a));
+    return As(await Promise.all(r));
   }
   /*
    * retrieve the features from the bigbed data that were found through the lookup of the extraIndex
@@ -4034,20 +4008,20 @@ class Ps extends tr {
     const i = await this.searchExtraIndexBlocks(n, t);
     if (i.length === 0)
       return [];
-    const r = await this.getUnzoomedView(t), a = i.map((s) => new Z((u) => {
-      r.readFeatures(u, [s], t);
-    }).pipe(er((u, l) => u.concat(l)), Ji((u) => {
-      for (const l of u)
-        l.field = s.field;
+    const a = await this.getUnzoomedView(t), r = i.map((l) => new Z((u) => {
+      a.readFeatures(u, [l], t);
+    }).pipe(er((u, s) => u.concat(s)), Ji((u) => {
+      for (const s of u)
+        s.field = l.field;
       return u;
     })));
-    return (await qi(Cs(...a))).filter((s) => {
+    return (await qi(Cs(...r))).filter((l) => {
       var u;
-      return ((u = s.rest) === null || u === void 0 ? void 0 : u.split("	")[(s.field || 0) - 3]) === n;
+      return ((u = l.rest) === null || u === void 0 ? void 0 : u.split("	")[(l.field || 0) - 3]) === n;
     });
   }
 }
 export {
-  Ps as BigBed,
+  Ls as BigBed,
   Fs as BigWig
 };