react-easy-wall 2.0.14 → 3.1.0

package/dist/esm/node_modules/@apollo/client/cache/inmemory/policies.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"policies.js","sources":["../../../../../../../node_modules/@apollo/client/cache/inmemory/policies.js"],"sourcesContent":["import { equal } from \"@wry/equality\";\nimport { disableWarningsSlot } from \"@apollo/client/masking\";\nimport { isReference } from \"@apollo/client/utilities\";\nimport { __DEV__ } from \"@apollo/client/utilities/environment\";\nimport { streamInfoSymbol } from \"@apollo/client/utilities/internal\";\nimport { argumentsObjectFromField, getStoreKeyName, isArray, isNonNullObject, storeKeyNameFromField, stringifyForDisplay, } from \"@apollo/client/utilities/internal\";\nimport { invariant, newInvariantError, } from \"@apollo/client/utilities/invariant\";\nimport { defaultDataIdFromObject, fieldNameFromStoreName, hasOwn, selectionSetMatchesResult, storeValueIsStoreObject, TypeOrFieldNameRegExp, } from \"./helpers.js\";\nimport { keyArgsFnFromSpecifier, keyFieldsFnFromSpecifier, } from \"./key-extractor.js\";\nimport { cacheSlot } from \"./reactiveVars.js\";\nfunction argsFromFieldSpecifier(spec) {\n    return (spec.args !== void 0 ? spec.args\n        : spec.field ? argumentsObjectFromField(spec.field, spec.variables)\n            : null);\n}\nconst nullKeyFieldsFn = () => void 0;\nconst simpleKeyArgsFn = (_args, context) => context.fieldName;\n// These merge functions can be selected by specifying merge:true or\n// merge:false in a field policy.\nconst mergeTrueFn = (existing, incoming, { mergeObjects }) => mergeObjects(existing, incoming);\nconst mergeFalseFn = (_, incoming) => incoming;\nexport const defaultStreamFieldMergeFn = (existing, incoming, { streamFieldInfo, existingData }) => {\n    if (!existing && !existingData) {\n        return incoming;\n    }\n    const results = [];\n    const previous = existing ?? existingData;\n    const length = streamFieldInfo?.isLastChunk ?\n        incoming.length\n        : Math.max(previous.length, incoming.length);\n    for (let i = 0; i < length; i++) {\n        results[i] = incoming[i] === undefined ? previous[i] : incoming[i];\n    }\n    return results;\n};\nexport class Policies {\n    config;\n    typePolicies = {};\n    toBeAdded = {};\n    // Map from subtype names to sets of supertype names. Note that this\n    // representation inverts the structure of possibleTypes (whose keys are\n    // supertypes and whose values are arrays of subtypes) because it tends\n    // to be much more efficient to search upwards than downwards.\n    supertypeMap = new Map();\n    // Any fuzzy subtypes specified by possibleTypes will be converted to\n    // RegExp objects and recorded here. Every key of this map can also be\n    // found in supertypeMap. In many cases this Map will be empty, which\n    // means no fuzzy subtype checking will happen in fragmentMatches.\n    fuzzySubtypes = new Map();\n    cache;\n    rootIdsByTypename = {};\n    rootTypenamesById = {};\n    usingPossibleTypes = false;\n    constructor(config) {\n        this.config = config;\n        this.config = {\n            dataIdFromObject: defaultDataIdFromObject,\n            ...config,\n        };\n        this.cache = this.config.cache;\n        this.setRootTypename(\"Query\");\n        this.setRootTypename(\"Mutation\");\n        this.setRootTypename(\"Subscription\");\n        if (config.possibleTypes) {\n            this.addPossibleTypes(config.possibleTypes);\n        }\n        if (config.typePolicies) {\n            this.addTypePolicies(config.typePolicies);\n        }\n    }\n    identify(object, partialContext) {\n        const policies = this;\n        const typename = (partialContext &&\n            (partialContext.typename || partialContext.storeObject?.__typename)) ||\n            object.__typename;\n        // It should be possible to write root Query fields with writeFragment,\n        // using { __typename: \"Query\", ... } as the data, but it does not make\n        // sense to allow the same identification behavior for the Mutation and\n        // Subscription types, since application code should never be writing\n        // directly to (or reading directly from) those root objects.\n        if (typename === this.rootTypenamesById.ROOT_QUERY) {\n            return [\"ROOT_QUERY\"];\n        }\n        // Default context.storeObject to object if not otherwise provided.\n        const storeObject = (partialContext && partialContext.storeObject) || object;\n        const context = {\n            ...partialContext,\n            typename,\n            storeObject,\n            readField: (partialContext && partialContext.readField) ||\n                ((...args) => {\n                    const options = normalizeReadFieldOptions(args, storeObject);\n                    return policies.readField(options, {\n                        store: policies.cache[\"data\"],\n                        variables: options.variables,\n                    });\n                }),\n        };\n        let id;\n        const policy = typename && this.getTypePolicy(typename);\n        let keyFn = (policy && policy.keyFn) || this.config.dataIdFromObject;\n        disableWarningsSlot.withValue(true, () => {\n            while (keyFn) {\n                const specifierOrId = keyFn({ ...object, ...storeObject }, context);\n                if (isArray(specifierOrId)) {\n                    keyFn = keyFieldsFnFromSpecifier(specifierOrId);\n                }\n                else {\n                    id = specifierOrId;\n                    break;\n                }\n            }\n        });\n        id = id ? String(id) : void 0;\n        return context.keyObject ? [id, context.keyObject] : [id];\n    }\n    addTypePolicies(typePolicies) {\n        Object.keys(typePolicies).forEach((typename) => {\n            const { queryType, mutationType, subscriptionType, ...incoming } = typePolicies[typename];\n            // Though {query,mutation,subscription}Type configurations are rare,\n            // it's important to call setRootTypename as early as possible,\n            // since these configurations should apply consistently for the\n            // entire lifetime of the cache. Also, since only one __typename can\n            // qualify as one of these root types, these three properties cannot\n            // be inherited, unlike the rest of the incoming properties. That\n            // restriction is convenient, because the purpose of this.toBeAdded\n            // is to delay the processing of type/field policies until the first\n            // time they're used, allowing policies to be added in any order as\n            // long as all relevant policies (including policies for supertypes)\n            // have been added by the time a given policy is used for the first\n            // time. In other words, since inheritance doesn't matter for these\n            // properties, there's also no need to delay their processing using\n            // the this.toBeAdded queue.\n            if (queryType)\n                this.setRootTypename(\"Query\", typename);\n            if (mutationType)\n                this.setRootTypename(\"Mutation\", typename);\n            if (subscriptionType)\n                this.setRootTypename(\"Subscription\", typename);\n            if (hasOwn.call(this.toBeAdded, typename)) {\n                this.toBeAdded[typename].push(incoming);\n            }\n            else {\n                this.toBeAdded[typename] = [incoming];\n            }\n        });\n    }\n    updateTypePolicy(typename, incoming, existingFieldPolicies) {\n        const existing = this.getTypePolicy(typename);\n        const { keyFields, fields } = incoming;\n        function setMerge(existing, merge) {\n            existing.merge =\n                typeof merge === \"function\" ? merge\n                    // Pass merge:true as a shorthand for a merge implementation\n                    // that returns options.mergeObjects(existing, incoming).\n                    : merge === true ? mergeTrueFn\n                        // Pass merge:false to make incoming always replace existing\n                        // without any warnings about data clobbering.\n                        : merge === false ? mergeFalseFn\n                            : existing.merge;\n        }\n        // Type policies can define merge functions, as an alternative to\n        // using field policies to merge child objects.\n        setMerge(existing, incoming.merge);\n        existing.keyFn =\n            // Pass false to disable normalization for this typename.\n            keyFields === false ? nullKeyFieldsFn\n                // Pass an array of strings to use those fields to compute a\n                // composite ID for objects of this typename.\n                : isArray(keyFields) ? keyFieldsFnFromSpecifier(keyFields)\n                    // Pass a function to take full control over identification.\n                    : typeof keyFields === \"function\" ? keyFields\n                        // Leave existing.keyFn unchanged if above cases fail.\n                        : existing.keyFn;\n        if (fields) {\n            Object.keys(fields).forEach((fieldName) => {\n                let existing = existingFieldPolicies[fieldName];\n                // Field policy inheritance is atomic/shallow: you can't inherit a\n                // field policy and then override just its read function, since read\n                // and merge functions often need to cooperate, so changing only one\n                // of them would be a recipe for inconsistency.\n                // So here we avoid merging an inherited field policy with an updated one.\n                if (!existing || existing?.typename !== typename) {\n                    existing = existingFieldPolicies[fieldName] = { typename };\n                }\n                const incoming = fields[fieldName];\n                if (typeof incoming === \"function\") {\n                    existing.read = incoming;\n                }\n                else {\n                    const { keyArgs, read, merge } = incoming;\n                    existing.keyFn =\n                        // Pass false to disable argument-based differentiation of\n                        // field identities.\n                        keyArgs === false ? simpleKeyArgsFn\n                            // Pass an array of strings to use named arguments to\n                            // compute a composite identity for the field.\n                            : isArray(keyArgs) ? keyArgsFnFromSpecifier(keyArgs)\n                                // Pass a function to take full control over field identity.\n                                : typeof keyArgs === \"function\" ? keyArgs\n                                    // Leave existing.keyFn unchanged if above cases fail.\n                                    : existing.keyFn;\n                    if (typeof read === \"function\") {\n                        existing.read = read;\n                    }\n                    setMerge(existing, merge);\n                }\n                if (existing.read && existing.merge) {\n                    // If we have both a read and a merge function, assume\n                    // keyArgs:false, because read and merge together can take\n                    // responsibility for interpreting arguments in and out. This\n                    // default assumption can always be overridden by specifying\n                    // keyArgs explicitly in the FieldPolicy.\n                    existing.keyFn = existing.keyFn || simpleKeyArgsFn;\n                }\n            });\n        }\n    }\n    setRootTypename(which, typename = which) {\n        const rootId = \"ROOT_\" + which.toUpperCase();\n        const old = this.rootTypenamesById[rootId];\n        if (typename !== old) {\n            invariant(!old || old === which, 103, which);\n            // First, delete any old __typename associated with this rootId from\n            // rootIdsByTypename.\n            if (old)\n                delete this.rootIdsByTypename[old];\n            // Now make this the only __typename that maps to this rootId.\n            this.rootIdsByTypename[typename] = rootId;\n            // Finally, update the __typename associated with this rootId.\n            this.rootTypenamesById[rootId] = typename;\n        }\n    }\n    addPossibleTypes(possibleTypes) {\n        this.usingPossibleTypes = true;\n        Object.keys(possibleTypes).forEach((supertype) => {\n            // Make sure all types have an entry in this.supertypeMap, even if\n            // their supertype set is empty, so we can return false immediately\n            // from policies.fragmentMatches for unknown supertypes.\n            this.getSupertypeSet(supertype, true);\n            possibleTypes[supertype].forEach((subtype) => {\n                this.getSupertypeSet(subtype, true).add(supertype);\n                const match = subtype.match(TypeOrFieldNameRegExp);\n                if (!match || match[0] !== subtype) {\n                    // TODO Don't interpret just any invalid typename as a RegExp.\n                    this.fuzzySubtypes.set(subtype, new RegExp(subtype));\n                }\n            });\n        });\n    }\n    getTypePolicy(typename) {\n        if (!hasOwn.call(this.typePolicies, typename)) {\n            const policy = (this.typePolicies[typename] = {});\n            policy.fields = {};\n            // When the TypePolicy for typename is first accessed, instead of\n            // starting with an empty policy object, inherit any properties or\n            // fields from the type policies of the supertypes of typename.\n            //\n            // Any properties or fields defined explicitly within the TypePolicy\n            // for typename will take precedence, and if there are multiple\n            // supertypes, the properties of policies whose types were added\n            // later via addPossibleTypes will take precedence over those of\n            // earlier supertypes. TODO Perhaps we should warn about these\n            // conflicts in development, and recommend defining the property\n            // explicitly in the subtype policy?\n            //\n            // Field policy inheritance is atomic/shallow: you can't inherit a\n            // field policy and then override just its read function, since read\n            // and merge functions often need to cooperate, so changing only one\n            // of them would be a recipe for inconsistency.\n            //\n            // Once the TypePolicy for typename has been accessed, its properties can\n            // still be updated directly using addTypePolicies, but future changes to\n            // inherited supertype policies will not be reflected in this subtype\n            // policy, because this code runs at most once per typename.\n            let supertypes = this.supertypeMap.get(typename);\n            if (!supertypes && this.fuzzySubtypes.size) {\n                // To make the inheritance logic work for unknown typename strings that\n                // may have fuzzy supertypes, we give this typename an empty supertype\n                // set and then populate it with any fuzzy supertypes that match.\n                supertypes = this.getSupertypeSet(typename, true);\n                // This only works for typenames that are directly matched by a fuzzy\n                // supertype. What if there is an intermediate chain of supertypes?\n                // While possible, that situation can only be solved effectively by\n                // specifying the intermediate relationships via possibleTypes, manually\n                // and in a non-fuzzy way.\n                this.fuzzySubtypes.forEach((regExp, fuzzy) => {\n                    if (regExp.test(typename)) {\n                        // The fuzzy parameter is just the original string version of regExp\n                        // (not a valid __typename string), but we can look up the\n                        // associated supertype(s) in this.supertypeMap.\n                        const fuzzySupertypes = this.supertypeMap.get(fuzzy);\n                        if (fuzzySupertypes) {\n                            fuzzySupertypes.forEach((supertype) => supertypes.add(supertype));\n                        }\n                    }\n                });\n            }\n            if (supertypes && supertypes.size) {\n                supertypes.forEach((supertype) => {\n                    const { fields, ...rest } = this.getTypePolicy(supertype);\n                    Object.assign(policy, rest);\n                    Object.assign(policy.fields, fields);\n                });\n            }\n        }\n        const inbox = this.toBeAdded[typename];\n        if (inbox && inbox.length) {\n            // Merge the pending policies into this.typePolicies, in the order they\n            // were originally passed to addTypePolicy.\n            inbox.splice(0).forEach((policy) => {\n                this.updateTypePolicy(typename, policy, this.typePolicies[typename].fields);\n            });\n        }\n        return this.typePolicies[typename];\n    }\n    getFieldPolicy(typename, fieldName) {\n        if (typename) {\n            return this.getTypePolicy(typename).fields[fieldName];\n        }\n    }\n    getSupertypeSet(subtype, createIfMissing) {\n        let supertypeSet = this.supertypeMap.get(subtype);\n        if (!supertypeSet && createIfMissing) {\n            this.supertypeMap.set(subtype, (supertypeSet = new Set()));\n        }\n        return supertypeSet;\n    }\n    fragmentMatches(fragment, typename, result, variables) {\n        if (!fragment.typeCondition)\n            return true;\n        // If the fragment has a type condition but the object we're matching\n        // against does not have a __typename, the fragment cannot match.\n        if (!typename)\n            return false;\n        const supertype = fragment.typeCondition.name.value;\n        // Common case: fragment type condition and __typename are the same.\n        if (typename === supertype)\n            return true;\n        if (this.usingPossibleTypes && this.supertypeMap.has(supertype)) {\n            const typenameSupertypeSet = this.getSupertypeSet(typename, true);\n            const workQueue = [typenameSupertypeSet];\n            const maybeEnqueue = (subtype) => {\n                const supertypeSet = this.getSupertypeSet(subtype, false);\n                if (supertypeSet &&\n                    supertypeSet.size &&\n                    workQueue.indexOf(supertypeSet) < 0) {\n                    workQueue.push(supertypeSet);\n                }\n            };\n            // We need to check fuzzy subtypes only if we encountered fuzzy\n            // subtype strings in addPossibleTypes, and only while writing to\n            // the cache, since that's when selectionSetMatchesResult gives a\n            // strong signal of fragment matching. The StoreReader class calls\n            // policies.fragmentMatches without passing a result object, so\n            // needToCheckFuzzySubtypes is always false while reading.\n            let needToCheckFuzzySubtypes = !!(result && this.fuzzySubtypes.size);\n            let checkingFuzzySubtypes = false;\n            // It's important to keep evaluating workQueue.length each time through\n            // the loop, because the queue can grow while we're iterating over it.\n            for (let i = 0; i < workQueue.length; ++i) {\n                const supertypeSet = workQueue[i];\n                if (supertypeSet.has(supertype)) {\n                    if (!typenameSupertypeSet.has(supertype)) {\n                        if (checkingFuzzySubtypes) {\n                            __DEV__ && invariant.warn(104, typename, supertype);\n                        }\n                        // Record positive results for faster future lookup.\n                        // Unfortunately, we cannot safely cache negative results,\n                        // because new possibleTypes data could always be added to the\n                        // Policies class.\n                        typenameSupertypeSet.add(supertype);\n                    }\n                    return true;\n                }\n                supertypeSet.forEach(maybeEnqueue);\n                if (needToCheckFuzzySubtypes &&\n                    // Start checking fuzzy subtypes only after exhausting all\n                    // non-fuzzy subtypes (after the final iteration of the loop).\n                    i === workQueue.length - 1 &&\n                    // We could wait to compare fragment.selectionSet to result\n                    // after we verify the supertype, but this check is often less\n                    // expensive than that search, and we will have to do the\n                    // comparison anyway whenever we find a potential match.\n                    selectionSetMatchesResult(fragment.selectionSet, result, variables)) {\n                    // We don't always need to check fuzzy subtypes (if no result\n                    // was provided, or !this.fuzzySubtypes.size), but, when we do,\n                    // we only want to check them once.\n                    needToCheckFuzzySubtypes = false;\n                    checkingFuzzySubtypes = true;\n                    // If we find any fuzzy subtypes that match typename, extend the\n                    // workQueue to search through the supertypes of those fuzzy\n                    // subtypes. Otherwise the for-loop will terminate and we'll\n                    // return false below.\n                    this.fuzzySubtypes.forEach((regExp, fuzzyString) => {\n                        const match = typename.match(regExp);\n                        if (match && match[0] === typename) {\n                            maybeEnqueue(fuzzyString);\n                        }\n                    });\n                }\n            }\n        }\n        return false;\n    }\n    hasKeyArgs(typename, fieldName) {\n        const policy = this.getFieldPolicy(typename, fieldName);\n        return !!(policy && policy.keyFn);\n    }\n    getStoreFieldName(fieldSpec) {\n        const { typename, fieldName } = fieldSpec;\n        const policy = this.getFieldPolicy(typename, fieldName);\n        let storeFieldName;\n        let keyFn = policy && policy.keyFn;\n        if (keyFn && typename) {\n            const context = {\n                typename,\n                fieldName,\n                field: fieldSpec.field || null,\n                variables: fieldSpec.variables,\n            };\n            const args = argsFromFieldSpecifier(fieldSpec);\n            while (keyFn) {\n                const specifierOrString = keyFn(args, context);\n                if (isArray(specifierOrString)) {\n                    keyFn = keyArgsFnFromSpecifier(specifierOrString);\n                }\n                else {\n                    // If the custom keyFn returns a falsy value, fall back to\n                    // fieldName instead.\n                    storeFieldName = specifierOrString || fieldName;\n                    break;\n                }\n            }\n        }\n        if (storeFieldName === void 0) {\n            storeFieldName =\n                fieldSpec.field ?\n                    storeKeyNameFromField(fieldSpec.field, fieldSpec.variables)\n                    : getStoreKeyName(fieldName, argsFromFieldSpecifier(fieldSpec));\n        }\n        // Returning false from a keyArgs function is like configuring\n        // keyArgs: false, but more dynamic.\n        if (storeFieldName === false) {\n            return fieldName;\n        }\n        // Make sure custom field names start with the actual field.name.value\n        // of the field, so we can always figure out which properties of a\n        // StoreObject correspond to which original field names.\n        return fieldName === fieldNameFromStoreName(storeFieldName) ? storeFieldName\n            : fieldName + \":\" + storeFieldName;\n    }\n    readField(options, context) {\n        const objectOrReference = options.from;\n        if (!objectOrReference)\n            return;\n        const nameOrField = options.field || options.fieldName;\n        if (!nameOrField)\n            return;\n        if (options.typename === void 0) {\n            const typename = context.store.getFieldValue(objectOrReference, \"__typename\");\n            if (typename)\n                options.typename = typename;\n        }\n        const storeFieldName = this.getStoreFieldName(options);\n        const fieldName = fieldNameFromStoreName(storeFieldName);\n        const existing = context.store.getFieldValue(objectOrReference, storeFieldName);\n        const policy = this.getFieldPolicy(options.typename, fieldName);\n        const read = policy && policy.read;\n        if (read) {\n            const readOptions = makeFieldFunctionOptions(this, objectOrReference, options, context, context.store.getStorage(isReference(objectOrReference) ?\n                objectOrReference.__ref\n                : objectOrReference, storeFieldName));\n            // Call read(existing, readOptions) with cacheSlot holding this.cache.\n            return cacheSlot.withValue(this.cache, read, [\n                existing,\n                readOptions,\n            ]);\n        }\n        return existing;\n    }\n    getReadFunction(typename, fieldName) {\n        const policy = this.getFieldPolicy(typename, fieldName);\n        return policy && policy.read;\n    }\n    getMergeFunction(parentTypename, fieldName, childTypename) {\n        let policy = this.getFieldPolicy(parentTypename, fieldName);\n        let merge = policy && policy.merge;\n        if (!merge && childTypename) {\n            policy = this.getTypePolicy(childTypename);\n            merge = policy && policy.merge;\n        }\n        return merge;\n    }\n    runMergeFunction(existing, incoming, { field, typename, merge, path }, context, storage) {\n        // Preserve the value in case `context.overwrite` is set.\n        const existingData = existing;\n        if (merge === mergeTrueFn) {\n            // Instead of going to the trouble of creating a full\n            // FieldFunctionOptions object and calling mergeTrueFn, we can\n            // simply call mergeObjects, as mergeTrueFn would.\n            return makeMergeObjectsFunction(context.store)(existing, incoming);\n        }\n        if (merge === mergeFalseFn) {\n            // Likewise for mergeFalseFn, whose implementation is even simpler.\n            return incoming;\n        }\n        // If cache.writeQuery or cache.writeFragment was called with\n        // options.overwrite set to true, we still call merge functions, but\n        // the existing data is always undefined, so the merge function will\n        // not attempt to combine the incoming data with the existing data.\n        if (context.overwrite) {\n            existing = void 0;\n        }\n        const streamInfo = context.extensions?.[streamInfoSymbol]\n            ?.deref()\n            ?.peekArray(path);\n        if (streamInfo) {\n            const { current, previous } = streamInfo;\n            if (previous &&\n                equal(previous.incoming, incoming) &&\n                equal(previous.streamFieldInfo, current)) {\n                return previous.result;\n            }\n        }\n        const result = merge(existing, incoming, makeMergeFieldFunctionOptions(this, \n        // Unlike options.readField for read functions, we do not fall\n        // back to the current object if no foreignObjOrRef is provided,\n        // because it's not clear what the current object should be for\n        // merge functions: the (possibly undefined) existing object, or\n        // the incoming object? If you think your merge function needs\n        // to read sibling fields in order to produce a new value for\n        // the current field, you might want to rethink your strategy,\n        // because that's a recipe for making merge behavior sensitive\n        // to the order in which fields are written into the cache.\n        // However, readField(name, ref) is useful for merge functions\n        // that need to deduplicate child objects and references.\n        void 0, {\n            typename,\n            fieldName: field.name.value,\n            field,\n            variables: context.variables,\n            path,\n        }, context, storage || {}, existingData));\n        if (streamInfo) {\n            streamInfo.previous = {\n                incoming,\n                streamFieldInfo: streamInfo.current,\n                result,\n            };\n        }\n        return result;\n    }\n}\nfunction makeFieldFunctionOptions(policies, objectOrReference, fieldSpec, context, storage) {\n    const storeFieldName = policies.getStoreFieldName(fieldSpec);\n    const fieldName = fieldNameFromStoreName(storeFieldName);\n    const variables = fieldSpec.variables || context.variables;\n    const { toReference, canRead } = context.store;\n    return {\n        args: argsFromFieldSpecifier(fieldSpec),\n        field: fieldSpec.field || null,\n        fieldName,\n        storeFieldName,\n        variables,\n        isReference,\n        toReference,\n        storage,\n        cache: policies.cache,\n        canRead,\n        readField(...args) {\n            return policies.readField(normalizeReadFieldOptions(args, objectOrReference, variables), context);\n        },\n        mergeObjects: makeMergeObjectsFunction(context.store),\n    };\n}\nfunction makeMergeFieldFunctionOptions(policies, objectOrReference, fieldSpec, context, storage, existingData) {\n    const options = {\n        ...makeFieldFunctionOptions(policies, objectOrReference, fieldSpec, context, storage),\n        extensions: context.extensions,\n        existingData,\n    };\n    const extensions = context.extensions;\n    if (extensions && streamInfoSymbol in extensions) {\n        const { [streamInfoSymbol]: streamInfo, ...otherExtensions } = extensions;\n        const streamFieldInfo = streamInfo?.deref()?.peekArray(fieldSpec.path);\n        if (streamFieldInfo) {\n            options.streamFieldInfo = streamFieldInfo.current;\n        }\n        // If the only key in `extensions` was the stream details key, we didn't\n        // receive any remote extensions, so we reset extensions back to undefined\n        options.extensions =\n            Object.keys(otherExtensions).length === 0 ? undefined : otherExtensions;\n    }\n    return options;\n}\nexport function normalizeReadFieldOptions(readFieldArgs, objectOrReference, variables) {\n    const { 0: fieldNameOrOptions, 1: from, length: argc } = readFieldArgs;\n    let options;\n    if (typeof fieldNameOrOptions === \"string\") {\n        options = {\n            fieldName: fieldNameOrOptions,\n            // Default to objectOrReference only when no second argument was\n            // passed for the from parameter, not when undefined is explicitly\n            // passed as the second argument.\n            from: argc > 1 ? from : objectOrReference,\n        };\n    }\n    else {\n        options = { ...fieldNameOrOptions };\n        // Default to objectOrReference only when fieldNameOrOptions.from is\n        // actually omitted, rather than just undefined.\n        if (!hasOwn.call(options, \"from\")) {\n            options.from = objectOrReference;\n        }\n    }\n    if (__DEV__ && options.from === void 0) {\n        __DEV__ && invariant.warn(105, stringifyForDisplay(Array.from(readFieldArgs)));\n    }\n    if (void 0 === options.variables) {\n        options.variables = variables;\n    }\n    return options;\n}\nfunction makeMergeObjectsFunction(store) {\n    return function mergeObjects(existing, incoming) {\n        if (isArray(existing) || isArray(incoming)) {\n            throw newInvariantError(106);\n        }\n        // These dynamic checks are necessary because the parameters of a\n        // custom merge function can easily have the any type, so the type\n        // system cannot always enforce the StoreObject | Reference parameter\n        // types of options.mergeObjects.\n        if (isNonNullObject(existing) && isNonNullObject(incoming)) {\n            const eType = store.getFieldValue(existing, \"__typename\");\n            const iType = store.getFieldValue(incoming, \"__typename\");\n            const typesDiffer = eType && iType && eType !== iType;\n            if (typesDiffer) {\n                return incoming;\n            }\n            if (isReference(existing) && storeValueIsStoreObject(incoming)) {\n                // Update the normalized EntityStore for the entity identified by\n                // existing.__ref, preferring/overwriting any fields contributed by the\n                // newer incoming StoreObject.\n                store.merge(existing.__ref, incoming);\n                return existing;\n            }\n            if (storeValueIsStoreObject(existing) && isReference(incoming)) {\n                // Update the normalized EntityStore for the entity identified by\n                // incoming.__ref, taking fields from the older existing object only if\n                // those fields are not already present in the newer StoreObject\n                // identified by incoming.__ref.\n                store.merge(existing, incoming.__ref);\n                return incoming;\n            }\n            if (storeValueIsStoreObject(existing) &&\n                storeValueIsStoreObject(incoming)) {\n                return { ...existing, ...incoming };\n            }\n        }\n        return incoming;\n    };\n}\n//# sourceMappingURL=policies.js.map\n"],"names":[],"mappings":";;;;;;;;;;;;;;AAUA,SAAS,sBAAsB,CAAC,IAAI,EAAE;AACtC,IAAI,QAAQ,IAAI,CAAC,IAAI,KAAK,MAAM,GAAG,IAAI,CAAC;AACxC,UAAU,IAAI,CAAC,KAAK,GAAG,wBAAwB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS;AAC1E,cAAc,IAAI;AAClB;AACA,MAAM,eAAe,GAAG,MAAM,MAAM;AACpC,MAAM,eAAe,GAAG,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,SAAS;AAC7D;AACA;AACA,MAAM,WAAW,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,KAAK,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC;AAC9F,MAAM,YAAY,GAAG,CAAC,CAAC,EAAE,QAAQ,KAAK,QAAQ;AAClC,MAAC,yBAAyB,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,eAAe,EAAE,YAAY,EAAE,KAAK;AACpG,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,YAAY,EAAE;AACpC,QAAQ,OAAO,QAAQ;AACvB,IAAI;AACJ,IAAI,MAAM,OAAO,GAAG,EAAE;AACtB,IAAI,MAAM,QAAQ,GAAG,QAAQ,IAAI,YAAY;AAC7C,IAAI,MAAM,MAAM,GAAG,eAAe,EAAE,WAAW;AAC/C,QAAQ,QAAQ,CAAC;AACjB,UAAU,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC;AACpD,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;AACrC,QAAQ,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AAC1E,IAAI;AACJ,IAAI,OAAO,OAAO;AAClB;AACO,MAAM,QAAQ,CAAC;AACtB,IAAI,MAAM;AACV,IAAI,YAAY,GAAG,EAAE;AACrB,IAAI,SAAS,GAAG,EAAE;AAClB;AACA;AACA;AACA;AACA,IAAI,YAAY,GAAG,IAAI,GAAG,EAAE;AAC5B;AACA;AACA;AACA;AACA,IAAI,aAAa,GAAG,IAAI,GAAG,EAAE;AAC7B,IAAI,KAAK;AACT,IAAI,iBAAiB,GAAG,EAAE;AAC1B,IAAI,iBAAiB,GAAG,EAAE;AAC1B,IAAI,kBAAkB,GAAG,KAAK;AAC9B,IAAI,WAAW,CAAC,MAAM,EAAE;AACxB,QAAQ,IAAI,CAAC,MAAM,GAAG,MAAM;AAC5B,QAAQ,IAAI,CAAC,MAAM,GAAG;AACtB,YAAY,gBAAgB,EAAE,uBAAuB;AACrD,YAAY,GAAG,MAAM;AACrB,SAAS;AACT,QAAQ,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK;AACtC,QAAQ,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC;AACrC,QAAQ,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC;AACxC,QAAQ,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC;AAC5C,QAAQ,IAAI,MAAM,CAAC,aAAa,EAAE;AAClC,YAAY,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,aAAa,CAAC;AACvD,QAAQ;AACR,QAAQ,IAAI,MAAM,CAAC,YAAY,EAAE;AACjC,YAAY,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC;AACrD,QAAQ;AACR,IAAI;AACJ,IAAI,QAAQ,CAAC,MAAM,EAAE,cAAc,EAAE;AACrC,QAAQ,MAAM,QAAQ,GAAG,IAAI;AAC7B,QAAQ,MAAM,QAAQ,GAAG,CAAC,cAAc;AACxC,aAAa,cAAc,CAAC,QAAQ,IAAI,cAAc,CAAC,WAAW,EAAE,UAAU,CAAC;AAC/E,YAAY,MAAM,CAAC,UAAU;AAC7B;AACA;AACA;AACA;AACA;AACA,QAAQ,IAAI,QAAQ,KAAK,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE;AAC5D,YAAY,OAAO,CAAC,YAAY,CAAC;AACjC,QAAQ;AACR;AACA,QAAQ,MAAM,WAAW,GAAG,CAAC,cAAc,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM;AACpF,QAAQ,MAAM,OAAO,GAAG;AACxB,YAAY,GAAG,cAAc;AAC7B,YAAY,QAAQ;AACpB,YAAY,WAAW;AACvB,YAAY,SAAS,EAAE,CAAC,cAAc,IAAI,cAAc,CAAC,SAAS;AAClE,iBAAiB,CAAC,GAAG,IAAI,KAAK;AAC9B,oBAAoB,MAAM,OAAO,GAAG,yBAAyB,CAAC,IAAI,EAAE,WAAW,CAAC;AAChF,oBAAoB,OAAO,QAAQ,CAAC,SAAS,CAAC,OAAO,EAAE;AACvD,wBAAwB,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;AACrD,wBAAwB,SAAS,EAAE,OAAO,CAAC,SAAS;AACpD,qBAAqB,CAAC;AACtB,gBAAgB,CAAC,CAAC;AAClB,SAAS;AACT,QAAQ,IAAI,EAAE;AACd,QAAQ,MAAM,MAAM,GAAG,QAAQ,IAAI,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC;AAC/D,QAAQ,IAAI,KAAK,GAAG,CAAC,MAAM,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,MAAM,CAAC,gBAAgB;AAC5E,QAAQ,mBAAmB,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM;AAClD,YAAY,OAAO,KAAK,EAAE;AAC1B,gBAAgB,MAAM,aAAa,GAAG,KAAK,CAAC,EAAE,GAAG,MAAM,EAAE,GAAG,WAAW,EAAE,EAAE,OAAO,CAAC;AACnF,gBAAgB,IAAI,OAAO,CAAC,aAAa,CAAC,EAAE;AAC5C,oBAAoB,KAAK,GAAG,wBAAwB,CAAC,aAAa,CAAC;AACnE,gBAAgB;AAChB,qBAAqB;AACrB,oBAAoB,EAAE,GAAG,aAAa;AACtC,oBAAoB;AACpB,gBAAgB;AAChB,YAAY;AACZ,QAAQ,CAAC,CAAC;AACV,QAAQ,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,MAAM;AACrC,QAAQ,OAAO,OAAO,CAAC,SAAS,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;AACjE,IAAI;AACJ,IAAI,eAAe,CAAC,YAAY,EAAE;AAClC,QAAQ,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,KAAK;AACxD,YAAY,MAAM,EAAE,SAAS,EAAE,YAAY,EAAE,gBAAgB,EAAE,GAAG,QAAQ,EAAE,GAAG,YAAY,CAAC,QAAQ,CAAC;AACrG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,IAAI,SAAS;AACzB,gBAAgB,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,QAAQ,CAAC;AACvD,YAAY,IAAI,YAAY;AAC5B,gBAAgB,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,QAAQ,CAAC;AAC1D,YAAY,IAAI,gBAAgB;AAChC,gBAAgB,IAAI,CAAC,eAAe,CAAC,cAAc,EAAE,QAAQ,CAAC;AAC9D,YAAY,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,EAAE;AACvD,gBAAgB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;AACvD,YAAY;AACZ,iBAAiB;AACjB,gBAAgB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC;AACrD,YAAY;AACZ,QAAQ,CAAC,CAAC;AACV,IAAI;AACJ,IAAI,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,qBAAqB,EAAE;AAChE,QAAQ,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC;AACrD,QAAQ,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,QAAQ;AAC9C,QAAQ,SAAS,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE;AAC3C,YAAY,QAAQ,CAAC,KAAK;AAC1B,gBAAgB,OAAO,KAAK,KAAK,UAAU,GAAG;AAC9C;AACA;AACA,sBAAsB,KAAK,KAAK,IAAI,GAAG;AACvC;AACA;AACA,0BAA0B,KAAK,KAAK,KAAK,GAAG;AAC5C,8BAA8B,QAAQ,CAAC,KAAK;AAC5C,QAAQ;AACR;AACA;AACA,QAAQ,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC;AAC1C,QAAQ,QAAQ,CAAC,KAAK;AACtB;AACA,YAAY,SAAS,KAAK,KAAK,GAAG;AAClC;AACA;AACA,kBAAkB,OAAO,CAAC,SAAS,CAAC,GAAG,wBAAwB,CAAC,SAAS;AACzE;AACA,sBAAsB,OAAO,SAAS,KAAK,UAAU,GAAG;AACxD;AACA,0BAA0B,QAAQ,CAAC,KAAK;AACxC,QAAQ,IAAI,MAAM,EAAE;AACpB,YAAY,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,KAAK;AACvD,gBAAgB,IAAI,QAAQ,GAAG,qBAAqB,CAAC,SAAS,CAAC;AAC/D;AACA;AACA;AACA;AACA;AACA,gBAAgB,IAAI,CAAC,QAAQ,IAAI,QAAQ,EAAE,QAAQ,KAAK,QAAQ,EAAE;AAClE,oBAAoB,QAAQ,GAAG,qBAAqB,CAAC,SAAS,CAAC,GAAG,EAAE,QAAQ,EAAE;AAC9E,gBAAgB;AAChB,gBAAgB,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC;AAClD,gBAAgB,IAAI,OAAO,QAAQ,KAAK,UAAU,EAAE;AACpD,oBAAoB,QAAQ,CAAC,IAAI,GAAG,QAAQ;AAC5C,gBAAgB;AAChB,qBAAqB;AACrB,oBAAoB,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,QAAQ;AAC7D,oBAAoB,QAAQ,CAAC,KAAK;AAClC;AACA;AACA,wBAAwB,OAAO,KAAK,KAAK,GAAG;AAC5C;AACA;AACA,8BAA8B,OAAO,CAAC,OAAO,CAAC,GAAG,sBAAsB,CAAC,OAAO;AAC/E;AACA,kCAAkC,OAAO,OAAO,KAAK,UAAU,GAAG;AAClE;AACA,sCAAsC,QAAQ,CAAC,KAAK;AACpD,oBAAoB,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;AACpD,wBAAwB,QAAQ,CAAC,IAAI,GAAG,IAAI;AAC5C,oBAAoB;AACpB,oBAAoB,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC;AAC7C,gBAAgB;AAChB,gBAAgB,IAAI,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE;AACrD;AACA;AACA;AACA;AACA;AACA,oBAAoB,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,IAAI,eAAe;AACtE,gBAAgB;AAChB,YAAY,CAAC,CAAC;AACd,QAAQ;AACR,IAAI;AACJ,IAAI,eAAe,CAAC,KAAK,EAAE,QAAQ,GAAG,KAAK,EAAE;AAC7C,QAAQ,MAAM,MAAM,GAAG,OAAO,GAAG,KAAK,CAAC,WAAW,EAAE;AACpD,QAAQ,MAAM,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC;AAClD,QAAQ,IAAI,QAAQ,KAAK,GAAG,EAAE;AAC9B,YAAY,SAAS,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC;AACxD;AACA;AACA,YAAY,IAAI,GAAG;AACnB,gBAAgB,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC;AAClD;AACA,YAAY,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,GAAG,MAAM;AACrD;AACA,YAAY,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,GAAG,QAAQ;AACrD,QAAQ;AACR,IAAI;AACJ,IAAI,gBAAgB,CAAC,aAAa,EAAE;AACpC,QAAQ,IAAI,CAAC,kBAAkB,GAAG,IAAI;AACtC,QAAQ,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,KAAK;AAC1D;AACA;AACA;AACA,YAAY,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC;AACjD,YAAY,aAAa,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,KAAK;AAC1D,gBAAgB,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;AAClE,gBAAgB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,qBAAqB,CAAC;AAClE,gBAAgB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE;AACpD;AACA,oBAAoB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;AACxE,gBAAgB;AAChB,YAAY,CAAC,CAAC;AACd,QAAQ,CAAC,CAAC;AACV,IAAI;AACJ,IAAI,aAAa,CAAC,QAAQ,EAAE;AAC5B,QAAQ,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,EAAE;AACvD,YAAY,MAAM,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;AAC7D,YAAY,MAAM,CAAC,MAAM,GAAG,EAAE;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,IAAI,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC;AAC5D,YAAY,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE;AACxD;AACA;AACA;AACA,gBAAgB,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC;AACjE;AACA;AACA;AACA;AACA;AACA,gBAAgB,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,KAAK;AAC9D,oBAAoB,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;AAC/C;AACA;AACA;AACA,wBAAwB,MAAM,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC;AAC5E,wBAAwB,IAAI,eAAe,EAAE;AAC7C,4BAA4B,eAAe,CAAC,OAAO,CAAC,CAAC,SAAS,KAAK,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AAC7F,wBAAwB;AACxB,oBAAoB;AACpB,gBAAgB,CAAC,CAAC;AAClB,YAAY;AACZ,YAAY,IAAI,UAAU,IAAI,UAAU,CAAC,IAAI,EAAE;AAC/C,gBAAgB,UAAU,CAAC,OAAO,CAAC,CAAC,SAAS,KAAK;AAClD,oBAAoB,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC;AAC7E,oBAAoB,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC;AAC/C,oBAAoB,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;AACxD,gBAAgB,CAAC,CAAC;AAClB,YAAY;AACZ,QAAQ;AACR,QAAQ,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;AAC9C,QAAQ,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE;AACnC;AACA;AACA,YAAY,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK;AAChD,gBAAgB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;AAC3F,YAAY,CAAC,CAAC;AACd,QAAQ;AACR,QAAQ,OAAO,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;AAC1C,IAAI;AACJ,IAAI,cAAc,CAAC,QAAQ,EAAE,SAAS,EAAE;AACxC,QAAQ,IAAI,QAAQ,EAAE;AACtB,YAAY,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC;AACjE,QAAQ;AACR,IAAI;AACJ,IAAI,eAAe,CAAC,OAAO,EAAE,eAAe,EAAE;AAC9C,QAAQ,IAAI,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC;AACzD,QAAQ,IAAI,CAAC,YAAY,IAAI,eAAe,EAAE;AAC9C,YAAY,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,GAAG,YAAY,GAAG,IAAI,GAAG,EAAE,EAAE;AACtE,QAAQ;AACR,QAAQ,OAAO,YAAY;AAC3B,IAAI;AACJ,IAAI,eAAe,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE;AAC3D,QAAQ,IAAI,CAAC,QAAQ,CAAC,aAAa;AACnC,YAAY,OAAO,IAAI;AACvB;AACA;AACA,QAAQ,IAAI,CAAC,QAAQ;AACrB,YAAY,OAAO,KAAK;AACxB,QAAQ,MAAM,SAAS,GAAG,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK;AAC3D;AACA,QAAQ,IAAI,QAAQ,KAAK,SAAS;AAClC,YAAY,OAAO,IAAI;AACvB,QAAQ,IAAI,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;AACzE,YAAY,MAAM,oBAAoB,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC;AAC7E,YAAY,MAAM,SAAS,GAAG,CAAC,oBAAoB,CAAC;AACpD,YAAY,MAAM,YAAY,GAAG,CAAC,OAAO,KAAK;AAC9C,gBAAgB,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,KAAK,CAAC;AACzE,gBAAgB,IAAI,YAAY;AAChC,oBAAoB,YAAY,CAAC,IAAI;AACrC,oBAAoB,SAAS,CAAC,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE;AACzD,oBAAoB,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC;AAChD,gBAAgB;AAChB,YAAY,CAAC;AACb;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,IAAI,wBAAwB,GAAG,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;AAEhF;AACA;AACA,YAAY,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;AACvD,gBAAgB,MAAM,YAAY,GAAG,SAAS,CAAC,CAAC,CAAC;AACjD,gBAAgB,IAAI,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;AACjD,oBAAoB,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;AAI9D;AACA;AACA;AACA;AACA,wBAAwB,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC;AAC3D,oBAAoB;AACpB,oBAAoB,OAAO,IAAI;AAC/B,gBAAgB;AAChB,gBAAgB,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC;AAClD,gBAAgB,IAAI,wBAAwB;AAC5C;AACA;AACA,oBAAoB,CAAC,KAAK,SAAS,CAAC,MAAM,GAAG,CAAC;AAC9C;AACA;AACA;AACA;AACA,oBAAoB,yBAAyB,CAAC,QAAQ,CAAC,YAAY,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE;AACzF;AACA;AACA;AACA,oBAAoB,wBAAwB,GAAG,KAAK;AAEpD;AACA;AACA;AACA;AACA,oBAAoB,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,WAAW,KAAK;AACxE,wBAAwB,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC;AAC5D,wBAAwB,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE;AAC5D,4BAA4B,YAAY,CAAC,WAAW,CAAC;AACrD,wBAAwB;AACxB,oBAAoB,CAAC,CAAC;AACtB,gBAAgB;AAChB,YAAY;AACZ,QAAQ;AACR,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ,IAAI,UAAU,CAAC,QAAQ,EAAE,SAAS,EAAE;AACpC,QAAQ,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,SAAS,CAAC;AAC/D,QAAQ,OAAO,CAAC,EAAE,MAAM,IAAI,MAAM,CAAC,KAAK,CAAC;AACzC,IAAI;AACJ,IAAI,iBAAiB,CAAC,SAAS,EAAE;AACjC,QAAQ,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,SAAS;AACjD,QAAQ,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,SAAS,CAAC;AAC/D,QAAQ,IAAI,cAAc;AAC1B,QAAQ,IAAI,KAAK,GAAG,MAAM,IAAI,MAAM,CAAC,KAAK;AAC1C,QAAQ,IAAI,KAAK,IAAI,QAAQ,EAAE;AAC/B,YAAY,MAAM,OAAO,GAAG;AAC5B,gBAAgB,QAAQ;AACxB,gBAAgB,SAAS;AACzB,gBAAgB,KAAK,EAAE,SAAS,CAAC,KAAK,IAAI,IAAI;AAC9C,gBAAgB,SAAS,EAAE,SAAS,CAAC,SAAS;AAC9C,aAAa;AACb,YAAY,MAAM,IAAI,GAAG,sBAAsB,CAAC,SAAS,CAAC;AAC1D,YAAY,OAAO,KAAK,EAAE;AAC1B,gBAAgB,MAAM,iBAAiB,GAAG,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC;AAC9D,gBAAgB,IAAI,OAAO,CAAC,iBAAiB,CAAC,EAAE;AAChD,oBAAoB,KAAK,GAAG,sBAAsB,CAAC,iBAAiB,CAAC;AACrE,gBAAgB;AAChB,qBAAqB;AACrB;AACA;AACA,oBAAoB,cAAc,GAAG,iBAAiB,IAAI,SAAS;AACnE,oBAAoB;AACpB,gBAAgB;AAChB,YAAY;AACZ,QAAQ;AACR,QAAQ,IAAI,cAAc,KAAK,MAAM,EAAE;AACvC,YAAY,cAAc;AAC1B,gBAAgB,SAAS,CAAC,KAAK;AAC/B,oBAAoB,qBAAqB,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,SAAS;AAC9E,sBAAsB,eAAe,CAAC,SAAS,EAAE,sBAAsB,CAAC,SAAS,CAAC,CAAC;AACnF,QAAQ;AACR;AACA;AACA,QAAQ,IAAI,cAAc,KAAK,KAAK,EAAE;AACtC,YAAY,OAAO,SAAS;AAC5B,QAAQ;AACR;AACA;AACA;AACA,QAAQ,OAAO,SAAS,KAAK,sBAAsB,CAAC,cAAc,CAAC,GAAG;AACtE,cAAc,SAAS,GAAG,GAAG,GAAG,cAAc;AAC9C,IAAI;AACJ,IAAI,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE;AAChC,QAAQ,MAAM,iBAAiB,GAAG,OAAO,CAAC,IAAI;AAC9C,QAAQ,IAAI,CAAC,iBAAiB;AAC9B,YAAY;AACZ,QAAQ,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,SAAS;AAC9D,QAAQ,IAAI,CAAC,WAAW;AACxB,YAAY;AACZ,QAAQ,IAAI,OAAO,CAAC,QAAQ,KAAK,MAAM,EAAE;AACzC,YAAY,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,iBAAiB,EAAE,YAAY,CAAC;AACzF,YAAY,IAAI,QAAQ;AACxB,gBAAgB,OAAO,CAAC,QAAQ,GAAG,QAAQ;AAC3C,QAAQ;AACR,QAAQ,MAAM,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC;AAC9D,QAAQ,MAAM,SAAS,GAAG,sBAAsB,CAAC,cAAc,CAAC;AAChE,QAAQ,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,iBAAiB,EAAE,cAAc,CAAC;AACvF,QAAQ,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,EAAE,SAAS,CAAC;AACvE,QAAQ,MAAM,IAAI,GAAG,MAAM,IAAI,MAAM,CAAC,IAAI;AAC1C,QAAQ,IAAI,IAAI,EAAE;AAClB,YAAY,MAAM,WAAW,GAAG,wBAAwB,CAAC,IAAI,EAAE,iBAAiB,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,iBAAiB,CAAC;AAC3J,gBAAgB,iBAAiB,CAAC;AAClC,kBAAkB,iBAAiB,EAAE,cAAc,CAAC,CAAC;AACrD;AACA,YAAY,OAAO,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE;AACzD,gBAAgB,QAAQ;AACxB,gBAAgB,WAAW;AAC3B,aAAa,CAAC;AACd,QAAQ;AACR,QAAQ,OAAO,QAAQ;AACvB,IAAI;AACJ,IAAI,eAAe,CAAC,QAAQ,EAAE,SAAS,EAAE;AACzC,QAAQ,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,SAAS,CAAC;AAC/D,QAAQ,OAAO,MAAM,IAAI,MAAM,CAAC,IAAI;AACpC,IAAI;AACJ,IAAI,gBAAgB,CAAC,cAAc,EAAE,SAAS,EAAE,aAAa,EAAE;AAC/D,QAAQ,IAAI,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,SAAS,CAAC;AACnE,QAAQ,IAAI,KAAK,GAAG,MAAM,IAAI,MAAM,CAAC,KAAK;AAC1C,QAAQ,IAAI,CAAC,KAAK,IAAI,aAAa,EAAE;AACrC,YAAY,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC;AACtD,YAAY,KAAK,GAAG,MAAM,IAAI,MAAM,CAAC,KAAK;AAC1C,QAAQ;AACR,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ,IAAI,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE;AAC7F;AACA,QAAQ,MAAM,YAAY,GAAG,QAAQ;AACrC,QAAQ,IAAI,KAAK,KAAK,WAAW,EAAE;AACnC;AACA;AACA;AACA,YAAY,OAAO,wBAAwB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC;AAC9E,QAAQ;AACR,QAAQ,IAAI,KAAK,KAAK,YAAY,EAAE;AACpC;AACA,YAAY,OAAO,QAAQ;AAC3B,QAAQ;AACR;AACA;AACA;AACA;AACA,QAAQ,IAAI,OAAO,CAAC,SAAS,EAAE;AAC/B,YAAY,QAAQ,GAAG,MAAM;AAC7B,QAAQ;AACR,QAAQ,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,GAAG,gBAAgB;AAChE,cAAc,KAAK;AACnB,cAAc,SAAS,CAAC,IAAI,CAAC;AAC7B,QAAQ,IAAI,UAAU,EAAE;AACxB,YAAY,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,UAAU;AACpD,YAAY,IAAI,QAAQ;AACxB,gBAAgB,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;AAClD,gBAAgB,KAAK,CAAC,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC,EAAE;AAC1D,gBAAgB,OAAO,QAAQ,CAAC,MAAM;AACtC,YAAY;AACZ,QAAQ;AACR,QAAQ,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,6BAA6B,CAAC,IAAI;AACnF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM,EAAE;AAChB,YAAY,QAAQ;AACpB,YAAY,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK;AACvC,YAAY,KAAK;AACjB,YAAY,SAAS,EAAE,OAAO,CAAC,SAAS;AACxC,YAAY,IAAI;AAChB,SAAS,EAAE,OAAO,EAAE,OAAO,IAAI,EAAE,EAAE,YAAY,CAAC,CAAC;AACjD,QAAQ,IAAI,UAAU,EAAE;AACxB,YAAY,UAAU,CAAC,QAAQ,GAAG;AAClC,gBAAgB,QAAQ;AACxB,gBAAgB,eAAe,EAAE,UAAU,CAAC,OAAO;AACnD,gBAAgB,MAAM;AACtB,aAAa;AACb,QAAQ;AACR,QAAQ,OAAO,MAAM;AACrB,IAAI;AACJ;AACA,SAAS,wBAAwB,CAAC,QAAQ,EAAE,iBAAiB,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE;AAC5F,IAAI,MAAM,cAAc,GAAG,QAAQ,CAAC,iBAAiB,CAAC,SAAS,CAAC;AAChE,IAAI,MAAM,SAAS,GAAG,sBAAsB,CAAC,cAAc,CAAC;AAC5D,IAAI,MAAM,SAAS,GAAG,SAAS,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS;AAC9D,IAAI,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,KAAK;AAClD,IAAI,OAAO;AACX,QAAQ,IAAI,EAAE,sBAAsB,CAAC,SAAS,CAAC;AAC/C,QAAQ,KAAK,EAAE,SAAS,CAAC,KAAK,IAAI,IAAI;AACtC,QAAQ,SAAS;AACjB,QAAQ,cAAc;AACtB,QAAQ,SAAS;AACjB,QAAQ,WAAW;AACnB,QAAQ,WAAW;AACnB,QAAQ,OAAO;AACf,QAAQ,KAAK,EAAE,QAAQ,CAAC,KAAK;AAC7B,QAAQ,OAAO;AACf,QAAQ,SAAS,CAAC,GAAG,IAAI,EAAE;AAC3B,YAAY,OAAO,QAAQ,CAAC,SAAS,CAAC,yBAAyB,CAAC,IAAI,EAAE,iBAAiB,EAAE,SAAS,CAAC,EAAE,OAAO,CAAC;AAC7G,QAAQ,CAAC;AACT,QAAQ,YAAY,EAAE,wBAAwB,CAAC,OAAO,CAAC,KAAK,CAAC;AAC7D,KAAK;AACL;AACA,SAAS,6BAA6B,CAAC,QAAQ,EAAE,iBAAiB,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE;AAC/G,IAAI,MAAM,OAAO,GAAG;AACpB,QAAQ,GAAG,wBAAwB,CAAC,QAAQ,EAAE,iBAAiB,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC;AAC7F,QAAQ,UAAU,EAAE,OAAO,CAAC,UAAU;AACtC,QAAQ,YAAY;AACpB,KAAK;AACL,IAAI,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU;AACzC,IAAI,IAAI,UAAU,IAAI,gBAAgB,IAAI,UAAU,EAAE;AACtD,QAAQ,MAAM,EAAE,CAAC,gBAAgB,GAAG,UAAU,EAAE,GAAG,eAAe,EAAE,GAAG,UAAU;AACjF,QAAQ,MAAM,eAAe,GAAG,UAAU,EAAE,KAAK,EAAE,EAAE,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC;AAC9E,QAAQ,IAAI,eAAe,EAAE;AAC7B,YAAY,OAAO,CAAC,eAAe,GAAG,eAAe,CAAC,OAAO;AAC7D,QAAQ;AACR;AACA;AACA,QAAQ,OAAO,CAAC,UAAU;AAC1B,YAAY,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,KAAK,CAAC,GAAG,SAAS,GAAG,eAAe;AACnF,IAAI;AACJ,IAAI,OAAO,OAAO;AAClB;AACO,SAAS,yBAAyB,CAAC,aAAa,EAAE,iBAAiB,EAAE,SAAS,EAAE;AACvF,IAAI,MAAM,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,aAAa;AAC1E,IAAI,IAAI,OAAO;AACf,IAAI,IAAI,OAAO,kBAAkB,KAAK,QAAQ,EAAE;AAChD,QAAQ,OAAO,GAAG;AAClB,YAAY,SAAS,EAAE,kBAAkB;AACzC;AACA;AACA;AACA,YAAY,IAAI,EAAE,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,iBAAiB;AACrD,SAAS;AACT,IAAI;AACJ,SAAS;AACT,QAAQ,OAAO,GAAG,EAAE,GAAG,kBAAkB,EAAE;AAC3C;AACA;AACA,QAAQ,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE;AAC3C,YAAY,OAAO,CAAC,IAAI,GAAG,iBAAiB;AAC5C,QAAQ;AACR,IAAI;AAIJ,IAAI,IAAI,MAAM,KAAK,OAAO,CAAC,SAAS,EAAE;AACtC,QAAQ,OAAO,CAAC,SAAS,GAAG,SAAS;AACrC,IAAI;AACJ,IAAI,OAAO,OAAO;AAClB;AACA,SAAS,wBAAwB,CAAC,KAAK,EAAE;AACzC,IAAI,OAAO,SAAS,YAAY,CAAC,QAAQ,EAAE,QAAQ,EAAE;AACrD,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE;AACpD,YAAY,MAAM,iBAAiB,CAAC,GAAG,CAAC;AACxC,QAAQ;AACR;AACA;AACA;AACA;AACA,QAAQ,IAAI,eAAe,CAAC,QAAQ,CAAC,IAAI,eAAe,CAAC,QAAQ,CAAC,EAAE;AACpE,YAAY,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,YAAY,CAAC;AACrE,YAAY,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,YAAY,CAAC;AACrE,YAAY,MAAM,WAAW,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK;AACjE,YAAY,IAAI,WAAW,EAAE;AAC7B,gBAAgB,OAAO,QAAQ;AAC/B,YAAY;AACZ,YAAY,IAAI,WAAW,CAAC,QAAQ,CAAC,IAAI,uBAAuB,CAAC,QAAQ,CAAC,EAAE;AAC5E;AACA;AACA;AACA,gBAAgB,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;AACrD,gBAAgB,OAAO,QAAQ;AAC/B,YAAY;AACZ,YAAY,IAAI,uBAAuB,CAAC,QAAQ,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,EAAE;AAC5E;AACA;AACA;AACA;AACA,gBAAgB,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,KAAK,CAAC;AACrD,gBAAgB,OAAO,QAAQ;AAC/B,YAAY;AACZ,YAAY,IAAI,uBAAuB,CAAC,QAAQ,CAAC;AACjD,gBAAgB,uBAAuB,CAAC,QAAQ,CAAC,EAAE;AACnD,gBAAgB,OAAO,EAAE,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE;AACnD,YAAY;AACZ,QAAQ;AACR,QAAQ,OAAO,QAAQ;AACvB,IAAI,CAAC;AACL;;;;","x_google_ignoreList":[0]}

package/dist/esm/node_modules/@apollo/client/cache/inmemory/reactiveVars.js

@@ -1,90 +0,0 @@
-import '../../../../optimism/lib/entry.js';
-import '../../../../optimism/lib/context.js';
-import { dep } from '../../../../optimism/lib/dep.js';
-import { Slot } from '../../../../@wry/context/lib/slot.js';
-import '../../../../@wry/context/lib/index.js';
-
-// Contextual Slot that acquires its value when custom read functions are
-// called in Policies#readField.
-const cacheSlot = new Slot();
-const cacheInfoMap = new WeakMap();
-function getCacheInfo(cache) {
-    let info = cacheInfoMap.get(cache);
-    if (!info) {
-        cacheInfoMap.set(cache, (info = {
-            vars: new Set(),
-            dep: dep(),
-        }));
-    }
-    return info;
-}
-function forgetCache(cache) {
-    getCacheInfo(cache).vars.forEach((rv) => rv.forgetCache(cache));
-}
-// Calling forgetCache(cache) serves to silence broadcasts and allows the
-// cache to be garbage collected. However, the varsByCache WeakMap
-// preserves the set of reactive variables that were previously associated
-// with this cache, which makes it possible to "recall" the cache at a
-// later time, by reattaching it to those variables. If the cache has been
-// garbage collected in the meantime, because it is no longer reachable,
-// you won't be able to call recallCache(cache), and the cache will
-// automatically disappear from the varsByCache WeakMap.
-function recallCache(cache) {
-    getCacheInfo(cache).vars.forEach((rv) => rv.attachCache(cache));
-}
-function makeVar(value) {
-    const caches = new Set();
-    const listeners = new Set();
-    const rv = function (newValue) {
-        if (arguments.length > 0) {
-            if (value !== newValue) {
-                value = newValue;
-                caches.forEach((cache) => {
-                    // Invalidate any fields with custom read functions that
-                    // consumed this variable, so query results involving those
-                    // fields will be recomputed the next time we read them.
-                    getCacheInfo(cache).dep.dirty(rv);
-                    // Broadcast changes to any caches that have previously read
-                    // from this variable.
-                    broadcast(cache);
-                });
-                // Finally, notify any listeners added via rv.onNextChange.
-                const oldListeners = Array.from(listeners);
-                listeners.clear();
-                oldListeners.forEach((listener) => listener(value));
-            }
-        }
-        else {
-            // When reading from the variable, obtain the current cache from
-            // context via cacheSlot. This isn't entirely foolproof, but it's
-            // the same system that powers varDep.
-            const cache = cacheSlot.getValue();
-            if (cache) {
-                attach(cache);
-                getCacheInfo(cache).dep(rv);
-            }
-        }
-        return value;
-    };
-    rv.onNextChange = (listener) => {
-        listeners.add(listener);
-        return () => {
-            listeners.delete(listener);
-        };
-    };
-    const attach = (rv.attachCache = (cache) => {
-        caches.add(cache);
-        getCacheInfo(cache).vars.add(rv);
-        return rv;
-    });
-    rv.forgetCache = (cache) => caches.delete(cache);
-    return rv;
-}
-function broadcast(cache) {
-    if (cache.broadcastWatches) {
-        cache.broadcastWatches();
-    }
-}
-
-export { cacheSlot, forgetCache, makeVar, recallCache };
-//# sourceMappingURL=reactiveVars.js.map

package/dist/esm/node_modules/@apollo/client/cache/inmemory/reactiveVars.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"reactiveVars.js","sources":["../../../../../../../node_modules/@apollo/client/cache/inmemory/reactiveVars.js"],"sourcesContent":["import { dep, Slot } from \"optimism\";\n// Contextual Slot that acquires its value when custom read functions are\n// called in Policies#readField.\nexport const cacheSlot = new Slot();\nconst cacheInfoMap = new WeakMap();\nfunction getCacheInfo(cache) {\n    let info = cacheInfoMap.get(cache);\n    if (!info) {\n        cacheInfoMap.set(cache, (info = {\n            vars: new Set(),\n            dep: dep(),\n        }));\n    }\n    return info;\n}\nexport function forgetCache(cache) {\n    getCacheInfo(cache).vars.forEach((rv) => rv.forgetCache(cache));\n}\n// Calling forgetCache(cache) serves to silence broadcasts and allows the\n// cache to be garbage collected. However, the varsByCache WeakMap\n// preserves the set of reactive variables that were previously associated\n// with this cache, which makes it possible to \"recall\" the cache at a\n// later time, by reattaching it to those variables. If the cache has been\n// garbage collected in the meantime, because it is no longer reachable,\n// you won't be able to call recallCache(cache), and the cache will\n// automatically disappear from the varsByCache WeakMap.\nexport function recallCache(cache) {\n    getCacheInfo(cache).vars.forEach((rv) => rv.attachCache(cache));\n}\nexport function makeVar(value) {\n    const caches = new Set();\n    const listeners = new Set();\n    const rv = function (newValue) {\n        if (arguments.length > 0) {\n            if (value !== newValue) {\n                value = newValue;\n                caches.forEach((cache) => {\n                    // Invalidate any fields with custom read functions that\n                    // consumed this variable, so query results involving those\n                    // fields will be recomputed the next time we read them.\n                    getCacheInfo(cache).dep.dirty(rv);\n                    // Broadcast changes to any caches that have previously read\n                    // from this variable.\n                    broadcast(cache);\n                });\n                // Finally, notify any listeners added via rv.onNextChange.\n                const oldListeners = Array.from(listeners);\n                listeners.clear();\n                oldListeners.forEach((listener) => listener(value));\n            }\n        }\n        else {\n            // When reading from the variable, obtain the current cache from\n            // context via cacheSlot. This isn't entirely foolproof, but it's\n            // the same system that powers varDep.\n            const cache = cacheSlot.getValue();\n            if (cache) {\n                attach(cache);\n                getCacheInfo(cache).dep(rv);\n            }\n        }\n        return value;\n    };\n    rv.onNextChange = (listener) => {\n        listeners.add(listener);\n        return () => {\n            listeners.delete(listener);\n        };\n    };\n    const attach = (rv.attachCache = (cache) => {\n        caches.add(cache);\n        getCacheInfo(cache).vars.add(rv);\n        return rv;\n    });\n    rv.forgetCache = (cache) => caches.delete(cache);\n    return rv;\n}\nfunction broadcast(cache) {\n    if (cache.broadcastWatches) {\n        cache.broadcastWatches();\n    }\n}\n//# sourceMappingURL=reactiveVars.js.map"],"names":[],"mappings":";;;;;;AACA;AACA;AACY,MAAC,SAAS,GAAG,IAAI,IAAI;AACjC,MAAM,YAAY,GAAG,IAAI,OAAO,EAAE;AAClC,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B,IAAI,IAAI,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC;AACtC,IAAI,IAAI,CAAC,IAAI,EAAE;AACf,QAAQ,YAAY,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,GAAG;AACxC,YAAY,IAAI,EAAE,IAAI,GAAG,EAAE;AAC3B,YAAY,GAAG,EAAE,GAAG,EAAE;AACtB,SAAS,EAAE;AACX,IAAI;AACJ,IAAI,OAAO,IAAI;AACf;AACO,SAAS,WAAW,CAAC,KAAK,EAAE;AACnC,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;AACnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,WAAW,CAAC,KAAK,EAAE;AACnC,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;AACnE;AACO,SAAS,OAAO,CAAC,KAAK,EAAE;AAC/B,IAAI,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE;AAC5B,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE;AAC/B,IAAI,MAAM,EAAE,GAAG,UAAU,QAAQ,EAAE;AACnC,QAAQ,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;AAClC,YAAY,IAAI,KAAK,KAAK,QAAQ,EAAE;AACpC,gBAAgB,KAAK,GAAG,QAAQ;AAChC,gBAAgB,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,KAAK;AAC1C;AACA;AACA;AACA,oBAAoB,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AACrD;AACA;AACA,oBAAoB,SAAS,CAAC,KAAK,CAAC;AACpC,gBAAgB,CAAC,CAAC;AAClB;AACA,gBAAgB,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;AAC1D,gBAAgB,SAAS,CAAC,KAAK,EAAE;AACjC,gBAAgB,YAAY,CAAC,OAAO,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,KAAK,CAAC,CAAC;AACnE,YAAY;AACZ,QAAQ;AACR,aAAa;AACb;AACA;AACA;AACA,YAAY,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,EAAE;AAC9C,YAAY,IAAI,KAAK,EAAE;AACvB,gBAAgB,MAAM,CAAC,KAAK,CAAC;AAC7B,gBAAgB,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;AAC3C,YAAY;AACZ,QAAQ;AACR,QAAQ,OAAO,KAAK;AACpB,IAAI,CAAC;AACL,IAAI,EAAE,CAAC,YAAY,GAAG,CAAC,QAAQ,KAAK;AACpC,QAAQ,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC;AAC/B,QAAQ,OAAO,MAAM;AACrB,YAAY,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC;AACtC,QAAQ,CAAC;AACT,IAAI,CAAC;AACL,IAAI,MAAM,MAAM,IAAI,EAAE,CAAC,WAAW,GAAG,CAAC,KAAK,KAAK;AAChD,QAAQ,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC;AACzB,QAAQ,YAAY,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACxC,QAAQ,OAAO,EAAE;AACjB,IAAI,CAAC,CAAC;AACN,IAAI,EAAE,CAAC,WAAW,GAAG,CAAC,KAAK,KAAK,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;AACpD,IAAI,OAAO,EAAE;AACb;AACA,SAAS,SAAS,CAAC,KAAK,EAAE;AAC1B,IAAI,IAAI,KAAK,CAAC,gBAAgB,EAAE;AAChC,QAAQ,KAAK,CAAC,gBAAgB,EAAE;AAChC,IAAI;AACJ;;;;","x_google_ignoreList":[0]}

package/dist/esm/node_modules/@apollo/client/cache/inmemory/readFromStore.js

@@ -1,284 +0,0 @@
-import { wrap } from '../../../../optimism/lib/index.js';
-import { isReference } from '../../utilities/graphql/storeUtils.js';
-import { addTypenameToDocument } from '../../utilities/graphql/transform.js';
-import { newInvariantError } from '../../utilities/invariant/index.js';
-import { MissingFieldError } from '../core/types/common.js';
-import { supportsResultCaching, maybeDependOnExistenceOfEntity } from './entityStore.js';
-import { extractFragmentContext } from './helpers.js';
-import { getDefaultValues } from '../../utilities/internal/getDefaultValues.js';
-import { getQueryDefinition } from '../../utilities/internal/getQueryDefinition.js';
-import { getMainDefinition } from '../../utilities/internal/getMainDefinition.js';
-import { getFragmentFromSelection } from '../../utilities/internal/getFragmentFromSelection.js';
-import { Kind } from '../../../../graphql/language/kinds.js';
-import { mergeDeepArray } from '../../utilities/internal/mergeDeepArray.js';
-import { cacheSizes } from '../../utilities/caching/sizes.js';
-import { canonicalStringify } from '../../utilities/internal/canonicalStringify.js';
-import { DeepMerger } from '../../utilities/internal/DeepMerger.js';
-import { shouldInclude } from '../../utilities/internal/shouldInclude.js';
-import { isField } from '../../utilities/internal/isField.js';
-import { resultKeyNameFromField } from '../../utilities/internal/resultKeyNameFromField.js';
-import { isArray } from '../../utilities/internal/isArray.js';
-import { makeReference } from '../../utilities/internal/makeReference.js';
-import { maybeDeepFreeze } from '../../utilities/internal/maybeDeepFreeze.js';
-
-function execSelectionSetKeyArgs(options) {
-    return [options.selectionSet, options.objectOrReference, options.context];
-}
-class StoreReader {
-    // cached version of executeSelectionSet
-    executeSelectionSet;
-    // cached version of executeSubSelectedArray
-    executeSubSelectedArray;
-    config;
-    knownResults = new WeakMap();
-    constructor(config) {
-        this.config = config;
-        // memoized functions in this class will be "garbage-collected"
-        // by recreating the whole `StoreReader` in
-        // `InMemoryCache.resetResultsCache`
-        // (triggered from `InMemoryCache.gc` with `resetResultCache: true`)
-        this.executeSelectionSet = wrap((options) => {
-            const peekArgs = execSelectionSetKeyArgs(options);
-            const other = this.executeSelectionSet.peek(...peekArgs);
-            if (other) {
-                // If we previously read this result with canonization enabled, we can
-                // return that canonized result as-is.
-                return other;
-            }
-            maybeDependOnExistenceOfEntity(options.context.store, options.enclosingRef.__ref);
-            // Finally, if we didn't find any useful previous results, run the real
-            // execSelectionSetImpl method with the given options.
-            return this.execSelectionSetImpl(options);
-        }, {
-            max: cacheSizes["inMemoryCache.executeSelectionSet"] ||
-                50000 /* defaultCacheSizes["inMemoryCache.executeSelectionSet"] */,
-            keyArgs: execSelectionSetKeyArgs,
-            // Note that the parameters of makeCacheKey are determined by the
-            // array returned by keyArgs.
-            makeCacheKey(selectionSet, parent, context) {
-                if (supportsResultCaching(context.store)) {
-                    return context.store.makeCacheKey(selectionSet, isReference(parent) ? parent.__ref : parent, context.varString);
-                }
-            },
-        });
-        this.executeSubSelectedArray = wrap((options) => {
-            maybeDependOnExistenceOfEntity(options.context.store, options.enclosingRef.__ref);
-            return this.execSubSelectedArrayImpl(options);
-        }, {
-            max: cacheSizes["inMemoryCache.executeSubSelectedArray"] ||
-                10000 /* defaultCacheSizes["inMemoryCache.executeSubSelectedArray"] */,
-            makeCacheKey({ field, array, context }) {
-                if (supportsResultCaching(context.store)) {
-                    return context.store.makeCacheKey(field, array, context.varString);
-                }
-            },
-        });
-    }
-    /**
-     * Given a store and a query, return as much of the result as possible and
-     * identify if any data was missing from the store.
-     */
-    diffQueryAgainstStore({ store, query, rootId = "ROOT_QUERY", variables, returnPartialData = true, }) {
-        const policies = this.config.cache.policies;
-        variables = {
-            ...getDefaultValues(getQueryDefinition(query)),
-            ...variables,
-        };
-        const rootRef = makeReference(rootId);
-        const execResult = this.executeSelectionSet({
-            selectionSet: getMainDefinition(query).selectionSet,
-            objectOrReference: rootRef,
-            enclosingRef: rootRef,
-            context: {
-                store,
-                query,
-                policies,
-                variables,
-                varString: canonicalStringify(variables),
-                ...extractFragmentContext(query, this.config.fragments),
-            },
-        });
-        let missing;
-        if (execResult.missing) {
-            missing = new MissingFieldError(firstMissing(execResult.missing), execResult.missing, query, variables);
-        }
-        const complete = !missing;
-        const { result } = execResult;
-        return {
-            result: complete ? result
-                : returnPartialData ?
-                    Object.keys(result).length === 0 ?
-                        null
-                        : result
-                    : null,
-            complete,
-            missing,
-        };
-    }
-    isFresh(result, parent, selectionSet, context) {
-        if (supportsResultCaching(context.store) &&
-            this.knownResults.get(result) === selectionSet) {
-            const latest = this.executeSelectionSet.peek(selectionSet, parent, context);
-            if (latest && result === latest.result) {
-                return true;
-            }
-        }
-        return false;
-    }
-    // Uncached version of executeSelectionSet.
-    execSelectionSetImpl({ selectionSet, objectOrReference, enclosingRef, context, }) {
-        if (isReference(objectOrReference) &&
-            !context.policies.rootTypenamesById[objectOrReference.__ref] &&
-            !context.store.has(objectOrReference.__ref)) {
-            return {
-                result: {},
-                missing: `Dangling reference to missing ${objectOrReference.__ref} object`,
-            };
-        }
-        const { variables, policies, store } = context;
-        const typename = store.getFieldValue(objectOrReference, "__typename");
-        const objectsToMerge = [];
-        let missing;
-        const missingMerger = new DeepMerger();
-        if (typeof typename === "string" && !policies.rootIdsByTypename[typename]) {
-            // Ensure we always include a default value for the __typename
-            // field, if we have one. Note that this field can be overridden by other
-            // merged objects.
-            objectsToMerge.push({ __typename: typename });
-        }
-        function handleMissing(result, resultName) {
-            if (result.missing) {
-                missing = missingMerger.merge(missing, {
-                    [resultName]: result.missing,
-                });
-            }
-            return result.result;
-        }
-        const workSet = new Set(selectionSet.selections);
-        workSet.forEach((selection) => {
-            // Omit fields with directives @skip(if: <truthy value>) or
-            // @include(if: <falsy value>).
-            if (!shouldInclude(selection, variables))
-                return;
-            if (isField(selection)) {
-                let fieldValue = policies.readField({
-                    fieldName: selection.name.value,
-                    field: selection,
-                    variables: context.variables,
-                    from: objectOrReference,
-                }, context);
-                const resultName = resultKeyNameFromField(selection);
-                if (fieldValue === void 0) {
-                    if (!addTypenameToDocument.added(selection)) {
-                        missing = missingMerger.merge(missing, {
-                            [resultName]: `Can't find field '${selection.name.value}' on ${isReference(objectOrReference) ?
-                                objectOrReference.__ref + " object"
-                                : "object " + JSON.stringify(objectOrReference, null, 2)}`,
-                        });
-                    }
-                }
-                else if (isArray(fieldValue)) {
-                    if (fieldValue.length > 0) {
-                        fieldValue = handleMissing(this.executeSubSelectedArray({
-                            field: selection,
-                            array: fieldValue,
-                            enclosingRef,
-                            context,
-                        }), resultName);
-                    }
-                }
-                else if (!selection.selectionSet) ;
-                else if (fieldValue != null) {
-                    // In this case, because we know the field has a selection set,
-                    // it must be trying to query a GraphQLObjectType, which is why
-                    // fieldValue must be != null.
-                    fieldValue = handleMissing(this.executeSelectionSet({
-                        selectionSet: selection.selectionSet,
-                        objectOrReference: fieldValue,
-                        enclosingRef: isReference(fieldValue) ? fieldValue : enclosingRef,
-                        context,
-                    }), resultName);
-                }
-                if (fieldValue !== void 0) {
-                    objectsToMerge.push({ [resultName]: fieldValue });
-                }
-            }
-            else {
-                const fragment = getFragmentFromSelection(selection, context.lookupFragment);
-                if (!fragment && selection.kind === Kind.FRAGMENT_SPREAD) {
-                    throw newInvariantError(107, selection.name.value);
-                }
-                if (fragment && policies.fragmentMatches(fragment, typename)) {
-                    fragment.selectionSet.selections.forEach(workSet.add, workSet);
-                }
-            }
-        });
-        const result = mergeDeepArray(objectsToMerge);
-        const finalResult = { result, missing };
-        const frozen = maybeDeepFreeze(finalResult);
-        // Store this result with its selection set so that we can quickly
-        // recognize it again in the StoreReader#isFresh method.
-        if (frozen.result) {
-            this.knownResults.set(frozen.result, selectionSet);
-        }
-        return frozen;
-    }
-    // Uncached version of executeSubSelectedArray.
-    execSubSelectedArrayImpl({ field, array, enclosingRef, context, }) {
-        let missing;
-        let missingMerger = new DeepMerger();
-        function handleMissing(childResult, i) {
-            if (childResult.missing) {
-                missing = missingMerger.merge(missing, { [i]: childResult.missing });
-            }
-            return childResult.result;
-        }
-        if (field.selectionSet) {
-            array = array.filter((item) => item === undefined || context.store.canRead(item));
-        }
-        array = array.map((item, i) => {
-            // null value in array
-            if (item === null) {
-                return null;
-            }
-            // This is a nested array, recurse
-            if (isArray(item)) {
-                return handleMissing(this.executeSubSelectedArray({
-                    field,
-                    array: item,
-                    enclosingRef,
-                    context,
-                }), i);
-            }
-            // This is an object, run the selection set on it
-            if (field.selectionSet) {
-                return handleMissing(this.executeSelectionSet({
-                    selectionSet: field.selectionSet,
-                    objectOrReference: item,
-                    enclosingRef: isReference(item) ? item : enclosingRef,
-                    context,
-                }), i);
-            }
-            return item;
-        });
-        return {
-            result: array,
-            missing,
-        };
-    }
-}
-function firstMissing(tree) {
-    try {
-        JSON.stringify(tree, (_, value) => {
-            if (typeof value === "string")
-                throw value;
-            return value;
-        });
-    }
-    catch (result) {
-        return result;
-    }
-}
-
-export { StoreReader };
-//# sourceMappingURL=readFromStore.js.map

package/dist/esm/node_modules/@apollo/client/cache/inmemory/readFromStore.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"readFromStore.js","sources":["../../../../../../../node_modules/@apollo/client/cache/inmemory/readFromStore.js"],"sourcesContent":["import { Kind } from \"graphql\";\nimport { wrap } from \"optimism\";\nimport { addTypenameToDocument, cacheSizes, canonicalStringify, isReference, } from \"@apollo/client/utilities\";\nimport { __DEV__ } from \"@apollo/client/utilities/environment\";\nimport { DeepMerger, getDefaultValues, getFragmentFromSelection, getMainDefinition, getQueryDefinition, isArray, isField, isNonNullObject, makeReference, maybeDeepFreeze, mergeDeepArray, resultKeyNameFromField, shouldInclude, } from \"@apollo/client/utilities/internal\";\nimport { invariant, newInvariantError, } from \"@apollo/client/utilities/invariant\";\nimport { MissingFieldError } from \"../core/types/common.js\";\nimport { maybeDependOnExistenceOfEntity, supportsResultCaching, } from \"./entityStore.js\";\nimport { extractFragmentContext, getTypenameFromStoreObject, } from \"./helpers.js\";\nfunction execSelectionSetKeyArgs(options) {\n    return [options.selectionSet, options.objectOrReference, options.context];\n}\nexport class StoreReader {\n    // cached version of executeSelectionSet\n    executeSelectionSet;\n    // cached version of executeSubSelectedArray\n    executeSubSelectedArray;\n    config;\n    knownResults = new WeakMap();\n    constructor(config) {\n        this.config = config;\n        // memoized functions in this class will be \"garbage-collected\"\n        // by recreating the whole `StoreReader` in\n        // `InMemoryCache.resetResultsCache`\n        // (triggered from `InMemoryCache.gc` with `resetResultCache: true`)\n        this.executeSelectionSet = wrap((options) => {\n            const peekArgs = execSelectionSetKeyArgs(options);\n            const other = this.executeSelectionSet.peek(...peekArgs);\n            if (other) {\n                // If we previously read this result with canonization enabled, we can\n                // return that canonized result as-is.\n                return other;\n            }\n            maybeDependOnExistenceOfEntity(options.context.store, options.enclosingRef.__ref);\n            // Finally, if we didn't find any useful previous results, run the real\n            // execSelectionSetImpl method with the given options.\n            return this.execSelectionSetImpl(options);\n        }, {\n            max: cacheSizes[\"inMemoryCache.executeSelectionSet\"] ||\n                50000 /* defaultCacheSizes[\"inMemoryCache.executeSelectionSet\"] */,\n            keyArgs: execSelectionSetKeyArgs,\n            // Note that the parameters of makeCacheKey are determined by the\n            // array returned by keyArgs.\n            makeCacheKey(selectionSet, parent, context) {\n                if (supportsResultCaching(context.store)) {\n                    return context.store.makeCacheKey(selectionSet, isReference(parent) ? parent.__ref : parent, context.varString);\n                }\n            },\n        });\n        this.executeSubSelectedArray = wrap((options) => {\n            maybeDependOnExistenceOfEntity(options.context.store, options.enclosingRef.__ref);\n            return this.execSubSelectedArrayImpl(options);\n        }, {\n            max: cacheSizes[\"inMemoryCache.executeSubSelectedArray\"] ||\n                10000 /* defaultCacheSizes[\"inMemoryCache.executeSubSelectedArray\"] */,\n            makeCacheKey({ field, array, context }) {\n                if (supportsResultCaching(context.store)) {\n                    return context.store.makeCacheKey(field, array, context.varString);\n                }\n            },\n        });\n    }\n    /**\n     * Given a store and a query, return as much of the result as possible and\n     * identify if any data was missing from the store.\n     */\n    diffQueryAgainstStore({ store, query, rootId = \"ROOT_QUERY\", variables, returnPartialData = true, }) {\n        const policies = this.config.cache.policies;\n        variables = {\n            ...getDefaultValues(getQueryDefinition(query)),\n            ...variables,\n        };\n        const rootRef = makeReference(rootId);\n        const execResult = this.executeSelectionSet({\n            selectionSet: getMainDefinition(query).selectionSet,\n            objectOrReference: rootRef,\n            enclosingRef: rootRef,\n            context: {\n                store,\n                query,\n                policies,\n                variables,\n                varString: canonicalStringify(variables),\n                ...extractFragmentContext(query, this.config.fragments),\n            },\n        });\n        let missing;\n        if (execResult.missing) {\n            missing = new MissingFieldError(firstMissing(execResult.missing), execResult.missing, query, variables);\n        }\n        const complete = !missing;\n        const { result } = execResult;\n        return {\n            result: complete ? result\n                : returnPartialData ?\n                    Object.keys(result).length === 0 ?\n                        null\n                        : result\n                    : null,\n            complete,\n            missing,\n        };\n    }\n    isFresh(result, parent, selectionSet, context) {\n        if (supportsResultCaching(context.store) &&\n            this.knownResults.get(result) === selectionSet) {\n            const latest = this.executeSelectionSet.peek(selectionSet, parent, context);\n            if (latest && result === latest.result) {\n                return true;\n            }\n        }\n        return false;\n    }\n    // Uncached version of executeSelectionSet.\n    execSelectionSetImpl({ selectionSet, objectOrReference, enclosingRef, context, }) {\n        if (isReference(objectOrReference) &&\n            !context.policies.rootTypenamesById[objectOrReference.__ref] &&\n            !context.store.has(objectOrReference.__ref)) {\n            return {\n                result: {},\n                missing: `Dangling reference to missing ${objectOrReference.__ref} object`,\n            };\n        }\n        const { variables, policies, store } = context;\n        const typename = store.getFieldValue(objectOrReference, \"__typename\");\n        const objectsToMerge = [];\n        let missing;\n        const missingMerger = new DeepMerger();\n        if (typeof typename === \"string\" && !policies.rootIdsByTypename[typename]) {\n            // Ensure we always include a default value for the __typename\n            // field, if we have one. Note that this field can be overridden by other\n            // merged objects.\n            objectsToMerge.push({ __typename: typename });\n        }\n        function handleMissing(result, resultName) {\n            if (result.missing) {\n                missing = missingMerger.merge(missing, {\n                    [resultName]: result.missing,\n                });\n            }\n            return result.result;\n        }\n        const workSet = new Set(selectionSet.selections);\n        workSet.forEach((selection) => {\n            // Omit fields with directives @skip(if: <truthy value>) or\n            // @include(if: <falsy value>).\n            if (!shouldInclude(selection, variables))\n                return;\n            if (isField(selection)) {\n                let fieldValue = policies.readField({\n                    fieldName: selection.name.value,\n                    field: selection,\n                    variables: context.variables,\n                    from: objectOrReference,\n                }, context);\n                const resultName = resultKeyNameFromField(selection);\n                if (fieldValue === void 0) {\n                    if (!addTypenameToDocument.added(selection)) {\n                        missing = missingMerger.merge(missing, {\n                            [resultName]: `Can't find field '${selection.name.value}' on ${isReference(objectOrReference) ?\n                                objectOrReference.__ref + \" object\"\n                                : \"object \" + JSON.stringify(objectOrReference, null, 2)}`,\n                        });\n                    }\n                }\n                else if (isArray(fieldValue)) {\n                    if (fieldValue.length > 0) {\n                        fieldValue = handleMissing(this.executeSubSelectedArray({\n                            field: selection,\n                            array: fieldValue,\n                            enclosingRef,\n                            context,\n                        }), resultName);\n                    }\n                }\n                else if (!selection.selectionSet) {\n                    // do nothing\n                }\n                else if (fieldValue != null) {\n                    // In this case, because we know the field has a selection set,\n                    // it must be trying to query a GraphQLObjectType, which is why\n                    // fieldValue must be != null.\n                    fieldValue = handleMissing(this.executeSelectionSet({\n                        selectionSet: selection.selectionSet,\n                        objectOrReference: fieldValue,\n                        enclosingRef: isReference(fieldValue) ? fieldValue : enclosingRef,\n                        context,\n                    }), resultName);\n                }\n                if (fieldValue !== void 0) {\n                    objectsToMerge.push({ [resultName]: fieldValue });\n                }\n            }\n            else {\n                const fragment = getFragmentFromSelection(selection, context.lookupFragment);\n                if (!fragment && selection.kind === Kind.FRAGMENT_SPREAD) {\n                    throw newInvariantError(107, selection.name.value);\n                }\n                if (fragment && policies.fragmentMatches(fragment, typename)) {\n                    fragment.selectionSet.selections.forEach(workSet.add, workSet);\n                }\n            }\n        });\n        const result = mergeDeepArray(objectsToMerge);\n        const finalResult = { result, missing };\n        const frozen = maybeDeepFreeze(finalResult);\n        // Store this result with its selection set so that we can quickly\n        // recognize it again in the StoreReader#isFresh method.\n        if (frozen.result) {\n            this.knownResults.set(frozen.result, selectionSet);\n        }\n        return frozen;\n    }\n    // Uncached version of executeSubSelectedArray.\n    execSubSelectedArrayImpl({ field, array, enclosingRef, context, }) {\n        let missing;\n        let missingMerger = new DeepMerger();\n        function handleMissing(childResult, i) {\n            if (childResult.missing) {\n                missing = missingMerger.merge(missing, { [i]: childResult.missing });\n            }\n            return childResult.result;\n        }\n        if (field.selectionSet) {\n            array = array.filter((item) => item === undefined || context.store.canRead(item));\n        }\n        array = array.map((item, i) => {\n            // null value in array\n            if (item === null) {\n                return null;\n            }\n            // This is a nested array, recurse\n            if (isArray(item)) {\n                return handleMissing(this.executeSubSelectedArray({\n                    field,\n                    array: item,\n                    enclosingRef,\n                    context,\n                }), i);\n            }\n            // This is an object, run the selection set on it\n            if (field.selectionSet) {\n                return handleMissing(this.executeSelectionSet({\n                    selectionSet: field.selectionSet,\n                    objectOrReference: item,\n                    enclosingRef: isReference(item) ? item : enclosingRef,\n                    context,\n                }), i);\n            }\n            if (__DEV__) {\n                assertSelectionSetForIdValue(context.store, field, item);\n            }\n            return item;\n        });\n        return {\n            result: array,\n            missing,\n        };\n    }\n}\nfunction firstMissing(tree) {\n    try {\n        JSON.stringify(tree, (_, value) => {\n            if (typeof value === \"string\")\n                throw value;\n            return value;\n        });\n    }\n    catch (result) {\n        return result;\n    }\n}\nfunction assertSelectionSetForIdValue(store, field, fieldValue) {\n    if (!field.selectionSet) {\n        const workSet = new Set([fieldValue]);\n        workSet.forEach((value) => {\n            if (isNonNullObject(value)) {\n                invariant(\n                    !isReference(value),\n                    108,\n                    getTypenameFromStoreObject(store, value),\n                    field.name.value\n                );\n                Object.values(value).forEach(workSet.add, workSet);\n            }\n        });\n    }\n}\n//# sourceMappingURL=readFromStore.js.map\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AASA,SAAS,uBAAuB,CAAC,OAAO,EAAE;AAC1C,IAAI,OAAO,CAAC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC,OAAO,CAAC;AAC7E;AACO,MAAM,WAAW,CAAC;AACzB;AACA,IAAI,mBAAmB;AACvB;AACA,IAAI,uBAAuB;AAC3B,IAAI,MAAM;AACV,IAAI,YAAY,GAAG,IAAI,OAAO,EAAE;AAChC,IAAI,WAAW,CAAC,MAAM,EAAE;AACxB,QAAQ,IAAI,CAAC,MAAM,GAAG,MAAM;AAC5B;AACA;AACA;AACA;AACA,QAAQ,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,CAAC,OAAO,KAAK;AACrD,YAAY,MAAM,QAAQ,GAAG,uBAAuB,CAAC,OAAO,CAAC;AAC7D,YAAY,MAAM,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;AACpE,YAAY,IAAI,KAAK,EAAE;AACvB;AACA;AACA,gBAAgB,OAAO,KAAK;AAC5B,YAAY;AACZ,YAAY,8BAA8B,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC;AAC7F;AACA;AACA,YAAY,OAAO,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC;AACrD,QAAQ,CAAC,EAAE;AACX,YAAY,GAAG,EAAE,UAAU,CAAC,mCAAmC,CAAC;AAChE,gBAAgB,KAAK;AACrB,YAAY,OAAO,EAAE,uBAAuB;AAC5C;AACA;AACA,YAAY,YAAY,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE;AACxD,gBAAgB,IAAI,qBAAqB,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AAC1D,oBAAoB,OAAO,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,MAAM,EAAE,OAAO,CAAC,SAAS,CAAC;AACnI,gBAAgB;AAChB,YAAY,CAAC;AACb,SAAS,CAAC;AACV,QAAQ,IAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,CAAC,OAAO,KAAK;AACzD,YAAY,8BAA8B,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC;AAC7F,YAAY,OAAO,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC;AACzD,QAAQ,CAAC,EAAE;AACX,YAAY,GAAG,EAAE,UAAU,CAAC,uCAAuC,CAAC;AACpE,gBAAgB,KAAK;AACrB,YAAY,YAAY,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE;AACpD,gBAAgB,IAAI,qBAAqB,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AAC1D,oBAAoB,OAAO,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC;AACtF,gBAAgB;AAChB,YAAY,CAAC;AACb,SAAS,CAAC;AACV,IAAI;AACJ;AACA;AACA;AACA;AACA,IAAI,qBAAqB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,YAAY,EAAE,SAAS,EAAE,iBAAiB,GAAG,IAAI,GAAG,EAAE;AACzG,QAAQ,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ;AACnD,QAAQ,SAAS,GAAG;AACpB,YAAY,GAAG,gBAAgB,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;AAC1D,YAAY,GAAG,SAAS;AACxB,SAAS;AACT,QAAQ,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC;AAC7C,QAAQ,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC;AACpD,YAAY,YAAY,EAAE,iBAAiB,CAAC,KAAK,CAAC,CAAC,YAAY;AAC/D,YAAY,iBAAiB,EAAE,OAAO;AACtC,YAAY,YAAY,EAAE,OAAO;AACjC,YAAY,OAAO,EAAE;AACrB,gBAAgB,KAAK;AACrB,gBAAgB,KAAK;AACrB,gBAAgB,QAAQ;AACxB,gBAAgB,SAAS;AACzB,gBAAgB,SAAS,EAAE,kBAAkB,CAAC,SAAS,CAAC;AACxD,gBAAgB,GAAG,sBAAsB,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;AACvE,aAAa;AACb,SAAS,CAAC;AACV,QAAQ,IAAI,OAAO;AACnB,QAAQ,IAAI,UAAU,CAAC,OAAO,EAAE;AAChC,YAAY,OAAO,GAAG,IAAI,iBAAiB,CAAC,YAAY,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC;AACnH,QAAQ;AACR,QAAQ,MAAM,QAAQ,GAAG,CAAC,OAAO;AACjC,QAAQ,MAAM,EAAE,MAAM,EAAE,GAAG,UAAU;AACrC,QAAQ,OAAO;AACf,YAAY,MAAM,EAAE,QAAQ,GAAG;AAC/B,kBAAkB,iBAAiB;AACnC,oBAAoB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC;AACpD,wBAAwB;AACxB,0BAA0B;AAC1B,sBAAsB,IAAI;AAC1B,YAAY,QAAQ;AACpB,YAAY,OAAO;AACnB,SAAS;AACT,IAAI;AACJ,IAAI,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE;AACnD,QAAQ,IAAI,qBAAqB,CAAC,OAAO,CAAC,KAAK,CAAC;AAChD,YAAY,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,YAAY,EAAE;AAC5D,YAAY,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,CAAC;AACvF,YAAY,IAAI,MAAM,IAAI,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE;AACpD,gBAAgB,OAAO,IAAI;AAC3B,YAAY;AACZ,QAAQ;AACR,QAAQ,OAAO,KAAK;AACpB,IAAI;AACJ;AACA,IAAI,oBAAoB,CAAC,EAAE,YAAY,EAAE,iBAAiB,EAAE,YAAY,EAAE,OAAO,GAAG,EAAE;AACtF,QAAQ,IAAI,WAAW,CAAC,iBAAiB,CAAC;AAC1C,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAC,iBAAiB,CAAC,KAAK,CAAC;AACxE,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAAE;AACzD,YAAY,OAAO;AACnB,gBAAgB,MAAM,EAAE,EAAE;AAC1B,gBAAgB,OAAO,EAAE,CAAC,8BAA8B,EAAE,iBAAiB,CAAC,KAAK,CAAC,OAAO,CAAC;AAC1F,aAAa;AACb,QAAQ;AACR,QAAQ,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,OAAO;AACtD,QAAQ,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,iBAAiB,EAAE,YAAY,CAAC;AAC7E,QAAQ,MAAM,cAAc,GAAG,EAAE;AACjC,QAAQ,IAAI,OAAO;AACnB,QAAQ,MAAM,aAAa,GAAG,IAAI,UAAU,EAAE;AAC9C,QAAQ,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE;AACnF;AACA;AACA;AACA,YAAY,cAAc,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AACzD,QAAQ;AACR,QAAQ,SAAS,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE;AACnD,YAAY,IAAI,MAAM,CAAC,OAAO,EAAE;AAChC,gBAAgB,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE;AACvD,oBAAoB,CAAC,UAAU,GAAG,MAAM,CAAC,OAAO;AAChD,iBAAiB,CAAC;AAClB,YAAY;AACZ,YAAY,OAAO,MAAM,CAAC,MAAM;AAChC,QAAQ;AACR,QAAQ,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,UAAU,CAAC;AACxD,QAAQ,OAAO,CAAC,OAAO,CAAC,CAAC,SAAS,KAAK;AACvC;AACA;AACA,YAAY,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,SAAS,CAAC;AACpD,gBAAgB;AAChB,YAAY,IAAI,OAAO,CAAC,SAAS,CAAC,EAAE;AACpC,gBAAgB,IAAI,UAAU,GAAG,QAAQ,CAAC,SAAS,CAAC;AACpD,oBAAoB,SAAS,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK;AACnD,oBAAoB,KAAK,EAAE,SAAS;AACpC,oBAAoB,SAAS,EAAE,OAAO,CAAC,SAAS;AAChD,oBAAoB,IAAI,EAAE,iBAAiB;AAC3C,iBAAiB,EAAE,OAAO,CAAC;AAC3B,gBAAgB,MAAM,UAAU,GAAG,sBAAsB,CAAC,SAAS,CAAC;AACpE,gBAAgB,IAAI,UAAU,KAAK,MAAM,EAAE;AAC3C,oBAAoB,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE;AACjE,wBAAwB,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE;AAC/D,4BAA4B,CAAC,UAAU,GAAG,CAAC,kBAAkB,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,WAAW,CAAC,iBAAiB,CAAC;AACzH,gCAAgC,iBAAiB,CAAC,KAAK,GAAG;AAC1D,kCAAkC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,iBAAiB,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;AAC1F,yBAAyB,CAAC;AAC1B,oBAAoB;AACpB,gBAAgB;AAChB,qBAAqB,IAAI,OAAO,CAAC,UAAU,CAAC,EAAE;AAC9C,oBAAoB,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;AAC/C,wBAAwB,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,uBAAuB,CAAC;AAChF,4BAA4B,KAAK,EAAE,SAAS;AAC5C,4BAA4B,KAAK,EAAE,UAAU;AAC7C,4BAA4B,YAAY;AACxC,4BAA4B,OAAO;AACnC,yBAAyB,CAAC,EAAE,UAAU,CAAC;AACvC,oBAAoB;AACpB,gBAAgB;AAChB,qBAAqB,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE;AAGlD,qBAAqB,IAAI,UAAU,IAAI,IAAI,EAAE;AAC7C;AACA;AACA;AACA,oBAAoB,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,mBAAmB,CAAC;AACxE,wBAAwB,YAAY,EAAE,SAAS,CAAC,YAAY;AAC5D,wBAAwB,iBAAiB,EAAE,UAAU;AACrD,wBAAwB,YAAY,EAAE,WAAW,CAAC,UAAU,CAAC,GAAG,UAAU,GAAG,YAAY;AACzF,wBAAwB,OAAO;AAC/B,qBAAqB,CAAC,EAAE,UAAU,CAAC;AACnC,gBAAgB;AAChB,gBAAgB,IAAI,UAAU,KAAK,MAAM,EAAE;AAC3C,oBAAoB,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,GAAG,UAAU,EAAE,CAAC;AACrE,gBAAgB;AAChB,YAAY;AACZ,iBAAiB;AACjB,gBAAgB,MAAM,QAAQ,GAAG,wBAAwB,CAAC,SAAS,EAAE,OAAO,CAAC,cAAc,CAAC;AAC5F,gBAAgB,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,EAAE;AAC1E,oBAAoB,MAAM,iBAAiB,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;AACtE,gBAAgB;AAChB,gBAAgB,IAAI,QAAQ,IAAI,QAAQ,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE;AAC9E,oBAAoB,QAAQ,CAAC,YAAY,CAAC,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC;AAClF,gBAAgB;AAChB,YAAY;AACZ,QAAQ,CAAC,CAAC;AACV,QAAQ,MAAM,MAAM,GAAG,cAAc,CAAC,cAAc,CAAC;AACrD,QAAQ,MAAM,WAAW,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE;AAC/C,QAAQ,MAAM,MAAM,GAAG,eAAe,CAAC,WAAW,CAAC;AACnD;AACA;AACA,QAAQ,IAAI,MAAM,CAAC,MAAM,EAAE;AAC3B,YAAY,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC;AAC9D,QAAQ;AACR,QAAQ,OAAO,MAAM;AACrB,IAAI;AACJ;AACA,IAAI,wBAAwB,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,OAAO,GAAG,EAAE;AACvE,QAAQ,IAAI,OAAO;AACnB,QAAQ,IAAI,aAAa,GAAG,IAAI,UAAU,EAAE;AAC5C,QAAQ,SAAS,aAAa,CAAC,WAAW,EAAE,CAAC,EAAE;AAC/C,YAAY,IAAI,WAAW,CAAC,OAAO,EAAE;AACrC,gBAAgB,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC;AACpF,YAAY;AACZ,YAAY,OAAO,WAAW,CAAC,MAAM;AACrC,QAAQ;AACR,QAAQ,IAAI,KAAK,CAAC,YAAY,EAAE;AAChC,YAAY,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,IAAI,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AAC7F,QAAQ;AACR,QAAQ,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK;AACvC;AACA,YAAY,IAAI,IAAI,KAAK,IAAI,EAAE;AAC/B,gBAAgB,OAAO,IAAI;AAC3B,YAAY;AACZ;AACA,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE;AAC/B,gBAAgB,OAAO,aAAa,CAAC,IAAI,CAAC,uBAAuB,CAAC;AAClE,oBAAoB,KAAK;AACzB,oBAAoB,KAAK,EAAE,IAAI;AAC/B,oBAAoB,YAAY;AAChC,oBAAoB,OAAO;AAC3B,iBAAiB,CAAC,EAAE,CAAC,CAAC;AACtB,YAAY;AACZ;AACA,YAAY,IAAI,KAAK,CAAC,YAAY,EAAE;AACpC,gBAAgB,OAAO,aAAa,CAAC,IAAI,CAAC,mBAAmB,CAAC;AAC9D,oBAAoB,YAAY,EAAE,KAAK,CAAC,YAAY;AACpD,oBAAoB,iBAAiB,EAAE,IAAI;AAC3C,oBAAoB,YAAY,EAAE,WAAW,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,YAAY;AACzE,oBAAoB,OAAO;AAC3B,iBAAiB,CAAC,EAAE,CAAC,CAAC;AACtB,YAAY;AAIZ,YAAY,OAAO,IAAI;AACvB,QAAQ,CAAC,CAAC;AACV,QAAQ,OAAO;AACf,YAAY,MAAM,EAAE,KAAK;AACzB,YAAY,OAAO;AACnB,SAAS;AACT,IAAI;AACJ;AACA,SAAS,YAAY,CAAC,IAAI,EAAE;AAC5B,IAAI,IAAI;AACR,QAAQ,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK;AAC3C,YAAY,IAAI,OAAO,KAAK,KAAK,QAAQ;AACzC,gBAAgB,MAAM,KAAK;AAC3B,YAAY,OAAO,KAAK;AACxB,QAAQ,CAAC,CAAC;AACV,IAAI;AACJ,IAAI,OAAO,MAAM,EAAE;AACnB,QAAQ,OAAO,MAAM;AACrB,IAAI;AACJ;;;;","x_google_ignoreList":[0]}