{"version":3,"sources":["node_modules/@arcgis/core/geometry/support/aaBoundingRect.js"],"sourcesContent":["/*\nAll material copyright ESRI, All Rights Reserved, unless otherwise specified.\nSee https://js.arcgis.com/4.28/esri/copyright.txt for details.\n*/\nimport \"../../core/has.js\";\nimport { clamp as n } from \"../../core/mathUtils.js\";\nimport t from \"../Extent.js\";\nfunction r(n) {\n  return n;\n}\nfunction u(n = L) {\n  return r([n[0], n[1], n[2], n[3]]);\n}\nfunction i(n) {\n  return r([n[0], n[1], n[2], n[3]]);\n}\nfunction e(n, t) {\n  return n !== t && (n[0] = t[0], n[1] = t[1], n[2] = t[2], n[3] = t[3]), n;\n}\nfunction a(n, t, r, i, e = u()) {\n  return e[0] = n, e[1] = t, e[2] = r, e[3] = i, e;\n}\nfunction o(n, t = u()) {\n  return t[0] = n.xmin, t[1] = n.ymin, t[2] = n.xmax, t[3] = n.ymax, t;\n}\nfunction c(n, r) {\n  return new t({\n    xmin: n[0],\n    ymin: n[1],\n    xmax: n[2],\n    ymax: n[3],\n    spatialReference: r\n  });\n}\nfunction f(n, t) {\n  t[0] < n[0] && (n[0] = t[0]), t[0] > n[2] && (n[2] = t[0]), t[1] < n[1] && (n[1] = t[1]), t[1] > n[3] && (n[3] = t[1]);\n}\nfunction m(n, t, r) {\n  if (null != t) {\n    if (\"length\" in t) G(t) ? (r[0] = Math.min(n[0], t[0]), r[1] = Math.min(n[1], t[1]), r[2] = Math.max(n[2], t[2]), r[3] = Math.max(n[3], t[3])) : 2 !== t.length && 3 !== t.length || (r[0] = Math.min(n[0], t[0]), r[1] = Math.min(n[1], t[1]), r[2] = Math.max(n[2], t[0]), r[3] = Math.max(n[3], t[1]));else switch (t.type) {\n      case \"extent\":\n        r[0] = Math.min(n[0], t.xmin), r[1] = Math.min(n[1], t.ymin), r[2] = Math.max(n[2], t.xmax), r[3] = Math.max(n[3], t.ymax);\n        break;\n      case \"point\":\n        r[0] = Math.min(n[0], t.x), r[1] = Math.min(n[1], t.y), r[2] = Math.max(n[2], t.x), r[3] = Math.max(n[3], t.y);\n    }\n  } else e(r, n);\n}\nfunction h(n, t, r = n) {\n  const u = t.length;\n  let i = n[0],\n    e = n[1],\n    a = n[2],\n    o = n[3];\n  for (let c = 0; c < u; c++) {\n    const n = t[c];\n    i = Math.min(i, n[0]), e = Math.min(e, n[1]), a = Math.max(a, n[0]), o = Math.max(o, n[1]);\n  }\n  return r[0] = i, r[1] = e, r[2] = a, r[3] = o, r;\n}\nfunction x(n) {\n  for (let t = 0; t < 4; t++) if (!isFinite(n[t])) return !1;\n  return !0;\n}\nfunction M(n) {\n  return null == n || n[0] >= n[2] ? 0 : n[2] - n[0];\n}\nfunction s(n) {\n  return null == n || n[1] >= n[3] ? 0 : n[3] - n[1];\n}\nfunction l(n) {\n  return M(n) * s(n);\n}\nfunction y(n) {\n  return M(n) > 0 && s(n) > 0;\n}\nfunction p(n, t = [0, 0]) {\n  return t[0] = (n[0] + n[2]) / 2, t[1] = (n[1] + n[3]) / 2, t;\n}\nfunction b(n, t) {\n  return w(n, t[0], t[1]);\n}\nfunction g(n, t) {\n  const r = t[3],\n    u = .5 * (n[0] + n[2]),\n    i = Math.abs(t[0] - u),\n    e = .5 * (n[2] - n[0]);\n  if (i > r + e) return !1;\n  const a = .5 * (n[1] + n[3]),\n    o = .5 * (n[3] - n[1]),\n    c = Math.abs(t[1] - a);\n  if (c > r + o) return !1;\n  if (i < e || c < o) return !0;\n  const f = i - e,\n    m = c - o;\n  return f * f + m * m <= r * r;\n}\nfunction j(n, t, r) {\n  const u = n[0],\n    i = n[1],\n    e = n[2],\n    a = n[3],\n    {\n      x: o,\n      y: c\n    } = t,\n    {\n      x: f,\n      y: m\n    } = r,\n    h = (n, t) => (m - c) * n + (o - f) * t + (f * c - o * m) < 0,\n    x = h(u, a),\n    M = h(e, a),\n    s = h(e, i),\n    l = h(u, i);\n  return !(x === M && M === s && s === l && l === x || o < u && f < u || o > e && f > e || c > a && m > a || c < i && m < i);\n}\nfunction F(n, t) {\n  return w(n, t.x, t.y);\n}\nfunction w(n, t, r) {\n  return t >= n[0] && r >= n[1] && t <= n[2] && r <= n[3];\n}\nfunction k(n, t, r, u) {\n  return t >= n[0] - u && r >= n[1] - u && t <= n[2] + u && r <= n[3] + u;\n}\nfunction q(n, t, r) {\n  return t[0] >= n[0] - r && t[1] >= n[1] - r && t[0] <= n[2] + r && t[1] <= n[3] + r;\n}\nfunction E(n, t) {\n  return Math.max(t[0], n[0]) <= Math.min(t[2], n[2]) && Math.max(t[1], n[1]) <= Math.min(t[3], n[3]);\n}\nfunction R(n, t) {\n  return t[0] >= n[0] && t[2] <= n[2] && t[1] >= n[1] && t[3] <= n[3];\n}\nfunction U(t, r, u) {\n  if (null == r) return e(u, t);\n  const i = r[0],\n    a = r[1],\n    o = r[2],\n    c = r[3];\n  return u[0] = n(t[0], i, o), u[1] = n(t[1], a, c), u[2] = n(t[2], i, o), u[3] = n(t[3], a, c), u;\n}\nfunction d(n, t) {\n  const r = (n[0] + n[2]) / 2,\n    u = (n[1] + n[3]) / 2,\n    i = Math.max(Math.abs(t[0] - r) - M(n) / 2, 0),\n    e = Math.max(Math.abs(t[1] - u) - s(n) / 2, 0);\n  return Math.sqrt(i * i + e * e);\n}\nfunction v(n, t) {\n  t[0] = n[2] - n[0], t[1] = n[3] - n[1];\n}\nfunction z(n, t, r, u = n) {\n  return u[0] = n[0] + t, u[1] = n[1] + r, u[2] = n[2] + t, u[3] = n[3] + r, u;\n}\nfunction A(n, t, r = n) {\n  return r[0] = n[0] - t, r[1] = n[1] - t, r[2] = n[2] + t, r[3] = n[3] + t, r;\n}\nfunction B(n, t, r = n) {\n  return r[0] = t[0], r[1] = t[1], r !== n && (r[2] = n[2], r[3] = n[3]), r;\n}\nfunction C(n, t, r = n) {\n  return r[2] = t[0], r[3] = t[1], r !== n && (r[0] = n[0], r[1] = n[1]), n;\n}\nfunction D(n) {\n  return n ? e(n, K) : u(K);\n}\nfunction G(n) {\n  return null != n && 4 === n.length;\n}\nfunction H(n) {\n  return !(0 !== M(n) && isFinite(n[0]) || 0 !== s(n) && isFinite(n[1]));\n}\nfunction I(n, t) {\n  return G(n) && G(t) ? n[0] === t[0] && n[1] === t[1] && n[2] === t[2] && n[3] === t[3] : n === t;\n}\nconst J = r([-1 / 0, -1 / 0, 1 / 0, 1 / 0]),\n  K = r([1 / 0, 1 / 0, -1 / 0, -1 / 0]),\n  L = r([0, 0, 0, 0]),\n  N = r([0, 0, 1, 1]);\nexport { x as allFinite, l as area, p as center, i as clone, R as contains, b as containsPoint, F as containsPointObject, q as containsPointWithMargin, w as containsXY, k as containsXYWithMargin, e as copy, u as create, d as distance, D as empty, I as equals, m as expand, f as expandPointInPlace, h as expandWithNestedArray, o as fromExtent, a as fromValues, y as hasArea, s as height, U as intersection, E as intersects, j as intersectsSegment, g as intersectsSphere, G as is, H as isPoint, K as negativeInfinity, z as offset, A as pad, J as positiveInfinity, C as setMax, B as setMin, v as size, c as toExtent, N as unit, M as width, L as zero };"],"mappings":";;;;;AAOA,SAAS,EAAE,GAAG;AACZ,SAAO;AACT;AACA,SAAS,EAAE,IAAI,GAAG;AAChB,SAAO,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACnC;AACA,SAASA,GAAE,GAAG;AACZ,SAAO,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACnC;AACA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,MAAM,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI;AAC1E;AACA,SAAS,EAAE,GAAG,GAAGC,IAAGD,IAAGE,KAAI,EAAE,GAAG;AAC9B,SAAOA,GAAE,CAAC,IAAI,GAAGA,GAAE,CAAC,IAAI,GAAGA,GAAE,CAAC,IAAID,IAAGC,GAAE,CAAC,IAAIF,IAAGE;AACjD;AACA,SAAS,EAAE,GAAG,IAAI,EAAE,GAAG;AACrB,SAAO,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,MAAM;AACrE;AACA,SAAS,EAAE,GAAGD,IAAG;AACf,SAAO,IAAI,EAAE;AAAA,IACX,MAAM,EAAE,CAAC;AAAA,IACT,MAAM,EAAE,CAAC;AAAA,IACT,MAAM,EAAE,CAAC;AAAA,IACT,MAAM,EAAE,CAAC;AAAA,IACT,kBAAkBA;AAAA,EACpB,CAAC;AACH;AACA,SAAS,EAAE,GAAG,GAAG;AACf,IAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC;AACtH;AACA,SAAS,EAAE,GAAG,GAAGA,IAAG;AAClB,MAAI,QAAQ,GAAG;AACb,QAAI,YAAY;AAAG,QAAE,CAAC,KAAKA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,MAAM,EAAE,UAAU,MAAM,EAAE,WAAWA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA;AAAQ,cAAQ,EAAE,MAAM;AAAA,QAC7T,KAAK;AACH,UAAAA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,IAAI,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,IAAI,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,IAAI,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,IAAI;AACzH;AAAA,QACF,KAAK;AACH,UAAAA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,GAAGA,GAAE,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;AAAA,MACjH;AAAA,EACF;AAAO,MAAEA,IAAG,CAAC;AACf;AAiBA,SAASE,GAAE,GAAG;AACZ,SAAO,QAAQ,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AACnD;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,QAAQ,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AACnD;AACA,SAAS,EAAE,GAAG;AACZ,SAAOA,GAAE,CAAC,IAAI,EAAE,CAAC;AACnB;AAOA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACxB;AAuCA,SAAS,EAAE,GAAG,GAAGC,IAAG;AAClB,SAAO,KAAK,EAAE,CAAC,KAAKA,MAAK,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC,KAAKA,MAAK,EAAE,CAAC;AACxD;AAIA,SAAS,EAAE,GAAG,GAAGC,IAAG;AAClB,SAAO,EAAE,CAAC,KAAK,EAAE,CAAC,IAAIA,MAAK,EAAE,CAAC,KAAK,EAAE,CAAC,IAAIA,MAAK,EAAE,CAAC,KAAK,EAAE,CAAC,IAAIA,MAAK,EAAE,CAAC,KAAK,EAAE,CAAC,IAAIA;AACpF;AACA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACpG;AACA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC;AACpE;AA+BA,SAAS,EAAE,GAAG;AACZ,SAAO,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAC1B;AACA,SAAS,EAAE,GAAG;AACZ,SAAO,QAAQ,KAAK,MAAM,EAAE;AAC9B;AAIA,SAAS,EAAE,GAAG,GAAG;AACf,SAAO,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM;AACjG;AACA,IAAM,IAAI,EAAE,CAAC,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;AAA1C,IACE,IAAI,EAAE,CAAC,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC;AADtC,IAEE,IAAI,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;AAFpB,IAGE,IAAI,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;","names":["i","r","e","M","r","r"],"x_google_ignoreList":[0]}