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