@@ -34,7 +34,7 @@ discard block |
||
34 | 34 | } |
35 | 35 | |
36 | 36 | $argumentNodes = $node->getArguments(); |
37 | - $argumentNodeMap = keyMap($argumentNodes, function (ArgumentNode $argument) { |
|
37 | + $argumentNodeMap = keyMap($argumentNodes, function(ArgumentNode $argument) { |
|
38 | 38 | return $argument->getNameValue(); |
39 | 39 | }); |
40 | 40 | |
@@ -65,7 +65,7 @@ discard block |
||
65 | 65 | } |
66 | 66 | |
67 | 67 | $argumentNodes = $node->getArguments(); |
68 | - $argumentNodeMap = keyMap($argumentNodes, function (ArgumentNode $argument) { |
|
68 | + $argumentNodeMap = keyMap($argumentNodes, function(ArgumentNode $argument) { |
|
69 | 69 | return $argument->getNameValue(); |
70 | 70 | }); |
71 | 71 |
@@ -146,7 +146,7 @@ |
||
146 | 146 | */ |
147 | 147 | function locationsShorthandToArray(array $locations): array |
148 | 148 | { |
149 | - return array_map(function ($shorthand) { |
|
149 | + return array_map(function($shorthand) { |
|
150 | 150 | return locationShorthandToArray($shorthand); |
151 | 151 | }, $locations); |
152 | 152 | } |
@@ -92,7 +92,7 @@ |
||
92 | 92 | // If both types are abstract, then determine if there is any intersection |
93 | 93 | // between possible concrete types of each. |
94 | 94 | return arraySome($schema->getPossibleTypes($typeA), |
95 | - function (TypeInterface $type) use ($schema, $typeB) { |
|
95 | + function(TypeInterface $type) use ($schema, $typeB) { |
|
96 | 96 | return $schema->isPossibleType($typeB, $type); |
97 | 97 | }); |
98 | 98 | } |