HomeSort by relevance Sort by last modified time
    Searched defs:m2 (Results 51 - 75 of 275) sorted by null

1 23 4 5 6 7 8 91011

  /external/eigen/test/
diagonalmatrices.cpp 28 m2 = MatrixType::Random(rows, cols); local
58 VERIFY_IS_APPROX( ((ldm1 * (m1+m2))(i,j)) , ldm1.diagonal()(i) * (m1+m2)(i,j) );
63 VERIFY_IS_APPROX( (((v1+v2).asDiagonal() * (m1+m2))(i,j)) , (v1+v2)(i) * (m1+m2)(i,j) );
65 VERIFY_IS_APPROX( (((m1+m2) * (rv1+rv2).asDiagonal())(i,j)) , (rv1+rv2)(j) * (m1+m2)(i,j) );
integer_types.cpp 31 m2 = MatrixType::Random(rows, cols), local
36 } while(m1 == mzero || m1 == m2);
46 VERIFY_IS_EQUAL(-m2+m1+m2, m1);
47 VERIFY_IS_EQUAL((-m1+m2)*s1, -s1*m1+s1*m2);
67 m2 = MatrixType::Random(rows, cols), local
80 } while(m1 == mzero || m1 == m2);
103 VERIFY(m1!=m2);
104 VERIFY(!(m1==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()));
41 m2 = MatrixType::Random(rows, cols), local
62 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
64 m3 *= m1.transpose() * m2;
65 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
66 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
69 VERIFY_IS_APPROX(square*(m1 + m2), square*m1+square*m2)
    [all...]
product_notemporary.cpp 45 m2 = MatrixType::Random(rows, cols), local
60 VERIFY_EVALUATION_COUNT( m3 = (m1 * m2.adjoint()), 1);
61 VERIFY_EVALUATION_COUNT( m3.noalias() = m1 * m2.adjoint(), 0);
63 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * (m1 * m2.transpose()), 0);
65 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * m2.adjoint(), 0);
66 VERIFY_EVALUATION_COUNT( m3.noalias() = s1 * m1 * s2 * (m1*s3+m2*s2).adjoint(), 1);
67 VERIFY_EVALUATION_COUNT( m3.noalias() = (s1 * m1).adjoint() * s2 * m2, 0);
68 VERIFY_EVALUATION_COUNT( m3.noalias() += s1 * (-m1*s3).adjoint() * (s2 * m2 * s3), 0);
69 VERIFY_EVALUATION_COUNT( m3.noalias() -= s1 * (m1.transpose() * m2), 0);
71 VERIFY_EVALUATION_COUNT(( m3.block(r0,r0,r1,r1).noalias() += -m1.block(r0,c0,r1,c1) * (s2*m2.block(r0,c0,r1,c1)).adjoint() ), 0)
    [all...]
product_selfadjoint.cpp 26 m2 = MatrixType::Random(rows, cols), local
42 m2 = m1.template triangularView<Lower>();
43 m2.template selfadjointView<Lower>().rankUpdate(v1,v2);
44 VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().toDenseMatrix());
46 m2 = m1.template triangularView<Upper>();
47 m2.template selfadjointView<Upper>().rankUpdate(-v1,s2*v2,s3);
48 VERIFY_IS_APPROX(m2, (m1 + (s3*(-v1)*(s2*v2).adjoint()+internal::conj(s3)*(s2*v2)*(-v1).adjoint())).template triangularView<Upper>().toDenseMatrix());
50 m2 = m1.template triangularView<Upper>();
51 m2.template selfadjointView<Upper>().rankUpdate(-s2*r1.adjoint(),r2.adjoint()*s3,s1);
52 VERIFY_IS_APPROX(m2, (m1 + s1*(-s2*r1.adjoint())*(r2.adjoint()*s3).adjoint() + internal::conj(s1)*(r2.adjoint()*s3) * (…)
    [all...]
qr.cpp 47 Matrix<Scalar,Cols,Cols2> m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2); local
48 Matrix<Scalar,Rows,Cols2> m3 = m1*m2;
49 m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2);
50 m2 = qr.solve(m3);
51 VERIFY_IS_APPROX(m3, m1*m2);
61 MatrixType m1(size, size), m2(size, size), m3(size, size);
73 m2 = qr.solve(m3);
74 VERIFY_IS_APPROX(m3, m1*m2);
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...]
qr_fullpivoting.cpp 45 MatrixType m2 = MatrixType::Random(cols,cols2); local
46 MatrixType m3 = m1*m2;
47 m2 = MatrixType::Random(cols,cols2);
48 m2 = qr.solve(m3);
49 VERIFY_IS_APPROX(m3, m1*m2);
59 MatrixType m1(size, size), m2(size, size), m3(size, size);
75 m2 = qr.solve(m3);
76 VERIFY_IS_APPROX(m3, m1*m2);
triangular.cpp 26 m2 = MatrixType::Random(rows, cols), local
34 MatrixType m2up = m2.template triangularView<Upper>();
40 VERIFY(!m2.isLowerTriangular());
43 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2);
54 m1.template triangularView<Upper>() = m2.transpose() + m2;
55 m3 = m2.transpose() + m2;
60 m1.template triangularView<Lower>() = m2.transpose() + m2
134 m2 = MatrixType::Random(rows, cols), local
    [all...]
array_for_matrix.cpp 24 m2 = MatrixType::Random(rows, cols), local
47 VERIFY_IS_MUCH_SMALLER_THAN(m1.colwise().sum() + m2.colwise().sum() - (m1+m2).colwise().sum(), (m1+m2).cwiseAbs().maxCoeff());
48 VERIFY_IS_MUCH_SMALLER_THAN(m1.rowwise().sum() - m2.rowwise().sum() - (m1-m2).rowwise().sum(), (m1-m2).cwiseAbs().maxCoeff());
88 m2 = MatrixType::Random(rows, cols), local
108 VERIFY_IS_APPROX( (m1.array()<m2.array()).select(m1,m2), m1.cwiseMin(m2) )
    [all...]
basicstuff.cpp 27 m2 = MatrixType::Random(rows, cols), local
84 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1)));
103 VERIFY(m1!=m2);
104 VERIFY(!(m1==m2));
106 m1 = m2;
107 VERIFY(m1==m2);
108 VERIFY(!(m1!=m2));
173 Matrix4f m = Matrix4f::Random(), m2; local
176 m2 = m.cast<float>(); // check the specialization when NewType == Type
177 VERIFY(m.isApprox(m2));
    [all...]
  /external/eigen/test/eigen2/
eigen2_adjoint.cpp 30 m2 = MatrixType::Random(rows, cols), local
48 VERIFY_IS_APPROX((m1.adjoint() * m2).adjoint(), m2.adjoint() * m1);
eigen2_cwiseop.cpp 32 m2 = MatrixType::Random(rows, cols), local
77 m2 = m2.template binaryExpr<AddIfNull<Scalar> >(mones);
90 VERIFY_IS_APPROX(m2, m2.cwise() * mones);
91 VERIFY_IS_APPROX(m1.cwise() * m2, m2.cwise() * m1);
93 m3.cwise() *= m2;
94 VERIFY_IS_APPROX(m3, m1.cwise() * m2);
96 VERIFY_IS_APPROX(mones, m2.cwise()/m2)
    [all...]
eigen2_triangular.cpp 24 m2 = MatrixType::Random(rows, cols), local
40 MatrixType m2up = m2.template part<Eigen::UpperTriangular>();
46 VERIFY(!m2.isLowerTriangular());
49 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2);
60 m1.template part<Eigen::UpperTriangular>() = (m2.transpose() * m2).lazy();
61 m3 = m2.transpose() * m2;
66 m1.template part<Eigen::LowerTriangular>() = (m2.transpose() * m2).lazy()
125 Matrix2i m2 = Matrix2i::Zero(); local
    [all...]
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()));
42 m2 = MatrixType::Random(rows, cols), local
66 VERIFY_IS_APPROX((m1*m1.transpose())*m2, m1*(m1.transpose()*m2));
68 m3 *= m1.transpose() * m2;
69 VERIFY_IS_APPROX(m3, m1 * (m1.transpose()*m2));
70 VERIFY_IS_APPROX(m3, m1.lazy() * (m1.transpose()*m2));
73 VERIFY_IS_APPROX(square*(m1 + m2), square*m1+square*m2)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/support/win32/
support.h 55 static const unsigned int m2 = 0x33333333; //binary: 00110011.. local
59 x = (x & m2) + ((x >> 2) & m2); //put count of each 4 bits into those 4 bits
70 static const unsigned long long m2 = 0x3333333333333333; //binary: 00110011.. local
74 x = (x & m2) + ((x >> 2) & m2); //put count of each 4 bits into those 4 bits
  /packages/apps/Camera/jni/feature_mos/src/mosaic/
Geometry.h 111 double m2 = 1.0 / m1; local
112 double b2 = y1 - m2 * x1;
114 if (fabs( m1 - m2 ) > 1.e-6)
116 double x = (b2 - b1) / (m1 - m2);
  /packages/apps/Camera2/jni/feature_mos/src/mosaic/
Geometry.h 111 double m2 = 1.0 / m1; local
112 double b2 = y1 - m2 * x1;
114 if (fabs( m1 - m2 ) > 1.e-6)
116 double x = (b2 - b1) / (m1 - m2);
  /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/
Geometry.h 111 double m2 = 1.0 / m1; local
112 double b2 = y1 - m2 * x1;
114 if (fabs( m1 - m2 ) > 1.e-6)
116 double x = (b2 - b1) / (m1 - m2);
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/
SmoothingUtils.java 57 final float[][] m2 = new float[N][1]; local
82 // m2
84 m2[i][0] = ys[i];
95 MatrixUtils.dump("a3", m2);
97 MatrixUtils.multiply(m0Invxm1, m2, retval);
  /cts/tests/tests/renderscript/src/android/renderscript/cts/
Matrix4fTest.java 107 Matrix4f m2 = new Matrix4f(setData); local
109 m1.load(m2);
228 Matrix4f m2 = new Matrix4f(m.getArray()); local
229 assertTrue(m2.inverse());
230 m.multiply(m2);
  /cts/suite/cts/deviceTests/opengl/test/
MatrixTest.cpp 36 Matrix m2; local
39 m2.mData[4] = 9;
41 ASSERT_TRUE(m1.equals(m2));
73 Matrix m2; local
76 m2.loadWith(m1);
79 checkValues(m2.mData, data, Matrix::MATRIX_SIZE);
85 Matrix* m2 = Matrix::newTranslate(10, 5, 6); local
86 ASSERT_TRUE(m2 != NULL);
87 ASSERT_TRUE(m1.equals(*m2));
88 delete m2;
94 Matrix* m2 = Matrix::newScale(10, 5, 6); local
103 Matrix* m2 = Matrix::newRotate(180, 1, 0, 1); local
112 Matrix m2; local
    [all...]
  /cts/tests/tests/graphics/src/android/graphics/cts/
CameraTest.java 47 Matrix m2 = new Matrix(); local
48 mCamera.getMatrix(m2);
49 assertFalse(m1.equals(m2));
52 m2.getValues(f);
69 Matrix m2 = new Matrix(); local
70 mCamera.getMatrix(m2);
71 assertFalse(m1.equals(m2));
74 m2.getValues(f);
91 Matrix m2 = new Matrix(); local
92 mCamera.getMatrix(m2);
113 Matrix m2 = new Matrix(); local
    [all...]
  /external/chromium/testing/gmock/test/
gmock_link_test.h 610 Matcher<const FieldHelper*> m2 = Field(&FieldHelper::field_, Eq(0)); local
611 EXPECT_TRUE(m2.Matches(&helper));
621 Matcher<const FieldHelper*> m2 = Property(&FieldHelper::field, Eq(0)); local
622 EXPECT_TRUE(m2.Matches(&helper));
  /external/chromium_org/third_party/mesa/src/src/mesa/math/
m_norm_tmp.h 56 GLfloat m2 = m[2], m6 = m[6], m10 = m[10]; local
64 tx = ux * m0 + uy * m1 + uz * m2;
86 m2 *= scale, m6 *= scale, m10 *= scale;
93 tx = ux * m0 + uy * m1 + uz * m2;
220 const GLfloat m2 = scale*m[2], m6 = scale*m[6], m10 = scale*m[10]; local
227 out[i][0] = ux * m0 + uy * m1 + uz * m2;
279 const GLfloat m2 = m[2], m6 = m[6], m10 = m[10]; local
287 out[i][0] = ux * m0 + uy * m1 + uz * m2;

Completed in 311 milliseconds

1 23 4 5 6 7 8 91011