- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 1,405 for reachable (0.17 sec)
-
tensorflow/compiler/mlir/lite/transforms/trim_functions_tf.cc
funcs_to_trim.push_back(func); } } // remove all unexported functions from the module. for (auto func : funcs_to_trim) { func.erase(); } return true; } // validate that all reachable functions from the remaining functions are // also in the allowlist. void TrimFunctionsPass::Verify() { // TODO(ashwinm): Instead, we should make sure that references to all // SymbolRefAttrs of all ops are present.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Oct 07 21:08:41 UTC 2022 - 4.6K bytes - Viewed (0) -
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) -
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) -
pkg/test/util/assert/assert.go
func ChannelHasItem[T any](t test.Failer, c <-chan T) T { t.Helper() select { case r := <-c: return r case <-time.After(time.Second * 5): t.Fatalf("failed to receive event after 5s") } // Not reachable return ptr.Empty[T]() } // ChannelIsEmpty asserts a channel is empty for at least 20ms func ChannelIsEmpty[T any](t test.Failer, c <-chan T) { t.Helper() select { case r := <-c:
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Dec 18 17:21:50 UTC 2023 - 4.4K 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) -
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) -
cmd/bootstrap-peer-server.go
retries++ // after 20 retries start logging that servers are not reachable yet if retries >= 20 { logger.Info(fmt.Sprintf("Waiting for at least %d remote servers with valid configuration to be online", len(clnts)/2)) if len(offlineEndpoints) > 0 { logger.Info(fmt.Sprintf("Following servers are currently offline or unreachable %s", offlineEndpoints)) } if len(incorrectConfigs) > 0 {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 7.5K 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/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)