@hybridcore/ui 1.1.0 → 1.1.2

package/dist/{Source-Bo1Eq6y-.js → Source-CnCcu5UP.js}

@@ -1,221 +1,5 @@
-import { k as W, m as K, f as p, W as ce, h as H, b as S, d as E, n as Lt, o as ge, s as j, p as fe, q as de, r as Re, e as _e, V as me, u as nt, l as it, E as Ct } from "./Object-DBPgar-D.js";
-const C = {
-  UNKNOWN: 0,
-  INTERSECTING: 1,
-  ABOVE: 2,
-  RIGHT: 4,
-  BELOW: 8,
-  LEFT: 16
-};
-function Gn(n) {
-  const t = $();
-  for (let e = 0, i = n.length; e < i; ++e)
-    Ie(t, n[e]);
-  return t;
-}
-function ye(n, t, e) {
-  const i = Math.min.apply(null, n), r = Math.min.apply(null, t), s = Math.max.apply(null, n), o = Math.max.apply(null, t);
-  return J(i, r, s, o, e);
-}
-function jn(n, t, e) {
-  return e ? (e[0] = n[0] - t, e[1] = n[1] - t, e[2] = n[2] + t, e[3] = n[3] + t, e) : [
-    n[0] - t,
-    n[1] - t,
-    n[2] + t,
-    n[3] + t
-  ];
-}
-function Ln(n, t) {
-  return t ? (t[0] = n[0], t[1] = n[1], t[2] = n[2], t[3] = n[3], t) : n.slice();
-}
-function vt(n, t, e) {
-  let i, r;
-  return t < n[0] ? i = n[0] - t : n[2] < t ? i = t - n[2] : i = 0, e < n[1] ? r = n[1] - e : n[3] < e ? r = e - n[3] : r = 0, i * i + r * r;
-}
-function vn(n, t) {
-  return Yt(n, t[0], t[1]);
-}
-function Me(n, t) {
-  return n[0] <= t[0] && t[2] <= n[2] && n[1] <= t[1] && t[3] <= n[3];
-}
-function Yt(n, t, e) {
-  return n[0] <= t && t <= n[2] && n[1] <= e && e <= n[3];
-}
-function Et(n, t) {
-  const e = n[0], i = n[1], r = n[2], s = n[3], o = t[0], u = t[1];
-  let a = C.UNKNOWN;
-  return o < e ? a = a | C.LEFT : o > r && (a = a | C.RIGHT), u < i ? a = a | C.BELOW : u > s && (a = a | C.ABOVE), a === C.UNKNOWN && (a = C.INTERSECTING), a;
-}
-function $() {
-  return [1 / 0, 1 / 0, -1 / 0, -1 / 0];
-}
-function J(n, t, e, i, r) {
-  return r ? (r[0] = n, r[1] = t, r[2] = e, r[3] = i, r) : [n, t, e, i];
-}
-function Q(n) {
-  return J(1 / 0, 1 / 0, -1 / 0, -1 / 0, n);
-}
-function Ce(n, t) {
-  const e = n[0], i = n[1];
-  return J(e, i, e, i, t);
-}
-function Ee(n, t, e, i, r) {
-  const s = Q(r);
-  return zt(s, n, t, e, i);
-}
-function Yn(n, t) {
-  return n[0] == t[0] && n[2] == t[2] && n[1] == t[1] && n[3] == t[3];
-}
-function zn(n, t) {
-  return t[0] < n[0] && (n[0] = t[0]), t[2] > n[2] && (n[2] = t[2]), t[1] < n[1] && (n[1] = t[1]), t[3] > n[3] && (n[3] = t[3]), n;
-}
-function Ie(n, t) {
-  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]);
-}
-function zt(n, t, e, i, r) {
-  for (; e < i; e += r)
-    Se(n, t[e], t[e + 1]);
-  return n;
-}
-function Se(n, t, e) {
-  n[0] = Math.min(n[0], t), n[1] = Math.min(n[1], e), n[2] = Math.max(n[2], t), n[3] = Math.max(n[3], e);
-}
-function pe(n, t) {
-  let e;
-  return e = t(Ae(n)), e || (e = t(we(n)), e) || (e = t(Oe(n)), e) || (e = t(Ne(n)), e) ? e : !1;
-}
-function Un(n) {
-  let t = 0;
-  return tt(n) || (t = A(n) * X(n)), t;
-}
-function Ae(n) {
-  return [n[0], n[1]];
-}
-function we(n) {
-  return [n[2], n[1]];
-}
-function L(n) {
-  return [(n[0] + n[2]) / 2, (n[1] + n[3]) / 2];
-}
-function Pe(n, t, e, i, r) {
-  const [s, o, u, a, h, l, c, g] = Te(
-    n,
-    t,
-    e,
-    i
-  );
-  return J(
-    Math.min(s, u, h, c),
-    Math.min(o, a, l, g),
-    Math.max(s, u, h, c),
-    Math.max(o, a, l, g),
-    r
-  );
-}
-function Te(n, t, e, i) {
-  const r = t * i[0] / 2, s = t * i[1] / 2, o = Math.cos(e), u = Math.sin(e), a = r * o, h = r * u, l = s * o, c = s * u, g = n[0], f = n[1];
-  return [
-    g - a + c,
-    f - h - l,
-    g - a - c,
-    f - h + l,
-    g + a - c,
-    f + h + l,
-    g + a + c,
-    f + h - l,
-    g - a + c,
-    f - h - l
-  ];
-}
-function X(n) {
-  return n[3] - n[1];
-}
-function Vn(n, t, e) {
-  const i = e || $();
-  return lt(n, t) ? (n[0] > t[0] ? i[0] = n[0] : i[0] = t[0], n[1] > t[1] ? i[1] = n[1] : i[1] = t[1], n[2] < t[2] ? i[2] = n[2] : i[2] = t[2], n[3] < t[3] ? i[3] = n[3] : i[3] = t[3]) : Q(i), i;
-}
-function Ne(n) {
-  return [n[0], n[3]];
-}
-function Oe(n) {
-  return [n[2], n[3]];
-}
-function A(n) {
-  return n[2] - n[0];
-}
-function lt(n, t) {
-  return n[0] <= t[2] && n[2] >= t[0] && n[1] <= t[3] && n[3] >= t[1];
-}
-function tt(n) {
-  return n[2] < n[0] || n[3] < n[1];
-}
-function xe(n, t) {
-  return t ? (t[0] = n[0], t[1] = n[1], t[2] = n[2], t[3] = n[3], t) : n;
-}
-function Fe(n, t, e) {
-  let i = !1;
-  const r = Et(n, t), s = Et(n, e);
-  if (r === C.INTERSECTING || s === C.INTERSECTING)
-    i = !0;
-  else {
-    const o = n[0], u = n[1], a = n[2], h = n[3], l = t[0], c = t[1], g = e[0], f = e[1], d = (f - c) / (g - l);
-    let R, _;
-    s & C.ABOVE && !(r & C.ABOVE) && (R = g - (f - h) / d, i = R >= o && R <= a), !i && s & C.RIGHT && !(r & C.RIGHT) && (_ = f - (g - a) * d, i = _ >= u && _ <= h), !i && s & C.BELOW && !(r & C.BELOW) && (R = g - (f - u) / d, i = R >= o && R <= a), !i && s & C.LEFT && !(r & C.LEFT) && (_ = f - (g - o) * d, i = _ >= u && _ <= h);
-  }
-  return i;
-}
-function Ze(n, t, e, i) {
-  if (tt(n))
-    return Q(e);
-  let r = [];
-  r = [
-    n[0],
-    n[1],
-    n[2],
-    n[1],
-    n[2],
-    n[3],
-    n[0],
-    n[3]
-  ], t(r, r, 2);
-  const s = [], o = [];
-  for (let u = 0, a = r.length; u < a; u += 2)
-    s.push(r[u]), o.push(r[u + 1]);
-  return ye(s, o, e);
-}
-function be(n, t) {
-  const e = t.getExtent(), i = L(n);
-  if (t.canWrapX() && (i[0] < e[0] || i[0] >= e[2])) {
-    const r = A(e), o = Math.floor(
-      (i[0] - e[0]) / r
-    ) * r;
-    n[0] -= o, n[2] -= o;
-  }
-  return n;
-}
-function Dn(n, t) {
-  if (t.canWrapX()) {
-    const e = t.getExtent();
-    if (!isFinite(n[0]) || !isFinite(n[2]))
-      return [[e[0], n[1], e[2], n[3]]];
-    be(n, t);
-    const i = A(e);
-    if (A(n) > i)
-      return [[e[0], n[1], e[2], n[3]]];
-    if (n[0] < e[0])
-      return [
-        [n[0] + i, n[1], e[2], n[3]],
-        [e[0], n[1], n[2], n[3]]
-      ];
-    if (n[2] > e[2])
-      return [
-        [n[0], n[1], e[2], n[3]],
-        [e[0], n[1], n[2] - i, n[3]]
-      ];
-  }
-  return [n];
-}
-const Ut = {
+import { k as W, m as K, d as p, W as ce, f as H, b as S, i as E, n as Lt, o as ge, s as j, p as fe, q as de, r as Re, e as _e, V as me, u as nt, l as it, E as Ct } from "./has-9_asnBxn.js";
+const vt = {
   // use the radius of the Normal sphere
   radians: 6370997 / (2 * Math.PI),
   degrees: 2 * Math.PI * 6370997 / 360,
@@ -223,7 +7,7 @@ const Ut = {
   m: 1,
   "us-ft": 1200 / 3937
 };
-class Vt {
+class Yt {
   /**
    * @param {Options} options Projection options.
    */
@@ -269,7 +53,7 @@ class Vt {
    * @api
    */
   getMetersPerUnit() {
-    return this.metersPerUnit_ || Ut[this.units_];
+    return this.metersPerUnit_ || vt[this.units_];
   }
   /**
    * Get the world extent for this projection.
@@ -356,8 +140,8 @@ class Vt {
     return this.getPointResolutionFunc_;
   }
 }
-const z = 6378137, Z = Math.PI * z, Xe = [-Z, -Z, Z, Z], Ge = [-180, -85, 180, 85], U = z * Math.log(Math.tan(Math.PI / 2));
-class x extends Vt {
+const z = 6378137, Z = Math.PI * z, ye = [-Z, -Z, Z, Z], Me = [-180, -85, 180, 85], U = z * Math.log(Math.tan(Math.PI / 2));
+class x extends Yt {
   /**
    * @param {string} code Code.
    */
@@ -365,16 +149,16 @@ class x extends Vt {
     super({
       code: t,
       units: "m",
-      extent: Xe,
+      extent: ye,
       global: !0,
-      worldExtent: Ge,
+      worldExtent: Me,
       getPointResolution: function(e, i) {
         return e / Math.cosh(i[1] / z);
       }
     });
   }
 }
-const It = [
+const Et = [
   new x("EPSG:3857"),
   new x("EPSG:102100"),
   new x("EPSG:102113"),
@@ -382,7 +166,7 @@ const It = [
   new x("http://www.opengis.net/def/crs/EPSG/0/3857"),
   new x("http://www.opengis.net/gml/srs/epsg.xml#3857")
 ];
-function je(n, t, e) {
+function Ce(n, t, e) {
   const i = n.length;
   e = e > 1 ? e : 2, t === void 0 && (e > 2 ? t = n.slice() : t = new Array(i));
   for (let r = 0; r < i; r += e) {
@@ -392,15 +176,15 @@ function je(n, t, e) {
   }
   return t;
 }
-function Le(n, t, e) {
+function Ee(n, t, e) {
   const i = n.length;
   e = e > 1 ? e : 2, t === void 0 && (e > 2 ? t = n.slice() : t = new Array(i));
   for (let r = 0; r < i; r += e)
     t[r] = 180 * n[r] / Z, t[r + 1] = 360 * Math.atan(Math.exp(n[r + 1] / z)) / Math.PI - 90;
   return t;
 }
-const ve = 6378137, St = [-180, -90, 180, 90], Ye = Math.PI * ve / 180;
-class N extends Vt {
+const Ie = 6378137, It = [-180, -90, 180, 90], Se = Math.PI * Ie / 180;
+class N extends Yt {
   /**
    * @param {string} code Code.
    * @param {string} [axisOrientation] Axis orientation.
@@ -409,15 +193,15 @@ class N extends Vt {
     super({
       code: t,
       units: "degrees",
-      extent: St,
+      extent: It,
       axisOrientation: e,
       global: !0,
-      metersPerUnit: Ye,
-      worldExtent: St
+      metersPerUnit: Se,
+      worldExtent: It
     });
   }
 }
-const pt = [
+const St = [
   new N("CRS:84"),
   new N("EPSG:4326", "neu"),
   new N("urn:ogc:def:crs:OGC:1.3:CRS84"),
@@ -427,10 +211,10 @@ const pt = [
   new N("http://www.opengis.net/def/crs/EPSG/0/4326", "neu")
 ];
 let ot = {};
-function ze(n) {
+function pe(n) {
   return ot[n] || ot[n.replace(/urn:(x-)?ogc:def:crs:EPSG:(.*:)?(\w+)$/, "EPSG:$3")] || null;
 }
-function Ue(n, t) {
+function Ae(n, t) {
   ot[n] = t;
 }
 let b = {};
@@ -438,10 +222,226 @@ function k(n, t, e) {
   const i = n.getCode(), r = t.getCode();
   i in b || (b[i] = {}), b[i][r] = e;
 }
-function Ve(n, t) {
+function we(n, t) {
   let e;
   return n in b && t in b[n] && (e = b[n][t]), e;
 }
+const C = {
+  UNKNOWN: 0,
+  INTERSECTING: 1,
+  ABOVE: 2,
+  RIGHT: 4,
+  BELOW: 8,
+  LEFT: 16
+};
+function Gn(n) {
+  const t = $();
+  for (let e = 0, i = n.length; e < i; ++e)
+    xe(t, n[e]);
+  return t;
+}
+function Pe(n, t, e) {
+  const i = Math.min.apply(null, n), r = Math.min.apply(null, t), s = Math.max.apply(null, n), o = Math.max.apply(null, t);
+  return J(i, r, s, o, e);
+}
+function jn(n, t, e) {
+  return e ? (e[0] = n[0] - t, e[1] = n[1] - t, e[2] = n[2] + t, e[3] = n[3] + t, e) : [
+    n[0] - t,
+    n[1] - t,
+    n[2] + t,
+    n[3] + t
+  ];
+}
+function Ln(n, t) {
+  return t ? (t[0] = n[0], t[1] = n[1], t[2] = n[2], t[3] = n[3], t) : n.slice();
+}
+function zt(n, t, e) {
+  let i, r;
+  return t < n[0] ? i = n[0] - t : n[2] < t ? i = t - n[2] : i = 0, e < n[1] ? r = n[1] - e : n[3] < e ? r = e - n[3] : r = 0, i * i + r * r;
+}
+function vn(n, t) {
+  return Ut(n, t[0], t[1]);
+}
+function Te(n, t) {
+  return n[0] <= t[0] && t[2] <= n[2] && n[1] <= t[1] && t[3] <= n[3];
+}
+function Ut(n, t, e) {
+  return n[0] <= t && t <= n[2] && n[1] <= e && e <= n[3];
+}
+function pt(n, t) {
+  const e = n[0], i = n[1], r = n[2], s = n[3], o = t[0], u = t[1];
+  let a = C.UNKNOWN;
+  return o < e ? a = a | C.LEFT : o > r && (a = a | C.RIGHT), u < i ? a = a | C.BELOW : u > s && (a = a | C.ABOVE), a === C.UNKNOWN && (a = C.INTERSECTING), a;
+}
+function $() {
+  return [1 / 0, 1 / 0, -1 / 0, -1 / 0];
+}
+function J(n, t, e, i, r) {
+  return r ? (r[0] = n, r[1] = t, r[2] = e, r[3] = i, r) : [n, t, e, i];
+}
+function Q(n) {
+  return J(1 / 0, 1 / 0, -1 / 0, -1 / 0, n);
+}
+function Ne(n, t) {
+  const e = n[0], i = n[1];
+  return J(e, i, e, i, t);
+}
+function Oe(n, t, e, i, r) {
+  const s = Q(r);
+  return Vt(s, n, t, e, i);
+}
+function Yn(n, t) {
+  return n[0] == t[0] && n[2] == t[2] && n[1] == t[1] && n[3] == t[3];
+}
+function zn(n, t) {
+  return t[0] < n[0] && (n[0] = t[0]), t[2] > n[2] && (n[2] = t[2]), t[1] < n[1] && (n[1] = t[1]), t[3] > n[3] && (n[3] = t[3]), n;
+}
+function xe(n, t) {
+  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]);
+}
+function Vt(n, t, e, i, r) {
+  for (; e < i; e += r)
+    Fe(n, t[e], t[e + 1]);
+  return n;
+}
+function Fe(n, t, e) {
+  n[0] = Math.min(n[0], t), n[1] = Math.min(n[1], e), n[2] = Math.max(n[2], t), n[3] = Math.max(n[3], e);
+}
+function Ze(n, t) {
+  let e;
+  return e = t(be(n)), e || (e = t(Xe(n)), e) || (e = t(ve(n)), e) || (e = t(Le(n)), e) ? e : !1;
+}
+function Un(n) {
+  let t = 0;
+  return tt(n) || (t = A(n) * X(n)), t;
+}
+function be(n) {
+  return [n[0], n[1]];
+}
+function Xe(n) {
+  return [n[2], n[1]];
+}
+function L(n) {
+  return [(n[0] + n[2]) / 2, (n[1] + n[3]) / 2];
+}
+function Ge(n, t, e, i, r) {
+  const [s, o, u, a, h, l, c, g] = je(
+    n,
+    t,
+    e,
+    i
+  );
+  return J(
+    Math.min(s, u, h, c),
+    Math.min(o, a, l, g),
+    Math.max(s, u, h, c),
+    Math.max(o, a, l, g),
+    r
+  );
+}
+function je(n, t, e, i) {
+  const r = t * i[0] / 2, s = t * i[1] / 2, o = Math.cos(e), u = Math.sin(e), a = r * o, h = r * u, l = s * o, c = s * u, g = n[0], f = n[1];
+  return [
+    g - a + c,
+    f - h - l,
+    g - a - c,
+    f - h + l,
+    g + a - c,
+    f + h + l,
+    g + a + c,
+    f + h - l,
+    g - a + c,
+    f - h - l
+  ];
+}
+function X(n) {
+  return n[3] - n[1];
+}
+function Vn(n, t, e) {
+  const i = e || $();
+  return lt(n, t) ? (n[0] > t[0] ? i[0] = n[0] : i[0] = t[0], n[1] > t[1] ? i[1] = n[1] : i[1] = t[1], n[2] < t[2] ? i[2] = n[2] : i[2] = t[2], n[3] < t[3] ? i[3] = n[3] : i[3] = t[3]) : Q(i), i;
+}
+function Le(n) {
+  return [n[0], n[3]];
+}
+function ve(n) {
+  return [n[2], n[3]];
+}
+function A(n) {
+  return n[2] - n[0];
+}
+function lt(n, t) {
+  return n[0] <= t[2] && n[2] >= t[0] && n[1] <= t[3] && n[3] >= t[1];
+}
+function tt(n) {
+  return n[2] < n[0] || n[3] < n[1];
+}
+function Ye(n, t) {
+  return t ? (t[0] = n[0], t[1] = n[1], t[2] = n[2], t[3] = n[3], t) : n;
+}
+function ze(n, t, e) {
+  let i = !1;
+  const r = pt(n, t), s = pt(n, e);
+  if (r === C.INTERSECTING || s === C.INTERSECTING)
+    i = !0;
+  else {
+    const o = n[0], u = n[1], a = n[2], h = n[3], l = t[0], c = t[1], g = e[0], f = e[1], d = (f - c) / (g - l);
+    let R, _;
+    s & C.ABOVE && !(r & C.ABOVE) && (R = g - (f - h) / d, i = R >= o && R <= a), !i && s & C.RIGHT && !(r & C.RIGHT) && (_ = f - (g - a) * d, i = _ >= u && _ <= h), !i && s & C.BELOW && !(r & C.BELOW) && (R = g - (f - u) / d, i = R >= o && R <= a), !i && s & C.LEFT && !(r & C.LEFT) && (_ = f - (g - o) * d, i = _ >= u && _ <= h);
+  }
+  return i;
+}
+function Ue(n, t, e, i) {
+  if (tt(n))
+    return Q(e);
+  let r = [];
+  r = [
+    n[0],
+    n[1],
+    n[2],
+    n[1],
+    n[2],
+    n[3],
+    n[0],
+    n[3]
+  ], t(r, r, 2);
+  const s = [], o = [];
+  for (let u = 0, a = r.length; u < a; u += 2)
+    s.push(r[u]), o.push(r[u + 1]);
+  return Pe(s, o, e);
+}
+function Ve(n, t) {
+  const e = t.getExtent(), i = L(n);
+  if (t.canWrapX() && (i[0] < e[0] || i[0] >= e[2])) {
+    const r = A(e), o = Math.floor(
+      (i[0] - e[0]) / r
+    ) * r;
+    n[0] -= o, n[2] -= o;
+  }
+  return n;
+}
+function Dn(n, t) {
+  if (t.canWrapX()) {
+    const e = t.getExtent();
+    if (!isFinite(n[0]) || !isFinite(n[2]))
+      return [[e[0], n[1], e[2], n[3]]];
+    Ve(n, t);
+    const i = A(e);
+    if (A(n) > i)
+      return [[e[0], n[1], e[2], n[3]]];
+    if (n[0] < e[0])
+      return [
+        [n[0] + i, n[1], e[2], n[3]],
+        [e[0], n[1], n[2], n[3]]
+      ];
+    if (n[2] > e[2])
+      return [
+        [n[0], n[1], e[2], n[3]],
+        [e[0], n[1], n[2] - i, n[3]]
+      ];
+  }
+  return [n];
+}
 function De(n, t) {
   return n[0] += +t[0], n[1] += +t[1], n;
 }
@@ -529,13 +529,13 @@ function Kt(n, t) {
   return n;
 }
 function He(n) {
-  Ue(n.getCode(), n), k(n, n, ht);
+  Ae(n.getCode(), n), k(n, n, ht);
 }
 function $e(n) {
   n.forEach(He);
 }
 function T(n) {
-  return typeof n == "string" ? ze(
+  return typeof n == "string" ? pe(
     /** @type {string} */
     n
   ) : (
@@ -624,7 +624,7 @@ function Qn(n, t) {
 }
 function gt(n, t) {
   const e = n.getCode(), i = t.getCode();
-  let r = Ve(e, i);
+  let r = we(e, i);
   return r || (r = Kt), r;
 }
 function q(n, t) {
@@ -636,7 +636,7 @@ function kt(n, t, e) {
 }
 function ti(n, t, e, i) {
   const r = q(t, e);
-  return Ze(n, r, void 0);
+  return Ue(n, r, void 0);
 }
 function Pt(n, t) {
   return n;
@@ -653,11 +653,11 @@ function V(n, t) {
   return n;
 }
 function tn() {
-  wt(It), wt(pt), Je(
-    pt,
-    It,
-    je,
-    Le
+  wt(Et), wt(St), Je(
+    St,
+    Et,
+    Ce,
+    Ee
   );
 }
 tn();
@@ -1315,7 +1315,7 @@ class En extends H {
       const e = this.computeExtent(this.extent_);
       (isNaN(e[0]) || isNaN(e[1])) && Q(e), this.extentRevision_ = this.getRevision();
     }
-    return xe(this.extent_, t);
+    return Ye(this.extent_, t);
   }
   /**
    * Rotate the geometry around a given coordinate. This modifies the geometry
@@ -1457,7 +1457,7 @@ class Rt extends En {
    * @return {import("../extent.js").Extent} extent Extent.
    */
   computeExtent(t) {
-    return Ee(
+    return Oe(
       this.flatCoordinates,
       0,
       this.flatCoordinates.length,
@@ -2046,7 +2046,7 @@ class v extends Rt {
    * @return {number} Minimum squared distance.
    */
   closestPointXY(t, e, i, r) {
-    return r < vt(this.getExtent(), t, e) ? r : (this.maxDeltaRevision_ != this.getRevision() && (this.maxDelta_ = Math.sqrt(
+    return r < zt(this.getExtent(), t, e) ? r : (this.maxDeltaRevision_ != this.getRevision() && (this.maxDelta_ = Math.sqrt(
       qt(
         this.flatCoordinates,
         0,
@@ -2195,7 +2195,7 @@ class _t extends Rt {
    * @return {import("../extent.js").Extent} extent Extent.
    */
   computeExtent(t) {
-    return Ce(this.flatCoordinates, t);
+    return Ne(this.flatCoordinates, t);
   }
   /**
    * Get the type of this geometry.
@@ -2212,7 +2212,7 @@ class _t extends Rt {
    * @api
    */
   intersectsExtent(t) {
-    return Yt(t, this.flatCoordinates[0], this.flatCoordinates[1]);
+    return Ut(t, this.flatCoordinates[0], this.flatCoordinates[1]);
   }
   /**
    * @param {!Array<*>} coordinates Coordinates.
@@ -2229,7 +2229,7 @@ class _t extends Rt {
   }
 }
 function An(n, t, e, i, r) {
-  return !pe(
+  return !Ze(
     r,
     /**
      * @param {import("../../coordinate.js").Coordinate} coordinate Coordinate.
@@ -2317,14 +2317,14 @@ function wn(n, t, e, i, r) {
   return !1;
 }
 function yt(n, t, e, i, r) {
-  const s = zt(
+  const s = Vt(
     $(),
     n,
     t,
     e,
     i
   );
-  return lt(r, s) ? Me(r, s) || s[0] >= r[0] && s[2] <= r[2] || s[1] >= r[1] && s[3] <= r[3] ? !0 : wn(
+  return lt(r, s) ? Te(r, s) || s[0] >= r[0] && s[2] <= r[2] || s[1] >= r[1] && s[3] <= r[3] ? !0 : wn(
     n,
     t,
     e,
@@ -2336,7 +2336,7 @@ function yt(n, t, e, i, r) {
      *     `false` otherwise.
      */
     function(o, u) {
-      return Fe(r, o, u);
+      return ze(r, o, u);
     }
   ) : !1;
 }
@@ -2530,7 +2530,7 @@ class Y extends Rt {
    * @return {number} Minimum squared distance.
    */
   closestPointXY(t, e, i, r) {
-    return r < vt(this.getExtent(), t, e) ? r : (this.maxDeltaRevision_ != this.getRevision() && (this.maxDelta_ = Math.sqrt(
+    return r < zt(this.getExtent(), t, e) ? r : (this.maxDeltaRevision_ != this.getRevision() && (this.maxDelta_ = Math.sqrt(
       Ht(
         this.flatCoordinates,
         0,
@@ -3162,7 +3162,7 @@ class Gt extends H {
       /** @type {!number} */
       this.getRotation()
     );
-    return p(r !== void 0, 3), Pe(e, i, r, t);
+    return p(r !== void 0, 3), Ge(e, i, r, t);
   }
   /**
    * Get the maximum resolution of the view.
@@ -3881,7 +3881,7 @@ function xn(n) {
   } else {
     const M = (f ? Math.max(A(f), X(f)) : (
       // use an extent that can fit the whole world if need be
-      360 * Ut.degrees / g.getMetersPerUnit()
+      360 * vt.degrees / g.getMetersPerUnit()
     )) / un / Math.pow(2, rt), y = M / Math.pow(2, 28 - rt);
     e = n.maxResolution, e !== void 0 ? o = 0 : e = M / Math.pow(a, o), i = n.minResolution, i === void 0 && (n.maxZoom !== void 0 ? n.maxResolution !== void 0 ? i = e / Math.pow(a, u) : i = M / Math.pow(a, u) : i = y), u = o + Math.floor(
       Math.log(e / i) / Math.log(a)
@@ -4272,7 +4272,7 @@ export {
   en as G,
   ni as H,
   P as I,
-  Pe as J,
+  Ge as J,
   tt as K,
   Ii as L,
   Yn as M,
@@ -4282,23 +4282,23 @@ export {
   qe as Q,
   an as R,
   Si as S,
-  Ne as T,
-  Oe as U,
+  Le as T,
+  ve as U,
   Gt as V,
-  we as W,
-  Ae as X,
+  Xe as W,
+  be as X,
   Rn as Y,
   q as Z,
   Un as _,
-  Jn as a,
-  Ie as a0,
+  ti as a,
+  xe as a0,
   zn as a1,
   X as a2,
   L as a3,
-  pe as a4,
+  Ze as a4,
   Hn as a5,
   vn as a6,
-  Te as a7,
+  je as a7,
   si as a8,
   T as a9,
   gi as aA,
@@ -4309,20 +4309,20 @@ export {
   Sn as aF,
   yn as aG,
   Dn as aH,
-  Me as aI,
+  Te as aI,
   De as aJ,
-  Et as aK,
+  pt as aK,
   C as aL,
   F as aM,
   Bt as aN,
   ei as aO,
   ai as aP,
   ii as aQ,
-  be as aR,
+  Ve as aR,
   $n as aS,
   Qn as aa,
   Rt as ab,
-  vt as ac,
+  zt as ac,
   qt as ad,
   $t as ae,
   wn as af,
@@ -4336,8 +4336,8 @@ export {
   ci as an,
   mi as ao,
   te as ap,
-  Yt as aq,
-  Ee as ar,
+  Ut as aq,
+  Oe as ar,
   ui as as,
   li as at,
   Ri as au,
@@ -4346,9 +4346,9 @@ export {
   fi as ax,
   _i as ay,
   Mi as az,
-  kt as b,
+  Jn as b,
   Gn as c,
-  Ce as d,
+  Ne as d,
   kn as e,
   w as f,
   B as g,
@@ -4364,7 +4364,7 @@ export {
   Wn as q,
   Ei as r,
   Dt as s,
-  ti as t,
+  kt as t,
   rn as u,
   ri as v,
   qn as w,