@datagouv/components-next 1.0.2-dev.9 → 1.0.2-dev.91

package/dist/XmlPreview.client-BVAeNK4n.js

@@ -0,0 +1,34 @@
+import { defineComponent as i, defineAsyncComponent as m, createBlock as u, openBlock as f, unref as t, withCtx as l, createVNode as p } from "vue";
+import { u as x } from "./main-Dk_66g-3.js";
+import { _ as w } from "./PreviewWrapper.vue_vue_type_script_setup_true_lang-BKqb6TMw.js";
+const X = /* @__PURE__ */ i({
+  __name: "XmlPreview.client",
+  props: {
+    resource: {}
+  },
+  setup(r) {
+    const o = m(
+      () => import("./vue3-xml-viewer.common-B8dNNkOU.js").then((e) => e.v).then((e) => e.default || e.XmlViewer)
+    ), n = r, s = x(), c = async () => {
+      const e = await fetch(n.resource.url);
+      if (!e.ok) throw new Error(`HTTP error! status: ${e.status}`);
+      return e.text();
+    };
+    return (e, _) => (f(), u(w, {
+      "file-type": "XML",
+      resource: r.resource,
+      "max-size": t(s).maxXmlPreviewCharSize,
+      load: c
+    }, {
+      default: l(({ data: a }) => [
+        p(t(o), {
+          xml: a
+        }, null, 8, ["xml"])
+      ]),
+      _: 1
+    }, 8, ["resource", "max-size"]));
+  }
+});
+export {
+  X as default
+};

package/dist/{common-PJfpC179.js → common-BjQlan3k.js}

@@ -1,13 +1,13 @@
-import { r as w, aV as F, i as _, aW as I, n as O } from "./proj-DsetBcW7.js";
-function X(n, u) {
+import { r as w, aX as F, i as X, aY as _, n as I } from "./proj-CsNo9yH1.js";
+function O(n, u) {
   if (!n)
     throw new Error(u);
 }
-function y(n) {
+function Y(n) {
   return Math.pow(n, 3);
 }
 function Z(n) {
-  return 1 - y(1 - n);
+  return 1 - Y(1 - n);
 }
 function z(n) {
   return 3 * n * n - 2 * n * n * n;
@@ -16,10 +16,10 @@ function P(n) {
   return n;
 }
 const b = new Array(6);
-function V() {
+function B() {
   return [1, 0, 0, 1, 0, 0];
 }
-function W(n) {
+function G(n) {
   return s(n, 1, 0, 0, 1, 0, 0);
 }
 function v(n, u) {
@@ -29,34 +29,34 @@ function v(n, u) {
 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) {
+function H(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) {
+function J(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) {
+function K(n, u, i) {
   return v(n, s(b, u, 0, 0, i, 0, 0));
 }
-function J(n, u, i) {
+function N(n, u, i) {
   return v(n, s(b, 1, 0, 0, 1, u, i));
 }
-function K(n, u, i, e, c, t, r, l) {
+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 N(n, u) {
-  const i = D(u);
-  X(i !== 0, "Transformation matrix cannot be inverted");
+function V(n, u) {
+  const i = y(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 D(n) {
+function y(n) {
   return n[0] * n[3] - n[1] * n[2];
 }
-const E = [1e5, 1e5, 1e5, 1e5, 2, 2];
-function Q(n) {
+const D = [1e5, 1e5, 1e5, 1e5, 2, 2];
+function W(n) {
   return "matrix(" + n.join(", ") + ")";
 }
 function R(n) {
@@ -65,11 +65,11 @@ function R(n) {
 function $(n, u) {
   const i = R(n), e = R(u);
   for (let c = 0; c < 6; ++c)
-    if (Math.round((i[c] - e[c]) * E[c]) !== 0)
+    if (Math.round((i[c] - e[c]) * D[c]) !== 0)
       return !1;
   return !0;
 }
-function T(n, u, i, e, c) {
+function E(n, u, i, e, c) {
   return !w(
     c,
     /**
@@ -96,7 +96,7 @@ function a(n, u, i, e, c, t) {
   }
   return r !== 0;
 }
-function Y(n, u, i, e, c, t) {
+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)
@@ -109,7 +109,7 @@ function f(n, u, i, e, c, t) {
     return !1;
   for (let r = 0, l = i.length; r < l; ++r) {
     const g = i[r];
-    if (Y(n, u, g, e, c, t))
+    if (T(n, u, g, e, c, t))
       return !0;
     u = g[g.length - 1];
   }
@@ -126,7 +126,7 @@ function j(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 : j(
+  return t = t ?? F(I(), n, u, i, e), X(c, t) ? t[0] >= c[0] && t[2] <= c[2] || t[1] >= c[1] && t[3] <= c[3] ? !0 : j(
     n,
     u,
     i,
@@ -138,7 +138,7 @@ function A(n, u, i, e, c, t) {
      *     `false` otherwise.
      */
     function(r, l) {
-      return I(c, r, l);
+      return _(c, r, l);
     }
   ) : !1;
 }
@@ -187,7 +187,7 @@ function q(n, u, i, e, c) {
   if (i.length === 1)
     return !0;
   for (let t = 1, r = i.length; t < r; ++t)
-    if (T(
+    if (E(
       n,
       i[t - 1],
       i[t],
@@ -215,30 +215,30 @@ function C(n, u, i, e, c) {
 const x = 42, m = 256;
 export {
   x as D,
-  X as a,
+  O as a,
   o as b,
   C as c,
-  K as d,
-  V as e,
+  Q as d,
+  B as e,
   j as f,
-  G as g,
-  H as h,
+  J as g,
+  K as h,
   A as i,
   Z as j,
   P as k,
   f as l,
   v as m,
-  N as n,
+  V as n,
   R as o,
   $ as p,
-  Q as q,
-  W as r,
-  B as s,
-  J as t,
-  Y as u,
+  W as q,
+  G as r,
+  H as s,
+  N as t,
+  T as u,
   q as v,
   z as w,
   m as x,
   k as y,
-  y as z
+  Y as z
 };