Searched refs:m1 (Results 1 - 25 of 378) sorted by relevance

1234567891011>>

/external/libcxx/test/re/re.results/re.results.nonmember/
H A Dequal.pass.cpp16 // 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/
H A Dassign.fail.cpp21 std::mutex m1; local
22 m1 = m0;
/external/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.mutex.requirements.mutex/thread.mutex.recursive/
H A Dassign.fail.cpp21 std::recursive_mutex m1; local
22 m1 = m0;
/external/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.timedmutex.requirements/thread.timedmutex.class/
H A Dassign.fail.cpp21 std::timed_mutex m1; local
22 m1 = m0;
/external/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.timedmutex.requirements/thread.timedmutex.recursive/
H A Dassign.fail.cpp21 std::recursive_timed_mutex m1; local
22 m1 = m0;
/external/clang/test/CodeGen/
H A D3dnow-builtins.c8 __m64 test_m_pavgusb(__m64 m1, __m64 m2) { argument
11 return _m_pavgusb(m1, m2);
20 __m64 test_m_pfacc(__m64 m1, __m64 m2) { argument
23 return _m_pfacc(m1, m2);
26 __m64 test_m_pfadd(__m64 m1, __m64 m2) { argument
29 return _m_pfadd(m1, m2);
32 __m64 test_m_pfcmpeq(__m64 m1, __m64 m2) { argument
35 return _m_pfcmpeq(m1, m2);
38 __m64 test_m_pfcmpge(__m64 m1, __m64 m2) { argument
41 return _m_pfcmpge(m1, m
44 test_m_pfcmpgt(__m64 m1, __m64 m2) argument
50 test_m_pfmax(__m64 m1, __m64 m2) argument
56 test_m_pfmin(__m64 m1, __m64 m2) argument
62 test_m_pfmul(__m64 m1, __m64 m2) argument
74 test_m_pfrcpit1(__m64 m1, __m64 m2) argument
80 test_m_pfrcpit2(__m64 m1, __m64 m2) argument
92 test_m_pfrsqrtit1(__m64 m1, __m64 m2) argument
98 test_m_pfsub(__m64 m1, __m64 m2) argument
104 test_m_pfsubr(__m64 m1, __m64 m2) argument
116 test_m_pmulhrw(__m64 m1, __m64 m2) argument
128 test_m_pfnacc(__m64 m1, __m64 m2) argument
134 test_m_pfpnacc(__m64 m1, __m64 m2) argument
[all...]
/external/libcxx/test/thread/thread.mutex/thread.mutex.requirements/thread.sharedtimedmutex.requirements/thread.sharedtimedmutex.class/
H A Dassign.fail.cpp22 std::shared_timed_mutex m1; local
23 m1 = m0;
/external/eigen/test/eigen2/
H A Deigen2_linearstructure.cpp26 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...]
H A Deigen2_inverse.cpp26 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 * m
[all...]
H A Deigen2_array.cpp26 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
64 MatrixType m1 = MatrixType::Random(rows, cols), local
[all...]
H A Deigen2_cwiseop.cpp31 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
[all...]
H A Deigen2_swap.cpp35 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_cop
[all...]
/external/eigen/test/
H A Dlinearstructure.cpp26 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...]
H A Darray.cpp22 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, ArrayTyp
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...]
H A Dinteger_types.cpp30 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
[all...]
H A Deigen2support.cpp22 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
[all...]
H A Dcwiseop.cpp33 cwiseops_real_only(MatrixType& m1, MatrixType& m2, MatrixType& m3, MatrixType& mones) argument
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
75 MatrixType m1 = MatrixType::Random(rows, cols), local
[all...]
H A Dproduct_extra.cpp24 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
[all...]
H A Dinverse.cpp26 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
[all...]
/external/clang/test/PCH/
H A Dchanged-files.c2 int s1 = m1;
24 // RUN: echo "#define m1 'abcd'" >> %t.h
/external/eigen/doc/snippets/
H A DMatrixBase_set.cpp1 Matrix3i m1; variable
2 m1 << 1, 2, 3,
5 cout << m1 << endl << endl;
12 v1, m1.block(1,1,2,2);
H A DIOFormat.cpp2 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/valgrind/main/helgrind/tests/
H A Dhg02_deadlock.c4 static pthread_mutex_t m1 = PTHREAD_MUTEX_INITIALIZER; variable
9 pthread_mutex_lock(&m1);
11 pthread_mutex_unlock(&m1);
20 pthread_mutex_lock(&m1);
21 pthread_mutex_unlock(&m1);
32 pthread_mutex_lock(&m1);
33 pthread_mutex_unlock(&m1);
/external/libcxx/test/re/re.results/re.results.swap/
H A Dmember_swap.pass.cpp22 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);
H A Dnon_member_swap.pass.cpp15 // 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);

Completed in 227 milliseconds

1234567891011>>