@@ -166,7 +166,9 @@ discard block |
||
| 166 | 166 | // sort tags by depth so that there will be no errors in case we are deleting parent and child |
| 167 | 167 | $tagsCollection = $tagsCollection->getArrayCopy(); |
| 168 | 168 | uasort($tagsCollection, function ($t1, $t2) { |
| 169 | - if ($t1->depth == $t2->depth) return 0; |
|
| 169 | + if ($t1->depth == $t2->depth) { |
|
| 170 | + return 0; |
|
| 171 | + } |
|
| 170 | 172 | return ($t1->depth > $t2->depth) ? -1 : 1; |
| 171 | 173 | }); |
| 172 | 174 | |
@@ -273,7 +275,9 @@ discard block |
||
| 273 | 275 | // sort top to bottom |
| 274 | 276 | $tagCollection = $tagCollection->getArrayCopy(); |
| 275 | 277 | uasort($tagCollection, function ($t1, $t2) { |
| 276 | - if ($t1->depth == $t2->depth) return 0; |
|
| 278 | + if ($t1->depth == $t2->depth) { |
|
| 279 | + return 0; |
|
| 280 | + } |
|
| 277 | 281 | return ($t1->depth > $t2->depth) ? 1 : -1; |
| 278 | 282 | }); |
| 279 | 283 | break; |
@@ -281,7 +285,9 @@ discard block |
||
| 281 | 285 | // sort bottom to top |
| 282 | 286 | $tagCollection = $tagCollection->getArrayCopy(); |
| 283 | 287 | uasort($tagCollection, function ($t1, $t2) { |
| 284 | - if ($t1->depth == $t2->depth) return 0; |
|
| 288 | + if ($t1->depth == $t2->depth) { |
|
| 289 | + return 0; |
|
| 290 | + } |
|
| 285 | 291 | return ($t1->depth > $t2->depth) ? -1 : 1; |
| 286 | 292 | }); |
| 287 | 293 | break; |