react-semaphor 0.1.555 → 0.1.556

package/dist/chunks/{index-CtoK1Lgu.js → index-dIV-Gdsb.js}

@@ -20,8 +20,6 @@ function bt(n) {
 }
 const gt = [
   "table",
-  "pivotTable",
-  "aggregateTable",
   "matrixTable",
   "detailTable"
 ], Mt = new Set(gt);
@@ -30,7 +28,7 @@ function kt(n) {
 }
 function vt(n) {
   var t, i;
-  return ((t = n == null ? void 0 : n.cards) == null ? void 0 : t.find((e) => e.id === n.activeCardId)) ?? ((i = n == null ? void 0 : n.cards) == null ? void 0 : i[0]);
+  return ((t = n == null ? void 0 : n.cards) == null ? void 0 : t.find((o) => o.id === n.activeCardId)) ?? ((i = n == null ? void 0 : n.cards) == null ? void 0 : i[0]);
 }
 function K(n) {
   var i;
@@ -53,12 +51,12 @@ const L = {
 };
 function Y(n) {
   if (n <= 0) return [];
-  const t = Math.ceil(n / 4), i = Math.floor(n / t), e = n % t;
-  return Array.from({ length: t }, (o, r) => r < e ? i + 1 : i).flatMap(
-    (o) => Array.from({ length: o }, () => 48 / o)
+  const t = Math.ceil(n / 4), i = Math.floor(n / t), o = n % t;
+  return Array.from({ length: t }, (e, r) => r < o ? i + 1 : i).flatMap(
+    (e) => Array.from({ length: e }, () => 48 / e)
   );
 }
-const et = {
+const ot = {
   full: 48,
   half: 24,
   third: 16,
@@ -66,9 +64,9 @@ const et = {
 }, Wt = ["full", "half", "third", "quarter"];
 function _t(n) {
   let t = "full", i = 1 / 0;
-  for (const e of Wt) {
-    const o = Math.abs(et[e] - n);
-    o < i && (t = e, i = o);
+  for (const o of Wt) {
+    const e = Math.abs(ot[o] - n);
+    e < i && (t = o, i = e);
   }
   return t;
 }
@@ -86,35 +84,35 @@ function Q(n, t) {
 function Ht(n) {
   return n.slice().sort((t, i) => t.y > i.y || t.y === i.y && t.x > i.x ? 1 : t.y === i.y && t.x === i.x ? 0 : -1);
 }
-function ot(n, t, i) {
+function et(n, t, i) {
   t.y += 1;
-  const e = n.findIndex((o) => o.i === t.i);
-  for (let o = e + 1; o < n.length; o += 1) {
-    const r = n[o];
+  const o = n.findIndex((e) => e.i === t.i);
+  for (let e = o + 1; e < n.length; e += 1) {
+    const r = n[e];
     if (!r.static) {
       if (r.y > t.y + t.h) break;
-      N(t, r) && ot(n, r, i + t.h);
+      N(t, r) && et(n, r, i + t.h);
     }
   }
   t.y = i;
 }
 function zt(n, t, i) {
   for (t.y = Math.min(I(n), t.y); t.y > 0 && !Q(n, t); ) t.y -= 1;
-  let e;
-  for (; e = Q(n, t); )
-    ot(i, t, e.y + e.h);
+  let o;
+  for (; o = Q(n, t); )
+    et(i, t, o.y + o.h);
   return t.y = Math.max(t.y, 0), t.x = Math.max(t.x, 0), t;
 }
 function M(n) {
-  const t = n.map((r) => ({ ...r })), i = t.filter((r) => r.static), e = Ht(t), o = /* @__PURE__ */ new Map();
-  for (const r of e) {
+  const t = n.map((r) => ({ ...r })), i = t.filter((r) => r.static), o = Ht(t), e = /* @__PURE__ */ new Map();
+  for (const r of o) {
     let s = { ...r };
-    s.static || (s = zt(i, s, e), i.push(s)), o.set(r, s);
+    s.static || (s = zt(i, s, o), i.push(s)), e.set(r, s);
   }
-  return t.map((r) => o.get(r));
+  return t.map((r) => e.get(r));
 }
 function It(n) {
-  return M(n).every((i, e) => i.y === n[e].y && i.x === n[e].x);
+  return M(n).every((i, o) => i.y === n[o].y && i.x === n[o].x);
 }
 function Ot(n) {
   for (let t = 0; t < n.length; t += 1)
@@ -123,42 +121,42 @@ function Ot(n) {
   return !1;
 }
 function B(n, t) {
-  const i = (e) => t.get(e.i) ?? Number.MAX_SAFE_INTEGER;
-  return n.slice().sort((e, o) => e.y - o.y || e.x - o.x || i(e) - i(o));
+  const i = (o) => t.get(o.i) ?? Number.MAX_SAFE_INTEGER;
+  return n.slice().sort((o, e) => o.y - e.y || o.x - e.x || i(o) - i(e));
 }
 function R(n) {
   const t = [];
-  let i = [], e = 0;
-  for (const o of n) {
+  let i = [], o = 0;
+  for (const e of n) {
     const r = i[i.length - 1];
-    if (r && o.x >= r.x + r.w && e + o.w <= g) {
-      i.push(o), e += o.w;
+    if (r && e.x >= r.x + r.w && o + e.w <= g) {
+      i.push(e), o += e.w;
       continue;
     }
-    i.length && t.push(i), i = [o], e = o.w;
+    i.length && t.push(i), i = [e], o = e.w;
   }
   return i.length && t.push(i), t;
 }
 function At(n) {
   return new Map(n.map((t, i) => [t, i]));
 }
-function Et(n, t, i, e) {
-  const o = (c) => t.get(c) ?? "chart", r = B(n, i).map((c) => c.i), s = r.find((c) => o(c) === "text"), a = e ? r : [
+function Et(n, t, i, o) {
+  const e = (c) => t.get(c) ?? "chart", r = B(n, i).map((c) => c.i), s = r.find((c) => e(c) === "text"), a = o ? r : [
     ...s ? [s] : [],
-    ...r.filter((c) => o(c) === "kpi"),
-    ...r.filter((c) => o(c) === "chart"),
-    ...r.filter((c) => o(c) === "table"),
-    ...r.filter((c) => o(c) === "text" && c !== s)
+    ...r.filter((c) => e(c) === "kpi"),
+    ...r.filter((c) => e(c) === "chart"),
+    ...r.filter((c) => e(c) === "table"),
+    ...r.filter((c) => e(c) === "text" && c !== s)
   ], f = (c) => {
     const p = a[c];
-    if (!e) return a.filter((k) => o(k) === o(p));
+    if (!o) return a.filter((k) => e(k) === e(p));
     let w = c;
-    for (; w > 0 && o(a[w - 1]) === o(p); ) w -= 1;
+    for (; w > 0 && e(a[w - 1]) === e(p); ) w -= 1;
     let h = c;
-    for (; h < a.length - 1 && o(a[h + 1]) === o(p); ) h += 1;
+    for (; h < a.length - 1 && e(a[h + 1]) === e(p); ) h += 1;
     return a.slice(w, h + 1);
   }, x = (c) => {
-    const p = a[c], w = o(p);
+    const p = a[c], w = e(p);
     if (w === "table") return g;
     if (w === "text") return p === s ? g : g / 2;
     const h = f(c);
@@ -168,7 +166,7 @@ function Et(n, t, i, e) {
   };
   let l = 0, u = 0, d = 0;
   const m = a.map((c, p) => {
-    const w = L[o(c)], h = Math.min(x(p), g);
+    const w = L[e(c)], h = Math.min(x(p), g);
     l > 0 && l + h > g && (l = 0, u += d, d = 0);
     const k = { i: c, x: l, y: u, w: h, h: w.h, minW: Math.min(w.minW, g), minH: w.minH };
     return l += h, d = Math.max(d, w.h), k;
@@ -178,85 +176,85 @@ function Et(n, t, i, e) {
 function S(n) {
   return Math.floor(n + 0.5);
 }
-function rt(n, t, i, e, o, r) {
-  const s = v.columns[t], a = { i: n.i, x: i, y: e, w: o, h: n.h }, f = r ?? n.minW;
-  return f !== void 0 && (a.minW = Math.max(1, Math.min(f, o, s))), n.minH !== void 0 && (a.minH = n.minH), n.maxW !== void 0 && (a.maxW = Math.max(o, Math.min(n.maxW, s))), n.maxH !== void 0 && (a.maxH = n.maxH), n.static !== void 0 && (a.static = n.static), n.isResizable !== void 0 && (a.isResizable = n.isResizable), n.isDraggable !== void 0 && (a.isDraggable = n.isDraggable), a;
+function rt(n, t, i, o, e, r) {
+  const s = v.columns[t], a = { i: n.i, x: i, y: o, w: e, h: n.h }, f = r ?? n.minW;
+  return f !== void 0 && (a.minW = Math.max(1, Math.min(f, e, s))), n.minH !== void 0 && (a.minH = n.minH), n.maxW !== void 0 && (a.maxW = Math.max(e, Math.min(n.maxW, s))), n.maxH !== void 0 && (a.maxH = n.maxH), n.static !== void 0 && (a.static = n.static), n.isResizable !== void 0 && (a.isResizable = n.isResizable), n.isDraggable !== void 0 && (a.isDraggable = n.isDraggable), a;
 }
 function st(n) {
   return M(
     n.map((t) => {
-      let i = S(t.x * 0.75), o = S((t.x + t.w) * 0.75) - i;
-      o === 0 && (o = 1, i === 36 && (i = 35));
-      const r = t.minW === void 0 ? void 0 : Math.min(Math.max(1, S(t.minW * 0.75)), o);
-      return rt(t, "md", i, t.y, o, r);
+      let i = S(t.x * 0.75), e = S((t.x + t.w) * 0.75) - i;
+      e === 0 && (e = 1, i === 36 && (i = 35));
+      const r = t.minW === void 0 ? void 0 : Math.min(Math.max(1, S(t.minW * 0.75)), e);
+      return rt(t, "md", i, t.y, e, r);
     })
   );
 }
 function St(n, t) {
-  const i = new Map(st(n).map((r) => [r.i, r])), e = new Map(t.map((r) => [r.i, r])), o = v.columns.lg;
+  const i = new Map(st(n).map((r) => [r.i, r])), o = new Map(t.map((r) => [r.i, r])), e = v.columns.lg;
   return n.map((r) => {
-    const s = e.get(r.i), a = i.get(r.i);
+    const s = o.get(r.i), a = i.get(r.i);
     if (!s || !a) return r;
     const f = { ...r };
     if (s.x !== a.x || s.w !== a.w) {
-      const x = Math.min(o - 1, S(s.x * 1.3333333333333333)), l = Math.min(o, Math.max(x + 1, S((s.x + s.w) * (4 / 3))));
+      const x = Math.min(e - 1, S(s.x * 1.3333333333333333)), l = Math.min(e, Math.max(x + 1, S((s.x + s.w) * (4 / 3))));
       f.x = x, f.w = l - x;
     }
     return (s.y !== a.y || s.h !== a.h) && (f.y = s.y, f.h = s.h), f;
   });
 }
 function j(n, t, i) {
-  const e = /* @__PURE__ */ new Map();
-  let o = 0;
+  const o = /* @__PURE__ */ new Map();
+  let e = 0;
   for (const r of n) {
     let s = 0;
     for (const a of r)
-      e.set(a.source.i, rt(a.source, t, a.x, o, a.w)), s = Math.max(s, a.source.h);
-    o += s;
+      o.set(a.source.i, rt(a.source, t, a.x, e, a.w)), s = Math.max(s, a.source.h);
+    e += s;
   }
-  return M(i.map((r) => e.get(r.i)));
+  return M(i.map((r) => o.get(r.i)));
 }
 function tt(n, t, i) {
-  const e = [];
-  for (const o of n) {
+  const o = [];
+  for (const e of n) {
     let r;
     const s = () => {
-      r && e.push([{ source: r, x: 0, w: t }]), r = void 0;
+      r && o.push([{ source: r, x: 0, w: t }]), r = void 0;
     };
-    for (const a of o)
-      i(a) ? (s(), e.push([{ source: a, x: 0, w: t }])) : r ? (e.push([
+    for (const a of e)
+      i(a) ? (s(), o.push([{ source: a, x: 0, w: t }])) : r ? (o.push([
         { source: r, x: 0, w: t / 2 },
         { source: a, x: t / 2, w: t / 2 }
       ]), r = void 0) : r = a;
     s();
   }
-  return e;
+  return o;
 }
-function at(n, t, i, e) {
+function at(n, t, i, o) {
   if (n === "md") return st(t);
-  const o = v.columns[n], r = R(B(t, e)), s = (a) => i.get(a.i) ?? "chart";
-  return n === "sm" ? j(tt(r, o, (a) => s(a) === "table" || s(a) === "text"), "sm", t) : n === "xs" ? j(tt(r, o, (a) => s(a) !== "kpi"), "xs", t) : j(
-    r.flatMap((a) => a.map((f) => [{ source: f, x: 0, w: o }])),
+  const e = v.columns[n], r = R(B(t, o)), s = (a) => i.get(a.i) ?? "chart";
+  return n === "sm" ? j(tt(r, e, (a) => s(a) === "table" || s(a) === "text"), "sm", t) : n === "xs" ? j(tt(r, e, (a) => s(a) !== "kpi"), "xs", t) : j(
+    r.flatMap((a) => a.map((f) => [{ source: f, x: 0, w: e }])),
     "xxs",
     t
   );
 }
 function H(n, t, i) {
-  const e = L[t];
-  return { i: n, x: 0, y: 0, w: i, h: e.h, minW: Math.min(e.minW, i), minH: e.minH };
+  const o = L[t];
+  return { i: n, x: 0, y: 0, w: i, h: o.h, minW: Math.min(o.minW, i), minH: o.minH };
 }
 function P(n, t) {
-  return n.slice().sort((i, e) => (t.get(i.i) ?? 0) - (t.get(e.i) ?? 0));
+  return n.slice().sort((i, o) => (t.get(i.i) ?? 0) - (t.get(o.i) ?? 0));
 }
 function G(n, t, i) {
-  return n.map((e) => e.y >= t ? { ...e, y: e.y + i } : e);
+  return n.map((o) => o.y >= t ? { ...o, y: o.y + i } : o);
 }
 function Tt(n, t, i) {
-  const e = (f, x) => !t.some((l) => N({ ...n, i: "\0", x: f, y: x }, l)), o = n.x + n.w;
-  if (o + n.w <= i && e(o, n.y)) return { x: o, y: n.y };
+  const o = (f, x) => !t.some((l) => N({ ...n, i: "\0", x: f, y: x }, l)), e = n.x + n.w;
+  if (e + n.w <= i && o(e, n.y)) return { x: e, y: n.y };
   const r = Math.max(i - n.w, 0), s = n.y + n.h, a = [s, ...t.map((f) => f.y + f.h).filter((f) => f > s).sort((f, x) => f - x)];
   for (const f of a)
-    for (let x = 0; x <= r; x += 1) if (e(x, f)) return { x, y: f };
+    for (let x = 0; x <= r; x += 1) if (o(x, f)) return { x, y: f };
   return { x: 0, y: s };
 }
 function ft(n, t) {
@@ -269,18 +267,18 @@ function ft(n, t) {
     ...n.maxW !== void 0 ? { maxW: Math.max(i, Math.min(n.maxW, t)) } : {}
   };
 }
-function ct(n, t, i, e) {
-  const o = n.find((f) => f.i === t), r = ft(o, e), { x: s, y: a } = Tt(r, n.filter((f) => f.i !== t), e);
+function ct(n, t, i, o) {
+  const e = n.find((f) => f.i === t), r = ft(e, o), { x: s, y: a } = Tt(r, n.filter((f) => f.i !== t), o);
   return [...n, { ...r, i, x: s, y: a }];
 }
-function Bt(n, t, i, e, o) {
+function Bt(n, t, i, o, e) {
   var u;
-  const r = e == null ? void 0 : e.position;
+  const r = o == null ? void 0 : o.position;
   if (r && typeof r == "object" && "beside" in r)
-    return M(P(ct(n, r.beside, t, g), o.frameOrder));
-  const s = e != null && e.width ? et[e.width] : void 0;
+    return M(P(ct(n, r.beside, t, g), e.frameOrder));
+  const s = o != null && o.width ? ot[o.width] : void 0;
   let a = n.slice();
-  const f = (d) => M(P([...a, d], o.frameOrder));
+  const f = (d) => M(P([...a, d], e.frameOrder));
   if (r === "top") {
     const d = H(t, i, s ?? E[i]);
     return a = G(a, 0, d.h), f(d);
@@ -288,7 +286,7 @@ function Bt(n, t, i, e, o) {
   if (r === "end" || r === void 0 && s !== void 0)
     return f({ ...H(t, i, s ?? E[i]), y: I(a) });
   if (r && typeof r == "object" && "after" in r) {
-    const d = H(t, i, s ?? E[i]), c = R(B(a, o.frameOrder)).find((W) => W.some((b) => b.i === r.after)), p = c.find((W) => W.i === r.after), w = c[c.length - 1];
+    const d = H(t, i, s ?? E[i]), c = R(B(a, e.frameOrder)).find((W) => W.some((b) => b.i === r.after)), p = c.find((W) => W.i === r.after), w = c[c.length - 1];
     if (g - (w.x + w.w) >= d.w) {
       const W = new Set(c.filter((b) => b.x > p.x).map((b) => b.i));
       return a = a.map((b) => W.has(b.i) ? { ...b, x: b.x + d.w } : b), f({ ...d, x: p.x + p.w, y: p.y });
@@ -296,7 +294,7 @@ function Bt(n, t, i, e, o) {
     const k = Math.max(...c.map((W) => W.y + W.h));
     return a = G(a, k, d.h), f({ ...d, x: 0, y: k });
   }
-  const x = (d) => o.kinds.get(d.i) ?? "chart", l = R(B(a, o.frameOrder));
+  const x = (d) => e.kinds.get(d.i) ?? "chart", l = R(B(a, e.frameOrder));
   if (i === "kpi") {
     const d = ((u = l[0]) == null ? void 0 : u.length) === 1 && x(l[0][0]) === "text" ? 1 : 0;
     let m = d;
@@ -313,7 +311,7 @@ function Bt(n, t, i, e, o) {
       const yt = { ...y, x: b, y: F, w: $, ...y.minW !== void 0 ? { minW: Math.min(y.minW, $) } : {} };
       return b += $, O = Math.max(O, y.h), yt;
     }), Z = F + O, xt = a.filter((y) => !p.has(y.i)).map((y) => y.y >= w && Z > h ? { ...y, y: y.y + (Z - h) } : y);
-    return M(P([...xt, ...pt], o.frameOrder));
+    return M(P([...xt, ...pt], e.frameOrder));
   }
   if (i === "chart") {
     const d = l[l.length - 1], m = (d == null ? void 0 : d.length) === 1 ? d[0] : void 0;
@@ -322,8 +320,8 @@ function Bt(n, t, i, e, o) {
   return f({ ...H(t, i, g), y: I(a) });
 }
 function dt(n, t, i) {
-  const e = Math.max(1, Math.min(i, Math.round(t.w * i / g)));
-  return [...n, ft({ ...t, x: 0, y: I(n), w: e }, i)];
+  const o = Math.max(1, Math.min(i, Math.round(t.w * i / g)));
+  return [...n, ft({ ...t, x: 0, y: I(n), w: o }, i)];
 }
 const V = ["md", "sm", "xs", "xxs"], ut = [];
 function A(n) {
@@ -339,12 +337,12 @@ function _(n) {
   return typeof n == "number" && Number.isFinite(n) ? Math.round(n) : void 0;
 }
 function T(n, t, i) {
-  const e = new Set(i.ids), o = /* @__PURE__ */ new Map();
-  if (!Array.isArray(n)) return o;
+  const o = new Set(i.ids), e = /* @__PURE__ */ new Map();
+  if (!Array.isArray(n)) return e;
   for (const r of n) {
     if (!r || typeof r != "object") continue;
     const s = r, a = s.i;
-    if (typeof a != "string" || !e.has(a) || o.has(a)) continue;
+    if (typeof a != "string" || !o.has(a) || e.has(a)) continue;
     const f = i.kinds.get(a) ?? "chart", x = _(s.minH), l = Math.max(1, Math.min(_(s.w) ?? Math.min(E[f], t), t)), u = Math.max(_(s.h) ?? L[f].h, x ?? 1, 1), d = {
       i: a,
       x: Math.max(0, Math.min(_(s.x) ?? 0, t - l)),
@@ -356,9 +354,9 @@ function T(n, t, i) {
     const c = _(s.maxW);
     c !== void 0 && (d.maxW = Math.max(c, l));
     const p = _(s.maxH);
-    p !== void 0 && (d.maxH = Math.max(p, u)), typeof s.static == "boolean" && (d.static = s.static), typeof s.isResizable == "boolean" && (d.isResizable = s.isResizable), typeof s.isDraggable == "boolean" && (d.isDraggable = s.isDraggable), o.set(a, d);
+    p !== void 0 && (d.maxH = Math.max(p, u)), typeof s.static == "boolean" && (d.static = s.static), typeof s.isResizable == "boolean" && (d.isResizable = s.isResizable), typeof s.isDraggable == "boolean" && (d.isDraggable = s.isDraggable), e.set(a, d);
   }
-  return o;
+  return e;
 }
 function Lt(n, t) {
   return t.ids.every((i) => n.has(i));
@@ -367,23 +365,23 @@ function D(n, t) {
   return t.ids.flatMap((i) => n.has(i) ? [n.get(i)] : []);
 }
 function X(n, t) {
-  const i = M(D(n, t)), e = new Map(i.map((r) => [r.i, r]));
-  let o = I(i);
+  const i = M(D(n, t)), o = new Map(i.map((r) => [r.i, r]));
+  let e = I(i);
   for (const r of t.ids) {
-    if (e.has(r)) continue;
+    if (o.has(r)) continue;
     const s = t.kinds.get(r) ?? "chart", a = L[s], f = E[s];
-    e.set(r, { i: r, x: 0, y: o, w: f, h: a.h, minW: Math.min(a.minW, f), minH: a.minH }), o += a.h;
+    o.set(r, { i: r, x: 0, y: e, w: f, h: a.h, minW: Math.min(a.minW, f), minH: a.minH }), e += a.h;
   }
-  return M(t.ids.map((r) => e.get(r)));
+  return M(t.ids.map((r) => o.get(r)));
 }
 function Ct(n, t) {
   const i = g / t;
-  return n.map((e) => {
-    if (!e || typeof e != "object") return e;
-    const o = e, r = _(o.x), s = _(o.w);
-    if (r === void 0 || s === void 0) return o;
+  return n.map((o) => {
+    if (!o || typeof o != "object") return o;
+    const e = o, r = _(e.x), s = _(e.w);
+    if (r === void 0 || s === void 0) return e;
     const a = Math.round(r * i), f = Math.round((r + s) * i);
-    return { ...o, x: a, w: Math.max(1, f - a) };
+    return { ...e, x: a, w: Math.max(1, f - a) };
   });
 }
 function $t(n) {
@@ -391,8 +389,8 @@ function $t(n) {
   if (Array.isArray(t.lg)) return t.lg;
   if (Array.isArray(n.layout)) return n.layout;
   for (const i of V) {
-    const e = t[i];
-    if (Array.isArray(e)) return Ct(e, v.columns[i]);
+    const o = t[i];
+    if (Array.isArray(o)) return Ct(o, v.columns[i]);
   }
   return [];
 }
@@ -400,27 +398,27 @@ function nt(n, t) {
   var i;
   return (i = n.layouts) == null ? void 0 : i[t];
 }
-function mt(n, t, i, e) {
-  let o = M(D(n, e));
+function mt(n, t, i, o) {
+  let e = M(D(n, o));
   for (const r of t)
-    n.has(r.i) || (o = dt(o, r, v.columns[i]));
-  return M(U(o, e));
+    n.has(r.i) || (e = dt(e, r, v.columns[i]));
+  return M(U(e, o));
 }
 function U(n, t) {
-  return n.slice().sort((i, e) => (t.frameOrder.get(i.i) ?? 0) - (t.frameOrder.get(e.i) ?? 0));
+  return n.slice().sort((i, o) => (t.frameOrder.get(i.i) ?? 0) - (t.frameOrder.get(o.i) ?? 0));
 }
 const Rt = ["i", "x", "y", "w", "h", "minW", "minH", "maxW", "maxH", "static", "isResizable", "isDraggable"];
 function lt(n, t) {
-  return !Array.isArray(n) || n.length !== t.length ? !1 : t.every((i, e) => {
-    const o = n[e];
-    return !!o && Rt.every((r) => o[r] === i[r]);
+  return !Array.isArray(n) || n.length !== t.length ? !1 : t.every((i, o) => {
+    const e = n[o];
+    return !!e && Rt.every((r) => e[r] === i[r]);
   });
 }
 function Dt(n, t) {
-  const i = new Map(t.map((e) => [e.i, e]));
-  return n.length === t.length && n.every((e) => {
-    const o = i.get(e.i);
-    return !!o && o.x === e.x && o.y === e.y && o.w === e.w && o.h === e.h;
+  const i = new Map(t.map((o) => [o.i, o]));
+  return n.length === t.length && n.every((o) => {
+    const e = i.get(o.i);
+    return !!e && e.x === o.x && e.y === o.y && e.w === o.w && e.h === o.h;
   });
 }
 function Nt(n, t) {
@@ -430,62 +428,62 @@ function Ft(n) {
   return v.customizable.filter((t) => n.includes(t));
 }
 function ht(n, t, i) {
-  const e = { lg: n };
-  for (const o of V)
-    e[o] = i[o] ?? at(o, n, t.kinds, t.frameOrder);
-  return e;
+  const o = { lg: n };
+  for (const e of V)
+    o[e] = i[e] ?? at(e, n, t.kinds, t.frameOrder);
+  return o;
 }
 function jt(n, t) {
   return R(B(n, t.frameOrder)).map((i) => ({
-    tiles: i.map((e) => ({ frameId: e.i, kind: t.kinds.get(e.i) ?? "chart", width: _t(e.w) }))
+    tiles: i.map((o) => ({ frameId: o.i, kind: t.kinds.get(o.i) ?? "chart", width: _t(o.w) }))
   }));
 }
 function Pt(n) {
-  const t = A(n.frames ?? ut), i = X(T($t(n), g, t), t), e = Array.isArray(n.customizedBreakpoints), o = {}, r = [];
+  const t = A(n.frames ?? ut), i = X(T($t(n), g, t), t), o = Array.isArray(n.customizedBreakpoints), e = {}, r = [];
   for (const f of V) {
     const x = v.columns[f], l = T(nt(n, f), x, t), u = Lt(l, t) && t.ids.length > 0;
     if (q(f)) {
-      if (e && n.customizedBreakpoints.includes(f)) {
-        o[f] = mt(l, i, f, t), r.push(f);
+      if (o && n.customizedBreakpoints.includes(f)) {
+        e[f] = mt(l, i, f, t), r.push(f);
         continue;
       }
-      if (!e && u) {
+      if (!o && u) {
         const m = M(D(l, t));
-        Dt(m, at(f, i, t.kinds, t.frameOrder)) || (o[f] = m, r.push(f));
+        Dt(m, at(f, i, t.kinds, t.frameOrder)) || (e[f] = m, r.push(f));
       }
       continue;
     }
-    !e && u && (o[f] = M(D(l, t)));
+    !o && u && (e[f] = M(D(l, t)));
   }
-  const s = ht(i, t, o), a = v.breakpoints.some((f) => !lt(nt(n, f), s[f]));
+  const s = ht(i, t, e), a = v.breakpoints.some((f) => !lt(nt(n, f), s[f]));
   return { layouts: s, customizedBreakpoints: r, rows: jt(i, t), repaired: a };
 }
 function z(n) {
   return { ok: !1, failure: n };
 }
 function it(n, t, i) {
-  const e = L[i];
-  return n.map((o) => o.i === t ? { ...o, h: e.h, minH: e.minH, minW: Math.min(e.minW, o.w) } : o);
+  const o = L[i];
+  return n.map((e) => e.i === t ? { ...e, h: o.h, minH: o.minH, minW: Math.min(o.minW, e.w) } : e);
 }
 function Gt(n, t) {
-  const i = Pt(n), e = n.frames ?? ut;
-  let o = e, r = i.layouts.lg, s = i.customizedBreakpoints.slice();
+  const i = Pt(n), o = n.frames ?? ut;
+  let e = o, r = i.layouts.lg, s = i.customizedBreakpoints.slice();
   const a = {};
   for (const u of s) a[u] = i.layouts[u];
   switch (t.kind) {
     case "frame_added": {
       const { frame: u, placement: d } = t;
-      if (e.some((h) => h.id === u.id))
+      if (o.some((h) => h.id === u.id))
         return z({ code: "frame_already_on_sheet", frameId: u.id, message: `A frame with id ${u.id} is already on this sheet.` });
       const m = d == null ? void 0 : d.position, c = typeof m == "object" ? "after" in m ? m.after : m.beside : void 0;
-      if (c !== void 0 && !e.some((h) => h.id === c))
+      if (c !== void 0 && !o.some((h) => h.id === c))
         return z({ code: "position_target_not_found", frameId: c, message: `No frame ${c} on this sheet to place the new frame next to.` });
-      if (m === "top") o = [u, ...e];
+      if (m === "top") e = [u, ...o];
       else if (c !== void 0) {
-        const h = e.findIndex((k) => k.id === c);
-        o = [...e.slice(0, h + 1), u, ...e.slice(h + 1)];
-      } else o = [...e, u];
-      const p = A(o);
+        const h = o.findIndex((k) => k.id === c);
+        e = [...o.slice(0, h + 1), u, ...o.slice(h + 1)];
+      } else e = [...o, u];
+      const p = A(e);
       r = Bt(r, u.id, p.kinds.get(u.id), d, p);
       const w = r.find((h) => h.i === u.id);
       for (const h of s) {
@@ -495,23 +493,23 @@ function Gt(n, t) {
       break;
     }
     case "frame_removed": {
-      if (!e.some((u) => u.id === t.frameId))
+      if (!o.some((u) => u.id === t.frameId))
         return z({ code: "frame_not_on_sheet", frameId: t.frameId, message: `No frame ${t.frameId} on this sheet.` });
-      o = e.filter((u) => u.id !== t.frameId), r = M(r.filter((u) => u.i !== t.frameId));
+      e = o.filter((u) => u.id !== t.frameId), r = M(r.filter((u) => u.i !== t.frameId));
       for (const u of s)
         a[u] = M(a[u].filter((d) => d.i !== t.frameId));
       break;
     }
     case "frame_updated": {
-      const u = e.findIndex((c) => c.id === t.frame.id);
+      const u = o.findIndex((c) => c.id === t.frame.id);
       if (u < 0)
         return z({ code: "frame_not_on_sheet", frameId: t.frame.id, message: `No frame ${t.frame.id} on this sheet.` });
-      o = e.map((c, p) => p === u ? t.frame : c);
-      const d = K(e[u]), m = K(t.frame);
+      e = o.map((c, p) => p === u ? t.frame : c);
+      const d = K(o[u]), m = K(t.frame);
       if (d === m)
         return {
           ok: !0,
-          frames: o,
+          frames: e,
           layouts: i.layouts,
           customizedBreakpoints: i.customizedBreakpoints,
           changed: !0,
@@ -527,7 +525,7 @@ function Gt(n, t) {
     case "grid_edited": {
       if (!bt(t.breakpoint))
         return z({ code: "breakpoint_not_editable", breakpoint: String(t.breakpoint), message: `The ${String(t.breakpoint)} layout is derived; edit Desktop, Tablet or Phone.` });
-      const u = A(e);
+      const u = A(o);
       if (t.breakpoint === "md") {
         const d = [...T(t.items, v.columns.md, u).values()];
         r = X(new Map(St(r, d).map((m) => [m.i, m])), u);
@@ -546,34 +544,34 @@ function Gt(n, t) {
       break;
     }
     case "arrange": {
-      const u = A(e), d = Et(r, u.kinds, u.frameOrder, t.keepOrder === !0), m = new Map(e.map((c) => [c.id, c]));
-      o = d.order.map((c) => m.get(c)), o.every((c, p) => c === e[p]) && (o = e), r = d.items, s = [];
+      const u = A(o), d = Et(r, u.kinds, u.frameOrder, t.keepOrder === !0), m = new Map(o.map((c) => [c.id, c]));
+      e = d.order.map((c) => m.get(c)), e.every((c, p) => c === o[p]) && (e = o), r = d.items, s = [];
       for (const c of v.customizable) delete a[c];
       break;
     }
   }
-  const f = A(o);
+  const f = A(e);
   r = U(r, f);
   const x = ht(r, f, a), l = !Nt(x, i.layouts) || s.join() !== i.customizedBreakpoints.join();
-  return { ok: !0, frames: o, layouts: x, customizedBreakpoints: s, changed: o !== e || l, layoutsChanged: l };
+  return { ok: !0, frames: e, layouts: x, customizedBreakpoints: s, changed: e !== o || l, layoutsChanged: l };
 }
 function Kt(n, t) {
   const i = [...t].sort().join("\0");
-  for (const e of v.breakpoints) {
-    const o = n[e], r = v.columns[e];
-    if (!Array.isArray(o)) throw new Error(`Layout ${e} is missing.`);
-    if (o.map((s) => s.i).sort().join("\0") !== i) throw new Error(`Layout ${e} doesn't hold exactly the sheet's frames.`);
-    for (const s of o) {
-      if (![s.x, s.y, s.w, s.h].every(Number.isInteger)) throw new Error(`Layout ${e}: ${s.i} has a non-integer position or size.`);
+  for (const o of v.breakpoints) {
+    const e = n[o], r = v.columns[o];
+    if (!Array.isArray(e)) throw new Error(`Layout ${o} is missing.`);
+    if (e.map((s) => s.i).sort().join("\0") !== i) throw new Error(`Layout ${o} doesn't hold exactly the sheet's frames.`);
+    for (const s of e) {
+      if (![s.x, s.y, s.w, s.h].every(Number.isInteger)) throw new Error(`Layout ${o}: ${s.i} has a non-integer position or size.`);
       if (s.x < 0 || s.y < 0 || s.w < 1 || s.w > r || s.x + s.w > r || s.h < 1)
-        throw new Error(`Layout ${e}: ${s.i} is out of bounds.`);
-      if (s.minW !== void 0 && (s.minW < 1 || s.minW > s.w)) throw new Error(`Layout ${e}: ${s.i} minW out of range.`);
-      if (s.minH !== void 0 && (s.minH < 1 || s.minH > s.h)) throw new Error(`Layout ${e}: ${s.i} minH out of range.`);
-      if (s.maxW !== void 0 && s.maxW < s.w) throw new Error(`Layout ${e}: ${s.i} maxW below w.`);
-      if (s.maxH !== void 0 && s.maxH < s.h) throw new Error(`Layout ${e}: ${s.i} maxH below h.`);
+        throw new Error(`Layout ${o}: ${s.i} is out of bounds.`);
+      if (s.minW !== void 0 && (s.minW < 1 || s.minW > s.w)) throw new Error(`Layout ${o}: ${s.i} minW out of range.`);
+      if (s.minH !== void 0 && (s.minH < 1 || s.minH > s.h)) throw new Error(`Layout ${o}: ${s.i} minH out of range.`);
+      if (s.maxW !== void 0 && s.maxW < s.w) throw new Error(`Layout ${o}: ${s.i} maxW below w.`);
+      if (s.maxH !== void 0 && s.maxH < s.h) throw new Error(`Layout ${o}: ${s.i} maxH below h.`);
     }
-    if (Ot(o)) throw new Error(`Layout ${e} has overlapping items.`);
-    if (!It(o)) throw new Error(`Layout ${e} isn't packed.`);
+    if (Ot(e)) throw new Error(`Layout ${o} has overlapping items.`);
+    if (!It(e)) throw new Error(`Layout ${o} isn't packed.`);
   }
 }
 export {