void testSequentialEncoding() {
            Smb2Lock lock1 = new Smb2Lock(100L, 200L, 1);
            Smb2Lock lock2 = new Smb2Lock(300L, 400L, 2);
            Smb2Lock lock3 = new Smb2Lock(500L, 600L, 4);

            int offset = 0;
            offset += lock1.encode(buffer, offset);
            offset += lock2.encode(buffer, offset);
            offset += lock3.encode(buffer, offset);

/* HMACT64 keyed hashing algorithm
 * Copyright (C) 2003 "Eric Glass" <jcifs at samba dot org>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,

/* HMACT64 keyed hashing algorithm
 * Copyright (C) 2003 "Eric Glass" <jcifs at samba dot org>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,

        name = "\\PIPE\\LANMAN";
        maxParameterCount = 8;

        //        maxDataCount = 4096; why was this set?
        maxSetupCount = (byte) 0x00;
        setupCount = 0;
        timeout = 5000;
    }

    @Override
    int writeSetupWireFormat(final byte[] dst, final int dstIndex) {
        return 0;
    }

    @Override
    int writeParametersWireFormat(final byte[] dst, int dstIndex) {

        assertEquals(16384, netServerEnum2.maxDataCount);
        assertEquals(0, netServerEnum2.maxSetupCount);
        assertEquals(0, netServerEnum2.setupCount);
        assertEquals(5000, netServerEnum2.timeout);
    }

    /**
     * Test the reset method.
     */
    @Test
    void testReset() {
        String lastName = "LAST_NAME";
        netServerEnum2.reset(0, lastName);

            Smb2Lock[] multipleLocks = new Smb2Lock[] { new Smb2Lock(0L, 100L, Smb2Lock.SMB2_LOCKFLAG_EXCLUSIVE_LOCK),
                    new Smb2Lock(200L, 300L, Smb2Lock.SMB2_LOCKFLAG_SHARED_LOCK), new Smb2Lock(500L, 100L, Smb2Lock.SMB2_LOCKFLAG_UNLOCK) };
            assertDoesNotThrow(() -> new Smb2LockRequest(mockConfig, testFileId, multipleLocks));
        }

        @Test
        @DisplayName("Should accept null locks array")

/**
 * Single-threaded benchmark for {@link LoadingCache}.
 *
 * @author Charles Fry
 */
@NullUnmarked
public class LoadingCacheSingleThreadBenchmark {
  @Param({"1000", "2000"})
  int maximumSize;

  @Param("5000")
  int distinctKeys;

  @Param("4")
  int segments;

  // 1 means uniform likelihood of keys; higher means some keys are more popular
  // tweak this to control hit rate
  @Param("2.5")
  double concentration;

        when(request.allowChain(nextRequest)).thenReturn(true);
        when(request.createCancel()).thenReturn(nextRequest);
        when(request.size()).thenReturn(1024);
        when(request.getOverrideTimeout()).thenReturn(5000);

        // When & Then
        assertTrue(request.isResponseAsync());
        assertEquals(nextRequest, request.getNext());
        assertEquals(nextRequest, request.split());

        .isEqualTo("Code must be in range [1000,5000): 1")
    }
    data.write("88021388".decodeHex()) // Close with code 5000
    assertFailsWith<ProtocolException> {
      clientReader.processNextFrame()
    }.also { expected ->
      assertThat(expected.message)
        .isEqualTo("Code must be in range [1000,5000): 5000")
    }
  }

  @Test fun closeReservedSetThrows() {

/* jcifs smb client library in Java
 * Copyright (C) 2003  "Michael B. Allen" <jcifs at samba dot org>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,