| /external/eigen/test/eigen2/ |
| eigen2_newstdvector.cpp | 18 int rows = m.rows(); local
20 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
21 std::vector<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);
|
| eigen2_qtvector.cpp | 23 int rows = m.rows(); local
25 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
26 QVector<MatrixType> v(10, MatrixType(rows,cols)), w(20, y);
|
| eigen2_stdvector.cpp | 17 int rows = m.rows(); local
19 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
20 std::vector<MatrixType, aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);
|
| eigen2_sum.cpp | 16 int rows = m.rows(); local
19 MatrixType m1 = MatrixType::Random(rows, cols);
21 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows, cols).sum(), Scalar(1));
22 VERIFY_IS_APPROX(MatrixType::Ones(rows, cols).sum(), Scalar(float(rows*cols))); // the float() here to shut up excessive MSVC warning about int->complex conversion being lossy
24 for(int i = 0; i < rows; i++) for(int j = 0; j < cols; j++) x += m1(i,j);
|
| eigen2_svd.cpp | 18 int rows = m.rows(); local
23 MatrixType a = MatrixType::Random(rows,cols);
25 Matrix<Scalar, MatrixType::RowsAtCompileTime, 1>::Random(rows,1);
34 MatrixType sigma = MatrixType::Zero(rows,cols);
35 MatrixType matU = MatrixType::Zero(rows,rows);
37 matU.block(0,0,rows,cols) = svd.matrixU();
42 if (rows==cols)
46 MatrixType a1 = MatrixType::Random(rows,cols)
[all...] |
| eigen2_swap.cpp | 31 int rows = m.rows(); local
35 MatrixType m1 = MatrixType::Random(rows,cols);
36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols);
37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols);
58 m1.swap(m2.block(0,0,rows,cols));
|
| /external/eigen/test/ |
| inverse.cpp | 20 Index rows = m.rows(); local
27 MatrixType m1(rows, cols),
28 m2(rows, cols),
29 identity = MatrixType::Identity(rows, rows);
30 createRandomPIMatrixOfRank(rows,rows,rows,m1);
62 VectorType v3 = VectorType::Random(rows);
[all...] |
| jacobi.cpp | 19 Index rows = m.rows(); local
29 const MatrixType a(MatrixType::Random(rows, cols));
36 Index p = internal::random<Index>(0, rows-1);
39 q = internal::random<Index>(0, rows-1);
|
| linearstructure.cpp | 20 Index rows = m.rows(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols);
32 Index r = internal::random<Index>(0, rows-1),
64 VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1);
65 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), m1.cwiseProduct(m1));
66 VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1);
67 VERIFY_IS_APPROX(m1.block(0,0,rows,cols) * s1, m1 * s1)
[all...] |
| mapstaticmethods.cpp | 72 int rows = m.rows(), cols = m.cols(); local
76 PlainObjectType::Map(ptr, rows, cols).setZero();
77 PlainObjectType::MapAligned(ptr, rows, cols).setZero();
78 PlainObjectType::Map(const_ptr, rows, cols).sum();
79 PlainObjectType::MapAligned(const_ptr, rows, cols).sum();
81 PlainObjectType::Map(ptr, rows, cols, InnerStride<>(i)).setZero();
82 PlainObjectType::MapAligned(ptr, rows, cols, InnerStride<>(i)).setZero();
83 PlainObjectType::Map(const_ptr, rows, cols, InnerStride<>(i)).sum();
84 PlainObjectType::MapAligned(const_ptr, rows, cols, InnerStride<>(i)).sum()
[all...] |
| mapstride.cpp | 56 Index rows = _m.rows(), cols = _m.cols(); local
58 MatrixType m = MatrixType::Random(rows,cols);
60 Index arraysize = 2*(rows+4)*(cols+4);
69 Map<MatrixType, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1));
88 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4));
101 Map<MatrixType, Alignment, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2));
|
| miscmatrices.cpp | 21 Index rows = m.rows(); local
24 Index r = internal::random<Index>(0, rows-1), r2 = internal::random<Index>(0, rows-1), c = internal::random<Index>(0, cols-1);
25 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
26 MatrixType m1 = MatrixType::Ones(rows,cols);
28 VectorType v1 = VectorType::Random(rows);
34 square = MatrixType::Zero(rows, rows);
35 square.diagonal() = VectorType::Ones(rows);
[all...] |
| product_trmv.cpp | 21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m3(rows, cols);
26 VectorType v1 = VectorType::Random(rows);
30 m1 = MatrixType::Random(rows, cols);
|
| qtvector.cpp | 23 Index rows = m.rows(); local
25 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
26 QVector<MatrixType> v(10, MatrixType(rows,cols)), w(20, y);
|
| selfadjoint.cpp | 21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m3(rows, cols);
|
| stddeque.cpp | 20 Index rows = m.rows(); local
22 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
23 std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);
|
| stdlist.cpp | 20 Index rows = m.rows(); local
22 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
23 std::list<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);
|
| stdvector.cpp | 17 typename MatrixType::Index rows = m.rows(); local
19 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
20 std::vector<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);
|
| stdvector_overload.cpp | 31 typename MatrixType::Index rows = m.rows(); local
33 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
34 std::vector<MatrixType> v(10, MatrixType(rows,cols)), w(20, y);
|
| swap.cpp | 31 typename MatrixType::Index rows = m.rows(); local
35 MatrixType m1 = MatrixType::Random(rows,cols);
36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols);
37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols);
58 m1.swap(m2.block(0,0,rows,cols));
|
| vectorwiseop.cpp | 22 Index rows = m.rows(); local
24 Index r = internal::random<Index>(0, rows-1),
27 ArrayType m1 = ArrayType::Random(rows, cols),
28 m2(rows, cols),
29 m3(rows, cols);
31 ColVectorType colvec = ColVectorType::Random(rows);
115 Index rows = m.rows(); local
117 Index r = internal::random<Index>(0, rows-1)
[all...] |
| /external/libvpx/libvpx/vp9/common/ |
| vp9_debugmodes.c | 31 int rows = cm->mi_rows; local
37 for (mi_row = 0; mi_row < rows; mi_row++) {
56 int rows = cm->mi_rows; local
67 for (mi_row = 0; mi_row < rows; mi_row++) {
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_linear.h | 63 unsigned rows; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
100 if (t->size < t->stride * t->rows * t->tiles_y)
|
| /external/opencv/cv/src/ |
| cvadapthresh.cpp | 53 int i, j, rows, cols; local
66 rows = src->rows;
72 CV_CALL( mean = cvCreateMat( rows, cols, CV_8UC1 ));
86 for( i = 0; i < rows; i++ )
|
| /frameworks/base/core/tests/coretests/src/android/database/sqlite/ |
| SQLiteCursorTest.java | 81 Set<Integer> rows = new HashSet<Integer>(); local
86 rows.add(j); // store in a hashtable so we can verify the results from cursor later on
90 assertEquals(N, rows.size());
102 assertTrue(rows.contains(val));
103 assertTrue(rows.remove(val));
105 // did I see all the rows in the table?
106 assertTrue(rows.isEmpty());
109 rows = new HashSet<Integer>();
113 rows.add(j);
122 assertEquals(M, rows.size())
[all...] |
