@@ -16,7 +16,7 @@ |
||
16 | 16 | { |
17 | 17 | $added = 0; |
18 | 18 | foreach ($elements as $element) { |
19 | - if (! in_array($element, $set, true)) { |
|
19 | + if (!in_array($element, $set, true)) { |
|
20 | 20 | $set[] = $element; |
21 | 21 | $added++; |
22 | 22 | } |
@@ -49,7 +49,7 @@ discard block |
||
49 | 49 | |
50 | 50 | function none(iterable $items, callable $callback, int $mode = 0): bool |
51 | 51 | { |
52 | - return ! some($items, $callback, $mode); |
|
52 | + return !some($items, $callback, $mode); |
|
53 | 53 | } |
54 | 54 | |
55 | 55 | function at_least(int $n, iterable $items, callable $callback, int $mode = CALLBACK_USE_VALUE): bool |
@@ -153,7 +153,7 @@ discard block |
||
153 | 153 | |
154 | 154 | function has(array $items, ...$keys): bool |
155 | 155 | { |
156 | - return ! array_diff($keys, array_keys($items)); |
|
156 | + return !array_diff($keys, array_keys($items)); |
|
157 | 157 | } |
158 | 158 | |
159 | 159 | function only(array $items, ...$keys): array |
@@ -13,14 +13,14 @@ discard block |
||
13 | 13 | function set_path(array &$haystack, string $path, $value, string $separator = '.'): void |
14 | 14 | { |
15 | 15 | $path = explode($separator, $path); |
16 | - $temp =& $haystack; |
|
16 | + $temp = & $haystack; |
|
17 | 17 | |
18 | 18 | foreach ($path as $key) { |
19 | 19 | if (!is_array($temp)) { |
20 | 20 | $temp = []; |
21 | 21 | } |
22 | 22 | |
23 | - $temp =& $temp[$key]; |
|
23 | + $temp = & $temp[$key]; |
|
24 | 24 | } |
25 | 25 | |
26 | 26 | $temp = $value; |
@@ -59,7 +59,7 @@ discard block |
||
59 | 59 | return |
60 | 60 | array_reduce( |
61 | 61 | explode($separator, $path), |
62 | - fn ($arr, $p) => is_array($arr) && array_key_exists($p, $arr) ? $arr[$p] : $default, |
|
62 | + fn($arr, $p) => is_array($arr) && array_key_exists($p, $arr) ? $arr[$p] : $default, |
|
63 | 63 | $haystack |
64 | 64 | ); |
65 | 65 | |
@@ -106,7 +106,7 @@ discard block |
||
106 | 106 | |
107 | 107 | $target = &$haystack; |
108 | 108 | foreach ($keys as $innerKey) { |
109 | - if (! is_array($target)) { |
|
109 | + if (!is_array($target)) { |
|
110 | 110 | break; |
111 | 111 | } |
112 | 112 | |
@@ -134,7 +134,7 @@ discard block |
||
134 | 134 | |
135 | 135 | $target = $haystack; |
136 | 136 | foreach ($keys as $innerKey) { |
137 | - if (! is_array($target) || ! array_key_exists($innerKey, $target)) { |
|
137 | + if (!is_array($target) || !array_key_exists($innerKey, $target)) { |
|
138 | 138 | return false; |
139 | 139 | } |
140 | 140 |
@@ -21,8 +21,8 @@ |
||
21 | 21 | $keys[] = $iterator->getSubIterator($depth)->key(); |
22 | 22 | } |
23 | 23 | |
24 | - if (! empty($pathSeparator)) { |
|
25 | - $result[join($pathSeparator, $keys) ] = $leafValue; |
|
24 | + if (!empty($pathSeparator)) { |
|
25 | + $result[join($pathSeparator, $keys)] = $leafValue; |
|
26 | 26 | } else { |
27 | 27 | $result[] = $leafValue; |
28 | 28 | } |