/external/eigen/doc/examples/ |
H A D | Tutorial_simple_example_fixed_size.cpp | 8 Matrix3f m3; local 9 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; 13 std::cout << "m3\n" << m3 << "\nm4:\n"
|
/external/libcxx/test/std/diagnostics/syserr/syserr.errcat/syserr.errcat.derived/ |
H A D | message.pass.cpp | 28 std::string m3 = e_cat2.message(6); local 31 assert(!m3.empty()); 33 assert(m1 != m3);
|
/external/testng/src/test/java/test/tmp/ |
H A D | Tn.java | 20 public void m3(String param) { method in class:Tn
|
/external/clang/test/CodeGenCXX/ |
H A D | attr-disable-tail-calls.cpp | 7 int m3() { return 3; } function in class:B 21 t += b->m1() + b->m2() + b->m3() + b->m4();
|
/external/eigen/doc/ |
H A D | tutorial.cpp | 8 Eigen::Matrix3f m3 = Eigen::Matrix3f::Random(); local 11 std::cout << "*** Step 1 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; 15 m3.diagonal().setOnes(); 17 std::cout << "*** Step 2 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; 20 m4.block<3,3>(0,1) = m3; 21 m3.row(2) = m4.block<1,3>(2,0); 23 std::cout << "*** Step 3 ***\nm3:\n" << m3 << "\nm4:\n" << m4 << std::endl; 39 m3 = m3.cwise().cos(); 40 std::cout << "*** Step 6 ***\nm3:\n" << m3 << "\nm [all...] |
/external/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.guard/ |
H A D | variadic_adopt_lock.pass.cpp | 53 TestMutex m1, m2, m3; local 55 m1.lock(); m2.lock(); m3.lock(); 57 LG lg(m1, m2, m3, std::adopt_lock); 58 assert(m1.locked && m2.locked && m3.locked); 60 assert(!m1.locked && !m2.locked && !m3.locked);
|
/external/skia/tests/ |
H A D | MessageBusTest.cpp | 35 const TestMessage m3 = { 1, 0.3f }; local 36 SkMessageBus<TestMessage>::Post(m3);
|
/external/clang/test/Lexer/ |
H A D | constants.c | 36 int m3 = '\\\ variable
|
/external/eigen/bench/ |
H A D | sparse_transpose.cpp | 52 DenseMatrix m1(rows,cols), m3(rows,cols); 54 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1.transpose();) 70 cs *m1, *m3; local 73 BENCH(for (int k=0; k<REPEAT; ++k) { m3 = cs_transpose(m1,1); cs_spfree(m3);}) 82 GmmSparse m1(rows,cols), m3(rows,cols); 84 BENCH(for (int k=0; k<REPEAT; ++k) gmm::copy(gmm::transposed(m1),m3);) 92 MtlSparse m1(rows,cols), m3(rows,cols); 94 BENCH(for (int k=0; k<REPEAT; ++k) m3 = trans(m1);)
|
H A D | sparse_product.cpp | 119 DenseMatrix m1(rows,cols), m2(rows,cols), m3(rows,cols); 126 m3 = m1 * m2; 133 m3 = m1.transpose() * m2; 140 m3 = m1.transpose() * m2.transpose(); 147 m3 = m1 * m2.transpose(); 188 DynamicSparseMatrix<Scalar> m1(sm1), m2(sm2), m3(sm3); 194 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1 * m2;) 207 BENCH(for (int k=0; k<REPEAT; ++k) m3 = m1.transpose() * m2;) 213 BENCH( for (int k=0; k<REPEAT; ++k) m3 = m1.transpose() * m2.transpose(); ) 219 BENCH( for (int k=0; k<REPEAT; ++k) m3 228 cs *m1, *m2, *m3; local [all...] |
/external/eigen/test/ |
H A D | inverse.cpp | 65 MatrixType m3 = v3*v3.transpose(), m4(rows,cols); local 66 m3.computeInverseAndDetWithCheck(m4, det, invertible); 68 VERIFY_IS_MUCH_SMALLER_THAN(abs(det-m3.determinant()), RealScalar(1)); 69 m3.computeInverseWithCheck(m4, invertible);
|
H A D | commainitializer.cpp | 70 Matrix3d m3; local 73 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8) ); 76 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9, 10) ); 82 m3 = Matrix3d::Random(); 83 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; 84 VERIFY_IS_APPROX(m3, ref ); 90 m3 = Matrix3d::Random(); 91 m3 << vec[0], vec[1], vec[2]; 92 VERIFY_IS_APPROX(m3, ref); 97 m3 [all...] |
H A D | linearstructure.cpp | 33 m3(rows, cols); 48 m3 = m2; m3 += m1; 49 VERIFY_IS_APPROX(m3, m1+m2); 50 m3 = m2; m3 -= m1; 51 VERIFY_IS_APPROX(m3, m2-m1); 52 m3 = m2; m3 *= s1; 53 VERIFY_IS_APPROX(m3, s 139 Matrix4d m2, m3; local [all...] |
H A D | product_symm.cpp | 25 m2 = MatrixType::Random(rows, cols), m3; local 37 m3 = m2.template selfadjointView<Lower>(); 38 VERIFY_IS_EQUAL(m1, m3); 61 m3 = m2.template selfadjointView<Upper>(); 62 VERIFY_IS_EQUAL(m1, m3);
|
H A D | swap.cpp | 37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols); local 41 OtherMatrixType m3_copy = m3; 57 m1.swap(m3); 59 VERIFY_IS_APPROX(m3,m1_copy); 61 m3 = m3_copy; 71 m1.transpose().swap(m3.transpose()); 73 VERIFY_IS_APPROX(m3,m1_copy); 75 m3 = m3_copy;
|
H A D | product_selfadjoint.cpp | 26 m3; local 57 m3 = m1; 58 m3.block(1,1,rows-1,cols-1) += v1.tail(rows-1) * v2.head(cols-1).adjoint()+ v2.head(cols-1) * v1.tail(rows-1).adjoint(); 59 VERIFY_IS_APPROX(m2, m3.template triangularView<Lower>().toDenseMatrix());
|
/external/testng/src/test/java/test/dependent/ |
H A D | ImplicitGroupInclusion2SampleTest.java | 27 public void m3() { method in class:ImplicitGroupInclusion2SampleTest
|
H A D | ImplicitGroupInclusion4SampleTest.java | 27 public void m3() { method in class:ImplicitGroupInclusion4SampleTest 31 @Test (groups = {"g2"}, dependsOnMethods="m3")
|
/external/testng/src/test/java/test/thread/ |
H A D | TrueParallelSampleTest.java | 30 public void m3() { method in class:TrueParallelSampleTest 31 log("m3");
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/moment/ |
H A D | ThirdMoment.java | 53 protected double m3; field in class:ThirdMoment 67 m3 = Double.NaN; 87 m3 = m2 = m1 = 0.0; 94 m3 = m3 - 3.0 * nDev * prevM2 + (n0 - 1) * (n0 - 2) * nDevSq * dev; 102 return m3; 111 m3 = Double.NaN; 135 dest.m3 = source.m3;
|
H A D | Skewness.java | 67 * @param m3 external moment 69 public Skewness(final ThirdMoment m3) { argument 71 this.moment = m3; 112 return (n0 * moment.m3) /
|
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
H A D | p12.cpp | 67 auto m3 = [this,m] { // expected-note 3{{lambda expression begins here}} local
|
/external/clang/test/Preprocessor/ |
H A D | pragma_diagnostic_sections.cpp | 12 void m3() { int b; while (b==b); } // expected-warning {{always evaluates to true}} function in struct:S
|
/external/jacoco/org.jacoco.core.test/src/org/jacoco/core/test/perf/targets/ |
H A D | Target01.java | 45 m3(); 46 m3(); 47 m3(); 48 m3(); 53 public void m3() { method in class:Target01
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
H A D | AbstractWell.java | 60 /** Index indirection table giving for each index the value index + m3 taking table size into account. */ 69 * @param m3 third parameter of the algorithm 71 protected AbstractWell(final int k, final int m1, final int m2, final int m3) { argument 72 this(k, m1, m2, m3, System.currentTimeMillis()); 79 * @param m3 third parameter of the algorithm 82 protected AbstractWell(final int k, final int m1, final int m2, final int m3, final int seed) { argument 83 this(k, m1, m2, m3, new int[] { seed }); 90 * @param m3 third parameter of the algorithm 94 protected AbstractWell(final int k, final int m1, final int m2, final int m3, final int[] seed) { argument 116 i3[j] = (j + m3) 131 AbstractWell(final int k, final int m1, final int m2, final int m3, final long seed) argument [all...] |