@graphql-inspector/core 4.1.0 → 4.1.1-alpha-20230418154415-aa03cdf5

package/cjs/ast/document.js

@@ -13,7 +13,7 @@ function readDocument(source) {
     const documentNode = (0, graphql_1.parse)(source.body);
     const filepath = source.name;
     const definitions = documentNode.definitions || [];
-    definitions.forEach((node) => {
+    for (const node of definitions) {
         if (isOperation(node)) {
             result.operations.push({
                 node,
@@ -26,7 +26,7 @@ function readDocument(source) {
                 source: filepath,
             });
         }
-    });
+    }
     result.hasFragments = result.fragments.length > 0;
     result.hasOperations = result.operations.length > 0;
     return result;

package/cjs/coverage/index.js

@@ -86,22 +86,22 @@ function coverage(schema, sources) {
         }
     }
     const documents = coverage.sources.map(document_js_1.readDocument);
-    documents.forEach((doc, i) => {
+    for (const [i, doc] of documents.entries()) {
         const source = coverage.sources[i];
-        doc.operations.forEach(op => {
+        for (const op of doc.operations) {
             (0, graphql_1.visit)(op.node, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor(source)));
-        });
-        doc.fragments.forEach(fr => {
+        }
+        for (const fr of doc.fragments) {
             (0, graphql_1.visit)(fr.node, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor(source)));
-        });
-    });
+        }
+    }
     for (const key in coverage.types) {
         const me = coverage.types[key];
         processStats(me);
         coverage.stats.numTypes++;
         if (me.fieldsCountCovered > 0)
             coverage.stats.numTypesCovered++;
-        if (me.fieldsCount == me.fieldsCountCovered)
+        if (me.fieldsCount === me.fieldsCountCovered)
             coverage.stats.numTypesCoveredFully++;
         coverage.stats.numFields += me.fieldsCount;
         coverage.stats.numFiledsCovered += me.fieldsCountCovered;

package/cjs/diff/directive.js

@@ -12,9 +12,11 @@ function changesInDirective(oldDirective, newDirective, addChange) {
         removed: (0, compare_js_1.diffArrays)(oldDirective.locations, newDirective.locations),
     };
     // locations added
-    locations.added.forEach(location => addChange((0, directive_js_1.directiveLocationAdded)(newDirective, location)));
+    for (const location of locations.added)
+        addChange((0, directive_js_1.directiveLocationAdded)(newDirective, location));
     // locations removed
-    locations.removed.forEach(location => addChange((0, directive_js_1.directiveLocationRemoved)(oldDirective, location)));
+    for (const location of locations.removed)
+        addChange((0, directive_js_1.directiveLocationRemoved)(oldDirective, location));
     (0, compare_js_1.compareLists)(oldDirective.args, newDirective.args, {
         onAdded(arg) {
             addChange((0, directive_js_1.directiveArgumentAdded)(newDirective, arg));

package/cjs/diff/rules/consider-usage.js

@@ -9,7 +9,7 @@ const considerUsage = ({ changes, config }) => tslib_1.__awaiter(void 0, void 0,
         throw new Error(`considerUsage rule is missing config`);
     }
     const collectedBreakingField = [];
-    changes.forEach(change => {
+    for (const change of changes) {
         if (change.criticality.level === change_js_1.CriticalityLevel.Breaking && change.path) {
             const [typeName, fieldName, argumentName] = (0, path_js_1.parsePath)(change.path);
             collectedBreakingField.push({
@@ -18,7 +18,7 @@ const considerUsage = ({ changes, config }) => tslib_1.__awaiter(void 0, void 0,
                 argument: argumentName,
             });
         }
-    });
+    }
     // True if safe to break, false otherwise
     const usageList = yield config.checkUsage(collectedBreakingField);
     // turns an array of booleans into an array of `Type.Field` strings

package/cjs/similar/index.js

@@ -16,7 +16,7 @@ function similar(schema, typeName, threshold = 0.4) {
     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 => {
+    for (const source of typeName ? [{ typeId: typeName, value: '' }] : targets) {
         const sourceType = schema.getType(source.typeId);
         const matchWith = targets.filter(target => schema.getType(target.typeId).astNode.kind === sourceType.astNode.kind &&
             target.typeId !== source.typeId);
@@ -26,7 +26,7 @@ function similar(schema, typeName, threshold = 0.4) {
                 results[source.typeId] = found;
             }
         }
-    });
+    }
     return results;
 }
 exports.similar = similar;

package/cjs/utils/compare.js

@@ -73,13 +73,19 @@ function compareLists(oldList, newList, callbacks) {
     }
     if (callbacks) {
         if (callbacks.onAdded) {
-            added.forEach(callbacks.onAdded);
+            for (const item of added) {
+                callbacks.onAdded(item);
+            }
         }
         if (callbacks.onRemoved) {
-            removed.forEach(callbacks.onRemoved);
+            for (const item of removed) {
+                callbacks.onRemoved(item);
+            }
         }
         if (callbacks.onMutual) {
-            mutual.forEach(callbacks.onMutual);
+            for (const item of mutual) {
+                callbacks.onMutual(item);
+            }
         }
     }
     return {

package/cjs/utils/string.js

@@ -16,7 +16,7 @@ function compareTwoStrings(str1, str2) {
     const pairs2 = wordLetterPairs(str2);
     const union = pairs1.length + pairs2.length;
     let intersection = 0;
-    pairs1.forEach(pair1 => {
+    for (const pair1 of pairs1) {
         for (let i = 0, pair2; (pair2 = pairs2[i]); i++) {
             if (pair1 !== pair2)
                 continue;
@@ -24,7 +24,7 @@ function compareTwoStrings(str1, str2) {
             pairs2.splice(i, 1);
             break;
         }
-    });
+    }
     return (intersection * 2) / union;
 }
 function findBestMatch(mainString, targetStrings) {

package/cjs/validate/complexity.js

@@ -26,7 +26,7 @@ function calculateOperationComplexity(node, config, getFragmentByName, depth = 0
                     calculateOperationComplexity(child, config, getFragmentByName, depth + 1);
         }
     }
-    if (node.kind == graphql_1.Kind.FRAGMENT_SPREAD) {
+    if (node.kind === graphql_1.Kind.FRAGMENT_SPREAD) {
         const fragment = getFragmentByName(node.name.value);
         if (fragment) {
             cost +=

package/cjs/validate/directive-count.js

@@ -26,7 +26,7 @@ function countDirectives(node, getFragmentByName) {
             directives += countDirectives(child, getFragmentByName);
         }
     }
-    if (node.kind == graphql_1.Kind.FRAGMENT_SPREAD) {
+    if (node.kind === graphql_1.Kind.FRAGMENT_SPREAD) {
         const fragment = getFragmentByName(node.name.value);
         if (fragment) {
             directives += countDirectives(fragment, getFragmentByName);

package/cjs/validate/index.js

@@ -19,25 +19,24 @@ function validate(schema, sources, options) {
     const fragments = [];
     const fragmentNames = [];
     const graph = new dependency_graph_1.DepGraph({ circular: true });
-    documents.forEach(doc => {
-        doc.fragments.forEach(fragment => {
+    for (const doc of documents) {
+        for (const fragment of doc.fragments) {
             fragmentNames.push(fragment.node.name.value);
             fragments.push(fragment);
             graph.addNode(fragment.node.name.value, fragment.node);
-        });
-    });
-    fragments.forEach(fragment => {
+        }
+    }
+    for (const fragment of fragments) {
         const depends = extractFragments((0, graphql_1.print)(fragment.node));
         if (depends) {
-            depends.forEach(name => {
+            for (const name of depends) {
                 graph.addDependency(fragment.node.name.value, name);
-            });
+            }
         }
-    });
-    documents
+    }
+    for (const doc of documents
         // since we include fragments, validate only operations
-        .filter(doc => doc.hasOperations)
-        .forEach(doc => {
+        .filter(doc => doc.hasOperations)) {
         const docWithOperations = {
             kind: graphql_1.Kind.DOCUMENT,
             definitions: doc.operations.map(d => d.node),
@@ -117,7 +116,7 @@ function validate(schema, sources, options) {
                 deprecated,
             });
         }
-    });
+    }
     return invalidDocuments;
 }
 exports.validate = validate;

package/cjs/validate/query-depth.js

@@ -92,7 +92,7 @@ function countDepth(node, parentDepth, getFragmentReference) {
             depth = Math.max(depth, countDepth(child, parentDepth + 1, getFragmentReference));
         }
     }
-    if (node.kind == graphql_1.Kind.FRAGMENT_SPREAD) {
+    if (node.kind === graphql_1.Kind.FRAGMENT_SPREAD) {
         const fragment = getFragmentReference(node.name.value);
         if (fragment) {
             depth = Math.max(depth, countDepth(fragment, parentDepth + 1, getFragmentReference));

package/esm/ast/document.js

@@ -10,7 +10,7 @@ export function readDocument(source) {
     const documentNode = parse(source.body);
     const filepath = source.name;
     const definitions = documentNode.definitions || [];
-    definitions.forEach((node) => {
+    for (const node of definitions) {
         if (isOperation(node)) {
             result.operations.push({
                 node,
@@ -23,7 +23,7 @@ export function readDocument(source) {
                 source: filepath,
             });
         }
-    });
+    }
     result.hasFragments = result.fragments.length > 0;
     result.hasOperations = result.operations.length > 0;
     return result;

package/esm/coverage/index.js

@@ -83,22 +83,22 @@ export function coverage(schema, sources) {
         }
     }
     const documents = coverage.sources.map(readDocument);
-    documents.forEach((doc, i) => {
+    for (const [i, doc] of documents.entries()) {
         const source = coverage.sources[i];
-        doc.operations.forEach(op => {
+        for (const op of doc.operations) {
             visit(op.node, visitWithTypeInfo(typeInfo, visitor(source)));
-        });
-        doc.fragments.forEach(fr => {
+        }
+        for (const fr of doc.fragments) {
             visit(fr.node, visitWithTypeInfo(typeInfo, visitor(source)));
-        });
-    });
+        }
+    }
     for (const key in coverage.types) {
         const me = coverage.types[key];
         processStats(me);
         coverage.stats.numTypes++;
         if (me.fieldsCountCovered > 0)
             coverage.stats.numTypesCovered++;
-        if (me.fieldsCount == me.fieldsCountCovered)
+        if (me.fieldsCount === me.fieldsCountCovered)
             coverage.stats.numTypesCoveredFully++;
         coverage.stats.numFields += me.fieldsCount;
         coverage.stats.numFiledsCovered += me.fieldsCountCovered;

package/esm/diff/directive.js

@@ -9,9 +9,11 @@ export function changesInDirective(oldDirective, newDirective, addChange) {
         removed: diffArrays(oldDirective.locations, newDirective.locations),
     };
     // locations added
-    locations.added.forEach(location => addChange(directiveLocationAdded(newDirective, location)));
+    for (const location of locations.added)
+        addChange(directiveLocationAdded(newDirective, location));
     // locations removed
-    locations.removed.forEach(location => addChange(directiveLocationRemoved(oldDirective, location)));
+    for (const location of locations.removed)
+        addChange(directiveLocationRemoved(oldDirective, location));
     compareLists(oldDirective.args, newDirective.args, {
         onAdded(arg) {
             addChange(directiveArgumentAdded(newDirective, arg));

package/esm/diff/rules/consider-usage.js

@@ -6,7 +6,7 @@ export const considerUsage = ({ changes, config }) => __awaiter(void 0, void 0,
         throw new Error(`considerUsage rule is missing config`);
     }
     const collectedBreakingField = [];
-    changes.forEach(change => {
+    for (const change of changes) {
         if (change.criticality.level === CriticalityLevel.Breaking && change.path) {
             const [typeName, fieldName, argumentName] = parsePath(change.path);
             collectedBreakingField.push({
@@ -15,7 +15,7 @@ export const considerUsage = ({ changes, config }) => __awaiter(void 0, void 0,
                 argument: argumentName,
             });
         }
-    });
+    }
     // True if safe to break, false otherwise
     const usageList = yield config.checkUsage(collectedBreakingField);
     // turns an array of booleans into an array of `Type.Field` strings

package/esm/similar/index.js

@@ -13,7 +13,7 @@ export function similar(schema, typeName, threshold = 0.4) {
     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 => {
+    for (const source of typeName ? [{ typeId: typeName, value: '' }] : targets) {
         const sourceType = schema.getType(source.typeId);
         const matchWith = targets.filter(target => schema.getType(target.typeId).astNode.kind === sourceType.astNode.kind &&
             target.typeId !== source.typeId);
@@ -23,7 +23,7 @@ export function similar(schema, typeName, threshold = 0.4) {
                 results[source.typeId] = found;
             }
         }
-    });
+    }
     return results;
 }
 function similarTo(type, targets, threshold) {

package/esm/utils/compare.js

@@ -65,13 +65,19 @@ export function compareLists(oldList, newList, callbacks) {
     }
     if (callbacks) {
         if (callbacks.onAdded) {
-            added.forEach(callbacks.onAdded);
+            for (const item of added) {
+                callbacks.onAdded(item);
+            }
         }
         if (callbacks.onRemoved) {
-            removed.forEach(callbacks.onRemoved);
+            for (const item of removed) {
+                callbacks.onRemoved(item);
+            }
         }
         if (callbacks.onMutual) {
-            mutual.forEach(callbacks.onMutual);
+            for (const item of mutual) {
+                callbacks.onMutual(item);
+            }
         }
     }
     return {

package/esm/utils/string.js

@@ -12,7 +12,7 @@ function compareTwoStrings(str1, str2) {
     const pairs2 = wordLetterPairs(str2);
     const union = pairs1.length + pairs2.length;
     let intersection = 0;
-    pairs1.forEach(pair1 => {
+    for (const pair1 of pairs1) {
         for (let i = 0, pair2; (pair2 = pairs2[i]); i++) {
             if (pair1 !== pair2)
                 continue;
@@ -20,7 +20,7 @@ function compareTwoStrings(str1, str2) {
             pairs2.splice(i, 1);
             break;
         }
-    });
+    }
     return (intersection * 2) / union;
 }
 export function findBestMatch(mainString, targetStrings) {

package/esm/validate/complexity.js

@@ -22,7 +22,7 @@ export function calculateOperationComplexity(node, config, getFragmentByName, de
                     calculateOperationComplexity(child, config, getFragmentByName, depth + 1);
         }
     }
-    if (node.kind == Kind.FRAGMENT_SPREAD) {
+    if (node.kind === Kind.FRAGMENT_SPREAD) {
         const fragment = getFragmentByName(node.name.value);
         if (fragment) {
             cost +=

package/esm/validate/directive-count.js

@@ -22,7 +22,7 @@ export function countDirectives(node, getFragmentByName) {
             directives += countDirectives(child, getFragmentByName);
         }
     }
-    if (node.kind == Kind.FRAGMENT_SPREAD) {
+    if (node.kind === Kind.FRAGMENT_SPREAD) {
         const fragment = getFragmentByName(node.name.value);
         if (fragment) {
             directives += countDirectives(fragment, getFragmentByName);

package/esm/validate/index.js

@@ -16,25 +16,24 @@ export function validate(schema, sources, options) {
     const fragments = [];
     const fragmentNames = [];
     const graph = new DepGraph({ circular: true });
-    documents.forEach(doc => {
-        doc.fragments.forEach(fragment => {
+    for (const doc of documents) {
+        for (const fragment of doc.fragments) {
             fragmentNames.push(fragment.node.name.value);
             fragments.push(fragment);
             graph.addNode(fragment.node.name.value, fragment.node);
-        });
-    });
-    fragments.forEach(fragment => {
+        }
+    }
+    for (const fragment of fragments) {
         const depends = extractFragments(print(fragment.node));
         if (depends) {
-            depends.forEach(name => {
+            for (const name of depends) {
                 graph.addDependency(fragment.node.name.value, name);
-            });
+            }
         }
-    });
-    documents
+    }
+    for (const doc of documents
         // since we include fragments, validate only operations
-        .filter(doc => doc.hasOperations)
-        .forEach(doc => {
+        .filter(doc => doc.hasOperations)) {
         const docWithOperations = {
             kind: Kind.DOCUMENT,
             definitions: doc.operations.map(d => d.node),
@@ -114,7 +113,7 @@ export function validate(schema, sources, options) {
                 deprecated,
             });
         }
-    });
+    }
     return invalidDocuments;
 }
 function findDuplicatedFragments(fragmentNames) {

package/esm/validate/query-depth.js

@@ -87,7 +87,7 @@ export function countDepth(node, parentDepth, getFragmentReference) {
             depth = Math.max(depth, countDepth(child, parentDepth + 1, getFragmentReference));
         }
     }
-    if (node.kind == Kind.FRAGMENT_SPREAD) {
+    if (node.kind === Kind.FRAGMENT_SPREAD) {
         const fragment = getFragmentReference(node.name.value);
         if (fragment) {
             depth = Math.max(depth, countDepth(fragment, parentDepth + 1, getFragmentReference));

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graphql-inspector/core",
-  "version": "4.1.0",
+  "version": "4.1.1-alpha-20230418154415-aa03cdf5",
   "description": "Tooling for GraphQL. Compare GraphQL Schemas, check documents, find breaking changes, find similar types.",
   "sideEffects": false,
   "peerDependencies": {
@@ -9,7 +9,7 @@
   "dependencies": {
     "dependency-graph": "0.11.0",
     "object-inspect": "1.12.3",
-    "tslib": "^2.0.0"
+    "tslib": "2.5.0"
   },
   "repository": {
     "type": "git",