| Conditions | 7 |
| Paths | 14 |
| Total Lines | 32 |
| Code Lines | 16 |
| Lines | 0 |
| Ratio | 0 % |
| Tests | 17 |
| CRAP Score | 7 |
| Changes | 0 | ||
| 1 | <?php |
||
| 15 | 31 | public static function partialIntersection(int $m, array ...$sets): array |
|
| 16 | { |
||
| 17 | 31 | $iterator = new \MultipleIterator(\MultipleIterator::MIT_NEED_ANY); |
|
| 18 | |||
| 19 | 31 | foreach ($sets as $set) { |
|
| 20 | 29 | $iterator->attachIterator(new \ArrayIterator($set)); |
|
| 21 | } |
||
| 22 | |||
| 23 | 31 | $usageMap = []; |
|
| 24 | 31 | $result = []; |
|
| 25 | |||
| 26 | 31 | foreach ($iterator as $values) { |
|
| 27 | 24 | foreach ($values as $value) { |
|
| 28 | 24 | if ($value === null) { |
|
| 29 | 10 | continue; |
|
| 30 | } |
||
| 31 | |||
| 32 | 24 | if (!isset($usageMap[$value])) { |
|
| 33 | 24 | $usageMap[$value] = 0; |
|
| 34 | } |
||
| 35 | |||
| 36 | 24 | $usageMap[$value]++; |
|
| 37 | |||
| 38 | 24 | if ($usageMap[$value] === $m) { |
|
| 39 | 16 | $result[] = $value; |
|
| 40 | } |
||
| 41 | } |
||
| 42 | } |
||
| 43 | |||
| 44 | 31 | sort($result); |
|
| 45 | |||
| 46 | 31 | return $result; |
|
| 47 | } |
||
| 77 |