impact-nova 1.7.21 → 1.7.23

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

@@ -1,37 +1,37 @@
-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;
+import { useCallback as h } from "react";
+import { useSensors as W, useSensor as A, MouseSensor as X, TouchSensor as j, closestCorners as q } from "@dnd-kit/core";
+import { arrayMove as w } from "@dnd-kit/sortable";
+const B = "droppable-", O = /* @__PURE__ */ new Set(["root-frozen", "root-scrollable"]);
+function Y(f) {
+  if (f.startsWith(B)) {
+    const c = f.slice(B.length);
+    if (O.has(c)) return c;
   }
   return null;
 }
-const Q = (f) => {
-  const c = q(f), x = c.filter(
-    (s) => !L.has(s.id)
+const K = (f) => {
+  const c = q(f), a = c.filter(
+    (s) => !O.has(s.id)
   );
-  return x.length > 0 ? x : c;
+  return a.length > 0 ? a : 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);
+function F(f, c) {
+  for (const a of f) {
+    if (a.id === c) return a;
+    if (a.children) {
+      const s = F(a.children, c);
       if (s) return s;
     }
   }
 }
-const U = ({
+const Q = ({
   items: f,
   onDragEnd: c
 }) => {
-  const x = W(
-    F(X),
-    F(j)
-  ), s = a(
+  const a = W(
+    A(X),
+    A(j)
+  ), s = h(
     (t, r, o = 0) => {
       for (const n of t) {
         if (n.id === r) return o;
@@ -43,19 +43,19 @@ const U = ({
       return null;
     },
     []
-  ), h = a(
+  ), S = h(
     (t, r, o = null) => {
       for (const n of t) {
         if (n.id === r) return o;
         if (n.children) {
-          const e = h(n.children, r, n.id);
+          const e = S(n.children, r, n.id);
           if (e !== null) return e;
         }
       }
       return null;
     },
     []
-  ), T = a(
+  ), M = h(
     (t, r, o) => t.map((n) => {
       if (n.children && n.children.length > 0) {
         const e = n.children.findIndex(
@@ -64,7 +64,7 @@ const U = ({
           (l) => l.id === o
         );
         if (e !== -1 && i !== -1) {
-          const l = M(n.children, e, i);
+          const l = w(n.children, e, i);
           return {
             ...n,
             children: l
@@ -72,15 +72,15 @@ const U = ({
         }
         return {
           ...n,
-          children: T(n.children, r, o)
+          children: M(n.children, r, o)
         };
       }
       return n;
     }),
     []
-  ), N = a(
+  ), _ = h(
     (t, r, o) => {
-      const n = h(t, o);
+      const n = S(t, o);
       if (!n) return null;
       const e = t.findIndex(
         (l) => l.id === n
@@ -88,7 +88,7 @@ const U = ({
         (l) => l.id === r
       );
       if (e !== -1 && i !== -1) {
-        const l = M(
+        const l = w(
           t,
           i,
           e
@@ -97,122 +97,120 @@ const U = ({
       }
       return null;
     },
-    [h, c]
-  ), _ = a(
+    [S, c]
+  ), g = h(
     (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);
+        const i = w(t, n, e);
         return c?.(r, o), i;
       }
       return null;
     },
     [c]
-  ), y = a(
+  ), p = h(
     (t, r, o) => {
-      const n = T(t, r, o);
+      const n = M(t, r, o);
       return c?.(r, o), n;
     },
-    [T, c]
-  ), A = a(
+    [M, c]
+  ), y = h(
     (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 {
-            ...u,
-            children: u.children ? u.children.filter((d) => d.id !== r) : []
-          };
-        if (u.id === i) {
-          const d = u.children ? [...u.children] : [], C = d.findIndex(
-            (S) => S.id === o
-          );
-          if (C !== -1) {
-            const S = n ? C + 1 : C;
-            d.splice(S, 0, l);
-          } else
-            d.push(l);
-          return {
-            ...u,
-            children: d
-          };
+      const e = F(t, r);
+      if (!e) return null;
+      const i = (C) => C.filter((u) => u.id !== r).map(
+        (u) => u.children ? { ...u, children: i(u.children) } : u
+      ), l = (C) => {
+        const u = C.findIndex((d) => d.id === o);
+        if (u !== -1) {
+          const d = [...C], T = n ? u + 1 : u;
+          return d.splice(T, 0, e), { nodes: d, inserted: !0 };
         }
-        return u;
-      });
-      return c?.(r, o), P;
+        let P = !1;
+        return { nodes: C.map((d) => {
+          if (P || !d.children) return d;
+          const T = l(d.children);
+          return T.inserted ? (P = !0, { ...d, children: T.nodes }) : d;
+        }), inserted: P };
+      }, L = i(t), { nodes: x, inserted: R } = l(L);
+      return R ? (c?.(r, o), x) : null;
     },
-    [h, c]
-  ), O = a(
+    [c]
+  ), b = h(
     (t, r, o) => {
-      const n = b(t, r);
+      const n = F(t, r);
       if (!n) return t;
       const e = t.map((i) => {
-        let l = i.children ? i.children.filter((P) => P.id !== r) : [];
+        let l = i.children ? i.children.filter((L) => L.id !== r) : [];
         return i.id === o && (l = [n, ...l]), { ...i, children: l };
       });
       return c?.(r, o), e;
     },
     [c]
-  ), k = a(
+  ), k = h(
     (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(
+        const i = o.id, l = n.id, L = Y(l);
+        if (L)
+          return console.log("[NL-drop] route=section", { activeId: i, sectionId: L }), b(e, i, L);
+        const x = s(e, i), R = s(e, l), C = S(e, i), u = S(e, l);
+        if (console.log("[NL-drop] event", {
+          activeId: i,
+          overId: l,
+          activeLevel: x,
+          overLevel: R,
+          activeParentId: C,
+          overParentId: u
+        }), O.has(l) && x !== null && x > 0)
+          return b(e, i, l);
+        if (x === 0 && R !== null && R > 0)
+          return _(
             e,
             i,
             l
           ) || e;
-        if (u === null || d === null || u !== d)
+        if (x === null || R === null)
           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;
+        if (x > 0 && R > 0 && C !== u) {
+          const P = o.rect.current.translated, N = n.rect;
+          let d = !1;
+          if (P && N) {
+            const H = P.top + P.height / 2, V = N.top + N.height / 2;
+            d = H > V;
           }
-          return A(e, i, l, B) || e;
+          return y(e, i, l, d) || e;
         }
-        return u === 0 ? _(e, i, l) || e : y(e, i, l);
+        return x === 0 ? g(e, i, l) || e : p(e, i, l);
       });
     },
     [
       s,
-      h,
-      N,
+      S,
       _,
+      g,
+      p,
       y,
-      A,
-      O
+      b
     ]
-  ), z = a(
+  ), z = h(
     (t, r) => {
       if (!t || !r || t === r)
         return !1;
       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;
+      return Y(r) !== null || O.has(r) ? !0 : o === null || n === null ? !1 : o === 0 && n > 0 || o === n || o > 0 && n > 0;
     },
     [f, s]
   );
   return {
-    sensors: x,
+    sensors: a,
     handleDragEnd: k,
     isValidDrop: z,
     findItemLevel: s,
-    findParentId: h
+    findParentId: S
   };
 };
 export {
-  Q as customCollisionDetection,
-  U as useNestedListDragDrop
+  K as customCollisionDetection,
+  Q as useNestedListDragDrop
 };