- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 338 for Reachable (0.2 sec)
-
src/cmd/go/internal/modcmd/why.go
arguments as a list of modules and finds a path to any package in each of the modules. By default, why queries the graph of packages matched by "go list all", which includes tests for reachable packages. The -vendor flag causes why to exclude tests of dependencies. The output is a sequence of stanzas, one for each package or module name on the command line, separated by blank lines. Each stanza begins
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 01 21:32:23 UTC 2023 - 3.8K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/Address.kt
protocols: List<Protocol>, connectionSpecs: List<ConnectionSpec>, /** * Returns this address's proxy selector. Only used if the proxy is null. If none of this * selector's proxies are reachable, a direct connection will be attempted. */ @get:JvmName("proxySelector") val proxySelector: ProxySelector, ) { /** * Returns a URL with the hostname and port of the origin server. The path, query, and fragment of
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 7.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/lca.go
} parent := dom[b.ID].ID blocks[b.ID].parent = parent blocks[b.ID].sibling = blocks[parent].firstChild blocks[parent].firstChild = b.ID } // Compute euler tour ordering. // Each reachable block will appear #children+1 times in the tour. tour := make([]ID, 0, f.NumBlocks()*2-1) type queueEntry struct { bid ID // block to work on cid ID // child we're already working on (0 = haven't started yet) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 30 21:52:15 UTC 2023 - 3.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s outgoing edges in the direction (if any) of the edge. * * <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>Some algorithms that operate on a {@code SuccessorsFunction} may produce undesired results
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.3K bytes - Viewed (0) -
cmd/erasure-common.go
defer wg.Done() if disks[i] == nil { return } di, err := disks[i].DiskInfo(context.Background(), DiskInfoOptions{}) if err != nil || di.Healing { // - Do not consume disks which are not reachable // unformatted or simply not accessible for some reason. // // - Do not consume disks which are being healed // // - Future: skip busy disks return } mu.Lock()
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 4.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/SuccessorsFunction.java
* Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing * {@code node}'s outgoing edges in the direction (if any) of the edge. * * <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>Some algorithms that operate on a {@code SuccessorsFunction} may produce undesired results
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.3K bytes - Viewed (0) -
src/cmd/internal/objabi/reloctype.go
R_INITORDER // R_WEAK marks the relocation as a weak reference. // A weak relocation does not make the symbol it refers to reachable, // and is only honored by the linker if the symbol is in some other way // reachable. R_WEAK = -1 << 15 R_WEAKADDR = R_WEAK | R_ADDR R_WEAKADDROFF = R_WEAK | R_ADDROFF )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 17:26:07 UTC 2024 - 17.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/internal/analysisflags/flags.go
// Use in unitchecker.Run will gob.Register all fact types for the returned // graph of analyzers but of course not the ones only reachable from // dropped analyzers. To avoid inconsistency about which gob types are // registered from run to run, Parse itself gob.Registers all the facts // only reachable from dropped analyzers. // This is not a particularly elegant API, but this is an internal package.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 12.1K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/DetermineExecutionPlanAction.java
* So if the dependency is only required by a finalizer, then it should not start until the finalizer is ready to start * (ie the finalized task has completed). But if the dependency is also required by some node reachable from the * command-line tasks, then it should start as soon as its dependencies are ready. * Or if the dependency is required by multiple finalizers, then it should not start until one of those finalizer * is ready to start.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 17.7K bytes - Viewed (0) -
src/cmd/compile/internal/inline/interleaved/interleaved.go
for _, fn := range pkg.Funcs { DevirtualizeAndInlineFunc(fn, inlProfile) } if base.Flag.LowerL != 0 { // Perform a garbage collection of hidden closures functions that // are no longer reachable from top-level functions following // inlining. See #59404 and #59638 for more context. inline.GarbageCollectUnreferencedHiddenClosures() if base.Debug.DumpInlFuncProps != "" {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 20:42:52 UTC 2024 - 5.1K bytes - Viewed (0)