| /external/eigen/test/ |
| product_extra.cpp | 25 MatrixType m1 = MatrixType::Random(rows, cols), local
36 OtherMajorMatrixType tm1 = m1;
42 VERIFY_IS_APPROX(m3.noalias() = m1 * m2.adjoint(), m1 * m2.adjoint().eval());
43 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * square.adjoint(), m1.adjoint().eval() * square.adjoint().eval());
44 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * m2, m1.adjoint().eval() * m2);
45 VERIFY_IS_APPROX(m3.noalias() = (s1 * m1.adjoint()) * m2, (s1 * m1.adjoint()).eval() * m2)
[all...] |
| inverse.cpp | 27 MatrixType m1(rows, cols),
30 createRandomPIMatrixOfRank(rows,rows,rows,m1);
31 m2 = m1.inverse();
32 VERIFY_IS_APPROX(m1, m2.inverse() );
36 VERIFY_IS_APPROX(identity, m1.inverse() * m1 );
37 VERIFY_IS_APPROX(identity, m1 * m1.inverse() );
39 VERIFY_IS_APPROX(m1, m1.inverse().inverse() )
[all...] |
| vectorwiseop.cpp | 27 ArrayType m1 = ArrayType::Random(rows, cols), local
36 m2 = m1;
38 VERIFY_IS_APPROX(m2, m1.colwise() + colvec);
39 VERIFY_IS_APPROX(m2.col(c), m1.col(c) + colvec);
42 VERIFY_RAISES_ASSERT(m1.colwise() + colvec.transpose());
44 m2 = m1;
46 VERIFY_IS_APPROX(m2, m1.rowwise() + rowvec);
47 VERIFY_IS_APPROX(m2.row(r), m1.row(r) + rowvec);
50 VERIFY_RAISES_ASSERT(m1.rowwise() + rowvec.transpose());
54 m2 = m1;
120 MatrixType m1 = MatrixType::Random(rows, cols), local
[all...] |
| array_for_matrix.cpp | 23 MatrixType m1 = MatrixType::Random(rows, cols), local
34 VERIFY_IS_APPROX(m1.array() + s1, s1 + m1.array());
35 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1);
36 VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,s2) );
37 m3 = m1;
39 VERIFY_IS_APPROX(m3, (m1.array() + s2).matrix())
87 MatrixType m1 = MatrixType::Random(rows, cols), local
152 MatrixType m1 = MatrixType::Random(rows, cols); local
[all...] |
| nomalloc.cpp | 38 MatrixType m1 = MatrixType::Random(rows, cols), local
47 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2);
48 VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c)));
49 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), (m1.array()*m1.array()).matrix());
50 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2))
[all...] |
| product.h | 14 bool areNotApprox(const MatrixBase<Derived1>& m1, const MatrixBase<Derived2>& m2, typename Derived1::RealScalar epsilon = NumTraits<typename Derived1::RealScalar>::dummy_precision())
16 return !((m1-m2).cwiseAbs2().maxCoeff() < epsilon * epsilon
17 * (std::max)(m1.cwiseAbs2().maxCoeff(), m2.cwiseAbs2().maxCoeff()));
40 MatrixType m1 = MatrixType::Random(rows, cols), local
52 OtherMajorMatrixType tm1 = m1;
62 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
63 m3 = m1;
[all...] |
| /external/skia/tests/ |
| MetaDataTest.cpp | 38 SkMetaData m1; local
40 REPORTER_ASSERT(reporter, !m1.findS32("int"));
41 REPORTER_ASSERT(reporter, !m1.findScalar("scalar"));
42 REPORTER_ASSERT(reporter, !m1.findString("hello"));
43 REPORTER_ASSERT(reporter, !m1.removeS32("int"));
44 REPORTER_ASSERT(reporter, !m1.removeScalar("scalar"));
45 REPORTER_ASSERT(reporter, !m1.removeString("hello"));
46 REPORTER_ASSERT(reporter, !m1.removeString("true"));
47 REPORTER_ASSERT(reporter, !m1.removeString("false"));
49 m1.setS32("int", 12345)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/diagnostics/syserr/syserr.errcat/syserr.errcat.objects/ |
| generic_category.pass.cpp | 23 std::string m1 = e_cat1.name(); local
24 assert(m1 == "generic");
|
| /ndk/sources/cxx-stl/llvm-libc++/test/input.output/iostreams.base/std.ios.manip/error.reporting/ |
| iostream_category.pass.cpp | 21 std::string m1 = e_cat1.name(); local
22 assert(m1 == "iostream");
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/map/map.special/ |
| member_swap.pass.cpp | 30 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
32 M m1_save = m1;
34 m1.swap(m2);
35 assert(m1 == m2_save);
53 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
55 M m1_save = m1;
57 m1.swap(m2);
58 assert(m1 == m2_save);
72 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
74 M m1_save = m1;
[all...] |
| non_member_swap.pass.cpp | 34 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
36 M m1_save = m1;
38 swap(m1, m2);
39 assert(m1 == m2_save);
57 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
59 M m1_save = m1;
61 swap(m1, m2);
62 assert(m1 == m2_save);
76 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
78 M m1_save = m1;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multimap/multimap.special/ |
| member_swap.pass.cpp | 30 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
32 M m1_save = m1;
34 m1.swap(m2);
35 assert(m1 == m2_save);
53 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
55 M m1_save = m1;
57 m1.swap(m2);
58 assert(m1 == m2_save);
72 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
74 M m1_save = m1;
[all...] |
| non_member_swap.pass.cpp | 34 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
36 M m1_save = m1;
38 swap(m1, m2);
39 assert(m1 == m2_save);
57 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
59 M m1_save = m1;
61 swap(m1, m2);
62 assert(m1 == m2_save);
76 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
78 M m1_save = m1;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multiset/multiset.special/ |
| member_swap.pass.cpp | 30 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
32 M m1_save = m1;
34 m1.swap(m2);
35 assert(m1 == m2_save);
53 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
55 M m1_save = m1;
57 m1.swap(m2);
58 assert(m1 == m2_save);
72 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
74 M m1_save = m1;
[all...] |
| non_member_swap.pass.cpp | 32 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
34 M m1_save = m1;
36 swap(m1, m2);
37 assert(m1 == m2_save);
55 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
57 M m1_save = m1;
59 swap(m1, m2);
60 assert(m1 == m2_save);
74 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
76 M m1_save = m1;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/set/set.special/ |
| member_swap.pass.cpp | 30 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
32 M m1_save = m1;
34 m1.swap(m2);
35 assert(m1 == m2_save);
53 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
55 M m1_save = m1;
57 m1.swap(m2);
58 assert(m1 == m2_save);
72 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
74 M m1_save = m1;
[all...] |
| non_member_swap.pass.cpp | 32 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
34 M m1_save = m1;
36 swap(m1, m2);
37 assert(m1 == m2_save);
55 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
57 M m1_save = m1;
59 swap(m1, m2);
60 assert(m1 == m2_save);
74 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
76 M m1_save = m1;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/thread/thread.mutex/thread.mutex.requirements/thread.mutex.requirements.mutex/thread.mutex.class/ |
| copy.fail.cpp | 21 std::mutex m1(m0);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/thread/thread.mutex/thread.mutex.requirements/thread.mutex.requirements.mutex/thread.mutex.recursive/ |
| copy.fail.cpp | 21 std::recursive_mutex m1(m0);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/thread/thread.mutex/thread.mutex.requirements/thread.timedmutex.requirements/thread.timedmutex.class/ |
| copy.fail.cpp | 21 std::timed_mutex m1(m0);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/thread/thread.mutex/thread.mutex.requirements/thread.timedmutex.requirements/thread.timedmutex.recursive/ |
| copy.fail.cpp | 21 std::recursive_timed_mutex m1(m0);
|
| /external/eigen/doc/examples/ |
| class_CwiseUnaryOp_ptrfun.cpp | 17 Matrix4d m1 = Matrix4d::Random(); local
18 cout << m1 << endl << "becomes: " << endl << m1.unaryExpr(ptr_fun(ramp)) << endl;
|
| /external/eigen/doc/snippets/ |
| Tutorial_Map_using.cpp | 6 MatrixType m1(n_dims), m2(n_dims);
7 m1.setRandom();
13 cout << "m1: " << m1 << endl;
15 cout << "Squared euclidean distance: " << (m1-m2).squaredNorm() << endl;
17 (m1-m2map).squaredNorm() << endl;
|
| /external/eigen/test/eigen2/ |
| product.h | 15 bool areNotApprox(const MatrixBase<Derived1>& m1, const MatrixBase<Derived2>& m2, typename Derived1::RealScalar epsilon = precision<typename Derived1::RealScalar>())
17 return !((m1-m2).cwise().abs2().maxCoeff() < epsilon * epsilon
18 * std::max(m1.cwise().abs2().maxCoeff(), m2.cwise().abs2().maxCoeff()));
41 MatrixType m1 = MatrixType::Random(rows, cols), local
56 OtherMajorMatrixType tm1 = m1;
66 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
67 m3 = m1;
[all...] |
| eigen2_swap.cpp | 35 MatrixType m1 = MatrixType::Random(rows,cols); local
39 MatrixType m1_copy = m1;
44 m1.swap(m2);
45 VERIFY_IS_APPROX(m1,m2_copy);
47 m1 = m1_copy;
51 m1.swap(m3);
52 VERIFY_IS_APPROX(m1,m3_copy);
54 m1 = m1_copy;
58 m1.swap(m2.block(0,0,rows,cols));
59 VERIFY_IS_APPROX(m1,m2_copy)
[all...] |
