@@ -49,7 +49,7 @@ |
||
49 | 49 | /** @var Directive $directiveDefinition */ |
50 | 50 | $directiveDefinition = find( |
51 | 51 | $this->context->getSchema()->getDirectives(), |
52 | - function (Directive $definition) use ($node) { |
|
52 | + function(Directive $definition) use ($node) { |
|
53 | 53 | return $definition->getName() === $node->getNameValue(); |
54 | 54 | } |
55 | 55 | ); |
@@ -26,7 +26,7 @@ |
||
26 | 26 | */ |
27 | 27 | protected function enterDocument(DocumentNode $node): ?NodeInterface |
28 | 28 | { |
29 | - $this->operationCount = \count(\array_filter($node->getDefinitions(), function ($definition) { |
|
29 | + $this->operationCount = \count(\array_filter($node->getDefinitions(), function($definition) { |
|
30 | 30 | return $definition instanceof OperationDefinitionNode; |
31 | 31 | })); |
32 | 32 |
@@ -101,7 +101,7 @@ |
||
101 | 101 | |
102 | 102 | $this->context->reportError( |
103 | 103 | new ValidationException( |
104 | - fragmentCycleMessage($spreadName, \array_map(function (FragmentSpreadNode $spread) { |
|
104 | + fragmentCycleMessage($spreadName, \array_map(function(FragmentSpreadNode $spread) { |
|
105 | 105 | return $spread->getNameValue(); |
106 | 106 | }, $cyclePath)), |
107 | 107 | \array_merge($cyclePath, [$spreadNode]) |
@@ -66,7 +66,7 @@ |
||
66 | 66 | $array = ['data' => $this->data]; |
67 | 67 | |
68 | 68 | if (!empty($this->errors)) { |
69 | - $array['errors'] = array_map(function (GraphQLException $error) { |
|
69 | + $array['errors'] = array_map(function(GraphQLException $error) { |
|
70 | 70 | return $error->toArray(); |
71 | 71 | }, $this->errors); |
72 | 72 | } |
@@ -104,7 +104,7 @@ |
||
104 | 104 | $line < \count($lines) ? leftPad($padLen, $nextLineNum) . ': ' . $lines[$line] : null, |
105 | 105 | ]; |
106 | 106 | |
107 | - return \implode("\n", \array_filter($outputLines, function ($line) { |
|
107 | + return \implode("\n", \array_filter($outputLines, function($line) { |
|
108 | 108 | return null !== $line; |
109 | 109 | })); |
110 | 110 | } |
@@ -124,7 +124,7 @@ |
||
124 | 124 | { |
125 | 125 | return arraySome( |
126 | 126 | introspectionTypes(), |
127 | - function (TypeInterface $introspectionType) use ($type) { |
|
127 | + function(TypeInterface $introspectionType) use ($type) { |
|
128 | 128 | /** @noinspection PhpUndefinedMethodInspection */ |
129 | 129 | return $type->getName() === $introspectionType->getName(); |
130 | 130 | } |
@@ -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 | } |
@@ -50,7 +50,7 @@ |
||
50 | 50 | $errors = $this->validate($schema); |
51 | 51 | |
52 | 52 | if (!empty($errors)) { |
53 | - $message = \implode("\n", \array_map(function (SchemaValidationException $error) { |
|
53 | + $message = \implode("\n", \array_map(function(SchemaValidationException $error) { |
|
54 | 54 | return $error->getMessage(); |
55 | 55 | }, $errors)); |
56 | 56 |