docs: 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;
    }