if (object instanceof HashCode) {
      HashCode that = (HashCode) object;
      return bits() == that.bits() && equalsSameBits(that);
    }
    return false;
  }

  /**
   * Returns a "Java hash code" for this {@code HashCode} instance; this is well-defined (so, for
   * example, you can safely put {@code HashCode} instances into a {@code HashSet}) but is otherwise

    int dataLength() {
      return data.length();
    }

    @Override
    public boolean equals(@Nullable Object o) {
      if (o instanceof LockFreeBitArray) {
        LockFreeBitArray lockFreeBitArray = (LockFreeBitArray) o;
        // TODO(lowasser): avoid allocation here
        return Arrays.equals(toPlainArray(data), toPlainArray(lockFreeBitArray.data));

                .build();
    }

    /**
     * Returns a new builder for creating XmlNode instances.
     *
     * @return a new Builder instance
     */
    static Builder newBuilder() {
        return new Builder();
    }

    /**
     * Builder class for creating XmlNode instances.
     * <p>
     * This builder provides a fluent API for setting the various properties of an XML node.

  public void testValues() {
    LocalCache<Object, Object> map = makeLocalCache(createCacheBuilder());
    map.put("foo", "bar");
    map.put("baz", "bar");
    map.put("quux", "quux");
    assertThat(map.values() instanceof Set).isFalse();
    assertThat(map.values().removeAll(ImmutableSet.of("bar"))).isTrue();
    assertThat(map).hasSize(1);
  }

  public void testComputeIfAbsent_removalListener() {

  public void testValues() {
    LocalCache<Object, Object> map = makeLocalCache(createCacheBuilder());
    map.put("foo", "bar");
    map.put("baz", "bar");
    map.put("quux", "quux");
    assertThat(map.values() instanceof Set).isFalse();
    assertThat(map.values().removeAll(ImmutableSet.of("bar"))).isTrue();
    assertThat(map).hasSize(1);
  }

  public void testCopyEntry_computing() {

    assertThrows(IndexOutOfBoundsException.class, () -> iia3.subArray(1, 4));
  }

  /*
   * Whenever an implementation uses `instanceof` on a parameter instance, the test has to know that
   * (so much for "black box") and try instances that both do and don't pass the check. The "don't"
   * half of that is more awkward to arrange...
   */
  private static <T> Iterable<T> iterable(Collection<T> collection) {

 *         .onResultOf(getBarFunction)
 *         .nullsLast();
 * }
 *
 * Note that each chaining method returns a new ordering instance which is backed by the previous
 * instance, but has the chance to act on values <i>before</i> handing off to that backing instance.
 * As a result, it usually helps to read chained ordering expressions <i>backwards</i>. For example,
 * when {@code compare} is called on the above ordering:
 *

            if (properties != null) {
                for (Map.Entry<Object, Object> entry : properties.entrySet()) {
                    Object v = entry.getValue();
                    if (v instanceof String value) {
                        String inter = interpolate(value);
                        if (value != inter && inter != null) {
                            entry.setValue(inter);
                        }

    }

    /** {@inheritDoc} */
    @Override
    public boolean equals(Object object) {
        if (this == object) {
            return true;
        }

        if (object instanceof MojoDescriptor other) {
            return Objects.equals(getPluginDescriptor(), other.getPluginDescriptor())
                    && Objects.equals(getGoal(), other.getGoal());
        }

        return false;

        return lockedGetOrLoad(key, hash, loader);
      } catch (ExecutionException ee) {
        Throwable cause = ee.getCause();
        if (cause instanceof Error) {
          throw new ExecutionError((Error) cause);
        } else if (cause instanceof RuntimeException) {
          throw new UncheckedExecutionException(cause);
        }
        throw ee;
      } finally {
        postReadCleanup();