| /external/eigen/test/ |
| selfadjoint.cpp | 21 Index cols = m.cols(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m3(rows, cols);
|
| sizeoverflow.cpp | 24 void triggerMatrixBadAlloc(Index rows, Index cols)
26 VERIFY_THROWS_BADALLOC( MatrixType m(rows, cols) );
27 VERIFY_THROWS_BADALLOC( MatrixType m; m.resize(rows, cols) );
28 VERIFY_THROWS_BADALLOC( MatrixType m; m.conservativeResize(rows, cols) );
41 // there are 2 levels of overflow checking. first in PlainObjectBase.h we check for overflow in rows*cols computations.
|
| linearstructure.cpp | 22 Index cols = m.cols(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols);
34 c = internal::random<Index>(0, cols-1);
65 VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1);
66 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), m1.cwiseProduct(m1));
67 VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1);
68 VERIFY_IS_APPROX(m1.block(0,0,rows,cols) * s1, m1 * s1)
[all...] |
| product_selfadjoint.cpp | 22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
56 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
58 m3.block(1,1,rows-1,cols-1) += v1.tail(rows-1) * v2.head(cols-1).adjoint()+ v2.head(cols-1) * v1.tail(rows-1).adjoint();
|
| eigen2support.cpp | 20 Index cols = m.cols(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m3(rows, cols);
30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
|
| product_extra.cpp | 22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
26 m3(rows, cols),
27 mzero = MatrixType::Zero(rows, cols),
31 square2 = MatrixType::Random(cols, cols),
32 res2 = MatrixType::Random(cols, cols);
[all...] |
| integer_types.cpp | 28 Index cols = m.cols(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
62 Index cols = m.cols(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, cols),
[all...] |
| /external/opencv/cvaux/src/ |
| cvvideo.cpp | 64 if( frame->cols != even->cols || frame->cols != odd->cols ||
|
| /external/eigen/test/eigen2/ |
| eigen2_sum.cpp | 17 int cols = m.cols(); 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);
|
| /external/eigen/Eigen/src/Core/ |
| EigenBase.h | 43 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
46 inline Index cols() const { return derived().cols(); } function in struct:Eigen::EigenBase
47 /** \returns the number of coefficients, which is rows()*cols().
48 * \sa rows(), cols(), SizeAtCompileTime. */
49 inline Index size() const { return rows() * cols(); }
60 typename Dest::PlainObject res(rows(),cols());
70 typename Dest::PlainObject res(rows(),cols());
|
| /external/ceres-solver/internal/ceres/ |
| incomplete_lq_factorization_test.cc | 52 EXPECT_EQ(expected.cols()[i], actual.cols()[i]);
85 int* cols = matrix.mutable_cols(); local
94 cols[idx] = j;
141 EXPECT_EQ(matrix.cols()[0], 0);
149 EXPECT_EQ(matrix.cols()[idx], idx - matrix.rows()[1]);
159 EXPECT_EQ(matrix.cols()[matrix.rows()[2]], 0);
160 EXPECT_EQ(matrix.cols()[matrix.rows()[2] + 1], 3);
161 EXPECT_EQ(matrix.cols()[matrix.rows()[2] + 2], 5);
173 EXPECT_EQ(matrix.cols()[matrix.rows()[3]], 0)
[all...] |
| triplet_sparse_matrix_test.cc | 81 EXPECT_EQ(m.cols()[0], 1);
82 EXPECT_EQ(m.cols()[1], 4);
122 EXPECT_EQ(cpy.cols()[0], 1);
123 EXPECT_EQ(cpy.cols()[1], 4);
168 EXPECT_EQ(cpy.cols()[0], 1);
169 EXPECT_EQ(cpy.cols()[1], 4);
221 EXPECT_EQ(m.cols()[0], 1);
222 EXPECT_EQ(m.cols()[1], 4);
223 EXPECT_EQ(m.cols()[2], 1);
224 EXPECT_EQ(m.cols()[3], 4)
[all...] |
| compressed_row_sparse_matrix_test.cc | 224 EXPECT_EQ(crsm->num_nonzeros(), crs_matrix.cols.size());
232 EXPECT_EQ(crsm->cols()[i], crs_matrix.cols[i]);
284 int* cols = matrix_->mutable_cols(); local
288 cols[0] = 0;
292 cols[1] = 1;
296 cols[2] = 1;
298 cols[3] = 2;
302 cols[4] = 0;
304 cols[5] = 1
351 int* cols = matrix.mutable_cols(); local
438 vector<int> cols; local
[all...] |
| block_sparse_matrix.cc | 57 for (int i = 0; i < block_structure_->cols.size(); ++i) {
58 num_cols_ += block_structure_->cols[i].size;
70 int col_block_size = block_structure_->cols[col_block_id].size;
98 int col_block_size = block_structure_->cols[col_block_id].size;
99 int col_block_pos = block_structure_->cols[col_block_id].position;
118 int col_block_size = block_structure_->cols[col_block_id].size;
119 int col_block_pos = block_structure_->cols[col_block_id].position;
136 int col_block_size = block_structure_->cols[col_block_id].size;
137 int col_block_pos = block_structure_->cols[col_block_id].position;
153 int col_block_size = block_structure_->cols[col_block_id].size
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixVector_MKL.h | 57 Index rows, Index cols, \
64 rows, cols, lhs, lhsStride, rhs, rhsIncr, res, resIncr, alpha); \
67 rows, cols, lhs, lhsStride, rhs, rhsIncr, res, resIncr, alpha); \
74 Index rows, Index cols, \
80 rows, cols, lhs, lhsStride, rhs, rhsIncr, res, resIncr, alpha); \
96 Index rows, Index cols, \
101 MKL_INT m=rows, n=cols, lda=lhsStride, incx=rhsIncr, incy=resIncr; \
106 m=cols; \
113 Map<const GEMVVector, 0, InnerStride<> > map_x(rhs,cols,1,InnerStride<>(incx)); \
|
| /external/eigen/Eigen/src/SVD/ |
| UpperBidiagonalization.h | 56 : m_householder(matrix.rows(), matrix.cols()),
57 m_bidiagonal(matrix.cols(), matrix.cols()),
78 .setLength(m_householder.cols()-1)
92 Index cols = matrix.cols(); local
94 eigen_assert(rows >= cols && "UpperBidiagonalization is only for matrices satisfying rows>=cols.");
100 for (Index k = 0; /* breaks at k==cols-1 below */ ; ++k)
103 Index remainingCols = cols - k - 1
[all...] |
| JacobiSVD.h | 79 if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols())
82 ::new (&m_qr) QRType(svd.rows(), svd.cols());
89 if(matrix.rows() > matrix.cols())
92 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>();
124 if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols())
127 ::new (&m_qr) QRType(svd.cols(), svd.rows());
129 m_adjoint.resize(svd.cols(), svd.rows())
741 inline Index cols() const { return m_cols; } function in class:Eigen::JacobiSVD
[all...] |
| /external/eigen/bench/ |
| sparse_cholesky.cpp | 44 void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatrix& dst)
46 dst.startFill(rows*cols*density);
47 for(int j = 0; j < cols; j++)
80 int cols = SIZE; local
84 VectorXf b = VectorXf::Random(cols);
85 VectorXf x = VectorXf::Random(cols);
92 EigenSparseSelfAdjointMatrix sm1(rows, cols);
94 fillSpdMatrix(density, rows, cols, sm1);
103 DenseMatrix m1(rows,cols);
117 for (int j=0; j<cols; ++j
[all...] |
| sparse_lu.cpp | 75 int cols = SIZE; local
79 VectorX b = VectorX::Random(cols);
80 VectorX x = VectorX::Random(cols);
87 EigenSparseMatrix sm1(rows, cols);
88 fillMatrix(density, rows, cols, sm1);
96 DenseMatrix m1(rows,cols);
|
| BenchSparseUtil.h | 27 void fillMatrix(float density, int rows, int cols, EigenSparseMatrix& dst)
29 dst.reserve(double(rows)*cols*density);
30 for(int j = 0; j < cols; j++)
42 void fillMatrix2(int nnzPerCol, int rows, int cols, EigenSparseMatrix& dst)
44 // std::cout << "alloc " << nnzPerCol*cols << "\n";
45 dst.reserve(nnzPerCol*cols);
46 for(int j = 0; j < cols; j++)
65 for (int j=0; j<src.cols(); ++j)
76 GmmDynSparse tmp(src.rows(), src.cols());
77 for (int j=0; j<src.cols(); ++j
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/arm/neon/ |
| vp9_subtract_neon.c | 17 void vp9_subtract_block_neon(int rows, int cols,
23 if (cols > 16) {
25 for (c = 0; c < cols; c += 32) {
47 } else if (cols > 8) {
61 } else if (cols > 4) {
73 for (c = 0; c < cols; ++c)
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR_MKL.h | 55 Index cols = matrix.cols();\
61 m_colsTranspositions.resize(cols);\
66 m_colsPermutation.resize(cols); \
71 LAPACKE_##MKLPREFIX##geqp3( matrix_order, rows, cols, (MKLTYPE*)m_qr.data(), lda, (lapack_int*)m_colsPermutation.indices().data(), (MKLTYPE*)m_hCoeffs.data()); \
80 for(i=0;i<cols;i++) perm[i]--;\
|
| /external/chromium_org/third_party/pexpect/ |
| screen.py | 69 self.cols = c
76 self.w = [ [SPACE] * self.cols for c in range(self.rows)]
98 top_bot = '+' + '-'*self.cols + '+\n'
103 self.fill_region (1,1,self.rows,self.cols, ch)
109 cs = constrain (cs, 1, self.cols)
110 ce = constrain (ce, 1, self.cols)
158 c = constrain (c, 1, self.cols)
177 c = constrain (c, 1, self.cols)
178 for ci in range (self.cols, c, -1):
189 c = constrain (c, 1, self.cols)
[all...] |
| /external/lldb/test/pexpect-2.4/ |
| screen.py | 53 self.cols = c
60 self.w = [ [SPACE] * self.cols for c in range(self.rows)]
82 top_bot = '+' + '-'*self.cols + '+\n'
87 self.fill_region (1,1,self.rows,self.cols, ch)
93 cs = constrain (cs, 1, self.cols)
94 ce = constrain (ce, 1, self.cols)
142 c = constrain (c, 1, self.cols)
161 c = constrain (c, 1, self.cols)
162 for ci in range (self.cols, c, -1):
173 c = constrain (c, 1, self.cols)
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| GeneralizedEigenSolver.h | 149 : m_eivec(A.rows(), A.cols()),
150 m_alphas(A.cols()),
151 m_betas(A.cols()),
154 m_realQZ(A.cols()),
155 m_matS(A.rows(), A.cols()),
156 m_tmp(A.cols())
283 // Index n = m_eivec.cols();
295 eigen_assert(A.cols() == A.rows() && B.cols() == A.rows() && B.cols() == B.rows())
[all...] |
