@ynput/ayon-frontend-shared 0.2.2 → 0.2.4

package/dist/shared/src/containers/ProjectTreeTable/hooks/useOverviewTable.cjs.js

@@ -1,32 +1,20 @@
 "use strict";
 const React = require("react");
 const loadingUtils = require("../utils/loadingUtils.cjs.js");
+const useGetEntityTypeData = require("./useGetEntityTypeData.cjs.js");
 const TASKS_INFINITE_QUERY_COUNT = 100;
 function useOverviewTable({
   foldersMap,
   tasksMap,
+  rows,
   tasksByFolderMap,
   expanded,
-  folderTypes = [],
-  taskTypes = [],
+  projectInfo,
   showHierarchy,
   loadingTasks = {},
   isLoadingMore = false
 }) {
-  const folderTypesByName = React.useMemo(() => {
-    const map = /* @__PURE__ */ new Map();
-    for (const folderType of folderTypes) {
-      map.set(folderType.name, folderType);
-    }
-    return map;
-  }, [folderTypes]);
-  const taskTypesByName = React.useMemo(() => {
-    const map = /* @__PURE__ */ new Map();
-    for (const taskType of taskTypes) {
-      map.set(taskType.name, taskType);
-    }
-    return map;
-  }, [taskTypes]);
+  const getEntityTypeData = useGetEntityTypeData({ projectInfo });
   const expandedKey = React.useMemo(() => JSON.stringify(expanded), [expanded]);
   const expandedFolderIds = React.useMemo(() => {
     return new Set(
@@ -37,7 +25,7 @@ function useOverviewTable({
     const childToParent = /* @__PURE__ */ new Map();
     const parentToChildren = /* @__PURE__ */ new Map();
     for (const folder of foldersMap.values()) {
-      if (!folder.id) continue;
+      if (!(folder == null ? void 0 : folder.id)) continue;
       const parentId = folder.parentId;
       if (parentId) {
         childToParent.set(folder.id, parentId);
@@ -55,7 +43,7 @@ function useOverviewTable({
     const visible = /* @__PURE__ */ new Set();
     const queue = [];
     for (const folder of foldersMap.values()) {
-      if (!folder.id) continue;
+      if (!(folder == null ? void 0 : folder.id)) continue;
       if (!folder.parentId || !foldersMap.has(folder.parentId)) {
         visible.add(folder.id);
         queue.push(folder.id);
@@ -80,15 +68,15 @@ function useOverviewTable({
   return React.useMemo(() => {
     var _a, _b, _c, _d, _e, _f, _g;
     const createTaskRow = (task, parentId) => {
-      var _a2, _b2;
+      const typeData = getEntityTypeData("task", task.taskType);
       return {
         id: task.id,
         entityType: "task",
         parentId: parentId || task.folderId,
         name: task.name || "",
         label: task.label || task.name || "",
-        icon: ((_a2 = taskTypesByName.get(task.taskType)) == null ? void 0 : _a2.icon) || null,
-        color: ((_b2 = taskTypesByName.get(task.taskType)) == null ? void 0 : _b2.color) || null,
+        icon: (typeData == null ? void 0 : typeData.icon) || null,
+        color: (typeData == null ? void 0 : typeData.color) || null,
         status: task.status,
         assignees: task.assignees,
         tags: task.tags,
@@ -97,17 +85,21 @@ function useOverviewTable({
         subType: task.taskType || null,
         attrib: task.attrib,
         ownAttrib: task.ownAttrib,
-        path: task.folder.path
+        path: task.folder.path,
+        updatedAt: task.updatedAt
       };
     };
     if (!showHierarchy) {
-      const flatTaskRows = [];
+      const flatRows = [];
       for (const task of tasksMap.values()) {
         if (!task.id) continue;
-        flatTaskRows.push(createTaskRow(task));
+        flatRows.push(createTaskRow(task));
       }
-      if (flatTaskRows.length > 1) {
-        flatTaskRows.sort((a, b) => {
+      for (const row of rows || []) {
+        flatRows.push(row);
+      }
+      if (flatRows.length > 1) {
+        flatRows.sort((a, b) => {
           if (a.name < b.name) return -1;
           if (a.name > b.name) return 1;
           return 0;
@@ -123,10 +115,10 @@ function useOverviewTable({
           const loadingTaskRows = loadingUtils.generateLoadingRows(loadingAttribs, count, {
             type: "task"
           });
-          flatTaskRows.push(...loadingTaskRows);
+          flatRows.push(...loadingTaskRows);
         }
       }
-      return flatTaskRows;
+      return flatRows;
     }
     const rowsById = /* @__PURE__ */ new Map();
     const rootRows = [];
@@ -139,7 +131,7 @@ function useOverviewTable({
         parentId: folder.parentId || void 0,
         name: folder.name || "",
         label: folder.label || folder.name || "",
-        icon: ((_d = folderTypesByName.get(folder.folderType)) == null ? void 0 : _d.icon) || null,
+        icon: ((_d = getEntityTypeData("folder", folder.folderType)) == null ? void 0 : _d.icon) || null,
         color: null,
         img: null,
         subRows: [],
@@ -149,7 +141,8 @@ function useOverviewTable({
         ownAttrib: folder.ownAttrib || [],
         path: folder.path,
         attrib: folder.attrib || {},
-        childOnlyMatch: folder.childOnlyMatch || false
+        childOnlyMatch: folder.childOnlyMatch || false,
+        updatedAt: folder.updatedAt
       };
       rowsById.set(folderId, row);
       if (!folder.parentId || !foldersMap.has(folder.parentId)) {
@@ -211,6 +204,9 @@ function useOverviewTable({
         });
       }
     }
+    for (const row of rows || []) {
+      rootRows.push(row);
+    }
     if (rootRows.length > 1) {
       rootRows.sort((a, b) => {
         if (a.name < b.name) return -1;
@@ -222,11 +218,11 @@ function useOverviewTable({
   }, [
     foldersMap,
     tasksMap,
+    rows,
     visibleFolders,
     childToParentMap,
     expandedFolderIds,
     showHierarchy,
-    taskTypesByName,
     loadingTasks,
     isLoadingMore
   ]);

package/dist/shared/src/containers/ProjectTreeTable/hooks/useOverviewTable.cjs.js.map

@@ -1 +1 @@
-{"version":3,"file":"useOverviewTable.cjs.js","sources":["../../../../../../src/containers/ProjectTreeTable/hooks/useOverviewTable.ts"],"sourcesContent":["import { useMemo } from 'react'\nimport {\n  EditorTaskNode,\n  FolderNodeMap,\n  TableRow,\n  TaskNodeMap,\n  TasksByFolderMap,\n} from '../types/table'\nimport { ExpandedState } from '@tanstack/react-table'\nimport { generateLoadingRows } from '../utils/loadingUtils'\nconst TASKS_INFINITE_QUERY_COUNT = 100\nimport { LoadingTasks } from '../types'\nimport { FolderType, TaskType } from '../types/project'\n\ntype Params = {\n  foldersMap: FolderNodeMap\n  tasksMap: TaskNodeMap\n  tasksByFolderMap: TasksByFolderMap\n  expanded: ExpandedState\n  folderTypes?: FolderType[]\n  taskTypes?: TaskType[]\n  showHierarchy: boolean\n  loadingTasks: LoadingTasks\n  isLoadingMore?: boolean\n}\n\n/**\n * React hook that creates a hierarchical tree structure from folders and tasks for use with TanStack Table\n * Uses memoization to avoid unnecessary recalculations on re-render\n *\n * @param foldersMap - Map of folders organized by folder ID\n * @param tasksMap - Map of tasks organized by task ID\n * @param tasksByFolderMap - Map of tasks organized by folder ID\n * @param expanded - Object with folder IDs as keys to indicate expanded folders\n * @param folderTypes - Array of folder types for to add things like folder icon\n * @param taskTypes - Array of task types for to add things like task icon\n * @param showHierarchy - Boolean to indicate if the hierarchy should be shown\n * @param loadingTasks - Object with folder IDs as keys to indicate loading tasks\n * @param isLoadingMore - Boolean to indicate if more tasks are being loaded\n * @returns An array of TableRow objects with nested subRows suitable for TanStack Table\n */\nexport default function useOverviewTable({\n  foldersMap,\n  tasksMap,\n  tasksByFolderMap,\n  expanded,\n  folderTypes = [],\n  taskTypes = [],\n  showHierarchy,\n  loadingTasks = {},\n  isLoadingMore = false,\n}: Params): TableRow[] {\n  // create a map of folder types by name for efficient lookups\n  const folderTypesByName = useMemo(() => {\n    const map: Map<string, FolderType> = new Map()\n    for (const folderType of folderTypes) {\n      map.set(folderType.name, folderType)\n    }\n    return map\n  }, [folderTypes])\n\n  // create a map of task types by name for efficient lookups\n  const taskTypesByName = useMemo(() => {\n    const map: Map<string, TaskType> = new Map()\n    for (const taskType of taskTypes) {\n      map.set(taskType.name, taskType)\n    }\n    return map\n  }, [taskTypes])\n\n  // Convert expanded object to a stable string for memoization comparison\n  const expandedKey = useMemo(() => JSON.stringify(expanded), [expanded])\n\n  // Memoize expandedFolderIds set for efficient lookups\n  const expandedFolderIds = useMemo(() => {\n    return new Set(\n      Object.entries(expanded)\n        .filter(([_, isExpanded]) => isExpanded)\n        .map(([id]) => id),\n    )\n  }, [expandedKey])\n\n  // Memoize relationship maps to avoid rebuilding them on every render\n  const { childToParentMap, parentToChildrenMap } = useMemo(() => {\n    const childToParent = new Map<string, string>()\n    const parentToChildren = new Map<string, Set<string>>()\n\n    // Construct relationship maps in a single pass\n    for (const folder of foldersMap.values()) {\n      if (!folder.id) continue\n\n      const parentId = folder.parentId\n      if (parentId) {\n        childToParent.set(folder.id, parentId)\n\n        let children = parentToChildren.get(parentId)\n        if (!children) {\n          children = new Set<string>()\n          parentToChildren.set(parentId, children)\n        }\n        children.add(folder.id)\n      }\n    }\n\n    return { childToParentMap: childToParent, parentToChildrenMap: parentToChildren }\n  }, [foldersMap])\n\n  // Memoize visible folders calculation\n  const visibleFolders = useMemo(() => {\n    const visible = new Set<string>()\n\n    // Start with root folders and folders with non-existent parents\n    const queue: string[] = []\n    for (const folder of foldersMap.values()) {\n      if (!folder.id) continue\n\n      // Include folders with no parent OR with a parent that doesn't exist\n      if (!folder.parentId || !foldersMap.has(folder.parentId)) {\n        visible.add(folder.id)\n        queue.push(folder.id)\n      }\n    }\n\n    // Process queue to identify visible folders (BFS)\n    while (queue.length > 0) {\n      const folderId = queue.shift()!\n      const isParentExpanded = expandedFolderIds.has(folderId)\n\n      if (!isParentExpanded) continue\n\n      // Add children of expanded folders to visible set\n      const childrenIds = parentToChildrenMap.get(folderId)\n      if (childrenIds) {\n        for (const childId of childrenIds) {\n          if (!visible.has(childId)) {\n            visible.add(childId)\n            queue.push(childId)\n          }\n        }\n      }\n    }\n\n    return visible\n  }, [foldersMap, parentToChildrenMap, expandedFolderIds])\n\n  // Final memoized result - build the table tree\n  return useMemo(() => {\n    // Helper function to create a task row\n    const createTaskRow = (task: EditorTaskNode, parentId?: string): TableRow => {\n      return {\n        id: task.id,\n        entityType: 'task',\n        parentId: parentId || task.folderId,\n        name: task.name || '',\n        label: task.label || task.name || '',\n        icon: taskTypesByName.get(task.taskType)?.icon || null,\n        color: taskTypesByName.get(task.taskType)?.color || null,\n        status: task.status,\n        assignees: task.assignees,\n        tags: task.tags,\n        img: null,\n        subRows: [],\n        subType: task.taskType || null,\n        attrib: task.attrib,\n        ownAttrib: task.ownAttrib,\n        path: task.folder.path,\n      }\n    }\n\n    // If showHierarchy is false, create a flat list of task rows\n    if (!showHierarchy) {\n      const flatTaskRows: TableRow[] = []\n\n      // Loop through all tasks\n      for (const task of tasksMap.values()) {\n        if (!task.id) continue\n        flatTaskRows.push(createTaskRow(task))\n      }\n\n      // Sort all tasks by name\n      if (flatTaskRows.length > 1) {\n        flatTaskRows.sort((a, b) => {\n          if (a.name < b.name) return -1\n          if (a.name > b.name) return 1\n          return 0\n        })\n      }\n\n      // if we are loading more tasks, add loading rows\n      if (isLoadingMore) {\n        const firstTaskAttrib = tasksMap.entries().next()?.value?.[1]?.attrib || {}\n        const loadingAttribs = Object.keys(firstTaskAttrib).map((key) => ({\n          name: key,\n        }))\n        // number of tasks we loading with the infinite query\n        const count = TASKS_INFINITE_QUERY_COUNT\n        if (count > 0) {\n          const loadingTaskRows = generateLoadingRows(loadingAttribs, count, {\n            type: 'task',\n          })\n\n          flatTaskRows.push(...loadingTaskRows)\n        }\n      }\n\n      return flatTaskRows\n    }\n\n    // Use Map for O(1) lookups\n    const rowsById = new Map<string, TableRow>()\n    const rootRows: TableRow[] = []\n\n    // Create minimal rows for only visible folders\n    for (const folderId of visibleFolders) {\n      const folder = foldersMap.get(folderId)\n      if (!folder) continue\n\n      // Create row with minimal required properties\n      const row: TableRow = {\n        id: folderId,\n        entityType: 'folder',\n        parentId: folder.parentId || undefined,\n        name: folder.name || '',\n        label: folder.label || folder.name || '',\n        icon: folderTypesByName.get(folder.folderType)?.icon || null,\n        color: null,\n        img: null,\n        subRows: [],\n        status: folder.status,\n        tags: folder.tags || [],\n        subType: folder.folderType || null,\n        ownAttrib: folder.ownAttrib || [],\n        path: folder.path,\n        attrib: folder.attrib || {},\n        childOnlyMatch: folder.childOnlyMatch || false,\n      }\n\n      rowsById.set(folderId, row)\n\n      // Add root rows directly to the rootRows array\n      if (!folder.parentId || !foldersMap.has(folder.parentId)) {\n        rootRows.push(row)\n      }\n\n      // Process tasks immediately if folder is expanded\n      if (expandedFolderIds.has(folderId)) {\n        // because tasksByFolderMap is a map of tasks by folder ID\n        // we can directly get the tasks for the current folder\n        const folderTaskIds = tasksByFolderMap.get(folderId) || []\n        const folderTasks = folderTaskIds.flatMap((taskId) => tasksMap.get(taskId) || [])\n\n        if (folderTasks.length || loadingTasks[folderId]) {\n          // Use array literal with known length for better performance\n          const taskRows = new Array<TableRow>(folderTasks.length)\n\n          // Direct array assignment is faster than push operations\n          for (let i = 0; i < folderTasks.length; i++) {\n            taskRows[i] = createTaskRow(folderTasks[i], folderId)\n          }\n\n          // Add loading rows if applicable\n          if (loadingTasks[folderId]) {\n            const firstTaskAttrib = tasksMap.entries().next()?.value?.[1]?.attrib || {}\n            const loadingAttribs = Object.keys(firstTaskAttrib).map((key) => ({\n              name: key,\n            }))\n            const count = loadingTasks[folderId]\n            if (count > 0) {\n              const loadingTaskRows = generateLoadingRows(loadingAttribs, count, {\n                type: 'task',\n                parentId: folderId,\n              })\n\n              taskRows.push(...loadingTaskRows)\n            }\n          }\n          // Only sort if we have multiple items\n          if (taskRows.length > 1) {\n            // Use a more efficient string comparison for sorting\n            taskRows.sort((a, b) => {\n              if (a.name < b.name) return -1\n              if (a.name > b.name) return 1\n              return 0\n            })\n          }\n\n          row.subRows = taskRows\n        }\n      }\n    }\n\n    // Build the folder hierarchy efficiently\n    for (const folderId of visibleFolders) {\n      const parentId = childToParentMap.get(folderId)\n      if (!parentId || !expandedFolderIds.has(parentId)) continue\n\n      const childRow = rowsById.get(folderId)\n      const parentRow = rowsById.get(parentId)\n\n      if (!childRow || !parentRow) continue\n\n      // Add folder to its parent's subRows\n      parentRow.subRows.push(childRow)\n    }\n\n    // Sort subRows for expanded folders in a single pass\n    for (const folderId of expandedFolderIds) {\n      const row = rowsById.get(folderId)\n      if (!row || row.subRows.length <= 1) continue\n\n      // Process only folders that have both task rows and folder children\n      const hasTasksAndFolders =\n        row.subRows.some((r) => r.entityType === 'task') &&\n        row.subRows.some((r) => r.entityType === 'folder')\n\n      if (hasTasksAndFolders) {\n        // More efficient sort using type as primary key to reduce comparisons\n        row.subRows.sort((a, b) => {\n          // Type first (tasks before folders)\n          const typeA = a.entityType === 'task' ? 0 : 1\n          const typeB = b.entityType === 'task' ? 0 : 1\n\n          if (typeA !== typeB) return typeA - typeB\n\n          // Then by name using more efficient string comparison\n          if (a.name < b.name) return -1\n          if (a.name > b.name) return 1\n          return 0\n        })\n      }\n    }\n\n    // Sort root rows\n    if (rootRows.length > 1) {\n      rootRows.sort((a, b) => {\n        if (a.name < b.name) return -1\n        if (a.name > b.name) return 1\n        return 0\n      })\n    }\n\n    return rootRows\n  }, [\n    foldersMap,\n    tasksMap,\n    visibleFolders,\n    childToParentMap,\n    expandedFolderIds,\n    showHierarchy,\n    taskTypesByName,\n    loadingTasks,\n    isLoadingMore,\n  ])\n}\n"],"names":["useMemo","_a","_b","generateLoadingRows"],"mappings":";;;AAUA,MAAM,6BAA6B;AA+BnC,SAAwB,iBAAiB;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,cAAc,CAAC;AAAA,EACf,YAAY,CAAC;AAAA,EACb;AAAA,EACA,eAAe,CAAC;AAAA,EAChB,gBAAgB;AAClB,GAAuB;AAEf,QAAA,oBAAoBA,MAAAA,QAAQ,MAAM;AAChC,UAAA,0BAAmC,IAAI;AAC7C,eAAW,cAAc,aAAa;AAChC,UAAA,IAAI,WAAW,MAAM,UAAU;AAAA,IAAA;AAE9B,WAAA;AAAA,EAAA,GACN,CAAC,WAAW,CAAC;AAGV,QAAA,kBAAkBA,MAAAA,QAAQ,MAAM;AAC9B,UAAA,0BAAiC,IAAI;AAC3C,eAAW,YAAY,WAAW;AAC5B,UAAA,IAAI,SAAS,MAAM,QAAQ;AAAA,IAAA;AAE1B,WAAA;AAAA,EAAA,GACN,CAAC,SAAS,CAAC;AAGR,QAAA,cAAcA,cAAQ,MAAM,KAAK,UAAU,QAAQ,GAAG,CAAC,QAAQ,CAAC;AAGhE,QAAA,oBAAoBA,MAAAA,QAAQ,MAAM;AACtC,WAAO,IAAI;AAAA,MACT,OAAO,QAAQ,QAAQ,EACpB,OAAO,CAAC,CAAC,GAAG,UAAU,MAAM,UAAU,EACtC,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE;AAAA,IACrB;AAAA,EAAA,GACC,CAAC,WAAW,CAAC;AAGhB,QAAM,EAAE,kBAAkB,oBAAoB,IAAIA,cAAQ,MAAM;AACxD,UAAA,oCAAoB,IAAoB;AACxC,UAAA,uCAAuB,IAAyB;AAG3C,eAAA,UAAU,WAAW,UAAU;AACpC,UAAA,CAAC,OAAO,GAAI;AAEhB,YAAM,WAAW,OAAO;AACxB,UAAI,UAAU;AACE,sBAAA,IAAI,OAAO,IAAI,QAAQ;AAEjC,YAAA,WAAW,iBAAiB,IAAI,QAAQ;AAC5C,YAAI,CAAC,UAAU;AACb,yCAAe,IAAY;AACV,2BAAA,IAAI,UAAU,QAAQ;AAAA,QAAA;AAEhC,iBAAA,IAAI,OAAO,EAAE;AAAA,MAAA;AAAA,IACxB;AAGF,WAAO,EAAE,kBAAkB,eAAe,qBAAqB,iBAAiB;AAAA,EAAA,GAC/E,CAAC,UAAU,CAAC;AAGT,QAAA,iBAAiBA,MAAAA,QAAQ,MAAM;AAC7B,UAAA,8BAAc,IAAY;AAGhC,UAAM,QAAkB,CAAC;AACd,eAAA,UAAU,WAAW,UAAU;AACpC,UAAA,CAAC,OAAO,GAAI;AAGZ,UAAA,CAAC,OAAO,YAAY,CAAC,WAAW,IAAI,OAAO,QAAQ,GAAG;AAChD,gBAAA,IAAI,OAAO,EAAE;AACf,cAAA,KAAK,OAAO,EAAE;AAAA,MAAA;AAAA,IACtB;AAIK,WAAA,MAAM,SAAS,GAAG;AACjB,YAAA,WAAW,MAAM,MAAM;AACvB,YAAA,mBAAmB,kBAAkB,IAAI,QAAQ;AAEvD,UAAI,CAAC,iBAAkB;AAGjB,YAAA,cAAc,oBAAoB,IAAI,QAAQ;AACpD,UAAI,aAAa;AACf,mBAAW,WAAW,aAAa;AACjC,cAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,oBAAQ,IAAI,OAAO;AACnB,kBAAM,KAAK,OAAO;AAAA,UAAA;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAGK,WAAA;AAAA,EACN,GAAA,CAAC,YAAY,qBAAqB,iBAAiB,CAAC;AAGvD,SAAOA,cAAQ,MAAM;;AAEb,UAAA,gBAAgB,CAAC,MAAsB,aAAgC;;AACpE,aAAA;AAAA,QACL,IAAI,KAAK;AAAA,QACT,YAAY;AAAA,QACZ,UAAU,YAAY,KAAK;AAAA,QAC3B,MAAM,KAAK,QAAQ;AAAA,QACnB,OAAO,KAAK,SAAS,KAAK,QAAQ;AAAA,QAClC,QAAMC,MAAA,gBAAgB,IAAI,KAAK,QAAQ,MAAjC,gBAAAA,IAAoC,SAAQ;AAAA,QAClD,SAAOC,MAAA,gBAAgB,IAAI,KAAK,QAAQ,MAAjC,gBAAAA,IAAoC,UAAS;AAAA,QACpD,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,MAAM,KAAK;AAAA,QACX,KAAK;AAAA,QACL,SAAS,CAAC;AAAA,QACV,SAAS,KAAK,YAAY;AAAA,QAC1B,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,MAAM,KAAK,OAAO;AAAA,MACpB;AAAA,IACF;AAGA,QAAI,CAAC,eAAe;AAClB,YAAM,eAA2B,CAAC;AAGvB,iBAAA,QAAQ,SAAS,UAAU;AAChC,YAAA,CAAC,KAAK,GAAI;AACD,qBAAA,KAAK,cAAc,IAAI,CAAC;AAAA,MAAA;AAInC,UAAA,aAAa,SAAS,GAAG;AACd,qBAAA,KAAK,CAAC,GAAG,MAAM;AAC1B,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,iBAAA;AAAA,QAAA,CACR;AAAA,MAAA;AAIH,UAAI,eAAe;AACX,cAAA,oBAAkB,0BAAS,UAAU,WAAnB,mBAA2B,UAA3B,mBAAmC,OAAnC,mBAAuC,WAAU,CAAC;AAC1E,cAAM,iBAAiB,OAAO,KAAK,eAAe,EAAE,IAAI,CAAC,SAAS;AAAA,UAChE,MAAM;AAAA,QAAA,EACN;AAEF,cAAM,QAAQ;AACC;AACP,gBAAA,kBAAkBC,aAAAA,oBAAoB,gBAAgB,OAAO;AAAA,YACjE,MAAM;AAAA,UAAA,CACP;AAEY,uBAAA,KAAK,GAAG,eAAe;AAAA,QAAA;AAAA,MACtC;AAGK,aAAA;AAAA,IAAA;AAIH,UAAA,+BAAe,IAAsB;AAC3C,UAAM,WAAuB,CAAC;AAG9B,eAAW,YAAY,gBAAgB;AAC/B,YAAA,SAAS,WAAW,IAAI,QAAQ;AACtC,UAAI,CAAC,OAAQ;AAGb,YAAM,MAAgB;AAAA,QACpB,IAAI;AAAA,QACJ,YAAY;AAAA,QACZ,UAAU,OAAO,YAAY;AAAA,QAC7B,MAAM,OAAO,QAAQ;AAAA,QACrB,OAAO,OAAO,SAAS,OAAO,QAAQ;AAAA,QACtC,QAAM,uBAAkB,IAAI,OAAO,UAAU,MAAvC,mBAA0C,SAAQ;AAAA,QACxD,OAAO;AAAA,QACP,KAAK;AAAA,QACL,SAAS,CAAC;AAAA,QACV,QAAQ,OAAO;AAAA,QACf,MAAM,OAAO,QAAQ,CAAC;AAAA,QACtB,SAAS,OAAO,cAAc;AAAA,QAC9B,WAAW,OAAO,aAAa,CAAC;AAAA,QAChC,MAAM,OAAO;AAAA,QACb,QAAQ,OAAO,UAAU,CAAC;AAAA,QAC1B,gBAAgB,OAAO,kBAAkB;AAAA,MAC3C;AAES,eAAA,IAAI,UAAU,GAAG;AAGtB,UAAA,CAAC,OAAO,YAAY,CAAC,WAAW,IAAI,OAAO,QAAQ,GAAG;AACxD,iBAAS,KAAK,GAAG;AAAA,MAAA;AAIf,UAAA,kBAAkB,IAAI,QAAQ,GAAG;AAGnC,cAAM,gBAAgB,iBAAiB,IAAI,QAAQ,KAAK,CAAC;AACnD,cAAA,cAAc,cAAc,QAAQ,CAAC,WAAW,SAAS,IAAI,MAAM,KAAK,EAAE;AAEhF,YAAI,YAAY,UAAU,aAAa,QAAQ,GAAG;AAEhD,gBAAM,WAAW,IAAI,MAAgB,YAAY,MAAM;AAGvD,mBAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,qBAAS,CAAC,IAAI,cAAc,YAAY,CAAC,GAAG,QAAQ;AAAA,UAAA;AAIlD,cAAA,aAAa,QAAQ,GAAG;AACpB,kBAAA,oBAAkB,0BAAS,UAAU,WAAnB,mBAA2B,UAA3B,mBAAmC,OAAnC,mBAAuC,WAAU,CAAC;AAC1E,kBAAM,iBAAiB,OAAO,KAAK,eAAe,EAAE,IAAI,CAAC,SAAS;AAAA,cAChE,MAAM;AAAA,YAAA,EACN;AACI,kBAAA,QAAQ,aAAa,QAAQ;AACnC,gBAAI,QAAQ,GAAG;AACP,oBAAA,kBAAkBA,aAAAA,oBAAoB,gBAAgB,OAAO;AAAA,gBACjE,MAAM;AAAA,gBACN,UAAU;AAAA,cAAA,CACX;AAEQ,uBAAA,KAAK,GAAG,eAAe;AAAA,YAAA;AAAA,UAClC;AAGE,cAAA,SAAS,SAAS,GAAG;AAEd,qBAAA,KAAK,CAAC,GAAG,MAAM;AACtB,kBAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,kBAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,qBAAA;AAAA,YAAA,CACR;AAAA,UAAA;AAGH,cAAI,UAAU;AAAA,QAAA;AAAA,MAChB;AAAA,IACF;AAIF,eAAW,YAAY,gBAAgB;AAC/B,YAAA,WAAW,iBAAiB,IAAI,QAAQ;AAC9C,UAAI,CAAC,YAAY,CAAC,kBAAkB,IAAI,QAAQ,EAAG;AAE7C,YAAA,WAAW,SAAS,IAAI,QAAQ;AAChC,YAAA,YAAY,SAAS,IAAI,QAAQ;AAEnC,UAAA,CAAC,YAAY,CAAC,UAAW;AAGnB,gBAAA,QAAQ,KAAK,QAAQ;AAAA,IAAA;AAIjC,eAAW,YAAY,mBAAmB;AAClC,YAAA,MAAM,SAAS,IAAI,QAAQ;AACjC,UAAI,CAAC,OAAO,IAAI,QAAQ,UAAU,EAAG;AAGrC,YAAM,qBACJ,IAAI,QAAQ,KAAK,CAAC,MAAM,EAAE,eAAe,MAAM,KAC/C,IAAI,QAAQ,KAAK,CAAC,MAAM,EAAE,eAAe,QAAQ;AAEnD,UAAI,oBAAoB;AAEtB,YAAI,QAAQ,KAAK,CAAC,GAAG,MAAM;AAEzB,gBAAM,QAAQ,EAAE,eAAe,SAAS,IAAI;AAC5C,gBAAM,QAAQ,EAAE,eAAe,SAAS,IAAI;AAExC,cAAA,UAAU,MAAO,QAAO,QAAQ;AAGpC,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,iBAAA;AAAA,QAAA,CACR;AAAA,MAAA;AAAA,IACH;AAIE,QAAA,SAAS,SAAS,GAAG;AACd,eAAA,KAAK,CAAC,GAAG,MAAM;AACtB,YAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,YAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,eAAA;AAAA,MAAA,CACR;AAAA,IAAA;AAGI,WAAA;AAAA,EAAA,GACN;AAAA,IACD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA,CACD;AACH;;"}
+{"version":3,"file":"useOverviewTable.cjs.js","sources":["../../../../../../src/containers/ProjectTreeTable/hooks/useOverviewTable.ts"],"sourcesContent":["import { useMemo } from 'react'\nimport {\n  EditorTaskNode,\n  FolderNodeMap,\n  TableRow,\n  TaskNodeMap,\n  TasksByFolderMap,\n} from '../types/table'\nimport { ExpandedState } from '@tanstack/react-table'\nimport { generateLoadingRows } from '../utils/loadingUtils'\nconst TASKS_INFINITE_QUERY_COUNT = 100\nimport { LoadingTasks } from '../types'\nimport { ProjectModel } from '../types/project'\nimport useGetEntityTypeData from './useGetEntityTypeData'\n\ntype Params = {\n  foldersMap: FolderNodeMap\n  tasksMap: TaskNodeMap\n  tasksByFolderMap: TasksByFolderMap\n  rows?: TableRow[]\n  expanded: ExpandedState\n  projectInfo?: ProjectModel\n  showHierarchy: boolean\n  loadingTasks?: LoadingTasks\n  isLoadingMore?: boolean\n}\n\nexport default function useOverviewTable({\n  foldersMap,\n  tasksMap,\n  rows,\n  tasksByFolderMap,\n  expanded,\n  projectInfo,\n  showHierarchy,\n  loadingTasks = {},\n  isLoadingMore = false,\n}: Params): TableRow[] {\n  const getEntityTypeData = useGetEntityTypeData({ projectInfo })\n\n  // Convert expanded object to a stable string for memoization comparison\n  const expandedKey = useMemo(() => JSON.stringify(expanded), [expanded])\n\n  // Memoize expandedFolderIds set for efficient lookups\n  const expandedFolderIds = useMemo(() => {\n    return new Set(\n      Object.entries(expanded)\n        .filter(([_, isExpanded]) => isExpanded)\n        .map(([id]) => id),\n    )\n  }, [expandedKey])\n\n  // Memoize relationship maps to avoid rebuilding them on every render\n  const { childToParentMap, parentToChildrenMap } = useMemo(() => {\n    const childToParent = new Map<string, string>()\n    const parentToChildren = new Map<string, Set<string>>()\n\n    // Construct relationship maps in a single pass\n    for (const folder of foldersMap.values()) {\n      if (!folder?.id) continue\n\n      const parentId = folder.parentId\n      if (parentId) {\n        childToParent.set(folder.id, parentId)\n\n        let children = parentToChildren.get(parentId)\n        if (!children) {\n          children = new Set<string>()\n          parentToChildren.set(parentId, children)\n        }\n        children.add(folder.id)\n      }\n    }\n\n    return { childToParentMap: childToParent, parentToChildrenMap: parentToChildren }\n  }, [foldersMap])\n\n  // Memoize visible folders calculation\n  const visibleFolders = useMemo(() => {\n    const visible = new Set<string>()\n\n    // Start with root folders and folders with non-existent parents\n    const queue: string[] = []\n    for (const folder of foldersMap.values()) {\n      if (!folder?.id) continue\n\n      // Include folders with no parent OR with a parent that doesn't exist\n      if (!folder.parentId || !foldersMap.has(folder.parentId)) {\n        visible.add(folder.id)\n        queue.push(folder.id)\n      }\n    }\n\n    // Process queue to identify visible folders (BFS)\n    while (queue.length > 0) {\n      const folderId = queue.shift()!\n      const isParentExpanded = expandedFolderIds.has(folderId)\n\n      if (!isParentExpanded) continue\n\n      // Add children of expanded folders to visible set\n      const childrenIds = parentToChildrenMap.get(folderId)\n      if (childrenIds) {\n        for (const childId of childrenIds) {\n          if (!visible.has(childId)) {\n            visible.add(childId)\n            queue.push(childId)\n          }\n        }\n      }\n    }\n\n    return visible\n  }, [foldersMap, parentToChildrenMap, expandedFolderIds])\n\n  // Final memoized result - build the table tree\n  return useMemo(() => {\n    // Helper function to create a task row\n    const createTaskRow = (task: EditorTaskNode, parentId?: string): TableRow => {\n      const typeData = getEntityTypeData('task', task.taskType)\n      return {\n        id: task.id,\n        entityType: 'task',\n        parentId: parentId || task.folderId,\n        name: task.name || '',\n        label: task.label || task.name || '',\n        icon: typeData?.icon || null,\n        color: typeData?.color || null,\n        status: task.status,\n        assignees: task.assignees,\n        tags: task.tags,\n        img: null,\n        subRows: [],\n        subType: task.taskType || null,\n        attrib: task.attrib,\n        ownAttrib: task.ownAttrib,\n        path: task.folder.path,\n        updatedAt: task.updatedAt,\n      }\n    }\n\n    // If showHierarchy is false, create a flat list of task rows\n    if (!showHierarchy) {\n      const flatRows: TableRow[] = []\n\n      // Loop through all tasks\n      for (const task of tasksMap.values()) {\n        if (!task.id) continue\n        flatRows.push(createTaskRow(task))\n      }\n\n      // Loop through all extra rows\n      for (const row of rows || []) {\n        flatRows.push(row)\n      }\n\n      // Sort all tasks by name\n      if (flatRows.length > 1) {\n        flatRows.sort((a, b) => {\n          if (a.name < b.name) return -1\n          if (a.name > b.name) return 1\n          return 0\n        })\n      }\n\n      // if we are loading more tasks, add loading rows\n      if (isLoadingMore) {\n        const firstTaskAttrib = tasksMap.entries().next()?.value?.[1]?.attrib || {}\n        const loadingAttribs = Object.keys(firstTaskAttrib).map((key) => ({\n          name: key,\n        }))\n        // number of tasks we loading with the infinite query\n        const count = TASKS_INFINITE_QUERY_COUNT\n        if (count > 0) {\n          const loadingTaskRows = generateLoadingRows(loadingAttribs, count, {\n            type: 'task',\n          })\n\n          flatRows.push(...loadingTaskRows)\n        }\n      }\n\n      return flatRows\n    }\n\n    // Use Map for O(1) lookups\n    const rowsById = new Map<string, TableRow>()\n    const rootRows: TableRow[] = []\n\n    // Create minimal rows for only visible folders\n    for (const folderId of visibleFolders) {\n      const folder = foldersMap.get(folderId)\n      if (!folder) continue\n\n      // Create row with minimal required properties\n      const row: TableRow = {\n        id: folderId,\n        entityType: 'folder',\n        parentId: folder.parentId || undefined,\n        name: folder.name || '',\n        label: folder.label || folder.name || '',\n        icon: getEntityTypeData('folder', folder.folderType)?.icon || null,\n        color: null,\n        img: null,\n        subRows: [],\n        status: folder.status,\n        tags: folder.tags || [],\n        subType: folder.folderType || null,\n        ownAttrib: folder.ownAttrib || [],\n        path: folder.path,\n        attrib: folder.attrib || {},\n        childOnlyMatch: folder.childOnlyMatch || false,\n        updatedAt: folder.updatedAt,\n      }\n\n      rowsById.set(folderId, row)\n\n      // Add root rows directly to the rootRows array\n      if (!folder.parentId || !foldersMap.has(folder.parentId)) {\n        rootRows.push(row)\n      }\n\n      // Process tasks immediately if folder is expanded\n      if (expandedFolderIds.has(folderId)) {\n        // because tasksByFolderMap is a map of tasks by folder ID\n        // we can directly get the tasks for the current folder\n        const folderTaskIds = tasksByFolderMap.get(folderId) || []\n        const folderTasks = folderTaskIds.flatMap((taskId) => tasksMap.get(taskId) || [])\n\n        if (folderTasks.length || loadingTasks[folderId]) {\n          // Use array literal with known length for better performance\n          const taskRows = new Array<TableRow>(folderTasks.length)\n\n          // Direct array assignment is faster than push operations\n          for (let i = 0; i < folderTasks.length; i++) {\n            taskRows[i] = createTaskRow(folderTasks[i], folderId)\n          }\n\n          // Add loading rows if applicable\n          if (loadingTasks[folderId]) {\n            const firstTaskAttrib = tasksMap.entries().next()?.value?.[1]?.attrib || {}\n            const loadingAttribs = Object.keys(firstTaskAttrib).map((key) => ({\n              name: key,\n            }))\n            const count = loadingTasks[folderId]\n            if (count > 0) {\n              const loadingTaskRows = generateLoadingRows(loadingAttribs, count, {\n                type: 'task',\n                parentId: folderId,\n              })\n\n              taskRows.push(...loadingTaskRows)\n            }\n          }\n          // Only sort if we have multiple items\n          if (taskRows.length > 1) {\n            // Use a more efficient string comparison for sorting\n            taskRows.sort((a, b) => {\n              if (a.name < b.name) return -1\n              if (a.name > b.name) return 1\n              return 0\n            })\n          }\n\n          row.subRows = taskRows\n        }\n      }\n    }\n\n    // Build the folder hierarchy efficiently\n    for (const folderId of visibleFolders) {\n      const parentId = childToParentMap.get(folderId)\n      if (!parentId || !expandedFolderIds.has(parentId)) continue\n\n      const childRow = rowsById.get(folderId)\n      const parentRow = rowsById.get(parentId)\n\n      if (!childRow || !parentRow) continue\n\n      // Add folder to its parent's subRows\n      parentRow.subRows.push(childRow)\n    }\n\n    // Sort subRows for expanded folders in a single pass\n    for (const folderId of expandedFolderIds) {\n      const row = rowsById.get(folderId)\n      if (!row || row.subRows.length <= 1) continue\n\n      // Process only folders that have both task rows and folder children\n      const hasTasksAndFolders =\n        row.subRows.some((r) => r.entityType === 'task') &&\n        row.subRows.some((r) => r.entityType === 'folder')\n\n      if (hasTasksAndFolders) {\n        // More efficient sort using type as primary key to reduce comparisons\n        row.subRows.sort((a, b) => {\n          // Type first (tasks before folders)\n          const typeA = a.entityType === 'task' ? 0 : 1\n          const typeB = b.entityType === 'task' ? 0 : 1\n\n          if (typeA !== typeB) return typeA - typeB\n\n          // Then by name using more efficient string comparison\n          if (a.name < b.name) return -1\n          if (a.name > b.name) return 1\n          return 0\n        })\n      }\n    }\n\n    // Add any extra rows to the root rows\n    for (const row of rows || []) {\n      rootRows.push(row)\n    }\n\n    // Sort root rows\n    if (rootRows.length > 1) {\n      rootRows.sort((a, b) => {\n        if (a.name < b.name) return -1\n        if (a.name > b.name) return 1\n        return 0\n      })\n    }\n\n    return rootRows\n  }, [\n    foldersMap,\n    tasksMap,\n    rows,\n    visibleFolders,\n    childToParentMap,\n    expandedFolderIds,\n    showHierarchy,\n    loadingTasks,\n    isLoadingMore,\n  ])\n}\n"],"names":["useMemo","generateLoadingRows"],"mappings":";;;;AAUA,MAAM,6BAA6B;AAiBnC,SAAwB,iBAAiB;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,eAAe,CAAC;AAAA,EAChB,gBAAgB;AAClB,GAAuB;AACrB,QAAM,oBAAoB,qBAAqB,EAAE,aAAa;AAGxD,QAAA,cAAcA,cAAQ,MAAM,KAAK,UAAU,QAAQ,GAAG,CAAC,QAAQ,CAAC;AAGhE,QAAA,oBAAoBA,MAAAA,QAAQ,MAAM;AACtC,WAAO,IAAI;AAAA,MACT,OAAO,QAAQ,QAAQ,EACpB,OAAO,CAAC,CAAC,GAAG,UAAU,MAAM,UAAU,EACtC,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE;AAAA,IACrB;AAAA,EAAA,GACC,CAAC,WAAW,CAAC;AAGhB,QAAM,EAAE,kBAAkB,oBAAoB,IAAIA,cAAQ,MAAM;AACxD,UAAA,oCAAoB,IAAoB;AACxC,UAAA,uCAAuB,IAAyB;AAG3C,eAAA,UAAU,WAAW,UAAU;AACpC,UAAA,EAAC,iCAAQ,IAAI;AAEjB,YAAM,WAAW,OAAO;AACxB,UAAI,UAAU;AACE,sBAAA,IAAI,OAAO,IAAI,QAAQ;AAEjC,YAAA,WAAW,iBAAiB,IAAI,QAAQ;AAC5C,YAAI,CAAC,UAAU;AACb,yCAAe,IAAY;AACV,2BAAA,IAAI,UAAU,QAAQ;AAAA,QAAA;AAEhC,iBAAA,IAAI,OAAO,EAAE;AAAA,MAAA;AAAA,IACxB;AAGF,WAAO,EAAE,kBAAkB,eAAe,qBAAqB,iBAAiB;AAAA,EAAA,GAC/E,CAAC,UAAU,CAAC;AAGT,QAAA,iBAAiBA,MAAAA,QAAQ,MAAM;AAC7B,UAAA,8BAAc,IAAY;AAGhC,UAAM,QAAkB,CAAC;AACd,eAAA,UAAU,WAAW,UAAU;AACpC,UAAA,EAAC,iCAAQ,IAAI;AAGb,UAAA,CAAC,OAAO,YAAY,CAAC,WAAW,IAAI,OAAO,QAAQ,GAAG;AAChD,gBAAA,IAAI,OAAO,EAAE;AACf,cAAA,KAAK,OAAO,EAAE;AAAA,MAAA;AAAA,IACtB;AAIK,WAAA,MAAM,SAAS,GAAG;AACjB,YAAA,WAAW,MAAM,MAAM;AACvB,YAAA,mBAAmB,kBAAkB,IAAI,QAAQ;AAEvD,UAAI,CAAC,iBAAkB;AAGjB,YAAA,cAAc,oBAAoB,IAAI,QAAQ;AACpD,UAAI,aAAa;AACf,mBAAW,WAAW,aAAa;AACjC,cAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,oBAAQ,IAAI,OAAO;AACnB,kBAAM,KAAK,OAAO;AAAA,UAAA;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAGK,WAAA;AAAA,EACN,GAAA,CAAC,YAAY,qBAAqB,iBAAiB,CAAC;AAGvD,SAAOA,cAAQ,MAAM;;AAEb,UAAA,gBAAgB,CAAC,MAAsB,aAAgC;AAC3E,YAAM,WAAW,kBAAkB,QAAQ,KAAK,QAAQ;AACjD,aAAA;AAAA,QACL,IAAI,KAAK;AAAA,QACT,YAAY;AAAA,QACZ,UAAU,YAAY,KAAK;AAAA,QAC3B,MAAM,KAAK,QAAQ;AAAA,QACnB,OAAO,KAAK,SAAS,KAAK,QAAQ;AAAA,QAClC,OAAM,qCAAU,SAAQ;AAAA,QACxB,QAAO,qCAAU,UAAS;AAAA,QAC1B,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,MAAM,KAAK;AAAA,QACX,KAAK;AAAA,QACL,SAAS,CAAC;AAAA,QACV,SAAS,KAAK,YAAY;AAAA,QAC1B,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,MAAM,KAAK,OAAO;AAAA,QAClB,WAAW,KAAK;AAAA,MAClB;AAAA,IACF;AAGA,QAAI,CAAC,eAAe;AAClB,YAAM,WAAuB,CAAC;AAGnB,iBAAA,QAAQ,SAAS,UAAU;AAChC,YAAA,CAAC,KAAK,GAAI;AACL,iBAAA,KAAK,cAAc,IAAI,CAAC;AAAA,MAAA;AAIxB,iBAAA,OAAO,QAAQ,IAAI;AAC5B,iBAAS,KAAK,GAAG;AAAA,MAAA;AAIf,UAAA,SAAS,SAAS,GAAG;AACd,iBAAA,KAAK,CAAC,GAAG,MAAM;AACtB,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,iBAAA;AAAA,QAAA,CACR;AAAA,MAAA;AAIH,UAAI,eAAe;AACX,cAAA,oBAAkB,0BAAS,UAAU,WAAnB,mBAA2B,UAA3B,mBAAmC,OAAnC,mBAAuC,WAAU,CAAC;AAC1E,cAAM,iBAAiB,OAAO,KAAK,eAAe,EAAE,IAAI,CAAC,SAAS;AAAA,UAChE,MAAM;AAAA,QAAA,EACN;AAEF,cAAM,QAAQ;AACC;AACP,gBAAA,kBAAkBC,aAAAA,oBAAoB,gBAAgB,OAAO;AAAA,YACjE,MAAM;AAAA,UAAA,CACP;AAEQ,mBAAA,KAAK,GAAG,eAAe;AAAA,QAAA;AAAA,MAClC;AAGK,aAAA;AAAA,IAAA;AAIH,UAAA,+BAAe,IAAsB;AAC3C,UAAM,WAAuB,CAAC;AAG9B,eAAW,YAAY,gBAAgB;AAC/B,YAAA,SAAS,WAAW,IAAI,QAAQ;AACtC,UAAI,CAAC,OAAQ;AAGb,YAAM,MAAgB;AAAA,QACpB,IAAI;AAAA,QACJ,YAAY;AAAA,QACZ,UAAU,OAAO,YAAY;AAAA,QAC7B,MAAM,OAAO,QAAQ;AAAA,QACrB,OAAO,OAAO,SAAS,OAAO,QAAQ;AAAA,QACtC,QAAM,uBAAkB,UAAU,OAAO,UAAU,MAA7C,mBAAgD,SAAQ;AAAA,QAC9D,OAAO;AAAA,QACP,KAAK;AAAA,QACL,SAAS,CAAC;AAAA,QACV,QAAQ,OAAO;AAAA,QACf,MAAM,OAAO,QAAQ,CAAC;AAAA,QACtB,SAAS,OAAO,cAAc;AAAA,QAC9B,WAAW,OAAO,aAAa,CAAC;AAAA,QAChC,MAAM,OAAO;AAAA,QACb,QAAQ,OAAO,UAAU,CAAC;AAAA,QAC1B,gBAAgB,OAAO,kBAAkB;AAAA,QACzC,WAAW,OAAO;AAAA,MACpB;AAES,eAAA,IAAI,UAAU,GAAG;AAGtB,UAAA,CAAC,OAAO,YAAY,CAAC,WAAW,IAAI,OAAO,QAAQ,GAAG;AACxD,iBAAS,KAAK,GAAG;AAAA,MAAA;AAIf,UAAA,kBAAkB,IAAI,QAAQ,GAAG;AAGnC,cAAM,gBAAgB,iBAAiB,IAAI,QAAQ,KAAK,CAAC;AACnD,cAAA,cAAc,cAAc,QAAQ,CAAC,WAAW,SAAS,IAAI,MAAM,KAAK,EAAE;AAEhF,YAAI,YAAY,UAAU,aAAa,QAAQ,GAAG;AAEhD,gBAAM,WAAW,IAAI,MAAgB,YAAY,MAAM;AAGvD,mBAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,qBAAS,CAAC,IAAI,cAAc,YAAY,CAAC,GAAG,QAAQ;AAAA,UAAA;AAIlD,cAAA,aAAa,QAAQ,GAAG;AACpB,kBAAA,oBAAkB,0BAAS,UAAU,WAAnB,mBAA2B,UAA3B,mBAAmC,OAAnC,mBAAuC,WAAU,CAAC;AAC1E,kBAAM,iBAAiB,OAAO,KAAK,eAAe,EAAE,IAAI,CAAC,SAAS;AAAA,cAChE,MAAM;AAAA,YAAA,EACN;AACI,kBAAA,QAAQ,aAAa,QAAQ;AACnC,gBAAI,QAAQ,GAAG;AACP,oBAAA,kBAAkBA,aAAAA,oBAAoB,gBAAgB,OAAO;AAAA,gBACjE,MAAM;AAAA,gBACN,UAAU;AAAA,cAAA,CACX;AAEQ,uBAAA,KAAK,GAAG,eAAe;AAAA,YAAA;AAAA,UAClC;AAGE,cAAA,SAAS,SAAS,GAAG;AAEd,qBAAA,KAAK,CAAC,GAAG,MAAM;AACtB,kBAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,kBAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,qBAAA;AAAA,YAAA,CACR;AAAA,UAAA;AAGH,cAAI,UAAU;AAAA,QAAA;AAAA,MAChB;AAAA,IACF;AAIF,eAAW,YAAY,gBAAgB;AAC/B,YAAA,WAAW,iBAAiB,IAAI,QAAQ;AAC9C,UAAI,CAAC,YAAY,CAAC,kBAAkB,IAAI,QAAQ,EAAG;AAE7C,YAAA,WAAW,SAAS,IAAI,QAAQ;AAChC,YAAA,YAAY,SAAS,IAAI,QAAQ;AAEnC,UAAA,CAAC,YAAY,CAAC,UAAW;AAGnB,gBAAA,QAAQ,KAAK,QAAQ;AAAA,IAAA;AAIjC,eAAW,YAAY,mBAAmB;AAClC,YAAA,MAAM,SAAS,IAAI,QAAQ;AACjC,UAAI,CAAC,OAAO,IAAI,QAAQ,UAAU,EAAG;AAGrC,YAAM,qBACJ,IAAI,QAAQ,KAAK,CAAC,MAAM,EAAE,eAAe,MAAM,KAC/C,IAAI,QAAQ,KAAK,CAAC,MAAM,EAAE,eAAe,QAAQ;AAEnD,UAAI,oBAAoB;AAEtB,YAAI,QAAQ,KAAK,CAAC,GAAG,MAAM;AAEzB,gBAAM,QAAQ,EAAE,eAAe,SAAS,IAAI;AAC5C,gBAAM,QAAQ,EAAE,eAAe,SAAS,IAAI;AAExC,cAAA,UAAU,MAAO,QAAO,QAAQ;AAGpC,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,iBAAA;AAAA,QAAA,CACR;AAAA,MAAA;AAAA,IACH;AAIS,eAAA,OAAO,QAAQ,IAAI;AAC5B,eAAS,KAAK,GAAG;AAAA,IAAA;AAIf,QAAA,SAAS,SAAS,GAAG;AACd,eAAA,KAAK,CAAC,GAAG,MAAM;AACtB,YAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,YAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,eAAA;AAAA,MAAA,CACR;AAAA,IAAA;AAGI,WAAA;AAAA,EAAA,GACN;AAAA,IACD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA,CACD;AACH;;"}

package/dist/shared/src/containers/ProjectTreeTable/hooks/useOverviewTable.es.js

@@ -1,31 +1,19 @@
 import { useMemo } from "react";
 import { generateLoadingRows } from "../utils/loadingUtils.es.js";
+import useGetEntityTypeData from "./useGetEntityTypeData.es.js";
 const TASKS_INFINITE_QUERY_COUNT = 100;
 function useOverviewTable({
   foldersMap,
   tasksMap,
+  rows,
   tasksByFolderMap,
   expanded,
-  folderTypes = [],
-  taskTypes = [],
+  projectInfo,
   showHierarchy,
   loadingTasks = {},
   isLoadingMore = false
 }) {
-  const folderTypesByName = useMemo(() => {
-    const map = /* @__PURE__ */ new Map();
-    for (const folderType of folderTypes) {
-      map.set(folderType.name, folderType);
-    }
-    return map;
-  }, [folderTypes]);
-  const taskTypesByName = useMemo(() => {
-    const map = /* @__PURE__ */ new Map();
-    for (const taskType of taskTypes) {
-      map.set(taskType.name, taskType);
-    }
-    return map;
-  }, [taskTypes]);
+  const getEntityTypeData = useGetEntityTypeData({ projectInfo });
   const expandedKey = useMemo(() => JSON.stringify(expanded), [expanded]);
   const expandedFolderIds = useMemo(() => {
     return new Set(
@@ -36,7 +24,7 @@ function useOverviewTable({
     const childToParent = /* @__PURE__ */ new Map();
     const parentToChildren = /* @__PURE__ */ new Map();
     for (const folder of foldersMap.values()) {
-      if (!folder.id) continue;
+      if (!(folder == null ? void 0 : folder.id)) continue;
       const parentId = folder.parentId;
       if (parentId) {
         childToParent.set(folder.id, parentId);
@@ -54,7 +42,7 @@ function useOverviewTable({
     const visible = /* @__PURE__ */ new Set();
     const queue = [];
     for (const folder of foldersMap.values()) {
-      if (!folder.id) continue;
+      if (!(folder == null ? void 0 : folder.id)) continue;
       if (!folder.parentId || !foldersMap.has(folder.parentId)) {
         visible.add(folder.id);
         queue.push(folder.id);
@@ -79,15 +67,15 @@ function useOverviewTable({
   return useMemo(() => {
     var _a, _b, _c, _d, _e, _f, _g;
     const createTaskRow = (task, parentId) => {
-      var _a2, _b2;
+      const typeData = getEntityTypeData("task", task.taskType);
       return {
         id: task.id,
         entityType: "task",
         parentId: parentId || task.folderId,
         name: task.name || "",
         label: task.label || task.name || "",
-        icon: ((_a2 = taskTypesByName.get(task.taskType)) == null ? void 0 : _a2.icon) || null,
-        color: ((_b2 = taskTypesByName.get(task.taskType)) == null ? void 0 : _b2.color) || null,
+        icon: (typeData == null ? void 0 : typeData.icon) || null,
+        color: (typeData == null ? void 0 : typeData.color) || null,
         status: task.status,
         assignees: task.assignees,
         tags: task.tags,
@@ -96,17 +84,21 @@ function useOverviewTable({
         subType: task.taskType || null,
         attrib: task.attrib,
         ownAttrib: task.ownAttrib,
-        path: task.folder.path
+        path: task.folder.path,
+        updatedAt: task.updatedAt
       };
     };
     if (!showHierarchy) {
-      const flatTaskRows = [];
+      const flatRows = [];
       for (const task of tasksMap.values()) {
         if (!task.id) continue;
-        flatTaskRows.push(createTaskRow(task));
+        flatRows.push(createTaskRow(task));
       }
-      if (flatTaskRows.length > 1) {
-        flatTaskRows.sort((a, b) => {
+      for (const row of rows || []) {
+        flatRows.push(row);
+      }
+      if (flatRows.length > 1) {
+        flatRows.sort((a, b) => {
           if (a.name < b.name) return -1;
           if (a.name > b.name) return 1;
           return 0;
@@ -122,10 +114,10 @@ function useOverviewTable({
           const loadingTaskRows = generateLoadingRows(loadingAttribs, count, {
             type: "task"
           });
-          flatTaskRows.push(...loadingTaskRows);
+          flatRows.push(...loadingTaskRows);
         }
       }
-      return flatTaskRows;
+      return flatRows;
     }
     const rowsById = /* @__PURE__ */ new Map();
     const rootRows = [];
@@ -138,7 +130,7 @@ function useOverviewTable({
         parentId: folder.parentId || void 0,
         name: folder.name || "",
         label: folder.label || folder.name || "",
-        icon: ((_d = folderTypesByName.get(folder.folderType)) == null ? void 0 : _d.icon) || null,
+        icon: ((_d = getEntityTypeData("folder", folder.folderType)) == null ? void 0 : _d.icon) || null,
         color: null,
         img: null,
         subRows: [],
@@ -148,7 +140,8 @@ function useOverviewTable({
         ownAttrib: folder.ownAttrib || [],
         path: folder.path,
         attrib: folder.attrib || {},
-        childOnlyMatch: folder.childOnlyMatch || false
+        childOnlyMatch: folder.childOnlyMatch || false,
+        updatedAt: folder.updatedAt
       };
       rowsById.set(folderId, row);
       if (!folder.parentId || !foldersMap.has(folder.parentId)) {
@@ -210,6 +203,9 @@ function useOverviewTable({
         });
       }
     }
+    for (const row of rows || []) {
+      rootRows.push(row);
+    }
     if (rootRows.length > 1) {
       rootRows.sort((a, b) => {
         if (a.name < b.name) return -1;
@@ -221,11 +217,11 @@ function useOverviewTable({
   }, [
     foldersMap,
     tasksMap,
+    rows,
     visibleFolders,
     childToParentMap,
     expandedFolderIds,
     showHierarchy,
-    taskTypesByName,
     loadingTasks,
     isLoadingMore
   ]);

package/dist/shared/src/containers/ProjectTreeTable/hooks/useOverviewTable.es.js.map

@@ -1 +1 @@
-{"version":3,"file":"useOverviewTable.es.js","sources":["../../../../../../src/containers/ProjectTreeTable/hooks/useOverviewTable.ts"],"sourcesContent":["import { useMemo } from 'react'\nimport {\n  EditorTaskNode,\n  FolderNodeMap,\n  TableRow,\n  TaskNodeMap,\n  TasksByFolderMap,\n} from '../types/table'\nimport { ExpandedState } from '@tanstack/react-table'\nimport { generateLoadingRows } from '../utils/loadingUtils'\nconst TASKS_INFINITE_QUERY_COUNT = 100\nimport { LoadingTasks } from '../types'\nimport { FolderType, TaskType } from '../types/project'\n\ntype Params = {\n  foldersMap: FolderNodeMap\n  tasksMap: TaskNodeMap\n  tasksByFolderMap: TasksByFolderMap\n  expanded: ExpandedState\n  folderTypes?: FolderType[]\n  taskTypes?: TaskType[]\n  showHierarchy: boolean\n  loadingTasks: LoadingTasks\n  isLoadingMore?: boolean\n}\n\n/**\n * React hook that creates a hierarchical tree structure from folders and tasks for use with TanStack Table\n * Uses memoization to avoid unnecessary recalculations on re-render\n *\n * @param foldersMap - Map of folders organized by folder ID\n * @param tasksMap - Map of tasks organized by task ID\n * @param tasksByFolderMap - Map of tasks organized by folder ID\n * @param expanded - Object with folder IDs as keys to indicate expanded folders\n * @param folderTypes - Array of folder types for to add things like folder icon\n * @param taskTypes - Array of task types for to add things like task icon\n * @param showHierarchy - Boolean to indicate if the hierarchy should be shown\n * @param loadingTasks - Object with folder IDs as keys to indicate loading tasks\n * @param isLoadingMore - Boolean to indicate if more tasks are being loaded\n * @returns An array of TableRow objects with nested subRows suitable for TanStack Table\n */\nexport default function useOverviewTable({\n  foldersMap,\n  tasksMap,\n  tasksByFolderMap,\n  expanded,\n  folderTypes = [],\n  taskTypes = [],\n  showHierarchy,\n  loadingTasks = {},\n  isLoadingMore = false,\n}: Params): TableRow[] {\n  // create a map of folder types by name for efficient lookups\n  const folderTypesByName = useMemo(() => {\n    const map: Map<string, FolderType> = new Map()\n    for (const folderType of folderTypes) {\n      map.set(folderType.name, folderType)\n    }\n    return map\n  }, [folderTypes])\n\n  // create a map of task types by name for efficient lookups\n  const taskTypesByName = useMemo(() => {\n    const map: Map<string, TaskType> = new Map()\n    for (const taskType of taskTypes) {\n      map.set(taskType.name, taskType)\n    }\n    return map\n  }, [taskTypes])\n\n  // Convert expanded object to a stable string for memoization comparison\n  const expandedKey = useMemo(() => JSON.stringify(expanded), [expanded])\n\n  // Memoize expandedFolderIds set for efficient lookups\n  const expandedFolderIds = useMemo(() => {\n    return new Set(\n      Object.entries(expanded)\n        .filter(([_, isExpanded]) => isExpanded)\n        .map(([id]) => id),\n    )\n  }, [expandedKey])\n\n  // Memoize relationship maps to avoid rebuilding them on every render\n  const { childToParentMap, parentToChildrenMap } = useMemo(() => {\n    const childToParent = new Map<string, string>()\n    const parentToChildren = new Map<string, Set<string>>()\n\n    // Construct relationship maps in a single pass\n    for (const folder of foldersMap.values()) {\n      if (!folder.id) continue\n\n      const parentId = folder.parentId\n      if (parentId) {\n        childToParent.set(folder.id, parentId)\n\n        let children = parentToChildren.get(parentId)\n        if (!children) {\n          children = new Set<string>()\n          parentToChildren.set(parentId, children)\n        }\n        children.add(folder.id)\n      }\n    }\n\n    return { childToParentMap: childToParent, parentToChildrenMap: parentToChildren }\n  }, [foldersMap])\n\n  // Memoize visible folders calculation\n  const visibleFolders = useMemo(() => {\n    const visible = new Set<string>()\n\n    // Start with root folders and folders with non-existent parents\n    const queue: string[] = []\n    for (const folder of foldersMap.values()) {\n      if (!folder.id) continue\n\n      // Include folders with no parent OR with a parent that doesn't exist\n      if (!folder.parentId || !foldersMap.has(folder.parentId)) {\n        visible.add(folder.id)\n        queue.push(folder.id)\n      }\n    }\n\n    // Process queue to identify visible folders (BFS)\n    while (queue.length > 0) {\n      const folderId = queue.shift()!\n      const isParentExpanded = expandedFolderIds.has(folderId)\n\n      if (!isParentExpanded) continue\n\n      // Add children of expanded folders to visible set\n      const childrenIds = parentToChildrenMap.get(folderId)\n      if (childrenIds) {\n        for (const childId of childrenIds) {\n          if (!visible.has(childId)) {\n            visible.add(childId)\n            queue.push(childId)\n          }\n        }\n      }\n    }\n\n    return visible\n  }, [foldersMap, parentToChildrenMap, expandedFolderIds])\n\n  // Final memoized result - build the table tree\n  return useMemo(() => {\n    // Helper function to create a task row\n    const createTaskRow = (task: EditorTaskNode, parentId?: string): TableRow => {\n      return {\n        id: task.id,\n        entityType: 'task',\n        parentId: parentId || task.folderId,\n        name: task.name || '',\n        label: task.label || task.name || '',\n        icon: taskTypesByName.get(task.taskType)?.icon || null,\n        color: taskTypesByName.get(task.taskType)?.color || null,\n        status: task.status,\n        assignees: task.assignees,\n        tags: task.tags,\n        img: null,\n        subRows: [],\n        subType: task.taskType || null,\n        attrib: task.attrib,\n        ownAttrib: task.ownAttrib,\n        path: task.folder.path,\n      }\n    }\n\n    // If showHierarchy is false, create a flat list of task rows\n    if (!showHierarchy) {\n      const flatTaskRows: TableRow[] = []\n\n      // Loop through all tasks\n      for (const task of tasksMap.values()) {\n        if (!task.id) continue\n        flatTaskRows.push(createTaskRow(task))\n      }\n\n      // Sort all tasks by name\n      if (flatTaskRows.length > 1) {\n        flatTaskRows.sort((a, b) => {\n          if (a.name < b.name) return -1\n          if (a.name > b.name) return 1\n          return 0\n        })\n      }\n\n      // if we are loading more tasks, add loading rows\n      if (isLoadingMore) {\n        const firstTaskAttrib = tasksMap.entries().next()?.value?.[1]?.attrib || {}\n        const loadingAttribs = Object.keys(firstTaskAttrib).map((key) => ({\n          name: key,\n        }))\n        // number of tasks we loading with the infinite query\n        const count = TASKS_INFINITE_QUERY_COUNT\n        if (count > 0) {\n          const loadingTaskRows = generateLoadingRows(loadingAttribs, count, {\n            type: 'task',\n          })\n\n          flatTaskRows.push(...loadingTaskRows)\n        }\n      }\n\n      return flatTaskRows\n    }\n\n    // Use Map for O(1) lookups\n    const rowsById = new Map<string, TableRow>()\n    const rootRows: TableRow[] = []\n\n    // Create minimal rows for only visible folders\n    for (const folderId of visibleFolders) {\n      const folder = foldersMap.get(folderId)\n      if (!folder) continue\n\n      // Create row with minimal required properties\n      const row: TableRow = {\n        id: folderId,\n        entityType: 'folder',\n        parentId: folder.parentId || undefined,\n        name: folder.name || '',\n        label: folder.label || folder.name || '',\n        icon: folderTypesByName.get(folder.folderType)?.icon || null,\n        color: null,\n        img: null,\n        subRows: [],\n        status: folder.status,\n        tags: folder.tags || [],\n        subType: folder.folderType || null,\n        ownAttrib: folder.ownAttrib || [],\n        path: folder.path,\n        attrib: folder.attrib || {},\n        childOnlyMatch: folder.childOnlyMatch || false,\n      }\n\n      rowsById.set(folderId, row)\n\n      // Add root rows directly to the rootRows array\n      if (!folder.parentId || !foldersMap.has(folder.parentId)) {\n        rootRows.push(row)\n      }\n\n      // Process tasks immediately if folder is expanded\n      if (expandedFolderIds.has(folderId)) {\n        // because tasksByFolderMap is a map of tasks by folder ID\n        // we can directly get the tasks for the current folder\n        const folderTaskIds = tasksByFolderMap.get(folderId) || []\n        const folderTasks = folderTaskIds.flatMap((taskId) => tasksMap.get(taskId) || [])\n\n        if (folderTasks.length || loadingTasks[folderId]) {\n          // Use array literal with known length for better performance\n          const taskRows = new Array<TableRow>(folderTasks.length)\n\n          // Direct array assignment is faster than push operations\n          for (let i = 0; i < folderTasks.length; i++) {\n            taskRows[i] = createTaskRow(folderTasks[i], folderId)\n          }\n\n          // Add loading rows if applicable\n          if (loadingTasks[folderId]) {\n            const firstTaskAttrib = tasksMap.entries().next()?.value?.[1]?.attrib || {}\n            const loadingAttribs = Object.keys(firstTaskAttrib).map((key) => ({\n              name: key,\n            }))\n            const count = loadingTasks[folderId]\n            if (count > 0) {\n              const loadingTaskRows = generateLoadingRows(loadingAttribs, count, {\n                type: 'task',\n                parentId: folderId,\n              })\n\n              taskRows.push(...loadingTaskRows)\n            }\n          }\n          // Only sort if we have multiple items\n          if (taskRows.length > 1) {\n            // Use a more efficient string comparison for sorting\n            taskRows.sort((a, b) => {\n              if (a.name < b.name) return -1\n              if (a.name > b.name) return 1\n              return 0\n            })\n          }\n\n          row.subRows = taskRows\n        }\n      }\n    }\n\n    // Build the folder hierarchy efficiently\n    for (const folderId of visibleFolders) {\n      const parentId = childToParentMap.get(folderId)\n      if (!parentId || !expandedFolderIds.has(parentId)) continue\n\n      const childRow = rowsById.get(folderId)\n      const parentRow = rowsById.get(parentId)\n\n      if (!childRow || !parentRow) continue\n\n      // Add folder to its parent's subRows\n      parentRow.subRows.push(childRow)\n    }\n\n    // Sort subRows for expanded folders in a single pass\n    for (const folderId of expandedFolderIds) {\n      const row = rowsById.get(folderId)\n      if (!row || row.subRows.length <= 1) continue\n\n      // Process only folders that have both task rows and folder children\n      const hasTasksAndFolders =\n        row.subRows.some((r) => r.entityType === 'task') &&\n        row.subRows.some((r) => r.entityType === 'folder')\n\n      if (hasTasksAndFolders) {\n        // More efficient sort using type as primary key to reduce comparisons\n        row.subRows.sort((a, b) => {\n          // Type first (tasks before folders)\n          const typeA = a.entityType === 'task' ? 0 : 1\n          const typeB = b.entityType === 'task' ? 0 : 1\n\n          if (typeA !== typeB) return typeA - typeB\n\n          // Then by name using more efficient string comparison\n          if (a.name < b.name) return -1\n          if (a.name > b.name) return 1\n          return 0\n        })\n      }\n    }\n\n    // Sort root rows\n    if (rootRows.length > 1) {\n      rootRows.sort((a, b) => {\n        if (a.name < b.name) return -1\n        if (a.name > b.name) return 1\n        return 0\n      })\n    }\n\n    return rootRows\n  }, [\n    foldersMap,\n    tasksMap,\n    visibleFolders,\n    childToParentMap,\n    expandedFolderIds,\n    showHierarchy,\n    taskTypesByName,\n    loadingTasks,\n    isLoadingMore,\n  ])\n}\n"],"names":["_a","_b"],"mappings":";;AAUA,MAAM,6BAA6B;AA+BnC,SAAwB,iBAAiB;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,cAAc,CAAC;AAAA,EACf,YAAY,CAAC;AAAA,EACb;AAAA,EACA,eAAe,CAAC;AAAA,EAChB,gBAAgB;AAClB,GAAuB;AAEf,QAAA,oBAAoB,QAAQ,MAAM;AAChC,UAAA,0BAAmC,IAAI;AAC7C,eAAW,cAAc,aAAa;AAChC,UAAA,IAAI,WAAW,MAAM,UAAU;AAAA,IAAA;AAE9B,WAAA;AAAA,EAAA,GACN,CAAC,WAAW,CAAC;AAGV,QAAA,kBAAkB,QAAQ,MAAM;AAC9B,UAAA,0BAAiC,IAAI;AAC3C,eAAW,YAAY,WAAW;AAC5B,UAAA,IAAI,SAAS,MAAM,QAAQ;AAAA,IAAA;AAE1B,WAAA;AAAA,EAAA,GACN,CAAC,SAAS,CAAC;AAGR,QAAA,cAAc,QAAQ,MAAM,KAAK,UAAU,QAAQ,GAAG,CAAC,QAAQ,CAAC;AAGhE,QAAA,oBAAoB,QAAQ,MAAM;AACtC,WAAO,IAAI;AAAA,MACT,OAAO,QAAQ,QAAQ,EACpB,OAAO,CAAC,CAAC,GAAG,UAAU,MAAM,UAAU,EACtC,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE;AAAA,IACrB;AAAA,EAAA,GACC,CAAC,WAAW,CAAC;AAGhB,QAAM,EAAE,kBAAkB,oBAAoB,IAAI,QAAQ,MAAM;AACxD,UAAA,oCAAoB,IAAoB;AACxC,UAAA,uCAAuB,IAAyB;AAG3C,eAAA,UAAU,WAAW,UAAU;AACpC,UAAA,CAAC,OAAO,GAAI;AAEhB,YAAM,WAAW,OAAO;AACxB,UAAI,UAAU;AACE,sBAAA,IAAI,OAAO,IAAI,QAAQ;AAEjC,YAAA,WAAW,iBAAiB,IAAI,QAAQ;AAC5C,YAAI,CAAC,UAAU;AACb,yCAAe,IAAY;AACV,2BAAA,IAAI,UAAU,QAAQ;AAAA,QAAA;AAEhC,iBAAA,IAAI,OAAO,EAAE;AAAA,MAAA;AAAA,IACxB;AAGF,WAAO,EAAE,kBAAkB,eAAe,qBAAqB,iBAAiB;AAAA,EAAA,GAC/E,CAAC,UAAU,CAAC;AAGT,QAAA,iBAAiB,QAAQ,MAAM;AAC7B,UAAA,8BAAc,IAAY;AAGhC,UAAM,QAAkB,CAAC;AACd,eAAA,UAAU,WAAW,UAAU;AACpC,UAAA,CAAC,OAAO,GAAI;AAGZ,UAAA,CAAC,OAAO,YAAY,CAAC,WAAW,IAAI,OAAO,QAAQ,GAAG;AAChD,gBAAA,IAAI,OAAO,EAAE;AACf,cAAA,KAAK,OAAO,EAAE;AAAA,MAAA;AAAA,IACtB;AAIK,WAAA,MAAM,SAAS,GAAG;AACjB,YAAA,WAAW,MAAM,MAAM;AACvB,YAAA,mBAAmB,kBAAkB,IAAI,QAAQ;AAEvD,UAAI,CAAC,iBAAkB;AAGjB,YAAA,cAAc,oBAAoB,IAAI,QAAQ;AACpD,UAAI,aAAa;AACf,mBAAW,WAAW,aAAa;AACjC,cAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,oBAAQ,IAAI,OAAO;AACnB,kBAAM,KAAK,OAAO;AAAA,UAAA;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAGK,WAAA;AAAA,EACN,GAAA,CAAC,YAAY,qBAAqB,iBAAiB,CAAC;AAGvD,SAAO,QAAQ,MAAM;;AAEb,UAAA,gBAAgB,CAAC,MAAsB,aAAgC;;AACpE,aAAA;AAAA,QACL,IAAI,KAAK;AAAA,QACT,YAAY;AAAA,QACZ,UAAU,YAAY,KAAK;AAAA,QAC3B,MAAM,KAAK,QAAQ;AAAA,QACnB,OAAO,KAAK,SAAS,KAAK,QAAQ;AAAA,QAClC,QAAMA,MAAA,gBAAgB,IAAI,KAAK,QAAQ,MAAjC,gBAAAA,IAAoC,SAAQ;AAAA,QAClD,SAAOC,MAAA,gBAAgB,IAAI,KAAK,QAAQ,MAAjC,gBAAAA,IAAoC,UAAS;AAAA,QACpD,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,MAAM,KAAK;AAAA,QACX,KAAK;AAAA,QACL,SAAS,CAAC;AAAA,QACV,SAAS,KAAK,YAAY;AAAA,QAC1B,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,MAAM,KAAK,OAAO;AAAA,MACpB;AAAA,IACF;AAGA,QAAI,CAAC,eAAe;AAClB,YAAM,eAA2B,CAAC;AAGvB,iBAAA,QAAQ,SAAS,UAAU;AAChC,YAAA,CAAC,KAAK,GAAI;AACD,qBAAA,KAAK,cAAc,IAAI,CAAC;AAAA,MAAA;AAInC,UAAA,aAAa,SAAS,GAAG;AACd,qBAAA,KAAK,CAAC,GAAG,MAAM;AAC1B,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,iBAAA;AAAA,QAAA,CACR;AAAA,MAAA;AAIH,UAAI,eAAe;AACX,cAAA,oBAAkB,0BAAS,UAAU,WAAnB,mBAA2B,UAA3B,mBAAmC,OAAnC,mBAAuC,WAAU,CAAC;AAC1E,cAAM,iBAAiB,OAAO,KAAK,eAAe,EAAE,IAAI,CAAC,SAAS;AAAA,UAChE,MAAM;AAAA,QAAA,EACN;AAEF,cAAM,QAAQ;AACC;AACP,gBAAA,kBAAkB,oBAAoB,gBAAgB,OAAO;AAAA,YACjE,MAAM;AAAA,UAAA,CACP;AAEY,uBAAA,KAAK,GAAG,eAAe;AAAA,QAAA;AAAA,MACtC;AAGK,aAAA;AAAA,IAAA;AAIH,UAAA,+BAAe,IAAsB;AAC3C,UAAM,WAAuB,CAAC;AAG9B,eAAW,YAAY,gBAAgB;AAC/B,YAAA,SAAS,WAAW,IAAI,QAAQ;AACtC,UAAI,CAAC,OAAQ;AAGb,YAAM,MAAgB;AAAA,QACpB,IAAI;AAAA,QACJ,YAAY;AAAA,QACZ,UAAU,OAAO,YAAY;AAAA,QAC7B,MAAM,OAAO,QAAQ;AAAA,QACrB,OAAO,OAAO,SAAS,OAAO,QAAQ;AAAA,QACtC,QAAM,uBAAkB,IAAI,OAAO,UAAU,MAAvC,mBAA0C,SAAQ;AAAA,QACxD,OAAO;AAAA,QACP,KAAK;AAAA,QACL,SAAS,CAAC;AAAA,QACV,QAAQ,OAAO;AAAA,QACf,MAAM,OAAO,QAAQ,CAAC;AAAA,QACtB,SAAS,OAAO,cAAc;AAAA,QAC9B,WAAW,OAAO,aAAa,CAAC;AAAA,QAChC,MAAM,OAAO;AAAA,QACb,QAAQ,OAAO,UAAU,CAAC;AAAA,QAC1B,gBAAgB,OAAO,kBAAkB;AAAA,MAC3C;AAES,eAAA,IAAI,UAAU,GAAG;AAGtB,UAAA,CAAC,OAAO,YAAY,CAAC,WAAW,IAAI,OAAO,QAAQ,GAAG;AACxD,iBAAS,KAAK,GAAG;AAAA,MAAA;AAIf,UAAA,kBAAkB,IAAI,QAAQ,GAAG;AAGnC,cAAM,gBAAgB,iBAAiB,IAAI,QAAQ,KAAK,CAAC;AACnD,cAAA,cAAc,cAAc,QAAQ,CAAC,WAAW,SAAS,IAAI,MAAM,KAAK,EAAE;AAEhF,YAAI,YAAY,UAAU,aAAa,QAAQ,GAAG;AAEhD,gBAAM,WAAW,IAAI,MAAgB,YAAY,MAAM;AAGvD,mBAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,qBAAS,CAAC,IAAI,cAAc,YAAY,CAAC,GAAG,QAAQ;AAAA,UAAA;AAIlD,cAAA,aAAa,QAAQ,GAAG;AACpB,kBAAA,oBAAkB,0BAAS,UAAU,WAAnB,mBAA2B,UAA3B,mBAAmC,OAAnC,mBAAuC,WAAU,CAAC;AAC1E,kBAAM,iBAAiB,OAAO,KAAK,eAAe,EAAE,IAAI,CAAC,SAAS;AAAA,cAChE,MAAM;AAAA,YAAA,EACN;AACI,kBAAA,QAAQ,aAAa,QAAQ;AACnC,gBAAI,QAAQ,GAAG;AACP,oBAAA,kBAAkB,oBAAoB,gBAAgB,OAAO;AAAA,gBACjE,MAAM;AAAA,gBACN,UAAU;AAAA,cAAA,CACX;AAEQ,uBAAA,KAAK,GAAG,eAAe;AAAA,YAAA;AAAA,UAClC;AAGE,cAAA,SAAS,SAAS,GAAG;AAEd,qBAAA,KAAK,CAAC,GAAG,MAAM;AACtB,kBAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,kBAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,qBAAA;AAAA,YAAA,CACR;AAAA,UAAA;AAGH,cAAI,UAAU;AAAA,QAAA;AAAA,MAChB;AAAA,IACF;AAIF,eAAW,YAAY,gBAAgB;AAC/B,YAAA,WAAW,iBAAiB,IAAI,QAAQ;AAC9C,UAAI,CAAC,YAAY,CAAC,kBAAkB,IAAI,QAAQ,EAAG;AAE7C,YAAA,WAAW,SAAS,IAAI,QAAQ;AAChC,YAAA,YAAY,SAAS,IAAI,QAAQ;AAEnC,UAAA,CAAC,YAAY,CAAC,UAAW;AAGnB,gBAAA,QAAQ,KAAK,QAAQ;AAAA,IAAA;AAIjC,eAAW,YAAY,mBAAmB;AAClC,YAAA,MAAM,SAAS,IAAI,QAAQ;AACjC,UAAI,CAAC,OAAO,IAAI,QAAQ,UAAU,EAAG;AAGrC,YAAM,qBACJ,IAAI,QAAQ,KAAK,CAAC,MAAM,EAAE,eAAe,MAAM,KAC/C,IAAI,QAAQ,KAAK,CAAC,MAAM,EAAE,eAAe,QAAQ;AAEnD,UAAI,oBAAoB;AAEtB,YAAI,QAAQ,KAAK,CAAC,GAAG,MAAM;AAEzB,gBAAM,QAAQ,EAAE,eAAe,SAAS,IAAI;AAC5C,gBAAM,QAAQ,EAAE,eAAe,SAAS,IAAI;AAExC,cAAA,UAAU,MAAO,QAAO,QAAQ;AAGpC,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,iBAAA;AAAA,QAAA,CACR;AAAA,MAAA;AAAA,IACH;AAIE,QAAA,SAAS,SAAS,GAAG;AACd,eAAA,KAAK,CAAC,GAAG,MAAM;AACtB,YAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,YAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,eAAA;AAAA,MAAA,CACR;AAAA,IAAA;AAGI,WAAA;AAAA,EAAA,GACN;AAAA,IACD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA,CACD;AACH;"}
+{"version":3,"file":"useOverviewTable.es.js","sources":["../../../../../../src/containers/ProjectTreeTable/hooks/useOverviewTable.ts"],"sourcesContent":["import { useMemo } from 'react'\nimport {\n  EditorTaskNode,\n  FolderNodeMap,\n  TableRow,\n  TaskNodeMap,\n  TasksByFolderMap,\n} from '../types/table'\nimport { ExpandedState } from '@tanstack/react-table'\nimport { generateLoadingRows } from '../utils/loadingUtils'\nconst TASKS_INFINITE_QUERY_COUNT = 100\nimport { LoadingTasks } from '../types'\nimport { ProjectModel } from '../types/project'\nimport useGetEntityTypeData from './useGetEntityTypeData'\n\ntype Params = {\n  foldersMap: FolderNodeMap\n  tasksMap: TaskNodeMap\n  tasksByFolderMap: TasksByFolderMap\n  rows?: TableRow[]\n  expanded: ExpandedState\n  projectInfo?: ProjectModel\n  showHierarchy: boolean\n  loadingTasks?: LoadingTasks\n  isLoadingMore?: boolean\n}\n\nexport default function useOverviewTable({\n  foldersMap,\n  tasksMap,\n  rows,\n  tasksByFolderMap,\n  expanded,\n  projectInfo,\n  showHierarchy,\n  loadingTasks = {},\n  isLoadingMore = false,\n}: Params): TableRow[] {\n  const getEntityTypeData = useGetEntityTypeData({ projectInfo })\n\n  // Convert expanded object to a stable string for memoization comparison\n  const expandedKey = useMemo(() => JSON.stringify(expanded), [expanded])\n\n  // Memoize expandedFolderIds set for efficient lookups\n  const expandedFolderIds = useMemo(() => {\n    return new Set(\n      Object.entries(expanded)\n        .filter(([_, isExpanded]) => isExpanded)\n        .map(([id]) => id),\n    )\n  }, [expandedKey])\n\n  // Memoize relationship maps to avoid rebuilding them on every render\n  const { childToParentMap, parentToChildrenMap } = useMemo(() => {\n    const childToParent = new Map<string, string>()\n    const parentToChildren = new Map<string, Set<string>>()\n\n    // Construct relationship maps in a single pass\n    for (const folder of foldersMap.values()) {\n      if (!folder?.id) continue\n\n      const parentId = folder.parentId\n      if (parentId) {\n        childToParent.set(folder.id, parentId)\n\n        let children = parentToChildren.get(parentId)\n        if (!children) {\n          children = new Set<string>()\n          parentToChildren.set(parentId, children)\n        }\n        children.add(folder.id)\n      }\n    }\n\n    return { childToParentMap: childToParent, parentToChildrenMap: parentToChildren }\n  }, [foldersMap])\n\n  // Memoize visible folders calculation\n  const visibleFolders = useMemo(() => {\n    const visible = new Set<string>()\n\n    // Start with root folders and folders with non-existent parents\n    const queue: string[] = []\n    for (const folder of foldersMap.values()) {\n      if (!folder?.id) continue\n\n      // Include folders with no parent OR with a parent that doesn't exist\n      if (!folder.parentId || !foldersMap.has(folder.parentId)) {\n        visible.add(folder.id)\n        queue.push(folder.id)\n      }\n    }\n\n    // Process queue to identify visible folders (BFS)\n    while (queue.length > 0) {\n      const folderId = queue.shift()!\n      const isParentExpanded = expandedFolderIds.has(folderId)\n\n      if (!isParentExpanded) continue\n\n      // Add children of expanded folders to visible set\n      const childrenIds = parentToChildrenMap.get(folderId)\n      if (childrenIds) {\n        for (const childId of childrenIds) {\n          if (!visible.has(childId)) {\n            visible.add(childId)\n            queue.push(childId)\n          }\n        }\n      }\n    }\n\n    return visible\n  }, [foldersMap, parentToChildrenMap, expandedFolderIds])\n\n  // Final memoized result - build the table tree\n  return useMemo(() => {\n    // Helper function to create a task row\n    const createTaskRow = (task: EditorTaskNode, parentId?: string): TableRow => {\n      const typeData = getEntityTypeData('task', task.taskType)\n      return {\n        id: task.id,\n        entityType: 'task',\n        parentId: parentId || task.folderId,\n        name: task.name || '',\n        label: task.label || task.name || '',\n        icon: typeData?.icon || null,\n        color: typeData?.color || null,\n        status: task.status,\n        assignees: task.assignees,\n        tags: task.tags,\n        img: null,\n        subRows: [],\n        subType: task.taskType || null,\n        attrib: task.attrib,\n        ownAttrib: task.ownAttrib,\n        path: task.folder.path,\n        updatedAt: task.updatedAt,\n      }\n    }\n\n    // If showHierarchy is false, create a flat list of task rows\n    if (!showHierarchy) {\n      const flatRows: TableRow[] = []\n\n      // Loop through all tasks\n      for (const task of tasksMap.values()) {\n        if (!task.id) continue\n        flatRows.push(createTaskRow(task))\n      }\n\n      // Loop through all extra rows\n      for (const row of rows || []) {\n        flatRows.push(row)\n      }\n\n      // Sort all tasks by name\n      if (flatRows.length > 1) {\n        flatRows.sort((a, b) => {\n          if (a.name < b.name) return -1\n          if (a.name > b.name) return 1\n          return 0\n        })\n      }\n\n      // if we are loading more tasks, add loading rows\n      if (isLoadingMore) {\n        const firstTaskAttrib = tasksMap.entries().next()?.value?.[1]?.attrib || {}\n        const loadingAttribs = Object.keys(firstTaskAttrib).map((key) => ({\n          name: key,\n        }))\n        // number of tasks we loading with the infinite query\n        const count = TASKS_INFINITE_QUERY_COUNT\n        if (count > 0) {\n          const loadingTaskRows = generateLoadingRows(loadingAttribs, count, {\n            type: 'task',\n          })\n\n          flatRows.push(...loadingTaskRows)\n        }\n      }\n\n      return flatRows\n    }\n\n    // Use Map for O(1) lookups\n    const rowsById = new Map<string, TableRow>()\n    const rootRows: TableRow[] = []\n\n    // Create minimal rows for only visible folders\n    for (const folderId of visibleFolders) {\n      const folder = foldersMap.get(folderId)\n      if (!folder) continue\n\n      // Create row with minimal required properties\n      const row: TableRow = {\n        id: folderId,\n        entityType: 'folder',\n        parentId: folder.parentId || undefined,\n        name: folder.name || '',\n        label: folder.label || folder.name || '',\n        icon: getEntityTypeData('folder', folder.folderType)?.icon || null,\n        color: null,\n        img: null,\n        subRows: [],\n        status: folder.status,\n        tags: folder.tags || [],\n        subType: folder.folderType || null,\n        ownAttrib: folder.ownAttrib || [],\n        path: folder.path,\n        attrib: folder.attrib || {},\n        childOnlyMatch: folder.childOnlyMatch || false,\n        updatedAt: folder.updatedAt,\n      }\n\n      rowsById.set(folderId, row)\n\n      // Add root rows directly to the rootRows array\n      if (!folder.parentId || !foldersMap.has(folder.parentId)) {\n        rootRows.push(row)\n      }\n\n      // Process tasks immediately if folder is expanded\n      if (expandedFolderIds.has(folderId)) {\n        // because tasksByFolderMap is a map of tasks by folder ID\n        // we can directly get the tasks for the current folder\n        const folderTaskIds = tasksByFolderMap.get(folderId) || []\n        const folderTasks = folderTaskIds.flatMap((taskId) => tasksMap.get(taskId) || [])\n\n        if (folderTasks.length || loadingTasks[folderId]) {\n          // Use array literal with known length for better performance\n          const taskRows = new Array<TableRow>(folderTasks.length)\n\n          // Direct array assignment is faster than push operations\n          for (let i = 0; i < folderTasks.length; i++) {\n            taskRows[i] = createTaskRow(folderTasks[i], folderId)\n          }\n\n          // Add loading rows if applicable\n          if (loadingTasks[folderId]) {\n            const firstTaskAttrib = tasksMap.entries().next()?.value?.[1]?.attrib || {}\n            const loadingAttribs = Object.keys(firstTaskAttrib).map((key) => ({\n              name: key,\n            }))\n            const count = loadingTasks[folderId]\n            if (count > 0) {\n              const loadingTaskRows = generateLoadingRows(loadingAttribs, count, {\n                type: 'task',\n                parentId: folderId,\n              })\n\n              taskRows.push(...loadingTaskRows)\n            }\n          }\n          // Only sort if we have multiple items\n          if (taskRows.length > 1) {\n            // Use a more efficient string comparison for sorting\n            taskRows.sort((a, b) => {\n              if (a.name < b.name) return -1\n              if (a.name > b.name) return 1\n              return 0\n            })\n          }\n\n          row.subRows = taskRows\n        }\n      }\n    }\n\n    // Build the folder hierarchy efficiently\n    for (const folderId of visibleFolders) {\n      const parentId = childToParentMap.get(folderId)\n      if (!parentId || !expandedFolderIds.has(parentId)) continue\n\n      const childRow = rowsById.get(folderId)\n      const parentRow = rowsById.get(parentId)\n\n      if (!childRow || !parentRow) continue\n\n      // Add folder to its parent's subRows\n      parentRow.subRows.push(childRow)\n    }\n\n    // Sort subRows for expanded folders in a single pass\n    for (const folderId of expandedFolderIds) {\n      const row = rowsById.get(folderId)\n      if (!row || row.subRows.length <= 1) continue\n\n      // Process only folders that have both task rows and folder children\n      const hasTasksAndFolders =\n        row.subRows.some((r) => r.entityType === 'task') &&\n        row.subRows.some((r) => r.entityType === 'folder')\n\n      if (hasTasksAndFolders) {\n        // More efficient sort using type as primary key to reduce comparisons\n        row.subRows.sort((a, b) => {\n          // Type first (tasks before folders)\n          const typeA = a.entityType === 'task' ? 0 : 1\n          const typeB = b.entityType === 'task' ? 0 : 1\n\n          if (typeA !== typeB) return typeA - typeB\n\n          // Then by name using more efficient string comparison\n          if (a.name < b.name) return -1\n          if (a.name > b.name) return 1\n          return 0\n        })\n      }\n    }\n\n    // Add any extra rows to the root rows\n    for (const row of rows || []) {\n      rootRows.push(row)\n    }\n\n    // Sort root rows\n    if (rootRows.length > 1) {\n      rootRows.sort((a, b) => {\n        if (a.name < b.name) return -1\n        if (a.name > b.name) return 1\n        return 0\n      })\n    }\n\n    return rootRows\n  }, [\n    foldersMap,\n    tasksMap,\n    rows,\n    visibleFolders,\n    childToParentMap,\n    expandedFolderIds,\n    showHierarchy,\n    loadingTasks,\n    isLoadingMore,\n  ])\n}\n"],"names":[],"mappings":";;;AAUA,MAAM,6BAA6B;AAiBnC,SAAwB,iBAAiB;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,eAAe,CAAC;AAAA,EAChB,gBAAgB;AAClB,GAAuB;AACrB,QAAM,oBAAoB,qBAAqB,EAAE,aAAa;AAGxD,QAAA,cAAc,QAAQ,MAAM,KAAK,UAAU,QAAQ,GAAG,CAAC,QAAQ,CAAC;AAGhE,QAAA,oBAAoB,QAAQ,MAAM;AACtC,WAAO,IAAI;AAAA,MACT,OAAO,QAAQ,QAAQ,EACpB,OAAO,CAAC,CAAC,GAAG,UAAU,MAAM,UAAU,EACtC,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE;AAAA,IACrB;AAAA,EAAA,GACC,CAAC,WAAW,CAAC;AAGhB,QAAM,EAAE,kBAAkB,oBAAoB,IAAI,QAAQ,MAAM;AACxD,UAAA,oCAAoB,IAAoB;AACxC,UAAA,uCAAuB,IAAyB;AAG3C,eAAA,UAAU,WAAW,UAAU;AACpC,UAAA,EAAC,iCAAQ,IAAI;AAEjB,YAAM,WAAW,OAAO;AACxB,UAAI,UAAU;AACE,sBAAA,IAAI,OAAO,IAAI,QAAQ;AAEjC,YAAA,WAAW,iBAAiB,IAAI,QAAQ;AAC5C,YAAI,CAAC,UAAU;AACb,yCAAe,IAAY;AACV,2BAAA,IAAI,UAAU,QAAQ;AAAA,QAAA;AAEhC,iBAAA,IAAI,OAAO,EAAE;AAAA,MAAA;AAAA,IACxB;AAGF,WAAO,EAAE,kBAAkB,eAAe,qBAAqB,iBAAiB;AAAA,EAAA,GAC/E,CAAC,UAAU,CAAC;AAGT,QAAA,iBAAiB,QAAQ,MAAM;AAC7B,UAAA,8BAAc,IAAY;AAGhC,UAAM,QAAkB,CAAC;AACd,eAAA,UAAU,WAAW,UAAU;AACpC,UAAA,EAAC,iCAAQ,IAAI;AAGb,UAAA,CAAC,OAAO,YAAY,CAAC,WAAW,IAAI,OAAO,QAAQ,GAAG;AAChD,gBAAA,IAAI,OAAO,EAAE;AACf,cAAA,KAAK,OAAO,EAAE;AAAA,MAAA;AAAA,IACtB;AAIK,WAAA,MAAM,SAAS,GAAG;AACjB,YAAA,WAAW,MAAM,MAAM;AACvB,YAAA,mBAAmB,kBAAkB,IAAI,QAAQ;AAEvD,UAAI,CAAC,iBAAkB;AAGjB,YAAA,cAAc,oBAAoB,IAAI,QAAQ;AACpD,UAAI,aAAa;AACf,mBAAW,WAAW,aAAa;AACjC,cAAI,CAAC,QAAQ,IAAI,OAAO,GAAG;AACzB,oBAAQ,IAAI,OAAO;AACnB,kBAAM,KAAK,OAAO;AAAA,UAAA;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAGK,WAAA;AAAA,EACN,GAAA,CAAC,YAAY,qBAAqB,iBAAiB,CAAC;AAGvD,SAAO,QAAQ,MAAM;;AAEb,UAAA,gBAAgB,CAAC,MAAsB,aAAgC;AAC3E,YAAM,WAAW,kBAAkB,QAAQ,KAAK,QAAQ;AACjD,aAAA;AAAA,QACL,IAAI,KAAK;AAAA,QACT,YAAY;AAAA,QACZ,UAAU,YAAY,KAAK;AAAA,QAC3B,MAAM,KAAK,QAAQ;AAAA,QACnB,OAAO,KAAK,SAAS,KAAK,QAAQ;AAAA,QAClC,OAAM,qCAAU,SAAQ;AAAA,QACxB,QAAO,qCAAU,UAAS;AAAA,QAC1B,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,MAAM,KAAK;AAAA,QACX,KAAK;AAAA,QACL,SAAS,CAAC;AAAA,QACV,SAAS,KAAK,YAAY;AAAA,QAC1B,QAAQ,KAAK;AAAA,QACb,WAAW,KAAK;AAAA,QAChB,MAAM,KAAK,OAAO;AAAA,QAClB,WAAW,KAAK;AAAA,MAClB;AAAA,IACF;AAGA,QAAI,CAAC,eAAe;AAClB,YAAM,WAAuB,CAAC;AAGnB,iBAAA,QAAQ,SAAS,UAAU;AAChC,YAAA,CAAC,KAAK,GAAI;AACL,iBAAA,KAAK,cAAc,IAAI,CAAC;AAAA,MAAA;AAIxB,iBAAA,OAAO,QAAQ,IAAI;AAC5B,iBAAS,KAAK,GAAG;AAAA,MAAA;AAIf,UAAA,SAAS,SAAS,GAAG;AACd,iBAAA,KAAK,CAAC,GAAG,MAAM;AACtB,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,iBAAA;AAAA,QAAA,CACR;AAAA,MAAA;AAIH,UAAI,eAAe;AACX,cAAA,oBAAkB,0BAAS,UAAU,WAAnB,mBAA2B,UAA3B,mBAAmC,OAAnC,mBAAuC,WAAU,CAAC;AAC1E,cAAM,iBAAiB,OAAO,KAAK,eAAe,EAAE,IAAI,CAAC,SAAS;AAAA,UAChE,MAAM;AAAA,QAAA,EACN;AAEF,cAAM,QAAQ;AACC;AACP,gBAAA,kBAAkB,oBAAoB,gBAAgB,OAAO;AAAA,YACjE,MAAM;AAAA,UAAA,CACP;AAEQ,mBAAA,KAAK,GAAG,eAAe;AAAA,QAAA;AAAA,MAClC;AAGK,aAAA;AAAA,IAAA;AAIH,UAAA,+BAAe,IAAsB;AAC3C,UAAM,WAAuB,CAAC;AAG9B,eAAW,YAAY,gBAAgB;AAC/B,YAAA,SAAS,WAAW,IAAI,QAAQ;AACtC,UAAI,CAAC,OAAQ;AAGb,YAAM,MAAgB;AAAA,QACpB,IAAI;AAAA,QACJ,YAAY;AAAA,QACZ,UAAU,OAAO,YAAY;AAAA,QAC7B,MAAM,OAAO,QAAQ;AAAA,QACrB,OAAO,OAAO,SAAS,OAAO,QAAQ;AAAA,QACtC,QAAM,uBAAkB,UAAU,OAAO,UAAU,MAA7C,mBAAgD,SAAQ;AAAA,QAC9D,OAAO;AAAA,QACP,KAAK;AAAA,QACL,SAAS,CAAC;AAAA,QACV,QAAQ,OAAO;AAAA,QACf,MAAM,OAAO,QAAQ,CAAC;AAAA,QACtB,SAAS,OAAO,cAAc;AAAA,QAC9B,WAAW,OAAO,aAAa,CAAC;AAAA,QAChC,MAAM,OAAO;AAAA,QACb,QAAQ,OAAO,UAAU,CAAC;AAAA,QAC1B,gBAAgB,OAAO,kBAAkB;AAAA,QACzC,WAAW,OAAO;AAAA,MACpB;AAES,eAAA,IAAI,UAAU,GAAG;AAGtB,UAAA,CAAC,OAAO,YAAY,CAAC,WAAW,IAAI,OAAO,QAAQ,GAAG;AACxD,iBAAS,KAAK,GAAG;AAAA,MAAA;AAIf,UAAA,kBAAkB,IAAI,QAAQ,GAAG;AAGnC,cAAM,gBAAgB,iBAAiB,IAAI,QAAQ,KAAK,CAAC;AACnD,cAAA,cAAc,cAAc,QAAQ,CAAC,WAAW,SAAS,IAAI,MAAM,KAAK,EAAE;AAEhF,YAAI,YAAY,UAAU,aAAa,QAAQ,GAAG;AAEhD,gBAAM,WAAW,IAAI,MAAgB,YAAY,MAAM;AAGvD,mBAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,qBAAS,CAAC,IAAI,cAAc,YAAY,CAAC,GAAG,QAAQ;AAAA,UAAA;AAIlD,cAAA,aAAa,QAAQ,GAAG;AACpB,kBAAA,oBAAkB,0BAAS,UAAU,WAAnB,mBAA2B,UAA3B,mBAAmC,OAAnC,mBAAuC,WAAU,CAAC;AAC1E,kBAAM,iBAAiB,OAAO,KAAK,eAAe,EAAE,IAAI,CAAC,SAAS;AAAA,cAChE,MAAM;AAAA,YAAA,EACN;AACI,kBAAA,QAAQ,aAAa,QAAQ;AACnC,gBAAI,QAAQ,GAAG;AACP,oBAAA,kBAAkB,oBAAoB,gBAAgB,OAAO;AAAA,gBACjE,MAAM;AAAA,gBACN,UAAU;AAAA,cAAA,CACX;AAEQ,uBAAA,KAAK,GAAG,eAAe;AAAA,YAAA;AAAA,UAClC;AAGE,cAAA,SAAS,SAAS,GAAG;AAEd,qBAAA,KAAK,CAAC,GAAG,MAAM;AACtB,kBAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,kBAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,qBAAA;AAAA,YAAA,CACR;AAAA,UAAA;AAGH,cAAI,UAAU;AAAA,QAAA;AAAA,MAChB;AAAA,IACF;AAIF,eAAW,YAAY,gBAAgB;AAC/B,YAAA,WAAW,iBAAiB,IAAI,QAAQ;AAC9C,UAAI,CAAC,YAAY,CAAC,kBAAkB,IAAI,QAAQ,EAAG;AAE7C,YAAA,WAAW,SAAS,IAAI,QAAQ;AAChC,YAAA,YAAY,SAAS,IAAI,QAAQ;AAEnC,UAAA,CAAC,YAAY,CAAC,UAAW;AAGnB,gBAAA,QAAQ,KAAK,QAAQ;AAAA,IAAA;AAIjC,eAAW,YAAY,mBAAmB;AAClC,YAAA,MAAM,SAAS,IAAI,QAAQ;AACjC,UAAI,CAAC,OAAO,IAAI,QAAQ,UAAU,EAAG;AAGrC,YAAM,qBACJ,IAAI,QAAQ,KAAK,CAAC,MAAM,EAAE,eAAe,MAAM,KAC/C,IAAI,QAAQ,KAAK,CAAC,MAAM,EAAE,eAAe,QAAQ;AAEnD,UAAI,oBAAoB;AAEtB,YAAI,QAAQ,KAAK,CAAC,GAAG,MAAM;AAEzB,gBAAM,QAAQ,EAAE,eAAe,SAAS,IAAI;AAC5C,gBAAM,QAAQ,EAAE,eAAe,SAAS,IAAI;AAExC,cAAA,UAAU,MAAO,QAAO,QAAQ;AAGpC,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,cAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,iBAAA;AAAA,QAAA,CACR;AAAA,MAAA;AAAA,IACH;AAIS,eAAA,OAAO,QAAQ,IAAI;AAC5B,eAAS,KAAK,GAAG;AAAA,IAAA;AAIf,QAAA,SAAS,SAAS,GAAG;AACd,eAAA,KAAK,CAAC,GAAG,MAAM;AACtB,YAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AAC5B,YAAI,EAAE,OAAO,EAAE,KAAa,QAAA;AACrB,eAAA;AAAA,MAAA,CACR;AAAA,IAAA;AAGI,WAAA;AAAA,EAAA,GACN;AAAA,IACD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA,CACD;AACH;"}

package/dist/shared/src/containers/ProjectTreeTable/hooks/{useUpdateOverview.cjs.js → useUpdateTableData.cjs.js}

@@ -3,7 +3,7 @@ const reactToastify = require("react-toastify");
 const ProjectTableQueriesContext = require("../context/ProjectTableQueriesContext.cjs.js");
 const React = require("react");
 const ProjectTableContext = require("../context/ProjectTableContext.cjs.js");
-const useUpdateOverview = (props) => {
+const useUpdateTableData = (props) => {
   const { pushHistory } = props || {};
   const {
     getEntityById,
@@ -21,14 +21,16 @@ const useUpdateOverview = (props) => {
       }
       if (pushHistory && pushToHistory) {
         const inverseEntities = entities.map(
-          ({ id, type, field, isAttrib }) => {
+          ({ rowId, id, type, field, isAttrib, meta }) => {
             var _a2;
             const entityData = getEntityById(id);
+            const entityId = (entityData == null ? void 0 : entityData.entityId) || id;
             const oldValue = isAttrib ? ((_a2 = entityData.attrib) == null ? void 0 : _a2[field]) ?? null : entityData[field] ?? null;
             const ownAttrib = (entityData == null ? void 0 : entityData.ownAttrib) || [];
             const wasInherited = isAttrib && !ownAttrib.includes(field);
             return {
-              id,
+              rowId,
+              id: entityId,
               type,
               field,
               value: oldValue,
@@ -36,38 +38,48 @@ const useUpdateOverview = (props) => {
               wasInherited,
               // Track inheritance status for undo
               ownAttrib,
-              folderId: entityData == null ? void 0 : entityData.folderId
+              folderId: entityData == null ? void 0 : entityData.folderId,
+              meta
             };
           }
         );
         const historyEntities = entities.flatMap(
-          ({ id, type, field, value, isAttrib }) => {
+          ({ rowId, id, type, field, value, isAttrib, meta }) => {
             const entityData = getEntityById(id);
+            const entityId = (entityData == null ? void 0 : entityData.entityId) || id;
             if (!entityData) return [];
             return {
-              id,
+              rowId,
+              id: entityId,
               type,
               field,
               value,
               isAttrib,
               ownAttrib: (entityData == null ? void 0 : entityData.ownAttrib) || [],
-              folderId: "folderId" in entityData ? entityData.folderId : entityData == null ? void 0 : entityData.parentId
+              folderId: "folderId" in entityData ? entityData.folderId : entityData == null ? void 0 : entityData.parentId,
+              meta
             };
           }
         );
         pushHistory(inverseEntities, historyEntities);
       }
-      const supportedEntityTypes = ["task", "folder"];
+      const supportedEntityTypes = [
+        "task",
+        "folder",
+        "product",
+        "version"
+      ];
       let operations = [];
       for (const entity of entities) {
-        let { id, type, field, value, isAttrib } = entity;
+        let { id, type, field, value, isAttrib, meta } = entity;
+        const entityData = getEntityById(id);
+        const entityId = (entityData == null ? void 0 : entityData.entityId) || id;
         let entityType = type;
         if (!supportedEntityTypes.includes(entityType)) {
           continue;
         }
         const data = isAttrib ? { attrib: { [field]: value } } : { [field]: value };
         if (isAttrib) {
-          const entityData = getEntityById(id);
           const ownAttrib = [...(entityData == null ? void 0 : entityData.ownAttrib) || []];
           if (!ownAttrib.includes(field)) {
             ownAttrib.push(field);
@@ -75,7 +87,7 @@ const useUpdateOverview = (props) => {
           data.ownAttrib = ownAttrib;
         }
         const existingOperationIndex = operations.findIndex(
-          (op) => op.entityId === entity.id && op.entityType === entityType
+          (op) => op.entityId === entityId && op.entityType === entityType
         );
         if (existingOperationIndex !== -1) {
           const existingOperation = operations[existingOperationIndex];
@@ -89,10 +101,12 @@ const useUpdateOverview = (props) => {
           };
         } else {
           operations.push({
+            rowId: entity.rowId,
             entityType,
-            entityId: entity.id,
+            entityId,
             type: "update",
-            data
+            data,
+            meta
           });
         }
       }
@@ -118,10 +132,18 @@ const useUpdateOverview = (props) => {
           patchOperations: inheritedDependentsOperations
         });
       } catch (error) {
-        reactToastify.toast.error("Failed to update entities");
+        console.error("Error updating entities:", error);
+        reactToastify.toast.error("Failed to update entities: " + (error == null ? void 0 : error.error));
       }
     },
-    [projectName, updateEntities, getEntityById, getInheritedDependents, pushHistory]
+    [
+      projectName,
+      updateEntities,
+      //
+      getEntityById,
+      getInheritedDependents,
+      pushHistory
+    ]
   );
   const inheritFromParent = React.useCallback(
     async (entities, pushToHistory = true) => {
@@ -136,6 +158,7 @@ const useUpdateOverview = (props) => {
           for (const attrib of entity.attribs) {
             if ((entityData == null ? void 0 : entityData.attrib) && attrib in entityData.attrib) {
               undoEntities.push({
+                rowId: entity.rowId,
                 id: entity.entityId,
                 type: entity.entityType,
                 field: attrib,
@@ -144,13 +167,15 @@ const useUpdateOverview = (props) => {
                 wasInherited: false,
                 // Mark as not inherited
                 ownAttrib: (entityData == null ? void 0 : entityData.ownAttrib) || [],
-                folderId: entityData == null ? void 0 : entityData.folderId
+                folderId: entityData == null ? void 0 : entityData.folderId,
+                meta: entityData.meta
               });
             }
           }
         }
         const redoEntities = entities.flatMap(
           (entity) => entity.attribs.map((attrib) => ({
+            rowId: entity.rowId,
             id: entity.entityId,
             type: entity.entityType,
             field: attrib,
@@ -159,7 +184,8 @@ const useUpdateOverview = (props) => {
             wasInherited: true,
             // Mark as inherited
             ownAttrib: entity.ownAttrib,
-            folderId: entity.folderId
+            folderId: entity.folderId,
+            meta: entity.meta
           }))
         );
         if (undoEntities.length > 0) {
@@ -180,12 +206,14 @@ const useUpdateOverview = (props) => {
           attribData[attrib] = null;
         });
         operations.push({
+          rowId: entity.rowId,
           entityType,
           entityId: entity.entityId,
           type: "update",
           data: {
             attrib: attribData
-          }
+          },
+          meta: entity.meta
         });
         const findTopFolder = () => {
           const folderId = entity.folderId;
@@ -291,5 +319,5 @@ const useUpdateOverview = (props) => {
   );
   return { updateEntities: handleUpdateEntities, inheritFromParent };
 };
-module.exports = useUpdateOverview;
-//# sourceMappingURL=useUpdateOverview.cjs.js.map
+module.exports = useUpdateTableData;
+//# sourceMappingURL=useUpdateTableData.cjs.js.map