graphql 0.0.1-test.1

package/utilities/printSchema.mjs

@@ -0,0 +1,309 @@
+import { inspect } from '../jsutils/inspect.mjs';
+import { invariant } from '../jsutils/invariant.mjs';
+import { isPrintableAsBlockString } from '../language/blockString.mjs';
+import { Kind } from '../language/kinds.mjs';
+import { print } from '../language/printer.mjs';
+import {
+  isEnumType,
+  isInputObjectType,
+  isInterfaceType,
+  isObjectType,
+  isScalarType,
+  isUnionType,
+} from '../type/definition.mjs';
+import {
+  DEFAULT_DEPRECATION_REASON,
+  isSpecifiedDirective,
+} from '../type/directives.mjs';
+import { isIntrospectionType } from '../type/introspection.mjs';
+import { isSpecifiedScalarType } from '../type/scalars.mjs';
+import { astFromValue } from './astFromValue.mjs';
+export function printSchema(schema) {
+  return printFilteredSchema(
+    schema,
+    (n) => !isSpecifiedDirective(n),
+    isDefinedType,
+  );
+}
+export function printIntrospectionSchema(schema) {
+  return printFilteredSchema(schema, isSpecifiedDirective, isIntrospectionType);
+}
+
+function isDefinedType(type) {
+  return !isSpecifiedScalarType(type) && !isIntrospectionType(type);
+}
+
+function printFilteredSchema(schema, directiveFilter, typeFilter) {
+  const directives = schema.getDirectives().filter(directiveFilter);
+  const types = Object.values(schema.getTypeMap()).filter(typeFilter);
+  return [
+    printSchemaDefinition(schema),
+    ...directives.map((directive) => printDirective(directive)),
+    ...types.map((type) => printType(type)),
+  ]
+    .filter(Boolean)
+    .join('\n\n');
+}
+
+function printSchemaDefinition(schema) {
+  if (schema.description == null && isSchemaOfCommonNames(schema)) {
+    return;
+  }
+
+  const operationTypes = [];
+  const queryType = schema.getQueryType();
+
+  if (queryType) {
+    operationTypes.push(`  query: ${queryType.name}`);
+  }
+
+  const mutationType = schema.getMutationType();
+
+  if (mutationType) {
+    operationTypes.push(`  mutation: ${mutationType.name}`);
+  }
+
+  const subscriptionType = schema.getSubscriptionType();
+
+  if (subscriptionType) {
+    operationTypes.push(`  subscription: ${subscriptionType.name}`);
+  }
+
+  return printDescription(schema) + `schema {\n${operationTypes.join('\n')}\n}`;
+}
+/**
+ * GraphQL schema define root types for each type of operation. These types are
+ * the same as any other type and can be named in any manner, however there is
+ * a common naming convention:
+ *
+ * ```graphql
+ *   schema {
+ *     query: Query
+ *     mutation: Mutation
+ *     subscription: Subscription
+ *   }
+ * ```
+ *
+ * When using this naming convention, the schema description can be omitted.
+ */
+
+function isSchemaOfCommonNames(schema) {
+  const queryType = schema.getQueryType();
+
+  if (queryType && queryType.name !== 'Query') {
+    return false;
+  }
+
+  const mutationType = schema.getMutationType();
+
+  if (mutationType && mutationType.name !== 'Mutation') {
+    return false;
+  }
+
+  const subscriptionType = schema.getSubscriptionType();
+
+  if (subscriptionType && subscriptionType.name !== 'Subscription') {
+    return false;
+  }
+
+  return true;
+}
+
+export function printType(type) {
+  if (isScalarType(type)) {
+    return printScalar(type);
+  }
+
+  if (isObjectType(type)) {
+    return printObject(type);
+  }
+
+  if (isInterfaceType(type)) {
+    return printInterface(type);
+  }
+
+  if (isUnionType(type)) {
+    return printUnion(type);
+  }
+
+  if (isEnumType(type)) {
+    return printEnum(type);
+  }
+
+  if (isInputObjectType(type)) {
+    return printInputObject(type);
+  }
+  /* c8 ignore next 3 */
+  // Not reachable, all possible types have been considered.
+
+  false || invariant(false, 'Unexpected type: ' + inspect(type));
+}
+
+function printScalar(type) {
+  return (
+    printDescription(type) + `scalar ${type.name}` + printSpecifiedByURL(type)
+  );
+}
+
+function printImplementedInterfaces(type) {
+  const interfaces = type.getInterfaces();
+  return interfaces.length
+    ? ' implements ' + interfaces.map((i) => i.name).join(' & ')
+    : '';
+}
+
+function printObject(type) {
+  return (
+    printDescription(type) +
+    `type ${type.name}` +
+    printImplementedInterfaces(type) +
+    printFields(type)
+  );
+}
+
+function printInterface(type) {
+  return (
+    printDescription(type) +
+    `interface ${type.name}` +
+    printImplementedInterfaces(type) +
+    printFields(type)
+  );
+}
+
+function printUnion(type) {
+  const types = type.getTypes();
+  const possibleTypes = types.length ? ' = ' + types.join(' | ') : '';
+  return printDescription(type) + 'union ' + type.name + possibleTypes;
+}
+
+function printEnum(type) {
+  const values = type
+    .getValues()
+    .map(
+      (value, i) =>
+        printDescription(value, '  ', !i) +
+        '  ' +
+        value.name +
+        printDeprecated(value.deprecationReason),
+    );
+  return printDescription(type) + `enum ${type.name}` + printBlock(values);
+}
+
+function printInputObject(type) {
+  const fields = Object.values(type.getFields()).map(
+    (f, i) => printDescription(f, '  ', !i) + '  ' + printInputValue(f),
+  );
+  return printDescription(type) + `input ${type.name}` + printBlock(fields);
+}
+
+function printFields(type) {
+  const fields = Object.values(type.getFields()).map(
+    (f, i) =>
+      printDescription(f, '  ', !i) +
+      '  ' +
+      f.name +
+      printArgs(f.args, '  ') +
+      ': ' +
+      String(f.type) +
+      printDeprecated(f.deprecationReason),
+  );
+  return printBlock(fields);
+}
+
+function printBlock(items) {
+  return items.length !== 0 ? ' {\n' + items.join('\n') + '\n}' : '';
+}
+
+function printArgs(args, indentation = '') {
+  if (args.length === 0) {
+    return '';
+  } // If every arg does not have a description, print them on one line.
+
+  if (args.every((arg) => !arg.description)) {
+    return '(' + args.map(printInputValue).join(', ') + ')';
+  }
+
+  return (
+    '(\n' +
+    args
+      .map(
+        (arg, i) =>
+          printDescription(arg, '  ' + indentation, !i) +
+          '  ' +
+          indentation +
+          printInputValue(arg),
+      )
+      .join('\n') +
+    '\n' +
+    indentation +
+    ')'
+  );
+}
+
+function printInputValue(arg) {
+  const defaultAST = astFromValue(arg.defaultValue, arg.type);
+  let argDecl = arg.name + ': ' + String(arg.type);
+
+  if (defaultAST) {
+    argDecl += ` = ${print(defaultAST)}`;
+  }
+
+  return argDecl + printDeprecated(arg.deprecationReason);
+}
+
+function printDirective(directive) {
+  return (
+    printDescription(directive) +
+    'directive @' +
+    directive.name +
+    printArgs(directive.args) +
+    (directive.isRepeatable ? ' repeatable' : '') +
+    ' on ' +
+    directive.locations.join(' | ')
+  );
+}
+
+function printDeprecated(reason) {
+  if (reason == null) {
+    return '';
+  }
+
+  if (reason !== DEFAULT_DEPRECATION_REASON) {
+    const astValue = print({
+      kind: Kind.STRING,
+      value: reason,
+    });
+    return ` @deprecated(reason: ${astValue})`;
+  }
+
+  return ' @deprecated';
+}
+
+function printSpecifiedByURL(scalar) {
+  if (scalar.specifiedByURL == null) {
+    return '';
+  }
+
+  const astValue = print({
+    kind: Kind.STRING,
+    value: scalar.specifiedByURL,
+  });
+  return ` @specifiedBy(url: ${astValue})`;
+}
+
+function printDescription(def, indentation = '', firstInBlock = true) {
+  const { description } = def;
+
+  if (description == null) {
+    return '';
+  }
+
+  const blockString = print({
+    kind: Kind.STRING,
+    value: description,
+    block: isPrintableAsBlockString(description),
+  });
+  const prefix =
+    indentation && !firstInBlock ? '\n' + indentation : indentation;
+  return prefix + blockString.replace(/\n/g, '\n' + indentation) + '\n';
+}

package/utilities/separateOperations.d.ts

@@ -0,0 +1,11 @@
+import type { ObjMap } from '../jsutils/ObjMap';
+import type { DocumentNode } from '../language/ast';
+/**
+ * separateOperations accepts a single AST document which may contain many
+ * operations and fragments and returns a collection of AST documents each of
+ * which contains a single operation as well the fragment definitions it
+ * refers to.
+ */
+export declare function separateOperations(
+  documentAST: DocumentNode,
+): ObjMap<DocumentNode>;

package/utilities/separateOperations.js

@@ -0,0 +1,88 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.separateOperations = separateOperations;
+
+var _kinds = require('../language/kinds.js');
+
+var _visitor = require('../language/visitor.js');
+
+/**
+ * separateOperations accepts a single AST document which may contain many
+ * operations and fragments and returns a collection of AST documents each of
+ * which contains a single operation as well the fragment definitions it
+ * refers to.
+ */
+function separateOperations(documentAST) {
+  const operations = [];
+  const depGraph = Object.create(null); // Populate metadata and build a dependency graph.
+
+  for (const definitionNode of documentAST.definitions) {
+    switch (definitionNode.kind) {
+      case _kinds.Kind.OPERATION_DEFINITION:
+        operations.push(definitionNode);
+        break;
+
+      case _kinds.Kind.FRAGMENT_DEFINITION:
+        depGraph[definitionNode.name.value] = collectDependencies(
+          definitionNode.selectionSet,
+        );
+        break;
+
+      default: // ignore non-executable definitions
+    }
+  } // For each operation, produce a new synthesized AST which includes only what
+  // is necessary for completing that operation.
+
+  const separatedDocumentASTs = Object.create(null);
+
+  for (const operation of operations) {
+    const dependencies = new Set();
+
+    for (const fragmentName of collectDependencies(operation.selectionSet)) {
+      collectTransitiveDependencies(dependencies, depGraph, fragmentName);
+    } // Provides the empty string for anonymous operations.
+
+    const operationName = operation.name ? operation.name.value : ''; // The list of definition nodes to be included for this operation, sorted
+    // to retain the same order as the original document.
+
+    separatedDocumentASTs[operationName] = {
+      kind: _kinds.Kind.DOCUMENT,
+      definitions: documentAST.definitions.filter(
+        (node) =>
+          node === operation ||
+          (node.kind === _kinds.Kind.FRAGMENT_DEFINITION &&
+            dependencies.has(node.name.value)),
+      ),
+    };
+  }
+
+  return separatedDocumentASTs;
+}
+
+// From a dependency graph, collects a list of transitive dependencies by
+// recursing through a dependency graph.
+function collectTransitiveDependencies(collected, depGraph, fromName) {
+  if (!collected.has(fromName)) {
+    collected.add(fromName);
+    const immediateDeps = depGraph[fromName];
+
+    if (immediateDeps !== undefined) {
+      for (const toName of immediateDeps) {
+        collectTransitiveDependencies(collected, depGraph, toName);
+      }
+    }
+  }
+}
+
+function collectDependencies(selectionSet) {
+  const dependencies = [];
+  (0, _visitor.visit)(selectionSet, {
+    FragmentSpread(node) {
+      dependencies.push(node.name.value);
+    },
+  });
+  return dependencies;
+}

package/utilities/separateOperations.mjs

@@ -0,0 +1,80 @@
+import { Kind } from '../language/kinds.mjs';
+import { visit } from '../language/visitor.mjs';
+/**
+ * separateOperations accepts a single AST document which may contain many
+ * operations and fragments and returns a collection of AST documents each of
+ * which contains a single operation as well the fragment definitions it
+ * refers to.
+ */
+
+export function separateOperations(documentAST) {
+  const operations = [];
+  const depGraph = Object.create(null); // Populate metadata and build a dependency graph.
+
+  for (const definitionNode of documentAST.definitions) {
+    switch (definitionNode.kind) {
+      case Kind.OPERATION_DEFINITION:
+        operations.push(definitionNode);
+        break;
+
+      case Kind.FRAGMENT_DEFINITION:
+        depGraph[definitionNode.name.value] = collectDependencies(
+          definitionNode.selectionSet,
+        );
+        break;
+
+      default: // ignore non-executable definitions
+    }
+  } // For each operation, produce a new synthesized AST which includes only what
+  // is necessary for completing that operation.
+
+  const separatedDocumentASTs = Object.create(null);
+
+  for (const operation of operations) {
+    const dependencies = new Set();
+
+    for (const fragmentName of collectDependencies(operation.selectionSet)) {
+      collectTransitiveDependencies(dependencies, depGraph, fragmentName);
+    } // Provides the empty string for anonymous operations.
+
+    const operationName = operation.name ? operation.name.value : ''; // The list of definition nodes to be included for this operation, sorted
+    // to retain the same order as the original document.
+
+    separatedDocumentASTs[operationName] = {
+      kind: Kind.DOCUMENT,
+      definitions: documentAST.definitions.filter(
+        (node) =>
+          node === operation ||
+          (node.kind === Kind.FRAGMENT_DEFINITION &&
+            dependencies.has(node.name.value)),
+      ),
+    };
+  }
+
+  return separatedDocumentASTs;
+}
+
+// From a dependency graph, collects a list of transitive dependencies by
+// recursing through a dependency graph.
+function collectTransitiveDependencies(collected, depGraph, fromName) {
+  if (!collected.has(fromName)) {
+    collected.add(fromName);
+    const immediateDeps = depGraph[fromName];
+
+    if (immediateDeps !== undefined) {
+      for (const toName of immediateDeps) {
+        collectTransitiveDependencies(collected, depGraph, toName);
+      }
+    }
+  }
+}
+
+function collectDependencies(selectionSet) {
+  const dependencies = [];
+  visit(selectionSet, {
+    FragmentSpread(node) {
+      dependencies.push(node.name.value);
+    },
+  });
+  return dependencies;
+}

package/utilities/sortValueNode.d.ts

@@ -0,0 +1,9 @@
+import type { ValueNode } from '../language/ast';
+/**
+ * Sort ValueNode.
+ *
+ * This function returns a sorted copy of the given ValueNode.
+ *
+ * @internal
+ */
+export declare function sortValueNode(valueNode: ValueNode): ValueNode;

package/utilities/sortValueNode.js

@@ -0,0 +1,47 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.sortValueNode = sortValueNode;
+
+var _naturalCompare = require('../jsutils/naturalCompare.js');
+
+var _kinds = require('../language/kinds.js');
+
+/**
+ * Sort ValueNode.
+ *
+ * This function returns a sorted copy of the given ValueNode.
+ *
+ * @internal
+ */
+function sortValueNode(valueNode) {
+  switch (valueNode.kind) {
+    case _kinds.Kind.OBJECT:
+      return { ...valueNode, fields: sortFields(valueNode.fields) };
+
+    case _kinds.Kind.LIST:
+      return { ...valueNode, values: valueNode.values.map(sortValueNode) };
+
+    case _kinds.Kind.INT:
+    case _kinds.Kind.FLOAT:
+    case _kinds.Kind.STRING:
+    case _kinds.Kind.BOOLEAN:
+    case _kinds.Kind.NULL:
+    case _kinds.Kind.ENUM:
+    case _kinds.Kind.VARIABLE:
+      return valueNode;
+  }
+}
+
+function sortFields(fields) {
+  return fields
+    .map((fieldNode) => ({
+      ...fieldNode,
+      value: sortValueNode(fieldNode.value),
+    }))
+    .sort((fieldA, fieldB) =>
+      (0, _naturalCompare.naturalCompare)(fieldA.name.value, fieldB.name.value),
+    );
+}

package/utilities/sortValueNode.mjs

@@ -0,0 +1,39 @@
+import { naturalCompare } from '../jsutils/naturalCompare.mjs';
+import { Kind } from '../language/kinds.mjs';
+/**
+ * Sort ValueNode.
+ *
+ * This function returns a sorted copy of the given ValueNode.
+ *
+ * @internal
+ */
+
+export function sortValueNode(valueNode) {
+  switch (valueNode.kind) {
+    case Kind.OBJECT:
+      return { ...valueNode, fields: sortFields(valueNode.fields) };
+
+    case Kind.LIST:
+      return { ...valueNode, values: valueNode.values.map(sortValueNode) };
+
+    case Kind.INT:
+    case Kind.FLOAT:
+    case Kind.STRING:
+    case Kind.BOOLEAN:
+    case Kind.NULL:
+    case Kind.ENUM:
+    case Kind.VARIABLE:
+      return valueNode;
+  }
+}
+
+function sortFields(fields) {
+  return fields
+    .map((fieldNode) => ({
+      ...fieldNode,
+      value: sortValueNode(fieldNode.value),
+    }))
+    .sort((fieldA, fieldB) =>
+      naturalCompare(fieldA.name.value, fieldB.name.value),
+    );
+}

package/utilities/stripIgnoredCharacters.d.ts

@@ -0,0 +1,62 @@
+import { Source } from '../language/source';
+/**
+ * Strips characters that are not significant to the validity or execution
+ * of a GraphQL document:
+ *   - UnicodeBOM
+ *   - WhiteSpace
+ *   - LineTerminator
+ *   - Comment
+ *   - Comma
+ *   - BlockString indentation
+ *
+ * Note: It is required to have a delimiter character between neighboring
+ * non-punctuator tokens and this function always uses single space as delimiter.
+ *
+ * It is guaranteed that both input and output documents if parsed would result
+ * in the exact same AST except for nodes location.
+ *
+ * Warning: It is guaranteed that this function will always produce stable results.
+ * However, it's not guaranteed that it will stay the same between different
+ * releases due to bugfixes or changes in the GraphQL specification.
+ *
+ * Query example:
+ *
+ * ```graphql
+ * query SomeQuery($foo: String!, $bar: String) {
+ *   someField(foo: $foo, bar: $bar) {
+ *     a
+ *     b {
+ *       c
+ *       d
+ *     }
+ *   }
+ * }
+ * ```
+ *
+ * Becomes:
+ *
+ * ```graphql
+ * query SomeQuery($foo:String!$bar:String){someField(foo:$foo bar:$bar){a b{c d}}}
+ * ```
+ *
+ * SDL example:
+ *
+ * ```graphql
+ * """
+ * Type description
+ * """
+ * type Foo {
+ *   """
+ *   Field description
+ *   """
+ *   bar: String
+ * }
+ * ```
+ *
+ * Becomes:
+ *
+ * ```graphql
+ * """Type description""" type Foo{"""Field description""" bar:String}
+ * ```
+ */
+export declare function stripIgnoredCharacters(source: string | Source): string;