- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 749 for reachable (0.29 sec)
-
android/guava/src/com/google/common/graph/Graph.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 - 13.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graph.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 - 13.6K bytes - Viewed (0) -
src/cmd/link/internal/ld/stackcheck.go
func (sc *stackCheck) findRoots() []loader.Sym { // Collect all nodes. nodes := make(map[loader.Sym]struct{}) for k := range sc.graph { nodes[k] = struct{}{} } // Start a DFS from each node and delete all reachable // children. If we encounter an unrooted cycle, this will // delete everything in that cycle, so we detect this case and // track the lowest-numbered node encountered in the cycle and // put that node back as a root.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 24 16:49:08 UTC 2023 - 11.9K bytes - Viewed (0) -
platforms/software/dependency-management/src/integTest/groovy/org/gradle/integtests/resolve/api/ResolutionResultApiIntegrationTest.groovy
} } } """ } @Issue("https://github.com/gradle/gradle/issues/26334") def "resolution result does not report duplicate variants for the same module reachable through different paths"() { createDirs("producer", "transitive") settingsFile << """ include "producer", "transitive" """ file("producer/build.gradle") << """
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 24 06:54:47 UTC 2023 - 30.5K bytes - Viewed (0) -
staging/src/k8s.io/api/networking/v1beta1/types_swagger_doc_generated.go
} var map_Ingress = map[string]string{ "": "Ingress is a collection of rules that allow inbound connections to reach the endpoints defined by a backend. An Ingress can be configured to give services externally-reachable urls, load balance traffic, terminate SSL, offer name based virtual hosting etc.", "metadata": "Standard object's metadata. More info: https://git.k8s.io/community/contributors/devel/sig-architecture/api-conventions.md#metadata",
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Jan 22 00:51:25 UTC 2023 - 14.3K bytes - Viewed (0) -
src/cmd/link/internal/loader/symbolbuilder.go
func (p *relocsByOff) Less(i, j int) bool { return p.relocs[i].Off() < p.relocs[j].Off() } func (p *relocsByOff) Swap(i, j int) { p.relocs[i], p.relocs[j] = p.relocs[j], p.relocs[i] } func (sb *SymbolBuilder) Reachable() bool { return sb.l.AttrReachable(sb.symIdx) } func (sb *SymbolBuilder) SetReachable(v bool) { sb.l.SetAttrReachable(sb.symIdx, v) } func (sb *SymbolBuilder) ReadOnly() bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 08 15:25:19 UTC 2023 - 13.9K bytes - Viewed (0) -
src/cmd/compile/internal/staticinit/sched.go
// global map variable V to its associated outlined init function. // These relocation ensure that if the map var itself is determined to // be reachable at link time, we also mark the init function as // reachable. func AddKeepRelocations() { if varToMapInit == nil { return } for k, v := range varToMapInit { // Add R_KEEP relocation from map to init function.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 17:16:14 UTC 2024 - 30.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/likelyadjust.go
} // Reducible-loop-nest-finding. for _, b := range po { if f.pass != nil && f.pass.debug > 3 { fmt.Printf("loop finding at %s\n", b) } var innermost *loop // innermost header reachable from this block // IF any successor s of b is in a loop headed by h // AND h dominates b // THEN b is in the loop headed by h. // // Choose the first/innermost such h. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 15.4K bytes - Viewed (0) -
staging/src/k8s.io/api/networking/v1beta1/generated.proto
repeated HTTPIngressPath paths = 1; } // Ingress is a collection of rules that allow inbound connections to reach the // endpoints defined by a backend. An Ingress can be configured to give services // externally-reachable urls, load balance traffic, terminate SSL, offer name // based virtual hosting etc. message Ingress { // Standard object's metadata.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 28 15:34:11 UTC 2024 - 15.1K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/server/options/serving.go
if s == nil { return } fs.IPVar(&s.BindAddress, "bind-address", s.BindAddress, ""+ "The IP address on which to listen for the --secure-port port. The "+ "associated interface(s) must be reachable by the rest of the cluster, and by CLI/web "+ "clients. If blank or an unspecified address (0.0.0.0 or ::), all interfaces and IP address families will be used.")
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Apr 27 13:08:18 UTC 2024 - 15.9K bytes - Viewed (0)