- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 117 for bicycle (0.42 sec)
-
internal/grid/types.go
) // Recycler will override the internal reuse in typed handlers. // When this is supported, the handler will not do internal pooling of objects, // call Recycle() when the object is no longer needed. // The recycler should handle nil pointers. type Recycler interface { Recycle() } // MSS is a map[string]string that can be serialized. // It is not very efficient, but it is only used for easy parameter passing.
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Mon Apr 01 23:42:09 GMT 2024 - 15.4K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
from.children.add(to); to.parents.add(from); List<String> cycle = findCycle(to); if (cycle != null) { // remove edge which introduced cycle removeEdge(from, to); throw new CycleDetectedException( "Edge between '" + from.label + "' and '" + to.label + "' introduces to cycle in the graph", cycle); } } void removeEdge(Vertex from, Vertex to) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 4.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) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/Graph.java
List<String> cycle = visitCycle(graph, Collections.singleton(to), new HashMap<>(), new LinkedList<>()); if (cycle != null) { // remove edge which introduced cycle throw new CycleDetectedException( "Edge between '" + from + "' and '" + to + "' introduces to cycle in the graph", cycle); } } }
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Apr 12 10:50:18 GMT 2024 - 3.3K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/CycleDetectedException.java
private final List<String> cycle; public CycleDetectedException(String message, List<String> cycle) { super(message); this.cycle = cycle; } public List<String> getCycle() { return cycle; } @Override public String getMessage() { return super.getMessage() + " " + String.join(" --> ", cycle); }
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 1.3K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/Graph.java
from.children.add(to); to.parents.add(from); List<String> cycle = findCycle(to); if (cycle != null) { // remove edge which introduced cycle removeEdge(from, to); throw new CycleDetectedException( "Edge between '" + from.label + "' and '" + to.label + "' introduces to cycle in the graph", cycle); } } void removeEdge(Vertex from, Vertex to) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 3.9K bytes - Viewed (0) -
internal/config/scanner/scanner.go
} cfg.MaxWait, err = time.ParseDuration(maxWait) if err != nil { return err } cycle := env.Get(EnvCycle, kvs.GetWithDefault(Cycle, DefaultKVS)) if cycle == "" { cycle = "1m" } cfg.Cycle, err = time.ParseDuration(cycle) if err != nil { return err } return nil
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Apr 11 01:10:30 GMT 2024 - 5.5K bytes - Viewed (0) -
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-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) -
maven-core/src/test/java/org/apache/maven/project/GraphTest.java
List<String> cycle = cde.getCycle(); assertNotNull(cycle, "Cycle should be not null"); assertTrue(cycle.contains("a"), "Cycle contains 'a'"); assertTrue(cycle.contains("b"), "Cycle contains 'b'"); assertTrue(cycle.contains("c"), "Cycle contains 'c'"); Graph graph3 = new Graph(); addEdge(graph3, "a", "b");
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 8.3K bytes - Viewed (0)