//    were added to the queue. It's easily possible for one thread to take the head of the
    //    queue, immediately followed by another thread taking the next element in the queue. That
    //    second thread can then dispatch to the subscriber it took before the first thread does.
    //
    // All this makes me really wonder if there's any value in queueing here at all. A dispatcher

        when(dest.openUnshared(anyInt(), anyInt(), anyInt(), anyInt(), anyInt())).thenThrow(authEx) // first attempt fails with auth
                .thenReturn(handle); // second attempt succeeds

        // dest currently has READONLY attribute set
        int currentAttrs = SmbConstants.ATTR_READONLY | SmbConstants.ATTR_ARCHIVE;
        when(dest.getAttributes()).thenReturn(currentAttrs);

 * argument is used.
 *
 * <table border="1">
 * <caption>Examples Of SMB URLs When Augmented With A Second Constructor Parameter</caption>
 * <tr >
 * <td colspan="3">
 * <b>Examples Of SMB URLs When Augmented With A Second Constructor Parameter</b></td>
 * <tr>
 * <td >
 * <b>First Parameter</b></td>
 * <td><b>Second Parameter</b></td>
 * <td><b>Result</b></td>
 * </tr>

        // Then
        assertEquals(2, written, "Should write 2 bytes");
        assertEquals(SmbComTransaction.TRANS2_FIND_NEXT2, dst[0], "First byte must be subCommand");
        assertEquals((byte) 0x00, dst[1], "Second byte must be 0");
    }

    /**
     * Validates writeParametersWireFormat encodes values in the correct order and endianness.
     */
    @Test
    void testWriteParametersWireFormat() {
        // Given

  }

  @Test fun successfulFindMatchingPins() {
    val certificatePinner =
      CertificatePinner
        .Builder()
        .add("first.com", certA1Sha256Pin, certB1Sha256Pin)
        .add("second.com", certC1Sha256Pin)
        .build()

    val expectedPins =
      listOf(
        Pin("first.com", certA1Sha256Pin),
        Pin("first.com", certB1Sha256Pin),
      )

        infoField.setAccessible(true);
        infoField.set(response, mockDecodable);

        Decodable first = response.getInfo();
        Decodable second = response.getInfo();

        assertSame(first, second, "Multiple calls should return the same instance");
    }

    @Test
    @DisplayName("Test getInfo with null info returns null")
    void testGetInfoWithNullInfo() {

   * </pre>
   *
   * @throws IllegalArgumentException if there is a loop in the causal chain
   */
  public static Throwable getRootCause(Throwable throwable) {
    // Keep a second pointer that slowly walks the causal chain. If the fast pointer ever catches
    // the slower pointer, then there's a loop.
    Throwable slowPointer = throwable;
    boolean advanceSlowPointer = false;

        long time = System.currentTimeMillis();
        ServerMessageBlock.writeTime(time, buffer, 0);
        long readTime = ServerMessageBlock.readTime(buffer, 0);
        // Precision may be lost, so check within a second
        assertTrue(Math.abs(time - readTime) < 1000);
    }

    @Test
    void testTimeReadWriteZero() {
        byte[] buffer = new byte[8];
        ServerMessageBlock.writeTime(0, buffer, 0);

    /* Should recover to be able to remove() after next(). */
    assertEquals("B", peekingIterator.next());
    peekingIterator.remove();
    assertEquals("Should have removed an element", 2, list.size());
    assertFalse("Second element should be gone", list.contains("B"));
  }

  static class ThrowsAtEndException extends RuntimeException {
    /* nothing */
  }

  /**

        assertEquals(28, bytesConsumed1);

        byte[] resumeKey1 = response.getResumeKey();
        assertNotNull(resumeKey1);
        assertEquals((byte) 0x11, resumeKey1[0]);

        // Second decode - should overwrite
        byte[] buffer2 = new byte[28];
        Arrays.fill(buffer2, 0, 24, (byte) 0x22);

        int bytesConsumed2 = response.decode(buffer2, 0, 28);
        assertEquals(28, bytesConsumed2);