| /external/eigen/test/ |
| product_syrk.cpp | 24 MatrixType m1 = MatrixType::Random(rows, cols), local
60 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c),s1)._expression()),
61 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
64 VERIFY_IS_APPROX((m2.template selfadjointView<Upper>().rankUpdate(m1.col(c),s1)._expression()),
65 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Upper>().toDenseMatrix()));
68 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c).conjugate(),s1)._expression()),
69 ((s1 * m1.col(c).conjugate() * m1.col(c).conjugate().adjoint()).eval().template triangularView<Lower>().toDenseMatrix()))
[all...] |
| product_selfadjoint.cpp | 25 MatrixType m1 = MatrixType::Random(rows, cols), local
39 m1 = (m1.adjoint() + m1).eval();
42 m2 = m1.template triangularView<Lower>();
44 VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().toDenseMatrix());
46 m2 = m1.template triangularView<Upper>();
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>();
52 VERIFY_IS_APPROX(m2, (m1 + s1*(-s2*r1.adjoint())*(r2.adjoint()*s3).adjoint() + internal::conj(s1)*(r2.adjoint()*s3) * (-s2* (…)
[all...] |
| householder.cpp | 54 MatrixType m1(rows, cols),
59 m1.colwise() = v1;
60 m2 = m1;
61 m1.col(0).makeHouseholder(essential, beta, alpha);
62 m1.applyHouseholderOnTheLeft(essential,beta,tmp);
63 VERIFY_IS_APPROX(m1.norm(), m2.norm());
64 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(m1.block(1,0,rows-1,cols).norm(), m1.norm());
65 VERIFY_IS_MUCH_SMALLER_THAN(internal::imag(m1(0,0)), internal::real(m1(0,0)))
[all...] |
| qr_fullpivoting.cpp | 24 MatrixType m1; local
25 createRandomPIMatrixOfRank(rank,rows,cols,m1);
26 FullPivHouseholderQR<MatrixType> qr(m1);
43 VERIFY_IS_APPROX(m1, c);
46 MatrixType m3 = m1*m2;
49 VERIFY_IS_APPROX(m3, m1*m2);
59 MatrixType m1(size, size), m2(size, size), m3(size, size);
60 m1 = MatrixType::Random(size,size);
66 m1 += a * a.adjoint();
69 FullPivHouseholderQR<MatrixType> qr(m1);
[all...] |
| qr.cpp | 38 Matrix<Scalar,Rows,Cols> m1 = Matrix<Scalar,Rows,Cols>::Random(); local
39 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
45 VERIFY_IS_APPROX(m1, qr.householderQ() * r);
48 Matrix<Scalar,Rows,Cols2> m3 = m1*m2;
51 VERIFY_IS_APPROX(m3, m1*m2);
61 MatrixType m1(size, size), m2(size, size), m3(size, size);
62 m1 = MatrixType::Random(size,size);
68 m1 += a * a.adjoint();
71 HouseholderQR<MatrixType> qr(m1);
74 VERIFY_IS_APPROX(m3, m1*m2)
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| CameraTest.java | 43 Matrix m1 = new Matrix(); local
44 preCompare(m1);
49 assertFalse(m1.equals(m2));
65 Matrix m1 = new Matrix(); local
66 preCompare(m1);
71 assertFalse(m1.equals(m2));
87 Matrix m1 = new Matrix(); local
88 preCompare(m1);
93 assertFalse(m1.equals(m2));
109 Matrix m1 = new Matrix() local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| TemplateSubPatternAssociation.java | 117 * @param m1 mode to match
121 boolean matchMode(QName m1)
123 return matchModes(m1, m_template.getMode());
129 * @param m1 First 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/eigen/bench/ |
| sparse_product.cpp | 119 DenseMatrix m1(rows,cols), m2(rows,cols), m3(rows,cols);
120 eiToDense(sm1, m1);
126 m3 = m1 * m2;
133 m3 = m1.transpose() * m2;
140 m3 = m1.transpose() * m2.transpose();
147 m3 = m1 * m2.transpose();
188 DynamicSparseMatrix<Scalar> m1(sm1), m2(sm2), m3(sm3);
189 std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/(float(m1.rows())*float(m1.cols()))*100 << "% *
228 cs *m1, *m2, *m3; local
[all...] |
| sparse_dense_product.cpp | 72 DenseMatrix m1(rows,cols);
73 eiToDense(sm1, m1);
78 v2 = m1 * v1;
85 v2 = m1.transpose() * v1;
105 // DynamicSparseMatrix<Scalar> m1(sm1);
106 // std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/float(m1.rows()*m1.cols())*100 << "%\n";
108 // BENCH(for (int k=0; k<REPEAT; ++k) v2 = m1 * v1;)
111 // BENCH(for (int k=0; k<REPEAT; ++k) v2 = m1.transpose() * v1;
[all...] |
| sparse_trisolver.cpp | 81 DenseMatrix m1(rows,cols);
83 eiToDense(sm1, m1);
84 m2 = m1;
86 BENCH(x = m1.marked<UpperTriangular>().solveTriangular(b);)
126 cs *m1; local
127 eiToCSparse(sm1, m1);
129 BENCH(x = b; if (!cs_lsolve (m1, x.data())){std::cerr << "cs_lsolve failed\n"; break;}; )
138 GmmSparse m1(rows,cols);
140 eiToGmm(sm1, m1);
141 gmm::copy(m1,m2)
[all...] |
| /external/eigen/doc/examples/ |
| TemplateKeyword_flexible.cpp | 15 MatrixXi m1 = MatrixXi::Ones(5,5); local
19 copyUpperTriangularPart(m2, m1.topLeftCorner(4,4));
|
| TemplateKeyword_simple.cpp | 13 MatrixXf m1 = MatrixXf::Ones(4,4); local
17 copyUpperTriangularPart(m2, m1);
|
| /external/libvpx/libvpx/vp9/common/x86/ |
| vp9_intrapred_ssse3.asm | 43 movd m1, [leftq+lineq*2 ]
45 pshufb m1, m0
47 movd [dstq ], m1
61 movd m1, [leftq+lineq*2 ]
63 pshufb m1, m0
65 movq [dstq ], m1
79 movd m1, [leftq+lineq*2 ]
81 pshufb m1, m0
83 mova [dstq ], m1
97 movd m1, [leftq+lineq*2
[all...] |
| vp9_copy_sse2.asm | 32 movu m1, [srcq+16]
38 pavgb m1, [dstq+16]
43 mova [dstq+16], m1
55 movu m1, [srcq+16]
61 pavgb m1, [dstq +16]
66 mova [dstq +16], m1
80 movu m1, [srcq+src_strideq]
86 pavgb m1, [dstq+dst_strideq]
91 mova [dstq+dst_strideq ], m1
106 movu m1, [srcq+src_strideq
[all...] |
| /external/libvpx/libvpx/vp9/encoder/x86/ |
| vp9_sad_sse2.asm | 54 movu m1, [refq]
59 pavgb m1, [second_predq+mmsize*0]
65 psadbw m1, [srcq]
69 paddd m1, m2
72 paddd m0, m1
78 movhlps m1, m0
79 paddd m0, m1
97 movu m1, [refq]
102 pavgb m1, [second_predq+mmsize*0]
108 psadbw m1, [srcq
[all...] |
| /art/test/ProtoCompare/ |
| ProtoCompare.java | 18 int m1(short x, int y, long z) { return x + y + (int)z; } method in class:ProtoCompare
|
| /art/test/ProtoCompare2/ |
| ProtoCompare2.java | 18 int m1(short x, int y, long z) { return x + y + (int)z; } method in class:ProtoCompare2
|
| /external/eigen/demos/mix_eigen_and_c/ |
| binary_library.h | 41 void MatrixXd_add (const struct C_MatrixXd *m1,
44 void MatrixXd_multiply (const struct C_MatrixXd *m1,
62 void Map_MatrixXd_add (const struct C_Map_MatrixXd *m1,
65 void Map_MatrixXd_multiply (const struct C_Map_MatrixXd *m1,
|
| /external/markdown/markdown/extensions/ |
| meta.py | 69 m1 = META_RE.match(line)
70 if m1:
71 key = m1.group('key').lower().strip()
72 meta[key] = [m1.group('value').strip()]
|
| /external/webrtc/src/system_wrappers/source/ |
| data_log_helpers_unittest.cc | 51 webrtc::MultiValueContainer<int> m1(a, 3);
55 m1.ToString(&s1);
59 m1 = m2;
60 m1.ToString(&s1);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| colorsys.py | 97 m1 = 2.0*l - m2
98 return (_v(m1, m2, h+ONE_THIRD), _v(m1, m2, h), _v(m1, m2, h-ONE_THIRD))
100 def _v(m1, m2, hue):
103 return m1 + (m2-m1)*hue*6.0
107 return m1 + (m2-m1)*(TWO_THIRD-hue)*6.0
108 return m1
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| colorsys.py | 97 m1 = 2.0*l - m2
98 return (_v(m1, m2, h+ONE_THIRD), _v(m1, m2, h), _v(m1, m2, h-ONE_THIRD))
100 def _v(m1, m2, hue):
103 return m1 + (m2-m1)*hue*6.0
107 return m1 + (m2-m1)*(TWO_THIRD-hue)*6.0
108 return m1
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/kube/ |
| M4.java | 46 float[][] m1 = m; local
51 result.m[i][j] = m1[i][0]*m2[0][j] + m1[i][1]*m2[1][j] + m1[i][2]*m2[2][j] + m1[i][3]*m2[3][j];
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
| SmoothingUtils.java | 56 final float[][] m1 = new float[COEFF_COUNT][N]; local
75 // m1
78 m1[i][j] = (i == 0) ? 1.0f : m1[i - 1][j] * xs[j];
90 MatrixUtils.dump("a1", m1);
92 MatrixUtils.multiply(m0Inv, m1, m0Invxm1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/multiset.cons/ |
| move_alloc.pass.cpp | 44 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
58 M m3(std::move(m1), A(7));
62 assert(m1.empty());
82 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
96 M m3(std::move(m1), A(5));
100 assert(m1.empty());
120 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
134 M m3(std::move(m1), A(5));
138 assert(m1.empty());
|
