- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 83 for Indices (0.29 sec)
-
tensorflow/compiler/mlir/lite/transforms/reduce_while_operands.cc
Block &body = while_op.getBody().front(); auto n = while_op.getNumOperands(); if (!AllOperationSafe(cond) || !AllOperationSafe(body)) return false; // Find all Consumed indices. // i is consumed element if result(i) is used outside whileOp or // argument(i) is used in whileOp.getCond(). for (auto i = 0; i < n; ++i) { if (!while_op.getResult(i).use_empty() ||
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 10.4K bytes - Viewed (0) -
staging/src/k8s.io/api/apps/v1/generated.proto
// 0-indexed names, or to orchestrate progressive movement of replicas from // one StatefulSet to another. // If set, replica indices will be in the range: // [.spec.ordinals.start, .spec.ordinals.start + .spec.replicas). // If unset, defaults to 0. Replica indices will be in the range: // [0, .spec.replicas). // +optional optional int32 start = 1; }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Apr 29 07:14:59 UTC 2024 - 34.8K bytes - Viewed (0) -
platforms/core-configuration/declarative-dsl-core/src/main/kotlin/org/gradle/internal/declarativedsl/analysis/FunctionCallResolver.kt
): ParameterArgumentBinding? { fun findParameterByName(name: String): DataParameter? = parameters.find { it.name == name } val lastPositionalArgIndex = arguments.indices.lastOrNull { arguments[it] is FunctionArgument.Positional } ?: arguments.size val bindingMap = mutableMapOf<DataParameter, FunctionArgument.ValueArgument>() arguments.forEachIndexed { argIndex, arg ->
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue May 21 14:27:23 UTC 2024 - 19.9K bytes - Viewed (0) -
pkg/controller/tainteviction/taint_eviction_test.go
} return pod } func addTaintsToNode(node *corev1.Node, key, value string, indices []int) *corev1.Node { taints := []corev1.Taint{} for _, index := range indices { taints = append(taints, createNoExecuteTaint(index)) } node.Spec.Taints = taints return node } var alwaysReady = func() bool { return true }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Apr 25 14:24:16 UTC 2024 - 31.3K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typestring.go
tparams *TypeParamList // local type parameters paramNames bool // if set, write function parameter names, otherwise, write types only tpSubscripts bool // if set, write type parameter indices as subscripts pkgInfo bool // package-annotate first unexported-type field to avoid confusing type description } func newTypeWriter(buf *bytes.Buffer, qf Qualifier) *typeWriter {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 12.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/post_quantize.cc
assert(output_axis < num_dimensions); const int input_axis = perm[output_axis]; for (int i = 0; i < output_shape[output_axis]; ++i) { // Update the input indices on `input_axis`. assert(input_axis < input_indices->size()); input_indices->operator[](input_axis) = static_cast<uint64_t>(i); // Write the value from `input_tensor` if it is the last axis or
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 17.1K bytes - Viewed (0) -
src/go/types/typestring.go
tparams *TypeParamList // local type parameters paramNames bool // if set, write function parameter names, otherwise, write types only tpSubscripts bool // if set, write type parameter indices as subscripts pkgInfo bool // package-annotate first unexported-type field to avoid confusing type description } func newTypeWriter(buf *bytes.Buffer, qf Qualifier) *typeWriter {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 12.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/prepare_composite_functions_tf.cc
if (lstm_func.getNumArguments() == 7) return failure(); // We should know the batch size in advance for the lstm fusion. // A good indicator of batch size is both cell state and input state (indices // 1 & 2) have fixed shape and other input tenors should have ranked tensor // types. for (int i = 0; i < 6; ++i) { auto input = lstm_func.getArgument(i);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 17.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/stablehlo/python/integration_test/quantize_model_test_base.py
if self.same_scale_op == 'concatenate': ones = array_ops.ones_like(out) out = array_ops.concat([out, ones], 0) elif self.same_scale_op == 'gather': out = array_ops.gather(out, indices=[0], axis=0) elif self.same_scale_op == 'max_pool': out = nn_ops.max_pool(out, ksize=3, strides=1, padding='SAME') elif self.same_scale_op == 'pad': paddings = array_ops.ones(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 14 06:31:57 UTC 2024 - 18.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/pgen.go
s.stksize = 0 s.stkptrsize = 0 s.stkalign = int64(types.RegSize) fn := s.curfn // Mark the PAUTO's unused. for _, ln := range fn.Dcl { if ln.OpenDeferSlot() { // Open-coded defer slots have indices that were assigned // upfront during SSA construction, but the defer statement can // later get removed during deadcode elimination (#61895). To // keep their relative offsets correct, treat them all as used.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 13.1K bytes - Viewed (0)