finished = true;
    }

    @Override
    protected HashCode makeHash() {
      if (!finished) {
        // processRemaining does teardown we always want to do -- the folding together of the four
        // rolling CRCs.  So we call it on an empty ByteBuffer if we didn't already.
        processRemaining(EMPTY);
      }
      return HashCode.fromInt(~crc0);
    }

    static final int[] byteTable = {

 *
 * See [RFC 7692, 7.1][rfc_7692] for details on negotiation process.
 *
 * [rfc_7692]: https://tools.ietf.org/html/rfc7692#section-7.1
 */
@IgnoreJRERequirement // As of AGP 3.4.1, D8 desugars API 24 hashCode methods.
data class WebSocketExtensions(
  /** True if the agreed upon extensions includes the permessage-deflate extension. */
  @JvmField val perMessageDeflate: Boolean = false,

      return false;
    }

    ElementOrder<?> other = (ElementOrder<?>) obj;
    return (type == other.type) && Objects.equals(comparator, other.comparator);
  }

  @Override
  public int hashCode() {
    return Objects.hash(type, comparator);
  }

  @Override
  public String toString() {
    ToStringHelper helper = MoreObjects.toStringHelper(this).add("type", type);
    if (comparator != null) {

 * higher space consumption.
 *
 * <p>This class extends {@link Number}, but does not define methods such as {@code
 * equals}, {@code hashCode} and {@code compareTo} because instances are expected to be mutated, and
 * so are not useful as collection keys.
 *
 * <p>jsr166e note: This class is targeted to be placed in java.util.concurrent.atomic.
 *

    create().clear();
    create().contains("foo");
    create().containsAll(ImmutableList.of("foo"));
    create().equals(new ArrayDeque<>(ImmutableList.of("foo")));
    create().hashCode();
    create().isEmpty();
    create().iterator();
    create().remove("foo");
    create().removeAll(ImmutableList.of("foo"));
    create().retainAll(ImmutableList.of("foo"));
    create().size();

      return false;
    }

    ElementOrder<?> other = (ElementOrder<?>) obj;
    return (type == other.type) && Objects.equals(comparator, other.comparator);
  }

  @Override
  public int hashCode() {
    return Objects.hash(type, comparator);
  }

  @Override
  public String toString() {
    ToStringHelper helper = MoreObjects.toStringHelper(this).add("type", type);
    if (comparator != null) {

      LocalCache<Object, Object> map = makeLocalCache(builder);

      Object keyOne = new Object();
      Object valueOne = new Object();
      int hashOne = map.hash(keyOne);
      ReferenceEntry<Object, Object> entryOne = map.newEntry(keyOne, hashOne, null);
      ValueReference<Object, Object> valueRefOne = map.newValueReference(entryOne, valueOne, 1);
      assertThat(valueRefOne.get()).isSameInstanceAs(valueOne);

      LocalCache<Object, Object> map = makeLocalCache(builder);

      Object keyOne = new Object();
      Object valueOne = new Object();
      int hashOne = map.hash(keyOne);
      ReferenceEntry<Object, Object> entryOne = map.newEntry(keyOne, hashOne, null);
      ValueReference<Object, Object> valueRefOne = map.newValueReference(entryOne, valueOne, 1);
      assertThat(valueRefOne.get()).isSameInstanceAs(valueOne);

                        && Objects.equals(repositories, that.repositories)
                        && nature == that.nature;
            }

            @Override
            public int hashCode() {
                return Objects.hash(artifactCoordinates, repositories, nature);
            }

            @Override
            public String toString() {

                return false;
            }
            Key<?> key = (Key<?>) o;
            return Objects.equals(id, key.id) && Objects.equals(type, key.type);
        }

        @Override
        public int hashCode() {
            return Objects.hash(id, type);
        }
    }