Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 2 of 2 for tuon (0.04 seconds)

  1. src/main/java/org/codelibs/fess/llm/AbstractLlmClient.java

            }
    
            // Walk from newest turn to oldest, selecting contiguous newest turns that fit within budget
            int remaining = budgetChars;
            int firstIncludedTurn = turns.size();
            for (int t = turns.size() - 1; t >= 0; t--) {
                final int[] turn = turns.get(t);
                int turnLen = 0;
                for (int i = turn[0]; i < turn[1]; i++) {
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 21 06:04:58 GMT 2026
    - 72K bytes
    - Click Count (0)
  2. src/test/java/org/codelibs/fess/llm/AbstractLlmClientTest.java

            final List<LlmMessage> history = new ArrayList<>();
            history.add(LlmMessage.user("Q1")); // standalone turn (2)
            history.add(LlmMessage.user("Q2")); // 2
            history.add(LlmMessage.assistant("A2")); // pair turn (4)
            history.add(LlmMessage.user("Q3")); // standalone turn (2)
            final LlmChatRequest request = new LlmChatRequest();
            client.testAddHistoryWithBudget(request, history, 100);
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Mar 19 07:04:54 GMT 2026
    - 53K bytes
    - Click Count (0)
Back to Top