* comes from a data structure supporting efficient indexed random access, typically an array or
   * list.
   *
   * <p>The order of the resulting stream is defined if and only if the order of the original stream
   * was defined.
   */
  public static <T extends @Nullable Object, R extends @Nullable Object> Stream<R> mapWithIndex(
      Stream<T> stream, FunctionWithIndex<? super T, ? extends R> function) {

      represent, as a whole, an original work of authorship. For the purposes
      of this License, Derivative Works shall not include works that remain
      separable from, or merely link (or bind by name) to the interfaces of,
      the Work and Derivative Works thereof.

      "Contribution" shall mean any work of authorship, including
      the original version of the Work and any modifications or additions

            /*
             * The NbtAddress object used to query this node will be in the list
             * returned by the Node Status. A new NbtAddress object should not be
             * created for it because the original is potentially being actively
             * referenced by other objects. We must populate the existing object's
             * data explicitly (and carefully).
             */

  public final String[] createKeyArray(int length) {
    return new String[length];
  }

  @Override
  public final String[] createValueArray(int length) {
    return new String[length];
  }

  /** Returns the original element list, unchanged. */
  @Override
  public Iterable<Entry<String, String>> order(List<Entry<String, String>> insertionOrder) {
    return insertionOrder;
  }

            byte[] mechToken = new byte[] { 0x01, 0x02, 0x03, 0x04, 0x05 };
            byte[] mic = new byte[] { (byte) 0xAA, (byte) 0xBB, (byte) 0xCC };

            NegTokenInit original = new NegTokenInit(mechs, flags, mechToken, mic);
            byte[] firstEncoding = original.toByteArray();

            // Multiple round-trips should produce identical results
            NegTokenInit parsed1 = new NegTokenInit(firstEncoding);

    }

    /**
     * An inner class for updating the stopwords file.
     * This class handles the process of writing changes to a temporary file
     * and then replacing the original file upon successful commit.
     */
    protected class StopwordsUpdater implements Closeable {

        /** A flag indicating whether the changes have been committed. */
        protected boolean isCommit = false;

     * Multi-word values are wrapped in double quotes with internal quotes replaced by spaces.
     *
     * @param value the string value to quote
     * @return the quoted string if it contains spaces, otherwise the original value
     */
    protected String quote(final String value) {
        if (value.split("\\s").length > 1) {
            return new StringBuilder().append('"').append(value.replace('"', ' ')).append('"').toString();
        }

    assertSideEffectFree(hash);
    assertReadableBytes(hash);
  }

  private static void assertSideEffectFree(HashCode hash) {
    byte[] original = hash.asBytes();
    byte[] mutated = hash.asBytes();
    mutated[0]++;
    assertTrue(Arrays.equals(original, hash.asBytes()));
  }

  private static void assertReadableBytes(HashCode hashCode) {
    assertTrue(hashCode.bits() >= 32); // sanity

import jcifs.Encodable;
import jcifs.internal.util.SMBUtil;

/**
 * SMB2 Validate Negotiate Info request data structure. This structure is used to validate
 * that the negotiated SMB2 dialect matches what was originally negotiated.
 *
 * @author mbechler
 *
 */
public class ValidateNegotiateInfoRequest implements Encodable {

    private final int capabilities;
    private final byte[] clientGuid;

        // When
        transformHeader.setNonce(testNonce);

        // Then
        assertArrayEquals(testNonce, transformHeader.getNonce());
    }

    @Test
    @DisplayName("Should set and get original message size")
    void testOriginalMessageSize() {
        // Given
        int messageSize = 1024;

        // When
        transformHeader.setOriginalMessageSize(messageSize);

        // Then