/external/eigen/test/ |
product_extra.cpp | 26 m2 = MatrixType::Random(rows, cols), local 42 VERIFY_IS_APPROX(m3.noalias() = m1 * m2.adjoint(), m1 * m2.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); 46 VERIFY_IS_APPROX(m3.noalias() = ((s1 * m1).adjoint()) * m2, (internal::conj(s1) * m1.adjoint()).eval() * m2); 47 VERIFY_IS_APPROX(m3.noalias() = (- m1.adjoint() * s1) * (s3 * m2), (- m1.adjoint() * s1).eval() * (s3 * m2).eval()) [all...] |
lu.cpp | 58 CMatrixType m2(cols, cols2); 90 m2 = CMatrixType::Random(cols,cols2); 91 m3 = m1*m2; 92 m2 = CMatrixType::Random(cols,cols2); 94 m2.block(0,0,m2.rows(),m2.cols()) = lu.solve(m3); 95 VERIFY_IS_APPROX(m3, m1*m2); 107 MatrixType m1(size, size), m2(size, size), m3(size, size); 124 m2 = lu.solve(m3) [all...] |
qr_colpivoting.cpp | 41 MatrixType m2 = MatrixType::Random(cols,cols2); local 42 MatrixType m3 = m1*m2; 43 m2 = MatrixType::Random(cols,cols2); 44 m2 = qr.solve(m3); 45 VERIFY_IS_APPROX(m3, m1*m2); 66 Matrix<Scalar,Cols,Cols2> m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2); local 67 Matrix<Scalar,Rows,Cols2> m3 = m1*m2; 68 m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2); 69 m2 = qr.solve(m3); 70 VERIFY_IS_APPROX(m3, m1*m2); [all...] |
/external/clang/test/SemaCXX/ |
composite-pointer-type.cpp | 50 bool f(Matrix4 m1, const Matrix4 m2) { 51 return m1 != m2;
|
/external/eigen/demos/mix_eigen_and_c/ |
binary_library.cpp | 122 void MatrixXd_multiply(const C_MatrixXd *m1, const C_MatrixXd *m2, C_MatrixXd *result) 124 c_to_eigen(result) = c_to_eigen(m1) * c_to_eigen(m2); 127 void MatrixXd_add(const C_MatrixXd *m1, const C_MatrixXd *m2, C_MatrixXd *result) 129 c_to_eigen(result) = c_to_eigen(m1) + c_to_eigen(m2); 177 void Map_MatrixXd_multiply(const C_Map_MatrixXd *m1, const C_Map_MatrixXd *m2, C_Map_MatrixXd *result) 179 c_to_eigen(result) = c_to_eigen(m1) * c_to_eigen(m2); 182 void Map_MatrixXd_add(const C_Map_MatrixXd *m1, const C_Map_MatrixXd *m2, C_Map_MatrixXd *result) 184 c_to_eigen(result) = c_to_eigen(m1) + c_to_eigen(m2);
|
/external/valgrind/main/VEX/test/ |
rounderr.c | 4 m2 = 1.19999999999998885, exp = 1.19999999999999996 9 m2 = 1.19999999999998885, exp = 1.19999999999999996 14 m2 = 1.19999999999999996, exp = 1.19999999999999996 19 m2 = 1.19999999999999996, exp = 1.19999999999999996 24 m2 = 1.19999999999999440, exp = 1.19999999999999996 29 m2 = 1.19999999999998885, exp = 1.19999999999999996 88 double m2 = my_mean2 (numacc2, 1, nacc2); local 91 printf("m2 = %19.17f, exp = %19.17f\n", m2, expected_mean);
|
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
TemplateSubPatternAssociation.java | 130 * @param m2 Second mode to match 134 private boolean matchModes(QName m1, QName m2) 136 return (((null == m1) && (null == m2)) 137 || ((null != m1) && (null != m2) && m1.equals(m2)));
|
/external/markdown/markdown/extensions/ |
meta.py | 74 m2 = META_MORE_RE.match(line) 75 if m2 and key: 77 meta[key].append(m2.group('value').strip())
|
/external/valgrind/main/none/tests/s390x/ |
mul_GE.c | 27 static void do_regmem_insns(unsigned long m2) 29 mhysweep(m2); 30 mfysweep(m2);
|
/external/webrtc/src/system_wrappers/source/ |
data_log_helpers_unittest.cc | 52 webrtc::MultiValueContainer<int> m2(b, 3); 56 m2.ToString(&s2); 59 m1 = m2;
|
/external/webkit/Source/WebCore/platform/graphics/transforms/ |
AffineTransform.h | 134 bool operator== (const AffineTransform& m2) const 136 return (m_transform[0] == m2.m_transform[0] 137 && m_transform[1] == m2.m_transform[1] 138 && m_transform[2] == m2.m_transform[2] 139 && m_transform[3] == m2.m_transform[3] 140 && m_transform[4] == m2.m_transform[4] 141 && m_transform[5] == m2.m_transform[5]);
|
TransformationMatrix.h | 275 bool operator==(const TransformationMatrix& m2) const 277 return (m_matrix[0][0] == m2.m_matrix[0][0] && 278 m_matrix[0][1] == m2.m_matrix[0][1] && 279 m_matrix[0][2] == m2.m_matrix[0][2] && 280 m_matrix[0][3] == m2.m_matrix[0][3] && 281 m_matrix[1][0] == m2.m_matrix[1][0] && 282 m_matrix[1][1] == m2.m_matrix[1][1] && 283 m_matrix[1][2] == m2.m_matrix[1][2] && 284 m_matrix[1][3] == m2.m_matrix[1][3] && 285 m_matrix[2][0] == m2.m_matrix[2][0] & [all...] |
/system/media/camera/tests/ |
camera_metadata_tests.cpp | 418 camera_metadata_t *m2 = copy_camera_metadata(buf, buf_size, m); local 419 EXPECT_NOT_NULL(m2); 420 EXPECT_EQ(buf, (uint8_t*)m2); 422 get_camera_metadata_entry_count(m2)); 424 get_camera_metadata_data_count(m2)); 425 EXPECT_EQ(get_camera_metadata_entry_capacity(m2), 426 get_camera_metadata_entry_count(m2)); 427 EXPECT_EQ(get_camera_metadata_data_capacity(m2), 428 get_camera_metadata_data_count(m2)); 435 result = get_camera_metadata_entry(m2, i, &e2) 474 camera_metadata_t *m2 = copy_camera_metadata(buf, buf_size, m); local 533 camera_metadata_t *m2 = copy_camera_metadata(buf, buf_size, m); local 552 camera_metadata_t *m2 = NULL; local 635 camera_metadata_t *m2 = NULL; local 662 camera_metadata_t *m2 = NULL; local [all...] |
/external/opencv/cv/src/ |
cvfundam.cpp | 63 virtual int runKernel( const CvMat* m1, const CvMat* m2, CvMat* model )=0; 64 virtual bool runLMeDS( const CvMat* m1, const CvMat* m2, CvMat* model, 66 virtual bool runRANSAC( const CvMat* m1, const CvMat* m2, CvMat* model, 73 virtual void computeReprojError( const CvMat* m1, const CvMat* m2, 75 virtual int findInliers( const CvMat* m1, const CvMat* m2, 78 virtual bool getSubset( const CvMat* m1, const CvMat* m2, 109 int CvModelEstimator2::findInliers( const CvMat* m1, const CvMat* m2, 117 computeReprojError( m1, m2, model, _err ); 162 bool CvModelEstimator2::runRANSAC( const CvMat* m1, const CvMat* m2, CvMat* model, 177 CV_ASSERT( CV_ARE_SIZES_EQ(m1, m2) && CV_ARE_SIZES_EQ(m1, mask) ) 694 const CvPoint2D64f* m2 = (const CvPoint2D64f*)_m2->data.ptr; local 803 const CvPoint2D64f* m2 = (const CvPoint2D64f*)_m2->data.ptr; local 918 const CvPoint2D64f* m2 = (const CvPoint2D64f*)_m2->data.ptr; local 951 CvMat *m1 = 0, *m2 = 0, *tempMask = 0; local [all...] |
/external/eigen/test/eigen2/ |
eigen2_array.cpp | 27 m2 = MatrixType::Random(rows, cols), local 47 if (!ei_isApprox(m1.sum(), (m1+m2).sum())) 48 VERIFY_IS_NOT_APPROX(((m1+m2).rowwise().sum()).sum(), m1.sum()); 65 m2 = MatrixType::Random(rows, cols), local 85 VERIFY_IS_APPROX( (m1.cwise()<m2).select(m1,m2), m1.cwise().min(m2) ); 86 VERIFY_IS_APPROX( (m1.cwise()>m2).select(m1,m2), m1.cwise().max(m2) ); [all...] |
/external/quake/quake/src/WinQuake/ |
gl_mesh.cpp | 60 int m1, m2; local 77 m2 = last->vertindex[(startv+1)%3]; 89 if (check->vertindex[ (k+1)%3 ] != m2) 100 m2 = check->vertindex[ (k+2)%3 ]; 129 int m1, m2; local 146 m2 = last->vertindex[(startv+2)%3]; 159 if (check->vertindex[ (k+1)%3 ] != m2) 169 m2 = check->vertindex[ (k+2)%3 ]; 171 stripverts[stripcount+2] = m2; 203 int m1, m2; local [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/map/map.cons/ |
move_alloc.pass.cpp | 58 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 60 assert(m3 == m2); 97 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 99 assert(m3 == m2); 136 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 138 assert(m3 == m2);
|
move_assign.pass.cpp | 58 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 61 assert(m3 == m2); 98 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 101 assert(m3 == m2); 138 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 141 assert(m3 == m2);
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multimap/multimap.cons/ |
move_alloc.pass.cpp | 58 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 60 assert(m3 == m2); 97 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 99 assert(m3 == m2); 136 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 138 assert(m3 == m2);
|
move_assign.pass.cpp | 58 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 61 assert(m3 == m2); 98 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 101 assert(m3 == m2); 138 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 141 assert(m3 == m2);
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multiset/multiset.cons/ |
move_alloc.pass.cpp | 57 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 59 assert(m3 == m2); 95 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 97 assert(m3 == m2); 133 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 135 assert(m3 == m2);
|
move_assign.pass.cpp | 57 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 60 assert(m3 == m2); 96 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 99 assert(m3 == m2); 135 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 138 assert(m3 == m2);
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/set/set.cons/ |
move_alloc.pass.cpp | 57 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 59 assert(m3 == m2); 95 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 97 assert(m3 == m2); 133 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 135 assert(m3 == m2);
|
move_assign.pass.cpp | 57 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 60 assert(m3 == m2); 96 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 99 assert(m3 == m2); 135 M m2(I(a2), I(a2+sizeof(a2)/sizeof(a2[0])), C(5), A(7)); 138 assert(m3 == m2);
|
/external/skia/tests/ |
ColorFilterTest.cpp | 88 SkXfermode::Mode m2 = ILLEGAL_MODE; local 89 REPORTER_ASSERT(reporter, cf2->asColorMode(&c2, &m2)); 91 REPORTER_ASSERT(reporter, m2 == expectedMode);
|