impact-nova 0.1.13 → 1.1.0

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

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