}

    /**
     * The number of permutations with repeated elements is calculated as follows:
     *
     * <ul>
     *   <li>For an empty list, it is 1 (base case).
     *   <li>When r numbers are added to a list of n-r elements, the number of permutations is
     *       increased by a factor of (n choose r).
     * </ul>
     */
    private static <E> int calculateSize(

        final LlmChatRequest request = client.testBuildIntentRequest("What is Fess?", Collections.emptyList());
        final List<LlmMessage> messages = request.getMessages();
        // system + user = 2 messages (no history added)
        assertEquals(2, messages.size());
    }

    @Test
    public void test_buildIntentRequest_trimsHistoryToMaxSix() {
        final List<LlmMessage> history = new ArrayList<>();

   * {@code initialCapacity} values without resizing. The returned builder is not thread-safe.
   *
   * <p><b>Performance note:</b> When feasible, {@code initialCapacity} should be the exact number
   * of values that will be added, if that knowledge is readily available. It is better to guess a
   * value slightly too high than slightly too low. If the value is not exact, the {@link

        assertEquals(testOrigin, processOrigin);
        assertEquals(request, processRequest);
        assertEquals(response, processResponse);

        // Verify headers were added
        List<String> originHeaders = responseHeaders.get("Access-Control-Allow-Origin");
        assertNotNull(originHeaders);
        assertTrue(originHeaders.contains(testOrigin));
    }

// This file is for validation errors only, i.e., errors reported by the validate function.
// Negative test cases for errors generated earlier in the assembler's preprocess stage
// should be added to riscv64error.s.  If they are added to this file, they will prevent
// the validate function from being run and TestRISCVValidation will report missing
// errors.

TEXT validation(SB),$0

   * Builder} constructor.
   */
  public static <K, V> Builder<K, V> builder() {
    return new Builder<>();
  }

  /**
   * Returns a new builder with a hint for how many distinct keys are expected to be added. The
   * generated builder is equivalent to that returned by {@link #builder}, but may perform better if
   * {@code expectedKeys} is a good estimate.
   *

This button will cause a Javascript alert dialog to appear asking you to type a reason for accepting the changes, e.g. "Added new API for Gradle 8.x".

Clicking okay on the dialog will cause a copy of the `accepted-public-api-changes.json` containing your (properly sorted) addition to be downloaded.

        };
  }

  /**
   * Creates an {@code MonitorBasedArrayBlockingQueue} with the given (fixed) capacity, the
   * specified access policy and initially containing the elements of the given collection, added in
   * traversal order of the collection's iterator.
   *
   * @param capacity the capacity of this queue
   * @param fair if {@code true} then queue accesses for threads blocked on insertion or removal,

    @CanIgnoreReturnValue
    Builder<C> combine(Builder<C> builder) {
      addAll(builder.ranges);
      return this;
    }

    /**
     * Returns an {@code ImmutableRangeSet} containing the ranges added to this builder.
     *
     * @throws IllegalArgumentException if any input ranges have nonempty overlap
     */
    public ImmutableRangeSet<C> build() {
      ImmutableList.Builder<Range<C>> mergedRangesBuilder =

        for (SmbTransportImpl transport : connections) {
            try {
                // Check if connection has been idle too long
                // Note: getLastUseTime() method would need to be added to SmbTransportImpl
                // For now, we'll use a simple disconnected check
                if (transport.isDisconnected()) {
                    idle.add(transport);