- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 63 for permutation (0.15 sec)
-
src/vendor/golang.org/x/crypto/internal/poly1305/sum_s390x.s
// into 26-bit big-endian limbs and places the results into // the first and second lane of dāā[0:4] respectively. // // The EX0, EX1 and EX2 constants are arrays of byte indices // for permutation. The permutation both reverses the bytes // in the input and ensures the bytes are copied into the // destination limb ready to be shifted into their final // position. #define EXPAND(in0, in1, d0, d1, d2, d3, d4) \
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 17.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/tpu_space_to_depth_pass.cc
TF::TransposeOp GetTransposeOpForConv2DFilter(OpBuilder* builder, Value input) { SmallVector<int32_t, 6> permutation = {0, 2, 1, 3, 4, 5}; auto permute_type = RankedTensorType::get({6}, builder->getIntegerType(32)); auto permute_attr = DenseIntElementsAttr::get(permute_type, permutation); auto permute_value = builder->create<TF::ConstOp>(input.getLoc(), permute_attr);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 29.3K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt
// In practice, wildcards are always in the leftmost position. For now, this implementation // cheats and does not attempt every possible permutation. Instead, it only considers wildcards // in the leftmost position. We assert this fact when we generate the public suffix file. If // this assertion ever fails we'll need to refactor this implementation.
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 11.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/tests/tfl_legalize_hlo.mlir
// CHECK-LABEL: main // CHECK: return %arg0 : tensor<5x7xf32> } // - transpose // func.func @transpose_2d(%arg0: tensor<2x3xf32>) -> tensor<3x2xf32> { %0 = "mhlo.transpose"(%arg0) <{permutation = dense<[1, 0]> : tensor<2xi64>}> : (tensor<2x3xf32>) -> tensor<3x2xf32> func.return %0 : tensor<3x2xf32> // CHECK-LABEL: transpose_2d
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 02 09:41:17 UTC 2024 - 40.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/utils/lstm_utils.cc
Value Transpose(OpBuilder* builder, Value value_to_transpose, SmallVector<int32_t, 4> perm, RankedTensorType original_type, mlir::Location location) { // Create a constant op for transpose permutation. auto perm_op = CreateI32DenseConst(builder, perm, location); // Create tensor type for the transpose result. auto transpose_type = original_type; auto transpose_shape =
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 36.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/cluster_ops_by_policy.h
// // Example: compilation using XLA (MHLO) lowering // // %0 = "tf.Transpose"(%input, %perm) // : (tensor<?x?xf32>, tensor<2xi32>) -> tensor<?x?xf32> // // XLAs `mhlo.transpose` operation requires permutation to be an attribute // (compile time value), so it means that if we want to put `tf.Transpose` // into a cluster that will be compiled with XLA, the `%perm` operand must
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 03 03:47:00 UTC 2023 - 12.1K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/keccakf_amd64.s
// Convert the user state into an internal state NOTQ _be(rpState) NOTQ _bi(rpState) NOTQ _go(rpState) NOTQ _ki(rpState) NOTQ _mi(rpState) NOTQ _sa(rpState) // Execute the KeccakF permutation MOVQ _ba(rpState), rCa MOVQ _be(rpState), rCe MOVQ _bu(rpState), rCu XORQ _ga(rpState), rCa XORQ _ge(rpState), rCe XORQ _gu(rpState), rCu XORQ _ka(rpState), rCa XORQ _ke(rpState), rCe
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 10 16:37:53 UTC 2024 - 14.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/tests/flatbuffer2mlir/vhlo.mlir
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 14 19:15:40 UTC 2024 - 31.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/post_quantize.cc
struct FoldTransposeOp : public OpRewritePattern<TransposeOp> { explicit FoldTransposeOp(MLIRContext* context) : OpRewritePattern<TransposeOp>(context, 1) {} // Computes the permutation of a constant `input_tensor` according to `perm`. // The function recursively traverses the dimensions of the output tensor in // a row-major order and writes the value in the output tensor into // `new_values`.
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/runtime/map_benchmark_test.go
m[i] = true } b.ResetTimer() for i := 0; i < b.N; i++ { _ = m[n-1] } }) } } func BenchmarkMapCycle(b *testing.B) { // Arrange map entries to be a permutation, so that // we hit all entries, and one lookup is data dependent // on the previous lookup. const N = 3127 p := rand.New(rand.NewSource(1)).Perm(N) m := map[int]int{} for i := 0; i < N; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 09 16:41:16 UTC 2023 - 10.6K bytes - Viewed (0)