* <ul>
     *   <li>Its execution does not cause any observable side effects.
     *   <li>The computation is <i>consistent with equals</i>; that is, {@link Objects#equals
     *       Objects.equals}{@code (k1, k2) &&} {@link Objects#equals Objects.equals}{@code (v1,
     *       v2)} implies that {@code Objects.equals(transformer.transform(k1, v1),
     *       transformer.transform(k2, v2))}.
     * </ul>
     *

     * <ul>
     *   <li>Its execution does not cause any observable side effects.
     *   <li>The computation is <i>consistent with equals</i>; that is, {@link Objects#equals
     *       Objects.equals}{@code (k1, k2) &&} {@link Objects#equals Objects.equals}{@code (v1,
     *       v2)} implies that {@code Objects.equals(transformer.transform(k1, v1),
     *       transformer.transform(k2, v2))}.
     * </ul>
     *

                // treeConnect good enough to test service type
                connect0();
                if (share.equals("IPC$")) {
                    type = TYPE_NAMED_PIPE;
                } else if (tree.service.equals("LPT1:")) {
                    type = TYPE_PRINTER;
                } else if (tree.service.equals("COMM")) {
                    type = TYPE_COMM;
                } else {
                    type = TYPE_SHARE;

                    String aliasName = f.getName().replaceFirst(".json$", "");
                    if (index.equals(DOC_INDEX)) {
                        if ("fess.search".equals(aliasName)) {
                            aliasName = fessConfig.getIndexDocumentSearchIndex();
                        } else if ("fess.update".equals(aliasName)) {
                            aliasName = fessConfig.getIndexDocumentUpdateIndex();

HSPLkotlin/collections/EmptyMap;-><init>()V
HSPLkotlin/collections/EmptyMap;->isEmpty()Z
HSPLkotlin/collections/EmptySet;-><clinit>()V
HSPLkotlin/collections/EmptySet;-><init>()V
HSPLkotlin/collections/EmptySet;->equals(Ljava/lang/Object;)Z
HSPLkotlin/collections/EmptySet;->hashCode()I
HSPLkotlin/collections/EmptySet;->isEmpty()Z
HSPLkotlin/collections/EmptySet;->iterator()Ljava/util/Iterator;

    map.put(1, 1);
    map.put(2, 1);
    map.put(3, 1);
    map.entrySet()
        .removeIf(
            entry -> {
              if (entry.getValue().equals(1)) {
                map.put(entry.getKey(), 2);
                return true;
              } else {
                return false;
              }
            });
    assertThat(map).hasSize(3);

            <![CDATA[
    /**
     * @see java.lang.Object#equals(java.lang.Object)
     */
    public boolean equals(Object o) {
        if (this == o) {
            return true;
        } else if (o instanceof Extension e) {
            return java.util.Objects.equals(e.getArtifactId(), getArtifactId())
                && java.util.Objects.equals(e.getGroupId(), getGroupId())

                // trigger requests to resolve the actual target
                exists();
                dest.exists();

                if (!Objects.equals(getServerWithDfs(), dest.getServerWithDfs()) || !Objects.equals(getShare(), dest.getShare())) {
                    throw new SmbException("Cannot rename between different trees");
                }
            }

    public Object load(Object key) {
      return new Object();
    }

    @Override
    public int hashCode() {
      return 42;
    }

    @Override
    public boolean equals(@Nullable Object o) {
      return o instanceof SerializableCacheLoader;
    }
  }

  private static class SerializableRemovalListener<K, V>
      implements RemovalListener<K, V>, Serializable {

    public V getValue() {
      return value;
    }

    @Override
    public boolean equals(@Nullable Object object) {
      // Cannot use key and value equivalence
      if (object instanceof Entry) {
        Entry<?, ?> that = (Entry<?, ?>) object;
        return key.equals(that.getKey()) && value.equals(that.getValue());
      }
      return false;
    }

    @Override