assertEquals(new BigDecimal("10"), BigDecimalConversionUtil.toBigDecimal(Short.valueOf((short) 10)));
        assertEquals(new BigDecimal("100"), BigDecimalConversionUtil.toBigDecimal(Integer.valueOf(100)));
        assertEquals(new BigDecimal("1000"), BigDecimalConversionUtil.toBigDecimal(Long.valueOf(1000L)));

    }

    @Test
    @DisplayName("Should have distinct dialect codes")
    void testDistinctDialectCodes() {
        // Collect all dialect codes (excluding SMB1 which returns -1)
        java.util.Set<Integer> dialectCodes = new java.util.HashSet<>();

        for (DialectVersion version : DialectVersion.values()) {
            if (version.isSMB2()) {
                int dialect = version.getDialect();

      return
    }

    assertThat(url, "Expected URL to parse successfully, but was null")
      .isNotNull()
    val effectivePort =
      when {
        url!!.port != defaultPort(url.scheme) -> Integer.toString(url.port)
        else -> ""
      }
    val effectiveQuery =
      when {
        url.encodedQuery != null -> "?" + url.encodedQuery
        else -> ""
      }
    val effectiveFragment =

        for (int status : errorStatuses) {
            assertTrue((status & (int) 0xC0000000L) == (int) 0xC0000000L,
                    "Error status should have severity bits set to 0xC: " + Integer.toHexString(status));
        }
    }

    @Test
    @DisplayName("Should have status codes array")
    void testStatusCodesArray() {
        // When
        int[] codes = NtStatus.NT_STATUS_CODES;

        throw new IllegalArgumentException("cannot store more than Integer.MAX_VALUE elements");
      } else if (minCapacity <= oldCapacity) {
        return oldCapacity;
      }
      // careful of overflow!
      int newCapacity = oldCapacity + (oldCapacity >> 1) + 1;
      if (newCapacity < minCapacity) {
        newCapacity = Integer.highestOneBit(minCapacity - 1) << 1;
      }
      if (newCapacity < 0) {

    if (minCapacity < 0) {
      throw new IllegalArgumentException("cannot store more than Integer.MAX_VALUE elements");
    } else if (minCapacity <= oldCapacity) {
      return oldCapacity;
    }
    // careful of overflow!
    int newCapacity = oldCapacity + (oldCapacity >> 1) + 1;
    if (newCapacity < minCapacity) {
      newCapacity = Integer.highestOneBit(minCapacity - 1) << 1;
    }
    if (newCapacity < 0) {

	},
	ErrInvalidMaxUploads: {
		Code:           "InvalidArgument",
		Description:    "Argument max-uploads must be an integer between 0 and 2147483647",
		HTTPStatusCode: http.StatusBadRequest,
	},
	ErrInvalidMaxKeys: {
		Code:           "InvalidArgument",
		Description:    "Argument maxKeys must be an integer between 0 and 2147483647",
		HTTPStatusCode: http.StatusBadRequest,
	},
	ErrInvalidEncodingMethod: {

  public boolean containsKey(Object key) {
    return map.containsKey(key);
  }

  /**
   * Returns the number of key-value mappings in this map. If the map contains more than {@code
   * Integer.MAX_VALUE} elements, returns {@code Integer.MAX_VALUE}.
   */
  public int size() {
    return map.size();
  }

  /** Returns {@code true} if this map contains no key-value mappings. */
  public boolean isEmpty() {

        ImmutableSet.of(() -> new GeneralSpliteratorOfObject<>(spliteratorSupplier.get())));
  }

  /**
   * @since 33.4.0 (but since 28.1 in the JRE flavor)
   */
  public static SpliteratorTester<Integer> ofInt(Supplier<Spliterator.OfInt> spliteratorSupplier) {
    return new SpliteratorTester<>(
        ImmutableSet.of(
            () -> new GeneralSpliteratorOfObject<>(spliteratorSupplier.get()),

    if (safeMax < safeMin) {
      // If the safe range is empty, set the range limits to opposite extremes
      // to ensure the first test of either value will fail.
      safeMax = -1;
      safeMin = Integer.MAX_VALUE;
    }
    this.safeMin = safeMin;
    this.safeMax = safeMax;

    // This is a bit of a hack but lets us do quicker per-character checks in