- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 338 for Reachable (0.19 sec)
-
platforms/core-execution/workers/src/integTest/groovy/org/gradle/workers/internal/WorkerExecutorIntegrationTest.groovy
def reachableClasses = gradleApiClasses.findAll { reachable(it) } if (!reachableClasses.empty) { throw new IllegalArgumentException("These classes should not be visible to the worker action: " + reachableClasses) } } boolean reachable(String classname) { try {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon May 06 13:00:39 UTC 2024 - 31K bytes - Viewed (0) -
src/runtime/mgc.go
// escapes its callback closure, so it can't capture anything. // // This is protected by markDoneSema. var gcMarkDoneFlushed uint32 // gcMarkDone transitions the GC from mark to mark termination if all // reachable objects have been marked (that is, there are no grey // objects and can be no more in the future). Otherwise, it flushes // all local work to the global queues where it can be discovered by // other workers. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/value/encrypt/aes/aes_extended_nonce.go
// Speaking on the cryptographic safety, the limit on the number of operations that can be preformed // with a single seed with derived keys and randomly generated nonces is not practically reachable. // Thus, the scheme does not impose any specific requirements on the seed rotation schedule. // Reusing the same seed is safe to do over time and across process restarts. Whenever a new
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jul 21 19:25:52 UTC 2023 - 6.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_saved_model_ops.td
contains a subobject "self.bar" which itself has an exported function "baz", then the function will have an exported name "bar.baz". If an object in the object graph is reachable via multiple paths from the root of the object graph, then this array can have multiple entries. TODO(silvasean): This design should be reconsidered after
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Oct 31 08:49:35 UTC 2023 - 7.2K 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/main/java/jcifs/smb1/smb1/NtStatus.java
"NT_STATUS_NOT_FOUND", "The referenced account is currently locked out and may not be logged on to.", "The remote system is not reachable by the transport.", "NT_STATUS_IO_REPARSE_TAG_NOT_HANDLED", };
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Fri Mar 22 21:10:40 UTC 2019 - 11.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/cfg/cfg.go
type Block struct { Nodes []ast.Node // statements, expressions, and ValueSpecs Succs []*Block // successor nodes in the graph Index int32 // index within CFG.Blocks Live bool // block is reachable from entry Kind BlockKind // block kind Stmt ast.Stmt // statement that gave rise to this block (see BlockKind for details) succs2 [2]*Block // underlying array for Succs }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 7.7K 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)