Search Options

Results per page
Sort
Preferred Languages
Advance

Results 241 - 250 of 1,050 for Spread (0.03 sec)

  1. src/test/java/jcifs/tests/persistent/HandleInfoTest.java

                    null);
    
            assertFalse(durableInfo.isExpired());
    
            // Wait for expiration
            try {
                Thread.sleep(150);
            } catch (InterruptedException e) {
                Thread.currentThread().interrupt();
            }
    
            assertTrue(durableInfo.isExpired());
    
            // Test persistent handle (never expires)
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 21 04:51:33 UTC 2025
    - 4.6K bytes
    - Viewed (0)
  2. src/test/java/jcifs/util/SimpleCircuitBreakerTest.java

        @RepeatedTest(10)
        @DisplayName("Test thread safety")
        void testThreadSafety() throws InterruptedException {
            SimpleCircuitBreaker breaker = new SimpleCircuitBreaker("concurrent", 5, 3, 100);
            AtomicInteger successCount = new AtomicInteger(0);
            AtomicInteger failureCount = new AtomicInteger(0);
    
            // Create multiple threads
            Thread[] threads = new Thread[10];
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 10.6K bytes
    - Viewed (0)
  3. src/test/java/jcifs/internal/witness/MockWitnessService.java

        private final AtomicInteger registrationCounter = new AtomicInteger(0);
        private final ConcurrentHashMap<String, MockRegistration> registrations = new ConcurrentHashMap<>();
        private Thread serverThread;
    
        /**
         * Mock registration data
         */
        private static class MockRegistration {
            final String registrationId;
            final String shareName;
            final String serverAddress;
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 23 09:06:40 UTC 2025
    - 8.2K bytes
    - Viewed (0)
  4. okhttp/src/jvmTest/kotlin/okhttp3/internal/concurrent/TaskRunnerTest.kt

        // Enqueueing the red task starts a thread because the head of the queue changed.
        redQueue.execute("red task") {
          log += "red:starting@${taskFaker.nanoTime}"
          taskFaker.sleep(100.µs)
          log += "red:finishing@${taskFaker.nanoTime}"
        }
        assertThat(taskFaker.executeCallCount).isEqualTo(1)
    
        // Enqueueing the blue task doesn't start a thread because the red one is still starting.
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Wed Mar 19 19:25:20 UTC 2025
    - 23K bytes
    - Viewed (0)
  5. guava/src/com/google/common/collect/Maps.java

        return Synchronized.biMap(bimap, null);
      }
    
      /**
       * Returns an unmodifiable view of the specified bimap. This method allows modules to provide
       * users with "read-only" access to internal bimaps. Query operations on the returned bimap "read
       * through" to the specified bimap, and attempts to modify the returned map, whether direct or via
       * its collection views, result in an {@code UnsupportedOperationException}.
       *
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Nov 17 22:50:48 UTC 2025
    - 163.5K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/collect/Maps.java

        return Synchronized.biMap(bimap, null);
      }
    
      /**
       * Returns an unmodifiable view of the specified bimap. This method allows modules to provide
       * users with "read-only" access to internal bimaps. Query operations on the returned bimap "read
       * through" to the specified bimap, and attempts to modify the returned map, whether direct or via
       * its collection views, result in an {@code UnsupportedOperationException}.
       *
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 23 17:50:58 UTC 2025
    - 157.6K bytes
    - Viewed (0)
  7. guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

     * example involving two locks and two threads, deadlock occurs when one thread acquires Lock A, and
     * then Lock B, while another thread acquires Lock B, and then Lock A:
     *
     * <pre>
     * Thread1: acquire(LockA) --X acquire(LockB)
     * Thread2: acquire(LockB) --X acquire(LockA)
     * </pre>
     *
     * <p>Neither thread will progress because each is waiting for the other. In more complex
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Sep 11 17:06:34 UTC 2025
    - 35.9K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/helper/WebFsIndexHelper.java

        protected long crawlingExecutionInterval = Constants.DEFAULT_CRAWLING_EXECUTION_INTERVAL;
    
        /**
         * Thread priority for index updater operations.
         */
        protected int indexUpdaterPriority = Thread.MAX_PRIORITY;
    
        /**
         * Thread priority for crawler operations.
         */
        protected int crawlerPriority = Thread.NORM_PRIORITY;
    
        /**
         * Synchronized list of active crawlers.
         */
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Fri Nov 28 16:29:12 UTC 2025
    - 25K bytes
    - Viewed (0)
  9. src/test/java/jcifs/SmbWatchHandleTest.java

                        watchCount++;
                        try {
                            // Simulate some processing time
                            Thread.sleep(10);
                        } catch (InterruptedException e) {
                            Thread.currentThread().interrupt();
                        }
                        return Arrays.asList(createMockNotification("file" + watchCount + ".txt"));
                    }
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 13.2K bytes
    - Viewed (1)
  10. src/test/java/jcifs/EmptyIteratorTest.java

                    threads[i].start();
                }
    
                // Wait for all threads to complete
                for (Thread thread : threads) {
                    thread.join();
                }
            }
    
            // Then
            for (int i = 0; i < threadCount; i++) {
                assertTrue(results[i], "Thread " + i + " should have completed successfully");
            }
        }
    
        @Test
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 12K bytes
    - Viewed (0)
Back to top