new UnhashableObject(5));
    }
  }

  public static class Colliders extends SampleElements<Object> {
    public Colliders() {
      super(new Collider(1), new Collider(2), new Collider(3), new Collider(4), new Collider(5));
    }
  }

  private static final class Collider {
    final int value;

    Collider(int value) {
      this.value = value;
    }

    @Override

          new UnhashableObject(5));
    }
  }

  public static class Colliders extends SampleElements<Object> {
    public Colliders() {
      super(new Collider(1), new Collider(2), new Collider(3), new Collider(4), new Collider(5));
    }
  }

  private static final class Collider {
    final int value;

    Collider(int value) {
      this.value = value;
    }

    @Override

package com.google.common.collect.testing;

import com.google.common.annotations.GwtCompatible;
import com.google.common.collect.testing.SampleElements.Colliders;
import java.util.List;
import org.jspecify.annotations.NullMarked;

/**
 * A generator using sample elements whose hash codes all collide badly.
 *
 * @author Kevin Bourrillion
 */
@GwtCompatible
@NullMarked

  }

  @Override
  protected Map<Object, Integer> makePopulatedMap() {
    Colliders colliders = new Colliders();
    return ImmutableMap.of(
        colliders.e0(), 0,
        colliders.e1(), 1,
        colliders.e2(), 2,
        colliders.e3(), 3);
  }

  @Override
  protected Object getKeyNotInPopulatedMap() {
    return new Colliders().e4();
  }

  @Override
  protected Integer getValueNotInPopulatedMap() {

            }
          }
          collide = false;
        } else if (!wasUncontended) // CAS already known to fail
        wasUncontended = true; // Continue after rehash
        else if (a.cas(v = a.value, fn(v, x))) break;
        else if (n >= NCPU || cells != as) collide = false; // At max size or stale
        else if (!collide) collide = true;
        else if (busy == 0 && casBusy()) {
          try {

    assertEqualHashCode(Predicates.or(p1, p2), Predicates.or(p1, p2));

    // While not a contractual requirement, we'd like the hash codes for ands
    // & ors of the same predicates to not collide.
    assertTrue(Predicates.and(p1, p2).hashCode() != Predicates.or(p1, p2).hashCode());
  }

  @J2ktIncompatible
  @GwtIncompatible // reflection
  public void testNulls() throws Exception {