docs: public static void fillArrayANDNOT(final short[] container, final long[] bitmap1,
        final long[] bitmap2) {
      int pos = 0;
      if (bitmap1.length != bitmap2.length) {
        throw new IllegalArgumentException("not supported");
      }
      for (int k = 0; k < bitmap1.length; ++k) {
        long bitset = bitmap1[k] & (~bitmap2[k]);
        while (bitset != 0) {
          container[pos++] = (short) (k * 64 + numberOfTrailingZeros(bitset));
          bitset &= (bitset - 1);
        }
      }
    }