(self.webpackChunkRemoteClient = self.webpackChunkRemoteClient || []).push([
  [9946],
  {
    85674: (t, e, n) => {
      'use strict';
      n.d(e, { O: () => o, a: () => r });
      class r {
        constructor(t = [], e = [], n = !1) {
          (this.lengths = null != t ? t : []),
            (this.coords = null != e ? e : []),
            (this.hasIndeterminateRingOrder = n);
        }
        get isPoint() {
          return 0 === this.lengths.length;
        }
        forEachVertex(t) {
          let e = 0;
          this.lengths.length || t(this.coords[0], this.coords[1]);
          for (let n = 0; n < this.lengths.length; n++) {
            const r = this.lengths[n];
            for (let n = 0; n < r; n++) t(this.coords[2 * (n + e)], this.coords[2 * (n + e) + 1]);
            e += r;
          }
        }
        clone() {
          return new r(this.lengths.slice(), this.coords.slice(), this.hasIndeterminateRingOrder);
        }
      }
      class o {
        constructor(t = null, e = {}, n, r) {
          (this.displayId = 0),
            (this.geohashX = 0),
            (this.geohashY = 0),
            (this.geometry = t),
            e && (this.attributes = e),
            n && (this.centroid = n),
            null != r && (this.objectId = r);
        }
        get hasGeometry() {
          return !(!this.geometry || !this.geometry.coords || !this.geometry.coords.length);
        }
        weakClone() {
          const t = new o(this.geometry, this.attributes, this.centroid, this.objectId);
          return (
            (t.displayId = this.displayId),
            (t.geohashX = this.geohashX),
            (t.geohashY = this.geohashY),
            t
          );
        }
      }
    },
    9006: (t, e, n) => {
      'use strict';
      n.d(e, { O: () => r });
      class r {
        constructor() {
          (this.objectIdFieldName = null),
            (this.globalIdFieldName = null),
            (this.geohashFieldName = null),
            (this.geometryProperties = null),
            (this.geometryType = null),
            (this.spatialReference = null),
            (this.hasZ = !1),
            (this.hasM = !1),
            (this.features = []),
            (this.fields = []),
            (this.transform = null),
            (this.exceededTransferLimit = !1),
            (this.uniqueIdField = null),
            (this.queryGeometryType = null),
            (this.queryGeometry = null);
        }
        weakClone() {
          const t = new r();
          return (
            (t.objectIdFieldName = this.objectIdFieldName),
            (t.globalIdFieldName = this.globalIdFieldName),
            (t.geohashFieldName = this.geohashFieldName),
            (t.geometryProperties = this.geometryProperties),
            (t.geometryType = this.geometryType),
            (t.spatialReference = this.spatialReference),
            (t.hasZ = this.hasZ),
            (t.hasM = this.hasM),
            (t.features = this.features),
            (t.fields = this.fields),
            (t.transform = this.transform),
            (t.exceededTransferLimit = this.exceededTransferLimit),
            (t.uniqueIdField = this.uniqueIdField),
            (t.queryGeometry = this.queryGeometry),
            (t.queryGeometryType = this.queryGeometryType),
            t
          );
        }
      }
    },
    53326: (t, e, n) => {
      'use strict';
      n.d(e, {
        C: () => g,
        N: () => y,
        b: () => u,
        c: () => o,
        d: () => i,
        e: () => f,
        g: () => m,
        l: () => s,
        m: () => c,
        n: () => h,
        s: () => a,
        y: () => l,
      });
      var r = n(76506);
      function o(t = p) {
        return [t[0], t[1], t[2], t[3], t[4], t[5]];
      }
      function s(t, e, n, r, s, i, u = o()) {
        return (u[0] = t), (u[1] = e), (u[2] = n), (u[3] = r), (u[4] = s), (u[5] = i), u;
      }
      function i(t, e) {
        (t[0] = Math.min(t[0], e[0])),
          (t[1] = Math.min(t[1], e[1])),
          (t[2] = Math.min(t[2], e[2])),
          (t[3] = Math.max(t[3], e[3])),
          (t[4] = Math.max(t[4], e[4])),
          (t[5] = Math.max(t[5], e[5]));
      }
      function u(t, e) {
        (t[0] = Math.min(t[0], e[0])),
          (t[1] = Math.min(t[1], e[1])),
          (t[2] = Math.min(t[2], e[2])),
          (t[3] = Math.max(t[3], e[0])),
          (t[4] = Math.max(t[4], e[1])),
          (t[5] = Math.max(t[5], e[2]));
      }
      function l(t, e = [0, 0, 0]) {
        return (
          (e[0] = (function (t) {
            return t[0] >= t[3] ? 0 : t[3] - t[0];
          })(t)),
          (e[1] = (function (t) {
            return t[1] >= t[4] ? 0 : t[4] - t[1];
          })(t)),
          (e[2] = (function (t) {
            return t[2] >= t[5] ? 0 : t[5] - t[2];
          })(t)),
          e
        );
      }
      function c(t, e, n = t) {
        return (
          (n[0] = e[0]),
          (n[1] = e[1]),
          (n[2] = e[2]),
          n !== t && ((n[3] = t[3]), (n[4] = t[4]), (n[5] = t[5])),
          n
        );
      }
      function h(t, e, n = t) {
        return (
          (n[3] = e[0]),
          (n[4] = e[1]),
          (n[5] = e[2]),
          n !== t && ((n[0] = t[0]), (n[1] = t[1]), (n[2] = t[2])),
          t
        );
      }
      function a(t, e) {
        return (
          (t[0] = e[0]),
          (t[1] = e[1]),
          (t[2] = e[2]),
          (t[3] = e[3]),
          (t[4] = e[4]),
          (t[5] = e[5]),
          t
        );
      }
      function f(t) {
        return t ? a(t, y) : o(y);
      }
      function g(t, e) {
        return (
          (t[0] = e[0]),
          (t[1] = e[1]),
          (t[2] = Number.NEGATIVE_INFINITY),
          (t[3] = e[2]),
          (t[4] = e[3]),
          (t[5] = Number.POSITIVE_INFINITY),
          t
        );
      }
      function d(t) {
        return 6 === t.length;
      }
      function m(t, e, n) {
        if ((0, r.b)(t) || (0, r.b)(e)) return t === e;
        if (!d(t) || !d(e)) return !1;
        if (n) {
          for (let r = 0; r < t.length; r++) if (!n(t[r], e[r])) return !1;
        } else for (let n = 0; n < t.length; n++) if (t[n] !== e[n]) return !1;
        return !0;
      }
      n(21801), n(92482);
      const y = [1 / 0, 1 / 0, 1 / 0, -1 / 0, -1 / 0, -1 / 0],
        p = [0, 0, 0, 0, 0, 0];
      o();
    },
    92482: (t, e, n) => {
      'use strict';
      n.d(e, {
        N: () => a,
        a: () => o,
        d: () => c,
        f: () => s,
        m: () => h,
        p: () => i,
        t: () => u,
        x: () => l,
      }),
        n(76506);
      var r = n(21801);
      function o(t = f) {
        return [t[0], t[1], t[2], t[3]];
      }
      function s(t, e, n, r, s = o()) {
        return (s[0] = t), (s[1] = e), (s[2] = n), (s[3] = r), s;
      }
      function i(t, e = o()) {
        return (e[0] = t.xmin), (e[1] = t.ymin), (e[2] = t.xmax), (e[3] = t.ymax), e;
      }
      function u(t, e) {
        return new r.Z({ xmin: t[0], ymin: t[1], xmax: t[2], ymax: t[3], spatialReference: e });
      }
      function l(t) {
        return (
          (function (t) {
            return t[0] >= t[2] ? 0 : t[2] - t[0];
          })(t) *
          (function (t) {
            return t[1] >= t[3] ? 0 : t[3] - t[1];
          })(t)
        );
      }
      function c(t, e) {
        return (
          Math.max(e[0], t[0]) <= Math.min(e[2], t[2]) &&
          Math.max(e[1], t[1]) <= Math.min(e[3], t[3])
        );
      }
      function h(t, e) {
        return e[0] >= t[0] && e[2] <= t[2] && e[1] >= t[1] && e[3] <= t[3];
      }
      const a = [1 / 0, 1 / 0, -1 / 0, -1 / 0],
        f = [0, 0, 0, 0];
    },
    40267: (t, e, n) => {
      'use strict';
      n.d(e, {
        a: () => U,
        b: () => S,
        c: () => _,
        e: () => L,
        f: () => M,
        g: () => K,
        h: () => D,
        i: () => O,
        j: () => v,
        k: () => q,
        l: () => X,
        m: () => $,
        n: () => C,
        o: () => V,
        p: () => Y,
        q: () => B,
        r: () => tt,
        s: () => W,
        t: () => y,
        u: () => Q,
        v: () => p,
        w: () => nt,
        z: () => rt,
      });
      var r = n(60991),
        o = n(92143),
        s = n(32422),
        i = n(85674),
        u = n(9006);
      function l(t, e) {
        return t ? (e ? 4 : 3) : e ? 3 : 2;
      }
      const c = o.L.getLogger('esri.tasks.support.optimizedFeatureSet'),
        h = {
          esriGeometryPoint: 0,
          esriGeometryPolyline: 2,
          esriGeometryPolygon: 3,
          esriGeometryMultipoint: 0,
        },
        a = (t, e, n, r, o, s) => {
          (t[n] = o), (t[n + 1] = s);
        },
        f = (t, e, n, r, o, s) => {
          (t[n] = o), (t[n + 1] = s), (t[n + 2] = e[r + 2]);
        },
        g = (t, e, n, r, o, s) => {
          (t[n] = o), (t[n + 1] = s), (t[n + 2] = e[r + 3]);
        },
        d = (t, e, n, r, o, s) => {
          (t[n] = o), (t[n + 1] = s), (t[n + 2] = e[r + 2]), (t[n + 3] = e[r + 3]);
        };
      function m(t, e, n, r) {
        if (t) {
          if (n) return e && r ? d : f;
          if (e && r) return g;
        } else if (e && r) return f;
        return a;
      }
      function y({ scale: t, translate: e }, n) {
        return Math.round((n - e[0]) / t[0]);
      }
      function p({ scale: t, translate: e }, n) {
        return Math.round((e[1] - n) / t[1]);
      }
      function I({ scale: t, translate: e }, n) {
        return n * t[0] + e[0];
      }
      function b({ scale: t, translate: e }, n) {
        return e[1] - n * t[1];
      }
      function M(t, e, n) {
        return t ? (e ? (n ? Z(t) : N(t)) : n ? F(t) : w(t)) : null;
      }
      function w(t) {
        const e = t.coords;
        return { x: e[0], y: e[1] };
      }
      function x(t, e) {
        return (t.coords[0] = e.x), (t.coords[1] = e.y), t;
      }
      function N(t) {
        const e = t.coords;
        return { x: e[0], y: e[1], z: e[2] };
      }
      function T(t, e) {
        return (t.coords[0] = e.x), (t.coords[1] = e.y), (t.coords[2] = e.z), t;
      }
      function F(t) {
        const e = t.coords;
        return { x: e[0], y: e[1], m: e[2] };
      }
      function G(t, e) {
        return (t.coords[0] = e.x), (t.coords[1] = e.y), (t.coords[2] = e.m), t;
      }
      function Z(t) {
        const e = t.coords;
        return { x: e[0], y: e[1], z: e[2], m: e[3] };
      }
      function P(t, e) {
        return (
          (t.coords[0] = e.x), (t.coords[1] = e.y), (t.coords[2] = e.z), (t.coords[3] = e.m), t
        );
      }
      function k(t, e) {
        return t && e ? P : t ? T : e ? G : x;
      }
      function q(t, e, n) {
        if (!t) return null;
        const r = l(e, n),
          o = [];
        for (let e = 0; e < t.coords.length; e += r) {
          const n = [];
          for (let o = 0; o < r; o++) n.push(t.coords[e + o]);
          o.push(n);
        }
        return e
          ? n
            ? { points: o, hasZ: e, hasM: n }
            : { points: o, hasZ: e }
          : n
          ? { points: o, hasM: n }
          : { points: o };
      }
      function j(t, e, n = l(e.hasZ, e.hasM)) {
        t.lengths[0] = e.points.length;
        const r = t.coords;
        let o = 0;
        for (const t of e.points) for (let e = 0; e < n; e++) r[o++] = t[e];
        return t;
      }
      function O(t, e, n) {
        if (!t) return null;
        const r = l(e, n),
          { coords: o, lengths: s } = t,
          i = [];
        let u = 0;
        for (const t of s) {
          const e = [];
          for (let n = 0; n < t; n++) {
            const t = [];
            for (let e = 0; e < r; e++) t.push(o[u++]);
            e.push(t);
          }
          i.push(e);
        }
        return e
          ? n
            ? { paths: i, hasZ: e, hasM: n }
            : { paths: i, hasZ: e }
          : n
          ? { paths: i, hasM: n }
          : { paths: i };
      }
      function R(t, e, n = l(e.hasZ, e.hasM)) {
        const { lengths: r, coords: o } = t;
        let s = 0;
        for (const t of e.paths) {
          for (const e of t) for (let t = 0; t < n; t++) o[s++] = e[t];
          r.push(t.length);
        }
        return t;
      }
      function v(t, e, n) {
        if (!t) return null;
        const r = l(e, n),
          { coords: o, lengths: s } = t,
          i = [];
        let u = 0;
        for (const t of s) {
          const e = [];
          for (let n = 0; n < t; n++) {
            const t = [];
            for (let e = 0; e < r; e++) t.push(o[u++]);
            e.push(t);
          }
          i.push(e);
        }
        return e
          ? n
            ? { rings: i, hasZ: e, hasM: n }
            : { rings: i, hasZ: e }
          : n
          ? { rings: i, hasM: n }
          : { rings: i };
      }
      function L(t, e, n = e.hasZ, r = e.hasM) {
        return (
          (function (t, e, n, r) {
            const o = l(n, r),
              { lengths: s, coords: i } = t;
            let u = 0;
            s.length = i.length = 0;
            for (const t of e) {
              for (const e of t) for (let t = 0; t < o; t++) i[u++] = e[t];
              s.push(t.length);
            }
          })(t, e.rings, n, r),
          t
        );
      }
      const z = [],
        E = [];
      function Y(t, e, n, r, o) {
        z[0] = t;
        const [s] = C(E, z, e, n, r, o);
        return (z.length = E.length = 0), s;
      }
      function C(t, e, n, o, s, u) {
        if (((t.length = 0), !n)) {
          for (const n of e) {
            const e = n.attributes[u];
            t.push(new i.O(null, n.attributes, null, e));
          }
          return t;
        }
        switch (n) {
          case 'esriGeometryPoint':
            return (function (t, e, n, r, o) {
              const s = k(n, r);
              for (const n of e) {
                const { geometry: e, attributes: r } = n;
                let u;
                e && (u = s(new i.a(), e)), t.push(new i.O(u, r, null, r[o]));
              }
              return t;
            })(t, e, o, s, u);
          case 'esriGeometryMultipoint':
            return (function (t, e, n, r, o) {
              const s = l(n, r);
              for (const n of e) {
                const e = n.geometry,
                  r = n.attributes;
                let u;
                e && (u = j(new i.a(), e, s)), t.push(new i.O(u, r, null, r[o]));
              }
              return t;
            })(t, e, o, s, u);
          case 'esriGeometryPolyline':
            return (function (t, e, n, r, o) {
              const s = l(n, r);
              for (const n of e) {
                const e = n.geometry,
                  r = n.attributes;
                let u;
                e && (u = R(new i.a(), e, s)), t.push(new i.O(u, r, null, r[o]));
              }
              return t;
            })(t, e, o, s, u);
          case 'esriGeometryPolygon':
            return (function (t, e, n, r, o) {
              for (const s of e) {
                const e = s.geometry,
                  u = s.centroid,
                  l = s.attributes;
                let c;
                e && (c = L(new i.a(), e, n, r)),
                  u
                    ? t.push(new i.O(c, l, x(new i.a(), u), l[o]))
                    : t.push(new i.O(c, l, null, l[o]));
              }
              return t;
            })(t, e, o, s, u);
          default:
            c.error(
              'convertToFeatureSet:unknown-geometry',
              new r.Z(`Unable to parse unknown geometry type '${n}'`),
            ),
              (t.length = 0);
        }
        return t;
      }
      function V(t, e, n, r) {
        (E[0] = t), A(z, E, e, n, r);
        const o = z[0];
        return (z.length = E.length = 0), o;
      }
      function S(t, e, n) {
        if (!t) return null;
        const o = new i.a();
        return (
          'hasZ' in t && null == e && (e = t.hasZ),
          'hasM' in t && null == n && (n = t.hasM),
          (0, s.wp)(t)
            ? k(null != e ? e : null != t.z, null != n ? n : null != t.m)(o, t)
            : (0, s.oU)(t)
            ? L(o, t, e, n)
            : (0, s.l9)(t)
            ? R(o, t, l(e, n))
            : (0, s.aW)(t)
            ? j(o, t, l(e, n))
            : void c.error(
                'convertFromGeometry:unknown-geometry',
                new r.Z(`Unable to parse unknown geometry type '${t}'`),
              )
        );
      }
      function _(t, e, n, o) {
        const s = t && ('coords' in t ? t : t.geometry);
        if (!s) return null;
        switch (e) {
          case 'esriGeometryPoint': {
            let t = w;
            return n && o ? (t = Z) : n ? (t = N) : o && (t = F), t(s);
          }
          case 'esriGeometryMultipoint':
            return q(s, n, o);
          case 'esriGeometryPolyline':
            return O(s, n, o);
          case 'esriGeometryPolygon':
            return v(s, n, o);
          default:
            return void c.error(
              'convertToGeometry:unknown-geometry',
              new r.Z(`Unable to parse unknown geometry type '${e}'`),
            );
        }
      }
      function A(t, e, n, o, s) {
        switch (((t.length = 0), n)) {
          case 'esriGeometryPoint':
            return (function (t, e, n, r) {
              let o = w;
              n && r ? (o = Z) : n ? (o = N) : r && (o = F);
              for (const n of e) {
                const { geometry: e, attributes: r } = n,
                  s = e ? o(e) : null;
                t.push({ attributes: r, geometry: s });
              }
              return t;
            })(t, e, o, s);
          case 'esriGeometryMultipoint':
            return (function (t, e, n, r) {
              for (const o of e) {
                const { geometry: e, attributes: s } = o;
                let i;
                e && (i = q(e, n, r)), t.push({ attributes: s, geometry: i });
              }
              return t;
            })(t, e, o, s);
          case 'esriGeometryPolyline':
            return (function (t, e, n, r) {
              for (const o of e) {
                const { geometry: e, attributes: s } = o;
                let i;
                e && (i = O(e, n, r)), t.push({ attributes: s, geometry: i });
              }
              return t;
            })(t, e, o, s);
          case 'esriGeometryPolygon':
            return (function (t, e, n, r) {
              for (const o of e) {
                const { geometry: e, attributes: s, centroid: i } = o;
                let u;
                if ((e && (u = v(e, n, r)), i)) {
                  const e = w(i);
                  t.push({ attributes: s, centroid: e, geometry: u });
                } else t.push({ attributes: s, geometry: u });
              }
              return t;
            })(t, e, o, s);
          default:
            c.error(
              'convertToFeatureSet:unknown-geometry',
              new r.Z(`Unable to parse unknown geometry type '${n}'`),
            );
        }
        return t;
      }
      function U(t) {
        const {
            objectIdFieldName: e,
            spatialReference: n,
            transform: r,
            fields: o,
            hasM: s,
            hasZ: i,
            features: u,
            geometryType: l,
            exceededTransferLimit: c,
            uniqueIdField: h,
            queryGeometry: a,
            queryGeometryType: f,
          } = t,
          g = {
            features: A([], u, l, i, s),
            fields: o,
            geometryType: l,
            objectIdFieldName: e,
            spatialReference: n,
            uniqueIdField: h,
            queryGeometry: _(a, f, !1, !1),
          };
        return (
          r && (g.transform = r),
          c && (g.exceededTransferLimit = c),
          s && (g.hasM = s),
          i && (g.hasZ = i),
          g
        );
      }
      function $(t, e) {
        const n = new u.O(),
          {
            hasM: o,
            hasZ: s,
            features: i,
            objectIdFieldName: l,
            spatialReference: h,
            geometryType: a,
            exceededTransferLimit: f,
            transform: g,
            fields: d,
          } = t;
        return (
          d && (n.fields = d),
          (n.geometryType = a),
          (n.objectIdFieldName = l || e),
          (n.spatialReference = h),
          n.objectIdFieldName
            ? (i && C(n.features, i, a, s, o, n.objectIdFieldName),
              f && (n.exceededTransferLimit = f),
              o && (n.hasM = o),
              s && (n.hasZ = s),
              g && (n.transform = g),
              n)
            : (c.error(
                new r.Z(
                  'optimized-features:invalid-objectIdFieldName',
                  'objectIdFieldName is missing',
                ),
              ),
              n)
        );
      }
      function X(t) {
        const { transform: e, features: n, hasM: r, hasZ: o } = t;
        if (!e) return t;
        for (const t of n)
          t.geometry && Q(t.geometry, t.geometry, r, o, e),
            t.centroid && Q(t.centroid, t.centroid, r, o, e);
        return (t.transform = null), t;
      }
      function W(t, e) {
        const { geometryType: n, features: r, hasM: o, hasZ: s } = e;
        if (!t) return e;
        for (let e = 0; e < r.length; e++) {
          const u = r[e],
            l = u.weakClone();
          (l.geometry = new i.a()),
            B(l.geometry, u.geometry, o, s, n, t),
            u.centroid &&
              ((l.centroid = new i.a()), B(l.centroid, u.centroid, o, s, 'esriGeometryPoint', t)),
            (r[e] = l);
        }
        return (e.transform = t), e;
      }
      function B(t, e, n, r, o, s, i = n, u = r) {
        if (
          (t.lengths.length && (t.lengths.length = 0),
          t.coords.length && (t.coords.length = 0),
          !e || !e.coords.length)
        )
          return null;
        const c = h[o],
          { coords: a, lengths: f } = e,
          g = l(n, r),
          d = l(n && i, r && u),
          I = m(n, r, i, u);
        if (!f.length)
          return (
            I(t.coords, a, 0, 0, y(s, a[0]), p(s, a[1])),
            t.lengths.length && (t.lengths.length = 0),
            (t.coords.length = g),
            t
          );
        let b,
          M,
          w,
          x,
          N = 0,
          T = 0,
          F = T;
        for (const e of f) {
          if (e < c) continue;
          let n = 0;
          (T = F),
            (w = b = y(s, a[N])),
            (x = M = p(s, a[N + 1])),
            I(t.coords, a, T, N, w, x),
            n++,
            (N += g),
            (T += d);
          for (let r = 1; r < e; r++, N += g)
            (w = y(s, a[N])),
              (x = p(s, a[N + 1])),
              (w === b && x === M) ||
                (I(t.coords, a, T, N, w - b, x - M), (T += d), n++, (b = w), (M = x));
          n >= c && (t.lengths.push(n), (F = T));
        }
        return (t.coords.length = F), t.coords.length ? t : null;
      }
      function D(t, e, n, r, o, s, i = n, u = r) {
        if (
          (t.lengths.length && (t.lengths.length = 0),
          t.coords.length && (t.coords.length = 0),
          !e || !e.coords.length)
        )
          return null;
        const c = h[o],
          { coords: a, lengths: f } = e,
          g = l(n, r),
          d = l(n && i, r && u),
          y = m(n, r, i, u);
        if (!f.length)
          return (
            y(t.coords, a, 0, 0, a[0], a[1]),
            t.lengths.length && (t.lengths.length = 0),
            (t.coords.length = g),
            t
          );
        let p = 0;
        const I = s * s;
        for (const e of f) {
          if (e < c) {
            p += e * g;
            continue;
          }
          const n = t.coords.length / d,
            r = p,
            o = p + (e - 1) * g;
          y(t.coords, a, t.coords.length, r, a[r], a[r + 1]),
            J(t.coords, a, g, I, y, r, o),
            y(t.coords, a, t.coords.length, o, a[o], a[o + 1]);
          const s = t.coords.length / d - n;
          s >= c ? t.lengths.push(s) : (t.coords.length = n * d), (p += e * g);
        }
        return t.coords.length ? t : null;
      }
      function H(t, e, n, r) {
        const o = t[e],
          s = t[e + 1],
          i = t[n],
          u = t[n + 1],
          l = t[r],
          c = t[r + 1];
        let h = i,
          a = u,
          f = l - h,
          g = c - a;
        if (0 !== f || 0 !== g) {
          const t = ((o - h) * f + (s - a) * g) / (f * f + g * g);
          t > 1 ? ((h = l), (a = c)) : t > 0 && ((h += f * t), (a += g * t));
        }
        return (f = o - h), (g = s - a), f * f + g * g;
      }
      function J(t, e, n, r, o, s, i) {
        let u,
          l = r,
          c = 0;
        for (let t = s + n; t < i; t += n) (u = H(e, t, s, i)), u > l && ((c = t), (l = u));
        l > r &&
          (c - s > n && J(t, e, n, r, o, s, c),
          o(t, e, t.length, c, e[c], e[c + 1]),
          i - c > n && J(t, e, n, r, o, c, i));
      }
      function K(t, e, n, r) {
        if (!e || !e.coords || !e.coords.length) return null;
        const o = l(n, r);
        let s = Number.POSITIVE_INFINITY,
          i = Number.POSITIVE_INFINITY,
          u = Number.NEGATIVE_INFINITY,
          c = Number.NEGATIVE_INFINITY;
        if (e && e.coords) {
          const t = e.coords;
          for (let e = 0; e < t.length; e += o) {
            const n = t[e],
              r = t[e + 1];
            (s = Math.min(s, n)), (u = Math.max(u, n)), (i = Math.min(i, r)), (c = Math.max(c, r));
          }
        }
        return (t[0] = s), (t[1] = i), (t[2] = u), (t[3] = c), t;
      }
      function Q(t, e, n, r, o) {
        const { coords: s, lengths: i } = e,
          u = n ? (r ? d : f) : r ? f : a,
          c = l(n, r);
        if (!s.length) return t !== e && ((t.lengths.length = 0), (t.coords.length = 0)), t;
        if (!i.length)
          return (
            u(t.coords, s, 0, 0, I(o, s[0]), b(o, s[1])),
            t !== e && ((t.lengths.length = 0), (t.coords.length = c)),
            t
          );
        const [h, g] = o.scale;
        let m = 0;
        for (let e = 0; e < i.length; e++) {
          const n = i[e];
          t.lengths[e] = n;
          let r = I(o, s[m]),
            l = b(o, s[m + 1]);
          u(t.coords, s, m, m, r, l), (m += c);
          for (let e = 1; e < n; e++, m += c)
            (r += s[m] * h), (l -= s[m + 1] * g), u(t.coords, s, m, m, r, l);
        }
        return t !== e && ((t.lengths.length = i.length), (t.coords.length = s.length)), t;
      }
      function tt(t, e, n, r, o, s) {
        const i = l(n, r),
          u = m(n, r, o, s),
          c = e.coords;
        (t.coords.length = 0), (t.lengths.length = 0), t.lengths.push(...e.lengths);
        for (let e = 0; e < c.length; e += i) u(t.coords, c, t.coords.length, e, c[e], c[e + 1]);
        return t;
      }
      function et(t, e, n, r) {
        let o = 0,
          s = t[r * e],
          i = t[r * (e + 1)];
        for (let u = 1; u < n; u++) {
          const n = s + t[r * (e + u)],
            l = i + t[r * (e + u) + 1],
            c = (n - s) * (l + i);
          (s = n), (i = l), (o += c);
        }
        return 0.5 * o;
      }
      function nt(t, e) {
        const { coords: n, lengths: r } = t;
        let o = 0,
          s = 0;
        for (let t = 0; t < r.length; t++) (s += et(n, o, r[t], e)), (o += t);
        return Math.abs(s);
      }
      function rt(t, e) {
        const n = t.clone(),
          r = t.coords,
          o = t.lengths;
        let s = 0;
        for (let t = 0; t < o.length; t++) {
          const i = o[t];
          let u = r[e * s],
            l = r[e * s + 1];
          for (let t = 1; t < i; t++) {
            const o = u + r[e * (s + t)],
              i = l + r[e * (s + t) + 1];
            (n.coords[e * (s + t)] = o), (n.coords[e * (s + t) + 1] = i), (u = o), (l = i);
          }
          s += i;
        }
        return n;
      }
    },
    71435: (t, e, n) => {
      'use strict';
      n.d(e, { a: () => g, b: () => a, c: () => f, t: () => i, u: () => d }), n(32422);
      const r = (t, e, n) => [e, n],
        o = (t, e, n) => [e, n, t[2]],
        s = (t, e, n) => [e, n, t[2], t[3]];
      function i(t) {
        return t
          ? {
              originPosition:
                'upper-left' === t.originPosition
                  ? 'upperLeft'
                  : 'lower-left' === t.originPosition
                  ? 'lowerLeft'
                  : t.originPosition,
              scale: t.tolerance ? [t.tolerance, t.tolerance] : [1, 1],
              translate: t.extent ? [t.extent.xmin, t.extent.ymax] : [0, 0],
            }
          : null;
      }
      function u({ scale: t, translate: e }, n) {
        return n * t[0] + e[0];
      }
      function l({ scale: t, translate: e }, n) {
        return e[1] - n * t[1];
      }
      function c(t, e, n) {
        const r = new Array(n.length);
        if (!n.length) return r;
        const [o, s] = t.scale;
        let i = u(t, n[0][0]),
          c = l(t, n[0][1]);
        r[0] = e(n[0], i, c);
        for (let t = 1; t < n.length; t++) {
          const u = n[t];
          (i += u[0] * o), (c -= u[1] * s), (r[t] = e(u, i, c));
        }
        return r;
      }
      function h(t, e, n) {
        const r = new Array(n.length);
        for (let o = 0; o < n.length; o++) r[o] = c(t, e, n[o]);
        return r;
      }
      function a(t, e, n, i, u) {
        return (
          (e.points = (function (t, e, n, i) {
            return c(t, n ? (i ? s : o) : i ? o : r, e);
          })(t, n.points, i, u)),
          e
        );
      }
      function f(t, e, n, r, o) {
        return (
          (e.x = u(t, n.x)), (e.y = l(t, n.y)), e !== n && (r && (e.z = n.z), o && (e.m = n.m)), e
        );
      }
      function g(t, e, n, i, u) {
        return (
          (e.rings = (function (t, e, n, i) {
            return h(t, n ? (i ? s : o) : i ? o : r, e);
          })(t, n.rings, i, u)),
          e
        );
      }
      function d(t, e, n, i, u) {
        return (
          (e.paths = (function (t, e, n, i) {
            return h(t, n ? (i ? s : o) : i ? o : r, e);
          })(t, n.paths, i, u)),
          e
        );
      }
    },
  },
]);
