impact-nova 1.7.30 → 1.7.31

package/dist/components/ui/nested-list/hooks/useNestedListDragDrop.js

@@ -1,211 +1,218 @@
-import { useCallback as x } from "react";
-import { useSensors as Q, useSensor as V, MouseSensor as U, TouchSensor as Z, closestCenter as $ } from "@dnd-kit/core";
+import { useCallback as S } from "react";
+import { useSensors as Z, useSensor as V, MouseSensor as $, TouchSensor as E, closestCenter as p } from "@dnd-kit/core";
 import { arrayMove as w } from "@dnd-kit/sortable";
 const W = "droppable-", y = /* @__PURE__ */ new Set(["root-frozen", "root-scrollable"]);
-function X(a) {
-  if (a.startsWith(W)) {
-    const s = a.slice(W.length);
-    if (y.has(s)) return s;
+function X(h) {
+  if (h.startsWith(W)) {
+    const u = h.slice(W.length);
+    if (y.has(u)) return u;
   }
   return null;
 }
-const I = (a) => {
-  const s = $(a), d = s.filter(
-    (R) => !y.has(R.id)
+const nn = (h) => {
+  const u = p(h), d = u.filter(
+    (x) => !y.has(x.id)
   );
-  return d.length > 0 ? d : s;
+  return d.length > 0 ? d : u;
 };
-function M(a, s) {
-  for (const d of a) {
-    if (d.id === s) return d;
+function F(h, u) {
+  for (const d of h) {
+    if (d.id === u) return d;
     if (d.children) {
-      const R = M(d.children, s);
-      if (R) return R;
+      const x = F(d.children, u);
+      if (x) return x;
     }
   }
 }
-function j(a, s) {
-  for (const d of a) {
-    if (d.id === s) return null;
-    if (d.children && M(d.children, s))
+function j(h, u) {
+  for (const d of h) {
+    if (d.id === u) return null;
+    if (d.children && F(d.children, u))
       return d.id;
   }
   return null;
 }
-const nn = ({
-  items: a,
-  onDragEnd: s,
-  collapsedItems: d = {}
+const rn = ({
+  items: h,
+  onDragEnd: u,
+  collapsedItems: d = {},
+  canDrag: x
 }) => {
-  const R = Q(
-    V(U),
-    V(Z)
-  ), C = x(
-    (i, e, t = 0) => {
-      for (const n of i) {
-        if (n.id === e) return t;
-        if (n.children) {
-          const r = C(n.children, e, t + 1);
-          if (r !== null) return r;
+  const q = Z(
+    V($),
+    V(E)
+  ), C = S(
+    (t, e, o = 0) => {
+      for (const r of t) {
+        if (r.id === e) return o;
+        if (r.children) {
+          const n = C(r.children, e, o + 1);
+          if (n !== null) return n;
         }
       }
       return null;
     },
     []
-  ), T = x(
-    (i, e, t = null) => {
-      for (const n of i) {
-        if (n.id === e) return t;
-        if (n.children) {
-          const r = T(n.children, e, n.id);
-          if (r !== null) return r;
+  ), T = S(
+    (t, e, o = null) => {
+      for (const r of t) {
+        if (r.id === e) return o;
+        if (r.children) {
+          const n = T(r.children, e, r.id);
+          if (n !== null) return n;
         }
       }
       return null;
     },
     []
-  ), A = x(
-    (i, e, t) => i.map((n) => {
-      if (n.children && n.children.length > 0) {
-        const r = n.children.findIndex(
-          (o) => o.id === e
-        ), c = n.children.findIndex(
-          (o) => o.id === t
+  ), A = S(
+    (t, e, o) => t.map((r) => {
+      if (r.children && r.children.length > 0) {
+        const n = r.children.findIndex(
+          (i) => i.id === e
+        ), l = r.children.findIndex(
+          (i) => i.id === o
         );
-        if (r !== -1 && c !== -1) {
-          const o = w(n.children, r, c);
+        if (n !== -1 && l !== -1) {
+          const i = w(r.children, n, l);
           return {
-            ...n,
-            children: o
+            ...r,
+            children: i
           };
         }
         return {
-          ...n,
-          children: A(n.children, e, t)
+          ...r,
+          children: A(r.children, e, o)
         };
       }
-      return n;
+      return r;
     }),
     []
-  ), B = x(
-    (i, e, t) => {
-      const n = T(i, t);
-      if (!n) return null;
-      const r = i.findIndex(
-        (o) => o.id === n
-      ), c = i.findIndex(
-        (o) => o.id === e
+  ), B = S(
+    (t, e, o) => {
+      const r = T(t, o);
+      if (!r) return null;
+      const n = t.findIndex(
+        (i) => i.id === r
+      ), l = t.findIndex(
+        (i) => i.id === e
       );
-      if (r !== -1 && c !== -1) {
-        const o = w(
-          i,
-          c,
-          r
+      if (n !== -1 && l !== -1) {
+        const i = w(
+          t,
+          l,
+          n
         );
-        return s?.(e, n), o;
+        return u?.(e, r), i;
       }
       return null;
     },
-    [T, s]
-  ), k = x(
-    (i, e, t) => {
-      const n = i.findIndex((c) => c.id === e), r = i.findIndex((c) => c.id === t);
-      if (n !== -1 && r !== -1) {
-        const c = w(i, n, r);
-        return s?.(e, t), c;
+    [T, u]
+  ), k = S(
+    (t, e, o) => {
+      const r = t.findIndex((l) => l.id === e), n = t.findIndex((l) => l.id === o);
+      if (r !== -1 && n !== -1) {
+        const l = w(t, r, n);
+        return u?.(e, o), l;
       }
       return null;
     },
-    [s]
-  ), z = x(
-    (i, e, t) => {
-      const n = A(i, e, t);
-      return s?.(e, t), n;
+    [u]
+  ), z = S(
+    (t, e, o) => {
+      const r = A(t, e, o);
+      return u?.(e, o), r;
     },
-    [A, s]
-  ), G = x(
-    (i, e, t, n = !1) => {
-      const r = M(i, e);
-      if (!r) return null;
-      const c = (u) => u.filter((l) => l.id !== e).map(
-        (l) => l.children ? { ...l, children: c(l.children) } : l
-      ).filter((l) => !(l.children && l.children.length === 0 && l.category === "group")), o = M(i, t), f = !r.children || r.children.length === 0, S = o?.children && o.children.length > 0, g = d[t] === !0, _ = f && S && !g, Y = (u) => {
-        for (let l = 0; l < u.length; l++) {
-          if (u[l].id === t)
+    [A, u]
+  ), G = S(
+    (t, e, o, r = !1) => {
+      const n = F(t, e);
+      if (!n) return null;
+      const l = (s) => s.filter((c) => c.id !== e).map(
+        (c) => c.children ? { ...c, children: l(c.children) } : c
+      ).filter((c) => !(c.children && c.children.length === 0 && c.category === "group")), i = F(t, o), f = !n.children || n.children.length === 0, R = i?.children && i.children.length > 0, M = d[o] === !0, _ = f && R && !M, g = (s) => {
+        for (let c = 0; c < s.length; c++) {
+          if (s[c].id === o)
             if (_) {
-              const P = {
-                ...u[l],
-                children: [r, ...u[l].children || []]
-              }, h = [...u];
-              return h[l] = P, { nodes: h, inserted: !0 };
+              const L = {
+                ...s[c],
+                children: [n, ...s[c].children || []]
+              }, a = [...s];
+              return a[c] = L, { nodes: a, inserted: !0 };
             } else {
-              const P = [...u], h = n ? l + 1 : l;
-              return P.splice(h, 0, r), { nodes: P, inserted: !0 };
+              const L = [...s], a = r ? c + 1 : c;
+              return L.splice(a, 0, n), { nodes: L, inserted: !0 };
             }
-          if (u[l].children) {
-            const P = Y(u[l].children);
-            if (P.inserted) {
-              const h = [...u];
-              return h[l] = { ...u[l], children: P.nodes }, { nodes: h, inserted: !0 };
+          if (s[c].children) {
+            const L = g(s[c].children);
+            if (L.inserted) {
+              const a = [...s];
+              return a[c] = { ...s[c], children: L.nodes }, { nodes: a, inserted: !0 };
             }
           }
         }
-        return { nodes: u, inserted: !1 };
-      }, L = c(i), { nodes: b, inserted: O } = Y(L);
-      return O ? (s?.(e, t), b) : null;
+        return { nodes: s, inserted: !1 };
+      }, P = l(t), { nodes: O, inserted: Y } = g(P);
+      return Y ? (u?.(e, o), O) : null;
     },
-    [s, d]
-  ), N = x(
-    (i, e, t) => {
-      const n = M(i, e);
-      if (!n) return i;
-      const r = (o) => o.filter((f) => f.id !== e).map(
-        (f) => f.children ? { ...f, children: r(f.children) } : f
-      ), c = i.map((o) => {
-        let f = o.children ? r(o.children) : [];
-        return o.id === t && (f = [n, ...f]), { ...o, children: f };
+    [u, d]
+  ), N = S(
+    (t, e, o) => {
+      const r = F(t, e);
+      if (!r) return t;
+      const n = (i) => i.filter((f) => f.id !== e).map(
+        (f) => f.children ? { ...f, children: n(f.children) } : f
+      ), l = t.map((i) => {
+        let f = i.children ? n(i.children) : [];
+        return i.id === o && (f = [r, ...f]), { ...i, children: f };
       });
-      return s?.(e, t), c;
+      return u?.(e, o), l;
     },
-    [s]
-  ), q = x(
-    (i, e) => {
-      const { active: t, over: n } = i;
-      !n || t.id === n.id || e((r) => {
-        const c = t.id, o = n.id, f = X(o);
+    [u]
+  ), J = S(
+    (t, e) => {
+      const { active: o, over: r } = t;
+      !r || o.id === r.id || e((n) => {
+        const l = o.id, i = r.id;
+        if (x) {
+          const P = F(n, l), O = C(n, l);
+          if (P && O !== null && !x(P, O))
+            return n;
+        }
+        const f = X(i);
         if (f)
-          return N(r, c, f);
-        const S = C(r, c), g = C(r, o), _ = T(r, c), Y = T(r, o);
-        if (y.has(o) && S !== null && S > 0)
-          return N(r, c, o);
-        if (S === 0 && g !== null && g > 0)
+          return N(n, l, f);
+        const R = C(n, l), M = C(n, i), _ = T(n, l), g = T(n, i);
+        if (y.has(i) && R !== null && R > 0)
+          return N(n, l, i);
+        if (R === 0 && M !== null && M > 0)
           return B(
-            r,
-            c,
-            o
-          ) || r;
-        if (S === null || g === null)
-          return r;
-        if (S > 0 && g > 0 && _ !== Y) {
-          const L = j(r, c), b = j(r, o);
-          if (L && b && L !== b) {
-            const h = t.rect.current.translated, F = n.rect;
+            n,
+            l,
+            i
+          ) || n;
+        if (R === null || M === null)
+          return n;
+        if (R > 0 && M > 0 && _ !== g) {
+          const P = j(n, l), O = j(n, i);
+          if (P && O && P !== O) {
+            const a = o.rect.current.translated, b = r.rect;
             let H = !1;
-            if (h && F) {
-              const J = h.top + h.height / 2, K = F.top + F.height / 2;
-              H = J > K;
+            if (a && b) {
+              const Q = a.top + a.height / 2, U = b.top + b.height / 2;
+              H = Q > U;
             }
-            return G(r, c, o, H) || r;
+            return G(n, l, i, H) || n;
           }
-          const O = t.rect.current.translated, u = n.rect;
-          let l = !1;
-          if (O && u) {
-            const h = O.top + O.height / 2, F = u.top + u.height / 2;
-            l = h > F;
+          const Y = o.rect.current.translated, s = r.rect;
+          let c = !1;
+          if (Y && s) {
+            const a = Y.top + Y.height / 2, b = s.top + s.height / 2;
+            c = a > b;
           }
-          return G(r, c, o, l) || r;
+          return G(n, l, i, c) || n;
         }
-        return S === 0 ? k(r, c, o) || r : z(r, c, o);
+        return R === 0 ? k(n, l, i) || n : z(n, l, i);
       });
     },
     [
@@ -215,26 +222,32 @@ const nn = ({
       k,
       z,
       G,
-      N
+      N,
+      x
     ]
-  ), D = x(
-    (i, e) => {
-      if (!i || !e || i === e)
+  ), K = S(
+    (t, e) => {
+      if (!t || !e || t === e)
         return !1;
-      const t = i ? C(a, i) : null, n = e ? C(a, e) : null;
-      return X(e) !== null || y.has(e) ? !0 : t === null || n === null ? !1 : t === 0 && n > 0 || t === n || t > 0 && n > 0;
+      if (x) {
+        const n = F(h, t), l = C(h, t);
+        if (n && l !== null && !x(n, l))
+          return !1;
+      }
+      const o = t ? C(h, t) : null, r = e ? C(h, e) : null;
+      return X(e) !== null || y.has(e) ? !0 : o === null || r === null ? !1 : o === 0 && r > 0 || o === r || o > 0 && r > 0;
     },
-    [a, C]
+    [h, C, x]
   );
   return {
-    sensors: R,
-    handleDragEnd: q,
-    isValidDrop: D,
+    sensors: q,
+    handleDragEnd: J,
+    isValidDrop: K,
     findItemLevel: C,
     findParentId: T
   };
 };
 export {
-  I as customCollisionDetection,
-  nn as useNestedListDragDrop
+  nn as customCollisionDetection,
+  rn as useNestedListDragDrop
 };