original_string: 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));
      }
code: 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));
      }
code_tokens: 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 ) ) ; }
docstring: Checks whether the requirements can be resolved.
docstring_tokens: Checks whether the requirements can be resolved .