* entire stream. To avoid a potentially expensive operation, see {@link #lengthIfKnown}.
   *
   * <p>The default implementation calls {@link #lengthIfKnown} and returns the value if present. If
   * absent, it will fall back to a heavyweight operation that will open a stream, {@link
   * Reader#skip(long) skip} to the end of the stream, and return the total number of chars that
   * were skipped.
   *

   * entire stream. To avoid a potentially expensive operation, see {@link #lengthIfKnown}.
   *
   * <p>The default implementation calls {@link #lengthIfKnown} and returns the value if present. If
   * absent, it will fall back to a heavyweight operation that will open a stream, {@link
   * Reader#skip(long) skip} to the end of the stream, and return the total number of chars that
   * were skipped.
   *

                if (b != 0) {
                    hasNonZero = true;
                    break;
                }
            }
            assertTrue(hasNonZero, "Signature should be present at correct offset");
        }

        @Test
        @DisplayName("Should be thread-safe with optimized locking")
        void testSignThreadSafety() throws InterruptedException {
            int threadCount = 10;

        ArgumentCaptor<Smb2IoctlRequest> cap = ArgumentCaptor.forClass(Smb2IoctlRequest.class);
        verify(tree).send(cap.capture(), eq(RequestParam.NO_RETRY));
        assertNotNull(cap.getValue()); // captured request should be present
    }

    @Test
    @DisplayName("sendrecv uses TransactNamedPipe when PIPE_TYPE_TRANSACT is set")
    void sendrecv_transact_branch() throws Exception {
        // Arrange

 * [duplex calls][RequestBody.isDuplex] interleave the request and response bodies.
 *
 * Since connections may be reused, the proxy selection, DNS, and connect events may not be present
 * for a call. In future releases of OkHttp these events may also occur concurrently to permit
 * multiple routes to be attempted simultaneously.
 *
 * Events and sequences of events may be repeated for retries and follow-ups.

        // file name from deep path
        SmbResourceLocatorImpl a = locator("smb://server/share/dir/file.txt");
        assertEquals("file.txt", a.getName());

        // share name with trailing slash when only share present
        SmbResourceLocatorImpl b = locator("smb://server/share/");
        assertEquals("share/", b.getName());

        // host when no path/share
        SmbResourceLocatorImpl c = locator("smb://server/");

     * length of the local certificate chain. These certificates are also base64-encoded and appear
     * each on their own line. A length of -1 is used to encode a null array. The last line is
     * optional. If present, it contains the TLS version.
     */
    @Throws(IOException::class)
    constructor(rawSource: Source) {
      rawSource.use {
        val source = rawSource.buffer()

   * endpoints are unordered and the graph is directed; it simply returns {@code false}. This is for
   * consistency with the behavior of {@link Collection#contains(Object)} (which does not generally
   * throw if the object cannot be present in the collection), and the desire to have this method's
   * behavior be compatible with {@code edges().contains(endpoints)}.
   *
   * @since 27.1
   */
  @Override

   * endpoints are unordered and the graph is directed; it simply returns {@code false}. This is for
   * consistency with the behavior of {@link Collection#contains(Object)} (which does not generally
   * throw if the object cannot be present in the collection), and the desire to have this method's
   * behavior be compatible with {@code edges().contains(endpoints)}.
   *
   * @since 27.1
   */
  @Override

        keyList.tail = node;
      }
    } else { // non-empty list, insert before nextSibling
      /*
       * requireNonNull is safe as long as callers pass a nextSibling that (a) has the same key and
       * (b) is present in the multimap. (And they do, except maybe in case of concurrent
       * modification, in which case all bets are off.)
       */
      KeyList<K, V> keyList = requireNonNull(keyToKeyList.get(key));
      keyList.count++;