| /external/eigen/test/ |
| diagonal.cpp | 21 Index cols = m.cols(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols);
|
| visitor.cpp | 18 Index cols = p.cols(); local
22 m = MatrixType::Random(rows, cols);
30 for(Index j = 0; j < cols; j++)
|
| redux.cpp | 19 Index cols = m.cols(); local
21 MatrixType m1 = MatrixType::Random(rows, cols);
25 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + Scalar(0.2) * m1;
27 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows, cols).sum(), Scalar(1));
28 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
30 for(int j = 0; j < cols; j++)
38 const Scalar mean = s/Scalar(RealScalar(rows*cols));
48 Index c0 = internal::random<Index>(0,cols-1)
[all...] |
| sparse_permutations.cpp | 17 const Index cols = ref.cols(); local
24 double density = (std::max)(8./(rows*cols), 0.01);
26 SparseMatrixType mat(rows, cols), up(rows,cols), lo(rows,cols);
28 DenseMatrix mat_d = DenseMatrix::Zero(rows, cols), up_sym_d, lo_sym_d, res_d;
44 randomPermutationVector(pi, cols);
|
| adjoint.cpp | 26 Index cols = m.cols(); local
28 MatrixType m1 = MatrixType::Random(rows, cols),
29 m2 = MatrixType::Random(rows, cols),
30 m3(rows, cols),
75 c = internal::random<Index>(0, cols-1);
|
| /external/eigen/test/eigen2/ |
| eigen2_visitor.cpp | 17 int cols = p.cols(); local
21 m = MatrixType::Random(rows, cols);
29 for(int j = 0; j < cols; j++)
|
| sparse.h | 52 sparseMat.startFill(int(refMat.rows()*refMat.cols()*density));
53 for(int j=0; j<refMat.cols(); j++)
95 sparseMat.startFill(int(refMat.rows()*refMat.cols()*density));
96 for(int j=0; j<refMat.cols(); j++)
|
| eigen2_sparse_basic.cpp | 49 const int cols = ref.cols(); local
53 double density = std::max(8./(rows*cols), 0.01);
58 SparseMatrixType m(rows, cols);
59 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
87 int j = ei_random<int>(0,cols-1);
89 int w = ei_random<int>(1,cols-j-1);
111 for(int c=0; c<cols; c++)
167 DenseMatrix m1(rows,cols);
169 SparseMatrixType m2(rows,cols);
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/nanox/ |
| SDL_nxmodes.c | 62 GrResizeWindow (FSwindow, si.cols, si.rows) ;
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| UmfPackSupport.h | 154 inline Index cols() const { return m_copyMatrix.cols(); } function in class:Eigen::UmfPackLU
243 errorCode = umfpack_symbolic(matrix.rows(), matrix.cols(), m_outerIndexPtr, m_innerIndexPtr, m_valuePtr,
300 m_copyMatrix.resize(mat.rows(), mat.cols());
347 int lnz, unz, rows, cols, nz_udiag; local
348 umfpack_get_lunz(&lnz, &unz, &rows, &cols, &nz_udiag, m_numeric, Scalar());
351 m_l.resize(rows,(std::min)(rows,cols));
354 m_u.resize((std::min)(rows,cols),cols);
358 m_q.resize(cols);
[all...] |
| /external/opencv/cv/src/ |
| cvfundam.cpp | 113 int i, count = _err->rows*_err->cols, goodCount = 0;
176 int count = m1->rows*m1->cols, maxGoodCount = 0;
271 int count = m1->rows*m1->cols;
361 int count = m1->cols*m1->rows;
446 int i, count = m1->rows*m1->cols;
509 int i, count = m1->rows*m1->cols;
527 int i, j, k, count = m1->rows*m1->cols;
530 CvMat modelPart = cvMat( solver.param->rows, solver.param->cols, model->type, model->data.ptr );
594 count = MAX(imagePoints->cols, imagePoints->rows);
606 (mask->rows == 1 || mask->cols == 1) &
[all...] |
| /packages/apps/Exchange/src/com/android/exchange/service/ |
| EasOutboxSyncHandler.java | 202 String[] cols = Utility.getRowColumns(context, Body.CONTENT_URI, BODY_SOURCE_PROJECTION, local
206 if (cols != null && cols[0] != null) {
207 refId = Long.parseLong(cols[0]);
209 cols = Utility.getRowColumns(context, Message.CONTENT_URI, refId,
212 if (cols != null) {
213 itemId = cols[0];
214 final long boxId = Long.parseLong(cols[1]);
216 cols = Utility.getRowColumns(context, Mailbox.CONTENT_URI, boxId,
218 if (cols != null)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLFrameSetElement.idl | 23 [Reflect] attribute DOMString cols;
|
| /external/eigen/Eigen/src/Core/ |
| NestByValue.h | 46 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::NestByValue
|
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixMatrix_MKL.h | 51 Index rows, Index cols, \
67 n = (MKL_INT)cols; \
102 Index rows, Index cols, \
119 n = (MKL_INT)cols; \
178 Index rows, Index cols, \
193 n = (MKL_INT)cols; \
228 Index rows, Index cols, \
244 n = (MKL_INT)cols; \
|
| TriangularMatrixVector_MKL.h | 94 Index cols = IsLower ? size : _cols; \
100 Map<const VectorRhs, 0, InnerStride<> > rhs(_rhs,cols,InnerStride<>(rhsIncr)); \
131 if (size<(std::max)(rows,cols)) { \
146 n = cols-size; \
179 Index cols = IsLower ? size : _cols; \
185 Map<const VectorRhs, 0, InnerStride<> > rhs(_rhs,cols,InnerStride<>(rhsIncr)); \
216 if (size<(std::max)(rows,cols)) { \
231 n = cols-size; \
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| RealSchur_MKL.h | 51 assert(matrix.cols() == matrix.rows()); \
53 lapack_int n = matrix.cols(), sdim, info; \
|
| SelfAdjointEigenSolver_MKL.h | 47 eigen_assert(matrix.cols() == matrix.rows()); \
52 lapack_int n = matrix.cols(), lda, matrix_order, info; \
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseView.h | 45 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::SparseView
|
| /external/eigen/Eigen/src/misc/ |
| Image.h | 50 inline Index cols() const { return m_cols; } function in struct:Eigen::internal::image_retval_base
78 using Base::cols; \
|
| /external/eigen/Eigen/src/plugins/ |
| MatrixCwiseBinaryOps.h | 86 return cwiseMin(Derived::PlainObject::Constant(rows(), cols(), other));
110 return cwiseMax(Derived::PlainObject::Constant(rows(), cols(), other));
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineInplaceLU.h | 37 : /*m_matrix(matrix.rows(), matrix.cols()),*/ m_flags(flags), m_status(0), m_lu(matrix) {
122 const size_t cols = m_lu.cols(); local
124 eigen_assert(rows == cols && "We do not (yet) support rectangular LU.");
186 const size_t cols = m_lu.cols(); local
188 eigen_assert(rows == cols && "We do not (yet) support rectangular LU.");
309 const size_t cols = m_lu.cols(); local
|
| /external/libvpx/libvpx/vpx/ |
| vp8cx.h | 223 unsigned int cols; /**< Number of columns. */ member in struct:vpx_roi_map
243 unsigned int cols; /**< number of cols */ member in struct:vpx_active_map
|
| /external/ceres-solver/internal/ceres/ |
| schur_eliminator_test.cc | 72 num_eliminate_cols += bs->cols[i].size;
88 const int schur_size = J.cols() - num_eliminate_cols;
96 sol_expected.resize(J.cols());
111 const int block_size = bs->cols[i].size;
131 const int num_col_blocks = bs->cols.size();
134 blocks[i - num_eliminate_blocks] = bs->cols[i].size;
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| CwiseOperators.h | 216 typename ExpressionType::ConstantReturnType(_expression().rows(), _expression().cols(), s));
225 typename ExpressionType::ConstantReturnType(_expression().rows(), _expression().cols(), s));
234 typename ExpressionType::ConstantReturnType(_expression().rows(), _expression().cols(), s));
243 typename ExpressionType::ConstantReturnType(_expression().rows(), _expression().cols(), s));
252 typename ExpressionType::ConstantReturnType(_expression().rows(), _expression().cols(), s));
261 typename ExpressionType::ConstantReturnType(_expression().rows(), _expression().cols(), s));
|
