* and the arithmetic mean is always higher than the geometric mean.
     *
     * b) this iteration converges to floor(sqrt(x)). In fact, the number of correct digits doubles
     * with each iteration, so this algorithm takes O(log(digits)) iterations.
     *
     * We start out with a double-precision approximation, which may be higher or lower than the

   */
  ALLOWS_NULL_QUERIES,
  ALLOWS_NULL_VALUES(ALLOWS_NULL_QUERIES),

  /**
   * Indicates that a collection disallows certain elements (other than {@code null}, whose validity
   * as an element is indicated by the presence or absence of {@link #ALLOWS_NULL_VALUES}). From the
   * documentation for {@link Collection}:
   *
   * <blockquote>
   *

 * @since 11.0
 */
@GwtCompatible
public final class IntMath {
  @VisibleForTesting static final int MAX_SIGNED_POWER_OF_TWO = 1 << (Integer.SIZE - 2);

  /**
   * Returns the smallest power of two greater than or equal to {@code x}. This is equivalent to
   * {@code checkedPow(2, log2(x, CEILING))}.
   *
   * @throws IllegalArgumentException if {@code x <= 0}

                        IllegalArgumentException.class),

                // Name length larger than remaining bytes - use method reference
                Arguments.of("name length exceeds remaining", (java.util.function.Supplier<byte[]>) () -> {
                    byte[] buf = buildBuffer(der, nameBytes);
                    // Corrupt NAME_LEN to be larger than actual by +5
                    int i = 2 + 2 + der.length; // index where NAME_LEN starts

  }

  /**
   * This method returns a {@code ImmutableSortedMap}, consisting of the entries whose keys are less
   * than {@code toKey}.
   *
   * <p>The {@link SortedMap#headMap} documentation states that a submap of a submap throws an
   * {@link IllegalArgumentException} if passed a {@code toKey} greater than an earlier {@code
   * toKey}. However, this method doesn't throw an exception in that situation, but instead keeps

  private int bufferSize;

  /**
   * The largest of the lowest k elements we've seen so far relative to this comparator. If
   * bufferSize ≥ k, then we can ignore any elements greater than this value.
   */
  private @Nullable T threshold;

  @SuppressWarnings("unchecked") // TODO(cpovirk): Consider storing Object[] instead of T[].
  private TopKSelector(Comparator<? super T> comparator, int k) {

## Version 4.6.0

_2020-04-28_

 *  Fix: Follow HTTP 307 and 308 redirects on methods other than GET and POST. We're reluctant to
    change OkHttp's behavior in handling common HTTP status codes, but this fix is overdue! The new
    behavior is now consistent with [RFC 7231][rfc_7231_647], which is newer than OkHttp itself.
    If you want this update with the old behavior use [this interceptor][legacy_interceptor].

    void testConstructorWithLongKey() {
        // Test constructor with a key longer than BLOCK_LENGTH (64 bytes)
        // HMACT64 truncates keys at 64 bytes
        HMACT64 hmac = new HMACT64(LONG_TEST_KEY);
        assertNotNull(hmac);
    }

    @Test
    void testConstructorWithShortKey() {
        // Test constructor with a key shorter than BLOCK_LENGTH (64 bytes)
        HMACT64 hmac = new HMACT64(SHORT_TEST_KEY);

You could also create a `JSONResponse` directly and return it.

/// tip

You will normally have much better performance using a [Response Model](../tutorial/response-model.md) than returning a `JSONResponse` directly, as that way it serializes the data using Pydantic, in Rust.

///

## Return a `Response` { #return-a-response }

You can return a `Response` or any sub-class of it.

/// info

    smallElementAggregateFunction: (List<T>) -> R,
    expectedBucketNumber: Int,
    maxNumberInBucket: Int,
    noElementSplitFunction: (Int) -> List<R> = { throw IllegalArgumentException("More buckets than things to split") },
    canRunTogether: (T, T) -> Boolean = { _, _ -> true },
): List<R> {
    if (list.isEmpty()) {
        return noElementSplitFunction(expectedBucketNumber)
    }
    if (expectedBucketNumber == 1) {