- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 43 for cycle (0.14 sec)
-
guava-tests/test/com/google/common/collect/IteratorsTest.java
assertTrue(cycle.hasNext()); assertEquals("b", cycle.next()); } } public void testCycleOfTwoWithRemove() { Iterable<String> iterable = Lists.newArrayList("a", "b"); Iterator<String> cycle = Iterators.cycle(iterable); assertTrue(cycle.hasNext()); assertEquals("a", cycle.next()); assertTrue(cycle.hasNext()); assertEquals("b", cycle.next()); assertTrue(cycle.hasNext());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 55.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* verified or created. * <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed * to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new * "safe" edge is created. * <li>If a cycle is detected, an "unsafe" (cyclic) edge is created to represent a potential * deadlock situation, and the appropriate Policy is executed. * </ul> *
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
createDirectedGraph("aa", "dd", "ab", "ac", "ca", "cd", "bd"); /** A directed graph with a single cycle: a -> b -> c -> d -> a. */ private static final SuccessorsFunction<Character> CYCLE_GRAPH = createDirectedGraph("ab", "bc", "cd", "da"); /** * Same as {@link #CYCLE_GRAPH}, but with an extra a->c edge. * * <pre>{@code * |--------------| * v | * a -> b -> c -> d
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/test/com/google/common/collect/IteratorsTest.java
assertTrue(cycle.hasNext()); assertEquals("b", cycle.next()); } } public void testCycleOfTwoWithRemove() { Iterable<String> iterable = Lists.newArrayList("a", "b"); Iterator<String> cycle = Iterators.cycle(iterable); assertTrue(cycle.hasNext()); assertEquals("a", cycle.next()); assertTrue(cycle.hasNext()); assertEquals("b", cycle.next()); assertTrue(cycle.hasNext());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 56.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/FluentIterableTest.java
// always point to "a". assertEquals("a", cycle.iterator().next()); } public void testCycle_emptyIterable() { FluentIterable<Integer> cycle = FluentIterable.<Integer>of().cycle(); assertFalse(cycle.iterator().hasNext()); } public void testCycle_removingAllElementsStopsCycle() { FluentIterable<Integer> cycle = fluent(1, 2).cycle(); Iterator<Integer> iterator = cycle.iterator();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 06 17:32:08 GMT 2023 - 30.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
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-tests/test/com/google/common/graph/TraverserTest.java
createDirectedGraph("aa", "dd", "ab", "ac", "ca", "cd", "bd"); /** A directed graph with a single cycle: a -> b -> c -> d -> a. */ private static final SuccessorsFunction<Character> CYCLE_GRAPH = createDirectedGraph("ab", "bc", "cd", "da"); /** * Same as {@link #CYCLE_GRAPH}, but with an extra a->c edge. * * <pre>{@code * |--------------| * v | * a -> b -> c -> d
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) -
android/guava/src/com/google/common/util/concurrent/AbstractScheduledService.java
* * Maybe there is a way to avoid this cycle. But we think the cycle is safe enough to ignore: * Each task is retained for only as long as it is running -- so it's retained only as long as * it would already be retained by the underlying executor. * * If the cycle test starts reporting this cycle in the future, we should add an entry to * cycle_suppress_list.txt. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Dec 13 19:45:20 GMT 2023 - 25.8K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/TypeResolver.java
} // First, check whether var -> arg forms a cycle for (Type t = arg; t != null; t = mappings.get(TypeVariableKey.forLookup(t))) { if (var.equalsType(t)) { // cycle detected, remove the entire cycle from the mapping so that // each type variable resolves deterministically to itself. // Otherwise, an F -> T cycle will end up resolving both F and T
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 24.2K bytes - Viewed (0) -
android/guava-testlib/pom.xml
<version>4.13.2</version> </dependency> <dependency> <!-- Do not include Truth in non-test scope! Doing so creates a problematic dependency cycle. --> <groupId>com.google.truth</groupId> <artifactId>truth</artifactId> <version>${truth.version}</version> <scope>test</scope> <exclusions> <exclusion>
XML - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jul 31 18:55:22 GMT 2023 - 3.1K bytes - Viewed (0)