Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for curTop (0.02 sec)

  1. src/main/java/org/codelibs/fess/helper/SearchHelper.java

         *
         * @param params The search request parameters
         * @param cursor Function to process each document in the result set
         * @param userBean Optional user information for permission checking
         * @return Total number of documents processed
         */
        public long scrollSearch(final SearchRequestParams params, final BooleanFunction<Map<String, Object>> cursor,
                final OptionalThing<FessUserBean> userBean) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 35.8K bytes
    - Viewed (0)
  2. src/main/java/org/codelibs/fess/opensearch/client/SearchEngineClient.java

         * @param condition the search condition
         * @param cursor    the cursor function to process each hit
         * @return the number of documents processed
         * @throws InvalidQueryException if the query is invalid
         */
        public long scrollSearch(final String index, final SearchCondition<SearchRequestBuilder> condition,
                final BooleanFunction<Map<String, Object>> cursor) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sun Aug 31 08:19:00 UTC 2025
    - 121.9K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        it.remove();
        // After this remove, 400 has moved up and 20 down past cursor
        assertTrue("Heap is not intact after remove", mmHeap.isIntact());
        assertEquals((Integer) 10, it.next());
        assertEquals((Integer) 3, it.next());
        it.remove();
        // After this remove, 400 moved down again and 500 up past the cursor
        assertTrue("Heap is not intact after remove", mmHeap.isIntact());
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 36K bytes
    - Viewed (0)
Back to top