/external/eigen/test/ |
commainitializer.cpp | 14 Matrix3d m3; local 17 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8) ); 20 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9, 10) ); 26 m3 = Matrix3d::Random(); 27 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; 28 VERIFY_IS_APPROX(m3, ref ); 34 m3 = Matrix3d::Random(); 35 m3 << vec[0], vec[1], vec[2]; 36 VERIFY_IS_APPROX(m3, ref); 41 m3 = Matrix3d::Random() [all...] |
selfadjoint.cpp | 24 m3(rows, cols); 29 m3 = m1.template selfadjointView<Upper>(); 30 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangularView<Upper>())); 31 VERIFY_IS_APPROX(m3, m3.adjoint()); 34 m3 = m1.template selfadjointView<Lower>(); 35 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>())); 36 VERIFY_IS_APPROX(m3, m3.adjoint());
|
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 = m1.template triangularView<Eigen::Lower>() [all...] |
product_notemporary.cpp | 46 m3(rows, cols); 60 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1); 61 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0); 63 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0); 65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0); 66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1); 67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0); 68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0); 69 VERIFY_EVALUATION_COUNT( m3.noalias() -= s1 * (m1.transpose() * m2), 0); 71 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block(r0,c0,r1,c1)).adjoint() ), 0 (…) [all...] |
cwiseop.cpp | 35 cwiseops_real_only(MatrixType& m1, MatrixType& m2, MatrixType& m3, MatrixType& mones) 41 m3 = m1.cwise().abs().cwise().sqrt(); 42 VERIFY_IS_APPROX(m3.cwise().square(), m1.cwise().abs()); 47 m3 = (m1.cwise().abs().cwise()<=RealScalar(0.01)).select(mones,m1); 48 VERIFY_IS_APPROX(m3.cwise().pow(-1), m3.cwise().inverse()); 49 m3 = m1.cwise().abs(); 50 VERIFY_IS_APPROX(m3.cwise().pow(RealScalar(0.5)), m3.cwise().sqrt()); 54 m3 = m1 [all...] |
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.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), largerEps)) [all...] |
linearstructure.cpp | 28 m3(rows, cols); 43 m3 = m2; m3 += m1; 44 VERIFY_IS_APPROX(m3, m1+m2); 45 m3 = m2; m3 -= m1; 46 VERIFY_IS_APPROX(m3, m2-m1); 47 m3 = m2; m3 *= s1; 48 VERIFY_IS_APPROX(m3, s1*m2) [all...] |
/external/eigen/test/eigen2/ |
eigen2_commainitializer.cpp | 14 Matrix3d m3; local 17 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8) ); 20 VERIFY_RAISES_ASSERT( (m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9, 10) ); 26 m3 = Matrix3d::Random(); 27 m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9; 28 VERIFY_IS_APPROX(m3, ref ); 34 m3 = Matrix3d::Random(); 35 m3 << vec[0], vec[1], vec[2]; 36 VERIFY_IS_APPROX(m3, ref); 41 m3 = Matrix3d::Random() [all...] |
eigen2_triangular.cpp | 24 m3(rows, cols), 51 m3 = m2.transpose() * m2; 52 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>().transpose(), m1); 57 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>(), m1); 59 VERIFY_IS_APPROX(m3.template part<Diagonal>(), m3.diagonal().asDiagonal()); 67 m3 = m1.template part<Eigen::LowerTriangular>(); 68 VERIFY(m3.template marked<Eigen::LowerTriangular>().solveTriangular(m3).cwise().abs().isIdentity(test_precision<RealScalar>())); 69 VERIFY(m3.transpose().template marked<Eigen::UpperTriangular>( 122 Matrix2i m3 = Matrix2i::Zero(); local [all...] |
eigen2_cwiseop.cpp | 33 m3(rows, cols), 49 m3 = MatrixType::Constant(rows, cols, s1); 55 VERIFY_IS_APPROX(m3(i,j), s1); 59 VERIFY(m3.isConstant(s1)); 61 VERIFY_IS_APPROX(m4.setConstant(s1), m3); 62 VERIFY_IS_APPROX(m4.setConstant(rows,cols,s1), m3); 68 VERIFY_IS_APPROX(m4, m3); 82 m3 = m1; m3.cwise() += 1; 83 VERIFY_IS_APPROX(m1 + mones, m3); [all...] |
eigen2_linearstructure.cpp | 28 m3(rows, cols); 43 m3 = m2; m3 += m1; 44 VERIFY_IS_APPROX(m3, m1+m2); 45 m3 = m2; m3 -= m1; 46 VERIFY_IS_APPROX(m3, m2-m1); 47 m3 = m2; m3 *= s1; 48 VERIFY_IS_APPROX(m3, s1*m2) [all...] |
/external/icu/icu4j/perf-tests/ |
rbbiperf_r.pl | 32 my $m3 = "line"; 72 "TestNextLine", ["$jvm1 testRBBINext $m3", "$jvm2 testRBBINext $m3"], 77 "TestPreviousLine", ["$jvm1 testRBBIPrevious $m3", "$jvm2 testRBBIPrevious $m3"], 82 "TestIsBoundaryLine", ["$jvm1 testRBBIIsBoundary $m3", "$jvm2 testRBBIIsBoundary $m3"],
|
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/arm/ |
ld-sp-warn-cortex-m3.d | 1 # name: Erratum 752419: Warn Loads with writebacks to SP (cortex m3) 2 # as: -mcpu=cortex-m3 4 # error-output: ld-sp-warn-cortex-m3.l
|
/external/eigen/doc/examples/ |
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/ |
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 << "\nm4:\n" << m4 << std::endl [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/moment/ |
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/ |
cpu-test.s | 14 // CHECK: .cpu cortex-m3 15 .cpu cortex-m3
|
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/all/ |
altmacro.s | 13 .macro m3 str 22 m3 "abc" label 23 m3 <"1", "23"> label 35 m3 "!!<>'" label
|
/external/icu/icu4c/source/test/perf/ubrkperf/ |
UBrkPerf_r.pl | 31 my $m3 = "-- -m line"; 84 "TestForwardLine", ["$p1,$m3,TestICUForward", "$p2,$m3,TestICUForward"], 89 "TestIsBoundLine", ["$p1,$m3,TestICUIsBound", "$p2,$m3,TestICUIsBound"],
|
/external/libcxx/test/std/diagnostics/syserr/syserr.errcat/syserr.errcat.derived/ |
message.pass.cpp | 28 std::string m3 = e_cat2.message(6); local 31 assert(!m3.empty()); 33 assert(m1 != m3);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/diagnostics/syserr/syserr.errcat/syserr.errcat.derived/ |
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/ |
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...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
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) { 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) { 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) { 116 i3[j] = (j + m3) % r [all...] |
/external/clang/test/CodeGenCXX/ |
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/libvpx/libvpx/vp9/encoder/x86/ |
vp9_dct_mmx.asm | 20 psubw m3, m2 21 psubw m4, m3 27 paddw m3, m5 31 SWAP 3, 5 ; m3 b1 39 punpcklwd m5, m3 40 punpckhwd m2, m3 42 movq m3, m0 45 punpckldq m3, m2 56 movq m3, [r3q + strideq*2] ;d1 66 psllw m3, [all...] |