- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 204 for circle (0.1 sec)
-
src/go/types/initorder.go
// if n still depends on other nodes, we have a cycle if n.ndeps > 0 { cycle := findPath(check.objMap, n.obj, n.obj, make(map[Object]bool)) // If n.obj is not part of the cycle (e.g., n.obj->b->c->d->c), // cycle will be nil. Don't report anything in that case since // the cycle is reported when the algorithm gets to an object // in the cycle. // Furthermore, once an object in the cycle is encountered,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.9K bytes - Viewed (0) -
src/cmd/compile/internal/types2/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 - 29.6K 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) -
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) -
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) -
tensorflow/compiler/jit/xla_cluster_util.cc
// The clustering code must avoid adding cycles to the graph to prevent // deadlock. However, the graph may contain loops, which would trigger the // cycle detection code. To handle loops, we alter the structure of the cycle // detection graph, disconnecting each loop from the enclosing graph. // Specifically, we: // * add a new "frame" node for each loop.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 29 08:39:39 UTC 2024 - 21.3K bytes - Viewed (0) -
.teamcity/src/test/kotlin/PromotionProjectTests.kt
model.buildTypes.map { it.name } ) } @Test fun `promotion project has expected build types for other branches`() { val model = setupModelFor("release")
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Feb 13 14:18:23 UTC 2024 - 13.4K bytes - Viewed (0) -
pkg/scheduler/framework/interface.go
// // We regard the backoff as a penalty of wasting the scheduling cycle. // In the case of returning Pending, we cannot say the scheduling cycle is wasted // because the scheduling result is used to proceed the Pod's scheduling forward, // that particular scheduling cycle is failed though. // So, Pods rejected by such reasons don't need to suffer a penalty (backoff).
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 15:52:16 UTC 2024 - 35.4K bytes - Viewed (0) -
src/cmd/compile/internal/types2/validtype.go
package types2 import "cmd/compile/internal/syntax" // validType verifies that the given type does not "expand" indefinitely // producing a cycle in the type graph. // (Cycles involving alias types, as in "type A = [10]A" are detected // earlier, via the objDecl cycle detection mechanism.) func (check *Checker) validType(typ *Named) { check.validType0(nopos, typ, nil, nil) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 15 13:22:37 UTC 2024 - 10.2K bytes - Viewed (0)