@datagouv/components-next 1.0.2-dev.207 → 1.0.2-dev.209

package/dist/{common-BoeTUnDZ.js → common-C3bYhKiN.js}

@@ -1,13 +1,13 @@
-import { S as w, aY as F, i as _, aZ as I, v as O } from "./proj-DxGbobp7.js";
-function X(n, u) {
+import { U as _, a_ as b, i as w, a$ as F, v as T } from "./proj-DQrI7bbu.js";
+function O(n, u) {
   if (!n)
     throw new Error(u);
 }
-function Y(n) {
+function D(n) {
   return Math.pow(n, 3);
 }
-function U(n) {
-  return 1 - Y(1 - n);
+function Z(n) {
+  return 1 - D(1 - n);
 }
 function z(n) {
   return 3 * n * n - 2 * n * n * n;
@@ -15,69 +15,69 @@ function z(n) {
 function P(n) {
   return n;
 }
-const R = new Array(6);
-function B() {
-  return [1, 0, 0, 1, 0, 0];
+const E = [1, 0, 0, 1, 0, 0], v = new Array(6);
+function $() {
+  return E.slice(0);
 }
-function G(n) {
+function B(n) {
   return s(n, 1, 0, 0, 1, 0, 0);
 }
-function b(n, u) {
-  const i = n[0], e = n[1], c = n[2], t = n[3], r = n[4], l = n[5], g = u[0], h = u[1], p = u[2], S = u[3], L = u[4], v = u[5];
-  return n[0] = i * g + c * h, n[1] = e * g + t * h, n[2] = i * p + c * S, n[3] = e * p + t * S, n[4] = i * L + c * v + r, n[5] = e * L + t * v + l, n;
+function I(n, u) {
+  const i = n[0], e = n[1], c = n[2], t = n[3], r = n[4], l = n[5], g = u[0], h = u[1], a = u[2], R = u[3], S = u[4], L = u[5];
+  return n[0] = i * g + c * h, n[1] = e * g + t * h, n[2] = i * a + c * R, n[3] = e * a + t * R, n[4] = i * S + c * L + r, n[5] = e * S + t * L + l, n;
 }
 function s(n, u, i, e, c, t, r) {
   return n[0] = u, n[1] = i, n[2] = e, n[3] = c, n[4] = t, n[5] = r, n;
 }
-function H(n, u) {
+function G(n, u) {
   return n[0] = u[0], n[1] = u[1], n[2] = u[2], n[3] = u[3], n[4] = u[4], n[5] = u[5], n;
 }
-function J(n, u) {
+function H(n, u) {
   const i = u[0], e = u[1];
   return u[0] = n[0] * i + n[2] * e + n[4], u[1] = n[1] * i + n[3] * e + n[5], u;
 }
-function K(n, u, i) {
-  return b(n, s(R, u, 0, 0, i, 0, 0));
+function J(n, u, i) {
+  return I(n, s(v, u, 0, 0, i, 0, 0));
 }
-function N(n, u, i) {
-  return b(n, s(R, 1, 0, 0, 1, u, i));
+function K(n, u, i) {
+  return I(n, s(v, 1, 0, 0, 1, u, i));
 }
 function Q(n, u, i, e, c, t, r, l) {
   const g = Math.sin(t), h = Math.cos(t);
   return n[0] = e * h, n[1] = c * g, n[2] = -e * g, n[3] = c * h, n[4] = r * e * h - l * e * g + u, n[5] = r * c * g + l * c * h + i, n;
 }
 function V(n, u) {
-  const i = y(u);
-  X(i !== 0, "Transformation matrix cannot be inverted");
+  const i = X(u);
+  O(i !== 0, "Transformation matrix cannot be inverted");
   const e = u[0], c = u[1], t = u[2], r = u[3], l = u[4], g = u[5];
   return n[0] = r / i, n[1] = -c / i, n[2] = -t / i, n[3] = e / i, n[4] = (t * g - r * l) / i, n[5] = -(e * g - c * l) / i, n;
 }
-function y(n) {
+function X(n) {
   return n[0] * n[3] - n[1] * n[2];
 }
-const D = [1e5, 1e5, 1e5, 1e5, 2, 2];
+const Y = [1e5, 1e5, 1e5, 1e5, 2, 2];
 function W(n) {
   return "matrix(" + n.join(", ") + ")";
 }
 function M(n) {
   return n.substring(7, n.length - 1).split(",").map(parseFloat);
 }
-function $(n, u) {
+function f(n, u) {
   const i = M(n), e = M(u);
   for (let c = 0; c < 6; ++c)
-    if (Math.round((i[c] - e[c]) * D[c]) !== 0)
+    if (Math.round((i[c] - e[c]) * Y[c]) !== 0)
       return !1;
   return !0;
 }
-function E(n, u, i, e, c) {
-  return !w(
+function y(n, u, i, e, c) {
+  return !_(
     c,
     /**
      * @param {import("../../coordinate.js").Coordinate} coordinate Coordinate.
      * @return {boolean} Contains (x, y).
      */
     function(r) {
-      return !a(
+      return !p(
         n,
         u,
         i,
@@ -88,34 +88,34 @@ function E(n, u, i, e, c) {
     }
   );
 }
-function a(n, u, i, e, c, t) {
+function p(n, u, i, e, c, t) {
   let r = 0, l = n[i - e], g = n[i - e + 1];
   for (; u < i; u += e) {
-    const h = n[u], p = n[u + 1];
-    g <= t ? p > t && (h - l) * (t - g) - (c - l) * (p - g) > 0 && r++ : p <= t && (h - l) * (t - g) - (c - l) * (p - g) < 0 && r--, l = h, g = p;
+    const h = n[u], a = n[u + 1];
+    g <= t ? a > t && (h - l) * (t - g) - (c - l) * (a - g) > 0 && r++ : a <= t && (h - l) * (t - g) - (c - l) * (a - g) < 0 && r--, l = h, g = a;
   }
   return r !== 0;
 }
-function T(n, u, i, e, c, t) {
-  if (i.length === 0 || !a(n, u, i[0], e, c, t))
+function U(n, u, i, e, c, t) {
+  if (i.length === 0 || !p(n, u, i[0], e, c, t))
     return !1;
   for (let r = 1, l = i.length; r < l; ++r)
-    if (a(n, i[r - 1], i[r], e, c, t))
+    if (p(n, i[r - 1], i[r], e, c, t))
       return !1;
   return !0;
 }
-function f(n, u, i, e, c, t) {
+function o(n, u, i, e, c, t) {
   if (i.length === 0)
     return !1;
   for (let r = 0, l = i.length; r < l; ++r) {
     const g = i[r];
-    if (T(n, u, g, e, c, t))
+    if (U(n, u, g, e, c, t))
       return !0;
     u = g[g.length - 1];
   }
   return !1;
 }
-function Z(n, u, i, e, c) {
+function j(n, u, i, e, c) {
   let t;
   for (u += e; u < i; u += e)
     if (t = c(
@@ -126,7 +126,7 @@ function Z(n, u, i, e, c) {
   return !1;
 }
 function A(n, u, i, e, c, t) {
-  return t = t ?? F(O(), n, u, i, e), _(c, t) ? t[0] >= c[0] && t[2] <= c[2] || t[1] >= c[1] && t[3] <= c[3] ? !0 : Z(
+  return t = t ?? b(T(), n, u, i, e), w(c, t) ? t[0] >= c[0] && t[2] <= c[2] || t[1] >= c[1] && t[3] <= c[3] ? !0 : j(
     n,
     u,
     i,
@@ -138,11 +138,11 @@ function A(n, u, i, e, c, t) {
      *     `false` otherwise.
      */
     function(r, l) {
-      return I(c, r, l);
+      return F(c, r, l);
     }
   ) : !1;
 }
-function o(n, u, i, e, c) {
+function C(n, u, i, e, c) {
   for (let t = 0, r = i.length; t < r; ++t) {
     if (A(n, u, i[t], e, c))
       return !0;
@@ -150,29 +150,29 @@ function o(n, u, i, e, c) {
   }
   return !1;
 }
-function j(n, u, i, e, c) {
-  return !!(A(n, u, i, e, c) || a(
+function k(n, u, i, e, c) {
+  return !!(A(n, u, i, e, c) || p(
     n,
     u,
     i,
     e,
     c[0],
     c[1]
-  ) || a(
+  ) || p(
     n,
     u,
     i,
     e,
     c[0],
     c[3]
-  ) || a(
+  ) || p(
     n,
     u,
     i,
     e,
     c[2],
     c[1]
-  ) || a(
+  ) || p(
     n,
     u,
     i,
@@ -181,13 +181,13 @@ function j(n, u, i, e, c) {
     c[3]
   ));
 }
-function k(n, u, i, e, c) {
-  if (!j(n, u, i[0], e, c))
+function q(n, u, i, e, c) {
+  if (!k(n, u, i[0], e, c))
     return !1;
   if (i.length === 1)
     return !0;
   for (let t = 1, r = i.length; t < r; ++t)
-    if (E(
+    if (y(
       n,
       i[t - 1],
       i[t],
@@ -203,42 +203,43 @@ function k(n, u, i, e, c) {
       return !1;
   return !0;
 }
-function C(n, u, i, e, c) {
+function x(n, u, i, e, c) {
   for (let t = 0, r = i.length; t < r; ++t) {
     const l = i[t];
-    if (k(n, u, l, e, c))
+    if (q(n, u, l, e, c))
       return !0;
     u = l[l.length - 1];
   }
   return !1;
 }
-const x = 42, m = 256;
+const m = 42, d = 256;
 export {
-  x as D,
-  X as a,
-  o as b,
-  C as c,
+  m as D,
+  E as I,
+  O as a,
+  C as b,
+  x as c,
   Q as d,
-  B as e,
-  Z as f,
-  J as g,
-  K as h,
+  $ as e,
+  j as f,
+  H as g,
+  J as h,
   A as i,
-  U as j,
+  Z as j,
   P as k,
-  f as l,
-  b as m,
+  o as l,
+  I as m,
   V as n,
   M as o,
-  $ as p,
+  f as p,
   W as q,
-  G as r,
-  H as s,
-  N as t,
-  T as u,
-  k as v,
+  B as r,
+  G as s,
+  K as t,
+  U as u,
+  q as v,
   z as w,
-  m as x,
-  j as y,
-  Y as z
+  d as x,
+  k as y,
+  D as z
 };