builder.addEscape(' ', "-");
    builder.addEscape('!', "$");
    Escaper second = builder.build();
    // This should have no effect on existing escapers.
    builder.addEscape(' ', "*");

    // Test both escapers after modifying the builder.
    assertThat(first.escape("The Quick Brown Fox!")).isEqualTo("Xhe_Xuick_Xrown_XoxX");
    assertThat(second.escape("The Quick Brown Fox!")).isEqualTo("Xhe-Xuick-Xrown-Xox$");
  }

            // v1 node string follows
            bb.put("\\server1\0".getBytes(StandardCharsets.UTF_16LE));

            // Position for second referral
            bb.position(28); // 8 header + 20 first referral

            // Second Referral v1
            bb.putShort((short) 1); // version
            bb.putShort((short) 22); // size
            bb.putShort((short) 2); // serverType

# Window size in milliseconds.
rate.limit.window.ms=60000
# Duration in milliseconds to block IP when limit exceeded.
rate.limit.block.duration.ms=300000
# Retry-After header value in seconds.
rate.limit.retry.after.seconds=60
# Comma-separated list of whitelisted IPs (e.g., 127.0.0.1,::1).
rate.limit.whitelist.ips=127.0.0.1,::1
# Comma-separated list of blocked IPs.
rate.limit.blocked.ips=

                }
            });
        }

        // Start all threads
        startLatch.countDown();

        // Wait for completion
        assertTrue(endLatch.await(30, TimeUnit.SECONDS), "All threads should complete");
        executor.shutdown();

        // Then - All operations should succeed
        assertTrue(exceptions.isEmpty(), "No exceptions should occur");

		return nil, nil, err
	}

	// Wait up to 10 seconds for disks to come online.
	pools := obj.(*erasureServerPools)
	t := time.Now()
	for _, pool := range pools.serverPools {
		for _, sets := range pool.erasureDisks {
			for _, s := range sets {
				if !s.IsLocal() {
					for !s.IsOnline() {
						time.Sleep(100 * time.Millisecond)
						if time.Since(t) > 10*time.Second {

pkg p4, func Clone[$0 interface{ ~[]$1 }, $1 interface{}]($0) $0
pkg p4, func NewPair[$0 interface{ M }, $1 interface{ ~int }]($0, $1) Pair[$0, $1]
pkg p4, method (Pair[$0, $1]) First() $0
pkg p4, method (Pair[$0, $1]) Second() $1

@GwtCompatible
@NullUnmarked
public class AbstractIteratorTest extends TestCase {

  public void testDefaultBehaviorOfNextAndHasNext() {

    // This sample AbstractIterator returns 0 on the first call, 1 on the
    // second, then signals that it's reached the end of the data
    Iterator<Integer> iter =
        new AbstractIterator<Integer>() {
          private int rep;

          @Override
          public @Nullable Integer computeNext() {

     * @return load balancing strategy
     */
    String getLoadBalancingStrategy();

    /**
     * Channel health check interval in seconds
     *
     * Property {@code jcifs.smb.client.channelHealthCheckInterval} (int, default 10)
     *
     * @return health check interval in seconds
     */
    int getChannelHealthCheckInterval();

    /**
     * Property {@code jcifs.smb.client.handleStateDirectory}
     *

import com.google.common.annotations.GwtIncompatible;
import java.util.concurrent.locks.LockSupport;
import org.jspecify.annotations.Nullable;

/**
 * Works around an android bug, where parking for more than INT_MAX seconds can produce an abort
 * signal on 32 bit devices running Android Q.
 */
@GwtIncompatible
final class OverflowAvoidingLockSupport {
  // Represents the max nanoseconds representable on a linux timespec with a 32 bit tv_sec

        return ordinal() <= v.ordinal();
    }

    /**
     * Get the minimum of two dialect versions
     *
     * @param a the first version to compare
     * @param b the second version to compare
     * @return smaller of the two versions
     */
    public static DialectVersion min(final DialectVersion a, final DialectVersion b) {
        if (a.atMost(b)) {
            return a;
        }