- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 70 for Headless (0.27 sec)
-
tensorflow/compiler/mlir/tensorflow/ir/tf_executor_ops.td
The TensorFlow Executor dialect. This dialect models the TensorFlow executor semantics and can represent arbitrary TensorFlow graphs. As such it follows the existing execution model that includes deadness propagation, concurrent semantics, and control dependencies. Operations in this dialect return a value of type `!tf_executor.control` as last returned value (exceptions are `tf_executor.NextIteration.graph`,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 23 19:35:12 UTC 2023 - 22K bytes - Viewed (0) -
src/go/types/typexpr.go
if check.conf._Trace { check.trace(e0.Pos(), "-- type %s", e0) check.indent++ defer func() { check.indent-- var under Type if T != nil { // Calling under() here may lead to endless instantiations. // Test case: type T[P any] *T[P] under = safeUnderlying(T) } if T == under { check.trace(e0.Pos(), "=> %s // %s", T, goTypeName(T)) } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 16.3K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typexpr.go
if check.conf.Trace { check.trace(e0.Pos(), "-- type %s", e0) check.indent++ defer func() { check.indent-- var under Type if T != nil { // Calling under() here may lead to endless instantiations. // Test case: type T[P any] *T[P] under = safeUnderlying(T) } if T == under { check.trace(e0.Pos(), "=> %s // %s", T, goTypeName(T)) } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 16.6K bytes - Viewed (0) -
src/go/types/predicates.go
// the current interface. Example: // // type T interface { // m() interface{T} // } // // If two such (differently named) interfaces are compared, // endless recursion occurs if the cycle is not detected. // // If x and y were compared before, they must be equal // (if they were not, the recursion would have stopped);
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 17.6K bytes - Viewed (0) -
src/crypto/tls/cipher_suites.go
// implement FFDHE, so that means ECDHE. // // - AEADs come before CBC ciphers // // Even with Lucky13 countermeasures, MAC-then-Encrypt CBC cipher suites // are fundamentally fragile, and suffered from an endless sequence of // padding oracle attacks. See https://eprint.iacr.org/2015/1129, // https://www.imperialviolet.org/2014/12/08/poodleagain.html, and
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 25.5K bytes - Viewed (0) -
src/encoding/gob/debug.go
if len(p.data) == 0 { return p.r.Read(b) } // Satisfy what's possible from the read-ahead data. n = copy(b, p.data) // Move data down to beginning of slice, to avoid endless growth copy(p.data, p.data[n:]) p.data = p.data[:len(p.data)-n] return } // peek returns as many bytes as possible from the unread // portion of the stream, up to the length of b.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 20 09:34:41 UTC 2023 - 18.3K bytes - Viewed (0) -
src/cmd/compile/internal/types2/predicates.go
// the current interface. Example: // // type T interface { // m() interface{T} // } // // If two such (differently named) interfaces are compared, // endless recursion occurs if the cycle is not detected. // // If x and y were compared before, they must be equal // (if they were not, the recursion would have stopped);
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 17.5K bytes - Viewed (0) -
src/go/internal/gcimporter/gcimporter_test.go
} // verifyInterfaceMethodRecvs verifies that method receiver types // are named if the methods belong to a named interface type. func verifyInterfaceMethodRecvs(t *testing.T, named *types.Named, level int) { // avoid endless recursion in case of an embedding bug that lead to a cycle if level > 10 { t.Errorf("%s: embeds itself", named) return } iface, _ := named.Underlying().(*types.Interface) if iface == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 16:22:59 UTC 2024 - 21.9K bytes - Viewed (0) -
src/cmd/compile/internal/types2/lookup.go
} } // Start with typ as single entry at shallowest depth. current := []embeddedType{{typ, nil, isPtr, false}} // seen tracks named types that we have seen already, allocated lazily. // Used to avoid endless searches in case of recursive types. // // We must use a lookup on identity rather than a simple map[*Named]bool as // instantiated types may be identical but not equal. var seen instanceLookup
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 22 19:32:17 UTC 2024 - 19.8K bytes - Viewed (0) -
src/go/types/lookup.go
} } // Start with typ as single entry at shallowest depth. current := []embeddedType{{typ, nil, isPtr, false}} // seen tracks named types that we have seen already, allocated lazily. // Used to avoid endless searches in case of recursive types. // // We must use a lookup on identity rather than a simple map[*Named]bool as // instantiated types may be identical but not equal. var seen instanceLookup
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 19.9K bytes - Viewed (0)