| /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 | 33 cwiseops_real_only(MatrixType& m1, MatrixType& m2, MatrixType& m3, MatrixType& mones)
39 m3 = m1.cwise().abs().cwise().sqrt();
40 VERIFY_IS_APPROX(m3.cwise().square(), m1.cwise().abs());
45 m3 = (m1.cwise().abs().cwise()<=RealScalar(0.01)).select(mones,m1);
46 VERIFY_IS_APPROX(m3.cwise().pow(-1), m3.cwise().inverse());
47 m3 = m1.cwise().abs();
48 VERIFY_IS_APPROX(m3.cwise().pow(RealScalar(0.5)), m3.cwise().sqrt());
52 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 | 25 m3(rows, cols),
61 m3 = m2.transpose() * m2;
62 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>().transpose(), m1);
67 VERIFY_IS_APPROX(m3.template part<Eigen::LowerTriangular>(), m1);
69 VERIFY_IS_APPROX(m3.template part<Diagonal>(), m3.diagonal().asDiagonal());
77 m3 = m1.template part<Eigen::LowerTriangular>();
78 VERIFY(m3.template marked<Eigen::LowerTriangular>().solveTriangular(m3).cwise().abs().isIdentity(test_precision<RealScalar>()));
79 VERIFY(m3.transpose().template marked<Eigen::UpperTriangular>(
132 Matrix2i m3 = Matrix2i::Zero(); local
[all...] |
| eigen2_cwiseop.cpp | 33 m3(rows, cols),
52 m3 = MatrixType::Constant(rows, cols, s1);
58 VERIFY_IS_APPROX(m3(i,j), s1);
62 VERIFY(m3.isConstant(s1));
64 VERIFY_IS_APPROX(m4.setConstant(s1), m3);
65 VERIFY_IS_APPROX(m4.setConstant(rows,cols,s1), m3);
71 VERIFY_IS_APPROX(m4, m3);
85 m3 = m1; m3.cwise() += 1;
86 VERIFY_IS_APPROX(m1 + mones, m3);
[all...] |
| eigen2_linearstructure.cpp | 28 m3(rows, cols),
44 m3 = m2; m3 += m1;
45 VERIFY_IS_APPROX(m3, m1+m2);
46 m3 = m2; m3 -= m1;
47 VERIFY_IS_APPROX(m3, m2-m1);
48 m3 = m2; m3 *= s1;
49 VERIFY_IS_APPROX(m3, s1*m2)
[all...] |
| /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/icu/icu4c/source/test/perf/ubrkperf/ |
| UBrkPerf.pl | 32 my $m3 = "-- -m line";
82 "TestForwardLine", ["$p1 $m3 TestICUForward", "$p2 $m3 TestICUForward", "$p3 $m3 TestICUForward"],
87 "TestIsBoundLine", ["$p1 $m3 TestICUIsBound", "$p2 $m3 TestICUIsBound", "$p3 $m3 TestICUIsBound"],
|
| 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/chromium_org/third_party/icu/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/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/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/x86/ |
| vp9_dct_mmx.asm | 17 psubw m3, m2
18 psubw m4, m3
24 paddw m3, m5
28 SWAP 3, 5 ; m3 b1
36 punpcklwd m5, m3
37 punpckhwd m2, m3
39 movq m3, m0
42 punpckldq m3, m2
53 movq m3, [r3q + strideq*2] ;d1
63 psllw m3,
[all...] |
| /external/eigen/bench/ |
| 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/libcxx/test/containers/associative/map/map.cons/ |
| 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.key_comp() == C(5))
[all...] |
| /external/libcxx/test/containers/associative/multimap/multimap.cons/ |
| 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.key_comp() == C(5))
[all...] |
| /external/libcxx/test/containers/associative/multiset/multiset.cons/ |
| 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.key_comp() == C(5))
[all...] |
| /external/libcxx/test/containers/associative/set/set.cons/ |
| 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.key_comp() == C(5))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.cons/ |
| 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.key_comp() == C(5))
[all...] |
