@graphql-inspector/core 3.3.0 → 3.4.0

package/index.mjs

@@ -1,7 +1,8 @@
 import { __awaiter } from 'tslib';
-import { Kind, TypeInfo, visit, visitWithTypeInfo, GraphQLError, getNamedType, isScalarType, isInterfaceType, isObjectType, isUnionType, isInputObjectType, isListType, isNonNullType, isWrappingType, isEnumType, parse, extendSchema, print, validate as validate$1, printType } from 'graphql';
+import { Kind, TypeInfo, visit, visitWithTypeInfo, GraphQLError, getNamedType, isScalarType, isInterfaceType, isObjectType, isUnionType, isInputObjectType, isListType, isNonNullType, isWrappingType, isEnumType, parse, extendSchema, TokenKind, print, validate as validate$1, printType } from 'graphql';
 import inspect from 'object-inspect';
 import { DepGraph } from 'dependency-graph';
+import { Parser } from 'graphql/language/parser';
 
 function keyMap(list, keyFn) {
     return list.reduce((map, item) => {
@@ -43,7 +44,7 @@ function isVoid(a) {
     return typeof a === 'undefined' || a === null;
 }
 function diffArrays(a, b) {
-    return a.filter((c) => !b.some((d) => isEqual(d, c)));
+    return a.filter(c => !b.some(d => isEqual(d, c)));
 }
 function compareLists(oldList, newList, callbacks) {
     const oldMap = keyMap(oldList, ({ name }) => name);
@@ -94,7 +95,7 @@ function isDeprecated(fieldOrEnumValue) {
     if (fieldOrEnumValue.deprecationReason != null) {
         return true;
     }
-    if ((_b = (_a = fieldOrEnumValue.astNode) === null || _a === void 0 ? void 0 : _a.directives) === null || _b === void 0 ? void 0 : _b.some((directive) => directive.name.value === 'deprecated')) {
+    if ((_b = (_a = fieldOrEnumValue.astNode) === null || _a === void 0 ? void 0 : _a.directives) === null || _b === void 0 ? void 0 : _b.some(directive => directive.name.value === 'deprecated')) {
         return true;
     }
     return false;
@@ -109,8 +110,7 @@ function safeChangeForField(oldType, newType) {
         return safeChangeForField(ofType, newType.ofType);
     }
     if (isListType(oldType)) {
-        return ((isListType(newType) &&
-            safeChangeForField(oldType.ofType, newType.ofType)) ||
+        return ((isListType(newType) && safeChangeForField(oldType.ofType, newType.ofType)) ||
             (isNonNullType(newType) && safeChangeForField(oldType, newType.ofType)));
     }
     return false;
@@ -145,7 +145,7 @@ function getTypePrefix(type) {
     return kindsMap[kind.toString()];
 }
 function isPrimitive(type) {
-    return (['String', 'Int', 'Float', 'Boolean', 'ID'].indexOf(typeof type === 'string' ? type : type.name) !== -1);
+    return ['String', 'Int', 'Float', 'Boolean', 'ID'].indexOf(typeof type === 'string' ? type : type.name) !== -1;
 }
 function isForIntrospection(type) {
     return ([
@@ -170,7 +170,9 @@ function findDeprecatedUsages(schema, ast) {
                 if (reason) {
                     const fieldDef = typeInfo.getFieldDef();
                     if (fieldDef) {
-                        errors.push(new GraphQLError(`The argument '${argument === null || argument === void 0 ? void 0 : argument.name}' of '${fieldDef.name}' is deprecated. ${reason}`, [node]));
+                        errors.push(new GraphQLError(`The argument '${argument === null || argument === void 0 ? void 0 : argument.name}' of '${fieldDef.name}' is deprecated. ${reason}`, [
+                            node,
+                        ]));
                     }
                 }
             }
@@ -200,7 +202,7 @@ function findDeprecatedUsages(schema, ast) {
 }
 function removeFieldIfDirectives(node, directiveNames) {
     if (node.directives) {
-        if (node.directives.some((d) => directiveNames.indexOf(d.name.value) !== -1)) {
+        if (node.directives.some(d => directiveNames.indexOf(d.name.value) !== -1)) {
             return null;
         }
     }
@@ -208,7 +210,7 @@ function removeFieldIfDirectives(node, directiveNames) {
 }
 function removeDirectives(node, directiveNames) {
     if (node.directives) {
-        return Object.assign(Object.assign({}, node), { directives: node.directives.filter((d) => directiveNames.indexOf(d.name.value) === -1) });
+        return Object.assign(Object.assign({}, node), { directives: node.directives.filter(d => directiveNames.indexOf(d.name.value) === -1) });
     }
     return node;
 }
@@ -258,11 +260,7 @@ function getReachableTypes(schema) {
             }
         }
     };
-    for (const type of [
-        schema.getQueryType(),
-        schema.getMutationType(),
-        schema.getSubscriptionType(),
-    ]) {
+    for (const type of [schema.getQueryType(), schema.getMutationType(), schema.getSubscriptionType()]) {
         if (type) {
             collect(type);
         }
@@ -504,9 +502,7 @@ function directiveLocationRemoved(directive, location) {
 function directiveArgumentAdded(directive, arg) {
     return {
         criticality: {
-            level: isNonNullType(arg.type)
-                ? CriticalityLevel.Breaking
-                : CriticalityLevel.NonBreaking,
+            level: isNonNullType(arg.type) ? CriticalityLevel.Breaking : CriticalityLevel.NonBreaking,
         },
         type: ChangeType.DirectiveArgumentAdded,
         message: `Argument '${arg.name}' was added to directive '${directive.name}'`,
@@ -705,7 +701,7 @@ function compareTwoStrings(str1, str2) {
     const pairs2 = wordLetterPairs(str2);
     const union = pairs1.length + pairs2.length;
     let intersection = 0;
-    pairs1.forEach((pair1) => {
+    pairs1.forEach(pair1 => {
         for (let i = 0, pair2; (pair2 = pairs2[i]); i++) {
             if (pair1 !== pair2)
                 continue;
@@ -719,7 +715,7 @@ function compareTwoStrings(str1, str2) {
 function findBestMatch(mainString, targetStrings) {
     if (!areArgsValid(mainString, targetStrings))
         throw new Error('Bad arguments: First argument should be a string, second should be an array of strings');
-    const ratings = targetStrings.map((target) => ({
+    const ratings = targetStrings.map(target => ({
         target,
         rating: compareTwoStrings(mainString, target.value),
     }));
@@ -727,9 +723,7 @@ function findBestMatch(mainString, targetStrings) {
     return { ratings, bestMatch };
 }
 function flattenDeep(arr) {
-    return Array.isArray(arr)
-        ? arr.reduce((a, b) => a.concat(flattenDeep(b)), [])
-        : [arr];
+    return Array.isArray(arr) ? arr.reduce((a, b) => a.concat(flattenDeep(b)), []) : [arr];
 }
 function areArgsValid(mainString, targetStrings) {
     if (typeof mainString !== 'string')
@@ -738,7 +732,7 @@ function areArgsValid(mainString, targetStrings) {
         return false;
     if (!targetStrings.length)
         return false;
-    if (targetStrings.find((s) => typeof s.value !== 'string'))
+    if (targetStrings.find(s => typeof s.value !== 'string'))
         return false;
     return true;
 }
@@ -753,7 +747,9 @@ function wordLetterPairs(str) {
     return flattenDeep(pairs);
 }
 function safeString(obj) {
-    return inspect(obj).replace(/\[Object\: null prototype\] /g, '').replace(/(^')|('$)/g, '');
+    return inspect(obj)
+        .replace(/\[Object\: null prototype\] /g, '')
+        .replace(/(^')|('$)/g, '');
 }
 
 function inputFieldRemoved(input, field) {
@@ -868,14 +864,12 @@ function changesInInputField(input, oldField, newField, addChange) {
         }
     }
     if (isNotEqual(oldField.defaultValue, newField.defaultValue)) {
-        if (Array.isArray(oldField.defaultValue) &&
-            Array.isArray(newField.defaultValue)) {
+        if (Array.isArray(oldField.defaultValue) && Array.isArray(newField.defaultValue)) {
             if (diffArrays(oldField.defaultValue, newField.defaultValue).length > 0) {
                 addChange(inputFieldDefaultValueChanged(input, oldField, newField));
             }
         }
-        else if (JSON.stringify(oldField.defaultValue) !==
-            JSON.stringify(newField.defaultValue)) {
+        else if (JSON.stringify(oldField.defaultValue) !== JSON.stringify(newField.defaultValue)) {
             addChange(inputFieldDefaultValueChanged(input, oldField, newField));
         }
     }
@@ -1099,15 +1093,13 @@ function changesInArgument(type, field, oldArg, newArg, addChange) {
         addChange(fieldArgumentDescriptionChanged(type, field, oldArg, newArg));
     }
     if (isNotEqual(oldArg.defaultValue, newArg.defaultValue)) {
-        if (Array.isArray(oldArg.defaultValue) &&
-            Array.isArray(newArg.defaultValue)) {
+        if (Array.isArray(oldArg.defaultValue) && Array.isArray(newArg.defaultValue)) {
             const diff = diffArrays(oldArg.defaultValue, newArg.defaultValue);
             if (diff.length > 0) {
                 addChange(fieldArgumentDefaultChanged(type, field, oldArg, newArg));
             }
         }
-        else if (JSON.stringify(oldArg.defaultValue) !==
-            JSON.stringify(newArg.defaultValue)) {
+        else if (JSON.stringify(oldArg.defaultValue) !== JSON.stringify(newArg.defaultValue)) {
             addChange(fieldArgumentDefaultChanged(type, field, oldArg, newArg));
         }
     }
@@ -1212,9 +1204,9 @@ function changesInDirective(oldDirective, newDirective, addChange) {
         removed: diffArrays(oldDirective.locations, newDirective.locations),
     };
     // locations added
-    locations.added.forEach((location) => addChange(directiveLocationAdded(newDirective, location)));
+    locations.added.forEach(location => addChange(directiveLocationAdded(newDirective, location)));
     // locations removed
-    locations.removed.forEach((location) => addChange(directiveLocationRemoved(oldDirective, location)));
+    locations.removed.forEach(location => addChange(directiveLocationRemoved(oldDirective, location)));
     compareLists(oldDirective.args, newDirective.args, {
         onAdded(arg) {
             addChange(directiveArgumentAdded(newDirective, arg));
@@ -1245,7 +1237,7 @@ function diffSchema(oldSchema, newSchema) {
         changes.push(change);
     }
     changesInSchema(oldSchema, newSchema, addChange);
-    compareLists(Object.values(oldSchema.getTypeMap()).filter((t) => !isPrimitive(t)), Object.values(newSchema.getTypeMap()).filter((t) => !isPrimitive(t)), {
+    compareLists(Object.values(oldSchema.getTypeMap()).filter(t => !isPrimitive(t)), Object.values(newSchema.getTypeMap()).filter(t => !isPrimitive(t)), {
         onAdded(type) {
             addChange(typeAdded(type));
         },
@@ -1330,7 +1322,7 @@ function changesInType(oldType, newType, addChange) {
 }
 
 const dangerousBreaking = ({ changes }) => {
-    return changes.map((change) => {
+    return changes.map(change => {
         if (change.criticality.level === CriticalityLevel.Dangerous) {
             return Object.assign(Object.assign({}, change), { criticality: Object.assign(Object.assign({}, change.criticality), { level: CriticalityLevel.Breaking }) });
         }
@@ -1342,8 +1334,8 @@ function parsePath(path) {
     return path.split('.');
 }
 
-const suppressRemovalOfDeprecatedField = ({ changes, oldSchema, }) => {
-    return changes.map((change) => {
+const suppressRemovalOfDeprecatedField = ({ changes, oldSchema }) => {
+    return changes.map(change => {
         if (change.type === ChangeType.FieldRemoved &&
             change.criticality.level === CriticalityLevel.Breaking &&
             change.path) {
@@ -1398,15 +1390,15 @@ const descriptionChangeTypes = [
     ChangeType.TypeDescriptionChanged,
 ];
 const ignoreDescriptionChanges = ({ changes }) => {
-    return changes.filter((change) => descriptionChangeTypes.indexOf(change.type) === -1);
+    return changes.filter(change => descriptionChangeTypes.indexOf(change.type) === -1);
 };
 
-const considerUsage = ({ changes, config, }) => __awaiter(void 0, void 0, void 0, function* () {
+const considerUsage = ({ changes, config }) => __awaiter(void 0, void 0, void 0, function* () {
     if (!config) {
         throw new Error(`considerUsage rule is missing config`);
     }
     const collectedBreakingField = [];
-    changes.forEach((change) => {
+    changes.forEach(change => {
         if (change.criticality.level === CriticalityLevel.Breaking && change.path) {
             const [typeName, fieldName, argumentName] = parsePath(change.path);
             collectedBreakingField.push({
@@ -1423,11 +1415,11 @@ const considerUsage = ({ changes, config, }) => __awaiter(void 0, void 0, void 0
     const suppressedPaths = collectedBreakingField
         .filter((_, i) => usageList[i] === true)
         .map(({ type, field, argument }) => [type, field, argument].filter(Boolean).join('.'));
-    return changes.map((change) => {
+    return changes.map(change => {
         // Turns those "safe to break" changes into "dangerous"
         if (change.criticality.level === CriticalityLevel.Breaking &&
             change.path &&
-            suppressedPaths.some((p) => change.path.startsWith(p))) {
+            suppressedPaths.some(p => change.path.startsWith(p))) {
             return Object.assign(Object.assign({}, change), { criticality: Object.assign(Object.assign({}, change.criticality), { level: CriticalityLevel.Dangerous }), message: `${change.message} (non-breaking based on usage)` });
         }
         return change;
@@ -1436,7 +1428,7 @@ const considerUsage = ({ changes, config, }) => __awaiter(void 0, void 0, void 0
 
 const safeUnreachable = ({ changes, oldSchema }) => {
     const reachable = getReachableTypes(oldSchema);
-    return changes.map((change) => {
+    return changes.map(change => {
         if (change.criticality.level === CriticalityLevel.Breaking && change.path) {
             const [typeName] = parsePath(change.path);
             if (!reachable.has(typeName)) {
@@ -1543,7 +1535,7 @@ function calculateDepth({ node, currentDepth, maxDepth, getFragment, }) {
             return 1 + maxInnerDepth;
         }
         case Kind.SELECTION_SET: {
-            return Math.max(...node.selections.map((selection) => {
+            return Math.max(...node.selections.map(selection => {
                 return calculateDepth({
                     node: selection,
                     currentDepth: currentDepth,
@@ -1553,7 +1545,7 @@ function calculateDepth({ node, currentDepth, maxDepth, getFragment, }) {
             }));
         }
         case Kind.DOCUMENT: {
-            return Math.max(...node.definitions.map((def) => {
+            return Math.max(...node.definitions.map(def => {
                 return calculateDepth({
                     node: def,
                     currentDepth: currentDepth,
@@ -1565,7 +1557,7 @@ function calculateDepth({ node, currentDepth, maxDepth, getFragment, }) {
         case Kind.OPERATION_DEFINITION:
         case Kind.INLINE_FRAGMENT:
         case Kind.FRAGMENT_DEFINITION: {
-            return Math.max(...node.selectionSet.selections.map((selection) => {
+            return Math.max(...node.selectionSet.selections.map(selection => {
                 return calculateDepth({
                     node: selection,
                     currentDepth,
@@ -1586,13 +1578,26 @@ function calculateDepth({ node, currentDepth, maxDepth, getFragment, }) {
         }
     }
 }
+function countDepth(node, parentDepth, getFragmentReference) {
+    let depth = parentDepth;
+    if ('selectionSet' in node && node.selectionSet) {
+        for (let child of node.selectionSet.selections) {
+            depth = Math.max(depth, countDepth(child, parentDepth + 1, getFragmentReference));
+        }
+    }
+    if (node.kind == Kind.FRAGMENT_SPREAD) {
+        const fragment = getFragmentReference(node.name.value);
+        if (fragment) {
+            depth = Math.max(depth, countDepth(fragment, parentDepth + 1, getFragmentReference));
+        }
+    }
+    return depth;
+}
 
 function transformDocumentWithApollo(doc, { keepClientFields }) {
     return visit(doc, {
         Field(node) {
-            return keepClientFields
-                ? removeDirectives(node, ['client'])
-                : removeFieldIfDirectives(node, ['client']);
+            return keepClientFields ? removeDirectives(node, ['client']) : removeFieldIfDirectives(node, ['client']);
         },
     });
 }
@@ -1602,6 +1607,116 @@ function transformSchemaWithApollo(schema) {
     `));
 }
 
+function validateAliasCount({ source, doc, maxAliasCount, fragmentGraph, }) {
+    const getFragmentByFragmentName = (fragmentName) => fragmentGraph.getNodeData(fragmentName);
+    for (const definition of doc.definitions) {
+        if (definition.kind !== Kind.OPERATION_DEFINITION) {
+            continue;
+        }
+        const aliasCount = countAliases(definition, getFragmentByFragmentName);
+        if (aliasCount > maxAliasCount) {
+            return new GraphQLError(`Too many aliases (${aliasCount}). Maximum allowed is ${maxAliasCount}`, [definition], source, definition.loc && definition.loc.start ? [definition.loc.start] : undefined);
+        }
+    }
+}
+function countAliases(node, getFragmentByName) {
+    let aliases = 0;
+    if ('alias' in node && node.alias) {
+        ++aliases;
+    }
+    if ('selectionSet' in node && node.selectionSet) {
+        for (let child of node.selectionSet.selections) {
+            aliases += countAliases(child, getFragmentByName);
+        }
+    }
+    else if (node.kind === Kind.FRAGMENT_SPREAD) {
+        const fragmentNode = getFragmentByName(node.name.value);
+        if (fragmentNode) {
+            aliases += countAliases(fragmentNode, getFragmentByName);
+        }
+    }
+    return aliases;
+}
+
+function validateDirectiveCount({ source, doc, maxDirectiveCount, fragmentGraph, }) {
+    const getFragmentByFragmentName = (fragmentName) => fragmentGraph.getNodeData(fragmentName);
+    for (const definition of doc.definitions) {
+        if (definition.kind !== Kind.OPERATION_DEFINITION) {
+            continue;
+        }
+        const directiveCount = countDirectives(definition, getFragmentByFragmentName);
+        if (directiveCount > maxDirectiveCount) {
+            return new GraphQLError(`Too many directives (${directiveCount}). Maximum allowed is ${maxDirectiveCount}`, [definition], source, definition.loc && definition.loc.start ? [definition.loc.start] : undefined);
+        }
+    }
+}
+function countDirectives(node, getFragmentByName) {
+    let directives = 0;
+    if (node.directives) {
+        directives += node.directives.length;
+    }
+    if ('selectionSet' in node && node.selectionSet) {
+        for (let child of node.selectionSet.selections) {
+            directives += countDirectives(child, getFragmentByName);
+        }
+    }
+    if (node.kind == Kind.FRAGMENT_SPREAD) {
+        const fragment = getFragmentByName(node.name.value);
+        if (fragment) {
+            directives += countDirectives(fragment, getFragmentByName);
+        }
+    }
+    return directives;
+}
+
+class ParserWithLexer extends Parser {
+    constructor(source, options) {
+        super(source, options);
+        this.__tokenCount = 0;
+        const lexer = this._lexer;
+        this._lexer = new Proxy(lexer, {
+            get: (target, prop, receiver) => {
+                if (prop === 'advance') {
+                    return () => {
+                        const token = target.advance();
+                        if (token.kind !== TokenKind.EOF) {
+                            this.__tokenCount++;
+                        }
+                        return token;
+                    };
+                }
+                return Reflect.get(target, prop, receiver);
+            },
+        });
+    }
+    get tokenCount() {
+        return this.__tokenCount;
+    }
+}
+function calculateTokenCount(args) {
+    const parser = new ParserWithLexer(args.source);
+    const document = parser.parseDocument();
+    let { tokenCount } = parser;
+    visit(document, {
+        FragmentSpread(node) {
+            const fragmentSource = args.getReferencedFragmentSource(node.name.value);
+            if (fragmentSource) {
+                tokenCount += calculateTokenCount({
+                    source: fragmentSource,
+                    getReferencedFragmentSource: args.getReferencedFragmentSource,
+                });
+            }
+        },
+    });
+    return tokenCount;
+}
+function validateTokenCount(args) {
+    const tokenCount = calculateTokenCount(args);
+    if (tokenCount > args.maxTokenCount) {
+        return new GraphQLError(`Query exceeds maximum token count of ${args.maxTokenCount} (actual: ${tokenCount})`, args.document, args.source, args.document.loc && args.document.loc.start ? [args.document.loc.start] : undefined);
+    }
+}
+
 function validate(schema, sources, options) {
     const config = Object.assign({ strictDeprecated: true, strictFragments: true, keepClientFields: false, apollo: false }, options);
     const invalidDocuments = [];
@@ -1611,43 +1726,41 @@ function validate(schema, sources, options) {
     const fragments = [];
     const fragmentNames = [];
     const graph = new DepGraph({ circular: true });
-    documents.forEach((doc) => {
-        doc.fragments.forEach((fragment) => {
+    documents.forEach(doc => {
+        doc.fragments.forEach(fragment => {
             fragmentNames.push(fragment.node.name.value);
             fragments.push(fragment);
             graph.addNode(fragment.node.name.value, fragment.node);
         });
     });
-    fragments.forEach((fragment) => {
+    fragments.forEach(fragment => {
         const depends = extractFragments(print(fragment.node));
         if (depends) {
-            depends.forEach((name) => {
+            depends.forEach(name => {
                 graph.addDependency(fragment.node.name.value, name);
             });
         }
     });
     documents
         // since we include fragments, validate only operations
-        .filter((doc) => doc.hasOperations)
-        .forEach((doc) => {
+        .filter(doc => doc.hasOperations)
+        .forEach(doc => {
         const docWithOperations = {
             kind: Kind.DOCUMENT,
-            definitions: doc.operations.map((d) => d.node),
+            definitions: doc.operations.map(d => d.node),
         };
         const extractedFragments = (extractFragments(print(docWithOperations)) || [])
             // resolve all nested fragments
-            .map((fragmentName) => resolveFragment(graph.getNodeData(fragmentName), graph))
+            .map(fragmentName => resolveFragment(graph.getNodeData(fragmentName), graph))
             // flatten arrays
             .reduce((list, current) => list.concat(current), [])
             // remove duplicates
-            .filter((def, i, all) => all.findIndex((item) => item.name.value === def.name.value) === i);
+            .filter((def, i, all) => all.findIndex(item => item.name.value === def.name.value) === i);
         const merged = {
             kind: Kind.DOCUMENT,
             definitions: [...docWithOperations.definitions, ...extractedFragments],
         };
-        let transformedSchema = config.apollo
-            ? transformSchemaWithApollo(schema)
-            : schema;
+        let transformedSchema = config.apollo ? transformSchemaWithApollo(schema) : schema;
         const transformedDoc = config.apollo
             ? transformDocumentWithApollo(merged, {
                 keepClientFields: config.keepClientFields,
@@ -1665,12 +1778,41 @@ function validate(schema, sources, options) {
                 errors.push(depthError);
             }
         }
-        const deprecated = config.strictDeprecated
-            ? findDeprecatedUsages(transformedSchema, transformedDoc)
-            : [];
-        const duplicatedFragments = config.strictFragments
-            ? findDuplicatedFragments(fragmentNames)
-            : [];
+        if (config.maxAliasCount) {
+            const aliasError = validateAliasCount({
+                source: doc.source,
+                doc: transformedDoc,
+                maxAliasCount: config.maxAliasCount,
+                fragmentGraph: graph,
+            });
+            if (aliasError) {
+                errors.push(aliasError);
+            }
+        }
+        if (config.maxDirectiveCount) {
+            const directiveError = validateDirectiveCount({
+                source: doc.source,
+                doc: transformedDoc,
+                maxDirectiveCount: config.maxDirectiveCount,
+                fragmentGraph: graph,
+            });
+            if (directiveError) {
+                errors.push(directiveError);
+            }
+        }
+        if (config.maxTokenCount) {
+            const tokenCountError = validateTokenCount({
+                source: doc.source,
+                document: transformedDoc,
+                maxTokenCount: config.maxTokenCount,
+                getReferencedFragmentSource: fragmentName => print(graph.getNodeData(fragmentName)),
+            });
+            if (tokenCountError) {
+                errors.push(tokenCountError);
+            }
+        }
+        const deprecated = config.strictDeprecated ? findDeprecatedUsages(transformedSchema, transformedDoc) : [];
+        const duplicatedFragments = config.strictFragments ? findDuplicatedFragments(fragmentNames) : [];
         if (sumLengths(errors, duplicatedFragments, deprecated) > 0) {
             invalidDocuments.push({
                 source: doc.source,
@@ -1684,7 +1826,7 @@ function validate(schema, sources, options) {
 function findDuplicatedFragments(fragmentNames) {
     return fragmentNames
         .filter((name, i, all) => all.indexOf(name) !== i)
-        .map((name) => new GraphQLError(`Name of '${name}' fragment is not unique`));
+        .map(name => new GraphQLError(`Name of '${name}' fragment is not unique`));
 }
 //
 // PostInfo -> AuthorInfo
@@ -1693,13 +1835,10 @@ function findDuplicatedFragments(fragmentNames) {
 function resolveFragment(fragment, graph) {
     return graph
         .dependenciesOf(fragment.name.value)
-        .reduce((list, current) => [
-        ...list,
-        ...resolveFragment(graph.getNodeData(current), graph),
-    ], [fragment]);
+        .reduce((list, current) => [...list, ...resolveFragment(graph.getNodeData(current), graph)], [fragment]);
 }
 function extractFragments(document) {
-    return (document.match(/[\.]{3}[a-z0-9\_]+\b/gi) || []).map((name) => name.replace('...', ''));
+    return (document.match(/[\.]{3}[a-z0-9\_]+\b/gi) || []).map(name => name.replace('...', ''));
 }
 function sumLengths(...arrays) {
     return arrays.reduce((sum, { length }) => sum + length, 0);
@@ -1708,20 +1847,19 @@ function sumLengths(...arrays) {
 function similar(schema, typeName, threshold = 0.4) {
     const typeMap = schema.getTypeMap();
     const targets = Object.keys(schema.getTypeMap())
-        .filter((name) => !isPrimitive(name) && !isForIntrospection(name))
-        .map((name) => ({
+        .filter(name => !isPrimitive(name) && !isForIntrospection(name))
+        .map(name => ({
         typeId: name,
         value: stripType(typeMap[name]),
     }));
     const results = {};
-    if (typeof typeName !== 'undefined' &&
-        !targets.some((t) => t.typeId === typeName)) {
+    if (typeof typeName !== 'undefined' && !targets.some(t => t.typeId === typeName)) {
         throw new Error(`Type '${typeName}' doesn't exist`);
     }
-    (typeName ? [{ typeId: typeName, value: '' }] : targets).forEach((source) => {
+    (typeName ? [{ typeId: typeName, value: '' }] : targets).forEach(source => {
         const sourceType = schema.getType(source.typeId);
-        const matchWith = targets.filter((target) => schema.getType(target.typeId).astNode.kind ===
-            sourceType.astNode.kind && target.typeId !== source.typeId);
+        const matchWith = targets.filter(target => schema.getType(target.typeId).astNode.kind === sourceType.astNode.kind &&
+            target.typeId !== source.typeId);
         if (matchWith.length > 0) {
             const found = similarTo(sourceType, matchWith, threshold);
             if (found) {
@@ -1732,7 +1870,7 @@ function similar(schema, typeName, threshold = 0.4) {
     return results;
 }
 function similarTo(type, targets, threshold) {
-    const types = targets.filter((target) => target.typeId !== type.name);
+    const types = targets.filter(target => target.typeId !== type.name);
     const result = findBestMatch(stripType(type), types);
     if (result.bestMatch.rating < threshold) {
         return;
@@ -1740,7 +1878,7 @@ function similarTo(type, targets, threshold) {
     return {
         bestMatch: result.bestMatch,
         ratings: result.ratings
-            .filter((r) => r.rating >= threshold && r.target !== result.bestMatch.target)
+            .filter(r => r.rating >= threshold && r.target !== result.bestMatch.target)
             .sort((a, b) => a.rating - b.rating)
             .reverse(),
     };
@@ -1752,7 +1890,7 @@ function stripType(type) {
         .replace(/\}$/g, '')
         .trim()
         .split('\n')
-        .map((s) => s.trim())
+        .map(s => s.trim())
         .sort((a, b) => a.localeCompare(b))
         .join(' ');
 }
@@ -1764,7 +1902,7 @@ function coverage(schema, sources) {
     };
     const typeMap = schema.getTypeMap();
     const typeInfo = new TypeInfo(schema);
-    const visitor = (source) => ({
+    const visitor = source => ({
         Field(node) {
             const fieldDef = typeInfo.getFieldDef();
             const parent = typeInfo.getParentType();
@@ -1782,20 +1920,14 @@ function coverage(schema, sources) {
                 typeCoverage.hits++;
                 fieldCoverage.hits++;
                 if (node.loc) {
-                    fieldCoverage.locations[sourceName] = [
-                        node.loc,
-                        ...(locations || []),
-                    ];
+                    fieldCoverage.locations[sourceName] = [node.loc, ...(locations || [])];
                 }
                 if (node.arguments) {
                     for (const argNode of node.arguments) {
                         const argCoverage = fieldCoverage.children[argNode.name.value];
                         argCoverage.hits++;
                         if (argNode.loc) {
-                            argCoverage.locations[sourceName] = [
-                                argNode.loc,
-                                ...(argCoverage.locations[sourceName] || []),
-                            ];
+                            argCoverage.locations[sourceName] = [argNode.loc, ...(argCoverage.locations[sourceName] || [])];
                         }
                     }
                 }
@@ -1833,14 +1965,31 @@ function coverage(schema, sources) {
     const documents = coverage.sources.map(readDocument);
     documents.forEach((doc, i) => {
         const source = coverage.sources[i];
-        doc.operations.forEach((op) => {
+        doc.operations.forEach(op => {
             visit(op.node, visitWithTypeInfo(typeInfo, visitor(source)));
         });
-        doc.fragments.forEach((fr) => {
+        doc.fragments.forEach(fr => {
             visit(fr.node, visitWithTypeInfo(typeInfo, visitor(source)));
         });
     });
     return coverage;
 }
 
-export { ChangeType, CriticalityLevel, DiffRule, coverage, diff, getTypePrefix, similar, validate };
+function calculateOperationComplexity(node, config, getFragmentByName, depth = 0) {
+    let cost = config.scalarCost;
+    if ('selectionSet' in node && node.selectionSet) {
+        cost = config.objectCost;
+        for (let child of node.selectionSet.selections) {
+            cost += config.depthCostFactor * calculateOperationComplexity(child, config, getFragmentByName, depth + 1);
+        }
+    }
+    if (node.kind == Kind.FRAGMENT_SPREAD) {
+        const fragment = getFragmentByName(node.name.value);
+        if (fragment) {
+            cost += config.depthCostFactor * calculateOperationComplexity(fragment, config, getFragmentByName, depth + 1);
+        }
+    }
+    return cost;
+}
+
+export { ChangeType, CriticalityLevel, DiffRule, calculateOperationComplexity, calculateTokenCount, countAliases, countDepth, countDirectives, coverage, diff, getTypePrefix, similar, validate };