locar-tiler 0.6.0 → 0.7.1

package/dist/locar-tiler.mjs

@@ -1,4 +1,4 @@
-class N {
+class D {
   static EARTH = 4007501668e-2;
   static HALF_EARTH = 2003750834e-2;
 }
@@ -13,15 +13,15 @@ class q {
    * @param {number} y - the y coordinate of the tile.
    * @param {number} z - the zoom of the tile.
    */
-  constructor(e, t, n) {
-    this.x = e, this.y = t, this.z = n;
+  constructor(e, t, s) {
+    this.x = e, this.y = t, this.z = s;
   }
   /**
    * Get the number of Spherical Mercator "metres" in a given tile.
    * @return {number} the number of Spherical Mercator "metres" in a given tile.
    */
   getMetresInTile() {
-    return N.EARTH / Math.pow(2, this.z);
+    return D.EARTH / Math.pow(2, this.z);
   }
   /**
    * Get the bottom left coordinate of the tile.
@@ -29,7 +29,7 @@ class q {
    */
   getBottomLeft() {
     var e = this.getMetresInTile();
-    return { e: this.x * e - N.HALF_EARTH, n: N.HALF_EARTH - (this.y + 1) * e };
+    return { e: this.x * e - D.HALF_EARTH, n: D.HALF_EARTH - (this.y + 1) * e };
   }
   /**
    * Get the top right coordinate of the tile.
@@ -57,7 +57,7 @@ class Se {
    * @return {EastNorth} the Spherical Mercator coordinates. 
    */
   project(e) {
-    return { e: this.#e(e.lon), n: this.#t(e.lat) };
+    return { e: this.#e(e.longitude), n: this.#t(e.latitude) };
   }
   /**
    * Unproject Spherical Mercator into longitude/latitude.
@@ -65,20 +65,20 @@ class Se {
    * @return {LonLat} the longitude/latitude.
    */
   unproject(e) {
-    return { lon: this.#n(e[0]), lat: this.#i(e[1]) };
+    return { longitude: this.#s(e[0]), latitude: this.#i(e[1]) };
   }
   #e(e) {
-    return e / 180 * N.HALF_EARTH;
+    return e / 180 * D.HALF_EARTH;
   }
   #t(e) {
     var t = Math.log(Math.tan((90 + e) * Math.PI / 360)) / (Math.PI / 180);
-    return t * N.HALF_EARTH / 180;
+    return t * D.HALF_EARTH / 180;
   }
-  #n(e) {
-    return e / N.HALF_EARTH * 180;
+  #s(e) {
+    return e / D.HALF_EARTH * 180;
   }
   #i(e) {
-    var t = e / N.HALF_EARTH * 180;
+    var t = e / D.HALF_EARTH * 180;
     return t = 180 / Math.PI * (2 * Math.atan(Math.exp(t * Math.PI / 180)) - Math.PI / 2), t;
   }
   /**
@@ -87,8 +87,8 @@ class Se {
    * @param {number} z - the zoom level. 
    */
   getTile(e, t) {
-    var n = new q(-1, -1, t), a = n.getMetresInTile();
-    return n.x = Math.floor((N.HALF_EARTH + e.e) / a), n.y = Math.floor((N.HALF_EARTH - e.n) / a), n;
+    var s = new q(-1, -1, t), a = s.getMetresInTile();
+    return s.x = Math.floor((D.HALF_EARTH + e.e) / a), s.y = Math.floor((D.HALF_EARTH - e.n) / a), s;
   }
   /**
    * Obtains a tile from a given lon/lat and zoom.
@@ -149,13 +149,13 @@ class ie {
    */
   async update(e) {
     const t = [];
-    let n = null;
-    if (n = this.#e(e)) {
-      this.tile = n;
-      const a = [n.x, n.x - 1, n.x + 1], s = [n.y, n.y - 1, n.y + 1];
+    let s = null;
+    if (s = this.#e(e)) {
+      this.tile = s;
+      const a = [s.x, s.x - 1, s.x + 1], n = [s.y, s.y - 1, s.y + 1];
       for (let l = 0; l < a.length; l++)
-        for (let h = 0; h < s.length; h++) {
-          const d = new q(a[l], s[h], n.z), r = await this.#t(d);
+        for (let h = 0; h < n.length; h++) {
+          const d = new q(a[l], n[h], s.z), r = await this.#t(d);
           r !== null && t.push({ data: r.data, tile: d });
         }
     }
@@ -174,10 +174,10 @@ class ie {
    * @return {DataTile[]} array of 9 tiles, including the current tile and the 8 surrounding it.
    */
   getCurrentTiles() {
-    const e = [], t = [this.tile.x, this.tile.x - 1, this.tile.x + 1], n = [this.tile.y, this.tile.y - 1, this.tile.y + 1];
+    const e = [], t = [this.tile.x, this.tile.x - 1, this.tile.x + 1], s = [this.tile.y, this.tile.y - 1, this.tile.y + 1];
     for (let a = 0; a < t.length; a++)
-      for (let s = 0; s < n.length; s++) {
-        const l = new q(t[a], n[s], this.tile.z), h = this.dataTiles.get(l.getIndex());
+      for (let n = 0; n < s.length; n++) {
+        const l = new q(t[a], s[n], this.tile.z), h = this.dataTiles.get(l.getIndex());
         h !== null && e.push({ data: h, tile: l });
       }
     return e;
@@ -192,10 +192,10 @@ class ie {
   async #t(e) {
     const t = e.getIndex();
     if (this.dataTiles.get(t) === void 0) {
-      const n = await this.readTile(
+      const s = await this.readTile(
         this.url.replace("{x}", e.x.toString()).replace("{y}", e.y.toString()).replace("{z}", e.z.toString())
       );
-      return this.dataTiles.set(t, this.rawTileToStoredTile(e, n)), this.dataTiles.get(t);
+      return this.dataTiles.set(t, this.rawTileToStoredTile(e, s)), this.dataTiles.get(t);
     }
     return null;
   }
@@ -207,8 +207,8 @@ class ie {
    */
   async getData(e, t = 13) {
     await this.update(e);
-    const n = this.sphMerc.getTile(e, t);
-    return this.dataTiles.get(`${t}/${n.x}/${n.y}`);
+    const s = this.sphMerc.getTile(e, t);
+    return this.dataTiles.get(`${t}/${s.x}/${s.y}`);
   }
   /**
    * Converts the raw data from the server to a custom type of data.
@@ -280,11 +280,11 @@ class wt {
    * @returns A new IOBuffer instance.
    */
   constructor(e = Re, t = {}) {
-    let n = !1;
-    typeof e == "number" ? e = new ArrayBuffer(e) : (n = !0, this.lastWrittenByte = e.byteLength);
-    const a = t.offset ? t.offset >>> 0 : 0, s = e.byteLength - a;
+    let s = !1;
+    typeof e == "number" ? e = new ArrayBuffer(e) : (s = !0, this.lastWrittenByte = e.byteLength);
+    const a = t.offset ? t.offset >>> 0 : 0, n = e.byteLength - a;
     let l = a;
-    (ArrayBuffer.isView(e) || e instanceof wt) && (e.byteLength !== e.buffer.byteLength && (l = e.byteOffset + a), e = e.buffer), n ? this.lastWrittenByte = s : this.lastWrittenByte = 0, this.buffer = e, this.length = s, this.byteLength = s, this.byteOffset = l, this.offset = 0, this.littleEndian = !0, this._data = new DataView(this.buffer, l, s), this._mark = 0, this._marks = [];
+    (ArrayBuffer.isView(e) || e instanceof wt) && (e.byteLength !== e.buffer.byteLength && (l = e.byteOffset + a), e = e.buffer), s ? this.lastWrittenByte = n : this.lastWrittenByte = 0, this.buffer = e, this.length = n, this.byteLength = n, this.byteOffset = l, this.offset = 0, this.littleEndian = !0, this._data = new DataView(this.buffer, l, n), this._mark = 0, this._marks = [];
   }
   /**
    * Checks if the memory allocated to the buffer is sufficient to store more
@@ -401,8 +401,8 @@ class wt {
    */
   ensureAvailable(e = 1) {
     if (!this.available(e)) {
-      const n = (this.offset + e) * 2, a = new Uint8Array(n);
-      a.set(new Uint8Array(this.buffer)), this.buffer = a.buffer, this.length = n, this.byteLength = n, this._data = new DataView(this.buffer);
+      const s = (this.offset + e) * 2, a = new Uint8Array(s);
+      a.set(new Uint8Array(this.buffer)), this.buffer = a.buffer, this.length = s, this.byteLength = s, this._data = new DataView(this.buffer);
     }
     return this;
   }
@@ -451,15 +451,15 @@ class wt {
    * @returns The read array.
    */
   readArray(e, t) {
-    const n = et[t].BYTES_PER_ELEMENT * e, a = this.byteOffset + this.offset, s = this.buffer.slice(a, a + n);
+    const s = et[t].BYTES_PER_ELEMENT * e, a = this.byteOffset + this.offset, n = this.buffer.slice(a, a + s);
     if (this.littleEndian === Ce && t !== "uint8" && t !== "int8") {
-      const h = new Uint8Array(this.buffer.slice(a, a + n));
+      const h = new Uint8Array(this.buffer.slice(a, a + s));
       h.reverse();
       const d = new et[t](h.buffer);
-      return this.offset += n, d.reverse(), d;
+      return this.offset += s, d.reverse(), d;
     }
-    const l = new et[t](s);
-    return this.offset += n, l;
+    const l = new et[t](n);
+    return this.offset += s, l;
   }
   /**
    * Read a 16-bit signed integer and move pointer forward by 2 bytes.
@@ -539,7 +539,7 @@ class wt {
    */
   readChars(e = 1) {
     let t = "";
-    for (let n = 0; n < e; n++)
+    for (let s = 0; s < e; s++)
       t += this.readChar();
     return t;
   }
@@ -739,43 +739,43 @@ function F(i) {
   for (; --e >= 0; )
     i[e] = 0;
 }
-const Ne = 3, De = 258, ne = 29, Me = 256, Le = Me + 1 + ne, se = 30, Be = 512, $e = new Array((Le + 2) * 2);
+const De = 3, Ne = 258, se = 29, Me = 256, Le = Me + 1 + se, ne = 30, Be = 512, $e = new Array((Le + 2) * 2);
 F($e);
-const Fe = new Array(se * 2);
+const Fe = new Array(ne * 2);
 F(Fe);
 const He = new Array(Be);
 F(He);
-const Ze = new Array(De - Ne + 1);
+const Ze = new Array(Ne - De + 1);
 F(Ze);
-const We = new Array(ne);
+const We = new Array(se);
 F(We);
-const ze = new Array(se);
+const ze = new Array(ne);
 F(ze);
-const Pe = (i, e, t, n) => {
-  let a = i & 65535 | 0, s = i >>> 16 & 65535 | 0, l = 0;
+const Pe = (i, e, t, s) => {
+  let a = i & 65535 | 0, n = i >>> 16 & 65535 | 0, l = 0;
   for (; t !== 0; ) {
     l = t > 2e3 ? 2e3 : t, t -= l;
     do
-      a = a + e[n++] | 0, s = s + a | 0;
+      a = a + e[s++] | 0, n = n + a | 0;
     while (--l);
-    a %= 65521, s %= 65521;
+    a %= 65521, n %= 65521;
   }
-  return a | s << 16 | 0;
+  return a | n << 16 | 0;
 };
 var ut = Pe;
 const Ge = () => {
   let i, e = [];
   for (var t = 0; t < 256; t++) {
     i = t;
-    for (var n = 0; n < 8; n++)
+    for (var s = 0; s < 8; s++)
       i = i & 1 ? 3988292384 ^ i >>> 1 : i >>> 1;
     e[t] = i;
   }
   return e;
-}, Ke = new Uint32Array(Ge()), Ye = (i, e, t, n) => {
-  const a = Ke, s = n + t;
+}, Ke = new Uint32Array(Ge()), Ye = (i, e, t, s) => {
+  const a = Ke, n = s + t;
   i ^= -1;
-  for (let l = n; l < s; l++)
+  for (let l = s; l < n; l++)
     i = i >>> 8 ^ a[(i ^ e[l]) & 255];
   return i ^ -1;
 };
@@ -826,18 +826,18 @@ var Xe = function(i) {
     if (t) {
       if (typeof t != "object")
         throw new TypeError(t + "must be non-object");
-      for (const n in t)
-        je(t, n) && (i[n] = t[n]);
+      for (const s in t)
+        je(t, s) && (i[s] = t[s]);
     }
   }
   return i;
 }, Ve = (i) => {
   let e = 0;
-  for (let n = 0, a = i.length; n < a; n++)
-    e += i[n].length;
+  for (let s = 0, a = i.length; s < a; s++)
+    e += i[s].length;
   const t = new Uint8Array(e);
-  for (let n = 0, a = 0, s = i.length; n < s; n++) {
-    let l = i[n];
+  for (let s = 0, a = 0, n = i.length; s < n; s++) {
+    let l = i[s];
     t.set(l, a), a += l.length;
   }
   return t;
@@ -858,47 +858,47 @@ Z[254] = Z[254] = 1;
 var qe = (i) => {
   if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
     return new TextEncoder().encode(i);
-  let e, t, n, a, s, l = i.length, h = 0;
+  let e, t, s, a, n, l = i.length, h = 0;
   for (a = 0; a < l; a++)
-    t = i.charCodeAt(a), (t & 64512) === 55296 && a + 1 < l && (n = i.charCodeAt(a + 1), (n & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (n - 56320), a++)), h += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
-  for (e = new Uint8Array(h), s = 0, a = 0; s < h; a++)
-    t = i.charCodeAt(a), (t & 64512) === 55296 && a + 1 < l && (n = i.charCodeAt(a + 1), (n & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (n - 56320), a++)), t < 128 ? e[s++] = t : t < 2048 ? (e[s++] = 192 | t >>> 6, e[s++] = 128 | t & 63) : t < 65536 ? (e[s++] = 224 | t >>> 12, e[s++] = 128 | t >>> 6 & 63, e[s++] = 128 | t & 63) : (e[s++] = 240 | t >>> 18, e[s++] = 128 | t >>> 12 & 63, e[s++] = 128 | t >>> 6 & 63, e[s++] = 128 | t & 63);
+    t = i.charCodeAt(a), (t & 64512) === 55296 && a + 1 < l && (s = i.charCodeAt(a + 1), (s & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (s - 56320), a++)), h += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
+  for (e = new Uint8Array(h), n = 0, a = 0; n < h; a++)
+    t = i.charCodeAt(a), (t & 64512) === 55296 && a + 1 < l && (s = i.charCodeAt(a + 1), (s & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (s - 56320), a++)), t < 128 ? e[n++] = t : t < 2048 ? (e[n++] = 192 | t >>> 6, e[n++] = 128 | t & 63) : t < 65536 ? (e[n++] = 224 | t >>> 12, e[n++] = 128 | t >>> 6 & 63, e[n++] = 128 | t & 63) : (e[n++] = 240 | t >>> 18, e[n++] = 128 | t >>> 12 & 63, e[n++] = 128 | t >>> 6 & 63, e[n++] = 128 | t & 63);
   return e;
 };
 const Je = (i, e) => {
   if (e < 65534 && i.subarray && oe)
     return String.fromCharCode.apply(null, i.length === e ? i : i.subarray(0, e));
   let t = "";
-  for (let n = 0; n < e; n++)
-    t += String.fromCharCode(i[n]);
+  for (let s = 0; s < e; s++)
+    t += String.fromCharCode(i[s]);
   return t;
 };
 var Qe = (i, e) => {
   const t = e || i.length;
   if (typeof TextDecoder == "function" && TextDecoder.prototype.decode)
     return new TextDecoder().decode(i.subarray(0, e));
-  let n, a;
-  const s = new Array(t * 2);
-  for (a = 0, n = 0; n < t; ) {
-    let l = i[n++];
+  let s, a;
+  const n = new Array(t * 2);
+  for (a = 0, s = 0; s < t; ) {
+    let l = i[s++];
     if (l < 128) {
-      s[a++] = l;
+      n[a++] = l;
       continue;
     }
     let h = Z[l];
     if (h > 4) {
-      s[a++] = 65533, n += h - 1;
+      n[a++] = 65533, s += h - 1;
       continue;
     }
-    for (l &= h === 2 ? 31 : h === 3 ? 15 : 7; h > 1 && n < t; )
-      l = l << 6 | i[n++] & 63, h--;
+    for (l &= h === 2 ? 31 : h === 3 ? 15 : 7; h > 1 && s < t; )
+      l = l << 6 | i[s++] & 63, h--;
     if (h > 1) {
-      s[a++] = 65533;
+      n[a++] = 65533;
       continue;
     }
-    l < 65536 ? s[a++] = l : (l -= 65536, s[a++] = 55296 | l >> 10 & 1023, s[a++] = 56320 | l & 1023);
+    l < 65536 ? n[a++] = l : (l -= 65536, n[a++] = 55296 | l >> 10 & 1023, n[a++] = 56320 | l & 1023);
   }
-  return Je(s, a);
+  return Je(n, a);
 }, ti = (i, e) => {
   e = e || i.length, e > i.length && (e = i.length);
   let t = e - 1;
@@ -914,28 +914,28 @@ function ei() {
   this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
 }
 var ii = ei;
-const K = 16209, ni = 16191;
-var si = function(e, t) {
-  let n, a, s, l, h, d, r, o, w, u, f, _, U, x, g, T, y, c, E, S, p, m, A, b;
+const K = 16209, si = 16191;
+var ni = function(e, t) {
+  let s, a, n, l, h, d, r, o, w, u, f, _, U, x, g, T, y, c, E, S, p, m, A, b;
   const k = e.state;
-  n = e.next_in, A = e.input, a = n + (e.avail_in - 5), s = e.next_out, b = e.output, l = s - (t - e.avail_out), h = s + (e.avail_out - 257), d = k.dmax, r = k.wsize, o = k.whave, w = k.wnext, u = k.window, f = k.hold, _ = k.bits, U = k.lencode, x = k.distcode, g = (1 << k.lenbits) - 1, T = (1 << k.distbits) - 1;
+  s = e.next_in, A = e.input, a = s + (e.avail_in - 5), n = e.next_out, b = e.output, l = n - (t - e.avail_out), h = n + (e.avail_out - 257), d = k.dmax, r = k.wsize, o = k.whave, w = k.wnext, u = k.window, f = k.hold, _ = k.bits, U = k.lencode, x = k.distcode, g = (1 << k.lenbits) - 1, T = (1 << k.distbits) - 1;
   t:
     do {
-      _ < 15 && (f += A[n++] << _, _ += 8, f += A[n++] << _, _ += 8), y = U[f & g];
+      _ < 15 && (f += A[s++] << _, _ += 8, f += A[s++] << _, _ += 8), y = U[f & g];
       e:
         for (; ; ) {
           if (c = y >>> 24, f >>>= c, _ -= c, c = y >>> 16 & 255, c === 0)
-            b[s++] = y & 65535;
+            b[n++] = y & 65535;
           else if (c & 16) {
-            E = y & 65535, c &= 15, c && (_ < c && (f += A[n++] << _, _ += 8), E += f & (1 << c) - 1, f >>>= c, _ -= c), _ < 15 && (f += A[n++] << _, _ += 8, f += A[n++] << _, _ += 8), y = x[f & T];
+            E = y & 65535, c &= 15, c && (_ < c && (f += A[s++] << _, _ += 8), E += f & (1 << c) - 1, f >>>= c, _ -= c), _ < 15 && (f += A[s++] << _, _ += 8, f += A[s++] << _, _ += 8), y = x[f & T];
             i:
               for (; ; ) {
                 if (c = y >>> 24, f >>>= c, _ -= c, c = y >>> 16 & 255, c & 16) {
-                  if (S = y & 65535, c &= 15, _ < c && (f += A[n++] << _, _ += 8, _ < c && (f += A[n++] << _, _ += 8)), S += f & (1 << c) - 1, S > d) {
+                  if (S = y & 65535, c &= 15, _ < c && (f += A[s++] << _, _ += 8, _ < c && (f += A[s++] << _, _ += 8)), S += f & (1 << c) - 1, S > d) {
                     e.msg = "invalid distance too far back", k.mode = K;
                     break t;
                   }
-                  if (f >>>= c, _ -= c, c = s - l, S > c) {
+                  if (f >>>= c, _ -= c, c = n - l, S > c) {
                     if (c = S - c, c > o && k.sane) {
                       e.msg = "invalid distance too far back", k.mode = K;
                       break t;
@@ -944,40 +944,40 @@ var si = function(e, t) {
                       if (p += r - c, c < E) {
                         E -= c;
                         do
-                          b[s++] = u[p++];
+                          b[n++] = u[p++];
                         while (--c);
-                        p = s - S, m = b;
+                        p = n - S, m = b;
                       }
                     } else if (w < c) {
                       if (p += r + w - c, c -= w, c < E) {
                         E -= c;
                         do
-                          b[s++] = u[p++];
+                          b[n++] = u[p++];
                         while (--c);
                         if (p = 0, w < E) {
                           c = w, E -= c;
                           do
-                            b[s++] = u[p++];
+                            b[n++] = u[p++];
                           while (--c);
-                          p = s - S, m = b;
+                          p = n - S, m = b;
                         }
                       }
                     } else if (p += w - c, c < E) {
                       E -= c;
                       do
-                        b[s++] = u[p++];
+                        b[n++] = u[p++];
                       while (--c);
-                      p = s - S, m = b;
+                      p = n - S, m = b;
                     }
                     for (; E > 2; )
-                      b[s++] = m[p++], b[s++] = m[p++], b[s++] = m[p++], E -= 3;
-                    E && (b[s++] = m[p++], E > 1 && (b[s++] = m[p++]));
+                      b[n++] = m[p++], b[n++] = m[p++], b[n++] = m[p++], E -= 3;
+                    E && (b[n++] = m[p++], E > 1 && (b[n++] = m[p++]));
                   } else {
-                    p = s - S;
+                    p = n - S;
                     do
-                      b[s++] = b[p++], b[s++] = b[p++], b[s++] = b[p++], E -= 3;
+                      b[n++] = b[p++], b[n++] = b[p++], b[n++] = b[p++], E -= 3;
                     while (E > 2);
-                    E && (b[s++] = b[p++], E > 1 && (b[s++] = b[p++]));
+                    E && (b[n++] = b[p++], E > 1 && (b[n++] = b[p++]));
                   }
                 } else if ((c & 64) === 0) {
                   y = x[(y & 65535) + (f & (1 << c) - 1)];
@@ -992,7 +992,7 @@ var si = function(e, t) {
             y = U[(y & 65535) + (f & (1 << c) - 1)];
             continue e;
           } else if (c & 32) {
-            k.mode = ni;
+            k.mode = si;
             break t;
           } else {
             e.msg = "invalid literal/length code", k.mode = K;
@@ -1000,8 +1000,8 @@ var si = function(e, t) {
           }
           break;
         }
-    } while (n < a && s < h);
-  E = _ >> 3, n -= E, _ -= E << 3, f &= (1 << _) - 1, e.next_in = n, e.next_out = s, e.avail_in = n < a ? 5 + (a - n) : 5 - (n - a), e.avail_out = s < h ? 257 + (h - s) : 257 - (s - h), k.hold = f, k.bits = _;
+    } while (s < a && n < h);
+  E = _ >> 3, s -= E, _ -= E << 3, f &= (1 << _) - 1, e.next_in = s, e.next_out = n, e.avail_in = s < a ? 5 + (a - s) : 5 - (s - a), e.avail_out = n < h ? 257 + (h - n) : 257 - (n - h), k.hold = f, k.bits = _;
 };
 const $ = 15, xt = 852, yt = 592, kt = 0, it = 1, Et = 2, ai = new Uint16Array([
   /* Length codes 257..285 base */
@@ -1137,19 +1137,19 @@ const $ = 15, xt = 852, yt = 592, kt = 0, it = 1, Et = 2, ai = new Uint16Array([
   29,
   64,
   64
-]), li = (i, e, t, n, a, s, l, h) => {
+]), li = (i, e, t, s, a, n, l, h) => {
   const d = h.bits;
   let r = 0, o = 0, w = 0, u = 0, f = 0, _ = 0, U = 0, x = 0, g = 0, T = 0, y, c, E, S, p, m = null, A;
   const b = new Uint16Array($ + 1), k = new Uint16Array($ + 1);
   let M = null, gt, P, G;
   for (r = 0; r <= $; r++)
     b[r] = 0;
-  for (o = 0; o < n; o++)
+  for (o = 0; o < s; o++)
     b[e[t + o]]++;
   for (f = d, u = $; u >= 1 && b[u] === 0; u--)
     ;
   if (f > u && (f = u), u === 0)
-    return a[s++] = 1 << 24 | 64 << 16 | 0, a[s++] = 1 << 24 | 64 << 16 | 0, h.bits = 1, 0;
+    return a[n++] = 1 << 24 | 64 << 16 | 0, a[n++] = 1 << 24 | 64 << 16 | 0, h.bits = 1, 0;
   for (w = 1; w < u && b[w] === 0; w++)
     ;
   for (f < w && (f = w), x = 1, r = 1; r <= $; r++)
@@ -1159,9 +1159,9 @@ const $ = 15, xt = 852, yt = 592, kt = 0, it = 1, Et = 2, ai = new Uint16Array([
     return -1;
   for (k[1] = 0, r = 1; r < $; r++)
     k[r + 1] = k[r] + b[r];
-  for (o = 0; o < n; o++)
+  for (o = 0; o < s; o++)
     e[t + o] !== 0 && (l[k[e[t + o]]++] = o);
-  if (i === kt ? (m = M = l, A = 20) : i === it ? (m = ai, M = ri, A = 257) : (m = oi, M = hi, A = 0), T = 0, o = 0, r = w, p = s, _ = f, U = 0, E = -1, g = 1 << f, S = g - 1, i === it && g > xt || i === Et && g > yt)
+  if (i === kt ? (m = M = l, A = 20) : i === it ? (m = ai, M = ri, A = 257) : (m = oi, M = hi, A = 0), T = 0, o = 0, r = w, p = n, _ = f, U = 0, E = -1, g = 1 << f, S = g - 1, i === it && g > xt || i === Et && g > yt)
     return 1;
   for (; ; ) {
     gt = r - U, l[o] + 1 < A ? (P = 0, G = l[o]) : l[o] >= A ? (P = M[l[o] - A], G = m[l[o] - A]) : (P = 96, G = 0), y = 1 << r - U, c = 1 << _, w = c;
@@ -1180,7 +1180,7 @@ const $ = 15, xt = 852, yt = 592, kt = 0, it = 1, Et = 2, ai = new Uint16Array([
         _++, x <<= 1;
       if (g += 1 << _, i === it && g > xt || i === Et && g > yt)
         return 1;
-      E = T & S, a[E] = f << 24 | _ << 16 | p - s | 0;
+      E = T & S, a[E] = f << 24 | _ << 16 | p - n | 0;
     }
   }
   return T !== 0 && (a[p + T] = r - U << 24 | 64 << 16 | 0), h.bits = f, 0;
@@ -1198,7 +1198,7 @@ const fi = 0, he = 1, le = 2, {
   Z_MEM_ERROR: ce,
   Z_BUF_ERROR: _i,
   Z_DEFLATED: Tt
-} = ae, tt = 16180, mt = 16181, vt = 16182, Ut = 16183, St = 16184, It = 16185, Ot = 16186, Rt = 16187, Ct = 16188, Nt = 16189, Q = 16190, C = 16191, nt = 16192, Dt = 16193, st = 16194, Mt = 16195, Lt = 16196, Bt = 16197, $t = 16198, j = 16199, X = 16200, Ft = 16201, Ht = 16202, Zt = 16203, Wt = 16204, zt = 16205, at = 16206, Pt = 16207, Gt = 16208, v = 16209, de = 16210, ue = 16211, pi = 852, wi = 592, gi = 15, bi = gi, Kt = (i) => (i >>> 24 & 255) + (i >>> 8 & 65280) + ((i & 65280) << 8) + ((i & 255) << 24);
+} = ae, tt = 16180, mt = 16181, vt = 16182, Ut = 16183, St = 16184, It = 16185, Ot = 16186, Rt = 16187, Ct = 16188, Dt = 16189, Q = 16190, C = 16191, st = 16192, Nt = 16193, nt = 16194, Mt = 16195, Lt = 16196, Bt = 16197, $t = 16198, j = 16199, X = 16200, Ft = 16201, Ht = 16202, Zt = 16203, Wt = 16204, zt = 16205, at = 16206, Pt = 16207, Gt = 16208, v = 16209, de = 16210, ue = 16211, pi = 852, wi = 592, gi = 15, bi = gi, Kt = (i) => (i >>> 24 & 255) + (i >>> 8 & 65280) + ((i & 65280) << 8) + ((i & 255) << 24);
 function xi() {
   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;
 }
@@ -1221,15 +1221,15 @@ const B = (i) => {
   let t;
   if (B(i))
     return O;
-  const n = i.state;
-  return e < 0 ? (t = 0, e = -e) : (t = (e >> 4) + 5, e < 48 && (e &= 15)), e && (e < 8 || e > 15) ? O : (n.window !== null && n.wbits !== e && (n.window = null), n.wrap = t, n.wbits = e, pe(i));
+  const s = i.state;
+  return e < 0 ? (t = 0, e = -e) : (t = (e >> 4) + 5, e < 48 && (e &= 15)), e && (e < 8 || e > 15) ? O : (s.window !== null && s.wbits !== e && (s.window = null), s.wrap = t, s.wbits = e, pe(i));
 }, ge = (i, e) => {
   if (!i)
     return O;
   const t = new xi();
   i.state = t, t.strm = i, t.window = null, t.mode = tt;
-  const n = we(i, e);
-  return n !== L && (i.state = null), n;
+  const s = we(i, e);
+  return s !== L && (i.state = null), s;
 }, yi = (i) => ge(i, bi);
 let Yt = !0, rt, ot;
 const ki = (i) => {
@@ -1249,12 +1249,12 @@ const ki = (i) => {
     H(le, i.lens, 0, 32, ot, 0, i.work, { bits: 5 }), Yt = !1;
   }
   i.lencode = rt, i.lenbits = 9, i.distcode = ot, i.distbits = 5;
-}, be = (i, e, t, n) => {
+}, be = (i, e, t, s) => {
   let a;
-  const s = i.state;
-  return s.window === null && (s.wsize = 1 << s.wbits, s.wnext = 0, s.whave = 0, s.window = new Uint8Array(s.wsize)), n >= s.wsize ? (s.window.set(e.subarray(t - s.wsize, t), 0), s.wnext = 0, s.whave = s.wsize) : (a = s.wsize - s.wnext, a > n && (a = n), s.window.set(e.subarray(t - n, t - n + a), s.wnext), n -= a, n ? (s.window.set(e.subarray(t - n, t), 0), s.wnext = n, s.whave = s.wsize) : (s.wnext += a, s.wnext === s.wsize && (s.wnext = 0), s.whave < s.wsize && (s.whave += a))), 0;
+  const n = i.state;
+  return n.window === null && (n.wsize = 1 << n.wbits, n.wnext = 0, n.whave = 0, n.window = new Uint8Array(n.wsize)), s >= n.wsize ? (n.window.set(e.subarray(t - n.wsize, t), 0), n.wnext = 0, n.whave = n.wsize) : (a = n.wsize - n.wnext, a > s && (a = s), n.window.set(e.subarray(t - s, t - s + a), n.wnext), s -= a, s ? (n.window.set(e.subarray(t - s, t), 0), n.wnext = s, n.whave = n.wsize) : (n.wnext += a, n.wnext === n.wsize && (n.wnext = 0), n.whave < n.wsize && (n.whave += a))), 0;
 }, Ei = (i, e) => {
-  let t, n, a, s, l, h, d, r, o, w, u, f, _, U, x = 0, g, T, y, c, E, S, p, m;
+  let t, s, a, n, l, h, d, r, o, w, u, f, _, U, x = 0, g, T, y, c, E, S, p, m;
   const A = new Uint8Array(4);
   let b, k;
   const M = (
@@ -1263,19 +1263,19 @@ const ki = (i) => {
   );
   if (B(i) || !i.output || !i.input && i.avail_in !== 0)
     return O;
-  t = i.state, t.mode === C && (t.mode = nt), l = i.next_out, a = i.output, d = i.avail_out, s = i.next_in, n = i.input, h = i.avail_in, r = t.hold, o = t.bits, w = h, u = d, m = L;
+  t = i.state, t.mode === C && (t.mode = st), l = i.next_out, a = i.output, d = i.avail_out, n = i.next_in, s = i.input, h = i.avail_in, r = t.hold, o = t.bits, w = h, u = d, m = L;
   t:
     for (; ; )
       switch (t.mode) {
         case tt:
           if (t.wrap === 0) {
-            t.mode = nt;
+            t.mode = st;
             break;
           }
           for (; o < 16; ) {
             if (h === 0)
               break t;
-            h--, r += n[s++] << o, o += 8;
+            h--, r += s[n++] << o, o += 8;
           }
           if (t.wrap & 2 && r === 35615) {
             t.wbits === 0 && (t.wbits = 15), t.check = 0, A[0] = r & 255, A[1] = r >>> 8 & 255, t.check = R(t.check, A, 2, 0), r = 0, o = 0, t.mode = mt;
@@ -1294,13 +1294,13 @@ const ki = (i) => {
             i.msg = "invalid window size", t.mode = v;
             break;
           }
-          t.dmax = 1 << t.wbits, t.flags = 0, i.adler = t.check = 1, t.mode = r & 512 ? Nt : C, r = 0, o = 0;
+          t.dmax = 1 << t.wbits, t.flags = 0, i.adler = t.check = 1, t.mode = r & 512 ? Dt : C, r = 0, o = 0;
           break;
         case mt:
           for (; o < 16; ) {
             if (h === 0)
               break t;
-            h--, r += n[s++] << o, o += 8;
+            h--, r += s[n++] << o, o += 8;
           }
           if (t.flags = r, (t.flags & 255) !== Tt) {
             i.msg = "unknown compression method", t.mode = v;
@@ -1316,7 +1316,7 @@ const ki = (i) => {
           for (; o < 32; ) {
             if (h === 0)
               break t;
-            h--, r += n[s++] << o, o += 8;
+            h--, r += s[n++] << o, o += 8;
           }
           t.head && (t.head.time = r), t.flags & 512 && t.wrap & 4 && (A[0] = r & 255, A[1] = r >>> 8 & 255, A[2] = r >>> 16 & 255, A[3] = r >>> 24 & 255, t.check = R(t.check, A, 4, 0)), r = 0, o = 0, t.mode = Ut;
         /* falls through */
@@ -1324,7 +1324,7 @@ const ki = (i) => {
           for (; o < 16; ) {
             if (h === 0)
               break t;
-            h--, r += n[s++] << o, o += 8;
+            h--, r += s[n++] << o, o += 8;
           }
           t.head && (t.head.xflags = r & 255, t.head.os = r >> 8), t.flags & 512 && t.wrap & 4 && (A[0] = r & 255, A[1] = r >>> 8 & 255, t.check = R(t.check, A, 2, 0)), r = 0, o = 0, t.mode = St;
         /* falls through */
@@ -1333,7 +1333,7 @@ const ki = (i) => {
             for (; o < 16; ) {
               if (h === 0)
                 break t;
-              h--, r += n[s++] << o, o += 8;
+              h--, r += s[n++] << o, o += 8;
             }
             t.length = r, t.head && (t.head.extra_len = r), t.flags & 512 && t.wrap & 4 && (A[0] = r & 255, A[1] = r >>> 8 & 255, t.check = R(t.check, A, 2, 0)), r = 0, o = 0;
           } else t.head && (t.head.extra = null);
@@ -1341,15 +1341,15 @@ const ki = (i) => {
         /* falls through */
         case It:
           if (t.flags & 1024 && (f = t.length, f > h && (f = h), f && (t.head && (p = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(
-            n.subarray(
-              s,
+            s.subarray(
+              n,
               // extra field is limited to 65536 bytes
               // - no need for additional size check
-              s + f
+              n + f
             ),
             /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
             p
-          )), t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, n, f, s)), h -= f, s += f, t.length -= f), t.length))
+          )), t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, s, f, n)), h -= f, n += f, t.length -= f), t.length))
             break t;
           t.length = 0, t.mode = Ot;
         /* falls through */
@@ -1359,9 +1359,9 @@ const ki = (i) => {
               break t;
             f = 0;
             do
-              p = n[s + f++], t.head && p && t.length < 65536 && (t.head.name += String.fromCharCode(p));
+              p = s[n + f++], t.head && p && t.length < 65536 && (t.head.name += String.fromCharCode(p));
             while (p && f < h);
-            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, n, f, s)), h -= f, s += f, p)
+            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, s, f, n)), h -= f, n += f, p)
               break t;
           } else t.head && (t.head.name = null);
           t.length = 0, t.mode = Rt;
@@ -1372,9 +1372,9 @@ const ki = (i) => {
               break t;
             f = 0;
             do
-              p = n[s + f++], t.head && p && t.length < 65536 && (t.head.comment += String.fromCharCode(p));
+              p = s[n + f++], t.head && p && t.length < 65536 && (t.head.comment += String.fromCharCode(p));
             while (p && f < h);
-            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, n, f, s)), h -= f, s += f, p)
+            if (t.flags & 512 && t.wrap & 4 && (t.check = R(t.check, s, f, n)), h -= f, n += f, p)
               break t;
           } else t.head && (t.head.comment = null);
           t.mode = Ct;
@@ -1384,7 +1384,7 @@ const ki = (i) => {
             for (; o < 16; ) {
               if (h === 0)
                 break t;
-              h--, r += n[s++] << o, o += 8;
+              h--, r += s[n++] << o, o += 8;
             }
             if (t.wrap & 4 && r !== (t.check & 65535)) {
               i.msg = "header crc mismatch", t.mode = v;
@@ -1394,24 +1394,24 @@ const ki = (i) => {
           }
           t.head && (t.head.hcrc = t.flags >> 9 & 1, t.head.done = !0), i.adler = t.check = 0, t.mode = C;
           break;
-        case Nt:
+        case Dt:
           for (; o < 32; ) {
             if (h === 0)
               break t;
-            h--, r += n[s++] << o, o += 8;
+            h--, r += s[n++] << o, o += 8;
           }
           i.adler = t.check = Kt(r), r = 0, o = 0, t.mode = Q;
         /* falls through */
         case Q:
           if (t.havedict === 0)
-            return i.next_out = l, i.avail_out = d, i.next_in = s, i.avail_in = h, t.hold = r, t.bits = o, ui;
+            return i.next_out = l, i.avail_out = d, i.next_in = n, i.avail_in = h, t.hold = r, t.bits = o, ui;
           i.adler = t.check = 1, t.mode = C;
         /* falls through */
         case C:
           if (e === ci || e === Y)
             break t;
         /* falls through */
-        case nt:
+        case st:
           if (t.last) {
             r >>>= o & 7, o -= o & 7, t.mode = at;
             break;
@@ -1419,11 +1419,11 @@ const ki = (i) => {
           for (; o < 3; ) {
             if (h === 0)
               break t;
-            h--, r += n[s++] << o, o += 8;
+            h--, r += s[n++] << o, o += 8;
           }
           switch (t.last = r & 1, r >>>= 1, o -= 1, r & 3) {
             case 0:
-              t.mode = Dt;
+              t.mode = Nt;
               break;
             case 1:
               if (ki(t), t.mode = j, e === Y) {
@@ -1439,27 +1439,27 @@ const ki = (i) => {
           }
           r >>>= 2, o -= 2;
           break;
-        case Dt:
+        case Nt:
           for (r >>>= o & 7, o -= o & 7; o < 32; ) {
             if (h === 0)
               break t;
-            h--, r += n[s++] << o, o += 8;
+            h--, r += s[n++] << o, o += 8;
           }
           if ((r & 65535) !== (r >>> 16 ^ 65535)) {
             i.msg = "invalid stored block lengths", t.mode = v;
             break;
           }
-          if (t.length = r & 65535, r = 0, o = 0, t.mode = st, e === Y)
+          if (t.length = r & 65535, r = 0, o = 0, t.mode = nt, e === Y)
             break t;
         /* falls through */
-        case st:
+        case nt:
           t.mode = Mt;
         /* falls through */
         case Mt:
           if (f = t.length, f) {
             if (f > h && (f = h), f > d && (f = d), f === 0)
               break t;
-            a.set(n.subarray(s, s + f), l), h -= f, s += f, d -= f, l += f, t.length -= f;
+            a.set(s.subarray(n, n + f), l), h -= f, n += f, d -= f, l += f, t.length -= f;
             break;
           }
           t.mode = C;
@@ -1468,7 +1468,7 @@ const ki = (i) => {
           for (; o < 14; ) {
             if (h === 0)
               break t;
-            h--, r += n[s++] << o, o += 8;
+            h--, r += s[n++] << o, o += 8;
           }
           if (t.nlen = (r & 31) + 257, r >>>= 5, o -= 5, t.ndist = (r & 31) + 1, r >>>= 5, o -= 5, t.ncode = (r & 15) + 4, r >>>= 4, o -= 4, t.nlen > 286 || t.ndist > 30) {
             i.msg = "too many length or distance symbols", t.mode = v;
@@ -1481,7 +1481,7 @@ const ki = (i) => {
             for (; o < 3; ) {
               if (h === 0)
                 break t;
-              h--, r += n[s++] << o, o += 8;
+              h--, r += s[n++] << o, o += 8;
             }
             t.lens[M[t.have++]] = r & 7, r >>>= 3, o -= 3;
           }
@@ -1498,7 +1498,7 @@ const ki = (i) => {
             for (; x = t.lencode[r & (1 << t.lenbits) - 1], g = x >>> 24, T = x >>> 16 & 255, y = x & 65535, !(g <= o); ) {
               if (h === 0)
                 break t;
-              h--, r += n[s++] << o, o += 8;
+              h--, r += s[n++] << o, o += 8;
             }
             if (y < 16)
               r >>>= g, o -= g, t.lens[t.have++] = y;
@@ -1507,7 +1507,7 @@ const ki = (i) => {
                 for (k = g + 2; o < k; ) {
                   if (h === 0)
                     break t;
-                  h--, r += n[s++] << o, o += 8;
+                  h--, r += s[n++] << o, o += 8;
                 }
                 if (r >>>= g, o -= g, t.have === 0) {
                   i.msg = "invalid bit length repeat", t.mode = v;
@@ -1518,14 +1518,14 @@ const ki = (i) => {
                 for (k = g + 3; o < k; ) {
                   if (h === 0)
                     break t;
-                  h--, r += n[s++] << o, o += 8;
+                  h--, r += s[n++] << o, o += 8;
                 }
                 r >>>= g, o -= g, p = 0, f = 3 + (r & 7), r >>>= 3, o -= 3;
               } else {
                 for (k = g + 7; o < k; ) {
                   if (h === 0)
                     break t;
-                  h--, r += n[s++] << o, o += 8;
+                  h--, r += s[n++] << o, o += 8;
                 }
                 r >>>= g, o -= g, p = 0, f = 11 + (r & 127), r >>>= 7, o -= 7;
               }
@@ -1559,19 +1559,19 @@ const ki = (i) => {
         /* falls through */
         case X:
           if (h >= 6 && d >= 258) {
-            i.next_out = l, i.avail_out = d, i.next_in = s, i.avail_in = h, t.hold = r, t.bits = o, si(i, u), l = i.next_out, a = i.output, d = i.avail_out, s = i.next_in, n = i.input, h = i.avail_in, r = t.hold, o = t.bits, t.mode === C && (t.back = -1);
+            i.next_out = l, i.avail_out = d, i.next_in = n, i.avail_in = h, t.hold = r, t.bits = o, ni(i, u), l = i.next_out, a = i.output, d = i.avail_out, n = i.next_in, s = i.input, h = i.avail_in, r = t.hold, o = t.bits, t.mode === C && (t.back = -1);
             break;
           }
           for (t.back = 0; x = t.lencode[r & (1 << t.lenbits) - 1], g = x >>> 24, T = x >>> 16 & 255, y = x & 65535, !(g <= o); ) {
             if (h === 0)
               break t;
-            h--, r += n[s++] << o, o += 8;
+            h--, r += s[n++] << o, o += 8;
           }
           if (T && (T & 240) === 0) {
             for (c = g, E = T, S = y; x = t.lencode[S + ((r & (1 << c + E) - 1) >> c)], g = x >>> 24, T = x >>> 16 & 255, y = x & 65535, !(c + g <= o); ) {
               if (h === 0)
                 break t;
-              h--, r += n[s++] << o, o += 8;
+              h--, r += s[n++] << o, o += 8;
             }
             r >>>= c, o -= c, t.back += c;
           }
@@ -1594,7 +1594,7 @@ const ki = (i) => {
             for (k = t.extra; o < k; ) {
               if (h === 0)
                 break t;
-              h--, r += n[s++] << o, o += 8;
+              h--, r += s[n++] << o, o += 8;
             }
             t.length += r & (1 << t.extra) - 1, r >>>= t.extra, o -= t.extra, t.back += t.extra;
           }
@@ -1604,13 +1604,13 @@ const ki = (i) => {
           for (; x = t.distcode[r & (1 << t.distbits) - 1], g = x >>> 24, T = x >>> 16 & 255, y = x & 65535, !(g <= o); ) {
             if (h === 0)
               break t;
-            h--, r += n[s++] << o, o += 8;
+            h--, r += s[n++] << o, o += 8;
           }
           if ((T & 240) === 0) {
             for (c = g, E = T, S = y; x = t.distcode[S + ((r & (1 << c + E) - 1) >> c)], g = x >>> 24, T = x >>> 16 & 255, y = x & 65535, !(c + g <= o); ) {
               if (h === 0)
                 break t;
-              h--, r += n[s++] << o, o += 8;
+              h--, r += s[n++] << o, o += 8;
             }
             r >>>= c, o -= c, t.back += c;
           }
@@ -1625,7 +1625,7 @@ const ki = (i) => {
             for (k = t.extra; o < k; ) {
               if (h === 0)
                 break t;
-              h--, r += n[s++] << o, o += 8;
+              h--, r += s[n++] << o, o += 8;
             }
             t.offset += r & (1 << t.extra) - 1, r >>>= t.extra, o -= t.extra, t.back += t.extra;
           }
@@ -1662,7 +1662,7 @@ const ki = (i) => {
             for (; o < 32; ) {
               if (h === 0)
                 break t;
-              h--, r |= n[s++] << o, o += 8;
+              h--, r |= s[n++] << o, o += 8;
             }
             if (u -= d, i.total_out += u, t.total += u, t.wrap & 4 && u && (i.adler = t.check = /*UPDATE_CHECK(state.check, put - _out, _out);*/
             t.flags ? R(t.check, a, u, l - u) : ut(t.check, a, u, l - u)), u = d, t.wrap & 4 && (t.flags ? r : Kt(r)) !== t.check) {
@@ -1678,7 +1678,7 @@ const ki = (i) => {
             for (; o < 32; ) {
               if (h === 0)
                 break t;
-              h--, r += n[s++] << o, o += 8;
+              h--, r += s[n++] << o, o += 8;
             }
             if (t.wrap & 4 && r !== (t.total & 4294967295)) {
               i.msg = "incorrect length check", t.mode = v;
@@ -1701,8 +1701,8 @@ const ki = (i) => {
         default:
           return O;
       }
-  return i.next_out = l, i.avail_out = d, i.next_in = s, i.avail_in = h, t.hold = r, t.bits = o, (t.wsize || u !== i.avail_out && t.mode < v && (t.mode < at || e !== At)) && be(i, i.output, i.next_out, u - i.avail_out), w -= i.avail_in, u -= i.avail_out, i.total_in += w, i.total_out += u, t.total += u, t.wrap & 4 && u && (i.adler = t.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
-  t.flags ? R(t.check, a, u, i.next_out - u) : ut(t.check, a, u, i.next_out - u)), i.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === C ? 128 : 0) + (t.mode === j || t.mode === st ? 256 : 0), (w === 0 && u === 0 || e === At) && m === L && (m = _i), m;
+  return i.next_out = l, i.avail_out = d, i.next_in = n, i.avail_in = h, t.hold = r, t.bits = o, (t.wsize || u !== i.avail_out && t.mode < v && (t.mode < at || e !== At)) && be(i, i.output, i.next_out, u - i.avail_out), w -= i.avail_in, u -= i.avail_out, i.total_in += w, i.total_out += u, t.total += u, t.wrap & 4 && u && (i.adler = t.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
+  t.flags ? R(t.check, a, u, i.next_out - u) : ut(t.check, a, u, i.next_out - u)), i.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === C ? 128 : 0) + (t.mode === j || t.mode === nt ? 256 : 0), (w === 0 && u === 0 || e === At) && m === L && (m = _i), m;
 }, Ai = (i) => {
   if (B(i))
     return O;
@@ -1715,10 +1715,10 @@ const ki = (i) => {
   return (t.wrap & 2) === 0 ? O : (t.head = e, e.done = !1, L);
 }, mi = (i, e) => {
   const t = e.length;
-  let n, a, s;
-  return B(i) || (n = i.state, n.wrap !== 0 && n.mode !== Q) ? O : n.mode === Q && (a = 1, a = ut(a, e, t, 0), a !== n.check) ? fe : (s = be(i, e, t, t), s ? (n.mode = de, ce) : (n.havedict = 1, L));
+  let s, a, n;
+  return B(i) || (s = i.state, s.wrap !== 0 && s.mode !== Q) ? O : s.mode === Q && (a = 1, a = ut(a, e, t, 0), a !== s.check) ? fe : (n = be(i, e, t, t), n ? (s.mode = de, ce) : (s.havedict = 1, L));
 };
-var vi = pe, Ui = we, Si = _e, Ii = yi, Oi = ge, Ri = Ei, Ci = Ai, Ni = Ti, Di = mi, Mi = "pako inflate (from Nodeca project)", D = {
+var vi = pe, Ui = we, Si = _e, Ii = yi, Oi = ge, Ri = Ei, Ci = Ai, Di = Ti, Ni = mi, Mi = "pako inflate (from Nodeca project)", N = {
   inflateReset: vi,
   inflateReset2: Ui,
   inflateResetKeep: Si,
@@ -1726,8 +1726,8 @@ var vi = pe, Ui = we, Si = _e, Ii = yi, Oi = ge, Ri = Ei, Ci = Ai, Ni = Ti, Di =
   inflateInit2: Oi,
   inflate: Ri,
   inflateEnd: Ci,
-  inflateGetHeader: Ni,
-  inflateSetDictionary: Di,
+  inflateGetHeader: Di,
+  inflateSetDictionary: Ni,
   inflateInfo: Mi
 };
 function Li() {
@@ -1752,38 +1752,38 @@ function z(i) {
   }, i || {});
   const e = this.options;
   e.raw && e.windowBits >= 0 && e.windowBits < 16 && (e.windowBits = -e.windowBits, e.windowBits === 0 && (e.windowBits = -15)), e.windowBits >= 0 && e.windowBits < 16 && !(i && i.windowBits) && (e.windowBits += 32), e.windowBits > 15 && e.windowBits < 48 && (e.windowBits & 15) === 0 && (e.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new ii(), this.strm.avail_out = 0;
-  let t = D.inflateInit2(
+  let t = N.inflateInit2(
     this.strm,
     e.windowBits
   );
   if (t !== W)
     throw new Error(_t[t]);
-  if (this.header = new Bi(), D.inflateGetHeader(this.strm, this.header), e.dictionary && (typeof e.dictionary == "string" ? e.dictionary = pt.string2buf(e.dictionary) : xe.call(e.dictionary) === "[object ArrayBuffer]" && (e.dictionary = new Uint8Array(e.dictionary)), e.raw && (t = D.inflateSetDictionary(this.strm, e.dictionary), t !== W)))
+  if (this.header = new Bi(), N.inflateGetHeader(this.strm, this.header), e.dictionary && (typeof e.dictionary == "string" ? e.dictionary = pt.string2buf(e.dictionary) : xe.call(e.dictionary) === "[object ArrayBuffer]" && (e.dictionary = new Uint8Array(e.dictionary)), e.raw && (t = N.inflateSetDictionary(this.strm, e.dictionary), t !== W)))
     throw new Error(_t[t]);
 }
 z.prototype.push = function(i, e) {
-  const t = this.strm, n = this.options.chunkSize, a = this.options.dictionary;
-  let s, l, h;
+  const t = this.strm, s = this.options.chunkSize, a = this.options.dictionary;
+  let n, l, h;
   if (this.ended) return !1;
   for (e === ~~e ? l = e : l = e === !0 ? Fi : $i, xe.call(i) === "[object ArrayBuffer]" ? t.input = new Uint8Array(i) : t.input = i, t.next_in = 0, t.avail_in = t.input.length; ; ) {
-    for (t.avail_out === 0 && (t.output = new Uint8Array(n), t.next_out = 0, t.avail_out = n), s = D.inflate(t, l), s === lt && a && (s = D.inflateSetDictionary(t, a), s === W ? s = D.inflate(t, l) : s === jt && (s = lt)); t.avail_in > 0 && s === ht && t.state.wrap > 0 && i[t.next_in] !== 0; )
-      D.inflateReset(t), s = D.inflate(t, l);
-    switch (s) {
+    for (t.avail_out === 0 && (t.output = new Uint8Array(s), t.next_out = 0, t.avail_out = s), n = N.inflate(t, l), n === lt && a && (n = N.inflateSetDictionary(t, a), n === W ? n = N.inflate(t, l) : n === jt && (n = lt)); t.avail_in > 0 && n === ht && t.state.wrap > 0 && i[t.next_in] !== 0; )
+      N.inflateReset(t), n = N.inflate(t, l);
+    switch (n) {
       case Hi:
       case jt:
       case lt:
       case Zi:
-        return this.onEnd(s), this.ended = !0, !1;
+        return this.onEnd(n), this.ended = !0, !1;
     }
-    if (h = t.avail_out, t.next_out && (t.avail_out === 0 || s === ht))
+    if (h = t.avail_out, t.next_out && (t.avail_out === 0 || n === ht))
       if (this.options.to === "string") {
         let d = pt.utf8border(t.output, t.next_out), r = t.next_out - d, o = pt.buf2string(t.output, d);
-        t.next_out = r, t.avail_out = n - r, r && t.output.set(t.output.subarray(d, d + r), 0), this.onData(o);
+        t.next_out = r, t.avail_out = s - r, r && t.output.set(t.output.subarray(d, d + r), 0), this.onData(o);
       } else
         this.onData(t.output.length === t.next_out ? t.output : t.output.subarray(0, t.next_out));
-    if (!(s === W && h === 0)) {
-      if (s === ht)
-        return s = D.inflateEnd(this.strm), this.onEnd(s), this.ended = !0, !0;
+    if (!(n === W && h === 0)) {
+      if (n === ht)
+        return n = N.inflateEnd(this.strm), this.onEnd(n), this.ended = !0, !0;
       if (t.avail_in === 0) break;
     }
   }
@@ -1815,95 +1815,95 @@ for (let i = 0; i < 256; i++) {
 }
 const Vt = 4294967295;
 function Xi(i, e, t) {
-  let n = i;
+  let s = i;
   for (let a = 0; a < t; a++)
-    n = ye[(n ^ e[a]) & 255] ^ n >>> 8;
-  return n;
+    s = ye[(s ^ e[a]) & 255] ^ s >>> 8;
+  return s;
 }
 function Vi(i, e) {
   return (Xi(Vt, i, e) ^ Vt) >>> 0;
 }
 function qt(i, e, t) {
-  const n = i.readUint32(), a = Vi(new Uint8Array(i.buffer, i.byteOffset + i.offset - e - 4, e), e);
-  if (a !== n)
-    throw new Error(`CRC mismatch for chunk ${t}. Expected ${n}, found ${a}`);
+  const s = i.readUint32(), a = Vi(new Uint8Array(i.buffer, i.byteOffset + i.offset - e - 4, e), e);
+  if (a !== s)
+    throw new Error(`CRC mismatch for chunk ${t}. Expected ${s}, found ${a}`);
 }
 function ke(i, e, t) {
-  for (let n = 0; n < t; n++)
-    e[n] = i[n];
+  for (let s = 0; s < t; s++)
+    e[s] = i[s];
 }
-function Ee(i, e, t, n) {
+function Ee(i, e, t, s) {
   let a = 0;
-  for (; a < n; a++)
+  for (; a < s; a++)
     e[a] = i[a];
   for (; a < t; a++)
-    e[a] = i[a] + e[a - n] & 255;
+    e[a] = i[a] + e[a - s] & 255;
 }
-function Ae(i, e, t, n) {
+function Ae(i, e, t, s) {
   let a = 0;
   if (t.length === 0)
-    for (; a < n; a++)
+    for (; a < s; a++)
       e[a] = i[a];
   else
-    for (; a < n; a++)
+    for (; a < s; a++)
       e[a] = i[a] + t[a] & 255;
 }
-function Te(i, e, t, n, a) {
-  let s = 0;
+function Te(i, e, t, s, a) {
+  let n = 0;
   if (t.length === 0) {
-    for (; s < a; s++)
-      e[s] = i[s];
-    for (; s < n; s++)
-      e[s] = i[s] + (e[s - a] >> 1) & 255;
+    for (; n < a; n++)
+      e[n] = i[n];
+    for (; n < s; n++)
+      e[n] = i[n] + (e[n - a] >> 1) & 255;
   } else {
-    for (; s < a; s++)
-      e[s] = i[s] + (t[s] >> 1) & 255;
-    for (; s < n; s++)
-      e[s] = i[s] + (e[s - a] + t[s] >> 1) & 255;
+    for (; n < a; n++)
+      e[n] = i[n] + (t[n] >> 1) & 255;
+    for (; n < s; n++)
+      e[n] = i[n] + (e[n - a] + t[n] >> 1) & 255;
   }
 }
-function me(i, e, t, n, a) {
-  let s = 0;
+function me(i, e, t, s, a) {
+  let n = 0;
   if (t.length === 0) {
-    for (; s < a; s++)
-      e[s] = i[s];
-    for (; s < n; s++)
-      e[s] = i[s] + e[s - a] & 255;
+    for (; n < a; n++)
+      e[n] = i[n];
+    for (; n < s; n++)
+      e[n] = i[n] + e[n - a] & 255;
   } else {
-    for (; s < a; s++)
-      e[s] = i[s] + t[s] & 255;
-    for (; s < n; s++)
-      e[s] = i[s] + qi(e[s - a], t[s], t[s - a]) & 255;
+    for (; n < a; n++)
+      e[n] = i[n] + t[n] & 255;
+    for (; n < s; n++)
+      e[n] = i[n] + qi(e[n - a], t[n], t[n - a]) & 255;
   }
 }
 function qi(i, e, t) {
-  const n = i + e - t, a = Math.abs(n - i), s = Math.abs(n - e), l = Math.abs(n - t);
-  return a <= s && a <= l ? i : s <= l ? e : t;
+  const s = i + e - t, a = Math.abs(s - i), n = Math.abs(s - e), l = Math.abs(s - t);
+  return a <= n && a <= l ? i : n <= l ? e : t;
 }
-function Ji(i, e, t, n, a, s) {
+function Ji(i, e, t, s, a, n) {
   switch (i) {
     case 0:
       ke(e, t, a);
       break;
     case 1:
-      Ee(e, t, a, s);
+      Ee(e, t, a, n);
       break;
     case 2:
-      Ae(e, t, n, a);
+      Ae(e, t, s, a);
       break;
     case 3:
-      Te(e, t, n, a, s);
+      Te(e, t, s, a, n);
       break;
     case 4:
-      me(e, t, n, a, s);
+      me(e, t, s, a, n);
       break;
     default:
       throw new Error(`Unsupported filter: ${i}`);
   }
 }
-const Qi = new Uint16Array([255]), tn = new Uint8Array(Qi.buffer), en = tn[0] === 255;
-function nn(i) {
-  const { data: e, width: t, height: n, channels: a, depth: s } = i, l = [
+const Qi = new Uint16Array([255]), ts = new Uint8Array(Qi.buffer), es = ts[0] === 255;
+function is(i) {
+  const { data: e, width: t, height: s, channels: a, depth: n } = i, l = [
     { x: 0, y: 0, xStep: 8, yStep: 8 },
     // Pass 1
     { x: 4, y: 0, xStep: 8, yStep: 8 },
@@ -1918,10 +1918,10 @@ function nn(i) {
     // Pass 6
     { x: 0, y: 1, xStep: 1, yStep: 2 }
     // Pass 7
-  ], h = Math.ceil(s / 8) * a, d = new Uint8Array(n * t * h);
+  ], h = Math.ceil(n / 8) * a, d = new Uint8Array(s * t * h);
   let r = 0;
   for (let o = 0; o < 7; o++) {
-    const w = l[o], u = Math.ceil((t - w.x) / w.xStep), f = Math.ceil((n - w.y) / w.yStep);
+    const w = l[o], u = Math.ceil((t - w.x) / w.xStep), f = Math.ceil((s - w.y) / w.yStep);
     if (u <= 0 || f <= 0)
       continue;
     const _ = u * h, U = new Uint8Array(_);
@@ -1932,29 +1932,29 @@ function nn(i) {
       Ji(g, T, y, U, _, h), U.set(y);
       for (let c = 0; c < u; c++) {
         const E = w.x + c * w.xStep, S = w.y + x * w.yStep;
-        if (!(E >= t || S >= n))
+        if (!(E >= t || S >= s))
           for (let p = 0; p < h; p++)
             d[(S * t + E) * h + p] = y[c * h + p];
       }
     }
   }
-  if (s === 16) {
+  if (n === 16) {
     const o = new Uint16Array(d.buffer);
-    if (en)
+    if (es)
       for (let w = 0; w < o.length; w++)
-        o[w] = sn(o[w]);
+        o[w] = ss(o[w]);
     return o;
   } else
     return d;
 }
-function sn(i) {
+function ss(i) {
   return (i & 255) << 8 | i >> 8 & 255;
 }
-const an = new Uint16Array([255]), rn = new Uint8Array(an.buffer), on = rn[0] === 255, hn = new Uint8Array(0);
+const ns = new Uint16Array([255]), as = new Uint8Array(ns.buffer), rs = as[0] === 255, os = new Uint8Array(0);
 function Jt(i) {
-  const { data: e, width: t, height: n, channels: a, depth: s } = i, l = Math.ceil(s / 8) * a, h = Math.ceil(s / 8 * a * t), d = new Uint8Array(n * h);
-  let r = hn, o = 0, w, u;
-  for (let f = 0; f < n; f++) {
+  const { data: e, width: t, height: s, channels: a, depth: n } = i, l = Math.ceil(n / 8) * a, h = Math.ceil(n / 8 * a * t), d = new Uint8Array(s * h);
+  let r = os, o = 0, w, u;
+  for (let f = 0; f < s; f++) {
     switch (w = e.subarray(o + 1, o + 1 + h), u = d.subarray(f * h, (f + 1) * h), e[o]) {
       case 0:
         ke(w, u, h);
@@ -1976,24 +1976,24 @@ function Jt(i) {
     }
     r = u, o += h + 1;
   }
-  if (s === 16) {
+  if (n === 16) {
     const f = new Uint16Array(d.buffer);
-    if (on)
+    if (rs)
       for (let _ = 0; _ < f.length; _++)
-        f[_] = ln(f[_]);
+        f[_] = hs(f[_]);
     return f;
   } else
     return d;
 }
-function ln(i) {
+function hs(i) {
   return (i & 255) << 8 | i >> 8 & 255;
 }
 const J = Uint8Array.of(137, 80, 78, 71, 13, 10, 26, 10);
 function Qt(i) {
-  if (!fn(i.readBytes(J.length)))
+  if (!ls(i.readBytes(J.length)))
     throw new Error("wrong PNG signature");
 }
-function fn(i) {
+function ls(i) {
   if (i.length < J.length)
     return !1;
   for (let e = 0; e < J.length; e++)
@@ -2001,29 +2001,29 @@ function fn(i) {
       return !1;
   return !0;
 }
-const cn = "tEXt", dn = 0, ve = new TextDecoder("latin1");
-function un(i) {
-  if (pn(i), i.length === 0 || i.length > 79)
+const fs = "tEXt", cs = 0, ve = new TextDecoder("latin1");
+function ds(i) {
+  if (_s(i), i.length === 0 || i.length > 79)
     throw new Error("keyword length must be between 1 and 79");
 }
-const _n = /^[\u0000-\u00FF]*$/;
-function pn(i) {
-  if (!_n.test(i))
+const us = /^[\u0000-\u00FF]*$/;
+function _s(i) {
+  if (!us.test(i))
     throw new Error("invalid latin1 text");
 }
-function wn(i, e, t) {
-  const n = Ue(e);
-  i[n] = gn(e, t - n.length - 1);
+function ps(i, e, t) {
+  const s = Ue(e);
+  i[s] = ws(e, t - s.length - 1);
 }
 function Ue(i) {
-  for (i.mark(); i.readByte() !== dn; )
+  for (i.mark(); i.readByte() !== cs; )
     ;
   const e = i.offset;
   i.reset();
   const t = ve.decode(i.readBytes(e - i.offset - 1));
-  return i.skip(1), un(t), t;
+  return i.skip(1), ds(t), t;
 }
-function gn(i, e) {
+function ws(i, e) {
   return ve.decode(i.readBytes(e));
 }
 const I = {
@@ -2051,7 +2051,7 @@ const I = {
   SOURCE: 0,
   OVER: 1
 };
-class bn extends wt {
+class gs extends wt {
   _checkCrc;
   _inflator;
   _png;
@@ -2072,8 +2072,8 @@ class bn extends wt {
   _writingDataChunks;
   constructor(e, t = {}) {
     super(e);
-    const { checkCrc: n = !1 } = t;
-    this._checkCrc = n, this._inflator = new Xt(), this._png = {
+    const { checkCrc: s = !1 } = t;
+    this._checkCrc = s, this._inflator = new Xt(), this._png = {
       width: -1,
       height: -1,
       channels: -1,
@@ -2107,7 +2107,7 @@ class bn extends wt {
   }
   // https://www.w3.org/TR/PNG/#5Chunk-layout
   decodeChunk(e, t) {
-    const n = this.offset;
+    const s = this.offset;
     switch (t) {
       // 11.2 Critical chunks
       case "IHDR":
@@ -2129,8 +2129,8 @@ class bn extends wt {
       case "iCCP":
         this.decodeiCCP(e);
         break;
-      case cn:
-        wn(this._png.text, this, e);
+      case fs:
+        ps(this._png.text, this, e);
         break;
       case "pHYs":
         this.decodepHYs();
@@ -2139,12 +2139,12 @@ class bn extends wt {
         this.skip(e);
         break;
     }
-    if (this.offset - n !== e)
+    if (this.offset - s !== e)
       throw new Error(`Length mismatch while decoding chunk ${t}`);
     this._checkCrc ? qt(this, e + 4, t) : this.skip(4);
   }
   decodeApngChunk(e, t) {
-    const n = this.offset;
+    const s = this.offset;
     switch (t !== "fdAT" && t !== "IDAT" && this._writingDataChunks && this.pushDataToFrame(), t) {
       case "acTL":
         this.decodeACTL();
@@ -2156,35 +2156,35 @@ class bn extends wt {
         this.decodeFDAT(e);
         break;
       default:
-        this.decodeChunk(e, t), this.offset = n + e;
+        this.decodeChunk(e, t), this.offset = s + e;
         break;
     }
-    if (this.offset - n !== e)
+    if (this.offset - s !== e)
       throw new Error(`Length mismatch while decoding chunk ${t}`);
     this._checkCrc ? qt(this, e + 4, t) : this.skip(4);
   }
   // https://www.w3.org/TR/PNG/#11IHDR
   decodeIHDR() {
     const e = this._png;
-    e.width = this.readUint32(), e.height = this.readUint32(), e.depth = xn(this.readUint8());
+    e.width = this.readUint32(), e.height = this.readUint32(), e.depth = bs(this.readUint8());
     const t = this.readUint8();
     this._colorType = t;
-    let n;
+    let s;
     switch (t) {
       case I.GREYSCALE:
-        n = 1;
+        s = 1;
         break;
       case I.TRUECOLOUR:
-        n = 3;
+        s = 3;
         break;
       case I.INDEXED_COLOUR:
-        n = 1;
+        s = 1;
         break;
       case I.GREYSCALE_ALPHA:
-        n = 2;
+        s = 2;
         break;
       case I.TRUECOLOUR_ALPHA:
-        n = 4;
+        s = 4;
         break;
       // Kept for exhaustiveness.
       // eslint-disable-next-line unicorn/no-useless-switch-case
@@ -2192,7 +2192,7 @@ class bn extends wt {
       default:
         throw new Error(`Unknown color type: ${t}`);
     }
-    if (this._png.channels = n, this._compressionMethod = this.readUint8(), this._compressionMethod !== ft.DEFLATE)
+    if (this._png.channels = s, this._compressionMethod = this.readUint8(), this._compressionMethod !== ft.DEFLATE)
       throw new Error(`Unsupported compression method: ${this._compressionMethod}`);
     this._filterMethod = this.readUint8(), this._interlaceMethod = this.readUint8();
   }
@@ -2220,23 +2220,23 @@ class bn extends wt {
       throw new RangeError(`PLTE field length must be a multiple of 3. Got ${e}`);
     const t = e / 3;
     this._hasPalette = !0;
-    const n = [];
-    this._palette = n;
+    const s = [];
+    this._palette = s;
     for (let a = 0; a < t; a++)
-      n.push([this.readUint8(), this.readUint8(), this.readUint8()]);
+      s.push([this.readUint8(), this.readUint8(), this.readUint8()]);
   }
   // https://www.w3.org/TR/PNG/#11IDAT
   decodeIDAT(e) {
     this._writingDataChunks = !0;
-    const t = e, n = this.offset + this.byteOffset;
-    if (this._inflator.push(new Uint8Array(this.buffer, n, t)), this._inflator.err)
+    const t = e, s = this.offset + this.byteOffset;
+    if (this._inflator.push(new Uint8Array(this.buffer, s, t)), this._inflator.err)
       throw new Error(`Error while decompressing the data: ${this._inflator.err}`);
     this.skip(e);
   }
   decodeFDAT(e) {
     this._writingDataChunks = !0;
-    let t = e, n = this.offset + this.byteOffset;
-    if (n += 4, t -= 4, this._inflator.push(new Uint8Array(this.buffer, n, t)), this._inflator.err)
+    let t = e, s = this.offset + this.byteOffset;
+    if (s += 4, t -= 4, this._inflator.push(new Uint8Array(this.buffer, s, t)), this._inflator.err)
       throw new Error(`Error while decompressing the data: ${this._inflator.err}`);
     this.skip(e);
   }
@@ -2259,8 +2259,8 @@ class bn extends wt {
           throw new Error(`tRNS chunk contains more alpha values than there are palette colors (${e} vs ${this._palette.length})`);
         let t = 0;
         for (; t < e; t++) {
-          const n = this.readByte();
-          this._palette[t].push(n);
+          const s = this.readByte();
+          this._palette[t].push(s);
         }
         for (; t < this._palette.length; t++)
           this._palette[t].push(255);
@@ -2277,9 +2277,9 @@ class bn extends wt {
   }
   // https://www.w3.org/TR/PNG/#11iCCP
   decodeiCCP(e) {
-    const t = Ue(this), n = this.readUint8();
-    if (n !== ft.DEFLATE)
-      throw new Error(`Unsupported iCCP compression method: ${n}`);
+    const t = Ue(this), s = this.readUint8();
+    if (s !== ft.DEFLATE)
+      throw new Error(`Unsupported iCCP compression method: ${s}`);
     const a = this.readBytes(e - t.length - 2);
     this._png.iccEmbeddedProfile = {
       name: t,
@@ -2288,11 +2288,11 @@ class bn extends wt {
   }
   // https://www.w3.org/TR/PNG/#11pHYs
   decodepHYs() {
-    const e = this.readUint32(), t = this.readUint32(), n = this.readByte();
+    const e = this.readUint32(), t = this.readUint32(), s = this.readByte();
     this._png.resolution = {
       x: e,
       y: t,
-      unit: n
+      unit: s
     };
   }
   decodeApngImage() {
@@ -2303,65 +2303,65 @@ class bn extends wt {
         delayNumber: this._frames[e].delayNumber,
         delayDenominator: this._frames[e].delayDenominator,
         data: this._apng.depth === 8 ? new Uint8Array(this._apng.width * this._apng.height * this._apng.channels) : new Uint16Array(this._apng.width * this._apng.height * this._apng.channels)
-      }, n = this._frames.at(e);
-      if (n) {
-        if (n.data = Jt({
-          data: n.data,
-          width: n.width,
-          height: n.height,
+      }, s = this._frames.at(e);
+      if (s) {
+        if (s.data = Jt({
+          data: s.data,
+          width: s.width,
+          height: s.height,
           channels: this._apng.channels,
           depth: this._apng.depth
-        }), this._hasPalette && (this._apng.palette = this._palette), this._hasTransparency && (this._apng.transparency = this._transparency), e === 0 || n.xOffset === 0 && n.yOffset === 0 && n.width === this._png.width && n.height === this._png.height)
-          t.data = n.data;
+        }), this._hasPalette && (this._apng.palette = this._palette), this._hasTransparency && (this._apng.transparency = this._transparency), e === 0 || s.xOffset === 0 && s.yOffset === 0 && s.width === this._png.width && s.height === this._png.height)
+          t.data = s.data;
         else {
           const a = this._apng.frames.at(e - 1);
-          this.disposeFrame(n, a, t), this.addFrameDataToCanvas(t, n);
+          this.disposeFrame(s, a, t), this.addFrameDataToCanvas(t, s);
         }
         this._apng.frames.push(t);
       }
     }
     return this._apng;
   }
-  disposeFrame(e, t, n) {
+  disposeFrame(e, t, s) {
     switch (e.disposeOp) {
       case V.NONE:
         break;
       case V.BACKGROUND:
         for (let a = 0; a < this._png.height; a++)
-          for (let s = 0; s < this._png.width; s++) {
-            const l = (a * e.width + s) * this._png.channels;
+          for (let n = 0; n < this._png.width; n++) {
+            const l = (a * e.width + n) * this._png.channels;
             for (let h = 0; h < this._png.channels; h++)
-              n.data[l + h] = 0;
+              s.data[l + h] = 0;
           }
         break;
       case V.PREVIOUS:
-        n.data.set(t.data);
+        s.data.set(t.data);
         break;
       default:
         throw new Error("Unknown disposeOp");
     }
   }
   addFrameDataToCanvas(e, t) {
-    const n = 1 << this._png.depth, a = (s, l) => {
-      const h = ((s + t.yOffset) * this._png.width + t.xOffset + l) * this._png.channels, d = (s * t.width + l) * this._png.channels;
+    const s = 1 << this._png.depth, a = (n, l) => {
+      const h = ((n + t.yOffset) * this._png.width + t.xOffset + l) * this._png.channels, d = (n * t.width + l) * this._png.channels;
       return { index: h, frameIndex: d };
     };
     switch (t.blendOp) {
       case dt.SOURCE:
-        for (let s = 0; s < t.height; s++)
+        for (let n = 0; n < t.height; n++)
           for (let l = 0; l < t.width; l++) {
-            const { index: h, frameIndex: d } = a(s, l);
+            const { index: h, frameIndex: d } = a(n, l);
             for (let r = 0; r < this._png.channels; r++)
               e.data[h + r] = t.data[d + r];
           }
         break;
       // https://www.w3.org/TR/png-3/#13Alpha-channel-processing
       case dt.OVER:
-        for (let s = 0; s < t.height; s++)
+        for (let n = 0; n < t.height; n++)
           for (let l = 0; l < t.width; l++) {
-            const { index: h, frameIndex: d } = a(s, l);
+            const { index: h, frameIndex: d } = a(n, l);
             for (let r = 0; r < this._png.channels; r++) {
-              const o = t.data[d + this._png.channels - 1] / n, w = r % (this._png.channels - 1) === 0 ? 1 : t.data[d + r], u = Math.floor(o * w + (1 - o) * e.data[h + r]);
+              const o = t.data[d + this._png.channels - 1] / s, w = r % (this._png.channels - 1) === 0 ? 1 : t.data[d + r], u = Math.floor(o * w + (1 - o) * e.data[h + r]);
               e.data[h + r] += u;
             }
           }
@@ -2385,7 +2385,7 @@ class bn extends wt {
         depth: this._png.depth
       });
     else if (this._interlaceMethod === ct.ADAM7)
-      this._png.data = nn({
+      this._png.data = is({
         data: e,
         width: this._png.width,
         height: this._png.height,
@@ -2412,20 +2412,20 @@ class bn extends wt {
     }), this._inflator = new Xt(), this._writingDataChunks = !1;
   }
 }
-function xn(i) {
+function bs(i) {
   if (i !== 1 && i !== 2 && i !== 4 && i !== 8 && i !== 16)
     throw new Error(`invalid bit depth: ${i}`);
   return i;
 }
-function yn(i, e) {
-  return new bn(i, e).decode();
+function xs(i, e) {
+  return new gs(i, e).decode();
 }
-class kn {
+class ys {
   #e;
   #t;
-  #n;
-  #i;
   #s;
+  #i;
+  #n;
   elevs;
   /**
    * Create a new DEM.
@@ -2437,8 +2437,8 @@ class kn {
    * @param {number} xSpacing - spacing in Spherical Mercator units in the horizontal direction.
    * @param {number} ySpacing - spacing in Spherical Mercator units in the vertical direction.
    */
-  constructor(e, t, n, a, s, l) {
-    this.#e = t, this.#t = n, this.#n = a, this.elevs = e, this.#i = s, this.#s = l;
+  constructor(e, t, s, a, n, l) {
+    this.#e = t, this.#t = s, this.#s = a, this.elevs = e, this.#i = n, this.#n = l;
   }
   /** Obtains the elevation in metres at a given x and y Spherical Mercator coordinate using bilinear interpolation.
    * @param {number} x - the Spherical Mercator x coordinate.
@@ -2446,16 +2446,20 @@ class kn {
    * @return {number} the elevation in metres
    */
   getElevation(e, t) {
-    let n = [e, t], a = Math.floor((n[0] - this.#e.e) / this.#i), s = this.#n - Math.ceil((n[1] - this.#e.n) / this.#s), l, h, d, r, o, w, u, f = null;
-    if (a >= 0 && s >= 0 && a < this.#t - 1 && s < this.#n - 1) {
-      r = this.elevs[s * this.#t + a], o = this.elevs[s * this.#t + a + 1], w = this.elevs[s * this.#t + a + this.#t], u = this.elevs[s * this.#t + a + this.#t + 1], l = this.#e.e + a * this.#i, l + this.#i, h = this.#e.n + (this.#n - 1 - s) * this.#s, d = h - this.#s;
-      let _ = (n[0] - l) / this.#i, U = r * (1 - _) + o * _, x = w * (1 - _) + u * _, g = (n[1] - d) / this.#s;
+    let s = [e, t], a = Math.floor((s[0] - this.#e.e) / this.#i), n = this.#s - Math.ceil((s[1] - this.#e.n) / this.#n), l, h, d, r, o, w, u, f = null;
+    if (a >= 0 && n >= 0 && a < this.#t - 1 && n < this.#s - 1) {
+      r = this.elevs[n * this.#t + a], o = this.elevs[n * this.#t + a + 1], w = this.elevs[n * this.#t + a + this.#t], u = this.elevs[n * this.#t + a + this.#t + 1], l = this.#e.e + a * this.#i, l + this.#i, h = this.#e.n + (this.#s - 1 - n) * this.#n, d = h - this.#n;
+      let _ = (s[0] - l) / this.#i, U = r * (1 - _) + o * _, x = w * (1 - _) + u * _, g = (s[1] - d) / this.#n;
       f = x * (1 - g) + U * g;
     }
     return f;
   }
+  /** Process the DEM data with a custom function. The function has access to all the key properties of the DEM. */
+  processData(e) {
+    e(this.elevs, this.#e, this.#t, this.#s, this.#i, this.#n);
+  }
 }
-class En extends ie {
+class ks extends ie {
   /**
    * Create a DemTiler.
    * @class
@@ -2470,14 +2474,14 @@ class En extends ie {
    * @return {Promise<any>} a Promise resolving with raw DEM data.
    */
   async readTile(e) {
-    const n = await (await fetch(e, {
+    const s = await (await fetch(e, {
       signal: AbortSignal.timeout(3e4)
-    })).arrayBuffer(), a = yn(n);
-    let s, l = 0;
+    })).arrayBuffer(), a = xs(s);
+    let n, l = 0;
     const h = new Array(a.width * a.height);
     for (let d = 0; d < a.height; d++)
       for (let r = 0; r < a.width; r++)
-        s = (d * a.width + r) * a.channels, h[l++] = Math.round(a.data[s] * 256 + a.data[s + 1] + a.data[s + 2] / 256 - 32768);
+        n = (d * a.width + r) * a.channels, h[l++] = Math.round(a.data[n] * 256 + a.data[n + 1] + a.data[n + 2] / 256 - 32768);
     return { w: a.width, h: a.height, elevs: h };
   }
   /**
@@ -2486,8 +2490,8 @@ class En extends ie {
    * @return {number} the elevation in metres, or Number.NEGATIVE_INFINITY if this position is outside the extent of the DEM.
    */
   getElevation(e) {
-    const t = this.getTile(e, this.tile.z), n = this.dataTiles.get(`${t.z}/${t.x}/${t.y}`);
-    return n ? n.data.getElevation(e.e, e.n) : null;
+    const t = this.getTile(e, this.tile.z), s = this.dataTiles.get(`${t.z}/${t.x}/${t.y}`);
+    return s ? s.data.getElevation(e.e, e.n) : null;
   }
   /**
    * Obtain the elevation in metres for a given longitude/latitude. 
@@ -2504,18 +2508,18 @@ class En extends ie {
    * @return {DataTile} the DataTile pairing the Tile and the DEM data as a DEM object. 
    */
   rawTileToStoredTile(e, t) {
-    const n = e.getTopRight(), a = e.getBottomLeft(), s = (n.e - a.e) / (t.w - 1), l = (n.n - a.n) / (t.h - 1), h = new kn(
+    const s = e.getTopRight(), a = e.getBottomLeft(), n = (s.e - a.e) / (t.w - 1), l = (s.n - a.n) / (t.h - 1), h = new ys(
       t.elevs,
       a,
       t.w,
       t.h,
-      s,
+      n,
       l
     );
     return { tile: e, data: h };
   }
 }
-class An extends ie {
+class Es extends ie {
   /**
    * Create a JsonTiler.
    * @class
@@ -2535,7 +2539,7 @@ class An extends ie {
     })).json();
   }
 }
-class Tn {
+class As {
   e;
   n;
   /**
@@ -2556,26 +2560,26 @@ class Tn {
   }
 }
 class ee {
-  lon;
-  lat;
+  longitude;
+  latitude;
   /**
    * Creates a LonLat.
    * @class
-   * @param {number} lon - the longitude.
-   * @param {number} lat - the latitude.
+   * @param {number} longitude - the longitude.
+   * @param {number} latitude - the latitude.
    */
   constructor(e, t) {
-    this.lon = e, this.lat = t;
+    this.longitude = e, this.latitude = t;
   }
   /**
    * Returns a string representation of the LonLat. 
    * @return {string} the string representation. 
    */
   toString() {
-    return `lon: ${this.lon}, lat: ${this.lat}`;
+    return `longitude: ${this.longitude}, latitude: ${this.latitude}`;
   }
 }
-class mn {
+class Ts {
   demTiler;
   jsonTiler;
   /**
@@ -2597,13 +2601,13 @@ class mn {
    * @return {Promise<DataTile[]>} promise resolving with an array of updated JSON tiles with elevation added as a third member of the coordinates of each point. As for Tiler, only the newly-downloaded tiles are returned.
    */
   async updateByLonLat(e) {
-    const t = this.demTiler.sphMerc.project(e), n = await this.demTiler.update(t), a = await this.jsonTiler.update(t);
-    return n.forEach((s, l) => {
-      this.#e(s, a[l]);
+    const t = this.demTiler.sphMerc.project(e), s = await this.demTiler.update(t), a = await this.jsonTiler.update(t);
+    return s.forEach((n, l) => {
+      this.#e(n, a[l]);
     }), a;
   }
   async #e(e, t) {
-    t.data.features.forEach((a, s) => {
+    t.data.features.forEach((a, n) => {
       switch (a.geometry.type) {
         case "LineString":
           const l = a.geometry;
@@ -2622,19 +2626,19 @@ class mn {
     });
   }
   #t(e, t) {
-    t.forEach((n) => {
-      const a = this.demTiler.sphMerc.project(new ee(n[0], n[1])), s = e.data?.getElevation(a.e, a.n) ?? 0;
-      s > Number.NEGATIVE_INFINITY && (n[2] = s);
+    t.forEach((s) => {
+      const a = this.demTiler.sphMerc.project(new ee(s[0], s[1])), n = e.data?.getElevation(a.e, a.n) ?? 0;
+      n > Number.NEGATIVE_INFINITY && (s[2] = n);
     });
   }
 }
 export {
-  N as Constants,
-  kn as DEM,
-  mn as DemApplier,
-  En as DemTiler,
-  Tn as EastNorth,
-  An as JsonTiler,
+  D as Constants,
+  ys as DEM,
+  Ts as DemApplier,
+  ks as DemTiler,
+  As as EastNorth,
+  Es as JsonTiler,
   ee as LonLat,
   Se as SphMercProjection,
   q as Tile,