.addEqualityGroup(
            newHashSet(3, 2),
            union(singleton(3), singleton(2)),
            intersection(newHashSet(3, 2), newHashSet(3, 2, 1)),
            difference(newHashSet(3, 2, 1), newHashSet(1)),
            symmetricDifference(newHashSet(3, 1), newHashSet(2, 1)))
        .addEqualityGroup(
            newHashSet(1, 2, 3),

        // Clear execution order before test
        PriorityTrackingBooster.clearExecutionOrder();

        scoreUpdater.execute();

        // Boosters should be executed in priority order (3, 2, 1)
        List<Integer> executionOrder = PriorityTrackingBooster.getExecutionOrder();
        assertEquals(3, executionOrder.size());
        assertEquals(Integer.valueOf(3), executionOrder.get(0));

        assertThrows(IllegalArgumentException.class, () -> new SimpleCircuitBreaker("invalid", 3, 0, 100));
        assertThrows(IllegalArgumentException.class, () -> new SimpleCircuitBreaker("invalid", 3, 2, -1));
    }

    @Test
    @DisplayName("Test statistics toString")
    void testStatisticsToString() throws Exception {
        circuitBreaker.call(() -> "success");

   * link(), which is defined at the end of this file.
   */

  private int getPredecessor(int entry) {
    return ((int) (link(entry) >>> 32)) - 1;
  }

  @Override
  int getSuccessor(int entry) {
    return ((int) link(entry)) - 1;
  }

  private void setSuccessor(int entry, int succ) {
    long succMask = ~0L >>> 32;

    multimap.put("bar", 1);
    multimap.putAll("foo", asList(-1, 2, 4));
    multimap.putAll("bar", asList(2, 3));
    multimap.put("foo", 1);
    assertThat(multimap.toString()).isEqualTo("{bar=[3, 2, 1], foo=[4, 3, 2, 1, -1]}");
  }

  public void testGetComparator() {
    TreeMultimap<@Nullable String, @Nullable Integer> multimap = createPopulate();
    assertEquals(StringLength.COMPARATOR, multimap.keyComparator());

        b.addDependency("c", "3.3.0-v3346");

        ArtifactSpec c = createArtifactSpec("c", "3.2.1-v3235e");

        OverConstrainedVersionException e = assertThrows(
                OverConstrainedVersionException.class, () -> collect(createSet(new Object[] {a.artifact})));
        assertTrue(e.getMessage().contains("[3.2.1-v3235e, 3.3.0-v3346]"), "Versions unordered");

  }

  private static final int MAXIMUM_CAPACITY = 1 << 30;

  static final float DEFAULT_LOAD_FACTOR = 1.0f;

  /** Bitmask that selects the low 32 bits. */
  private static final long NEXT_MASK = (1L << 32) - 1;

  /** Bitmask that selects the high 32 bits. */
  private static final long HASH_MASK = ~NEXT_MASK;

  static final int DEFAULT_SIZE = 3;

  // used to indicate blank table entries
  static final int UNSET = -1;

        final int len = str.length();
        int ch, size = 0;
        byte[] dst;

        for (int i = 0; i < len; i++) {
            ch = str.charAt(i);
            size += ch > 0x07F ? ch > 0x7FF ? 3 : 2 : 1;
        }
        dst = new byte[size];
        writeShort(size);
        try {
            Encdec.enc_utf8(str, dst, 0, size);
        } catch (final IOException ioe) {

    for (int r = Character.MIN_RADIX; r <= Character.MAX_RADIX; r++) {
      int radix = r;
      // tests can successfully parse a number string with this radix.
      String maxAsString = Long.toString((1L << 32) - 1, radix);
      assertThat(UnsignedInts.parseUnsignedInt(maxAsString, radix)).isEqualTo(-1);

      assertThrows(
          NumberFormatException.class,
          () -> {
            long overflow = 1L << 32;

   * link(), which is defined at the end of this file.
   */

  private int getPredecessor(int entry) {
    return ((int) (link(entry) >>> 32)) - 1;
  }

  @Override
  int getSuccessor(int entry) {
    return ((int) link(entry)) - 1;
  }

  private void setSuccessor(int entry, int succ) {
    long succMask = ~0L >>> 32;