private boolean expectCall = false;
    private final CountDownLatch calledCountDown = new CountDownLatch(1);

    @Override
    public void run() {
      assertTrue("Listener called before it was expected", expectCall);
      assertFalse("Listener called more than once", wasCalled());
      calledCountDown.countDown();
    }

    void expectCall() {
      assertFalse("expectCall is already true", expectCall);

   * MultimapBuilder.hashKeys(expectedKeys).hashSetValues(expectedValuesPerKey).build()}, which
   * provides more control over the underlying data structure.
   *
   * @param expectedKeys the expected number of distinct keys
   * @param expectedValuesPerKey the expected average number of values per key
   * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is
   *     negative
   */

    try {
      Longs.concat(arrays);
      fail();
    } catch (IllegalArgumentException expected) {
    }
  }

  private static void assertByteArrayEquals(byte[] expected, byte[] actual) {
    assertWithMessage(
            "Expected: %s, but got: %s", Arrays.toString(expected), Arrays.toString(actual))
        .that(Arrays.equals(expected, actual))
        .isTrue();
  }

  public void testToByteArray() {

    }

    @Test
    public void testConstructorWithNullMethod() {
        String url = "https://example.com";

        try {
            new CurlRequest(null, url);
            fail("Expected IllegalArgumentException");
        } catch (IllegalArgumentException e) {
            assertTrue(e.getMessage().contains("method must not be null"));
        }
    }

    @Test

      for (int i = 0; i < sample.size(); i++) {
        Collection<String> misleading = misleadingSizeCollection(delta);
        List<String> expected = sample.subList(0, i);
        misleading.addAll(expected);
        assertEquals(expected, ImmutableList.copyOf(misleading));
        assertEquals(expected, ImmutableList.copyOf((Iterable<String>) misleading));
      }
    }
  }

   * MultimapBuilder.hashKeys(expectedKeys).hashSetValues(expectedValuesPerKey).build()}, which
   * provides more control over the underlying data structure.
   *
   * @param expectedKeys the expected number of distinct keys
   * @param expectedValuesPerKey the expected average number of values per key
   * @throws IllegalArgumentException if {@code expectedKeys} or {@code expectedValuesPerKey} is
   *     negative
   */

 */
@ExtendWith(MockitoExtension.class)
@MockitoSettings(strictness = Strictness.LENIENT)
class SmbTreeHandleTest {

    @Mock
    private SmbTreeHandle smbTreeHandle;

    @Mock
    private Configuration mockConfig;

    /**
     * Test for getConfig() method.
     * Verifies that the method returns the expected Configuration object.
     */
    @Test

        assertTrue(len >= 2);
        // writeInt2 writes in little-endian format (LSB first)
        int written = (buffer[0] & 0xFF) | ((buffer[1] & 0xFF) << 8);
        int expected = level & 0xFFFF;
        assertEquals(expected, written);
    }

    // Helper method to extract string from buffer
    private String extractStringFromBuffer(byte[] buffer, int offset, int maxLen) {
        int end = offset;

        // Expected size: 2 (info level) + 4 (reserved) + filename length + 1 (null terminator)
        byte[] dst = new byte[2 + 4 + filename.length() + 1];

        // When
        int bytesWritten = trans.writeParametersWireFormat(dst, 0);

        // Then
        assertEquals(dst.length, bytesWritten, "The number of bytes written should match the expected length.");
        // Check informationLevel

   * _last_ request, but it remembers the (expected) time of the _next_ request. This also enables
   * us to tell immediately (see tryAcquire(timeout)) whether a particular timeout is enough to get
   * us to the point of the next scheduling time, since we always maintain that. And what we mean by
   * "an unused RateLimiter" is also defined by that notion: when we observe that the