// Multiple leading backslashes - only first one gets stripped, then trailing ones get stripped
        // But getPath() adds a backslash at the beginning, so \\fourth\path\\ becomes \fourth\path\
        request.setPath("\\\\fourth\\path\\\\");
        assertEquals("\\\\fourth\\path\\", request.getPath());
    }

        CommonServerMessageBlockRequest fourth = third.getNext();
        boolean firstAllowsSecond = request.allowChain(nextRequest);
        boolean secondAllowsThird = nextRequest.allowChain(thirdRequest);

        // Then
        assertEquals(nextRequest, second);
        assertEquals(thirdRequest, third);
        assertNull(fourth);
        assertTrue(firstAllowsSecond);

            contexts[1] = null; // Null context
            contexts[2] = new MockCreateContextRequest("THIRD");
            contexts[3] = new MockCreateContextRequest("FOURTH");

            byte[] buffer = new byte[256];
            int offset = 0;
            int validCount = 0;

            for (CreateContextRequest context : contexts) {
                if (context != null) {

    }

    /**
     * Test multiple name changes
     */
    public void test_multipleNameChanges() {
        String[] names = { "first", "second", "third", "fourth", "fifth" };

        for (String name : names) {
            testTransformer.setName(name);
            assertEquals(name, testTransformer.getName());
        }

        // Verify final state

  }

  private static final class PaddedLock extends ReentrantLock {
    /*
     * Padding from 40 into 64 bytes, same size as cache line. Might be beneficial to add a fourth
     * long here, to minimize chance of interference between consecutive locks, but I couldn't
     * observe any benefit from that.
     */
    long unused1;
    long unused2;
    long unused3;

    for (int i = 0; i < 5; i++) {
      limiter.acquire();
    }
    assertEvents("R0.00", "R1.00", "R1.00", "R1.00", "R1.00");
  }

  /**
   * Make sure that bursts can never go above 1-second-worth-of-work for the current rate, even when
   * we change the rate.
   */
  public void testWeNeverGetABurstMoreThanOneSec() {
    RateLimiter limiter = RateLimiter.create(1.0, stopwatch);

    for (int i = 0; i < 5; i++) {
      limiter.acquire();
    }
    assertEvents("R0.00", "R1.00", "R1.00", "R1.00", "R1.00");
  }

  /**
   * Make sure that bursts can never go above 1-second-worth-of-work for the current rate, even when
   * we change the rate.
   */
  public void testWeNeverGetABurstMoreThanOneSec() {
    RateLimiter limiter = RateLimiter.create(1.0, stopwatch);

import java.util.Iterator;
import org.jspecify.annotations.Nullable;

/**
 * A function from {@code A} to {@code B} with an associated <i>reverse</i> function from {@code B}
 * to {@code A}; used for converting back and forth between <i>different representations of the same
 * information</i>.
 *
 * <h3>Invertibility</h3>
 *
 * <p>The reverse operation <b>may</b> be a strict <i>inverse</i> (meaning that {@code

 * when there is a specific reason to prioritize memory over CPU.
 *
 * @author Louis Wasserman
 */
@J2ktIncompatible // no support for access-order mode in LinkedHashMap delegate
@GwtIncompatible // not worth using in GWT for now
final class CompactLinkedHashMap<K extends @Nullable Object, V extends @Nullable Object>
    extends CompactHashMap<K, V> {

 * if any intersection is found. The sizes of both arguments are assumed to be so small, and the
 * likelihood of an intersection so great, that it is not worth the CPU cost of sorting or the
 * memory cost of hashing.
 */
internal fun Array<String>.hasIntersection(
  other: Array<String>?,
  comparator: Comparator<in String>,
): Boolean {