@ynput/ayon-frontend-shared 0.4.2 → 0.4.4

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

@@ -1 +1 @@
-{"version":3,"file":"useBuildProjectDataTable.cjs.js","sources":["../../../../../../src/containers/ProjectTreeTable/hooks/useBuildProjectDataTable.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 { useGetEntityTypeData } from './useGetEntityTypeData'\nimport { TableGroupBy } from '../context'\nimport { linksToTableData } from '../utils'\nimport { useProjectContext } from '@shared/context/ProjectContext'\n\ntype Params = {\n  foldersMap: FolderNodeMap\n  tasksMap: TaskNodeMap\n  tasksByFolderMap: TasksByFolderMap\n  rows?: TableRow[]\n  expanded: ExpandedState\n  showHierarchy: boolean\n  isFlatFolderView?: boolean\n  showEmptyFolders?: boolean\n  loadingTasks?: LoadingTasks\n  isLoadingMore?: boolean\n  groupBy?: TableGroupBy\n  selectedFolders?: string[]\n}\n\nexport default function useBuildProjectDataTable({\n  foldersMap,\n  tasksMap,\n  rows,\n  tasksByFolderMap,\n  expanded,\n  showHierarchy,\n  isFlatFolderView = false,\n  showEmptyFolders = false,\n  loadingTasks = {},\n  isLoadingMore = false,\n  selectedFolders = [],\n}: Params): TableRow[] {\n  const project = useProjectContext()\n  const getEntityTypeData = useGetEntityTypeData({ projectInfo: project })\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\n      const links = linksToTableData(task.links, 'task', project.anatomy)\n\n      return {\n        id: task.id,\n        entityType: 'task',\n        parentId: parentId || task.folderId,\n        folderId: 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        midnightExclusiveFields: task.data?.schedulerSyncData?.allDay\n          ? ['attrib_endDate']\n          : undefined,\n        ownAttrib: task.ownAttrib,\n        parents: task.parents || [],\n        path: task.parents.join('/') || null, // todo: probably remove this and just use parents\n        folder: task.parents[task.parents.length - 1] || undefined,\n        updatedAt: task.updatedAt,\n        createdAt: task.createdAt,\n        thumbnailHash: task.thumbnailHash,\n        hasReviewables: task.hasReviewables || false,\n        links: links,\n        subtasks: task.subtasks || [],\n        latestComments: task.latestComments || [],\n      }\n    }\n\n    const createRootTaskRows = (): TableRow[] => {\n      const rootTaskRows: TableRow[] = []\n      for (const folderId of selectedFolders) {\n        if (foldersMap.has(folderId)) continue\n        const folderTaskIds = tasksByFolderMap.get(folderId) || []\n        for (const taskId of folderTaskIds) {\n          const task = tasksMap.get(taskId)\n          if (task) rootTaskRows.push(createTaskRow(task))\n        }\n      }\n      return rootTaskRows\n    }\n\n    // Flat folder view: all folders at root level, each expandable to show tasks\n    if (isFlatFolderView) {\n      const flatFolderRows: TableRow[] = []\n\n      for (const folder of foldersMap.values()) {\n        if (!folder?.id) continue\n\n        // Use the folder's hasTasks flag (from REST data) to filter before tasks are loaded\n        const hasTasks = folder.hasTasks ?? tasksByFolderMap.has(folder.id)\n        // Skip folders without tasks when showEmptyFolders is off\n        if (!showEmptyFolders && !hasTasks) continue\n\n        const folderTypeData = getEntityTypeData('folder', folder.folderType)\n        const links = linksToTableData(folder.links, 'folder', project.anatomy)\n\n        const row: TableRow = {\n          id: folder.id,\n          entityType: 'folder',\n          parentId: undefined, // flat — no parent nesting\n          folderId: folder.id,\n          name: folder.name || '',\n          label: folder.label || folder.name || '',\n          icon: folderTypeData?.icon || null,\n          color: folderTypeData?.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          folder: folder.parents[folder.parents.length - 1] || undefined,\n          attrib: folder.attrib || {},\n          childOnlyMatch: folder.childOnlyMatch || false,\n          updatedAt: folder.updatedAt,\n          createdAt: folder.createdAt,\n          thumbnailHash: folder.thumbnailHash,\n          hasReviewables: folder.hasReviewables || false,\n          hasVersions: folder.hasVersions || false,\n          links: links,\n        }\n\n        // If folder is expanded, attach task subRows\n        if (expandedFolderIds.has(folder.id)) {\n          const folderTaskIds = tasksByFolderMap.get(folder.id) || []\n          const folderTasks = folderTaskIds.flatMap((taskId) => tasksMap.get(taskId) || [])\n\n          if (folderTasks.length || loadingTasks[folder.id]) {\n            const taskRows = folderTasks.map((task) => createTaskRow(task, folder.id))\n\n            if (loadingTasks[folder.id]) {\n              const count = loadingTasks[folder.id]\n              if (count > 0) {\n                taskRows.push(...generateLoadingRows(count, { parentId: folder.id }))\n              }\n            }\n\n            row.subRows = taskRows\n          }\n        }\n\n        flatFolderRows.push(row)\n      }\n\n      flatFolderRows.push(...createRootTaskRows())\n\n      return flatFolderRows\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      // if we are loading more tasks, add loading rows\n      if (isLoadingMore) {\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(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      const links = linksToTableData(folder.links, 'folder', project.anatomy)\n\n      const folderTypeData = getEntityTypeData('folder', folder.folderType)\n\n      // Create row with minimal required properties\n      const row: TableRow = {\n        id: folderId,\n        entityType: 'folder',\n        parentId: folder.parentId || undefined,\n        folderId: folderId || null, // root folders have no folderId\n        name: folder.name || '',\n        label: folder.label || folder.name || '',\n        icon: folderTypeData?.icon || null,\n        color: folderTypeData?.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        folder: folder.parents[folder.parents.length - 1] || undefined,\n        attrib: folder.attrib || {},\n        childOnlyMatch: folder.childOnlyMatch || false,\n        updatedAt: folder.updatedAt,\n        createdAt: folder.createdAt,\n        thumbnailHash: folder.thumbnailHash,\n        hasReviewables: folder.hasReviewables || false,\n        hasVersions: folder.hasVersions || false,\n        links: links,\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 count = loadingTasks[folderId]\n            if (count > 0) {\n              const loadingTaskRows = generateLoadingRows(count, { parentId: folderId })\n\n              taskRows.push(...loadingTaskRows)\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    rootRows.push(...createRootTaskRows())\n\n    // if we are loading more tasks, add loading rows at the root level\n    // this happens when in hierarchy mode but with a slicer selection that causes paginated tasks\n    if (showHierarchy && isLoadingMore) {\n      const count = TASKS_INFINITE_QUERY_COUNT\n      if (count > 0) {\n        rootRows.push(...generateLoadingRows(count, { type: 'task' }))\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    return rootRows\n  }, [\n    foldersMap,\n    tasksMap,\n    tasksByFolderMap,\n    rows,\n    visibleFolders,\n    childToParentMap,\n    expandedFolderIds,\n    showHierarchy,\n    isFlatFolderView,\n    showEmptyFolders,\n    loadingTasks,\n    isLoadingMore,\n    selectedFolders,\n  ])\n}\n"],"names":["TASKS_INFINITE_QUERY_COUNT","useBuildProjectDataTable","foldersMap","tasksMap","rows","tasksByFolderMap","expanded","showHierarchy","isFlatFolderView","showEmptyFolders","loadingTasks","isLoadingMore","selectedFolders","project","useProjectContext","getEntityTypeData","useGetEntityTypeData","expandedKey","useMemo","expandedFolderIds","_","isExpanded","id","childToParentMap","parentToChildrenMap","childToParent","parentToChildren","folder","parentId","children","visibleFolders","visible","queue","folderId","childrenIds","childId","createTaskRow","task","typeData","links","linksToTableData","createRootTaskRows","rootTaskRows","folderTaskIds","taskId","flatFolderRows","hasTasks","folderTypeData","row","folderTasks","taskRows","count","generateLoadingRows","flatRows","loadingTaskRows","rowsById","rootRows","i","childRow","parentRow"],"mappings":"mhOAUMA,EAA6B,IAsBnC,SAAwBC,EAAyB,CAC/C,WAAAC,EACA,SAAAC,EACA,KAAAC,EACA,iBAAAC,EACA,SAAAC,EACA,cAAAC,EACA,iBAAAC,EAAmB,GACnB,iBAAAC,EAAmB,GACnB,aAAAC,EAAe,CAAA,EACf,cAAAC,EAAgB,GAChB,gBAAAC,EAAkB,CAAA,CACpB,EAAuB,CACrB,MAAMC,EAAUC,EAAAA,kBAAA,EACVC,EAAoBC,EAAAA,qBAAqB,CAAE,YAAaH,EAAS,EAGjEI,EAAcC,EAAAA,QAAQ,IAAM,KAAK,UAAUZ,CAAQ,EAAG,CAACA,CAAQ,CAAC,EAGhEa,EAAoBD,EAAAA,QAAQ,IACzB,IAAI,IACT,OAAO,QAAQZ,CAAQ,EACpB,OAAO,CAAC,CAACc,EAAGC,CAAU,IAAMA,CAAU,EACtC,IAAI,CAAC,CAACC,CAAE,IAAMA,CAAE,CAAA,EAEpB,CAACL,CAAW,CAAC,EAGV,CAAE,iBAAAM,EAAkB,oBAAAC,CAAA,EAAwBN,EAAAA,QAAQ,IAAM,CAC9D,MAAMO,MAAoB,IACpBC,MAAuB,IAG7B,UAAWC,KAAUzB,EAAW,SAAU,CACxC,GAAI,CAACyB,GAAQ,GAAI,SAEjB,MAAMC,EAAWD,EAAO,SACxB,GAAIC,EAAU,CACZH,EAAc,IAAIE,EAAO,GAAIC,CAAQ,EAErC,IAAIC,EAAWH,EAAiB,IAAIE,CAAQ,EACvCC,IACHA,MAAe,IACfH,EAAiB,IAAIE,EAAUC,CAAQ,GAEzCA,EAAS,IAAIF,EAAO,EAAE,CACxB,CACF,CAEA,MAAO,CAAE,iBAAkBF,EAAe,oBAAqBC,CAAA,CACjE,EAAG,CAACxB,CAAU,CAAC,EAGT4B,EAAiBZ,EAAAA,QAAQ,IAAM,CACnC,MAAMa,MAAc,IAGdC,EAAkB,CAAA,EACxB,UAAWL,KAAUzB,EAAW,SACzByB,GAAQ,KAGT,CAACA,EAAO,UAAY,CAACzB,EAAW,IAAIyB,EAAO,QAAQ,KACrDI,EAAQ,IAAIJ,EAAO,EAAE,EACrBK,EAAM,KAAKL,EAAO,EAAE,GAKxB,KAAOK,EAAM,OAAS,GAAG,CACvB,MAAMC,EAAWD,EAAM,MAAA,EAGvB,GAAI,CAFqBb,EAAkB,IAAIc,CAAQ,EAEhC,SAGvB,MAAMC,EAAcV,EAAoB,IAAIS,CAAQ,EACpD,GAAIC,EACF,UAAWC,KAAWD,EACfH,EAAQ,IAAII,CAAO,IACtBJ,EAAQ,IAAII,CAAO,EACnBH,EAAM,KAAKG,CAAO,EAI1B,CAEA,OAAOJ,CACT,EAAG,CAAC7B,EAAYsB,EAAqBL,CAAiB,CAAC,EAGvD,OAAOD,EAAAA,QAAQ,IAAM,CAEnB,MAAMkB,EAAgB,CAACC,EAAsBT,IAAgC,CAC3E,MAAMU,EAAWvB,EAAkB,OAAQsB,EAAK,QAAQ,EAElDE,EAAQC,EAAAA,iBAAiBH,EAAK,MAAO,OAAQxB,EAAQ,OAAO,EAElE,MAAO,CACL,GAAIwB,EAAK,GACT,WAAY,OACZ,SAAUT,GAAYS,EAAK,SAC3B,SAAUA,EAAK,SACf,KAAMA,EAAK,MAAQ,GACnB,MAAOA,EAAK,OAASA,EAAK,MAAQ,GAClC,KAAMC,GAAU,MAAQ,KACxB,MAAOA,GAAU,OAAS,KAC1B,OAAQD,EAAK,OACb,UAAWA,EAAK,UAChB,KAAMA,EAAK,KACX,IAAK,KACL,QAAS,CAAA,EACT,QAASA,EAAK,UAAY,KAC1B,OAAQA,EAAK,OACb,wBAAyBA,EAAK,MAAM,mBAAmB,OACnD,CAAC,gBAAgB,EACjB,OACJ,UAAWA,EAAK,UAChB,QAASA,EAAK,SAAW,CAAA,EACzB,KAAMA,EAAK,QAAQ,KAAK,GAAG,GAAK,KAChC,OAAQA,EAAK,QAAQA,EAAK,QAAQ,OAAS,CAAC,GAAK,OACjD,UAAWA,EAAK,UAChB,UAAWA,EAAK,UAChB,cAAeA,EAAK,cACpB,eAAgBA,EAAK,gBAAkB,GACvC,MAAAE,EACA,SAAUF,EAAK,UAAY,CAAA,EAC3B,eAAgBA,EAAK,gBAAkB,CAAA,CAAC,CAE5C,EAEMI,EAAqB,IAAkB,CAC3C,MAAMC,EAA2B,CAAA,EACjC,UAAWT,KAAYrB,EAAiB,CACtC,GAAIV,EAAW,IAAI+B,CAAQ,EAAG,SAC9B,MAAMU,EAAgBtC,EAAiB,IAAI4B,CAAQ,GAAK,CAAA,EACxD,UAAWW,KAAUD,EAAe,CAClC,MAAMN,EAAOlC,EAAS,IAAIyC,CAAM,EAC5BP,GAAMK,EAAa,KAAKN,EAAcC,CAAI,CAAC,CACjD,CACF,CACA,OAAOK,CACT,EAGA,GAAIlC,EAAkB,CACpB,MAAMqC,EAA6B,CAAA,EAEnC,UAAWlB,KAAUzB,EAAW,SAAU,CACxC,GAAI,CAACyB,GAAQ,GAAI,SAGjB,MAAMmB,EAAWnB,EAAO,UAAYtB,EAAiB,IAAIsB,EAAO,EAAE,EAElE,GAAI,CAAClB,GAAoB,CAACqC,EAAU,SAEpC,MAAMC,EAAiBhC,EAAkB,SAAUY,EAAO,UAAU,EAC9DY,EAAQC,EAAAA,iBAAiBb,EAAO,MAAO,SAAUd,EAAQ,OAAO,EAEhEmC,EAAgB,CACpB,GAAIrB,EAAO,GACX,WAAY,SACZ,SAAU,OACV,SAAUA,EAAO,GACjB,KAAMA,EAAO,MAAQ,GACrB,MAAOA,EAAO,OAASA,EAAO,MAAQ,GACtC,KAAMoB,GAAgB,MAAQ,KAC9B,MAAOA,GAAgB,OAAS,KAChC,IAAK,KACL,QAAS,CAAA,EACT,OAAQpB,EAAO,OACf,KAAMA,EAAO,MAAQ,CAAA,EACrB,QAASA,EAAO,YAAc,KAC9B,UAAWA,EAAO,WAAa,CAAA,EAC/B,KAAMA,EAAO,KACb,OAAQA,EAAO,QAAQA,EAAO,QAAQ,OAAS,CAAC,GAAK,OACrD,OAAQA,EAAO,QAAU,CAAA,EACzB,eAAgBA,EAAO,gBAAkB,GACzC,UAAWA,EAAO,UAClB,UAAWA,EAAO,UAClB,cAAeA,EAAO,cACtB,eAAgBA,EAAO,gBAAkB,GACzC,YAAaA,EAAO,aAAe,GACnC,MAAAY,CAAA,EAIF,GAAIpB,EAAkB,IAAIQ,EAAO,EAAE,EAAG,CAEpC,MAAMsB,GADgB5C,EAAiB,IAAIsB,EAAO,EAAE,GAAK,CAAA,GACvB,QAASiB,GAAWzC,EAAS,IAAIyC,CAAM,GAAK,EAAE,EAEhF,GAAIK,EAAY,QAAUvC,EAAaiB,EAAO,EAAE,EAAG,CACjD,MAAMuB,EAAWD,EAAY,IAAKZ,GAASD,EAAcC,EAAMV,EAAO,EAAE,CAAC,EAEzE,GAAIjB,EAAaiB,EAAO,EAAE,EAAG,CAC3B,MAAMwB,EAAQzC,EAAaiB,EAAO,EAAE,EAChCwB,EAAQ,GACVD,EAAS,KAAK,GAAGE,sBAAoBD,EAAO,CAAE,SAAUxB,EAAO,EAAA,CAAI,CAAC,CAExE,CAEAqB,EAAI,QAAUE,CAChB,CACF,CAEAL,EAAe,KAAKG,CAAG,CACzB,CAEA,OAAAH,EAAe,KAAK,GAAGJ,GAAoB,EAEpCI,CACT,CAGA,GAAI,CAACtC,EAAe,CAClB,MAAM8C,EAAuB,CAAA,EAG7B,UAAWhB,KAAQlC,EAAS,SACrBkC,EAAK,IACVgB,EAAS,KAAKjB,EAAcC,CAAI,CAAC,EAInC,UAAWW,KAAO5C,GAAQ,GACxBiD,EAAS,KAAKL,CAAG,EAInB,GAAIrC,EAAe,CAEjB,MAAMwC,EAAQnD,EACC,CACb,MAAMsD,EAAkBF,EAAAA,oBAAoBD,EAAO,CACjD,KAAM,MAAA,CACP,EAEDE,EAAS,KAAK,GAAGC,CAAe,CAClC,CACF,CAEA,OAAOD,CACT,CAGA,MAAME,MAAe,IACfC,EAAuB,CAAA,EAG7B,UAAWvB,KAAYH,EAAgB,CACrC,MAAMH,EAASzB,EAAW,IAAI+B,CAAQ,EACtC,GAAI,CAACN,EAAQ,SAEb,MAAMY,EAAQC,EAAAA,iBAAiBb,EAAO,MAAO,SAAUd,EAAQ,OAAO,EAEhEkC,EAAiBhC,EAAkB,SAAUY,EAAO,UAAU,EAG9DqB,EAAgB,CACpB,GAAIf,EACJ,WAAY,SACZ,SAAUN,EAAO,UAAY,OAC7B,SAAUM,GAAY,KACtB,KAAMN,EAAO,MAAQ,GACrB,MAAOA,EAAO,OAASA,EAAO,MAAQ,GACtC,KAAMoB,GAAgB,MAAQ,KAC9B,MAAOA,GAAgB,OAAS,KAChC,IAAK,KACL,QAAS,CAAA,EACT,OAAQpB,EAAO,OACf,KAAMA,EAAO,MAAQ,CAAA,EACrB,QAASA,EAAO,YAAc,KAC9B,UAAWA,EAAO,WAAa,CAAA,EAC/B,KAAMA,EAAO,KACb,OAAQA,EAAO,QAAQA,EAAO,QAAQ,OAAS,CAAC,GAAK,OACrD,OAAQA,EAAO,QAAU,CAAA,EACzB,eAAgBA,EAAO,gBAAkB,GACzC,UAAWA,EAAO,UAClB,UAAWA,EAAO,UAClB,cAAeA,EAAO,cACtB,eAAgBA,EAAO,gBAAkB,GACzC,YAAaA,EAAO,aAAe,GACnC,MAAAY,CAAA,EAWF,GARAgB,EAAS,IAAItB,EAAUe,CAAG,GAGtB,CAACrB,EAAO,UAAY,CAACzB,EAAW,IAAIyB,EAAO,QAAQ,IACrD6B,EAAS,KAAKR,CAAG,EAIf7B,EAAkB,IAAIc,CAAQ,EAAG,CAInC,MAAMgB,GADgB5C,EAAiB,IAAI4B,CAAQ,GAAK,CAAA,GACtB,QAASW,GAAWzC,EAAS,IAAIyC,CAAM,GAAK,EAAE,EAEhF,GAAIK,EAAY,QAAUvC,EAAauB,CAAQ,EAAG,CAEhD,MAAMiB,EAAW,IAAI,MAAgBD,EAAY,MAAM,EAGvD,QAASQ,EAAI,EAAGA,EAAIR,EAAY,OAAQQ,IACtCP,EAASO,CAAC,EAAIrB,EAAca,EAAYQ,CAAC,EAAGxB,CAAQ,EAItD,GAAIvB,EAAauB,CAAQ,EAAG,CAC1B,MAAMkB,EAAQzC,EAAauB,CAAQ,EACnC,GAAIkB,EAAQ,EAAG,CACb,MAAMG,EAAkBF,EAAAA,oBAAoBD,EAAO,CAAE,SAAUlB,EAAU,EAEzEiB,EAAS,KAAK,GAAGI,CAAe,CAClC,CACF,CAEAN,EAAI,QAAUE,CAChB,CACF,CACF,CAGA,UAAWjB,KAAYH,EAAgB,CACrC,MAAMF,EAAWL,EAAiB,IAAIU,CAAQ,EAC9C,GAAI,CAACL,GAAY,CAACT,EAAkB,IAAIS,CAAQ,EAAG,SAEnD,MAAM8B,EAAWH,EAAS,IAAItB,CAAQ,EAChC0B,EAAYJ,EAAS,IAAI3B,CAAQ,EAEnC,CAAC8B,GAAY,CAACC,GAGlBA,EAAU,SAAS,KAAKD,CAAQ,CAClC,CAMA,GAJAF,EAAS,KAAK,GAAGf,GAAoB,EAIjClC,GAAiBI,EAAe,CAClC,MAAMwC,EAAQnD,EAEZwD,EAAS,KAAK,GAAGJ,EAAAA,oBAAoBD,EAAO,CAAE,KAAM,MAAA,CAAQ,CAAC,CAEjE,CAGA,UAAWH,KAAO5C,GAAQ,GACxBoD,EAAS,KAAKR,CAAG,EAGnB,OAAOQ,CACT,EAAG,CACDtD,EACAC,EACAE,EACAD,EACA0B,EACAP,EACAJ,EACAZ,EACAC,EACAC,EACAC,EACAC,EACAC,CAAA,CACD,CACH"}
+{"version":3,"file":"useBuildProjectDataTable.cjs.js","sources":["../../../../../../src/containers/ProjectTreeTable/hooks/useBuildProjectDataTable.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 { useGetEntityTypeData } from './useGetEntityTypeData'\nimport { TableGroupBy } from '../context'\nimport { buildFolderTableRow, buildTaskTableRow, linksToTableData } from '../utils'\nimport { useProjectContext } from '@shared/context/ProjectContext'\n\ntype Params = {\n  foldersMap: FolderNodeMap\n  tasksMap: TaskNodeMap\n  tasksByFolderMap: TasksByFolderMap\n  rows?: TableRow[]\n  expanded: ExpandedState\n  showHierarchy: boolean\n  isFlatFolderView?: boolean\n  showEmptyFolders?: boolean\n  loadingTasks?: LoadingTasks\n  isLoadingMore?: boolean\n  groupBy?: TableGroupBy\n  selectedFolders?: string[]\n}\n\nexport default function useBuildProjectDataTable({\n  foldersMap,\n  tasksMap,\n  rows,\n  tasksByFolderMap,\n  expanded,\n  showHierarchy,\n  isFlatFolderView = false,\n  showEmptyFolders = false,\n  loadingTasks = {},\n  isLoadingMore = false,\n  selectedFolders = [],\n}: Params): TableRow[] {\n  const project = useProjectContext()\n  const getEntityTypeData = useGetEntityTypeData({ projectInfo: project })\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      const row = buildTaskTableRow(task, foldersMap.get(parentId || task.folderId))\n      row.primary.icon = typeData?.icon || null\n      row.primary.color = typeData?.color || null\n      row.primary.links = linksToTableData(task.links, 'task', project.anatomy)\n      row.subRows = []\n      return row\n    }\n\n    const createFolderRow = (\n      folder: typeof foldersMap extends Map<string, infer T> ? T : never,\n    ) => {\n      const typeData = getEntityTypeData('folder', folder.folderType)\n      const row = buildFolderTableRow(folder)\n      row.primary.icon = typeData?.icon || null\n      row.primary.color = typeData?.color || null\n      row.primary.links = linksToTableData(folder.links, 'folder', project.anatomy)\n      row.subRows = []\n      return row\n    }\n\n    const createRootTaskRows = (): TableRow[] => {\n      const rootTaskRows: TableRow[] = []\n      for (const folderId of selectedFolders) {\n        if (foldersMap.has(folderId)) continue\n        const folderTaskIds = tasksByFolderMap.get(folderId) || []\n        for (const taskId of folderTaskIds) {\n          const task = tasksMap.get(taskId)\n          if (task) rootTaskRows.push(createTaskRow(task))\n        }\n      }\n      return rootTaskRows\n    }\n\n    // Flat folder view: all folders at root level, each expandable to show tasks\n    if (isFlatFolderView) {\n      const flatFolderRows: TableRow[] = []\n\n      for (const folder of foldersMap.values()) {\n        if (!folder?.id) continue\n\n        // Use the folder's hasTasks flag (from REST data) to filter before tasks are loaded\n        const hasTasks = folder.hasTasks ?? tasksByFolderMap.has(folder.id)\n        // Skip folders without tasks when showEmptyFolders is off\n        if (!showEmptyFolders && !hasTasks) continue\n\n        const row = createFolderRow(folder)\n        row.childOnlyMatch = folder.childOnlyMatch || false\n\n        // If folder is expanded, attach task subRows\n        if (expandedFolderIds.has(folder.id)) {\n          const folderTaskIds = tasksByFolderMap.get(folder.id) || []\n          const folderTasks = folderTaskIds.flatMap((taskId) => tasksMap.get(taskId) || [])\n\n          if (folderTasks.length || loadingTasks[folder.id]) {\n            const taskRows = folderTasks.map((task) => createTaskRow(task, folder.id))\n\n            if (loadingTasks[folder.id]) {\n              const count = loadingTasks[folder.id]\n              if (count > 0) {\n                taskRows.push(...generateLoadingRows(count))\n              }\n            }\n\n            row.subRows = taskRows\n          }\n        }\n\n        flatFolderRows.push(row)\n      }\n\n      flatFolderRows.push(...createRootTaskRows())\n\n      return flatFolderRows\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      // if we are loading more tasks, add loading rows\n      if (isLoadingMore) {\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(count)\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      const row = createFolderRow(folder)\n      row.childOnlyMatch = folder.childOnlyMatch || false\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 count = loadingTasks[folderId]\n            if (count > 0) {\n              const loadingTaskRows = generateLoadingRows(count)\n\n              taskRows.push(...loadingTaskRows)\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    rootRows.push(...createRootTaskRows())\n\n    // if we are loading more tasks, add loading rows at the root level\n    // this happens when in hierarchy mode but with a slicer selection that causes paginated tasks\n    if (showHierarchy && isLoadingMore) {\n      const count = TASKS_INFINITE_QUERY_COUNT\n      if (count > 0) {\n        rootRows.push(...generateLoadingRows(count))\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    return rootRows\n  }, [\n    foldersMap,\n    tasksMap,\n    tasksByFolderMap,\n    rows,\n    visibleFolders,\n    childToParentMap,\n    expandedFolderIds,\n    showHierarchy,\n    isFlatFolderView,\n    showEmptyFolders,\n    loadingTasks,\n    isLoadingMore,\n    selectedFolders,\n  ])\n}\n"],"names":["TASKS_INFINITE_QUERY_COUNT","useBuildProjectDataTable","foldersMap","tasksMap","rows","tasksByFolderMap","expanded","showHierarchy","isFlatFolderView","showEmptyFolders","loadingTasks","isLoadingMore","selectedFolders","project","useProjectContext","getEntityTypeData","useGetEntityTypeData","expandedKey","useMemo","expandedFolderIds","_","isExpanded","id","childToParentMap","parentToChildrenMap","childToParent","parentToChildren","folder","parentId","children","visibleFolders","visible","queue","folderId","childrenIds","childId","createTaskRow","task","typeData","row","buildTaskTableRow","linksToTableData","createFolderRow","buildFolderTableRow","createRootTaskRows","rootTaskRows","folderTaskIds","taskId","flatFolderRows","hasTasks","folderTasks","taskRows","count","generateLoadingRows","flatRows","loadingTaskRows","rowsById","rootRows","i","childRow","parentRow"],"mappings":"krPAUMA,EAA6B,IAsBnC,SAAwBC,EAAyB,CAC/C,WAAAC,EACA,SAAAC,EACA,KAAAC,EACA,iBAAAC,EACA,SAAAC,EACA,cAAAC,EACA,iBAAAC,EAAmB,GACnB,iBAAAC,EAAmB,GACnB,aAAAC,EAAe,CAAA,EACf,cAAAC,EAAgB,GAChB,gBAAAC,EAAkB,CAAA,CACpB,EAAuB,CACrB,MAAMC,EAAUC,EAAAA,kBAAA,EACVC,EAAoBC,EAAAA,qBAAqB,CAAE,YAAaH,EAAS,EAGjEI,EAAcC,EAAAA,QAAQ,IAAM,KAAK,UAAUZ,CAAQ,EAAG,CAACA,CAAQ,CAAC,EAGhEa,EAAoBD,EAAAA,QAAQ,IACzB,IAAI,IACT,OAAO,QAAQZ,CAAQ,EACpB,OAAO,CAAC,CAACc,EAAGC,CAAU,IAAMA,CAAU,EACtC,IAAI,CAAC,CAACC,CAAE,IAAMA,CAAE,CAAA,EAEpB,CAACL,CAAW,CAAC,EAGV,CAAE,iBAAAM,EAAkB,oBAAAC,CAAA,EAAwBN,EAAAA,QAAQ,IAAM,CAC9D,MAAMO,MAAoB,IACpBC,MAAuB,IAG7B,UAAWC,KAAUzB,EAAW,SAAU,CACxC,GAAI,CAACyB,GAAQ,GAAI,SAEjB,MAAMC,EAAWD,EAAO,SACxB,GAAIC,EAAU,CACZH,EAAc,IAAIE,EAAO,GAAIC,CAAQ,EAErC,IAAIC,EAAWH,EAAiB,IAAIE,CAAQ,EACvCC,IACHA,MAAe,IACfH,EAAiB,IAAIE,EAAUC,CAAQ,GAEzCA,EAAS,IAAIF,EAAO,EAAE,CACxB,CACF,CAEA,MAAO,CAAE,iBAAkBF,EAAe,oBAAqBC,CAAA,CACjE,EAAG,CAACxB,CAAU,CAAC,EAGT4B,EAAiBZ,EAAAA,QAAQ,IAAM,CACnC,MAAMa,MAAc,IAGdC,EAAkB,CAAA,EACxB,UAAWL,KAAUzB,EAAW,SACzByB,GAAQ,KAGT,CAACA,EAAO,UAAY,CAACzB,EAAW,IAAIyB,EAAO,QAAQ,KACrDI,EAAQ,IAAIJ,EAAO,EAAE,EACrBK,EAAM,KAAKL,EAAO,EAAE,GAKxB,KAAOK,EAAM,OAAS,GAAG,CACvB,MAAMC,EAAWD,EAAM,MAAA,EAGvB,GAAI,CAFqBb,EAAkB,IAAIc,CAAQ,EAEhC,SAGvB,MAAMC,EAAcV,EAAoB,IAAIS,CAAQ,EACpD,GAAIC,EACF,UAAWC,KAAWD,EACfH,EAAQ,IAAII,CAAO,IACtBJ,EAAQ,IAAII,CAAO,EACnBH,EAAM,KAAKG,CAAO,EAI1B,CAEA,OAAOJ,CACT,EAAG,CAAC7B,EAAYsB,EAAqBL,CAAiB,CAAC,EAGvD,OAAOD,EAAAA,QAAQ,IAAM,CAEnB,MAAMkB,EAAgB,CAACC,EAAsBT,IAAgC,CAC3E,MAAMU,EAAWvB,EAAkB,OAAQsB,EAAK,QAAQ,EAClDE,EAAMC,EAAAA,kBAAkBH,EAAMnC,EAAW,IAAI0B,GAAYS,EAAK,QAAQ,CAAC,EAC7E,OAAAE,EAAI,QAAQ,KAAOD,GAAU,MAAQ,KACrCC,EAAI,QAAQ,MAAQD,GAAU,OAAS,KACvCC,EAAI,QAAQ,MAAQE,EAAAA,iBAAiBJ,EAAK,MAAO,OAAQxB,EAAQ,OAAO,EACxE0B,EAAI,QAAU,CAAA,EACPA,CACT,EAEMG,EACJf,GACG,CACH,MAAMW,EAAWvB,EAAkB,SAAUY,EAAO,UAAU,EACxDY,EAAMI,EAAAA,oBAAoBhB,CAAM,EACtC,OAAAY,EAAI,QAAQ,KAAOD,GAAU,MAAQ,KACrCC,EAAI,QAAQ,MAAQD,GAAU,OAAS,KACvCC,EAAI,QAAQ,MAAQE,EAAAA,iBAAiBd,EAAO,MAAO,SAAUd,EAAQ,OAAO,EAC5E0B,EAAI,QAAU,CAAA,EACPA,CACT,EAEMK,EAAqB,IAAkB,CAC3C,MAAMC,EAA2B,CAAA,EACjC,UAAWZ,KAAYrB,EAAiB,CACtC,GAAIV,EAAW,IAAI+B,CAAQ,EAAG,SAC9B,MAAMa,EAAgBzC,EAAiB,IAAI4B,CAAQ,GAAK,CAAA,EACxD,UAAWc,KAAUD,EAAe,CAClC,MAAMT,EAAOlC,EAAS,IAAI4C,CAAM,EAC5BV,GAAMQ,EAAa,KAAKT,EAAcC,CAAI,CAAC,CACjD,CACF,CACA,OAAOQ,CACT,EAGA,GAAIrC,EAAkB,CACpB,MAAMwC,EAA6B,CAAA,EAEnC,UAAWrB,KAAUzB,EAAW,SAAU,CACxC,GAAI,CAACyB,GAAQ,GAAI,SAGjB,MAAMsB,EAAWtB,EAAO,UAAYtB,EAAiB,IAAIsB,EAAO,EAAE,EAElE,GAAI,CAAClB,GAAoB,CAACwC,EAAU,SAEpC,MAAMV,EAAMG,EAAgBf,CAAM,EAIlC,GAHAY,EAAI,eAAiBZ,EAAO,gBAAkB,GAG1CR,EAAkB,IAAIQ,EAAO,EAAE,EAAG,CAEpC,MAAMuB,GADgB7C,EAAiB,IAAIsB,EAAO,EAAE,GAAK,CAAA,GACvB,QAASoB,GAAW5C,EAAS,IAAI4C,CAAM,GAAK,EAAE,EAEhF,GAAIG,EAAY,QAAUxC,EAAaiB,EAAO,EAAE,EAAG,CACjD,MAAMwB,EAAWD,EAAY,IAAKb,GAASD,EAAcC,EAAMV,EAAO,EAAE,CAAC,EAEzE,GAAIjB,EAAaiB,EAAO,EAAE,EAAG,CAC3B,MAAMyB,EAAQ1C,EAAaiB,EAAO,EAAE,EAChCyB,EAAQ,GACVD,EAAS,KAAK,GAAGE,EAAAA,oBAAoBD,CAAK,CAAC,CAE/C,CAEAb,EAAI,QAAUY,CAChB,CACF,CAEAH,EAAe,KAAKT,CAAG,CACzB,CAEA,OAAAS,EAAe,KAAK,GAAGJ,GAAoB,EAEpCI,CACT,CAGA,GAAI,CAACzC,EAAe,CAClB,MAAM+C,EAAuB,CAAA,EAG7B,UAAWjB,KAAQlC,EAAS,SACrBkC,EAAK,IACViB,EAAS,KAAKlB,EAAcC,CAAI,CAAC,EAInC,UAAWE,KAAOnC,GAAQ,GACxBkD,EAAS,KAAKf,CAAG,EAInB,GAAI5B,EAAe,CAEjB,MAAMyC,EAAQpD,EACC,CACb,MAAMuD,EAAkBF,EAAAA,oBAAoBD,CAAK,EAEjDE,EAAS,KAAK,GAAGC,CAAe,CAClC,CACF,CAEA,OAAOD,CACT,CAGA,MAAME,MAAe,IACfC,EAAuB,CAAA,EAG7B,UAAWxB,KAAYH,EAAgB,CACrC,MAAMH,EAASzB,EAAW,IAAI+B,CAAQ,EACtC,GAAI,CAACN,EAAQ,SAEb,MAAMY,EAAMG,EAAgBf,CAAM,EAWlC,GAVAY,EAAI,eAAiBZ,EAAO,gBAAkB,GAE9C6B,EAAS,IAAIvB,EAAUM,CAAG,GAGtB,CAACZ,EAAO,UAAY,CAACzB,EAAW,IAAIyB,EAAO,QAAQ,IACrD8B,EAAS,KAAKlB,CAAG,EAIfpB,EAAkB,IAAIc,CAAQ,EAAG,CAInC,MAAMiB,GADgB7C,EAAiB,IAAI4B,CAAQ,GAAK,CAAA,GACtB,QAASc,GAAW5C,EAAS,IAAI4C,CAAM,GAAK,EAAE,EAEhF,GAAIG,EAAY,QAAUxC,EAAauB,CAAQ,EAAG,CAEhD,MAAMkB,EAAW,IAAI,MAAgBD,EAAY,MAAM,EAGvD,QAASQ,EAAI,EAAGA,EAAIR,EAAY,OAAQQ,IACtCP,EAASO,CAAC,EAAItB,EAAcc,EAAYQ,CAAC,EAAGzB,CAAQ,EAItD,GAAIvB,EAAauB,CAAQ,EAAG,CAC1B,MAAMmB,EAAQ1C,EAAauB,CAAQ,EACnC,GAAImB,EAAQ,EAAG,CACb,MAAMG,EAAkBF,EAAAA,oBAAoBD,CAAK,EAEjDD,EAAS,KAAK,GAAGI,CAAe,CAClC,CACF,CAEAhB,EAAI,QAAUY,CAChB,CACF,CACF,CAGA,UAAWlB,KAAYH,EAAgB,CACrC,MAAMF,EAAWL,EAAiB,IAAIU,CAAQ,EAC9C,GAAI,CAACL,GAAY,CAACT,EAAkB,IAAIS,CAAQ,EAAG,SAEnD,MAAM+B,EAAWH,EAAS,IAAIvB,CAAQ,EAChC2B,EAAYJ,EAAS,IAAI5B,CAAQ,EAEnC,CAAC+B,GAAY,CAACC,GAGlBA,EAAU,SAAS,KAAKD,CAAQ,CAClC,CAMA,GAJAF,EAAS,KAAK,GAAGb,GAAoB,EAIjCrC,GAAiBI,EAAe,CAClC,MAAMyC,EAAQpD,EAEZyD,EAAS,KAAK,GAAGJ,EAAAA,oBAAoBD,CAAK,CAAC,CAE/C,CAGA,UAAWb,KAAOnC,GAAQ,GACxBqD,EAAS,KAAKlB,CAAG,EAGnB,OAAOkB,CACT,EAAG,CACDvD,EACAC,EACAE,EACAD,EACA0B,EACAP,EACAJ,EACAZ,EACAC,EACAC,EACAC,EACAC,EACAC,CAAA,CACD,CACH"}

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

@@ -1,6 +1,6 @@
 import { useMemo as I } from "react";
-import { generateLoadingRows as g } from "../utils/loadingUtils.es.js";
-import { useGetEntityTypeData as V } from "./useGetEntityTypeData.es.js";
+import { generateLoadingRows as R } from "../utils/loadingUtils.es.js";
+import { useGetEntityTypeData as A } from "./useGetEntityTypeData.es.js";
 import "@ynput/ayon-react-components";
 import "../../../components/SearchFilter/filterDates.es.js";
 import "date-fns";
@@ -9,6 +9,7 @@ import "react-toastify";
 import "lodash";
 import "uuid";
 import "../../../api/queries/users/updateUsers.es.js";
+import "../../../util/searchTerms.es.js";
 import "../../../util/pubsub.es.js";
 import "../../../../../_virtual/jsx-runtime.es.js";
 import "clsx";
@@ -38,6 +39,7 @@ import "../../../api/generated/configuration.es.js";
 import "../../../api/generated/dataImport.es.js";
 import "../../../api/generated/desktop.es.js";
 import "../../../api/generated/entityLists.es.js";
+import "../../../api/generated/enums.es.js";
 import "../../../api/generated/events.es.js";
 import "../../../api/generated/files.es.js";
 import "../../../api/generated/folders.es.js";
@@ -63,6 +65,8 @@ import "../../../api/generated/workfiles.es.js";
 import "../../../api/generated/ynputCloud.es.js";
 import "../../../api/generated/grouping.es.js";
 import "../../../api/generated/views.es.js";
+import "../../../api/queries/accessGroups/getAccessGroups.es.js";
+import "../../../api/queries/accessGroups/updateAccessGroups.es.js";
 import "../../../api/queries/actions/getActions.es.js";
 import "../../../api/queries/activities/getActivities.es.js";
 import "../../../api/queries/activities/updateReaction.es.js";
@@ -93,6 +97,7 @@ import "../../../api/queries/entityLists/getListsAttributes.es.js";
 import "../../../api/queries/entityLists/listItemsColumnStats.es.js";
 import "../../../api/queries/entityLists/updateListsAttributes.es.js";
 import "../../../api/queries/entityLists/listFolders.es.js";
+import "../../../api/queries/enums/getEnums.es.js";
 import "../../../api/queries/folders/getFolders.es.js";
 import "../../../api/queries/folders/getFolderDeleteInfo.es.js";
 import "../../../api/queries/grouping/getGrouping.es.js";
@@ -128,239 +133,166 @@ import "../../ContextMenu/ContextMenuContext.es.js";
 import "../../../context/DeleteEntitiesContext.es.js";
 import "../../../context/GlobalContext.es.js";
 import "../context/ProjectDataContextInstance.es.js";
+import "../../Slicer/context/SlicerContextInstance.es.js";
+import "../../../context/RemoteModulesContext.es.js";
+import "../../../../../_virtual/runtime.es.js";
+import "../../../../../_virtual/semver.es.js";
+import "../../../context/PowerpackContextInstance.es.js";
+import "../../Slicer/components/SlicerDropdownFallback.es.js";
 import "../../../context/ProjectFoldersContextInstance.es.js";
 import "../buildTreeTableColumns.es.js";
-import { linksToTableData as P } from "../utils/linksToTableData.es.js";
-const H = 100;
-function li({
-  foldersMap: a,
-  tasksMap: h,
+import { linksToTableData as x } from "../utils/linksToTableData.es.js";
+import { buildTaskTableRow as U, buildFolderTableRow as q } from "../utils/tableRowBuilders.es.js";
+const N = 100;
+function kr({
+  foldersMap: c,
+  tasksMap: w,
   rows: y,
-  tasksByFolderMap: b,
-  expanded: R,
-  showHierarchy: A,
-  isFlatFolderView: S = !1,
-  showEmptyFolders: j = !1,
-  loadingTasks: c = {},
-  isLoadingMore: v = !1,
-  selectedFolders: E = []
+  tasksByFolderMap: T,
+  expanded: g,
+  showHierarchy: b,
+  isFlatFolderView: v = !1,
+  showEmptyFolders: D = !1,
+  loadingTasks: d = {},
+  isLoadingMore: k = !1,
+  selectedFolders: S = []
 }) {
-  const T = K(), D = V({ projectInfo: T }), N = I(() => JSON.stringify(R), [R]), f = I(() => new Set(
-    Object.entries(R).filter(([r, e]) => e).map(([r]) => r)
-  ), [N]), { childToParentMap: x, parentToChildrenMap: _ } = I(() => {
-    const r = /* @__PURE__ */ new Map(), e = /* @__PURE__ */ new Map();
-    for (const i of a.values()) {
+  const O = K(), j = A({ projectInfo: O }), _ = I(() => JSON.stringify(g), [g]), u = I(() => new Set(
+    Object.entries(g).filter(([p, n]) => n).map(([p]) => p)
+  ), [_]), { childToParentMap: C, parentToChildrenMap: E } = I(() => {
+    const p = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map();
+    for (const i of c.values()) {
       if (!i?.id) continue;
-      const m = i.parentId;
-      if (m) {
-        r.set(i.id, m);
-        let o = e.get(m);
-        o || (o = /* @__PURE__ */ new Set(), e.set(m, o)), o.add(i.id);
+      const f = i.parentId;
+      if (f) {
+        p.set(i.id, f);
+        let e = n.get(f);
+        e || (e = /* @__PURE__ */ new Set(), n.set(f, e)), e.add(i.id);
       }
     }
-    return { childToParentMap: r, parentToChildrenMap: e };
-  }, [a]), C = I(() => {
-    const r = /* @__PURE__ */ new Set(), e = [];
-    for (const i of a.values())
-      i?.id && (!i.parentId || !a.has(i.parentId)) && (r.add(i.id), e.push(i.id));
-    for (; e.length > 0; ) {
-      const i = e.shift();
-      if (!f.has(i)) continue;
-      const o = _.get(i);
-      if (o)
-        for (const t of o)
-          r.has(t) || (r.add(t), e.push(t));
+    return { childToParentMap: p, parentToChildrenMap: n };
+  }, [c]), P = I(() => {
+    const p = /* @__PURE__ */ new Set(), n = [];
+    for (const i of c.values())
+      i?.id && (!i.parentId || !c.has(i.parentId)) && (p.add(i.id), n.push(i.id));
+    for (; n.length > 0; ) {
+      const i = n.shift();
+      if (!u.has(i)) continue;
+      const e = E.get(i);
+      if (e)
+        for (const t of e)
+          p.has(t) || (p.add(t), n.push(t));
     }
-    return r;
-  }, [a, _, f]);
+    return p;
+  }, [c, E, u]);
   return I(() => {
-    const r = (o, t) => {
-      const n = D("task", o.taskType), p = P(o.links, "task", T.anatomy);
-      return {
-        id: o.id,
-        entityType: "task",
-        parentId: t || o.folderId,
-        folderId: o.folderId,
-        name: o.name || "",
-        label: o.label || o.name || "",
-        icon: n?.icon || null,
-        color: n?.color || null,
-        status: o.status,
-        assignees: o.assignees,
-        tags: o.tags,
-        img: null,
-        subRows: [],
-        subType: o.taskType || null,
-        attrib: o.attrib,
-        midnightExclusiveFields: o.data?.schedulerSyncData?.allDay ? ["attrib_endDate"] : void 0,
-        ownAttrib: o.ownAttrib,
-        parents: o.parents || [],
-        path: o.parents.join("/") || null,
-        // todo: probably remove this and just use parents
-        folder: o.parents[o.parents.length - 1] || void 0,
-        updatedAt: o.updatedAt,
-        createdAt: o.createdAt,
-        thumbnailHash: o.thumbnailHash,
-        hasReviewables: o.hasReviewables || !1,
-        links: p,
-        subtasks: o.subtasks || [],
-        latestComments: o.latestComments || []
-      };
-    }, e = () => {
-      const o = [];
-      for (const t of E) {
-        if (a.has(t)) continue;
-        const n = b.get(t) || [];
-        for (const p of n) {
-          const l = h.get(p);
-          l && o.push(r(l));
+    const p = (t, o) => {
+      const r = j("task", t.taskType), m = U(t, c.get(o || t.folderId));
+      return m.primary.icon = r?.icon || null, m.primary.color = r?.color || null, m.primary.links = x(t.links, "task", O.anatomy), m.subRows = [], m;
+    }, n = (t) => {
+      const o = j("folder", t.folderType), r = q(t);
+      return r.primary.icon = o?.icon || null, r.primary.color = o?.color || null, r.primary.links = x(t.links, "folder", O.anatomy), r.subRows = [], r;
+    }, i = () => {
+      const t = [];
+      for (const o of S) {
+        if (c.has(o)) continue;
+        const r = T.get(o) || [];
+        for (const m of r) {
+          const a = w.get(m);
+          a && t.push(p(a));
         }
       }
-      return o;
+      return t;
     };
-    if (S) {
-      const o = [];
-      for (const t of a.values()) {
-        if (!t?.id) continue;
-        const n = t.hasTasks ?? b.has(t.id);
-        if (!j && !n) continue;
-        const p = D("folder", t.folderType), l = P(t.links, "folder", T.anatomy), O = {
-          id: t.id,
-          entityType: "folder",
-          parentId: void 0,
-          // flat — no parent nesting
-          folderId: t.id,
-          name: t.name || "",
-          label: t.label || t.name || "",
-          icon: p?.icon || null,
-          color: p?.color || null,
-          img: null,
-          subRows: [],
-          status: t.status,
-          tags: t.tags || [],
-          subType: t.folderType || null,
-          ownAttrib: t.ownAttrib || [],
-          path: t.path,
-          folder: t.parents[t.parents.length - 1] || void 0,
-          attrib: t.attrib || {},
-          childOnlyMatch: t.childOnlyMatch || !1,
-          updatedAt: t.updatedAt,
-          createdAt: t.createdAt,
-          thumbnailHash: t.thumbnailHash,
-          hasReviewables: t.hasReviewables || !1,
-          hasVersions: t.hasVersions || !1,
-          links: l
-        };
-        if (f.has(t.id)) {
-          const d = (b.get(t.id) || []).flatMap((s) => h.get(s) || []);
-          if (d.length || c[t.id]) {
-            const s = d.map((u) => r(u, t.id));
-            if (c[t.id]) {
-              const u = c[t.id];
-              u > 0 && s.push(...g(u, { parentId: t.id }));
+    if (v) {
+      const t = [];
+      for (const o of c.values()) {
+        if (!o?.id) continue;
+        const r = o.hasTasks ?? T.has(o.id);
+        if (!D && !r) continue;
+        const m = n(o);
+        if (m.childOnlyMatch = o.childOnlyMatch || !1, u.has(o.id)) {
+          const l = (T.get(o.id) || []).flatMap((s) => w.get(s) || []);
+          if (l.length || d[o.id]) {
+            const s = l.map((h) => p(h, o.id));
+            if (d[o.id]) {
+              const h = d[o.id];
+              h > 0 && s.push(...R(h));
             }
-            O.subRows = s;
+            m.subRows = s;
           }
         }
-        o.push(O);
+        t.push(m);
       }
-      return o.push(...e()), o;
+      return t.push(...i()), t;
     }
-    if (!A) {
-      const o = [];
-      for (const t of h.values())
-        t.id && o.push(r(t));
-      for (const t of y || [])
-        o.push(t);
-      if (v) {
-        const t = H;
+    if (!b) {
+      const t = [];
+      for (const o of w.values())
+        o.id && t.push(p(o));
+      for (const o of y || [])
+        t.push(o);
+      if (k) {
+        const o = N;
         {
-          const n = g(t, {
-            type: "task"
-          });
-          o.push(...n);
+          const r = R(o);
+          t.push(...r);
         }
       }
-      return o;
+      return t;
     }
-    const i = /* @__PURE__ */ new Map(), m = [];
-    for (const o of C) {
-      const t = a.get(o);
-      if (!t) continue;
-      const n = P(t.links, "folder", T.anatomy), p = D("folder", t.folderType), l = {
-        id: o,
-        entityType: "folder",
-        parentId: t.parentId || void 0,
-        folderId: o || null,
-        // root folders have no folderId
-        name: t.name || "",
-        label: t.label || t.name || "",
-        icon: p?.icon || null,
-        color: p?.color || null,
-        img: null,
-        subRows: [],
-        status: t.status,
-        tags: t.tags || [],
-        subType: t.folderType || null,
-        ownAttrib: t.ownAttrib || [],
-        path: t.path,
-        folder: t.parents[t.parents.length - 1] || void 0,
-        attrib: t.attrib || {},
-        childOnlyMatch: t.childOnlyMatch || !1,
-        updatedAt: t.updatedAt,
-        createdAt: t.createdAt,
-        thumbnailHash: t.thumbnailHash,
-        hasReviewables: t.hasReviewables || !1,
-        hasVersions: t.hasVersions || !1,
-        links: n
-      };
-      if (i.set(o, l), (!t.parentId || !a.has(t.parentId)) && m.push(l), f.has(o)) {
-        const w = (b.get(o) || []).flatMap((d) => h.get(d) || []);
-        if (w.length || c[o]) {
-          const d = new Array(w.length);
-          for (let s = 0; s < w.length; s++)
-            d[s] = r(w[s], o);
-          if (c[o]) {
-            const s = c[o];
+    const f = /* @__PURE__ */ new Map(), e = [];
+    for (const t of P) {
+      const o = c.get(t);
+      if (!o) continue;
+      const r = n(o);
+      if (r.childOnlyMatch = o.childOnlyMatch || !1, f.set(t, r), (!o.parentId || !c.has(o.parentId)) && e.push(r), u.has(t)) {
+        const a = (T.get(t) || []).flatMap((l) => w.get(l) || []);
+        if (a.length || d[t]) {
+          const l = new Array(a.length);
+          for (let s = 0; s < a.length; s++)
+            l[s] = p(a[s], t);
+          if (d[t]) {
+            const s = d[t];
             if (s > 0) {
-              const u = g(s, { parentId: o });
-              d.push(...u);
+              const h = R(s);
+              l.push(...h);
             }
           }
-          l.subRows = d;
+          r.subRows = l;
         }
       }
     }
-    for (const o of C) {
-      const t = x.get(o);
-      if (!t || !f.has(t)) continue;
-      const n = i.get(o), p = i.get(t);
-      !n || !p || p.subRows?.push(n);
+    for (const t of P) {
+      const o = C.get(t);
+      if (!o || !u.has(o)) continue;
+      const r = f.get(t), m = f.get(o);
+      !r || !m || m.subRows?.push(r);
     }
-    if (m.push(...e()), A && v) {
-      const o = H;
-      m.push(...g(o, { type: "task" }));
+    if (e.push(...i()), b && k) {
+      const t = N;
+      e.push(...R(t));
     }
-    for (const o of y || [])
-      m.push(o);
-    return m;
+    for (const t of y || [])
+      e.push(t);
+    return e;
   }, [
-    a,
-    h,
-    b,
+    c,
+    w,
+    T,
     y,
+    P,
     C,
-    x,
-    f,
-    A,
-    S,
-    j,
-    c,
+    u,
+    b,
     v,
-    E
+    D,
+    d,
+    k,
+    S
   ]);
 }
 export {
-  li as default
+  kr as default
 };
 //# sourceMappingURL=useBuildProjectDataTable.es.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"useBuildProjectDataTable.es.js","sources":["../../../../../../src/containers/ProjectTreeTable/hooks/useBuildProjectDataTable.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 { useGetEntityTypeData } from './useGetEntityTypeData'\nimport { TableGroupBy } from '../context'\nimport { linksToTableData } from '../utils'\nimport { useProjectContext } from '@shared/context/ProjectContext'\n\ntype Params = {\n  foldersMap: FolderNodeMap\n  tasksMap: TaskNodeMap\n  tasksByFolderMap: TasksByFolderMap\n  rows?: TableRow[]\n  expanded: ExpandedState\n  showHierarchy: boolean\n  isFlatFolderView?: boolean\n  showEmptyFolders?: boolean\n  loadingTasks?: LoadingTasks\n  isLoadingMore?: boolean\n  groupBy?: TableGroupBy\n  selectedFolders?: string[]\n}\n\nexport default function useBuildProjectDataTable({\n  foldersMap,\n  tasksMap,\n  rows,\n  tasksByFolderMap,\n  expanded,\n  showHierarchy,\n  isFlatFolderView = false,\n  showEmptyFolders = false,\n  loadingTasks = {},\n  isLoadingMore = false,\n  selectedFolders = [],\n}: Params): TableRow[] {\n  const project = useProjectContext()\n  const getEntityTypeData = useGetEntityTypeData({ projectInfo: project })\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\n      const links = linksToTableData(task.links, 'task', project.anatomy)\n\n      return {\n        id: task.id,\n        entityType: 'task',\n        parentId: parentId || task.folderId,\n        folderId: 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        midnightExclusiveFields: task.data?.schedulerSyncData?.allDay\n          ? ['attrib_endDate']\n          : undefined,\n        ownAttrib: task.ownAttrib,\n        parents: task.parents || [],\n        path: task.parents.join('/') || null, // todo: probably remove this and just use parents\n        folder: task.parents[task.parents.length - 1] || undefined,\n        updatedAt: task.updatedAt,\n        createdAt: task.createdAt,\n        thumbnailHash: task.thumbnailHash,\n        hasReviewables: task.hasReviewables || false,\n        links: links,\n        subtasks: task.subtasks || [],\n        latestComments: task.latestComments || [],\n      }\n    }\n\n    const createRootTaskRows = (): TableRow[] => {\n      const rootTaskRows: TableRow[] = []\n      for (const folderId of selectedFolders) {\n        if (foldersMap.has(folderId)) continue\n        const folderTaskIds = tasksByFolderMap.get(folderId) || []\n        for (const taskId of folderTaskIds) {\n          const task = tasksMap.get(taskId)\n          if (task) rootTaskRows.push(createTaskRow(task))\n        }\n      }\n      return rootTaskRows\n    }\n\n    // Flat folder view: all folders at root level, each expandable to show tasks\n    if (isFlatFolderView) {\n      const flatFolderRows: TableRow[] = []\n\n      for (const folder of foldersMap.values()) {\n        if (!folder?.id) continue\n\n        // Use the folder's hasTasks flag (from REST data) to filter before tasks are loaded\n        const hasTasks = folder.hasTasks ?? tasksByFolderMap.has(folder.id)\n        // Skip folders without tasks when showEmptyFolders is off\n        if (!showEmptyFolders && !hasTasks) continue\n\n        const folderTypeData = getEntityTypeData('folder', folder.folderType)\n        const links = linksToTableData(folder.links, 'folder', project.anatomy)\n\n        const row: TableRow = {\n          id: folder.id,\n          entityType: 'folder',\n          parentId: undefined, // flat — no parent nesting\n          folderId: folder.id,\n          name: folder.name || '',\n          label: folder.label || folder.name || '',\n          icon: folderTypeData?.icon || null,\n          color: folderTypeData?.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          folder: folder.parents[folder.parents.length - 1] || undefined,\n          attrib: folder.attrib || {},\n          childOnlyMatch: folder.childOnlyMatch || false,\n          updatedAt: folder.updatedAt,\n          createdAt: folder.createdAt,\n          thumbnailHash: folder.thumbnailHash,\n          hasReviewables: folder.hasReviewables || false,\n          hasVersions: folder.hasVersions || false,\n          links: links,\n        }\n\n        // If folder is expanded, attach task subRows\n        if (expandedFolderIds.has(folder.id)) {\n          const folderTaskIds = tasksByFolderMap.get(folder.id) || []\n          const folderTasks = folderTaskIds.flatMap((taskId) => tasksMap.get(taskId) || [])\n\n          if (folderTasks.length || loadingTasks[folder.id]) {\n            const taskRows = folderTasks.map((task) => createTaskRow(task, folder.id))\n\n            if (loadingTasks[folder.id]) {\n              const count = loadingTasks[folder.id]\n              if (count > 0) {\n                taskRows.push(...generateLoadingRows(count, { parentId: folder.id }))\n              }\n            }\n\n            row.subRows = taskRows\n          }\n        }\n\n        flatFolderRows.push(row)\n      }\n\n      flatFolderRows.push(...createRootTaskRows())\n\n      return flatFolderRows\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      // if we are loading more tasks, add loading rows\n      if (isLoadingMore) {\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(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      const links = linksToTableData(folder.links, 'folder', project.anatomy)\n\n      const folderTypeData = getEntityTypeData('folder', folder.folderType)\n\n      // Create row with minimal required properties\n      const row: TableRow = {\n        id: folderId,\n        entityType: 'folder',\n        parentId: folder.parentId || undefined,\n        folderId: folderId || null, // root folders have no folderId\n        name: folder.name || '',\n        label: folder.label || folder.name || '',\n        icon: folderTypeData?.icon || null,\n        color: folderTypeData?.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        folder: folder.parents[folder.parents.length - 1] || undefined,\n        attrib: folder.attrib || {},\n        childOnlyMatch: folder.childOnlyMatch || false,\n        updatedAt: folder.updatedAt,\n        createdAt: folder.createdAt,\n        thumbnailHash: folder.thumbnailHash,\n        hasReviewables: folder.hasReviewables || false,\n        hasVersions: folder.hasVersions || false,\n        links: links,\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 count = loadingTasks[folderId]\n            if (count > 0) {\n              const loadingTaskRows = generateLoadingRows(count, { parentId: folderId })\n\n              taskRows.push(...loadingTaskRows)\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    rootRows.push(...createRootTaskRows())\n\n    // if we are loading more tasks, add loading rows at the root level\n    // this happens when in hierarchy mode but with a slicer selection that causes paginated tasks\n    if (showHierarchy && isLoadingMore) {\n      const count = TASKS_INFINITE_QUERY_COUNT\n      if (count > 0) {\n        rootRows.push(...generateLoadingRows(count, { type: 'task' }))\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    return rootRows\n  }, [\n    foldersMap,\n    tasksMap,\n    tasksByFolderMap,\n    rows,\n    visibleFolders,\n    childToParentMap,\n    expandedFolderIds,\n    showHierarchy,\n    isFlatFolderView,\n    showEmptyFolders,\n    loadingTasks,\n    isLoadingMore,\n    selectedFolders,\n  ])\n}\n"],"names":["TASKS_INFINITE_QUERY_COUNT","useBuildProjectDataTable","foldersMap","tasksMap","rows","tasksByFolderMap","expanded","showHierarchy","isFlatFolderView","showEmptyFolders","loadingTasks","isLoadingMore","selectedFolders","project","useProjectContext","getEntityTypeData","useGetEntityTypeData","expandedKey","useMemo","expandedFolderIds","_","isExpanded","id","childToParentMap","parentToChildrenMap","childToParent","parentToChildren","folder","parentId","children","visibleFolders","visible","queue","folderId","childrenIds","childId","createTaskRow","task","typeData","links","linksToTableData","createRootTaskRows","rootTaskRows","folderTaskIds","taskId","flatFolderRows","hasTasks","folderTypeData","row","folderTasks","taskRows","count","generateLoadingRows","flatRows","loadingTaskRows","rowsById","rootRows","i","childRow","parentRow"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAUA,MAAMA,IAA6B;AAsBnC,SAAwBC,GAAyB;AAAA,EAC/C,YAAAC;AAAA,EACA,UAAAC;AAAA,EACA,MAAAC;AAAA,EACA,kBAAAC;AAAA,EACA,UAAAC;AAAA,EACA,eAAAC;AAAA,EACA,kBAAAC,IAAmB;AAAA,EACnB,kBAAAC,IAAmB;AAAA,EACnB,cAAAC,IAAe,CAAA;AAAA,EACf,eAAAC,IAAgB;AAAA,EAChB,iBAAAC,IAAkB,CAAA;AACpB,GAAuB;AACrB,QAAMC,IAAUC,EAAA,GACVC,IAAoBC,EAAqB,EAAE,aAAaH,GAAS,GAGjEI,IAAcC,EAAQ,MAAM,KAAK,UAAUZ,CAAQ,GAAG,CAACA,CAAQ,CAAC,GAGhEa,IAAoBD,EAAQ,MACzB,IAAI;AAAA,IACT,OAAO,QAAQZ,CAAQ,EACpB,OAAO,CAAC,CAACc,GAAGC,CAAU,MAAMA,CAAU,EACtC,IAAI,CAAC,CAACC,CAAE,MAAMA,CAAE;AAAA,EAAA,GAEpB,CAACL,CAAW,CAAC,GAGV,EAAE,kBAAAM,GAAkB,qBAAAC,EAAA,IAAwBN,EAAQ,MAAM;AAC9D,UAAMO,wBAAoB,IAAA,GACpBC,wBAAuB,IAAA;AAG7B,eAAWC,KAAUzB,EAAW,UAAU;AACxC,UAAI,CAACyB,GAAQ,GAAI;AAEjB,YAAMC,IAAWD,EAAO;AACxB,UAAIC,GAAU;AACZ,QAAAH,EAAc,IAAIE,EAAO,IAAIC,CAAQ;AAErC,YAAIC,IAAWH,EAAiB,IAAIE,CAAQ;AAC5C,QAAKC,MACHA,wBAAe,IAAA,GACfH,EAAiB,IAAIE,GAAUC,CAAQ,IAEzCA,EAAS,IAAIF,EAAO,EAAE;AAAA,MACxB;AAAA,IACF;AAEA,WAAO,EAAE,kBAAkBF,GAAe,qBAAqBC,EAAA;AAAA,EACjE,GAAG,CAACxB,CAAU,CAAC,GAGT4B,IAAiBZ,EAAQ,MAAM;AACnC,UAAMa,wBAAc,IAAA,GAGdC,IAAkB,CAAA;AACxB,eAAWL,KAAUzB,EAAW;AAC9B,MAAKyB,GAAQ,OAGT,CAACA,EAAO,YAAY,CAACzB,EAAW,IAAIyB,EAAO,QAAQ,OACrDI,EAAQ,IAAIJ,EAAO,EAAE,GACrBK,EAAM,KAAKL,EAAO,EAAE;AAKxB,WAAOK,EAAM,SAAS,KAAG;AACvB,YAAMC,IAAWD,EAAM,MAAA;AAGvB,UAAI,CAFqBb,EAAkB,IAAIc,CAAQ,EAEhC;AAGvB,YAAMC,IAAcV,EAAoB,IAAIS,CAAQ;AACpD,UAAIC;AACF,mBAAWC,KAAWD;AACpB,UAAKH,EAAQ,IAAII,CAAO,MACtBJ,EAAQ,IAAII,CAAO,GACnBH,EAAM,KAAKG,CAAO;AAAA,IAI1B;AAEA,WAAOJ;AAAA,EACT,GAAG,CAAC7B,GAAYsB,GAAqBL,CAAiB,CAAC;AAGvD,SAAOD,EAAQ,MAAM;AAEnB,UAAMkB,IAAgB,CAACC,GAAsBT,MAAgC;AAC3E,YAAMU,IAAWvB,EAAkB,QAAQsB,EAAK,QAAQ,GAElDE,IAAQC,EAAiBH,EAAK,OAAO,QAAQxB,EAAQ,OAAO;AAElE,aAAO;AAAA,QACL,IAAIwB,EAAK;AAAA,QACT,YAAY;AAAA,QACZ,UAAUT,KAAYS,EAAK;AAAA,QAC3B,UAAUA,EAAK;AAAA,QACf,MAAMA,EAAK,QAAQ;AAAA,QACnB,OAAOA,EAAK,SAASA,EAAK,QAAQ;AAAA,QAClC,MAAMC,GAAU,QAAQ;AAAA,QACxB,OAAOA,GAAU,SAAS;AAAA,QAC1B,QAAQD,EAAK;AAAA,QACb,WAAWA,EAAK;AAAA,QAChB,MAAMA,EAAK;AAAA,QACX,KAAK;AAAA,QACL,SAAS,CAAA;AAAA,QACT,SAASA,EAAK,YAAY;AAAA,QAC1B,QAAQA,EAAK;AAAA,QACb,yBAAyBA,EAAK,MAAM,mBAAmB,SACnD,CAAC,gBAAgB,IACjB;AAAA,QACJ,WAAWA,EAAK;AAAA,QAChB,SAASA,EAAK,WAAW,CAAA;AAAA,QACzB,MAAMA,EAAK,QAAQ,KAAK,GAAG,KAAK;AAAA;AAAA,QAChC,QAAQA,EAAK,QAAQA,EAAK,QAAQ,SAAS,CAAC,KAAK;AAAA,QACjD,WAAWA,EAAK;AAAA,QAChB,WAAWA,EAAK;AAAA,QAChB,eAAeA,EAAK;AAAA,QACpB,gBAAgBA,EAAK,kBAAkB;AAAA,QACvC,OAAAE;AAAA,QACA,UAAUF,EAAK,YAAY,CAAA;AAAA,QAC3B,gBAAgBA,EAAK,kBAAkB,CAAA;AAAA,MAAC;AAAA,IAE5C,GAEMI,IAAqB,MAAkB;AAC3C,YAAMC,IAA2B,CAAA;AACjC,iBAAWT,KAAYrB,GAAiB;AACtC,YAAIV,EAAW,IAAI+B,CAAQ,EAAG;AAC9B,cAAMU,IAAgBtC,EAAiB,IAAI4B,CAAQ,KAAK,CAAA;AACxD,mBAAWW,KAAUD,GAAe;AAClC,gBAAMN,IAAOlC,EAAS,IAAIyC,CAAM;AAChC,UAAIP,KAAMK,EAAa,KAAKN,EAAcC,CAAI,CAAC;AAAA,QACjD;AAAA,MACF;AACA,aAAOK;AAAA,IACT;AAGA,QAAIlC,GAAkB;AACpB,YAAMqC,IAA6B,CAAA;AAEnC,iBAAWlB,KAAUzB,EAAW,UAAU;AACxC,YAAI,CAACyB,GAAQ,GAAI;AAGjB,cAAMmB,IAAWnB,EAAO,YAAYtB,EAAiB,IAAIsB,EAAO,EAAE;AAElE,YAAI,CAAClB,KAAoB,CAACqC,EAAU;AAEpC,cAAMC,IAAiBhC,EAAkB,UAAUY,EAAO,UAAU,GAC9DY,IAAQC,EAAiBb,EAAO,OAAO,UAAUd,EAAQ,OAAO,GAEhEmC,IAAgB;AAAA,UACpB,IAAIrB,EAAO;AAAA,UACX,YAAY;AAAA,UACZ,UAAU;AAAA;AAAA,UACV,UAAUA,EAAO;AAAA,UACjB,MAAMA,EAAO,QAAQ;AAAA,UACrB,OAAOA,EAAO,SAASA,EAAO,QAAQ;AAAA,UACtC,MAAMoB,GAAgB,QAAQ;AAAA,UAC9B,OAAOA,GAAgB,SAAS;AAAA,UAChC,KAAK;AAAA,UACL,SAAS,CAAA;AAAA,UACT,QAAQpB,EAAO;AAAA,UACf,MAAMA,EAAO,QAAQ,CAAA;AAAA,UACrB,SAASA,EAAO,cAAc;AAAA,UAC9B,WAAWA,EAAO,aAAa,CAAA;AAAA,UAC/B,MAAMA,EAAO;AAAA,UACb,QAAQA,EAAO,QAAQA,EAAO,QAAQ,SAAS,CAAC,KAAK;AAAA,UACrD,QAAQA,EAAO,UAAU,CAAA;AAAA,UACzB,gBAAgBA,EAAO,kBAAkB;AAAA,UACzC,WAAWA,EAAO;AAAA,UAClB,WAAWA,EAAO;AAAA,UAClB,eAAeA,EAAO;AAAA,UACtB,gBAAgBA,EAAO,kBAAkB;AAAA,UACzC,aAAaA,EAAO,eAAe;AAAA,UACnC,OAAAY;AAAA,QAAA;AAIF,YAAIpB,EAAkB,IAAIQ,EAAO,EAAE,GAAG;AAEpC,gBAAMsB,KADgB5C,EAAiB,IAAIsB,EAAO,EAAE,KAAK,CAAA,GACvB,QAAQ,CAACiB,MAAWzC,EAAS,IAAIyC,CAAM,KAAK,EAAE;AAEhF,cAAIK,EAAY,UAAUvC,EAAaiB,EAAO,EAAE,GAAG;AACjD,kBAAMuB,IAAWD,EAAY,IAAI,CAACZ,MAASD,EAAcC,GAAMV,EAAO,EAAE,CAAC;AAEzE,gBAAIjB,EAAaiB,EAAO,EAAE,GAAG;AAC3B,oBAAMwB,IAAQzC,EAAaiB,EAAO,EAAE;AACpC,cAAIwB,IAAQ,KACVD,EAAS,KAAK,GAAGE,EAAoBD,GAAO,EAAE,UAAUxB,EAAO,GAAA,CAAI,CAAC;AAAA,YAExE;AAEA,YAAAqB,EAAI,UAAUE;AAAA,UAChB;AAAA,QACF;AAEA,QAAAL,EAAe,KAAKG,CAAG;AAAA,MACzB;AAEA,aAAAH,EAAe,KAAK,GAAGJ,GAAoB,GAEpCI;AAAA,IACT;AAGA,QAAI,CAACtC,GAAe;AAClB,YAAM8C,IAAuB,CAAA;AAG7B,iBAAWhB,KAAQlC,EAAS;AAC1B,QAAKkC,EAAK,MACVgB,EAAS,KAAKjB,EAAcC,CAAI,CAAC;AAInC,iBAAWW,KAAO5C,KAAQ;AACxB,QAAAiD,EAAS,KAAKL,CAAG;AAInB,UAAIrC,GAAe;AAEjB,cAAMwC,IAAQnD;AACC;AACb,gBAAMsD,IAAkBF,EAAoBD,GAAO;AAAA,YACjD,MAAM;AAAA,UAAA,CACP;AAED,UAAAE,EAAS,KAAK,GAAGC,CAAe;AAAA,QAClC;AAAA,MACF;AAEA,aAAOD;AAAA,IACT;AAGA,UAAME,wBAAe,IAAA,GACfC,IAAuB,CAAA;AAG7B,eAAWvB,KAAYH,GAAgB;AACrC,YAAMH,IAASzB,EAAW,IAAI+B,CAAQ;AACtC,UAAI,CAACN,EAAQ;AAEb,YAAMY,IAAQC,EAAiBb,EAAO,OAAO,UAAUd,EAAQ,OAAO,GAEhEkC,IAAiBhC,EAAkB,UAAUY,EAAO,UAAU,GAG9DqB,IAAgB;AAAA,QACpB,IAAIf;AAAA,QACJ,YAAY;AAAA,QACZ,UAAUN,EAAO,YAAY;AAAA,QAC7B,UAAUM,KAAY;AAAA;AAAA,QACtB,MAAMN,EAAO,QAAQ;AAAA,QACrB,OAAOA,EAAO,SAASA,EAAO,QAAQ;AAAA,QACtC,MAAMoB,GAAgB,QAAQ;AAAA,QAC9B,OAAOA,GAAgB,SAAS;AAAA,QAChC,KAAK;AAAA,QACL,SAAS,CAAA;AAAA,QACT,QAAQpB,EAAO;AAAA,QACf,MAAMA,EAAO,QAAQ,CAAA;AAAA,QACrB,SAASA,EAAO,cAAc;AAAA,QAC9B,WAAWA,EAAO,aAAa,CAAA;AAAA,QAC/B,MAAMA,EAAO;AAAA,QACb,QAAQA,EAAO,QAAQA,EAAO,QAAQ,SAAS,CAAC,KAAK;AAAA,QACrD,QAAQA,EAAO,UAAU,CAAA;AAAA,QACzB,gBAAgBA,EAAO,kBAAkB;AAAA,QACzC,WAAWA,EAAO;AAAA,QAClB,WAAWA,EAAO;AAAA,QAClB,eAAeA,EAAO;AAAA,QACtB,gBAAgBA,EAAO,kBAAkB;AAAA,QACzC,aAAaA,EAAO,eAAe;AAAA,QACnC,OAAAY;AAAA,MAAA;AAWF,UARAgB,EAAS,IAAItB,GAAUe,CAAG,IAGtB,CAACrB,EAAO,YAAY,CAACzB,EAAW,IAAIyB,EAAO,QAAQ,MACrD6B,EAAS,KAAKR,CAAG,GAIf7B,EAAkB,IAAIc,CAAQ,GAAG;AAInC,cAAMgB,KADgB5C,EAAiB,IAAI4B,CAAQ,KAAK,CAAA,GACtB,QAAQ,CAACW,MAAWzC,EAAS,IAAIyC,CAAM,KAAK,EAAE;AAEhF,YAAIK,EAAY,UAAUvC,EAAauB,CAAQ,GAAG;AAEhD,gBAAMiB,IAAW,IAAI,MAAgBD,EAAY,MAAM;AAGvD,mBAASQ,IAAI,GAAGA,IAAIR,EAAY,QAAQQ;AACtC,YAAAP,EAASO,CAAC,IAAIrB,EAAca,EAAYQ,CAAC,GAAGxB,CAAQ;AAItD,cAAIvB,EAAauB,CAAQ,GAAG;AAC1B,kBAAMkB,IAAQzC,EAAauB,CAAQ;AACnC,gBAAIkB,IAAQ,GAAG;AACb,oBAAMG,IAAkBF,EAAoBD,GAAO,EAAE,UAAUlB,GAAU;AAEzE,cAAAiB,EAAS,KAAK,GAAGI,CAAe;AAAA,YAClC;AAAA,UACF;AAEA,UAAAN,EAAI,UAAUE;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAGA,eAAWjB,KAAYH,GAAgB;AACrC,YAAMF,IAAWL,EAAiB,IAAIU,CAAQ;AAC9C,UAAI,CAACL,KAAY,CAACT,EAAkB,IAAIS,CAAQ,EAAG;AAEnD,YAAM8B,IAAWH,EAAS,IAAItB,CAAQ,GAChC0B,IAAYJ,EAAS,IAAI3B,CAAQ;AAEvC,MAAI,CAAC8B,KAAY,CAACC,KAGlBA,EAAU,SAAS,KAAKD,CAAQ;AAAA,IAClC;AAMA,QAJAF,EAAS,KAAK,GAAGf,GAAoB,GAIjClC,KAAiBI,GAAe;AAClC,YAAMwC,IAAQnD;AAEZ,MAAAwD,EAAS,KAAK,GAAGJ,EAAoBD,GAAO,EAAE,MAAM,OAAA,CAAQ,CAAC;AAAA,IAEjE;AAGA,eAAWH,KAAO5C,KAAQ;AACxB,MAAAoD,EAAS,KAAKR,CAAG;AAGnB,WAAOQ;AAAA,EACT,GAAG;AAAA,IACDtD;AAAA,IACAC;AAAA,IACAE;AAAA,IACAD;AAAA,IACA0B;AAAA,IACAP;AAAA,IACAJ;AAAA,IACAZ;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,EAAA,CACD;AACH;"}
+{"version":3,"file":"useBuildProjectDataTable.es.js","sources":["../../../../../../src/containers/ProjectTreeTable/hooks/useBuildProjectDataTable.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 { useGetEntityTypeData } from './useGetEntityTypeData'\nimport { TableGroupBy } from '../context'\nimport { buildFolderTableRow, buildTaskTableRow, linksToTableData } from '../utils'\nimport { useProjectContext } from '@shared/context/ProjectContext'\n\ntype Params = {\n  foldersMap: FolderNodeMap\n  tasksMap: TaskNodeMap\n  tasksByFolderMap: TasksByFolderMap\n  rows?: TableRow[]\n  expanded: ExpandedState\n  showHierarchy: boolean\n  isFlatFolderView?: boolean\n  showEmptyFolders?: boolean\n  loadingTasks?: LoadingTasks\n  isLoadingMore?: boolean\n  groupBy?: TableGroupBy\n  selectedFolders?: string[]\n}\n\nexport default function useBuildProjectDataTable({\n  foldersMap,\n  tasksMap,\n  rows,\n  tasksByFolderMap,\n  expanded,\n  showHierarchy,\n  isFlatFolderView = false,\n  showEmptyFolders = false,\n  loadingTasks = {},\n  isLoadingMore = false,\n  selectedFolders = [],\n}: Params): TableRow[] {\n  const project = useProjectContext()\n  const getEntityTypeData = useGetEntityTypeData({ projectInfo: project })\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      const row = buildTaskTableRow(task, foldersMap.get(parentId || task.folderId))\n      row.primary.icon = typeData?.icon || null\n      row.primary.color = typeData?.color || null\n      row.primary.links = linksToTableData(task.links, 'task', project.anatomy)\n      row.subRows = []\n      return row\n    }\n\n    const createFolderRow = (\n      folder: typeof foldersMap extends Map<string, infer T> ? T : never,\n    ) => {\n      const typeData = getEntityTypeData('folder', folder.folderType)\n      const row = buildFolderTableRow(folder)\n      row.primary.icon = typeData?.icon || null\n      row.primary.color = typeData?.color || null\n      row.primary.links = linksToTableData(folder.links, 'folder', project.anatomy)\n      row.subRows = []\n      return row\n    }\n\n    const createRootTaskRows = (): TableRow[] => {\n      const rootTaskRows: TableRow[] = []\n      for (const folderId of selectedFolders) {\n        if (foldersMap.has(folderId)) continue\n        const folderTaskIds = tasksByFolderMap.get(folderId) || []\n        for (const taskId of folderTaskIds) {\n          const task = tasksMap.get(taskId)\n          if (task) rootTaskRows.push(createTaskRow(task))\n        }\n      }\n      return rootTaskRows\n    }\n\n    // Flat folder view: all folders at root level, each expandable to show tasks\n    if (isFlatFolderView) {\n      const flatFolderRows: TableRow[] = []\n\n      for (const folder of foldersMap.values()) {\n        if (!folder?.id) continue\n\n        // Use the folder's hasTasks flag (from REST data) to filter before tasks are loaded\n        const hasTasks = folder.hasTasks ?? tasksByFolderMap.has(folder.id)\n        // Skip folders without tasks when showEmptyFolders is off\n        if (!showEmptyFolders && !hasTasks) continue\n\n        const row = createFolderRow(folder)\n        row.childOnlyMatch = folder.childOnlyMatch || false\n\n        // If folder is expanded, attach task subRows\n        if (expandedFolderIds.has(folder.id)) {\n          const folderTaskIds = tasksByFolderMap.get(folder.id) || []\n          const folderTasks = folderTaskIds.flatMap((taskId) => tasksMap.get(taskId) || [])\n\n          if (folderTasks.length || loadingTasks[folder.id]) {\n            const taskRows = folderTasks.map((task) => createTaskRow(task, folder.id))\n\n            if (loadingTasks[folder.id]) {\n              const count = loadingTasks[folder.id]\n              if (count > 0) {\n                taskRows.push(...generateLoadingRows(count))\n              }\n            }\n\n            row.subRows = taskRows\n          }\n        }\n\n        flatFolderRows.push(row)\n      }\n\n      flatFolderRows.push(...createRootTaskRows())\n\n      return flatFolderRows\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      // if we are loading more tasks, add loading rows\n      if (isLoadingMore) {\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(count)\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      const row = createFolderRow(folder)\n      row.childOnlyMatch = folder.childOnlyMatch || false\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 count = loadingTasks[folderId]\n            if (count > 0) {\n              const loadingTaskRows = generateLoadingRows(count)\n\n              taskRows.push(...loadingTaskRows)\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    rootRows.push(...createRootTaskRows())\n\n    // if we are loading more tasks, add loading rows at the root level\n    // this happens when in hierarchy mode but with a slicer selection that causes paginated tasks\n    if (showHierarchy && isLoadingMore) {\n      const count = TASKS_INFINITE_QUERY_COUNT\n      if (count > 0) {\n        rootRows.push(...generateLoadingRows(count))\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    return rootRows\n  }, [\n    foldersMap,\n    tasksMap,\n    tasksByFolderMap,\n    rows,\n    visibleFolders,\n    childToParentMap,\n    expandedFolderIds,\n    showHierarchy,\n    isFlatFolderView,\n    showEmptyFolders,\n    loadingTasks,\n    isLoadingMore,\n    selectedFolders,\n  ])\n}\n"],"names":["TASKS_INFINITE_QUERY_COUNT","useBuildProjectDataTable","foldersMap","tasksMap","rows","tasksByFolderMap","expanded","showHierarchy","isFlatFolderView","showEmptyFolders","loadingTasks","isLoadingMore","selectedFolders","project","useProjectContext","getEntityTypeData","useGetEntityTypeData","expandedKey","useMemo","expandedFolderIds","_","isExpanded","id","childToParentMap","parentToChildrenMap","childToParent","parentToChildren","folder","parentId","children","visibleFolders","visible","queue","folderId","childrenIds","childId","createTaskRow","task","typeData","row","buildTaskTableRow","linksToTableData","createFolderRow","buildFolderTableRow","createRootTaskRows","rootTaskRows","folderTaskIds","taskId","flatFolderRows","hasTasks","folderTasks","taskRows","count","generateLoadingRows","flatRows","loadingTaskRows","rowsById","rootRows","i","childRow","parentRow"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAUA,MAAMA,IAA6B;AAsBnC,SAAwBC,GAAyB;AAAA,EAC/C,YAAAC;AAAA,EACA,UAAAC;AAAA,EACA,MAAAC;AAAA,EACA,kBAAAC;AAAA,EACA,UAAAC;AAAA,EACA,eAAAC;AAAA,EACA,kBAAAC,IAAmB;AAAA,EACnB,kBAAAC,IAAmB;AAAA,EACnB,cAAAC,IAAe,CAAA;AAAA,EACf,eAAAC,IAAgB;AAAA,EAChB,iBAAAC,IAAkB,CAAA;AACpB,GAAuB;AACrB,QAAMC,IAAUC,EAAA,GACVC,IAAoBC,EAAqB,EAAE,aAAaH,GAAS,GAGjEI,IAAcC,EAAQ,MAAM,KAAK,UAAUZ,CAAQ,GAAG,CAACA,CAAQ,CAAC,GAGhEa,IAAoBD,EAAQ,MACzB,IAAI;AAAA,IACT,OAAO,QAAQZ,CAAQ,EACpB,OAAO,CAAC,CAACc,GAAGC,CAAU,MAAMA,CAAU,EACtC,IAAI,CAAC,CAACC,CAAE,MAAMA,CAAE;AAAA,EAAA,GAEpB,CAACL,CAAW,CAAC,GAGV,EAAE,kBAAAM,GAAkB,qBAAAC,EAAA,IAAwBN,EAAQ,MAAM;AAC9D,UAAMO,wBAAoB,IAAA,GACpBC,wBAAuB,IAAA;AAG7B,eAAWC,KAAUzB,EAAW,UAAU;AACxC,UAAI,CAACyB,GAAQ,GAAI;AAEjB,YAAMC,IAAWD,EAAO;AACxB,UAAIC,GAAU;AACZ,QAAAH,EAAc,IAAIE,EAAO,IAAIC,CAAQ;AAErC,YAAIC,IAAWH,EAAiB,IAAIE,CAAQ;AAC5C,QAAKC,MACHA,wBAAe,IAAA,GACfH,EAAiB,IAAIE,GAAUC,CAAQ,IAEzCA,EAAS,IAAIF,EAAO,EAAE;AAAA,MACxB;AAAA,IACF;AAEA,WAAO,EAAE,kBAAkBF,GAAe,qBAAqBC,EAAA;AAAA,EACjE,GAAG,CAACxB,CAAU,CAAC,GAGT4B,IAAiBZ,EAAQ,MAAM;AACnC,UAAMa,wBAAc,IAAA,GAGdC,IAAkB,CAAA;AACxB,eAAWL,KAAUzB,EAAW;AAC9B,MAAKyB,GAAQ,OAGT,CAACA,EAAO,YAAY,CAACzB,EAAW,IAAIyB,EAAO,QAAQ,OACrDI,EAAQ,IAAIJ,EAAO,EAAE,GACrBK,EAAM,KAAKL,EAAO,EAAE;AAKxB,WAAOK,EAAM,SAAS,KAAG;AACvB,YAAMC,IAAWD,EAAM,MAAA;AAGvB,UAAI,CAFqBb,EAAkB,IAAIc,CAAQ,EAEhC;AAGvB,YAAMC,IAAcV,EAAoB,IAAIS,CAAQ;AACpD,UAAIC;AACF,mBAAWC,KAAWD;AACpB,UAAKH,EAAQ,IAAII,CAAO,MACtBJ,EAAQ,IAAII,CAAO,GACnBH,EAAM,KAAKG,CAAO;AAAA,IAI1B;AAEA,WAAOJ;AAAA,EACT,GAAG,CAAC7B,GAAYsB,GAAqBL,CAAiB,CAAC;AAGvD,SAAOD,EAAQ,MAAM;AAEnB,UAAMkB,IAAgB,CAACC,GAAsBT,MAAgC;AAC3E,YAAMU,IAAWvB,EAAkB,QAAQsB,EAAK,QAAQ,GAClDE,IAAMC,EAAkBH,GAAMnC,EAAW,IAAI0B,KAAYS,EAAK,QAAQ,CAAC;AAC7E,aAAAE,EAAI,QAAQ,OAAOD,GAAU,QAAQ,MACrCC,EAAI,QAAQ,QAAQD,GAAU,SAAS,MACvCC,EAAI,QAAQ,QAAQE,EAAiBJ,EAAK,OAAO,QAAQxB,EAAQ,OAAO,GACxE0B,EAAI,UAAU,CAAA,GACPA;AAAA,IACT,GAEMG,IAAkB,CACtBf,MACG;AACH,YAAMW,IAAWvB,EAAkB,UAAUY,EAAO,UAAU,GACxDY,IAAMI,EAAoBhB,CAAM;AACtC,aAAAY,EAAI,QAAQ,OAAOD,GAAU,QAAQ,MACrCC,EAAI,QAAQ,QAAQD,GAAU,SAAS,MACvCC,EAAI,QAAQ,QAAQE,EAAiBd,EAAO,OAAO,UAAUd,EAAQ,OAAO,GAC5E0B,EAAI,UAAU,CAAA,GACPA;AAAA,IACT,GAEMK,IAAqB,MAAkB;AAC3C,YAAMC,IAA2B,CAAA;AACjC,iBAAWZ,KAAYrB,GAAiB;AACtC,YAAIV,EAAW,IAAI+B,CAAQ,EAAG;AAC9B,cAAMa,IAAgBzC,EAAiB,IAAI4B,CAAQ,KAAK,CAAA;AACxD,mBAAWc,KAAUD,GAAe;AAClC,gBAAMT,IAAOlC,EAAS,IAAI4C,CAAM;AAChC,UAAIV,KAAMQ,EAAa,KAAKT,EAAcC,CAAI,CAAC;AAAA,QACjD;AAAA,MACF;AACA,aAAOQ;AAAA,IACT;AAGA,QAAIrC,GAAkB;AACpB,YAAMwC,IAA6B,CAAA;AAEnC,iBAAWrB,KAAUzB,EAAW,UAAU;AACxC,YAAI,CAACyB,GAAQ,GAAI;AAGjB,cAAMsB,IAAWtB,EAAO,YAAYtB,EAAiB,IAAIsB,EAAO,EAAE;AAElE,YAAI,CAAClB,KAAoB,CAACwC,EAAU;AAEpC,cAAMV,IAAMG,EAAgBf,CAAM;AAIlC,YAHAY,EAAI,iBAAiBZ,EAAO,kBAAkB,IAG1CR,EAAkB,IAAIQ,EAAO,EAAE,GAAG;AAEpC,gBAAMuB,KADgB7C,EAAiB,IAAIsB,EAAO,EAAE,KAAK,CAAA,GACvB,QAAQ,CAACoB,MAAW5C,EAAS,IAAI4C,CAAM,KAAK,EAAE;AAEhF,cAAIG,EAAY,UAAUxC,EAAaiB,EAAO,EAAE,GAAG;AACjD,kBAAMwB,IAAWD,EAAY,IAAI,CAACb,MAASD,EAAcC,GAAMV,EAAO,EAAE,CAAC;AAEzE,gBAAIjB,EAAaiB,EAAO,EAAE,GAAG;AAC3B,oBAAMyB,IAAQ1C,EAAaiB,EAAO,EAAE;AACpC,cAAIyB,IAAQ,KACVD,EAAS,KAAK,GAAGE,EAAoBD,CAAK,CAAC;AAAA,YAE/C;AAEA,YAAAb,EAAI,UAAUY;AAAA,UAChB;AAAA,QACF;AAEA,QAAAH,EAAe,KAAKT,CAAG;AAAA,MACzB;AAEA,aAAAS,EAAe,KAAK,GAAGJ,GAAoB,GAEpCI;AAAA,IACT;AAGA,QAAI,CAACzC,GAAe;AAClB,YAAM+C,IAAuB,CAAA;AAG7B,iBAAWjB,KAAQlC,EAAS;AAC1B,QAAKkC,EAAK,MACViB,EAAS,KAAKlB,EAAcC,CAAI,CAAC;AAInC,iBAAWE,KAAOnC,KAAQ;AACxB,QAAAkD,EAAS,KAAKf,CAAG;AAInB,UAAI5B,GAAe;AAEjB,cAAMyC,IAAQpD;AACC;AACb,gBAAMuD,IAAkBF,EAAoBD,CAAK;AAEjD,UAAAE,EAAS,KAAK,GAAGC,CAAe;AAAA,QAClC;AAAA,MACF;AAEA,aAAOD;AAAA,IACT;AAGA,UAAME,wBAAe,IAAA,GACfC,IAAuB,CAAA;AAG7B,eAAWxB,KAAYH,GAAgB;AACrC,YAAMH,IAASzB,EAAW,IAAI+B,CAAQ;AACtC,UAAI,CAACN,EAAQ;AAEb,YAAMY,IAAMG,EAAgBf,CAAM;AAWlC,UAVAY,EAAI,iBAAiBZ,EAAO,kBAAkB,IAE9C6B,EAAS,IAAIvB,GAAUM,CAAG,IAGtB,CAACZ,EAAO,YAAY,CAACzB,EAAW,IAAIyB,EAAO,QAAQ,MACrD8B,EAAS,KAAKlB,CAAG,GAIfpB,EAAkB,IAAIc,CAAQ,GAAG;AAInC,cAAMiB,KADgB7C,EAAiB,IAAI4B,CAAQ,KAAK,CAAA,GACtB,QAAQ,CAACc,MAAW5C,EAAS,IAAI4C,CAAM,KAAK,EAAE;AAEhF,YAAIG,EAAY,UAAUxC,EAAauB,CAAQ,GAAG;AAEhD,gBAAMkB,IAAW,IAAI,MAAgBD,EAAY,MAAM;AAGvD,mBAASQ,IAAI,GAAGA,IAAIR,EAAY,QAAQQ;AACtC,YAAAP,EAASO,CAAC,IAAItB,EAAcc,EAAYQ,CAAC,GAAGzB,CAAQ;AAItD,cAAIvB,EAAauB,CAAQ,GAAG;AAC1B,kBAAMmB,IAAQ1C,EAAauB,CAAQ;AACnC,gBAAImB,IAAQ,GAAG;AACb,oBAAMG,IAAkBF,EAAoBD,CAAK;AAEjD,cAAAD,EAAS,KAAK,GAAGI,CAAe;AAAA,YAClC;AAAA,UACF;AAEA,UAAAhB,EAAI,UAAUY;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAGA,eAAWlB,KAAYH,GAAgB;AACrC,YAAMF,IAAWL,EAAiB,IAAIU,CAAQ;AAC9C,UAAI,CAACL,KAAY,CAACT,EAAkB,IAAIS,CAAQ,EAAG;AAEnD,YAAM+B,IAAWH,EAAS,IAAIvB,CAAQ,GAChC2B,IAAYJ,EAAS,IAAI5B,CAAQ;AAEvC,MAAI,CAAC+B,KAAY,CAACC,KAGlBA,EAAU,SAAS,KAAKD,CAAQ;AAAA,IAClC;AAMA,QAJAF,EAAS,KAAK,GAAGb,GAAoB,GAIjCrC,KAAiBI,GAAe;AAClC,YAAMyC,IAAQpD;AAEZ,MAAAyD,EAAS,KAAK,GAAGJ,EAAoBD,CAAK,CAAC;AAAA,IAE/C;AAGA,eAAWb,KAAOnC,KAAQ;AACxB,MAAAqD,EAAS,KAAKlB,CAAG;AAGnB,WAAOkB;AAAA,EACT,GAAG;AAAA,IACDvD;AAAA,IACAC;AAAA,IACAE;AAAA,IACAD;AAAA,IACA0B;AAAA,IACAP;AAAA,IACAJ;AAAA,IACAZ;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,IACAC;AAAA,EAAA,CACD;AACH;"}