- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 1,106 for reachable (0.19 sec)
-
src/cmd/link/internal/ld/inittask.go
var h lexHeap // m maps from an inittask symbol for package p to the number of // p's direct imports that have not yet been scheduled. m := map[loader.Sym]int{} // Find all reachable inittask records from the roots. // Keep track of the dependency edges between them in edges. // Keep track of how many imports each package has in m. // q is the list of found but not yet explored packages.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 30 20:09:45 UTC 2024 - 6.2K bytes - Viewed (0) -
src/runtime/mgc.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
src/go/types/labels.go
// If there are any forward jumps left, no label was found for // the corresponding goto statements. Either those labels were // never defined, or they are inside blocks and not reachable // for the respective gotos. for _, jmp := range fwdJumps { var msg string var code Code name := jmp.Label.Name if alt := all.Lookup(name); alt != nil { msg = "goto %s jumps into block"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 7.2K bytes - Viewed (0) -
subprojects/core/src/integTest/groovy/org/gradle/api/FinalizerTaskIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri May 17 13:27:33 UTC 2024 - 32.3K bytes - Viewed (0) -
src/runtime/gc_test.go
t.Fatalf("live object not in reachable set; want %b, got %b", want, got) } if bits.OnesCount64(got&^want) > 1 { // Note: we can occasionally have a value that is retained even though // it isn't live, due to conservative scanning of stack frames. // See issue 67204. For now, we allow a "slop" of 1 unintentionally // retained object. t.Fatalf("dead object in reachable set; want %b, got %b", want, got) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 05 22:33:52 UTC 2024 - 17.6K bytes - Viewed (0) -
src/go/types/mono.go
} } func (check *Checker) reportInstanceLoop(v int) { var stack []int seen := make([]bool, len(check.mono.vertices)) // We have a path that contains a cycle and ends at v, but v may // only be reachable from the cycle, not on the cycle itself. We // start by walking backwards along the path until we find a vertex // that appears twice. for !seen[v] { stack = append(stack, v) seen[v] = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
* * <p>In an undirected graph, this is equivalent to {@link #adjacentNodes(Object)}. * * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>If {@code node} is removed from the graph after this method is called, the {@code Set}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/BaseGraph.java
* * <p>In an undirected graph, this is equivalent to {@link #adjacentNodes(Object)}. * * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}. * * <p>If {@code node} is removed from the graph after this method is called, the {@code Set}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
pkg/proxy/serviceport.go
InternalPolicyLocal() bool // HintsAnnotation returns the value of the v1.DeprecatedAnnotationTopologyAwareHints annotation. HintsAnnotation() string // ExternallyAccessible returns true if the service port is reachable via something // other than ClusterIP (NodePort/ExternalIP/LoadBalancer) ExternallyAccessible() bool // UsesClusterEndpoints returns true if the service port ever sends traffic to
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Jan 09 08:17:56 UTC 2024 - 10.7K bytes - Viewed (0) -
tensorflow/compiler/jit/extract_outside_compilation_pass.cc
fld, &host_fbody)); // We use ReverseDFS() to copy nodes. Make sure all nodes are reverse // reachable from sink node so all nodes will be copied. // TODO(b/77601805): consolidate copy graph functions. FixupSourceAndSinkEdges(host_fbody->graph); std::map<const Node*, Node*> node_map;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 104.7K bytes - Viewed (0)