// Write FileInternalInfo data at the large offset
        SMBUtil.writeInt8(0x123456789ABCDEFL, buffer, 1000);

        int result = response.readBytesWireFormat(buffer, bufferIndex);

        // Should return at least to the end of the data
        assertTrue(result >= 900); // 1000 + 8 - 100
        assertNotNull(response.getInfo());
    }

    @Test
    @DisplayName("Test readBytesWireFormat with zero buffer length")

            }
        };

        ThreadDumpUtil.processThreadDump(countingConsumer);

        // Verify that multiple threads were processed
        assertTrue("Should process at least one thread", threadCount.get() >= 1);
        assertTrue("Should have stack trace elements", stackTraceCount.get() > 0);
        assertTrue("Should have more stack traces than threads", stackTraceCount.get() > threadCount.get());

                    this.handle = this.pipe.openUnshared(this.openFlags, this.access, this.sharing, SmbConstants.ATTR_NORMAL, 0);
                } else {
                    // at least on samba, SmbComOpenAndX fails without the pipe prefix
                    this.handle = this.pipe.openUnshared("\\pipe" + getUncPath(), this.openFlags, this.access, this.sharing,

   *
   * @param array an array of {@code long} values, possibly empty
   * @param target a primitive {@code long} value
   * @return the least index {@code i} for which {@code array[i] == target}, or {@code -1} if no
   *     such index exists.
   */
  public static int indexOf(long[] array, long target) {
    return indexOf(array, target, 0, array.length);
  }

    val client = makeClient()
    makeRequest(client)

    // As of OkHttp 5 we now apply the ordering from the OkHttpClient, which defaults to MODERN_TLS
    // Clients might need a changed order, but can at least define a preferred order to override that default.
    val socketOrderedByDefaults =
      handshakeEnabledCipherSuites.sortedBy { ConnectionSpec.MODERN_TLS.cipherSuitesAsString!!.indexOf(it) }

    EnumHashBiMap<Currency, String> bimap = EnumHashBiMap.create(map);
    assertEquals("dollar", bimap.get(Currency.DOLLAR));
    assertEquals(Currency.DOLLAR, bimap.inverse().get("dollar"));

    /* Map must have at least one entry if not an EnumHashBiMap. */
    assertThrows(
        IllegalArgumentException.class,
        () -> EnumHashBiMap.create(Collections.<Currency, String>emptyMap()));

   * require its own suppression, since it is also unsound. toArray(T[]) is just a mess from a
   * nullness perspective. The signature below at least has the virtue of being relatively simple.
   */
  @SuppressWarnings("nullness")
  public final <T extends @Nullable Object> T[] toArray(T[] other) {
    checkNotNull(other);
    int size = size();

                // Exponential backoff with overflow protection
                if (retryDelayMs > 0) {
                    try {
                        // Safe calculation: ensure retryCount is at least 1 for proper exponential backoff
                        int safeShift = Math.min(MAX_BACKOFF_SHIFT, Math.max(1, retryCount));
                        long multiplier = 1L << safeShift;

     * with each iteration, so this algorithm takes O(log(digits)) iterations.
     *
     * We start out with a double-precision approximation, which may be higher or lower than the
     * true value. Therefore, we perform at least one Newton iteration to get a guess that's
     * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point.
     */
    BigInteger sqrt0;
    int log2 = log2(x, FLOOR);

		if tracker.isHealed(bucket) {
			continue
		}

		var forwardTo string
		// If we resume to the same bucket, forward to last known item.
		b := tracker.getBucket()
		if b == bucket {
			forwardTo = tracker.getObject()
		}
		if b != "" {
			// Reset to where last bucket ended if resuming.
			tracker.resume()
		}
		tracker.setObject("")
		tracker.setBucket(bucket)