assertNotNull(buffer, "getBuffer should never return null");
        assertSame(expectedBuffer, buffer, "Should return configured buffer");
    }

    @Test
    @DisplayName("releaseBuffer should accept byte arrays gracefully")
    void testReleaseBufferContract() {
        // Given
        byte[] buffer = new byte[1024];
        doNothing().when(mockBufferCache).releaseBuffer(buffer);

        // When & Then

    assertEquals(HashCode.fromString(expected), hashFunc.hashBytes(data));
  }

  private static byte[] fillByteArray(int size, int toFillWith) {
    byte[] array = new byte[size];
    Arrays.fill(array, (byte) toFillWith);
    return array;
  }

        }

        @Test
        @DisplayName("Parse handles null mechanisms array")
        void testNullMechanisms() {
            NegTokenInit init = new NegTokenInit(null, 0, null, null);
            assertNull(init.getMechanisms());

            // Should not throw when converting to byte array
            assertDoesNotThrow(() -> init.toByteArray());
        }

        @Test

           */
          toJoin = Arrays.copyOf(toJoin, expandedCapacity(toJoin.length, toJoin.length + 1));
        }
        toJoin[i++] = toString(part);
      }
      // We might not have seen the expected number of elements, as discussed above.
      if (i != toJoin.length) {
        toJoin = Arrays.copyOf(toJoin, i);
      }
      return String.join(separator, toJoin);
    }

            // Then
            assertNotNull(bytes);
            assertTrue(bytes.length >= 48); // Minimum size
            // Verify signature
            assertTrue(Arrays.equals(Type2Message.NTLMSSP_SIGNATURE, Arrays.copyOfRange(bytes, 0, 8)));
            // Verify message type
            assertEquals(Type2Message.NTLMSSP_TYPE2, Type2Message.readULong(bytes, 8));
            // Verify flags

        // Then - Nonces should be unique (SMB3 compliant: random + counter)
        assertFalse(Arrays.equals(nonce1, nonce2), "Nonces should be different");
        assertFalse(Arrays.equals(nonce2, nonce3), "Nonces should be different");
        assertFalse(Arrays.equals(nonce1, nonce3), "Nonces should be different");

        // Nonces should have proper size

        // Change file ID
        byte[] newFileId1 = new byte[16];
        Arrays.fill(newFileId1, (byte) 0xAA);
        request.setFileId(newFileId1);

        // Change flags
        request.setCloseFlags(0x0000);

        // Change file ID again
        byte[] newFileId2 = new byte[16];
        Arrays.fill(newFileId2, (byte) 0xBB);
        request.setFileId(newFileId2);

    }
  }

  private void recurse(int level) {
    // We're going to reuse the stimuli array 3^steps times by overwriting it
    // in a recursive loop.  Sneaky.
    if (level == stimuli.length) {
      // We've filled the array.
      compareResultsForThisListOfStimuli();
    } else {
      // Keep recursing to fill the array.
      for (Stimulus<E, ? super I> stimulus : getStimulusValues()) {
        stimuli[level] = stimulus;

   */
  public abstract long padToLong();

  /**
   * Returns the value of this hash code as a byte array. The caller may modify the byte array;
   * changes to it will <i>not</i> be reflected in this {@code HashCode} object or any other arrays
   * returned by this method.
   */
  // TODO(user): consider ByteString here, when that is available
  public abstract byte[] asBytes();

  /**

        }
        return id;
    }

    /**
     * Parses the given query string and returns an array of keywords.
     *
     * @param q the query string to be parsed
     * @param field the field to be used for keyword extraction
     * @return an array of keywords extracted from the query string, or an empty array if the number of keywords exceeds the maximum allowed or if any keyword exceeds the maximum length
     */