- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 112 for importing (0.19 sec)
-
tensorflow/compiler/mlir/tf2xla/internal/passes/extract_outside_compilation.cc
} } // Output `shard_type`, which is the type of each shard, given `full_type`. If // the full shape is (num_cores_per_replica * a, b, c), then the shard shape is // (a, b, c). `context_op` is used for error reporting, in case of errors. LogicalResult GetShardShapedType(Operation* context_op, int num_cores_per_replica, Type full_type, Type& shard_type) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Apr 30 21:25:12 UTC 2024 - 68.3K bytes - Viewed (0) -
common-protos/k8s.io/apimachinery/pkg/apis/meta/v1/generated.proto
optional string name = 1; // singularName is the singular name of the resource. This allows clients to handle plural and singular opaquely. // The singularName is more correct for reporting status on a single item and both singular and plural are allowed // from the kubectl CLI interface. optional string singularName = 6; // namespaced indicates if a resource is namespaced or not.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Mar 11 18:43:24 UTC 2024 - 53.3K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/apis/meta/v1/generated.proto
optional string name = 1; // singularName is the singular name of the resource. This allows clients to handle plural and singular opaquely. // The singularName is more correct for reporting status on a single item and both singular and plural are allowed // from the kubectl CLI interface. optional string singularName = 6; // namespaced indicates if a resource is namespaced or not.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 28 15:34:11 UTC 2024 - 53.7K bytes - Viewed (0) -
src/runtime/mheap.go
// basis point at (sweepHeapLiveBasis, pagesSweptBasis). At // any given time, the system is at (gcController.heapLive, // pagesSwept) in this space. // // It is important that the line pass through a point we // control rather than simply starting at a 0,0 origin // because that lets us adjust sweep pacing at any time while // accounting for current progress. If we could only adjust
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/native-binaries/google-test/groovy/libs/googleTest/1.7.0/include/gtest/internal/gtest-port.h
// when you downcast, you should use this macro. In debug mode, we // use dynamic_cast<> to double-check the downcast is legal (we die // if it's not). In normal mode, we do the efficient static_cast<> // instead. Thus, it's important to test in debug mode to make sure // the cast is legal! // This is the only place in the code we should use dynamic_cast<>. // In particular, you SHOULDN'T be using dynamic_cast<> in order to
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 67.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
// lastChanged and lastChecked "times" so unchanged predecessors can be // skipped on after-the-first iterations. Doing this allows extra // iterations by the caller to be almost free. // // It is important to know that the set representation used for // startState, endState, and merges can share data for two sets where // one is a small delta from the other. Doing this does require a
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
src/runtime/mgcpacer.go
// These two values are still kept separate however because they are // distinct conceptually, and in previous iterations of the pacer the // distinction was more important. gcBackgroundUtilization = 0.25 // gcCreditSlack is the amount of scan work credit that can // accumulate locally before updating gcController.heapScanWork and,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass.cc
// cost function, nor can we look at global information while deciding on // individual edges to contract. Instead, we will make decisions on these // important edges then make decisions on all other edges, causing the highest // chance of all most important edges to be contracted. // // An example of where this might occur is with a digraph: // {A -> B, B -> C, A -> X, X -> C} where B is a Size operation and X is
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 12:19:41 UTC 2024 - 85.3K bytes - Viewed (0) -
src/runtime/mgcscavenge.go
// When synchronously scavenging for the memory limit or for debug.FreeOSMemory, these // "dense" packing heuristics are ignored (in other words, scavenging is "forced") because // in these scenarios returning memory to the OS is more important than keeping CPU // overheads low. package runtime import ( "internal/goos" "internal/runtime/atomic" "runtime/internal/sys" "unsafe" ) const (
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:48:45 UTC 2024 - 52.3K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/parser.go
case _Lparen: pos := p.pos() p.next() p.xnest++ x := p.expr() p.xnest-- p.want(_Rparen) // Optimization: Record presence of ()'s only where needed // for error reporting. Don't bother in other cases; it is // just a waste of memory and time. // // Parentheses are not permitted around T in a composite // literal T{}. If the next token is a {, assume x is a
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 62.9K bytes - Viewed (0)