/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/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/eigen/test/ |
H A D | selfadjoint.cpp | 25 m3(rows, cols), 31 m3 = m1.template selfadjointView<Upper>(); 32 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangularView<Upper>())); 33 VERIFY_IS_APPROX(m3, m3.adjoint()); 35 m3 = m1.template selfadjointView<Lower>(); 36 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>())); 37 VERIFY_IS_APPROX(m3, m3.adjoint()); 39 m3 [all...] |
H A D | product_notemporary.cpp | 31 m3(rows, cols); 45 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1); 46 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()).transpose(), 1); 47 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0); 49 VERIFY_EVALUATION_COUNT( m3 = s1 * (m1 * m2.transpose()), 1); 50 // VERIFY_EVALUATION_COUNT( m3 = m3 + s1 * (m1 * m2.transpose()), 1); 51 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0); 53 VERIFY_EVALUATION_COUNT( m3 = m3 [all...] |
H A D | product_trmv.cpp | 25 m3(rows, cols); 33 m3 = m1.template triangularView<Eigen::Lower>(); 34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps)); 35 m3 = m1.template triangularView<Eigen::Upper>(); 36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps)); 37 m3 = m1.template triangularView<Eigen::UnitLower>(); 38 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps)); 39 m3 = m1.template triangularView<Eigen::UnitUpper>(); 40 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitUpper>() * v1, largerEps)); 43 m3 [all...] |
H A D | lu.cpp | 61 MatrixType m1(rows, cols), m3(rows, cols2); 95 m3 = m1*m2; 98 m2.block(0,0,m2.rows(),m2.cols()) = lu.solve(m3); 99 VERIFY_IS_APPROX(m3, m1*m2); 102 m3 = MatrixType::Random(rows,cols2); 103 m2 = m1.transpose()*m3; 104 m3 = MatrixType::Random(rows,cols2); 105 lu.template _solve_impl_transposed<false>(m2, m3); 106 VERIFY_IS_APPROX(m2, m1.transpose()*m3); 107 m3 [all...] |
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 | triangular.cpp | 27 m3(rows, cols), 55 m3 = m2.transpose() + m2; 56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1); 61 VERIFY_IS_APPROX(m3.template triangularView<Lower>().toDenseMatrix(), m1); 63 VERIFY_IS_APPROX(m3.template triangularView<Lower>().conjugate().toDenseMatrix(), 64 m3.conjugate().template triangularView<Lower>().toDenseMatrix()); 72 m3 = m1.template triangularView<Upper>(); 73 VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), largerEps)); 74 m3 = m1.template triangularView<Lower>(); 75 VERIFY(v2.isApprox(m3 [all...] |
/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;
|
/external/llvm/test/MC/ARM/ |
H A D | cpu-test.s | 14 // CHECK: .cpu cortex-m3 15 .cpu cortex-m3
|
/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/libvpx/libvpx/vpx_dsp/x86/ |
H A D | highbd_sad4d_sse2.asm | 28 mova m3, m0 30 psubusw m3, m4 34 por m4, m3 38 mova m3, m0 40 psubusw m3, m6 44 por m6, m3 52 mova m3, m0 53 psubusw m3, m2 55 por m2, m3 60 mova m3, m [all...] |
H A D | fwd_txfm_ssse3_x86_64.asm | 43 mova m3, [inputq + r3] 55 psllw m3, 2 72 paddw m6, m3, m4 73 psubw m3, m4 113 paddw m9, m3, m1 114 psubw m3, m1 139 punpcklwd m11, m0, m3 140 punpckhwd m0, m3 143 pmaddwd m3, m0, [pw_9102_13623] 147 paddd m3, m [all...] |
/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...] |
/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/icu/icu4j/perf-tests/ |
H A D | rbbiperf_r.pl | 34 my $m3 = "line"; 74 "TestNextLine", ["$jvm1 testRBBINext $m3", "$jvm2 testRBBINext $m3"], 79 "TestPreviousLine", ["$jvm1 testRBBIPrevious $m3", "$jvm2 testRBBIPrevious $m3"], 84 "TestIsBoundaryLine", ["$jvm1 testRBBIIsBoundary $m3", "$jvm2 testRBBIIsBoundary $m3"],
|
/external/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.guard/ |
H A D | variadic_mutex.pass.cpp | 85 TestMutex m1, m2, m3; 87 LG lg(m1, m2, m3); 88 assert(m1.locked && m2.locked && m3.locked); 90 assert(!m1.locked && !m2.locked && !m3.locked); 107 MT m1, m2, m3; 110 LG lg(m1, m2, m3); 113 assert(!m1.locked && !m2.locked && !m3.locked);
|
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/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);)
|
/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/libcxx/test/std/containers/associative/map/map.cons/ |
H A D | move_assign.pass.cpp | 60 M m3(C(3), A(7)); 61 m3 = std::move(m1); 62 assert(m3 == m2); 63 assert(m3.get_allocator() == A(7)); 64 assert(m3.key_comp() == C(5)); 100 M m3(C(3), A(5)); 101 m3 = std::move(m1); 102 assert(m3 == m2); 103 assert(m3.get_allocator() == A(5)); 104 assert(m3 [all...] |
/external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
H A D | move_assign.pass.cpp | 60 M m3(C(3), A(7)); 61 m3 = std::move(m1); 62 assert(m3 == m2); 63 assert(m3.get_allocator() == A(7)); 64 assert(m3.key_comp() == C(5)); 100 M m3(C(3), A(5)); 101 m3 = std::move(m1); 102 assert(m3 == m2); 103 assert(m3.get_allocator() == A(5)); 104 assert(m3 [all...] |
/external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
H A D | move_assign.pass.cpp | 59 M m3(C(3), A(7)); 60 m3 = std::move(m1); 61 assert(m3 == m2); 62 assert(m3.get_allocator() == A(7)); 63 assert(m3.key_comp() == C(5)); 98 M m3(C(3), A(5)); 99 m3 = std::move(m1); 100 assert(m3 == m2); 101 assert(m3.get_allocator() == A(5)); 102 assert(m3 [all...] |
/external/libcxx/test/std/containers/associative/set/set.cons/ |
H A D | move_assign.pass.cpp | 59 M m3(C(3), A(7)); 60 m3 = std::move(m1); 61 assert(m3 == m2); 62 assert(m3.get_allocator() == A(7)); 63 assert(m3.key_comp() == C(5)); 98 M m3(C(3), A(5)); 99 m3 = std::move(m1); 100 assert(m3 == m2); 101 assert(m3.get_allocator() == A(5)); 102 assert(m3 [all...] |
/external/valgrind/none/tests/s390x/ |
H A D | opcodes.h | 41 #define RIS_RURDI(op1,r1,m3,b4,d4,i2,op2) \ 42 ".short 0x" #op1 #r1 #m3 "\n\t" \ 44 #define RIE_RUPI(op1,r1,m3,i4,i2,op2) \ 45 ".short 0x" #op1 #r1 #m3 "\n\t" \ 47 #define RRS(op1,r1,r2,b4,d4,m3,u0,op2) \ 49 ".long 0x" #b4 #d4 #m3 #u0 #op2 "\n\t" 50 #define RIE_RRPU(op1,r1,r2,i4,m3,u0,op2) \ 52 ".long 0x" #i4 #m3 #u0 #op2 "\n\t" 59 #define RIS_RURDU(op1,r1,m3,b4,d4,i2,op2) \ 60 ".short 0x" #op1 #r1 #m3 "\ [all...] |