@@ -18,8 +18,8 @@ |
||
18 | 18 | $keys[] = $iterator->getSubIterator($depth)->key(); |
19 | 19 | } |
20 | 20 | |
21 | - if (! empty($separator)) { |
|
22 | - $result[join($separator, $keys) ] = $leafValue; |
|
21 | + if (!empty($separator)) { |
|
22 | + $result[join($separator, $keys)] = $leafValue; |
|
23 | 23 | } else { |
24 | 24 | $result[] = $leafValue; |
25 | 25 | } |
@@ -35,11 +35,11 @@ discard block |
||
35 | 35 | |
36 | 36 | $target = &$haystack; |
37 | 37 | foreach ($keys as $innerKey) { |
38 | - if (! is_array($target)) { |
|
38 | + if (!is_array($target)) { |
|
39 | 39 | break; |
40 | 40 | } |
41 | 41 | |
42 | - if (! array_key_exists($innerKey, $target)) { |
|
42 | + if (!array_key_exists($innerKey, $target)) { |
|
43 | 43 | $target[$innerKey] = []; |
44 | 44 | } |
45 | 45 | |
@@ -66,7 +66,7 @@ discard block |
||
66 | 66 | |
67 | 67 | $target = $haystack; |
68 | 68 | foreach ($keys as $innerKey) { |
69 | - if (! is_array($target) || ! array_key_exists($innerKey, $target)) { |
|
69 | + if (!is_array($target) || !array_key_exists($innerKey, $target)) { |
|
70 | 70 | return $default; |
71 | 71 | } |
72 | 72 | |
@@ -92,7 +92,7 @@ discard block |
||
92 | 92 | |
93 | 93 | $target = &$haystack; |
94 | 94 | foreach ($keys as $innerKey) { |
95 | - if (! is_array($target)) { |
|
95 | + if (!is_array($target)) { |
|
96 | 96 | break; |
97 | 97 | } |
98 | 98 | |
@@ -120,7 +120,7 @@ discard block |
||
120 | 120 | |
121 | 121 | $target = $haystack; |
122 | 122 | foreach ($keys as $innerKey) { |
123 | - if (! is_array($target) || ! array_key_exists($innerKey, $target)) { |
|
123 | + if (!is_array($target) || !array_key_exists($innerKey, $target)) { |
|
124 | 124 | return false; |
125 | 125 | } |
126 | 126 |