Set<K> seen = new HashSet<>();
      BitSet dups = new BitSet(); // slots that are overridden by a later duplicate key
      for (int i = size - 1; i >= 0; i--) {
        if (!seen.add(entries[i].getKey())) {
          dups.set(i);
        }
      }
      if (dups.isEmpty()) {
        return entries;
      }
      @SuppressWarnings({"rawtypes", "unchecked"})

      Set<Object> seenKeys = new HashSet<>();
      BitSet dups = new BitSet(); // slots that are overridden by a later duplicate key
      for (int i = size - 1; i >= 0; i--) {
        Object key = requireNonNull(localAlternatingKeysAndValues[2 * i]);
        if (!seenKeys.add(key)) {
          dups.set(i);
        }
      }
      if (dups.isEmpty()) {
        return localAlternatingKeysAndValues;
      }

pkg debug/elf, const R_LARCH_SOP_PUSH_ABSOLUTE = 23 #46229
pkg debug/elf, const R_LARCH_SOP_PUSH_ABSOLUTE R_LARCH #46229
pkg debug/elf, const R_LARCH_SOP_PUSH_DUP = 24 #46229
pkg debug/elf, const R_LARCH_SOP_PUSH_DUP R_LARCH #46229
pkg debug/elf, const R_LARCH_SOP_PUSH_GPREL = 25 #46229
pkg debug/elf, const R_LARCH_SOP_PUSH_GPREL R_LARCH #46229
pkg debug/elf, const R_LARCH_SOP_PUSH_PCREL = 22 #46229

	f := strings.Join(w.scope, ", ") + ", " + fmt.Sprintf(format, args...)
	if strings.Contains(f, "\n") {
		panic("feature contains newlines: " + f)
	}

	if _, dup := w.features[f]; dup {
		panic("duplicate feature inserted: " + f)
	}
	w.features[f] = true

	if verbose {
		log.Printf("feature: %s", f)
	}
}

func needApproval(filename string) bool {

    try {
      ImmutableBiMap.copyOf(map);
      fail();
    } catch (IllegalArgumentException expected) {
      assertThat(expected.getMessage()).containsMatch("1|2");
      // We don't specify which of the two dups should be reported.
    }
  }

  public void testToImmutableBiMap() {
    Collector<Entry<String, Integer>, ?, ImmutableBiMap<String, Integer>> collector =

    try {
      ImmutableBiMap.copyOf(map);
      fail();
    } catch (IllegalArgumentException expected) {
      assertThat(expected.getMessage()).containsMatch("1|2");
      // We don't specify which of the two dups should be reported.
    }
  }

  // TODO(b/172823566): Use mainline testToImmutableBiMap once CollectorTester is usable to java7.
  public void testToImmutableBiMap_java7_combine() {

			// of this fashion such as
			//  - foo-1
			//  - foo-1/
			// we should avoid this situation by making sure that
			// we compare the `foo-1/` after path.Clean() to
			// de-dup the entries.
			if path.Clean(best.name) == path.Clean(other.name) {
				toMerge = append(toMerge, otherIdx)
				continue
			}
			if best.name > other.name {
				toMerge = toMerge[:0]
				best = other