Home
last modified time | relevance | path

Searched refs:m1 (Results 1 – 25 of 1524) sorted by relevance

12345678910>>...61

/external/eigen/test/
Darray_cwise.cpp95 ArrayType m1 = ArrayType::Random(rows, cols), in array() local
98 ArrayType m4 = m1; // copy constructor in array()
99 VERIFY_IS_APPROX(m1, m4); in array()
108 VERIFY_IS_APPROX(m1 + s1, s1 + m1); in array()
109 VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1); in array()
110 VERIFY_IS_APPROX(s1 - m1, (-m1)+s1 ); in array()
111 VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1)); in array()
112 VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1); in array()
113 VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) ); in array()
114 m3 = m1; in array()
[all …]
Dnesting_ops.cpp53 MatrixType m1 = MatrixType::Random(rows,cols); in run_nesting_ops_2() local
58 VERIFY_EVALUATION_COUNT( use_n_times<1>(m1 + m1*m1), 1 ); in run_nesting_ops_2()
59 VERIFY_EVALUATION_COUNT( use_n_times<10>(m1 + m1*m1), 1 ); in run_nesting_ops_2()
61 …VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 ); in run_nesting_ops_2()
62 …VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 … in run_nesting_ops_2()
64 …VERIFY_EVALUATION_COUNT( use_n_times<1>(Scalar(2)*m1.template triangularView<Lower>().solve(m1.col… in run_nesting_ops_2()
65 …VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.col… in run_nesting_ops_2()
66 …VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.co… in run_nesting_ops_2()
70 VERIFY( verify_eval_type<10>(m1, m1) ); in run_nesting_ops_2()
73 VERIFY( verify_eval_type<3>(2*m1, 2*m1) ); in run_nesting_ops_2()
[all …]
Darray_for_matrix.cpp21 MatrixType m1 = MatrixType::Random(rows, cols), in array_for_matrix() local
32 VERIFY_IS_APPROX(m1.array() + s1, s1 + m1.array()); in array_for_matrix()
33 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1); in array_for_matrix()
34 …VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,… in array_for_matrix()
35 m3 = m1; in array_for_matrix()
37 VERIFY_IS_APPROX(m3, (m1.array() + s2).matrix()); in array_for_matrix()
38 m3 = m1; in array_for_matrix()
40 VERIFY_IS_APPROX(m3, (m1.array() - s1).matrix()); in array_for_matrix()
43 VERIFY_IS_MUCH_SMALLER_THAN(m1.colwise().sum().sum() - m1.sum(), m1.squaredNorm()); in array_for_matrix()
44 VERIFY_IS_MUCH_SMALLER_THAN(m1.rowwise().sum().sum() - m1.sum(), m1.squaredNorm()); in array_for_matrix()
[all …]
Dlinearstructure.cpp30 MatrixType m1 = MatrixType::Random(rows, cols), in linearStructure() local
40 VERIFY_IS_APPROX(-(-m1), m1); in linearStructure()
41 VERIFY_IS_APPROX(m1+m1, 2*m1); in linearStructure()
42 VERIFY_IS_APPROX(m1+m2-m1, m2); in linearStructure()
43 VERIFY_IS_APPROX(-m2+m1+m2, m1); in linearStructure()
44 VERIFY_IS_APPROX(m1*s1, s1*m1); in linearStructure()
45 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); in linearStructure()
46 VERIFY_IS_APPROX((-m1+m2)*s1, -s1*m1+s1*m2); in linearStructure()
47 m3 = m2; m3 += m1; in linearStructure()
48 VERIFY_IS_APPROX(m3, m1+m2); in linearStructure()
[all …]
Dvectorwiseop.cpp27 ArrayType m1 = ArrayType::Random(rows, cols), in vectorwiseop_array() local
36 m2 = m1; in vectorwiseop_array()
38 VERIFY_IS_APPROX(m2, m1.colwise() + colvec); in vectorwiseop_array()
39 VERIFY_IS_APPROX(m2.col(c), m1.col(c) + colvec); in vectorwiseop_array()
42 VERIFY_RAISES_ASSERT(m1.colwise() + colvec.transpose()); in vectorwiseop_array()
44 m2 = m1; in vectorwiseop_array()
46 VERIFY_IS_APPROX(m2, m1.rowwise() + rowvec); in vectorwiseop_array()
47 VERIFY_IS_APPROX(m2.row(r), m1.row(r) + rowvec); in vectorwiseop_array()
50 VERIFY_RAISES_ASSERT(m1.rowwise() + rowvec.transpose()); in vectorwiseop_array()
54 m2 = m1; in vectorwiseop_array()
[all …]
Dinteger_types.cpp29 MatrixType m1(rows, cols), in signed_integer_type_tests() local
34 m1 = MatrixType::Random(rows, cols); in signed_integer_type_tests()
35 } while(m1 == mzero || m1 == m2); in signed_integer_type_tests()
44 VERIFY_IS_EQUAL(-(-m1), m1); in signed_integer_type_tests()
45 VERIFY_IS_EQUAL(-m2+m1+m2, m1); in signed_integer_type_tests()
46 VERIFY_IS_EQUAL((-m1+m2)*s1, -s1*m1+s1*m2); in signed_integer_type_tests()
64 MatrixType m1(rows, cols), in integer_type_tests() local
77 m1 = MatrixType::Random(rows, cols); in integer_type_tests()
78 } while(m1 == mzero || m1 == m2); in integer_type_tests()
87 VERIFY_IS_APPROX( m1, m1); in integer_type_tests()
[all …]
Dblock.cpp15 block_real_only(const MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) { in block_real_only() argument
17 VERIFY_IS_APPROX(m1.row(r1).cwiseMax(s1), m1.cwiseMax(s1).row(r1)); in block_real_only()
18 VERIFY_IS_APPROX(m1.col(c1).cwiseMin(s1), m1.cwiseMin(s1).col(c1)); in block_real_only()
20 …VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMin(s1), m1.cwiseMin(s1).block(r1,c1,r2-r1+1… in block_real_only()
21 …VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMax(s1), m1.cwiseMax(s1).block(r1,c1,r2-r1+1… in block_real_only()
52 MatrixType m1 = MatrixType::Random(rows, cols), in block() local
53 m1_copy = m1, in block()
66 block_real_only(m1, r1, r2, c1, c1, s1); in block()
69 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1)); in block()
71 m1 = m1_copy; in block()
[all …]
Dproduct.h14 bool areNotApprox(const MatrixBase<Derived1>& m1, const MatrixBase<Derived2>& m2, typename Derived1…
16 return !((m1-m2).cwiseAbs2().maxCoeff() < epsilon * epsilon
17 * (std::max)(m1.cwiseAbs2().maxCoeff(), m2.cwiseAbs2().maxCoeff()));
38 MatrixType m1 = MatrixType::Random(rows, cols), in product() local
50 OtherMajorMatrixType tm1 = m1; in product()
60 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in product()
61 m3 = m1; in product()
62 m3 *= m1.transpose() * m2; in product()
63 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product()
64 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2)); in product()
[all …]
Dnomalloc.cpp32 MatrixType m1 = MatrixType::Random(rows, cols), in nomalloc() local
41 VERIFY_IS_APPROX((m1+m2)*s1, s1*m1+s1*m2); in nomalloc()
42 VERIFY_IS_APPROX((m1+m2)(r,c), (m1(r,c))+(m2(r,c))); in nomalloc()
43 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), (m1.array()*m1.array()).matrix()); in nomalloc()
44 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2)); in nomalloc()
46 m2.col(0).noalias() = m1 * m1.col(0); in nomalloc()
47 m2.col(0).noalias() -= m1.adjoint() * m1.col(0); in nomalloc()
48 m2.col(0).noalias() -= m1 * m1.row(0).adjoint(); in nomalloc()
49 m2.col(0).noalias() -= m1.adjoint() * m1.row(0).adjoint(); in nomalloc()
51 m2.row(0).noalias() = m1.row(0) * m1; in nomalloc()
[all …]
/external/sdv/vsomeip/third_party/boost/numeric/ublas/test/
Dtest23.cpp18 M m1 (N, N), m2 (N, N), m3 (N, N); in test() local
21 initialize_matrix (m1); in test()
23 ublas::blas_3::tmm (m1, value_type (1), m2, m1); in test()
24 std::cout << "tmm (m1, 1, m2, m1) = " << m1 << std::endl; in test()
25 initialize_matrix (m1); in test()
27 ublas::blas_3::tmm (m1, value_type (1), m2, ublas::trans (m1)); in test()
28 std::cout << "tmm (m1, 1, m2, trans (m1)) = " << m1 << std::endl; in test()
29 initialize_matrix (m1); in test()
31 ublas::blas_3::tmm (m1, value_type (1), ublas::trans (m2), m1); in test()
32 std::cout << "tmm (m1, 1, trans (m2), m1) = " << m1 << std::endl; in test()
[all …]
/external/clang/test/CodeGen/
D3dnow-builtins.c9 __m64 test_m_pavgusb(__m64 m1, __m64 m2) { in test_m_pavgusb() argument
13 return _m_pavgusb(m1, m2); in test_m_pavgusb()
23 __m64 test_m_pfacc(__m64 m1, __m64 m2) { in test_m_pfacc() argument
27 return _m_pfacc(m1, m2); in test_m_pfacc()
30 __m64 test_m_pfadd(__m64 m1, __m64 m2) { in test_m_pfadd() argument
34 return _m_pfadd(m1, m2); in test_m_pfadd()
37 __m64 test_m_pfcmpeq(__m64 m1, __m64 m2) { in test_m_pfcmpeq() argument
41 return _m_pfcmpeq(m1, m2); in test_m_pfcmpeq()
44 __m64 test_m_pfcmpge(__m64 m1, __m64 m2) { in test_m_pfcmpge() argument
48 return _m_pfcmpge(m1, m2); in test_m_pfcmpge()
[all …]
/external/libdav1d/src/x86/
Dipred_sse.asm154 pshuflw m1, m0, %3 ; extend 8 byte for 2 pos
155 punpcklqdq m1, m1
156 mova [dstq + %2], m1
158 mova [dstq + 16 + %2], m1
161 mova [dstq + 32 + %2], m1
162 mova [dstq + 48 + %2], m1
171 pshuflw m1, m0, q2233
172 movd [dstq+strideq*0], m1
173 psrlq m1, 32
174 movd [dstq+strideq*1], m1
[all …]
/external/libcxx/test/std/containers/associative/set/set.special/
Dmember_swap.pass.cpp27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
/external/cronet/stable/third_party/libc++/src/test/std/containers/associative/multiset/multiset.special/
Dmember_swap.pass.cpp27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
/external/cronet/stable/third_party/libc++/src/test/std/containers/associative/set/set.special/
Dmember_swap.pass.cpp27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
/external/cronet/tot/third_party/libc++/src/test/std/containers/associative/set/set.special/
Dmember_swap.pass.cpp27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
/external/libcxx/test/std/containers/associative/multiset/multiset.special/
Dmember_swap.pass.cpp27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
/external/cronet/tot/third_party/libc++/src/test/std/containers/associative/multiset/multiset.special/
Dmember_swap.pass.cpp27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
/external/cronet/stable/third_party/libc++/src/test/std/containers/associative/map/map.special/
Dnon_member_swap.pass.cpp30 M m1; in main() local
32 M m1_save = m1; in main()
34 swap(m1, m2); in main()
35 assert(m1 == m2_save); in main()
50 M m1; in main() local
52 M m1_save = m1; in main()
54 swap(m1, m2); in main()
55 assert(m1 == m2_save); in main()
66 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
68 M m1_save = m1; in main()
[all …]
/external/libcxx/test/std/containers/associative/multimap/multimap.special/
Dnon_member_swap.pass.cpp30 M m1; in main() local
32 M m1_save = m1; in main()
34 swap(m1, m2); in main()
35 assert(m1 == m2_save); in main()
50 M m1; in main() local
52 M m1_save = m1; in main()
54 swap(m1, m2); in main()
55 assert(m1 == m2_save); in main()
66 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
68 M m1_save = m1; in main()
[all …]
/external/cronet/stable/third_party/libc++/src/test/std/containers/associative/multimap/multimap.special/
Dnon_member_swap.pass.cpp30 M m1; in main() local
32 M m1_save = m1; in main()
34 swap(m1, m2); in main()
35 assert(m1 == m2_save); in main()
50 M m1; in main() local
52 M m1_save = m1; in main()
54 swap(m1, m2); in main()
55 assert(m1 == m2_save); in main()
66 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
68 M m1_save = m1; in main()
[all …]
/external/cronet/tot/third_party/libc++/src/test/std/containers/associative/multimap/multimap.special/
Dnon_member_swap.pass.cpp30 M m1; in main() local
32 M m1_save = m1; in main()
34 swap(m1, m2); in main()
35 assert(m1 == m2_save); in main()
50 M m1; in main() local
52 M m1_save = m1; in main()
54 swap(m1, m2); in main()
55 assert(m1 == m2_save); in main()
66 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
68 M m1_save = m1; in main()
[all …]
/external/cronet/tot/third_party/libc++/src/test/std/containers/associative/map/map.special/
Dnon_member_swap.pass.cpp30 M m1; in main() local
32 M m1_save = m1; in main()
34 swap(m1, m2); in main()
35 assert(m1 == m2_save); in main()
50 M m1; in main() local
52 M m1_save = m1; in main()
54 swap(m1, m2); in main()
55 assert(m1 == m2_save); in main()
66 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
68 M m1_save = m1; in main()
[all …]
Dmember_swap.pass.cpp27 M m1; in main() local
29 M m1_save = m1; in main()
31 m1.swap(m2); in main()
32 assert(m1 == m2_save); in main()
47 M m1; in main() local
49 M m1_save = m1; in main()
51 m1.swap(m2); in main()
52 assert(m1 == m2_save); in main()
63 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
65 M m1_save = m1; in main()
[all …]
/external/libcxx/test/std/containers/associative/map/map.special/
Dnon_member_swap.pass.cpp30 M m1; in main() local
32 M m1_save = m1; in main()
34 swap(m1, m2); in main()
35 assert(m1 == m2_save); in main()
50 M m1; in main() local
52 M m1_save = m1; in main()
54 swap(m1, m2); in main()
55 assert(m1 == m2_save); in main()
66 M m1(ar1, ar1+sizeof(ar1)/sizeof(ar1[0])); in main() local
68 M m1_save = m1; in main()
[all …]

12345678910>>...61