- Sort Score
- Result 10 results
- Languages All
Results 41 - 48 of 48 for French (0.17 sec)
-
guava-tests/test/com/google/common/util/concurrent/MoreExecutorsTest.java
if (waiter.isAlive()) { waiter.interrupt(); fail("awaitTermination failed to trigger after shutdown()"); } } /** Wait for the given thread to reach the {@link State#TIMED_WAITING} thread state. */ void awaitTimedWaiting(Thread thread) { while (true) { switch (thread.getState()) { case BLOCKED: case NEW: case RUNNABLE:
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 28.2K bytes - Viewed (3) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractScheduledServiceTest.java
assertThrows( TimeoutException.class, () -> service.startAsync().awaitRunning(1, MILLISECONDS)); assertThat(e) .hasMessageThat() .isEqualTo("Timed out waiting for Foo [STARTING] to reach the RUNNING state."); } private class TestService extends AbstractScheduledService { CyclicBarrier runFirstBarrier = new CyclicBarrier(2); CyclicBarrier runSecondBarrier = new CyclicBarrier(2);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ImmutableMapTest.java
.put(key1, 1) .put(key2, 2) .put(key1, 3) .put(key2, 4) .buildKeepingLast(); assertMapEquals(map, key1, 3, key2, 4); } // The java7 branch has different code depending on whether the entry indexes fit in a byte, // short, or int. The small table in testBuildKeepingLast_allowsOverwrite will test the byte // case. This method tests the short case.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 14:39:16 GMT 2024 - 37.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/primitives/UnsignedBytesBenchmark.java
if (unsafeImpl.compare(ba3, ba4) == 0) { throw new Error(); // deoptimization } } } /* try { UnsignedBytesBenchmark bench = new UnsignedBytesBenchmark(); bench.length = 1024; bench.setUp(); bench.timeUnsafe(100000); } catch (Exception e) { }*/
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.8K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Predicates.java
@Override public boolean apply(CharSequence t) { return pattern.matcher(t).find(); } @Override public int hashCode() { // Pattern uses Object.hashCode, so we have to reach // inside to build a hashCode consistent with equals. return Objects.hashCode(pattern.pattern(), pattern.flags()); } @Override public boolean equals(@CheckForNull Object obj) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
public static boolean fuzzyEquals(double a, double b, double tolerance) { MathPreconditions.checkNonNegative("tolerance", tolerance); return Math.copySign(a - b, 1.0) <= tolerance // copySign(x, 1.0) is a branch-free version of abs(x), but with different NaN semantics || (a == b) // needed to ensure that infinities equal themselves || (Double.isNaN(a) && Double.isNaN(b)); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/MoreExecutorsTest.java
if (waiter.isAlive()) { waiter.interrupt(); fail("awaitTermination failed to trigger after shutdown()"); } } /** Wait for the given thread to reach the {@link State#TIMED_WAITING} thread state. */ void awaitTimedWaiting(Thread thread) { while (true) { switch (thread.getState()) { case BLOCKED: case NEW: case RUNNABLE:
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 28.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
return true; } return hasCycle(network.asGraph()); } /** * Performs a traversal of the nodes reachable from {@code node}. If we ever reach a node we've * already visited (following only outgoing edges and without reusing edges), we know there's a * cycle in the graph. */ private static <N> boolean subgraphHasCycle( Graph<N> graph,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0)