- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 55 for quickly (0.05 sec)
-
src/test/java/org/codelibs/fess/helper/DataIndexHelperTest.java
} try { dataIndexHelper.crawl("test-session-force-stop"); assertTrue("Should exit quickly when force stopped", true); } catch (Exception e) { assertTrue("Force stop should handle exceptions quickly", true); } } public void test_crawl_with_short_intervals() { try { // Test with minimal interval
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Jul 12 05:35:01 UTC 2025 - 12.7K bytes - Viewed (0) -
src/test/java/jcifs/netbios/NameServiceClientImplTest.java
verify(mockContext, atLeastOnce()).getConfig(); } @Test @DisplayName("Should handle invalid NetBIOS name quickly") @Timeout(value = 1, unit = TimeUnit.SECONDS) // Very short timeout void testGetNbtByNameInvalid() { // When/Then - Should fail quickly with invalid characters assertThrows(Exception.class, () -> { nameServiceClient.getNbtByName("INVALID@#$%NAME");
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 11K bytes - Viewed (0) -
src/test/java/jcifs/smb/CriticalPerformanceTest.java
System.out.printf("Overall Performance Test: completed in %.2f ms%n", totalTimeMs); // Should complete very quickly with all optimizations assertTrue(totalTimeMs < 100, "All operations should complete quickly with performance fixes"); pool.close(); }
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sun Aug 31 08:00:57 UTC 2025 - 15.3K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/helper/IntervalControlHelperTest.java
assertTrue(end - start < 50); // Should return quickly // Test with rule that has no delay helper.addIntervalRule("01:30", "15:15", "*", 0); start = System.currentTimeMillis(); helper.delayByRules(); end = System.currentTimeMillis(); assertTrue(end - start < 50); // Should return quickly
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 10 13:41:04 UTC 2025 - 13.1K bytes - Viewed (0) -
src/test/java/jcifs/EmptyIteratorTest.java
} @Test @DisplayName("EmptyIterator should be lightweight and efficient") void testPerformanceCharacteristics() { // When - create many instances quickly long startTime = System.currentTimeMillis(); for (int i = 0; i < 10000; i++) { EmptyIterator iterator = new EmptyIterator(); iterator.hasNext(); iterator.next();
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 12K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/helper/ProcessHelperTest.java
assertNotNull(jobProcess2); // Since echo command completes quickly, processes might already be finished // So we just verify that processes were created without errors Set<String> sessionIds = processHelper.getRunningSessionIdSet(); // Since echo commands complete quickly, we may not catch them running // Just verify no exceptions occurred
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Jul 12 05:35:01 UTC 2025 - 15.1K bytes - Viewed (0) -
docs/en/docs/management-tasks.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sat Nov 09 16:39:20 UTC 2024 - 14.2K bytes - Viewed (0) -
src/test/java/jcifs/internal/fscc/FileSystemInformationTest.java
long startTime = System.nanoTime(); info.decode(largeBuffer, 0, 24); long endTime = System.nanoTime(); // Should complete quickly (under 1ms) assertTrue((endTime - startTime) < 1_000_000); } @ParameterizedTest @ValueSource(ints = { 24, 32, 100, 1000, 10000 })
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 18.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeBasedTable.java
* * <p>Lookups by row key are often faster than lookups by column key, because the data is stored in * a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still runs * quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer, * since an iteration across all row keys occurs. * * <p>Because a {@code TreeBasedTable} has unique sorted values for a given row, both {@code
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 18 15:05:43 UTC 2025 - 11.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeBasedTable.java
* * <p>Lookups by row key are often faster than lookups by column key, because the data is stored in * a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still runs * quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer, * since an iteration across all row keys occurs. * * <p>Because a {@code TreeBasedTable} has unique sorted values for a given row, both {@code
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 18 15:05:43 UTC 2025 - 11.6K bytes - Viewed (0)