- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 386 for circle (0.13 sec)
-
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());
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 03 13:01:51 UTC 2024 - 55.7K bytes - Viewed (0) -
src/go/types/decl.go
} else { check.trace(obj.Pos(), "=> error: cycle is invalid") } }() } if !tparCycle { // A cycle involving only constants and variables is invalid but we // ignore them here because they are reported via the initialization // cycle check. if nval == len(cycle) { return true } // A cycle involving only types (and possibly functions) must have at least
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 31K bytes - Viewed (0) -
src/runtime/mgcpacer.go
// heapScanWork is the total heap scan work performed this cycle. // stackScanWork is the total stack scan work performed this cycle. // globalsScanWork is the total globals scan work performed this cycle. // // These are updated atomically during the cycle. Updates occur in // bounded batches, since they are both written and read // throughout the cycle. At the end of the cycle, heapScanWork is how // much of the retained heap is scannable.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/test/groovy/org/gradle/internal/properties/bean/DefaultPropertyWalkerTest.groovy
} def "cycle in nested inputs is detected"() { def task = project.tasks.create("myTask", TaskWithNestedObject) def cycle = new Tree(value: "cycle", left: new Tree(value: "left")) cycle.right = cycle task.nested = new Tree(value: "first", left: new Tree(value: "left"), right: new Tree(value: "deeper", left: cycle, right: new Tree(value: "no-cycle"))) when:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 11 20:42:35 UTC 2024 - 10.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
// Graph query methods /** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K 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");
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Sep 22 06:02:04 UTC 2023 - 8.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
// Graph query methods /** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. * * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1). */ public static <N> boolean hasCycle(Graph<N> graph) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
src/go/types/mono.go
// time. Since v is the first vertex we found within the cycle, any // vertices we visited earlier cannot be part of the cycle. for stack[0] != v { stack = stack[1:] } // TODO(mdempsky): Pivot stack so we report the cycle from the top? err := check.newError(InvalidInstanceCycle) obj0 := check.mono.vertices[v].obj err.addf(obj0, "instantiation cycle:") qf := RelativeTo(check.pkg)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0) -
src/runtime/mprof.go
// cycles ("C+n" above) and we only publish a cycle once all // of the events from that cycle must be done. Specifically: // // Mallocs are accounted to cycle C+2. // Explicit frees are accounted to cycle C+2. // GC frees (done during sweeping) are accounted to cycle C+1. // // After mark termination, we increment the global heap // profile cycle counter and accumulate the stats from cycle C // into the active profile.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 53.3K bytes - Viewed (0) -
cmd/data-scanner-metric.go
} c := p.cycleInfo.clone() return &c } func (p *scannerMetrics) report() madmin.ScannerMetrics { var m madmin.ScannerMetrics cycle := p.getCycle() if cycle != nil { m.CurrentCycle = cycle.current m.CyclesCompletedAt = cycle.cycleCompleted m.CurrentStarted = cycle.started } m.CollectedAt = time.Now() m.ActivePaths = p.getCurrentPaths() m.LifeTimeOps = make(map[string]uint64, scannerMetricLast)
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Sep 25 05:15:31 UTC 2023 - 9.1K bytes - Viewed (0)