Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for mock (0.15 sec)

  1. android/guava-tests/test/com/google/common/util/concurrent/FuturesTest.java

        derived.cancel(false);
        assertTrue(primary.isCancelled());
        assertFalse(primary.wasInterrupted());
      }
    
      @J2ktIncompatible
      @GwtIncompatible // mocks
      // TODO(cpovirk): eliminate use of mocks
      public void testCatchingAsync_resultCancelledAfterFallback() throws Exception {
        final SettableFuture<Integer> secondary = SettableFuture.create();
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Tue Feb 20 17:00:05 GMT 2024
    - 144.5K bytes
    - Viewed (0)
  2. guava/src/com/google/common/cache/LocalCache.java

       * of reads may not be immediately reflected on the algorithm's data structures. These structures
       * are guarded by a lock and operations are applied in batches to avoid lock contention. The
       * penalty of applying the batches is spread across threads so that the amortized cost is slightly
       * higher than performing just the operation without enforcing the capacity constraint.
    Java
    - Registered: Fri Apr 05 12:43:09 GMT 2024
    - Last Modified: Thu Feb 22 17:40:56 GMT 2024
    - 150.3K bytes
    - Viewed (0)
  3. guava-tests/test/com/google/common/util/concurrent/FuturesTest.java

        derived.cancel(false);
        assertTrue(primary.isCancelled());
        assertFalse(primary.wasInterrupted());
      }
    
      @J2ktIncompatible
      @GwtIncompatible // mocks
      // TODO(cpovirk): eliminate use of mocks
      public void testCatchingAsync_resultCancelledAfterFallback() throws Exception {
        final SettableFuture<Integer> secondary = SettableFuture.create();
    Java
    - Registered: Fri Apr 12 12:43:09 GMT 2024
    - Last Modified: Tue Feb 20 17:00:05 GMT 2024
    - 144.5K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/cache/LocalCache.java

       * of reads may not be immediately reflected on the algorithm's data structures. These structures
       * are guarded by a lock and operations are applied in batches to avoid lock contention. The
       * penalty of applying the batches is spread across threads so that the amortized cost is slightly
       * higher than performing just the operation without enforcing the capacity constraint.
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Feb 22 17:40:56 GMT 2024
    - 144.7K bytes
    - Viewed (0)
Back to top