- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 14 for myproduct (0.15 sec)
-
tensorflow/c/eager/c_api_test.cc
ASSERT_EQ(TF_OK, TF_GetCode(status)) << TF_Message(status); float product[4] = {0}; EXPECT_EQ(sizeof(product), TF_TensorByteSize(t)); memcpy(&product[0], TF_TensorData(t), TF_TensorByteSize(t)); TF_DeleteTensor(t); EXPECT_EQ(7, product[0]); EXPECT_EQ(10, product[1]); EXPECT_EQ(15, product[2]); EXPECT_EQ(22, product[3]); TF_DeleteStatus(status); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Aug 03 20:50:20 UTC 2023 - 94.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* } * }</pre> * * <p>Note that if any input set is empty, the Cartesian product will also be empty. If no sets at * all are provided (an empty list), the resulting Cartesian product has one element, an empty * list (counter-intuitive, but mathematically consistent). * * <p><i>Performance notes:</i> while the cartesian product of sets of size {@code m, n, p} is a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 77.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Sets.java
* } * }</pre> * * <p>Note that if any input set is empty, the Cartesian product will also be empty. If no sets at * all are provided (an empty list), the resulting Cartesian product has one element, an empty * list (counter-intuitive, but mathematically consistent). * * <p><i>Performance notes:</i> while the cartesian product of sets of size {@code m, n, p} is a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 78.8K bytes - Viewed (0) -
tensorflow/cc/gradients/math_grad.cc
if (is_batch == false) { a = ConjugateHelper(scope, a); b = ConjugateHelper(scope, b); } auto product = op.output(0); bool ta; bool tb; TF_RETURN_IF_ERROR(GetNodeAttr(product.node()->attrs(), attr_adj_x, &ta)); TF_RETURN_IF_ERROR(GetNodeAttr(product.node()->attrs(), attr_adj_y, &tb)); if (!ta && !tb) { return MatMulGradHelper(scope, is_batch, grad_inputs[0], false, b, true,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Aug 25 18:20:20 UTC 2023 - 50.7K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/jvm/java_testing.adoc
include::sample[dir="snippets/testing/testReport/kotlin",files="buildSrc/src/main/kotlin/myproject.java-conventions.gradle.kts[tags=test-report];build.gradle.kts[tags=test-report]"] include::sample[dir="snippets/testing/testReport/groovy",files="buildSrc/src/main/groovy/myproject.java-conventions.gradle[tags=test-report];build.gradle[tags=test-report]"] ====
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Mar 29 16:24:12 UTC 2024 - 53.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/lower_tf.cc
const int64_t batch_size = input_shape[0]; // Compute the product of the block_shape values. int64_t block_num_elems = 1; for (auto val : block_shape.getValues<APInt>()) { block_num_elems *= val.getSExtValue(); } if (block_num_elems <= 0) { op.emitOpError() << "The product of the block dimensions must be positive"; return failure(); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 74.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
fail(); } catch (IllegalArgumentException expected) { } } /** The 0-ary cartesian product is a single empty list. */ public void testCartesianProduct_zeroary() { assertThat(Sets.cartesianProduct()).containsExactly(list()); } /** A unary cartesian product is one list of size 1 for each element in the input set. */ public void testCartesianProduct_unary() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 49.2K bytes - Viewed (0) -
src/regexp/syntax/parse.go
if p.size == nil { // We haven't started tracking size yet. // Do a relatively cheap check to see if we need to start. // Maintain the product of all the repeats we've seen // and don't track if the total number of regexp nodes // we've seen times the repeat product is in budget. if p.repeats == 0 { p.repeats = 1 } if re.Op == OpRepeat { n := re.Max if n == -1 { n = re.Min }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 13:59:01 UTC 2024 - 52.1K bytes - Viewed (0) -
testing/performance/src/templates/native-dependents-resources/googleTest/libs/googleTest/1.7.0/include/gtest/gtest-param-test.h
# if GTEST_HAS_COMBINE // Combine() allows the user to combine two or more sequences to produce // values of a Cartesian product of those sequences' elements. // // Synopsis: // Combine(gen1, gen2, ..., genN) // - returns a generator producing sequences with elements coming from // the Cartesian product of elements from the sequences generated by // gen1, gen2, ..., genN. The sequence elements will have a type of
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 74.1K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/api/kotlin_dsl.adoc
.Changing the JVM target using toolchains ==== include::sample[dir="samples/java/jvm-multi-project-with-toolchains/kotlin/",files="buildSrc/src/main/kotlin/myproject.java-conventions.gradle.kts[tags=toolchain]"] include::sample[dir="samples/java/jvm-multi-project-with-toolchains/groovy/",files="buildSrc/src/main/groovy/myproject.java-conventions.gradle[tags=toolchain]"] ==== [[sec:kotlin]] == The embedded Kotlin
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Apr 22 20:16:10 UTC 2024 - 55.4K bytes - Viewed (0)