- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 171 for we (0.09 sec)
-
android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
Integer javaVersion = Ints.tryParse(JAVA_SPECIFICATION_VERSION.value()); // Parsing to an integer might fail because Java 8 returns "1.8" instead of "8." // We can continue if it's 1.8, and we can continue if it's an integer in [9, 20). if (javaVersion != null && javaVersion >= 20) { // TODO(b/261217224): Make this test work under newer JDKs. return; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 11 16:13:05 UTC 2024 - 46.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* addressed by the new {@link java.util.stream.Stream} library. Read the method documentation below * for comparisons. These methods are not being deprecated, but we gently encourage you to migrate * to streams. * * @author Chris Povirk * @author Mike Bostock * @author Jared Levy * @since 2.0 */ @GwtCompatible @ElementTypesAreNonnullByDefault
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 22.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AtomicLongMap.java
return map.toString(); } /* * ConcurrentMap operations which we may eventually add. * * The problem with these is that remove(K, long) has to be done in two phases by definition --- * first decrementing to zero, and then removing. putIfAbsent or replace could observe the * intermediate zero-state. Ways we could deal with this are: *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 14.1K 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, Map<Object, NodeVisitState> visitedNodes,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K 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,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableEnumSet.java
} /* * Notes on EnumSet and <E extends Enum<E>>: * * This class isn't an arbitrary ForwardingImmutableSet because we need to * know that calling {@code clone()} during deserialization will return an * object that no one else has a reference to, allowing us to guarantee * immutability. Hence, we support only {@link EnumSet}. */ private final transient EnumSet<E> delegate;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 4.2K bytes - Viewed (0) -
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, Map<Object, NodeVisitState> visitedNodes,
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
guava/src/com/google/common/primitives/UnsignedBytes.java
* @since 13.0 */ @CanIgnoreReturnValue public static byte parseUnsignedByte(String string, int radix) { int parse = Integer.parseInt(checkNotNull(string), radix); // We need to throw a NumberFormatException, so we have to duplicate checkedCast. =( if (parse >> Byte.SIZE == 0) { return (byte) parse; } else { throw new NumberFormatException("out of range: " + parse); } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 18.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
@CheckForNull private AvlNode<E> right; /* * pred and succ are nullable after construction, but we always call successor() to initialize * them immediately thereafter. * * They may be subsequently nulled out by TreeMultiset.clear(). I think that the only place that * we can reference a node whose fields have been cleared is inside the iterator (and presumably * only under concurrent modification).
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 34.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/FuturesTest.java
* hang forever. More precisely, if it's expected to return, we simply call it[*], but if it's * expected to hang (because one of the input futures that we know makes it up isn't done yet), * then we call it in a separate thread (using pseudoTimedGet). The result is that we wait as long * as necessary when the method is expected to return (at the cost of hanging forever if there is
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 29 16:29:37 UTC 2024 - 144.1K bytes - Viewed (0)