public static boolean intersect(long[] x, long[] y) {
    final int min = (x.length < y.length) ? x.length : y.length;
    for(int i = 0; i < min; i++) {
      if((x[i] & y[i]) != 0L) {
        return true;
      }
    }
    return false;
  }
public static boolean intersect ( long [ ] x , long [ ] y ) { final int min = ( x . length < y . length ) ? x . length : y . length ; for ( int i = 0 ; i < min ; i ++ ) { if ( ( x [ i ] & y [ i ] ) != 0L ) { return true ; } } return false ; }
Test whether two Bitsets intersect.

@param x First bitset
@param y Second bitset
@return {@code true} when the bitsets intersect.