| /external/eigen/Eigen/src/Householder/ |
| BlockHouseholder.h | 26 const Index nbVecs = vectors.cols();
27 eigen_assert(triFactor.rows() == nbVecs && triFactor.cols() == nbVecs && vectors.rows()>=nbVecs);
50 Index nbVecs = vectors.cols();
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BasicPreconditioners.h | 46 DiagonalPreconditioner(const MatType& mat) : m_invdiag(mat.cols())
52 Index cols() const { return m_invdiag.size(); } function in class:Eigen::DiagonalPreconditioner
63 m_invdiag.resize(mat.cols());
|
| IterativeSolverBase.h | 117 Index cols() const { return mp_matrix ? mp_matrix->cols() : 0; } function in class:Eigen::IterativeSolverBase
138 return (mp_matrix && m_maxIterations<0) ? mp_matrix->cols() : m_maxIterations;
202 int rhsCols = b.cols();
|
| /external/eigen/Eigen/src/MetisSupport/ |
| MetisSupport.h | 31 Index m = A.cols();
32 eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED MATRICES");
105 Index m = A.cols();
|
| /external/opencv/cxcore/src/ |
| cxutils.cpp | 78 if( (labels->rows != 1 && (labels->cols != 1 || !CV_IS_MAT_CONT(labels->type))) ||
79 labels->rows + labels->cols - 1 != samples->rows )
91 dims = samples->cols*CV_MAT_CN(samples->type);
102 counters->cols = cluster_count; // cut down counters
289 coeff_count = coeffs->rows + coeffs->cols - 1;
291 if( (coeffs->rows != 1 && coeffs->cols != 1) || (coeff_count != 3 && coeff_count != 4) )
295 if( (roots->rows != 1 && roots->cols != 1) ||
296 roots->rows + roots->cols - 1 != 3 )
657 m = a->rows * a->cols;
658 n = r->rows * r->cols;
819 int cont_flag, arr_size, elem_size, cols, step; local
918 int rows, cols; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvtrifocal.cpp | 109 for(j=0;j<matrix->cols;j++)
138 numPoints = points->cols;
139 if( numPoints <= 0 || numPoints != normPoints->cols )
149 if(cameraMatr->rows != 3 || cameraMatr->cols != 3)
202 if( (points1->cols != points2->cols) || (points1->cols != points3->cols) || (points1->cols != 6) /* || (points4D->cols !=6) */
[all...] |
| /external/ceres-solver/internal/ceres/ |
| block_jacobian_writer.cc | 156 bs->cols.resize(parameter_blocks.size());
160 bs->cols[i].size = parameter_blocks[i]->LocalSize();
161 bs->cols[i].position = cursor;
162 cursor += bs->cols[i].size;
|
| compressed_row_sparse_matrix.cc | 47 // duplicates in the pair of arrays rows and cols, i.e., there is no
50 // rows[i] == rows[j] && cols[i] == cols[j]
54 RowColLessThan(const int* rows, const int* cols)
55 : rows(rows), cols(cols) {
60 return (cols[x] < cols[y]);
66 const int* cols; member in struct:ceres::internal::__anon6384::RowColLessThan
107 sort(index.begin(), index.end(), RowColLessThan(m.rows(), m.cols()));
330 int* cols = matrix->mutable_cols(); local
[all...] |
| normal_prior.cc | 46 CHECK_EQ(b_.rows(), A.cols());
|
| /external/eigen/Eigen/src/Core/ |
| Swap.h | 39 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::SwapWrapper
77 && colId >= 0 && colId < cols());
98 && colId >= 0 && colId < cols());
|
| TriangularMatrix.h | 50 inline Index cols() const { return derived().cols(); } function in class:Eigen::TriangularBase
88 DenseMatrixType res(rows(), cols());
99 eigen_assert(col>=0 && col<cols() && row>=0 && row<rows());
196 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::TriangularView
213 { return *this = MatrixType::Constant(rows(), cols(), value); }
480 for(Index j = 0; j < dst.cols(); ++j)
498 for(Index j = 0; j < dst.cols(); ++j)
517 for(Index j = 0; j < dst.cols(); ++j
[all...] |
| NestByValue.h | 46 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::NestByValue
|
| /external/eigen/Eigen/src/Core/products/ |
| TriangularMatrixVector.h | 41 Index cols = IsLower ? (std::min)(_rows,_cols) : _cols; local
44 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
48 const RhsMap rhs(_rhs,cols,InnerStride<>(rhsIncr));
78 if((!IsLower) && cols>size)
81 rows, cols-size,
109 Index cols = IsLower ? diagSize : _cols; local
112 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
116 const RhsMap rhs(_rhs,cols);
135 Index r = IsLower ? pi : cols - pi - actualPanelWidth;
149 rows-diagSize, cols,
[all...] |
| 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; \
|
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR_MKL.h | 52 lapack_int n = mat.cols(); \
|
| /external/eigen/Eigen/src/SparseQR/ |
| SparseQR.h | 112 inline Index cols() const { return m_pmat.cols();} function in class:Eigen::SparseQR
178 y.resize((std::max)(cols(),Index(y.rows())),y.cols());
183 if (m_perm_c.size()) dest = colsPermutation() * y.topRows(cols());
184 else dest = y.topRows(cols());
287 Index n = mat.cols();
326 Index n = mat.cols();
583 inline Index rows() const { return m_transpose ? m_qr.rows() : m_qr.cols(); }
584 inline Index cols() const { return m_other.cols(); function in struct:Eigen::SparseQR_QProduct
649 inline Index cols() const { return (std::min)(m_qr.rows(),m_qr.cols()); } function in struct:Eigen::SparseQRMatrixQReturnType
[all...] |
| /external/eigen/test/ |
| cholesky.cpp | 68 Index cols = m.cols(); local
75 MatrixType a0 = MatrixType::Random(rows,cols);
77 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
82 MatrixType a1 = MatrixType::Random(rows,cols);
119 MatrixType m1 = MatrixType::Random(rows,cols), m2(rows,cols);
251 Index cols = m.cols(); local
[all...] |
| diagonal.cpp | 18 Index cols = m.cols(); local
20 MatrixType m1 = MatrixType::Random(rows, cols),
21 m2 = MatrixType::Random(rows, cols);
|
| redux.cpp | 19 Index cols = m.cols(); local
21 MatrixType m1 = MatrixType::Random(rows, cols);
25 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + RealScalar(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...] |
| /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++)
|
| /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...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/vpx/ |
| vp8cx.h | 244 unsigned int cols; /**< Number of columns. */ member in struct:vpx_roi_map
264 unsigned int cols; /**< number of cols */ member in struct:vpx_active_map
|
