- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 546 for begin7_ (0.08 sec)
-
tensorflow/compiler/mlir/lite/transforms/optimize_batch_matmul.cc
llvm::SmallVector<int64_t, 4> permuted_shape(input_shape.begin(), input_shape.end()); // Swaps z dimension and x dimension to get permuted shape. std::iter_swap(permuted_shape.begin() + input_rank - 1, permuted_shape.begin() + input_rank - 2); return rewriter.create<TFL::TransposeOp>( bmm_op->getLoc(),
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 9.6K bytes - Viewed (0) -
platforms/native/platform-native/src/test/groovy/org/gradle/nativeplatform/platform/internal/ReadelfBinaryInfoTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Feb 05 23:09:11 UTC 2024 - 13.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/merge_control_flow.cc
std::next(it) != sub_if_group.begin(); --it) { auto op_list = GetMoveOpsBetweenTwoIfRegions( it->getOperation(), last_if_op, middle_if_ops, side_effect_analysis); all_moved_ops.insert(op_list.begin(), op_list.end()); auto first_if_ops = GetAllOpsFromIf(*it); middle_if_ops.insert(first_if_ops.begin(), first_if_ops.end()); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 17 07:31:01 UTC 2023 - 25.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_executor.cc
if (!hasSingleElement(body)) return false; Operation &wrapped_op = *body.begin(); YieldOp yield = GetYield(); return wrapped_op.getNumResults() == yield.getNumOperands() && std::equal(wrapped_op.getResults().begin(), wrapped_op.getResults().end(), yield.getOperands().begin()); } mlir::LogicalResult IslandOp::verify() { IslandOp island = *this;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 42.7K bytes - Viewed (0) -
pkg/volume/iscsi/iscsi_util_test.go
fakeIscsiadmOutput := []string{ "# BEGIN RECORD 2.0-873\n" + "iface.iscsi_ifacename = default\n" + "iface.transport_name = tcp\n" + "iface.initiatorname = <empty>\n" + "# END RECORD", "# BEGIN RECORD 2.0-873\n" + "iface.iscsi_ifacename = default\n" + "iface.transport_name = cxgb4i\n" + "iface.initiatorname = <empty>\n" + "# END RECORD", "# BEGIN RECORD 2.0-873\n" +
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Oct 18 09:43:07 UTC 2022 - 14.5K bytes - Viewed (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/Certificates.kt
import okio.ByteString.Companion.toByteString /** * Decodes a multiline string that contains a [certificate][certificatePem] which is * [PEM-encoded][rfc_7468]. A typical input string looks like this: * * ``` * -----BEGIN CERTIFICATE----- * MIIBYTCCAQegAwIBAgIBKjAKBggqhkjOPQQDAjApMRQwEgYDVQQLEwtlbmdpbmVl * cmluZzERMA8GA1UEAxMIY2FzaC5hcHAwHhcNNzAwMTAxMDAwMDA1WhcNNzAwMTAx * MDAwMDEwWjApMRQwEgYDVQQLEwtlbmdpbmVlcmluZzERMA8GA1UEAxMIY2FzaC5h
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 2.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/utils/verify_suitable_for_graph_export.cc
return mlir::WalkResult::interrupt(); } auto block = function.front().without_terminator(); auto graph = llvm::dyn_cast<mlir::tf_executor::GraphOp>(block.begin()); if (!graph) { block.begin()->emitError(kInvalidExecutorGraphMsg) << "first op in function is not a tf_executor.graph"; return mlir::WalkResult::interrupt(); } if (!hasSingleElement(block)) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Mar 30 02:12:49 UTC 2022 - 2.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow_to_stablehlo/tf_to_stablehlo.cc
return absl::AbortedError("Failed to parse input MLIR model."); } return quant::stablehlo::ImportedMlirModuleOp(std::move(module), nullptr); } std::unordered_set<std::string> tag_set(tag_names.begin(), tag_names.end()); return quant::stablehlo::SavedModelToMlirModuleOp( input_path, tag_set, exported_model_signatures, *context); } // Convert an TF module to a StableHLO module
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 22:58:42 UTC 2024 - 5.5K bytes - Viewed (0) -
src/internal/fuzz/queue.go
// size, previous duration, coverage, and any other metrics that seem useful. type queue struct { // elems holds a ring buffer. // The queue is empty when begin = end. // The queue is full (until grow is called) when end = begin + N - 1 (mod N) // where N = cap(elems). elems []any head, len int } func (q *queue) cap() int { return len(q.elems) } func (q *queue) grow() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Nov 05 21:02:45 UTC 2022 - 1.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/testdata/hist.gdb-dbg.nexts
55: func test() { 57: l := line{point{1 + zero, 2 + zero}, point{3 + zero, 4 + zero}} 58: tinycall() // this forces l etc to stack 59: dx := l.end.x - l.begin.x //gdb-dbg=(l.begin.x,l.end.y)//gdb-opt=(l,dx/O,dy/O) l.begin.x = 1 l.end.y = 4 60: dy := l.end.y - l.begin.y //gdb-opt=(dx,dy/O) 61: sink = dx + dy //gdb-opt=(dx,dy)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 04 20:41:52 UTC 2019 - 4K bytes - Viewed (0)