- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 924 for reachable (0.48 sec)
-
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) -
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) -
pilot/pkg/serviceregistry/kube/controller/ambient/waypoints.go
"istio.io/istio/pkg/workloadapi" ) type InboundBinding struct { Port uint32 Protocol workloadapi.ApplicationTunnel_Protocol } type Waypoint struct { krt.Named // Addresses this Waypoint is reachable by. For stock Istio waypoints, this // is is usually the VIP. Tere will always be at least one address in this // list. Addresses []netip.Addr
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jun 12 18:02:28 UTC 2024 - 11.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/html.go
return err } type htmlFuncPrinter struct { w io.Writer } func (p htmlFuncPrinter) header(f *Func) {} func (p htmlFuncPrinter) startBlock(b *Block, reachable bool) { var dead string if !reachable { dead = "dead-block" } fmt.Fprintf(p.w, "<ul class=\"%s ssa-print-func %s\">", b, dead) fmt.Fprintf(p.w, "<li class=\"ssa-start-block\">%s:", b.HTML()) if len(b.Preds) > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 04 15:11:40 UTC 2023 - 34.8K bytes - Viewed (0) -
src/runtime/mgcmark.go
state.head = x.next if stackTraceDebug { for i := 0; i < x.nobj; i++ { obj := &x.obj[i] if obj.r == nil { // reachable continue } println(" dead stkobj at", hex(gp.stack.lo+uintptr(obj.off)), "of size", obj.r.size) // Note: not necessarily really dead - only reachable-from-ptr dead. } } x.nobj = 0 putempty((*workbuf)(unsafe.Pointer(x))) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/types/objectpath/objectpath.go
// reading export data; the latter may have a smaller Scope since // export data trims objects that are not reachable from an exported // declaration. For example, the For function will return a path for // an exported method of an unexported type that is not reachable // from any public declaration; this path will cause the Object // function to fail if called on a package loaded from export data.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 23.1K bytes - Viewed (0) -
src/runtime/profbuf.go
// can overwrite gp.labels, the value of gp.labels is stable during // this signal handler: it will still be reachable from gp when // we finish executing. If a GC is in progress right now, it must // keep gp.labels alive, because gp.labels is reachable from gp. // If gp were to overwrite gp.labels, the deletion barrier would // still shade that pointer, which would preserve it for the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 18.2K bytes - Viewed (0) -
src/go/doc/example.go
// referenced by the body. unresolved := make(map[string]bool) var depDecls []ast.Decl usedDecls := make(map[ast.Decl]bool) // set of top-level decls reachable from the body usedObjs := make(map[*ast.Object]bool) // set of objects reachable from the body (each declared by a usedDecl) var inspectFunc func(ast.Node) bool inspectFunc = func(n ast.Node) bool { switch e := n.(type) { case *ast.Ident:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 21.4K bytes - Viewed (0) -
src/cmd/compile/internal/types2/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 Feb 28 00:05:29 UTC 2024 - 9.1K bytes - Viewed (0)