* consistently between their order within {@code valuesInExpectedOrder} and the order implied by
   * the given {@code comparator}.
   *
   * <p>In detail, this method asserts
   *
   * <ul>
   *   <li><i>reflexivity</i>: {@code comparator.compare(t, t) = 0} for all {@code t} in {@code
   *       valuesInExpectedOrder}; and
   *   <li><i>consistency</i>: {@code comparator.compare(ti, tj) < 0} and {@code

        assertEquals(message, exception.getMessage());
        assertNull(exception.getCause());
    }

    public void test_getType_immutability() {
        // Test that getType returns the same value consistently
        String type = "ApiKey";
        String message = "API key expired";
        InvalidAccessTokenException exception = new InvalidAccessTokenException(type, message);

- **Assertion-based validation** - All methods validate inputs using `AssertionUtil.assertArgumentNotNull()` and `AssertionUtil.assertArgumentNotEmpty()`
- **Exception wrapping** - Checked exceptions are consistently wrapped in runtime exceptions (e.g., `ClassNotFoundException` → `ClassNotFoundRuntimeException`)

   *
   * <p><b>Note:</b> if you won't be adding any elements to the list, use {@link ImmutableList#of()}
   * instead.
   *
   * <p><b>Performance note:</b> {@link ArrayList} and {@link java.util.ArrayDeque} consistently
   * outperform {@code LinkedList} except in certain rare and specific situations. Unless you have
   * spent a lot of time benchmarking your specific needs, use one of those instead.
   *

   * <p>The {@code hash} has the following properties:
   *
   * <ul>
   *   <li>It is <i>consistent</i>: for any reference {@code x}, multiple invocations of {@code
   *       hash(x}} consistently return the same value provided {@code x} remains unchanged
   *       according to the definition of the equivalence. The hash need not remain consistent from
   *       one execution of an application to another execution of the same application.

        }
      };
    }

    /**
     * Uses a {@link LinkedList} to store value collections.
     *
     * <p><b>Performance note:</b> {@link ArrayList} and {@link java.util.ArrayDeque} consistently
     * outperform {@code LinkedList} except in certain rare and specific situations. Unless you have
     * spent a lot of time benchmarking your specific needs, use one of those instead. (However, we

        }
      };
    }

    /**
     * Uses a {@link LinkedList} to store value collections.
     *
     * <p><b>Performance note:</b> {@link ArrayList} and {@link java.util.ArrayDeque} consistently
     * outperform {@code LinkedList} except in certain rare and specific situations. Unless you have
     * spent a lot of time benchmarking your specific needs, use one of those instead. (However, we

    assertEquals(1, IntMath.saturatedAbs(-1));
    assertEquals(10, IntMath.saturatedAbs(10));
    assertEquals(10, IntMath.saturatedAbs(-10));
  }

  private static int force32(int value) {
    // GWT doesn't consistently overflow values to make them 32-bit, so we need to force it.
    return value & 0xffffffff;
  }

    long div = p / q; // throws if q == 0
    long rem = p - q * div; // equals p % q

    if (rem == 0) {
      return div;
    }

    /*
     * Normal Java division rounds towards 0, consistently with RoundingMode.DOWN. We just have to
     * deal with the cases where rounding towards 0 is wrong, which typically depends on the sign of
     * p / q.
     *

    // Test multiple calls to the same method return consistent results
    public void test_methodConsistency() {
        // Test assistClientInvokeNames consistency
        String[] names1 = invokerAssistant.assistClientInvokeNames();
        String[] names2 = invokerAssistant.assistClientInvokeNames();
        assertSame(names1, names2);

        // Test assistByPassInvokeNames consistency