}

    protected SearchHits getSearchHits(final SearchResponse response) {
        SearchHits hits = response.getHits();
        if (hits == null) {
            throw new IllegalBehaviorStateException("hits is null: " + response);
        }
        return hits;
    }

    public static class BulkList<E, B> implements List<E> {

        private final List<E> parent;

    assertEquals(
        Hashing.md5().bits() + Hashing.md5().bits(),
        Hashing.concatenating(asList(Hashing.md5(), Hashing.md5())).bits());
    assertEquals(
        Hashing.md5().bits() + Hashing.murmur3_32().bits(),
        Hashing.concatenating(asList(Hashing.md5(), Hashing.murmur3_32())).bits());
    assertEquals(
        Hashing.md5().bits() + Hashing.murmur3_32().bits() + Hashing.murmur3_128().bits(),

            byte[] buf = new byte[8];
            int n = in.read(buf);
            assertEquals(3, n);
        }

        @Test
        @DisplayName("read() returns -1 when underlying readDirect hits EOF")
        void readSingleByteEOF() throws Exception {
            // Arrange SMB2 EOF via NT status code mapping in SmbFileInputStream

moment to be trampled under its feet, ran round the thistle
again; then the puppy began a series of short charges at the
stick, running a very little way forwards each time and a long
way back, and barking hoarsely all the while, till at last it sat
down a good way off, panting, with its tongue hanging out of its
mouth, and its great eyes half shut.

  This seemed to Alice a good opportunity for making her escape;

   * interpreted as an unsigned 64-bit value. Specifically, the sign bit of {@code bits} is
   * interpreted as a normal bit, and all other bits are treated as usual.
   *
   * <p>If the argument is nonnegative, the returned result will be equal to {@code bits},
   * otherwise, the result will be equal to {@code 2^64 + bits}.
   *
   * <p>To represent decimal constants less than {@code 2^63}, consider {@link #valueOf(long)}

  public static boolean isPowerOfTwo(long x) {
    return x > 0 & (x & (x - 1)) == 0;
  }

  /**
   * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a
   * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster
   * than the straightforward ternary expression.
   */
  @VisibleForTesting

 * the operation and the desired access bits are compared to the SID
 * and access mask of each ACE. If the SID matches, the allow/deny flags
 * and access mask are considered. If the ACE is a "deny"
 * ACE and <i>any</i> of the desired access bits match bits in the access
 * mask of the ACE, the whole access check fails. If the ACE is an "allow"
 * ACE and <i>all</i> of the bits in the desired access bits match bits in

              return;
            }

            var hits = obj.data,
                suggestor = this,
                reslist,
                $olEle,
                str,
                chkCorrectWord,
                $tmpli,
                $liEle,
                i, j, k;

            listNum = 0;
            if (typeof hits !== "undefined") {
              reslist = [];

            makeSMBKey(key, key8);
            setKey(key8);
        } else {
            setKey(key);
        }
    }

    /**
     * Converts a 7-byte SMB key to an 8-byte DES key with parity bits
     * @param key7 the 7-byte SMB key
     * @param key8 the output 8-byte DES key
     */
    public static void makeSMBKey(final byte[] key7, final byte[] key8) {

        int i;

      return null;
    }
    int mask = tableSize - 1;
    Builder.DuplicateKey duplicateKey = null;
    if (tableSize <= BYTE_MAX_SIZE) {
      /*
       * Use 8 bits per entry. The value is unsigned to allow use up to a size of 2^8.
       *
       * The absent indicator of -1 signed becomes 2^8 - 1 unsigned, which reduces the actual max