private function canBeResolved(array $requires, array $available, array $ordered): bool
    {
        if (0 === \count($requires)) {
            return true;
        }

        return 0 === \count(array_diff(array_intersect($requires, $available), $ordered));
    }
private function canBeResolved(array $requires, array $available, array $ordered): bool
    {
        if (0 === \count($requires)) {
            return true;
        }

        return 0 === \count(array_diff(array_intersect($requires, $available), $ordered));
    }
private function canBeResolved ( array $ requires , array $ available , array $ ordered ) : bool { if ( 0 === \ count ( $ requires ) ) { return true ; } return 0 === \ count ( array_diff ( array_intersect ( $ requires , $ available ) , $ ordered ) ) ; }
Checks whether the requirements can be resolved.
Checks whether the requirements can be resolved .