- Sort Score
- Result 10 results
- Languages All
Results 21 - 27 of 27 for French (0.13 sec)
-
android/guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java
// should never reach here! throw new UnsupportedOperationException(); } @Override public Entry<K, V> belowSamplesGreater() { // should never reach here! throw new UnsupportedOperationException(); } @Override public Entry<K, V> aboveSamplesLesser() { // should never reach here! throw new UnsupportedOperationException();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ServiceManager.java
} /** * Waits for the all the services to reach a terminal state. After this method returns all * services will either be {@linkplain Service.State#TERMINATED terminated} or {@linkplain * Service.State#FAILED failed}. */ public void awaitStopped() { state.awaitStopped(); } /** * Waits for the all the services to reach a terminal state for no more than the given time. After
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Dec 13 19:45:20 GMT 2023 - 30.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Striped64.java
* than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions * only become known via CAS failures, convergence can be slow,
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.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/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/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)