Homec4science
Diffusion Open Access Compliance Check Tool (OACCT) (paginated-inlines) Browse

rOACCT/node_modules/react-query/dist/createWebStoragePersistor-experimental.development.js.map
5d92ed19fb80paginated-inlines

Last Change
Raw File

createWebStoragePersistor-experimental.development.js.map
View Options

{
"version": 3,
"file": "createWebStoragePersistor-experimental.development.js",
"sources": [
"../node_modules/@babel/runtime/helpers/esm/extends.js",
"../src/core/utils.ts",
"../src/createWebStoragePersistor-experimental/index.ts"
],
"sourcesContent": [
"export default function _extends() {\n _extends = Object.assign || function (target) {\n for (var i = 1; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n };\n\n return _extends.apply(this, arguments);\n}",
"import type { Mutation } from './mutation'\nimport type { Query } from './query'\nimport { EnsuredQueryKey } from './types'\nimport type {\n MutationFunction,\n MutationKey,\n MutationOptions,\n QueryFunction,\n QueryKey,\n QueryOptions,\n} from './types'\n\n// TYPES\n\nexport interface QueryFilters {\n /**\n * Include or exclude active queries\n */\n active?: boolean\n /**\n * Match query key exactly\n */\n exact?: boolean\n /**\n * Include or exclude inactive queries\n */\n inactive?: 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 or exclude fetching queries\n */\n fetching?: boolean\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 * Include or exclude fetching mutations\n */\n fetching?: boolean\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 QueryStatusFilter = 'all' | 'active' | 'inactive' | 'none'\n\n// UTILS\n\nexport const isServer = typeof window === 'undefined'\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 ensureQueryKeyArray<T extends QueryKey>(\n value: T\n): EnsuredQueryKey<T> {\n return (Array.isArray(value)\n ? value\n : ([value] as unknown)) as EnsuredQueryKey<T>\n}\n\nexport function difference<T>(array1: T[], array2: T[]): T[] {\n return array1.filter(x => array2.indexOf(x) === -1)\n}\n\nexport function replaceAt<T>(array: T[], index: number, value: T): T[] {\n const copy = array.slice(0)\n copy[index] = value\n return copy\n}\n\nexport function timeUntilStale(updatedAt: number, staleTime?: number): number {\n return Math.max(updatedAt + (staleTime || 0) - Date.now(), 0)\n}\n\nexport function parseQueryArgs<\n TOptions extends QueryOptions<any, any, any, TQueryKey>,\n TQueryKey extends QueryKey = QueryKey\n>(\n arg1: TQueryKey | TOptions,\n arg2?: QueryFunction<any, TQueryKey> | TOptions,\n arg3?: TOptions\n): TOptions {\n if (!isQueryKey(arg1)) {\n return arg1 as TOptions\n }\n\n if (typeof arg2 === 'function') {\n return { ...arg3, queryKey: arg1, queryFn: arg2 } as TOptions\n }\n\n return { ...arg2, queryKey: arg1 } as TOptions\n}\n\nexport function parseMutationArgs<\n TOptions extends MutationOptions<any, any, any, any>\n>(\n arg1: MutationKey | MutationFunction<any, any> | TOptions,\n arg2?: MutationFunction<any, any> | TOptions,\n arg3?: TOptions\n): TOptions {\n if (isQueryKey(arg1)) {\n if (typeof arg2 === 'function') {\n return { ...arg3, mutationKey: arg1, mutationFn: arg2 } as TOptions\n }\n return { ...arg2, mutationKey: arg1 } as TOptions\n }\n\n if (typeof arg1 === 'function') {\n return { ...arg2, mutationFn: arg1 } as TOptions\n }\n\n return { ...arg1 } as TOptions\n}\n\nexport function parseFilterArgs<\n TFilters extends QueryFilters,\n TOptions = unknown\n>(\n arg1?: QueryKey | TFilters,\n arg2?: TFilters | TOptions,\n arg3?: TOptions\n): [TFilters, TOptions | undefined] {\n return (isQueryKey(arg1)\n ? [{ ...arg2, queryKey: arg1 }, arg3]\n : [arg1 || {}, arg2]) as [TFilters, TOptions]\n}\n\nexport function parseMutationFilterArgs(\n arg1?: QueryKey | MutationFilters,\n arg2?: MutationFilters\n): MutationFilters | undefined {\n return isQueryKey(arg1) ? { ...arg2, mutationKey: arg1 } : arg1\n}\n\nexport function mapQueryStatusFilter(\n active?: boolean,\n inactive?: boolean\n): QueryStatusFilter {\n if (\n (active === true && inactive === true) ||\n (active == null && inactive == null)\n ) {\n return 'all'\n } else if (active === false && inactive === false) {\n return 'none'\n } else {\n // At this point, active|inactive can only be true|false or false|true\n // so, when only one value is provided, the missing one has to be the negated value\n const isActive = active ?? !inactive\n return isActive ? 'active' : 'inactive'\n }\n}\n\nexport function matchQuery(\n filters: QueryFilters,\n query: Query<any, any, any, any>\n): boolean {\n const {\n active,\n exact,\n fetching,\n inactive,\n predicate,\n queryKey,\n stale,\n } = filters\n\n if (isQueryKey(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 const queryStatusFilter = mapQueryStatusFilter(active, inactive)\n\n if (queryStatusFilter === 'none') {\n return false\n } else if (queryStatusFilter !== 'all') {\n const isActive = query.isActive()\n if (queryStatusFilter === 'active' && !isActive) {\n return false\n }\n if (queryStatusFilter === 'inactive' && isActive) {\n return false\n }\n }\n\n if (typeof stale === 'boolean' && query.isStale() !== stale) {\n return false\n }\n\n if (typeof fetching === 'boolean' && query.isFetching() !== fetching) {\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, fetching, predicate, mutationKey } = filters\n if (isQueryKey(mutationKey)) {\n if (!mutation.options.mutationKey) {\n return false\n }\n if (exact) {\n if (\n hashQueryKey(mutation.options.mutationKey) !== hashQueryKey(mutationKey)\n ) {\n return false\n }\n } else if (!partialMatchKey(mutation.options.mutationKey, mutationKey)) {\n return false\n }\n }\n\n if (\n typeof fetching === 'boolean' &&\n (mutation.state.status === 'loading') !== fetching\n ) {\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 || hashQueryKey\n return hashFn(queryKey)\n}\n\n/**\n * Default query keys hash function.\n */\nexport function hashQueryKey(queryKey: QueryKey): string {\n const asArray = ensureQueryKeyArray(queryKey)\n return stableValueHash(asArray)\n}\n\n/**\n * Hashes the value into a stable hash.\n */\nexport function stableValueHash(value: any): string {\n return JSON.stringify(value, (_, 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 {\n return partialDeepEqual(ensureQueryKeyArray(a), ensureQueryKeyArray(b))\n}\n\n/**\n * Checks if `b` partially matches with `a`.\n */\nexport function partialDeepEqual(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 => !partialDeepEqual(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 = Array.isArray(a) && Array.isArray(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\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 isQueryKey(value: any): value is QueryKey {\n return typeof value === 'string' || Array.isArray(value)\n}\n\nexport function isError(value: any): value is Error {\n return value instanceof Error\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): void {\n Promise.resolve()\n .then(callback)\n .catch(error =>\n setTimeout(() => {\n throw error\n })\n )\n}\n\nexport function getAbortController(): AbortController | undefined {\n if (typeof AbortController === 'function') {\n return new AbortController()\n }\n}\n",
"import { noop } from '../core/utils'\nimport { PersistedClient, Persistor } from '../persistQueryClient-experimental'\n\ninterface CreateWebStoragePersistorOptions {\n /** The storage client used for setting an retrieving items from cache */\n storage: Storage\n /** The key to use when storing the cache */\n key?: string\n /** To avoid spamming,\n * pass a time in ms to throttle saving the cache to disk */\n throttleTime?: number\n /**\n * How to serialize the data to storage.\n * @default `JSON.stringify`\n */\n serialize?: (client: PersistedClient) => string\n /**\n * How to deserialize the data from storage.\n * @default `JSON.parse`\n */\n deserialize?: (cachedString: string) => PersistedClient\n}\n\nexport function createWebStoragePersistor({\n storage,\n key = `REACT_QUERY_OFFLINE_CACHE`,\n throttleTime = 1000,\n serialize = JSON.stringify,\n deserialize = JSON.parse,\n}: CreateWebStoragePersistorOptions): Persistor {\n //try to save data to storage\n function trySave(persistedClient: PersistedClient) {\n try {\n storage.setItem(key, serialize(persistedClient))\n } catch {\n return false\n }\n return true\n }\n\n if (typeof storage !== 'undefined') {\n return {\n persistClient: throttle(persistedClient => {\n if (trySave(persistedClient) !== true) {\n const mutations = [...persistedClient.clientState.mutations]\n const queries = [...persistedClient.clientState.queries]\n const client: PersistedClient = {\n ...persistedClient,\n clientState: { mutations, queries },\n }\n\n // sort queries by dataUpdatedAt (oldest first)\n const sortedQueries = [...queries].sort(\n (a, b) => a.state.dataUpdatedAt - b.state.dataUpdatedAt\n )\n // clean old queries and try to save\n while (sortedQueries.length > 0) {\n const oldestData = sortedQueries.shift()\n client.clientState.queries = queries.filter(q => q !== oldestData)\n if (trySave(client)) {\n return // save success\n }\n }\n\n // clean mutations and try to save\n while (mutations.shift()) {\n if (trySave(client)) {\n return // save success\n }\n }\n }\n }, throttleTime),\n restoreClient: () => {\n const cacheString = storage.getItem(key)\n\n if (!cacheString) {\n return\n }\n\n return deserialize(cacheString) as PersistedClient\n },\n removeClient: () => {\n storage.removeItem(key)\n },\n }\n }\n\n return {\n persistClient: noop,\n restoreClient: noop,\n removeClient: noop,\n }\n}\n\nfunction throttle<TArgs extends any[]>(\n func: (...args: TArgs) => any,\n wait = 100\n) {\n let timer: number | null = null\n let params: TArgs\n return function (...args: TArgs) {\n params = args\n if (timer === null) {\n timer = setTimeout(() => {\n func(...params)\n timer = null\n }, wait)\n }\n }\n}\n"
],
"names": [
"_extends",
"Object",
"assign",
"target",
"i",
"arguments",
"length",
"source",
"key",
"prototype",
"hasOwnProperty",
"call",
"apply",
"noop",
"undefined",
"createWebStoragePersistor",
"storage",
"throttleTime",
"serialize",
"JSON",
"stringify",
"deserialize",
"parse",
"trySave",
"persistedClient",
"setItem",
"persistClient",
"throttle",
"mutations",
"clientState",
"queries",
"client",
"sortedQueries",
"sort",
"a",
"b",
"state",
"dataUpdatedAt",
"oldestData",
"shift",
"filter",
"q",
"restoreClient",
"cacheString",
"getItem",
"removeClient",
"removeItem",
"func",
"wait",
"timer",
"params",
"args",
"setTimeout"
],
"mappings": ";;;;;;EAAe,SAASA,QAAT,GAAoB;EACjCA,EAAAA,QAAQ,GAAGC,MAAM,CAACC,MAAP,IAAiB,UAAUC,MAAV,EAAkB;EAC5C,SAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGC,SAAS,CAACC,MAA9B,EAAsCF,CAAC,EAAvC,EAA2C;EACzC,UAAIG,MAAM,GAAGF,SAAS,CAACD,CAAD,CAAtB;;EAEA,WAAK,IAAII,GAAT,IAAgBD,MAAhB,EAAwB;EACtB,YAAIN,MAAM,CAACQ,SAAP,CAAiBC,cAAjB,CAAgCC,IAAhC,CAAqCJ,MAArC,EAA6CC,GAA7C,CAAJ,EAAuD;EACrDL,UAAAA,MAAM,CAACK,GAAD,CAAN,GAAcD,MAAM,CAACC,GAAD,CAApB;EACD;EACF;EACF;;EAED,WAAOL,MAAP;EACD,GAZD;;EAcA,SAAOH,QAAQ,CAACY,KAAT,CAAe,IAAf,EAAqBP,SAArB,CAAP;EACD;;EC4DM,SAASQ,IAAT,GAA2B;EAChC,SAAOC,SAAP;EACD;;ECvDM,SAASC,yBAAT,OAMyC;EAAA,MAL9CC,OAK8C,QAL9CA,OAK8C;EAAA,sBAJ9CR,GAI8C;EAAA,MAJ9CA,GAI8C;EAAA,+BAH9CS,YAG8C;EAAA,MAH9CA,YAG8C,kCAH/B,IAG+B;EAAA,4BAF9CC,SAE8C;EAAA,MAF9CA,SAE8C,+BAFlCC,IAAI,CAACC,SAE6B;EAAA,8BAD9CC,WAC8C;EAAA,MAD9CA,WAC8C,iCADhCF,IAAI,CAACG,KAC2B;;EAC9C;EACA,WAASC,OAAT,CAAiBC,eAAjB,EAAmD;EACjD,QAAI;EACFR,MAAAA,OAAO,CAACS,OAAR,CAAgBjB,GAAhB,EAAqBU,SAAS,CAACM,eAAD,CAA9B;EACD,KAFD,CAEE,gBAAM;EACN,aAAO,KAAP;EACD;;EACD,WAAO,IAAP;EACD;;EAED,MAAI,OAAOR,OAAP,KAAmB,WAAvB,EAAoC;EAClC,WAAO;EACLU,MAAAA,aAAa,EAAEC,QAAQ,CAAC,UAAAH,eAAe,EAAI;EACzC,YAAID,OAAO,CAACC,eAAD,CAAP,KAA6B,IAAjC,EAAuC;EACrC,cAAMI,SAAS,aAAOJ,eAAe,CAACK,WAAhB,CAA4BD,SAAnC,CAAf;EACA,cAAME,OAAO,aAAON,eAAe,CAACK,WAAhB,CAA4BC,OAAnC,CAAb;;EACA,cAAMC,OAAuB,gBACxBP,eADwB;EAE3BK,YAAAA,WAAW,EAAE;EAAED,cAAAA,SAAS,EAATA,SAAF;EAAaE,cAAAA,OAAO,EAAPA;EAAb;EAFc,YAA7B,CAHqC;;;EASrC,cAAME,aAAa,GAAG,UAAIF,OAAJ,EAAaG,IAAb,CACpB,UAACC,CAAD,EAAIC,CAAJ;EAAA,mBAAUD,CAAC,CAACE,KAAF,CAAQC,aAAR,GAAwBF,CAAC,CAACC,KAAF,CAAQC,aAA1C;EAAA,WADoB,CAAtB,CATqC;;EAAA;EAcnC,gBAAMC,UAAU,GAAGN,aAAa,CAACO,KAAd,EAAnB;EACAR,YAAAA,OAAM,CAACF,WAAP,CAAmBC,OAAnB,GAA6BA,OAAO,CAACU,MAAR,CAAe,UAAAC,CAAC;EAAA,qBAAIA,CAAC,KAAKH,UAAV;EAAA,aAAhB,CAA7B;;EACA,gBAAIf,OAAO,CAACQ,OAAD,CAAX,EAAqB;EACnB;EAAA;EAAA,gBADmB;EAEpB;EAlBkC;;EAarC,iBAAOC,aAAa,CAAC1B,MAAd,GAAuB,CAA9B,EAAiC;EAAA;;EAAA;EAMhC,WAnBoC;;;EAsBrC,iBAAOsB,SAAS,CAACW,KAAV,EAAP,EAA0B;EACxB,gBAAIhB,OAAO,CAACQ,OAAD,CAAX,EAAqB;EACnB,qBADmB;EAEpB;EACF;EACF;EACF,OA7BsB,EA6BpBd,YA7BoB,CADlB;EA+BLyB,MAAAA,aAAa,EAAE,yBAAM;EACnB,YAAMC,WAAW,GAAG3B,OAAO,CAAC4B,OAAR,CAAgBpC,GAAhB,CAApB;;EAEA,YAAI,CAACmC,WAAL,EAAkB;EAChB;EACD;;EAED,eAAOtB,WAAW,CAACsB,WAAD,CAAlB;EACD,OAvCI;EAwCLE,MAAAA,YAAY,EAAE,wBAAM;EAClB7B,QAAAA,OAAO,CAAC8B,UAAR,CAAmBtC,GAAnB;EACD;EA1CI,KAAP;EA4CD;;EAED,SAAO;EACLkB,IAAAA,aAAa,EAAEb,IADV;EAEL6B,IAAAA,aAAa,EAAE7B,IAFV;EAGLgC,IAAAA,YAAY,EAAEhC;EAHT,GAAP;EAKD;;EAED,SAASc,QAAT,CACEoB,IADF,EAEEC,IAFF,EAGE;EAAA,MADAA,IACA;EADAA,IAAAA,IACA,GADO,GACP;EAAA;;EACA,MAAIC,KAAoB,GAAG,IAA3B;EACA,MAAIC,MAAJ;EACA,SAAO,YAA0B;EAAA,sCAAbC,IAAa;EAAbA,MAAAA,IAAa;EAAA;;EAC/BD,IAAAA,MAAM,GAAGC,IAAT;;EACA,QAAIF,KAAK,KAAK,IAAd,EAAoB;EAClBA,MAAAA,KAAK,GAAGG,UAAU,CAAC,YAAM;EACvBL,QAAAA,IAAI,MAAJ,SAAQG,MAAR;EACAD,QAAAA,KAAK,GAAG,IAAR;EACD,OAHiB,EAGfD,IAHe,CAAlB;EAID;EACF,GARD;EASD;;;;;;;;;;;;"
}
c4science · Help