@greatapps/common 1.1.536 → 1.1.539

package/dist/infra/utils/array.mjs

@@ -3,6 +3,69 @@ function insertSorted(data, newItem, compareFn) {
   if (index === -1) return [...data, newItem];
   return [...data.slice(0, index), newItem, ...data.slice(index)];
 }
+function insertIntoPaginatedCache({
+  pages,
+  pageNumbers,
+  newItem,
+  pageSize,
+  compareFn
+}) {
+  if (!pages.length) return pages;
+  if (!compareFn) {
+    const firstIdx = pageNumbers.indexOf(1);
+    if (firstIdx === -1) return pages;
+    const result2 = pages.slice();
+    let carry2 = newItem;
+    for (let i = firstIdx; i < result2.length && carry2 !== null; i++) {
+      const current = result2[i];
+      const nextData = [carry2, ...current.data];
+      const overflow = nextData.length > pageSize ? nextData[nextData.length - 1] : null;
+      result2[i] = {
+        ...current,
+        data: overflow !== null ? nextData.slice(0, pageSize) : nextData,
+        total: current.total + 1
+      };
+      carry2 = overflow;
+    }
+    return result2;
+  }
+  let targetIdx = -1;
+  for (let i = 0; i < pages.length; i++) {
+    const page = pages[i];
+    if (!page.data.length) continue;
+    const last = page.data[page.data.length - 1];
+    if (compareFn(newItem, last) <= 0) {
+      targetIdx = i;
+      break;
+    }
+  }
+  if (targetIdx === -1) {
+    const lastIdx = pages.length - 1;
+    const lastPage = pages[lastIdx];
+    if (lastPage.data.length < pageSize) {
+      targetIdx = lastIdx;
+    } else {
+      return pages.map((p) => ({ ...p, total: p.total + 1 }));
+    }
+  }
+  const result = pages.slice();
+  let carry = newItem;
+  for (let i = targetIdx; i < result.length && carry !== null; i++) {
+    const current = result[i];
+    const withInserted = insertSorted(current.data, carry, compareFn);
+    const overflow = withInserted.length > pageSize ? withInserted[withInserted.length - 1] : null;
+    result[i] = {
+      ...current,
+      data: overflow !== null ? withInserted.slice(0, pageSize) : withInserted,
+      total: current.total + 1
+    };
+    carry = overflow;
+  }
+  for (let i = 0; i < targetIdx; i++) {
+    result[i] = { ...result[i], total: result[i].total + 1 };
+  }
+  return result;
+}
 function buildCompareFn(sort) {
   const fields = sort.split(",").map((f) => f.trim()).filter(Boolean);
   const parsedFields = fields.map((field) => {
@@ -29,6 +92,7 @@ function buildCompareFn(sort) {
 }
 export {
   buildCompareFn,
+  insertIntoPaginatedCache,
   insertSorted
 };
 //# sourceMappingURL=array.mjs.map

package/dist/infra/utils/array.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/infra/utils/array.ts"],"sourcesContent":["/**\n * Insere um item em um array já ordenado, mantendo a ordenação\n * com base na função de comparação fornecida.\n */\nexport function insertSorted<T>(\n  data: T[],\n  newItem: T,\n  compareFn: (a: T, b: T) => number\n): T[] {\n  const index = data.findIndex((item) => compareFn(newItem, item) < 0);\n  if (index === -1) return [...data, newItem];\n  return [...data.slice(0, index), newItem, ...data.slice(index)];\n}\n\n/**\n * Cria uma função de comparação a partir de uma string de sort da API.\n * Suporta múltiplos campos separados por vírgula e prefixo `-` para desc.\n *\n * Exemplos:\n * - \"title\" → ascendente por title\n * - \"-title\" → descendente por title\n * - \"title,-datetime_add\" → ascendente por title, depois descendente por datetime_add\n */\nexport function buildCompareFn<T extends Record<string, unknown>>(\n  sort: string\n): (a: T, b: T) => number {\n  const fields = sort.split(',').map((f) => f.trim()).filter(Boolean);\n\n  const parsedFields = fields.map((field) => {\n    const desc = field.startsWith('-');\n    const key = desc ? field.slice(1) : field;\n    return { key, desc };\n  });\n\n  return (a: T, b: T) => {\n    for (const { key, desc } of parsedFields) {\n      const aVal = a[key];\n      const bVal = b[key];\n\n      let result: number;\n\n      if (typeof aVal === 'string' && typeof bVal === 'string') {\n        result = aVal.localeCompare(bVal);\n      } else if (typeof aVal === 'number' && typeof bVal === 'number') {\n        result = aVal - bVal;\n      } else {\n        result = String(aVal ?? '').localeCompare(String(bVal ?? ''));\n      }\n\n      if (result !== 0) return desc ? -result : result;\n    }\n    return 0;\n  };\n}\n"],"mappings":"AAIO,SAAS,aACd,MACA,SACA,WACK;AACL,QAAM,QAAQ,KAAK,UAAU,CAAC,SAAS,UAAU,SAAS,IAAI,IAAI,CAAC;AACnE,MAAI,UAAU,GAAI,QAAO,CAAC,GAAG,MAAM,OAAO;AAC1C,SAAO,CAAC,GAAG,KAAK,MAAM,GAAG,KAAK,GAAG,SAAS,GAAG,KAAK,MAAM,KAAK,CAAC;AAChE;AAWO,SAAS,eACd,MACwB;AACxB,QAAM,SAAS,KAAK,MAAM,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,OAAO;AAElE,QAAM,eAAe,OAAO,IAAI,CAAC,UAAU;AACzC,UAAM,OAAO,MAAM,WAAW,GAAG;AACjC,UAAM,MAAM,OAAO,MAAM,MAAM,CAAC,IAAI;AACpC,WAAO,EAAE,KAAK,KAAK;AAAA,EACrB,CAAC;AAED,SAAO,CAAC,GAAM,MAAS;AACrB,eAAW,EAAE,KAAK,KAAK,KAAK,cAAc;AACxC,YAAM,OAAO,EAAE,GAAG;AAClB,YAAM,OAAO,EAAE,GAAG;AAElB,UAAI;AAEJ,UAAI,OAAO,SAAS,YAAY,OAAO,SAAS,UAAU;AACxD,iBAAS,KAAK,cAAc,IAAI;AAAA,MAClC,WAAW,OAAO,SAAS,YAAY,OAAO,SAAS,UAAU;AAC/D,iBAAS,OAAO;AAAA,MAClB,OAAO;AACL,iBAAS,OAAO,QAAQ,EAAE,EAAE,cAAc,OAAO,QAAQ,EAAE,CAAC;AAAA,MAC9D;AAEA,UAAI,WAAW,EAAG,QAAO,OAAO,CAAC,SAAS;AAAA,IAC5C;AACA,WAAO;AAAA,EACT;AACF;","names":[]}
+{"version":3,"sources":["../../../src/infra/utils/array.ts"],"sourcesContent":["/**\n * Insere um item em um array já ordenado, mantendo a ordenação\n * com base na função de comparação fornecida.\n */\nexport function insertSorted<T>(\n  data: T[],\n  newItem: T,\n  compareFn: (a: T, b: T) => number\n): T[] {\n  const index = data.findIndex((item) => compareFn(newItem, item) < 0);\n  if (index === -1) return [...data, newItem];\n  return [...data.slice(0, index), newItem, ...data.slice(index)];\n}\n\nexport interface PaginatedPageCache<T> {\n  data: T[];\n  total: number;\n}\n\nexport interface InsertIntoPaginatedCacheParams<T> {\n  /** Páginas atuais do cache, ordenadas por número de página (1..N). */\n  pages: PaginatedPageCache<T>[];\n  /** Números das páginas correspondentes (mesmo tamanho de `pages`). */\n  pageNumbers: number[];\n  /** Novo item a inserir. */\n  newItem: T;\n  /** Tamanho fixo de cada página. */\n  pageSize: number;\n  /**\n   * Função de comparação que mantém a ordem.\n   * Se não fornecida, insere no topo da página 1 (sem reordenar).\n   */\n  compareFn?: (a: T, b: T) => number;\n}\n\n/**\n * Insere um item em um conjunto de páginas paginadas mantendo ordenação.\n *\n * Quando `compareFn` é fornecida, descobre em qual página o item deveria\n * cair (comparando com o último item de cada página). Insere na posição\n * correta e empurra o último item da página para a próxima, propagando\n * o overflow até a última página disponível.\n *\n * Páginas não-afetadas retornam a mesma referência.\n */\nexport function insertIntoPaginatedCache<T>({\n  pages,\n  pageNumbers,\n  newItem,\n  pageSize,\n  compareFn,\n}: InsertIntoPaginatedCacheParams<T>): PaginatedPageCache<T>[] {\n  if (!pages.length) return pages;\n\n  // Sem sort: insere no topo da página 1 e propaga overflow\n  if (!compareFn) {\n    // Só atualiza se a página 1 estiver no cache\n    const firstIdx = pageNumbers.indexOf(1);\n    if (firstIdx === -1) return pages;\n\n    const result: PaginatedPageCache<T>[] = pages.slice();\n    let carry: T | null = newItem;\n    for (let i = firstIdx; i < result.length && carry !== null; i++) {\n      const current = result[i];\n      const nextData: T[] = [carry, ...current.data];\n      const overflow: T | null =\n        nextData.length > pageSize ? nextData[nextData.length - 1] : null;\n      result[i] = {\n        ...current,\n        data: overflow !== null ? nextData.slice(0, pageSize) : nextData,\n        total: current.total + 1,\n      };\n      carry = overflow;\n    }\n    return result;\n  }\n\n  // Descobre em qual página o item cai\n  let targetIdx = -1;\n  for (let i = 0; i < pages.length; i++) {\n    const page = pages[i];\n    if (!page.data.length) continue;\n    const last = page.data[page.data.length - 1];\n    // Se newItem vem antes (ou igual) ao último item desta página, cai aqui\n    if (compareFn(newItem, last) <= 0) {\n      targetIdx = i;\n      break;\n    }\n  }\n\n  // Não coube em nenhuma página com itens — tenta a última página se for incompleta\n  if (targetIdx === -1) {\n    const lastIdx = pages.length - 1;\n    const lastPage = pages[lastIdx];\n    if (lastPage.data.length < pageSize) {\n      targetIdx = lastIdx;\n    } else {\n      // Não cai em nenhuma página carregada — apenas incrementa total\n      return pages.map((p) => ({ ...p, total: p.total + 1 }));\n    }\n  }\n\n  // Insere no target e propaga overflow para as páginas seguintes\n  const result: PaginatedPageCache<T>[] = pages.slice();\n  let carry: T | null = newItem;\n\n  for (let i = targetIdx; i < result.length && carry !== null; i++) {\n    const current = result[i];\n    const withInserted: T[] = insertSorted(current.data, carry, compareFn);\n    const overflow: T | null =\n      withInserted.length > pageSize ? withInserted[withInserted.length - 1] : null;\n    result[i] = {\n      ...current,\n      data: overflow !== null ? withInserted.slice(0, pageSize) : withInserted,\n      total: current.total + 1,\n    };\n    carry = overflow;\n  }\n\n  // Incrementa o total nas páginas anteriores ao target (não mudaram mas o total global cresceu)\n  for (let i = 0; i < targetIdx; i++) {\n    result[i] = { ...result[i], total: result[i].total + 1 };\n  }\n\n  return result;\n}\n\n/**\n * Cria uma função de comparação a partir de uma string de sort da API.\n * Suporta múltiplos campos separados por vírgula e prefixo `-` para desc.\n *\n * Exemplos:\n * - \"title\" → ascendente por title\n * - \"-title\" → descendente por title\n * - \"title,-datetime_add\" → ascendente por title, depois descendente por datetime_add\n */\nexport function buildCompareFn<T extends Record<string, unknown>>(\n  sort: string\n): (a: T, b: T) => number {\n  const fields = sort.split(',').map((f) => f.trim()).filter(Boolean);\n\n  const parsedFields = fields.map((field) => {\n    const desc = field.startsWith('-');\n    const key = desc ? field.slice(1) : field;\n    return { key, desc };\n  });\n\n  return (a: T, b: T) => {\n    for (const { key, desc } of parsedFields) {\n      const aVal = a[key];\n      const bVal = b[key];\n\n      let result: number;\n\n      if (typeof aVal === 'string' && typeof bVal === 'string') {\n        result = aVal.localeCompare(bVal);\n      } else if (typeof aVal === 'number' && typeof bVal === 'number') {\n        result = aVal - bVal;\n      } else {\n        result = String(aVal ?? '').localeCompare(String(bVal ?? ''));\n      }\n\n      if (result !== 0) return desc ? -result : result;\n    }\n    return 0;\n  };\n}\n"],"mappings":"AAIO,SAAS,aACd,MACA,SACA,WACK;AACL,QAAM,QAAQ,KAAK,UAAU,CAAC,SAAS,UAAU,SAAS,IAAI,IAAI,CAAC;AACnE,MAAI,UAAU,GAAI,QAAO,CAAC,GAAG,MAAM,OAAO;AAC1C,SAAO,CAAC,GAAG,KAAK,MAAM,GAAG,KAAK,GAAG,SAAS,GAAG,KAAK,MAAM,KAAK,CAAC;AAChE;AAiCO,SAAS,yBAA4B;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GAA+D;AAC7D,MAAI,CAAC,MAAM,OAAQ,QAAO;AAG1B,MAAI,CAAC,WAAW;AAEd,UAAM,WAAW,YAAY,QAAQ,CAAC;AACtC,QAAI,aAAa,GAAI,QAAO;AAE5B,UAAMA,UAAkC,MAAM,MAAM;AACpD,QAAIC,SAAkB;AACtB,aAAS,IAAI,UAAU,IAAID,QAAO,UAAUC,WAAU,MAAM,KAAK;AAC/D,YAAM,UAAUD,QAAO,CAAC;AACxB,YAAM,WAAgB,CAACC,QAAO,GAAG,QAAQ,IAAI;AAC7C,YAAM,WACJ,SAAS,SAAS,WAAW,SAAS,SAAS,SAAS,CAAC,IAAI;AAC/D,MAAAD,QAAO,CAAC,IAAI;AAAA,QACV,GAAG;AAAA,QACH,MAAM,aAAa,OAAO,SAAS,MAAM,GAAG,QAAQ,IAAI;AAAA,QACxD,OAAO,QAAQ,QAAQ;AAAA,MACzB;AACA,MAAAC,SAAQ;AAAA,IACV;AACA,WAAOD;AAAA,EACT;AAGA,MAAI,YAAY;AAChB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,OAAO,MAAM,CAAC;AACpB,QAAI,CAAC,KAAK,KAAK,OAAQ;AACvB,UAAM,OAAO,KAAK,KAAK,KAAK,KAAK,SAAS,CAAC;AAE3C,QAAI,UAAU,SAAS,IAAI,KAAK,GAAG;AACjC,kBAAY;AACZ;AAAA,IACF;AAAA,EACF;AAGA,MAAI,cAAc,IAAI;AACpB,UAAM,UAAU,MAAM,SAAS;AAC/B,UAAM,WAAW,MAAM,OAAO;AAC9B,QAAI,SAAS,KAAK,SAAS,UAAU;AACnC,kBAAY;AAAA,IACd,OAAO;AAEL,aAAO,MAAM,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,OAAO,EAAE,QAAQ,EAAE,EAAE;AAAA,IACxD;AAAA,EACF;AAGA,QAAM,SAAkC,MAAM,MAAM;AACpD,MAAI,QAAkB;AAEtB,WAAS,IAAI,WAAW,IAAI,OAAO,UAAU,UAAU,MAAM,KAAK;AAChE,UAAM,UAAU,OAAO,CAAC;AACxB,UAAM,eAAoB,aAAa,QAAQ,MAAM,OAAO,SAAS;AACrE,UAAM,WACJ,aAAa,SAAS,WAAW,aAAa,aAAa,SAAS,CAAC,IAAI;AAC3E,WAAO,CAAC,IAAI;AAAA,MACV,GAAG;AAAA,MACH,MAAM,aAAa,OAAO,aAAa,MAAM,GAAG,QAAQ,IAAI;AAAA,MAC5D,OAAO,QAAQ,QAAQ;AAAA,IACzB;AACA,YAAQ;AAAA,EACV;AAGA,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,WAAO,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC,GAAG,OAAO,OAAO,CAAC,EAAE,QAAQ,EAAE;AAAA,EACzD;AAEA,SAAO;AACT;AAWO,SAAS,eACd,MACwB;AACxB,QAAM,SAAS,KAAK,MAAM,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,OAAO;AAElE,QAAM,eAAe,OAAO,IAAI,CAAC,UAAU;AACzC,UAAM,OAAO,MAAM,WAAW,GAAG;AACjC,UAAM,MAAM,OAAO,MAAM,MAAM,CAAC,IAAI;AACpC,WAAO,EAAE,KAAK,KAAK;AAAA,EACrB,CAAC;AAED,SAAO,CAAC,GAAM,MAAS;AACrB,eAAW,EAAE,KAAK,KAAK,KAAK,cAAc;AACxC,YAAM,OAAO,EAAE,GAAG;AAClB,YAAM,OAAO,EAAE,GAAG;AAElB,UAAI;AAEJ,UAAI,OAAO,SAAS,YAAY,OAAO,SAAS,UAAU;AACxD,iBAAS,KAAK,cAAc,IAAI;AAAA,MAClC,WAAW,OAAO,SAAS,YAAY,OAAO,SAAS,UAAU;AAC/D,iBAAS,OAAO;AAAA,MAClB,OAAO;AACL,iBAAS,OAAO,QAAQ,EAAE,EAAE,cAAc,OAAO,QAAQ,EAAE,CAAC;AAAA,MAC9D;AAEA,UAAI,WAAW,EAAG,QAAO,OAAO,CAAC,SAAS;AAAA,IAC5C;AACA,WAAO;AAAA,EACT;AACF;","names":["result","carry"]}

package/dist/modules/projects/hooks/create-project.hook.mjs

@@ -4,16 +4,16 @@ import { createProjectAction } from "../actions/create-project.action";
 import { withAction } from "../../../utils/withAction";
 import { useAuthQueryKey } from "../../../hooks/useAuthQueryKey";
 import { PROJECTS_BASE_KEY } from "./list-projects.hook";
-import { insertSorted, buildCompareFn } from "../../../infra/utils/array";
-function extractSort(query) {
+import { buildCompareFn, insertIntoPaginatedCache } from "../../../infra/utils/array";
+function extractQueryParams(query) {
   const key = query.queryKey;
   for (let i = key.length - 1; i >= 0; i--) {
     const segment = key[i];
-    if (segment && typeof segment === "object" && "sort" in segment) {
-      return segment.sort;
+    if (segment !== null && typeof segment === "object") {
+      return segment;
     }
   }
-  return void 0;
+  return {};
 }
 function useCreateProject() {
   const queryClient = useQueryClient();
@@ -23,42 +23,65 @@ function useCreateProject() {
     onSuccess: (newProject) => {
       const cache = queryClient.getQueryCache();
       const queries = cache.findAll({ queryKey: projectsKey });
-      for (const query of queries) {
-        const sort = extractSort(query);
-        const isInfinite = query.queryKey.includes("infinite");
-        if (isInfinite) {
-          queryClient.setQueryData(
-            query.queryKey,
-            (old) => {
-              if (!old?.pages.length) return old;
-              const pageSize = old.pages[0].data.length || 20;
-              const allItems = old.pages.flatMap((page) => page.data);
-              const withNew = sort ? insertSorted(allItems, newProject, buildCompareFn(sort)) : [newProject, ...allItems];
-              const newTotal = (old.pages[0].total ?? 0) + 1;
-              return {
-                ...old,
-                pages: old.pages.map((page, i) => ({
-                  ...page,
-                  data: withNew.slice(i * pageSize, (i + 1) * pageSize),
-                  total: newTotal
-                }))
-              };
-            }
-          );
+      const infiniteQueries = queries.filter((q) => q.queryKey.includes("infinite"));
+      for (const query of infiniteQueries) {
+        const { sort } = extractQueryParams(query);
+        const compareFn = sort ? buildCompareFn(sort) : void 0;
+        queryClient.setQueryData(query.queryKey, (old) => {
+          if (!old?.pages.length) return old;
+          const pageSize = old.pages[0].data.length || 20;
+          const newPages = insertIntoPaginatedCache({
+            pages: old.pages,
+            pageNumbers: old.pages.map((_, i) => i + 1),
+            newItem: newProject,
+            pageSize,
+            compareFn
+          });
+          return { ...old, pages: newPages.map((p, i) => ({ ...old.pages[i], ...p })) };
+        });
+      }
+      const paginatedQueries = queries.filter((q) => !q.queryKey.includes("infinite"));
+      const groups = /* @__PURE__ */ new Map();
+      for (const query of paginatedQueries) {
+        const params = extractQueryParams(query);
+        const { page: _page, ...rest } = params;
+        void _page;
+        const signature = JSON.stringify(rest);
+        const existing = groups.get(signature);
+        if (existing) {
+          existing.queries.push(query);
         } else {
-          queryClient.setQueryData(
-            query.queryKey,
-            (old) => {
-              if (!old) return old;
-              const pageSize = old.data.length || 20;
-              const withNew = sort ? insertSorted(old.data, newProject, buildCompareFn(sort)) : [newProject, ...old.data];
-              return {
-                ...old,
-                data: withNew.slice(0, pageSize),
-                total: old.total + 1
-              };
-            }
-          );
+          groups.set(signature, { queries: [query], sort: params.sort });
+        }
+      }
+      for (const { queries: groupQueries, sort } of groups.values()) {
+        const compareFn = sort ? buildCompareFn(sort) : void 0;
+        const sortedByPage = groupQueries.map((q) => ({ query: q, page: extractQueryParams(q).page ?? 1 })).sort((a, b) => a.page - b.page);
+        const pages = [];
+        const pageNumbers = [];
+        for (const { query, page } of sortedByPage) {
+          const data = queryClient.getQueryData(query.queryKey);
+          if (data) {
+            pages.push(data);
+            pageNumbers.push(page);
+          }
+        }
+        if (!pages.length) continue;
+        const pageSize = pages[0].data.length || 20;
+        const newPages = insertIntoPaginatedCache({
+          pages,
+          pageNumbers,
+          newItem: newProject,
+          pageSize,
+          compareFn
+        });
+        for (let i = 0; i < sortedByPage.length; i++) {
+          if (newPages[i] !== pages[i]) {
+            queryClient.setQueryData(sortedByPage[i].query.queryKey, {
+              ...pages[i],
+              ...newPages[i]
+            });
+          }
         }
       }
       queryClient.invalidateQueries({ queryKey: projectsKey });

package/dist/modules/projects/hooks/create-project.hook.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../src/modules/projects/hooks/create-project.hook.ts"],"sourcesContent":["'use client';\n\nimport { useMutation, useQueryClient, InfiniteData, Query } from '@tanstack/react-query';\nimport { createProjectAction } from '../actions/create-project.action';\nimport { withAction } from '../../../utils/withAction';\nimport { useAuthQueryKey } from '../../../hooks/useAuthQueryKey';\nimport { PROJECTS_BASE_KEY } from './list-projects.hook';\nimport { insertSorted, buildCompareFn } from '../../../infra/utils/array';\nimport type { CreateProjectRequest, Project, ProjectsPage } from '../types';\n\nfunction extractSort(query: Query): string | undefined {\n  const key = query.queryKey;\n  for (let i = key.length - 1; i >= 0; i--) {\n    const segment = key[i];\n    if (segment && typeof segment === 'object' && 'sort' in segment) {\n      return (segment as Record<string, unknown>).sort as string | undefined;\n    }\n  }\n  return undefined;\n}\n\nexport function useCreateProject() {\n  const queryClient = useQueryClient();\n  const projectsKey = useAuthQueryKey([...PROJECTS_BASE_KEY]);\n\n  return useMutation({\n    mutationFn: (data: CreateProjectRequest) =>\n      withAction(createProjectAction)(data),\n\n    onSuccess: (newProject: Project) => {\n      const cache = queryClient.getQueryCache();\n      const queries = cache.findAll({ queryKey: projectsKey });\n\n      for (const query of queries) {\n        const sort = extractSort(query);\n        const isInfinite = query.queryKey.includes('infinite');\n\n        if (isInfinite) {\n          queryClient.setQueryData<InfiniteData<ProjectsPage>>(\n            query.queryKey,\n            (old) => {\n              if (!old?.pages.length) return old;\n\n              const pageSize = old.pages[0].data.length || 20;\n              const allItems = old.pages.flatMap((page) => page.data);\n\n              const withNew = sort\n                ? insertSorted(allItems, newProject, buildCompareFn<Project>(sort))\n                : [newProject, ...allItems];\n\n              const newTotal = (old.pages[0].total ?? 0) + 1;\n\n              return {\n                ...old,\n                pages: old.pages.map((page, i) => ({\n                  ...page,\n                  data: withNew.slice(i * pageSize, (i + 1) * pageSize),\n                  total: newTotal,\n                })),\n              };\n            },\n          );\n        } else {\n          queryClient.setQueryData<ProjectsPage>(\n            query.queryKey,\n            (old) => {\n              if (!old) return old;\n\n              const pageSize = old.data.length || 20;\n\n              const withNew = sort\n                ? insertSorted(old.data, newProject, buildCompareFn<Project>(sort))\n                : [newProject, ...old.data];\n\n              return {\n                ...old,\n                data: withNew.slice(0, pageSize),\n                total: old.total + 1,\n              };\n            },\n          );\n        }\n      }\n\n      queryClient.invalidateQueries({ queryKey: projectsKey });\n    },\n  });\n}\n"],"mappings":";AAEA,SAAS,aAAa,sBAA2C;AACjE,SAAS,2BAA2B;AACpC,SAAS,kBAAkB;AAC3B,SAAS,uBAAuB;AAChC,SAAS,yBAAyB;AAClC,SAAS,cAAc,sBAAsB;AAG7C,SAAS,YAAY,OAAkC;AACrD,QAAM,MAAM,MAAM;AAClB,WAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,UAAM,UAAU,IAAI,CAAC;AACrB,QAAI,WAAW,OAAO,YAAY,YAAY,UAAU,SAAS;AAC/D,aAAQ,QAAoC;AAAA,IAC9C;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,mBAAmB;AACjC,QAAM,cAAc,eAAe;AACnC,QAAM,cAAc,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;AAE1D,SAAO,YAAY;AAAA,IACjB,YAAY,CAAC,SACX,WAAW,mBAAmB,EAAE,IAAI;AAAA,IAEtC,WAAW,CAAC,eAAwB;AAClC,YAAM,QAAQ,YAAY,cAAc;AACxC,YAAM,UAAU,MAAM,QAAQ,EAAE,UAAU,YAAY,CAAC;AAEvD,iBAAW,SAAS,SAAS;AAC3B,cAAM,OAAO,YAAY,KAAK;AAC9B,cAAM,aAAa,MAAM,SAAS,SAAS,UAAU;AAErD,YAAI,YAAY;AACd,sBAAY;AAAA,YACV,MAAM;AAAA,YACN,CAAC,QAAQ;AACP,kBAAI,CAAC,KAAK,MAAM,OAAQ,QAAO;AAE/B,oBAAM,WAAW,IAAI,MAAM,CAAC,EAAE,KAAK,UAAU;AAC7C,oBAAM,WAAW,IAAI,MAAM,QAAQ,CAAC,SAAS,KAAK,IAAI;AAEtD,oBAAM,UAAU,OACZ,aAAa,UAAU,YAAY,eAAwB,IAAI,CAAC,IAChE,CAAC,YAAY,GAAG,QAAQ;AAE5B,oBAAM,YAAY,IAAI,MAAM,CAAC,EAAE,SAAS,KAAK;AAE7C,qBAAO;AAAA,gBACL,GAAG;AAAA,gBACH,OAAO,IAAI,MAAM,IAAI,CAAC,MAAM,OAAO;AAAA,kBACjC,GAAG;AAAA,kBACH,MAAM,QAAQ,MAAM,IAAI,WAAW,IAAI,KAAK,QAAQ;AAAA,kBACpD,OAAO;AAAA,gBACT,EAAE;AAAA,cACJ;AAAA,YACF;AAAA,UACF;AAAA,QACF,OAAO;AACL,sBAAY;AAAA,YACV,MAAM;AAAA,YACN,CAAC,QAAQ;AACP,kBAAI,CAAC,IAAK,QAAO;AAEjB,oBAAM,WAAW,IAAI,KAAK,UAAU;AAEpC,oBAAM,UAAU,OACZ,aAAa,IAAI,MAAM,YAAY,eAAwB,IAAI,CAAC,IAChE,CAAC,YAAY,GAAG,IAAI,IAAI;AAE5B,qBAAO;AAAA,gBACL,GAAG;AAAA,gBACH,MAAM,QAAQ,MAAM,GAAG,QAAQ;AAAA,gBAC/B,OAAO,IAAI,QAAQ;AAAA,cACrB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,kBAAY,kBAAkB,EAAE,UAAU,YAAY,CAAC;AAAA,IACzD;AAAA,EACF,CAAC;AACH;","names":[]}
+{"version":3,"sources":["../../../../src/modules/projects/hooks/create-project.hook.ts"],"sourcesContent":["'use client';\n\nimport { useMutation, useQueryClient, InfiniteData, Query } from '@tanstack/react-query';\nimport { createProjectAction } from '../actions/create-project.action';\nimport { withAction } from '../../../utils/withAction';\nimport { useAuthQueryKey } from '../../../hooks/useAuthQueryKey';\nimport { PROJECTS_BASE_KEY } from './list-projects.hook';\nimport { buildCompareFn, insertIntoPaginatedCache } from '../../../infra/utils/array';\nimport type { CreateProjectRequest, Project, ProjectsPage } from '../types';\n\ntype QueryParams = { sort?: string; page?: number; [key: string]: unknown };\n\nfunction extractQueryParams(query: Query): QueryParams {\n  const key = query.queryKey;\n  for (let i = key.length - 1; i >= 0; i--) {\n    const segment = key[i];\n    if (segment !== null && typeof segment === 'object') {\n      return segment as QueryParams;\n    }\n  }\n  return {};\n}\n\nexport function useCreateProject() {\n  const queryClient = useQueryClient();\n  const projectsKey = useAuthQueryKey([...PROJECTS_BASE_KEY]);\n\n  return useMutation({\n    mutationFn: (data: CreateProjectRequest) =>\n      withAction(createProjectAction)(data),\n\n    onSuccess: (newProject: Project) => {\n      const cache = queryClient.getQueryCache();\n      const queries = cache.findAll({ queryKey: projectsKey });\n\n      // 1) Caches infinite: todas as páginas vivem no mesmo queryData\n      const infiniteQueries = queries.filter((q) => q.queryKey.includes('infinite'));\n\n      for (const query of infiniteQueries) {\n        const { sort } = extractQueryParams(query);\n        const compareFn = sort ? buildCompareFn<Project>(sort) : undefined;\n\n        queryClient.setQueryData<InfiniteData<ProjectsPage>>(query.queryKey, (old) => {\n          if (!old?.pages.length) return old;\n\n          const pageSize = old.pages[0].data.length || 20;\n          const newPages = insertIntoPaginatedCache({\n            pages: old.pages,\n            pageNumbers: old.pages.map((_, i) => i + 1),\n            newItem: newProject,\n            pageSize,\n            compareFn,\n          });\n\n          return { ...old, pages: newPages.map((p, i) => ({ ...old.pages[i], ...p })) };\n        });\n      }\n\n      // 2) Caches paginados: agrupa queries do mesmo \"sort\" e trata como conjunto\n      const paginatedQueries = queries.filter((q) => !q.queryKey.includes('infinite'));\n\n      // Agrupa por assinatura dos params (exceto page)\n      const groups = new Map<string, { queries: Query[]; sort?: string }>();\n      for (const query of paginatedQueries) {\n        const params = extractQueryParams(query);\n        const { page: _page, ...rest } = params;\n        void _page;\n        const signature = JSON.stringify(rest);\n        const existing = groups.get(signature);\n        if (existing) {\n          existing.queries.push(query);\n        } else {\n          groups.set(signature, { queries: [query], sort: params.sort });\n        }\n      }\n\n      for (const { queries: groupQueries, sort } of groups.values()) {\n        const compareFn = sort ? buildCompareFn<Project>(sort) : undefined;\n\n        // Ordena por número de página\n        const sortedByPage = groupQueries\n          .map((q) => ({ query: q, page: extractQueryParams(q).page ?? 1 }))\n          .sort((a, b) => a.page - b.page);\n\n        // Monta as páginas na ordem\n        const pages: ProjectsPage[] = [];\n        const pageNumbers: number[] = [];\n        for (const { query, page } of sortedByPage) {\n          const data = queryClient.getQueryData<ProjectsPage>(query.queryKey);\n          if (data) {\n            pages.push(data);\n            pageNumbers.push(page);\n          }\n        }\n        if (!pages.length) continue;\n\n        const pageSize = pages[0].data.length || 20;\n        const newPages = insertIntoPaginatedCache({\n          pages,\n          pageNumbers,\n          newItem: newProject,\n          pageSize,\n          compareFn,\n        });\n\n        // Grava de volta cada página que mudou (referência diferente)\n        for (let i = 0; i < sortedByPage.length; i++) {\n          if (newPages[i] !== pages[i]) {\n            queryClient.setQueryData<ProjectsPage>(sortedByPage[i].query.queryKey, {\n              ...pages[i],\n              ...newPages[i],\n            });\n          }\n        }\n      }\n\n      queryClient.invalidateQueries({ queryKey: projectsKey });\n    },\n  });\n}\n"],"mappings":";AAEA,SAAS,aAAa,sBAA2C;AACjE,SAAS,2BAA2B;AACpC,SAAS,kBAAkB;AAC3B,SAAS,uBAAuB;AAChC,SAAS,yBAAyB;AAClC,SAAS,gBAAgB,gCAAgC;AAKzD,SAAS,mBAAmB,OAA2B;AACrD,QAAM,MAAM,MAAM;AAClB,WAAS,IAAI,IAAI,SAAS,GAAG,KAAK,GAAG,KAAK;AACxC,UAAM,UAAU,IAAI,CAAC;AACrB,QAAI,YAAY,QAAQ,OAAO,YAAY,UAAU;AACnD,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO,CAAC;AACV;AAEO,SAAS,mBAAmB;AACjC,QAAM,cAAc,eAAe;AACnC,QAAM,cAAc,gBAAgB,CAAC,GAAG,iBAAiB,CAAC;AAE1D,SAAO,YAAY;AAAA,IACjB,YAAY,CAAC,SACX,WAAW,mBAAmB,EAAE,IAAI;AAAA,IAEtC,WAAW,CAAC,eAAwB;AAClC,YAAM,QAAQ,YAAY,cAAc;AACxC,YAAM,UAAU,MAAM,QAAQ,EAAE,UAAU,YAAY,CAAC;AAGvD,YAAM,kBAAkB,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,SAAS,UAAU,CAAC;AAE7E,iBAAW,SAAS,iBAAiB;AACnC,cAAM,EAAE,KAAK,IAAI,mBAAmB,KAAK;AACzC,cAAM,YAAY,OAAO,eAAwB,IAAI,IAAI;AAEzD,oBAAY,aAAyC,MAAM,UAAU,CAAC,QAAQ;AAC5E,cAAI,CAAC,KAAK,MAAM,OAAQ,QAAO;AAE/B,gBAAM,WAAW,IAAI,MAAM,CAAC,EAAE,KAAK,UAAU;AAC7C,gBAAM,WAAW,yBAAyB;AAAA,YACxC,OAAO,IAAI;AAAA,YACX,aAAa,IAAI,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC;AAAA,YAC1C,SAAS;AAAA,YACT;AAAA,YACA;AAAA,UACF,CAAC;AAED,iBAAO,EAAE,GAAG,KAAK,OAAO,SAAS,IAAI,CAAC,GAAG,OAAO,EAAE,GAAG,IAAI,MAAM,CAAC,GAAG,GAAG,EAAE,EAAE,EAAE;AAAA,QAC9E,CAAC;AAAA,MACH;AAGA,YAAM,mBAAmB,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,SAAS,SAAS,UAAU,CAAC;AAG/E,YAAM,SAAS,oBAAI,IAAiD;AACpE,iBAAW,SAAS,kBAAkB;AACpC,cAAM,SAAS,mBAAmB,KAAK;AACvC,cAAM,EAAE,MAAM,OAAO,GAAG,KAAK,IAAI;AACjC,aAAK;AACL,cAAM,YAAY,KAAK,UAAU,IAAI;AACrC,cAAM,WAAW,OAAO,IAAI,SAAS;AACrC,YAAI,UAAU;AACZ,mBAAS,QAAQ,KAAK,KAAK;AAAA,QAC7B,OAAO;AACL,iBAAO,IAAI,WAAW,EAAE,SAAS,CAAC,KAAK,GAAG,MAAM,OAAO,KAAK,CAAC;AAAA,QAC/D;AAAA,MACF;AAEA,iBAAW,EAAE,SAAS,cAAc,KAAK,KAAK,OAAO,OAAO,GAAG;AAC7D,cAAM,YAAY,OAAO,eAAwB,IAAI,IAAI;AAGzD,cAAM,eAAe,aAClB,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,mBAAmB,CAAC,EAAE,QAAQ,EAAE,EAAE,EAChE,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AAGjC,cAAM,QAAwB,CAAC;AAC/B,cAAM,cAAwB,CAAC;AAC/B,mBAAW,EAAE,OAAO,KAAK,KAAK,cAAc;AAC1C,gBAAM,OAAO,YAAY,aAA2B,MAAM,QAAQ;AAClE,cAAI,MAAM;AACR,kBAAM,KAAK,IAAI;AACf,wBAAY,KAAK,IAAI;AAAA,UACvB;AAAA,QACF;AACA,YAAI,CAAC,MAAM,OAAQ;AAEnB,cAAM,WAAW,MAAM,CAAC,EAAE,KAAK,UAAU;AACzC,cAAM,WAAW,yBAAyB;AAAA,UACxC;AAAA,UACA;AAAA,UACA,SAAS;AAAA,UACT;AAAA,UACA;AAAA,QACF,CAAC;AAGD,iBAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC5C,cAAI,SAAS,CAAC,MAAM,MAAM,CAAC,GAAG;AAC5B,wBAAY,aAA2B,aAAa,CAAC,EAAE,MAAM,UAAU;AAAA,cACrE,GAAG,MAAM,CAAC;AAAA,cACV,GAAG,SAAS,CAAC;AAAA,YACf,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAEA,kBAAY,kBAAkB,EAAE,UAAU,YAAY,CAAC;AAAA,IACzD;AAAA,EACF,CAAC;AACH;","names":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@greatapps/common",
-  "version": "1.1.536",
+  "version": "1.1.539",
   "description": "Shared library for GreatApps frontend applications",
   "main": "./dist/index.mjs",
   "types": "./src/index.ts",

package/src/infra/utils/array.ts

@@ -12,6 +12,119 @@ export function insertSorted<T>(
   return [...data.slice(0, index), newItem, ...data.slice(index)];
 }
 
+export interface PaginatedPageCache<T> {
+  data: T[];
+  total: number;
+}
+
+export interface InsertIntoPaginatedCacheParams<T> {
+  /** Páginas atuais do cache, ordenadas por número de página (1..N). */
+  pages: PaginatedPageCache<T>[];
+  /** Números das páginas correspondentes (mesmo tamanho de `pages`). */
+  pageNumbers: number[];
+  /** Novo item a inserir. */
+  newItem: T;
+  /** Tamanho fixo de cada página. */
+  pageSize: number;
+  /**
+   * Função de comparação que mantém a ordem.
+   * Se não fornecida, insere no topo da página 1 (sem reordenar).
+   */
+  compareFn?: (a: T, b: T) => number;
+}
+
+/**
+ * Insere um item em um conjunto de páginas paginadas mantendo ordenação.
+ *
+ * Quando `compareFn` é fornecida, descobre em qual página o item deveria
+ * cair (comparando com o último item de cada página). Insere na posição
+ * correta e empurra o último item da página para a próxima, propagando
+ * o overflow até a última página disponível.
+ *
+ * Páginas não-afetadas retornam a mesma referência.
+ */
+export function insertIntoPaginatedCache<T>({
+  pages,
+  pageNumbers,
+  newItem,
+  pageSize,
+  compareFn,
+}: InsertIntoPaginatedCacheParams<T>): PaginatedPageCache<T>[] {
+  if (!pages.length) return pages;
+
+  // Sem sort: insere no topo da página 1 e propaga overflow
+  if (!compareFn) {
+    // Só atualiza se a página 1 estiver no cache
+    const firstIdx = pageNumbers.indexOf(1);
+    if (firstIdx === -1) return pages;
+
+    const result: PaginatedPageCache<T>[] = pages.slice();
+    let carry: T | null = newItem;
+    for (let i = firstIdx; i < result.length && carry !== null; i++) {
+      const current = result[i];
+      const nextData: T[] = [carry, ...current.data];
+      const overflow: T | null =
+        nextData.length > pageSize ? nextData[nextData.length - 1] : null;
+      result[i] = {
+        ...current,
+        data: overflow !== null ? nextData.slice(0, pageSize) : nextData,
+        total: current.total + 1,
+      };
+      carry = overflow;
+    }
+    return result;
+  }
+
+  // Descobre em qual página o item cai
+  let targetIdx = -1;
+  for (let i = 0; i < pages.length; i++) {
+    const page = pages[i];
+    if (!page.data.length) continue;
+    const last = page.data[page.data.length - 1];
+    // Se newItem vem antes (ou igual) ao último item desta página, cai aqui
+    if (compareFn(newItem, last) <= 0) {
+      targetIdx = i;
+      break;
+    }
+  }
+
+  // Não coube em nenhuma página com itens — tenta a última página se for incompleta
+  if (targetIdx === -1) {
+    const lastIdx = pages.length - 1;
+    const lastPage = pages[lastIdx];
+    if (lastPage.data.length < pageSize) {
+      targetIdx = lastIdx;
+    } else {
+      // Não cai em nenhuma página carregada — apenas incrementa total
+      return pages.map((p) => ({ ...p, total: p.total + 1 }));
+    }
+  }
+
+  // Insere no target e propaga overflow para as páginas seguintes
+  const result: PaginatedPageCache<T>[] = pages.slice();
+  let carry: T | null = newItem;
+
+  for (let i = targetIdx; i < result.length && carry !== null; i++) {
+    const current = result[i];
+    const withInserted: T[] = insertSorted(current.data, carry, compareFn);
+    const overflow: T | null =
+      withInserted.length > pageSize ? withInserted[withInserted.length - 1] : null;
+    result[i] = {
+      ...current,
+      data: overflow !== null ? withInserted.slice(0, pageSize) : withInserted,
+      total: current.total + 1,
+    };
+    carry = overflow;
+  }
+
+  // Incrementa o total nas páginas anteriores ao target (não mudaram mas o total global cresceu)
+  for (let i = 0; i < targetIdx; i++) {
+    result[i] = { ...result[i], total: result[i].total + 1 };
+  }
+
+  return result;
+}
+
 /**
  * Cria uma função de comparação a partir de uma string de sort da API.
  * Suporta múltiplos campos separados por vírgula e prefixo `-` para desc.

package/src/modules/projects/hooks/create-project.hook.ts

@@ -5,18 +5,20 @@ import { createProjectAction } from '../actions/create-project.action';
 import { withAction } from '../../../utils/withAction';
 import { useAuthQueryKey } from '../../../hooks/useAuthQueryKey';
 import { PROJECTS_BASE_KEY } from './list-projects.hook';
-import { insertSorted, buildCompareFn } from '../../../infra/utils/array';
+import { buildCompareFn, insertIntoPaginatedCache } from '../../../infra/utils/array';
 import type { CreateProjectRequest, Project, ProjectsPage } from '../types';
 
-function extractSort(query: Query): string | undefined {
+type QueryParams = { sort?: string; page?: number; [key: string]: unknown };
+
+function extractQueryParams(query: Query): QueryParams {
   const key = query.queryKey;
   for (let i = key.length - 1; i >= 0; i--) {
     const segment = key[i];
-    if (segment && typeof segment === 'object' && 'sort' in segment) {
-      return (segment as Record<string, unknown>).sort as string | undefined;
+    if (segment !== null && typeof segment === 'object') {
+      return segment as QueryParams;
     }
   }
-  return undefined;
+  return {};
 }
 
 export function useCreateProject() {
@@ -31,54 +33,84 @@ export function useCreateProject() {
       const cache = queryClient.getQueryCache();
       const queries = cache.findAll({ queryKey: projectsKey });
 
-      for (const query of queries) {
-        const sort = extractSort(query);
-        const isInfinite = query.queryKey.includes('infinite');
-
-        if (isInfinite) {
-          queryClient.setQueryData<InfiniteData<ProjectsPage>>(
-            query.queryKey,
-            (old) => {
-              if (!old?.pages.length) return old;
-
-              const pageSize = old.pages[0].data.length || 20;
-              const allItems = old.pages.flatMap((page) => page.data);
-
-              const withNew = sort
-                ? insertSorted(allItems, newProject, buildCompareFn<Project>(sort))
-                : [newProject, ...allItems];
-
-              const newTotal = (old.pages[0].total ?? 0) + 1;
-
-              return {
-                ...old,
-                pages: old.pages.map((page, i) => ({
-                  ...page,
-                  data: withNew.slice(i * pageSize, (i + 1) * pageSize),
-                  total: newTotal,
-                })),
-              };
-            },
-          );
+      // 1) Caches infinite: todas as páginas vivem no mesmo queryData
+      const infiniteQueries = queries.filter((q) => q.queryKey.includes('infinite'));
+
+      for (const query of infiniteQueries) {
+        const { sort } = extractQueryParams(query);
+        const compareFn = sort ? buildCompareFn<Project>(sort) : undefined;
+
+        queryClient.setQueryData<InfiniteData<ProjectsPage>>(query.queryKey, (old) => {
+          if (!old?.pages.length) return old;
+
+          const pageSize = old.pages[0].data.length || 20;
+          const newPages = insertIntoPaginatedCache({
+            pages: old.pages,
+            pageNumbers: old.pages.map((_, i) => i + 1),
+            newItem: newProject,
+            pageSize,
+            compareFn,
+          });
+
+          return { ...old, pages: newPages.map((p, i) => ({ ...old.pages[i], ...p })) };
+        });
+      }
+
+      // 2) Caches paginados: agrupa queries do mesmo "sort" e trata como conjunto
+      const paginatedQueries = queries.filter((q) => !q.queryKey.includes('infinite'));
+
+      // Agrupa por assinatura dos params (exceto page)
+      const groups = new Map<string, { queries: Query[]; sort?: string }>();
+      for (const query of paginatedQueries) {
+        const params = extractQueryParams(query);
+        const { page: _page, ...rest } = params;
+        void _page;
+        const signature = JSON.stringify(rest);
+        const existing = groups.get(signature);
+        if (existing) {
+          existing.queries.push(query);
         } else {
-          queryClient.setQueryData<ProjectsPage>(
-            query.queryKey,
-            (old) => {
-              if (!old) return old;
-
-              const pageSize = old.data.length || 20;
-
-              const withNew = sort
-                ? insertSorted(old.data, newProject, buildCompareFn<Project>(sort))
-                : [newProject, ...old.data];
-
-              return {
-                ...old,
-                data: withNew.slice(0, pageSize),
-                total: old.total + 1,
-              };
-            },
-          );
+          groups.set(signature, { queries: [query], sort: params.sort });
+        }
+      }
+
+      for (const { queries: groupQueries, sort } of groups.values()) {
+        const compareFn = sort ? buildCompareFn<Project>(sort) : undefined;
+
+        // Ordena por número de página
+        const sortedByPage = groupQueries
+          .map((q) => ({ query: q, page: extractQueryParams(q).page ?? 1 }))
+          .sort((a, b) => a.page - b.page);
+
+        // Monta as páginas na ordem
+        const pages: ProjectsPage[] = [];
+        const pageNumbers: number[] = [];
+        for (const { query, page } of sortedByPage) {
+          const data = queryClient.getQueryData<ProjectsPage>(query.queryKey);
+          if (data) {
+            pages.push(data);
+            pageNumbers.push(page);
+          }
+        }
+        if (!pages.length) continue;
+
+        const pageSize = pages[0].data.length || 20;
+        const newPages = insertIntoPaginatedCache({
+          pages,
+          pageNumbers,
+          newItem: newProject,
+          pageSize,
+          compareFn,
+        });
+
+        // Grava de volta cada página que mudou (referência diferente)
+        for (let i = 0; i < sortedByPage.length; i++) {
+          if (newPages[i] !== pages[i]) {
+            queryClient.setQueryData<ProjectsPage>(sortedByPage[i].query.queryKey, {
+              ...pages[i],
+              ...newPages[i],
+            });
+          }
         }
       }