long _15_gigabytes = 15L * 1000L * 1000L * 1000L;
        assertEquals("15 GB", format.format(_15_gigabytes));

        long _1000_gigabytes = 1000L * 1000L * 1000L * 1000L;
        assertEquals("1000 GB", format.format(_1000_gigabytes));
    }

    @Test
    void testSizeWithSelectedScaleUnit() {
        FileSizeFormat format = new FileSizeFormat();

        long _0_bytes = 0L;

    void testFormatDuration() {
        assertEquals("0.001 s", CLIReportingUtils.formatDuration(1));
        assertEquals("0.999 s", CLIReportingUtils.formatDuration(1000 - 1));
        assertEquals("1.000 s", CLIReportingUtils.formatDuration(1000));
        assertEquals("59.999 s", CLIReportingUtils.formatDuration(60 * 1000 - 1));
        assertEquals("01:00 min", CLIReportingUtils.formatDuration(60 * 1000));

        assertOrder(X_EQ_Y, "1.0-ga", "1.0.0-ga");
        assertOrder(X_EQ_Y, "1.0.ga", "1.0.0.ga");
        assertOrder(X_EQ_Y, "1.0ga", "1.0.0ga");

        assertOrder(X_EQ_Y, "1.0-alpha", "1.0.0-alpha");
        assertOrder(X_EQ_Y, "1.0.alpha", "1.0.0.alpha");
        assertOrder(X_EQ_Y, "1.0alpha", "1.0.0alpha");
        assertOrder(X_EQ_Y, "1.0-alpha-snapshot", "1.0.0-alpha-snapshot");

   * TreeMultimap.
   */
  public void testCreateFromTreeMultimap() {
    Multimap<Double, Double> tree = TreeMultimap.create(KEY_COMPARATOR, VALUE_COMPARATOR);
    tree.put(1.0, 2.0);
    tree.put(2.0, 3.0);
    tree.put(3.0, 4.0);
    tree.put(4.0, 5.0);

    TreeMultimap<Double, Double> copyFromTree = TreeMultimap.create(tree);
    assertEquals(tree, copyFromTree);

    // Tests that serializing a map, its keySet, and values only writes the underlying data once.

    Entry<Integer, Integer>[] entries = (Entry<Integer, Integer>[]) new Entry<?, ?>[1000];
    for (int i = 0; i < 1000; i++) {
      entries[i] = ImmutableMap.entryOf(i, i);
    }

    ImmutableMap<Integer, Integer> map = RegularImmutableMap.fromEntries(entries);
    Set<Integer> keySet = map.keySet();

// avoided.
func TestWriterReadFromCounts(t *testing.T) {
	var w0 writeCountingDiscard
	b0 := NewWriterSize(&w0, 1234)
	b0.WriteString(strings.Repeat("x", 1000))
	if w0 != 0 {
		t.Fatalf("write 1000 'x's: got %d writes, want 0", w0)
	}
	b0.WriteString(strings.Repeat("x", 200))
	if w0 != 0 {
		t.Fatalf("write 1200 'x's: got %d writes, want 0", w0)
	}

    int range = 10_000; // range should be small enough that equal elements occur semi-frequently
    for (int iter = 0; iter < reduceIterationsIfGwt(1000); iter++) {
      for (int i = 0; i < 100; i++) {
        Integer element = random.nextInt(range);
        elements.add(element);
        queue.add(element);
      }
      Iterator<Integer> queueIterator = queue.iterator();

      int x = slowItDown();
      return x + super.compareTo(e) - x; // silly attempt to prevent opt
    }

    static int slowItDown() {
      int result = 0;
      for (int i = 1; i <= 1000; i++) {
        result += i;
      }
      return result;
    }
  }

        api("org.javassist:javassist:3.27.0-GA")
        api("org.jetbrains.kotlinx:kotlinx-metadata-jvm:0.9.0")
        api("org.jsoup:jsoup:1.15.3")
        api("org.junit.jupiter:junit-jupiter:5.8.2")
        api("org.junit.vintage:junit-vintage-engine:5.8.2")
        api("org.openmbee.junit:junit-xml-parser:1.0.0")
        api("org.ow2.asm:asm:$asmVersion")
        api("org.ow2.asm:asm-commons:$asmVersion")

      int x = slowItDown();
      return x + super.compareTo(e) - x; // silly attempt to prevent opt
    }

    static int slowItDown() {
      int result = 0;
      for (int i = 1; i <= 1000; i++) {
        result += i;
      }
      return result;
    }
  }