assertEquals(ITERATIONS / 2, map.size());
    assertEquals(nonZeroKeys, map.asMap().keySet());
  }

  public void testClear() {
    AtomicLongMap<Object> map = AtomicLongMap.create();
    for (int i = 0; i < ITERATIONS; i++) {
      map.put(new Object(), i);
    }
    assertEquals(ITERATIONS, map.size());

    map.clear();
    assertEquals(0, map.size());
    assertTrue(map.isEmpty());
  }

    assertEquals(ITERATIONS / 2, map.size());
    assertEquals(nonZeroKeys, map.asMap().keySet());
  }

  public void testClear() {
    AtomicLongMap<Object> map = AtomicLongMap.create();
    for (int i = 0; i < ITERATIONS; i++) {
      map.put(new Object(), i);
    }
    assertEquals(ITERATIONS, map.size());

    map.clear();
    assertEquals(0, map.size());
    assertTrue(map.isEmpty());
  }

 */

package com.google.common.primitives;

import com.google.common.annotations.GwtCompatible;

@GwtCompatible
final class TestPlatform {
  static int reduceIterationsIfGwt(int iterations) {
    return iterations / 10;
  }

  private TestPlatform() {}

   * @param k1 the second half of the key
   */
  SipHashFunction(int c, int d, long k0, long k1) {
    checkArgument(
        c > 0, "The number of SipRound iterations (c=%s) during Compression must be positive.", c);
    checkArgument(
        d > 0, "The number of SipRound iterations (d=%s) during Finalization must be positive.", d);
    this.c = c;
    this.d = d;
    this.k0 = k0;
    this.k1 = k1;
  }

  @Override

import com.google.common.annotations.GwtCompatible;
import org.jspecify.annotations.NullUnmarked;

@GwtCompatible
@NullUnmarked
final class TestPlatform {
  static int reduceIterationsIfGwt(int iterations) {
    return iterations;
  }

  private TestPlatform() {}

import com.google.common.annotations.GwtCompatible;
import org.jspecify.annotations.NullUnmarked;

@GwtCompatible
@NullUnmarked
final class TestPlatform {
  static int reduceIterationsIfGwt(int iterations) {
    return iterations;
  }

  private TestPlatform() {}

            assertNull(exceptions[i], "Thread " + i + " threw exception");
        }

        // Verify all readers completed all iterations
        for (int i = 0; i < readerCount; i++) {
            assertEquals("Reader " + i + " should complete all iterations", iterations, trueCount[i] + falseCount[i]);
        }
    }

    /**
     * Test getName() method can be called concurrently without issues.
     */

        executor.shutdown();

        // Then - Verify no exceptions occurred
        if (!exceptions.isEmpty()) {
            fail("Concurrent operations caused exceptions: " + exceptions.get(0));
        }

        assertEquals(threadCount * opsPerThread, successCount.get(), "All operations should succeed");
    }

    /**
     * Test that session release with double-check pattern prevents race conditions.
     */
    @Test

        for (int i = 0; i < iterations; i++) {
            auth1.equals(auth2);
        }
        long endTime = System.nanoTime();

        return (endTime - startTime) / iterations;
    }

   * 800 bytes long as the C++ reference implementation.
   */
  public void testMultipleLengths() {
    int iterations = 800;
    byte[] buf = new byte[iterations * 4];
    int bufLen = 0;
    long h = 0;
    for (int i = 0; i < iterations; ++i) {
      h ^= fingerprint(buf, i);
      h = remix(h);
      buf[bufLen++] = getChar(h);

      h ^= fingerprint(buf, i * i % bufLen);