@@ -36,12 +36,12 @@ discard block |
||
| 36 | 36 | } |
| 37 | 37 | |
| 38 | 38 | // order with the longest prefixes first |
| 39 | - uksort($candidates, function ($prefix1, $prefix2) { |
|
| 39 | + uksort($candidates, function($prefix1, $prefix2) { |
|
| 40 | 40 | return strlen($prefix2) <=> strlen($prefix1); |
| 41 | 41 | }); |
| 42 | 42 | |
| 43 | 43 | // flatten to a single array |
| 44 | - $candidates = array_reduce($candidates, function ($candidates, $paths) { |
|
| 44 | + $candidates = array_reduce($candidates, function($candidates, $paths) { |
|
| 45 | 45 | return array_merge($candidates, $paths); |
| 46 | 46 | }, []); |
| 47 | 47 | |
@@ -99,7 +99,7 @@ discard block |
||
| 99 | 99 | |
| 100 | 100 | foreach ($prefixes as $prefix => $paths) { |
| 101 | 101 | $paths = (array) $paths; |
| 102 | - $paths = array_map(function ($path) { |
|
| 102 | + $paths = array_map(function($path) { |
|
| 103 | 103 | if (!file_exists($path)) { |
| 104 | 104 | $this->logger->warning(sprintf( |
| 105 | 105 | 'Composer mapped path "%s" does not exist', |