| /external/libcxx/test/re/re.results/re.results.nonmember/ |
| equal.pass.cpp | 16 // operator==(const match_results<BidirectionalIterator, Allocator>& m1,
21 // operator!=(const match_results<BidirectionalIterator, Allocator>& m1,
30 std::match_results<const char*> m1; local
32 assert(std::regex_search(s, m1, std::regex("cd((e)fg)hi")));
35 assert(m1 == m1);
36 assert(m1 != m2);
38 m2 = m1;
40 assert(m1 == m2);
|
| /external/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.mutex.requirements.mutex/thread.mutex.class/ |
| assign.fail.cpp | 21 std::mutex m1; local
22 m1 = m0;
|
| /external/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.mutex.requirements.mutex/thread.mutex.recursive/ |
| assign.fail.cpp | 21 std::recursive_mutex m1; local
22 m1 = m0;
|
| /external/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.timedmutex.requirements/thread.timedmutex.class/ |
| assign.fail.cpp | 21 std::timed_mutex m1; local
22 m1 = m0;
|
| /external/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.timedmutex.requirements/thread.timedmutex.recursive/ |
| assign.fail.cpp | 21 std::recursive_timed_mutex m1; local
22 m1 = m0;
|
| /external/clang/test/CodeGen/ |
| 3dnow-builtins.c | 8 __m64 test_m_pavgusb(__m64 m1, __m64 m2) {
11 return _m_pavgusb(m1, m2);
20 __m64 test_m_pfacc(__m64 m1, __m64 m2) {
23 return _m_pfacc(m1, m2);
26 __m64 test_m_pfadd(__m64 m1, __m64 m2) {
29 return _m_pfadd(m1, m2);
32 __m64 test_m_pfcmpeq(__m64 m1, __m64 m2) {
35 return _m_pfcmpeq(m1, m2);
38 __m64 test_m_pfcmpge(__m64 m1, __m64 m2) {
41 return _m_pfcmpge(m1, m2)
[all...] |
| /external/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.sharedtimedmutex.requirements/thread.sharedtimedmutex.class/ |
| assign.fail.cpp | 22 std::shared_timed_mutex m1; local
23 m1 = m0;
|
| /external/eigen/test/eigen2/ |
| eigen2_linearstructure.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local
37 VERIFY_IS_APPROX(-(-m1), m1);
38 VERIFY_IS_APPROX(m1+m1, 2*m1);
39 VERIFY_IS_APPROX(m1+m2-m1, m2);
40 VERIFY_IS_APPROX(-m2+m1+m2, m1);
[all...] |
| eigen2_inverse.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local
31 while(ei_abs(m1.determinant()) < RealScalar(0.1) && rows <= 8)
33 m1 = MatrixType::Random(rows, cols);
36 m2 = m1.inverse();
37 VERIFY_IS_APPROX(m1, m2.inverse() );
39 m1.computeInverse(&m2);
40 VERIFY_IS_APPROX(m1, m2.inverse() );
44 VERIFY_IS_APPROX(identity, m1.inverse() * m1 );
45 VERIFY_IS_APPROX(identity, m1 * m1.inverse() )
[all...] |
| eigen2_array.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local
34 VERIFY_IS_APPROX(m1.cwise() + s1, s1 + m1.cwise());
35 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
36 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
37 m3 = m1;
39 VERIFY_IS_APPROX(m3, m1.cwise() + s2)
64 MatrixType m1 = MatrixType::Random(rows, cols), local
[all...] |
| eigen2_cwiseop.cpp | 31 MatrixType m1 = MatrixType::Random(rows, cols), local
79 VERIFY_IS_APPROX(m1.cwise().pow(2), m1.cwise().abs2());
80 VERIFY_IS_APPROX(m1.cwise().pow(2), m1.cwise().square());
81 VERIFY_IS_APPROX(m1.cwise().pow(3), m1.cwise().cube());
83 VERIFY_IS_APPROX(m1 + mones, m1.cwise()+Scalar(1));
84 VERIFY_IS_APPROX(m1 - mones, m1.cwise()-Scalar(1))
[all...] |
| /external/eigen/test/ |
| linearstructure.cpp | 26 MatrixType m1 = MatrixType::Random(rows, cols), local
36 VERIFY_IS_APPROX(-(-m1), m1);
37 VERIFY_IS_APPROX(m1+m1, 2*m1);
38 VERIFY_IS_APPROX(m1+m2-m1, m2);
39 VERIFY_IS_APPROX(-m2+m1+m2, m1);
[all...] |
| array.cpp | 22 ArrayType m1 = ArrayType::Random(rows, cols), local
33 VERIFY_IS_APPROX(m1 + s1, s1 + m1);
34 VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1);
35 VERIFY_IS_APPROX(s1 - m1, (-m1)+s1 );
36 VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1));
37 VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1)
99 ArrayType m1 = ArrayType::Random(rows, cols), local
163 ArrayType m1 = ArrayType::Random(rows, cols), local
184 VERIFY_IS_APPROX(numext::real(m1), m1); local
225 ArrayType m1 = ArrayType::Random(rows, cols), local
244 ArrayType m1 = ArrayType::Random(rows, cols); local
[all...] |
| integer_types.cpp | 30 MatrixType m1(rows, cols),
35 m1 = MatrixType::Random(rows, cols);
36 } while(m1 == mzero || m1 == m2);
45 VERIFY_IS_EQUAL(-(-m1), m1);
46 VERIFY_IS_EQUAL(-m2+m1+m2, m1);
47 VERIFY_IS_EQUAL((-m1+m2)*s1, -s1*m1+s1*m2)
[all...] |
| eigen2support.cpp | 22 MatrixType m1 = MatrixType::Random(rows, cols), local
29 VERIFY_IS_APPROX(m1.cwise() + s1, s1 + m1.cwise());
30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
32 m3 = m1;
34 VERIFY_IS_APPROX(m3, m1.cwise() + s2)
[all...] |
| cwiseop.cpp | 33 cwiseops_real_only(MatrixType& m1, MatrixType& m2, MatrixType& m3, MatrixType& mones)
38 VERIFY_IS_APPROX(m1.cwise() / m2, m1.cwise() * (m2.cwise().inverse()));
39 m3 = m1.cwise().abs().cwise().sqrt();
40 VERIFY_IS_APPROX(m3.cwise().square(), m1.cwise().abs());
41 VERIFY_IS_APPROX(m1.cwise().square().cwise().sqrt(), m1.cwise().abs());
42 VERIFY_IS_APPROX(m1.cwise().abs().cwise().log().cwise().exp() , m1.cwise().abs());
44 VERIFY_IS_APPROX(m1.cwise().pow(2), m1.cwise().square())
75 MatrixType m1 = MatrixType::Random(rows, cols), local
[all...] |
| product_extra.cpp | 24 MatrixType m1 = MatrixType::Random(rows, cols), local
35 OtherMajorMatrixType tm1 = m1;
41 VERIFY_IS_APPROX(m3.noalias() = m1 * m2.adjoint(), m1 * m2.adjoint().eval());
42 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * square.adjoint(), m1.adjoint().eval() * square.adjoint().eval());
43 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * m2, m1.adjoint().eval() * m2);
44 VERIFY_IS_APPROX(m3.noalias() = (s1 * m1.adjoint()) * m2, (s1 * m1.adjoint()).eval() * m2)
[all...] |
| inverse.cpp | 26 MatrixType m1(rows, cols),
29 createRandomPIMatrixOfRank(rows,rows,rows,m1);
30 m2 = m1.inverse();
31 VERIFY_IS_APPROX(m1, m2.inverse() );
35 VERIFY_IS_APPROX(identity, m1.inverse() * m1 );
36 VERIFY_IS_APPROX(identity, m1 * m1.inverse() );
38 VERIFY_IS_APPROX(m1, m1.inverse().inverse() )
[all...] |
| /external/clang/test/PCH/ |
| changed-files.c | 2 int s1 = m1;
24 // RUN: echo "#define m1 'abcd'" >> %t.h
|
| /external/eigen/doc/snippets/ |
| MatrixBase_set.cpp | 1 Matrix3i m1; variable
2 m1 << 1, 2, 3,
5 cout << m1 << endl << endl;
12 v1, m1.block(1,1,2,2);
|
| IOFormat.cpp | 2 Matrix3d m1; variable
3 m1 << 1.111111, 2, 3.33333, 4, 5, 6, 7, 8.888888, 9;
10 std::cout << m1 << sep;
11 std::cout << m1.format(CommaInitFmt) << sep;
12 std::cout << m1.format(CleanFmt) << sep;
13 std::cout << m1.format(OctaveFmt) << sep;
14 std::cout << m1.format(HeavyFmt) << sep;
|
| /external/libcxx/test/re/re.results/re.results.swap/ |
| member_swap.pass.cpp | 22 std::match_results<const char*> m1; local
24 assert(std::regex_search(s, m1, std::regex("cd((e)fg)hi")));
27 std::match_results<const char*> m1_save = m1;
30 m1.swap(m2);
32 assert(m1 == m2_save);
|
| non_member_swap.pass.cpp | 15 // void swap(match_results<BidirectionalIterator, Allocator>& m1,
24 std::match_results<const char*> m1; local
26 assert(std::regex_search(s, m1, std::regex("cd((e)fg)hi")));
29 std::match_results<const char*> m1_save = m1;
32 swap(m1, m2);
34 assert(m1 == m2_save);
|
| /external/chromium_org/third_party/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...] |
| /external/libcxx/test/containers/associative/map/map.special/ |
| member_swap.pass.cpp | 33 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
35 M m1_save = m1;
37 m1.swap(m2);
38 assert(m1 == m2_save);
56 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
58 M m1_save = m1;
60 m1.swap(m2);
61 assert(m1 == m2_save);
75 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0]));
77 M m1_save = m1;
[all...] |
