assertTrue("Should have tag3", Arrays.asList(merged.getTags()).contains("tag3"));
        // Check for no duplicates
        long tag2Count = Arrays.stream(merged.getTags()).filter(t -> t.equals("tag2")).count();
        assertEquals("tag2 should appear only once", 1, tag2Count);
    }

    @Test
    public void test_merge_allKinds() {
        String[] text1 = { "test" };

 *       to be traversed is a tree or forest even if it is a subgraph of a graph which is neither.)
 *   <li>Are the node objects' implementations of {@code equals()}/{@code hashCode()} <a
 *       href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursive</a>?
 * </ol>
 *
 * <p>If your answers are:
 *
 * <ul>

        queryFieldConfig.highlightedFields(stream -> {
            stream.forEach(field -> {
                count.incrementAndGet();
                assertTrue(field.equals("field1") || field.equals("field2") || field.equals("field3"));
            });
        });

        assertEquals(3, count.get());
    }

    @Test
    public void test_highlightedFields_empty() {
        String[] fields = {};

 * {@code SetMultimap} instead, two presidents would have vanished, and last names might or might
 * not appear in chronological order.
 *
 * <p><b>Warning:</b> instances of type {@code Multimap} may not implement {@link Object#equals} in
 * the way you expect. Multimaps containing the same key-value pairs, even in the same order, may or
 * may not be equal and may or may not have the same {@code hashCode}. The recommended subinterfaces

        sorted = new LinkedList();
        fmt = req.getParameter("fmt");
        if (fmt == null) {
            fmt = "col";
        }
        sort = 0;
        if ((str = req.getParameter("sort")) == null || str.equals("name")) {
            sort = 0;
        } else if (str != null) {
            switch (str) {
            case "size":
                sort = 1;
                break;
            case "type":

    private final int i;

    MyInt(int i) {
      this.i = i;
    }

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

    @Override
    public boolean equals(Object o) {
      return o instanceof MyInt && ((MyInt) o).i == i;
    }
  }

  public void testAsFunction_simplistic() {
    String canonical = "a";
    String not = new String("a");

      return false;
    }
    for (int i = smearedHash(target); ; i++) {
      i &= mask;
      Object candidate = table[i];
      if (candidate == null) {
        return false;
      } else if (candidate.equals(target)) {
        return true;
      }
    }
  }

  @Override
  public int size() {
    return elements.length;
  }

  // We're careful to put only E instances into the array in the mainline.

            }
        }

        return snapshots.values();
    }

    @Override
    public Artifact transformArtifact(Artifact artifact) {
        if (artifact.isSnapshot() && artifact.getVersion().equals(artifact.getBaseVersion())) {
            Object key = RemoteSnapshotMetadata.getKey(artifact);
            RemoteSnapshotMetadata snapshotMetadata = snapshots.get(key);
            if (snapshotMetadata != null) {

    }

    @Override
    public boolean containsAll(final Collection<?> c) {
        return parent.containsAll(c);
    }

    @Override
    public boolean equals(final Object o) {
        return parent.equals(o);
    }

    @Override
    public Map<String, Object> get(final int index) {
        return parent.get(index);
    }

    @Override
    public int hashCode() {

description="Replace checking element presense in array with a utility function" suppressId="manual_array_contains" problemDescriptor="Replace manual array-contains check with utility function" text="for ($TYPE$ $ITEM$ : $ARR$) {
    if ($ITEM$.equals($TARGET$)) {
       return $RES$;
    }
}" recursive="false" caseInsensitive="false" type="JAVA" pattern_context="default" reformatAccordingToStyle="true" shortenFQN="true" useStaticImport="true" replacement="if (org.gradle.util.inter...