| /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/eigen/test/ |
| qr.cpp | 37 Matrix<Scalar,Rows,Cols> m1 = Matrix<Scalar,Rows,Cols>::Random(); local
38 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
44 VERIFY_IS_APPROX(m1, qr.householderQ() * r);
47 Matrix<Scalar,Rows,Cols2> m3 = m1*m2;
50 VERIFY_IS_APPROX(m3, m1*m2);
62 MatrixType m1(size, size), m2(size, size), m3(size, size);
63 m1 = MatrixType::Random(size,size);
69 m1 += a * a.adjoint();
72 HouseholderQR<MatrixType> qr(m1);
75 VERIFY_IS_APPROX(m3, m1*m2)
[all...] |
| adjoint.cpp | 71 MatrixType m1 = MatrixType::Random(rows, cols), local
84 VERIFY_IS_APPROX(m1.transpose().conjugate().adjoint(), m1);
85 VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(), m1);
88 VERIFY_IS_APPROX((m1.adjoint() * m2).adjoint(), m2.adjoint() * m1);
89 VERIFY_IS_APPROX((s1 * m1).adjoint(), numext::conj(s1) * m1.adjoint());
102 VERIFY_IS_APPROX(m1.conjugate()(r,c), numext::conj(m1(r,c)))
[all...] |
| /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/webrtc/system_wrappers/source/ |
| data_log_helpers_unittest.cc | 52 webrtc::MultiValueContainer<int> m1(a, 3);
56 m1.ToString(&s1);
60 m1 = m2;
61 m1.ToString(&s1);
|
| /external/libvpx/libvpx/vp9/encoder/x86/ |
| vp9_error_sse2.asm | 32 mova m1, [dqcq+sizeq*2+mmsize]
34 psubw m1, m3
38 pmaddwd m1, m1
45 punpckldq m7, m1, m5
47 punpckhdq m1, m5
50 paddq m4, m1
93 mova m1, [dqcq+sizeq*2+mmsize]
95 psubw m1, m3
99 pmaddwd m1, m
[all...] |
| /prebuilts/gdb/darwin-x86/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/gdb/linux-x86/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/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];
|
| /external/valgrind/none/tests/ |
| map_unmap.c | 98 void *m1, *m2; local
100 m1 = domap(LEN, 0);
101 if (m1 != expect1) {
102 printf("FAIL i=%d: m1=%p expect1=%p\n",
103 i, m1, expect1);
115 munmap(m1, LEN);
|
| /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);
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/ia64/ |
| pcrel.s | 16 .macro m1 op, opnd1
42 m1 mov, r2 =
57 m1 movl, r2 =
72 m1 data8
81 m1 data4
|
| /external/libvpx/libvpx/vpx_dsp/x86/ |
| intrapred_sse2.asm | 30 pxor m1, m1
33 psadbw m0, m1
51 pxor m1, m1
53 psadbw m0, m1
71 pxor m1, m1
73 psadbw m0, m1
91 pxor m1, m
[all...] |
| highbd_sad4d_sse2.asm | 36 pmaddwd m4, m1
37 pmaddwd m5, m1
46 pmaddwd m6, m1
47 pmaddwd m7, m1
56 pmaddwd m2, m1
65 pmaddwd m2, m1
74 pmaddwd m2, m1
83 pmaddwd m2, m1
112 pmaddwd m4, m1
113 pmaddwd m5, m1
[all...] |
| /external/eigen/bench/ |
| 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...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/sh/ |
| sh4al-dsp.s | 53 pabs y0,m1
59 dct pabs m0,m1
60 dcf pabs m1,y0
64 pmuls y0,a1,m1
70 pclr y0 pmuls y0,a1,m1
73 psub m1,x1,x1
78 dcf psub x1,m1,m0
79 dcf psub y0,x1,m1
80 dcf psub m1,a0,a1
82 pswap a1,m1
[all...] |
| /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());
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/set.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());
|
| /external/libcxx/test/std/containers/associative/multiset/multiset.cons/ |
| move_alloc.pass.cpp | 45 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
59 M m3(std::move(m1), A(7));
63 assert(m1.empty());
83 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
97 M m3(std::move(m1), A(5));
101 assert(m1.empty());
121 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
135 M m3(std::move(m1), A(5));
139 assert(m1.empty());
164 M m1(I(a1), I(a1+num), C(), A())
[all...] |
| /external/libcxx/test/std/containers/associative/set/set.cons/ |
| move_alloc.pass.cpp | 45 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
59 M m3(std::move(m1), A(7));
63 assert(m1.empty());
83 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
97 M m3(std::move(m1), A(5));
101 assert(m1.empty());
121 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
135 M m3(std::move(m1), A(5));
139 assert(m1.empty());
164 M m1(I(a1), I(a1+num), C(), A())
[all...] |
| /external/clang/test/CodeGenCXX/ |
| constructor-for-array-members.cpp | 37 M m1; local
38 m1.pr();
|
