- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 35 for permutation (0.32 sec)
-
platforms/software/dependency-management/src/integTest/groovy/org/gradle/integtests/resolve/versions/VersionRangeResolvePairBatch2IntegrationTest.groovy
def "resolve pair #permutation"() { given: def candidates = permutation.candidates def expectedSingle = permutation.expectedSingle def expectedMulti = permutation.expectedMulti expect: checkScenarioResolution(expectedSingle, expectedMulti, candidates) where: permutation << VersionRangeResolveTestScenarios.SCENARIOS_TWO_DEPENDENCIES_BATCH2
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 1.4K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/sha3.go
// If we're absorbing, we need to xor the input into the state // before applying the permutation. xorIn(d, d.storage[:d.rate]) d.n = 0 keccakF1600(&d.a) case spongeSqueezing: // If we're squeezing, we need to apply the permutation before // copying more output. keccakF1600(&d.a) d.i = 0 copyOut(d, d.storage[:d.rate]) } } // pads appends the domain separation bits in dsbyte, applies
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 5.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/stablehlo/cc/permutation_test.cc
const SmallVector<int64_t> permutation = {0}; const SmallVector<int> permutation_result = Permute<int>(single_element_array, permutation); EXPECT_THAT(permutation_result, ElementsAre(8)); } TEST(PermutationTest, PermuteFourElements) { const SmallVector<int> arr = {0, 3, 1, 2}; // Permutation inverse of {0, 3, 1, 2}. const SmallVector<int64_t> permutation = {0, 2, 3, 1};
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 22 00:14:00 UTC 2024 - 2.1K bytes - Viewed (0) -
platforms/software/dependency-management/src/integTest/groovy/org/gradle/integtests/resolve/versions/VersionRangeResolvePreferPairBatch1IntegrationTest.groovy
def "resolve prefer pair #permutation"() { given: def candidates = permutation.candidates def expectedSingle = permutation.expectedSingle def expectedMulti = permutation.expectedMulti expect: checkScenarioResolution(expectedSingle, expectedMulti, candidates) where: permutation << VersionRangeResolveTestScenarios.SCENARIOS_PREFER_BATCH1 }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 1.6K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/doc.go
// A sponge builds a pseudo-random function from a public pseudo-random // permutation, by applying the permutation to a state of "rate + capacity" // bytes, but hiding "capacity" of the bytes. // // A sponge starts out with a zero state. To hash an input using a sponge, up // to "rate" bytes of the input are XORed into the sponge's state. The sponge // is then "full" and the permutation is applied to "empty" it. This process is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 10 16:37:53 UTC 2024 - 3.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/ir/tfl_canonicalize.td
def ConvertTransposeToDecreaseRank : Pat< (TFL_TransposeOp:$output_transpose $input, (Arith_ConstantOp:$permutation $_)), (TFL_ReshapeOp (TFL_TransposeOp (TFL_ReshapeOp $input, (Arith_ConstantOp (GetSqueezedShape $input))), (Arith_ConstantOp (GetSqueezedPermutation $input, $permutation))), (Arith_ConstantOp (GetShape $output_transpose))), [(AnyStaticShapeTensor $input), (HasRankAtLeast<7> $input),
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Dec 13 20:41:03 UTC 2023 - 2.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/stablehlo/passes/nchw_convolution_to_nhwc.cc
// Returns a new tensor type with the shape transposed according to the // permutation. The rank of `type` and the size of `permutation` must be // equal. TensorType GetTransposedTensorType( const TensorType type, const ArrayRef<int64_t> permutation) const { const SmallVector<int64_t> after_shape = Permute<int64_t>(type.getShape(), permutation); return type.cloneWith(after_shape, type.getElementType()); } };
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 8.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_op_interfaces.td
>, InterfaceMethod< [{Updates operation attributes and operands to account for the folded permutation. If folding of permutation is not possible, must return failure.}], "LogicalResult", "FoldOperandsPermutation", (ins "ArrayRef<int64_t>":$permutation) >, ]; let verify = [{ return VerifyFoldOperandsTransposeInterface($_op); }]; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Nov 30 19:07:07 UTC 2022 - 6.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/transforms/legalize_hlo_conversions/scatter.cc
permutation_array, updates_type, rewriter); auto transposed_updates = rewriter.create<mhlo::TransposeOp>( scatter_op->getLoc(), permutation_and_shape.shape, updates, permutation_and_shape.permutation); updates = transposed_updates; updates_type = permutation_and_shape.shape; return success(); } } // end namespace odml
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Sep 12 02:29:42 UTC 2023 - 3.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/optimize_batch_matmul.cc
// Create a 1D I32 tensor for representing the dimension permutation. auto permuation_tensor_type = RankedTensorType::get({input_rank}, rewriter.getIntegerType(32)); llvm::SmallVector<Attribute, 4> permute; permute.reserve(input_rank); // First create an identity permutation tensor. for (int i = 0; i < input_rank; i++) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 9.6K bytes - Viewed (0)