@datagouv/components-next 0.2.0 → 1.0.0

package/dist/{XmlPreview.client-CAdN0w_Y.js → XmlPreview.client-C0OgBkSq.js}

@@ -1,5 +1,5 @@
 import { defineComponent as b, defineAsyncComponent as L, ref as o, computed as w, onMounted as T, createElementBlock as p, openBlock as l, createBlock as m, createCommentVNode as P, createVNode as u, unref as t, toDisplayString as i, withCtx as f, createElementVNode as d } from "vue";
-import { d as E, u as M, j as q, a as h, F as v } from "./main-Dgri3TQL.js";
+import { u as E, a as M, g as q, _ as h, F as v } from "./main-CNHxAJ8J.js";
 const B = { class: "fr-text--xs" }, S = { key: 0 }, V = {
   key: 1,
   class: "text-gray-medium"
@@ -10,16 +10,16 @@ const B = { class: "fr-text--xs" }, S = { key: 0 }, V = {
   },
   setup(k) {
     const z = L(
-      () => import("./vue3-xml-viewer.common-D6skc_Ai.js").then((e) => e.v).then((e) => e.default || e.XmlViewer)
-    ), g = k, x = E(), { t: r } = M(), n = o(null), c = o(!1), s = o(null), y = o(!1), _ = w(() => q(g.resource)), X = w(() => {
-      const e = _.value;
+      () => import("./vue3-xml-viewer.common-CmAdQfIy.js").then((e) => e.v).then((e) => e.default || e.XmlViewer)
+    ), g = k, x = E(), { t: r } = M(), n = o(null), c = o(!1), s = o(null), _ = o(!1), y = w(() => q(g.resource)), X = w(() => {
+      const e = y.value;
       if (!e || !x.maxXmlPreviewCharSize)
         return !1;
       const a = x.maxXmlPreviewCharSize;
       return e <= a;
     }), C = async () => {
       if (!X.value) {
-        y.value = !0;
+        _.value = !0;
         return;
       }
       c.value = !0, s.value = null;
@@ -40,14 +40,14 @@ const B = { class: "fr-text--xs" }, S = { key: 0 }, V = {
     }), (e, a) => (l(), p("div", B, [
       n.value ? (l(), p("div", S, [
         u(t(z), { xml: n.value }, null, 8, ["xml"])
-      ])) : c.value ? (l(), p("div", V, i(t(r)("Chargement de l'aperçu XML...")), 1)) : y.value ? (l(), m(h, {
+      ])) : c.value ? (l(), p("div", V, i(t(r)("Chargement de l'aperçu XML...")), 1)) : _.value ? (l(), m(h, {
         key: 2,
         type: "warning",
         class: "flex items-center space-x-2"
       }, {
         default: f(() => [
           u(t(v), { class: "shink-0 size-6" }),
-          d("span", null, i(_.value ? t(r)("Fichier XML trop volumineux pour l'aperçu. Pour consulter le fichier complet, téléchargez-le en cliquant sur le bouton bleu ou depuis l'onglet Téléchargements.") : t(r)("L'aperçu n'est pas disponible car la taille du fichier est inconnue. Pour consulter le fichier complet, téléchargez-le en cliquant sur le bouton bleu ou depuis l'onglet Téléchargements.")), 1)
+          d("span", null, i(y.value ? t(r)("Fichier XML trop volumineux pour l'aperçu. Pour consulter le fichier complet, téléchargez-le en cliquant sur le bouton bleu ou depuis l'onglet Téléchargements.") : t(r)("L'aperçu n'est pas disponible car la taille du fichier est inconnue. Pour consulter le fichier complet, téléchargez-le en cliquant sur le bouton bleu ou depuis l'onglet Téléchargements.")), 1)
         ]),
         _: 1
       })) : s.value === "network" ? (l(), m(h, {

package/dist/common-C4rDcQpp.js

@@ -0,0 +1,243 @@
+import { q as w, aV as F, i as _, aW as I, m as O } from "./proj-CKwYjU38.js";
+function X(n, u) {
+  if (!n)
+    throw new Error(u);
+}
+function q(n) {
+  return Math.pow(n, 3);
+}
+function Z(n) {
+  return 1 - q(1 - n);
+}
+function P(n) {
+  return 3 * n * n - 2 * n * n * n;
+}
+function V(n) {
+  return n;
+}
+const b = new Array(6);
+function W() {
+  return [1, 0, 0, 1, 0, 0];
+}
+function z(n) {
+  return s(n, 1, 0, 0, 1, 0, 0);
+}
+function v(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], L = u[3], S = u[4], M = u[5];
+  return n[0] = i * g + c * h, n[1] = e * g + t * h, n[2] = i * p + c * L, n[3] = e * p + t * L, n[4] = i * S + c * M + r, n[5] = e * S + t * M + 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 B(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 G(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 H(n, u, i) {
+  return v(n, s(b, u, 0, 0, i, 0, 0));
+}
+function J(n, u, i) {
+  return v(n, s(b, 1, 0, 0, 1, u, i));
+}
+function K(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 N(n, u) {
+  const i = y(u);
+  X(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) {
+  return n[0] * n[3] - n[1] * n[2];
+}
+const D = [1e5, 1e5, 1e5, 1e5, 2, 2];
+function Q(n) {
+  return "matrix(" + n.join(", ") + ")";
+}
+function R(n) {
+  return n.substring(7, n.length - 1).split(",").map(parseFloat);
+}
+function $(n, u) {
+  const i = R(n), e = R(u);
+  for (let c = 0; c < 6; ++c)
+    if (Math.round((i[c] - e[c]) * D[c]) !== 0)
+      return !1;
+  return !0;
+}
+function E(n, u, i, e, c) {
+  return !w(
+    c,
+    /**
+     * @param {import("../../coordinate.js").Coordinate} coordinate Coordinate.
+     * @return {boolean} Contains (x, y).
+     */
+    function(r) {
+      return !a(
+        n,
+        u,
+        i,
+        e,
+        r[0],
+        r[1]
+      );
+    }
+  );
+}
+function a(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;
+  }
+  return r !== 0;
+}
+function T(n, u, i, e, c, t) {
+  if (i.length === 0 || !a(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))
+      return !1;
+  return !0;
+}
+function f(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))
+      return !0;
+    u = g[g.length - 1];
+  }
+  return !1;
+}
+function Y(n, u, i, e, c) {
+  let t;
+  for (u += e; u < i; u += e)
+    if (t = c(
+      n.slice(u - e, u),
+      n.slice(u, u + e)
+    ), t)
+      return t;
+  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 : Y(
+    n,
+    u,
+    i,
+    e,
+    /**
+     * @param {import("../../coordinate.js").Coordinate} point1 Start point.
+     * @param {import("../../coordinate.js").Coordinate} point2 End point.
+     * @return {boolean} `true` if the segment and the extent intersect,
+     *     `false` otherwise.
+     */
+    function(r, l) {
+      return I(c, r, l);
+    }
+  ) : !1;
+}
+function o(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;
+    u = i[t];
+  }
+  return !1;
+}
+function j(n, u, i, e, c) {
+  return !!(A(n, u, i, e, c) || a(
+    n,
+    u,
+    i,
+    e,
+    c[0],
+    c[1]
+  ) || a(
+    n,
+    u,
+    i,
+    e,
+    c[0],
+    c[3]
+  ) || a(
+    n,
+    u,
+    i,
+    e,
+    c[2],
+    c[1]
+  ) || a(
+    n,
+    u,
+    i,
+    e,
+    c[2],
+    c[3]
+  ));
+}
+function k(n, u, i, e, c) {
+  if (!j(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(
+      n,
+      i[t - 1],
+      i[t],
+      e,
+      c
+    ) && !A(
+      n,
+      i[t - 1],
+      i[t],
+      e,
+      c
+    ))
+      return !1;
+  return !0;
+}
+function C(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))
+      return !0;
+    u = l[l.length - 1];
+  }
+  return !1;
+}
+const x = 42, m = 256;
+export {
+  x as D,
+  X as a,
+  o as b,
+  C as c,
+  K as d,
+  W as e,
+  Y as f,
+  G as g,
+  H as h,
+  A as i,
+  Z as j,
+  V as k,
+  f as l,
+  v as m,
+  N as n,
+  $ as o,
+  Q as p,
+  T as q,
+  z as r,
+  B as s,
+  J as t,
+  k as u,
+  P as v,
+  m as w,
+  j as x,
+  q as y
+};