@tanstack/query-core 5.0.0-beta.15 → 5.0.0-beta.20

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (139) hide show
  1. package/build/legacy/hydration.cjs.map +1 -1
  2. package/build/legacy/hydration.d.cts +3 -3
  3. package/build/legacy/hydration.d.ts +3 -3
  4. package/build/legacy/hydration.js.map +1 -1
  5. package/build/legacy/index.d.cts +1 -1
  6. package/build/legacy/index.d.ts +1 -1
  7. package/build/legacy/infiniteQueryBehavior.cjs +1 -1
  8. package/build/legacy/infiniteQueryBehavior.cjs.map +1 -1
  9. package/build/legacy/infiniteQueryBehavior.d.cts +1 -1
  10. package/build/legacy/infiniteQueryBehavior.d.ts +1 -1
  11. package/build/legacy/infiniteQueryBehavior.js +1 -1
  12. package/build/legacy/infiniteQueryBehavior.js.map +1 -1
  13. package/build/legacy/infiniteQueryObserver.d.cts +1 -1
  14. package/build/legacy/infiniteQueryObserver.d.ts +1 -1
  15. package/build/legacy/mutation.cjs.map +1 -1
  16. package/build/legacy/mutation.d.cts +1 -1
  17. package/build/legacy/mutation.d.ts +1 -1
  18. package/build/legacy/mutation.js.map +1 -1
  19. package/build/legacy/mutationCache.cjs.map +1 -1
  20. package/build/legacy/mutationCache.d.cts +1 -1
  21. package/build/legacy/mutationCache.d.ts +1 -1
  22. package/build/legacy/mutationCache.js.map +1 -1
  23. package/build/legacy/mutationObserver.d.cts +1 -1
  24. package/build/legacy/mutationObserver.d.ts +1 -1
  25. package/build/legacy/notifyManager.cjs.map +1 -1
  26. package/build/legacy/notifyManager.d.cts +1 -1
  27. package/build/legacy/notifyManager.d.ts +1 -1
  28. package/build/legacy/notifyManager.js.map +1 -1
  29. package/build/legacy/queriesObserver.cjs +6 -8
  30. package/build/legacy/queriesObserver.cjs.map +1 -1
  31. package/build/legacy/queriesObserver.d.cts +11 -11
  32. package/build/legacy/queriesObserver.d.ts +11 -11
  33. package/build/legacy/queriesObserver.js +6 -8
  34. package/build/legacy/queriesObserver.js.map +1 -1
  35. package/build/legacy/query.cjs.map +1 -1
  36. package/build/legacy/query.d.cts +1 -1
  37. package/build/legacy/query.d.ts +1 -1
  38. package/build/legacy/query.js.map +1 -1
  39. package/build/legacy/queryCache.cjs.map +1 -1
  40. package/build/legacy/queryCache.d.cts +1 -1
  41. package/build/legacy/queryCache.d.ts +1 -1
  42. package/build/legacy/queryCache.js.map +1 -1
  43. package/build/legacy/{queryClient-6d6b4ed8.d.ts → queryClient-cc9406ab.d.ts} +19 -19
  44. package/build/legacy/{queryClient-58ec0ff3.d.ts → queryClient-f9f2d3d1.d.ts} +19 -19
  45. package/build/legacy/queryClient.cjs.map +1 -1
  46. package/build/legacy/queryClient.d.cts +1 -1
  47. package/build/legacy/queryClient.d.ts +1 -1
  48. package/build/legacy/queryClient.js.map +1 -1
  49. package/build/legacy/queryObserver.d.cts +1 -1
  50. package/build/legacy/queryObserver.d.ts +1 -1
  51. package/build/legacy/retryer.d.cts +1 -1
  52. package/build/legacy/retryer.d.ts +1 -1
  53. package/build/legacy/types.cjs.map +1 -1
  54. package/build/legacy/types.d.cts +1 -1
  55. package/build/legacy/types.d.ts +1 -1
  56. package/build/legacy/utils.cjs.map +1 -1
  57. package/build/legacy/utils.d.cts +1 -1
  58. package/build/legacy/utils.d.ts +1 -1
  59. package/build/legacy/utils.js.map +1 -1
  60. package/build/modern/hydration.cjs.map +1 -1
  61. package/build/modern/hydration.d.cts +3 -3
  62. package/build/modern/hydration.d.ts +3 -3
  63. package/build/modern/hydration.js.map +1 -1
  64. package/build/modern/index.d.cts +1 -1
  65. package/build/modern/index.d.ts +1 -1
  66. package/build/modern/infiniteQueryBehavior.cjs +1 -1
  67. package/build/modern/infiniteQueryBehavior.cjs.map +1 -1
  68. package/build/modern/infiniteQueryBehavior.d.cts +1 -1
  69. package/build/modern/infiniteQueryBehavior.d.ts +1 -1
  70. package/build/modern/infiniteQueryBehavior.js +1 -1
  71. package/build/modern/infiniteQueryBehavior.js.map +1 -1
  72. package/build/modern/infiniteQueryObserver.d.cts +1 -1
  73. package/build/modern/infiniteQueryObserver.d.ts +1 -1
  74. package/build/modern/mutation.cjs.map +1 -1
  75. package/build/modern/mutation.d.cts +1 -1
  76. package/build/modern/mutation.d.ts +1 -1
  77. package/build/modern/mutation.js.map +1 -1
  78. package/build/modern/mutationCache.cjs.map +1 -1
  79. package/build/modern/mutationCache.d.cts +1 -1
  80. package/build/modern/mutationCache.d.ts +1 -1
  81. package/build/modern/mutationCache.js.map +1 -1
  82. package/build/modern/mutationObserver.d.cts +1 -1
  83. package/build/modern/mutationObserver.d.ts +1 -1
  84. package/build/modern/notifyManager.cjs.map +1 -1
  85. package/build/modern/notifyManager.d.cts +1 -1
  86. package/build/modern/notifyManager.d.ts +1 -1
  87. package/build/modern/notifyManager.js.map +1 -1
  88. package/build/modern/queriesObserver.cjs +6 -8
  89. package/build/modern/queriesObserver.cjs.map +1 -1
  90. package/build/modern/queriesObserver.d.cts +11 -11
  91. package/build/modern/queriesObserver.d.ts +11 -11
  92. package/build/modern/queriesObserver.js +6 -8
  93. package/build/modern/queriesObserver.js.map +1 -1
  94. package/build/modern/query.cjs.map +1 -1
  95. package/build/modern/query.d.cts +1 -1
  96. package/build/modern/query.d.ts +1 -1
  97. package/build/modern/query.js.map +1 -1
  98. package/build/modern/queryCache.cjs.map +1 -1
  99. package/build/modern/queryCache.d.cts +1 -1
  100. package/build/modern/queryCache.d.ts +1 -1
  101. package/build/modern/queryCache.js.map +1 -1
  102. package/build/modern/{queryClient-6d6b4ed8.d.ts → queryClient-cc9406ab.d.ts} +19 -19
  103. package/build/modern/{queryClient-58ec0ff3.d.ts → queryClient-f9f2d3d1.d.ts} +19 -19
  104. package/build/modern/queryClient.cjs.map +1 -1
  105. package/build/modern/queryClient.d.cts +1 -1
  106. package/build/modern/queryClient.d.ts +1 -1
  107. package/build/modern/queryClient.js.map +1 -1
  108. package/build/modern/queryObserver.d.cts +1 -1
  109. package/build/modern/queryObserver.d.ts +1 -1
  110. package/build/modern/retryer.d.cts +1 -1
  111. package/build/modern/retryer.d.ts +1 -1
  112. package/build/modern/types.cjs.map +1 -1
  113. package/build/modern/types.d.cts +1 -1
  114. package/build/modern/types.d.ts +1 -1
  115. package/build/modern/utils.cjs.map +1 -1
  116. package/build/modern/utils.d.cts +1 -1
  117. package/build/modern/utils.d.ts +1 -1
  118. package/build/modern/utils.js.map +1 -1
  119. package/package.json +1 -1
  120. package/src/hydration.ts +2 -2
  121. package/src/infiniteQueryBehavior.ts +1 -1
  122. package/src/mutation.ts +1 -1
  123. package/src/mutationCache.ts +3 -3
  124. package/src/notifyManager.ts +3 -3
  125. package/src/queriesObserver.ts +24 -25
  126. package/src/query.ts +1 -1
  127. package/src/queryCache.ts +2 -2
  128. package/src/queryClient.ts +2 -2
  129. package/src/tests/hydration.test.tsx +2 -2
  130. package/src/tests/infiniteQueryBehavior.test.tsx +4 -4
  131. package/src/tests/infiniteQueryObserver.test.tsx +7 -7
  132. package/src/tests/mutations.test.tsx +2 -2
  133. package/src/tests/queriesObserver.test.tsx +4 -4
  134. package/src/tests/query.test.tsx +3 -3
  135. package/src/tests/queryClient.test.tsx +38 -38
  136. package/src/tests/queryObserver.test.tsx +19 -19
  137. package/src/tests/utils.test.tsx +2 -2
  138. package/src/types.ts +12 -12
  139. package/src/utils.ts +2 -2
@@ -1 +1 @@
1
- {"version":3,"sources":["../../src/utils.ts"],"sourcesContent":["import type { Mutation } from './mutation'\nimport type { Query } from './query'\nimport type {\n FetchStatus,\n MutationKey,\n MutationStatus,\n QueryKey,\n QueryOptions,\n} from './types'\n\n// TYPES\n\nexport interface QueryFilters {\n /**\n * Filter to active queries, inactive queries or all queries\n */\n type?: QueryTypeFilter\n /**\n * Match query key exactly\n */\n exact?: boolean\n /**\n * Include queries matching this predicate function\n */\n predicate?: (query: Query) => boolean\n /**\n * Include queries matching this query key\n */\n queryKey?: QueryKey\n /**\n * Include or exclude stale queries\n */\n stale?: boolean\n /**\n * Include queries matching their fetchStatus\n */\n fetchStatus?: FetchStatus\n}\n\nexport interface MutationFilters {\n /**\n * Match mutation key exactly\n */\n exact?: boolean\n /**\n * Include mutations matching this predicate function\n */\n predicate?: (mutation: Mutation<any, any, any>) => boolean\n /**\n * Include mutations matching this mutation key\n */\n mutationKey?: MutationKey\n /**\n * Filter by mutation status\n */\n status?: MutationStatus\n}\n\nexport type DataUpdateFunction<TInput, TOutput> = (input: TInput) => TOutput\n\nexport type Updater<TInput, TOutput> =\n | TOutput\n | DataUpdateFunction<TInput, TOutput>\n\nexport type QueryTypeFilter = 'all' | 'active' | 'inactive'\n\n// UTILS\n\nexport const isServer = typeof window === 'undefined' || 'Deno' in window\n\nexport function noop(): undefined {\n return undefined\n}\n\nexport function functionalUpdate<TInput, TOutput>(\n updater: Updater<TInput, TOutput>,\n input: TInput,\n): TOutput {\n return typeof updater === 'function'\n ? (updater as DataUpdateFunction<TInput, TOutput>)(input)\n : updater\n}\n\nexport function isValidTimeout(value: unknown): value is number {\n return typeof value === 'number' && value >= 0 && value !== Infinity\n}\n\nexport function timeUntilStale(updatedAt: number, staleTime?: number): number {\n return Math.max(updatedAt + (staleTime || 0) - Date.now(), 0)\n}\n\nexport function matchQuery(\n filters: QueryFilters,\n query: Query<any, any, any, any>,\n): boolean {\n const {\n type = 'all',\n exact,\n fetchStatus,\n predicate,\n queryKey,\n stale,\n } = filters\n\n if (queryKey) {\n if (exact) {\n if (query.queryHash !== hashQueryKeyByOptions(queryKey, query.options)) {\n return false\n }\n } else if (!partialMatchKey(query.queryKey, queryKey)) {\n return false\n }\n }\n\n if (type !== 'all') {\n const isActive = query.isActive()\n if (type === 'active' && !isActive) {\n return false\n }\n if (type === 'inactive' && isActive) {\n return false\n }\n }\n\n if (typeof stale === 'boolean' && query.isStale() !== stale) {\n return false\n }\n\n if (\n typeof fetchStatus !== 'undefined' &&\n fetchStatus !== query.state.fetchStatus\n ) {\n return false\n }\n\n if (predicate && !predicate(query)) {\n return false\n }\n\n return true\n}\n\nexport function matchMutation(\n filters: MutationFilters,\n mutation: Mutation<any, any>,\n): boolean {\n const { exact, status, predicate, mutationKey } = filters\n if (mutationKey) {\n if (!mutation.options.mutationKey) {\n return false\n }\n if (exact) {\n if (hashKey(mutation.options.mutationKey) !== hashKey(mutationKey)) {\n return false\n }\n } else if (!partialMatchKey(mutation.options.mutationKey, mutationKey)) {\n return false\n }\n }\n\n if (status && mutation.state.status !== status) {\n return false\n }\n\n if (predicate && !predicate(mutation)) {\n return false\n }\n\n return true\n}\n\nexport function hashQueryKeyByOptions<TQueryKey extends QueryKey = QueryKey>(\n queryKey: TQueryKey,\n options?: QueryOptions<any, any, any, TQueryKey>,\n): string {\n const hashFn = options?.queryKeyHashFn || hashKey\n return hashFn(queryKey)\n}\n\n/**\n * Default query & mutation keys hash function.\n * Hashes the value into a stable hash.\n */\nexport function hashKey(queryKey: QueryKey | MutationKey): string {\n return JSON.stringify(queryKey, (_, val) =>\n isPlainObject(val)\n ? Object.keys(val)\n .sort()\n .reduce((result, key) => {\n result[key] = val[key]\n return result\n }, {} as any)\n : val,\n )\n}\n\n/**\n * Checks if key `b` partially matches with key `a`.\n */\nexport function partialMatchKey(a: QueryKey, b: QueryKey): boolean\nexport function partialMatchKey(a: any, b: any): boolean {\n if (a === b) {\n return true\n }\n\n if (typeof a !== typeof b) {\n return false\n }\n\n if (a && b && typeof a === 'object' && typeof b === 'object') {\n return !Object.keys(b).some((key) => !partialMatchKey(a[key], b[key]))\n }\n\n return false\n}\n\n/**\n * This function returns `a` if `b` is deeply equal.\n * If not, it will replace any deeply equal children of `b` with those of `a`.\n * This can be used for structural sharing between JSON values for example.\n */\nexport function replaceEqualDeep<T>(a: unknown, b: T): T\nexport function replaceEqualDeep(a: any, b: any): any {\n if (a === b) {\n return a\n }\n\n const array = isPlainArray(a) && isPlainArray(b)\n\n if (array || (isPlainObject(a) && isPlainObject(b))) {\n const aSize = array ? a.length : Object.keys(a).length\n const bItems = array ? b : Object.keys(b)\n const bSize = bItems.length\n const copy: any = array ? [] : {}\n\n let equalItems = 0\n\n for (let i = 0; i < bSize; i++) {\n const key = array ? i : bItems[i]\n copy[key] = replaceEqualDeep(a[key], b[key])\n if (copy[key] === a[key]) {\n equalItems++\n }\n }\n\n return aSize === bSize && equalItems === aSize ? a : copy\n }\n\n return b\n}\n\n/**\n * Shallow compare objects. Only works with objects that always have the same properties.\n */\nexport function shallowEqualObjects<T>(a: T, b: T): boolean {\n if ((a && !b) || (b && !a)) {\n return false\n }\n\n for (const key in a) {\n if (a[key] !== b[key]) {\n return false\n }\n }\n\n return true\n}\n\nexport function isPlainArray(value: unknown) {\n return Array.isArray(value) && value.length === Object.keys(value).length\n}\n\n// Copied from: https://github.com/jonschlinkert/is-plain-object\nexport function isPlainObject(o: any): o is Object {\n if (!hasObjectPrototype(o)) {\n return false\n }\n\n // If has modified constructor\n const ctor = o.constructor\n if (typeof ctor === 'undefined') {\n return true\n }\n\n // If has modified prototype\n const prot = ctor.prototype\n if (!hasObjectPrototype(prot)) {\n return false\n }\n\n // If constructor does not have an Object-specific method\n if (!prot.hasOwnProperty('isPrototypeOf')) {\n return false\n }\n\n // Most likely a plain Object\n return true\n}\n\nfunction hasObjectPrototype(o: any): boolean {\n return Object.prototype.toString.call(o) === '[object Object]'\n}\n\nexport function sleep(timeout: number): Promise<void> {\n return new Promise((resolve) => {\n setTimeout(resolve, timeout)\n })\n}\n\n/**\n * Schedules a microtask.\n * This can be useful to schedule state updates after rendering.\n */\nexport function scheduleMicrotask(callback: () => void) {\n sleep(0).then(callback)\n}\n\nexport function replaceData<\n TData,\n TOptions extends QueryOptions<any, any, any, any>,\n>(prevData: TData | undefined, data: TData, options: TOptions): TData {\n if (typeof options.structuralSharing === 'function') {\n return options.structuralSharing(prevData, data)\n } else if (options.structuralSharing !== false) {\n // Structurally share data between prev and new data if needed\n return replaceEqualDeep(prevData, data)\n }\n return data\n}\n\nexport function keepPreviousData<T>(\n previousData: T | undefined,\n): T | undefined {\n return previousData\n}\n\nexport function addToEnd<T>(items: T[], item: T, max = 0): T[] {\n const newItems = [...items, item]\n return max && newItems.length > max ? newItems.slice(1) : newItems\n}\n\nexport function addToStart<T>(items: T[], item: T, max = 0): T[] {\n const newItems = [item, ...items]\n return max && newItems.length > max ? newItems.slice(0, -1) : newItems\n}\n"],"mappings":";AAoEO,IAAM,WAAW,OAAO,WAAW,eAAe,UAAU;AAE5D,SAAS,OAAkB;AAChC,SAAO;AACT;AAEO,SAAS,iBACd,SACA,OACS;AACT,SAAO,OAAO,YAAY,aACrB,QAAgD,KAAK,IACtD;AACN;AAEO,SAAS,eAAe,OAAiC;AAC9D,SAAO,OAAO,UAAU,YAAY,SAAS,KAAK,UAAU;AAC9D;AAEO,SAAS,eAAe,WAAmB,WAA4B;AAC5E,SAAO,KAAK,IAAI,aAAa,aAAa,KAAK,KAAK,IAAI,GAAG,CAAC;AAC9D;AAEO,SAAS,WACd,SACA,OACS;AACT,QAAM;AAAA,IACJ,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,IAAI;AAEJ,MAAI,UAAU;AACZ,QAAI,OAAO;AACT,UAAI,MAAM,cAAc,sBAAsB,UAAU,MAAM,OAAO,GAAG;AACtE,eAAO;AAAA,MACT;AAAA,IACF,WAAW,CAAC,gBAAgB,MAAM,UAAU,QAAQ,GAAG;AACrD,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,SAAS,OAAO;AAClB,UAAM,WAAW,MAAM,SAAS;AAChC,QAAI,SAAS,YAAY,CAAC,UAAU;AAClC,aAAO;AAAA,IACT;AACA,QAAI,SAAS,cAAc,UAAU;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,OAAO,UAAU,aAAa,MAAM,QAAQ,MAAM,OAAO;AAC3D,WAAO;AAAA,EACT;AAEA,MACE,OAAO,gBAAgB,eACvB,gBAAgB,MAAM,MAAM,aAC5B;AACA,WAAO;AAAA,EACT;AAEA,MAAI,aAAa,CAAC,UAAU,KAAK,GAAG;AAClC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEO,SAAS,cACd,SACA,UACS;AACT,QAAM,EAAE,OAAO,QAAQ,WAAW,YAAY,IAAI;AAClD,MAAI,aAAa;AACf,QAAI,CAAC,SAAS,QAAQ,aAAa;AACjC,aAAO;AAAA,IACT;AACA,QAAI,OAAO;AACT,UAAI,QAAQ,SAAS,QAAQ,WAAW,MAAM,QAAQ,WAAW,GAAG;AAClE,eAAO;AAAA,MACT;AAAA,IACF,WAAW,CAAC,gBAAgB,SAAS,QAAQ,aAAa,WAAW,GAAG;AACtE,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,UAAU,SAAS,MAAM,WAAW,QAAQ;AAC9C,WAAO;AAAA,EACT;AAEA,MAAI,aAAa,CAAC,UAAU,QAAQ,GAAG;AACrC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEO,SAAS,sBACd,UACA,SACQ;AACR,QAAM,SAAS,SAAS,kBAAkB;AAC1C,SAAO,OAAO,QAAQ;AACxB;AAMO,SAAS,QAAQ,UAA0C;AAChE,SAAO,KAAK;AAAA,IAAU;AAAA,IAAU,CAAC,GAAG,QAClC,cAAc,GAAG,IACb,OAAO,KAAK,GAAG,EACZ,KAAK,EACL,OAAO,CAAC,QAAQ,QAAQ;AACvB,aAAO,GAAG,IAAI,IAAI,GAAG;AACrB,aAAO;AAAA,IACT,GAAG,CAAC,CAAQ,IACd;AAAA,EACN;AACF;AAMO,SAAS,gBAAgB,GAAQ,GAAiB;AACvD,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,MAAM,OAAO,GAAG;AACzB,WAAO;AAAA,EACT;AAEA,MAAI,KAAK,KAAK,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;AAC5D,WAAO,CAAC,OAAO,KAAK,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,gBAAgB,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;AAAA,EACvE;AAEA,SAAO;AACT;AAQO,SAAS,iBAAiB,GAAQ,GAAa;AACpD,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,aAAa,CAAC,KAAK,aAAa,CAAC;AAE/C,MAAI,SAAU,cAAc,CAAC,KAAK,cAAc,CAAC,GAAI;AACnD,UAAM,QAAQ,QAAQ,EAAE,SAAS,OAAO,KAAK,CAAC,EAAE;AAChD,UAAM,SAAS,QAAQ,IAAI,OAAO,KAAK,CAAC;AACxC,UAAM,QAAQ,OAAO;AACrB,UAAM,OAAY,QAAQ,CAAC,IAAI,CAAC;AAEhC,QAAI,aAAa;AAEjB,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,YAAM,MAAM,QAAQ,IAAI,OAAO,CAAC;AAChC,WAAK,GAAG,IAAI,iBAAiB,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC;AAC3C,UAAI,KAAK,GAAG,MAAM,EAAE,GAAG,GAAG;AACxB;AAAA,MACF;AAAA,IACF;AAEA,WAAO,UAAU,SAAS,eAAe,QAAQ,IAAI;AAAA,EACvD;AAEA,SAAO;AACT;AAKO,SAAS,oBAAuB,GAAM,GAAe;AAC1D,MAAK,KAAK,CAAC,KAAO,KAAK,CAAC,GAAI;AAC1B,WAAO;AAAA,EACT;AAEA,aAAW,OAAO,GAAG;AACnB,QAAI,EAAE,GAAG,MAAM,EAAE,GAAG,GAAG;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,aAAa,OAAgB;AAC3C,SAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,OAAO,KAAK,KAAK,EAAE;AACrE;AAGO,SAAS,cAAc,GAAqB;AACjD,MAAI,CAAC,mBAAmB,CAAC,GAAG;AAC1B,WAAO;AAAA,EACT;AAGA,QAAM,OAAO,EAAE;AACf,MAAI,OAAO,SAAS,aAAa;AAC/B,WAAO;AAAA,EACT;AAGA,QAAM,OAAO,KAAK;AAClB,MAAI,CAAC,mBAAmB,IAAI,GAAG;AAC7B,WAAO;AAAA,EACT;AAGA,MAAI,CAAC,KAAK,eAAe,eAAe,GAAG;AACzC,WAAO;AAAA,EACT;AAGA,SAAO;AACT;AAEA,SAAS,mBAAmB,GAAiB;AAC3C,SAAO,OAAO,UAAU,SAAS,KAAK,CAAC,MAAM;AAC/C;AAEO,SAAS,MAAM,SAAgC;AACpD,SAAO,IAAI,QAAQ,CAAC,YAAY;AAC9B,eAAW,SAAS,OAAO;AAAA,EAC7B,CAAC;AACH;AAMO,SAAS,kBAAkB,UAAsB;AACtD,QAAM,CAAC,EAAE,KAAK,QAAQ;AACxB;AAEO,SAAS,YAGd,UAA6B,MAAa,SAA0B;AACpE,MAAI,OAAO,QAAQ,sBAAsB,YAAY;AACnD,WAAO,QAAQ,kBAAkB,UAAU,IAAI;AAAA,EACjD,WAAW,QAAQ,sBAAsB,OAAO;AAE9C,WAAO,iBAAiB,UAAU,IAAI;AAAA,EACxC;AACA,SAAO;AACT;AAEO,SAAS,iBACd,cACe;AACf,SAAO;AACT;AAEO,SAAS,SAAY,OAAY,MAAS,MAAM,GAAQ;AAC7D,QAAM,WAAW,CAAC,GAAG,OAAO,IAAI;AAChC,SAAO,OAAO,SAAS,SAAS,MAAM,SAAS,MAAM,CAAC,IAAI;AAC5D;AAEO,SAAS,WAAc,OAAY,MAAS,MAAM,GAAQ;AAC/D,QAAM,WAAW,CAAC,MAAM,GAAG,KAAK;AAChC,SAAO,OAAO,SAAS,SAAS,MAAM,SAAS,MAAM,GAAG,EAAE,IAAI;AAChE;","names":[]}
1
+ {"version":3,"sources":["../../src/utils.ts"],"sourcesContent":["import type { Mutation } from './mutation'\nimport type { Query } from './query'\nimport type {\n FetchStatus,\n MutationKey,\n MutationStatus,\n QueryKey,\n QueryOptions,\n} from './types'\n\n// TYPES\n\nexport interface QueryFilters {\n /**\n * Filter to active queries, inactive queries or all queries\n */\n type?: QueryTypeFilter\n /**\n * Match query key exactly\n */\n exact?: boolean\n /**\n * Include queries matching this predicate function\n */\n predicate?: (query: Query) => boolean\n /**\n * Include queries matching this query key\n */\n queryKey?: QueryKey\n /**\n * Include or exclude stale queries\n */\n stale?: boolean\n /**\n * Include queries matching their fetchStatus\n */\n fetchStatus?: FetchStatus\n}\n\nexport interface MutationFilters {\n /**\n * Match mutation key exactly\n */\n exact?: boolean\n /**\n * Include mutations matching this predicate function\n */\n predicate?: (mutation: Mutation<any, any, any>) => boolean\n /**\n * Include mutations matching this mutation key\n */\n mutationKey?: MutationKey\n /**\n * Filter by mutation status\n */\n status?: MutationStatus\n}\n\nexport type DataUpdateFunction<TInput, TOutput> = (input: TInput) => TOutput\n\nexport type Updater<TInput, TOutput> =\n | TOutput\n | DataUpdateFunction<TInput, TOutput>\n\nexport type QueryTypeFilter = 'all' | 'active' | 'inactive'\n\n// UTILS\n\nexport const isServer = typeof window === 'undefined' || 'Deno' in window\n\nexport function noop(): undefined {\n return undefined\n}\n\nexport function functionalUpdate<TInput, TOutput>(\n updater: Updater<TInput, TOutput>,\n input: TInput,\n): TOutput {\n return typeof updater === 'function'\n ? (updater as DataUpdateFunction<TInput, TOutput>)(input)\n : updater\n}\n\nexport function isValidTimeout(value: unknown): value is number {\n return typeof value === 'number' && value >= 0 && value !== Infinity\n}\n\nexport function timeUntilStale(updatedAt: number, staleTime?: number): number {\n return Math.max(updatedAt + (staleTime || 0) - Date.now(), 0)\n}\n\nexport function matchQuery(\n filters: QueryFilters,\n query: Query<any, any, any, any>,\n): boolean {\n const {\n type = 'all',\n exact,\n fetchStatus,\n predicate,\n queryKey,\n stale,\n } = filters\n\n if (queryKey) {\n if (exact) {\n if (query.queryHash !== hashQueryKeyByOptions(queryKey, query.options)) {\n return false\n }\n } else if (!partialMatchKey(query.queryKey, queryKey)) {\n return false\n }\n }\n\n if (type !== 'all') {\n const isActive = query.isActive()\n if (type === 'active' && !isActive) {\n return false\n }\n if (type === 'inactive' && isActive) {\n return false\n }\n }\n\n if (typeof stale === 'boolean' && query.isStale() !== stale) {\n return false\n }\n\n if (\n typeof fetchStatus !== 'undefined' &&\n fetchStatus !== query.state.fetchStatus\n ) {\n return false\n }\n\n if (predicate && !predicate(query)) {\n return false\n }\n\n return true\n}\n\nexport function matchMutation(\n filters: MutationFilters,\n mutation: Mutation<any, any>,\n): boolean {\n const { exact, status, predicate, mutationKey } = filters\n if (mutationKey) {\n if (!mutation.options.mutationKey) {\n return false\n }\n if (exact) {\n if (hashKey(mutation.options.mutationKey) !== hashKey(mutationKey)) {\n return false\n }\n } else if (!partialMatchKey(mutation.options.mutationKey, mutationKey)) {\n return false\n }\n }\n\n if (status && mutation.state.status !== status) {\n return false\n }\n\n if (predicate && !predicate(mutation)) {\n return false\n }\n\n return true\n}\n\nexport function hashQueryKeyByOptions<TQueryKey extends QueryKey = QueryKey>(\n queryKey: TQueryKey,\n options?: QueryOptions<any, any, any, TQueryKey>,\n): string {\n const hashFn = options?.queryKeyHashFn || hashKey\n return hashFn(queryKey)\n}\n\n/**\n * Default query & mutation keys hash function.\n * Hashes the value into a stable hash.\n */\nexport function hashKey(queryKey: QueryKey | MutationKey): string {\n return JSON.stringify(queryKey, (_, val) =>\n isPlainObject(val)\n ? Object.keys(val)\n .sort()\n .reduce((result, key) => {\n result[key] = val[key]\n return result\n }, {} as any)\n : val,\n )\n}\n\n/**\n * Checks if key `b` partially matches with key `a`.\n */\nexport function partialMatchKey(a: QueryKey, b: QueryKey): boolean\nexport function partialMatchKey(a: any, b: any): boolean {\n if (a === b) {\n return true\n }\n\n if (typeof a !== typeof b) {\n return false\n }\n\n if (a && b && typeof a === 'object' && typeof b === 'object') {\n return !Object.keys(b).some((key) => !partialMatchKey(a[key], b[key]))\n }\n\n return false\n}\n\n/**\n * This function returns `a` if `b` is deeply equal.\n * If not, it will replace any deeply equal children of `b` with those of `a`.\n * This can be used for structural sharing between JSON values for example.\n */\nexport function replaceEqualDeep<T>(a: unknown, b: T): T\nexport function replaceEqualDeep(a: any, b: any): any {\n if (a === b) {\n return a\n }\n\n const array = isPlainArray(a) && isPlainArray(b)\n\n if (array || (isPlainObject(a) && isPlainObject(b))) {\n const aSize = array ? a.length : Object.keys(a).length\n const bItems = array ? b : Object.keys(b)\n const bSize = bItems.length\n const copy: any = array ? [] : {}\n\n let equalItems = 0\n\n for (let i = 0; i < bSize; i++) {\n const key = array ? i : bItems[i]\n copy[key] = replaceEqualDeep(a[key], b[key])\n if (copy[key] === a[key]) {\n equalItems++\n }\n }\n\n return aSize === bSize && equalItems === aSize ? a : copy\n }\n\n return b\n}\n\n/**\n * Shallow compare objects. Only works with objects that always have the same properties.\n */\nexport function shallowEqualObjects<T>(a: T, b: T): boolean {\n if ((a && !b) || (b && !a)) {\n return false\n }\n\n for (const key in a) {\n if (a[key] !== b[key]) {\n return false\n }\n }\n\n return true\n}\n\nexport function isPlainArray(value: unknown) {\n return Array.isArray(value) && value.length === Object.keys(value).length\n}\n\n// Copied from: https://github.com/jonschlinkert/is-plain-object\nexport function isPlainObject(o: any): o is Object {\n if (!hasObjectPrototype(o)) {\n return false\n }\n\n // If has modified constructor\n const ctor = o.constructor\n if (typeof ctor === 'undefined') {\n return true\n }\n\n // If has modified prototype\n const prot = ctor.prototype\n if (!hasObjectPrototype(prot)) {\n return false\n }\n\n // If constructor does not have an Object-specific method\n if (!prot.hasOwnProperty('isPrototypeOf')) {\n return false\n }\n\n // Most likely a plain Object\n return true\n}\n\nfunction hasObjectPrototype(o: any): boolean {\n return Object.prototype.toString.call(o) === '[object Object]'\n}\n\nexport function sleep(timeout: number): Promise<void> {\n return new Promise((resolve) => {\n setTimeout(resolve, timeout)\n })\n}\n\n/**\n * Schedules a microtask.\n * This can be useful to schedule state updates after rendering.\n */\nexport function scheduleMicrotask(callback: () => void) {\n sleep(0).then(callback)\n}\n\nexport function replaceData<\n TData,\n TOptions extends QueryOptions<any, any, any, any>,\n>(prevData: TData | undefined, data: TData, options: TOptions): TData {\n if (typeof options.structuralSharing === 'function') {\n return options.structuralSharing(prevData, data)\n } else if (options.structuralSharing !== false) {\n // Structurally share data between prev and new data if needed\n return replaceEqualDeep(prevData, data)\n }\n return data\n}\n\nexport function keepPreviousData<T>(\n previousData: T | undefined,\n): T | undefined {\n return previousData\n}\n\nexport function addToEnd<T>(items: Array<T>, item: T, max = 0): Array<T> {\n const newItems = [...items, item]\n return max && newItems.length > max ? newItems.slice(1) : newItems\n}\n\nexport function addToStart<T>(items: Array<T>, item: T, max = 0): Array<T> {\n const newItems = [item, ...items]\n return max && newItems.length > max ? newItems.slice(0, -1) : newItems\n}\n"],"mappings":";AAoEO,IAAM,WAAW,OAAO,WAAW,eAAe,UAAU;AAE5D,SAAS,OAAkB;AAChC,SAAO;AACT;AAEO,SAAS,iBACd,SACA,OACS;AACT,SAAO,OAAO,YAAY,aACrB,QAAgD,KAAK,IACtD;AACN;AAEO,SAAS,eAAe,OAAiC;AAC9D,SAAO,OAAO,UAAU,YAAY,SAAS,KAAK,UAAU;AAC9D;AAEO,SAAS,eAAe,WAAmB,WAA4B;AAC5E,SAAO,KAAK,IAAI,aAAa,aAAa,KAAK,KAAK,IAAI,GAAG,CAAC;AAC9D;AAEO,SAAS,WACd,SACA,OACS;AACT,QAAM;AAAA,IACJ,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,IAAI;AAEJ,MAAI,UAAU;AACZ,QAAI,OAAO;AACT,UAAI,MAAM,cAAc,sBAAsB,UAAU,MAAM,OAAO,GAAG;AACtE,eAAO;AAAA,MACT;AAAA,IACF,WAAW,CAAC,gBAAgB,MAAM,UAAU,QAAQ,GAAG;AACrD,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,SAAS,OAAO;AAClB,UAAM,WAAW,MAAM,SAAS;AAChC,QAAI,SAAS,YAAY,CAAC,UAAU;AAClC,aAAO;AAAA,IACT;AACA,QAAI,SAAS,cAAc,UAAU;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,OAAO,UAAU,aAAa,MAAM,QAAQ,MAAM,OAAO;AAC3D,WAAO;AAAA,EACT;AAEA,MACE,OAAO,gBAAgB,eACvB,gBAAgB,MAAM,MAAM,aAC5B;AACA,WAAO;AAAA,EACT;AAEA,MAAI,aAAa,CAAC,UAAU,KAAK,GAAG;AAClC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEO,SAAS,cACd,SACA,UACS;AACT,QAAM,EAAE,OAAO,QAAQ,WAAW,YAAY,IAAI;AAClD,MAAI,aAAa;AACf,QAAI,CAAC,SAAS,QAAQ,aAAa;AACjC,aAAO;AAAA,IACT;AACA,QAAI,OAAO;AACT,UAAI,QAAQ,SAAS,QAAQ,WAAW,MAAM,QAAQ,WAAW,GAAG;AAClE,eAAO;AAAA,MACT;AAAA,IACF,WAAW,CAAC,gBAAgB,SAAS,QAAQ,aAAa,WAAW,GAAG;AACtE,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,UAAU,SAAS,MAAM,WAAW,QAAQ;AAC9C,WAAO;AAAA,EACT;AAEA,MAAI,aAAa,CAAC,UAAU,QAAQ,GAAG;AACrC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAEO,SAAS,sBACd,UACA,SACQ;AACR,QAAM,SAAS,SAAS,kBAAkB;AAC1C,SAAO,OAAO,QAAQ;AACxB;AAMO,SAAS,QAAQ,UAA0C;AAChE,SAAO,KAAK;AAAA,IAAU;AAAA,IAAU,CAAC,GAAG,QAClC,cAAc,GAAG,IACb,OAAO,KAAK,GAAG,EACZ,KAAK,EACL,OAAO,CAAC,QAAQ,QAAQ;AACvB,aAAO,GAAG,IAAI,IAAI,GAAG;AACrB,aAAO;AAAA,IACT,GAAG,CAAC,CAAQ,IACd;AAAA,EACN;AACF;AAMO,SAAS,gBAAgB,GAAQ,GAAiB;AACvD,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,MAAM,OAAO,GAAG;AACzB,WAAO;AAAA,EACT;AAEA,MAAI,KAAK,KAAK,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;AAC5D,WAAO,CAAC,OAAO,KAAK,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,gBAAgB,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;AAAA,EACvE;AAEA,SAAO;AACT;AAQO,SAAS,iBAAiB,GAAQ,GAAa;AACpD,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,aAAa,CAAC,KAAK,aAAa,CAAC;AAE/C,MAAI,SAAU,cAAc,CAAC,KAAK,cAAc,CAAC,GAAI;AACnD,UAAM,QAAQ,QAAQ,EAAE,SAAS,OAAO,KAAK,CAAC,EAAE;AAChD,UAAM,SAAS,QAAQ,IAAI,OAAO,KAAK,CAAC;AACxC,UAAM,QAAQ,OAAO;AACrB,UAAM,OAAY,QAAQ,CAAC,IAAI,CAAC;AAEhC,QAAI,aAAa;AAEjB,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,YAAM,MAAM,QAAQ,IAAI,OAAO,CAAC;AAChC,WAAK,GAAG,IAAI,iBAAiB,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC;AAC3C,UAAI,KAAK,GAAG,MAAM,EAAE,GAAG,GAAG;AACxB;AAAA,MACF;AAAA,IACF;AAEA,WAAO,UAAU,SAAS,eAAe,QAAQ,IAAI;AAAA,EACvD;AAEA,SAAO;AACT;AAKO,SAAS,oBAAuB,GAAM,GAAe;AAC1D,MAAK,KAAK,CAAC,KAAO,KAAK,CAAC,GAAI;AAC1B,WAAO;AAAA,EACT;AAEA,aAAW,OAAO,GAAG;AACnB,QAAI,EAAE,GAAG,MAAM,EAAE,GAAG,GAAG;AACrB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,aAAa,OAAgB;AAC3C,SAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,OAAO,KAAK,KAAK,EAAE;AACrE;AAGO,SAAS,cAAc,GAAqB;AACjD,MAAI,CAAC,mBAAmB,CAAC,GAAG;AAC1B,WAAO;AAAA,EACT;AAGA,QAAM,OAAO,EAAE;AACf,MAAI,OAAO,SAAS,aAAa;AAC/B,WAAO;AAAA,EACT;AAGA,QAAM,OAAO,KAAK;AAClB,MAAI,CAAC,mBAAmB,IAAI,GAAG;AAC7B,WAAO;AAAA,EACT;AAGA,MAAI,CAAC,KAAK,eAAe,eAAe,GAAG;AACzC,WAAO;AAAA,EACT;AAGA,SAAO;AACT;AAEA,SAAS,mBAAmB,GAAiB;AAC3C,SAAO,OAAO,UAAU,SAAS,KAAK,CAAC,MAAM;AAC/C;AAEO,SAAS,MAAM,SAAgC;AACpD,SAAO,IAAI,QAAQ,CAAC,YAAY;AAC9B,eAAW,SAAS,OAAO;AAAA,EAC7B,CAAC;AACH;AAMO,SAAS,kBAAkB,UAAsB;AACtD,QAAM,CAAC,EAAE,KAAK,QAAQ;AACxB;AAEO,SAAS,YAGd,UAA6B,MAAa,SAA0B;AACpE,MAAI,OAAO,QAAQ,sBAAsB,YAAY;AACnD,WAAO,QAAQ,kBAAkB,UAAU,IAAI;AAAA,EACjD,WAAW,QAAQ,sBAAsB,OAAO;AAE9C,WAAO,iBAAiB,UAAU,IAAI;AAAA,EACxC;AACA,SAAO;AACT;AAEO,SAAS,iBACd,cACe;AACf,SAAO;AACT;AAEO,SAAS,SAAY,OAAiB,MAAS,MAAM,GAAa;AACvE,QAAM,WAAW,CAAC,GAAG,OAAO,IAAI;AAChC,SAAO,OAAO,SAAS,SAAS,MAAM,SAAS,MAAM,CAAC,IAAI;AAC5D;AAEO,SAAS,WAAc,OAAiB,MAAS,MAAM,GAAa;AACzE,QAAM,WAAW,CAAC,MAAM,GAAG,KAAK;AAChC,SAAO,OAAO,SAAS,SAAS,MAAM,SAAS,MAAM,GAAG,EAAE,IAAI;AAChE;","names":[]}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@tanstack/query-core",
3
- "version": "5.0.0-beta.15",
3
+ "version": "5.0.0-beta.20",
4
4
  "description": "The framework agnostic core that powers TanStack Query",
5
5
  "author": "tannerlinsley",
6
6
  "license": "MIT",
package/src/hydration.ts CHANGED
@@ -38,8 +38,8 @@ interface DehydratedQuery {
38
38
  }
39
39
 
40
40
  export interface DehydratedState {
41
- mutations: DehydratedMutation[]
42
- queries: DehydratedQuery[]
41
+ mutations: Array<DehydratedMutation>
42
+ queries: Array<DehydratedQuery>
43
43
  }
44
44
 
45
45
  // FUNCTIONS
@@ -100,7 +100,7 @@ export function infiniteQueryBehavior<TQueryFnData, TError, TData, TPageParam>(
100
100
  // Fetch first page
101
101
  result = await fetchPage(
102
102
  empty,
103
- oldPageParams[0] ?? options.defaultPageParam,
103
+ oldPageParams[0] ?? options.initialPageParam,
104
104
  )
105
105
 
106
106
  const remainingPages = pages ?? oldPages.length
package/src/mutation.ts CHANGED
@@ -88,7 +88,7 @@ export class Mutation<
88
88
  options!: MutationOptions<TData, TError, TVariables, TContext>
89
89
  readonly mutationId: number
90
90
 
91
- #observers: MutationObserver<TData, TError, TVariables, TContext>[]
91
+ #observers: Array<MutationObserver<TData, TError, TVariables, TContext>>
92
92
  #defaultOptions?: MutationOptions<TData, TError, TVariables, TContext>
93
93
  #mutationCache: MutationCache
94
94
  #retryer?: Retryer<TData>
@@ -82,7 +82,7 @@ type MutationCacheListener = (event: MutationCacheNotifyEvent) => void
82
82
  // CLASS
83
83
 
84
84
  export class MutationCache extends Subscribable<MutationCacheListener> {
85
- #mutations: Mutation<any, any, any, any>[]
85
+ #mutations: Array<Mutation<any, any, any, any>>
86
86
  #mutationId: number
87
87
  #resuming: Promise<unknown> | undefined
88
88
 
@@ -127,7 +127,7 @@ export class MutationCache extends Subscribable<MutationCacheListener> {
127
127
  })
128
128
  }
129
129
 
130
- getAll(): Mutation[] {
130
+ getAll(): Array<Mutation> {
131
131
  return this.#mutations
132
132
  }
133
133
 
@@ -146,7 +146,7 @@ export class MutationCache extends Subscribable<MutationCacheListener> {
146
146
  )
147
147
  }
148
148
 
149
- findAll(filters: MutationFilters = {}): Mutation[] {
149
+ findAll(filters: MutationFilters = {}): Array<Mutation> {
150
150
  return this.#mutations.filter((mutation) =>
151
151
  matchMutation(filters, mutation),
152
152
  )
@@ -8,10 +8,10 @@ type NotifyFunction = (callback: () => void) => void
8
8
 
9
9
  type BatchNotifyFunction = (callback: () => void) => void
10
10
 
11
- type BatchCallsCallback<T extends unknown[]> = (...args: T) => void
11
+ type BatchCallsCallback<T extends Array<unknown>> = (...args: T) => void
12
12
 
13
13
  export function createNotifyManager() {
14
- let queue: NotifyCallback[] = []
14
+ let queue: Array<NotifyCallback> = []
15
15
  let transactions = 0
16
16
  let notifyFn: NotifyFunction = (callback) => {
17
17
  callback()
@@ -47,7 +47,7 @@ export function createNotifyManager() {
47
47
  /**
48
48
  * All calls to the wrapped function will be batched.
49
49
  */
50
- const batchCalls = <T extends unknown[]>(
50
+ const batchCalls = <T extends Array<unknown>>(
51
51
  callback: BatchCallsCallback<T>,
52
52
  ): BatchCallsCallback<T> => {
53
53
  return (...args) => {
@@ -10,37 +10,37 @@ import type {
10
10
  import type { QueryClient } from './queryClient'
11
11
  import type { NotifyOptions } from './queryObserver'
12
12
 
13
- function difference<T>(array1: T[], array2: T[]): T[] {
13
+ function difference<T>(array1: Array<T>, array2: Array<T>): Array<T> {
14
14
  return array1.filter((x) => !array2.includes(x))
15
15
  }
16
16
 
17
- function replaceAt<T>(array: T[], index: number, value: T): T[] {
17
+ function replaceAt<T>(array: Array<T>, index: number, value: T): Array<T> {
18
18
  const copy = array.slice(0)
19
19
  copy[index] = value
20
20
  return copy
21
21
  }
22
22
 
23
- type QueriesObserverListener = (result: QueryObserverResult[]) => void
23
+ type QueriesObserverListener = (result: Array<QueryObserverResult>) => void
24
24
 
25
25
  export interface QueriesObserverOptions<
26
- TCombinedResult = QueryObserverResult[],
26
+ TCombinedResult = Array<QueryObserverResult>,
27
27
  > {
28
- combine?: (result: QueryObserverResult[]) => TCombinedResult
28
+ combine?: (result: Array<QueryObserverResult>) => TCombinedResult
29
29
  }
30
30
 
31
31
  export class QueriesObserver<
32
- TCombinedResult = QueryObserverResult[],
32
+ TCombinedResult = Array<QueryObserverResult>,
33
33
  > extends Subscribable<QueriesObserverListener> {
34
34
  #client: QueryClient
35
- #result!: QueryObserverResult[]
36
- #queries: QueryObserverOptions[]
37
- #observers: QueryObserver[]
35
+ #result!: Array<QueryObserverResult>
36
+ #queries: Array<QueryObserverOptions>
37
+ #observers: Array<QueryObserver>
38
38
  #options?: QueriesObserverOptions<TCombinedResult>
39
39
  #combinedResult!: TCombinedResult
40
40
 
41
41
  constructor(
42
42
  client: QueryClient,
43
- queries: QueryObserverOptions[],
43
+ queries: Array<QueryObserverOptions>,
44
44
  options?: QueriesObserverOptions<TCombinedResult>,
45
45
  ) {
46
46
  super()
@@ -53,7 +53,7 @@ export class QueriesObserver<
53
53
  this.setQueries(queries, options)
54
54
  }
55
55
 
56
- #setResult(value: QueryObserverResult[]) {
56
+ #setResult(value: Array<QueryObserverResult>) {
57
57
  this.#result = value
58
58
  this.#combinedResult = this.#combineResult(value)
59
59
  }
@@ -82,7 +82,7 @@ export class QueriesObserver<
82
82
  }
83
83
 
84
84
  setQueries(
85
- queries: QueryObserverOptions[],
85
+ queries: Array<QueryObserverOptions>,
86
86
  options?: QueriesObserverOptions<TCombinedResult>,
87
87
  notifyOptions?: NotifyOptions,
88
88
  ): void {
@@ -145,11 +145,11 @@ export class QueriesObserver<
145
145
  }
146
146
 
147
147
  getOptimisticResult(
148
- queries: QueryObserverOptions[],
148
+ queries: Array<QueryObserverOptions>,
149
149
  ): [
150
- rawResult: QueryObserverResult[],
151
- combineResult: (r?: QueryObserverResult[]) => TCombinedResult,
152
- trackResult: () => QueryObserverResult[],
150
+ rawResult: Array<QueryObserverResult>,
151
+ combineResult: (r?: Array<QueryObserverResult>) => TCombinedResult,
152
+ trackResult: () => Array<QueryObserverResult>,
153
153
  ] {
154
154
  const matches = this.#findMatchingObservers(queries)
155
155
  const result = matches.map((match) =>
@@ -158,7 +158,7 @@ export class QueriesObserver<
158
158
 
159
159
  return [
160
160
  result,
161
- (r?: QueryObserverResult[]) => {
161
+ (r?: Array<QueryObserverResult>) => {
162
162
  return this.#combineResult(r ?? result)
163
163
  },
164
164
  () => {
@@ -172,7 +172,7 @@ export class QueriesObserver<
172
172
  ]
173
173
  }
174
174
 
175
- #combineResult(input: QueryObserverResult[]): TCombinedResult {
175
+ #combineResult(input: Array<QueryObserverResult>): TCombinedResult {
176
176
  const combine = this.#options?.combine
177
177
  if (combine) {
178
178
  return replaceEqualDeep(this.#combinedResult, combine(input))
@@ -181,8 +181,8 @@ export class QueriesObserver<
181
181
  }
182
182
 
183
183
  #findMatchingObservers(
184
- queries: QueryObserverOptions[],
185
- ): QueryObserverMatch[] {
184
+ queries: Array<QueryObserverOptions>,
185
+ ): Array<QueryObserverMatch> {
186
186
  const prevObservers = this.#observers
187
187
  const prevObserversMap = new Map(
188
188
  prevObservers.map((observer) => [observer.options.queryHash, observer]),
@@ -192,7 +192,7 @@ export class QueriesObserver<
192
192
  this.#client.defaultQueryOptions(options),
193
193
  )
194
194
 
195
- const matchingObservers: QueryObserverMatch[] =
195
+ const matchingObservers: Array<QueryObserverMatch> =
196
196
  defaultedQueryOptions.flatMap((defaultedOptions) => {
197
197
  const match = prevObserversMap.get(defaultedOptions.queryHash)
198
198
  if (match != null) {
@@ -218,14 +218,13 @@ export class QueriesObserver<
218
218
  )
219
219
  }
220
220
 
221
- const newOrReusedObservers: QueryObserverMatch[] = unmatchedQueries.map(
222
- (options) => {
221
+ const newOrReusedObservers: Array<QueryObserverMatch> =
222
+ unmatchedQueries.map((options) => {
223
223
  return {
224
224
  defaultedQueryOptions: options,
225
225
  observer: getObserver(options),
226
226
  }
227
- },
228
- )
227
+ })
229
228
 
230
229
  const sortMatchesByOrderOfQueries = (
231
230
  a: QueryObserverMatch,
package/src/query.ts CHANGED
@@ -159,7 +159,7 @@ export class Query<
159
159
  #cache: QueryCache
160
160
  #promise?: Promise<TData>
161
161
  #retryer?: Retryer<TData>
162
- #observers: QueryObserver<any, any, any, any, any>[]
162
+ #observers: Array<QueryObserver<any, any, any, any, any>>
163
163
  #defaultOptions?: QueryOptions<TQueryFnData, TError, TData, TQueryKey>
164
164
  #abortSignalConsumed: boolean
165
165
 
package/src/queryCache.ts CHANGED
@@ -168,7 +168,7 @@ export class QueryCache extends Subscribable<QueryCacheListener> {
168
168
  | undefined
169
169
  }
170
170
 
171
- getAll(): Query[] {
171
+ getAll(): Array<Query> {
172
172
  return [...this.#queries.values()]
173
173
  }
174
174
 
@@ -182,7 +182,7 @@ export class QueryCache extends Subscribable<QueryCacheListener> {
182
182
  ) as Query<TQueryFnData, TError, TData> | undefined
183
183
  }
184
184
 
185
- findAll(filters: QueryFilters = {}): Query[] {
185
+ findAll(filters: QueryFilters = {}): Array<Query> {
186
186
  const queries = this.getAll()
187
187
  return Object.keys(filters).length > 0
188
188
  ? queries.filter((query) => matchQuery(filters, query))
@@ -128,7 +128,7 @@ export class QueryClient {
128
128
 
129
129
  getQueriesData<TQueryFnData = unknown>(
130
130
  filters: QueryFilters,
131
- ): [QueryKey, TQueryFnData | undefined][] {
131
+ ): Array<[QueryKey, TQueryFnData | undefined]> {
132
132
  return this.getQueryCache()
133
133
  .findAll(filters)
134
134
  .map(({ queryKey, state }) => {
@@ -167,7 +167,7 @@ export class QueryClient {
167
167
  filters: QueryFilters,
168
168
  updater: Updater<TQueryFnData | undefined, TQueryFnData | undefined>,
169
169
  options?: SetDataOptions,
170
- ): [QueryKey, TQueryFnData | undefined][] {
170
+ ): Array<[QueryKey, TQueryFnData | undefined]> {
171
171
  return notifyManager.batch(() =>
172
172
  this.getQueryCache()
173
173
  .findAll(filters)
@@ -69,7 +69,7 @@ describe('dehydration and rehydration', () => {
69
69
  key: [{ nestedKey: 1 }],
70
70
  })
71
71
 
72
- const fetchDataAfterHydration = vi.fn<unknown[], unknown>()
72
+ const fetchDataAfterHydration = vi.fn<Array<unknown>, unknown>()
73
73
  await hydrationClient.prefetchQuery({
74
74
  queryKey: ['string'],
75
75
  queryFn: fetchDataAfterHydration,
@@ -196,7 +196,7 @@ describe('dehydration and rehydration', () => {
196
196
  })?.state.data,
197
197
  ).toBe('string')
198
198
 
199
- const fetchDataAfterHydration = vi.fn<unknown[], unknown>()
199
+ const fetchDataAfterHydration = vi.fn<Array<unknown>, unknown>()
200
200
  await hydrationClient.prefetchQuery({
201
201
  queryKey: ['string', { key: ['string'], key2: 0 }],
202
202
  queryFn: fetchDataAfterHydration,
@@ -24,7 +24,7 @@ describe('InfiniteQueryBehavior', () => {
24
24
  const observer = new InfiniteQueryObserver(queryClient, {
25
25
  queryKey: key,
26
26
  retry: false,
27
- defaultPageParam: 1,
27
+ initialPageParam: 1,
28
28
  getNextPageParam: () => 2,
29
29
  })
30
30
 
@@ -62,7 +62,7 @@ describe('InfiniteQueryBehavior', () => {
62
62
  getNextPageParam: (lastPage) => lastPage + 1,
63
63
  getPreviousPageParam: (firstPage) => firstPage - 1,
64
64
  maxPages: 2,
65
- defaultPageParam: 1,
65
+ initialPageParam: 1,
66
66
  })
67
67
 
68
68
  let observerResult:
@@ -204,7 +204,7 @@ describe('InfiniteQueryBehavior', () => {
204
204
  queryFn: queryFnSpy,
205
205
  getNextPageParam: (lastPage) => lastPage + 1,
206
206
  getPreviousPageParam: (firstPage) => firstPage - 1,
207
- defaultPageParam: 1,
207
+ initialPageParam: 1,
208
208
  })
209
209
 
210
210
  let observerResult:
@@ -255,7 +255,7 @@ describe('InfiniteQueryBehavior', () => {
255
255
  queryFn: queryFnSpy,
256
256
  getNextPageParam: (lastPage) => lastPage + 1,
257
257
  getPreviousPageParam: (firstPage) => firstPage - 1,
258
- defaultPageParam: 1,
258
+ initialPageParam: 1,
259
259
  })
260
260
 
261
261
  let observerResult:
@@ -24,7 +24,7 @@ describe('InfiniteQueryObserver', () => {
24
24
  pages: data.pages.map((x) => `${x}`),
25
25
  pageParams: data.pageParams,
26
26
  }),
27
- defaultPageParam: 1,
27
+ initialPageParam: 1,
28
28
  getNextPageParam: () => 2,
29
29
  })
30
30
  let observerResult
@@ -53,7 +53,7 @@ describe('InfiniteQueryObserver', () => {
53
53
  pages: data.pages.map((x) => `${x}`),
54
54
  pageParams: data.pageParams,
55
55
  }),
56
- defaultPageParam: 1,
56
+ initialPageParam: 1,
57
57
  getNextPageParam: () => 2,
58
58
  })
59
59
  let observerResult
@@ -70,12 +70,12 @@ describe('InfiniteQueryObserver', () => {
70
70
 
71
71
  test('getNextPagParam and getPreviousPageParam should receive current pageParams', async () => {
72
72
  const key = queryKey()
73
- let single: string[] = []
74
- let all: string[] = []
73
+ let single: Array<string> = []
74
+ let all: Array<string> = []
75
75
  const observer = new InfiniteQueryObserver(queryClient, {
76
76
  queryKey: key,
77
77
  queryFn: ({ pageParam }) => String(pageParam),
78
- defaultPageParam: 1,
78
+ initialPageParam: 1,
79
79
  getNextPageParam: (_, __, lastPageParam, allPageParams) => {
80
80
  single.push('next' + lastPageParam)
81
81
  all.push('next' + allPageParams.join(','))
@@ -110,7 +110,7 @@ describe('InfiniteQueryObserver', () => {
110
110
  const observer = new InfiniteQueryObserver(queryClient, {
111
111
  queryKey: key,
112
112
  queryFn,
113
- defaultPageParam: 1,
113
+ initialPageParam: 1,
114
114
  getNextPageParam: () => next,
115
115
  })
116
116
 
@@ -137,7 +137,7 @@ describe('InfiniteQueryObserver', () => {
137
137
  const observer = new InfiniteQueryObserver(queryClient, {
138
138
  queryKey: key,
139
139
  queryFn,
140
- defaultPageParam: 1,
140
+ initialPageParam: 1,
141
141
  getNextPageParam: () => next,
142
142
  })
143
143
 
@@ -79,7 +79,7 @@ describe('mutations', () => {
79
79
  submittedAt: 0,
80
80
  })
81
81
 
82
- const states: MutationState<string, unknown, string, string>[] = []
82
+ const states: Array<MutationState<string, unknown, string, string>> = []
83
83
 
84
84
  mutation.subscribe((state) => {
85
85
  states.push(state)
@@ -159,7 +159,7 @@ describe('mutations', () => {
159
159
  retryDelay: 1,
160
160
  })
161
161
 
162
- const states: MutationState<string, unknown, string, string>[] = []
162
+ const states: Array<MutationState<string, unknown, string, string>> = []
163
163
 
164
164
  mutation.subscribe((state) => {
165
165
  states.push(state)
@@ -68,7 +68,7 @@ describe('queriesObserver', () => {
68
68
  { queryKey: key1, queryFn: queryFn1 },
69
69
  { queryKey: key2, queryFn: queryFn2 },
70
70
  ])
71
- const results: QueryObserverResult[][] = []
71
+ const results: Array<Array<QueryObserverResult>> = []
72
72
  results.push(observer.getCurrentResult())
73
73
  const unsubscribe = observer.subscribe((result) => {
74
74
  results.push(result)
@@ -113,7 +113,7 @@ describe('queriesObserver', () => {
113
113
  { queryKey: key1, queryFn: queryFn1 },
114
114
  { queryKey: key2, queryFn: queryFn2 },
115
115
  ])
116
- const results: QueryObserverResult[][] = []
116
+ const results: Array<Array<QueryObserverResult>> = []
117
117
  results.push(observer.getCurrentResult())
118
118
  const unsubscribe = observer.subscribe((result) => {
119
119
  results.push(result)
@@ -160,7 +160,7 @@ describe('queriesObserver', () => {
160
160
  { queryKey: key1, queryFn: queryFn1 },
161
161
  { queryKey: key2, queryFn: queryFn2 },
162
162
  ])
163
- const results: QueryObserverResult[][] = []
163
+ const results: Array<Array<QueryObserverResult>> = []
164
164
  results.push(observer.getCurrentResult())
165
165
  const unsubscribe = observer.subscribe((result) => {
166
166
  results.push(result)
@@ -208,7 +208,7 @@ describe('queriesObserver', () => {
208
208
  { queryKey: key1, queryFn: queryFn1 },
209
209
  { queryKey: key2, queryFn: queryFn2 },
210
210
  ])
211
- const results: QueryObserverResult[][] = []
211
+ const results: Array<Array<QueryObserverResult>> = []
212
212
  results.push(observer.getCurrentResult())
213
213
  const unsubscribe = observer.subscribe((result) => {
214
214
  results.push(result)
@@ -325,7 +325,7 @@ describe('query', () => {
325
325
  test('should not continue if explicitly cancelled', async () => {
326
326
  const key = queryKey()
327
327
 
328
- const queryFn = vi.fn<unknown[], unknown>()
328
+ const queryFn = vi.fn<Array<unknown>, unknown>()
329
329
 
330
330
  queryFn.mockImplementation(async () => {
331
331
  await sleep(10)
@@ -357,7 +357,7 @@ describe('query', () => {
357
357
  test('should not error if reset while pending', async () => {
358
358
  const key = queryKey()
359
359
 
360
- const queryFn = vi.fn<unknown[], unknown>()
360
+ const queryFn = vi.fn<Array<unknown>, unknown>()
361
361
 
362
362
  queryFn.mockImplementation(async () => {
363
363
  await sleep(10)
@@ -384,7 +384,7 @@ describe('query', () => {
384
384
  test('should be able to refetch a cancelled query', async () => {
385
385
  const key = queryKey()
386
386
 
387
- const queryFn = vi.fn<unknown[], unknown>()
387
+ const queryFn = vi.fn<Array<unknown>, unknown>()
388
388
 
389
389
  queryFn.mockImplementation(async () => {
390
390
  await sleep(50)