| /external/eigen/test/ |
| 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...] |
| redux.cpp | 21 MatrixType m1 = MatrixType::Random(rows, cols); local
23 // The entries of m1 are uniformly distributed in [0,1], so m1.prod() is very small. This may lead to test
25 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + Scalar(0.2) * m1;
29 Scalar s(0), p(1), minc(internal::real(m1.coeff(0))), maxc(internal::real(m1.coeff(0)));
33 s += m1(i,j);
35 minc = (std::min)(internal::real(minc), internal::real(m1(i,j)));
36 maxc = (std::max)(internal::real(maxc), internal::real(m1(i,j)));
40 VERIFY_IS_APPROX(m1.sum(), s)
[all...] |
| sparse_basic.cpp | 95 DenseMatrix m1(rows,cols);
96 m1.setZero();
105 if (m1.coeff(i,j)==Scalar(0))
106 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>();
110 VERIFY_IS_APPROX(m2,m1);
115 DenseMatrix m1(rows,cols);
116 m1.setZero();
124 if ((m1.coeff(i,j)==Scalar(0)) && (internal::random<int>()%2))
125 m2.insert(i,j) = m1(i,j) = internal::random<Scalar>();
130 m1(i,j) += v
[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/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);
|
| /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/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/map/map.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());
84 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
98 M m3(std::move(m1), A(5));
102 assert(m1.empty());
123 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
137 M m3(std::move(m1), A(5));
141 assert(m1.empty());
|
| move_assign.pass.cpp | 45 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
60 m3 = std::move(m1);
64 assert(m1.empty());
85 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
100 m3 = std::move(m1);
104 assert(m1.empty());
125 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
140 m3 = std::move(m1);
144 assert(m1.empty());
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multimap/multimap.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());
84 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
98 M m3(std::move(m1), A(5));
102 assert(m1.empty());
123 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
137 M m3(std::move(m1), A(5));
141 assert(m1.empty());
|
| move_assign.pass.cpp | 45 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
60 m3 = std::move(m1);
64 assert(m1.empty());
85 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
100 m3 = std::move(m1);
104 assert(m1.empty());
125 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
140 m3 = std::move(m1);
144 assert(m1.empty());
|
| /ndk/sources/cxx-stl/llvm-libc++/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());
|
| move_assign.pass.cpp | 44 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
59 m3 = std::move(m1);
63 assert(m1.empty());
83 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
98 m3 = std::move(m1);
102 assert(m1.empty());
122 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
137 m3 = std::move(m1);
141 assert(m1.empty());
|
| /ndk/sources/cxx-stl/llvm-libc++/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());
|
| move_assign.pass.cpp | 44 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
59 m3 = std::move(m1);
63 assert(m1.empty());
83 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
98 m3 = std::move(m1);
102 assert(m1.empty());
122 M m1(I(a1), I(a1+sizeof(a1)/sizeof(a1[0])), C(5), A(7));
137 m3 = std::move(m1);
141 assert(m1.empty());
|
| /external/clang/test/CodeGenCXX/ |
| constructor-for-array-members.cpp | 38 M m1; local
39 m1.pr();
|
| /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 | 3 m1 = 1.20000000000000018, exp = 1.19999999999999996
8 m1 = 1.20000000000000018, exp = 1.19999999999999996
13 m1 = 1.19999999999999996, exp = 1.19999999999999996
18 m1 = 1.19999999999999996, exp = 1.19999999999999996
23 m1 = 1.20000000000000040, exp = 1.19999999999999996
28 m1 = 1.20000000000000018, exp = 1.19999999999999996
87 double m1 = my_mean1 (numacc2, 1, nacc2); local
90 printf("m1 = %19.17f, exp = %19.17f\n", m1, expected_mean);
|
| /external/eigen/test/eigen2/ |
| eigen2_sparse_basic.cpp | 167 DenseMatrix m1(rows,cols);
168 m1.setZero();
176 if (m1.coeff(i,j)==Scalar(0))
177 m2.fillrand(i,j) = m1(i,j) = ei_random<Scalar>();
181 VERIFY_IS_APPROX(m2,m1);
186 SparseMatrixType m1(rows,cols), m2(rows,cols);
188 initSparse<Scalar>(density, refM1, m1);
191 for (int j=0; j<m1.outerSize(); ++j)
192 for (typename SparseMatrixType::InnerIterator i(m1,j); i; ++i)
195 VERIFY_IS_APPROX(m1, m2)
[all...] |
| /external/valgrind/main/VEX/priv/ |
| host_s390_disasm.c | 164 bcr_operand(UInt m1)
166 if (m1 == 0) return "nopr";
167 if (m1 == 15) return "br";
169 return construct_mnemonic("b", "r", m1);
175 bc_operand(UInt m1)
177 if (m1 == 0) return "nop";
178 if (m1 == 15) return "b";
180 return construct_mnemonic("b", "", m1);
186 brc_operand(UInt m1)
188 if (m1 == 0) return "brc"
[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,
176 int count = m1->rows*m1->cols, maxGoodCount = 0
693 const CvPoint2D64f* m1 = (const CvPoint2D64f*)_m1->data.ptr; local
802 const CvPoint2D64f* m1 = (const CvPoint2D64f*)_m1->data.ptr; local
917 const CvPoint2D64f* m1 = (const CvPoint2D64f*)_m1->data.ptr; local
951 CvMat *m1 = 0, *m2 = 0, *tempMask = 0; local
[all...] |
| /external/chromium/testing/gmock/test/ |
| gmock-matchers_test.cc | 292 Matcher<int> m1 = 5; local
293 EXPECT_TRUE(m1.Matches(5));
294 EXPECT_FALSE(m1.Matches(6));
299 Matcher<int*> m1 = NULL; local
300 EXPECT_TRUE(m1.Matches(NULL));
302 EXPECT_FALSE(m1.Matches(&n));
308 Matcher<bool> m1 = Eq(false); local
309 EXPECT_TRUE(m1.Matches(false));
310 EXPECT_FALSE(m1.Matches(true));
313 m1 = Eq(true)
340 Matcher<string> m1 = "hi"; local
352 Matcher<string> m1 = string("hi"); local
396 Matcher<const int&> m1 = ReferencesBarOrIsZero(); local
439 const Matcher<int> m1 = PolymorphicIsEven(); local
488 Matcher<double> m1 = Eq(2.0); local
504 Matcher<const int&> m1 = Eq(0); local
512 Matcher<int&> m1 = Eq(0); local
520 Matcher<int> m1 = Eq(0); local
528 Matcher<int> m1 = Eq(0); local
538 Matcher<int> m1 = Eq(0); local
558 Matcher<double> m1 = DoubleEq(1.0); local
572 Matcher<Base*> m1 = Eq(&d); local
586 Matcher<const int&> m1 = Ref(n); local
595 Matcher<int> m1 = Eq(0); local
603 Matcher<int> m1 = Eq(0); local
613 Matcher<int> m1 = Eq(0); local
622 Matcher<double> m1 = A<double>(); local
642 Matcher<int> m1 = An<int>(); local
663 Matcher<int> m1 = _; local
687 Matcher<const char*> m1 = Eq(a1); local
711 Matcher<int> m1 = Eq(1); local
722 Matcher<char> m1 = TypedEq<char>('a'); local
758 Matcher<int> m1 = Ge(0); local
772 Matcher<double> m1 = Gt(0); local
786 Matcher<char> m1 = Le('b'); local
800 Matcher<const string&> m1 = Lt("Hello"); local
814 Matcher<int> m1 = Ne(0); local
828 Matcher<int*> m1 = IsNull(); local
891 Matcher<int*> m1 = NotNull(); local
972 Matcher<const Base&> m1 = Ref(base); local
1055 Matcher<const string&> m1 = StrCaseEq(str1); local
1097 const Matcher<string> m1 = HasSubstr("foo"); local
1108 const Matcher<char*> m1 = HasSubstr("foo"); local
1182 Matcher<const pair<const char*, int>&> m1 = Pair("foo", 42); local
1191 Matcher<const pair<std::string, int>&> m1 = Pair("foo", 42); local
1287 const Matcher<const char*> m1 = StartsWith(string("")); local
1308 const Matcher<const char*> m1 = EndsWith(""); local
1329 const Matcher<const char*> m1 = MatchesRegex("a.*z"); local
1341 Matcher<const std::string> m1 = MatchesRegex(string("Hi.*")); local
1351 const Matcher<const char*> m1 = ContainsRegex(string("a.*z")); local
1363 Matcher<const std::string> m1 = ContainsRegex("Hi.*"); local
1448 Matcher<const ::std::wstring&> m1 = StrCaseEq(str1); local
1490 const Matcher< ::std::wstring> m1 = HasSubstr(L"foo"); local
1501 const Matcher<wchar_t*> m1 = HasSubstr(L"foo"); local
1521 const Matcher<const wchar_t*> m1 = StartsWith(::std::wstring(L"")); local
1542 const Matcher<const wchar_t*> m1 = EndsWith(L""); local
1639 Matcher<const ::wstring&> m1 = StrCaseEq(str1); local
1681 const Matcher< ::wstring> m1 = HasSubstr(L"foo"); local
1692 const Matcher<wchar_t*> m1 = HasSubstr(L"foo"); local
1712 const Matcher<const wchar_t*> m1 = StartsWith(::wstring(L"")); local
1733 const Matcher<const wchar_t*> m1 = EndsWith(L""); local
2515 Matcher<RawType> m1 = matcher_maker(0.0); local
2632 Matcher<float> m1 = FloatEq(2.0f); local
2646 Matcher<float> m1 = NanSensitiveFloatEq(2.0f); local
2687 Matcher<double> m1 = DoubleEq(2.0); local
2701 Matcher<double> m1 = NanSensitiveDoubleEq(2.0); local
4005 const Matcher<tuple<const double&, const int&> > m1 = IsHalfOf(); local
[all...] |
| /external/eigen/unsupported/test/ |
| alignedvector3.cpp | 24 Mat33 m1(Mat33::Random());
38 VERIFY_IS_APPROX(m1*f4,m1*r4);
39 VERIFY_IS_APPROX(f4.transpose()*m1,r4.transpose()*m1);
|
