}
    }

    /**
     * Sets the main searcher at index 0 of the searchers list.
     * This method is used to configure the primary searcher for rank fusion processing.
     * If searchers list is empty, adds the searcher; otherwise, replaces the first searcher.
     *
     * @param searcher the RankFusionSearcher to set as the main searcher
     */
    public void setSearcher(final RankFusionSearcher searcher) {

    /**
     * Test registering same searcher multiple times.
     */
    @Test
    public void test_registerSameSearcherMultipleTimes() throws Exception {
        try (RankFusionProcessor processor = new RankFusionProcessor()) {
            processor.setSearcher(new TestSearcher(100));
            final TestSearcher searcher = new TestSearcher(50);
            processor.register(searcher);

     * This constructor initializes the searcher with default values.
     * The searcher name will be lazily initialized when first accessed.
     */
    public RankFusionSearcher() {
        // Default constructor - name will be initialized lazily
    }

    /**
     * Returns the name of this searcher.
     * The name is derived from the class name by converting it to lowercase

        final TestSearcher searcher = new TestSearcher();
        assertEquals("test", searcher.getName());
    }

    /**
     * Test getName() removes "Searcher" suffix.
     */
    @Test
    public void test_getNameRemovesSearcherSuffix() {
        final CustomSearcher searcher = new CustomSearcher();
        assertEquals("custom", searcher.getName());
    }

    /**

            // Should handle exception gracefully and return results from working searcher
            final List<Map<String, Object>> results = processor.search("*", new TestSearchRequestParams(0, 10, 0), OptionalThing.empty());
            assertNotNull(results);
        }
    }

    /**
     * Test handling of searcher that throws FessSystemException.
     */
    @Test

        }

        final String[] searchers = DocumentUtil.getValue(docMap, Constants.SEARCHER, String[].class);
        if (searchers != null) {
            docMap.put(Constants.SEARCHER, ArrayUtil.add(searchers, getName()));
        } else {
            docMap.put(Constants.SEARCHER, new String[] { getName() });
        }

        return docMap;
    }

                        }
                    });
                }

                startLatch.countDown();
                assertTrue("Concurrent searches timed out", endLatch.await(10, TimeUnit.SECONDS));

                // Verify all searches completed and returned results
                assertEquals(numSearchThreads, allResults.size());
                for (List<Map<String, Object>> results : allResults) {

    public static final Boolean F = false;

    /** Constant for score field identifier. */
    public static final String SCORE = "score";

    /** Constant for searcher identifier. */
    public static final String SEARCHER = "searcher";

    /** Constant representing "on" state. */
    public static final String ON = "on";

    // ============================================================
    // Status Constants

   *
   * <p>This method runs in log(n) time on random-access lists, which offer near-constant-time
   * access to each list element.
   *
   * @param list the list to be searched.
   * @param key the value to be searched for.
   * @param comparator the comparator by which the list is ordered.
   * @param presentBehavior the specification for what to do if at least one element of the list

   *
   * <p>This method runs in log(n) time on random-access lists, which offer near-constant-time
   * access to each list element.
   *
   * @param list the list to be searched.
   * @param key the value to be searched for.
   * @param comparator the comparator by which the list is ordered.
   * @param presentBehavior the specification for what to do if at least one element of the list