Total Complexity | 45 |
Total Lines | 291 |
Duplicated Lines | 0 % |
Changes | 0 |
Complex classes like Arrays often do a lot of different things. To break such a class down, we need to identify a cohesive component within that class. A common approach to find such a component is to look for fields/methods that share the same prefixes, or suffixes.
Once you have determined the fields that belong together, you can apply the Extract Class refactoring. If the component makes sense as a sub-class, Extract Subclass is also a candidate, and is often faster.
While breaking up the class, it is a good idea to analyze how other classes use Arrays, and based on these observations, apply Extract Interface, too.
1 | <?php |
||
7 | class Arrays |
||
8 | { |
||
9 | /** |
||
10 | * Taken from Kohana's Arr class. |
||
11 | * |
||
12 | * Tests if an array is associative or not. |
||
13 | * |
||
14 | * // Returns TRUE |
||
15 | * Arr::isAssoc(array('username' => 'john.doe')); |
||
16 | * |
||
17 | * // Returns FALSE |
||
18 | * Arr::isAssoc('foo', 'bar'); |
||
19 | * |
||
20 | * @param array $array array to check |
||
21 | * @return boolean |
||
22 | */ |
||
23 | public static function isAssociative(array $array) |
||
31 | } |
||
32 | |||
33 | /** |
||
34 | * Taken from Kohana's Arr class. |
||
35 | * |
||
36 | * Recursively merge two or more arrays. Values in an associative array |
||
37 | * overwrite previous values with the same key. Values in an indexed array |
||
38 | * are appended, but only when they do not already exist in the result. |
||
39 | * |
||
40 | * Note that this does not work the same as [array_merge_recursive](http://php.net/array_merge_recursive)! |
||
41 | * |
||
42 | * $john = array('name' => 'john', 'children' => array('fred', 'paul', 'sally', 'jane')); |
||
43 | * $mary = array('name' => 'mary', 'children' => array('jane')); |
||
44 | * |
||
45 | * // John and Mary are married, merge them together |
||
46 | * $john = Arr::merge($john, $mary); |
||
47 | * |
||
48 | * // The output of $john will now be: |
||
49 | * array('name' => 'mary', 'children' => array('fred', 'paul', 'sally', 'jane')) |
||
50 | * |
||
51 | * @param array $array1 initial array |
||
52 | * @param array $array2,... array to merge |
||
53 | * @return array |
||
54 | */ |
||
55 | public static function merge($array1, $array2) |
||
120 | } |
||
121 | |||
122 | /** |
||
123 | * Equivalent of array_merge_recursive with more options. |
||
124 | * |
||
125 | * @param array $existing_row |
||
126 | * @param array $conflict_row |
||
127 | * @param callable|null $merge_resolver |
||
128 | * @param int $max_depth |
||
129 | * |
||
130 | * + If exist only in conflict row => add |
||
131 | * + If same continue |
||
132 | * + If different merge as array |
||
133 | */ |
||
134 | public static function mergeRecursiveCustom( |
||
135 | array $existing_row, |
||
136 | array $conflict_row, |
||
137 | callable $merge_resolver=null, |
||
138 | $max_depth=null |
||
139 | ){ |
||
140 | foreach ($conflict_row as $column => $conflict_value) { |
||
141 | |||
142 | // not existing in first array |
||
143 | if (!isset($existing_row[$column])) { |
||
144 | $existing_row[$column] = $conflict_value; |
||
145 | continue; |
||
146 | } |
||
147 | |||
148 | $existing_value = $existing_row[$column]; |
||
149 | |||
150 | // two arrays so we recurse |
||
151 | if (is_array($existing_value) && is_array($conflict_value)) { |
||
152 | |||
153 | if ($max_depth === null || $max_depth > 0) { |
||
154 | $existing_row[$column] = static::mergeRecursiveCustom( |
||
155 | $existing_value, |
||
156 | $conflict_value, |
||
157 | $merge_resolver, |
||
158 | $max_depth - 1 |
||
159 | ); |
||
160 | continue; |
||
161 | } |
||
162 | } |
||
163 | |||
164 | if ($merge_resolver) { |
||
165 | $existing_row[$column] = call_user_func_array( |
||
166 | $merge_resolver, |
||
167 | [ |
||
168 | $existing_value, |
||
169 | $conflict_value, |
||
170 | $column, |
||
171 | ] |
||
172 | ); |
||
173 | } |
||
174 | else { |
||
175 | // same resolution as array_merge_recursive |
||
176 | if (!is_array($existing_value)) { |
||
177 | $existing_row[$column] = [$existing_value]; |
||
178 | } |
||
179 | |||
180 | // We store the new value with their previous ones |
||
181 | $existing_row[$column][] = $conflict_value; |
||
182 | } |
||
183 | } |
||
184 | |||
185 | return $existing_row; |
||
186 | } |
||
187 | |||
188 | /** |
||
189 | * Merges two rows |
||
190 | * |
||
191 | * @param array $existing_row |
||
192 | * @param array $conflict_row |
||
193 | * |
||
194 | * @return array |
||
195 | */ |
||
196 | public static function mergePreservingDistincts( |
||
197 | array $existing_row, |
||
198 | array $conflict_row |
||
199 | ){ |
||
200 | $merge = static::mergeRecursiveCustom( |
||
201 | $existing_row, |
||
202 | $conflict_row, |
||
203 | function ($existing_value, $conflict_value, $column) { |
||
1 ignored issue
–
show
|
|||
204 | |||
205 | if ( ! $existing_value instanceof MergeBucket) { |
||
206 | $existing_value = MergeBucket::from()->push($existing_value); |
||
207 | } |
||
208 | |||
209 | // We store the new value with their previous ones |
||
210 | if ( ! $conflict_value instanceof MergeBucket) { |
||
211 | $conflict_value = MergeBucket::from()->push($conflict_value); |
||
212 | } |
||
213 | |||
214 | foreach ($conflict_value->toArray() as $conflict_key => $conflict_entry) { |
||
215 | $existing_value->push($conflict_entry); |
||
216 | } |
||
217 | |||
218 | return $existing_value; |
||
219 | }, |
||
220 | 0 |
||
221 | ); |
||
222 | |||
223 | return $merge; |
||
224 | } |
||
225 | |||
226 | /** |
||
227 | * |
||
228 | */ |
||
229 | public static function cleanMergeBuckets($merged_row) |
||
230 | { |
||
231 | foreach ($merged_row as $entry => $values) { |
||
232 | if ($values instanceof MergeBucket) { |
||
233 | $out[ $entry ] = $values->toArray(); |
||
234 | } |
||
235 | } |
||
236 | |||
237 | return $out; |
||
238 | } |
||
239 | |||
240 | /** |
||
241 | * This is the cleaning part of self::mergePreservingDistincts() |
||
242 | * |
||
243 | * @see mergePreservingDistincts() |
||
244 | */ |
||
245 | public static function keepUniqueColumnValues(array $row, array $excluded_columns=[]) |
||
246 | { |
||
247 | foreach ($row as $column => &$values) { |
||
248 | if (!is_array($values)) |
||
249 | continue; |
||
250 | |||
251 | if (in_array($column, $excluded_columns)) |
||
252 | continue; |
||
253 | |||
254 | $values = array_unique($values); |
||
255 | if (count($values) == 1) |
||
256 | $values = $values[0]; |
||
257 | } |
||
258 | |||
259 | return $row; |
||
260 | } |
||
261 | |||
262 | /** |
||
263 | * Replacement of array_unique, keeping the first key. |
||
264 | * |
||
265 | * @param $array |
||
266 | * @return With unique values |
||
267 | * |
||
268 | * @todo Options to keep another key than the first one? |
||
269 | */ |
||
270 | public static function unique($array) |
||
298 | } |
||
299 | |||
300 | /**/ |
||
301 | } |
||
302 |