public Set<V> removeAll(@Nullable Object key) {
    return (Set<V>) super.removeAll(key);
  }

  @Override
  public Set<V> replaceValues(@ParametricNullness K key, Iterable<? extends V> values) {
    return (Set<V>) super.replaceValues(key, values);
  }

  @Override
  Set<Entry<K, V>> createEntries() {
    return Sets.filter(unfiltered().entries(), entryPredicate());
  }

  @Override
  public Set<Entry<K, V>> entries() {

    return suite;
  }

  protected SetMultimap<String, Integer> create() {
    return TreeMultimap.create();
  }

  /** Create and populate a {@code TreeMultimap} with the natural ordering of keys and values. */
  private TreeMultimap<String, Integer> createPopulate() {
    TreeMultimap<String, Integer> multimap = TreeMultimap.create();
    multimap.put("google", 2);
    multimap.put("google", 6);
    multimap.put("foo", 3);

            System.out.printf("Total unique values: %d%n", group.totalUnique);
            System.out.printf("Total occurrences: %d%n", group.totalOccurrences);
            System.out.printf("Duplication ratio: %.2f%n", (double) group.totalOccurrences / group.totalUnique);

            System.out.println("\nMost frequent values across all paths:");
            for (ValueFrequency v : group.mostFrequentValues) {

// Trivial collisions are avoided, but this is by no means a strong hash.
func hashDeterministicString(m map[string]string) uint64 {
	// Seed (random)
	crc := uint64(0xc2b40bbac11a7295)
	// Xor each value to make order independent
	for k, v := range m {
		// Separate key and value with an individual xor with a random number.
		// Add values of each, so they cannot be trivially collided.

    }

    // Test append method with double array
    @Test
    public void test_append_doubleArray() {
        StringBuilder buf = new StringBuilder();
        double[] values = { 1.5, 2.3, 3.7 };
        Supplier<Object> supplier = () -> values;

        monitorTarget.append(buf, "arrayKey", supplier);
        assertEquals("\"arrayKey\":[1.5, 2.3, 3.7]", buf.toString());
    }

   * same value those two ranges will be coalesced.
   *
   * <p><b>Note:</b> coalescing requires calling {@code .equals()} on any connected values, which
   * may be expensive depending on the value type. Using this method on range maps with large values
   * such as {@link Collection} types is discouraged.
   *
   * @since 22.0
   */
  void putCoalescing(Range<K> range, V value);

            // Second read with different values
            byte[] fileId2 = new byte[16];
            Arrays.fill(fileId2, (byte) 0x99);
            byte[] buffer2 = createValidOplockBreakBuffer((byte) 0x08, fileId2);
            notification.readBytesWireFormat(buffer2, 0);

            // Verify second read overwrote first read values

        if (name.endsWith("/")) {
            name = name.substring(0, name.length() - 1);
        }
        final String[] values = name.split("/");
        if (values.length == 0) {
            return StringUtil.EMPTY;
        }
        return values[values.length - 1];
    }

    /**
     * Encodes an object name to a URL-safe base64 string.
     *

      this.y1 = y1;
    }

    /**
     * Finish building an instance which also maps {@code x = x2} to {@code y = y2}. These values
     * must not both be identical to the values given in the first mapping. If only the {@code x}
     * values are identical, the transformation is vertical. If only the {@code y} values are
     * identical, the transformation is horizontal (i.e. the slope is zero).
     */

			return ErrInvalidQueryParams
		}
	}
	return ErrNone
}

// Parses all the presigned signature values into separate elements.
func parsePreSignV4(query url.Values, region string, stype serviceType) (psv preSignValues, aec APIErrorCode) {
	// verify whether the required query params exist.
	aec = doesV4PresignParamsExist(query)
	if aec != ErrNone {
		return psv, aec
	}