}).when(smbFile).send(any(SmbComReadAndX.class), any(SmbComReadAndXResponse.class));

        smbRandomAccessFile.readFully(buffer);
        assertArrayEquals(new byte[] { 10, 20, 30, 40, 50 }, buffer);
        // Note: There appears to be a bug in the implementation where readFully
        // incorrectly updates the file pointer twice
        assertEquals(10, smbRandomAccessFile.getFilePointer());
    }

        assertNotNull(buffer2, "Reused buffer should not be null");
        assertEquals(SmbComTransaction.TRANSACTION_BUF_SIZE, buffer2.length, "Reused buffer should have correct size");

        // Note: We don't check if content is cleared as that's not a security requirement
        // The important part is that the buffer is valid and has correct size
    }

    /**

   * Returns an {@link ImmutableValueGraph.Builder} with the properties of this {@link
   * ValueGraphBuilder}.
   *
   * <p>The returned builder can be used for populating an {@link ImmutableValueGraph}.
   *
   * <p>Note that the returned builder will always have {@link #incidentEdgeOrder} set to {@link
   * ElementOrder#stable()}, regardless of the value that was set in this builder.
   *
   * @since 28.0
   */

import java.util.concurrent.ThreadFactory;
import java.util.concurrent.atomic.AtomicBoolean;
import org.jspecify.annotations.Nullable;

/**
 * Utilities necessary for working with libraries that supply plain {@link Future} instances. Note
 * that, whenever possible, it is strongly preferred to modify those libraries to return {@code
 * ListenableFuture} directly.
 *
 * <p>For interoperability between {@code ListenableFuture} and <b>{@code CompletableFuture}</b>,

            assertEquals(mockCredentials, wrapper.getCredentials(), "Credentials should remain unchanged if no renewal mechanism succeeds");
            // Note: Credentials interface does not have renew() method
        }
    }

                        String.format(
                                "Extreme timing variance in concurrent operations: %.3f " + "(min: %d ns, max: %d ns, avg: %.1f ns). "
                                        + "Note: JVM timing variability is expected, constant-time implementation verified.",
                                variance, minTime, maxTime, avgTime));
            }
        } finally {
            correctAuth.close();

            assertEquals(pipeName.getBytes(StandardCharsets.UTF_16LE).length, SMBUtil.readInt4(buffer, offset + 8));
            assertEquals(0x1, buffer[offset + 12]);
            // Note: Padding byte at offset + 13 is not guaranteed to be 0 after encode

            // Verify areas before offset are untouched
            for (int i = 0; i < offset; i++) {

   *
   * <p>The returned fluent iterable's iterator supports {@code remove()} if the {@code Iterator} of
   * this fluent iterable supports it. Note that it is <i>not</i> possible to delete the last
   * skipped element by immediately calling {@code remove()} on the returned fluent iterable's

   * stream is longer, its extra elements will be ignored.
   *
   * <p>Note that if you are calling {@link Stream#forEach} on the resulting stream, you might want
   * to consider using {@link #forEachPair} instead of this method.
   *
   * <p><b>Performance note:</b> The resulting stream is not <a
   * href="http://gee.cs.oswego.edu/dl/html/StreamParallelGuidance.html">efficiently splittable</a>.

 *
 * When the maximum concurrent streams limit is reduced, some allocations will be rescinded.
 * Attempting to create new streams on these allocations will fail.
 *
 * Note that an allocation may be released before its stream is completed. This is intended to make
 * bookkeeping easier for the caller: releasing the allocation as soon as the terminal stream has