}
        }
        return documentItems;
    }

    /**
     * Performs a scroll search for processing large result sets efficiently.
     *
     * This method uses OpenSearch scroll API to iterate through large numbers of
     * documents without loading them all into memory at once.
     *
     * @param params The search request parameters

        // Note: This is a rough check - exact performance depends on JVM, hardware, etc.
        // We expect Set lookup to be at least as fast as array lookup for large datasets
        assertTrue("Set-based lookup should be faster or comparable to array-based lookup for large datasets",
                setDuration <= arrayDuration * 2); // Allow 2x margin for test stability
    }

    /**
     * Helper method to create a test FessConfig.

            assertNotNull(results);
            assertEquals(0, results.size());
        }
    }

    /**
     * Test search with very large page size.
     */
    @Test
    public void test_searchWithLargePageSize() throws Exception {
        try (RankFusionProcessor processor = new RankFusionProcessor()) {

Card:"Vous avez saisi un numéro de carte de crédit invalide",badCVV:"Vous avez saisi un CVV incorrect",wrongFileDim:"Mauvaise taille de l'image, ",imageTooTall:"l'image ne peut pas être plus élevée que",imageTooWide:"l'image ne peut pas être plus large que",imageTooSmall:"l'image est trop petite",min:"moins",max:"max",imageRatioNotAccepted:"Ratio de l'image non accepté"}})}(a,window)});...

        assertEquals("value", targetMap.get("new.param"));
        assertEquals("true", targetMap.get("config.setting"));
    }

    @Test
    public void test_performanceAndBoundary() {
        // Test with large input
        StringBuilder largeInput = new StringBuilder();
        for (int i = 0; i < 1000; i++) {
            largeInput.append("key").append(i).append("=value").append(i).append("\n");
        }

        assertFalse(queryCommand.isSearchField("anyfield"));
    }

    /**
     * Test isSearchField() performance with large field set.
     */
    @Test
    public void test_isSearchField_performance() {
        // Create a large set of search fields
        int fieldCount = 1000;
        String[] fields = new String[fieldCount];
        for (int i = 0; i < fieldCount; i++) {

 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.llm;

import java.util.List;
import java.util.Map;

/**
 * Interface for LLM (Large Language Model) clients.
 * Implementations provide integration with different LLM providers
 * such as Ollama, OpenAI, and Google Gemini.
 *
 * In addition to low-level chat operations, this interface defines

                if (params != null && params.size() > 100) {
                    return createMockRescorerBuilder();
                }
                return null;
            }
        };

        // Test with large number of parameters
        Map<String, Object> largeParams = new HashMap<>();
        for (int i = 0; i < 150; i++) {
            largeParams.put("key" + i, "value" + i);
        }

        // This shows that the class returns the same array reference
        assertSame(retrievedValues, param.getValues());
    }

    @Test
    public void test_largeValueArray() {
        // Test with large array of values
        String name = "largeParam";
        String[] values = new String[1000];
        for (int i = 0; i < values.length; i++) {
            values[i] = "value" + i;
        }

 * This job removes old crawling sessions, search logs, job logs, and user info logs
 * based on configured retention periods. It helps maintain system performance by
 * preventing log tables from growing too large.
 */
public class PurgeLogJob {

    /** Logger instance for this class */
    private static final Logger logger = LogManager.getLogger(PurgeLogJob.class);

    /**
     * Default constructor for PurgeLogJob.