@ynput/ayon-frontend-shared 0.3.44 → 0.3.46

package/dist/shared/src/containers/ProjectTreeTable/context/ClipboardContext.es.js

@@ -145,29 +145,29 @@ const bt = Et(void 0), ks = ({
     async (a, d) => {
       const { headers: l, fullRow: I } = d || {};
       try {
-        const $ = X.map((h) => h.id).filter((h) => h !== K), E = /* @__PURE__ */ new Map();
+        const S = X.map((h) => h.id).filter((h) => h !== K), v = /* @__PURE__ */ new Map();
         a.forEach((h) => {
           const e = q(h);
           if (!e) return;
-          const { rowId: u, colId: A } = e;
-          A === K || !$.includes(A) || (E.has(u) || E.set(u, /* @__PURE__ */ new Set()), E.get(u)?.add(A));
+          const { rowId: u, colId: $ } = e;
+          $ === K || !S.includes($) || (v.has(u) || v.set(u, /* @__PURE__ */ new Set()), v.get(u)?.add($));
         }), I && a.filter(
           (e) => q(e)?.rowId && q(e)?.colId === K
         ).map((e) => q(e)?.rowId).forEach((e) => {
-          E.has(e) || E.set(e, /* @__PURE__ */ new Set()), Array.from(b.colIdToIndex.keys()).forEach((A) => {
-            E.get(e)?.add(A);
+          v.has(e) || v.set(e, /* @__PURE__ */ new Set()), Array.from(b.colIdToIndex.keys()).forEach(($) => {
+            v.get(e)?.add($);
           });
         });
-        const m = Array.from(E.keys()).sort((h, e) => {
-          const u = b.rowIdToIndex.get(h) ?? 1 / 0, A = b.rowIdToIndex.get(e) ?? 1 / 0;
-          return u - A;
+        const m = Array.from(v.keys()).sort((h, e) => {
+          const u = b.rowIdToIndex.get(h) ?? 1 / 0, $ = b.rowIdToIndex.get(e) ?? 1 / 0;
+          return u - $;
         });
         let D = "";
         const et = m[0];
         if (!et) return "";
-        const ot = Array.from(E.get(et) || []).sort((h, e) => {
-          const u = b.colIdToIndex.get(h) ?? 1 / 0, A = b.colIdToIndex.get(e) ?? 1 / 0;
-          return u - A;
+        const ot = Array.from(v.get(et) || []).sort((h, e) => {
+          const u = b.colIdToIndex.get(h) ?? 1 / 0, $ = b.colIdToIndex.get(e) ?? 1 / 0;
+          return u - $;
         });
         if (l && ot.length > 0) {
           const h = [];
@@ -184,11 +184,11 @@ const bt = Et(void 0), ks = ({
             console.warn(`Entity not found for rowId: ${h}`);
             continue;
           }
-          const A = Array.from(E.get(h) || []).sort((c, w) => {
+          const $ = Array.from(v.get(h) || []).sort((c, w) => {
             const F = b.colIdToIndex.get(c) ?? 1 / 0, W = b.colIdToIndex.get(w) ?? 1 / 0;
             return F - W;
           }).filter((c) => c !== K), R = [];
-          for (const c of A) {
+          for (const c of $) {
             let w = "";
             if (c.startsWith("link_"))
               w = Nt(e.links, c);
@@ -201,17 +201,14 @@ const bt = Et(void 0), ks = ({
             } else {
               let k = lt(e, c);
               if (c === "folder" && typeof k != "string") {
-                const T = k || e.product?.folder, t = "parents" in e ? e.parents : void 0;
-                k = T?.label || T?.name || t?.[t.length - 1] || "";
+                const A = k || e.product?.folder, t = "parents" in e ? e.parents : void 0;
+                k = A?.label || A?.name || t?.[t.length - 1] || "";
               }
               if (!k) {
-                const T = Q.find((t) => t.name === c.replace("attrib_", ""));
-                T && T.data.type === "boolean" ? k = !1 : T && T.data.type.includes("list_of") && (k = []);
-              }
-              if (w = k != null ? String(k) : "", c === "name" && (w = jt(e.entityId || e.id, j) || e.label || e.name || ""), c === "subType") {
-                const T = e.subType;
-                typeof T == "string" && T ? w = T : ("folderType" in e && (w = e.folderType || ""), "taskType" in e && (w = e.taskType || ""));
+                const A = Q.find((t) => t.name === c.replace("attrib_", ""));
+                A && A.data.type === "boolean" ? k = !1 : A && A.data.type.includes("list_of") && (k = []);
               }
+              w = k != null ? String(k) : "", c === "name" && (w = jt(e.entityId || e.id, j)), c === "subType" && ("folderType" in e && (w = e.folderType || ""), "taskType" in e && (w = e.taskType || ""));
             }
             const F = w.replace(/"/g, '""'), W = c !== "subtasks" && (w.includes(`
 `) || w.includes("	") || w.includes('"'));
@@ -221,8 +218,8 @@ const bt = Et(void 0), ks = ({
 `;
         }
         return D;
-      } catch ($) {
-        console.error("Failed to copy to clipboard:", $);
+      } catch (S) {
+        console.error("Failed to copy to clipboard:", S);
       }
     },
     [B, It, b, j, H, X]
@@ -230,7 +227,7 @@ const bt = Et(void 0), ks = ({
     const a = await ft();
     if (!a) return !1;
     const d = yt(a);
-    return d.length === 0 ? !1 : d.every((l) => l.values.every((I) => I.split(",").every(($) => Rt($))));
+    return d.length === 0 ? !1 : d.every((l) => l.values.every((I) => I.split(",").every((S) => Rt(S))));
   }, Z = it(
     async (a, d) => {
       if (a = a || Array.from(B), !a.length) return;
@@ -258,10 +255,10 @@ const bt = Et(void 0), ks = ({
         try {
           const I = await at(a, { headers: !0, fullRow: l });
           if (!I) return;
-          const $ = new Blob([I], { type: "text/csv" }), E = URL.createObjectURL($), m = document.createElement("a");
-          m.href = E;
+          const S = new Blob([I], { type: "text/csv" }), v = URL.createObjectURL(S), m = document.createElement("a");
+          m.href = v;
           const D = a.length;
-          m.download = `${d}-export-${D}_cells-${(/* @__PURE__ */ new Date()).toISOString().slice(0, 10)}.csv`, m.click(), URL.revokeObjectURL(E);
+          m.download = `${d}-export-${D}_cells-${(/* @__PURE__ */ new Date()).toISOString().slice(0, 10)}.csv`, m.click(), URL.revokeObjectURL(v);
         } catch (I) {
           console.error("Failed to copy to clipboard:", I);
         }
@@ -289,8 +286,8 @@ const bt = Et(void 0), ks = ({
       if (!a.length) return;
       const I = await ft();
       if (!I) return;
-      let $ = !1, E = I;
-      Kt(I) && ($ = !0);
+      let S = !1, v = I;
+      Kt(I) && (S = !0);
       const m = yt(I);
       if (!m.length) return;
       const D = m.length === 1 && m[0].values.length === 1, et = X.map((t) => t.id).filter((t) => t !== K), ot = (t, o, s) => {
@@ -313,7 +310,7 @@ const bt = Et(void 0), ks = ({
       const u = Array.from(e.keys()).sort((t, o) => {
         const s = b.rowIdToIndex.get(t) ?? 1 / 0, f = b.rowIdToIndex.get(o) ?? 1 / 0;
         return s - f;
-      }), A = u[0], R = Array.from(e.get(A) || []).sort((t, o) => {
+      }), $ = u[0], R = Array.from(e.get($) || []).sort((t, o) => {
         const s = b.colIdToIndex.get(t) ?? 1 / 0, f = b.colIdToIndex.get(o) ?? 1 / 0;
         return s - f;
       });
@@ -341,56 +338,56 @@ const bt = Et(void 0), ks = ({
         if (o === "name") continue;
         if (o === "subtasks") {
           let r = [], g = !1;
-          if ($) {
-            const n = E.trim().split(`
+          if (S) {
+            const n = v.trim().split(`
 `), y = n[0].toLowerCase(), V = y.includes("label") && y.includes("name") && y.includes("start date") && y.includes("end date") && y.includes("assignees") && y.includes("status") ? n.slice(1) : n, P = /* @__PURE__ */ new Map(), O = [];
             V.forEach((N) => {
               const L = pt(N);
               if (L.length === 0) return;
-              const x = L[0], U = `${x.taskId || ""}|${x.taskName || ""}`;
-              P.has(U) || (P.set(U, []), O.push(U)), P.get(U).push(x);
+              const T = L[0], U = `${T.taskId || ""}|${T.taskName || ""}`;
+              P.has(U) || (P.set(U, []), O.push(U)), P.get(U).push(T);
             }), O.forEach((N) => {
-              const [L, x] = N.split("|");
+              const [L, T] = N.split("|");
               r.push({
                 taskId: L || void 0,
-                taskName: x || void 0,
+                taskName: T || void 0,
                 subtasks: P.get(N) || []
               });
             }), g = r.length <= 1;
           }
           for (let n = 0; n < u.length; n++) {
-            const y = u[n], v = ct(y, j)?.entityType;
-            if (v !== "task") continue;
-            const V = H(y), P = V?.entityId || y, O = `${y}-${v}`;
+            const y = u[n], C = ct(y, j)?.entityType;
+            if (C !== "task") continue;
+            const V = H(y), P = V?.entityId || y, O = `${y}-${C}`;
             c.has(O) || c.set(O, {
               rowId: y,
               id: P,
-              type: v,
+              type: C,
               fields: {},
               attrib: {},
               links: {}
             });
             const N = c.get(O), L = V && "subtasks" in V && V.subtasks || [];
             N.previousSubtasks = L;
-            let x = [];
-            if ($) {
+            let T = [];
+            if (S) {
               if (g && r.length > 0)
-                x = r[0].subtasks;
+                T = r[0].subtasks;
               else if (r.length > 0) {
                 const i = n % r.length;
-                x = r[i].subtasks;
+                T = r[i].subtasks;
               }
             } else if (D) {
               const i = m[0].values[0];
-              x = pt(i);
+              T = pt(i);
             } else {
-              const i = n % m.length, C = m[i], S = t % C.values.length, _ = C.values[S];
-              x = pt(_);
+              const i = n % m.length, x = m[i], E = t % x.values.length, _ = x.values[E];
+              T = pt(_);
             }
-            if (!x || x.length === 0) continue;
-            const U = x.map((i, C) => ({
+            if (!T || T.length === 0) continue;
+            const U = T.map((i, x) => ({
               id: Pt(),
-              name: Mt(i.name || i.label || `Subtask ${C + 1}`),
+              name: Mt(i.name || i.label || `Subtask ${x + 1}`),
               label: i.label || "",
               assignees: i.assignees || [],
               description: i.label || "",
@@ -399,25 +396,25 @@ const bt = Et(void 0), ks = ({
               isDone: i.isDone || !1
             }));
             if (l === "merge") {
-              const i = [...L], C = new Set(
-                L.map((S) => {
-                  const _ = (S.label || "").toLowerCase(), st = (S.name || "").toLowerCase();
+              const i = [...L], x = new Set(
+                L.map((E) => {
+                  const _ = (E.label || "").toLowerCase(), st = (E.name || "").toLowerCase();
                   return `${_}|${st}`;
                 })
               );
-              for (const S of U) {
-                const _ = (S.label || "").toLowerCase(), st = (S.name || "").toLowerCase(), rt = `${_}|${st}`;
-                C.has(rt) || i.push(S);
+              for (const E of U) {
+                const _ = (E.label || "").toLowerCase(), st = (E.name || "").toLowerCase(), rt = `${_}|${st}`;
+                x.has(rt) || i.push(E);
               }
               N.subtasks = i;
             } else {
-              const i = U.map((C) => {
-                const S = L.find(
-                  (_) => (_.label || "").toLowerCase() === (C.label || "").toLowerCase() && (_.name || "").toLowerCase() === (C.name || "").toLowerCase()
+              const i = U.map((x) => {
+                const E = L.find(
+                  (_) => (_.label || "").toLowerCase() === (x.label || "").toLowerCase() && (_.name || "").toLowerCase() === (x.name || "").toLowerCase()
                 );
                 return {
-                  ...C,
-                  id: S?.id || C.id
+                  ...x,
+                  id: E?.id || x.id
                 };
               });
               N.subtasks = i;
@@ -434,7 +431,7 @@ const bt = Et(void 0), ks = ({
             else if (o === "tags" || o === "assignees")
               p = "array";
             else if (s) {
-              const n = o.replace("attrib_", ""), y = Q.find((v) => v.name === n);
+              const n = o.replace("attrib_", ""), y = Q.find((C) => C.name === n);
               if (y)
                 switch (y.data.type) {
                   case "boolean":
@@ -457,31 +454,31 @@ const bt = Et(void 0), ks = ({
         }
         for (let r = 0; r < u.length; r++) {
           const g = u[r], n = ct(g, j)?.entityType, y = n === "folder";
-          let v;
+          let C;
           if (D)
-            v = m[0].values[0];
+            C = m[0].values[0];
           else {
             const U = r % m.length, i = m[U];
             if (i.values.length > R.length) {
-              const C = b.colIdToIndex.get(R[0]) ?? 0, S = Array.from(b.colIdToIndex.keys()).filter((G) => G !== K).sort((G, Tt) => {
+              const x = b.colIdToIndex.get(R[0]) ?? 0, E = Array.from(b.colIdToIndex.keys()).filter((G) => G !== K).sort((G, Tt) => {
                 const xt = b.colIdToIndex.get(G) ?? 1 / 0, Ct = b.colIdToIndex.get(Tt) ?? 1 / 0;
                 return xt - Ct;
-              }), _ = S.findIndex(
-                (G) => b.colIdToIndex.get(G) === C
-              ), rt = S.slice(
+              }), _ = E.findIndex(
+                (G) => b.colIdToIndex.get(G) === x
+              ), rt = E.slice(
                 _,
                 _ + i.values.length
               ).indexOf(o);
-              v = i.values[rt] || i.values[rt % i.values.length];
+              C = i.values[rt] || i.values[rt % i.values.length];
             } else {
-              const C = t % i.values.length;
-              v = i.values[C];
+              const x = t % i.values.length;
+              C = i.values[x];
             }
           }
           let V = o.split("_").pop() || o;
-          if (o === "subType" && (V = y ? "folderType" : "taskType", s = !1, !v))
+          if (o === "subType" && (V = y ? "folderType" : "taskType", s = !1, !C))
             continue;
-          const P = Bt(v, p), N = H(g)?.entityId || g, L = `${g}-${n}`;
+          const P = Bt(C, p), N = H(g)?.entityId || g, L = `${g}-${n}`;
           !c.has(L) && n && c.set(L, {
             rowId: g,
             id: N,
@@ -490,11 +487,11 @@ const bt = Et(void 0), ks = ({
             attrib: {},
             links: {}
           });
-          const x = c.get(L);
+          const T = c.get(L);
           if (f) {
-            const [U, i, C, S, _] = o.split("_");
-            x.links[`${i}|${C}|${S}_${_}`] = P;
-          } else s ? x.attrib[V] = P : x.fields[V] = P;
+            const [U, i, x, E, _] = o.split("_");
+            T.links[`${i}|${x}|${E}_${_}`] = P;
+          } else s ? T.attrib[V] = P : T.fields[V] = P;
         }
       }
       const w = [], F = /* @__PURE__ */ new Map();
@@ -519,12 +516,12 @@ const bt = Et(void 0), ks = ({
         }), Object.entries(t.links).forEach(([o, s]) => {
           const [f, p] = o.split("_"), r = f.split("|");
           if (r.length >= 3) {
-            const g = r[0], n = r[1], y = r[2], v = `${g}|${n}|${y}`, V = p === "out" ? y : n, P = `${t.id}-${v}-${p}`;
+            const g = r[0], n = r[1], y = r[2], C = `${g}|${n}|${y}`, V = p === "out" ? y : n, P = `${t.id}-${C}-${p}`;
             F.set(P, {
               rowId: t.rowId,
               sourceEntityId: t.id,
               sourceEntityType: t.type,
-              linkType: v,
+              linkType: C,
               direction: p,
               targetEntityType: V,
               operation: l,
@@ -541,8 +538,8 @@ const bt = Et(void 0), ks = ({
           previousSubtasks: t.previousSubtasks
         });
       });
-      const T = [];
-      if (w.length > 0 && T.push(mt(w)), W.length > 0 && T.push(ut(W)), k.length > 0) {
+      const A = [];
+      if (w.length > 0 && A.push(mt(w)), W.length > 0 && A.push(ut(W)), k.length > 0) {
         nt && k.forEach(({ taskId: o, subtasks: s, previousSubtasks: f }) => {
           const p = f || [], r = s || [], g = () => {
             Y({ projectName: J, taskId: o, subtasks: p }).unwrap().catch(() => {
@@ -556,11 +553,11 @@ const bt = Et(void 0), ks = ({
         const t = k.map(
           ({ taskId: o, subtasks: s }) => Y({ projectName: J, taskId: o, subtasks: s }).unwrap()
         );
-        T.push(...t);
+        A.push(...t);
       }
-      if (T.length > 0)
+      if (A.length > 0)
         try {
-          await Promise.all(T);
+          await Promise.all(A);
         } catch (t) {
           console.error("Error updating entities:", t), M(`Paste failed: ${t || t?.message || "Unknown error"}`);
         }
@@ -583,8 +580,8 @@ const bt = Et(void 0), ks = ({
   St(() => {
     const a = async (d) => {
       if ((d.ctrlKey || d.metaKey) && d.key === "c") {
-        const l = document.activeElement, I = l?.closest("table") !== null || l?.closest(".table-container") !== null || l?.tagName === "TD" || l?.tagName === "TH", $ = l?.tagName === "INPUT" || l?.tagName === "TEXTAREA" || l?.isContentEditable;
-        if ((window.getSelection()?.toString().length ?? !1) && !I || $ && !I)
+        const l = document.activeElement, I = l?.closest("table") !== null || l?.closest(".table-container") !== null || l?.tagName === "TD" || l?.tagName === "TH", S = l?.tagName === "INPUT" || l?.tagName === "TEXTAREA" || l?.isContentEditable;
+        if ((window.getSelection()?.toString().length ?? !1) && !I || S && !I)
           return;
         B.size > 0 && await Z();
       }