@apollo/client 3.13.7 → 3.13.9-rc.0

package/cache/cache.d.cts

@@ -1 +0,0 @@
-export * from "./index.d.ts";

package/cache/inmemory/fixPolyfills.d.ts

@@ -1 +0,0 @@
-//# sourceMappingURL=fixPolyfills.d.ts.map

package/cache/inmemory/fixPolyfills.js

@@ -1,10 +0,0 @@
-"use strict";
-// Most JavaScript environments do not need the workarounds implemented in
-// fixPolyfills.native.ts, so importing fixPolyfills.ts merely imports
-// this empty module, adding nothing to bundle sizes or execution times.
-// When bundling for React Native, we substitute fixPolyfills.native.js
-// for fixPolyfills.js (see the "react-native" section of package.json),
-// to work around problems with Map and Set polyfills in older versions of
-// React Native (which should have been fixed in react-native@0.59.0):
-// https://github.com/apollographql/apollo-client/pull/5962
-//# sourceMappingURL=fixPolyfills.js.map

package/cache/inmemory/fixPolyfills.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fixPolyfills.js","sourceRoot":"","sources":["../../../src/cache/inmemory/fixPolyfills.ts"],"names":[],"mappings":";AAAA,0EAA0E;AAC1E,sEAAsE;AACtE,wEAAwE;AACxE,uEAAuE;AACvE,wEAAwE;AACxE,0EAA0E;AAC1E,sEAAsE;AACtE,2DAA2D","sourcesContent":["// Most JavaScript environments do not need the workarounds implemented in\n// fixPolyfills.native.ts, so importing fixPolyfills.ts merely imports\n// this empty module, adding nothing to bundle sizes or execution times.\n// When bundling for React Native, we substitute fixPolyfills.native.js\n// for fixPolyfills.js (see the \"react-native\" section of package.json),\n// to work around problems with Map and Set polyfills in older versions of\n// React Native (which should have been fixed in react-native@0.59.0):\n// https://github.com/apollographql/apollo-client/pull/5962\n"]}

package/cache/inmemory/fixPolyfills.native.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=fixPolyfills.native.d.ts.map

package/cache/inmemory/fixPolyfills.native.js

@@ -1,61 +0,0 @@
-// Make sure Map.prototype.set returns the Map instance, per spec.
-// https://github.com/apollographql/apollo-client/issues/4024
-var testMap = new Map();
-if (testMap.set(1, 2) !== testMap) {
-    var set_1 = testMap.set;
-    Map.prototype.set = function () {
-        var args = [];
-        for (var _i = 0; _i < arguments.length; _i++) {
-            args[_i] = arguments[_i];
-        }
-        set_1.apply(this, args);
-        return this;
-    };
-}
-// Make sure Set.prototype.add returns the Set instance, per spec.
-var testSet = new Set();
-if (testSet.add(3) !== testSet) {
-    var add_1 = testSet.add;
-    Set.prototype.add = function () {
-        var args = [];
-        for (var _i = 0; _i < arguments.length; _i++) {
-            args[_i] = arguments[_i];
-        }
-        add_1.apply(this, args);
-        return this;
-    };
-}
-var frozen = {};
-if (typeof Object.freeze === "function") {
-    Object.freeze(frozen);
-}
-try {
-    // If non-extensible objects can't be stored as keys in a Map, make sure we
-    // do not freeze/seal/etc. an object without first attempting to put it in a
-    // Map. For example, this gives the React Native Map polyfill a chance to tag
-    // objects before they become non-extensible:
-    // https://github.com/facebook/react-native/blob/98a6f19d7c/Libraries/vendor/core/Map.js#L44-L50
-    // https://github.com/apollographql/react-apollo/issues/2442#issuecomment-426489517
-    testMap.set(frozen, frozen).delete(frozen);
-}
-catch (_a) {
-    var wrap = function (method) {
-        return (method &&
-            (function (obj) {
-                try {
-                    // If .set succeeds, also call .delete to avoid leaking memory.
-                    testMap.set(obj, obj).delete(obj);
-                }
-                finally {
-                    // If .set or .delete fails, the exception will be silently swallowed
-                    // by this return-from-finally statement:
-                    return method.call(Object, obj);
-                }
-            }));
-    };
-    Object.freeze = wrap(Object.freeze);
-    Object.seal = wrap(Object.seal);
-    Object.preventExtensions = wrap(Object.preventExtensions);
-}
-export {};
-//# sourceMappingURL=fixPolyfills.native.js.map

package/cache/inmemory/fixPolyfills.native.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fixPolyfills.native.js","sourceRoot":"","sources":["../../../src/cache/inmemory/fixPolyfills.native.ts"],"names":[],"mappings":"AAAA,kEAAkE;AAClE,6DAA6D;AAC7D,IAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;AAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;IAC1B,IAAA,KAAG,GAAK,OAAO,IAAZ,CAAa;IACxB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG;QAAU,cAAO;aAAP,UAAO,EAAP,qBAAO,EAAP,IAAO;YAAP,yBAAO;;QACnC,KAAG,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;AACJ,CAAC;AAED,kEAAkE;AAClE,IAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;AAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;IACvB,IAAA,KAAG,GAAK,OAAO,IAAZ,CAAa;IACxB,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG;QAAU,cAAO;aAAP,UAAO,EAAP,qBAAO,EAAP,IAAO;YAAP,yBAAO;;QACnC,KAAG,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;AACJ,CAAC;AAED,IAAM,MAAM,GAAG,EAAE,CAAC;AAClB,IAAI,OAAO,MAAM,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;IACxC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AACxB,CAAC;AAED,IAAI,CAAC;IACH,2EAA2E;IAC3E,4EAA4E;IAC5E,6EAA6E;IAC7E,6CAA6C;IAC7C,gGAAgG;IAChG,mFAAmF;IACnF,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAC7C,CAAC;AAAC,WAAM,CAAC;IACP,IAAM,IAAI,GAAG,UAA6B,MAAS;QACjD,OAAO,CACL,MAAM;YACL,CAAC,UAAC,GAAG;gBACJ,IAAI,CAAC;oBACH,+DAA+D;oBAC/D,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpC,CAAC;wBAAS,CAAC;oBACT,qEAAqE;oBACrE,yCAAyC;oBACzC,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC,CAAO,CACT,CAAC;IACJ,CAAC,CAAC;IACF,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,CAAC,iBAAiB,GAAG,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;AAC5D,CAAC","sourcesContent":["// Make sure Map.prototype.set returns the Map instance, per spec.\n// https://github.com/apollographql/apollo-client/issues/4024\nconst testMap = new Map();\nif (testMap.set(1, 2) !== testMap) {\n  const { set } = testMap;\n  Map.prototype.set = function (...args) {\n    set.apply(this, args);\n    return this;\n  };\n}\n\n// Make sure Set.prototype.add returns the Set instance, per spec.\nconst testSet = new Set();\nif (testSet.add(3) !== testSet) {\n  const { add } = testSet;\n  Set.prototype.add = function (...args) {\n    add.apply(this, args);\n    return this;\n  };\n}\n\nconst frozen = {};\nif (typeof Object.freeze === \"function\") {\n  Object.freeze(frozen);\n}\n\ntry {\n  // If non-extensible objects can't be stored as keys in a Map, make sure we\n  // do not freeze/seal/etc. an object without first attempting to put it in a\n  // Map. For example, this gives the React Native Map polyfill a chance to tag\n  // objects before they become non-extensible:\n  // https://github.com/facebook/react-native/blob/98a6f19d7c/Libraries/vendor/core/Map.js#L44-L50\n  // https://github.com/apollographql/react-apollo/issues/2442#issuecomment-426489517\n  testMap.set(frozen, frozen).delete(frozen);\n} catch {\n  const wrap = <M extends <T>(obj: T) => T>(method: M): M => {\n    return (\n      method &&\n      (((obj) => {\n        try {\n          // If .set succeeds, also call .delete to avoid leaking memory.\n          testMap.set(obj, obj).delete(obj);\n        } finally {\n          // If .set or .delete fails, the exception will be silently swallowed\n          // by this return-from-finally statement:\n          return method.call(Object, obj);\n        }\n      }) as M)\n    );\n  };\n  Object.freeze = wrap(Object.freeze);\n  Object.seal = wrap(Object.seal);\n  Object.preventExtensions = wrap(Object.preventExtensions);\n}\n\nexport {};\n"]}

package/cache/inmemory/object-canon.d.ts

@@ -1,12 +0,0 @@
-export declare class ObjectCanon {
-    private known;
-    private pool;
-    isKnown(value: any): boolean;
-    private passes;
-    pass<T>(value: T): T;
-    admit<T>(value: T): T;
-    private sortedKeys;
-    private keysByJSON;
-    readonly empty: {};
-}
-//# sourceMappingURL=object-canon.d.ts.map

package/cache/inmemory/object-canon.js

@@ -1,181 +0,0 @@
-import { __assign } from "tslib";
-import { Trie } from "@wry/trie";
-import { canUseWeakMap, canUseWeakSet, isNonNullObject as isObjectOrArray, } from "../../utilities/index.js";
-import { isArray } from "./helpers.js";
-function shallowCopy(value) {
-    if (isObjectOrArray(value)) {
-        return isArray(value) ?
-            value.slice(0)
-            : __assign({ __proto__: Object.getPrototypeOf(value) }, value);
-    }
-    return value;
-}
-// When programmers talk about the "canonical form" of an object, they
-// usually have the following meaning in mind, which I've copied from
-// https://en.wiktionary.org/wiki/canonical_form:
-//
-// 1. A standard or normal presentation of a mathematical entity [or
-//    object]. A canonical form is an element of a set of representatives
-//    of equivalence classes of forms such that there is a function or
-//    procedure which projects every element of each equivalence class
-//    onto that one element, the canonical form of that equivalence
-//    class. The canonical form is expected to be simpler than the rest of
-//    the forms in some way.
-//
-// That's a long-winded way of saying any two objects that have the same
-// canonical form may be considered equivalent, even if they are !==,
-// which usually means the objects are structurally equivalent (deeply
-// equal), but don't necessarily use the same memory.
-//
-// Like a literary or musical canon, this ObjectCanon class represents a
-// collection of unique canonical items (JavaScript objects), with the
-// important property that canon.admit(a) === canon.admit(b) if a and b
-// are deeply equal to each other. In terms of the definition above, the
-// canon.admit method is the "function or procedure which projects every"
-// object "onto that one element, the canonical form."
-//
-// In the worst case, the canonicalization process may involve looking at
-// every property in the provided object tree, so it takes the same order
-// of time as deep equality checking. Fortunately, already-canonicalized
-// objects are returned immediately from canon.admit, so the presence of
-// canonical subtrees tends to speed up canonicalization.
-//
-// Since consumers of canonical objects can check for deep equality in
-// constant time, canonicalizing cache results can massively improve the
-// performance of application code that skips re-rendering unchanged
-// results, such as "pure" UI components in a framework like React.
-//
-// Of course, since canonical objects may be shared widely between
-// unrelated consumers, it's important to think of them as immutable, even
-// though they are not actually frozen with Object.freeze in production,
-// due to the extra performance overhead that comes with frozen objects.
-//
-// Custom scalar objects whose internal class name is neither Array nor
-// Object can be included safely in the admitted tree, but they will not
-// be replaced with a canonical version (to put it another way, they are
-// assumed to be canonical already).
-//
-// If we ignore custom objects, no detection of cycles or repeated object
-// references is currently required by the StoreReader class, since
-// GraphQL result objects are JSON-serializable trees (and thus contain
-// neither cycles nor repeated subtrees), so we can avoid the complexity
-// of keeping track of objects we've already seen during the recursion of
-// the admit method.
-//
-// In the future, we may consider adding additional cases to the switch
-// statement to handle other common object types, such as "[object Date]"
-// objects, as needed.
-var ObjectCanon = /** @class */ (function () {
-    function ObjectCanon() {
-        // Set of all canonical objects this ObjectCanon has admitted, allowing
-        // canon.admit to return previously-canonicalized objects immediately.
-        this.known = new (canUseWeakSet ? WeakSet : Set)();
-        // Efficient storage/lookup structure for canonical objects.
-        this.pool = new Trie(canUseWeakMap);
-        // Make the ObjectCanon assume this value has already been
-        // canonicalized.
-        this.passes = new WeakMap();
-        // Arrays that contain the same elements in a different order can share
-        // the same SortedKeysInfo object, to save memory.
-        this.keysByJSON = new Map();
-        // This has to come last because it depends on keysByJSON.
-        this.empty = this.admit({});
-    }
-    ObjectCanon.prototype.isKnown = function (value) {
-        return isObjectOrArray(value) && this.known.has(value);
-    };
-    ObjectCanon.prototype.pass = function (value) {
-        if (isObjectOrArray(value)) {
-            var copy = shallowCopy(value);
-            this.passes.set(copy, value);
-            return copy;
-        }
-        return value;
-    };
-    ObjectCanon.prototype.admit = function (value) {
-        var _this = this;
-        if (isObjectOrArray(value)) {
-            var original = this.passes.get(value);
-            if (original)
-                return original;
-            var proto = Object.getPrototypeOf(value);
-            switch (proto) {
-                case Array.prototype: {
-                    if (this.known.has(value))
-                        return value;
-                    var array = value.map(this.admit, this);
-                    // Arrays are looked up in the Trie using their recursively
-                    // canonicalized elements, and the known version of the array is
-                    // preserved as node.array.
-                    var node = this.pool.lookupArray(array);
-                    if (!node.array) {
-                        this.known.add((node.array = array));
-                        // Since canonical arrays may be shared widely between
-                        // unrelated consumers, it's important to regard them as
-                        // immutable, even if they are not frozen in production.
-                        if (globalThis.__DEV__ !== false) {
-                            Object.freeze(array);
-                        }
-                    }
-                    return node.array;
-                }
-                case null:
-                case Object.prototype: {
-                    if (this.known.has(value))
-                        return value;
-                    var proto_1 = Object.getPrototypeOf(value);
-                    var array_1 = [proto_1];
-                    var keys = this.sortedKeys(value);
-                    array_1.push(keys.json);
-                    var firstValueIndex_1 = array_1.length;
-                    keys.sorted.forEach(function (key) {
-                        array_1.push(_this.admit(value[key]));
-                    });
-                    // Objects are looked up in the Trie by their prototype (which
-                    // is *not* recursively canonicalized), followed by a JSON
-                    // representation of their (sorted) keys, followed by the
-                    // sequence of recursively canonicalized values corresponding to
-                    // those keys. To keep the final results unambiguous with other
-                    // sequences (such as arrays that just happen to contain [proto,
-                    // keys.json, value1, value2, ...]), the known version of the
-                    // object is stored as node.object.
-                    var node = this.pool.lookupArray(array_1);
-                    if (!node.object) {
-                        var obj_1 = (node.object = Object.create(proto_1));
-                        this.known.add(obj_1);
-                        keys.sorted.forEach(function (key, i) {
-                            obj_1[key] = array_1[firstValueIndex_1 + i];
-                        });
-                        // Since canonical objects may be shared widely between
-                        // unrelated consumers, it's important to regard them as
-                        // immutable, even if they are not frozen in production.
-                        if (globalThis.__DEV__ !== false) {
-                            Object.freeze(obj_1);
-                        }
-                    }
-                    return node.object;
-                }
-            }
-        }
-        return value;
-    };
-    // It's worthwhile to cache the sorting of arrays of strings, since the
-    // same initial unsorted arrays tend to be encountered many times.
-    // Fortunately, we can reuse the Trie machinery to look up the sorted
-    // arrays in linear time (which is faster than sorting large arrays).
-    ObjectCanon.prototype.sortedKeys = function (obj) {
-        var keys = Object.keys(obj);
-        var node = this.pool.lookupArray(keys);
-        if (!node.keys) {
-            keys.sort();
-            var json = JSON.stringify(keys);
-            if (!(node.keys = this.keysByJSON.get(json))) {
-                this.keysByJSON.set(json, (node.keys = { sorted: keys, json: json }));
-            }
-        }
-        return node.keys;
-    };
-    return ObjectCanon;
-}());
-export { ObjectCanon };
-//# sourceMappingURL=object-canon.js.map

package/cache/inmemory/object-canon.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"object-canon.js","sourceRoot":"","sources":["../../../src/cache/inmemory/object-canon.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EACL,aAAa,EACb,aAAa,EACb,eAAe,IAAI,eAAe,GACnC,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAEvC,SAAS,WAAW,CAAI,KAAQ;IAC9B,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YAClB,KAAK,CAAC,KAAK,CAAC,CAAC,CAAc;YAC9B,CAAC,YAAG,SAAS,EAAE,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,IAAK,KAAK,CAAE,CAAC;IAC5D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sEAAsE;AACtE,qEAAqE;AACrE,iDAAiD;AACjD,EAAE;AACF,oEAAoE;AACpE,yEAAyE;AACzE,sEAAsE;AACtE,sEAAsE;AACtE,mEAAmE;AACnE,0EAA0E;AAC1E,4BAA4B;AAC5B,EAAE;AACF,wEAAwE;AACxE,qEAAqE;AACrE,sEAAsE;AACtE,qDAAqD;AACrD,EAAE;AACF,wEAAwE;AACxE,sEAAsE;AACtE,uEAAuE;AACvE,wEAAwE;AACxE,yEAAyE;AACzE,sDAAsD;AACtD,EAAE;AACF,yEAAyE;AACzE,yEAAyE;AACzE,wEAAwE;AACxE,wEAAwE;AACxE,yDAAyD;AACzD,EAAE;AACF,sEAAsE;AACtE,wEAAwE;AACxE,oEAAoE;AACpE,mEAAmE;AACnE,EAAE;AACF,kEAAkE;AAClE,0EAA0E;AAC1E,wEAAwE;AACxE,wEAAwE;AACxE,EAAE;AACF,uEAAuE;AACvE,wEAAwE;AACxE,wEAAwE;AACxE,oCAAoC;AACpC,EAAE;AACF,yEAAyE;AACzE,mEAAmE;AACnE,uEAAuE;AACvE,wEAAwE;AACxE,yEAAyE;AACzE,oBAAoB;AACpB,EAAE;AACF,uEAAuE;AACvE,yEAAyE;AACzE,sBAAsB;AACtB;IAAA;QACE,uEAAuE;QACvE,sEAAsE;QAC9D,UAAK,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAU,CAAC;QAE9D,4DAA4D;QACpD,SAAI,GAAG,IAAI,IAAI,CAIpB,aAAa,CAAC,CAAC;QAMlB,0DAA0D;QAC1D,iBAAiB;QACT,WAAM,GAAG,IAAI,OAAO,EAAkB,CAAC;QA+F/C,uEAAuE;QACvE,kDAAkD;QAC1C,eAAU,GAAG,IAAI,GAAG,EAA0B,CAAC;QAEvD,0DAA0D;QAC1C,UAAK,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACzC,CAAC;IA3GQ,6BAAO,GAAd,UAAe,KAAU;QACvB,OAAO,eAAe,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzD,CAAC;IAMM,0BAAI,GAAX,UAAY,KAAU;QACpB,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAIM,2BAAK,GAAZ,UAAa,KAAU;QAAvB,iBAgEC;QA/DC,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxC,IAAI,QAAQ;gBAAE,OAAO,QAAQ,CAAC;YAE9B,IAAM,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;YAC3C,QAAQ,KAAK,EAAE,CAAC;gBACd,KAAK,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;oBACrB,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;wBAAE,OAAO,KAAK,CAAC;oBACxC,IAAM,KAAK,GAAW,KAAe,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC5D,2DAA2D;oBAC3D,gEAAgE;oBAChE,2BAA2B;oBAC3B,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;oBAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;wBAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;wBACrC,sDAAsD;wBACtD,wDAAwD;wBACxD,wDAAwD;wBACxD,IAAI,OAAO,EAAE,CAAC;4BACZ,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;wBACvB,CAAC;oBACH,CAAC;oBACD,OAAO,IAAI,CAAC,KAAK,CAAC;gBACpB,CAAC;gBAED,KAAK,IAAI,CAAC;gBACV,KAAK,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;oBACtB,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;wBAAE,OAAO,KAAK,CAAC;oBACxC,IAAM,OAAK,GAAG,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;oBAC3C,IAAM,OAAK,GAAG,CAAC,OAAK,CAAC,CAAC;oBACtB,IAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBACpC,OAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACtB,IAAM,iBAAe,GAAG,OAAK,CAAC,MAAM,CAAC;oBACrC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAC,GAAG;wBACtB,OAAK,CAAC,IAAI,CAAC,KAAI,CAAC,KAAK,CAAE,KAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC9C,CAAC,CAAC,CAAC;oBACH,8DAA8D;oBAC9D,0DAA0D;oBAC1D,yDAAyD;oBACzD,gEAAgE;oBAChE,+DAA+D;oBAC/D,gEAAgE;oBAChE,6DAA6D;oBAC7D,mCAAmC;oBACnC,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,OAAK,CAAC,CAAC;oBAC1C,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;wBACjB,IAAM,KAAG,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,OAAK,CAAC,CAAC,CAAC;wBACjD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAG,CAAC,CAAC;wBACpB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAC,GAAG,EAAE,CAAC;4BACzB,KAAG,CAAC,GAAG,CAAC,GAAG,OAAK,CAAC,iBAAe,GAAG,CAAC,CAAC,CAAC;wBACxC,CAAC,CAAC,CAAC;wBACH,uDAAuD;wBACvD,wDAAwD;wBACxD,wDAAwD;wBACxD,IAAI,OAAO,EAAE,CAAC;4BACZ,MAAM,CAAC,MAAM,CAAC,KAAG,CAAC,CAAC;wBACrB,CAAC;oBACH,CAAC;oBACD,OAAO,IAAI,CAAC,MAAM,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,uEAAuE;IACvE,kEAAkE;IAClE,qEAAqE;IACrE,qEAAqE;IAC7D,gCAAU,GAAlB,UAAmB,GAAW;QAC5B,IAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,IAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAC7C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,MAAA,EAAE,CAAC,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAOH,kBAAC;AAAD,CAAC,AAvHD,IAuHC","sourcesContent":["import { Trie } from \"@wry/trie\";\nimport {\n  canUseWeakMap,\n  canUseWeakSet,\n  isNonNullObject as isObjectOrArray,\n} from \"../../utilities/index.js\";\nimport { isArray } from \"./helpers.js\";\n\nfunction shallowCopy<T>(value: T): T {\n  if (isObjectOrArray(value)) {\n    return isArray(value) ?\n        (value.slice(0) as any as T)\n      : { __proto__: Object.getPrototypeOf(value), ...value };\n  }\n  return value;\n}\n\n// When programmers talk about the \"canonical form\" of an object, they\n// usually have the following meaning in mind, which I've copied from\n// https://en.wiktionary.org/wiki/canonical_form:\n//\n// 1. A standard or normal presentation of a mathematical entity [or\n//    object]. A canonical form is an element of a set of representatives\n//    of equivalence classes of forms such that there is a function or\n//    procedure which projects every element of each equivalence class\n//    onto that one element, the canonical form of that equivalence\n//    class. The canonical form is expected to be simpler than the rest of\n//    the forms in some way.\n//\n// That's a long-winded way of saying any two objects that have the same\n// canonical form may be considered equivalent, even if they are !==,\n// which usually means the objects are structurally equivalent (deeply\n// equal), but don't necessarily use the same memory.\n//\n// Like a literary or musical canon, this ObjectCanon class represents a\n// collection of unique canonical items (JavaScript objects), with the\n// important property that canon.admit(a) === canon.admit(b) if a and b\n// are deeply equal to each other. In terms of the definition above, the\n// canon.admit method is the \"function or procedure which projects every\"\n// object \"onto that one element, the canonical form.\"\n//\n// In the worst case, the canonicalization process may involve looking at\n// every property in the provided object tree, so it takes the same order\n// of time as deep equality checking. Fortunately, already-canonicalized\n// objects are returned immediately from canon.admit, so the presence of\n// canonical subtrees tends to speed up canonicalization.\n//\n// Since consumers of canonical objects can check for deep equality in\n// constant time, canonicalizing cache results can massively improve the\n// performance of application code that skips re-rendering unchanged\n// results, such as \"pure\" UI components in a framework like React.\n//\n// Of course, since canonical objects may be shared widely between\n// unrelated consumers, it's important to think of them as immutable, even\n// though they are not actually frozen with Object.freeze in production,\n// due to the extra performance overhead that comes with frozen objects.\n//\n// Custom scalar objects whose internal class name is neither Array nor\n// Object can be included safely in the admitted tree, but they will not\n// be replaced with a canonical version (to put it another way, they are\n// assumed to be canonical already).\n//\n// If we ignore custom objects, no detection of cycles or repeated object\n// references is currently required by the StoreReader class, since\n// GraphQL result objects are JSON-serializable trees (and thus contain\n// neither cycles nor repeated subtrees), so we can avoid the complexity\n// of keeping track of objects we've already seen during the recursion of\n// the admit method.\n//\n// In the future, we may consider adding additional cases to the switch\n// statement to handle other common object types, such as \"[object Date]\"\n// objects, as needed.\nexport class ObjectCanon {\n  // Set of all canonical objects this ObjectCanon has admitted, allowing\n  // canon.admit to return previously-canonicalized objects immediately.\n  private known = new (canUseWeakSet ? WeakSet : Set)<object>();\n\n  // Efficient storage/lookup structure for canonical objects.\n  private pool = new Trie<{\n    array?: any[];\n    object?: Record<string, any>;\n    keys?: SortedKeysInfo;\n  }>(canUseWeakMap);\n\n  public isKnown(value: any): boolean {\n    return isObjectOrArray(value) && this.known.has(value);\n  }\n\n  // Make the ObjectCanon assume this value has already been\n  // canonicalized.\n  private passes = new WeakMap<object, object>();\n  public pass<T>(value: T): T;\n  public pass(value: any) {\n    if (isObjectOrArray(value)) {\n      const copy = shallowCopy(value);\n      this.passes.set(copy, value);\n      return copy;\n    }\n    return value;\n  }\n\n  // Returns the canonical version of value.\n  public admit<T>(value: T): T;\n  public admit(value: any) {\n    if (isObjectOrArray(value)) {\n      const original = this.passes.get(value);\n      if (original) return original;\n\n      const proto = Object.getPrototypeOf(value);\n      switch (proto) {\n        case Array.prototype: {\n          if (this.known.has(value)) return value;\n          const array: any[] = (value as any[]).map(this.admit, this);\n          // Arrays are looked up in the Trie using their recursively\n          // canonicalized elements, and the known version of the array is\n          // preserved as node.array.\n          const node = this.pool.lookupArray(array);\n          if (!node.array) {\n            this.known.add((node.array = array));\n            // Since canonical arrays may be shared widely between\n            // unrelated consumers, it's important to regard them as\n            // immutable, even if they are not frozen in production.\n            if (__DEV__) {\n              Object.freeze(array);\n            }\n          }\n          return node.array;\n        }\n\n        case null:\n        case Object.prototype: {\n          if (this.known.has(value)) return value;\n          const proto = Object.getPrototypeOf(value);\n          const array = [proto];\n          const keys = this.sortedKeys(value);\n          array.push(keys.json);\n          const firstValueIndex = array.length;\n          keys.sorted.forEach((key) => {\n            array.push(this.admit((value as any)[key]));\n          });\n          // Objects are looked up in the Trie by their prototype (which\n          // is *not* recursively canonicalized), followed by a JSON\n          // representation of their (sorted) keys, followed by the\n          // sequence of recursively canonicalized values corresponding to\n          // those keys. To keep the final results unambiguous with other\n          // sequences (such as arrays that just happen to contain [proto,\n          // keys.json, value1, value2, ...]), the known version of the\n          // object is stored as node.object.\n          const node = this.pool.lookupArray(array);\n          if (!node.object) {\n            const obj = (node.object = Object.create(proto));\n            this.known.add(obj);\n            keys.sorted.forEach((key, i) => {\n              obj[key] = array[firstValueIndex + i];\n            });\n            // Since canonical objects may be shared widely between\n            // unrelated consumers, it's important to regard them as\n            // immutable, even if they are not frozen in production.\n            if (__DEV__) {\n              Object.freeze(obj);\n            }\n          }\n          return node.object;\n        }\n      }\n    }\n    return value;\n  }\n\n  // It's worthwhile to cache the sorting of arrays of strings, since the\n  // same initial unsorted arrays tend to be encountered many times.\n  // Fortunately, we can reuse the Trie machinery to look up the sorted\n  // arrays in linear time (which is faster than sorting large arrays).\n  private sortedKeys(obj: object) {\n    const keys = Object.keys(obj);\n    const node = this.pool.lookupArray(keys);\n    if (!node.keys) {\n      keys.sort();\n      const json = JSON.stringify(keys);\n      if (!(node.keys = this.keysByJSON.get(json))) {\n        this.keysByJSON.set(json, (node.keys = { sorted: keys, json }));\n      }\n    }\n    return node.keys;\n  }\n  // Arrays that contain the same elements in a different order can share\n  // the same SortedKeysInfo object, to save memory.\n  private keysByJSON = new Map<string, SortedKeysInfo>();\n\n  // This has to come last because it depends on keysByJSON.\n  public readonly empty = this.admit({});\n}\n\ntype SortedKeysInfo = {\n  sorted: string[];\n  json: string;\n};\n"]}

package/cache/package.json

@@ -1,8 +0,0 @@
-{
-  "name": "@apollo/client/cache",
-  "type": "module",
-  "main": "cache.cjs",
-  "module": "index.js",
-  "types": "index.d.ts",
-  "sideEffects": false
-}

package/config/jest/areApolloErrorsEqual.d.ts

@@ -1,3 +0,0 @@
-import type { Tester } from "@jest/expect-utils";
-export declare const areApolloErrorsEqual: Tester;
-//# sourceMappingURL=areApolloErrorsEqual.d.ts.map

package/config/jest/areApolloErrorsEqual.js

@@ -1,23 +0,0 @@
-function isApolloError(e) {
-    return e instanceof Error && e.name == "ApolloError";
-}
-export var areApolloErrorsEqual = function (a, b, customTesters) {
-    var isAApolloError = isApolloError(a);
-    var isBApolloError = isApolloError(b);
-    if (isAApolloError && isBApolloError) {
-        return (a.message === b.message &&
-            this.equals(a.graphQLErrors, b.graphQLErrors, customTesters) &&
-            this.equals(a.protocolErrors, b.protocolErrors, customTesters) &&
-            this.equals(a.clientErrors, b.clientErrors, customTesters) &&
-            this.equals(a.networkError, b.networkError, customTesters) &&
-            this.equals(a.cause, b.cause, customTesters) &&
-            this.equals(a.extraInfo, b.extraInfo, customTesters));
-    }
-    else if (isAApolloError === isBApolloError) {
-        return undefined;
-    }
-    else {
-        return false;
-    }
-};
-//# sourceMappingURL=areApolloErrorsEqual.js.map

package/config/jest/areApolloErrorsEqual.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"areApolloErrorsEqual.js","sourceRoot":"","sources":["../../../src/config/jest/areApolloErrorsEqual.ts"],"names":[],"mappings":"AAEA,SAAS,aAAa,CAAC,CAAM;IAC3B,OAAO,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,IAAI,IAAI,aAAa,CAAC;AACvD,CAAC;AAED,MAAM,CAAC,IAAM,oBAAoB,GAAW,UAAU,CAAC,EAAE,CAAC,EAAE,aAAa;IACvE,IAAM,cAAc,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IACxC,IAAM,cAAc,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAExC,IAAI,cAAc,IAAI,cAAc,EAAE,CAAC;QACrC,OAAO,CACL,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO;YACvB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,aAAa,EAAE,aAAa,CAAC;YAC5D,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,cAAc,EAAE,aAAa,CAAC;YAC9D,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,YAAY,EAAE,aAAa,CAAC;YAC1D,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,YAAY,EAAE,aAAa,CAAC;YAC1D,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,aAAa,CAAC;YAC5C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,aAAa,CAAC,CACrD,CAAC;IACJ,CAAC;SAAM,IAAI,cAAc,KAAK,cAAc,EAAE,CAAC;QAC7C,OAAO,SAAS,CAAC;IACnB,CAAC;SAAM,CAAC;QACN,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC,CAAC","sourcesContent":["import type { ApolloError } from \"../../errors/index.js\";\nimport type { Tester } from \"@jest/expect-utils\";\nfunction isApolloError(e: any): e is ApolloError {\n  return e instanceof Error && e.name == \"ApolloError\";\n}\n\nexport const areApolloErrorsEqual: Tester = function (a, b, customTesters) {\n  const isAApolloError = isApolloError(a);\n  const isBApolloError = isApolloError(b);\n\n  if (isAApolloError && isBApolloError) {\n    return (\n      a.message === b.message &&\n      this.equals(a.graphQLErrors, b.graphQLErrors, customTesters) &&\n      this.equals(a.protocolErrors, b.protocolErrors, customTesters) &&\n      this.equals(a.clientErrors, b.clientErrors, customTesters) &&\n      this.equals(a.networkError, b.networkError, customTesters) &&\n      this.equals(a.cause, b.cause, customTesters) &&\n      this.equals(a.extraInfo, b.extraInfo, customTesters)\n    );\n  } else if (isAApolloError === isBApolloError) {\n    return undefined;\n  } else {\n    return false;\n  }\n};\n"]}

package/config/jest/areGraphQlErrorsEqual.d.ts

@@ -1,3 +0,0 @@
-import type { Tester } from "@jest/expect-utils";
-export declare const areGraphQLErrorsEqual: Tester;
-//# sourceMappingURL=areGraphQlErrorsEqual.d.ts.map

package/config/jest/areGraphQlErrorsEqual.js

@@ -1,7 +0,0 @@
-import { GraphQLError } from "graphql";
-export var areGraphQLErrorsEqual = function (a, b, customTesters) {
-    if (a instanceof GraphQLError || b instanceof GraphQLError) {
-        return this.equals(a instanceof GraphQLError ? a.toJSON() : a, b instanceof GraphQLError ? b.toJSON() : b, customTesters);
-    }
-};
-//# sourceMappingURL=areGraphQlErrorsEqual.js.map

package/config/jest/areGraphQlErrorsEqual.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"areGraphQlErrorsEqual.js","sourceRoot":"","sources":["../../../src/config/jest/areGraphQlErrorsEqual.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAGvC,MAAM,CAAC,IAAM,qBAAqB,GAAW,UAAU,CAAC,EAAE,CAAC,EAAE,aAAa;IACxE,IAAI,CAAC,YAAY,YAAY,IAAI,CAAC,YAAY,YAAY,EAAE,CAAC;QAC3D,OAAO,IAAI,CAAC,MAAM,CAChB,CAAC,YAAY,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAC1C,CAAC,YAAY,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAC1C,aAAa,CACd,CAAC;IACJ,CAAC;AACH,CAAC,CAAC","sourcesContent":["import { GraphQLError } from \"graphql\";\nimport type { Tester } from \"@jest/expect-utils\";\n\nexport const areGraphQLErrorsEqual: Tester = function (a, b, customTesters) {\n  if (a instanceof GraphQLError || b instanceof GraphQLError) {\n    return this.equals(\n      a instanceof GraphQLError ? a.toJSON() : a,\n      b instanceof GraphQLError ? b.toJSON() : b,\n      customTesters\n    );\n  }\n};\n"]}

package/config/jest/setup.d.ts

@@ -1,3 +0,0 @@
-import "@testing-library/jest-dom";
-import "../../testing/matchers/index.js";
-//# sourceMappingURL=setup.d.ts.map

package/config/jest/setup.js

@@ -1,36 +0,0 @@
-var _a, _b;
-import gql from "graphql-tag";
-import { TextEncoder, TextDecoder } from "util";
-(_a = global.TextEncoder) !== null && _a !== void 0 ? _a : (global.TextEncoder = TextEncoder);
-// @ts-ignore
-(_b = global.TextDecoder) !== null && _b !== void 0 ? _b : (global.TextDecoder = TextDecoder);
-import "@testing-library/jest-dom";
-import { loadErrorMessageHandler } from "../../dev/loadErrorMessageHandler.js";
-import "../../testing/matchers/index.js";
-import { areApolloErrorsEqual } from "./areApolloErrorsEqual.js";
-import { areGraphQLErrorsEqual } from "./areGraphQlErrorsEqual.js";
-// Turn off warnings for repeated fragment names
-gql.disableFragmentWarnings();
-process.on("unhandledRejection", function () { });
-loadErrorMessageHandler();
-function fail(reason) {
-    if (reason === void 0) { reason = "fail was called in a test."; }
-    expect(reason).toBe(undefined);
-}
-// @ts-ignore
-globalThis.fail = fail;
-if (!Symbol.dispose) {
-    Object.defineProperty(Symbol, "dispose", {
-        value: Symbol("dispose"),
-    });
-}
-if (!Symbol.asyncDispose) {
-    Object.defineProperty(Symbol, "asyncDispose", {
-        value: Symbol("asyncDispose"),
-    });
-}
-// @ts-ignore
-expect.addEqualityTesters([areApolloErrorsEqual, areGraphQLErrorsEqual]);
-// not available in JSDOM 🙄
-global.structuredClone = function (val) { return JSON.parse(JSON.stringify(val)); };
-//# sourceMappingURL=setup.js.map

package/config/jest/setup.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"setup.js","sourceRoot":"","sources":["../../../src/config/jest/setup.ts"],"names":[],"mappings":";AAAA,OAAO,GAAG,MAAM,aAAa,CAAC;AAC9B,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,MAAM,CAAC;AAChD,MAAA,MAAM,CAAC,WAAW,oCAAlB,MAAM,CAAC,WAAW,GAAK,WAAW,EAAC;AACnC,aAAa;AACb,MAAA,MAAM,CAAC,WAAW,oCAAlB,MAAM,CAAC,WAAW,GAAK,WAAW,EAAC;AACnC,OAAO,2BAA2B,CAAC;AACnC,OAAO,EAAE,uBAAuB,EAAE,MAAM,sCAAsC,CAAC;AAC/E,OAAO,iCAAiC,CAAC;AACzC,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AACjE,OAAO,EAAE,qBAAqB,EAAE,MAAM,4BAA4B,CAAC;AAEnE,gDAAgD;AAChD,GAAG,CAAC,uBAAuB,EAAE,CAAC;AAE9B,OAAO,CAAC,EAAE,CAAC,oBAAoB,EAAE,cAAO,CAAC,CAAC,CAAC;AAE3C,uBAAuB,EAAE,CAAC;AAE1B,SAAS,IAAI,CAAC,MAAqC;IAArC,uBAAA,EAAA,qCAAqC;IACjD,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AACjC,CAAC;AAED,aAAa;AACb,UAAU,CAAC,IAAI,GAAG,IAAI,CAAC;AAEvB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IACpB,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,SAAS,EAAE;QACvC,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC;KACzB,CAAC,CAAC;AACL,CAAC;AACD,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;IACzB,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,cAAc,EAAE;QAC5C,KAAK,EAAE,MAAM,CAAC,cAAc,CAAC;KAC9B,CAAC,CAAC;AACL,CAAC;AAED,aAAa;AACb,MAAM,CAAC,kBAAkB,CAAC,CAAC,oBAAoB,EAAE,qBAAqB,CAAC,CAAC,CAAC;AAEzE,4BAA4B;AAC5B,MAAM,CAAC,eAAe,GAAG,UAAC,GAAG,IAAK,OAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAA/B,CAA+B,CAAC","sourcesContent":["import gql from \"graphql-tag\";\nimport { TextEncoder, TextDecoder } from \"util\";\nglobal.TextEncoder ??= TextEncoder;\n// @ts-ignore\nglobal.TextDecoder ??= TextDecoder;\nimport \"@testing-library/jest-dom\";\nimport { loadErrorMessageHandler } from \"../../dev/loadErrorMessageHandler.js\";\nimport \"../../testing/matchers/index.js\";\nimport { areApolloErrorsEqual } from \"./areApolloErrorsEqual.js\";\nimport { areGraphQLErrorsEqual } from \"./areGraphQlErrorsEqual.js\";\n\n// Turn off warnings for repeated fragment names\ngql.disableFragmentWarnings();\n\nprocess.on(\"unhandledRejection\", () => {});\n\nloadErrorMessageHandler();\n\nfunction fail(reason = \"fail was called in a test.\") {\n  expect(reason).toBe(undefined);\n}\n\n// @ts-ignore\nglobalThis.fail = fail;\n\nif (!Symbol.dispose) {\n  Object.defineProperty(Symbol, \"dispose\", {\n    value: Symbol(\"dispose\"),\n  });\n}\nif (!Symbol.asyncDispose) {\n  Object.defineProperty(Symbol, \"asyncDispose\", {\n    value: Symbol(\"asyncDispose\"),\n  });\n}\n\n// @ts-ignore\nexpect.addEqualityTesters([areApolloErrorsEqual, areGraphQLErrorsEqual]);\n\n// not available in JSDOM 🙄\nglobal.structuredClone = (val) => JSON.parse(JSON.stringify(val));\n"]}

package/core/LocalState.d.ts

@@ -1,65 +0,0 @@
-import type { DocumentNode, SelectionNode, FieldNode, ASTNode } from "graphql";
-import type { ApolloCache } from "../cache/index.js";
-import type { FragmentMap, StoreObject } from "../utilities/index.js";
-import type { ApolloClient } from "./ApolloClient.js";
-import type { Resolvers, OperationVariables } from "./types.js";
-import type { FetchResult } from "../link/core/index.js";
-export type Resolver = (rootValue?: any, args?: any, context?: any, info?: {
-    field: FieldNode;
-    fragmentMap: FragmentMap;
-}) => any;
-export type VariableMap = {
-    [name: string]: any;
-};
-export type FragmentMatcher = (rootValue: any, typeCondition: string, context: any) => boolean;
-export type ExecContext = {
-    fragmentMap: FragmentMap;
-    context: any;
-    variables: VariableMap;
-    fragmentMatcher: FragmentMatcher;
-    defaultOperationType: string;
-    exportedVariables: Record<string, any>;
-    onlyRunForcedResolvers: boolean;
-    selectionsToResolve: Set<SelectionNode>;
-};
-export type LocalStateOptions<TCacheShape> = {
-    cache: ApolloCache<TCacheShape>;
-    client?: ApolloClient<TCacheShape>;
-    resolvers?: Resolvers | Resolvers[];
-    fragmentMatcher?: FragmentMatcher;
-};
-export declare class LocalState<TCacheShape> {
-    private cache;
-    private client?;
-    private resolvers?;
-    private fragmentMatcher?;
-    private selectionsToResolveCache;
-    constructor({ cache, client, resolvers, fragmentMatcher, }: LocalStateOptions<TCacheShape>);
-    addResolvers(resolvers: Resolvers | Resolvers[]): void;
-    setResolvers(resolvers: Resolvers | Resolvers[]): void;
-    getResolvers(): Resolvers;
-    runResolvers<TData>({ document, remoteResult, context, variables, onlyRunForcedResolvers, }: {
-        document: DocumentNode | null;
-        remoteResult: FetchResult<TData>;
-        context?: Record<string, any>;
-        variables?: Record<string, any>;
-        onlyRunForcedResolvers?: boolean;
-    }): Promise<FetchResult<TData>>;
-    setFragmentMatcher(fragmentMatcher: FragmentMatcher): void;
-    getFragmentMatcher(): FragmentMatcher | undefined;
-    clientQuery(document: DocumentNode): DocumentNode | null;
-    serverQuery(document: DocumentNode): DocumentNode | null;
-    prepareContext(context?: Record<string, any>): {
-        cache: ApolloCache<TCacheShape>;
-        getCacheKey(obj: StoreObject): string | undefined;
-    };
-    addExportedVariables<TVars extends OperationVariables>(document: DocumentNode, variables?: TVars, context?: {}): Promise<TVars>;
-    shouldForceResolvers(document: ASTNode): boolean;
-    private buildRootValueFromCache;
-    private resolveDocument;
-    private resolveSelectionSet;
-    private resolveField;
-    private resolveSubSelectedArray;
-    private collectSelectionsToResolve;
-}
-//# sourceMappingURL=LocalState.d.ts.map