- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 16 for Mock (0.17 sec)
-
guava-tests/test/com/google/common/collect/ImmutableSortedMultisetTest.java
import static com.google.common.truth.Truth.assertThat; import static java.util.Arrays.asList; import static org.junit.Assert.assertThrows; import static org.mockito.Mockito.mock; import static org.mockito.Mockito.when; import com.google.common.collect.Multiset.Entry; import com.google.common.collect.testing.ListTestSuiteBuilder; import com.google.common.collect.testing.MinimalCollection;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 20:09:59 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
@Override public String toString() { return "Ordering.arbitrary()"; } /* * We need to be able to mock identityHashCode() calls for tests, because it * can take 1-10 seconds to find colliding objects. Mocking frameworks that * can do magic to mock static method calls still can't do so for a system * class, so we need the indirection. In production, Hotspot should still
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
* cancelled without a call to {@code cancel}, such as by calling {@code * setFuture(cancelledFuture)}. * * <p>Beware of completing a future while holding a lock. Its listeners may do slow work or * acquire other locks, risking deadlocks. */ @CanIgnoreReturnValue @Override public boolean cancel(boolean mayInterruptIfRunning) { Object localValue = value;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractClosingFutureTest.java
final Waiter waiter = new Waiter(); final CountDownLatch futureCancelled = new CountDownLatch(1); final Exception exception = new Exception(); final Closeable mockCloseable = Mockito.mock(Closeable.class); @Override protected void tearDown() throws Exception { assertNoExpectedFailures(); super.tearDown(); } public void testFrom() throws Exception {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 75.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractClosingFutureTest.java
final Waiter waiter = new Waiter(); final CountDownLatch futureCancelled = new CountDownLatch(1); final Exception exception = new Exception(); final Closeable mockCloseable = Mockito.mock(Closeable.class); @Override protected void tearDown() throws Exception { assertNoExpectedFailures(); super.tearDown(); } public void testFrom() throws Exception {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 74.7K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* needed. * * A single spinlock ("busy") is used for initializing and * resizing the table, as well as populating slots with new Cells. * There is no need for a blocking lock; when the lock is not * available, threads try other slots (or the base). During these * retries, there is increased contention and reduced locality, * which is still better than alternatives. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionList.java
// NPE on null listener, so we propagate that contract up into the add method as well. checkNotNull(runnable, "Runnable was null."); checkNotNull(executor, "Executor was null."); // Lock while we check state. We must maintain the lock while adding the new pair so that // another thread can't run the list out from under us. We only add to the list if we have not // yet started execution. synchronized (this) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 6.9K bytes - Viewed (0) -
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) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
* ListenableFuture} listeners, should take care not to do so while holding a lock. Additionally, * as a further line of defense, prefer not to perform any locking inside a task that will be run * under {@code directExecutor}: Not only might the wait for a lock be long, but if the running * thread was holding a lock, the listener may deadlock or break lock isolation. * * <p>This instance is equivalent to: *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 41.8K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/Striped64.java
* needed. * * A single spinlock ("busy") is used for initializing and * resizing the table, as well as populating slots with new Cells. * There is no need for a blocking lock; when the lock is not * available, threads try other slots (or the base). During these * retries, there is increased contention and reduced locality, * which is still better than alternatives. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0)