Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for numThreads (0.83 sec)

  1. fess-crawler-opensearch/src/test/java/org/codelibs/fess/crawler/service/impl/OpenSearchUrlQueueServiceTest.java

            final String sessionId = "poll_session4";
            final int numThreads = 5;
            final int itemsPerThread = 10;
            final List<OpenSearchUrlQueue> urlQueueList = new ArrayList<>();
    
            // Insert items
            for (int i = 1; i <= itemsPerThread * numThreads; i++) {
                final OpenSearchUrlQueue urlQueue = new OpenSearchUrlQueue();
    Registered: Sat Dec 20 11:21:39 UTC 2025
    - Last Modified: Thu Nov 20 08:40:57 UTC 2025
    - 14.3K bytes
    - Viewed (0)
  2. fess-crawler-opensearch/src/test/java/org/codelibs/fess/crawler/client/FesenClientTest.java

            final int numThreads = 10;
            final ExecutorService executor = Executors.newFixedThreadPool(numThreads);
            final CountDownLatch latch = new CountDownLatch(numThreads);
            final AtomicInteger callbackCount = new AtomicInteger(0);
    
            // Add listeners concurrently from multiple threads
            for (int i = 0; i < numThreads; i++) {
                executor.submit(() -> {
    Registered: Sat Dec 20 11:21:39 UTC 2025
    - Last Modified: Thu Nov 20 08:44:44 UTC 2025
    - 17K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/fess/rank/fusion/RankFusionProcessor.java

                    int numThreads = ComponentUtil.getFessConfig().getRankFusionThreadsAsInteger();
                    if (numThreads <= 0) {
                        numThreads = Runtime.getRuntime().availableProcessors() * 3 / 2 + 1;
                    }
                    if (logger.isDebugEnabled()) {
                        logger.debug("Initializing executor service with {} threads", numThreads);
                    }
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Fri Nov 28 16:29:12 UTC 2025
    - 27.5K bytes
    - Viewed (0)
Back to top