@graphql-inspector/action 3.1.0 → 3.2.0

package/index.mjs

@@ -1969,6 +1969,18 @@ function readName(lexer, start) {
   );
 }
 
+/**
+ * Configuration options to control parser behavior
+ */
+
+/**
+ * Given a GraphQL source, parses it into a Document.
+ * Throws GraphQLError if a syntax error is encountered.
+ */
+function parse(source, options) {
+  const parser = new Parser(source, options);
+  return parser.parseDocument();
+}
 /**
  * Given a string containing a GraphQL value (ex. `[42]`), parse the AST for
  * that value.
@@ -3688,6 +3700,85 @@ function visit(root, visitor, visitorKeys = QueryDocumentKeys) {
 
   return newRoot;
 }
+/**
+ * Creates a new visitor instance which delegates to many visitors to run in
+ * parallel. Each visitor will be visited for each node before moving on.
+ *
+ * If a prior visitor edits a node, no following visitors will see that node.
+ */
+
+function visitInParallel(visitors) {
+  const skipping = new Array(visitors.length).fill(null);
+  const mergedVisitor = Object.create(null);
+
+  for (const kind of Object.values(Kind)) {
+    let hasVisitor = false;
+    const enterList = new Array(visitors.length).fill(undefined);
+    const leaveList = new Array(visitors.length).fill(undefined);
+
+    for (let i = 0; i < visitors.length; ++i) {
+      const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);
+      hasVisitor || (hasVisitor = enter != null || leave != null);
+      enterList[i] = enter;
+      leaveList[i] = leave;
+    }
+
+    if (!hasVisitor) {
+      continue;
+    }
+
+    const mergedEnterLeave = {
+      enter(...args) {
+        const node = args[0];
+
+        for (let i = 0; i < visitors.length; i++) {
+          if (skipping[i] === null) {
+            var _enterList$i;
+
+            const result =
+              (_enterList$i = enterList[i]) === null || _enterList$i === void 0
+                ? void 0
+                : _enterList$i.apply(visitors[i], args);
+
+            if (result === false) {
+              skipping[i] = node;
+            } else if (result === BREAK) {
+              skipping[i] = BREAK;
+            } else if (result !== undefined) {
+              return result;
+            }
+          }
+        }
+      },
+
+      leave(...args) {
+        const node = args[0];
+
+        for (let i = 0; i < visitors.length; i++) {
+          if (skipping[i] === null) {
+            var _leaveList$i;
+
+            const result =
+              (_leaveList$i = leaveList[i]) === null || _leaveList$i === void 0
+                ? void 0
+                : _leaveList$i.apply(visitors[i], args);
+
+            if (result === BREAK) {
+              skipping[i] = BREAK;
+            } else if (result !== undefined && result !== false) {
+              return result;
+            }
+          } else if (skipping[i] === node) {
+            skipping[i] = null;
+          }
+        }
+      },
+    };
+    mergedVisitor[kind] = mergedEnterLeave;
+  }
+
+  return mergedVisitor;
+}
 /**
  * Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.
  */
@@ -4744,6 +4835,13 @@ function isLeafType(type) {
  * These types may describe the parent context of a selection set.
  */
 
+function isCompositeType(type) {
+  return isObjectType(type) || isInterfaceType(type) || isUnionType(type);
+}
+/**
+ * These types may describe the parent context of a selection set.
+ */
+
 function isAbstractType(type) {
   return isInterfaceType(type) || isUnionType(type);
 }
@@ -4851,6 +4949,11 @@ function assertNullableType(type) {
 
   return type;
 }
+function getNullableType(type) {
+  if (type) {
+    return isNonNullType(type) ? type.ofType : type;
+  }
+}
 function getNamedType(type) {
   if (type) {
     let unwrappedType = type;
@@ -5212,6 +5315,9 @@ function argsToArgsConfig(args) {
     }),
   );
 }
+function isRequiredArgument(arg) {
+  return isNonNullType(arg.type) && arg.defaultValue === undefined;
+}
 
 /**
  * Interface Type Definition
@@ -5669,6 +5775,90 @@ function defineInputFieldMap(config) {
   });
 }
 
+function isRequiredInputField(field) {
+  return isNonNullType(field.type) && field.defaultValue === undefined;
+}
+
+/**
+ * Provided a type and a super type, return true if the first type is either
+ * equal or a subset of the second super type (covariant).
+ */
+
+function isTypeSubTypeOf(schema, maybeSubType, superType) {
+  // Equivalent type is a valid subtype
+  if (maybeSubType === superType) {
+    return true;
+  } // If superType is non-null, maybeSubType must also be non-null.
+
+  if (isNonNullType(superType)) {
+    if (isNonNullType(maybeSubType)) {
+      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);
+    }
+
+    return false;
+  }
+
+  if (isNonNullType(maybeSubType)) {
+    // If superType is nullable, maybeSubType may be non-null or nullable.
+    return isTypeSubTypeOf(schema, maybeSubType.ofType, superType);
+  } // If superType type is a list, maybeSubType type must also be a list.
+
+  if (isListType(superType)) {
+    if (isListType(maybeSubType)) {
+      return isTypeSubTypeOf(schema, maybeSubType.ofType, superType.ofType);
+    }
+
+    return false;
+  }
+
+  if (isListType(maybeSubType)) {
+    // If superType is not a list, maybeSubType must also be not a list.
+    return false;
+  } // If superType type is an abstract type, check if it is super type of maybeSubType.
+  // Otherwise, the child type is not a valid subtype of the parent type.
+
+  return (
+    isAbstractType(superType) &&
+    (isInterfaceType(maybeSubType) || isObjectType(maybeSubType)) &&
+    schema.isSubType(superType, maybeSubType)
+  );
+}
+/**
+ * Provided two composite types, determine if they "overlap". Two composite
+ * types overlap when the Sets of possible concrete types for each intersect.
+ *
+ * This is often used to determine if a fragment of a given type could possibly
+ * be visited in a context of another type.
+ *
+ * This function is commutative.
+ */
+
+function doTypesOverlap(schema, typeA, typeB) {
+  // Equivalent types overlap
+  if (typeA === typeB) {
+    return true;
+  }
+
+  if (isAbstractType(typeA)) {
+    if (isAbstractType(typeB)) {
+      // If both types are abstract, then determine if there is any intersection
+      // between possible concrete types of each.
+      return schema
+        .getPossibleTypes(typeA)
+        .some((type) => schema.isSubType(typeB, type));
+    } // Determine if the latter type is a possible concrete type of the former.
+
+    return schema.isSubType(typeA, typeB);
+  }
+
+  if (isAbstractType(typeB)) {
+    // Determine if the former type is a possible concrete type of the latter.
+    return schema.isSubType(typeB, typeA);
+  } // Otherwise the types do not overlap.
+
+  return false;
+}
+
 /**
  * Returns true if the provided object is an Object (i.e. not a string literal)
  * and implements the Iterator protocol.
@@ -7195,6 +7385,166 @@ function collectReferencedTypes(type, typeSet) {
   return typeSet;
 }
 
+/**
+ * Given a Schema and an AST node describing a type, return a GraphQLType
+ * definition which applies to that type. For example, if provided the parsed
+ * AST node for `[User]`, a GraphQLList instance will be returned, containing
+ * the type called "User" found in the schema. If a type called "User" is not
+ * found in the schema, then undefined will be returned.
+ */
+
+function typeFromAST(schema, typeNode) {
+  let innerType;
+
+  if (typeNode.kind === Kind.LIST_TYPE) {
+    innerType = typeFromAST(schema, typeNode.type);
+    return innerType && new GraphQLList(innerType);
+  }
+
+  if (typeNode.kind === Kind.NON_NULL_TYPE) {
+    innerType = typeFromAST(schema, typeNode.type);
+    return innerType && new GraphQLNonNull(innerType);
+  } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')
+
+  if (typeNode.kind === Kind.NAMED_TYPE) {
+    return schema.getType(typeNode.name.value);
+  } // istanbul ignore next (Not reachable. All possible type nodes have been considered)
+
+   invariant(false, 'Unexpected type node: ' + inspect(typeNode));
+}
+
+function isExecutableDefinitionNode(node) {
+  return (
+    node.kind === Kind.OPERATION_DEFINITION ||
+    node.kind === Kind.FRAGMENT_DEFINITION
+  );
+}
+function isTypeSystemDefinitionNode(node) {
+  return (
+    node.kind === Kind.SCHEMA_DEFINITION ||
+    isTypeDefinitionNode(node) ||
+    node.kind === Kind.DIRECTIVE_DEFINITION
+  );
+}
+function isTypeDefinitionNode(node) {
+  return (
+    node.kind === Kind.SCALAR_TYPE_DEFINITION ||
+    node.kind === Kind.OBJECT_TYPE_DEFINITION ||
+    node.kind === Kind.INTERFACE_TYPE_DEFINITION ||
+    node.kind === Kind.UNION_TYPE_DEFINITION ||
+    node.kind === Kind.ENUM_TYPE_DEFINITION ||
+    node.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION
+  );
+}
+function isTypeSystemExtensionNode(node) {
+  return node.kind === Kind.SCHEMA_EXTENSION || isTypeExtensionNode(node);
+}
+function isTypeExtensionNode(node) {
+  return (
+    node.kind === Kind.SCALAR_TYPE_EXTENSION ||
+    node.kind === Kind.OBJECT_TYPE_EXTENSION ||
+    node.kind === Kind.INTERFACE_TYPE_EXTENSION ||
+    node.kind === Kind.UNION_TYPE_EXTENSION ||
+    node.kind === Kind.ENUM_TYPE_EXTENSION ||
+    node.kind === Kind.INPUT_OBJECT_TYPE_EXTENSION
+  );
+}
+
+/**
+ * Executable definitions
+ *
+ * A GraphQL document is only valid for execution if all definitions are either
+ * operation or fragment definitions.
+ *
+ * See https://spec.graphql.org/draft/#sec-Executable-Definitions
+ */
+function ExecutableDefinitionsRule(context) {
+  return {
+    Document(node) {
+      for (const definition of node.definitions) {
+        if (!isExecutableDefinitionNode(definition)) {
+          const defName =
+            definition.kind === Kind.SCHEMA_DEFINITION ||
+            definition.kind === Kind.SCHEMA_EXTENSION
+              ? 'schema'
+              : '"' + definition.name.value + '"';
+          context.reportError(
+            new GraphQLError(
+              `The ${defName} definition is not executable.`,
+              definition,
+            ),
+          );
+        }
+      }
+
+      return false;
+    },
+  };
+}
+
+/**
+ * Unique operation names
+ *
+ * A GraphQL document is only valid if all defined operations have unique names.
+ *
+ * See https://spec.graphql.org/draft/#sec-Operation-Name-Uniqueness
+ */
+function UniqueOperationNamesRule(context) {
+  const knownOperationNames = Object.create(null);
+  return {
+    OperationDefinition(node) {
+      const operationName = node.name;
+
+      if (operationName) {
+        if (knownOperationNames[operationName.value]) {
+          context.reportError(
+            new GraphQLError(
+              `There can be only one operation named "${operationName.value}".`,
+              [knownOperationNames[operationName.value], operationName],
+            ),
+          );
+        } else {
+          knownOperationNames[operationName.value] = operationName;
+        }
+      }
+
+      return false;
+    },
+
+    FragmentDefinition: () => false,
+  };
+}
+
+/**
+ * Lone anonymous operation
+ *
+ * A GraphQL document is only valid if when it contains an anonymous operation
+ * (the query short-hand) that it contains only that one operation definition.
+ *
+ * See https://spec.graphql.org/draft/#sec-Lone-Anonymous-Operation
+ */
+function LoneAnonymousOperationRule(context) {
+  let operationCount = 0;
+  return {
+    Document(node) {
+      operationCount = node.definitions.filter(
+        (definition) => definition.kind === Kind.OPERATION_DEFINITION,
+      ).length;
+    },
+
+    OperationDefinition(node) {
+      if (!node.name && operationCount > 1) {
+        context.reportError(
+          new GraphQLError(
+            'This anonymous operation must be the only defined operation.',
+            node,
+          ),
+        );
+      }
+    },
+  };
+}
+
 /**
  * Produces a JavaScript value given a GraphQL Value AST.
  *
@@ -7356,109 +7706,3397 @@ function isMissingVariable(valueNode, variables) {
 }
 
 /**
- * Build a GraphQLSchema for use by client tools.
+ * Prepares an object map of argument values given a list of argument
+ * definitions and list of argument AST nodes.
  *
- * Given the result of a client running the introspection query, creates and
- * returns a GraphQLSchema instance which can be then used with all graphql-js
- * tools, but cannot be used to execute a query, as introspection does not
- * represent the "resolver", "parse" or "serialize" functions or any other
- * server-internal mechanisms.
+ * Note: The returned value is a plain Object with a prototype, since it is
+ * exposed to user code. Care should be taken to not pull values from the
+ * Object prototype.
  *
- * This function expects a complete introspection result. Don't forget to check
- * the "errors" field of a server response before calling this function.
+ * @internal
  */
 
-function buildClientSchema(introspection, options) {
-  (isObjectLike(introspection) && isObjectLike(introspection.__schema)) ||
-    devAssert(
-      false,
-      `Invalid or incomplete introspection result. Ensure that you are passing "data" property of introspection response and no "errors" was returned alongside: ${inspect(
-        introspection,
-      )}.`,
-    ); // Get the schema from the introspection result.
+function getArgumentValues(def, node, variableValues) {
+  var _node$arguments;
 
-  const schemaIntrospection = introspection.__schema; // Iterate through all types, getting the type definition for each.
+  const coercedValues = {}; // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
 
-  const typeMap = keyValMap(
-    schemaIntrospection.types,
-    (typeIntrospection) => typeIntrospection.name,
-    (typeIntrospection) => buildType(typeIntrospection),
-  ); // Include standard types only if they are used.
+  const argumentNodes =
+    (_node$arguments = node.arguments) !== null && _node$arguments !== void 0
+      ? _node$arguments
+      : [];
+  const argNodeMap = keyMap(argumentNodes, (arg) => arg.name.value);
+
+  for (const argDef of def.args) {
+    const name = argDef.name;
+    const argType = argDef.type;
+    const argumentNode = argNodeMap[name];
+
+    if (!argumentNode) {
+      if (argDef.defaultValue !== undefined) {
+        coercedValues[name] = argDef.defaultValue;
+      } else if (isNonNullType(argType)) {
+        throw new GraphQLError(
+          `Argument "${name}" of required type "${inspect(argType)}" ` +
+            'was not provided.',
+          node,
+        );
+      }
 
-  for (const stdType of [...specifiedScalarTypes, ...introspectionTypes]) {
-    if (typeMap[stdType.name]) {
-      typeMap[stdType.name] = stdType;
+      continue;
     }
-  } // Get the root Query, Mutation, and Subscription types.
-
-  const queryType = schemaIntrospection.queryType
-    ? getObjectType(schemaIntrospection.queryType)
-    : null;
-  const mutationType = schemaIntrospection.mutationType
-    ? getObjectType(schemaIntrospection.mutationType)
-    : null;
-  const subscriptionType = schemaIntrospection.subscriptionType
-    ? getObjectType(schemaIntrospection.subscriptionType)
-    : null; // Get the directives supported by Introspection, assuming empty-set if
-  // directives were not queried for.
 
-  const directives = schemaIntrospection.directives
-    ? schemaIntrospection.directives.map(buildDirective)
-    : []; // Then produce and return a Schema with these types.
+    const valueNode = argumentNode.value;
+    let isNull = valueNode.kind === Kind.NULL;
 
-  return new GraphQLSchema({
-    description: schemaIntrospection.description,
-    query: queryType,
-    mutation: mutationType,
-    subscription: subscriptionType,
-    types: Object.values(typeMap),
-    directives,
-    assumeValid:
-      options === null || options === void 0 ? void 0 : options.assumeValid,
-  }); // Given a type reference in introspection, return the GraphQLType instance.
-  // preferring cached instances before building new instances.
+    if (valueNode.kind === Kind.VARIABLE) {
+      const variableName = valueNode.name.value;
 
-  function getType(typeRef) {
-    if (typeRef.kind === TypeKind.LIST) {
-      const itemRef = typeRef.ofType;
+      if (
+        variableValues == null ||
+        !hasOwnProperty(variableValues, variableName)
+      ) {
+        if (argDef.defaultValue !== undefined) {
+          coercedValues[name] = argDef.defaultValue;
+        } else if (isNonNullType(argType)) {
+          throw new GraphQLError(
+            `Argument "${name}" of required type "${inspect(argType)}" ` +
+              `was provided the variable "$${variableName}" which was not provided a runtime value.`,
+            valueNode,
+          );
+        }
 
-      if (!itemRef) {
-        throw new Error('Decorated type deeper than introspection query.');
+        continue;
       }
 
-      return new GraphQLList(getType(itemRef));
+      isNull = variableValues[variableName] == null;
     }
 
-    if (typeRef.kind === TypeKind.NON_NULL) {
-      const nullableRef = typeRef.ofType;
+    if (isNull && isNonNullType(argType)) {
+      throw new GraphQLError(
+        `Argument "${name}" of non-null type "${inspect(argType)}" ` +
+          'must not be null.',
+        valueNode,
+      );
+    }
 
-      if (!nullableRef) {
-        throw new Error('Decorated type deeper than introspection query.');
-      }
+    const coercedValue = valueFromAST(valueNode, argType, variableValues);
 
-      const nullableType = getType(nullableRef);
-      return new GraphQLNonNull(assertNullableType(nullableType));
+    if (coercedValue === undefined) {
+      // Note: ValuesOfCorrectTypeRule validation should catch this before
+      // execution. This is a runtime check to ensure execution does not
+      // continue with an invalid argument value.
+      throw new GraphQLError(
+        `Argument "${name}" has invalid value ${print(valueNode)}.`,
+        valueNode,
+      );
     }
 
-    return getNamedType(typeRef);
+    coercedValues[name] = coercedValue;
   }
 
-  function getNamedType(typeRef) {
-    const typeName = typeRef.name;
-
-    if (!typeName) {
-      throw new Error(`Unknown type reference: ${inspect(typeRef)}.`);
-    }
+  return coercedValues;
+}
+/**
+ * Prepares an object map of argument values given a directive definition
+ * and a AST node which may contain directives. Optionally also accepts a map
+ * of variable values.
+ *
+ * If the directive does not exist on the node, returns undefined.
+ *
+ * Note: The returned value is a plain Object with a prototype, since it is
+ * exposed to user code. Care should be taken to not pull values from the
+ * Object prototype.
+ */
 
-    const type = typeMap[typeName];
+function getDirectiveValues(directiveDef, node, variableValues) {
+  var _node$directives;
 
-    if (!type) {
-      throw new Error(
-        `Invalid or incomplete schema, unknown type: ${typeName}. Ensure that a full introspection query is used in order to build a client schema.`,
-      );
-    }
+  // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+  const directiveNode =
+    (_node$directives = node.directives) === null || _node$directives === void 0
+      ? void 0
+      : _node$directives.find(
+          (directive) => directive.name.value === directiveDef.name,
+        );
 
-    return type;
+  if (directiveNode) {
+    return getArgumentValues(directiveDef, directiveNode, variableValues);
+  }
+}
+
+function hasOwnProperty(obj, prop) {
+  return Object.prototype.hasOwnProperty.call(obj, prop);
+}
+
+/**
+ * Given a selectionSet, collect all of the fields and returns it at the end.
+ *
+ * CollectFields requires the "runtime type" of an object. For a field which
+ * returns an Interface or Union type, the "runtime type" will be the actual
+ * Object type returned by that field.
+ *
+ * @internal
+ */
+
+function collectFields(
+  schema,
+  fragments,
+  variableValues,
+  runtimeType,
+  selectionSet,
+) {
+  const fields = new Map();
+  collectFieldsImpl(
+    schema,
+    fragments,
+    variableValues,
+    runtimeType,
+    selectionSet,
+    fields,
+    new Set(),
+  );
+  return fields;
+}
+
+function collectFieldsImpl(
+  schema,
+  fragments,
+  variableValues,
+  runtimeType,
+  selectionSet,
+  fields,
+  visitedFragmentNames,
+) {
+  for (const selection of selectionSet.selections) {
+    switch (selection.kind) {
+      case Kind.FIELD: {
+        if (!shouldIncludeNode(variableValues, selection)) {
+          continue;
+        }
+
+        const name = getFieldEntryKey(selection);
+        const fieldList = fields.get(name);
+
+        if (fieldList !== undefined) {
+          fieldList.push(selection);
+        } else {
+          fields.set(name, [selection]);
+        }
+
+        break;
+      }
+
+      case Kind.INLINE_FRAGMENT: {
+        if (
+          !shouldIncludeNode(variableValues, selection) ||
+          !doesFragmentConditionMatch(schema, selection, runtimeType)
+        ) {
+          continue;
+        }
+
+        collectFieldsImpl(
+          schema,
+          fragments,
+          variableValues,
+          runtimeType,
+          selection.selectionSet,
+          fields,
+          visitedFragmentNames,
+        );
+        break;
+      }
+
+      case Kind.FRAGMENT_SPREAD: {
+        const fragName = selection.name.value;
+
+        if (
+          visitedFragmentNames.has(fragName) ||
+          !shouldIncludeNode(variableValues, selection)
+        ) {
+          continue;
+        }
+
+        visitedFragmentNames.add(fragName);
+        const fragment = fragments[fragName];
+
+        if (
+          !fragment ||
+          !doesFragmentConditionMatch(schema, fragment, runtimeType)
+        ) {
+          continue;
+        }
+
+        collectFieldsImpl(
+          schema,
+          fragments,
+          variableValues,
+          runtimeType,
+          fragment.selectionSet,
+          fields,
+          visitedFragmentNames,
+        );
+        break;
+      }
+    }
+  }
+}
+/**
+ * Determines if a field should be included based on the `@include` and `@skip`
+ * directives, where `@skip` has higher precedence than `@include`.
+ */
+
+function shouldIncludeNode(variableValues, node) {
+  const skip = getDirectiveValues(GraphQLSkipDirective, node, variableValues);
+
+  if ((skip === null || skip === void 0 ? void 0 : skip.if) === true) {
+    return false;
+  }
+
+  const include = getDirectiveValues(
+    GraphQLIncludeDirective,
+    node,
+    variableValues,
+  );
+
+  if (
+    (include === null || include === void 0 ? void 0 : include.if) === false
+  ) {
+    return false;
+  }
+
+  return true;
+}
+/**
+ * Determines if a fragment is applicable to the given type.
+ */
+
+function doesFragmentConditionMatch(schema, fragment, type) {
+  const typeConditionNode = fragment.typeCondition;
+
+  if (!typeConditionNode) {
+    return true;
+  }
+
+  const conditionalType = typeFromAST(schema, typeConditionNode);
+
+  if (conditionalType === type) {
+    return true;
+  }
+
+  if (isAbstractType(conditionalType)) {
+    return schema.isSubType(conditionalType, type);
+  }
+
+  return false;
+}
+/**
+ * Implements the logic to compute the key of a given field's entry
+ */
+
+function getFieldEntryKey(node) {
+  return node.alias ? node.alias.value : node.name.value;
+}
+
+/**
+ * Subscriptions must only include a non-introspection field.
+ *
+ * A GraphQL subscription is valid only if it contains a single root field and
+ * that root field is not an introspection field.
+ *
+ * See https://spec.graphql.org/draft/#sec-Single-root-field
+ */
+function SingleFieldSubscriptionsRule(context) {
+  return {
+    OperationDefinition(node) {
+      if (node.operation === 'subscription') {
+        const schema = context.getSchema();
+        const subscriptionType = schema.getSubscriptionType();
+
+        if (subscriptionType) {
+          const operationName = node.name ? node.name.value : null;
+          const variableValues = Object.create(null);
+          const document = context.getDocument();
+          const fragments = Object.create(null);
+
+          for (const definition of document.definitions) {
+            if (definition.kind === Kind.FRAGMENT_DEFINITION) {
+              fragments[definition.name.value] = definition;
+            }
+          }
+
+          const fields = collectFields(
+            schema,
+            fragments,
+            variableValues,
+            subscriptionType,
+            node.selectionSet,
+          );
+
+          if (fields.size > 1) {
+            const fieldSelectionLists = [...fields.values()];
+            const extraFieldSelectionLists = fieldSelectionLists.slice(1);
+            const extraFieldSelections = extraFieldSelectionLists.flat();
+            context.reportError(
+              new GraphQLError(
+                operationName != null
+                  ? `Subscription "${operationName}" must select only one top level field.`
+                  : 'Anonymous Subscription must select only one top level field.',
+                extraFieldSelections,
+              ),
+            );
+          }
+
+          for (const fieldNodes of fields.values()) {
+            const field = fieldNodes[0];
+            const fieldName = field.name.value;
+
+            if (fieldName.startsWith('__')) {
+              context.reportError(
+                new GraphQLError(
+                  operationName != null
+                    ? `Subscription "${operationName}" must not select an introspection top level field.`
+                    : 'Anonymous Subscription must not select an introspection top level field.',
+                  fieldNodes,
+                ),
+              );
+            }
+          }
+        }
+      }
+    },
+  };
+}
+
+/**
+ * Known type names
+ *
+ * A GraphQL document is only valid if referenced types (specifically
+ * variable definitions and fragment conditions) are defined by the type schema.
+ *
+ * See https://spec.graphql.org/draft/#sec-Fragment-Spread-Type-Existence
+ */
+function KnownTypeNamesRule(context) {
+  const schema = context.getSchema();
+  const existingTypesMap = schema ? schema.getTypeMap() : Object.create(null);
+  const definedTypes = Object.create(null);
+
+  for (const def of context.getDocument().definitions) {
+    if (isTypeDefinitionNode(def)) {
+      definedTypes[def.name.value] = true;
+    }
+  }
+
+  const typeNames = [
+    ...Object.keys(existingTypesMap),
+    ...Object.keys(definedTypes),
+  ];
+  return {
+    NamedType(node, _1, parent, _2, ancestors) {
+      const typeName = node.name.value;
+
+      if (!existingTypesMap[typeName] && !definedTypes[typeName]) {
+        var _ancestors$;
+
+        const definitionNode =
+          (_ancestors$ = ancestors[2]) !== null && _ancestors$ !== void 0
+            ? _ancestors$
+            : parent;
+        const isSDL = definitionNode != null && isSDLNode(definitionNode);
+
+        if (isSDL && standardTypeNames.includes(typeName)) {
+          return;
+        }
+
+        const suggestedTypes = suggestionList(
+          typeName,
+          isSDL ? standardTypeNames.concat(typeNames) : typeNames,
+        );
+        context.reportError(
+          new GraphQLError(
+            `Unknown type "${typeName}".` + didYouMean(suggestedTypes),
+            node,
+          ),
+        );
+      }
+    },
+  };
+}
+const standardTypeNames = [...specifiedScalarTypes, ...introspectionTypes].map(
+  (type) => type.name,
+);
+
+function isSDLNode(value) {
+  return (
+    'kind' in value &&
+    (isTypeSystemDefinitionNode(value) || isTypeSystemExtensionNode(value))
+  );
+}
+
+/**
+ * Fragments on composite type
+ *
+ * Fragments use a type condition to determine if they apply, since fragments
+ * can only be spread into a composite type (object, interface, or union), the
+ * type condition must also be a composite type.
+ *
+ * See https://spec.graphql.org/draft/#sec-Fragments-On-Composite-Types
+ */
+function FragmentsOnCompositeTypesRule(context) {
+  return {
+    InlineFragment(node) {
+      const typeCondition = node.typeCondition;
+
+      if (typeCondition) {
+        const type = typeFromAST(context.getSchema(), typeCondition);
+
+        if (type && !isCompositeType(type)) {
+          const typeStr = print(typeCondition);
+          context.reportError(
+            new GraphQLError(
+              `Fragment cannot condition on non composite type "${typeStr}".`,
+              typeCondition,
+            ),
+          );
+        }
+      }
+    },
+
+    FragmentDefinition(node) {
+      const type = typeFromAST(context.getSchema(), node.typeCondition);
+
+      if (type && !isCompositeType(type)) {
+        const typeStr = print(node.typeCondition);
+        context.reportError(
+          new GraphQLError(
+            `Fragment "${node.name.value}" cannot condition on non composite type "${typeStr}".`,
+            node.typeCondition,
+          ),
+        );
+      }
+    },
+  };
+}
+
+/**
+ * Variables are input types
+ *
+ * A GraphQL operation is only valid if all the variables it defines are of
+ * input types (scalar, enum, or input object).
+ *
+ * See https://spec.graphql.org/draft/#sec-Variables-Are-Input-Types
+ */
+function VariablesAreInputTypesRule(context) {
+  return {
+    VariableDefinition(node) {
+      const type = typeFromAST(context.getSchema(), node.type);
+
+      if (type !== undefined && !isInputType(type)) {
+        const variableName = node.variable.name.value;
+        const typeName = print(node.type);
+        context.reportError(
+          new GraphQLError(
+            `Variable "$${variableName}" cannot be non-input type "${typeName}".`,
+            node.type,
+          ),
+        );
+      }
+    },
+  };
+}
+
+/**
+ * Scalar leafs
+ *
+ * A GraphQL document is valid only if all leaf fields (fields without
+ * sub selections) are of scalar or enum types.
+ */
+function ScalarLeafsRule(context) {
+  return {
+    Field(node) {
+      const type = context.getType();
+      const selectionSet = node.selectionSet;
+
+      if (type) {
+        if (isLeafType(getNamedType(type))) {
+          if (selectionSet) {
+            const fieldName = node.name.value;
+            const typeStr = inspect(type);
+            context.reportError(
+              new GraphQLError(
+                `Field "${fieldName}" must not have a selection since type "${typeStr}" has no subfields.`,
+                selectionSet,
+              ),
+            );
+          }
+        } else if (!selectionSet) {
+          const fieldName = node.name.value;
+          const typeStr = inspect(type);
+          context.reportError(
+            new GraphQLError(
+              `Field "${fieldName}" of type "${typeStr}" must have a selection of subfields. Did you mean "${fieldName} { ... }"?`,
+              node,
+            ),
+          );
+        }
+      }
+    },
+  };
+}
+
+/**
+ * Fields on correct type
+ *
+ * A GraphQL document is only valid if all fields selected are defined by the
+ * parent type, or are an allowed meta field such as __typename.
+ *
+ * See https://spec.graphql.org/draft/#sec-Field-Selections
+ */
+function FieldsOnCorrectTypeRule(context) {
+  return {
+    Field(node) {
+      const type = context.getParentType();
+
+      if (type) {
+        const fieldDef = context.getFieldDef();
+
+        if (!fieldDef) {
+          // This field doesn't exist, lets look for suggestions.
+          const schema = context.getSchema();
+          const fieldName = node.name.value; // First determine if there are any suggested types to condition on.
+
+          let suggestion = didYouMean(
+            'to use an inline fragment on',
+            getSuggestedTypeNames(schema, type, fieldName),
+          ); // If there are no suggested types, then perhaps this was a typo?
+
+          if (suggestion === '') {
+            suggestion = didYouMean(getSuggestedFieldNames(type, fieldName));
+          } // Report an error, including helpful suggestions.
+
+          context.reportError(
+            new GraphQLError(
+              `Cannot query field "${fieldName}" on type "${type.name}".` +
+                suggestion,
+              node,
+            ),
+          );
+        }
+      }
+    },
+  };
+}
+/**
+ * Go through all of the implementations of type, as well as the interfaces that
+ * they implement. If any of those types include the provided field, suggest them,
+ * sorted by how often the type is referenced.
+ */
+
+function getSuggestedTypeNames(schema, type, fieldName) {
+  if (!isAbstractType(type)) {
+    // Must be an Object type, which does not have possible fields.
+    return [];
+  }
+
+  const suggestedTypes = new Set();
+  const usageCount = Object.create(null);
+
+  for (const possibleType of schema.getPossibleTypes(type)) {
+    if (!possibleType.getFields()[fieldName]) {
+      continue;
+    } // This object type defines this field.
+
+    suggestedTypes.add(possibleType);
+    usageCount[possibleType.name] = 1;
+
+    for (const possibleInterface of possibleType.getInterfaces()) {
+      var _usageCount$possibleI;
+
+      if (!possibleInterface.getFields()[fieldName]) {
+        continue;
+      } // This interface type defines this field.
+
+      suggestedTypes.add(possibleInterface);
+      usageCount[possibleInterface.name] =
+        ((_usageCount$possibleI = usageCount[possibleInterface.name]) !==
+          null && _usageCount$possibleI !== void 0
+          ? _usageCount$possibleI
+          : 0) + 1;
+    }
+  }
+
+  return [...suggestedTypes]
+    .sort((typeA, typeB) => {
+      // Suggest both interface and object types based on how common they are.
+      const usageCountDiff = usageCount[typeB.name] - usageCount[typeA.name];
+
+      if (usageCountDiff !== 0) {
+        return usageCountDiff;
+      } // Suggest super types first followed by subtypes
+
+      if (isInterfaceType(typeA) && schema.isSubType(typeA, typeB)) {
+        return -1;
+      }
+
+      if (isInterfaceType(typeB) && schema.isSubType(typeB, typeA)) {
+        return 1;
+      }
+
+      return naturalCompare(typeA.name, typeB.name);
+    })
+    .map((x) => x.name);
+}
+/**
+ * For the field name provided, determine if there are any similar field names
+ * that may be the result of a typo.
+ */
+
+function getSuggestedFieldNames(type, fieldName) {
+  if (isObjectType(type) || isInterfaceType(type)) {
+    const possibleFieldNames = Object.keys(type.getFields());
+    return suggestionList(fieldName, possibleFieldNames);
+  } // Otherwise, must be a Union type, which does not define fields.
+
+  return [];
+}
+
+/**
+ * Unique fragment names
+ *
+ * A GraphQL document is only valid if all defined fragments have unique names.
+ *
+ * See https://spec.graphql.org/draft/#sec-Fragment-Name-Uniqueness
+ */
+function UniqueFragmentNamesRule(context) {
+  const knownFragmentNames = Object.create(null);
+  return {
+    OperationDefinition: () => false,
+
+    FragmentDefinition(node) {
+      const fragmentName = node.name.value;
+
+      if (knownFragmentNames[fragmentName]) {
+        context.reportError(
+          new GraphQLError(
+            `There can be only one fragment named "${fragmentName}".`,
+            [knownFragmentNames[fragmentName], node.name],
+          ),
+        );
+      } else {
+        knownFragmentNames[fragmentName] = node.name;
+      }
+
+      return false;
+    },
+  };
+}
+
+/**
+ * Known fragment names
+ *
+ * A GraphQL document is only valid if all `...Fragment` fragment spreads refer
+ * to fragments defined in the same document.
+ *
+ * See https://spec.graphql.org/draft/#sec-Fragment-spread-target-defined
+ */
+function KnownFragmentNamesRule(context) {
+  return {
+    FragmentSpread(node) {
+      const fragmentName = node.name.value;
+      const fragment = context.getFragment(fragmentName);
+
+      if (!fragment) {
+        context.reportError(
+          new GraphQLError(`Unknown fragment "${fragmentName}".`, node.name),
+        );
+      }
+    },
+  };
+}
+
+/**
+ * No unused fragments
+ *
+ * A GraphQL document is only valid if all fragment definitions are spread
+ * within operations, or spread within other fragments spread within operations.
+ *
+ * See https://spec.graphql.org/draft/#sec-Fragments-Must-Be-Used
+ */
+function NoUnusedFragmentsRule(context) {
+  const operationDefs = [];
+  const fragmentDefs = [];
+  return {
+    OperationDefinition(node) {
+      operationDefs.push(node);
+      return false;
+    },
+
+    FragmentDefinition(node) {
+      fragmentDefs.push(node);
+      return false;
+    },
+
+    Document: {
+      leave() {
+        const fragmentNameUsed = Object.create(null);
+
+        for (const operation of operationDefs) {
+          for (const fragment of context.getRecursivelyReferencedFragments(
+            operation,
+          )) {
+            fragmentNameUsed[fragment.name.value] = true;
+          }
+        }
+
+        for (const fragmentDef of fragmentDefs) {
+          const fragName = fragmentDef.name.value;
+
+          if (fragmentNameUsed[fragName] !== true) {
+            context.reportError(
+              new GraphQLError(
+                `Fragment "${fragName}" is never used.`,
+                fragmentDef,
+              ),
+            );
+          }
+        }
+      },
+    },
+  };
+}
+
+/**
+ * Possible fragment spread
+ *
+ * A fragment spread is only valid if the type condition could ever possibly
+ * be true: if there is a non-empty intersection of the possible parent types,
+ * and possible types which pass the type condition.
+ */
+function PossibleFragmentSpreadsRule(context) {
+  return {
+    InlineFragment(node) {
+      const fragType = context.getType();
+      const parentType = context.getParentType();
+
+      if (
+        isCompositeType(fragType) &&
+        isCompositeType(parentType) &&
+        !doTypesOverlap(context.getSchema(), fragType, parentType)
+      ) {
+        const parentTypeStr = inspect(parentType);
+        const fragTypeStr = inspect(fragType);
+        context.reportError(
+          new GraphQLError(
+            `Fragment cannot be spread here as objects of type "${parentTypeStr}" can never be of type "${fragTypeStr}".`,
+            node,
+          ),
+        );
+      }
+    },
+
+    FragmentSpread(node) {
+      const fragName = node.name.value;
+      const fragType = getFragmentType(context, fragName);
+      const parentType = context.getParentType();
+
+      if (
+        fragType &&
+        parentType &&
+        !doTypesOverlap(context.getSchema(), fragType, parentType)
+      ) {
+        const parentTypeStr = inspect(parentType);
+        const fragTypeStr = inspect(fragType);
+        context.reportError(
+          new GraphQLError(
+            `Fragment "${fragName}" cannot be spread here as objects of type "${parentTypeStr}" can never be of type "${fragTypeStr}".`,
+            node,
+          ),
+        );
+      }
+    },
+  };
+}
+
+function getFragmentType(context, name) {
+  const frag = context.getFragment(name);
+
+  if (frag) {
+    const type = typeFromAST(context.getSchema(), frag.typeCondition);
+
+    if (isCompositeType(type)) {
+      return type;
+    }
+  }
+}
+
+/**
+ * No fragment cycles
+ *
+ * The graph of fragment spreads must not form any cycles including spreading itself.
+ * Otherwise an operation could infinitely spread or infinitely execute on cycles in the underlying data.
+ *
+ * See https://spec.graphql.org/draft/#sec-Fragment-spreads-must-not-form-cycles
+ */
+function NoFragmentCyclesRule(context) {
+  // Tracks already visited fragments to maintain O(N) and to ensure that cycles
+  // are not redundantly reported.
+  const visitedFrags = Object.create(null); // Array of AST nodes used to produce meaningful errors
+
+  const spreadPath = []; // Position in the spread path
+
+  const spreadPathIndexByName = Object.create(null);
+  return {
+    OperationDefinition: () => false,
+
+    FragmentDefinition(node) {
+      detectCycleRecursive(node);
+      return false;
+    },
+  }; // This does a straight-forward DFS to find cycles.
+  // It does not terminate when a cycle was found but continues to explore
+  // the graph to find all possible cycles.
+
+  function detectCycleRecursive(fragment) {
+    if (visitedFrags[fragment.name.value]) {
+      return;
+    }
+
+    const fragmentName = fragment.name.value;
+    visitedFrags[fragmentName] = true;
+    const spreadNodes = context.getFragmentSpreads(fragment.selectionSet);
+
+    if (spreadNodes.length === 0) {
+      return;
+    }
+
+    spreadPathIndexByName[fragmentName] = spreadPath.length;
+
+    for (const spreadNode of spreadNodes) {
+      const spreadName = spreadNode.name.value;
+      const cycleIndex = spreadPathIndexByName[spreadName];
+      spreadPath.push(spreadNode);
+
+      if (cycleIndex === undefined) {
+        const spreadFragment = context.getFragment(spreadName);
+
+        if (spreadFragment) {
+          detectCycleRecursive(spreadFragment);
+        }
+      } else {
+        const cyclePath = spreadPath.slice(cycleIndex);
+        const viaPath = cyclePath
+          .slice(0, -1)
+          .map((s) => '"' + s.name.value + '"')
+          .join(', ');
+        context.reportError(
+          new GraphQLError(
+            `Cannot spread fragment "${spreadName}" within itself` +
+              (viaPath !== '' ? ` via ${viaPath}.` : '.'),
+            cyclePath,
+          ),
+        );
+      }
+
+      spreadPath.pop();
+    }
+
+    spreadPathIndexByName[fragmentName] = undefined;
+  }
+}
+
+/**
+ * Groups array items into a Map, given a function to produce grouping key.
+ */
+function groupBy(list, keyFn) {
+  const result = new Map();
+
+  for (const item of list) {
+    const key = keyFn(item);
+    const group = result.get(key);
+
+    if (group === undefined) {
+      result.set(key, [item]);
+    } else {
+      group.push(item);
+    }
+  }
+
+  return result;
+}
+
+/**
+ * Unique variable names
+ *
+ * A GraphQL operation is only valid if all its variables are uniquely named.
+ */
+function UniqueVariableNamesRule(context) {
+  return {
+    OperationDefinition(operationNode) {
+      var _operationNode$variab;
+
+      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+      const variableDefinitions =
+        (_operationNode$variab = operationNode.variableDefinitions) !== null &&
+        _operationNode$variab !== void 0
+          ? _operationNode$variab
+          : [];
+      const seenVariableDefinitions = groupBy(
+        variableDefinitions,
+        (node) => node.variable.name.value,
+      );
+
+      for (const [variableName, variableNodes] of seenVariableDefinitions) {
+        if (variableNodes.length > 1) {
+          context.reportError(
+            new GraphQLError(
+              `There can be only one variable named "$${variableName}".`,
+              variableNodes.map((node) => node.variable.name),
+            ),
+          );
+        }
+      }
+    },
+  };
+}
+
+/**
+ * No undefined variables
+ *
+ * A GraphQL operation is only valid if all variables encountered, both directly
+ * and via fragment spreads, are defined by that operation.
+ *
+ * See https://spec.graphql.org/draft/#sec-All-Variable-Uses-Defined
+ */
+function NoUndefinedVariablesRule(context) {
+  let variableNameDefined = Object.create(null);
+  return {
+    OperationDefinition: {
+      enter() {
+        variableNameDefined = Object.create(null);
+      },
+
+      leave(operation) {
+        const usages = context.getRecursiveVariableUsages(operation);
+
+        for (const { node } of usages) {
+          const varName = node.name.value;
+
+          if (variableNameDefined[varName] !== true) {
+            context.reportError(
+              new GraphQLError(
+                operation.name
+                  ? `Variable "$${varName}" is not defined by operation "${operation.name.value}".`
+                  : `Variable "$${varName}" is not defined.`,
+                [node, operation],
+              ),
+            );
+          }
+        }
+      },
+    },
+
+    VariableDefinition(node) {
+      variableNameDefined[node.variable.name.value] = true;
+    },
+  };
+}
+
+/**
+ * No unused variables
+ *
+ * A GraphQL operation is only valid if all variables defined by an operation
+ * are used, either directly or within a spread fragment.
+ *
+ * See https://spec.graphql.org/draft/#sec-All-Variables-Used
+ */
+function NoUnusedVariablesRule(context) {
+  let variableDefs = [];
+  return {
+    OperationDefinition: {
+      enter() {
+        variableDefs = [];
+      },
+
+      leave(operation) {
+        const variableNameUsed = Object.create(null);
+        const usages = context.getRecursiveVariableUsages(operation);
+
+        for (const { node } of usages) {
+          variableNameUsed[node.name.value] = true;
+        }
+
+        for (const variableDef of variableDefs) {
+          const variableName = variableDef.variable.name.value;
+
+          if (variableNameUsed[variableName] !== true) {
+            context.reportError(
+              new GraphQLError(
+                operation.name
+                  ? `Variable "$${variableName}" is never used in operation "${operation.name.value}".`
+                  : `Variable "$${variableName}" is never used.`,
+                variableDef,
+              ),
+            );
+          }
+        }
+      },
+    },
+
+    VariableDefinition(def) {
+      variableDefs.push(def);
+    },
+  };
+}
+
+/**
+ * Known directives
+ *
+ * A GraphQL document is only valid if all `@directives` are known by the
+ * schema and legally positioned.
+ *
+ * See https://spec.graphql.org/draft/#sec-Directives-Are-Defined
+ */
+function KnownDirectivesRule(context) {
+  const locationsMap = Object.create(null);
+  const schema = context.getSchema();
+  const definedDirectives = schema
+    ? schema.getDirectives()
+    : specifiedDirectives;
+
+  for (const directive of definedDirectives) {
+    locationsMap[directive.name] = directive.locations;
+  }
+
+  const astDefinitions = context.getDocument().definitions;
+
+  for (const def of astDefinitions) {
+    if (def.kind === Kind.DIRECTIVE_DEFINITION) {
+      locationsMap[def.name.value] = def.locations.map((name) => name.value);
+    }
+  }
+
+  return {
+    Directive(node, _key, _parent, _path, ancestors) {
+      const name = node.name.value;
+      const locations = locationsMap[name];
+
+      if (!locations) {
+        context.reportError(
+          new GraphQLError(`Unknown directive "@${name}".`, node),
+        );
+        return;
+      }
+
+      const candidateLocation = getDirectiveLocationForASTPath(ancestors);
+
+      if (candidateLocation && !locations.includes(candidateLocation)) {
+        context.reportError(
+          new GraphQLError(
+            `Directive "@${name}" may not be used on ${candidateLocation}.`,
+            node,
+          ),
+        );
+      }
+    },
+  };
+}
+
+function getDirectiveLocationForASTPath(ancestors) {
+  const appliedTo = ancestors[ancestors.length - 1];
+  'kind' in appliedTo || invariant(false);
+
+  switch (appliedTo.kind) {
+    case Kind.OPERATION_DEFINITION:
+      return getDirectiveLocationForOperation(appliedTo.operation);
+
+    case Kind.FIELD:
+      return DirectiveLocation.FIELD;
+
+    case Kind.FRAGMENT_SPREAD:
+      return DirectiveLocation.FRAGMENT_SPREAD;
+
+    case Kind.INLINE_FRAGMENT:
+      return DirectiveLocation.INLINE_FRAGMENT;
+
+    case Kind.FRAGMENT_DEFINITION:
+      return DirectiveLocation.FRAGMENT_DEFINITION;
+
+    case Kind.VARIABLE_DEFINITION:
+      return DirectiveLocation.VARIABLE_DEFINITION;
+
+    case Kind.SCHEMA_DEFINITION:
+    case Kind.SCHEMA_EXTENSION:
+      return DirectiveLocation.SCHEMA;
+
+    case Kind.SCALAR_TYPE_DEFINITION:
+    case Kind.SCALAR_TYPE_EXTENSION:
+      return DirectiveLocation.SCALAR;
+
+    case Kind.OBJECT_TYPE_DEFINITION:
+    case Kind.OBJECT_TYPE_EXTENSION:
+      return DirectiveLocation.OBJECT;
+
+    case Kind.FIELD_DEFINITION:
+      return DirectiveLocation.FIELD_DEFINITION;
+
+    case Kind.INTERFACE_TYPE_DEFINITION:
+    case Kind.INTERFACE_TYPE_EXTENSION:
+      return DirectiveLocation.INTERFACE;
+
+    case Kind.UNION_TYPE_DEFINITION:
+    case Kind.UNION_TYPE_EXTENSION:
+      return DirectiveLocation.UNION;
+
+    case Kind.ENUM_TYPE_DEFINITION:
+    case Kind.ENUM_TYPE_EXTENSION:
+      return DirectiveLocation.ENUM;
+
+    case Kind.ENUM_VALUE_DEFINITION:
+      return DirectiveLocation.ENUM_VALUE;
+
+    case Kind.INPUT_OBJECT_TYPE_DEFINITION:
+    case Kind.INPUT_OBJECT_TYPE_EXTENSION:
+      return DirectiveLocation.INPUT_OBJECT;
+
+    case Kind.INPUT_VALUE_DEFINITION: {
+      const parentNode = ancestors[ancestors.length - 3];
+      'kind' in parentNode || invariant(false);
+      return parentNode.kind === Kind.INPUT_OBJECT_TYPE_DEFINITION
+        ? DirectiveLocation.INPUT_FIELD_DEFINITION
+        : DirectiveLocation.ARGUMENT_DEFINITION;
+    }
+  }
+}
+
+function getDirectiveLocationForOperation(operation) {
+  switch (operation) {
+    case OperationTypeNode.QUERY:
+      return DirectiveLocation.QUERY;
+
+    case OperationTypeNode.MUTATION:
+      return DirectiveLocation.MUTATION;
+
+    case OperationTypeNode.SUBSCRIPTION:
+      return DirectiveLocation.SUBSCRIPTION;
+  } // istanbul ignore next (Not reachable. All possible types have been considered)
+
+   invariant(false, 'Unexpected operation: ' + inspect(operation));
+}
+
+/**
+ * Unique directive names per location
+ *
+ * A GraphQL document is only valid if all non-repeatable directives at
+ * a given location are uniquely named.
+ *
+ * See https://spec.graphql.org/draft/#sec-Directives-Are-Unique-Per-Location
+ */
+function UniqueDirectivesPerLocationRule(context) {
+  const uniqueDirectiveMap = Object.create(null);
+  const schema = context.getSchema();
+  const definedDirectives = schema
+    ? schema.getDirectives()
+    : specifiedDirectives;
+
+  for (const directive of definedDirectives) {
+    uniqueDirectiveMap[directive.name] = !directive.isRepeatable;
+  }
+
+  const astDefinitions = context.getDocument().definitions;
+
+  for (const def of astDefinitions) {
+    if (def.kind === Kind.DIRECTIVE_DEFINITION) {
+      uniqueDirectiveMap[def.name.value] = !def.repeatable;
+    }
+  }
+
+  const schemaDirectives = Object.create(null);
+  const typeDirectivesMap = Object.create(null);
+  return {
+    // Many different AST nodes may contain directives. Rather than listing
+    // them all, just listen for entering any node, and check to see if it
+    // defines any directives.
+    enter(node) {
+      if (!('directives' in node) || !node.directives) {
+        return;
+      }
+
+      let seenDirectives;
+
+      if (
+        node.kind === Kind.SCHEMA_DEFINITION ||
+        node.kind === Kind.SCHEMA_EXTENSION
+      ) {
+        seenDirectives = schemaDirectives;
+      } else if (isTypeDefinitionNode(node) || isTypeExtensionNode(node)) {
+        const typeName = node.name.value;
+        seenDirectives = typeDirectivesMap[typeName];
+
+        if (seenDirectives === undefined) {
+          typeDirectivesMap[typeName] = seenDirectives = Object.create(null);
+        }
+      } else {
+        seenDirectives = Object.create(null);
+      }
+
+      for (const directive of node.directives) {
+        const directiveName = directive.name.value;
+
+        if (uniqueDirectiveMap[directiveName]) {
+          if (seenDirectives[directiveName]) {
+            context.reportError(
+              new GraphQLError(
+                `The directive "@${directiveName}" can only be used once at this location.`,
+                [seenDirectives[directiveName], directive],
+              ),
+            );
+          } else {
+            seenDirectives[directiveName] = directive;
+          }
+        }
+      }
+    },
+  };
+}
+
+/**
+ * Known argument names
+ *
+ * A GraphQL field is only valid if all supplied arguments are defined by
+ * that field.
+ *
+ * See https://spec.graphql.org/draft/#sec-Argument-Names
+ * See https://spec.graphql.org/draft/#sec-Directives-Are-In-Valid-Locations
+ */
+function KnownArgumentNamesRule(context) {
+  return {
+    // eslint-disable-next-line new-cap
+    ...KnownArgumentNamesOnDirectivesRule(context),
+
+    Argument(argNode) {
+      const argDef = context.getArgument();
+      const fieldDef = context.getFieldDef();
+      const parentType = context.getParentType();
+
+      if (!argDef && fieldDef && parentType) {
+        const argName = argNode.name.value;
+        const knownArgsNames = fieldDef.args.map((arg) => arg.name);
+        const suggestions = suggestionList(argName, knownArgsNames);
+        context.reportError(
+          new GraphQLError(
+            `Unknown argument "${argName}" on field "${parentType.name}.${fieldDef.name}".` +
+              didYouMean(suggestions),
+            argNode,
+          ),
+        );
+      }
+    },
+  };
+}
+/**
+ * @internal
+ */
+
+function KnownArgumentNamesOnDirectivesRule(context) {
+  const directiveArgs = Object.create(null);
+  const schema = context.getSchema();
+  const definedDirectives = schema
+    ? schema.getDirectives()
+    : specifiedDirectives;
+
+  for (const directive of definedDirectives) {
+    directiveArgs[directive.name] = directive.args.map((arg) => arg.name);
+  }
+
+  const astDefinitions = context.getDocument().definitions;
+
+  for (const def of astDefinitions) {
+    if (def.kind === Kind.DIRECTIVE_DEFINITION) {
+      var _def$arguments;
+
+      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+      const argsNodes =
+        (_def$arguments = def.arguments) !== null && _def$arguments !== void 0
+          ? _def$arguments
+          : [];
+      directiveArgs[def.name.value] = argsNodes.map((arg) => arg.name.value);
+    }
+  }
+
+  return {
+    Directive(directiveNode) {
+      const directiveName = directiveNode.name.value;
+      const knownArgs = directiveArgs[directiveName];
+
+      if (directiveNode.arguments && knownArgs) {
+        for (const argNode of directiveNode.arguments) {
+          const argName = argNode.name.value;
+
+          if (!knownArgs.includes(argName)) {
+            const suggestions = suggestionList(argName, knownArgs);
+            context.reportError(
+              new GraphQLError(
+                `Unknown argument "${argName}" on directive "@${directiveName}".` +
+                  didYouMean(suggestions),
+                argNode,
+              ),
+            );
+          }
+        }
+      }
+
+      return false;
+    },
+  };
+}
+
+/**
+ * Unique argument names
+ *
+ * A GraphQL field or directive is only valid if all supplied arguments are
+ * uniquely named.
+ *
+ * See https://spec.graphql.org/draft/#sec-Argument-Names
+ */
+function UniqueArgumentNamesRule(context) {
+  return {
+    Field: checkArgUniqueness,
+    Directive: checkArgUniqueness,
+  };
+
+  function checkArgUniqueness(parentNode) {
+    var _parentNode$arguments;
+
+    // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+    const argumentNodes =
+      (_parentNode$arguments = parentNode.arguments) !== null &&
+      _parentNode$arguments !== void 0
+        ? _parentNode$arguments
+        : [];
+    const seenArgs = groupBy(argumentNodes, (arg) => arg.name.value);
+
+    for (const [argName, argNodes] of seenArgs) {
+      if (argNodes.length > 1) {
+        context.reportError(
+          new GraphQLError(
+            `There can be only one argument named "${argName}".`,
+            argNodes.map((node) => node.name),
+          ),
+        );
+      }
+    }
+  }
+}
+
+/**
+ * Value literals of correct type
+ *
+ * A GraphQL document is only valid if all value literals are of the type
+ * expected at their position.
+ *
+ * See https://spec.graphql.org/draft/#sec-Values-of-Correct-Type
+ */
+function ValuesOfCorrectTypeRule(context) {
+  return {
+    ListValue(node) {
+      // Note: TypeInfo will traverse into a list's item type, so look to the
+      // parent input type to check if it is a list.
+      const type = getNullableType(context.getParentInputType());
+
+      if (!isListType(type)) {
+        isValidValueNode(context, node);
+        return false; // Don't traverse further.
+      }
+    },
+
+    ObjectValue(node) {
+      const type = getNamedType(context.getInputType());
+
+      if (!isInputObjectType(type)) {
+        isValidValueNode(context, node);
+        return false; // Don't traverse further.
+      } // Ensure every required field exists.
+
+      const fieldNodeMap = keyMap(node.fields, (field) => field.name.value);
+
+      for (const fieldDef of Object.values(type.getFields())) {
+        const fieldNode = fieldNodeMap[fieldDef.name];
+
+        if (!fieldNode && isRequiredInputField(fieldDef)) {
+          const typeStr = inspect(fieldDef.type);
+          context.reportError(
+            new GraphQLError(
+              `Field "${type.name}.${fieldDef.name}" of required type "${typeStr}" was not provided.`,
+              node,
+            ),
+          );
+        }
+      }
+    },
+
+    ObjectField(node) {
+      const parentType = getNamedType(context.getParentInputType());
+      const fieldType = context.getInputType();
+
+      if (!fieldType && isInputObjectType(parentType)) {
+        const suggestions = suggestionList(
+          node.name.value,
+          Object.keys(parentType.getFields()),
+        );
+        context.reportError(
+          new GraphQLError(
+            `Field "${node.name.value}" is not defined by type "${parentType.name}".` +
+              didYouMean(suggestions),
+            node,
+          ),
+        );
+      }
+    },
+
+    NullValue(node) {
+      const type = context.getInputType();
+
+      if (isNonNullType(type)) {
+        context.reportError(
+          new GraphQLError(
+            `Expected value of type "${inspect(type)}", found ${print(node)}.`,
+            node,
+          ),
+        );
+      }
+    },
+
+    EnumValue: (node) => isValidValueNode(context, node),
+    IntValue: (node) => isValidValueNode(context, node),
+    FloatValue: (node) => isValidValueNode(context, node),
+    StringValue: (node) => isValidValueNode(context, node),
+    BooleanValue: (node) => isValidValueNode(context, node),
+  };
+}
+/**
+ * Any value literal may be a valid representation of a Scalar, depending on
+ * that scalar type.
+ */
+
+function isValidValueNode(context, node) {
+  // Report any error at the full type expected by the location.
+  const locationType = context.getInputType();
+
+  if (!locationType) {
+    return;
+  }
+
+  const type = getNamedType(locationType);
+
+  if (!isLeafType(type)) {
+    const typeStr = inspect(locationType);
+    context.reportError(
+      new GraphQLError(
+        `Expected value of type "${typeStr}", found ${print(node)}.`,
+        node,
+      ),
+    );
+    return;
+  } // Scalars and Enums determine if a literal value is valid via parseLiteral(),
+  // which may throw or return an invalid value to indicate failure.
+
+  try {
+    const parseResult = type.parseLiteral(
+      node,
+      undefined,
+      /* variables */
+    );
+
+    if (parseResult === undefined) {
+      const typeStr = inspect(locationType);
+      context.reportError(
+        new GraphQLError(
+          `Expected value of type "${typeStr}", found ${print(node)}.`,
+          node,
+        ),
+      );
+    }
+  } catch (error) {
+    const typeStr = inspect(locationType);
+
+    if (error instanceof GraphQLError) {
+      context.reportError(error);
+    } else {
+      context.reportError(
+        new GraphQLError(
+          `Expected value of type "${typeStr}", found ${print(node)}; ` +
+            error.message,
+          node,
+          undefined,
+          undefined,
+          undefined,
+          error,
+        ),
+      );
+    }
+  }
+}
+
+/**
+ * Provided required arguments
+ *
+ * A field or directive is only valid if all required (non-null without a
+ * default value) field arguments have been provided.
+ */
+function ProvidedRequiredArgumentsRule(context) {
+  return {
+    // eslint-disable-next-line new-cap
+    ...ProvidedRequiredArgumentsOnDirectivesRule(context),
+    Field: {
+      // Validate on leave to allow for deeper errors to appear first.
+      leave(fieldNode) {
+        var _fieldNode$arguments;
+
+        const fieldDef = context.getFieldDef();
+
+        if (!fieldDef) {
+          return false;
+        }
+
+        const providedArgs = new Set( // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+          (_fieldNode$arguments = fieldNode.arguments) === null ||
+          _fieldNode$arguments === void 0
+            ? void 0
+            : _fieldNode$arguments.map((arg) => arg.name.value),
+        );
+
+        for (const argDef of fieldDef.args) {
+          if (!providedArgs.has(argDef.name) && isRequiredArgument(argDef)) {
+            const argTypeStr = inspect(argDef.type);
+            context.reportError(
+              new GraphQLError(
+                `Field "${fieldDef.name}" argument "${argDef.name}" of type "${argTypeStr}" is required, but it was not provided.`,
+                fieldNode,
+              ),
+            );
+          }
+        }
+      },
+    },
+  };
+}
+/**
+ * @internal
+ */
+
+function ProvidedRequiredArgumentsOnDirectivesRule(context) {
+  var _schema$getDirectives;
+
+  const requiredArgsMap = Object.create(null);
+  const schema = context.getSchema();
+  const definedDirectives =
+    (_schema$getDirectives =
+      schema === null || schema === void 0
+        ? void 0
+        : schema.getDirectives()) !== null && _schema$getDirectives !== void 0
+      ? _schema$getDirectives
+      : specifiedDirectives;
+
+  for (const directive of definedDirectives) {
+    requiredArgsMap[directive.name] = keyMap(
+      directive.args.filter(isRequiredArgument),
+      (arg) => arg.name,
+    );
+  }
+
+  const astDefinitions = context.getDocument().definitions;
+
+  for (const def of astDefinitions) {
+    if (def.kind === Kind.DIRECTIVE_DEFINITION) {
+      var _def$arguments;
+
+      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+      const argNodes =
+        (_def$arguments = def.arguments) !== null && _def$arguments !== void 0
+          ? _def$arguments
+          : [];
+      requiredArgsMap[def.name.value] = keyMap(
+        argNodes.filter(isRequiredArgumentNode),
+        (arg) => arg.name.value,
+      );
+    }
+  }
+
+  return {
+    Directive: {
+      // Validate on leave to allow for deeper errors to appear first.
+      leave(directiveNode) {
+        const directiveName = directiveNode.name.value;
+        const requiredArgs = requiredArgsMap[directiveName];
+
+        if (requiredArgs) {
+          var _directiveNode$argume;
+
+          // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+          const argNodes =
+            (_directiveNode$argume = directiveNode.arguments) !== null &&
+            _directiveNode$argume !== void 0
+              ? _directiveNode$argume
+              : [];
+          const argNodeMap = new Set(argNodes.map((arg) => arg.name.value));
+
+          for (const [argName, argDef] of Object.entries(requiredArgs)) {
+            if (!argNodeMap.has(argName)) {
+              const argType = isType(argDef.type)
+                ? inspect(argDef.type)
+                : print(argDef.type);
+              context.reportError(
+                new GraphQLError(
+                  `Directive "@${directiveName}" argument "${argName}" of type "${argType}" is required, but it was not provided.`,
+                  directiveNode,
+                ),
+              );
+            }
+          }
+        }
+      },
+    },
+  };
+}
+
+function isRequiredArgumentNode(arg) {
+  return arg.type.kind === Kind.NON_NULL_TYPE && arg.defaultValue == null;
+}
+
+/**
+ * Variables in allowed position
+ *
+ * Variable usages must be compatible with the arguments they are passed to.
+ *
+ * See https://spec.graphql.org/draft/#sec-All-Variable-Usages-are-Allowed
+ */
+function VariablesInAllowedPositionRule(context) {
+  let varDefMap = Object.create(null);
+  return {
+    OperationDefinition: {
+      enter() {
+        varDefMap = Object.create(null);
+      },
+
+      leave(operation) {
+        const usages = context.getRecursiveVariableUsages(operation);
+
+        for (const { node, type, defaultValue } of usages) {
+          const varName = node.name.value;
+          const varDef = varDefMap[varName];
+
+          if (varDef && type) {
+            // A var type is allowed if it is the same or more strict (e.g. is
+            // a subtype of) than the expected type. It can be more strict if
+            // the variable type is non-null when the expected type is nullable.
+            // If both are list types, the variable item type can be more strict
+            // than the expected item type (contravariant).
+            const schema = context.getSchema();
+            const varType = typeFromAST(schema, varDef.type);
+
+            if (
+              varType &&
+              !allowedVariableUsage(
+                schema,
+                varType,
+                varDef.defaultValue,
+                type,
+                defaultValue,
+              )
+            ) {
+              const varTypeStr = inspect(varType);
+              const typeStr = inspect(type);
+              context.reportError(
+                new GraphQLError(
+                  `Variable "$${varName}" of type "${varTypeStr}" used in position expecting type "${typeStr}".`,
+                  [varDef, node],
+                ),
+              );
+            }
+          }
+        }
+      },
+    },
+
+    VariableDefinition(node) {
+      varDefMap[node.variable.name.value] = node;
+    },
+  };
+}
+/**
+ * Returns true if the variable is allowed in the location it was found,
+ * which includes considering if default values exist for either the variable
+ * or the location at which it is located.
+ */
+
+function allowedVariableUsage(
+  schema,
+  varType,
+  varDefaultValue,
+  locationType,
+  locationDefaultValue,
+) {
+  if (isNonNullType(locationType) && !isNonNullType(varType)) {
+    const hasNonNullVariableDefaultValue =
+      varDefaultValue != null && varDefaultValue.kind !== Kind.NULL;
+    const hasLocationDefaultValue = locationDefaultValue !== undefined;
+
+    if (!hasNonNullVariableDefaultValue && !hasLocationDefaultValue) {
+      return false;
+    }
+
+    const nullableLocationType = locationType.ofType;
+    return isTypeSubTypeOf(schema, varType, nullableLocationType);
+  }
+
+  return isTypeSubTypeOf(schema, varType, locationType);
+}
+
+function reasonMessage(reason) {
+  if (Array.isArray(reason)) {
+    return reason
+      .map(
+        ([responseName, subReason]) =>
+          `subfields "${responseName}" conflict because ` +
+          reasonMessage(subReason),
+      )
+      .join(' and ');
+  }
+
+  return reason;
+}
+/**
+ * Overlapping fields can be merged
+ *
+ * A selection set is only valid if all fields (including spreading any
+ * fragments) either correspond to distinct response names or can be merged
+ * without ambiguity.
+ *
+ * See https://spec.graphql.org/draft/#sec-Field-Selection-Merging
+ */
+
+function OverlappingFieldsCanBeMergedRule(context) {
+  // A memoization for when two fragments are compared "between" each other for
+  // conflicts. Two fragments may be compared many times, so memoizing this can
+  // dramatically improve the performance of this validator.
+  const comparedFragmentPairs = new PairSet(); // A cache for the "field map" and list of fragment names found in any given
+  // selection set. Selection sets may be asked for this information multiple
+  // times, so this improves the performance of this validator.
+
+  const cachedFieldsAndFragmentNames = new Map();
+  return {
+    SelectionSet(selectionSet) {
+      const conflicts = findConflictsWithinSelectionSet(
+        context,
+        cachedFieldsAndFragmentNames,
+        comparedFragmentPairs,
+        context.getParentType(),
+        selectionSet,
+      );
+
+      for (const [[responseName, reason], fields1, fields2] of conflicts) {
+        const reasonMsg = reasonMessage(reason);
+        context.reportError(
+          new GraphQLError(
+            `Fields "${responseName}" conflict because ${reasonMsg}. Use different aliases on the fields to fetch both if this was intentional.`,
+            fields1.concat(fields2),
+          ),
+        );
+      }
+    },
+  };
+}
+
+/**
+ * Algorithm:
+ *
+ * Conflicts occur when two fields exist in a query which will produce the same
+ * response name, but represent differing values, thus creating a conflict.
+ * The algorithm below finds all conflicts via making a series of comparisons
+ * between fields. In order to compare as few fields as possible, this makes
+ * a series of comparisons "within" sets of fields and "between" sets of fields.
+ *
+ * Given any selection set, a collection produces both a set of fields by
+ * also including all inline fragments, as well as a list of fragments
+ * referenced by fragment spreads.
+ *
+ * A) Each selection set represented in the document first compares "within" its
+ * collected set of fields, finding any conflicts between every pair of
+ * overlapping fields.
+ * Note: This is the *only time* that a the fields "within" a set are compared
+ * to each other. After this only fields "between" sets are compared.
+ *
+ * B) Also, if any fragment is referenced in a selection set, then a
+ * comparison is made "between" the original set of fields and the
+ * referenced fragment.
+ *
+ * C) Also, if multiple fragments are referenced, then comparisons
+ * are made "between" each referenced fragment.
+ *
+ * D) When comparing "between" a set of fields and a referenced fragment, first
+ * a comparison is made between each field in the original set of fields and
+ * each field in the the referenced set of fields.
+ *
+ * E) Also, if any fragment is referenced in the referenced selection set,
+ * then a comparison is made "between" the original set of fields and the
+ * referenced fragment (recursively referring to step D).
+ *
+ * F) When comparing "between" two fragments, first a comparison is made between
+ * each field in the first referenced set of fields and each field in the the
+ * second referenced set of fields.
+ *
+ * G) Also, any fragments referenced by the first must be compared to the
+ * second, and any fragments referenced by the second must be compared to the
+ * first (recursively referring to step F).
+ *
+ * H) When comparing two fields, if both have selection sets, then a comparison
+ * is made "between" both selection sets, first comparing the set of fields in
+ * the first selection set with the set of fields in the second.
+ *
+ * I) Also, if any fragment is referenced in either selection set, then a
+ * comparison is made "between" the other set of fields and the
+ * referenced fragment.
+ *
+ * J) Also, if two fragments are referenced in both selection sets, then a
+ * comparison is made "between" the two fragments.
+ *
+ */
+// Find all conflicts found "within" a selection set, including those found
+// via spreading in fragments. Called when visiting each SelectionSet in the
+// GraphQL Document.
+function findConflictsWithinSelectionSet(
+  context,
+  cachedFieldsAndFragmentNames,
+  comparedFragmentPairs,
+  parentType,
+  selectionSet,
+) {
+  const conflicts = [];
+  const [fieldMap, fragmentNames] = getFieldsAndFragmentNames(
+    context,
+    cachedFieldsAndFragmentNames,
+    parentType,
+    selectionSet,
+  ); // (A) Find find all conflicts "within" the fields of this selection set.
+  // Note: this is the *only place* `collectConflictsWithin` is called.
+
+  collectConflictsWithin(
+    context,
+    conflicts,
+    cachedFieldsAndFragmentNames,
+    comparedFragmentPairs,
+    fieldMap,
+  );
+
+  if (fragmentNames.length !== 0) {
+    // (B) Then collect conflicts between these fields and those represented by
+    // each spread fragment name found.
+    for (let i = 0; i < fragmentNames.length; i++) {
+      collectConflictsBetweenFieldsAndFragment(
+        context,
+        conflicts,
+        cachedFieldsAndFragmentNames,
+        comparedFragmentPairs,
+        false,
+        fieldMap,
+        fragmentNames[i],
+      ); // (C) Then compare this fragment with all other fragments found in this
+      // selection set to collect conflicts between fragments spread together.
+      // This compares each item in the list of fragment names to every other
+      // item in that same list (except for itself).
+
+      for (let j = i + 1; j < fragmentNames.length; j++) {
+        collectConflictsBetweenFragments(
+          context,
+          conflicts,
+          cachedFieldsAndFragmentNames,
+          comparedFragmentPairs,
+          false,
+          fragmentNames[i],
+          fragmentNames[j],
+        );
+      }
+    }
+  }
+
+  return conflicts;
+} // Collect all conflicts found between a set of fields and a fragment reference
+// including via spreading in any nested fragments.
+
+function collectConflictsBetweenFieldsAndFragment(
+  context,
+  conflicts,
+  cachedFieldsAndFragmentNames,
+  comparedFragmentPairs,
+  areMutuallyExclusive,
+  fieldMap,
+  fragmentName,
+) {
+  const fragment = context.getFragment(fragmentName);
+
+  if (!fragment) {
+    return;
+  }
+
+  const [fieldMap2, referencedFragmentNames] =
+    getReferencedFieldsAndFragmentNames(
+      context,
+      cachedFieldsAndFragmentNames,
+      fragment,
+    ); // Do not compare a fragment's fieldMap to itself.
+
+  if (fieldMap === fieldMap2) {
+    return;
+  } // (D) First collect any conflicts between the provided collection of fields
+  // and the collection of fields represented by the given fragment.
+
+  collectConflictsBetween(
+    context,
+    conflicts,
+    cachedFieldsAndFragmentNames,
+    comparedFragmentPairs,
+    areMutuallyExclusive,
+    fieldMap,
+    fieldMap2,
+  ); // (E) Then collect any conflicts between the provided collection of fields
+  // and any fragment names found in the given fragment.
+
+  for (const referencedFragmentName of referencedFragmentNames) {
+    collectConflictsBetweenFieldsAndFragment(
+      context,
+      conflicts,
+      cachedFieldsAndFragmentNames,
+      comparedFragmentPairs,
+      areMutuallyExclusive,
+      fieldMap,
+      referencedFragmentName,
+    );
+  }
+} // Collect all conflicts found between two fragments, including via spreading in
+// any nested fragments.
+
+function collectConflictsBetweenFragments(
+  context,
+  conflicts,
+  cachedFieldsAndFragmentNames,
+  comparedFragmentPairs,
+  areMutuallyExclusive,
+  fragmentName1,
+  fragmentName2,
+) {
+  // No need to compare a fragment to itself.
+  if (fragmentName1 === fragmentName2) {
+    return;
+  } // Memoize so two fragments are not compared for conflicts more than once.
+
+  if (
+    comparedFragmentPairs.has(
+      fragmentName1,
+      fragmentName2,
+      areMutuallyExclusive,
+    )
+  ) {
+    return;
+  }
+
+  comparedFragmentPairs.add(fragmentName1, fragmentName2, areMutuallyExclusive);
+  const fragment1 = context.getFragment(fragmentName1);
+  const fragment2 = context.getFragment(fragmentName2);
+
+  if (!fragment1 || !fragment2) {
+    return;
+  }
+
+  const [fieldMap1, referencedFragmentNames1] =
+    getReferencedFieldsAndFragmentNames(
+      context,
+      cachedFieldsAndFragmentNames,
+      fragment1,
+    );
+  const [fieldMap2, referencedFragmentNames2] =
+    getReferencedFieldsAndFragmentNames(
+      context,
+      cachedFieldsAndFragmentNames,
+      fragment2,
+    ); // (F) First, collect all conflicts between these two collections of fields
+  // (not including any nested fragments).
+
+  collectConflictsBetween(
+    context,
+    conflicts,
+    cachedFieldsAndFragmentNames,
+    comparedFragmentPairs,
+    areMutuallyExclusive,
+    fieldMap1,
+    fieldMap2,
+  ); // (G) Then collect conflicts between the first fragment and any nested
+  // fragments spread in the second fragment.
+
+  for (const referencedFragmentName2 of referencedFragmentNames2) {
+    collectConflictsBetweenFragments(
+      context,
+      conflicts,
+      cachedFieldsAndFragmentNames,
+      comparedFragmentPairs,
+      areMutuallyExclusive,
+      fragmentName1,
+      referencedFragmentName2,
+    );
+  } // (G) Then collect conflicts between the second fragment and any nested
+  // fragments spread in the first fragment.
+
+  for (const referencedFragmentName1 of referencedFragmentNames1) {
+    collectConflictsBetweenFragments(
+      context,
+      conflicts,
+      cachedFieldsAndFragmentNames,
+      comparedFragmentPairs,
+      areMutuallyExclusive,
+      referencedFragmentName1,
+      fragmentName2,
+    );
+  }
+} // Find all conflicts found between two selection sets, including those found
+// via spreading in fragments. Called when determining if conflicts exist
+// between the sub-fields of two overlapping fields.
+
+function findConflictsBetweenSubSelectionSets(
+  context,
+  cachedFieldsAndFragmentNames,
+  comparedFragmentPairs,
+  areMutuallyExclusive,
+  parentType1,
+  selectionSet1,
+  parentType2,
+  selectionSet2,
+) {
+  const conflicts = [];
+  const [fieldMap1, fragmentNames1] = getFieldsAndFragmentNames(
+    context,
+    cachedFieldsAndFragmentNames,
+    parentType1,
+    selectionSet1,
+  );
+  const [fieldMap2, fragmentNames2] = getFieldsAndFragmentNames(
+    context,
+    cachedFieldsAndFragmentNames,
+    parentType2,
+    selectionSet2,
+  ); // (H) First, collect all conflicts between these two collections of field.
+
+  collectConflictsBetween(
+    context,
+    conflicts,
+    cachedFieldsAndFragmentNames,
+    comparedFragmentPairs,
+    areMutuallyExclusive,
+    fieldMap1,
+    fieldMap2,
+  ); // (I) Then collect conflicts between the first collection of fields and
+  // those referenced by each fragment name associated with the second.
+
+  for (const fragmentName2 of fragmentNames2) {
+    collectConflictsBetweenFieldsAndFragment(
+      context,
+      conflicts,
+      cachedFieldsAndFragmentNames,
+      comparedFragmentPairs,
+      areMutuallyExclusive,
+      fieldMap1,
+      fragmentName2,
+    );
+  } // (I) Then collect conflicts between the second collection of fields and
+  // those referenced by each fragment name associated with the first.
+
+  for (const fragmentName1 of fragmentNames1) {
+    collectConflictsBetweenFieldsAndFragment(
+      context,
+      conflicts,
+      cachedFieldsAndFragmentNames,
+      comparedFragmentPairs,
+      areMutuallyExclusive,
+      fieldMap2,
+      fragmentName1,
+    );
+  } // (J) Also collect conflicts between any fragment names by the first and
+  // fragment names by the second. This compares each item in the first set of
+  // names to each item in the second set of names.
+
+  for (const fragmentName1 of fragmentNames1) {
+    for (const fragmentName2 of fragmentNames2) {
+      collectConflictsBetweenFragments(
+        context,
+        conflicts,
+        cachedFieldsAndFragmentNames,
+        comparedFragmentPairs,
+        areMutuallyExclusive,
+        fragmentName1,
+        fragmentName2,
+      );
+    }
+  }
+
+  return conflicts;
+} // Collect all Conflicts "within" one collection of fields.
+
+function collectConflictsWithin(
+  context,
+  conflicts,
+  cachedFieldsAndFragmentNames,
+  comparedFragmentPairs,
+  fieldMap,
+) {
+  // A field map is a keyed collection, where each key represents a response
+  // name and the value at that key is a list of all fields which provide that
+  // response name. For every response name, if there are multiple fields, they
+  // must be compared to find a potential conflict.
+  for (const [responseName, fields] of Object.entries(fieldMap)) {
+    // This compares every field in the list to every other field in this list
+    // (except to itself). If the list only has one item, nothing needs to
+    // be compared.
+    if (fields.length > 1) {
+      for (let i = 0; i < fields.length; i++) {
+        for (let j = i + 1; j < fields.length; j++) {
+          const conflict = findConflict(
+            context,
+            cachedFieldsAndFragmentNames,
+            comparedFragmentPairs,
+            false, // within one collection is never mutually exclusive
+            responseName,
+            fields[i],
+            fields[j],
+          );
+
+          if (conflict) {
+            conflicts.push(conflict);
+          }
+        }
+      }
+    }
+  }
+} // Collect all Conflicts between two collections of fields. This is similar to,
+// but different from the `collectConflictsWithin` function above. This check
+// assumes that `collectConflictsWithin` has already been called on each
+// provided collection of fields. This is true because this validator traverses
+// each individual selection set.
+
+function collectConflictsBetween(
+  context,
+  conflicts,
+  cachedFieldsAndFragmentNames,
+  comparedFragmentPairs,
+  parentFieldsAreMutuallyExclusive,
+  fieldMap1,
+  fieldMap2,
+) {
+  // A field map is a keyed collection, where each key represents a response
+  // name and the value at that key is a list of all fields which provide that
+  // response name. For any response name which appears in both provided field
+  // maps, each field from the first field map must be compared to every field
+  // in the second field map to find potential conflicts.
+  for (const [responseName, fields1] of Object.entries(fieldMap1)) {
+    const fields2 = fieldMap2[responseName];
+
+    if (fields2) {
+      for (const field1 of fields1) {
+        for (const field2 of fields2) {
+          const conflict = findConflict(
+            context,
+            cachedFieldsAndFragmentNames,
+            comparedFragmentPairs,
+            parentFieldsAreMutuallyExclusive,
+            responseName,
+            field1,
+            field2,
+          );
+
+          if (conflict) {
+            conflicts.push(conflict);
+          }
+        }
+      }
+    }
+  }
+} // Determines if there is a conflict between two particular fields, including
+// comparing their sub-fields.
+
+function findConflict(
+  context,
+  cachedFieldsAndFragmentNames,
+  comparedFragmentPairs,
+  parentFieldsAreMutuallyExclusive,
+  responseName,
+  field1,
+  field2,
+) {
+  const [parentType1, node1, def1] = field1;
+  const [parentType2, node2, def2] = field2; // If it is known that two fields could not possibly apply at the same
+  // time, due to the parent types, then it is safe to permit them to diverge
+  // in aliased field or arguments used as they will not present any ambiguity
+  // by differing.
+  // It is known that two parent types could never overlap if they are
+  // different Object types. Interface or Union types might overlap - if not
+  // in the current state of the schema, then perhaps in some future version,
+  // thus may not safely diverge.
+
+  const areMutuallyExclusive =
+    parentFieldsAreMutuallyExclusive ||
+    (parentType1 !== parentType2 &&
+      isObjectType(parentType1) &&
+      isObjectType(parentType2));
+
+  if (!areMutuallyExclusive) {
+    var _node1$arguments, _node2$arguments;
+
+    // Two aliases must refer to the same field.
+    const name1 = node1.name.value;
+    const name2 = node2.name.value;
+
+    if (name1 !== name2) {
+      return [
+        [responseName, `"${name1}" and "${name2}" are different fields`],
+        [node1],
+        [node2],
+      ];
+    } // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+
+    const args1 =
+      (_node1$arguments = node1.arguments) !== null &&
+      _node1$arguments !== void 0
+        ? _node1$arguments
+        : []; // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+
+    const args2 =
+      (_node2$arguments = node2.arguments) !== null &&
+      _node2$arguments !== void 0
+        ? _node2$arguments
+        : []; // Two field calls must have the same arguments.
+
+    if (!sameArguments(args1, args2)) {
+      return [
+        [responseName, 'they have differing arguments'],
+        [node1],
+        [node2],
+      ];
+    }
+  } // The return type for each field.
+
+  const type1 = def1 === null || def1 === void 0 ? void 0 : def1.type;
+  const type2 = def2 === null || def2 === void 0 ? void 0 : def2.type;
+
+  if (type1 && type2 && doTypesConflict(type1, type2)) {
+    return [
+      [
+        responseName,
+        `they return conflicting types "${inspect(type1)}" and "${inspect(
+          type2,
+        )}"`,
+      ],
+      [node1],
+      [node2],
+    ];
+  } // Collect and compare sub-fields. Use the same "visited fragment names" list
+  // for both collections so fields in a fragment reference are never
+  // compared to themselves.
+
+  const selectionSet1 = node1.selectionSet;
+  const selectionSet2 = node2.selectionSet;
+
+  if (selectionSet1 && selectionSet2) {
+    const conflicts = findConflictsBetweenSubSelectionSets(
+      context,
+      cachedFieldsAndFragmentNames,
+      comparedFragmentPairs,
+      areMutuallyExclusive,
+      getNamedType(type1),
+      selectionSet1,
+      getNamedType(type2),
+      selectionSet2,
+    );
+    return subfieldConflicts(conflicts, responseName, node1, node2);
+  }
+}
+
+function sameArguments(arguments1, arguments2) {
+  if (arguments1.length !== arguments2.length) {
+    return false;
+  }
+
+  return arguments1.every((argument1) => {
+    const argument2 = arguments2.find(
+      (argument) => argument.name.value === argument1.name.value,
+    );
+
+    if (!argument2) {
+      return false;
+    }
+
+    return sameValue(argument1.value, argument2.value);
+  });
+}
+
+function sameValue(value1, value2) {
+  return print(value1) === print(value2);
+} // Two types conflict if both types could not apply to a value simultaneously.
+// Composite types are ignored as their individual field types will be compared
+// later recursively. However List and Non-Null types must match.
+
+function doTypesConflict(type1, type2) {
+  if (isListType(type1)) {
+    return isListType(type2)
+      ? doTypesConflict(type1.ofType, type2.ofType)
+      : true;
+  }
+
+  if (isListType(type2)) {
+    return true;
+  }
+
+  if (isNonNullType(type1)) {
+    return isNonNullType(type2)
+      ? doTypesConflict(type1.ofType, type2.ofType)
+      : true;
+  }
+
+  if (isNonNullType(type2)) {
+    return true;
+  }
+
+  if (isLeafType(type1) || isLeafType(type2)) {
+    return type1 !== type2;
+  }
+
+  return false;
+} // Given a selection set, return the collection of fields (a mapping of response
+// name to field nodes and definitions) as well as a list of fragment names
+// referenced via fragment spreads.
+
+function getFieldsAndFragmentNames(
+  context,
+  cachedFieldsAndFragmentNames,
+  parentType,
+  selectionSet,
+) {
+  const cached = cachedFieldsAndFragmentNames.get(selectionSet);
+
+  if (cached) {
+    return cached;
+  }
+
+  const nodeAndDefs = Object.create(null);
+  const fragmentNames = Object.create(null);
+
+  _collectFieldsAndFragmentNames(
+    context,
+    parentType,
+    selectionSet,
+    nodeAndDefs,
+    fragmentNames,
+  );
+
+  const result = [nodeAndDefs, Object.keys(fragmentNames)];
+  cachedFieldsAndFragmentNames.set(selectionSet, result);
+  return result;
+} // Given a reference to a fragment, return the represented collection of fields
+// as well as a list of nested fragment names referenced via fragment spreads.
+
+function getReferencedFieldsAndFragmentNames(
+  context,
+  cachedFieldsAndFragmentNames,
+  fragment,
+) {
+  // Short-circuit building a type from the node if possible.
+  const cached = cachedFieldsAndFragmentNames.get(fragment.selectionSet);
+
+  if (cached) {
+    return cached;
+  }
+
+  const fragmentType = typeFromAST(context.getSchema(), fragment.typeCondition);
+  return getFieldsAndFragmentNames(
+    context,
+    cachedFieldsAndFragmentNames,
+    fragmentType,
+    fragment.selectionSet,
+  );
+}
+
+function _collectFieldsAndFragmentNames(
+  context,
+  parentType,
+  selectionSet,
+  nodeAndDefs,
+  fragmentNames,
+) {
+  for (const selection of selectionSet.selections) {
+    switch (selection.kind) {
+      case Kind.FIELD: {
+        const fieldName = selection.name.value;
+        let fieldDef;
+
+        if (isObjectType(parentType) || isInterfaceType(parentType)) {
+          fieldDef = parentType.getFields()[fieldName];
+        }
+
+        const responseName = selection.alias
+          ? selection.alias.value
+          : fieldName;
+
+        if (!nodeAndDefs[responseName]) {
+          nodeAndDefs[responseName] = [];
+        }
+
+        nodeAndDefs[responseName].push([parentType, selection, fieldDef]);
+        break;
+      }
+
+      case Kind.FRAGMENT_SPREAD:
+        fragmentNames[selection.name.value] = true;
+        break;
+
+      case Kind.INLINE_FRAGMENT: {
+        const typeCondition = selection.typeCondition;
+        const inlineFragmentType = typeCondition
+          ? typeFromAST(context.getSchema(), typeCondition)
+          : parentType;
+
+        _collectFieldsAndFragmentNames(
+          context,
+          inlineFragmentType,
+          selection.selectionSet,
+          nodeAndDefs,
+          fragmentNames,
+        );
+
+        break;
+      }
+    }
+  }
+} // Given a series of Conflicts which occurred between two sub-fields, generate
+// a single Conflict.
+
+function subfieldConflicts(conflicts, responseName, node1, node2) {
+  if (conflicts.length > 0) {
+    return [
+      [responseName, conflicts.map(([reason]) => reason)],
+      [node1, ...conflicts.map(([, fields1]) => fields1).flat()],
+      [node2, ...conflicts.map(([, , fields2]) => fields2).flat()],
+    ];
+  }
+}
+/**
+ * A way to keep track of pairs of things when the ordering of the pair does not matter.
+ */
+
+class PairSet {
+  constructor() {
+    this._data = new Map();
+  }
+
+  has(a, b, areMutuallyExclusive) {
+    var _this$_data$get;
+
+    const [key1, key2] = a < b ? [a, b] : [b, a];
+    const result =
+      (_this$_data$get = this._data.get(key1)) === null ||
+      _this$_data$get === void 0
+        ? void 0
+        : _this$_data$get.get(key2);
+
+    if (result === undefined) {
+      return false;
+    } // areMutuallyExclusive being false is a superset of being true, hence if
+    // we want to know if this PairSet "has" these two with no exclusivity,
+    // we have to ensure it was added as such.
+
+    return areMutuallyExclusive ? true : areMutuallyExclusive === result;
+  }
+
+  add(a, b, areMutuallyExclusive) {
+    const [key1, key2] = a < b ? [a, b] : [b, a];
+
+    const map = this._data.get(key1);
+
+    if (map === undefined) {
+      this._data.set(key1, new Map([[key2, areMutuallyExclusive]]));
+    } else {
+      map.set(key2, areMutuallyExclusive);
+    }
+  }
+}
+
+/**
+ * Unique input field names
+ *
+ * A GraphQL input object value is only valid if all supplied fields are
+ * uniquely named.
+ *
+ * See https://spec.graphql.org/draft/#sec-Input-Object-Field-Uniqueness
+ */
+function UniqueInputFieldNamesRule(context) {
+  const knownNameStack = [];
+  let knownNames = Object.create(null);
+  return {
+    ObjectValue: {
+      enter() {
+        knownNameStack.push(knownNames);
+        knownNames = Object.create(null);
+      },
+
+      leave() {
+        const prevKnownNames = knownNameStack.pop();
+        prevKnownNames || invariant(false);
+        knownNames = prevKnownNames;
+      },
+    },
+
+    ObjectField(node) {
+      const fieldName = node.name.value;
+
+      if (knownNames[fieldName]) {
+        context.reportError(
+          new GraphQLError(
+            `There can be only one input field named "${fieldName}".`,
+            [knownNames[fieldName], node.name],
+          ),
+        );
+      } else {
+        knownNames[fieldName] = node.name;
+      }
+    },
+  };
+}
+
+/**
+ * Lone Schema definition
+ *
+ * A GraphQL document is only valid if it contains only one schema definition.
+ */
+function LoneSchemaDefinitionRule(context) {
+  var _ref, _ref2, _oldSchema$astNode;
+
+  const oldSchema = context.getSchema();
+  const alreadyDefined =
+    (_ref =
+      (_ref2 =
+        (_oldSchema$astNode =
+          oldSchema === null || oldSchema === void 0
+            ? void 0
+            : oldSchema.astNode) !== null && _oldSchema$astNode !== void 0
+          ? _oldSchema$astNode
+          : oldSchema === null || oldSchema === void 0
+          ? void 0
+          : oldSchema.getQueryType()) !== null && _ref2 !== void 0
+        ? _ref2
+        : oldSchema === null || oldSchema === void 0
+        ? void 0
+        : oldSchema.getMutationType()) !== null && _ref !== void 0
+      ? _ref
+      : oldSchema === null || oldSchema === void 0
+      ? void 0
+      : oldSchema.getSubscriptionType();
+  let schemaDefinitionsCount = 0;
+  return {
+    SchemaDefinition(node) {
+      if (alreadyDefined) {
+        context.reportError(
+          new GraphQLError(
+            'Cannot define a new schema within a schema extension.',
+            node,
+          ),
+        );
+        return;
+      }
+
+      if (schemaDefinitionsCount > 0) {
+        context.reportError(
+          new GraphQLError('Must provide only one schema definition.', node),
+        );
+      }
+
+      ++schemaDefinitionsCount;
+    },
+  };
+}
+
+/**
+ * Unique operation types
+ *
+ * A GraphQL document is only valid if it has only one type per operation.
+ */
+function UniqueOperationTypesRule(context) {
+  const schema = context.getSchema();
+  const definedOperationTypes = Object.create(null);
+  const existingOperationTypes = schema
+    ? {
+        query: schema.getQueryType(),
+        mutation: schema.getMutationType(),
+        subscription: schema.getSubscriptionType(),
+      }
+    : {};
+  return {
+    SchemaDefinition: checkOperationTypes,
+    SchemaExtension: checkOperationTypes,
+  };
+
+  function checkOperationTypes(node) {
+    var _node$operationTypes;
+
+    // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+    const operationTypesNodes =
+      (_node$operationTypes = node.operationTypes) !== null &&
+      _node$operationTypes !== void 0
+        ? _node$operationTypes
+        : [];
+
+    for (const operationType of operationTypesNodes) {
+      const operation = operationType.operation;
+      const alreadyDefinedOperationType = definedOperationTypes[operation];
+
+      if (existingOperationTypes[operation]) {
+        context.reportError(
+          new GraphQLError(
+            `Type for ${operation} already defined in the schema. It cannot be redefined.`,
+            operationType,
+          ),
+        );
+      } else if (alreadyDefinedOperationType) {
+        context.reportError(
+          new GraphQLError(
+            `There can be only one ${operation} type in schema.`,
+            [alreadyDefinedOperationType, operationType],
+          ),
+        );
+      } else {
+        definedOperationTypes[operation] = operationType;
+      }
+    }
+
+    return false;
+  }
+}
+
+/**
+ * Unique type names
+ *
+ * A GraphQL document is only valid if all defined types have unique names.
+ */
+function UniqueTypeNamesRule(context) {
+  const knownTypeNames = Object.create(null);
+  const schema = context.getSchema();
+  return {
+    ScalarTypeDefinition: checkTypeName,
+    ObjectTypeDefinition: checkTypeName,
+    InterfaceTypeDefinition: checkTypeName,
+    UnionTypeDefinition: checkTypeName,
+    EnumTypeDefinition: checkTypeName,
+    InputObjectTypeDefinition: checkTypeName,
+  };
+
+  function checkTypeName(node) {
+    const typeName = node.name.value;
+
+    if (schema !== null && schema !== void 0 && schema.getType(typeName)) {
+      context.reportError(
+        new GraphQLError(
+          `Type "${typeName}" already exists in the schema. It cannot also be defined in this type definition.`,
+          node.name,
+        ),
+      );
+      return;
+    }
+
+    if (knownTypeNames[typeName]) {
+      context.reportError(
+        new GraphQLError(`There can be only one type named "${typeName}".`, [
+          knownTypeNames[typeName],
+          node.name,
+        ]),
+      );
+    } else {
+      knownTypeNames[typeName] = node.name;
+    }
+
+    return false;
+  }
+}
+
+/**
+ * Unique enum value names
+ *
+ * A GraphQL enum type is only valid if all its values are uniquely named.
+ */
+function UniqueEnumValueNamesRule(context) {
+  const schema = context.getSchema();
+  const existingTypeMap = schema ? schema.getTypeMap() : Object.create(null);
+  const knownValueNames = Object.create(null);
+  return {
+    EnumTypeDefinition: checkValueUniqueness,
+    EnumTypeExtension: checkValueUniqueness,
+  };
+
+  function checkValueUniqueness(node) {
+    var _node$values;
+
+    const typeName = node.name.value;
+
+    if (!knownValueNames[typeName]) {
+      knownValueNames[typeName] = Object.create(null);
+    } // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+
+    const valueNodes =
+      (_node$values = node.values) !== null && _node$values !== void 0
+        ? _node$values
+        : [];
+    const valueNames = knownValueNames[typeName];
+
+    for (const valueDef of valueNodes) {
+      const valueName = valueDef.name.value;
+      const existingType = existingTypeMap[typeName];
+
+      if (isEnumType(existingType) && existingType.getValue(valueName)) {
+        context.reportError(
+          new GraphQLError(
+            `Enum value "${typeName}.${valueName}" already exists in the schema. It cannot also be defined in this type extension.`,
+            valueDef.name,
+          ),
+        );
+      } else if (valueNames[valueName]) {
+        context.reportError(
+          new GraphQLError(
+            `Enum value "${typeName}.${valueName}" can only be defined once.`,
+            [valueNames[valueName], valueDef.name],
+          ),
+        );
+      } else {
+        valueNames[valueName] = valueDef.name;
+      }
+    }
+
+    return false;
+  }
+}
+
+/**
+ * Unique field definition names
+ *
+ * A GraphQL complex type is only valid if all its fields are uniquely named.
+ */
+function UniqueFieldDefinitionNamesRule(context) {
+  const schema = context.getSchema();
+  const existingTypeMap = schema ? schema.getTypeMap() : Object.create(null);
+  const knownFieldNames = Object.create(null);
+  return {
+    InputObjectTypeDefinition: checkFieldUniqueness,
+    InputObjectTypeExtension: checkFieldUniqueness,
+    InterfaceTypeDefinition: checkFieldUniqueness,
+    InterfaceTypeExtension: checkFieldUniqueness,
+    ObjectTypeDefinition: checkFieldUniqueness,
+    ObjectTypeExtension: checkFieldUniqueness,
+  };
+
+  function checkFieldUniqueness(node) {
+    var _node$fields;
+
+    const typeName = node.name.value;
+
+    if (!knownFieldNames[typeName]) {
+      knownFieldNames[typeName] = Object.create(null);
+    } // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+
+    const fieldNodes =
+      (_node$fields = node.fields) !== null && _node$fields !== void 0
+        ? _node$fields
+        : [];
+    const fieldNames = knownFieldNames[typeName];
+
+    for (const fieldDef of fieldNodes) {
+      const fieldName = fieldDef.name.value;
+
+      if (hasField(existingTypeMap[typeName], fieldName)) {
+        context.reportError(
+          new GraphQLError(
+            `Field "${typeName}.${fieldName}" already exists in the schema. It cannot also be defined in this type extension.`,
+            fieldDef.name,
+          ),
+        );
+      } else if (fieldNames[fieldName]) {
+        context.reportError(
+          new GraphQLError(
+            `Field "${typeName}.${fieldName}" can only be defined once.`,
+            [fieldNames[fieldName], fieldDef.name],
+          ),
+        );
+      } else {
+        fieldNames[fieldName] = fieldDef.name;
+      }
+    }
+
+    return false;
+  }
+}
+
+function hasField(type, fieldName) {
+  if (isObjectType(type) || isInterfaceType(type) || isInputObjectType(type)) {
+    return type.getFields()[fieldName] != null;
+  }
+
+  return false;
+}
+
+/**
+ * Unique argument definition names
+ *
+ * A GraphQL Object or Interface type is only valid if all its fields have uniquely named arguments.
+ * A GraphQL Directive is only valid if all its arguments are uniquely named.
+ */
+function UniqueArgumentDefinitionNamesRule(context) {
+  return {
+    DirectiveDefinition(directiveNode) {
+      var _directiveNode$argume;
+
+      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+      const argumentNodes =
+        (_directiveNode$argume = directiveNode.arguments) !== null &&
+        _directiveNode$argume !== void 0
+          ? _directiveNode$argume
+          : [];
+      return checkArgUniqueness(`@${directiveNode.name.value}`, argumentNodes);
+    },
+
+    InterfaceTypeDefinition: checkArgUniquenessPerField,
+    InterfaceTypeExtension: checkArgUniquenessPerField,
+    ObjectTypeDefinition: checkArgUniquenessPerField,
+    ObjectTypeExtension: checkArgUniquenessPerField,
+  };
+
+  function checkArgUniquenessPerField(typeNode) {
+    var _typeNode$fields;
+
+    const typeName = typeNode.name.value; // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+
+    const fieldNodes =
+      (_typeNode$fields = typeNode.fields) !== null &&
+      _typeNode$fields !== void 0
+        ? _typeNode$fields
+        : [];
+
+    for (const fieldDef of fieldNodes) {
+      var _fieldDef$arguments;
+
+      const fieldName = fieldDef.name.value; // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+
+      const argumentNodes =
+        (_fieldDef$arguments = fieldDef.arguments) !== null &&
+        _fieldDef$arguments !== void 0
+          ? _fieldDef$arguments
+          : [];
+      checkArgUniqueness(`${typeName}.${fieldName}`, argumentNodes);
+    }
+
+    return false;
+  }
+
+  function checkArgUniqueness(parentName, argumentNodes) {
+    const seenArgs = groupBy(argumentNodes, (arg) => arg.name.value);
+
+    for (const [argName, argNodes] of seenArgs) {
+      if (argNodes.length > 1) {
+        context.reportError(
+          new GraphQLError(
+            `Argument "${parentName}(${argName}:)" can only be defined once.`,
+            argNodes.map((node) => node.name),
+          ),
+        );
+      }
+    }
+
+    return false;
+  }
+}
+
+/**
+ * Unique directive names
+ *
+ * A GraphQL document is only valid if all defined directives have unique names.
+ */
+function UniqueDirectiveNamesRule(context) {
+  const knownDirectiveNames = Object.create(null);
+  const schema = context.getSchema();
+  return {
+    DirectiveDefinition(node) {
+      const directiveName = node.name.value;
+
+      if (
+        schema !== null &&
+        schema !== void 0 &&
+        schema.getDirective(directiveName)
+      ) {
+        context.reportError(
+          new GraphQLError(
+            `Directive "@${directiveName}" already exists in the schema. It cannot be redefined.`,
+            node.name,
+          ),
+        );
+        return;
+      }
+
+      if (knownDirectiveNames[directiveName]) {
+        context.reportError(
+          new GraphQLError(
+            `There can be only one directive named "@${directiveName}".`,
+            [knownDirectiveNames[directiveName], node.name],
+          ),
+        );
+      } else {
+        knownDirectiveNames[directiveName] = node.name;
+      }
+
+      return false;
+    },
+  };
+}
+
+/**
+ * Possible type extension
+ *
+ * A type extension is only valid if the type is defined and has the same kind.
+ */
+function PossibleTypeExtensionsRule(context) {
+  const schema = context.getSchema();
+  const definedTypes = Object.create(null);
+
+  for (const def of context.getDocument().definitions) {
+    if (isTypeDefinitionNode(def)) {
+      definedTypes[def.name.value] = def;
+    }
+  }
+
+  return {
+    ScalarTypeExtension: checkExtension,
+    ObjectTypeExtension: checkExtension,
+    InterfaceTypeExtension: checkExtension,
+    UnionTypeExtension: checkExtension,
+    EnumTypeExtension: checkExtension,
+    InputObjectTypeExtension: checkExtension,
+  };
+
+  function checkExtension(node) {
+    const typeName = node.name.value;
+    const defNode = definedTypes[typeName];
+    const existingType =
+      schema === null || schema === void 0 ? void 0 : schema.getType(typeName);
+    let expectedKind;
+
+    if (defNode) {
+      expectedKind = defKindToExtKind[defNode.kind];
+    } else if (existingType) {
+      expectedKind = typeToExtKind(existingType);
+    }
+
+    if (expectedKind) {
+      if (expectedKind !== node.kind) {
+        const kindStr = extensionKindToTypeName(node.kind);
+        context.reportError(
+          new GraphQLError(
+            `Cannot extend non-${kindStr} type "${typeName}".`,
+            defNode ? [defNode, node] : node,
+          ),
+        );
+      }
+    } else {
+      const allTypeNames = Object.keys({
+        ...definedTypes,
+        ...(schema === null || schema === void 0
+          ? void 0
+          : schema.getTypeMap()),
+      });
+      const suggestedTypes = suggestionList(typeName, allTypeNames);
+      context.reportError(
+        new GraphQLError(
+          `Cannot extend type "${typeName}" because it is not defined.` +
+            didYouMean(suggestedTypes),
+          node.name,
+        ),
+      );
+    }
+  }
+}
+const defKindToExtKind = {
+  [Kind.SCALAR_TYPE_DEFINITION]: Kind.SCALAR_TYPE_EXTENSION,
+  [Kind.OBJECT_TYPE_DEFINITION]: Kind.OBJECT_TYPE_EXTENSION,
+  [Kind.INTERFACE_TYPE_DEFINITION]: Kind.INTERFACE_TYPE_EXTENSION,
+  [Kind.UNION_TYPE_DEFINITION]: Kind.UNION_TYPE_EXTENSION,
+  [Kind.ENUM_TYPE_DEFINITION]: Kind.ENUM_TYPE_EXTENSION,
+  [Kind.INPUT_OBJECT_TYPE_DEFINITION]: Kind.INPUT_OBJECT_TYPE_EXTENSION,
+};
+
+function typeToExtKind(type) {
+  if (isScalarType(type)) {
+    return Kind.SCALAR_TYPE_EXTENSION;
+  }
+
+  if (isObjectType(type)) {
+    return Kind.OBJECT_TYPE_EXTENSION;
+  }
+
+  if (isInterfaceType(type)) {
+    return Kind.INTERFACE_TYPE_EXTENSION;
+  }
+
+  if (isUnionType(type)) {
+    return Kind.UNION_TYPE_EXTENSION;
+  }
+
+  if (isEnumType(type)) {
+    return Kind.ENUM_TYPE_EXTENSION;
+  } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')
+
+  if (isInputObjectType(type)) {
+    return Kind.INPUT_OBJECT_TYPE_EXTENSION;
+  } // istanbul ignore next (Not reachable. All possible types have been considered)
+
+   invariant(false, 'Unexpected type: ' + inspect(type));
+}
+
+function extensionKindToTypeName(kind) {
+  switch (kind) {
+    case Kind.SCALAR_TYPE_EXTENSION:
+      return 'scalar';
+
+    case Kind.OBJECT_TYPE_EXTENSION:
+      return 'object';
+
+    case Kind.INTERFACE_TYPE_EXTENSION:
+      return 'interface';
+
+    case Kind.UNION_TYPE_EXTENSION:
+      return 'union';
+
+    case Kind.ENUM_TYPE_EXTENSION:
+      return 'enum';
+
+    case Kind.INPUT_OBJECT_TYPE_EXTENSION:
+      return 'input object';
+  } // istanbul ignore next (Not reachable. All possible types have been considered)
+
+   invariant(false, 'Unexpected kind: ' + inspect(kind));
+}
+
+// Spec Section: "Executable Definitions"
+/**
+ * This set includes all validation rules defined by the GraphQL spec.
+ *
+ * The order of the rules in this list has been adjusted to lead to the
+ * most clear output when encountering multiple validation errors.
+ */
+
+const specifiedRules = Object.freeze([
+  ExecutableDefinitionsRule,
+  UniqueOperationNamesRule,
+  LoneAnonymousOperationRule,
+  SingleFieldSubscriptionsRule,
+  KnownTypeNamesRule,
+  FragmentsOnCompositeTypesRule,
+  VariablesAreInputTypesRule,
+  ScalarLeafsRule,
+  FieldsOnCorrectTypeRule,
+  UniqueFragmentNamesRule,
+  KnownFragmentNamesRule,
+  NoUnusedFragmentsRule,
+  PossibleFragmentSpreadsRule,
+  NoFragmentCyclesRule,
+  UniqueVariableNamesRule,
+  NoUndefinedVariablesRule,
+  NoUnusedVariablesRule,
+  KnownDirectivesRule,
+  UniqueDirectivesPerLocationRule,
+  KnownArgumentNamesRule,
+  UniqueArgumentNamesRule,
+  ValuesOfCorrectTypeRule,
+  ProvidedRequiredArgumentsRule,
+  VariablesInAllowedPositionRule,
+  OverlappingFieldsCanBeMergedRule,
+  UniqueInputFieldNamesRule,
+]);
+/**
+ * @internal
+ */
+
+const specifiedSDLRules = Object.freeze([
+  LoneSchemaDefinitionRule,
+  UniqueOperationTypesRule,
+  UniqueTypeNamesRule,
+  UniqueEnumValueNamesRule,
+  UniqueFieldDefinitionNamesRule,
+  UniqueArgumentDefinitionNamesRule,
+  UniqueDirectiveNamesRule,
+  KnownTypeNamesRule,
+  KnownDirectivesRule,
+  UniqueDirectivesPerLocationRule,
+  PossibleTypeExtensionsRule,
+  KnownArgumentNamesOnDirectivesRule,
+  UniqueArgumentNamesRule,
+  UniqueInputFieldNamesRule,
+  ProvidedRequiredArgumentsOnDirectivesRule,
+]);
+
+/**
+ * An instance of this class is passed as the "this" context to all validators,
+ * allowing access to commonly useful contextual information from within a
+ * validation rule.
+ */
+class ASTValidationContext {
+  constructor(ast, onError) {
+    this._ast = ast;
+    this._fragments = undefined;
+    this._fragmentSpreads = new Map();
+    this._recursivelyReferencedFragments = new Map();
+    this._onError = onError;
+  }
+
+  get [Symbol.toStringTag]() {
+    return 'ASTValidationContext';
+  }
+
+  reportError(error) {
+    this._onError(error);
+  }
+
+  getDocument() {
+    return this._ast;
+  }
+
+  getFragment(name) {
+    let fragments;
+
+    if (this._fragments) {
+      fragments = this._fragments;
+    } else {
+      fragments = Object.create(null);
+
+      for (const defNode of this.getDocument().definitions) {
+        if (defNode.kind === Kind.FRAGMENT_DEFINITION) {
+          fragments[defNode.name.value] = defNode;
+        }
+      }
+
+      this._fragments = fragments;
+    }
+
+    return fragments[name];
+  }
+
+  getFragmentSpreads(node) {
+    let spreads = this._fragmentSpreads.get(node);
+
+    if (!spreads) {
+      spreads = [];
+      const setsToVisit = [node];
+      let set;
+
+      while ((set = setsToVisit.pop())) {
+        for (const selection of set.selections) {
+          if (selection.kind === Kind.FRAGMENT_SPREAD) {
+            spreads.push(selection);
+          } else if (selection.selectionSet) {
+            setsToVisit.push(selection.selectionSet);
+          }
+        }
+      }
+
+      this._fragmentSpreads.set(node, spreads);
+    }
+
+    return spreads;
+  }
+
+  getRecursivelyReferencedFragments(operation) {
+    let fragments = this._recursivelyReferencedFragments.get(operation);
+
+    if (!fragments) {
+      fragments = [];
+      const collectedNames = Object.create(null);
+      const nodesToVisit = [operation.selectionSet];
+      let node;
+
+      while ((node = nodesToVisit.pop())) {
+        for (const spread of this.getFragmentSpreads(node)) {
+          const fragName = spread.name.value;
+
+          if (collectedNames[fragName] !== true) {
+            collectedNames[fragName] = true;
+            const fragment = this.getFragment(fragName);
+
+            if (fragment) {
+              fragments.push(fragment);
+              nodesToVisit.push(fragment.selectionSet);
+            }
+          }
+        }
+      }
+
+      this._recursivelyReferencedFragments.set(operation, fragments);
+    }
+
+    return fragments;
+  }
+}
+class SDLValidationContext extends ASTValidationContext {
+  constructor(ast, schema, onError) {
+    super(ast, onError);
+    this._schema = schema;
+  }
+
+  get [Symbol.toStringTag]() {
+    return 'SDLValidationContext';
+  }
+
+  getSchema() {
+    return this._schema;
+  }
+}
+
+/**
+ * @internal
+ */
+
+function validateSDL(
+  documentAST,
+  schemaToExtend,
+  rules = specifiedSDLRules,
+) {
+  const errors = [];
+  const context = new SDLValidationContext(
+    documentAST,
+    schemaToExtend,
+    (error) => {
+      errors.push(error);
+    },
+  );
+  const visitors = rules.map((rule) => rule(context));
+  visit(documentAST, visitInParallel(visitors));
+  return errors;
+}
+/**
+ * Utility function which asserts a SDL document is valid by throwing an error
+ * if it is invalid.
+ *
+ * @internal
+ */
+
+function assertValidSDL(documentAST) {
+  const errors = validateSDL(documentAST);
+
+  if (errors.length !== 0) {
+    throw new Error(errors.map((error) => error.message).join('\n\n'));
+  }
+}
+
+/**
+ * Build a GraphQLSchema for use by client tools.
+ *
+ * Given the result of a client running the introspection query, creates and
+ * returns a GraphQLSchema instance which can be then used with all graphql-js
+ * tools, but cannot be used to execute a query, as introspection does not
+ * represent the "resolver", "parse" or "serialize" functions or any other
+ * server-internal mechanisms.
+ *
+ * This function expects a complete introspection result. Don't forget to check
+ * the "errors" field of a server response before calling this function.
+ */
+
+function buildClientSchema(introspection, options) {
+  (isObjectLike(introspection) && isObjectLike(introspection.__schema)) ||
+    devAssert(
+      false,
+      `Invalid or incomplete introspection result. Ensure that you are passing "data" property of introspection response and no "errors" was returned alongside: ${inspect(
+        introspection,
+      )}.`,
+    ); // Get the schema from the introspection result.
+
+  const schemaIntrospection = introspection.__schema; // Iterate through all types, getting the type definition for each.
+
+  const typeMap = keyValMap(
+    schemaIntrospection.types,
+    (typeIntrospection) => typeIntrospection.name,
+    (typeIntrospection) => buildType(typeIntrospection),
+  ); // Include standard types only if they are used.
+
+  for (const stdType of [...specifiedScalarTypes, ...introspectionTypes]) {
+    if (typeMap[stdType.name]) {
+      typeMap[stdType.name] = stdType;
+    }
+  } // Get the root Query, Mutation, and Subscription types.
+
+  const queryType = schemaIntrospection.queryType
+    ? getObjectType(schemaIntrospection.queryType)
+    : null;
+  const mutationType = schemaIntrospection.mutationType
+    ? getObjectType(schemaIntrospection.mutationType)
+    : null;
+  const subscriptionType = schemaIntrospection.subscriptionType
+    ? getObjectType(schemaIntrospection.subscriptionType)
+    : null; // Get the directives supported by Introspection, assuming empty-set if
+  // directives were not queried for.
+
+  const directives = schemaIntrospection.directives
+    ? schemaIntrospection.directives.map(buildDirective)
+    : []; // Then produce and return a Schema with these types.
+
+  return new GraphQLSchema({
+    description: schemaIntrospection.description,
+    query: queryType,
+    mutation: mutationType,
+    subscription: subscriptionType,
+    types: Object.values(typeMap),
+    directives,
+    assumeValid:
+      options === null || options === void 0 ? void 0 : options.assumeValid,
+  }); // Given a type reference in introspection, return the GraphQLType instance.
+  // preferring cached instances before building new instances.
+
+  function getType(typeRef) {
+    if (typeRef.kind === TypeKind.LIST) {
+      const itemRef = typeRef.ofType;
+
+      if (!itemRef) {
+        throw new Error('Decorated type deeper than introspection query.');
+      }
+
+      return new GraphQLList(getType(itemRef));
+    }
+
+    if (typeRef.kind === TypeKind.NON_NULL) {
+      const nullableRef = typeRef.ofType;
+
+      if (!nullableRef) {
+        throw new Error('Decorated type deeper than introspection query.');
+      }
+
+      const nullableType = getType(nullableRef);
+      return new GraphQLNonNull(assertNullableType(nullableType));
+    }
+
+    return getNamedType(typeRef);
+  }
+
+  function getNamedType(typeRef) {
+    const typeName = typeRef.name;
+
+    if (!typeName) {
+      throw new Error(`Unknown type reference: ${inspect(typeRef)}.`);
+    }
+
+    const type = typeMap[typeName];
+
+    if (!type) {
+      throw new Error(
+        `Invalid or incomplete schema, unknown type: ${typeName}. Ensure that a full introspection query is used in order to build a client schema.`,
+      );
+    }
+
+    return type;
   }
 
   function getObjectType(typeRef) {
@@ -7692,6 +11330,796 @@ function buildClientSchema(introspection, options) {
   }
 }
 
+/**
+ * @internal
+ */
+
+function extendSchemaImpl(schemaConfig, documentAST, options) {
+  var _schemaDef, _schemaDef$descriptio, _schemaDef2, _options$assumeValid;
+
+  // Collect the type definitions and extensions found in the document.
+  const typeDefs = [];
+  const typeExtensionsMap = Object.create(null); // New directives and types are separate because a directives and types can
+  // have the same name. For example, a type named "skip".
+
+  const directiveDefs = [];
+  let schemaDef; // Schema extensions are collected which may add additional operation types.
+
+  const schemaExtensions = [];
+
+  for (const def of documentAST.definitions) {
+    if (def.kind === Kind.SCHEMA_DEFINITION) {
+      schemaDef = def;
+    } else if (def.kind === Kind.SCHEMA_EXTENSION) {
+      schemaExtensions.push(def);
+    } else if (isTypeDefinitionNode(def)) {
+      typeDefs.push(def);
+    } else if (isTypeExtensionNode(def)) {
+      const extendedTypeName = def.name.value;
+      const existingTypeExtensions = typeExtensionsMap[extendedTypeName];
+      typeExtensionsMap[extendedTypeName] = existingTypeExtensions
+        ? existingTypeExtensions.concat([def])
+        : [def];
+    } else if (def.kind === Kind.DIRECTIVE_DEFINITION) {
+      directiveDefs.push(def);
+    }
+  } // If this document contains no new types, extensions, or directives then
+  // return the same unmodified GraphQLSchema instance.
+
+  if (
+    Object.keys(typeExtensionsMap).length === 0 &&
+    typeDefs.length === 0 &&
+    directiveDefs.length === 0 &&
+    schemaExtensions.length === 0 &&
+    schemaDef == null
+  ) {
+    return schemaConfig;
+  }
+
+  const typeMap = Object.create(null);
+
+  for (const existingType of schemaConfig.types) {
+    typeMap[existingType.name] = extendNamedType(existingType);
+  }
+
+  for (const typeNode of typeDefs) {
+    var _stdTypeMap$name;
+
+    const name = typeNode.name.value;
+    typeMap[name] =
+      (_stdTypeMap$name = stdTypeMap[name]) !== null &&
+      _stdTypeMap$name !== void 0
+        ? _stdTypeMap$name
+        : buildType(typeNode);
+  }
+
+  const operationTypes = {
+    // Get the extended root operation types.
+    query: schemaConfig.query && replaceNamedType(schemaConfig.query),
+    mutation: schemaConfig.mutation && replaceNamedType(schemaConfig.mutation),
+    subscription:
+      schemaConfig.subscription && replaceNamedType(schemaConfig.subscription),
+    // Then, incorporate schema definition and all schema extensions.
+    ...(schemaDef && getOperationTypes([schemaDef])),
+    ...getOperationTypes(schemaExtensions),
+  }; // Then produce and return a Schema config with these types.
+
+  return {
+    description:
+      (_schemaDef = schemaDef) === null || _schemaDef === void 0
+        ? void 0
+        : (_schemaDef$descriptio = _schemaDef.description) === null ||
+          _schemaDef$descriptio === void 0
+        ? void 0
+        : _schemaDef$descriptio.value,
+    ...operationTypes,
+    types: Object.values(typeMap),
+    directives: [
+      ...schemaConfig.directives.map(replaceDirective),
+      ...directiveDefs.map(buildDirective),
+    ],
+    extensions: Object.create(null),
+    astNode:
+      (_schemaDef2 = schemaDef) !== null && _schemaDef2 !== void 0
+        ? _schemaDef2
+        : schemaConfig.astNode,
+    extensionASTNodes: schemaConfig.extensionASTNodes.concat(schemaExtensions),
+    assumeValid:
+      (_options$assumeValid =
+        options === null || options === void 0
+          ? void 0
+          : options.assumeValid) !== null && _options$assumeValid !== void 0
+        ? _options$assumeValid
+        : false,
+  }; // Below are functions used for producing this schema that have closed over
+  // this scope and have access to the schema, cache, and newly defined types.
+
+  function replaceType(type) {
+    if (isListType(type)) {
+      // @ts-expect-error
+      return new GraphQLList(replaceType(type.ofType));
+    }
+
+    if (isNonNullType(type)) {
+      // @ts-expect-error
+      return new GraphQLNonNull(replaceType(type.ofType));
+    } // @ts-expect-error FIXME
+
+    return replaceNamedType(type);
+  }
+
+  function replaceNamedType(type) {
+    // Note: While this could make early assertions to get the correctly
+    // typed values, that would throw immediately while type system
+    // validation with validateSchema() will produce more actionable results.
+    return typeMap[type.name];
+  }
+
+  function replaceDirective(directive) {
+    const config = directive.toConfig();
+    return new GraphQLDirective({
+      ...config,
+      args: mapValue(config.args, extendArg),
+    });
+  }
+
+  function extendNamedType(type) {
+    if (isIntrospectionType(type) || isSpecifiedScalarType(type)) {
+      // Builtin types are not extended.
+      return type;
+    }
+
+    if (isScalarType(type)) {
+      return extendScalarType(type);
+    }
+
+    if (isObjectType(type)) {
+      return extendObjectType(type);
+    }
+
+    if (isInterfaceType(type)) {
+      return extendInterfaceType(type);
+    }
+
+    if (isUnionType(type)) {
+      return extendUnionType(type);
+    }
+
+    if (isEnumType(type)) {
+      return extendEnumType(type);
+    } // istanbul ignore else (See: 'https://github.com/graphql/graphql-js/issues/2618')
+
+    if (isInputObjectType(type)) {
+      return extendInputObjectType(type);
+    } // istanbul ignore next (Not reachable. All possible types have been considered)
+
+     invariant(false, 'Unexpected type: ' + inspect(type));
+  }
+
+  function extendInputObjectType(type) {
+    var _typeExtensionsMap$co;
+
+    const config = type.toConfig();
+    const extensions =
+      (_typeExtensionsMap$co = typeExtensionsMap[config.name]) !== null &&
+      _typeExtensionsMap$co !== void 0
+        ? _typeExtensionsMap$co
+        : [];
+    return new GraphQLInputObjectType({
+      ...config,
+      fields: () => ({
+        ...mapValue(config.fields, (field) => ({
+          ...field,
+          type: replaceType(field.type),
+        })),
+        ...buildInputFieldMap(extensions),
+      }),
+      extensionASTNodes: config.extensionASTNodes.concat(extensions),
+    });
+  }
+
+  function extendEnumType(type) {
+    var _typeExtensionsMap$ty;
+
+    const config = type.toConfig();
+    const extensions =
+      (_typeExtensionsMap$ty = typeExtensionsMap[type.name]) !== null &&
+      _typeExtensionsMap$ty !== void 0
+        ? _typeExtensionsMap$ty
+        : [];
+    return new GraphQLEnumType({
+      ...config,
+      values: { ...config.values, ...buildEnumValueMap(extensions) },
+      extensionASTNodes: config.extensionASTNodes.concat(extensions),
+    });
+  }
+
+  function extendScalarType(type) {
+    var _typeExtensionsMap$co2;
+
+    const config = type.toConfig();
+    const extensions =
+      (_typeExtensionsMap$co2 = typeExtensionsMap[config.name]) !== null &&
+      _typeExtensionsMap$co2 !== void 0
+        ? _typeExtensionsMap$co2
+        : [];
+    let specifiedByURL = config.specifiedByURL;
+
+    for (const extensionNode of extensions) {
+      var _getSpecifiedByURL;
+
+      specifiedByURL =
+        (_getSpecifiedByURL = getSpecifiedByURL(extensionNode)) !== null &&
+        _getSpecifiedByURL !== void 0
+          ? _getSpecifiedByURL
+          : specifiedByURL;
+    }
+
+    return new GraphQLScalarType({
+      ...config,
+      specifiedByURL,
+      extensionASTNodes: config.extensionASTNodes.concat(extensions),
+    });
+  }
+
+  function extendObjectType(type) {
+    var _typeExtensionsMap$co3;
+
+    const config = type.toConfig();
+    const extensions =
+      (_typeExtensionsMap$co3 = typeExtensionsMap[config.name]) !== null &&
+      _typeExtensionsMap$co3 !== void 0
+        ? _typeExtensionsMap$co3
+        : [];
+    return new GraphQLObjectType({
+      ...config,
+      interfaces: () => [
+        ...type.getInterfaces().map(replaceNamedType),
+        ...buildInterfaces(extensions),
+      ],
+      fields: () => ({
+        ...mapValue(config.fields, extendField),
+        ...buildFieldMap(extensions),
+      }),
+      extensionASTNodes: config.extensionASTNodes.concat(extensions),
+    });
+  }
+
+  function extendInterfaceType(type) {
+    var _typeExtensionsMap$co4;
+
+    const config = type.toConfig();
+    const extensions =
+      (_typeExtensionsMap$co4 = typeExtensionsMap[config.name]) !== null &&
+      _typeExtensionsMap$co4 !== void 0
+        ? _typeExtensionsMap$co4
+        : [];
+    return new GraphQLInterfaceType({
+      ...config,
+      interfaces: () => [
+        ...type.getInterfaces().map(replaceNamedType),
+        ...buildInterfaces(extensions),
+      ],
+      fields: () => ({
+        ...mapValue(config.fields, extendField),
+        ...buildFieldMap(extensions),
+      }),
+      extensionASTNodes: config.extensionASTNodes.concat(extensions),
+    });
+  }
+
+  function extendUnionType(type) {
+    var _typeExtensionsMap$co5;
+
+    const config = type.toConfig();
+    const extensions =
+      (_typeExtensionsMap$co5 = typeExtensionsMap[config.name]) !== null &&
+      _typeExtensionsMap$co5 !== void 0
+        ? _typeExtensionsMap$co5
+        : [];
+    return new GraphQLUnionType({
+      ...config,
+      types: () => [
+        ...type.getTypes().map(replaceNamedType),
+        ...buildUnionTypes(extensions),
+      ],
+      extensionASTNodes: config.extensionASTNodes.concat(extensions),
+    });
+  }
+
+  function extendField(field) {
+    return {
+      ...field,
+      type: replaceType(field.type),
+      args: field.args && mapValue(field.args, extendArg),
+    };
+  }
+
+  function extendArg(arg) {
+    return { ...arg, type: replaceType(arg.type) };
+  }
+
+  function getOperationTypes(nodes) {
+    const opTypes = {};
+
+    for (const node of nodes) {
+      var _node$operationTypes;
+
+      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+      const operationTypesNodes =
+        (_node$operationTypes = node.operationTypes) !== null &&
+        _node$operationTypes !== void 0
+          ? _node$operationTypes
+          : [];
+
+      for (const operationType of operationTypesNodes) {
+        // Note: While this could make early assertions to get the correctly
+        // typed values below, that would throw immediately while type system
+        // validation with validateSchema() will produce more actionable results.
+        // @ts-expect-error
+        opTypes[operationType.operation] = getNamedType(operationType.type);
+      }
+    }
+
+    return opTypes;
+  }
+
+  function getNamedType(node) {
+    var _stdTypeMap$name2;
+
+    const name = node.name.value;
+    const type =
+      (_stdTypeMap$name2 = stdTypeMap[name]) !== null &&
+      _stdTypeMap$name2 !== void 0
+        ? _stdTypeMap$name2
+        : typeMap[name];
+
+    if (type === undefined) {
+      throw new Error(`Unknown type: "${name}".`);
+    }
+
+    return type;
+  }
+
+  function getWrappedType(node) {
+    if (node.kind === Kind.LIST_TYPE) {
+      return new GraphQLList(getWrappedType(node.type));
+    }
+
+    if (node.kind === Kind.NON_NULL_TYPE) {
+      return new GraphQLNonNull(getWrappedType(node.type));
+    }
+
+    return getNamedType(node);
+  }
+
+  function buildDirective(node) {
+    var _node$description;
+
+    return new GraphQLDirective({
+      name: node.name.value,
+      description:
+        (_node$description = node.description) === null ||
+        _node$description === void 0
+          ? void 0
+          : _node$description.value,
+      // @ts-expect-error
+      locations: node.locations.map(({ value }) => value),
+      isRepeatable: node.repeatable,
+      args: buildArgumentMap(node.arguments),
+      astNode: node,
+    });
+  }
+
+  function buildFieldMap(nodes) {
+    const fieldConfigMap = Object.create(null);
+
+    for (const node of nodes) {
+      var _node$fields;
+
+      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+      const nodeFields =
+        (_node$fields = node.fields) !== null && _node$fields !== void 0
+          ? _node$fields
+          : [];
+
+      for (const field of nodeFields) {
+        var _field$description;
+
+        fieldConfigMap[field.name.value] = {
+          // Note: While this could make assertions to get the correctly typed
+          // value, that would throw immediately while type system validation
+          // with validateSchema() will produce more actionable results.
+          type: getWrappedType(field.type),
+          description:
+            (_field$description = field.description) === null ||
+            _field$description === void 0
+              ? void 0
+              : _field$description.value,
+          args: buildArgumentMap(field.arguments),
+          deprecationReason: getDeprecationReason(field),
+          astNode: field,
+        };
+      }
+    }
+
+    return fieldConfigMap;
+  }
+
+  function buildArgumentMap(args) {
+    // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+    const argsNodes = args !== null && args !== void 0 ? args : [];
+    const argConfigMap = Object.create(null);
+
+    for (const arg of argsNodes) {
+      var _arg$description;
+
+      // Note: While this could make assertions to get the correctly typed
+      // value, that would throw immediately while type system validation
+      // with validateSchema() will produce more actionable results.
+      const type = getWrappedType(arg.type);
+      argConfigMap[arg.name.value] = {
+        type,
+        description:
+          (_arg$description = arg.description) === null ||
+          _arg$description === void 0
+            ? void 0
+            : _arg$description.value,
+        defaultValue: valueFromAST(arg.defaultValue, type),
+        deprecationReason: getDeprecationReason(arg),
+        astNode: arg,
+      };
+    }
+
+    return argConfigMap;
+  }
+
+  function buildInputFieldMap(nodes) {
+    const inputFieldMap = Object.create(null);
+
+    for (const node of nodes) {
+      var _node$fields2;
+
+      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+      const fieldsNodes =
+        (_node$fields2 = node.fields) !== null && _node$fields2 !== void 0
+          ? _node$fields2
+          : [];
+
+      for (const field of fieldsNodes) {
+        var _field$description2;
+
+        // Note: While this could make assertions to get the correctly typed
+        // value, that would throw immediately while type system validation
+        // with validateSchema() will produce more actionable results.
+        const type = getWrappedType(field.type);
+        inputFieldMap[field.name.value] = {
+          type,
+          description:
+            (_field$description2 = field.description) === null ||
+            _field$description2 === void 0
+              ? void 0
+              : _field$description2.value,
+          defaultValue: valueFromAST(field.defaultValue, type),
+          deprecationReason: getDeprecationReason(field),
+          astNode: field,
+        };
+      }
+    }
+
+    return inputFieldMap;
+  }
+
+  function buildEnumValueMap(nodes) {
+    const enumValueMap = Object.create(null);
+
+    for (const node of nodes) {
+      var _node$values;
+
+      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+      const valuesNodes =
+        (_node$values = node.values) !== null && _node$values !== void 0
+          ? _node$values
+          : [];
+
+      for (const value of valuesNodes) {
+        var _value$description;
+
+        enumValueMap[value.name.value] = {
+          description:
+            (_value$description = value.description) === null ||
+            _value$description === void 0
+              ? void 0
+              : _value$description.value,
+          deprecationReason: getDeprecationReason(value),
+          astNode: value,
+        };
+      }
+    }
+
+    return enumValueMap;
+  }
+
+  function buildInterfaces(nodes) {
+    // Note: While this could make assertions to get the correctly typed
+    // values below, that would throw immediately while type system
+    // validation with validateSchema() will produce more actionable results.
+    // @ts-expect-error
+    return nodes.flatMap(
+      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+      (node) => {
+        var _node$interfaces$map, _node$interfaces;
+
+        return (_node$interfaces$map =
+          (_node$interfaces = node.interfaces) === null ||
+          _node$interfaces === void 0
+            ? void 0
+            : _node$interfaces.map(getNamedType)) !== null &&
+          _node$interfaces$map !== void 0
+          ? _node$interfaces$map
+          : [];
+      },
+    );
+  }
+
+  function buildUnionTypes(nodes) {
+    // Note: While this could make assertions to get the correctly typed
+    // values below, that would throw immediately while type system
+    // validation with validateSchema() will produce more actionable results.
+    // @ts-expect-error
+    return nodes.flatMap(
+      // istanbul ignore next (See: 'https://github.com/graphql/graphql-js/issues/2203')
+      (node) => {
+        var _node$types$map, _node$types;
+
+        return (_node$types$map =
+          (_node$types = node.types) === null || _node$types === void 0
+            ? void 0
+            : _node$types.map(getNamedType)) !== null &&
+          _node$types$map !== void 0
+          ? _node$types$map
+          : [];
+      },
+    );
+  }
+
+  function buildType(astNode) {
+    var _typeExtensionsMap$na;
+
+    const name = astNode.name.value;
+    const extensionASTNodes =
+      (_typeExtensionsMap$na = typeExtensionsMap[name]) !== null &&
+      _typeExtensionsMap$na !== void 0
+        ? _typeExtensionsMap$na
+        : [];
+
+    switch (astNode.kind) {
+      case Kind.OBJECT_TYPE_DEFINITION: {
+        var _astNode$description;
+
+        const allNodes = [astNode, ...extensionASTNodes];
+        return new GraphQLObjectType({
+          name,
+          description:
+            (_astNode$description = astNode.description) === null ||
+            _astNode$description === void 0
+              ? void 0
+              : _astNode$description.value,
+          interfaces: () => buildInterfaces(allNodes),
+          fields: () => buildFieldMap(allNodes),
+          astNode,
+          extensionASTNodes,
+        });
+      }
+
+      case Kind.INTERFACE_TYPE_DEFINITION: {
+        var _astNode$description2;
+
+        const allNodes = [astNode, ...extensionASTNodes];
+        return new GraphQLInterfaceType({
+          name,
+          description:
+            (_astNode$description2 = astNode.description) === null ||
+            _astNode$description2 === void 0
+              ? void 0
+              : _astNode$description2.value,
+          interfaces: () => buildInterfaces(allNodes),
+          fields: () => buildFieldMap(allNodes),
+          astNode,
+          extensionASTNodes,
+        });
+      }
+
+      case Kind.ENUM_TYPE_DEFINITION: {
+        var _astNode$description3;
+
+        const allNodes = [astNode, ...extensionASTNodes];
+        return new GraphQLEnumType({
+          name,
+          description:
+            (_astNode$description3 = astNode.description) === null ||
+            _astNode$description3 === void 0
+              ? void 0
+              : _astNode$description3.value,
+          values: buildEnumValueMap(allNodes),
+          astNode,
+          extensionASTNodes,
+        });
+      }
+
+      case Kind.UNION_TYPE_DEFINITION: {
+        var _astNode$description4;
+
+        const allNodes = [astNode, ...extensionASTNodes];
+        return new GraphQLUnionType({
+          name,
+          description:
+            (_astNode$description4 = astNode.description) === null ||
+            _astNode$description4 === void 0
+              ? void 0
+              : _astNode$description4.value,
+          types: () => buildUnionTypes(allNodes),
+          astNode,
+          extensionASTNodes,
+        });
+      }
+
+      case Kind.SCALAR_TYPE_DEFINITION: {
+        var _astNode$description5;
+
+        return new GraphQLScalarType({
+          name,
+          description:
+            (_astNode$description5 = astNode.description) === null ||
+            _astNode$description5 === void 0
+              ? void 0
+              : _astNode$description5.value,
+          specifiedByURL: getSpecifiedByURL(astNode),
+          astNode,
+          extensionASTNodes,
+        });
+      }
+
+      case Kind.INPUT_OBJECT_TYPE_DEFINITION: {
+        var _astNode$description6;
+
+        const allNodes = [astNode, ...extensionASTNodes];
+        return new GraphQLInputObjectType({
+          name,
+          description:
+            (_astNode$description6 = astNode.description) === null ||
+            _astNode$description6 === void 0
+              ? void 0
+              : _astNode$description6.value,
+          fields: () => buildInputFieldMap(allNodes),
+          astNode,
+          extensionASTNodes,
+        });
+      }
+    } // istanbul ignore next (Not reachable. All possible type definition nodes have been considered)
+
+    
+      invariant(false, 'Unexpected type definition node: ' + inspect(astNode));
+  }
+}
+const stdTypeMap = keyMap(
+  [...specifiedScalarTypes, ...introspectionTypes],
+  (type) => type.name,
+);
+/**
+ * Given a field or enum value node, returns the string value for the
+ * deprecation reason.
+ */
+
+function getDeprecationReason(node) {
+  const deprecated = getDirectiveValues(GraphQLDeprecatedDirective, node); // @ts-expect-error validated by `getDirectiveValues`
+
+  return deprecated === null || deprecated === void 0
+    ? void 0
+    : deprecated.reason;
+}
+/**
+ * Given a scalar node, returns the string value for the specifiedByURL.
+ */
+
+function getSpecifiedByURL(node) {
+  const specifiedBy = getDirectiveValues(GraphQLSpecifiedByDirective, node); // @ts-expect-error validated by `getDirectiveValues`
+
+  return specifiedBy === null || specifiedBy === void 0
+    ? void 0
+    : specifiedBy.url;
+}
+
+/**
+ * This takes the ast of a schema document produced by the parse function in
+ * src/language/parser.js.
+ *
+ * If no schema definition is provided, then it will look for types named Query,
+ * Mutation and Subscription.
+ *
+ * Given that AST it constructs a GraphQLSchema. The resulting schema
+ * has no resolve methods, so execution will use default resolvers.
+ */
+function buildASTSchema(documentAST, options) {
+  (documentAST != null && documentAST.kind === Kind.DOCUMENT) ||
+    devAssert(false, 'Must provide valid Document AST.');
+
+  if (
+    (options === null || options === void 0 ? void 0 : options.assumeValid) !==
+      true &&
+    (options === null || options === void 0
+      ? void 0
+      : options.assumeValidSDL) !== true
+  ) {
+    assertValidSDL(documentAST);
+  }
+
+  const emptySchemaConfig = {
+    description: undefined,
+    types: [],
+    directives: [],
+    extensions: Object.create(null),
+    extensionASTNodes: [],
+    assumeValid: false,
+  };
+  const config = extendSchemaImpl(emptySchemaConfig, documentAST, options);
+
+  if (config.astNode == null) {
+    for (const type of config.types) {
+      switch (type.name) {
+        // Note: While this could make early assertions to get the correctly
+        // typed values below, that would throw immediately while type system
+        // validation with validateSchema() will produce more actionable results.
+        case 'Query':
+          // @ts-expect-error validated in `validateSchema`
+          config.query = type;
+          break;
+
+        case 'Mutation':
+          // @ts-expect-error validated in `validateSchema`
+          config.mutation = type;
+          break;
+
+        case 'Subscription':
+          // @ts-expect-error validated in `validateSchema`
+          config.subscription = type;
+          break;
+      }
+    }
+  }
+
+  const directives = [
+    ...config.directives, // If specified directives were not explicitly declared, add them.
+    ...specifiedDirectives.filter((stdDirective) =>
+      config.directives.every(
+        (directive) => directive.name !== stdDirective.name,
+      ),
+    ),
+  ];
+  return new GraphQLSchema({ ...config, directives });
+}
+/**
+ * A helper function to build a GraphQLSchema directly from a source
+ * document.
+ */
+
+function buildSchema(source, options) {
+  const document = parse(source, {
+    noLocation:
+      options === null || options === void 0 ? void 0 : options.noLocation,
+    allowLegacyFragmentVariables:
+      options === null || options === void 0
+        ? void 0
+        : options.allowLegacyFragmentVariables,
+  });
+  return buildASTSchema(document, {
+    assumeValidSDL:
+      options === null || options === void 0 ? void 0 : options.assumeValidSDL,
+    assumeValid:
+      options === null || options === void 0 ? void 0 : options.assumeValid,
+  });
+}
+
 function printSchema(schema) {
   return printFilteredSchema(
     schema,
@@ -8085,7 +12513,7 @@ function run() {
         let newSchema;
         let sources;
         if (extname(schemaPath.toLowerCase()) === ".json") {
-            oldSchema = buildClientSchema(JSON.parse(oldFile));
+            oldSchema = endpoint ? buildSchema(oldFile) : buildClientSchema(JSON.parse(oldFile));
             newSchema = buildClientSchema(JSON.parse(newFile));
             sources = {
                 old: new Source(printSchema(oldSchema), endpoint || `${schemaRef}:${schemaPath}`),
@@ -8120,7 +12548,8 @@ function run() {
             ? (_c = context.payload.pull_request.labels) === null || _c === void 0 ? void 0 : _c.some((label) => label.name === approveLabel)
             : false;
         // Force Success when failOnBreaking is disabled
-        if ((failOnBreaking === false || hasApprovedBreakingChangeLabel) && conclusion === CheckConclusion.Failure) {
+        if ((failOnBreaking === false || hasApprovedBreakingChangeLabel) &&
+            conclusion === CheckConclusion.Failure) {
             info('FailOnBreaking disabled. Forcing SUCCESS');
             conclusion = CheckConclusion.Success;
         }
@@ -8157,6 +12586,8 @@ function fileLoader({ octokit, owner, repo, }) {
       repository(name: $repo, owner: $owner) {
         object(expression: $expression) {
           ... on Blob {
+            isTruncated
+            oid
             text
           }
         }
@@ -8164,7 +12595,7 @@ function fileLoader({ octokit, owner, repo, }) {
     }
   `;
     return function loadFile(file) {
-        var _a, _b;
+        var _a, _b, _c, _d, _e, _f, _g, _h, _j, _k, _l, _m;
         return __awaiter(this, void 0, void 0, function* () {
             if (file.workspace) {
                 return readFileSync(resolve(file.workspace, file.path), {
@@ -8178,8 +12609,23 @@ function fileLoader({ octokit, owner, repo, }) {
             });
             info(`Query ${file.ref}:${file.path} from ${owner}/${repo}`);
             try {
-                if ((_b = (_a = result === null || result === void 0 ? void 0 : result.repository) === null || _a === void 0 ? void 0 : _a.object) === null || _b === void 0 ? void 0 : _b.text) {
-                    return result.repository.object.text;
+                if (((_b = (_a = result === null || result === void 0 ? void 0 : result.repository) === null || _a === void 0 ? void 0 : _a.object) === null || _b === void 0 ? void 0 : _b.oid) && ((_d = (_c = result === null || result === void 0 ? void 0 : result.repository) === null || _c === void 0 ? void 0 : _c.object) === null || _d === void 0 ? void 0 : _d.isTruncated)) {
+                    const oid = (_f = (_e = result === null || result === void 0 ? void 0 : result.repository) === null || _e === void 0 ? void 0 : _e.object) === null || _f === void 0 ? void 0 : _f.oid;
+                    const getBlobResponse = yield octokit.git.getBlob({
+                        owner,
+                        repo,
+                        file_sha: oid,
+                    });
+                    if ((_g = getBlobResponse === null || getBlobResponse === void 0 ? void 0 : getBlobResponse.data) === null || _g === void 0 ? void 0 : _g.content) {
+                        return Buffer.from((_h = getBlobResponse === null || getBlobResponse === void 0 ? void 0 : getBlobResponse.data) === null || _h === void 0 ? void 0 : _h.content, 'base64').toString('utf-8');
+                    }
+                    throw new Error('getBlobResponse.data.content is null');
+                }
+                if ((_k = (_j = result === null || result === void 0 ? void 0 : result.repository) === null || _j === void 0 ? void 0 : _j.object) === null || _k === void 0 ? void 0 : _k.text) {
+                    if (((_m = (_l = result === null || result === void 0 ? void 0 : result.repository) === null || _l === void 0 ? void 0 : _l.object) === null || _m === void 0 ? void 0 : _m.isTruncated) === false) {
+                        return result.repository.object.text;
+                    }
+                    throw new Error('result.repository.object.text is truncated and oid is null');
                 }
                 throw new Error('result.repository.object.text is null');
             }
@@ -8198,7 +12644,8 @@ function updateCheckRun(octokit, checkId, { conclusion, output }) {
         const batches = batch(annotations, 50);
         info(`annotations to be sent: ${annotations.length}`);
         yield octokit.checks.update(Object.assign(Object.assign({ check_run_id: checkId, completed_at: new Date().toISOString(), status: 'completed' }, context.repo), { conclusion, output: {
-                title, summary
+                title,
+                summary,
             } }));
         try {
             yield Promise.all(batches.map((chunk) => __awaiter(this, void 0, void 0, function* () {