react-easy-wall 1.0.21 → 1.0.24

package/dist/cjs/node_modules/@wry/caches/lib/weak.js

@@ -0,0 +1,147 @@
+'use strict';
+
+function noop() { }
+const defaultDispose = noop;
+const _WeakRef = typeof WeakRef !== "undefined"
+    ? WeakRef
+    : function (value) {
+        return { deref: () => value };
+    };
+const _WeakMap = typeof WeakMap !== "undefined" ? WeakMap : Map;
+const _FinalizationRegistry = typeof FinalizationRegistry !== "undefined"
+    ? FinalizationRegistry
+    : function () {
+        return {
+            register: noop,
+            unregister: noop,
+        };
+    };
+const finalizationBatchSize = 10024;
+class WeakCache {
+    constructor(max = Infinity, dispose = defaultDispose) {
+        this.max = max;
+        this.dispose = dispose;
+        this.map = new _WeakMap();
+        this.newest = null;
+        this.oldest = null;
+        this.unfinalizedNodes = new Set();
+        this.finalizationScheduled = false;
+        this.size = 0;
+        this.finalize = () => {
+            const iterator = this.unfinalizedNodes.values();
+            for (let i = 0; i < finalizationBatchSize; i++) {
+                const node = iterator.next().value;
+                if (!node)
+                    break;
+                this.unfinalizedNodes.delete(node);
+                const key = node.key;
+                delete node.key;
+                node.keyRef = new _WeakRef(key);
+                this.registry.register(key, node, node);
+            }
+            if (this.unfinalizedNodes.size > 0) {
+                queueMicrotask(this.finalize);
+            }
+            else {
+                this.finalizationScheduled = false;
+            }
+        };
+        this.registry = new _FinalizationRegistry(this.deleteNode.bind(this));
+    }
+    has(key) {
+        return this.map.has(key);
+    }
+    get(key) {
+        const node = this.getNode(key);
+        return node && node.value;
+    }
+    getNode(key) {
+        const node = this.map.get(key);
+        if (node && node !== this.newest) {
+            const { older, newer } = node;
+            if (newer) {
+                newer.older = older;
+            }
+            if (older) {
+                older.newer = newer;
+            }
+            node.older = this.newest;
+            node.older.newer = node;
+            node.newer = null;
+            this.newest = node;
+            if (node === this.oldest) {
+                this.oldest = newer;
+            }
+        }
+        return node;
+    }
+    set(key, value) {
+        let node = this.getNode(key);
+        if (node) {
+            return (node.value = value);
+        }
+        node = {
+            key,
+            value,
+            newer: null,
+            older: this.newest,
+        };
+        if (this.newest) {
+            this.newest.newer = node;
+        }
+        this.newest = node;
+        this.oldest = this.oldest || node;
+        this.scheduleFinalization(node);
+        this.map.set(key, node);
+        this.size++;
+        return node.value;
+    }
+    clean() {
+        while (this.oldest && this.size > this.max) {
+            this.deleteNode(this.oldest);
+        }
+    }
+    deleteNode(node) {
+        if (node === this.newest) {
+            this.newest = node.older;
+        }
+        if (node === this.oldest) {
+            this.oldest = node.newer;
+        }
+        if (node.newer) {
+            node.newer.older = node.older;
+        }
+        if (node.older) {
+            node.older.newer = node.newer;
+        }
+        this.size--;
+        const key = node.key || (node.keyRef && node.keyRef.deref());
+        this.dispose(node.value, key);
+        if (!node.keyRef) {
+            this.unfinalizedNodes.delete(node);
+        }
+        else {
+            this.registry.unregister(node);
+        }
+        if (key)
+            this.map.delete(key);
+    }
+    delete(key) {
+        const node = this.map.get(key);
+        if (node) {
+            this.deleteNode(node);
+            return true;
+        }
+        return false;
+    }
+    scheduleFinalization(node) {
+        this.unfinalizedNodes.add(node);
+        if (!this.finalizationScheduled) {
+            this.finalizationScheduled = true;
+            queueMicrotask(this.finalize);
+        }
+    }
+}
+
+exports.WeakCache = WeakCache;
+//# sourceMappingURL=weak.js.map

package/dist/cjs/node_modules/@wry/caches/lib/weak.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"weak.js","sources":["../../../../../../node_modules/@wry/caches/lib/weak.js"],"sourcesContent":["function noop() { }\nconst defaultDispose = noop;\nconst _WeakRef = typeof WeakRef !== \"undefined\"\n    ? WeakRef\n    : function (value) {\n        return { deref: () => value };\n    };\nconst _WeakMap = typeof WeakMap !== \"undefined\" ? WeakMap : Map;\nconst _FinalizationRegistry = typeof FinalizationRegistry !== \"undefined\"\n    ? FinalizationRegistry\n    : function () {\n        return {\n            register: noop,\n            unregister: noop,\n        };\n    };\nconst finalizationBatchSize = 10024;\nexport class WeakCache {\n    constructor(max = Infinity, dispose = defaultDispose) {\n        this.max = max;\n        this.dispose = dispose;\n        this.map = new _WeakMap();\n        this.newest = null;\n        this.oldest = null;\n        this.unfinalizedNodes = new Set();\n        this.finalizationScheduled = false;\n        this.size = 0;\n        this.finalize = () => {\n            const iterator = this.unfinalizedNodes.values();\n            for (let i = 0; i < finalizationBatchSize; i++) {\n                const node = iterator.next().value;\n                if (!node)\n                    break;\n                this.unfinalizedNodes.delete(node);\n                const key = node.key;\n                delete node.key;\n                node.keyRef = new _WeakRef(key);\n                this.registry.register(key, node, node);\n            }\n            if (this.unfinalizedNodes.size > 0) {\n                queueMicrotask(this.finalize);\n            }\n            else {\n                this.finalizationScheduled = false;\n            }\n        };\n        this.registry = new _FinalizationRegistry(this.deleteNode.bind(this));\n    }\n    has(key) {\n        return this.map.has(key);\n    }\n    get(key) {\n        const node = this.getNode(key);\n        return node && node.value;\n    }\n    getNode(key) {\n        const node = this.map.get(key);\n        if (node && node !== this.newest) {\n            const { older, newer } = node;\n            if (newer) {\n                newer.older = older;\n            }\n            if (older) {\n                older.newer = newer;\n            }\n            node.older = this.newest;\n            node.older.newer = node;\n            node.newer = null;\n            this.newest = node;\n            if (node === this.oldest) {\n                this.oldest = newer;\n            }\n        }\n        return node;\n    }\n    set(key, value) {\n        let node = this.getNode(key);\n        if (node) {\n            return (node.value = value);\n        }\n        node = {\n            key,\n            value,\n            newer: null,\n            older: this.newest,\n        };\n        if (this.newest) {\n            this.newest.newer = node;\n        }\n        this.newest = node;\n        this.oldest = this.oldest || node;\n        this.scheduleFinalization(node);\n        this.map.set(key, node);\n        this.size++;\n        return node.value;\n    }\n    clean() {\n        while (this.oldest && this.size > this.max) {\n            this.deleteNode(this.oldest);\n        }\n    }\n    deleteNode(node) {\n        if (node === this.newest) {\n            this.newest = node.older;\n        }\n        if (node === this.oldest) {\n            this.oldest = node.newer;\n        }\n        if (node.newer) {\n            node.newer.older = node.older;\n        }\n        if (node.older) {\n            node.older.newer = node.newer;\n        }\n        this.size--;\n        const key = node.key || (node.keyRef && node.keyRef.deref());\n        this.dispose(node.value, key);\n        if (!node.keyRef) {\n            this.unfinalizedNodes.delete(node);\n        }\n        else {\n            this.registry.unregister(node);\n        }\n        if (key)\n            this.map.delete(key);\n    }\n    delete(key) {\n        const node = this.map.get(key);\n        if (node) {\n            this.deleteNode(node);\n            return true;\n        }\n        return false;\n    }\n    scheduleFinalization(node) {\n        this.unfinalizedNodes.add(node);\n        if (!this.finalizationScheduled) {\n            this.finalizationScheduled = true;\n            queueMicrotask(this.finalize);\n        }\n    }\n}\n//# sourceMappingURL=weak.js.map"],"names":[],"mappings":";;AAAA,SAAS,IAAI,GAAG,EAAE;AAClB,MAAM,cAAc,GAAG,IAAI;AAC3B,MAAM,QAAQ,GAAG,OAAO,OAAO,KAAK;AACpC,MAAM;AACN,MAAM,UAAU,KAAK,EAAE;AACvB,QAAQ,OAAO,EAAE,KAAK,EAAE,MAAM,KAAK,EAAE;AACrC,IAAI,CAAC;AACL,MAAM,QAAQ,GAAG,OAAO,OAAO,KAAK,WAAW,GAAG,OAAO,GAAG,GAAG;AAC/D,MAAM,qBAAqB,GAAG,OAAO,oBAAoB,KAAK;AAC9D,MAAM;AACN,MAAM,YAAY;AAClB,QAAQ,OAAO;AACf,YAAY,QAAQ,EAAE,IAAI;AAC1B,YAAY,UAAU,EAAE,IAAI;AAC5B,SAAS;AACT,IAAI,CAAC;AACL,MAAM,qBAAqB,GAAG,KAAK;AAC5B,MAAM,SAAS,CAAC;AACvB,IAAI,WAAW,CAAC,GAAG,GAAG,QAAQ,EAAE,OAAO,GAAG,cAAc,EAAE;AAC1D,QAAQ,IAAI,CAAC,GAAG,GAAG,GAAG;AACtB,QAAQ,IAAI,CAAC,OAAO,GAAG,OAAO;AAC9B,QAAQ,IAAI,CAAC,GAAG,GAAG,IAAI,QAAQ,EAAE;AACjC,QAAQ,IAAI,CAAC,MAAM,GAAG,IAAI;AAC1B,QAAQ,IAAI,CAAC,MAAM,GAAG,IAAI;AAC1B,QAAQ,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAE;AACzC,QAAQ,IAAI,CAAC,qBAAqB,GAAG,KAAK;AAC1C,QAAQ,IAAI,CAAC,IAAI,GAAG,CAAC;AACrB,QAAQ,IAAI,CAAC,QAAQ,GAAG,MAAM;AAC9B,YAAY,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE;AAC3D,YAAY,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,qBAAqB,EAAE,CAAC,EAAE,EAAE;AAC5D,gBAAgB,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK;AAClD,gBAAgB,IAAI,CAAC,IAAI;AACzB,oBAAoB;AACpB,gBAAgB,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC;AAClD,gBAAgB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG;AACpC,gBAAgB,OAAO,IAAI,CAAC,GAAG;AAC/B,gBAAgB,IAAI,CAAC,MAAM,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC;AAC/C,gBAAgB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC;AACvD,YAAY;AACZ,YAAY,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,GAAG,CAAC,EAAE;AAChD,gBAAgB,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC;AAC7C,YAAY;AACZ,iBAAiB;AACjB,gBAAgB,IAAI,CAAC,qBAAqB,GAAG,KAAK;AAClD,YAAY;AACZ,QAAQ,CAAC;AACT,QAAQ,IAAI,CAAC,QAAQ,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7E,IAAI;AACJ,IAAI,GAAG,CAAC,GAAG,EAAE;AACb,QAAQ,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AAChC,IAAI;AACJ,IAAI,GAAG,CAAC,GAAG,EAAE;AACb,QAAQ,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC;AACtC,QAAQ,OAAO,IAAI,IAAI,IAAI,CAAC,KAAK;AACjC,IAAI;AACJ,IAAI,OAAO,CAAC,GAAG,EAAE;AACjB,QAAQ,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AACtC,QAAQ,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;AAC1C,YAAY,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI;AACzC,YAAY,IAAI,KAAK,EAAE;AACvB,gBAAgB,KAAK,CAAC,KAAK,GAAG,KAAK;AACnC,YAAY;AACZ,YAAY,IAAI,KAAK,EAAE;AACvB,gBAAgB,KAAK,CAAC,KAAK,GAAG,KAAK;AACnC,YAAY;AACZ,YAAY,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM;AACpC,YAAY,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI;AACnC,YAAY,IAAI,CAAC,KAAK,GAAG,IAAI;AAC7B,YAAY,IAAI,CAAC,MAAM,GAAG,IAAI;AAC9B,YAAY,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;AACtC,gBAAgB,IAAI,CAAC,MAAM,GAAG,KAAK;AACnC,YAAY;AACZ,QAAQ;AACR,QAAQ,OAAO,IAAI;AACnB,IAAI;AACJ,IAAI,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE;AACpB,QAAQ,IAAI,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC;AACpC,QAAQ,IAAI,IAAI,EAAE;AAClB,YAAY,QAAQ,IAAI,CAAC,KAAK,GAAG,KAAK;AACtC,QAAQ;AACR,QAAQ,IAAI,GAAG;AACf,YAAY,GAAG;AACf,YAAY,KAAK;AACjB,YAAY,KAAK,EAAE,IAAI;AACvB,YAAY,KAAK,EAAE,IAAI,CAAC,MAAM;AAC9B,SAAS;AACT,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE;AACzB,YAAY,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,IAAI;AACpC,QAAQ;AACR,QAAQ,IAAI,CAAC,MAAM,GAAG,IAAI;AAC1B,QAAQ,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI;AACzC,QAAQ,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC;AACvC,QAAQ,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC;AAC/B,QAAQ,IAAI,CAAC,IAAI,EAAE;AACnB,QAAQ,OAAO,IAAI,CAAC,KAAK;AACzB,IAAI;AACJ,IAAI,KAAK,GAAG;AACZ,QAAQ,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE;AACpD,YAAY,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC;AACxC,QAAQ;AACR,IAAI;AACJ,IAAI,UAAU,CAAC,IAAI,EAAE;AACrB,QAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;AAClC,YAAY,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK;AACpC,QAAQ;AACR,QAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;AAClC,YAAY,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK;AACpC,QAAQ;AACR,QAAQ,IAAI,IAAI,CAAC,KAAK,EAAE;AACxB,YAAY,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;AACzC,QAAQ;AACR,QAAQ,IAAI,IAAI,CAAC,KAAK,EAAE;AACxB,YAAY,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;AACzC,QAAQ;AACR,QAAQ,IAAI,CAAC,IAAI,EAAE;AACnB,QAAQ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;AACpE,QAAQ,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC;AACrC,QAAQ,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAC1B,YAAY,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC;AAC9C,QAAQ;AACR,aAAa;AACb,YAAY,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC;AAC1C,QAAQ;AACR,QAAQ,IAAI,GAAG;AACf,YAAY,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC;AAChC,IAAI;AACJ,IAAI,MAAM,CAAC,GAAG,EAAE;AAChB,QAAQ,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AACtC,QAAQ,IAAI,IAAI,EAAE;AAClB,YAAY,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;AACjC,YAAY,OAAO,IAAI;AACvB,QAAQ;AACR,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ,IAAI,oBAAoB,CAAC,IAAI,EAAE;AAC/B,QAAQ,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC;AACvC,QAAQ,IAAI,CAAC,IAAI,CAAC,qBAAqB,EAAE;AACzC,YAAY,IAAI,CAAC,qBAAqB,GAAG,IAAI;AAC7C,YAAY,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC;AACzC,QAAQ;AACR,IAAI;AACJ;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/@wry/trie/lib/index.js

@@ -0,0 +1,86 @@
+'use strict';
+
+// A [trie](https://en.wikipedia.org/wiki/Trie) data structure that holds
+// object keys weakly, yet can also hold non-object keys, unlike the
+// native `WeakMap`.
+// If no makeData function is supplied, the looked-up data will be an empty,
+// null-prototype Object.
+const defaultMakeData = () => Object.create(null);
+// Useful for processing arguments objects as well as arrays.
+const { forEach, slice } = Array.prototype;
+const { hasOwnProperty } = Object.prototype;
+class Trie {
+    constructor(weakness = true, makeData = defaultMakeData) {
+        this.weakness = weakness;
+        this.makeData = makeData;
+    }
+    lookup() {
+        return this.lookupArray(arguments);
+    }
+    lookupArray(array) {
+        let node = this;
+        forEach.call(array, key => node = node.getChildTrie(key));
+        return hasOwnProperty.call(node, "data")
+            ? node.data
+            : node.data = this.makeData(slice.call(array));
+    }
+    peek() {
+        return this.peekArray(arguments);
+    }
+    peekArray(array) {
+        let node = this;
+        for (let i = 0, len = array.length; node && i < len; ++i) {
+            const map = node.mapFor(array[i], false);
+            node = map && map.get(array[i]);
+        }
+        return node && node.data;
+    }
+    remove() {
+        return this.removeArray(arguments);
+    }
+    removeArray(array) {
+        let data;
+        if (array.length) {
+            const head = array[0];
+            const map = this.mapFor(head, false);
+            const child = map && map.get(head);
+            if (child) {
+                data = child.removeArray(slice.call(array, 1));
+                if (!child.data && !child.weak && !(child.strong && child.strong.size)) {
+                    map.delete(head);
+                }
+            }
+        }
+        else {
+            data = this.data;
+            delete this.data;
+        }
+        return data;
+    }
+    getChildTrie(key) {
+        const map = this.mapFor(key, true);
+        let child = map.get(key);
+        if (!child)
+            map.set(key, child = new Trie(this.weakness, this.makeData));
+        return child;
+    }
+    mapFor(key, create) {
+        return this.weakness && isObjRef(key)
+            ? this.weak || (create ? this.weak = new WeakMap : void 0)
+            : this.strong || (create ? this.strong = new Map : void 0);
+    }
+}
+function isObjRef(value) {
+    switch (typeof value) {
+        case "object":
+            if (value === null)
+                break;
+        // Fall through to return true...
+        case "function":
+            return true;
+    }
+    return false;
+}
+
+exports.Trie = Trie;
+//# sourceMappingURL=index.js.map

package/dist/cjs/node_modules/@wry/trie/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../node_modules/@wry/trie/lib/index.js"],"sourcesContent":["// A [trie](https://en.wikipedia.org/wiki/Trie) data structure that holds\n// object keys weakly, yet can also hold non-object keys, unlike the\n// native `WeakMap`.\n// If no makeData function is supplied, the looked-up data will be an empty,\n// null-prototype Object.\nconst defaultMakeData = () => Object.create(null);\n// Useful for processing arguments objects as well as arrays.\nconst { forEach, slice } = Array.prototype;\nconst { hasOwnProperty } = Object.prototype;\nexport class Trie {\n    constructor(weakness = true, makeData = defaultMakeData) {\n        this.weakness = weakness;\n        this.makeData = makeData;\n    }\n    lookup() {\n        return this.lookupArray(arguments);\n    }\n    lookupArray(array) {\n        let node = this;\n        forEach.call(array, key => node = node.getChildTrie(key));\n        return hasOwnProperty.call(node, \"data\")\n            ? node.data\n            : node.data = this.makeData(slice.call(array));\n    }\n    peek() {\n        return this.peekArray(arguments);\n    }\n    peekArray(array) {\n        let node = this;\n        for (let i = 0, len = array.length; node && i < len; ++i) {\n            const map = node.mapFor(array[i], false);\n            node = map && map.get(array[i]);\n        }\n        return node && node.data;\n    }\n    remove() {\n        return this.removeArray(arguments);\n    }\n    removeArray(array) {\n        let data;\n        if (array.length) {\n            const head = array[0];\n            const map = this.mapFor(head, false);\n            const child = map && map.get(head);\n            if (child) {\n                data = child.removeArray(slice.call(array, 1));\n                if (!child.data && !child.weak && !(child.strong && child.strong.size)) {\n                    map.delete(head);\n                }\n            }\n        }\n        else {\n            data = this.data;\n            delete this.data;\n        }\n        return data;\n    }\n    getChildTrie(key) {\n        const map = this.mapFor(key, true);\n        let child = map.get(key);\n        if (!child)\n            map.set(key, child = new Trie(this.weakness, this.makeData));\n        return child;\n    }\n    mapFor(key, create) {\n        return this.weakness && isObjRef(key)\n            ? this.weak || (create ? this.weak = new WeakMap : void 0)\n            : this.strong || (create ? this.strong = new Map : void 0);\n    }\n}\nfunction isObjRef(value) {\n    switch (typeof value) {\n        case \"object\":\n            if (value === null)\n                break;\n        // Fall through to return true...\n        case \"function\":\n            return true;\n    }\n    return false;\n}\n//# sourceMappingURL=index.js.map"],"names":[],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA,MAAM,eAAe,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;AACjD;AACA,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,SAAS;AAC1C,MAAM,EAAE,cAAc,EAAE,GAAG,MAAM,CAAC,SAAS;AACpC,MAAM,IAAI,CAAC;AAClB,IAAI,WAAW,CAAC,QAAQ,GAAG,IAAI,EAAE,QAAQ,GAAG,eAAe,EAAE;AAC7D,QAAQ,IAAI,CAAC,QAAQ,GAAG,QAAQ;AAChC,QAAQ,IAAI,CAAC,QAAQ,GAAG,QAAQ;AAChC,IAAI;AACJ,IAAI,MAAM,GAAG;AACb,QAAQ,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC;AAC1C,IAAI;AACJ,IAAI,WAAW,CAAC,KAAK,EAAE;AACvB,QAAQ,IAAI,IAAI,GAAG,IAAI;AACvB,QAAQ,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;AACjE,QAAQ,OAAO,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM;AAC/C,cAAc,IAAI,CAAC;AACnB,cAAc,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC1D,IAAI;AACJ,IAAI,IAAI,GAAG;AACX,QAAQ,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC;AACxC,IAAI;AACJ,IAAI,SAAS,CAAC,KAAK,EAAE;AACrB,QAAQ,IAAI,IAAI,GAAG,IAAI;AACvB,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE;AAClE,YAAY,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;AACpD,YAAY,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAC3C,QAAQ;AACR,QAAQ,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI;AAChC,IAAI;AACJ,IAAI,MAAM,GAAG;AACb,QAAQ,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC;AAC1C,IAAI;AACJ,IAAI,WAAW,CAAC,KAAK,EAAE;AACvB,QAAQ,IAAI,IAAI;AAChB,QAAQ,IAAI,KAAK,CAAC,MAAM,EAAE;AAC1B,YAAY,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;AACjC,YAAY,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC;AAChD,YAAY,MAAM,KAAK,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;AAC9C,YAAY,IAAI,KAAK,EAAE;AACvB,gBAAgB,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAC9D,gBAAgB,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;AACxF,oBAAoB,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;AACpC,gBAAgB;AAChB,YAAY;AACZ,QAAQ;AACR,aAAa;AACb,YAAY,IAAI,GAAG,IAAI,CAAC,IAAI;AAC5B,YAAY,OAAO,IAAI,CAAC,IAAI;AAC5B,QAAQ;AACR,QAAQ,OAAO,IAAI;AACnB,IAAI;AACJ,IAAI,YAAY,CAAC,GAAG,EAAE;AACtB,QAAQ,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC;AAC1C,QAAQ,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AAChC,QAAQ,IAAI,CAAC,KAAK;AAClB,YAAY,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;AACxE,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ,IAAI,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE;AACxB,QAAQ,OAAO,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,GAAG;AAC5C,cAAc,IAAI,CAAC,IAAI,KAAK,MAAM,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,OAAO,GAAG,MAAM;AACrE,cAAc,IAAI,CAAC,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC;AACtE,IAAI;AACJ;AACA,SAAS,QAAQ,CAAC,KAAK,EAAE;AACzB,IAAI,QAAQ,OAAO,KAAK;AACxB,QAAQ,KAAK,QAAQ;AACrB,YAAY,IAAI,KAAK,KAAK,IAAI;AAC9B,gBAAgB;AAChB;AACA,QAAQ,KAAK,UAAU;AACvB,YAAY,OAAO,IAAI;AACvB;AACA,IAAI,OAAO,KAAK;AAChB;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/graphql/error/GraphQLError.js

@@ -0,0 +1,232 @@
+'use strict';
+
+var isObjectLike = require('../jsutils/isObjectLike.js');
+var location = require('../language/location.js');
+var printLocation = require('../language/printLocation.js');
+
+function toNormalizedOptions(args) {
+  const firstArg = args[0];
+
+  if (firstArg == null || 'kind' in firstArg || 'length' in firstArg) {
+    return {
+      nodes: firstArg,
+      source: args[1],
+      positions: args[2],
+      path: args[3],
+      originalError: args[4],
+      extensions: args[5],
+    };
+  }
+
+  return firstArg;
+}
+/**
+ * A GraphQLError describes an Error found during the parse, validate, or
+ * execute phases of performing a GraphQL operation. In addition to a message
+ * and stack trace, it also includes information about the locations in a
+ * GraphQL document and/or execution result that correspond to the Error.
+ */
+
+class GraphQLError extends Error {
+  /**
+   * An array of `{ line, column }` locations within the source GraphQL document
+   * which correspond to this error.
+   *
+   * Errors during validation often contain multiple locations, for example to
+   * point out two things with the same name. Errors during execution include a
+   * single location, the field which produced the error.
+   *
+   * Enumerable, and appears in the result of JSON.stringify().
+   */
+
+  /**
+   * An array describing the JSON-path into the execution response which
+   * corresponds to this error. Only included for errors during execution.
+   *
+   * Enumerable, and appears in the result of JSON.stringify().
+   */
+
+  /**
+   * An array of GraphQL AST Nodes corresponding to this error.
+   */
+
+  /**
+   * The source GraphQL document for the first location of this error.
+   *
+   * Note that if this Error represents more than one node, the source may not
+   * represent nodes after the first node.
+   */
+
+  /**
+   * An array of character offsets within the source GraphQL document
+   * which correspond to this error.
+   */
+
+  /**
+   * The original error thrown from a field resolver during execution.
+   */
+
+  /**
+   * Extension fields to add to the formatted error.
+   */
+
+  /**
+   * @deprecated Please use the `GraphQLErrorOptions` constructor overload instead.
+   */
+  constructor(message, ...rawArgs) {
+    var _this$nodes, _nodeLocations$, _ref;
+
+    const { nodes, source, positions, path, originalError, extensions } =
+      toNormalizedOptions(rawArgs);
+    super(message);
+    this.name = 'GraphQLError';
+    this.path = path !== null && path !== void 0 ? path : undefined;
+    this.originalError =
+      originalError !== null && originalError !== void 0
+        ? originalError
+        : undefined; // Compute list of blame nodes.
+
+    this.nodes = undefinedIfEmpty(
+      Array.isArray(nodes) ? nodes : nodes ? [nodes] : undefined,
+    );
+    const nodeLocations = undefinedIfEmpty(
+      (_this$nodes = this.nodes) === null || _this$nodes === void 0
+        ? void 0
+        : _this$nodes.map((node) => node.loc).filter((loc) => loc != null),
+    ); // Compute locations in the source for the given nodes/positions.
+
+    this.source =
+      source !== null && source !== void 0
+        ? source
+        : nodeLocations === null || nodeLocations === void 0
+        ? void 0
+        : (_nodeLocations$ = nodeLocations[0]) === null ||
+          _nodeLocations$ === void 0
+        ? void 0
+        : _nodeLocations$.source;
+    this.positions =
+      positions !== null && positions !== void 0
+        ? positions
+        : nodeLocations === null || nodeLocations === void 0
+        ? void 0
+        : nodeLocations.map((loc) => loc.start);
+    this.locations =
+      positions && source
+        ? positions.map((pos) => location.getLocation(source, pos))
+        : nodeLocations === null || nodeLocations === void 0
+        ? void 0
+        : nodeLocations.map((loc) => location.getLocation(loc.source, loc.start));
+    const originalExtensions = isObjectLike.isObjectLike(
+      originalError === null || originalError === void 0
+        ? void 0
+        : originalError.extensions,
+    )
+      ? originalError === null || originalError === void 0
+        ? void 0
+        : originalError.extensions
+      : undefined;
+    this.extensions =
+      (_ref =
+        extensions !== null && extensions !== void 0
+          ? extensions
+          : originalExtensions) !== null && _ref !== void 0
+        ? _ref
+        : Object.create(null); // Only properties prescribed by the spec should be enumerable.
+    // Keep the rest as non-enumerable.
+
+    Object.defineProperties(this, {
+      message: {
+        writable: true,
+        enumerable: true,
+      },
+      name: {
+        enumerable: false,
+      },
+      nodes: {
+        enumerable: false,
+      },
+      source: {
+        enumerable: false,
+      },
+      positions: {
+        enumerable: false,
+      },
+      originalError: {
+        enumerable: false,
+      },
+    }); // Include (non-enumerable) stack trace.
+
+    /* c8 ignore start */
+    // FIXME: https://github.com/graphql/graphql-js/issues/2317
+
+    if (
+      originalError !== null &&
+      originalError !== void 0 &&
+      originalError.stack
+    ) {
+      Object.defineProperty(this, 'stack', {
+        value: originalError.stack,
+        writable: true,
+        configurable: true,
+      });
+    } else if (Error.captureStackTrace) {
+      Error.captureStackTrace(this, GraphQLError);
+    } else {
+      Object.defineProperty(this, 'stack', {
+        value: Error().stack,
+        writable: true,
+        configurable: true,
+      });
+    }
+    /* c8 ignore stop */
+  }
+
+  get [Symbol.toStringTag]() {
+    return 'GraphQLError';
+  }
+
+  toString() {
+    let output = this.message;
+
+    if (this.nodes) {
+      for (const node of this.nodes) {
+        if (node.loc) {
+          output += '\n\n' + printLocation.printLocation(node.loc);
+        }
+      }
+    } else if (this.source && this.locations) {
+      for (const location of this.locations) {
+        output += '\n\n' + printLocation.printSourceLocation(this.source, location);
+      }
+    }
+
+    return output;
+  }
+
+  toJSON() {
+    const formattedError = {
+      message: this.message,
+    };
+
+    if (this.locations != null) {
+      formattedError.locations = this.locations;
+    }
+
+    if (this.path != null) {
+      formattedError.path = this.path;
+    }
+
+    if (this.extensions != null && Object.keys(this.extensions).length > 0) {
+      formattedError.extensions = this.extensions;
+    }
+
+    return formattedError;
+  }
+}
+
+function undefinedIfEmpty(array) {
+  return array === undefined || array.length === 0 ? undefined : array;
+}
+
+exports.GraphQLError = GraphQLError;
+//# sourceMappingURL=GraphQLError.js.map

package/dist/cjs/node_modules/graphql/error/GraphQLError.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphQLError.js","sources":["../../../../../node_modules/graphql/error/GraphQLError.mjs"],"sourcesContent":["import { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { getLocation } from '../language/location.mjs';\nimport {\n  printLocation,\n  printSourceLocation,\n} from '../language/printLocation.mjs';\n\nfunction toNormalizedOptions(args) {\n  const firstArg = args[0];\n\n  if (firstArg == null || 'kind' in firstArg || 'length' in firstArg) {\n    return {\n      nodes: firstArg,\n      source: args[1],\n      positions: args[2],\n      path: args[3],\n      originalError: args[4],\n      extensions: args[5],\n    };\n  }\n\n  return firstArg;\n}\n/**\n * A GraphQLError describes an Error found during the parse, validate, or\n * execute phases of performing a GraphQL operation. In addition to a message\n * and stack trace, it also includes information about the locations in a\n * GraphQL document and/or execution result that correspond to the Error.\n */\n\nexport class GraphQLError extends Error {\n  /**\n   * An array of `{ line, column }` locations within the source GraphQL document\n   * which correspond to this error.\n   *\n   * Errors during validation often contain multiple locations, for example to\n   * point out two things with the same name. Errors during execution include a\n   * single location, the field which produced the error.\n   *\n   * Enumerable, and appears in the result of JSON.stringify().\n   */\n\n  /**\n   * An array describing the JSON-path into the execution response which\n   * corresponds to this error. Only included for errors during execution.\n   *\n   * Enumerable, and appears in the result of JSON.stringify().\n   */\n\n  /**\n   * An array of GraphQL AST Nodes corresponding to this error.\n   */\n\n  /**\n   * The source GraphQL document for the first location of this error.\n   *\n   * Note that if this Error represents more than one node, the source may not\n   * represent nodes after the first node.\n   */\n\n  /**\n   * An array of character offsets within the source GraphQL document\n   * which correspond to this error.\n   */\n\n  /**\n   * The original error thrown from a field resolver during execution.\n   */\n\n  /**\n   * Extension fields to add to the formatted error.\n   */\n\n  /**\n   * @deprecated Please use the `GraphQLErrorOptions` constructor overload instead.\n   */\n  constructor(message, ...rawArgs) {\n    var _this$nodes, _nodeLocations$, _ref;\n\n    const { nodes, source, positions, path, originalError, extensions } =\n      toNormalizedOptions(rawArgs);\n    super(message);\n    this.name = 'GraphQLError';\n    this.path = path !== null && path !== void 0 ? path : undefined;\n    this.originalError =\n      originalError !== null && originalError !== void 0\n        ? originalError\n        : undefined; // Compute list of blame nodes.\n\n    this.nodes = undefinedIfEmpty(\n      Array.isArray(nodes) ? nodes : nodes ? [nodes] : undefined,\n    );\n    const nodeLocations = undefinedIfEmpty(\n      (_this$nodes = this.nodes) === null || _this$nodes === void 0\n        ? void 0\n        : _this$nodes.map((node) => node.loc).filter((loc) => loc != null),\n    ); // Compute locations in the source for the given nodes/positions.\n\n    this.source =\n      source !== null && source !== void 0\n        ? source\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : (_nodeLocations$ = nodeLocations[0]) === null ||\n          _nodeLocations$ === void 0\n        ? void 0\n        : _nodeLocations$.source;\n    this.positions =\n      positions !== null && positions !== void 0\n        ? positions\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : nodeLocations.map((loc) => loc.start);\n    this.locations =\n      positions && source\n        ? positions.map((pos) => getLocation(source, pos))\n        : nodeLocations === null || nodeLocations === void 0\n        ? void 0\n        : nodeLocations.map((loc) => getLocation(loc.source, loc.start));\n    const originalExtensions = isObjectLike(\n      originalError === null || originalError === void 0\n        ? void 0\n        : originalError.extensions,\n    )\n      ? originalError === null || originalError === void 0\n        ? void 0\n        : originalError.extensions\n      : undefined;\n    this.extensions =\n      (_ref =\n        extensions !== null && extensions !== void 0\n          ? extensions\n          : originalExtensions) !== null && _ref !== void 0\n        ? _ref\n        : Object.create(null); // Only properties prescribed by the spec should be enumerable.\n    // Keep the rest as non-enumerable.\n\n    Object.defineProperties(this, {\n      message: {\n        writable: true,\n        enumerable: true,\n      },\n      name: {\n        enumerable: false,\n      },\n      nodes: {\n        enumerable: false,\n      },\n      source: {\n        enumerable: false,\n      },\n      positions: {\n        enumerable: false,\n      },\n      originalError: {\n        enumerable: false,\n      },\n    }); // Include (non-enumerable) stack trace.\n\n    /* c8 ignore start */\n    // FIXME: https://github.com/graphql/graphql-js/issues/2317\n\n    if (\n      originalError !== null &&\n      originalError !== void 0 &&\n      originalError.stack\n    ) {\n      Object.defineProperty(this, 'stack', {\n        value: originalError.stack,\n        writable: true,\n        configurable: true,\n      });\n    } else if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, GraphQLError);\n    } else {\n      Object.defineProperty(this, 'stack', {\n        value: Error().stack,\n        writable: true,\n        configurable: true,\n      });\n    }\n    /* c8 ignore stop */\n  }\n\n  get [Symbol.toStringTag]() {\n    return 'GraphQLError';\n  }\n\n  toString() {\n    let output = this.message;\n\n    if (this.nodes) {\n      for (const node of this.nodes) {\n        if (node.loc) {\n          output += '\\n\\n' + printLocation(node.loc);\n        }\n      }\n    } else if (this.source && this.locations) {\n      for (const location of this.locations) {\n        output += '\\n\\n' + printSourceLocation(this.source, location);\n      }\n    }\n\n    return output;\n  }\n\n  toJSON() {\n    const formattedError = {\n      message: this.message,\n    };\n\n    if (this.locations != null) {\n      formattedError.locations = this.locations;\n    }\n\n    if (this.path != null) {\n      formattedError.path = this.path;\n    }\n\n    if (this.extensions != null && Object.keys(this.extensions).length > 0) {\n      formattedError.extensions = this.extensions;\n    }\n\n    return formattedError;\n  }\n}\n\nfunction undefinedIfEmpty(array) {\n  return array === undefined || array.length === 0 ? undefined : array;\n}\n/**\n * See: https://spec.graphql.org/draft/#sec-Errors\n */\n\n/**\n * Prints a GraphQLError to a string, representing useful location information\n * about the error's position in the source.\n *\n * @deprecated Please use `error.toString` instead. Will be removed in v17\n */\nexport function printError(error) {\n  return error.toString();\n}\n/**\n * Given a GraphQLError, format it according to the rules described by the\n * Response Format, Errors section of the GraphQL Specification.\n *\n * @deprecated Please use `error.toJSON` instead. Will be removed in v17\n */\n\nexport function formatError(error) {\n  return error.toJSON();\n}\n"],"names":["getLocation","isObjectLike","printLocation","printSourceLocation"],"mappings":";;;;;;AAOA,SAAS,mBAAmB,CAAC,IAAI,EAAE;AACnC,EAAE,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC;;AAE1B,EAAE,IAAI,QAAQ,IAAI,IAAI,IAAI,MAAM,IAAI,QAAQ,IAAI,QAAQ,IAAI,QAAQ,EAAE;AACtE,IAAI,OAAO;AACX,MAAM,KAAK,EAAE,QAAQ;AACrB,MAAM,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;AACrB,MAAM,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;AACxB,MAAM,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AACnB,MAAM,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC;AAC5B,MAAM,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC;AACzB,KAAK;AACL,EAAE;;AAEF,EAAE,OAAO,QAAQ;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEO,MAAM,YAAY,SAAS,KAAK,CAAC;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,EAAE,WAAW,CAAC,OAAO,EAAE,GAAG,OAAO,EAAE;AACnC,IAAI,IAAI,WAAW,EAAE,eAAe,EAAE,IAAI;;AAE1C,IAAI,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,aAAa,EAAE,UAAU,EAAE;AACvE,MAAM,mBAAmB,CAAC,OAAO,CAAC;AAClC,IAAI,KAAK,CAAC,OAAO,CAAC;AAClB,IAAI,IAAI,CAAC,IAAI,GAAG,cAAc;AAC9B,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,MAAM,GAAG,IAAI,GAAG,SAAS;AACnE,IAAI,IAAI,CAAC,aAAa;AACtB,MAAM,aAAa,KAAK,IAAI,IAAI,aAAa,KAAK;AAClD,UAAU;AACV,UAAU,SAAS,CAAC;;AAEpB,IAAI,IAAI,CAAC,KAAK,GAAG,gBAAgB;AACjC,MAAM,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,GAAG,SAAS;AAChE,KAAK;AACL,IAAI,MAAM,aAAa,GAAG,gBAAgB;AAC1C,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,MAAM,IAAI,IAAI,WAAW,KAAK;AAC7D,UAAU;AACV,UAAU,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,KAAK,GAAG,IAAI,IAAI,CAAC;AAC1E,KAAK,CAAC;;AAEN,IAAI,IAAI,CAAC,MAAM;AACf,MAAM,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK;AACpC,UAAU;AACV,UAAU,aAAa,KAAK,IAAI,IAAI,aAAa,KAAK;AACtD,UAAU;AACV,UAAU,CAAC,eAAe,GAAG,aAAa,CAAC,CAAC,CAAC,MAAM,IAAI;AACvD,UAAU,eAAe,KAAK;AAC9B,UAAU;AACV,UAAU,eAAe,CAAC,MAAM;AAChC,IAAI,IAAI,CAAC,SAAS;AAClB,MAAM,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK;AAC1C,UAAU;AACV,UAAU,aAAa,KAAK,IAAI,IAAI,aAAa,KAAK;AACtD,UAAU;AACV,UAAU,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC;AAC/C,IAAI,IAAI,CAAC,SAAS;AAClB,MAAM,SAAS,IAAI;AACnB,UAAU,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,KAAKA,oBAAW,CAAC,MAAM,EAAE,GAAG,CAAC;AACzD,UAAU,aAAa,KAAK,IAAI,IAAI,aAAa,KAAK;AACtD,UAAU;AACV,UAAU,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,KAAKA,oBAAW,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;AACxE,IAAI,MAAM,kBAAkB,GAAGC,yBAAY;AAC3C,MAAM,aAAa,KAAK,IAAI,IAAI,aAAa,KAAK;AAClD,UAAU;AACV,UAAU,aAAa,CAAC,UAAU;AAClC;AACA,QAAQ,aAAa,KAAK,IAAI,IAAI,aAAa,KAAK;AACpD,UAAU;AACV,UAAU,aAAa,CAAC;AACxB,QAAQ,SAAS;AACjB,IAAI,IAAI,CAAC,UAAU;AACnB,MAAM,CAAC,IAAI;AACX,QAAQ,UAAU,KAAK,IAAI,IAAI,UAAU,KAAK;AAC9C,YAAY;AACZ,YAAY,kBAAkB,MAAM,IAAI,IAAI,IAAI,KAAK;AACrD,UAAU;AACV,UAAU,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC9B;;AAEA,IAAI,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE;AAClC,MAAM,OAAO,EAAE;AACf,QAAQ,QAAQ,EAAE,IAAI;AACtB,QAAQ,UAAU,EAAE,IAAI;AACxB,OAAO;AACP,MAAM,IAAI,EAAE;AACZ,QAAQ,UAAU,EAAE,KAAK;AACzB,OAAO;AACP,MAAM,KAAK,EAAE;AACb,QAAQ,UAAU,EAAE,KAAK;AACzB,OAAO;AACP,MAAM,MAAM,EAAE;AACd,QAAQ,UAAU,EAAE,KAAK;AACzB,OAAO;AACP,MAAM,SAAS,EAAE;AACjB,QAAQ,UAAU,EAAE,KAAK;AACzB,OAAO;AACP,MAAM,aAAa,EAAE;AACrB,QAAQ,UAAU,EAAE,KAAK;AACzB,OAAO;AACP,KAAK,CAAC,CAAC;;AAEP;AACA;;AAEA,IAAI;AACJ,MAAM,aAAa,KAAK,IAAI;AAC5B,MAAM,aAAa,KAAK,MAAM;AAC9B,MAAM,aAAa,CAAC;AACpB,MAAM;AACN,MAAM,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE;AAC3C,QAAQ,KAAK,EAAE,aAAa,CAAC,KAAK;AAClC,QAAQ,QAAQ,EAAE,IAAI;AACtB,QAAQ,YAAY,EAAE,IAAI;AAC1B,OAAO,CAAC;AACR,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,iBAAiB,EAAE;AACxC,MAAM,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC;AACjD,IAAI,CAAC,MAAM;AACX,MAAM,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE;AAC3C,QAAQ,KAAK,EAAE,KAAK,EAAE,CAAC,KAAK;AAC5B,QAAQ,QAAQ,EAAE,IAAI;AACtB,QAAQ,YAAY,EAAE,IAAI;AAC1B,OAAO,CAAC;AACR,IAAI;AACJ;AACA,EAAE;;AAEF,EAAE,KAAK,MAAM,CAAC,WAAW,CAAC,GAAG;AAC7B,IAAI,OAAO,cAAc;AACzB,EAAE;;AAEF,EAAE,QAAQ,GAAG;AACb,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO;;AAE7B,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AACpB,MAAM,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AACrC,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE;AACtB,UAAU,MAAM,IAAI,MAAM,GAAGC,2BAAa,CAAC,IAAI,CAAC,GAAG,CAAC;AACpD,QAAQ;AACR,MAAM;AACN,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE;AAC9C,MAAM,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE;AAC7C,QAAQ,MAAM,IAAI,MAAM,GAAGC,iCAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC;AACrE,MAAM;AACN,IAAI;;AAEJ,IAAI,OAAO,MAAM;AACjB,EAAE;;AAEF,EAAE,MAAM,GAAG;AACX,IAAI,MAAM,cAAc,GAAG;AAC3B,MAAM,OAAO,EAAE,IAAI,CAAC,OAAO;AAC3B,KAAK;;AAEL,IAAI,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,EAAE;AAChC,MAAM,cAAc,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS;AAC/C,IAAI;;AAEJ,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,EAAE;AAC3B,MAAM,cAAc,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;AACrC,IAAI;;AAEJ,IAAI,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AAC5E,MAAM,cAAc,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU;AACjD,IAAI;;AAEJ,IAAI,OAAO,cAAc;AACzB,EAAE;AACF;;AAEA,SAAS,gBAAgB,CAAC,KAAK,EAAE;AACjC,EAAE,OAAO,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,GAAG,SAAS,GAAG,KAAK;AACtE;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/graphql/error/syntaxError.js

@@ -0,0 +1,18 @@
+'use strict';
+
+var GraphQLError = require('./GraphQLError.js');
+
+/**
+ * Produces a GraphQLError representing a syntax error, containing useful
+ * descriptive information about the syntax error's position in the source.
+ */
+
+function syntaxError(source, position, description) {
+  return new GraphQLError.GraphQLError(`Syntax Error: ${description}`, {
+    source,
+    positions: [position],
+  });
+}
+
+exports.syntaxError = syntaxError;
+//# sourceMappingURL=syntaxError.js.map

package/dist/cjs/node_modules/graphql/error/syntaxError.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"syntaxError.js","sources":["../../../../../node_modules/graphql/error/syntaxError.mjs"],"sourcesContent":["import { GraphQLError } from './GraphQLError.mjs';\n/**\n * Produces a GraphQLError representing a syntax error, containing useful\n * descriptive information about the syntax error's position in the source.\n */\n\nexport function syntaxError(source, position, description) {\n  return new GraphQLError(`Syntax Error: ${description}`, {\n    source,\n    positions: [position],\n  });\n}\n"],"names":["GraphQLError"],"mappings":";;;;AACA;AACA;AACA;AACA;;AAEO,SAAS,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE;AAC3D,EAAE,OAAO,IAAIA,yBAAY,CAAC,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC,EAAE;AAC1D,IAAI,MAAM;AACV,IAAI,SAAS,EAAE,CAAC,QAAQ,CAAC;AACzB,GAAG,CAAC;AACJ;;;;","x_google_ignoreList":[0]}

package/dist/cjs/node_modules/graphql/jsutils/devAssert.js

@@ -0,0 +1,12 @@
+'use strict';
+
+function devAssert(condition, message) {
+  const booleanCondition = Boolean(condition);
+
+  if (!booleanCondition) {
+    throw new Error(message);
+  }
+}
+
+exports.devAssert = devAssert;
+//# sourceMappingURL=devAssert.js.map

package/dist/cjs/node_modules/graphql/jsutils/devAssert.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"devAssert.js","sources":["../../../../../node_modules/graphql/jsutils/devAssert.mjs"],"sourcesContent":["export function devAssert(condition, message) {\n  const booleanCondition = Boolean(condition);\n\n  if (!booleanCondition) {\n    throw new Error(message);\n  }\n}\n"],"names":[],"mappings":";;AAAO,SAAS,SAAS,CAAC,SAAS,EAAE,OAAO,EAAE;AAC9C,EAAE,MAAM,gBAAgB,GAAG,OAAO,CAAC,SAAS,CAAC;;AAE7C,EAAE,IAAI,CAAC,gBAAgB,EAAE;AACzB,IAAI,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC;AAC5B,EAAE;AACF;;;;","x_google_ignoreList":[0]}