@@ -36,7 +36,9 @@ |
||
36 | 36 | |
37 | 37 | $query = new Query(); |
38 | 38 | $query->limit = self::INT_MAX_16BIT; |
39 | - if (isset($query->performCount)) $query->performCount = false; |
|
39 | + if (isset($query->performCount)) { |
|
40 | + $query->performCount = false; |
|
41 | + } |
|
40 | 42 | $query->filter = $this->getQueryCriterion($key, $values); |
41 | 43 | $results = $this->repository->getTrashService()->findTrashItems($query); |
42 | 44 |
@@ -60,8 +60,7 @@ |
||
60 | 60 | } |
61 | 61 | } |
62 | 62 | } |
63 | - } |
|
64 | - else { |
|
63 | + } else { |
|
65 | 64 | throw new \Exception("Path '$path' is neither a file nor directory"); |
66 | 65 | } |
67 | 66 | } |
@@ -71,7 +71,9 @@ discard block |
||
71 | 71 | if (!empty($sort)) { |
72 | 72 | $query->sortClauses = $this->getSortClauses($sort); |
73 | 73 | } |
74 | - if (isset($query->performCount)) $query->performCount = false; |
|
74 | + if (isset($query->performCount)) { |
|
75 | + $query->performCount = false; |
|
76 | + } |
|
75 | 77 | $query->filter = $this->getQueryCriterion($key, $values); |
76 | 78 | $results = $this->repository->getSearchService()->findLocations($query); |
77 | 79 | |
@@ -218,7 +220,9 @@ discard block |
||
218 | 220 | { |
219 | 221 | $query = new LocationQuery(); |
220 | 222 | $query->limit = self::INT_MAX_16BIT; |
221 | - if (isset($query->performCount)) $query->performCount = false; |
|
223 | + if (isset($query->performCount)) { |
|
224 | + $query->performCount = false; |
|
225 | + } |
|
222 | 226 | $query->filter = new Query\Criterion\ParentLocationId($parentLocationIds); |
223 | 227 | |
224 | 228 | $results = $this->repository->getSearchService()->findLocations($query); |
@@ -103,7 +103,9 @@ discard block |
||
103 | 103 | $query = new Query(); |
104 | 104 | $query->limit = $limit != 0 ? $limit : self::INT_MAX_16BIT; |
105 | 105 | $query->offset = $offset; |
106 | - if (isset($query->performCount)) $query->performCount = false; |
|
106 | + if (isset($query->performCount)) { |
|
107 | + $query->performCount = false; |
|
108 | + } |
|
107 | 109 | $query->filter = $this->getQueryCriterion($key, $values); |
108 | 110 | if (!empty($sort)) { |
109 | 111 | $query->sortClauses = $this->getSortClauses($sort); |
@@ -229,7 +231,9 @@ discard block |
||
229 | 231 | { |
230 | 232 | $query = new Query(); |
231 | 233 | $query->limit = self::INT_MAX_16BIT; |
232 | - if (isset($query->performCount)) $query->performCount = false; |
|
234 | + if (isset($query->performCount)) { |
|
235 | + $query->performCount = false; |
|
236 | + } |
|
233 | 237 | $query->filter = new Query\Criterion\ParentLocationId($parentLocationIds); |
234 | 238 | $results = $this->repository->getSearchService()->findContent($query); |
235 | 239 | |
@@ -269,7 +273,9 @@ discard block |
||
269 | 273 | { |
270 | 274 | $query = new Query(); |
271 | 275 | $query->limit = self::INT_MAX_16BIT; |
272 | - if (isset($query->performCount)) $query->performCount = false; |
|
276 | + if (isset($query->performCount)) { |
|
277 | + $query->performCount = false; |
|
278 | + } |
|
273 | 279 | $query->filter = new Query\Criterion\ContentTypeIdentifier($contentTypeIdentifiers); |
274 | 280 | // sort objects by depth, lower to higher, so that deleting them has less chances of failure |
275 | 281 | // NB: we only do this in eZP versions that allow depth sorting on content queries |
@@ -297,7 +303,9 @@ discard block |
||
297 | 303 | { |
298 | 304 | $query = new Query(); |
299 | 305 | $query->limit = self::INT_MAX_16BIT; |
300 | - if (isset($query->performCount)) $query->performCount = false; |
|
306 | + if (isset($query->performCount)) { |
|
307 | + $query->performCount = false; |
|
308 | + } |
|
301 | 309 | $query->filter = new Query\Criterion\ContentTypeId($contentTypeIds); |
302 | 310 | // sort objects by depth, lower to higher, so that deleting them has less chances of failure |
303 | 311 | // NB: we only do this in eZP versions that allow depth sorting on content queries |
@@ -329,8 +329,9 @@ |
||
329 | 329 | { |
330 | 330 | if (isset($step->dsl['references_type']) && $step->dsl['references_type'] == self::REFERENCE_TYPE_ARRAY && |
331 | 331 | isset($step->dsl['references_allow_empty']) && $step->dsl['references_allow_empty'] == true |
332 | - ) |
|
333 | - return true; |
|
332 | + ) { |
|
333 | + return true; |
|
334 | + } |
|
334 | 335 | return false; |
335 | 336 | } |
336 | 337 |
@@ -78,8 +78,7 @@ |
||
78 | 78 | $this->errOutput->setVerbosity(OutputInterface::VERBOSITY_NORMAL); |
79 | 79 | $this->errOutput->writeln($message, $type); |
80 | 80 | $this->errOutput->setVerbosity(OutputInterface::VERBOSITY_QUIET); |
81 | - } |
|
82 | - else |
|
81 | + } else |
|
83 | 82 | { |
84 | 83 | $this->errOutput->writeln($message, $type); |
85 | 84 | } |
@@ -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; |