Preparing report...

Report for github.com/matthewmueller/gqlparser

(v0.0.0-20180622154911-9893a3ea795d)

A+    Excellent!    Found 5 issues across 27 files

Tweet

gofmt100%

Gofmt formats Go programs. We run gofmt -s on your code, where -s is for the "simplify" command

No problems detected. Good job!


go_vet100%

go vet examines Go source code and reports suspicious constructs, such as Printf calls whose arguments do not align with the format string.

No problems detected. Good job!


gocyclo81%

Gocyclo calculates cyclomatic complexities of functions in Go source code. The cyclomatic complexity of a function is calculated according to the following rules: 1 is the base complexity of a function +1 for each 'if', 'for', 'case', '&&' or '||' Go Report Card warns on functions with cyclomatic complexity > 15.

    • lexer/token.go
    • Line 82: warning: cyclomatic complexity 23 of function (Type).String() is high (> 15) (gocyclo)
    • Line 32: warning: cyclomatic complexity 23 of function (Type).Name() is high (> 15) (gocyclo)
    • schema.go
    • Line 425: warning: cyclomatic complexity 19 of function (*parser).parseDirectiveLocation() is high (> 15) (gocyclo)
    • spec/spec.go
    • Line 37: warning: cyclomatic complexity 31 of function Test() is high (> 15) (gocyclo)
    • lexer/lexer.go
    • Line 77: warning: cyclomatic complexity 29 of function (*Lexer).ReadToken() is high (> 15) (gocyclo)
    • Line 302: warning: cyclomatic complexity 22 of function (*Lexer).readString() is high (> 15) (gocyclo)
    • Line 412: warning: cyclomatic complexity 16 of function (*Lexer).readBlockString() is high (> 15) (gocyclo)
    • loader.go
    • Line 22: warning: cyclomatic complexity 24 of function LoadSchema() is high (> 15) (gocyclo)

ineffassign100%

IneffAssign detects ineffectual assignments in Go code.

No problems detected. Good job!


license100%

Checks whether your project has a LICENSE file.

No problems detected. Good job!


misspell100%

Misspell Finds commonly misspelled English words

No problems detected. Good job!