@poor-knight/cesium-utils 0.0.0 → 0.0.2

package/dist/cesium-utils.js

@@ -1,24 +1,18 @@
 var ne = Object.defineProperty;
-var oe = (r, t, e) => t in r ? ne(r, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : r[t] = e;
-var W = (r, t, e) => oe(r, typeof t != "symbol" ? t + "" : t, e);
-import { Cartesian2, Cartesian3, VerticalOrigin, HorizontalOrigin, Color, LabelStyle, defaultValue, defined, DeveloperError, Event, Credit, Ellipsoid, GeographicTilingScheme, TerrainProvider, HeightmapTerrainData, Resource, Rectangle, WebMapTileServiceImageryProvider, ImageryLayer, WebMapServiceImageryProvider } from "cesium";
-var commonjsGlobal = typeof globalThis < "u" ? (
-  // eslint-disable-next-line no-undef
-  globalThis
-) : typeof window < "u" ? window : typeof global < "u" ? (
-  // eslint-disable-next-line no-undef
-  global
-) : typeof self < "u" ? self : {}, inflate$2 = {};
+var se = (r, t, e) => t in r ? ne(r, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : r[t] = e;
+var H = (r, t, e) => se(r, typeof t != "symbol" ? t + "" : t, e);
+import { Cartesian2, Cartesian3, VerticalOrigin, HorizontalOrigin, Color, LabelStyle, defined, DeveloperError, Event, Credit, Ellipsoid, GeographicTilingScheme, TerrainProvider, HeightmapTerrainData, Resource, Rectangle, WebMapTileServiceImageryProvider, ScreenSpaceEventHandler, ScreenSpaceEventType, ImageryLayer, WebMapServiceImageryProvider } from "cesium";
+var commonjsGlobal = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {}, inflate$2 = {};
 const adler32$1 = (r, t, e, a) => {
-  let l = r & 65535 | 0, n = r >>> 16 & 65535 | 0, o = 0;
+  let c = r & 65535 | 0, n = r >>> 16 & 65535 | 0, o = 0;
   for (; e !== 0; ) {
     o = e > 2e3 ? 2e3 : e, e -= o;
     do
-      l = l + t[a++] | 0, n = n + l | 0;
+      c = c + t[a++] | 0, n = n + c | 0;
     while (--o);
-    l %= 65521, n %= 65521;
+    c %= 65521, n %= 65521;
   }
-  return l | n << 16 | 0;
+  return c | n << 16 | 0;
 };
 var adler32_1 = adler32$1;
 const makeTable = () => {
@@ -31,77 +25,77 @@ const makeTable = () => {
   }
   return t;
 }, crcTable = new Uint32Array(makeTable()), crc32$1 = (r, t, e, a) => {
-  const l = crcTable, n = a + e;
+  const c = crcTable, n = a + e;
   r ^= -1;
   for (let o = a; o < n; o++)
-    r = r >>> 8 ^ l[(r ^ t[o]) & 255];
+    r = r >>> 8 ^ c[(r ^ t[o]) & 255];
   return r ^ -1;
 };
 var crc32_1 = crc32$1;
 const BAD$1 = 16209, TYPE$1 = 16191;
 var inffast = function(t, e) {
-  let a, l, n, o, s, u, i, c, h, p, d, y, g, T, _, m, b, v, x, O, E, q, S, $;
+  let a, c, n, o, s, u, i, l, h, p, d, y, g, _, w, m, b, v, E, T, R, q, A, $;
   const k = t.state;
-  a = t.next_in, S = t.input, l = a + (t.avail_in - 5), n = t.next_out, $ = t.output, o = n - (e - t.avail_out), s = n + (t.avail_out - 257), u = k.dmax, i = k.wsize, c = k.whave, h = k.wnext, p = k.window, d = k.hold, y = k.bits, g = k.lencode, T = k.distcode, _ = (1 << k.lenbits) - 1, m = (1 << k.distbits) - 1;
+  a = t.next_in, A = t.input, c = a + (t.avail_in - 5), n = t.next_out, $ = t.output, o = n - (e - t.avail_out), s = n + (t.avail_out - 257), u = k.dmax, i = k.wsize, l = k.whave, h = k.wnext, p = k.window, d = k.hold, y = k.bits, g = k.lencode, _ = k.distcode, w = (1 << k.lenbits) - 1, m = (1 << k.distbits) - 1;
   e: do {
-    y < 15 && (d += S[a++] << y, y += 8, d += S[a++] << y, y += 8), b = g[d & _];
+    y < 15 && (d += A[a++] << y, y += 8, d += A[a++] << y, y += 8), b = g[d & w];
     t: for (; ; ) {
       if (v = b >>> 24, d >>>= v, y -= v, v = b >>> 16 & 255, v === 0)
         $[n++] = b & 65535;
       else if (v & 16) {
-        x = b & 65535, v &= 15, v && (y < v && (d += S[a++] << y, y += 8), x += d & (1 << v) - 1, d >>>= v, y -= v), y < 15 && (d += S[a++] << y, y += 8, d += S[a++] << y, y += 8), b = T[d & m];
+        E = b & 65535, v &= 15, v && (y < v && (d += A[a++] << y, y += 8), E += d & (1 << v) - 1, d >>>= v, y -= v), y < 15 && (d += A[a++] << y, y += 8, d += A[a++] << y, y += 8), b = _[d & m];
         r: for (; ; ) {
           if (v = b >>> 24, d >>>= v, y -= v, v = b >>> 16 & 255, v & 16) {
-            if (O = b & 65535, v &= 15, y < v && (d += S[a++] << y, y += 8, y < v && (d += S[a++] << y, y += 8)), O += d & (1 << v) - 1, O > u) {
+            if (T = b & 65535, v &= 15, y < v && (d += A[a++] << y, y += 8, y < v && (d += A[a++] << y, y += 8)), T += d & (1 << v) - 1, T > u) {
               t.msg = "invalid distance too far back", k.mode = BAD$1;
               break e;
             }
-            if (d >>>= v, y -= v, v = n - o, O > v) {
-              if (v = O - v, v > c && k.sane) {
+            if (d >>>= v, y -= v, v = n - o, T > v) {
+              if (v = T - v, v > l && k.sane) {
                 t.msg = "invalid distance too far back", k.mode = BAD$1;
                 break e;
               }
-              if (E = 0, q = p, h === 0) {
-                if (E += i - v, v < x) {
-                  x -= v;
+              if (R = 0, q = p, h === 0) {
+                if (R += i - v, v < E) {
+                  E -= v;
                   do
-                    $[n++] = p[E++];
+                    $[n++] = p[R++];
                   while (--v);
-                  E = n - O, q = $;
+                  R = n - T, q = $;
                 }
               } else if (h < v) {
-                if (E += i + h - v, v -= h, v < x) {
-                  x -= v;
+                if (R += i + h - v, v -= h, v < E) {
+                  E -= v;
                   do
-                    $[n++] = p[E++];
+                    $[n++] = p[R++];
                   while (--v);
-                  if (E = 0, h < x) {
-                    v = h, x -= v;
+                  if (R = 0, h < E) {
+                    v = h, E -= v;
                     do
-                      $[n++] = p[E++];
+                      $[n++] = p[R++];
                     while (--v);
-                    E = n - O, q = $;
+                    R = n - T, q = $;
                   }
                 }
-              } else if (E += h - v, v < x) {
-                x -= v;
+              } else if (R += h - v, v < E) {
+                E -= v;
                 do
-                  $[n++] = p[E++];
+                  $[n++] = p[R++];
                 while (--v);
-                E = n - O, q = $;
+                R = n - T, q = $;
               }
-              for (; x > 2; )
-                $[n++] = q[E++], $[n++] = q[E++], $[n++] = q[E++], x -= 3;
-              x && ($[n++] = q[E++], x > 1 && ($[n++] = q[E++]));
+              for (; E > 2; )
+                $[n++] = q[R++], $[n++] = q[R++], $[n++] = q[R++], E -= 3;
+              E && ($[n++] = q[R++], E > 1 && ($[n++] = q[R++]));
             } else {
-              E = n - O;
+              R = n - T;
               do
-                $[n++] = $[E++], $[n++] = $[E++], $[n++] = $[E++], x -= 3;
-              while (x > 2);
-              x && ($[n++] = $[E++], x > 1 && ($[n++] = $[E++]));
+                $[n++] = $[R++], $[n++] = $[R++], $[n++] = $[R++], E -= 3;
+              while (E > 2);
+              E && ($[n++] = $[R++], E > 1 && ($[n++] = $[R++]));
             }
           } else if ((v & 64) === 0) {
-            b = T[(b & 65535) + (d & (1 << v) - 1)];
+            b = _[(b & 65535) + (d & (1 << v) - 1)];
             continue r;
           } else {
             t.msg = "invalid distance code", k.mode = BAD$1;
@@ -121,8 +115,8 @@ var inffast = function(t, e) {
       }
       break;
     }
-  } while (a < l && n < s);
-  x = y >> 3, a -= x, y -= x << 3, d &= (1 << y) - 1, t.next_in = a, t.next_out = n, t.avail_in = a < l ? 5 + (l - a) : 5 - (a - l), t.avail_out = n < s ? 257 + (s - n) : 257 - (n - s), k.hold = d, k.bits = y;
+  } while (a < c && n < s);
+  E = y >> 3, a -= E, y -= E << 3, d &= (1 << y) - 1, t.next_in = a, t.next_out = n, t.avail_in = a < c ? 5 + (c - a) : 5 - (a - c), t.avail_out = n < s ? 257 + (s - n) : 257 - (n - s), k.hold = d, k.bits = y;
 };
 const MAXBITS = 15, ENOUGH_LENS$1 = 852, ENOUGH_DISTS$1 = 592, CODES$1 = 0, LENS$1 = 1, DISTS$1 = 2, lbase = new Uint16Array([
   /* Length codes 257..285 base */
@@ -258,53 +252,53 @@ const MAXBITS = 15, ENOUGH_LENS$1 = 852, ENOUGH_DISTS$1 = 592, CODES$1 = 0, LENS
   29,
   64,
   64
-]), inflate_table$1 = (r, t, e, a, l, n, o, s) => {
+]), inflate_table$1 = (r, t, e, a, c, n, o, s) => {
   const u = s.bits;
-  let i = 0, c = 0, h = 0, p = 0, d = 0, y = 0, g = 0, T = 0, _ = 0, m = 0, b, v, x, O, E, q = null, S;
+  let i = 0, l = 0, h = 0, p = 0, d = 0, y = 0, g = 0, _ = 0, w = 0, m = 0, b, v, E, T, R, q = null, A;
   const $ = new Uint16Array(MAXBITS + 1), k = new Uint16Array(MAXBITS + 1);
   let D = null, M, L, U;
   for (i = 0; i <= MAXBITS; i++)
     $[i] = 0;
-  for (c = 0; c < a; c++)
-    $[t[e + c]]++;
+  for (l = 0; l < a; l++)
+    $[t[e + l]]++;
   for (d = u, p = MAXBITS; p >= 1 && $[p] === 0; p--)
     ;
   if (d > p && (d = p), p === 0)
-    return l[n++] = 1 << 24 | 64 << 16 | 0, l[n++] = 1 << 24 | 64 << 16 | 0, s.bits = 1, 0;
+    return c[n++] = 1 << 24 | 64 << 16 | 0, c[n++] = 1 << 24 | 64 << 16 | 0, s.bits = 1, 0;
   for (h = 1; h < p && $[h] === 0; h++)
     ;
-  for (d < h && (d = h), T = 1, i = 1; i <= MAXBITS; i++)
-    if (T <<= 1, T -= $[i], T < 0)
+  for (d < h && (d = h), _ = 1, i = 1; i <= MAXBITS; i++)
+    if (_ <<= 1, _ -= $[i], _ < 0)
       return -1;
-  if (T > 0 && (r === CODES$1 || p !== 1))
+  if (_ > 0 && (r === CODES$1 || p !== 1))
     return -1;
   for (k[1] = 0, i = 1; i < MAXBITS; i++)
     k[i + 1] = k[i] + $[i];
-  for (c = 0; c < a; c++)
-    t[e + c] !== 0 && (o[k[t[e + c]]++] = c);
-  if (r === CODES$1 ? (q = D = o, S = 20) : r === LENS$1 ? (q = lbase, D = lext, S = 257) : (q = dbase, D = dext, S = 0), m = 0, c = 0, i = h, E = n, y = d, g = 0, x = -1, _ = 1 << d, O = _ - 1, r === LENS$1 && _ > ENOUGH_LENS$1 || r === DISTS$1 && _ > ENOUGH_DISTS$1)
+  for (l = 0; l < a; l++)
+    t[e + l] !== 0 && (o[k[t[e + l]]++] = l);
+  if (r === CODES$1 ? (q = D = o, A = 20) : r === LENS$1 ? (q = lbase, D = lext, A = 257) : (q = dbase, D = dext, A = 0), m = 0, l = 0, i = h, R = n, y = d, g = 0, E = -1, w = 1 << d, T = w - 1, r === LENS$1 && w > ENOUGH_LENS$1 || r === DISTS$1 && w > ENOUGH_DISTS$1)
     return 1;
   for (; ; ) {
-    M = i - g, o[c] + 1 < S ? (L = 0, U = o[c]) : o[c] >= S ? (L = D[o[c] - S], U = q[o[c] - S]) : (L = 96, U = 0), b = 1 << i - g, v = 1 << y, h = v;
+    M = i - g, o[l] + 1 < A ? (L = 0, U = o[l]) : o[l] >= A ? (L = D[o[l] - A], U = q[o[l] - A]) : (L = 96, U = 0), b = 1 << i - g, v = 1 << y, h = v;
     do
-      v -= b, l[E + (m >> g) + v] = M << 24 | L << 16 | U | 0;
+      v -= b, c[R + (m >> g) + v] = M << 24 | L << 16 | U | 0;
     while (v !== 0);
     for (b = 1 << i - 1; m & b; )
       b >>= 1;
-    if (b !== 0 ? (m &= b - 1, m += b) : m = 0, c++, --$[i] === 0) {
+    if (b !== 0 ? (m &= b - 1, m += b) : m = 0, l++, --$[i] === 0) {
       if (i === p)
         break;
-      i = t[e + o[c]];
+      i = t[e + o[l]];
     }
-    if (i > d && (m & O) !== x) {
-      for (g === 0 && (g = d), E += h, y = i - g, T = 1 << y; y + g < p && (T -= $[y + g], !(T <= 0)); )
-        y++, T <<= 1;
-      if (_ += 1 << y, r === LENS$1 && _ > ENOUGH_LENS$1 || r === DISTS$1 && _ > ENOUGH_DISTS$1)
+    if (i > d && (m & T) !== E) {
+      for (g === 0 && (g = d), R += h, y = i - g, _ = 1 << y; y + g < p && (_ -= $[y + g], !(_ <= 0)); )
+        y++, _ <<= 1;
+      if (w += 1 << y, r === LENS$1 && w > ENOUGH_LENS$1 || r === DISTS$1 && w > ENOUGH_DISTS$1)
         return 1;
-      x = m & O, l[x] = d << 24 | y << 16 | E - n | 0;
+      E = m & T, c[E] = d << 24 | y << 16 | R - n | 0;
     }
   }
-  return m !== 0 && (l[E + m] = i - g << 24 | 64 << 16 | 0), s.bits = d, 0;
+  return m !== 0 && (c[R + m] = i - g << 24 | 64 << 16 | 0), s.bits = d, 0;
 };
 var inftrees = inflate_table$1, constants = {
   /* Allowed flush values; see deflate() and inflate() below for details */
@@ -394,12 +388,12 @@ const fixedtables = (r) => {
   }
   r.lencode = lenfix, r.lenbits = 9, r.distcode = distfix, r.distbits = 5;
 }, updatewindow = (r, t, e, a) => {
-  let l;
+  let c;
   const n = r.state;
-  return n.window === null && (n.wsize = 1 << n.wbits, n.wnext = 0, n.whave = 0, n.window = new Uint8Array(n.wsize)), a >= n.wsize ? (n.window.set(t.subarray(e - n.wsize, e), 0), n.wnext = 0, n.whave = n.wsize) : (l = n.wsize - n.wnext, l > a && (l = a), n.window.set(t.subarray(e - a, e - a + l), n.wnext), a -= l, a ? (n.window.set(t.subarray(e - a, e), 0), n.wnext = a, n.whave = n.wsize) : (n.wnext += l, n.wnext === n.wsize && (n.wnext = 0), n.whave < n.wsize && (n.whave += l))), 0;
+  return n.window === null && (n.wsize = 1 << n.wbits, n.wnext = 0, n.whave = 0, n.window = new Uint8Array(n.wsize)), a >= n.wsize ? (n.window.set(t.subarray(e - n.wsize, e), 0), n.wnext = 0, n.whave = n.wsize) : (c = n.wsize - n.wnext, c > a && (c = a), n.window.set(t.subarray(e - a, e - a + c), n.wnext), a -= c, a ? (n.window.set(t.subarray(e - a, e), 0), n.wnext = a, n.whave = n.wsize) : (n.wnext += c, n.wnext === n.wsize && (n.wnext = 0), n.whave < n.wsize && (n.whave += c))), 0;
 }, inflate$1 = (r, t) => {
-  let e, a, l, n, o, s, u, i, c, h, p, d, y, g, T = 0, _, m, b, v, x, O, E, q;
-  const S = new Uint8Array(4);
+  let e, a, c, n, o, s, u, i, l, h, p, d, y, g, _ = 0, w, m, b, v, E, T, R, q;
+  const A = new Uint8Array(4);
   let $, k;
   const D = (
     /* permutation of code lengths */
@@ -407,7 +401,7 @@ const fixedtables = (r) => {
   );
   if (inflateStateCheck(r) || !r.output || !r.input && r.avail_in !== 0)
     return Z_STREAM_ERROR$1;
-  e = r.state, e.mode === TYPE && (e.mode = TYPEDO), o = r.next_out, l = r.output, u = r.avail_out, n = r.next_in, a = r.input, s = r.avail_in, i = e.hold, c = e.bits, h = s, p = u, q = Z_OK$1;
+  e = r.state, e.mode === TYPE && (e.mode = TYPEDO), o = r.next_out, c = r.output, u = r.avail_out, n = r.next_in, a = r.input, s = r.avail_in, i = e.hold, l = e.bits, h = s, p = u, q = Z_OK$1;
   e: for (; ; )
     switch (e.mode) {
       case HEAD:
@@ -415,13 +409,13 @@ const fixedtables = (r) => {
           e.mode = TYPEDO;
           break;
         }
-        for (; c < 16; ) {
+        for (; l < 16; ) {
           if (s === 0)
             break e;
-          s--, i += a[n++] << c, c += 8;
+          s--, i += a[n++] << l, l += 8;
         }
         if (e.wrap & 2 && i === 35615) {
-          e.wbits === 0 && (e.wbits = 15), e.check = 0, S[0] = i & 255, S[1] = i >>> 8 & 255, e.check = crc32(e.check, S, 2, 0), i = 0, c = 0, e.mode = FLAGS;
+          e.wbits === 0 && (e.wbits = 15), e.check = 0, A[0] = i & 255, A[1] = i >>> 8 & 255, e.check = crc32(e.check, A, 2, 0), i = 0, l = 0, e.mode = FLAGS;
           break;
         }
         if (e.head && (e.head.done = !1), !(e.wrap & 1) || (((i & 255) << 8) + (i >> 8)) % 31) {
@@ -432,17 +426,17 @@ const fixedtables = (r) => {
           r.msg = "unknown compression method", e.mode = BAD;
           break;
         }
-        if (i >>>= 4, c -= 4, E = (i & 15) + 8, e.wbits === 0 && (e.wbits = E), E > 15 || E > e.wbits) {
+        if (i >>>= 4, l -= 4, R = (i & 15) + 8, e.wbits === 0 && (e.wbits = R), R > 15 || R > e.wbits) {
           r.msg = "invalid window size", e.mode = BAD;
           break;
         }
-        e.dmax = 1 << e.wbits, e.flags = 0, r.adler = e.check = 1, e.mode = i & 512 ? DICTID : TYPE, i = 0, c = 0;
+        e.dmax = 1 << e.wbits, e.flags = 0, r.adler = e.check = 1, e.mode = i & 512 ? DICTID : TYPE, i = 0, l = 0;
         break;
       case FLAGS:
-        for (; c < 16; ) {
+        for (; l < 16; ) {
           if (s === 0)
             break e;
-          s--, i += a[n++] << c, c += 8;
+          s--, i += a[n++] << l, l += 8;
         }
         if (e.flags = i, (e.flags & 255) !== Z_DEFLATED) {
           r.msg = "unknown compression method", e.mode = BAD;
@@ -452,44 +446,44 @@ const fixedtables = (r) => {
           r.msg = "unknown header flags set", e.mode = BAD;
           break;
         }
-        e.head && (e.head.text = i >> 8 & 1), e.flags & 512 && e.wrap & 4 && (S[0] = i & 255, S[1] = i >>> 8 & 255, e.check = crc32(e.check, S, 2, 0)), i = 0, c = 0, e.mode = TIME;
+        e.head && (e.head.text = i >> 8 & 1), e.flags & 512 && e.wrap & 4 && (A[0] = i & 255, A[1] = i >>> 8 & 255, e.check = crc32(e.check, A, 2, 0)), i = 0, l = 0, e.mode = TIME;
       /* falls through */
       case TIME:
-        for (; c < 32; ) {
+        for (; l < 32; ) {
           if (s === 0)
             break e;
-          s--, i += a[n++] << c, c += 8;
+          s--, i += a[n++] << l, l += 8;
         }
-        e.head && (e.head.time = i), e.flags & 512 && e.wrap & 4 && (S[0] = i & 255, S[1] = i >>> 8 & 255, S[2] = i >>> 16 & 255, S[3] = i >>> 24 & 255, e.check = crc32(e.check, S, 4, 0)), i = 0, c = 0, e.mode = OS;
+        e.head && (e.head.time = i), e.flags & 512 && e.wrap & 4 && (A[0] = i & 255, A[1] = i >>> 8 & 255, A[2] = i >>> 16 & 255, A[3] = i >>> 24 & 255, e.check = crc32(e.check, A, 4, 0)), i = 0, l = 0, e.mode = OS;
       /* falls through */
       case OS:
-        for (; c < 16; ) {
+        for (; l < 16; ) {
           if (s === 0)
             break e;
-          s--, i += a[n++] << c, c += 8;
+          s--, i += a[n++] << l, l += 8;
         }
-        e.head && (e.head.xflags = i & 255, e.head.os = i >> 8), e.flags & 512 && e.wrap & 4 && (S[0] = i & 255, S[1] = i >>> 8 & 255, e.check = crc32(e.check, S, 2, 0)), i = 0, c = 0, e.mode = EXLEN;
+        e.head && (e.head.xflags = i & 255, e.head.os = i >> 8), e.flags & 512 && e.wrap & 4 && (A[0] = i & 255, A[1] = i >>> 8 & 255, e.check = crc32(e.check, A, 2, 0)), i = 0, l = 0, e.mode = EXLEN;
       /* falls through */
       case EXLEN:
         if (e.flags & 1024) {
-          for (; c < 16; ) {
+          for (; l < 16; ) {
             if (s === 0)
               break e;
-            s--, i += a[n++] << c, c += 8;
+            s--, i += a[n++] << l, l += 8;
           }
-          e.length = i, e.head && (e.head.extra_len = i), e.flags & 512 && e.wrap & 4 && (S[0] = i & 255, S[1] = i >>> 8 & 255, e.check = crc32(e.check, S, 2, 0)), i = 0, c = 0;
+          e.length = i, e.head && (e.head.extra_len = i), e.flags & 512 && e.wrap & 4 && (A[0] = i & 255, A[1] = i >>> 8 & 255, e.check = crc32(e.check, A, 2, 0)), i = 0, l = 0;
         } else e.head && (e.head.extra = null);
         e.mode = EXTRA;
       /* falls through */
       case EXTRA:
-        if (e.flags & 1024 && (d = e.length, d > s && (d = s), d && (e.head && (E = e.head.extra_len - e.length, e.head.extra || (e.head.extra = new Uint8Array(e.head.extra_len)), e.head.extra.set(
+        if (e.flags & 1024 && (d = e.length, d > s && (d = s), d && (e.head && (R = e.head.extra_len - e.length, e.head.extra || (e.head.extra = new Uint8Array(e.head.extra_len)), e.head.extra.set(
           a.subarray(
             n,
             // extra field is limited to 65536 bytes
             // - no need for additional size check
             n + d
           ),
-          E
+          R
         )), e.flags & 512 && e.wrap & 4 && (e.check = crc32(e.check, a, d, n)), s -= d, n += d, e.length -= d), e.length))
           break e;
         e.length = 0, e.mode = NAME;
@@ -500,9 +494,9 @@ const fixedtables = (r) => {
             break e;
           d = 0;
           do
-            E = a[n + d++], e.head && E && e.length < 65536 && (e.head.name += String.fromCharCode(E));
-          while (E && d < s);
-          if (e.flags & 512 && e.wrap & 4 && (e.check = crc32(e.check, a, d, n)), s -= d, n += d, E)
+            R = a[n + d++], e.head && R && e.length < 65536 && (e.head.name += String.fromCharCode(R));
+          while (R && d < s);
+          if (e.flags & 512 && e.wrap & 4 && (e.check = crc32(e.check, a, d, n)), s -= d, n += d, R)
             break e;
         } else e.head && (e.head.name = null);
         e.length = 0, e.mode = COMMENT;
@@ -513,39 +507,39 @@ const fixedtables = (r) => {
             break e;
           d = 0;
           do
-            E = a[n + d++], e.head && E && e.length < 65536 && (e.head.comment += String.fromCharCode(E));
-          while (E && d < s);
-          if (e.flags & 512 && e.wrap & 4 && (e.check = crc32(e.check, a, d, n)), s -= d, n += d, E)
+            R = a[n + d++], e.head && R && e.length < 65536 && (e.head.comment += String.fromCharCode(R));
+          while (R && d < s);
+          if (e.flags & 512 && e.wrap & 4 && (e.check = crc32(e.check, a, d, n)), s -= d, n += d, R)
             break e;
         } else e.head && (e.head.comment = null);
         e.mode = HCRC;
       /* falls through */
       case HCRC:
         if (e.flags & 512) {
-          for (; c < 16; ) {
+          for (; l < 16; ) {
             if (s === 0)
               break e;
-            s--, i += a[n++] << c, c += 8;
+            s--, i += a[n++] << l, l += 8;
           }
           if (e.wrap & 4 && i !== (e.check & 65535)) {
             r.msg = "header crc mismatch", e.mode = BAD;
             break;
           }
-          i = 0, c = 0;
+          i = 0, l = 0;
         }
         e.head && (e.head.hcrc = e.flags >> 9 & 1, e.head.done = !0), r.adler = e.check = 0, e.mode = TYPE;
         break;
       case DICTID:
-        for (; c < 32; ) {
+        for (; l < 32; ) {
           if (s === 0)
             break e;
-          s--, i += a[n++] << c, c += 8;
+          s--, i += a[n++] << l, l += 8;
         }
-        r.adler = e.check = zswap32(i), i = 0, c = 0, e.mode = DICT;
+        r.adler = e.check = zswap32(i), i = 0, l = 0, e.mode = DICT;
       /* falls through */
       case DICT:
         if (e.havedict === 0)
-          return r.next_out = o, r.avail_out = u, r.next_in = n, r.avail_in = s, e.hold = i, e.bits = c, Z_NEED_DICT$1;
+          return r.next_out = o, r.avail_out = u, r.next_in = n, r.avail_in = s, e.hold = i, e.bits = l, Z_NEED_DICT$1;
         r.adler = e.check = 1, e.mode = TYPE;
       /* falls through */
       case TYPE:
@@ -554,21 +548,21 @@ const fixedtables = (r) => {
       /* falls through */
       case TYPEDO:
         if (e.last) {
-          i >>>= c & 7, c -= c & 7, e.mode = CHECK;
+          i >>>= l & 7, l -= l & 7, e.mode = CHECK;
           break;
         }
-        for (; c < 3; ) {
+        for (; l < 3; ) {
           if (s === 0)
             break e;
-          s--, i += a[n++] << c, c += 8;
+          s--, i += a[n++] << l, l += 8;
         }
-        switch (e.last = i & 1, i >>>= 1, c -= 1, i & 3) {
+        switch (e.last = i & 1, i >>>= 1, l -= 1, i & 3) {
           case 0:
             e.mode = STORED;
             break;
           case 1:
             if (fixedtables(e), e.mode = LEN_, t === Z_TREES) {
-              i >>>= 2, c -= 2;
+              i >>>= 2, l -= 2;
               break e;
             }
             break;
@@ -578,19 +572,19 @@ const fixedtables = (r) => {
           case 3:
             r.msg = "invalid block type", e.mode = BAD;
         }
-        i >>>= 2, c -= 2;
+        i >>>= 2, l -= 2;
         break;
       case STORED:
-        for (i >>>= c & 7, c -= c & 7; c < 32; ) {
+        for (i >>>= l & 7, l -= l & 7; l < 32; ) {
           if (s === 0)
             break e;
-          s--, i += a[n++] << c, c += 8;
+          s--, i += a[n++] << l, l += 8;
         }
         if ((i & 65535) !== (i >>> 16 ^ 65535)) {
           r.msg = "invalid stored block lengths", e.mode = BAD;
           break;
         }
-        if (e.length = i & 65535, i = 0, c = 0, e.mode = COPY_, t === Z_TREES)
+        if (e.length = i & 65535, i = 0, l = 0, e.mode = COPY_, t === Z_TREES)
           break e;
       /* falls through */
       case COPY_:
@@ -600,18 +594,18 @@ const fixedtables = (r) => {
         if (d = e.length, d) {
           if (d > s && (d = s), d > u && (d = u), d === 0)
             break e;
-          l.set(a.subarray(n, n + d), o), s -= d, n += d, u -= d, o += d, e.length -= d;
+          c.set(a.subarray(n, n + d), o), s -= d, n += d, u -= d, o += d, e.length -= d;
           break;
         }
         e.mode = TYPE;
         break;
       case TABLE:
-        for (; c < 14; ) {
+        for (; l < 14; ) {
           if (s === 0)
             break e;
-          s--, i += a[n++] << c, c += 8;
+          s--, i += a[n++] << l, l += 8;
         }
-        if (e.nlen = (i & 31) + 257, i >>>= 5, c -= 5, e.ndist = (i & 31) + 1, i >>>= 5, c -= 5, e.ncode = (i & 15) + 4, i >>>= 4, c -= 4, e.nlen > 286 || e.ndist > 30) {
+        if (e.nlen = (i & 31) + 257, i >>>= 5, l -= 5, e.ndist = (i & 31) + 1, i >>>= 5, l -= 5, e.ncode = (i & 15) + 4, i >>>= 4, l -= 4, e.nlen > 286 || e.ndist > 30) {
           r.msg = "too many length or distance symbols", e.mode = BAD;
           break;
         }
@@ -619,12 +613,12 @@ const fixedtables = (r) => {
       /* falls through */
       case LENLENS:
         for (; e.have < e.ncode; ) {
-          for (; c < 3; ) {
+          for (; l < 3; ) {
             if (s === 0)
               break e;
-            s--, i += a[n++] << c, c += 8;
+            s--, i += a[n++] << l, l += 8;
           }
-          e.lens[D[e.have++]] = i & 7, i >>>= 3, c -= 3;
+          e.lens[D[e.have++]] = i & 7, i >>>= 3, l -= 3;
         }
         for (; e.have < 19; )
           e.lens[D[e.have++]] = 0;
@@ -638,46 +632,46 @@ const fixedtables = (r) => {
       /* falls through */
       case CODELENS:
         for (; e.have < e.nlen + e.ndist; ) {
-          for (; T = e.lencode[i & (1 << e.lenbits) - 1], _ = T >>> 24, m = T >>> 16 & 255, b = T & 65535, !(_ <= c); ) {
+          for (; _ = e.lencode[i & (1 << e.lenbits) - 1], w = _ >>> 24, m = _ >>> 16 & 255, b = _ & 65535, !(w <= l); ) {
             if (s === 0)
               break e;
-            s--, i += a[n++] << c, c += 8;
+            s--, i += a[n++] << l, l += 8;
           }
           if (b < 16)
-            i >>>= _, c -= _, e.lens[e.have++] = b;
+            i >>>= w, l -= w, e.lens[e.have++] = b;
           else {
             if (b === 16) {
-              for (k = _ + 2; c < k; ) {
+              for (k = w + 2; l < k; ) {
                 if (s === 0)
                   break e;
-                s--, i += a[n++] << c, c += 8;
+                s--, i += a[n++] << l, l += 8;
               }
-              if (i >>>= _, c -= _, e.have === 0) {
+              if (i >>>= w, l -= w, e.have === 0) {
                 r.msg = "invalid bit length repeat", e.mode = BAD;
                 break;
               }
-              E = e.lens[e.have - 1], d = 3 + (i & 3), i >>>= 2, c -= 2;
+              R = e.lens[e.have - 1], d = 3 + (i & 3), i >>>= 2, l -= 2;
             } else if (b === 17) {
-              for (k = _ + 3; c < k; ) {
+              for (k = w + 3; l < k; ) {
                 if (s === 0)
                   break e;
-                s--, i += a[n++] << c, c += 8;
+                s--, i += a[n++] << l, l += 8;
               }
-              i >>>= _, c -= _, E = 0, d = 3 + (i & 7), i >>>= 3, c -= 3;
+              i >>>= w, l -= w, R = 0, d = 3 + (i & 7), i >>>= 3, l -= 3;
             } else {
-              for (k = _ + 7; c < k; ) {
+              for (k = w + 7; l < k; ) {
                 if (s === 0)
                   break e;
-                s--, i += a[n++] << c, c += 8;
+                s--, i += a[n++] << l, l += 8;
               }
-              i >>>= _, c -= _, E = 0, d = 11 + (i & 127), i >>>= 7, c -= 7;
+              i >>>= w, l -= w, R = 0, d = 11 + (i & 127), i >>>= 7, l -= 7;
             }
             if (e.have + d > e.nlen + e.ndist) {
               r.msg = "invalid bit length repeat", e.mode = BAD;
               break;
             }
             for (; d--; )
-              e.lens[e.have++] = E;
+              e.lens[e.have++] = R;
           }
         }
         if (e.mode === BAD)
@@ -715,23 +709,23 @@ const fixedtables = (r) => {
       /* falls through */
       case LEN:
         if (s >= 6 && u >= 258) {
-          r.next_out = o, r.avail_out = u, r.next_in = n, r.avail_in = s, e.hold = i, e.bits = c, inflate_fast(r, p), o = r.next_out, l = r.output, u = r.avail_out, n = r.next_in, a = r.input, s = r.avail_in, i = e.hold, c = e.bits, e.mode === TYPE && (e.back = -1);
+          r.next_out = o, r.avail_out = u, r.next_in = n, r.avail_in = s, e.hold = i, e.bits = l, inflate_fast(r, p), o = r.next_out, c = r.output, u = r.avail_out, n = r.next_in, a = r.input, s = r.avail_in, i = e.hold, l = e.bits, e.mode === TYPE && (e.back = -1);
           break;
         }
-        for (e.back = 0; T = e.lencode[i & (1 << e.lenbits) - 1], _ = T >>> 24, m = T >>> 16 & 255, b = T & 65535, !(_ <= c); ) {
+        for (e.back = 0; _ = e.lencode[i & (1 << e.lenbits) - 1], w = _ >>> 24, m = _ >>> 16 & 255, b = _ & 65535, !(w <= l); ) {
           if (s === 0)
             break e;
-          s--, i += a[n++] << c, c += 8;
+          s--, i += a[n++] << l, l += 8;
         }
         if (m && (m & 240) === 0) {
-          for (v = _, x = m, O = b; T = e.lencode[O + ((i & (1 << v + x) - 1) >> v)], _ = T >>> 24, m = T >>> 16 & 255, b = T & 65535, !(v + _ <= c); ) {
+          for (v = w, E = m, T = b; _ = e.lencode[T + ((i & (1 << v + E) - 1) >> v)], w = _ >>> 24, m = _ >>> 16 & 255, b = _ & 65535, !(v + w <= l); ) {
             if (s === 0)
               break e;
-            s--, i += a[n++] << c, c += 8;
+            s--, i += a[n++] << l, l += 8;
           }
-          i >>>= v, c -= v, e.back += v;
+          i >>>= v, l -= v, e.back += v;
         }
-        if (i >>>= _, c -= _, e.back += _, e.length = b, m === 0) {
+        if (i >>>= w, l -= w, e.back += w, e.length = b, m === 0) {
           e.mode = LIT;
           break;
         }
@@ -747,30 +741,30 @@ const fixedtables = (r) => {
       /* falls through */
       case LENEXT:
         if (e.extra) {
-          for (k = e.extra; c < k; ) {
+          for (k = e.extra; l < k; ) {
             if (s === 0)
               break e;
-            s--, i += a[n++] << c, c += 8;
+            s--, i += a[n++] << l, l += 8;
           }
-          e.length += i & (1 << e.extra) - 1, i >>>= e.extra, c -= e.extra, e.back += e.extra;
+          e.length += i & (1 << e.extra) - 1, i >>>= e.extra, l -= e.extra, e.back += e.extra;
         }
         e.was = e.length, e.mode = DIST;
       /* falls through */
       case DIST:
-        for (; T = e.distcode[i & (1 << e.distbits) - 1], _ = T >>> 24, m = T >>> 16 & 255, b = T & 65535, !(_ <= c); ) {
+        for (; _ = e.distcode[i & (1 << e.distbits) - 1], w = _ >>> 24, m = _ >>> 16 & 255, b = _ & 65535, !(w <= l); ) {
           if (s === 0)
             break e;
-          s--, i += a[n++] << c, c += 8;
+          s--, i += a[n++] << l, l += 8;
         }
         if ((m & 240) === 0) {
-          for (v = _, x = m, O = b; T = e.distcode[O + ((i & (1 << v + x) - 1) >> v)], _ = T >>> 24, m = T >>> 16 & 255, b = T & 65535, !(v + _ <= c); ) {
+          for (v = w, E = m, T = b; _ = e.distcode[T + ((i & (1 << v + E) - 1) >> v)], w = _ >>> 24, m = _ >>> 16 & 255, b = _ & 65535, !(v + w <= l); ) {
             if (s === 0)
               break e;
-            s--, i += a[n++] << c, c += 8;
+            s--, i += a[n++] << l, l += 8;
           }
-          i >>>= v, c -= v, e.back += v;
+          i >>>= v, l -= v, e.back += v;
         }
-        if (i >>>= _, c -= _, e.back += _, m & 64) {
+        if (i >>>= w, l -= w, e.back += w, m & 64) {
           r.msg = "invalid distance code", e.mode = BAD;
           break;
         }
@@ -778,12 +772,12 @@ const fixedtables = (r) => {
       /* falls through */
       case DISTEXT:
         if (e.extra) {
-          for (k = e.extra; c < k; ) {
+          for (k = e.extra; l < k; ) {
             if (s === 0)
               break e;
-            s--, i += a[n++] << c, c += 8;
+            s--, i += a[n++] << l, l += 8;
           }
-          e.offset += i & (1 << e.extra) - 1, i >>>= e.extra, c -= e.extra, e.back += e.extra;
+          e.offset += i & (1 << e.extra) - 1, i >>>= e.extra, l -= e.extra, e.back += e.extra;
         }
         if (e.offset > e.dmax) {
           r.msg = "invalid distance too far back", e.mode = BAD;
@@ -801,46 +795,46 @@ const fixedtables = (r) => {
           }
           d > e.wnext ? (d -= e.wnext, y = e.wsize - d) : y = e.wnext - d, d > e.length && (d = e.length), g = e.window;
         } else
-          g = l, y = o - e.offset, d = e.length;
+          g = c, y = o - e.offset, d = e.length;
         d > u && (d = u), u -= d, e.length -= d;
         do
-          l[o++] = g[y++];
+          c[o++] = g[y++];
         while (--d);
         e.length === 0 && (e.mode = LEN);
         break;
       case LIT:
         if (u === 0)
           break e;
-        l[o++] = e.length, u--, e.mode = LEN;
+        c[o++] = e.length, u--, e.mode = LEN;
         break;
       case CHECK:
         if (e.wrap) {
-          for (; c < 32; ) {
+          for (; l < 32; ) {
             if (s === 0)
               break e;
-            s--, i |= a[n++] << c, c += 8;
+            s--, i |= a[n++] << l, l += 8;
           }
           if (p -= u, r.total_out += p, e.total += p, e.wrap & 4 && p && (r.adler = e.check = /*UPDATE_CHECK(state.check, put - _out, _out);*/
-          e.flags ? crc32(e.check, l, p, o - p) : adler32(e.check, l, p, o - p)), p = u, e.wrap & 4 && (e.flags ? i : zswap32(i)) !== e.check) {
+          e.flags ? crc32(e.check, c, p, o - p) : adler32(e.check, c, p, o - p)), p = u, e.wrap & 4 && (e.flags ? i : zswap32(i)) !== e.check) {
             r.msg = "incorrect data check", e.mode = BAD;
             break;
           }
-          i = 0, c = 0;
+          i = 0, l = 0;
         }
         e.mode = LENGTH;
       /* falls through */
       case LENGTH:
         if (e.wrap && e.flags) {
-          for (; c < 32; ) {
+          for (; l < 32; ) {
             if (s === 0)
               break e;
-            s--, i += a[n++] << c, c += 8;
+            s--, i += a[n++] << l, l += 8;
           }
           if (e.wrap & 4 && i !== (e.total & 4294967295)) {
             r.msg = "incorrect length check", e.mode = BAD;
             break;
           }
-          i = 0, c = 0;
+          i = 0, l = 0;
         }
         e.mode = DONE;
       /* falls through */
@@ -857,8 +851,8 @@ const fixedtables = (r) => {
       default:
         return Z_STREAM_ERROR$1;
     }
-  return r.next_out = o, r.avail_out = u, r.next_in = n, r.avail_in = s, e.hold = i, e.bits = c, (e.wsize || p !== r.avail_out && e.mode < BAD && (e.mode < CHECK || t !== Z_FINISH$1)) && updatewindow(r, r.output, r.next_out, p - r.avail_out), h -= r.avail_in, p -= r.avail_out, r.total_in += h, r.total_out += p, e.total += p, e.wrap & 4 && p && (r.adler = e.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
-  e.flags ? crc32(e.check, l, p, r.next_out - p) : adler32(e.check, l, p, r.next_out - p)), r.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === TYPE ? 128 : 0) + (e.mode === LEN_ || e.mode === COPY_ ? 256 : 0), (h === 0 && p === 0 || t === Z_FINISH$1) && q === Z_OK$1 && (q = Z_BUF_ERROR), q;
+  return r.next_out = o, r.avail_out = u, r.next_in = n, r.avail_in = s, e.hold = i, e.bits = l, (e.wsize || p !== r.avail_out && e.mode < BAD && (e.mode < CHECK || t !== Z_FINISH$1)) && updatewindow(r, r.output, r.next_out, p - r.avail_out), h -= r.avail_in, p -= r.avail_out, r.total_in += h, r.total_out += p, e.total += p, e.wrap & 4 && p && (r.adler = e.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
+  e.flags ? crc32(e.check, c, p, r.next_out - p) : adler32(e.check, c, p, r.next_out - p)), r.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === TYPE ? 128 : 0) + (e.mode === LEN_ || e.mode === COPY_ ? 256 : 0), (h === 0 && p === 0 || t === Z_FINISH$1) && q === Z_OK$1 && (q = Z_BUF_ERROR), q;
 }, inflateEnd = (r) => {
   if (inflateStateCheck(r))
     return Z_STREAM_ERROR$1;
@@ -871,8 +865,8 @@ const fixedtables = (r) => {
   return (e.wrap & 2) === 0 ? Z_STREAM_ERROR$1 : (e.head = t, t.done = !1, Z_OK$1);
 }, inflateSetDictionary = (r, t) => {
   const e = t.length;
-  let a, l, n;
-  return inflateStateCheck(r) || (a = r.state, a.wrap !== 0 && a.mode !== DICT) ? Z_STREAM_ERROR$1 : a.mode === DICT && (l = 1, l = adler32(l, t, e, 0), l !== a.check) ? Z_DATA_ERROR$1 : (n = updatewindow(r, t, e, e), n ? (a.mode = MEM, Z_MEM_ERROR$1) : (a.havedict = 1, Z_OK$1));
+  let a, c, n;
+  return inflateStateCheck(r) || (a = r.state, a.wrap !== 0 && a.mode !== DICT) ? Z_STREAM_ERROR$1 : a.mode === DICT && (c = 1, c = adler32(c, t, e, 0), c !== a.check) ? Z_DATA_ERROR$1 : (n = updatewindow(r, t, e, e), n ? (a.mode = MEM, Z_MEM_ERROR$1) : (a.havedict = 1, Z_OK$1));
 };
 inflate$2.inflateReset = inflateReset;
 inflate$2.inflateReset2 = inflateReset2;
@@ -901,12 +895,12 @@ common$1.assign = function(r) {
 };
 common$1.flattenChunks = (r) => {
   let t = 0;
-  for (let a = 0, l = r.length; a < l; a++)
+  for (let a = 0, c = r.length; a < c; a++)
     t += r[a].length;
   const e = new Uint8Array(t);
-  for (let a = 0, l = 0, n = r.length; a < n; a++) {
+  for (let a = 0, c = 0, n = r.length; a < n; a++) {
     let o = r[a];
-    e.set(o, l), l += o.length;
+    e.set(o, c), c += o.length;
   }
   return e;
 };
@@ -924,11 +918,11 @@ _utf8len[254] = _utf8len[254] = 1;
 strings$1.string2buf = (r) => {
   if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
     return new TextEncoder().encode(r);
-  let t, e, a, l, n, o = r.length, s = 0;
-  for (l = 0; l < o; l++)
-    e = r.charCodeAt(l), (e & 64512) === 55296 && l + 1 < o && (a = r.charCodeAt(l + 1), (a & 64512) === 56320 && (e = 65536 + (e - 55296 << 10) + (a - 56320), l++)), s += e < 128 ? 1 : e < 2048 ? 2 : e < 65536 ? 3 : 4;
-  for (t = new Uint8Array(s), n = 0, l = 0; n < s; l++)
-    e = r.charCodeAt(l), (e & 64512) === 55296 && l + 1 < o && (a = r.charCodeAt(l + 1), (a & 64512) === 56320 && (e = 65536 + (e - 55296 << 10) + (a - 56320), l++)), e < 128 ? t[n++] = e : e < 2048 ? (t[n++] = 192 | e >>> 6, t[n++] = 128 | e & 63) : e < 65536 ? (t[n++] = 224 | e >>> 12, t[n++] = 128 | e >>> 6 & 63, t[n++] = 128 | e & 63) : (t[n++] = 240 | e >>> 18, t[n++] = 128 | e >>> 12 & 63, t[n++] = 128 | e >>> 6 & 63, t[n++] = 128 | e & 63);
+  let t, e, a, c, n, o = r.length, s = 0;
+  for (c = 0; c < o; c++)
+    e = r.charCodeAt(c), (e & 64512) === 55296 && c + 1 < o && (a = r.charCodeAt(c + 1), (a & 64512) === 56320 && (e = 65536 + (e - 55296 << 10) + (a - 56320), c++)), s += e < 128 ? 1 : e < 2048 ? 2 : e < 65536 ? 3 : 4;
+  for (t = new Uint8Array(s), n = 0, c = 0; n < s; c++)
+    e = r.charCodeAt(c), (e & 64512) === 55296 && c + 1 < o && (a = r.charCodeAt(c + 1), (a & 64512) === 56320 && (e = 65536 + (e - 55296 << 10) + (a - 56320), c++)), e < 128 ? t[n++] = e : e < 2048 ? (t[n++] = 192 | e >>> 6, t[n++] = 128 | e & 63) : e < 65536 ? (t[n++] = 224 | e >>> 12, t[n++] = 128 | e >>> 6 & 63, t[n++] = 128 | e & 63) : (t[n++] = 240 | e >>> 18, t[n++] = 128 | e >>> 12 & 63, t[n++] = 128 | e >>> 6 & 63, t[n++] = 128 | e & 63);
   return t;
 };
 const buf2binstring = (r, t) => {
@@ -943,28 +937,28 @@ strings$1.buf2string = (r, t) => {
   const e = t || r.length;
   if (typeof TextDecoder == "function" && TextDecoder.prototype.decode)
     return new TextDecoder().decode(r.subarray(0, t));
-  let a, l;
+  let a, c;
   const n = new Array(e * 2);
-  for (l = 0, a = 0; a < e; ) {
+  for (c = 0, a = 0; a < e; ) {
     let o = r[a++];
     if (o < 128) {
-      n[l++] = o;
+      n[c++] = o;
       continue;
     }
     let s = _utf8len[o];
     if (s > 4) {
-      n[l++] = 65533, a += s - 1;
+      n[c++] = 65533, a += s - 1;
       continue;
     }
     for (o &= s === 2 ? 31 : s === 3 ? 15 : 7; s > 1 && a < e; )
       o = o << 6 | r[a++] & 63, s--;
     if (s > 1) {
-      n[l++] = 65533;
+      n[c++] = 65533;
       continue;
     }
-    o < 65536 ? n[l++] = o : (o -= 65536, n[l++] = 55296 | o >> 10 & 1023, n[l++] = 56320 | o & 1023);
+    o < 65536 ? n[c++] = o : (o -= 65536, n[c++] = 55296 | o >> 10 & 1023, n[c++] = 56320 | o & 1023);
   }
-  return buf2binstring(n, l);
+  return buf2binstring(n, c);
 };
 strings$1.utf8border = (r, t) => {
   t = t || r.length, t > r.length && (t = r.length);
@@ -1028,11 +1022,11 @@ function Inflate(r) {
     throw new Error(msg[e]);
 }
 Inflate.prototype.push = function(r, t) {
-  const e = this.strm, a = this.options.chunkSize, l = this.options.dictionary;
+  const e = this.strm, a = this.options.chunkSize, c = this.options.dictionary;
   let n, o, s;
   if (this.ended) return !1;
   for (t === ~~t ? o = t : o = t === !0 ? Z_FINISH : Z_NO_FLUSH, toString.call(r) === "[object ArrayBuffer]" ? e.input = new Uint8Array(r) : e.input = r, e.next_in = 0, e.avail_in = e.input.length; ; ) {
-    for (e.avail_out === 0 && (e.output = new Uint8Array(a), e.next_out = 0, e.avail_out = a), n = zlib_inflate.inflate(e, o), n === Z_NEED_DICT && l && (n = zlib_inflate.inflateSetDictionary(e, l), n === Z_OK ? n = zlib_inflate.inflate(e, o) : n === Z_DATA_ERROR && (n = Z_NEED_DICT)); e.avail_in > 0 && n === Z_STREAM_END && e.state.wrap > 0 && r[e.next_in] !== 0; )
+    for (e.avail_out === 0 && (e.output = new Uint8Array(a), e.next_out = 0, e.avail_out = a), n = zlib_inflate.inflate(e, o), n === Z_NEED_DICT && c && (n = zlib_inflate.inflateSetDictionary(e, c), n === Z_OK ? n = zlib_inflate.inflate(e, o) : n === Z_DATA_ERROR && (n = Z_NEED_DICT)); e.avail_in > 0 && n === Z_STREAM_END && e.state.wrap > 0 && r[e.next_in] !== 0; )
       zlib_inflate.inflateReset(e), n = zlib_inflate.inflate(e, o);
     switch (n) {
       case Z_STREAM_ERROR:
@@ -1043,8 +1037,8 @@ Inflate.prototype.push = function(r, t) {
     }
     if (s = e.avail_out, e.next_out && (e.avail_out === 0 || n === Z_STREAM_END))
       if (this.options.to === "string") {
-        let u = strings.utf8border(e.output, e.next_out), i = e.next_out - u, c = strings.buf2string(e.output, u);
-        e.next_out = i, e.avail_out = a - i, i && e.output.set(e.output.subarray(u, u + i), 0), this.onData(c);
+        let u = strings.utf8border(e.output, e.next_out), i = e.next_out - u, l = strings.buf2string(e.output, u);
+        e.next_out = i, e.avail_out = a - i, i && e.output.set(e.output.subarray(u, u + i), 0), this.onData(l);
       } else
         this.onData(
           e.output.length === e.next_out ? e.output : e.output.subarray(0, e.next_out)
@@ -1069,14 +1063,14 @@ function inflate(r, t) {
   return e.result;
 }
 var inflate_2 = inflate;
-function f(r, t, e, a, l, n) {
-  let o = r.tileXYToRectangle(e, a, l);
+function f(r, t, e, a, c, n) {
+  let o = r.tileXYToRectangle(e, a, c);
   return defined(Rectangle.intersection(o, t, n));
 }
 class GeoTerrainProvider {
   constructor(t) {
-    if (t = defaultValue(t, {}), !defined(t.url)) throw new DeveloperError("options.url is required.");
-    this._dataType = defaultValue(t.dataType, "int"), this._tileType = defaultValue(t.tileType, "heightmap"), this._url = t.url, this._maxTerrainLevel = defaultValue(t.dataType, "int"), this._subdomains = t.subdomains, this._token = t.token, this.init(t);
+    if (t = t ?? {}, !defined(t.url)) throw new DeveloperError("options.url is required.");
+    this._dataType = t.dataType ?? "int", this._tileType = t.tileType ?? "heightmap", this._url = t.url, this._maxTerrainLevel = t.dataType ?? "int", this._subdomains = t.subdomains, this._token = t.token, this.init(t);
   }
   get credit() {
     return this._credit;
@@ -1109,16 +1103,16 @@ class GeoTerrainProvider {
     };
     const e = t.credit;
     typeof e == "string" && (this._credit = new Credit(e)), this._rectangles = [];
-    const a = defaultValue(t.ellipsoid, Ellipsoid.WGS84);
+    const a = t.ellipsoid ?? Ellipsoid.WGS84;
     this._tilingScheme = new GeographicTilingScheme({
       ellipsoid: a
     }), this._heightmapWidth = 64, this._heightmapHeight = 64, this._levelZeroMaximumGeometricError = TerrainProvider.getEstimatedLevelZeroGeometricErrorForAHeightmap(
       a,
       Math.min(this._heightmapWidth, this._heightmapHeight),
       this._tilingScheme.getNumberOfXTilesAtLevel(0)
-    ), this._ready = !0, this._topLevel = defaultValue(t.topLevel, 5), this._bottomLevel = defaultValue(t.bottomLevel, 25);
+    ), this._ready = !0, this._topLevel = t.topLevel ?? 5, this._bottomLevel = t.bottomLevel ?? 25;
   }
-  requestTileGeometry(t, e, a, l) {
+  requestTileGeometry(t, e, a, c) {
     if (!this.ready)
       throw new DeveloperError("requestTileGeometry must not be called before ready returns true.");
     if (a >= this._bottomLevel) return Promise.reject(`${a}该级别不发送请求!`);
@@ -1136,7 +1130,7 @@ class GeoTerrainProvider {
     Array.isArray(this._subdomains) && this._subdomains.length && (n = this._subdomains[(t + e) % this._subdomains.length], o = o.replace("{s}", n)), o = o.replace("{token}", this._token).replace("{x}", t).replace("{y}", e).replace("{z}", a + 1);
     const s = Resource.fetchArrayBuffer({
       url: o,
-      request: l
+      request: c
     });
     if (s)
       return s.then((u) => u.byteLength < 1e3 ? Promise.reject("无效数据") : inflate_2(u)).then((u) => {
@@ -1163,12 +1157,12 @@ class GeoTerrainProvider {
     this._dataType === "int" ? e = 2 : this._dataType === "float" && (e = 4);
     let a = t;
     if (a.length !== 22500 * e) return null;
-    let l, n, o, s, u = new ArrayBuffer(e), i = new DataView(u), c = this._heightmapWidth, h = this._heightmapHeight, p = new Uint8Array(c * h * 4);
+    let c, n, o, s, u = new ArrayBuffer(e), i = new DataView(u), l = this._heightmapWidth, h = this._heightmapHeight, p = new Uint8Array(l * h * 4);
     for (let d = 0; d < h; d++)
-      for (let y = 0; y < c; y++) {
-        o = parseInt(149 * d / (h - 1)), s = parseInt(149 * y / (c - 1)), n = e * (150 * o + s), e === 4 ? (i.setInt8(0, a[n]), i.setInt8(1, a[n + 1]), i.setInt8(2, a[n + 2]), i.setInt8(3, a[n + 3]), l = i.getFloat32(0, !0)) : l = a[n] + 256 * a[n + 1], (1e4 < l || l < -2e3) && (l = 0);
-        let g = (l + 1e3) / 1e-3, T = 4 * (d * c + y);
-        p[T] = g / 65536, p[1 + T] = (g - 256 * p[T] * 256) / 256, p[2 + T] = g - 256 * p[T] * 256 - 256 * p[1 + T], p[3 + T] = 255;
+      for (let y = 0; y < l; y++) {
+        o = parseInt(149 * d / (h - 1)), s = parseInt(149 * y / (l - 1)), n = e * (150 * o + s), e === 4 ? (i.setInt8(0, a[n]), i.setInt8(1, a[n + 1]), i.setInt8(2, a[n + 2]), i.setInt8(3, a[n + 3]), c = i.getFloat32(0, !0)) : c = a[n] + 256 * a[n + 1], (1e4 < c || c < -2e3) && (c = 0);
+        let g = (c + 1e3) / 1e-3, _ = 4 * (d * l + y);
+        p[_] = g / 65536, p[1 + _] = (g - 256 * p[_] * 256) / 256, p[2 + _] = g - 256 * p[_] * 256 - 256 * p[1 + _], p[3 + _] = 255;
       }
     return p;
   }
@@ -1183,12 +1177,12 @@ class GeoTerrainProvider {
     return t;
   }
   getChildTileMask(t, e, a) {
-    let l = new Rectangle(), n = this._tilingScheme, o = this._rectangles, s = n.tileXYToRectangle(t, e, a), u = 0;
+    let c = new Rectangle(), n = this._tilingScheme, o = this._rectangles, s = n.tileXYToRectangle(t, e, a), u = 0;
     for (let i = 0; i < o.length && u !== 15; ++i) {
-      let c = o[i];
-      if (!(c.maxLevel <= a)) {
-        let h = c.rectangle, p = Rectangle.intersection(h, s, l);
-        defined(p) && (f(n, h, 2 * t, 2 * e, a + 1, l) && (u |= 4), f(n, h, 2 * t + 1, 2 * e, a + 1, l) && (u |= 8), f(n, h, 2 * t, 2 * e + 1, a + 1, l) && (u |= 1), f(n, h, 2 * t + 1, 2 * e + 1, a + 1, l) && (u |= 2));
+      let l = o[i];
+      if (!(l.maxLevel <= a)) {
+        let h = l.rectangle, p = Rectangle.intersection(h, s, c);
+        defined(p) && (f(n, h, 2 * t, 2 * e, a + 1, c) && (u |= 4), f(n, h, 2 * t + 1, 2 * e, a + 1, c) && (u |= 8), f(n, h, 2 * t, 2 * e + 1, a + 1, c) && (u |= 1), f(n, h, 2 * t + 1, 2 * e + 1, a + 1, c) && (u |= 2));
       }
     }
     return u;
@@ -1199,9 +1193,9 @@ function requireAspromise() {
   if (hasRequiredAspromise) return aspromise;
   hasRequiredAspromise = 1, aspromise = r;
   function r(t, e) {
-    for (var a = new Array(arguments.length - 1), l = 0, n = 2, o = !0; n < arguments.length; ) a[l++] = arguments[n++];
+    for (var a = new Array(arguments.length - 1), c = 0, n = 2, o = !0; n < arguments.length; ) a[c++] = arguments[n++];
     return new Promise(function(u, i) {
-      a[l] = function(h) {
+      a[c] = function(h) {
         if (o)
           if (o = !1, h) i(h);
           else {
@@ -1211,8 +1205,8 @@ function requireAspromise() {
       };
       try {
         t.apply(e || null, a);
-      } catch (c) {
-        o && (o = !1, i(c));
+      } catch (l) {
+        o && (o = !1, i(l));
       }
     });
   }
@@ -1228,10 +1222,10 @@ function requireBase64() {
       for (var i = 0; --u % 4 > 1 && s.charAt(u) === "="; ) ++i;
       return Math.ceil(s.length * 3) / 4 - i;
     };
-    for (var e = new Array(64), a = new Array(123), l = 0; l < 64; )
-      a[e[l] = l < 26 ? l + 65 : l < 52 ? l + 71 : l < 62 ? l - 4 : l - 59 | 43] = l++;
+    for (var e = new Array(64), a = new Array(123), c = 0; c < 64; )
+      a[e[c] = c < 26 ? c + 65 : c < 52 ? c + 71 : c < 62 ? c - 4 : c - 59 | 43] = c++;
     t.encode = function(s, u, i) {
-      for (var c = null, h = [], p = 0, d = 0, y; u < i; ) {
+      for (var l = null, h = [], p = 0, d = 0, y; u < i; ) {
         var g = s[u++];
         switch (d) {
           case 0:
@@ -1244,13 +1238,13 @@ function requireBase64() {
             h[p++] = e[y | g >> 6], h[p++] = e[g & 63], d = 0;
             break;
         }
-        p > 8191 && ((c || (c = [])).push(String.fromCharCode.apply(String, h)), p = 0);
+        p > 8191 && ((l || (l = [])).push(String.fromCharCode.apply(String, h)), p = 0);
       }
-      return d && (h[p++] = e[y], h[p++] = 61, d === 1 && (h[p++] = 61)), c ? (p && c.push(String.fromCharCode.apply(String, h.slice(0, p))), c.join("")) : String.fromCharCode.apply(String, h.slice(0, p));
+      return d && (h[p++] = e[y], h[p++] = 61, d === 1 && (h[p++] = 61)), l ? (p && l.push(String.fromCharCode.apply(String, h.slice(0, p))), l.join("")) : String.fromCharCode.apply(String, h.slice(0, p));
     };
     var n = "invalid encoding";
     t.decode = function(s, u, i) {
-      for (var c = i, h = 0, p, d = 0; d < s.length; ) {
+      for (var l = i, h = 0, p, d = 0; d < s.length; ) {
         var y = s.charCodeAt(d++);
         if (y === 61 && h > 1) break;
         if ((y = a[y]) === void 0) throw Error(n);
@@ -1270,7 +1264,7 @@ function requireBase64() {
         }
       }
       if (h === 1) throw Error(n);
-      return i - c;
+      return i - l;
     }, t.test = function(s) {
       return /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(s);
     };
@@ -1283,23 +1277,23 @@ function requireEventemitter() {
   function r() {
     this._listeners = {};
   }
-  return r.prototype.on = function(e, a, l) {
+  return r.prototype.on = function(e, a, c) {
     return (this._listeners[e] || (this._listeners[e] = [])).push({
       fn: a,
-      ctx: l || this
+      ctx: c || this
     }), this;
   }, r.prototype.off = function(e, a) {
     if (e === void 0) this._listeners = {};
     else if (a === void 0) this._listeners[e] = [];
     else
-      for (var l = this._listeners[e], n = 0; n < l.length; )
-        l[n].fn === a ? l.splice(n, 1) : ++n;
+      for (var c = this._listeners[e], n = 0; n < c.length; )
+        c[n].fn === a ? c.splice(n, 1) : ++n;
     return this;
   }, r.prototype.emit = function(e) {
     var a = this._listeners[e];
     if (a) {
-      for (var l = [], n = 1; n < arguments.length; ) l.push(arguments[n++]);
-      for (n = 0; n < a.length; ) a[n].fn.apply(a[n++].ctx, l);
+      for (var c = [], n = 1; n < arguments.length; ) c.push(arguments[n++]);
+      for (n = 0; n < a.length; ) a[n].fn.apply(a[n++].ctx, c);
     }
     return this;
   }, eventemitter;
@@ -1314,10 +1308,10 @@ function requireFloat() {
       function i(d, y, g) {
         o[0] = d, y[g] = s[0], y[g + 1] = s[1], y[g + 2] = s[2], y[g + 3] = s[3];
       }
-      function c(d, y, g) {
+      function l(d, y, g) {
         o[0] = d, y[g] = s[3], y[g + 1] = s[2], y[g + 2] = s[1], y[g + 3] = s[0];
       }
-      n.writeFloatLE = u ? i : c, n.writeFloatBE = u ? c : i;
+      n.writeFloatLE = u ? i : l, n.writeFloatBE = u ? l : i;
       function h(d, y) {
         return s[0] = d[y], s[1] = d[y + 1], s[2] = d[y + 2], s[3] = d[y + 3], o[0];
       }
@@ -1326,7 +1320,7 @@ function requireFloat() {
       }
       n.readFloatLE = u ? h : p, n.readFloatBE = u ? p : h;
     }() : function() {
-      function o(u, i, c, h) {
+      function o(u, i, l, h) {
         var p = i < 0 ? 1 : 0;
         if (p && (i = -i), i === 0)
           u(1 / i > 0 ? (
@@ -1335,32 +1329,32 @@ function requireFloat() {
           ) : (
             /* negative 0 */
             2147483648
-          ), c, h);
-        else if (isNaN(i)) u(2143289344, c, h);
+          ), l, h);
+        else if (isNaN(i)) u(2143289344, l, h);
         else if (i > 34028234663852886e22)
-          u((p << 31 | 2139095040) >>> 0, c, h);
+          u((p << 31 | 2139095040) >>> 0, l, h);
         else if (i < 11754943508222875e-54)
-          u((p << 31 | Math.round(i / 1401298464324817e-60)) >>> 0, c, h);
+          u((p << 31 | Math.round(i / 1401298464324817e-60)) >>> 0, l, h);
         else {
           var d = Math.floor(Math.log(i) / Math.LN2), y = Math.round(i * Math.pow(2, -d) * 8388608) & 8388607;
-          u((p << 31 | d + 127 << 23 | y) >>> 0, c, h);
+          u((p << 31 | d + 127 << 23 | y) >>> 0, l, h);
         }
       }
       n.writeFloatLE = o.bind(null, t), n.writeFloatBE = o.bind(null, e);
-      function s(u, i, c) {
-        var h = u(i, c), p = (h >> 31) * 2 + 1, d = h >>> 23 & 255, y = h & 8388607;
+      function s(u, i, l) {
+        var h = u(i, l), p = (h >> 31) * 2 + 1, d = h >>> 23 & 255, y = h & 8388607;
         return d === 255 ? y ? NaN : p * (1 / 0) : d === 0 ? p * 1401298464324817e-60 * y : p * Math.pow(2, d - 150) * (y + 8388608);
       }
-      n.readFloatLE = s.bind(null, a), n.readFloatBE = s.bind(null, l);
+      n.readFloatLE = s.bind(null, a), n.readFloatBE = s.bind(null, c);
     }(), typeof Float64Array < "u" ? function() {
       var o = new Float64Array([-0]), s = new Uint8Array(o.buffer), u = s[7] === 128;
       function i(d, y, g) {
         o[0] = d, y[g] = s[0], y[g + 1] = s[1], y[g + 2] = s[2], y[g + 3] = s[3], y[g + 4] = s[4], y[g + 5] = s[5], y[g + 6] = s[6], y[g + 7] = s[7];
       }
-      function c(d, y, g) {
+      function l(d, y, g) {
         o[0] = d, y[g] = s[7], y[g + 1] = s[6], y[g + 2] = s[5], y[g + 3] = s[4], y[g + 4] = s[3], y[g + 5] = s[2], y[g + 6] = s[1], y[g + 7] = s[0];
       }
-      n.writeDoubleLE = u ? i : c, n.writeDoubleBE = u ? c : i;
+      n.writeDoubleLE = u ? i : l, n.writeDoubleBE = u ? l : i;
       function h(d, y) {
         return s[0] = d[y], s[1] = d[y + 1], s[2] = d[y + 2], s[3] = d[y + 3], s[4] = d[y + 4], s[5] = d[y + 5], s[6] = d[y + 6], s[7] = d[y + 7], o[0];
       }
@@ -1369,7 +1363,7 @@ function requireFloat() {
       }
       n.readDoubleLE = u ? h : p, n.readDoubleBE = u ? p : h;
     }() : function() {
-      function o(u, i, c, h, p, d) {
+      function o(u, i, l, h, p, d) {
         var y = h < 0 ? 1 : 0;
         if (y && (h = -h), h === 0)
           u(0, p, d + i), u(1 / h > 0 ? (
@@ -1378,31 +1372,31 @@ function requireFloat() {
           ) : (
             /* negative 0 */
             2147483648
-          ), p, d + c);
+          ), p, d + l);
         else if (isNaN(h))
-          u(0, p, d + i), u(2146959360, p, d + c);
+          u(0, p, d + i), u(2146959360, p, d + l);
         else if (h > 17976931348623157e292)
-          u(0, p, d + i), u((y << 31 | 2146435072) >>> 0, p, d + c);
+          u(0, p, d + i), u((y << 31 | 2146435072) >>> 0, p, d + l);
         else {
           var g;
           if (h < 22250738585072014e-324)
-            g = h / 5e-324, u(g >>> 0, p, d + i), u((y << 31 | g / 4294967296) >>> 0, p, d + c);
+            g = h / 5e-324, u(g >>> 0, p, d + i), u((y << 31 | g / 4294967296) >>> 0, p, d + l);
           else {
-            var T = Math.floor(Math.log(h) / Math.LN2);
-            T === 1024 && (T = 1023), g = h * Math.pow(2, -T), u(g * 4503599627370496 >>> 0, p, d + i), u(
-              (y << 31 | T + 1023 << 20 | g * 1048576 & 1048575) >>> 0,
+            var _ = Math.floor(Math.log(h) / Math.LN2);
+            _ === 1024 && (_ = 1023), g = h * Math.pow(2, -_), u(g * 4503599627370496 >>> 0, p, d + i), u(
+              (y << 31 | _ + 1023 << 20 | g * 1048576 & 1048575) >>> 0,
               p,
-              d + c
+              d + l
             );
           }
         }
       }
       n.writeDoubleLE = o.bind(null, t, 0, 4), n.writeDoubleBE = o.bind(null, e, 4, 0);
-      function s(u, i, c, h, p) {
-        var d = u(h, p + i), y = u(h, p + c), g = (y >> 31) * 2 + 1, T = y >>> 20 & 2047, _ = 4294967296 * (y & 1048575) + d;
-        return T === 2047 ? _ ? NaN : g * (1 / 0) : T === 0 ? g * 5e-324 * _ : g * Math.pow(2, T - 1075) * (_ + 4503599627370496);
+      function s(u, i, l, h, p) {
+        var d = u(h, p + i), y = u(h, p + l), g = (y >> 31) * 2 + 1, _ = y >>> 20 & 2047, w = 4294967296 * (y & 1048575) + d;
+        return _ === 2047 ? w ? NaN : g * (1 / 0) : _ === 0 ? g * 5e-324 * w : g * Math.pow(2, _ - 1075) * (w + 4503599627370496);
       }
-      n.readDoubleLE = s.bind(null, a, 0, 4), n.readDoubleBE = s.bind(null, l, 4, 0);
+      n.readDoubleLE = s.bind(null, a, 0, 4), n.readDoubleBE = s.bind(null, c, 4, 0);
     }(), n;
   }
   function t(n, o, s) {
@@ -1414,7 +1408,7 @@ function requireFloat() {
   function a(n, o) {
     return (n[o] | n[o + 1] << 8 | n[o + 2] << 16 | n[o + 3] << 24) >>> 0;
   }
-  function l(n, o) {
+  function c(n, o) {
     return (n[o] << 24 | n[o + 1] << 16 | n[o + 2] << 8 | n[o + 3]) >>> 0;
   }
   return float;
@@ -1438,18 +1432,18 @@ function requireUtf8() {
   return hasRequiredUtf8 || (hasRequiredUtf8 = 1, function(r) {
     var t = r;
     t.length = function(a) {
-      for (var l = 0, n = 0, o = 0; o < a.length; ++o)
-        n = a.charCodeAt(o), n < 128 ? l += 1 : n < 2048 ? l += 2 : (n & 64512) === 55296 && (a.charCodeAt(o + 1) & 64512) === 56320 ? (++o, l += 4) : l += 3;
-      return l;
-    }, t.read = function(a, l, n) {
-      var o = n - l;
+      for (var c = 0, n = 0, o = 0; o < a.length; ++o)
+        n = a.charCodeAt(o), n < 128 ? c += 1 : n < 2048 ? c += 2 : (n & 64512) === 55296 && (a.charCodeAt(o + 1) & 64512) === 56320 ? (++o, c += 4) : c += 3;
+      return c;
+    }, t.read = function(a, c, n) {
+      var o = n - c;
       if (o < 1) return "";
-      for (var s = null, u = [], i = 0, c; l < n; )
-        c = a[l++], c < 128 ? u[i++] = c : c > 191 && c < 224 ? u[i++] = (c & 31) << 6 | a[l++] & 63 : c > 239 && c < 365 ? (c = ((c & 7) << 18 | (a[l++] & 63) << 12 | (a[l++] & 63) << 6 | a[l++] & 63) - 65536, u[i++] = 55296 + (c >> 10), u[i++] = 56320 + (c & 1023)) : u[i++] = (c & 15) << 12 | (a[l++] & 63) << 6 | a[l++] & 63, i > 8191 && ((s || (s = [])).push(String.fromCharCode.apply(String, u)), i = 0);
+      for (var s = null, u = [], i = 0, l; c < n; )
+        l = a[c++], l < 128 ? u[i++] = l : l > 191 && l < 224 ? u[i++] = (l & 31) << 6 | a[c++] & 63 : l > 239 && l < 365 ? (l = ((l & 7) << 18 | (a[c++] & 63) << 12 | (a[c++] & 63) << 6 | a[c++] & 63) - 65536, u[i++] = 55296 + (l >> 10), u[i++] = 56320 + (l & 1023)) : u[i++] = (l & 15) << 12 | (a[c++] & 63) << 6 | a[c++] & 63, i > 8191 && ((s || (s = [])).push(String.fromCharCode.apply(String, u)), i = 0);
       return s ? (i && s.push(String.fromCharCode.apply(String, u.slice(0, i))), s.join("")) : String.fromCharCode.apply(String, u.slice(0, i));
-    }, t.write = function(a, l, n) {
+    }, t.write = function(a, c, n) {
       for (var o = n, s, u, i = 0; i < a.length; ++i)
-        s = a.charCodeAt(i), s < 128 ? l[n++] = s : s < 2048 ? (l[n++] = s >> 6 | 192, l[n++] = s & 63 | 128) : (s & 64512) === 55296 && ((u = a.charCodeAt(i + 1)) & 64512) === 56320 ? (s = 65536 + ((s & 1023) << 10) + (u & 1023), ++i, l[n++] = s >> 18 | 240, l[n++] = s >> 12 & 63 | 128, l[n++] = s >> 6 & 63 | 128, l[n++] = s & 63 | 128) : (l[n++] = s >> 12 | 224, l[n++] = s >> 6 & 63 | 128, l[n++] = s & 63 | 128);
+        s = a.charCodeAt(i), s < 128 ? c[n++] = s : s < 2048 ? (c[n++] = s >> 6 | 192, c[n++] = s & 63 | 128) : (s & 64512) === 55296 && ((u = a.charCodeAt(i + 1)) & 64512) === 56320 ? (s = 65536 + ((s & 1023) << 10) + (u & 1023), ++i, c[n++] = s >> 18 | 240, c[n++] = s >> 12 & 63 | 128, c[n++] = s >> 6 & 63 | 128, c[n++] = s & 63 | 128) : (c[n++] = s >> 12 | 224, c[n++] = s >> 6 & 63 | 128, c[n++] = s & 63 | 128);
       return n - o;
     };
   }(utf8$2)), utf8$2;
@@ -1459,12 +1453,12 @@ function requirePool() {
   if (hasRequiredPool) return pool_1;
   hasRequiredPool = 1, pool_1 = r;
   function r(t, e, a) {
-    var l = a || 8192, n = l >>> 1, o = null, s = l;
+    var c = a || 8192, n = c >>> 1, o = null, s = c;
     return function(i) {
       if (i < 1 || i > n) return t(i);
-      s + i > l && (o = t(l), s = 0);
-      var c = e.call(o, s, s += i);
-      return s & 7 && (s = (s | 7) + 1), c;
+      s + i > c && (o = t(c), s = 0);
+      var l = e.call(o, s, s += i);
+      return s & 7 && (s = (s | 7) + 1), l;
     };
   }
   return pool_1;
@@ -1514,11 +1508,11 @@ function requireLongbits() {
       }
     );
   };
-  var l = String.prototype.charCodeAt;
+  var c = String.prototype.charCodeAt;
   return t.fromHash = function(o) {
     return o === a ? e : new t(
-      (l.call(o, 0) | l.call(o, 1) << 8 | l.call(o, 2) << 16 | l.call(o, 3) << 24) >>> 0,
-      (l.call(o, 4) | l.call(o, 5) << 8 | l.call(o, 6) << 16 | l.call(o, 7) << 24) >>> 0
+      (c.call(o, 0) | c.call(o, 1) << 8 | c.call(o, 2) << 16 | c.call(o, 3) << 24) >>> 0,
+      (c.call(o, 4) | c.call(o, 5) << 8 | c.call(o, 6) << 16 | c.call(o, 7) << 24) >>> 0
     );
   }, t.prototype.toHash = function() {
     return String.fromCharCode(
@@ -1570,8 +1564,8 @@ function requireMinimal() {
       return s != null && n.hasOwnProperty(o) ? typeof s != "object" || (Array.isArray(s) ? s.length : Object.keys(s).length) > 0 : !1;
     }, t.Buffer = function() {
       try {
-        var l = t.inquire("buffer").Buffer;
-        return l.prototype.utf8Write ? l : (
+        var c = t.inquire("buffer").Buffer;
+        return c.prototype.utf8Write ? c : (
           /* istanbul ignore next */
           null
         );
@@ -1589,15 +1583,15 @@ function requireMinimal() {
       var s = t.LongBits.fromHash(n);
       return t.Long ? t.Long.fromBits(s.lo, s.hi, o) : s.toNumber(!!o);
     };
-    function e(l, n, o) {
+    function e(c, n, o) {
       for (var s = Object.keys(n), u = 0; u < s.length; ++u)
-        (l[s[u]] === void 0 || !o) && (l[s[u]] = n[s[u]]);
-      return l;
+        (c[s[u]] === void 0 || !o) && (c[s[u]] = n[s[u]]);
+      return c;
     }
     t.merge = e, t.lcFirst = function(n) {
       return n.charAt(0).toLowerCase() + n.substring(1);
     };
-    function a(l) {
+    function a(c) {
       function n(o, s) {
         if (!(this instanceof n)) return new n(o, s);
         Object.defineProperty(this, "message", {
@@ -1617,7 +1611,7 @@ function requireMinimal() {
         },
         name: {
           get: function() {
-            return l;
+            return c;
           },
           set: void 0,
           enumerable: !1,
@@ -1655,15 +1649,15 @@ function requireMinimal() {
       bytes: String,
       json: !0
     }, t._configure = function() {
-      var l = t.Buffer;
-      if (!l) {
+      var c = t.Buffer;
+      if (!c) {
         t._Buffer_from = t._Buffer_allocUnsafe = null;
         return;
       }
-      t._Buffer_from = l.from !== Uint8Array.from && l.from || function(o, s) {
-        return new l(o, s);
-      }, t._Buffer_allocUnsafe = l.allocUnsafe || function(o) {
-        return new l(o);
+      t._Buffer_from = c.from !== Uint8Array.from && c.from || function(o, s) {
+        return new c(o, s);
+      }, t._Buffer_allocUnsafe = c.allocUnsafe || function(o) {
+        return new c(o);
       };
     };
   }(minimal)), minimal;
@@ -1767,7 +1761,7 @@ var writeBytes = util$7.Array.prototype.set ? function r(t, e, a) {
 } : (
   /* istanbul ignore next */
   function r(t, e, a) {
-    for (var l = 0; l < t.length; ++l) e[a + l] = t[l];
+    for (var c = 0; c < t.length; ++c) e[a + c] = t[c];
   }
 );
 Writer$1.prototype.bytes = function r(t) {
@@ -1816,8 +1810,8 @@ BufferWriter._configure = function() {
       if (t.copy)
         t.copy(e, a, 0, t.length);
       else
-        for (var l = 0; l < t.length; )
-          e[a++] = t[l++];
+        for (var c = 0; c < t.length; )
+          e[a++] = t[c++];
     }
   );
 };
@@ -1854,10 +1848,10 @@ var create_array = typeof Uint8Array < "u" ? function r(t) {
   }
 ), create = function r() {
   return util$5.Buffer ? function(e) {
-    return (Reader$1.create = function(l) {
-      return util$5.Buffer.isBuffer(l) ? new BufferReader$1(l) : (
+    return (Reader$1.create = function(c) {
+      return util$5.Buffer.isBuffer(c) ? new BufferReader$1(c) : (
         /* istanbul ignore next */
-        create_array(l)
+        create_array(c)
       );
     })(e);
   } : (
@@ -1945,8 +1939,8 @@ Reader$1.prototype.bytes = function r() {
   if (this.pos += t, Array.isArray(this.buf))
     return this.buf.slice(e, a);
   if (e === a) {
-    var l = util$5.Buffer;
-    return l ? l.alloc(0) : new this.buf.constructor(0);
+    var c = util$5.Buffer;
+    return c ? c.alloc(0) : new this.buf.constructor(0);
   }
   return this._slice.call(this.buf, e, a);
 };
@@ -2032,10 +2026,10 @@ function Service$1(r, t, e) {
   if (typeof r != "function") throw TypeError("rpcImpl must be a function");
   util$3.EventEmitter.call(this), this.rpcImpl = r, this.requestDelimited = !!t, this.responseDelimited = !!e;
 }
-Service$1.prototype.rpcCall = function r(t, e, a, l, n) {
-  if (!l) throw TypeError("request must be specified");
+Service$1.prototype.rpcCall = function r(t, e, a, c, n) {
+  if (!c) throw TypeError("request must be specified");
   var o = this;
-  if (!n) return util$3.asPromise(r, o, t, e, a, l);
+  if (!n) return util$3.asPromise(r, o, t, e, a, c);
   if (!o.rpcImpl) {
     setTimeout(function() {
       n(Error("already ended"));
@@ -2045,7 +2039,7 @@ Service$1.prototype.rpcCall = function r(t, e, a, l, n) {
   try {
     return o.rpcImpl(
       t,
-      e[o.requestDelimited ? "encodeDelimited" : "encode"](l).finish(),
+      e[o.requestDelimited ? "encodeDelimited" : "encode"](c).finish(),
       function(u, i) {
         if (u)
           return o.emit("error", u, t), n(u);
@@ -2059,8 +2053,8 @@ Service$1.prototype.rpcCall = function r(t, e, a, l, n) {
         if (!(i instanceof a))
           try {
             i = a[o.responseDelimited ? "decodeDelimited" : "decode"](i);
-          } catch (c) {
-            return o.emit("error", c, t), n(c);
+          } catch (l) {
+            return o.emit("error", l, t), n(l);
           }
         return o.emit("data", i, t), n(null, i);
       }
@@ -2094,65 +2088,65 @@ function codegen(r, t) {
   var e = [];
   function a(n) {
     if (typeof n != "string") {
-      var o = l();
+      var o = c();
       if (codegen.verbose && console.warn("codegen: " + o), o = "return " + o, n) {
-        for (var s = Object.keys(n), u = new Array(s.length + 1), i = new Array(s.length), c = 0; c < s.length; )
-          u[c] = s[c], i[c] = n[s[c++]];
-        return u[c] = o, Function.apply(null, u).apply(null, i);
+        for (var s = Object.keys(n), u = new Array(s.length + 1), i = new Array(s.length), l = 0; l < s.length; )
+          u[l] = s[l], i[l] = n[s[l++]];
+        return u[l] = o, Function.apply(null, u).apply(null, i);
       }
       return Function(o)();
     }
     for (var h = new Array(arguments.length - 1), p = 0; p < h.length; )
       h[p] = arguments[++p];
     if (p = 0, n = n.replace(/%([%dfijs])/g, function(y, g) {
-      var T = h[p++];
+      var _ = h[p++];
       switch (g) {
         case "d":
         case "f":
-          return String(Number(T));
+          return String(Number(_));
         case "i":
-          return String(Math.floor(T));
+          return String(Math.floor(_));
         case "j":
-          return JSON.stringify(T);
+          return JSON.stringify(_);
         case "s":
-          return String(T);
+          return String(_);
       }
       return "%";
     }), p !== h.length) throw Error("parameter count mismatch");
     return e.push(n), a;
   }
-  function l(n) {
+  function c(n) {
     return "function " + (n || t || "") + "(" + (r && r.join(",") || "") + `){
   ` + e.join(`
   `) + `
 }`;
   }
-  return a.toString = l, a;
+  return a.toString = c, a;
 }
 codegen.verbose = !1;
 var fetch_1 = fetch, asPromise = requireAspromise(), inquire = requireInquire(), fs = inquire("fs");
 function fetch(r, t, e) {
-  return typeof t == "function" ? (e = t, t = {}) : t || (t = {}), e ? !t.xhr && fs && fs.readFile ? fs.readFile(r, function(l, n) {
-    return l && typeof XMLHttpRequest < "u" ? fetch.xhr(r, t, e) : l ? e(l) : e(null, t.binary ? n : n.toString("utf8"));
+  return typeof t == "function" ? (e = t, t = {}) : t || (t = {}), e ? !t.xhr && fs && fs.readFile ? fs.readFile(r, function(c, n) {
+    return c && typeof XMLHttpRequest < "u" ? fetch.xhr(r, t, e) : c ? e(c) : e(null, t.binary ? n : n.toString("utf8"));
   }) : fetch.xhr(r, t, e) : asPromise(fetch, this, r, t);
 }
 fetch.xhr = function r(t, e, a) {
-  var l = new XMLHttpRequest();
-  l.onreadystatechange = function() {
-    if (l.readyState === 4) {
-      if (l.status !== 0 && l.status !== 200) return a(Error("status " + l.status));
+  var c = new XMLHttpRequest();
+  c.onreadystatechange = function() {
+    if (c.readyState === 4) {
+      if (c.status !== 0 && c.status !== 200) return a(Error("status " + c.status));
       if (e.binary) {
-        var o = l.response;
+        var o = c.response;
         if (!o) {
           o = [];
-          for (var s = 0; s < l.responseText.length; ++s)
-            o.push(l.responseText.charCodeAt(s) & 255);
+          for (var s = 0; s < c.responseText.length; ++s)
+            o.push(c.responseText.charCodeAt(s) & 255);
         }
         return a(null, typeof Uint8Array < "u" ? new Uint8Array(o) : o);
       }
-      return a(null, l.responseText);
+      return a(null, c.responseText);
     }
-  }, e.binary && ("overrideMimeType" in l && l.overrideMimeType("text/plain; charset=x-user-defined"), l.responseType = "arraybuffer"), l.open("GET", t), l.send();
+  }, e.binary && ("overrideMimeType" in c && c.overrideMimeType("text/plain; charset=x-user-defined"), c.responseType = "arraybuffer"), c.open("GET", t), c.send();
 };
 var path = {};
 (function(r) {
@@ -2219,12 +2213,12 @@ function requireTypes() {
       "bytes"
       // 14
     ];
-    function l(n, o) {
+    function c(n, o) {
       var s = 0, u = {};
       for (o |= 0; s < n.length; ) u[a[s + o]] = n[s++];
       return u;
     }
-    t.basic = l([
+    t.basic = c([
       /* double   */
       1,
       /* float    */
@@ -2255,7 +2249,7 @@ function requireTypes() {
       2,
       /* bytes    */
       2
-    ]), t.defaults = l([
+    ]), t.defaults = c([
       /* double   */
       0,
       /* float    */
@@ -2288,7 +2282,7 @@ function requireTypes() {
       e.emptyArray,
       /* message  */
       null
-    ]), t.long = l(
+    ]), t.long = c(
       [
         /* int64    */
         0,
@@ -2302,7 +2296,7 @@ function requireTypes() {
         1
       ],
       7
-    ), t.mapKey = l(
+    ), t.mapKey = c(
       [
         /* int32    */
         0,
@@ -2330,7 +2324,7 @@ function requireTypes() {
         2
       ],
       2
-    ), t.packed = l([
+    ), t.packed = c([
       /* double   */
       1,
       /* float    */
@@ -2366,17 +2360,17 @@ function requireField() {
   hasRequiredField = 1, field = o;
   var r = requireObject();
   ((o.prototype = Object.create(r.prototype)).constructor = o).className = "Field";
-  var t = require_enum(), e = requireTypes(), a = requireUtil(), l, n = /^required|optional|repeated$/;
+  var t = require_enum(), e = requireTypes(), a = requireUtil(), c, n = /^required|optional|repeated$/;
   o.fromJSON = function(u, i) {
     return new o(u, i.id, i.type, i.rule, i.extend, i.options, i.comment);
   };
-  function o(s, u, i, c, h, p, d) {
-    if (a.isObject(c) ? (d = h, p = c, c = h = void 0) : a.isObject(h) && (d = p, p = h, h = void 0), r.call(this, s, p), !a.isInteger(u) || u < 0) throw TypeError("id must be a non-negative integer");
+  function o(s, u, i, l, h, p, d) {
+    if (a.isObject(l) ? (d = h, p = l, l = h = void 0) : a.isObject(h) && (d = p, p = h, h = void 0), r.call(this, s, p), !a.isInteger(u) || u < 0) throw TypeError("id must be a non-negative integer");
     if (!a.isString(i)) throw TypeError("type must be a string");
-    if (c !== void 0 && !n.test(c = c.toString().toLowerCase()))
+    if (l !== void 0 && !n.test(l = l.toString().toLowerCase()))
       throw TypeError("rule must be a string rule");
     if (h !== void 0 && !a.isString(h)) throw TypeError("extend must be a string");
-    c === "proto3_optional" && (c = "optional"), this.rule = c && c !== "optional" ? c : void 0, this.type = i, this.id = u, this.extend = h || void 0, this.required = c === "required", this.optional = !this.required, this.repeated = c === "repeated", this.map = !1, this.message = null, this.partOf = null, this.typeDefault = null, this.defaultValue = null, this.long = a.Long ? e.long[i] !== void 0 : (
+    l === "proto3_optional" && (l = "optional"), this.rule = l && l !== "optional" ? l : void 0, this.type = i, this.id = u, this.extend = h || void 0, this.required = l === "required", this.optional = !this.required, this.repeated = l === "repeated", this.map = !1, this.message = null, this.partOf = null, this.typeDefault = null, this.defaultValue = null, this.long = a.Long ? e.long[i] !== void 0 : (
       /* istanbul ignore next */
       !1
     ), this.bytes = i === "bytes", this.resolvedType = null, this.extensionField = null, this.declaringField = null, this._packed = null, this.comment = d;
@@ -2385,8 +2379,8 @@ function requireField() {
     get: function() {
       return this._packed === null && (this._packed = this.getOption("packed") !== !1), this._packed;
     }
-  }), o.prototype.setOption = function(u, i, c) {
-    return u === "packed" && (this._packed = null), r.prototype.setOption.call(this, u, i, c);
+  }), o.prototype.setOption = function(u, i, l) {
+    return u === "packed" && (this._packed = null), r.prototype.setOption.call(this, u, i, l);
   }, o.prototype.toJSON = function(u) {
     var i = u ? !!u.keepComments : !1;
     return a.toObject([
@@ -2405,7 +2399,7 @@ function requireField() {
     ]);
   }, o.prototype.resolve = function() {
     if (this.resolved) return this;
-    if ((this.typeDefault = e.defaults[this.type]) === void 0 ? (this.resolvedType = (this.declaringField ? this.declaringField.parent : this.parent).lookupTypeOrEnum(this.type), this.resolvedType instanceof l ? this.typeDefault = null : this.typeDefault = this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]) : this.options && this.options.proto3_optional && (this.typeDefault = null), this.options && this.options.default != null && (this.typeDefault = this.options.default, this.resolvedType instanceof t && typeof this.typeDefault == "string" && (this.typeDefault = this.resolvedType.values[this.typeDefault])), this.options && ((this.options.packed === !0 || this.options.packed !== void 0 && this.resolvedType && !(this.resolvedType instanceof t)) && delete this.options.packed, Object.keys(this.options).length || (this.options = void 0)), this.long)
+    if ((this.typeDefault = e.defaults[this.type]) === void 0 ? (this.resolvedType = (this.declaringField ? this.declaringField.parent : this.parent).lookupTypeOrEnum(this.type), this.resolvedType instanceof c ? this.typeDefault = null : this.typeDefault = this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]) : this.options && this.options.proto3_optional && (this.typeDefault = null), this.options && this.options.default != null && (this.typeDefault = this.options.default, this.resolvedType instanceof t && typeof this.typeDefault == "string" && (this.typeDefault = this.resolvedType.values[this.typeDefault])), this.options && ((this.options.packed === !0 || this.options.packed !== void 0 && this.resolvedType && !(this.resolvedType instanceof t)) && delete this.options.packed, Object.keys(this.options).length || (this.options = void 0)), this.long)
       this.typeDefault = a.Long.fromNumber(this.typeDefault, this.type.charAt(0) === "u"), Object.freeze && Object.freeze(this.typeDefault);
     else if (this.bytes && typeof this.typeDefault == "string") {
       var u;
@@ -2419,17 +2413,17 @@ function requireField() {
         0
       ), this.typeDefault = u;
     }
-    return this.map ? this.defaultValue = a.emptyObject : this.repeated ? this.defaultValue = a.emptyArray : this.defaultValue = this.typeDefault, this.parent instanceof l && (this.parent.ctor.prototype[this.name] = this.defaultValue), r.prototype.resolve.call(this);
-  }, o.d = function(u, i, c, h) {
+    return this.map ? this.defaultValue = a.emptyObject : this.repeated ? this.defaultValue = a.emptyArray : this.defaultValue = this.typeDefault, this.parent instanceof c && (this.parent.ctor.prototype[this.name] = this.defaultValue), r.prototype.resolve.call(this);
+  }, o.d = function(u, i, l, h) {
     return typeof i == "function" ? i = a.decorateType(i).name : i && typeof i == "object" && (i = a.decorateEnum(i).name), function(d, y) {
       a.decorateType(d.constructor).add(
-        new o(y, u, i, c, {
+        new o(y, u, i, l, {
           default: h
         })
       );
     };
   }, o._configure = function(u) {
-    l = u;
+    c = u;
   }, field;
 }
 var oneof, hasRequiredOneof;
@@ -2457,14 +2451,14 @@ function requireOneof() {
       s ? this.comment : void 0
     ]);
   };
-  function l(n) {
+  function c(n) {
     if (n.parent)
       for (var o = 0; o < n.fieldsArray.length; ++o)
         n.fieldsArray[o].parent || n.parent.add(n.fieldsArray[o]);
   }
   return a.prototype.add = function(o) {
     if (!(o instanceof t)) throw TypeError("field must be a Field");
-    return o.parent && o.parent !== this.parent && o.parent.remove(o), this.oneof.push(o.name), this.fieldsArray.push(o), o.partOf = this, l(this), this;
+    return o.parent && o.parent !== this.parent && o.parent.remove(o), this.oneof.push(o.name), this.fieldsArray.push(o), o.partOf = this, c(this), this;
   }, a.prototype.remove = function(o) {
     if (!(o instanceof t)) throw TypeError("field must be a Field");
     var s = this.fieldsArray.indexOf(o);
@@ -2476,15 +2470,15 @@ function requireOneof() {
       var i = o.get(this.oneof[u]);
       i && !i.partOf && (i.partOf = s, s.fieldsArray.push(i));
     }
-    l(this);
+    c(this);
   }, a.prototype.onRemove = function(o) {
     for (var s = 0, u; s < this.fieldsArray.length; ++s)
       (u = this.fieldsArray[s]).parent && u.parent.remove(u);
     r.prototype.onRemove.call(this, o);
   }, a.d = function() {
     for (var o = new Array(arguments.length), s = 0; s < arguments.length; ) o[s] = arguments[s++];
-    return function(i, c) {
-      e.decorateType(i.constructor).add(new a(c, o)), Object.defineProperty(i, c, {
+    return function(i, l) {
+      e.decorateType(i.constructor).add(new a(l, o)), Object.defineProperty(i, l, {
         get: e.oneOfGetter(o),
         set: e.oneOfSetter(o)
       });
@@ -2497,13 +2491,13 @@ function requireNamespace() {
   hasRequiredNamespace = 1, namespace = u;
   var r = requireObject();
   ((u.prototype = Object.create(r.prototype)).constructor = u).className = "Namespace";
-  var t = requireField(), e = requireUtil(), a = requireOneof(), l, n, o;
+  var t = requireField(), e = requireUtil(), a = requireOneof(), c, n, o;
   u.fromJSON = function(h, p) {
     return new u(h, p.options).addJSON(p.nested);
   };
-  function s(c, h) {
-    if (c && c.length) {
-      for (var p = {}, d = 0; d < c.length; ++d) p[c[d].name] = c[d].toJSON(h);
+  function s(l, h) {
+    if (l && l.length) {
+      for (var p = {}, d = 0; d < l.length; ++d) p[l[d].name] = l[d].toJSON(h);
       return p;
     }
   }
@@ -2520,11 +2514,11 @@ function requireNamespace() {
     }
     return !1;
   };
-  function u(c, h) {
-    r.call(this, c, h), this.nested = void 0, this._nestedArray = null;
+  function u(l, h) {
+    r.call(this, l, h), this.nested = void 0, this._nestedArray = null;
   }
-  function i(c) {
-    return c._nestedArray = null, c;
+  function i(l) {
+    return l._nestedArray = null, l;
   }
   return Object.defineProperty(u.prototype, "nestedArray", {
     get: function() {
@@ -2543,7 +2537,7 @@ function requireNamespace() {
       for (var d = Object.keys(h), y = 0, g; y < d.length; ++y)
         g = h[d[y]], p.add(
           // most to least likely
-          (g.fields !== void 0 ? l.fromJSON : g.values !== void 0 ? o.fromJSON : g.methods !== void 0 ? n.fromJSON : g.id !== void 0 ? t.fromJSON : u.fromJSON)(d[y], g)
+          (g.fields !== void 0 ? c.fromJSON : g.values !== void 0 ? o.fromJSON : g.methods !== void 0 ? n.fromJSON : g.id !== void 0 ? t.fromJSON : u.fromJSON)(d[y], g)
         );
     return this;
   }, u.prototype.get = function(h) {
@@ -2552,13 +2546,13 @@ function requireNamespace() {
     if (this.nested && this.nested[h] instanceof o) return this.nested[h].values;
     throw Error("no such enum: " + h);
   }, u.prototype.add = function(h) {
-    if (!(h instanceof t && h.extend !== void 0 || h instanceof l || h instanceof a || h instanceof o || h instanceof n || h instanceof u))
+    if (!(h instanceof t && h.extend !== void 0 || h instanceof c || h instanceof a || h instanceof o || h instanceof n || h instanceof u))
       throw TypeError("object must be a valid nested object");
     if (!this.nested) this.nested = {};
     else {
       var p = this.get(h.name);
       if (p)
-        if (p instanceof u && h instanceof u && !(p instanceof l || p instanceof n)) {
+        if (p instanceof u && h instanceof u && !(p instanceof c || p instanceof n)) {
           for (var d = p.nestedArray, y = 0; y < d.length; ++y) h.add(d[y]);
           this.remove(p), this.nested || (this.nested = {}), h.setOptions(p.options, !0);
         } else throw Error("duplicate name '" + h.name + "' in " + this);
@@ -2601,7 +2595,7 @@ function requireNamespace() {
           return y;
     return this.parent === null || d ? null : this.parent.lookup(h, p);
   }, u.prototype.lookupType = function(h) {
-    var p = this.lookup(h, [l]);
+    var p = this.lookup(h, [c]);
     if (!p) throw Error("no such type: " + h);
     return p;
   }, u.prototype.lookupEnum = function(h) {
@@ -2609,15 +2603,15 @@ function requireNamespace() {
     if (!p) throw Error("no such Enum '" + h + "' in " + this);
     return p;
   }, u.prototype.lookupTypeOrEnum = function(h) {
-    var p = this.lookup(h, [l, o]);
+    var p = this.lookup(h, [c, o]);
     if (!p) throw Error("no such Type or Enum '" + h + "' in " + this);
     return p;
   }, u.prototype.lookupService = function(h) {
     var p = this.lookup(h, [n]);
     if (!p) throw Error("no such Service '" + h + "' in " + this);
     return p;
-  }, u._configure = function(c, h, p) {
-    l = c, n = h, o = p;
+  }, u._configure = function(l, h, p) {
+    c = l, n = h, o = p;
   }, namespace;
 }
 var mapfield, hasRequiredMapfield;
@@ -2627,8 +2621,8 @@ function requireMapfield() {
   var r = requireField();
   ((a.prototype = Object.create(r.prototype)).constructor = a).className = "MapField";
   var t = requireTypes(), e = requireUtil();
-  function a(l, n, o, s, u, i) {
-    if (r.call(this, l, n, s, void 0, void 0, u, i), !e.isString(o)) throw TypeError("keyType must be a string");
+  function a(c, n, o, s, u, i) {
+    if (r.call(this, c, n, s, void 0, void 0, u, i), !e.isString(o)) throw TypeError("keyType must be a string");
     this.keyType = o, this.resolvedKeyType = null, this.map = !0;
   }
   return a.fromJSON = function(n, o) {
@@ -2654,8 +2648,8 @@ function requireMapfield() {
     if (t.mapKey[this.keyType] === void 0) throw Error("invalid key type: " + this.keyType);
     return r.prototype.resolve.call(this);
   }, a.d = function(n, o, s) {
-    return typeof s == "function" ? s = e.decorateType(s).name : s && typeof s == "object" && (s = e.decorateEnum(s).name), function(i, c) {
-      e.decorateType(i.constructor).add(new a(c, n, o, s));
+    return typeof s == "function" ? s = e.decorateType(s).name : s && typeof s == "object" && (s = e.decorateEnum(s).name), function(i, l) {
+      e.decorateType(i.constructor).add(new a(l, n, o, s));
     };
   }, mapfield;
 }
@@ -2666,15 +2660,15 @@ function requireMethod() {
   var r = requireObject();
   ((e.prototype = Object.create(r.prototype)).constructor = e).className = "Method";
   var t = requireUtil();
-  function e(a, l, n, o, s, u, i, c, h) {
-    if (t.isObject(s) ? (i = s, s = u = void 0) : t.isObject(u) && (i = u, u = void 0), !(l === void 0 || t.isString(l))) throw TypeError("type must be a string");
+  function e(a, c, n, o, s, u, i, l, h) {
+    if (t.isObject(s) ? (i = s, s = u = void 0) : t.isObject(u) && (i = u, u = void 0), !(c === void 0 || t.isString(c))) throw TypeError("type must be a string");
     if (!t.isString(n)) throw TypeError("requestType must be a string");
     if (!t.isString(o)) throw TypeError("responseType must be a string");
-    r.call(this, a, i), this.type = l || "rpc", this.requestType = n, this.requestStream = s ? !0 : void 0, this.responseType = o, this.responseStream = u ? !0 : void 0, this.resolvedRequestType = null, this.resolvedResponseType = null, this.comment = c, this.parsedOptions = h;
+    r.call(this, a, i), this.type = c || "rpc", this.requestType = n, this.requestStream = s ? !0 : void 0, this.responseType = o, this.responseStream = u ? !0 : void 0, this.resolvedRequestType = null, this.resolvedResponseType = null, this.comment = l, this.parsedOptions = h;
   }
-  return e.fromJSON = function(l, n) {
+  return e.fromJSON = function(c, n) {
     return new e(
-      l,
+      c,
       n.type,
       n.requestType,
       n.responseType,
@@ -2684,8 +2678,8 @@ function requireMethod() {
       n.comment,
       n.parsedOptions
     );
-  }, e.prototype.toJSON = function(l) {
-    var n = l ? !!l.keepComments : !1;
+  }, e.prototype.toJSON = function(c) {
+    var n = c ? !!c.keepComments : !1;
     return t.toObject([
       "type",
       this.type !== "rpc" && /* istanbul ignore next */
@@ -2712,20 +2706,20 @@ function requireMethod() {
 var service, hasRequiredService;
 function requireService() {
   if (hasRequiredService) return service;
-  hasRequiredService = 1, service = l;
+  hasRequiredService = 1, service = c;
   var r = requireNamespace();
-  ((l.prototype = Object.create(r.prototype)).constructor = l).className = "Service";
+  ((c.prototype = Object.create(r.prototype)).constructor = c).className = "Service";
   var t = requireMethod(), e = requireUtil(), a = rpc;
-  function l(o, s) {
+  function c(o, s) {
     r.call(this, o, s), this.methods = {}, this._methodsArray = null;
   }
-  l.fromJSON = function(s, u) {
-    var i = new l(s, u.options);
+  c.fromJSON = function(s, u) {
+    var i = new c(s, u.options);
     if (u.methods)
-      for (var c = Object.keys(u.methods), h = 0; h < c.length; ++h)
-        i.add(t.fromJSON(c[h], u.methods[c[h]]));
+      for (var l = Object.keys(u.methods), h = 0; h < l.length; ++h)
+        i.add(t.fromJSON(l[h], u.methods[l[h]]));
     return u.nested && i.addJSON(u.nested), i.comment = u.comment, i;
-  }, l.prototype.toJSON = function(s) {
+  }, c.prototype.toJSON = function(s) {
     var u = r.prototype.toJSON.call(this, s), i = s ? !!s.keepComments : !1;
     return e.toObject([
       "options",
@@ -2738,7 +2732,7 @@ function requireService() {
       "comment",
       i ? this.comment : void 0
     ]);
-  }, Object.defineProperty(l.prototype, "methodsArray", {
+  }, Object.defineProperty(c.prototype, "methodsArray", {
     get: function() {
       return this._methodsArray || (this._methodsArray = e.toArray(this.methods));
     }
@@ -2746,25 +2740,25 @@ function requireService() {
   function n(o) {
     return o._methodsArray = null, o;
   }
-  return l.prototype.get = function(s) {
+  return c.prototype.get = function(s) {
     return this.methods[s] || r.prototype.get.call(this, s);
-  }, l.prototype.resolveAll = function() {
+  }, c.prototype.resolveAll = function() {
     for (var s = this.methodsArray, u = 0; u < s.length; ++u) s[u].resolve();
     return r.prototype.resolve.call(this);
-  }, l.prototype.add = function(s) {
+  }, c.prototype.add = function(s) {
     if (this.get(s.name)) throw Error("duplicate name '" + s.name + "' in " + this);
     return s instanceof t ? (this.methods[s.name] = s, s.parent = this, n(this)) : r.prototype.add.call(this, s);
-  }, l.prototype.remove = function(s) {
+  }, c.prototype.remove = function(s) {
     if (s instanceof t) {
       if (this.methods[s.name] !== s) throw Error(s + " is not a member of " + this);
       return delete this.methods[s.name], s.parent = null, n(this);
     }
     return r.prototype.remove.call(this, s);
-  }, l.prototype.create = function(s, u, i) {
-    for (var c = new a.Service(s, u, i), h = 0, p; h < /* initializes */
+  }, c.prototype.create = function(s, u, i) {
+    for (var l = new a.Service(s, u, i), h = 0, p; h < /* initializes */
     this.methodsArray.length; ++h) {
       var d = e.lcFirst((p = this._methodsArray[h]).resolve().name).replace(/[^$\w_]/g, "");
-      c[d] = e.codegen(
+      l[d] = e.codegen(
         ["r", "c"],
         e.isReserved(d) ? d + "_" : d
       )("return this.rpcCall(m,q,s,r,c)")({
@@ -2773,7 +2767,7 @@ function requireService() {
         s: p.resolvedResponseType.ctor
       });
     }
-    return c;
+    return l;
   }, service;
 }
 var message = Message, util$1 = requireMinimal();
@@ -2812,12 +2806,12 @@ Message.prototype.toJSON = function r() {
 var decoder_1, hasRequiredDecoder;
 function requireDecoder() {
   if (hasRequiredDecoder) return decoder_1;
-  hasRequiredDecoder = 1, decoder_1 = l;
+  hasRequiredDecoder = 1, decoder_1 = c;
   var r = require_enum(), t = requireTypes(), e = requireUtil();
   function a(n) {
     return "missing required '" + n.name + "'";
   }
-  function l(n) {
+  function c(n) {
     var o = e.codegen(["r", "l"], n.name + "$decode")("if(!(r instanceof Reader))")(
       "r=Reader.create(r)"
     )(
@@ -2828,23 +2822,23 @@ function requireDecoder() {
     n.group && o("if((t&7)===4)")("break"), o("switch(t>>>3){");
     for (var s = 0; s < /* initializes */
     n.fieldsArray.length; ++s) {
-      var u = n._fieldsArray[s].resolve(), i = u.resolvedType instanceof r ? "int32" : u.type, c = "m" + e.safeProp(u.name);
-      o("case %i: {", u.id), u.map ? (o("if(%s===util.emptyObject)", c)("%s={}", c)("var c2 = r.uint32()+r.pos"), t.defaults[u.keyType] !== void 0 ? o("k=%j", t.defaults[u.keyType]) : o("k=null"), t.defaults[i] !== void 0 ? o("value=%j", t.defaults[i]) : o("value=null"), o("while(r.pos<c2){")("var tag2=r.uint32()")("switch(tag2>>>3){")(
+      var u = n._fieldsArray[s].resolve(), i = u.resolvedType instanceof r ? "int32" : u.type, l = "m" + e.safeProp(u.name);
+      o("case %i: {", u.id), u.map ? (o("if(%s===util.emptyObject)", l)("%s={}", l)("var c2 = r.uint32()+r.pos"), t.defaults[u.keyType] !== void 0 ? o("k=%j", t.defaults[u.keyType]) : o("k=null"), t.defaults[i] !== void 0 ? o("value=%j", t.defaults[i]) : o("value=null"), o("while(r.pos<c2){")("var tag2=r.uint32()")("switch(tag2>>>3){")(
         "case 1: k=r.%s(); break",
         u.keyType
-      )("case 2:"), t.basic[i] === void 0 ? o("value=types[%i].decode(r,r.uint32())", s) : o("value=r.%s()", i), o("break")("default:")("r.skipType(tag2&7)")("break")("}")("}"), t.long[u.keyType] !== void 0 ? o('%s[typeof k==="object"?util.longToHash(k):k]=value', c) : o("%s[k]=value", c)) : u.repeated ? (o("if(!(%s&&%s.length))", c, c)("%s=[]", c), t.packed[i] !== void 0 && o("if((t&7)===2){")("var c2=r.uint32()+r.pos")("while(r.pos<c2)")(
+      )("case 2:"), t.basic[i] === void 0 ? o("value=types[%i].decode(r,r.uint32())", s) : o("value=r.%s()", i), o("break")("default:")("r.skipType(tag2&7)")("break")("}")("}"), t.long[u.keyType] !== void 0 ? o('%s[typeof k==="object"?util.longToHash(k):k]=value', l) : o("%s[k]=value", l)) : u.repeated ? (o("if(!(%s&&%s.length))", l, l)("%s=[]", l), t.packed[i] !== void 0 && o("if((t&7)===2){")("var c2=r.uint32()+r.pos")("while(r.pos<c2)")(
         "%s.push(r.%s())",
-        c,
+        l,
         i
       )("}else"), t.basic[i] === void 0 ? o(
         u.resolvedType.group ? "%s.push(types[%i].decode(r))" : "%s.push(types[%i].decode(r,r.uint32()))",
-        c,
+        l,
         s
-      ) : o("%s.push(r.%s())", c, i)) : t.basic[i] === void 0 ? o(
+      ) : o("%s.push(r.%s())", l, i)) : t.basic[i] === void 0 ? o(
         u.resolvedType.group ? "%s=types[%i].decode(r)" : "%s=types[%i].decode(r,r.uint32())",
-        c,
+        l,
         s
-      ) : o("%s=r.%s()", c, i), o("break")("}");
+      ) : o("%s=r.%s()", l, i), o("break")("}");
     }
     for (o("default:")("r.skipType(t&7)")("break")("}")("}"), s = 0; s < n._fieldsArray.length; ++s) {
       var h = n._fieldsArray[s];
@@ -2869,8 +2863,8 @@ function requireVerifier() {
     if (s.resolvedType)
       if (s.resolvedType instanceof r) {
         o("switch(%s){", i)("default:")("return%j", e(s, "enum value"));
-        for (var c = Object.keys(s.resolvedType.values), h = 0; h < c.length; ++h)
-          o("case %i:", s.resolvedType.values[c[h]]);
+        for (var l = Object.keys(s.resolvedType.values), h = 0; h < l.length; ++h)
+          o("case %i:", s.resolvedType.values[l[h]]);
         o("break")("}");
       } else
         o("{")("var e=types[%i].verify(%s);", u, i)("if(e)")(
@@ -2920,7 +2914,7 @@ function requireVerifier() {
       }
     return o;
   }
-  function l(o, s, u) {
+  function c(o, s, u) {
     switch (s.keyType) {
       case "int32":
       case "uint32":
@@ -2952,25 +2946,25 @@ function requireVerifier() {
       "object expected"
     ), u = o.oneofsArray, i = {};
     u.length && s("var p={}");
-    for (var c = 0; c < /* initializes */
-    o.fieldsArray.length; ++c) {
-      var h = o._fieldsArray[c].resolve(), p = "m" + t.safeProp(h.name);
+    for (var l = 0; l < /* initializes */
+    o.fieldsArray.length; ++l) {
+      var h = o._fieldsArray[l].resolve(), p = "m" + t.safeProp(h.name);
       if (h.optional && s("if(%s!=null&&m.hasOwnProperty(%j)){", p, h.name), h.map)
         s("if(!util.isObject(%s))", p)("return%j", e(h, "object"))(
           "var k=Object.keys(%s)",
           p
-        )("for(var i=0;i<k.length;++i){"), l(s, h, "k[i]"), a(s, h, c, p + "[k[i]]")("}");
+        )("for(var i=0;i<k.length;++i){"), c(s, h, "k[i]"), a(s, h, l, p + "[k[i]]")("}");
       else if (h.repeated)
         s("if(!Array.isArray(%s))", p)("return%j", e(h, "array"))(
           "for(var i=0;i<%s.length;++i){",
           p
-        ), a(s, h, c, p + "[i]")("}");
+        ), a(s, h, l, p + "[i]")("}");
       else {
         if (h.partOf) {
           var d = t.safeProp(h.partOf.name);
           i[h.partOf.name] === 1 && s("if(p%s===1)", d)("return%j", h.partOf.name + ": multiple values"), i[h.partOf.name] = 1, s("p%s=1", d);
         }
-        a(s, h, c, p);
+        a(s, h, l, p);
       }
       h.optional && s("}");
     }
@@ -2982,17 +2976,17 @@ var converter = {}, hasRequiredConverter;
 function requireConverter() {
   return hasRequiredConverter || (hasRequiredConverter = 1, function(r) {
     var t = r, e = require_enum(), a = requireUtil();
-    function l(o, s, u, i) {
-      var c = !1;
+    function c(o, s, u, i) {
+      var l = !1;
       if (s.resolvedType)
         if (s.resolvedType instanceof e) {
           o("switch(d%s){", i);
           for (var h = s.resolvedType.values, p = Object.keys(h), d = 0; d < p.length; ++d)
-            h[p[d]] === s.typeDefault && !c && (o("default:")('if(typeof(d%s)==="number"){m%s=d%s;break}', i, i, i), s.repeated || o(
+            h[p[d]] === s.typeDefault && !l && (o("default:")('if(typeof(d%s)==="number"){m%s=d%s;break}', i, i, i), s.repeated || o(
               // fallback to default value only for
               // arrays, to avoid leaving holes.
               "break"
-            ), c = !0), o("case%j:", p[d])("case %i:", h[p[d]])("m%s=%j", i, h[p[d]])(
+            ), l = !0), o("case%j:", p[d])("case %i:", h[p[d]])("m%s=%j", i, h[p[d]])(
               "break"
             );
           o("}");
@@ -3019,7 +3013,6 @@ function requireConverter() {
             break;
           case "uint64":
             y = !0;
-          // eslint-disable-next-line no-fallthrough
           case "int64":
           case "sint64":
           case "fixed64":
@@ -3069,35 +3062,35 @@ function requireConverter() {
       );
       if (!u.length) return i("return new this.ctor");
       i("var m=new this.ctor");
-      for (var c = 0; c < u.length; ++c) {
-        var h = u[c].resolve(), p = a.safeProp(h.name);
+      for (var l = 0; l < u.length; ++l) {
+        var h = u[l].resolve(), p = a.safeProp(h.name);
         h.map ? (i("if(d%s){", p)('if(typeof d%s!=="object")', p)(
           "throw TypeError(%j)",
           h.fullName + ": object expected"
-        )("m%s={}", p)("for(var ks=Object.keys(d%s),i=0;i<ks.length;++i){", p), l(
+        )("m%s={}", p)("for(var ks=Object.keys(d%s),i=0;i<ks.length;++i){", p), c(
           i,
           h,
           /* not sorted */
-          c,
+          l,
           p + "[ks[i]]"
         )("}")("}")) : h.repeated ? (i("if(d%s){", p)("if(!Array.isArray(d%s))", p)(
           "throw TypeError(%j)",
           h.fullName + ": array expected"
-        )("m%s=[]", p)("for(var i=0;i<d%s.length;++i){", p), l(
+        )("m%s=[]", p)("for(var i=0;i<d%s.length;++i){", p), c(
           i,
           h,
           /* not sorted */
-          c,
+          l,
           p + "[i]"
         )("}")("}")) : (h.resolvedType instanceof e || i(
           // no need to test for null/undefined if an enum (uses switch)
           "if(d%s!=null){",
           p
-        ), l(
+        ), c(
           i,
           h,
           /* not sorted */
-          c,
+          l,
           p
         ), h.resolvedType instanceof e || i("}"));
       }
@@ -3116,15 +3109,14 @@ function requireConverter() {
           i
         ) : o("d%s=types[%i].toObject(m%s,o)", i, u, i);
       else {
-        var c = !1;
+        var l = !1;
         switch (s.type) {
           case "double":
           case "float":
             o("d%s=o.json&&!isFinite(m%s)?String(m%s):m%s", i, i, i, i);
             break;
           case "uint64":
-            c = !0;
-          // eslint-disable-next-line no-fallthrough
+            l = !0;
           case "int64":
           case "sint64":
           case "fixed64":
@@ -3141,7 +3133,7 @@ function requireConverter() {
               i,
               i,
               i,
-              c ? "true" : "",
+              l ? "true" : "",
               i
             );
             break;
@@ -3165,11 +3157,11 @@ function requireConverter() {
     t.toObject = function(s) {
       var u = s.fieldsArray.slice().sort(a.compareFieldsById);
       if (!u.length) return a.codegen()("return {}");
-      for (var i = a.codegen(["m", "o"], s.name + "$toObject")("if(!o)")("o={}")("var d={}"), c = [], h = [], p = [], d = 0; d < u.length; ++d)
-        u[d].partOf || (u[d].resolve().repeated ? c : u[d].map ? h : p).push(u[d]);
-      if (c.length) {
-        for (i("if(o.arrays||o.defaults){"), d = 0; d < c.length; ++d)
-          i("d%s=[]", a.safeProp(c[d].name));
+      for (var i = a.codegen(["m", "o"], s.name + "$toObject")("if(!o)")("o={}")("var d={}"), l = [], h = [], p = [], d = 0; d < u.length; ++d)
+        u[d].partOf || (u[d].resolve().repeated ? l : u[d].map ? h : p).push(u[d]);
+      if (l.length) {
+        for (i("if(o.arrays||o.defaults){"), d = 0; d < l.length; ++d)
+          i("d%s=[]", a.safeProp(l[d].name));
         i("}");
       }
       if (h.length) {
@@ -3202,12 +3194,12 @@ function requireConverter() {
               y.typeDefault.toNumber()
             );
           else if (y.bytes) {
-            var T = "[" + Array.prototype.slice.call(y.typeDefault).join(",") + "]";
+            var _ = "[" + Array.prototype.slice.call(y.typeDefault).join(",") + "]";
             i(
               "if(o.bytes===String)d%s=%j",
               g,
               String.fromCharCode.apply(String, y.typeDefault)
-            )("else{")("d%s=%s", g, T)(
+            )("else{")("d%s=%s", g, _)(
               "if(o.bytes!==Array)d%s=util.newBuffer(d%s)",
               g,
               g
@@ -3216,10 +3208,10 @@ function requireConverter() {
         }
         i("}");
       }
-      var _ = !1;
+      var w = !1;
       for (d = 0; d < u.length; ++d) {
         var y = u[d], m = s._fieldsArray.indexOf(y), g = a.safeProp(y.name);
-        y.map ? (_ || (_ = !0, i("var ks2")), i("if(m%s&&(ks2=Object.keys(m%s)).length){", g, g)("d%s={}", g)(
+        y.map ? (w || (w = !0, i("var ks2")), i("if(m%s&&(ks2=Object.keys(m%s)).length){", g, g)("d%s={}", g)(
           "for(var j=0;j<ks2.length;++j){"
         ), n(
           i,
@@ -3254,7 +3246,7 @@ var wrappers = {};
   t[".google.protobuf.Any"] = {
     fromObject: function(a) {
       if (a && a["@type"]) {
-        var l = a["@type"].substring(a["@type"].lastIndexOf("/") + 1), n = this.lookup(l);
+        var c = a["@type"].substring(a["@type"].lastIndexOf("/") + 1), n = this.lookup(c);
         if (n) {
           var o = a["@type"].charAt(0) === "." ? a["@type"].slice(1) : a["@type"];
           return o.indexOf("/") === -1 && (o = "/" + o), this.create({
@@ -3265,18 +3257,18 @@ var wrappers = {};
       }
       return this.fromObject(a);
     },
-    toObject: function(a, l) {
+    toObject: function(a, c) {
       var n = "type.googleapis.com/", o = "", s = "";
-      if (l && l.json && a.type_url && a.value) {
+      if (c && c.json && a.type_url && a.value) {
         s = a.type_url.substring(a.type_url.lastIndexOf("/") + 1), o = a.type_url.substring(0, a.type_url.lastIndexOf("/") + 1);
         var u = this.lookup(s);
         u && (a = u.decode(a.value));
       }
       if (!(a instanceof this.ctor) && a instanceof e) {
-        var i = a.$type.toObject(a, l), c = a.$type.fullName[0] === "." ? a.$type.fullName.slice(1) : a.$type.fullName;
-        return o === "" && (o = n), s = o + c, i["@type"] = s, i;
+        var i = a.$type.toObject(a, c), l = a.$type.fullName[0] === "." ? a.$type.fullName.slice(1) : a.$type.fullName;
+        return o === "" && (o = n), s = o + l, i["@type"] = s, i;
       }
-      return this.toObject(a, l);
+      return this.toObject(a, c);
     }
   };
 })(wrappers);
@@ -3286,9 +3278,9 @@ function requireType() {
   hasRequiredType = 1, type = g;
   var r = requireNamespace();
   ((g.prototype = Object.create(r.prototype)).constructor = g).className = "Type";
-  var t = require_enum(), e = requireOneof(), a = requireField(), l = requireMapfield(), n = requireService(), o = message, s = reader, u = writer, i = requireUtil(), c = requireEncoder(), h = requireDecoder(), p = requireVerifier(), d = requireConverter(), y = wrappers;
-  function g(_, m) {
-    r.call(this, _, m), this.fields = {}, this.oneofs = void 0, this.extensions = void 0, this.reserved = void 0, this.group = void 0, this._fieldsById = null, this._fieldsArray = null, this._oneofsArray = null, this._ctor = null;
+  var t = require_enum(), e = requireOneof(), a = requireField(), c = requireMapfield(), n = requireService(), o = message, s = reader, u = writer, i = requireUtil(), l = requireEncoder(), h = requireDecoder(), p = requireVerifier(), d = requireConverter(), y = wrappers;
+  function g(w, m) {
+    r.call(this, w, m), this.fields = {}, this.oneofs = void 0, this.extensions = void 0, this.reserved = void 0, this.group = void 0, this._fieldsById = null, this._fieldsArray = null, this._oneofsArray = null, this._ctor = null;
   }
   Object.defineProperties(g.prototype, {
     /**
@@ -3301,8 +3293,8 @@ function requireType() {
       get: function() {
         if (this._fieldsById) return this._fieldsById;
         this._fieldsById = {};
-        for (var _ = Object.keys(this.fields), m = 0; m < _.length; ++m) {
-          var b = this.fields[_[m]], v = b.id;
+        for (var w = Object.keys(this.fields), m = 0; m < w.length; ++m) {
+          var b = this.fields[w[m]], v = b.id;
           if (this._fieldsById[v]) throw Error("duplicate id " + v + " in " + this);
           this._fieldsById[v] = b;
         }
@@ -3341,9 +3333,9 @@ function requireType() {
       get: function() {
         return this._ctor || (this.ctor = g.generateConstructor(this)());
       },
-      set: function(_) {
-        var m = _.prototype;
-        m instanceof o || ((_.prototype = new o()).constructor = _, i.merge(_.prototype, m)), _.$type = _.prototype.$type = this, i.merge(_, o, !0), this._ctor = _;
+      set: function(w) {
+        var m = w.prototype;
+        m instanceof o || ((w.prototype = new o()).constructor = w, i.merge(w.prototype, m)), w.$type = w.prototype.$type = this, i.merge(w, o, !0), this._ctor = w;
         for (var b = 0; b < /* initializes */
         this.fieldsArray.length; ++b) this._fieldsArray[b].resolve();
         var v = {};
@@ -3353,39 +3345,39 @@ function requireType() {
             get: i.oneOfGetter(this._oneofsArray[b].oneof),
             set: i.oneOfSetter(this._oneofsArray[b].oneof)
           };
-        b && Object.defineProperties(_.prototype, v);
+        b && Object.defineProperties(w.prototype, v);
       }
     }
   }), g.generateConstructor = function(m) {
-    for (var b = i.codegen(["p"], m.name), v = 0, x; v < m.fieldsArray.length; ++v)
-      (x = m._fieldsArray[v]).map ? b("this%s={}", i.safeProp(x.name)) : x.repeated && b("this%s=[]", i.safeProp(x.name));
+    for (var b = i.codegen(["p"], m.name), v = 0, E; v < m.fieldsArray.length; ++v)
+      (E = m._fieldsArray[v]).map ? b("this%s={}", i.safeProp(E.name)) : E.repeated && b("this%s=[]", i.safeProp(E.name));
     return b("if(p)for(var ks=Object.keys(p),i=0;i<ks.length;++i)if(p[ks[i]]!=null)")(
       // omit undefined or null
       "this[ks[i]]=p[ks[i]]"
     );
   };
-  function T(_) {
-    return _._fieldsById = _._fieldsArray = _._oneofsArray = null, delete _.encode, delete _.decode, delete _.verify, _;
+  function _(w) {
+    return w._fieldsById = w._fieldsArray = w._oneofsArray = null, delete w.encode, delete w.decode, delete w.verify, w;
   }
   return g.fromJSON = function(m, b) {
     var v = new g(m, b.options);
     v.extensions = b.extensions, v.reserved = b.reserved;
-    for (var x = Object.keys(b.fields), O = 0; O < x.length; ++O)
+    for (var E = Object.keys(b.fields), T = 0; T < E.length; ++T)
       v.add(
-        (typeof b.fields[x[O]].keyType < "u" ? l.fromJSON : a.fromJSON)(
-          x[O],
-          b.fields[x[O]]
+        (typeof b.fields[E[T]].keyType < "u" ? c.fromJSON : a.fromJSON)(
+          E[T],
+          b.fields[E[T]]
         )
       );
     if (b.oneofs)
-      for (x = Object.keys(b.oneofs), O = 0; O < x.length; ++O)
-        v.add(e.fromJSON(x[O], b.oneofs[x[O]]));
+      for (E = Object.keys(b.oneofs), T = 0; T < E.length; ++T)
+        v.add(e.fromJSON(E[T], b.oneofs[E[T]]));
     if (b.nested)
-      for (x = Object.keys(b.nested), O = 0; O < x.length; ++O) {
-        var E = b.nested[x[O]];
+      for (E = Object.keys(b.nested), T = 0; T < E.length; ++T) {
+        var R = b.nested[E[T]];
         v.add(
           // most to least likely
-          (E.id !== void 0 ? a.fromJSON : E.fields !== void 0 ? g.fromJSON : E.values !== void 0 ? t.fromJSON : E.methods !== void 0 ? n.fromJSON : r.fromJSON)(x[O], E)
+          (R.id !== void 0 ? a.fromJSON : R.fields !== void 0 ? g.fromJSON : R.values !== void 0 ? t.fromJSON : R.methods !== void 0 ? n.fromJSON : r.fromJSON)(E[T], R)
         );
       }
     return b.extensions && b.extensions.length && (v.extensions = b.extensions), b.reserved && b.reserved.length && (v.reserved = b.reserved), b.group && (v.group = !0), b.comment && (v.comment = b.comment), v;
@@ -3398,8 +3390,8 @@ function requireType() {
       r.arrayToJSON(this.oneofsArray, m),
       "fields",
       r.arrayToJSON(
-        this.fieldsArray.filter(function(x) {
-          return !x.declaringField;
+        this.fieldsArray.filter(function(E) {
+          return !E.declaringField;
         }),
         m
       ) || {},
@@ -3432,19 +3424,19 @@ function requireType() {
       if (this.isReservedId(m.id)) throw Error("id " + m.id + " is reserved in " + this);
       if (this.isReservedName(m.name))
         throw Error("name '" + m.name + "' is reserved in " + this);
-      return m.parent && m.parent.remove(m), this.fields[m.name] = m, m.message = this, m.onAdd(this), T(this);
+      return m.parent && m.parent.remove(m), this.fields[m.name] = m, m.message = this, m.onAdd(this), _(this);
     }
-    return m instanceof e ? (this.oneofs || (this.oneofs = {}), this.oneofs[m.name] = m, m.onAdd(this), T(this)) : r.prototype.add.call(this, m);
+    return m instanceof e ? (this.oneofs || (this.oneofs = {}), this.oneofs[m.name] = m, m.onAdd(this), _(this)) : r.prototype.add.call(this, m);
   }, g.prototype.remove = function(m) {
     if (m instanceof a && m.extend === void 0) {
       if (!this.fields || this.fields[m.name] !== m)
         throw Error(m + " is not a member of " + this);
-      return delete this.fields[m.name], m.parent = null, m.onRemove(this), T(this);
+      return delete this.fields[m.name], m.parent = null, m.onRemove(this), _(this);
     }
     if (m instanceof e) {
       if (!this.oneofs || this.oneofs[m.name] !== m)
         throw Error(m + " is not a member of " + this);
-      return delete this.oneofs[m.name], m.parent = null, m.onRemove(this), T(this);
+      return delete this.oneofs[m.name], m.parent = null, m.onRemove(this), _(this);
     }
     return r.prototype.remove.call(this, m);
   }, g.prototype.isReservedId = function(m) {
@@ -3457,7 +3449,7 @@ function requireType() {
     for (var m = this.fullName, b = [], v = 0; v < /* initializes */
     this.fieldsArray.length; ++v)
       b.push(this._fieldsArray[v].resolve().resolvedType);
-    this.encode = c(this)({
+    this.encode = l(this)({
       Writer: u,
       types: b,
       util: i
@@ -3475,10 +3467,10 @@ function requireType() {
       types: b,
       util: i
     });
-    var x = y[m];
-    if (x) {
-      var O = Object.create(this);
-      O.fromObject = this.fromObject, this.fromObject = x.fromObject.bind(O), O.toObject = this.toObject, this.toObject = x.toObject.bind(O);
+    var E = y[m];
+    if (E) {
+      var T = Object.create(this);
+      T.fromObject = this.fromObject, this.fromObject = E.fromObject.bind(T), T.toObject = this.toObject, this.toObject = E.toObject.bind(T);
     }
     return this;
   }, g.prototype.encode = function(m, b) {
@@ -3507,90 +3499,90 @@ function requireRoot() {
   hasRequiredRoot = 1, root$1 = u;
   var r = requireNamespace();
   ((u.prototype = Object.create(r.prototype)).constructor = u).className = "Root";
-  var t = requireField(), e = require_enum(), a = requireOneof(), l = requireUtil(), n, o, s;
+  var t = requireField(), e = require_enum(), a = requireOneof(), c = requireUtil(), n, o, s;
   function u(p) {
     r.call(this, "", p), this.deferred = [], this.files = [];
   }
   u.fromJSON = function(d, y) {
     return y || (y = new u()), d.options && y.setOptions(d.options), y.addJSON(d.nested);
-  }, u.prototype.resolvePath = l.path.resolve, u.prototype.fetch = l.fetch;
+  }, u.prototype.resolvePath = c.path.resolve, u.prototype.fetch = c.fetch;
   function i() {
   }
   u.prototype.load = function p(d, y, g) {
     typeof y == "function" && (g = y, y = void 0);
-    var T = this;
-    if (!g) return l.asPromise(p, T, d, y);
-    var _ = g === i;
-    function m(S, $) {
+    var _ = this;
+    if (!g) return c.asPromise(p, _, d, y);
+    var w = g === i;
+    function m(A, $) {
       if (g) {
-        if (_) throw S;
+        if (w) throw A;
         var k = g;
-        g = null, k(S, $);
+        g = null, k(A, $);
       }
     }
-    function b(S) {
-      var $ = S.lastIndexOf("google/protobuf/");
+    function b(A) {
+      var $ = A.lastIndexOf("google/protobuf/");
       if ($ > -1) {
-        var k = S.substring($);
+        var k = A.substring($);
         if (k in s) return k;
       }
       return null;
     }
-    function v(S, $) {
+    function v(A, $) {
       try {
-        if (l.isString($) && $.charAt(0) === "{" && ($ = JSON.parse($)), !l.isString($)) T.setOptions($.options).addJSON($.nested);
+        if (c.isString($) && $.charAt(0) === "{" && ($ = JSON.parse($)), !c.isString($)) _.setOptions($.options).addJSON($.nested);
         else {
-          o.filename = S;
-          var k = o($, T, y), D, M = 0;
+          o.filename = A;
+          var k = o($, _, y), D, M = 0;
           if (k.imports)
             for (; M < k.imports.length; ++M)
-              (D = b(k.imports[M]) || T.resolvePath(S, k.imports[M])) && x(D);
+              (D = b(k.imports[M]) || _.resolvePath(A, k.imports[M])) && E(D);
           if (k.weakImports)
             for (M = 0; M < k.weakImports.length; ++M)
-              (D = b(k.weakImports[M]) || T.resolvePath(S, k.weakImports[M])) && x(D, !0);
+              (D = b(k.weakImports[M]) || _.resolvePath(A, k.weakImports[M])) && E(D, !0);
         }
       } catch (L) {
         m(L);
       }
-      !_ && !O && m(null, T);
+      !w && !T && m(null, _);
     }
-    function x(S, $) {
-      if (S = b(S) || S, !(T.files.indexOf(S) > -1)) {
-        if (T.files.push(S), S in s) {
-          _ ? v(S, s[S]) : (++O, setTimeout(function() {
-            --O, v(S, s[S]);
+    function E(A, $) {
+      if (A = b(A) || A, !(_.files.indexOf(A) > -1)) {
+        if (_.files.push(A), A in s) {
+          w ? v(A, s[A]) : (++T, setTimeout(function() {
+            --T, v(A, s[A]);
           }));
           return;
         }
-        if (_) {
+        if (w) {
           var k;
           try {
-            k = l.fs.readFileSync(S).toString("utf8");
+            k = c.fs.readFileSync(A).toString("utf8");
           } catch (D) {
             $ || m(D);
             return;
           }
-          v(S, k);
+          v(A, k);
         } else
-          ++O, T.fetch(S, function(D, M) {
-            if (--O, !!g) {
+          ++T, _.fetch(A, function(D, M) {
+            if (--T, !!g) {
               if (D) {
-                $ ? O || m(null, T) : m(D);
+                $ ? T || m(null, _) : m(D);
                 return;
               }
-              v(S, M);
+              v(A, M);
             }
           });
       }
     }
-    var O = 0;
-    l.isString(d) && (d = [d]);
-    for (var E = 0, q; E < d.length; ++E)
-      (q = T.resolvePath("", d[E])) && x(q);
-    if (_) return T;
-    O || m(null, T);
+    var T = 0;
+    c.isString(d) && (d = [d]);
+    for (var R = 0, q; R < d.length; ++R)
+      (q = _.resolvePath("", d[R])) && E(q);
+    if (w) return _;
+    T || m(null, _);
   }, u.prototype.loadSync = function(d, y) {
-    if (!l.isNode) throw Error("not supported");
+    if (!c.isNode) throw Error("not supported");
     return this.load(d, y, i);
   }, u.prototype.resolveAll = function() {
     if (this.deferred.length)
@@ -3601,7 +3593,7 @@ function requireRoot() {
       );
     return r.prototype.resolveAll.call(this);
   };
-  var c = /^[A-Z]/;
+  var l = /^[A-Z]/;
   function h(p, d) {
     var y = d.parent.lookup(d.extend);
     if (y) {
@@ -3623,7 +3615,7 @@ function requireRoot() {
       d.extend !== void 0 && /* not already handled */
       !d.extensionField && (h(this, d) || this.deferred.push(d));
     else if (d instanceof e)
-      c.test(d.name) && (d.parent[d.name] = d.values);
+      l.test(d.name) && (d.parent[d.name] = d.values);
     else if (!(d instanceof a)) {
       if (d instanceof n)
         for (var y = 0; y < this.deferred.length; )
@@ -3631,7 +3623,7 @@ function requireRoot() {
       for (var g = 0; g < /* initializes */
       d.nestedArray.length; ++g)
         this._handleAdd(d._nestedArray[g]);
-      c.test(d.name) && (d.parent[d.name] = d);
+      l.test(d.name) && (d.parent[d.name] = d);
     }
   }, u.prototype._handleRemove = function(d) {
     if (d instanceof t) {
@@ -3649,12 +3641,12 @@ function requireRoot() {
           y > -1 && this.deferred.splice(y, 1);
         }
     } else if (d instanceof e)
-      c.test(d.name) && delete d.parent[d.name];
+      l.test(d.name) && delete d.parent[d.name];
     else if (d instanceof r) {
       for (var g = 0; g < /* initializes */
       d.nestedArray.length; ++g)
         this._handleRemove(d._nestedArray[g]);
-      c.test(d.name) && delete d.parent[d.name];
+      l.test(d.name) && delete d.parent[d.name];
     }
   }, u._configure = function(p, d, y) {
     n = p, o = d, s = y;
@@ -3667,39 +3659,39 @@ function requireUtil() {
   var r = util$2.exports = requireMinimal(), t = roots, e, a;
   r.codegen = codegen_1, r.fetch = fetch_1, r.path = path, r.fs = r.inquire("fs"), r.toArray = function(i) {
     if (i) {
-      for (var c = Object.keys(i), h = new Array(c.length), p = 0; p < c.length; ) h[p] = i[c[p++]];
+      for (var l = Object.keys(i), h = new Array(l.length), p = 0; p < l.length; ) h[p] = i[l[p++]];
       return h;
     }
     return [];
   }, r.toObject = function(i) {
-    for (var c = {}, h = 0; h < i.length; ) {
+    for (var l = {}, h = 0; h < i.length; ) {
       var p = i[h++], d = i[h++];
-      d !== void 0 && (c[p] = d);
+      d !== void 0 && (l[p] = d);
     }
-    return c;
+    return l;
   };
-  var l = /\\/g, n = /"/g;
+  var c = /\\/g, n = /"/g;
   r.isReserved = function(i) {
     return /^(?:do|if|in|for|let|new|try|var|case|else|enum|eval|false|null|this|true|void|with|break|catch|class|const|super|throw|while|yield|delete|export|import|public|return|static|switch|typeof|default|extends|finally|package|private|continue|debugger|function|arguments|interface|protected|implements|instanceof)$/.test(
       i
     );
   }, r.safeProp = function(i) {
-    return !/^[$\w_]+$/.test(i) || r.isReserved(i) ? '["' + i.replace(l, "\\\\").replace(n, '\\"') + '"]' : "." + i;
+    return !/^[$\w_]+$/.test(i) || r.isReserved(i) ? '["' + i.replace(c, "\\\\").replace(n, '\\"') + '"]' : "." + i;
   }, r.ucFirst = function(i) {
     return i.charAt(0).toUpperCase() + i.substring(1);
   };
   var o = /_([a-z])/g;
   r.camelCase = function(i) {
-    return i.substring(0, 1) + i.substring(1).replace(o, function(c, h) {
+    return i.substring(0, 1) + i.substring(1).replace(o, function(l, h) {
       return h.toUpperCase();
     });
-  }, r.compareFieldsById = function(i, c) {
-    return i.id - c.id;
-  }, r.decorateType = function(i, c) {
+  }, r.compareFieldsById = function(i, l) {
+    return i.id - l.id;
+  }, r.decorateType = function(i, l) {
     if (i.$type)
-      return c && i.$type.name !== c && (r.decorateRoot.remove(i.$type), i.$type.name = c, r.decorateRoot.add(i.$type)), i.$type;
+      return l && i.$type.name !== l && (r.decorateRoot.remove(i.$type), i.$type.name = l, r.decorateRoot.add(i.$type)), i.$type;
     e || (e = requireType());
-    var h = new e(c || i.name);
+    var h = new e(l || i.name);
     return r.decorateRoot.add(h), h.ctor = i, Object.defineProperty(i, "$type", {
       value: h,
       enumerable: !1
@@ -3712,27 +3704,27 @@ function requireUtil() {
   return r.decorateEnum = function(i) {
     if (i.$type) return i.$type;
     a || (a = require_enum());
-    var c = new a("Enum" + s++, i);
-    return r.decorateRoot.add(c), Object.defineProperty(i, "$type", {
-      value: c,
+    var l = new a("Enum" + s++, i);
+    return r.decorateRoot.add(l), Object.defineProperty(i, "$type", {
+      value: l,
       enumerable: !1
-    }), c;
-  }, r.setProperty = function(i, c, h) {
+    }), l;
+  }, r.setProperty = function(i, l, h) {
     function p(d, y, g) {
-      var T = y.shift();
-      if (T === "__proto__" || T === "prototype")
+      var _ = y.shift();
+      if (_ === "__proto__" || _ === "prototype")
         return d;
       if (y.length > 0)
-        d[T] = p(d[T] || {}, y, g);
+        d[_] = p(d[_] || {}, y, g);
       else {
-        var _ = d[T];
-        _ && (g = [].concat(_).concat(g)), d[T] = g;
+        var w = d[_];
+        w && (g = [].concat(w).concat(g)), d[_] = g;
       }
       return d;
     }
     if (typeof i != "object") throw TypeError("dst must be an object");
-    if (!c) throw TypeError("path must be specified");
-    return c = c.split("."), p(i, c, h);
+    if (!l) throw TypeError("path must be specified");
+    return l = l.split("."), p(i, l, h);
   }, Object.defineProperty(r, "decorateRoot", {
     get: function() {
       return t.decorated || (t.decorated = new (requireRoot())());
@@ -3744,10 +3736,10 @@ function requireObject() {
   if (hasRequiredObject) return object;
   hasRequiredObject = 1, object = e, e.className = "ReflectionObject";
   var r = requireUtil(), t;
-  function e(a, l) {
+  function e(a, c) {
     if (!r.isString(a)) throw TypeError("name must be a string");
-    if (l && !r.isObject(l)) throw TypeError("options must be an object");
-    this.options = l, this.parsedOptions = null, this.name = a, this.parent = null, this.resolved = !1, this.comment = null, this.filename = null;
+    if (c && !r.isObject(c)) throw TypeError("options must be an object");
+    this.options = c, this.parsedOptions = null, this.name = a, this.parent = null, this.resolved = !1, this.comment = null, this.filename = null;
   }
   return Object.defineProperties(e.prototype, {
     /**
@@ -3770,52 +3762,52 @@ function requireObject() {
      */
     fullName: {
       get: function() {
-        for (var a = [this.name], l = this.parent; l; )
-          a.unshift(l.name), l = l.parent;
+        for (var a = [this.name], c = this.parent; c; )
+          a.unshift(c.name), c = c.parent;
         return a.join(".");
       }
     }
   }), e.prototype.toJSON = /* istanbul ignore next */
   function() {
     throw Error();
-  }, e.prototype.onAdd = function(l) {
-    this.parent && this.parent !== l && this.parent.remove(this), this.parent = l, this.resolved = !1;
-    var n = l.root;
+  }, e.prototype.onAdd = function(c) {
+    this.parent && this.parent !== c && this.parent.remove(this), this.parent = c, this.resolved = !1;
+    var n = c.root;
     n instanceof t && n._handleAdd(this);
-  }, e.prototype.onRemove = function(l) {
-    var n = l.root;
+  }, e.prototype.onRemove = function(c) {
+    var n = c.root;
     n instanceof t && n._handleRemove(this), this.parent = null, this.resolved = !1;
   }, e.prototype.resolve = function() {
     return this.resolved ? this : (this.root instanceof t && (this.resolved = !0), this);
-  }, e.prototype.getOption = function(l) {
-    if (this.options) return this.options[l];
-  }, e.prototype.setOption = function(l, n, o) {
-    return (!o || !this.options || this.options[l] === void 0) && ((this.options || (this.options = {}))[l] = n), this;
-  }, e.prototype.setParsedOption = function(l, n, o) {
+  }, e.prototype.getOption = function(c) {
+    if (this.options) return this.options[c];
+  }, e.prototype.setOption = function(c, n, o) {
+    return (!o || !this.options || this.options[c] === void 0) && ((this.options || (this.options = {}))[c] = n), this;
+  }, e.prototype.setParsedOption = function(c, n, o) {
     this.parsedOptions || (this.parsedOptions = []);
     var s = this.parsedOptions;
     if (o) {
       var u = s.find(function(h) {
-        return Object.prototype.hasOwnProperty.call(h, l);
+        return Object.prototype.hasOwnProperty.call(h, c);
       });
       if (u) {
-        var i = u[l];
+        var i = u[c];
         r.setProperty(i, o, n);
       } else
-        u = {}, u[l] = r.setProperty({}, o, n), s.push(u);
+        u = {}, u[c] = r.setProperty({}, o, n), s.push(u);
     } else {
-      var c = {};
-      c[l] = n, s.push(c);
+      var l = {};
+      l[c] = n, s.push(l);
     }
     return this;
-  }, e.prototype.setOptions = function(l, n) {
-    if (l)
-      for (var o = Object.keys(l), s = 0; s < o.length; ++s)
-        this.setOption(o[s], l[o[s]], n);
+  }, e.prototype.setOptions = function(c, n) {
+    if (c)
+      for (var o = Object.keys(c), s = 0; s < o.length; ++s)
+        this.setOption(o[s], c[o[s]], n);
     return this;
   }, e.prototype.toString = function() {
-    var l = this.constructor.className, n = this.fullName;
-    return n.length ? l + " " + n : l;
+    var c = this.constructor.className, n = this.fullName;
+    return n.length ? c + " " + n : c;
   }, e._configure = function(a) {
     t = a;
   }, object;
@@ -3827,11 +3819,11 @@ function require_enum() {
   var r = requireObject();
   ((a.prototype = Object.create(r.prototype)).constructor = a).className = "Enum";
   var t = requireNamespace(), e = requireUtil();
-  function a(l, n, o, s, u, i) {
-    if (r.call(this, l, o), n && typeof n != "object") throw TypeError("values must be an object");
+  function a(c, n, o, s, u, i) {
+    if (r.call(this, c, o), n && typeof n != "object") throw TypeError("values must be an object");
     if (this.valuesById = {}, this.values = Object.create(this.valuesById), this.comment = s, this.comments = u || {}, this.valuesOptions = i, this.reserved = void 0, n)
-      for (var c = Object.keys(n), h = 0; h < c.length; ++h)
-        typeof n[c[h]] == "number" && (this.valuesById[this.values[c[h]] = n[c[h]]] = c[h]);
+      for (var l = Object.keys(n), h = 0; h < l.length; ++h)
+        typeof n[l[h]] == "number" && (this.valuesById[this.values[l[h]] = n[l[h]]] = l[h]);
   }
   return a.fromJSON = function(n, o) {
     var s = new a(n, o.values, o.options, o.comment, o.comments);
@@ -3878,7 +3870,7 @@ function require_enum() {
 var encoder_1, hasRequiredEncoder;
 function requireEncoder() {
   if (hasRequiredEncoder) return encoder_1;
-  hasRequiredEncoder = 1, encoder_1 = l;
+  hasRequiredEncoder = 1, encoder_1 = c;
   var r = require_enum(), t = requireTypes(), e = requireUtil();
   function a(n, o, s, u) {
     return o.resolvedType.group ? n(
@@ -3894,33 +3886,33 @@ function requireEncoder() {
       (o.id << 3 | 2) >>> 0
     );
   }
-  function l(n) {
+  function c(n) {
     for (var o = e.codegen(["m", "w"], n.name + "$encode")("if(!w)")("w=Writer.create()"), s, u, i = (
       /* initializes */
       n.fieldsArray.slice().sort(e.compareFieldsById)
     ), s = 0; s < i.length; ++s) {
-      var c = i[s].resolve(), h = n._fieldsArray.indexOf(c), p = c.resolvedType instanceof r ? "int32" : c.type, d = t.basic[p];
-      u = "m" + e.safeProp(c.name), c.map ? (o(
+      var l = i[s].resolve(), h = n._fieldsArray.indexOf(l), p = l.resolvedType instanceof r ? "int32" : l.type, d = t.basic[p];
+      u = "m" + e.safeProp(l.name), l.map ? (o(
         "if(%s!=null&&Object.hasOwnProperty.call(m,%j)){",
         u,
-        c.name
+        l.name
       )(
         // !== undefined && !== null
         "for(var ks=Object.keys(%s),i=0;i<ks.length;++i){",
         u
       )(
         "w.uint32(%i).fork().uint32(%i).%s(ks[i])",
-        (c.id << 3 | 2) >>> 0,
-        8 | t.mapKey[c.keyType],
-        c.keyType
-      ), d === void 0 ? o("types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()", h, u) : o(".uint32(%i).%s(%s[ks[i]]).ldelim()", 16 | d, p, u), o("}")("}")) : c.repeated ? (o("if(%s!=null&&%s.length){", u, u), c.packed && t.packed[p] !== void 0 ? o("w.uint32(%i).fork()", (c.id << 3 | 2) >>> 0)(
+        (l.id << 3 | 2) >>> 0,
+        8 | t.mapKey[l.keyType],
+        l.keyType
+      ), d === void 0 ? o("types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()", h, u) : o(".uint32(%i).%s(%s[ks[i]]).ldelim()", 16 | d, p, u), o("}")("}")) : l.repeated ? (o("if(%s!=null&&%s.length){", u, u), l.packed && t.packed[p] !== void 0 ? o("w.uint32(%i).fork()", (l.id << 3 | 2) >>> 0)(
         "for(var i=0;i<%s.length;++i)",
         u
       )(
         "w.%s(%s[i])",
         p,
         u
-      )("w.ldelim()") : (o("for(var i=0;i<%s.length;++i)", u), d === void 0 ? a(o, c, h, u + "[i]") : o("w.uint32(%i).%s(%s[i])", (c.id << 3 | d) >>> 0, p, u)), o("}")) : (c.optional && o("if(%s!=null&&Object.hasOwnProperty.call(m,%j))", u, c.name), d === void 0 ? a(o, c, h, u) : o("w.uint32(%i).%s(%s)", (c.id << 3 | d) >>> 0, p, u));
+      )("w.ldelim()") : (o("for(var i=0;i<%s.length;++i)", u), d === void 0 ? a(o, l, h, u + "[i]") : o("w.uint32(%i).%s(%s[i])", (l.id << 3 | d) >>> 0, p, u)), o("}")) : (l.optional && o("if(%s!=null&&Object.hasOwnProperty.call(m,%j))", u, l.name), d === void 0 ? a(o, l, h, u) : o("w.uint32(%i).%s(%s)", (l.id << 3 | d) >>> 0, p, u));
     }
     return o("return w");
   }
@@ -3979,89 +3971,89 @@ function unescape(r) {
 tokenize$1.unescape = unescape;
 function tokenize$1(r, t) {
   r = r.toString();
-  var e = 0, a = r.length, l = 1, n = 0, o = {}, s = [], u = null;
+  var e = 0, a = r.length, c = 1, n = 0, o = {}, s = [], u = null;
   function i(v) {
-    return Error("illegal " + v + " (line " + l + ")");
+    return Error("illegal " + v + " (line " + c + ")");
   }
-  function c() {
+  function l() {
     var v = u === "'" ? stringSingleRe : stringDoubleRe;
     v.lastIndex = e - 1;
-    var x = v.exec(r);
-    if (!x) throw i("string");
-    return e = v.lastIndex, T(u), u = null, unescape(x[1]);
+    var E = v.exec(r);
+    if (!E) throw i("string");
+    return e = v.lastIndex, _(u), u = null, unescape(E[1]);
   }
   function h(v) {
     return r.charAt(v);
   }
-  function p(v, x, O) {
-    var E = {
+  function p(v, E, T) {
+    var R = {
       type: r.charAt(v++),
       lineEmpty: !1,
-      leading: O
+      leading: T
     }, q;
     t ? q = 2 : q = 3;
-    var S = v - q, $;
+    var A = v - q, $;
     do
-      if (--S < 0 || ($ = r.charAt(S)) === `
+      if (--A < 0 || ($ = r.charAt(A)) === `
 `) {
-        E.lineEmpty = !0;
+        R.lineEmpty = !0;
         break;
       }
     while ($ === " " || $ === "	");
-    for (var k = r.substring(v, x).split(setCommentSplitRe), D = 0; D < k.length; ++D)
+    for (var k = r.substring(v, E).split(setCommentSplitRe), D = 0; D < k.length; ++D)
       k[D] = k[D].replace(t ? setCommentAltRe : setCommentRe, "").trim();
-    E.text = k.join(`
-`).trim(), o[l] = E, n = l;
+    R.text = k.join(`
+`).trim(), o[c] = R, n = c;
   }
   function d(v) {
-    var x = y(v), O = r.substring(v, x), E = /^\s*\/\//.test(O);
-    return E;
+    var E = y(v), T = r.substring(v, E), R = /^\s*\/\//.test(T);
+    return R;
   }
   function y(v) {
-    for (var x = v; x < a && h(x) !== `
+    for (var E = v; E < a && h(E) !== `
 `; )
-      x++;
-    return x;
+      E++;
+    return E;
   }
   function g() {
     if (s.length > 0) return s.shift();
-    if (u) return c();
-    var v, x, O, E, q, S = e === 0;
+    if (u) return l();
+    var v, E, T, R, q, A = e === 0;
     do {
       if (e === a) return null;
-      for (v = !1; whitespaceRe.test(O = h(e)); )
-        if (O === `
-` && (S = !0, ++l), ++e === a) return null;
+      for (v = !1; whitespaceRe.test(T = h(e)); )
+        if (T === `
+` && (A = !0, ++c), ++e === a) return null;
       if (h(e) === "/") {
         if (++e === a)
           throw i("comment");
         if (h(e) === "/")
           if (t) {
-            if (E = e, q = !1, d(e - 1)) {
+            if (R = e, q = !1, d(e - 1)) {
               q = !0;
               do
-                if (e = y(e), e === a || (e++, !S))
+                if (e = y(e), e === a || (e++, !A))
                   break;
               while (d(e));
             } else
               e = Math.min(a, y(e) + 1);
-            q && (p(E, e, S), S = !0), l++, v = !0;
+            q && (p(R, e, A), A = !0), c++, v = !0;
           } else {
-            for (q = h(E = e + 1) === "/"; h(++e) !== `
+            for (q = h(R = e + 1) === "/"; h(++e) !== `
 `; )
               if (e === a)
                 return null;
-            ++e, q && (p(E, e - 1, S), S = !0), ++l, v = !0;
+            ++e, q && (p(R, e - 1, A), A = !0), ++c, v = !0;
           }
-        else if ((O = h(e)) === "*") {
-          E = e + 1, q = t || h(E) === "*";
+        else if ((T = h(e)) === "*") {
+          R = e + 1, q = t || h(R) === "*";
           do {
-            if (O === `
-` && ++l, ++e === a)
+            if (T === `
+` && ++c, ++e === a)
               throw i("comment");
-            x = O, O = h(e);
-          } while (x !== "*" || O !== "/");
-          ++e, q && (p(E, e - 2, S), S = !0), v = !0;
+            E = T, T = h(e);
+          } while (E !== "*" || T !== "/");
+          ++e, q && (p(R, e - 2, A), A = !0), v = !0;
         } else
           return "/";
       }
@@ -4073,40 +4065,40 @@ function tokenize$1(r, t) {
     var D = r.substring(e, e = $);
     return (D === '"' || D === "'") && (u = D), D;
   }
-  function T(v) {
+  function _(v) {
     s.push(v);
   }
-  function _() {
+  function w() {
     if (!s.length) {
       var v = g();
       if (v === null) return null;
-      T(v);
+      _(v);
     }
     return s[0];
   }
-  function m(v, x) {
-    var O = _(), E = O === v;
-    if (E)
+  function m(v, E) {
+    var T = w(), R = T === v;
+    if (R)
       return g(), !0;
-    if (!x) throw i("token '" + O + "', '" + v + "' expected");
+    if (!E) throw i("token '" + T + "', '" + v + "' expected");
     return !1;
   }
   function b(v) {
-    var x = null, O;
-    return v === void 0 ? (O = o[l - 1], delete o[l - 1], O && (t || O.type === "*" || O.lineEmpty) && (x = O.leading ? O.text : null)) : (n < v && _(), O = o[v], delete o[v], O && !O.lineEmpty && (t || O.type === "/") && (x = O.leading ? null : O.text)), x;
+    var E = null, T;
+    return v === void 0 ? (T = o[c - 1], delete o[c - 1], T && (t || T.type === "*" || T.lineEmpty) && (E = T.leading ? T.text : null)) : (n < v && w(), T = o[v], delete o[v], T && !T.lineEmpty && (t || T.type === "/") && (E = T.leading ? null : T.text)), E;
   }
   return Object.defineProperty(
     {
       next: g,
-      peek: _,
-      push: T,
+      peek: w,
+      push: _,
       skip: m,
       cmnt: b
     },
     "line",
     {
       get: function() {
-        return l;
+        return c;
       }
     }
   );
@@ -4119,29 +4111,29 @@ parse.defaults = {
 var tokenize = tokenize_1, Root = requireRoot(), Type = requireType(), Field = requireField(), MapField = requireMapfield(), OneOf = requireOneof(), Enum = require_enum(), Service = requireService(), Method = requireMethod(), types = requireTypes(), util = requireUtil(), base10Re = /^[1-9][0-9]*$/, base10NegRe = /^-?[1-9][0-9]*$/, base16Re = /^0[x][0-9a-fA-F]+$/, base16NegRe = /^-?0[x][0-9a-fA-F]+$/, base8Re = /^0[0-7]+$/, base8NegRe = /^-?0[0-7]+$/, numberRe = /^(?![eE])[0-9]*(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/, nameRe = /^[a-zA-Z_][a-zA-Z_0-9]*$/, typeRefRe = /^(?:\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\.[a-zA-Z_][a-zA-Z_0-9]*)*$/, fqTypeRefRe = /^(?:\.[a-zA-Z_][a-zA-Z_0-9]*)+$/;
 function parse(r, t, e) {
   t instanceof Root || (e = t, t = new Root()), e || (e = parse.defaults);
-  var a = e.preferTrailingComment || !1, l = tokenize(r, e.alternateCommentMode || !1), n = l.next, o = l.push, s = l.peek, u = l.skip, i = l.cmnt, c = !0, h, p, d, y, g = !1, T = t, _ = e.keepCase ? function(w) {
-    return w;
+  var a = e.preferTrailingComment || !1, c = tokenize(r, e.alternateCommentMode || !1), n = c.next, o = c.push, s = c.peek, u = c.skip, i = c.cmnt, l = !0, h, p, d, y, g = !1, _ = t, w = e.keepCase ? function(O) {
+    return O;
   } : util.camelCase;
-  function m(w, R, A) {
+  function m(O, x, S) {
     var N = parse.filename;
-    return A || (parse.filename = null), Error(
-      "illegal " + (R || "token") + " '" + w + "' (" + (N ? N + ", " : "") + "line " + l.line + ")"
+    return S || (parse.filename = null), Error(
+      "illegal " + (x || "token") + " '" + O + "' (" + (N ? N + ", " : "") + "line " + c.line + ")"
     );
   }
   function b() {
-    var w = [], R;
+    var O = [], x;
     do {
-      if ((R = n()) !== '"' && R !== "'") throw m(R);
-      w.push(n()), u(R), R = s();
-    } while (R === '"' || R === "'");
-    return w.join("");
+      if ((x = n()) !== '"' && x !== "'") throw m(x);
+      O.push(n()), u(x), x = s();
+    } while (x === '"' || x === "'");
+    return O.join("");
   }
   function v() {
-    var w = n();
-    switch (w) {
+    var O = n();
+    switch (O) {
       case "'":
       case '"':
-        return o(w), b();
+        return o(O), b();
       case "true":
       case "TRUE":
         return !0;
@@ -4150,20 +4142,20 @@ function parse(r, t, e) {
         return !1;
     }
     try {
-      return O(
-        w,
+      return T(
+        O,
         /* insideTryCatch */
         !0
       );
     } catch {
-      if (typeRefRe.test(w)) return w;
-      throw m(w, "value");
+      if (typeRefRe.test(O)) return O;
+      throw m(O, "value");
     }
   }
-  function x(w, R) {
-    var A, N;
+  function E(O, x) {
+    var S, N;
     do
-      R && ((A = s()) === '"' || A === "'") ? w.push(b()) : w.push([N = E(n()), u("to", !0) ? E(n()) : N]);
+      x && ((S = s()) === '"' || S === "'") ? O.push(b()) : O.push([N = R(n()), u("to", !0) ? R(n()) : N]);
     while (u(",", !0));
     var I = {
       options: void 0
@@ -4178,17 +4170,17 @@ function parse(r, t, e) {
         else throw m(C);
       },
       function() {
-        z(I);
+        W(I);
       }
     );
   }
-  function O(w, R) {
-    var A = 1;
-    switch (w.charAt(0) === "-" && (A = -1, w = w.substring(1)), w) {
+  function T(O, x) {
+    var S = 1;
+    switch (O.charAt(0) === "-" && (S = -1, O = O.substring(1)), O) {
       case "inf":
       case "INF":
       case "Inf":
-        return A * (1 / 0);
+        return S * (1 / 0);
       case "nan":
       case "NAN":
       case "Nan":
@@ -4197,14 +4189,14 @@ function parse(r, t, e) {
       case "0":
         return 0;
     }
-    if (base10Re.test(w)) return A * parseInt(w, 10);
-    if (base16Re.test(w)) return A * parseInt(w, 16);
-    if (base8Re.test(w)) return A * parseInt(w, 8);
-    if (numberRe.test(w)) return A * parseFloat(w);
-    throw m(w, "number", R);
-  }
-  function E(w, R) {
-    switch (w) {
+    if (base10Re.test(O)) return S * parseInt(O, 10);
+    if (base16Re.test(O)) return S * parseInt(O, 16);
+    if (base8Re.test(O)) return S * parseInt(O, 8);
+    if (numberRe.test(O)) return S * parseFloat(O);
+    throw m(O, "number", x);
+  }
+  function R(O, x) {
+    switch (O) {
       case "max":
       case "MAX":
       case "Max":
@@ -4212,95 +4204,94 @@ function parse(r, t, e) {
       case "0":
         return 0;
     }
-    if (!R && w.charAt(0) === "-") throw m(w, "id");
-    if (base10NegRe.test(w)) return parseInt(w, 10);
-    if (base16NegRe.test(w)) return parseInt(w, 16);
-    if (base8NegRe.test(w)) return parseInt(w, 8);
-    throw m(w, "id");
+    if (!x && O.charAt(0) === "-") throw m(O, "id");
+    if (base10NegRe.test(O)) return parseInt(O, 10);
+    if (base16NegRe.test(O)) return parseInt(O, 16);
+    if (base8NegRe.test(O)) return parseInt(O, 8);
+    throw m(O, "id");
   }
   function q() {
     if (h !== void 0) throw m("package");
     if (h = n(), !typeRefRe.test(h)) throw m(h, "name");
-    T = T.define(h), u(";");
+    _ = _.define(h), u(";");
   }
-  function S() {
-    var w = s(), R;
-    switch (w) {
+  function A() {
+    var O = s(), x;
+    switch (O) {
       case "weak":
-        R = d || (d = []), n();
+        x = d || (d = []), n();
         break;
       case "public":
         n();
-      // eslint-disable-next-line no-fallthrough
       default:
-        R = p || (p = []);
+        x = p || (p = []);
         break;
     }
-    w = b(), u(";"), R.push(w);
+    O = b(), u(";"), x.push(O);
   }
   function $() {
     if (u("="), y = b(), g = y === "proto3", !g && y !== "proto2") throw m(y, "syntax");
     t.setOption("syntax", y), u(";");
   }
-  function k(w, R) {
-    switch (R) {
+  function k(O, x) {
+    switch (x) {
       case "option":
-        return j(w, R), u(";"), !0;
+        return j(O, x), u(";"), !0;
       case "message":
-        return M(w, R), !0;
+        return M(O, x), !0;
       case "enum":
-        return J(w, R), !0;
+        return J(O, x), !0;
       case "service":
-        return te(w, R), !0;
+        return te(O, x), !0;
       case "extend":
-        return ie(w, R), !0;
+        return ie(O, x), !0;
     }
     return !1;
   }
-  function D(w, R, A) {
-    var N = l.line;
-    if (w && (typeof w.comment != "string" && (w.comment = i()), w.filename = parse.filename), u("{", !0)) {
-      for (var I; (I = n()) !== "}"; ) R(I);
+  function D(O, x, S) {
+    var N = c.line;
+    if (O && (typeof O.comment != "string" && (O.comment = i()), O.filename = parse.filename), u("{", !0)) {
+      for (var I; (I = n()) !== "}"; ) x(I);
       u(";", !0);
     } else
-      A && A(), u(";"), w && (typeof w.comment != "string" || a) && (w.comment = i(N) || w.comment);
+      S && S(), u(";"), O && (typeof O.comment != "string" || a) && (O.comment = i(N) || O.comment);
   }
-  function M(w, R) {
-    if (!nameRe.test(R = n())) throw m(R, "type name");
-    var A = new Type(R);
-    D(A, function(I) {
-      if (!k(A, I))
+  function M(O, x) {
+    if (!nameRe.test(x = n())) throw m(x, "type name");
+    var S = new Type(x);
+    D(S, function(I) {
+      if (!k(S, I))
         switch (I) {
           case "map":
-            X(A);
+            X(S);
             break;
           case "required":
           case "repeated":
-            L(A, I);
+            L(S, I);
             break;
           case "optional":
-            g ? L(A, "proto3_optional") : L(A, "optional");
+            g ? L(S, "proto3_optional") : L(S, "optional");
             break;
           case "oneof":
-            Y(A, I);
+            Y(S, I);
             break;
           case "extensions":
-            x(A.extensions || (A.extensions = []));
+            E(S.extensions || (S.extensions = []));
             break;
           case "reserved":
-            x(A.reserved || (A.reserved = []), !0);
+            E(S.reserved || (S.reserved = []), !0);
             break;
           default:
             if (!g || !typeRefRe.test(I)) throw m(I);
-            o(I), L(A, "optional");
+            o(I), L(S, "optional");
             break;
         }
-    }), w.add(A);
+    }), O.add(S);
   }
-  function L(w, R, A) {
+  function L(O, x, S) {
     var N = n();
     if (N === "group") {
-      U(w, R);
+      U(O, x);
       return;
     }
     for (; N.endsWith(".") || s().startsWith("."); )
@@ -4308,8 +4299,8 @@ function parse(r, t, e) {
     if (!typeRefRe.test(N)) throw m(N, "type");
     var I = n();
     if (!nameRe.test(I)) throw m(I, "name");
-    I = _(I), u("=");
-    var B = new Field(I, E(n()), N, R, A);
+    I = w(I), u("=");
+    var B = new Field(I, R(n()), N, x, S);
     if (D(
       B,
       function(F) {
@@ -4318,13 +4309,13 @@ function parse(r, t, e) {
         else throw m(F);
       },
       function() {
-        z(B);
+        W(B);
       }
-    ), R === "proto3_optional") {
+    ), x === "proto3_optional") {
       var C = new OneOf("_" + I);
-      B.setOption("proto3_optional", !0), C.add(B), w.add(C);
+      B.setOption("proto3_optional", !0), C.add(B), O.add(C);
     } else
-      w.add(B);
+      O.add(B);
     !g && B.repeated && (types.packed[N] !== void 0 || types.basic[N] === void 0) && B.setOption(
       "packed",
       !1,
@@ -4332,14 +4323,14 @@ function parse(r, t, e) {
       !0
     );
   }
-  function U(w, R) {
-    var A = n();
-    if (!nameRe.test(A)) throw m(A, "name");
-    var N = util.lcFirst(A);
-    A === N && (A = util.ucFirst(A)), u("=");
-    var I = E(n()), B = new Type(A);
+  function U(O, x) {
+    var S = n();
+    if (!nameRe.test(S)) throw m(S, "name");
+    var N = util.lcFirst(S);
+    S === N && (S = util.ucFirst(S)), u("=");
+    var I = R(n()), B = new Type(S);
     B.group = !0;
-    var C = new Field(N, I, A, R);
+    var C = new Field(N, I, S, x);
     C.filename = parse.filename, D(B, function(F) {
       switch (F) {
         case "option":
@@ -4362,20 +4353,20 @@ function parse(r, t, e) {
         default:
           throw m(F);
       }
-    }), w.add(B).add(C);
+    }), O.add(B).add(C);
   }
-  function X(w) {
+  function X(O) {
     u("<");
-    var R = n();
-    if (types.mapKey[R] === void 0) throw m(R, "type");
+    var x = n();
+    if (types.mapKey[x] === void 0) throw m(x, "type");
     u(",");
-    var A = n();
-    if (!typeRefRe.test(A)) throw m(A, "type");
+    var S = n();
+    if (!typeRefRe.test(S)) throw m(S, "type");
     u(">");
     var N = n();
     if (!nameRe.test(N)) throw m(N, "name");
     u("=");
-    var I = new MapField(_(N), E(n()), R, A);
+    var I = new MapField(w(N), R(n()), x, S);
     D(
       I,
       function(C) {
@@ -4384,37 +4375,37 @@ function parse(r, t, e) {
         else throw m(C);
       },
       function() {
-        z(I);
+        W(I);
       }
-    ), w.add(I);
-  }
-  function Y(w, R) {
-    if (!nameRe.test(R = n())) throw m(R, "name");
-    var A = new OneOf(_(R));
-    D(A, function(I) {
-      I === "option" ? (j(A, I), u(";")) : (o(I), L(A, "optional"));
-    }), w.add(A);
-  }
-  function J(w, R) {
-    if (!nameRe.test(R = n())) throw m(R, "name");
-    var A = new Enum(R);
-    D(A, function(I) {
+    ), O.add(I);
+  }
+  function Y(O, x) {
+    if (!nameRe.test(x = n())) throw m(x, "name");
+    var S = new OneOf(w(x));
+    D(S, function(I) {
+      I === "option" ? (j(S, I), u(";")) : (o(I), L(S, "optional"));
+    }), O.add(S);
+  }
+  function J(O, x) {
+    if (!nameRe.test(x = n())) throw m(x, "name");
+    var S = new Enum(x);
+    D(S, function(I) {
       switch (I) {
         case "option":
-          j(A, I), u(";");
+          j(S, I), u(";");
           break;
         case "reserved":
-          x(A.reserved || (A.reserved = []), !0);
+          E(S.reserved || (S.reserved = []), !0);
           break;
         default:
-          Q(A, I);
+          Q(S, I);
       }
-    }), w.add(A);
+    }), O.add(S);
   }
-  function Q(w, R) {
-    if (!nameRe.test(R)) throw m(R, "name");
+  function Q(O, x) {
+    if (!nameRe.test(x)) throw m(x, "name");
     u("=");
-    var A = E(n(), !0), N = {
+    var S = R(n(), !0), N = {
       options: void 0
     };
     N.setOption = function(I, B) {
@@ -4427,27 +4418,27 @@ function parse(r, t, e) {
         else throw m(B);
       },
       function() {
-        z(N);
+        W(N);
       }
-    ), w.add(R, A, N.comment, N.options);
+    ), O.add(x, S, N.comment, N.options);
   }
-  function j(w, R) {
-    var A = u("(", !0);
-    if (!typeRefRe.test(R = n())) throw m(R, "name");
-    var N = R, I = N, B;
-    A && (u(")"), N = "(" + N + ")", I = N, R = s(), fqTypeRefRe.test(R) && (B = R.slice(1), N += R, n())), u("=");
-    var C = K(w, N);
-    ee(w, I, C, B);
+  function j(O, x) {
+    var S = u("(", !0);
+    if (!typeRefRe.test(x = n())) throw m(x, "name");
+    var N = x, I = N, B;
+    S && (u(")"), N = "(" + N + ")", I = N, x = s(), fqTypeRefRe.test(x) && (B = x.slice(1), N += x, n())), u("=");
+    var C = K(O, N);
+    ee(O, I, C, B);
   }
-  function K(w, R) {
+  function K(O, x) {
     if (u("{", !0)) {
-      for (var A = {}; !u("}", !0); ) {
+      for (var S = {}; !u("}", !0); ) {
         if (!nameRe.test(P = n()))
           throw m(P, "name");
         if (P === null)
           throw m(P, "end of input");
         var N, I = P;
-        if (u(":", !0), s() === "{") N = K(w, R + "." + P);
+        if (u(":", !0), s() === "{") N = K(O, x + "." + P);
         else if (s() === "[") {
           N = [];
           var B;
@@ -4455,70 +4446,70 @@ function parse(r, t, e) {
             do
               B = v(), N.push(B);
             while (u(",", !0));
-            u("]"), typeof B < "u" && G(w, R + "." + P, B);
+            u("]"), typeof B < "u" && G(O, x + "." + P, B);
           }
         } else
-          N = v(), G(w, R + "." + P, N);
-        var C = A[I];
-        C && (N = [].concat(C).concat(N)), A[I] = N, u(",", !0), u(";", !0);
+          N = v(), G(O, x + "." + P, N);
+        var C = S[I];
+        C && (N = [].concat(C).concat(N)), S[I] = N, u(",", !0), u(";", !0);
       }
-      return A;
+      return S;
     }
     var Z = v();
-    return G(w, R, Z), Z;
+    return G(O, x, Z), Z;
   }
-  function G(w, R, A) {
-    w.setOption && w.setOption(R, A);
+  function G(O, x, S) {
+    O.setOption && O.setOption(x, S);
   }
-  function ee(w, R, A, N) {
-    w.setParsedOption && w.setParsedOption(R, A, N);
+  function ee(O, x, S, N) {
+    O.setParsedOption && O.setParsedOption(x, S, N);
   }
-  function z(w) {
+  function W(O) {
     if (u("[", !0)) {
       do
-        j(w, "option");
+        j(O, "option");
       while (u(",", !0));
       u("]");
     }
-    return w;
-  }
-  function te(w, R) {
-    if (!nameRe.test(R = n())) throw m(R, "service name");
-    var A = new Service(R);
-    D(A, function(I) {
-      if (!k(A, I))
-        if (I === "rpc") re(A, I);
+    return O;
+  }
+  function te(O, x) {
+    if (!nameRe.test(x = n())) throw m(x, "service name");
+    var S = new Service(x);
+    D(S, function(I) {
+      if (!k(S, I))
+        if (I === "rpc") re(S, I);
         else throw m(I);
-    }), w.add(A);
-  }
-  function re(w, R) {
-    var A = i(), N = R;
-    if (!nameRe.test(R = n())) throw m(R, "name");
-    var I = R, B, C, Z, F;
-    if (u("("), u("stream", !0) && (C = !0), !typeRefRe.test(R = n()) || (B = R, u(")"), u("returns"), u("("), u("stream", !0) && (F = !0), !typeRefRe.test(R = n()))) throw m(R);
-    Z = R, u(")");
-    var H = new Method(I, N, B, Z, C, F);
-    H.comment = A, D(H, function(V) {
+    }), O.add(S);
+  }
+  function re(O, x) {
+    var S = i(), N = x;
+    if (!nameRe.test(x = n())) throw m(x, "name");
+    var I = x, B, C, Z, F;
+    if (u("("), u("stream", !0) && (C = !0), !typeRefRe.test(x = n()) || (B = x, u(")"), u("returns"), u("("), u("stream", !0) && (F = !0), !typeRefRe.test(x = n()))) throw m(x);
+    Z = x, u(")");
+    var z = new Method(I, N, B, Z, C, F);
+    z.comment = S, D(z, function(V) {
       if (V === "option")
-        j(H, V), u(";");
+        j(z, V), u(";");
       else throw m(V);
-    }), w.add(H);
+    }), O.add(z);
   }
-  function ie(w, R) {
-    if (!typeRefRe.test(R = n())) throw m(R, "reference");
-    var A = R;
+  function ie(O, x) {
+    if (!typeRefRe.test(x = n())) throw m(x, "reference");
+    var S = x;
     D(null, function(I) {
       switch (I) {
         case "required":
         case "repeated":
-          L(w, I, A);
+          L(O, I, S);
           break;
         case "optional":
-          g ? L(w, "proto3_optional", A) : L(w, "optional", A);
+          g ? L(O, "proto3_optional", S) : L(O, "optional", S);
           break;
         default:
           if (!g || !typeRefRe.test(I)) throw m(I);
-          o(I), L(w, "optional", A);
+          o(I), L(O, "optional", S);
           break;
       }
     });
@@ -4526,23 +4517,23 @@ function parse(r, t, e) {
   for (var P; (P = n()) !== null; )
     switch (P) {
       case "package":
-        if (!c) throw m(P);
+        if (!l) throw m(P);
         q();
         break;
       case "import":
-        if (!c) throw m(P);
-        S();
+        if (!l) throw m(P);
+        A();
         break;
       case "syntax":
-        if (!c) throw m(P);
+        if (!l) throw m(P);
         $();
         break;
       case "option":
-        j(T, P), u(";");
+        j(_, P), u(";");
         break;
       default:
-        if (k(T, P)) {
-          c = !1;
+        if (k(_, P)) {
+          l = !1;
           continue;
         }
         throw m(P);
@@ -4931,8 +4922,8 @@ function getRawTag(r) {
     var a = !0;
   } catch {
   }
-  var l = nativeObjectToString$1.call(r);
-  return a && (t ? r[symToStringTag$1] = e : delete r[symToStringTag$1]), l;
+  var c = nativeObjectToString$1.call(r);
+  return a && (t ? r[symToStringTag$1] = e : delete r[symToStringTag$1]), c;
 }
 var objectProto$5 = Object.prototype, nativeObjectToString = objectProto$5.toString;
 function objectToString(r) {
@@ -5043,8 +5034,8 @@ var HOT_COUNT = 800, HOT_SPAN = 16, nativeNow = Date.now;
 function shortOut(r) {
   var t = 0, e = 0;
   return function() {
-    var a = nativeNow(), l = HOT_SPAN - (a - e);
-    if (e = a, l > 0) {
+    var a = nativeNow(), c = HOT_SPAN - (a - e);
+    if (e = a, c > 0) {
       if (++t >= HOT_COUNT)
         return arguments[0];
     } else
@@ -5081,11 +5072,11 @@ function eq(r, t) {
 var nativeMax$1 = Math.max;
 function overRest(r, t, e) {
   return t = nativeMax$1(t === void 0 ? r.length - 1 : t, 0), function() {
-    for (var a = arguments, l = -1, n = nativeMax$1(a.length - t, 0), o = Array(n); ++l < n; )
-      o[l] = a[t + l];
-    l = -1;
-    for (var s = Array(t + 1); ++l < t; )
-      s[l] = a[l];
+    for (var a = arguments, c = -1, n = nativeMax$1(a.length - t, 0), o = Array(n); ++c < n; )
+      o[c] = a[t + c];
+    c = -1;
+    for (var s = Array(t + 1); ++c < t; )
+      s[c] = a[c];
     return s[t] = e(o), apply(r, this, s);
   };
 }
@@ -5146,11 +5137,11 @@ var freeExports = typeof exports == "object" && exports && !exports.nodeType &&
   }
 }(), nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray, isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;
 function arrayLikeKeys(r, t) {
-  var e = isArray(r), a = !e && isArguments(r), l = !e && !a && isBuffer(r), n = !e && !a && !l && isTypedArray(r), o = e || a || l || n, s = o ? baseTimes(r.length, String) : [], u = s.length;
+  var e = isArray(r), a = !e && isArguments(r), c = !e && !a && isBuffer(r), n = !e && !a && !c && isTypedArray(r), o = e || a || c || n, s = o ? baseTimes(r.length, String) : [], u = s.length;
   for (var i in r)
     o && // Safari 9 has enumerable `arguments.length` in strict mode.
     (i == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
-    l && (i == "offset" || i == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
+    c && (i == "offset" || i == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
     n && (i == "buffer" || i == "byteLength" || i == "byteOffset") || // Skip index properties.
     isIndex(i, u)) || s.push(i);
   return s;
@@ -5178,65 +5169,177 @@ var now = function() {
   return root.Date.now();
 }, FUNC_ERROR_TEXT = "Expected a function", nativeMax = Math.max, nativeMin = Math.min;
 function debounce(r, t, e) {
-  var a, l, n, o, s, u, i = 0, c = !1, h = !1, p = !0;
+  var a, c, n, o, s, u, i = 0, l = !1, h = !1, p = !0;
   if (typeof r != "function")
     throw new TypeError(FUNC_ERROR_TEXT);
-  t = toNumber(t) || 0, isObject(e) && (c = !!e.leading, h = "maxWait" in e, n = h ? nativeMax(toNumber(e.maxWait) || 0, t) : n, p = "trailing" in e ? !!e.trailing : p);
-  function d(O) {
-    var E = a, q = l;
-    return a = l = void 0, i = O, o = r.apply(q, E), o;
+  t = toNumber(t) || 0, isObject(e) && (l = !!e.leading, h = "maxWait" in e, n = h ? nativeMax(toNumber(e.maxWait) || 0, t) : n, p = "trailing" in e ? !!e.trailing : p);
+  function d(T) {
+    var R = a, q = c;
+    return a = c = void 0, i = T, o = r.apply(q, R), o;
   }
-  function y(O) {
-    return i = O, s = setTimeout(_, t), c ? d(O) : o;
+  function y(T) {
+    return i = T, s = setTimeout(w, t), l ? d(T) : o;
   }
-  function g(O) {
-    var E = O - u, q = O - i, S = t - E;
-    return h ? nativeMin(S, n - q) : S;
+  function g(T) {
+    var R = T - u, q = T - i, A = t - R;
+    return h ? nativeMin(A, n - q) : A;
   }
-  function T(O) {
-    var E = O - u, q = O - i;
-    return u === void 0 || E >= t || E < 0 || h && q >= n;
+  function _(T) {
+    var R = T - u, q = T - i;
+    return u === void 0 || R >= t || R < 0 || h && q >= n;
   }
-  function _() {
-    var O = now();
-    if (T(O))
-      return m(O);
-    s = setTimeout(_, g(O));
+  function w() {
+    var T = now();
+    if (_(T))
+      return m(T);
+    s = setTimeout(w, g(T));
   }
-  function m(O) {
-    return s = void 0, p && a ? d(O) : (a = l = void 0, o);
+  function m(T) {
+    return s = void 0, p && a ? d(T) : (a = c = void 0, o);
   }
   function b() {
-    s !== void 0 && clearTimeout(s), i = 0, a = u = l = s = void 0;
+    s !== void 0 && clearTimeout(s), i = 0, a = u = c = s = void 0;
   }
   function v() {
     return s === void 0 ? o : m(now());
   }
-  function x() {
-    var O = now(), E = T(O);
-    if (a = arguments, l = this, u = O, E) {
+  function E() {
+    var T = now(), R = _(T);
+    if (a = arguments, c = this, u = T, R) {
       if (s === void 0)
         return y(u);
       if (h)
-        return clearTimeout(s), s = setTimeout(_, t), d(u);
+        return clearTimeout(s), s = setTimeout(w, t), d(u);
     }
-    return s === void 0 && (s = setTimeout(_, t)), o;
+    return s === void 0 && (s = setTimeout(w, t)), o;
   }
-  return x.cancel = b, x.flush = v, x;
+  return E.cancel = b, E.flush = v, E;
 }
 var objectProto = Object.prototype, hasOwnProperty = objectProto.hasOwnProperty, defaults = baseRest(function(r, t) {
   r = Object(r);
-  var e = -1, a = t.length, l = a > 2 ? t[2] : void 0;
-  for (l && isIterateeCall(t[0], t[1], l) && (a = 1); ++e < a; )
+  var e = -1, a = t.length, c = a > 2 ? t[2] : void 0;
+  for (c && isIterateeCall(t[0], t[1], c) && (a = 1); ++e < a; )
     for (var n = t[e], o = keysIn(n), s = -1, u = o.length; ++s < u; ) {
-      var i = o[s], c = r[i];
-      (c === void 0 || eq(c, objectProto[i]) && !hasOwnProperty.call(r, i)) && (r[i] = n[i]);
+      var i = o[s], l = r[i];
+      (l === void 0 || eq(l, objectProto[i]) && !hasOwnProperty.call(r, i)) && (r[i] = n[i]);
     }
   return r;
 });
+function getDefaultExportFromCjs(r) {
+  return r && r.__esModule && Object.prototype.hasOwnProperty.call(r, "default") ? r.default : r;
+}
+var eventemitter3 = { exports: {} }, hasRequiredEventemitter3;
+function requireEventemitter3() {
+  return hasRequiredEventemitter3 || (hasRequiredEventemitter3 = 1, function(r) {
+    var t = Object.prototype.hasOwnProperty, e = "~";
+    function a() {
+    }
+    Object.create && (a.prototype = /* @__PURE__ */ Object.create(null), new a().__proto__ || (e = !1));
+    function c(u, i, l) {
+      this.fn = u, this.context = i, this.once = l || !1;
+    }
+    function n(u, i, l, h, p) {
+      if (typeof l != "function")
+        throw new TypeError("The listener must be a function");
+      var d = new c(l, h || u, p), y = e ? e + i : i;
+      return u._events[y] ? u._events[y].fn ? u._events[y] = [u._events[y], d] : u._events[y].push(d) : (u._events[y] = d, u._eventsCount++), u;
+    }
+    function o(u, i) {
+      --u._eventsCount === 0 ? u._events = new a() : delete u._events[i];
+    }
+    function s() {
+      this._events = new a(), this._eventsCount = 0;
+    }
+    s.prototype.eventNames = function() {
+      var i = [], l, h;
+      if (this._eventsCount === 0) return i;
+      for (h in l = this._events)
+        t.call(l, h) && i.push(e ? h.slice(1) : h);
+      return Object.getOwnPropertySymbols ? i.concat(Object.getOwnPropertySymbols(l)) : i;
+    }, s.prototype.listeners = function(i) {
+      var l = e ? e + i : i, h = this._events[l];
+      if (!h) return [];
+      if (h.fn) return [h.fn];
+      for (var p = 0, d = h.length, y = new Array(d); p < d; p++)
+        y[p] = h[p].fn;
+      return y;
+    }, s.prototype.listenerCount = function(i) {
+      var l = e ? e + i : i, h = this._events[l];
+      return h ? h.fn ? 1 : h.length : 0;
+    }, s.prototype.emit = function(i, l, h, p, d, y) {
+      var g = e ? e + i : i;
+      if (!this._events[g]) return !1;
+      var _ = this._events[g], w = arguments.length, m, b;
+      if (_.fn) {
+        switch (_.once && this.removeListener(i, _.fn, void 0, !0), w) {
+          case 1:
+            return _.fn.call(_.context), !0;
+          case 2:
+            return _.fn.call(_.context, l), !0;
+          case 3:
+            return _.fn.call(_.context, l, h), !0;
+          case 4:
+            return _.fn.call(_.context, l, h, p), !0;
+          case 5:
+            return _.fn.call(_.context, l, h, p, d), !0;
+          case 6:
+            return _.fn.call(_.context, l, h, p, d, y), !0;
+        }
+        for (b = 1, m = new Array(w - 1); b < w; b++)
+          m[b - 1] = arguments[b];
+        _.fn.apply(_.context, m);
+      } else {
+        var v = _.length, E;
+        for (b = 0; b < v; b++)
+          switch (_[b].once && this.removeListener(i, _[b].fn, void 0, !0), w) {
+            case 1:
+              _[b].fn.call(_[b].context);
+              break;
+            case 2:
+              _[b].fn.call(_[b].context, l);
+              break;
+            case 3:
+              _[b].fn.call(_[b].context, l, h);
+              break;
+            case 4:
+              _[b].fn.call(_[b].context, l, h, p);
+              break;
+            default:
+              if (!m) for (E = 1, m = new Array(w - 1); E < w; E++)
+                m[E - 1] = arguments[E];
+              _[b].fn.apply(_[b].context, m);
+          }
+      }
+      return !0;
+    }, s.prototype.on = function(i, l, h) {
+      return n(this, i, l, h, !1);
+    }, s.prototype.once = function(i, l, h) {
+      return n(this, i, l, h, !0);
+    }, s.prototype.removeListener = function(i, l, h, p) {
+      var d = e ? e + i : i;
+      if (!this._events[d]) return this;
+      if (!l)
+        return o(this, d), this;
+      var y = this._events[d];
+      if (y.fn)
+        y.fn === l && (!p || y.once) && (!h || y.context === h) && o(this, d);
+      else {
+        for (var g = 0, _ = [], w = y.length; g < w; g++)
+          (y[g].fn !== l || p && !y[g].once || h && y[g].context !== h) && _.push(y[g]);
+        _.length ? this._events[d] = _.length === 1 ? _[0] : _ : o(this, d);
+      }
+      return this;
+    }, s.prototype.removeAllListeners = function(i) {
+      var l;
+      return i ? (l = e ? e + i : i, this._events[l] && o(this, l)) : (this._events = new a(), this._eventsCount = 0), this;
+    }, s.prototype.off = s.prototype.removeListener, s.prototype.addListener = s.prototype.on, s.prefixed = e, s.EventEmitter = s, r.exports = s;
+  }(eventemitter3)), eventemitter3.exports;
+}
+var eventemitter3Exports = requireEventemitter3();
+const EventEmitter = /* @__PURE__ */ getDefaultExportFromCjs(eventemitter3Exports);
 class WmsLayer {
-  constructor(t, e, a, l = 1 / 0) {
-    this.ctrl = t, this.key = e, this.layer = a, this.zIndex = l, this.ctrl.registerLayer(this);
+  constructor(t, e, a, c = 1 / 0) {
+    this.ctrl = t, this.key = e, this.layer = a, this.zIndex = c, this.ctrl.registerLayer(this);
   }
   show(t) {
     this.ctrl.showLayer(t, this.key);
@@ -5245,25 +5348,27 @@ class WmsLayer {
     this.ctrl.hideLayer(t, this.key);
   }
 }
-class WmsLayerController {
-  constructor(t) {
-    W(this, "layerMap", /* @__PURE__ */ new Map());
-    W(this, "showLayers", Array());
-    W(this, "imgLayer");
+class WmsLayerController extends EventEmitter {
+  constructor(e) {
+    super();
+    H(this, "layerMap", /* @__PURE__ */ new Map());
+    H(this, "showLayers", Array());
+    H(this, "imgLayer");
     /**更新底图，加了个的防抖 */
-    W(this, "update", debounce((t) => {
-      if (this.imgLayer && t.imageryLayers.remove(this.imgLayer, !0), this.showLayers.length === 0) {
-        this.imgLayer = void 0;
+    H(this, "update", debounce((e) => {
+      if (this.imgLayer && e.imageryLayers.remove(this.imgLayer, !0), this.showLayers.length === 0) {
+        this.imgLayer = void 0, this.destroyHandler();
         return;
       }
-      this.imgLayer = new ImageryLayer(
+      this.handler || this.hookClickEvent(e), this.imgLayer = new ImageryLayer(
         new WebMapServiceImageryProvider({
           ...this.args,
-          layers: this.showLayers.map((e) => this.layerMap.get(e).layer).join(",")
+          layers: this.showLayers.map((a) => this.layerMap.get(a).layer).join(",")
         })
-      ), this.imgLayer.show = !0, t.imageryLayers.add(this.imgLayer);
+      ), this.imgLayer.show = !0, e.imageryLayers.add(this.imgLayer);
     }, 200));
-    this.args = t, this.args.parameters = defaults(this.args.parameters, {
+    H(this, "handler");
+    this.args = e, this.args.parameters = defaults(this.args.parameters, {
       service: "WMS",
       version: "1.1.1",
       request: "GetMap",
@@ -5275,22 +5380,31 @@ class WmsLayerController {
       height: 256
     });
   }
-  registerLayer(t) {
-    if (this.layerMap.has(t.key))
-      throw new Error(`Layer with key 【${t.key}】 is already registered`);
-    this.layerMap.set(t.key, t);
-  }
-  showLayer(t, e) {
-    if (!this.layerMap.has(e))
-      throw new Error(`Layer with key 【${e}】 is not registered`);
-    this.showLayers.push(e), this.showLayers.sort((a, l) => {
-      const n = this.layerMap.get(a).zIndex, o = this.layerMap.get(l).zIndex;
-      return n - o;
-    }), this.update(t);
-  }
-  hideLayer(t, e) {
-    const a = this.showLayers.indexOf(e);
-    a !== -1 && (this.showLayers.splice(a, 1), this.update(t));
+  registerLayer(e) {
+    if (this.layerMap.has(e.key))
+      throw new Error(`Layer with key 【${e.key}】 is already registered`);
+    this.layerMap.set(e.key, e);
+  }
+  showLayer(e, a) {
+    if (!this.layerMap.has(a))
+      throw new Error(`Layer with key 【${a}】 is not registered`);
+    this.showLayers.push(a), this.showLayers.sort((c, n) => {
+      const o = this.layerMap.get(c).zIndex, s = this.layerMap.get(n).zIndex;
+      return o - s;
+    }), this.update(e);
+  }
+  hideLayer(e, a) {
+    const c = this.showLayers.indexOf(a);
+    c !== -1 && (this.showLayers.splice(c, 1), this.update(e));
+  }
+  hookClickEvent(e) {
+    this.handler = new ScreenSpaceEventHandler(e.scene.canvas), this.handler.setInputAction(async (a) => {
+      const c = e.scene, n = c.camera.getPickRay(a.position), o = await c.imageryLayers.pickImageryLayerFeatures(n, e.scene);
+      this.emit("click", o);
+    }, ScreenSpaceEventType.LEFT_CLICK);
+  }
+  destroyHandler() {
+    this.handler && (this.handler.destroy(), this.handler = void 0);
   }
 }
 export {