@@ -213,9 +213,9 @@ discard block |
||
| 213 | 213 | $time = microtime(true) - $start; |
| 214 | 214 | if ($input->getOption('separate-process')) { |
| 215 | 215 | // in case of using subprocesses, we can not measure max memory used |
| 216 | - $this->writeln("<info>Time taken: ".sprintf('%.2f', $time)." secs</info>"); |
|
| 216 | + $this->writeln("<info>Time taken: " . sprintf('%.2f', $time) . " secs</info>"); |
|
| 217 | 217 | } else { |
| 218 | - $this->writeln("<info>Time taken: ".sprintf('%.2f', $time)." secs, memory: ".sprintf('%.2f', (memory_get_peak_usage(true) / 1000000)). ' MB</info>'); |
|
| 218 | + $this->writeln("<info>Time taken: " . sprintf('%.2f', $time) . " secs, memory: " . sprintf('%.2f', (memory_get_peak_usage(true) / 1000000)) . ' MB</info>'); |
|
| 219 | 219 | } |
| 220 | 220 | |
| 221 | 221 | return $failed; |
@@ -442,7 +442,7 @@ discard block |
||
| 442 | 442 | $builderArgs[] = '--no-debug'; |
| 443 | 443 | } |
| 444 | 444 | if ($input->getOption('siteaccess')) { |
| 445 | - $builderArgs[] = '--siteaccess='.$input->getOption('siteaccess'); |
|
| 445 | + $builderArgs[] = '--siteaccess=' . $input->getOption('siteaccess'); |
|
| 446 | 446 | } |
| 447 | 447 | switch ($this->verbosity) { |
| 448 | 448 | case OutputInterface::VERBOSITY_VERBOSE: |
@@ -161,7 +161,7 @@ discard block |
||
| 161 | 161 | |
| 162 | 162 | // sort tags by depth so that there will be no errors in case we are deleting parent and child |
| 163 | 163 | $tagsCollection = $tagsCollection->getArrayCopy(); |
| 164 | - uasort($tagsCollection, function ($t1, $t2) { |
|
| 164 | + uasort($tagsCollection, function($t1, $t2) { |
|
| 165 | 165 | if ($t1->depth == $t2->depth) return 0; |
| 166 | 166 | return ($t1->depth > $t2->depth) ? -1 : 1; |
| 167 | 167 | }); |
@@ -266,7 +266,7 @@ discard block |
||
| 266 | 266 | case 'create': |
| 267 | 267 | // sort top to bottom |
| 268 | 268 | $tagCollection = $tagCollection->getArrayCopy(); |
| 269 | - uasort($tagCollection, function ($t1, $t2) { |
|
| 269 | + uasort($tagCollection, function($t1, $t2) { |
|
| 270 | 270 | if ($t1->depth == $t2->depth) return 0; |
| 271 | 271 | return ($t1->depth > $t2->depth) ? 1 : -1; |
| 272 | 272 | }); |
@@ -274,7 +274,7 @@ discard block |
||
| 274 | 274 | case 'delete': |
| 275 | 275 | // sort bottom to top |
| 276 | 276 | $tagCollection = $tagCollection->getArrayCopy(); |
| 277 | - uasort($tagCollection, function ($t1, $t2) { |
|
| 277 | + uasort($tagCollection, function($t1, $t2) { |
|
| 278 | 278 | if ($t1->depth == $t2->depth) return 0; |
| 279 | 279 | return ($t1->depth > $t2->depth) ? -1 : 1; |
| 280 | 280 | }); |
@@ -352,7 +352,7 @@ discard block |
||
| 352 | 352 | protected function getTagKeywords($tag) |
| 353 | 353 | { |
| 354 | 354 | $out = array(); |
| 355 | - foreach($tag->languageCodes as $languageCode) { |
|
| 355 | + foreach ($tag->languageCodes as $languageCode) { |
|
| 356 | 356 | $out[$languageCode] = $tag->getKeyword($languageCode); |
| 357 | 357 | } |
| 358 | 358 | return $out; |
@@ -156,7 +156,7 @@ |
||
| 156 | 156 | $childTags = $this->findTagsByParentTagIds(array_keys($parentTags)); |
| 157 | 157 | $tags = array_merge($tags, $childTags); |
| 158 | 158 | $parentTags = $childTags; |
| 159 | - } while ( count( $childTags ) > 0 ); |
|
| 159 | + } while (count($childTags) > 0); |
|
| 160 | 160 | |
| 161 | 161 | return $tags; |
| 162 | 162 | } |