graphql-query-complexity - npm Package Compare versions

Comparing version 0.9.0 to 0.10.0

dist/cjs/__tests__/fixtures/CompatibleValidationContext.js

@@ -23,3 +23,3 @@ "use strict";
     getErrors() {
-        // eslint-disable-next-line @typescript-eslint/ban-ts-ignore
+        // eslint-disable-next-line @typescript-eslint/ban-ts-comment
         // @ts-ignore
@@ -26,0 +26,0 @@ return super.getErrors ? super.getErrors() : this.errors;

dist/cjs/__tests__/QueryComplexity-test.js

@@ -20,3 +20,3 @@ "use strict";
     var result = {};
-    if (mod != null) for (var k in mod) if (k !== "default" && Object.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
     __setModuleDefault(result, mod);
@@ -38,7 +38,7 @@ return result;
     it('exports createComplexityRule as default and named export in index', () => {
-        chai_1.expect(index_1.createComplexityRule).to.equal(index_1.default);
-        chai_1.expect(typeof index_1.createComplexityRule).to.equal('function');
+        (0, chai_1.expect)(index_1.createComplexityRule).to.equal(index_1.default);
+        (0, chai_1.expect)(typeof index_1.createComplexityRule).to.equal('function');
     });
     it('should calculate complexity', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -48,11 +48,11 @@ variableScalar(count: 10)
     `);
-        const complexity = QueryComplexity_1.getComplexity({
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 1 })],
+        const complexity = (0, QueryComplexity_1.getComplexity)({
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 1 })],
             schema: schema_1.default,
             query: ast,
         });
-        chai_1.expect(complexity).to.equal(1);
+        (0, chai_1.expect)(complexity).to.equal(1);
     });
     it('should respect @include(if: false) via default variable value', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query Foo ($shouldSkip: Boolean = false) {
@@ -62,11 +62,11 @@ variableScalar(count: 10) @include(if: $shouldSkip)
     `);
-        const complexity = QueryComplexity_1.getComplexity({
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 1 })],
+        const complexity = (0, QueryComplexity_1.getComplexity)({
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 1 })],
             schema: schema_1.default,
             query: ast,
         });
-        chai_1.expect(complexity).to.equal(0);
+        (0, chai_1.expect)(complexity).to.equal(0);
     });
     it('should respect @include(if: false)', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -76,11 +76,11 @@ variableScalar(count: 10) @include(if: false)
     `);
-        const complexity = QueryComplexity_1.getComplexity({
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 1 })],
+        const complexity = (0, QueryComplexity_1.getComplexity)({
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 1 })],
             schema: schema_1.default,
             query: ast,
         });
-        chai_1.expect(complexity).to.equal(0);
+        (0, chai_1.expect)(complexity).to.equal(0);
     });
     it('should respect @include(if: true)', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -90,11 +90,11 @@ variableScalar(count: 10) @include(if: true)
     `);
-        const complexity = QueryComplexity_1.getComplexity({
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 1 })],
+        const complexity = (0, QueryComplexity_1.getComplexity)({
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 1 })],
             schema: schema_1.default,
             query: ast,
         });
-        chai_1.expect(complexity).to.equal(1);
+        (0, chai_1.expect)(complexity).to.equal(1);
     });
     it('should respect @skip(if: true)', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -104,11 +104,11 @@ variableScalar(count: 10) @skip(if: true)
     `);
-        const complexity = QueryComplexity_1.getComplexity({
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 1 })],
+        const complexity = (0, QueryComplexity_1.getComplexity)({
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 1 })],
             schema: schema_1.default,
             query: ast,
         });
-        chai_1.expect(complexity).to.equal(0);
+        (0, chai_1.expect)(complexity).to.equal(0);
     });
     it('should respect @skip(if: false)', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -118,11 +118,11 @@ variableScalar(count: 10) @skip(if: false)
     `);
-        const complexity = QueryComplexity_1.getComplexity({
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 1 })],
+        const complexity = (0, QueryComplexity_1.getComplexity)({
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 1 })],
             schema: schema_1.default,
             query: ast,
         });
-        chai_1.expect(complexity).to.equal(1);
+        (0, chai_1.expect)(complexity).to.equal(1);
     });
     it('should respect @skip(if: false) @include(if: true)', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -132,11 +132,11 @@ variableScalar(count: 10) @skip(if: false) @include(if: true)
     `);
-        const complexity = QueryComplexity_1.getComplexity({
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 1 })],
+        const complexity = (0, QueryComplexity_1.getComplexity)({
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 1 })],
             schema: schema_1.default,
             query: ast,
         });
-        chai_1.expect(complexity).to.equal(1);
+        (0, chai_1.expect)(complexity).to.equal(1);
     });
     it('should calculate complexity with variables', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query Q($count: Int) {
@@ -146,6 +146,6 @@ variableScalar(count: $count)
     `);
-        const complexity = QueryComplexity_1.getComplexity({
+        const complexity = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({ defaultComplexity: 1 }),
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({ defaultComplexity: 1 }),
             ],
@@ -158,6 +158,6 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity).to.equal(50);
+        (0, chai_1.expect)(complexity).to.equal(50);
     });
     it('should calculate complexity with variables and default value', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query Q($count: Int = 5) {
@@ -167,6 +167,6 @@ variableScalar(count: $count)
     `);
-        const complexity = QueryComplexity_1.getComplexity({
+        const complexity = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({ defaultComplexity: 1 }),
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({ defaultComplexity: 1 }),
             ],
@@ -177,6 +177,6 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity).to.equal(50);
+        (0, chai_1.expect)(complexity).to.equal(50);
     });
     it('should not allow negative cost', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -189,9 +189,9 @@ variableScalar(count: -100)
             maximumComplexity: 100,
-            estimators: [index_1.simpleEstimator({ defaultComplexity: -100 })],
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: -100 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(0);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(0);
     });
     it('should ignore unknown fragments', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -205,9 +205,9 @@ ...UnknownFragment
             maximumComplexity: 100,
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 10 })],
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 10 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(10);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(10);
     });
     it('should ignore inline fragment on unknown type', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -222,9 +222,9 @@ ...on UnknownType {
             maximumComplexity: 100,
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 10 })],
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 10 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(0);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(0);
     });
     it('should ignore fragment on unknown type', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -240,9 +240,9 @@ ...F
             maximumComplexity: 100,
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 10 })],
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 10 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(0);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(0);
     });
     it('should ignore unused variables', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query ($unusedVar: ID!) {
@@ -255,9 +255,9 @@ variableScalar(count: 100)
             maximumComplexity: 100,
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 10 })],
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 10 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(10);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(10);
     });
     it('should ignore unknown field', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -270,9 +270,9 @@ unknownField
             maximumComplexity: 100,
-            estimators: [index_1.simpleEstimator({ defaultComplexity: 10 })],
+            estimators: [(0, index_1.simpleEstimator)({ defaultComplexity: 10 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(0);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(0);
     });
     it('should report error above threshold', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -286,4 +286,4 @@ variableScalar(count: 100)
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({
                     defaultComplexity: 1,
@@ -293,9 +293,9 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(1000);
-        chai_1.expect(context.getErrors().length).to.equal(1);
-        chai_1.expect(context.getErrors()[0].message).to.equal('The query exceeds the maximum complexity of 100. Actual complexity is 1000');
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(1000);
+        (0, chai_1.expect)(context.getErrors().length).to.equal(1);
+        (0, chai_1.expect)(context.getErrors()[0].message).to.equal('The query exceeds the maximum complexity of 100. Actual complexity is 1000');
     });
     it('should add inline fragments', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -313,4 +313,4 @@ variableScalar(count: 5)
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({
                     defaultComplexity: 1,
@@ -320,7 +320,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(52);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(52);
     });
     it('should add fragments', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -339,4 +339,4 @@ scalar
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({
                     defaultComplexity: 1,
@@ -346,7 +346,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(21);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(21);
     });
     it('should add complexity for union types', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -365,4 +365,4 @@ union {
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({
                     defaultComplexity: 1,
@@ -372,7 +372,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(22);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(22);
     });
     it('should add complexity for interface types', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -391,4 +391,4 @@ interface {
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({
                     defaultComplexity: 1,
@@ -398,7 +398,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(3);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(3);
     });
     it('should add complexity for inline fragments without type condition', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -416,4 +416,4 @@ interface {
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({
                     defaultComplexity: 1,
@@ -423,7 +423,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(2);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(2);
     });
     it('should add complexity for enum types', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -437,4 +437,4 @@ enum
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({
                     defaultComplexity: 1,
@@ -444,7 +444,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(1);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(1);
     });
     it('should report error on a missing non-null argument', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
         query {
@@ -458,4 +458,4 @@ requiredArgs
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({
                     defaultComplexity: 1,
@@ -465,8 +465,8 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(context.getErrors().length).to.equal(1);
-        chai_1.expect(context.getErrors()[0].message).to.equal('Argument "count" of required type "Int!" was not provided.');
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(context.getErrors().length).to.equal(1);
+        (0, chai_1.expect)(context.getErrors()[0].message).to.equal('Argument "count" of required type "Int!" was not provided.');
     });
     it('should report error when no estimator is configured', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
         query {
@@ -481,9 +481,9 @@ scalar
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(context.getErrors().length).to.equal(1);
-        chai_1.expect(context.getErrors()[0].message).to.equal('No complexity could be calculated for field Query.scalar. ' +
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(context.getErrors().length).to.equal(1);
+        (0, chai_1.expect)(context.getErrors()[0].message).to.equal('No complexity could be calculated for field Query.scalar. ' +
             'At least one complexity estimator has to return a complexity score.');
     });
     it('should report error when no estimator returns value', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
         query {
@@ -496,11 +496,11 @@ scalar
             maximumComplexity: 100,
-            estimators: [index_1.fieldExtensionsEstimator()],
+            estimators: [(0, index_1.fieldExtensionsEstimator)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(context.getErrors().length).to.equal(1);
-        chai_1.expect(context.getErrors()[0].message).to.equal('No complexity could be calculated for field Query.scalar. ' +
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(context.getErrors().length).to.equal(1);
+        (0, chai_1.expect)(context.getErrors()[0].message).to.equal('No complexity could be calculated for field Query.scalar. ' +
             'At least one complexity estimator has to return a complexity score.');
     });
-    it('should return NaN when no astNode available on field when using directiveEstimator', () => {
-        const ast = graphql_1.parse(`
+    it('should throw error when no astNode available on field when using directiveEstimator', () => {
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -512,11 +512,12 @@ _service {
     `);
-        const complexity = QueryComplexity_1.getComplexity({
-            estimators: [index_1.directiveEstimator()],
-            schema: schema_1.default,
-            query: ast,
-        });
-        chai_1.expect(Number.isNaN(complexity)).to.equal(true);
+        (0, chai_1.expect)(() => {
+            (0, QueryComplexity_1.getComplexity)({
+                estimators: [(0, index_1.directiveEstimator)()],
+                schema: schema_1.default,
+                query: ast,
+            });
+        }).to.throw(/No complexity could be calculated for field Query._service/);
     });
     it('should skip complexity calculation by directiveEstimator when no astNode available on field', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -528,6 +529,6 @@ _service {
     `);
-        const complexity = QueryComplexity_1.getComplexity({
+        const complexity = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.directiveEstimator(),
-                index_1.simpleEstimator({
+                (0, index_1.directiveEstimator)(),
+                (0, index_1.simpleEstimator)({
                     defaultComplexity: 1,
@@ -539,6 +540,6 @@ }),
         });
-        chai_1.expect(complexity).to.equal(2);
+        (0, chai_1.expect)(complexity).to.equal(2);
     });
     it('should calculate complexity for specific operation', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query Primary {
@@ -553,6 +554,6 @@ scalar
     `);
-        const complexity1 = QueryComplexity_1.getComplexity({
+        const complexity1 = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({ defaultComplexity: 1 }),
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({ defaultComplexity: 1 }),
             ],
@@ -562,7 +563,7 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity1).to.equal(41);
-        const complexity2 = QueryComplexity_1.getComplexity({
+        (0, chai_1.expect)(complexity1).to.equal(41);
+        const complexity2 = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({ defaultComplexity: 1 }),
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({ defaultComplexity: 1 }),
             ],
@@ -573,6 +574,6 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity2).to.equal(20);
+        (0, chai_1.expect)(complexity2).to.equal(20);
     });
     it('should calculate max complexity for fragment on union type', () => {
-        const query = graphql_1.parse(`
+        const query = (0, graphql_1.parse)(`
       query Primary {
@@ -592,6 +593,6 @@ union {
     `);
-        const complexity = QueryComplexity_1.getComplexity({
+        const complexity = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({ defaultComplexity: 1 }),
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({ defaultComplexity: 1 }),
             ],
@@ -601,6 +602,6 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity).to.equal(3);
+        (0, chai_1.expect)(complexity).to.equal(3);
     });
     it('should calculate max complexity for nested fragment on union type', () => {
-        const query = graphql_1.parse(`
+        const query = (0, graphql_1.parse)(`
       query Primary {
@@ -622,6 +623,6 @@ union {
     `);
-        const complexity = QueryComplexity_1.getComplexity({
+        const complexity = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({ defaultComplexity: 0 }),
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({ defaultComplexity: 0 }),
             ],
@@ -631,6 +632,6 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity).to.equal(40);
+        (0, chai_1.expect)(complexity).to.equal(40);
     });
     it('should calculate max complexity for nested fragment on union type + named fragment', () => {
-        const query = graphql_1.parse(`
+        const query = (0, graphql_1.parse)(`
       query Primary {
@@ -653,6 +654,6 @@ union {
     `);
-        const complexity = QueryComplexity_1.getComplexity({
+        const complexity = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({ defaultComplexity: 0 }),
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({ defaultComplexity: 0 }),
             ],
@@ -662,6 +663,6 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity).to.equal(40);
+        (0, chai_1.expect)(complexity).to.equal(40);
     });
     it('should calculate max complexity for multiple interfaces', () => {
-        const query = graphql_1.parse(`
+        const query = (0, graphql_1.parse)(`
       query Primary {
@@ -679,6 +680,6 @@ interface {
     `);
-        const complexity = QueryComplexity_1.getComplexity({
+        const complexity = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({ defaultComplexity: 1 }),
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({ defaultComplexity: 1 }),
             ],
@@ -688,6 +689,6 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity).to.equal(21);
+        (0, chai_1.expect)(complexity).to.equal(21);
     });
     it('should calculate max complexity for multiple interfaces with nesting', () => {
-        const query = graphql_1.parse(`
+        const query = (0, graphql_1.parse)(`
       query Primary {
@@ -708,6 +709,6 @@ interface {
     `);
-        const complexity = QueryComplexity_1.getComplexity({
+        const complexity = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({ defaultComplexity: 1 }),
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({ defaultComplexity: 1 }),
             ],
@@ -717,6 +718,6 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity).to.equal(41); // 1 for interface, 20 * 2 for complexScalar
+        (0, chai_1.expect)(complexity).to.equal(41); // 1 for interface, 20 * 2 for complexScalar
     });
     it('should calculate max complexity for multiple interfaces with nesting + named fragment', () => {
-        const query = graphql_1.parse(`
+        const query = (0, graphql_1.parse)(`
       query Primary {
@@ -739,6 +740,6 @@ interface {
     `);
-        const complexity = QueryComplexity_1.getComplexity({
+        const complexity = (0, QueryComplexity_1.getComplexity)({
             estimators: [
-                index_1.fieldExtensionsEstimator(),
-                index_1.simpleEstimator({ defaultComplexity: 1 }),
+                (0, index_1.fieldExtensionsEstimator)(),
+                (0, index_1.simpleEstimator)({ defaultComplexity: 1 }),
             ],
@@ -748,6 +749,6 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity).to.equal(41); // 1 for interface, 20 * 2 for complexScalar
+        (0, chai_1.expect)(complexity).to.equal(41); // 1 for interface, 20 * 2 for complexScalar
     });
     it('should include the current node in the estimator args', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -767,3 +768,3 @@ nonNullItem {
         };
-        const complexity = QueryComplexity_1.getComplexity({
+        const complexity = (0, QueryComplexity_1.getComplexity)({
             estimators: [fieldCountEstimator],
@@ -773,5 +774,31 @@ schema: schema_1.default,
         });
-        chai_1.expect(complexity).to.equal(30); // 3 fields on nonNullItem * 10
+        (0, chai_1.expect)(complexity).to.equal(30); // 3 fields on nonNullItem * 10
     });
+    it('should handle invalid argument values for multiple query fields', () => {
+        const ast = (0, graphql_1.parse)(`
+      query {
+        requiredArgs(count: x) {
+          scalar
+          complexScalar
+        }
+        nonNullItem {
+          scalar
+          complexScalar
+          variableScalar(count: 10)
+        }
+      }
+    `);
+        (0, graphql_1.validate)(schema_1.default, ast, [
+            ...graphql_1.specifiedRules,
+            (0, index_1.createComplexityRule)({
+                maximumComplexity: 1000,
+                estimators: [
+                    (0, index_1.simpleEstimator)({
+                        defaultComplexity: 1,
+                    }),
+                ],
+            }),
+        ]);
+    });
 });
 //# sourceMappingURL=QueryComplexity-test.js.map

dist/cjs/estimators/directive/__tests__/directiveEstimator-test.js

@@ -20,3 +20,3 @@ "use strict";
     var result = {};
-    if (mod != null) for (var k in mod) if (k !== "default" && Object.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
     __setModuleDefault(result, mod);
@@ -38,3 +38,3 @@ return result;
     it('should read complexity from directive', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -47,9 +47,9 @@ scalar
             maximumComplexity: 100,
-            estimators: [index_1.default()],
+            estimators: [(0, index_1.default)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(5);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(5);
     });
     it('should not allow negative cost', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -62,9 +62,9 @@ negativeCostScalar
             maximumComplexity: 100,
-            estimators: [index_1.default()],
+            estimators: [(0, index_1.default)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(0);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(0);
     });
     it('uses default directive name', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -77,9 +77,9 @@ multiDirective
             maximumComplexity: 100,
-            estimators: [index_1.default()],
+            estimators: [(0, index_1.default)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(2);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(2);
     });
     it('uses configured directive name', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -93,3 +93,3 @@ multiDirective
             estimators: [
-                index_1.default({
+                (0, index_1.default)({
                     name: 'cost',
@@ -99,7 +99,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(1);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(1);
     });
     it('returns value + child complexity for configured multipliers but no values', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -114,9 +114,9 @@ childList {
             maximumComplexity: 100,
-            estimators: [index_1.default()],
+            estimators: [(0, index_1.default)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(5);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(5);
     });
     it('uses numeric multiplier value', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -131,9 +131,9 @@ childList(limit: 2) {
             maximumComplexity: 100,
-            estimators: [index_1.default()],
+            estimators: [(0, index_1.default)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(10);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(10);
     });
     it('combines multiple numeric multiplier values', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -148,9 +148,9 @@ childList(limit: 2, first: 2) {
             maximumComplexity: 100,
-            estimators: [index_1.default()],
+            estimators: [(0, index_1.default)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(20);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(20);
     });
     it('uses multiplier array value length', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -165,9 +165,9 @@ childList(ids: ["a", "b"]) {
             maximumComplexity: 100,
-            estimators: [index_1.default()],
+            estimators: [(0, index_1.default)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(10);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(10);
     });
     it('uses nested multiplier paths', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -182,9 +182,9 @@ childList(filter: {limit: 3}) {
             maximumComplexity: 100,
-            estimators: [index_1.default()],
+            estimators: [(0, index_1.default)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(15);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(15);
     });
     it('uses multi level nested multiplier paths with array reference', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -199,9 +199,9 @@ childList(filter: {filters: [{limit: 2}]}) {
             maximumComplexity: 100,
-            estimators: [index_1.default()],
+            estimators: [(0, index_1.default)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(10);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(10);
     });
     it('ignores fields without complexity directive', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -214,10 +214,10 @@ noDirective
             maximumComplexity: 100,
-            estimators: [index_1.default()],
+            estimators: [(0, index_1.default)()],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(context.getErrors().length).to.equal(1);
-        chai_1.expect(context.getErrors()[0].message).to.include('No complexity could be calculated for field Query.noDirective');
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(context.getErrors().length).to.equal(1);
+        (0, chai_1.expect)(context.getErrors()[0].message).to.include('No complexity could be calculated for field Query.noDirective');
     });
     it('should create complexity directive that can be used to generate directive definition', () => {
-        const complexityDirective = index_1.createComplexityDirective();
+        const complexityDirective = (0, index_1.createComplexityDirective)();
         const codeFirstSchema = new graphql_1.GraphQLSchema({
@@ -229,9 +229,9 @@ directives: [complexityDirective],
         // and directive from code first schema has no astNode
-        const builtCodeFirstSchema = graphql_1.buildSchema(graphql_1.printSchema(codeFirstSchema));
-        const printedSchemaFirstDirective = graphql_1.print(schema_1.default.getDirective('complexity').astNode);
-        const printedCodeFirstDirective = graphql_1.print(builtCodeFirstSchema.getDirective('complexity').astNode);
-        chai_1.expect(printedSchemaFirstDirective).to.equal(printedCodeFirstDirective);
+        const builtCodeFirstSchema = (0, graphql_1.buildSchema)((0, graphql_1.printSchema)(codeFirstSchema));
+        const printedSchemaFirstDirective = (0, graphql_1.print)(schema_1.default.getDirective('complexity').astNode);
+        const printedCodeFirstDirective = (0, graphql_1.print)(builtCodeFirstSchema.getDirective('complexity').astNode);
+        (0, chai_1.expect)(printedSchemaFirstDirective).to.equal(printedCodeFirstDirective);
     });
     it('should create complexity directive with configured name', () => {
-        const complexityDirective = index_1.createComplexityDirective({ name: 'cost' });
+        const complexityDirective = (0, index_1.createComplexityDirective)({ name: 'cost' });
         const codeFirstSchema = new graphql_1.GraphQLSchema({
@@ -243,8 +243,8 @@ directives: [complexityDirective],
         // and directive from code first schema has no astNode
-        const builtCodeFirstSchema = graphql_1.buildSchema(graphql_1.printSchema(codeFirstSchema));
-        const printedSchemaFirstDirective = graphql_1.print(schema_1.default.getDirective('cost').astNode);
-        const printedCodeFirstDirective = graphql_1.print(builtCodeFirstSchema.getDirective('cost').astNode);
-        chai_1.expect(printedSchemaFirstDirective).to.equal(printedCodeFirstDirective);
+        const builtCodeFirstSchema = (0, graphql_1.buildSchema)((0, graphql_1.printSchema)(codeFirstSchema));
+        const printedSchemaFirstDirective = (0, graphql_1.print)(schema_1.default.getDirective('cost').astNode);
+        const printedCodeFirstDirective = (0, graphql_1.print)(builtCodeFirstSchema.getDirective('cost').astNode);
+        (0, chai_1.expect)(printedSchemaFirstDirective).to.equal(printedCodeFirstDirective);
     });
 });
 //# sourceMappingURL=directiveEstimator-test.js.map

dist/cjs/estimators/directive/__tests__/fixtures/schema.js

@@ -7,3 +7,3 @@ "use strict";
 const graphql_1 = require("graphql");
-exports.default = graphql_1.buildSchema(`
+exports.default = (0, graphql_1.buildSchema)(`
 """Define a relation between the field and other nodes"""
@@ -10,0 +10,0 @@ directive @cost(

dist/cjs/estimators/directive/index.js

@@ -36,3 +36,3 @@ "use strict";
         }
-        const values = graphql_1.getDirectiveValues(directive, args.field.astNode);
+        const values = (0, graphql_1.getDirectiveValues)(directive, args.field.astNode);
         // Ignore if no directive set
@@ -46,3 +46,3 @@ if (!values) {
             totalMultiplier = values.multipliers.reduce((aggregated, multiplier) => {
-                const multiplierValue = lodash_get_1.default(args.args, multiplier);
+                const multiplierValue = (0, lodash_get_1.default)(args.args, multiplier);
                 if (typeof multiplierValue === 'number') {
@@ -49,0 +49,0 @@ return aggregated * multiplierValue;

dist/cjs/estimators/fieldExtensions/__tests__/fieldExtensionsEstimator-test.js

@@ -19,3 +19,3 @@ "use strict";
     it('should consider default scalar cost', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -29,4 +29,4 @@ scalar
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -36,7 +36,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(1);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(1);
     });
     it('should consider custom scalar cost', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -50,4 +50,4 @@ complexScalar
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -57,7 +57,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(20);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(20);
     });
     it('should consider variable scalar cost', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -71,4 +71,4 @@ variableScalar(count: 100)
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -78,7 +78,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(1000);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(1000);
     });
     it('should not allow negative cost', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -92,4 +92,4 @@ variableScalar(count: -100)
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -99,7 +99,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(0);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(0);
     });
     it('should report error above threshold', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -113,4 +113,4 @@ variableScalar(count: 100)
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -120,9 +120,9 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(1000);
-        chai_1.expect(context.getErrors().length).to.equal(1);
-        chai_1.expect(context.getErrors()[0].message).to.equal('The query exceeds the maximum complexity of 100. Actual complexity is 1000');
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(1000);
+        (0, chai_1.expect)(context.getErrors().length).to.equal(1);
+        (0, chai_1.expect)(context.getErrors()[0].message).to.equal('The query exceeds the maximum complexity of 100. Actual complexity is 1000');
     });
     it('should add inline fragments', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -140,4 +140,4 @@ variableScalar(count: 5)
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -147,7 +147,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(52);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(52);
     });
     it('should add fragments', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -166,4 +166,4 @@ scalar
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -173,7 +173,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(21);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(21);
     });
     it('should add complexity for union types', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -192,4 +192,4 @@ union {
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -199,7 +199,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(22);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(22);
     });
     it('should add complexity for interface types', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -218,4 +218,4 @@ interface {
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -225,7 +225,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(3);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(3);
     });
     it('should add complexity for inline fragments without type condition', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -243,4 +243,4 @@ interface {
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -250,7 +250,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(2);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(2);
     });
     it('should add complexity for enum types', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -264,4 +264,4 @@ enum
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -271,7 +271,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(1);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(1);
     });
     it('should error on a missing non-null argument', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
         query {
@@ -285,4 +285,4 @@ requiredArgs
             estimators: [
-                index_1.default(),
-                simple_1.default({
+                (0, index_1.default)(),
+                (0, simple_1.default)({
                     defaultComplexity: 1,
@@ -292,7 +292,7 @@ }),
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(context.getErrors().length).to.equal(1);
-        chai_1.expect(context.getErrors()[0].message).to.equal('Argument "count" of required type "Int!" was not provided.');
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(context.getErrors().length).to.equal(1);
+        (0, chai_1.expect)(context.getErrors()[0].message).to.equal('Argument "count" of required type "Int!" was not provided.');
     });
 });
 //# sourceMappingURL=fieldExtensionsEstimator-test.js.map

dist/cjs/estimators/index.js

 "use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.fieldExtensionsEstimator = exports.createComplexityDirective = exports.directiveEstimator = exports.simpleEstimator = void 0;
 var simple_1 = require("./simple");
-Object.defineProperty(exports, "simpleEstimator", { enumerable: true, get: function () { return simple_1.default; } });
+Object.defineProperty(exports, "simpleEstimator", { enumerable: true, get: function () { return __importDefault(simple_1).default; } });
 var directive_1 = require("./directive");
-Object.defineProperty(exports, "directiveEstimator", { enumerable: true, get: function () { return directive_1.default; } });
+Object.defineProperty(exports, "directiveEstimator", { enumerable: true, get: function () { return __importDefault(directive_1).default; } });
 Object.defineProperty(exports, "createComplexityDirective", { enumerable: true, get: function () { return directive_1.createComplexityDirective; } });
 var fieldExtensions_1 = require("./fieldExtensions");
-Object.defineProperty(exports, "fieldExtensionsEstimator", { enumerable: true, get: function () { return fieldExtensions_1.default; } });
+Object.defineProperty(exports, "fieldExtensionsEstimator", { enumerable: true, get: function () { return __importDefault(fieldExtensions_1).default; } });
 //# sourceMappingURL=index.js.map

dist/cjs/estimators/simple/__tests__/simpleEstimator-test.js

@@ -18,3 +18,3 @@ "use strict";
     it('should consider default scalar cost', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -27,9 +27,9 @@ scalar
             maximumComplexity: 100,
-            estimators: [index_1.default({ defaultComplexity: 1 })],
+            estimators: [(0, index_1.default)({ defaultComplexity: 1 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(1);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(1);
     });
     it('should consider default scalar cost + defaultComplexity', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -42,9 +42,9 @@ scalar
             maximumComplexity: 100,
-            estimators: [index_1.default({ defaultComplexity: 10 })],
+            estimators: [(0, index_1.default)({ defaultComplexity: 10 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(10);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(10);
     });
     it('should not allow negative cost', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -57,9 +57,9 @@ scalar
             maximumComplexity: 100,
-            estimators: [index_1.default({ defaultComplexity: -10 })],
+            estimators: [(0, index_1.default)({ defaultComplexity: -10 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(0);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(0);
     });
     it('should report error above threshold', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -72,11 +72,11 @@ scalar
             maximumComplexity: 100,
-            estimators: [index_1.default({ defaultComplexity: 1000 })],
+            estimators: [(0, index_1.default)({ defaultComplexity: 1000 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(1000);
-        chai_1.expect(context.getErrors().length).to.equal(1);
-        chai_1.expect(context.getErrors()[0].message).to.equal('The query exceeds the maximum complexity of 100. Actual complexity is 1000');
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(1000);
+        (0, chai_1.expect)(context.getErrors().length).to.equal(1);
+        (0, chai_1.expect)(context.getErrors()[0].message).to.equal('The query exceeds the maximum complexity of 100. Actual complexity is 1000');
     });
     it('should add inline fragments', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -93,9 +93,9 @@ variableScalar(count: 5)
             maximumComplexity: 100,
-            estimators: [index_1.default({ defaultComplexity: 1 })],
+            estimators: [(0, index_1.default)({ defaultComplexity: 1 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(3);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(3);
     });
     it('should add fragments', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -113,9 +113,9 @@ scalar
             maximumComplexity: 100,
-            estimators: [index_1.default({ defaultComplexity: 1 })],
+            estimators: [(0, index_1.default)({ defaultComplexity: 1 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(2);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(2);
     });
     it('should add complexity for union types', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -132,9 +132,9 @@ union {
             maximumComplexity: 100,
-            estimators: [index_1.default({ defaultComplexity: 1 })],
+            estimators: [(0, index_1.default)({ defaultComplexity: 1 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(2);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(2);
     });
     it('should add complexity for interface types', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -152,9 +152,9 @@ interface {
             maximumComplexity: 100,
-            estimators: [index_1.default({ defaultComplexity: 1 })],
+            estimators: [(0, index_1.default)({ defaultComplexity: 1 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(3);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(3);
     });
     it('should add complexity for inline fragments without type condition', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -171,9 +171,9 @@ interface {
             maximumComplexity: 100,
-            estimators: [index_1.default({ defaultComplexity: 1 })],
+            estimators: [(0, index_1.default)({ defaultComplexity: 1 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(2);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(2);
     });
     it('should add complexity for enum types', () => {
-        const ast = graphql_1.parse(`
+        const ast = (0, graphql_1.parse)(`
       query {
@@ -186,8 +186,8 @@ enum
             maximumComplexity: 100,
-            estimators: [index_1.default({ defaultComplexity: 1 })],
+            estimators: [(0, index_1.default)({ defaultComplexity: 1 })],
         });
-        graphql_1.visit(ast, graphql_1.visitWithTypeInfo(typeInfo, visitor));
-        chai_1.expect(visitor.complexity).to.equal(1);
+        (0, graphql_1.visit)(ast, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+        (0, chai_1.expect)(visitor.complexity).to.equal(1);
     });
 });
 //# sourceMappingURL=simpleEstimator-test.js.map

dist/cjs/index.js

@@ -10,3 +10,3 @@ "use strict";
 var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !exports.hasOwnProperty(p)) __createBinding(exports, m, p);
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
@@ -13,0 +13,0 @@ var __importDefault = (this && this.__importDefault) || function (mod) {

dist/cjs/QueryComplexity.js

@@ -17,3 +17,4 @@ "use strict";
     const typeInfo = new graphql_1.TypeInfo(options.schema);
-    const context = new graphql_1.ValidationContext(options.schema, options.query, typeInfo, () => null);
+    const errors = [];
+    const context = new graphql_1.ValidationContext(options.schema, options.query, typeInfo, (error) => errors.push(error));
     const visitor = new QueryComplexity(context, {
@@ -26,3 +27,7 @@ // Maximum complexity does not matter since we're only interested in the calculated complexity.
     });
-    graphql_1.visit(options.query, graphql_1.visitWithTypeInfo(typeInfo, visitor));
+    (0, graphql_1.visit)(options.query, (0, graphql_1.visitWithTypeInfo)(typeInfo, visitor));
+    // Throw first error if any
+    if (errors.length) {
+        throw errors.pop();
+    }
     return visitor.complexity;
@@ -57,3 +62,3 @@ }
         // with default values defined in the operation
-        this.variableValues = values_1.getVariableValues(this.context.getSchema(), (_a = operation.variableDefinitions) !== null && _a !== void 0 ? _a : [], (_b = this.options.variables) !== null && _b !== void 0 ? _b : {}).coerced;
+        this.variableValues = (0, values_1.getVariableValues)(this.context.getSchema(), (_a = operation.variableDefinitions) !== null && _a !== void 0 ? _a : [], (_b = this.options.variables) !== null && _b !== void 0 ? _b : {}).coerced;
         switch (operation.operation) {
@@ -94,3 +99,3 @@ case 'query':
             let possibleTypeNames;
-            if (graphql_1.isAbstractType(typeDef)) {
+            if ((0, graphql_1.isAbstractType)(typeDef)) {
                 possibleTypeNames = this.context
@@ -115,3 +120,3 @@ .getSchema()
                         case 'include': {
-                            const values = values_1.getDirectiveValues(this.includeDirectiveDef, childNode, this.variableValues || {});
+                            const values = (0, values_1.getDirectiveValues)(this.includeDirectiveDef, childNode, this.variableValues || {});
                             includeNode = values.if;
@@ -121,3 +126,3 @@ break;
                         case 'skip': {
-                            const values = values_1.getDirectiveValues(this.skipDirectiveDef, childNode, this.variableValues || {});
+                            const values = (0, values_1.getDirectiveValues)(this.skipDirectiveDef, childNode, this.variableValues || {});
                             skipNode = values.if;
@@ -138,14 +143,15 @@ break;
                         }
-                        const fieldType = graphql_1.getNamedType(field.type);
+                        const fieldType = (0, graphql_1.getNamedType)(field.type);
                         // Get arguments
                         let args;
                         try {
-                            args = values_1.getArgumentValues(field, childNode, this.variableValues || {});
+                            args = (0, values_1.getArgumentValues)(field, childNode, this.variableValues || {});
                         }
                         catch (e) {
-                            return this.context.reportError(e);
+                            this.context.reportError(e);
+                            return complexities;
                         }
                         // Check if we have child complexity
                         let childComplexity = 0;
-                        if (graphql_1.isCompositeType(fieldType)) {
+                        if ((0, graphql_1.isCompositeType)(fieldType)) {
                             childComplexity = this.nodeComplexity(childNode, fieldType);
@@ -172,4 +178,5 @@ }
                         if (!validScore) {
-                            return this.context.reportError(new graphql_1.GraphQLError(`No complexity could be calculated for field ${typeDef.name}.${field.name}. ` +
+                            this.context.reportError(new graphql_1.GraphQLError(`No complexity could be calculated for field ${typeDef.name}.${field.name}. ` +
                                 'At least one complexity estimator has to return a complexity score.'));
+                            return complexities;
                         }
@@ -188,7 +195,7 @@ break;
                         // Invalid fragment type, ignore. Should be caught by other validation rules
-                        if (!graphql_1.isCompositeType(fragmentType)) {
+                        if (!(0, graphql_1.isCompositeType)(fragmentType)) {
                             break;
                         }
                         const nodeComplexity = this.nodeComplexity(fragment, fragmentType);
-                        if (graphql_1.isAbstractType(fragmentType)) {
+                        if ((0, graphql_1.isAbstractType)(fragmentType)) {
                             // Add fragment complexity for all possible types
@@ -212,3 +219,3 @@ innerComplexities = addComplexities(nodeComplexity, complexities, this.context
                                 .getType(childNode.typeCondition.name.value);
-                            if (!graphql_1.isCompositeType(inlineFragmentType)) {
+                            if (!(0, graphql_1.isCompositeType)(inlineFragmentType)) {
                                 break;
@@ -218,3 +225,3 @@ }
                         const nodeComplexity = this.nodeComplexity(childNode, inlineFragmentType);
-                        if (graphql_1.isAbstractType(inlineFragmentType)) {
+                        if ((0, graphql_1.isAbstractType)(inlineFragmentType)) {
                             // Add fragment complexity for all possible types
@@ -221,0 +228,0 @@ innerComplexities = addComplexities(nodeComplexity, complexities, this.context

dist/esm/__tests__/fixtures/CompatibleValidationContext.js

@@ -20,3 +20,3 @@ import { ValidationContext } from 'graphql';
     getErrors() {
-        // eslint-disable-next-line @typescript-eslint/ban-ts-ignore
+        // eslint-disable-next-line @typescript-eslint/ban-ts-comment
         // @ts-ignore
@@ -23,0 +23,0 @@ return super.getErrors ? super.getErrors() : this.errors;

dist/esm/__tests__/QueryComplexity-test.js

 /**
  * Created by Ivo Meißner on 28.07.17.
  */
-import { parse, TypeInfo, visit, visitWithTypeInfo } from 'graphql';
+import { parse, TypeInfo, visit, visitWithTypeInfo, validate, specifiedRules, } from 'graphql';
 import { expect } from 'chai';
@@ -443,3 +443,3 @@ import schema from './fixtures/schema';
     });
-    it('should return NaN when no astNode available on field when using directiveEstimator', () => {
+    it('should throw error when no astNode available on field when using directiveEstimator', () => {
         const ast = parse(`
@@ -452,8 +452,9 @@ query {
     `);
-        const complexity = getComplexity({
-            estimators: [directiveEstimator()],
-            schema,
-            query: ast,
-        });
-        expect(Number.isNaN(complexity)).to.equal(true);
+        expect(() => {
+            getComplexity({
+                estimators: [directiveEstimator()],
+                schema,
+                query: ast,
+            });
+        }).to.throw(/No complexity could be calculated for field Query._service/);
     });
@@ -697,3 +698,29 @@ it('should skip complexity calculation by directiveEstimator when no astNode available on field', () => {
     });
+    it('should handle invalid argument values for multiple query fields', () => {
+        const ast = parse(`
+      query {
+        requiredArgs(count: x) {
+          scalar
+          complexScalar
+        }
+        nonNullItem {
+          scalar
+          complexScalar
+          variableScalar(count: 10)
+        }
+      }
+    `);
+        validate(schema, ast, [
+            ...specifiedRules,
+            createComplexityRule({
+                maximumComplexity: 1000,
+                estimators: [
+                    simpleEstimator({
+                        defaultComplexity: 1,
+                    }),
+                ],
+            }),
+        ]);
+    });
 });
 //# sourceMappingURL=QueryComplexity-test.js.map

dist/esm/QueryComplexity.js

@@ -14,3 +14,4 @@ /* eslint-disable @typescript-eslint/no-explicit-any */
     const typeInfo = new TypeInfo(options.schema);
-    const context = new ValidationContext(options.schema, options.query, typeInfo, () => null);
+    const errors = [];
+    const context = new ValidationContext(options.schema, options.query, typeInfo, (error) => errors.push(error));
     const visitor = new QueryComplexity(context, {
@@ -24,2 +25,6 @@ // Maximum complexity does not matter since we're only interested in the calculated complexity.
     visit(options.query, visitWithTypeInfo(typeInfo, visitor));
+    // Throw first error if any
+    if (errors.length) {
+        throw errors.pop();
+    }
     return visitor.complexity;
@@ -137,3 +142,4 @@ }
                         catch (e) {
-                            return this.context.reportError(e);
+                            this.context.reportError(e);
+                            return complexities;
                         }
@@ -164,4 +170,5 @@ // Check if we have child complexity
                         if (!validScore) {
-                            return this.context.reportError(new GraphQLError(`No complexity could be calculated for field ${typeDef.name}.${field.name}. ` +
+                            this.context.reportError(new GraphQLError(`No complexity could be calculated for field ${typeDef.name}.${field.name}. ` +
                                 'At least one complexity estimator has to return a complexity score.'));
+                            return complexities;
                         }
@@ -168,0 +175,0 @@ break;

package.json

 {
   "name": "graphql-query-complexity",
-  "version": "0.9.0",
+  "version": "0.10.0",
   "description": "Validation rule for GraphQL query complexity analysis",
@@ -27,3 +27,3 @@ "main": "dist/cjs/index.js",
   "peerDependencies": {
-    "graphql": "^0.13.0 || ^14.0.0 || ^15.0.0"
+    "graphql": "^14.5.0 || ^15.0.0"
   },
@@ -47,17 +47,17 @@ "files": [
   "devDependencies": {
-    "@types/assert": "^1.4.6",
-    "@types/chai": "^4.2.11",
+    "@types/assert": "^1.5.6",
+    "@types/chai": "^4.2.22",
     "@types/lodash.get": "^4.4.6",
-    "@types/mocha": "^7.0.2",
-    "@typescript-eslint/eslint-plugin": "^2.27.0",
-    "@typescript-eslint/parser": "^2.27.0",
-    "chai": "^4.2.0",
-    "eslint": "^6.8.0",
+    "@types/mocha": "^9.0.0",
+    "@typescript-eslint/eslint-plugin": "^5.1.0",
+    "@typescript-eslint/parser": "^5.1.0",
+    "chai": "^4.3.4",
+    "eslint": "^8.0.1",
     "graphql": "^14.5.0 || ^15.0.0",
-    "mocha": "^7.1.1",
-    "prettier": "^2.2.1",
+    "mocha": "^9.1.3",
+    "prettier": "^2.4.1",
     "rimraf": "^3.0.2",
-    "ts-node": "^8.8.2",
-    "typescript": "^3.8.3"
+    "ts-node": "^10.3.0",
+    "typescript": "^4.4.4"
   }
 }

README.md

@@ -9,4 +9,6 @@ # GraphQL Query Complexity Analysis for graphql-js
 This library provides GraphQL query analysis to reject complex queries to your GraphQL server.
-This can be used to protect your GraphQL servers against resource exhaustion and DoS attacks.
+It can be used to protect your GraphQL servers against resource exhaustion and DoS attacks.
 
+This library was originally developed as part of the [Slicknode GraphQL Framework + Headless CMS](https://slicknode.com).
+
 Works with [graphql-js](https://github.com/graphql/graphql-js) reference implementation.
@@ -175,12 +177,17 @@
 
-const complexity = getComplexity({
-  estimators: [simpleEstimator({ defaultComplexity: 1 })],
-  schema,
-  query,
-  variables: {
-    count: 10,
-  },
-});
+try {
+  const complexity = getComplexity({
+    estimators: [simpleEstimator({ defaultComplexity: 1 })],
+    schema,
+    query,
+    variables: {
+      count: 10,
+    },
+  });
 
-console.log(complexity); // Output: 3
+  console.log(complexity); // Output: 3
+} catch (e) {
+  // Log error in case complexity cannot be calculated (invalid query, misconfiguration, etc.)
+  console.error('Could not calculate complexity', e.message);
+}
 ```
@@ -187,0 +194,0 @@

Fixed alerts

Major refactor

Supply chain risk

Package has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

298934

2.61%

Lines of code

4696

1.56%

Number of lines in readme file

199

3.65%

Number of medium supply chain risk alerts

0

-100%

No dependency changes