- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 18 for Eccles (0.14 sec)
-
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* </ul> * * <p>The locks created by a factory instance will detect lock acquisition cycles with locks created * by other {@code CycleDetectingLockFactory} instances (except those with {@code Policy.DISABLED}). * A lock's behavior when a cycle is detected, however, is defined by the {@code Policy} of the * factory that created it. This allows detection of cycles across components while delegating * control over lock behavior to individual components. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
* * <pre>{@code * |--------------| * v | * a -> b -> c -> d * | ^ * |---------| * }</pre> */ private static final SuccessorsFunction<Character> TWO_CYCLES_GRAPH = createDirectedGraph("ab", "ac", "bc", "cd", "da"); /** * A tree-shaped graph that looks as follows (all edges are directed facing downwards): * * <pre>{@code * h
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/FuturesGetCheckedBenchmark.java
/** * The number of other exception types in the cache of known-good exceptions and the number of * other {@code ClassValue} entries for the exception type to be tested. This lets us evaluate * whether our solution scales to use with multiple exception types and to whether it is affected * by other {@code ClassValue} users. Some of the benchmarked implementations don't use one or * both of these mechanisms, so they will be unaffected. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Mar 22 03:01:34 GMT 2022 - 6.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/HashBiMap.java
// "HashBiMap.hashTableKToV" and "BiEntry.nextInKToVBucket" references. // Under that assumption, the remaining references can be safely marked as @Weak. // Using @Weak is necessary to avoid retain-cycles between BiEntry instances on iOS, // which would cause memory leaks when non-empty HashBiMap with cyclic BiEntry // instances is deallocated. @CheckForNull BiEntry<K, V> nextInKToVBucket;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
* * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code * remove()} is called, subsequent cycles omit the removed element, which is no longer in {@code * iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable} * is empty. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* number of nodes that have been seen but not yet visited, that is, the "horizon"). * </ul> * * @param graph {@link SuccessorsFunction} representing a general graph that may have cycles. */ public static <N> Traverser<N> forGraph(SuccessorsFunction<N> graph) { return new Traverser<N>(graph) { @Override Traversal<N> newTraversal() { return Traversal.inGraph(graph);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/FuturesGetCheckedBenchmark.java
/** * The number of other exception types in the cache of known-good exceptions and the number of * other {@code ClassValue} entries for the exception type to be tested. This lets us evaluate * whether our solution scales to use with multiple exception types and to whether it is affected * by other {@code ClassValue} users. Some of the benchmarked implementations don't use one or * both of these mechanisms, so they will be unaffected. */
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Mar 22 03:01:34 GMT 2022 - 6.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
private void appendUserObject(StringBuilder builder, @CheckForNull Object o) { // This is some basic recursion detection for when people create cycles via set/setFuture or // when deep chains of futures exist resulting in a StackOverflowException. We could detect // arbitrary cycles using a thread local but this should be a good enough solution (it is also // what jdk collections do in these cases) try {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
* * <pre>{@code * |--------------| * v | * a -> b -> c -> d * | ^ * |---------| * }</pre> */ private static final SuccessorsFunction<Character> TWO_CYCLES_GRAPH = createDirectedGraph("ab", "ac", "bc", "cd", "da"); /** * A tree-shaped graph that looks as follows (all edges are directed facing downwards): * * <pre>{@code * h
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterators.java
count++; } return count; } /** * Returns an iterator that cycles indefinitely over the elements of {@code iterable}. * * <p>The returned iterator supports {@code remove()} if the provided iterator does. After {@code * remove()} is called, subsequent cycles omit the removed element, which is no longer in {@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 50.5K bytes - Viewed (0)