@@ -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; |
@@ -162,7 +162,9 @@ discard block |
||
| 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 | 164 | uasort($tagsCollection, function ($t1, $t2) { |
| 165 | - if ($t1->depth == $t2->depth) return 0; |
|
| 165 | + if ($t1->depth == $t2->depth) { |
|
| 166 | + return 0; |
|
| 167 | + } |
|
| 166 | 168 | return ($t1->depth > $t2->depth) ? -1 : 1; |
| 167 | 169 | }); |
| 168 | 170 | |
@@ -267,7 +269,9 @@ discard block |
||
| 267 | 269 | // sort top to bottom |
| 268 | 270 | $tagCollection = $tagCollection->getArrayCopy(); |
| 269 | 271 | uasort($tagCollection, function ($t1, $t2) { |
| 270 | - if ($t1->depth == $t2->depth) return 0; |
|
| 272 | + if ($t1->depth == $t2->depth) { |
|
| 273 | + return 0; |
|
| 274 | + } |
|
| 271 | 275 | return ($t1->depth > $t2->depth) ? 1 : -1; |
| 272 | 276 | }); |
| 273 | 277 | break; |
@@ -275,7 +279,9 @@ discard block |
||
| 275 | 279 | // sort bottom to top |
| 276 | 280 | $tagCollection = $tagCollection->getArrayCopy(); |
| 277 | 281 | uasort($tagCollection, function ($t1, $t2) { |
| 278 | - if ($t1->depth == $t2->depth) return 0; |
|
| 282 | + if ($t1->depth == $t2->depth) { |
|
| 283 | + return 0; |
|
| 284 | + } |
|
| 279 | 285 | return ($t1->depth > $t2->depth) ? -1 : 1; |
| 280 | 286 | }); |
| 281 | 287 | break; |
@@ -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 | } |