| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| MINRES.h | 42 const int N(mat.cols()); // the size of the matrix
256 for(int j=0; j<b.cols(); ++j)
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMqrsolv.h | 22 template <typename Scalar,int Rows, int Cols, typename Index>
24 Matrix<Scalar,Rows,Cols> &s,
35 Index n = s.cols();
115 Index n = s.cols();
|
| /external/eigen/unsupported/test/ |
| bdcsvd.cpp | 55 MatrixType m = pickrandom ? MatrixType::Random(a.rows(), a.cols()) : a;
88 MatrixType m = MatrixType::Random(a.rows(), a.cols());
|
| /external/lldb/test/pexpect-2.4/examples/ |
| bd_serv.py | 258 def pretty_box (rows, cols, s):
263 top_bot = '+' + '-'*cols + '+\n'
|
| /external/opencv/cv/src/ |
| cvcondens.cpp | 249 if( (lowerBound->cols != 1) || (upperBound->cols != 1) )
|
| cvconvhull.cpp | 296 if( (mat->cols != 1 && mat->rows != 1) || !CV_IS_MAT_CONT(mat->type))
300 if( mat->cols + mat->rows - 1 < ptseq->total )
311 mat->cols + mat->rows - 1, &hull_header.s, &hullblock ));
489 if( mat->rows > mat->cols )
492 mat->cols = hullseq->total;
578 if( (mat->cols != 1 && mat->rows != 1) ||
583 if( mat->cols + mat->rows - 1 > ptseq->total )
589 mat->cols + mat->rows - 1, &hull_header.s, &hullblock ));
|
| cvfeatureselect.cpp | 98 CV_CALL( _eigImg = cvCreateMat( img->rows, img->cols, CV_32FC1 ));
108 CV_CALL( _tmpImg = cvCreateMat( img->rows, img->cols, CV_32FC1 ));
|
| cvgeometry.cpp | 370 matrixM->cols == 3 && matrixM->rows == 3 &&
548 if(projMatr->cols != 4 || projMatr->rows != 3)
551 if(calibMatr->cols != 3 || calibMatr->rows != 3 || rotMatr->cols != 3 || rotMatr->rows != 3)
554 if(posVect->cols != 1 || posVect->rows != 4)
|
| /external/libvpx/libvpx/vp9/common/x86/ |
| vp9_postproc_mmx.asm | 24 ; int cols,
148 cmp edx, dword ptr arg(5) ;cols
150 ; done with the all cols, start the across filtering in place
239 cmp edx, dword ptr arg(5) ;cols
266 ; int pitch, int rows, int cols,int flimit)
295 ;for(c=0; c<cols; c+=4)
445 sub dword arg(3), 4 ; cols -= 4
|
| vp9_postproc_sse2.asm | 21 ; int cols,
134 cmp edx, dword arg(5) ;cols
138 ; done with the all cols, start the across filtering in place
221 cmp edx, dword arg(5) ;cols
252 ; int pitch, int rows, int cols,int flimit)
284 ;for(c=0; c<cols; c+=8)
434 sub dword arg(3), 8 ; cols -= 8
453 ; int pitch, int rows, int cols,int flimit)
510 movsxd rdx, dword arg(3) ;cols
|
| /external/eigen/Eigen/src/Core/ |
| VectorwiseOp.h | 82 Index cols() const { return (Direction==Horizontal ? 1 : m_matrix.cols()); } function in class:Eigen::PartialReduxExpr
214 { return Direction==Vertical?m_matrix.cols():m_matrix.rows(); }
235 Direction==Horizontal ? 1 : m_matrix.cols());
257 Direction==Vertical ? 1 : m_matrix.cols());
|
| GeneralProduct.h | 45 template<int Rows, int Cols, int Depth> struct product_type_selector;
65 Cols = _Rhs::ColsAtCompileTime,
78 cols_select = product_size_category<Cols,MaxCols>::value,
91 EIGEN_DEBUG_VAR(Cols);
233 const Index cols = dest.cols(); local
234 for (Index j=0; j<cols; ++j)
347 eigen_assert(m_lhs.rows() == dst.rows() && m_rhs.cols() == dst.cols());
463 actualLhs.rows(), actualLhs.cols(),
[all...] |
| Redux.h | 175 eigen_assert(mat.rows()>0 && mat.cols()>0 && "you are using an empty matrix");
259 eigen_assert(mat.rows()>0 && mat.cols()>0 && "you are using an empty matrix");
301 eigen_assert(mat.rows()>0 && mat.cols()>0 && "you are using an empty matrix");
|
| /external/eigen/unsupported/Eigen/src/Eigenvalues/ |
| ArpackSelfAdjointEigenSolver.h | 351 eigen_assert(A.cols() == A.rows());
352 eigen_assert(B.cols() == B.rows());
353 eigen_assert(B.rows() == 0 || A.cols() == B.rows());
358 bool isBempty = (B.rows() == 0) || (B.cols() == 0);
366 int n = (int)A.cols();
|
| /external/opencv/cxcore/src/ |
| cxjacobieigens.cpp | 390 if( src->cols != src->rows )
396 if( (evals->rows != src->rows || evals->cols != 1) &&
397 (evals->cols != src->rows || evals->rows != 1))
411 evals->data.fl, src->cols, (float)eps ));
418 evals->data.db, src->cols, eps ));
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/x86/ |
| vp9_postproc_sse2.asm | 21 ; int cols,
134 cmp edx, dword arg(5) ;cols
138 ; done with the all cols, start the across filtering in place
221 cmp edx, dword arg(5) ;cols
252 ; int pitch, int rows, int cols,int flimit)
284 ;for(c=0; c<cols; c+=8)
434 sub dword arg(3), 8 ; cols -= 8
453 ; int pitch, int rows, int cols,int flimit)
510 movsxd rdx, dword arg(3) ;cols
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_postproc.c | 138 int cols,
155 for (col = 0; col < cols; col++) {
178 for (col = 0; col < cols; col++) {
217 int rows, int cols, int flimit) {
234 for (c = 0; c < cols + 8; c++) {
255 int rows, int cols, int flimit) {
259 for (c = 0; c < cols; c++) {
|
| /external/libvpx/x86/ |
| vp8_rtcd.h | 197 void vp8_mbpost_proc_across_ip_c(unsigned char *dst, int pitch, int rows, int cols,int flimit);
198 void vp8_mbpost_proc_across_ip_xmm(unsigned char *dst, int pitch, int rows, int cols,int flimit);
201 void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols,int flimit);
202 void vp8_mbpost_proc_down_mmx(unsigned char *dst, int pitch, int rows, int cols,int flimit);
203 void vp8_mbpost_proc_down_xmm(unsigned char *dst, int pitch, int rows, int cols,int flimit);
221 void vp8_post_proc_down_and_across_mb_row_c(unsigned char *src, unsigned char *dst, int src_pitch, int dst_pitch, int cols, unsigned char *flimits, int size);
222 void vp8_post_proc_down_and_across_mb_row_sse2(unsigned char *src, unsigned char *dst, int src_pitch, int dst_pitch, int cols, unsigned char *flimits, int size);
[all...] |
| /external/ceres-solver/internal/ceres/ |
| program.cc | 393 int* cols = tsm->mutable_cols(); local
412 cols = tsm->mutable_cols();
418 cols[num_nonzeros] = c;
|
| /external/chromium_org/third_party/libvpx/source/config/linux/generic/ |
| vp8_rtcd.h | 149 void vp8_mbpost_proc_across_ip_c(unsigned char *dst, int pitch, int rows, int cols,int flimit);
152 void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols,int flimit);
164 void vp8_post_proc_down_and_across_mb_row_c(unsigned char *src, unsigned char *dst, int src_pitch, int dst_pitch, int cols, unsigned char *flimits, int size);
|
| /external/chromium_org/third_party/libvpx/source/config/linux/mips64el/ |
| vp8_rtcd.h | 149 void vp8_mbpost_proc_across_ip_c(unsigned char *dst, int pitch, int rows, int cols,int flimit);
152 void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols,int flimit);
164 void vp8_post_proc_down_and_across_mb_row_c(unsigned char *src, unsigned char *dst, int src_pitch, int dst_pitch, int cols, unsigned char *flimits, int size);
|
| /external/chromium_org/third_party/libvpx/source/config/linux/mipsel/ |
| vp8_rtcd.h | 149 void vp8_mbpost_proc_across_ip_c(unsigned char *dst, int pitch, int rows, int cols,int flimit);
152 void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols,int flimit);
164 void vp8_post_proc_down_and_across_mb_row_c(unsigned char *src, unsigned char *dst, int src_pitch, int dst_pitch, int cols, unsigned char *flimits, int size);
|
| /external/chromium_org/third_party/libvpx/source/config/nacl/ |
| vp8_rtcd.h | 149 void vp8_mbpost_proc_across_ip_c(unsigned char *dst, int pitch, int rows, int cols,int flimit);
152 void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols,int flimit);
164 void vp8_post_proc_down_and_across_mb_row_c(unsigned char *src, unsigned char *dst, int src_pitch, int dst_pitch, int cols, unsigned char *flimits, int size);
|
| /external/libedit/src/ |
| el.c | 589 int lins, cols; local
597 if (terminal_get_size(el, &lins, &cols))
598 terminal_change_size(el, lins, cols);
|
| /external/opencv/ml/src/ |
| mltree.cpp | 215 sample_count = sample_idx->rows + sample_idx->cols - 1;
222 var_count = var_idx->rows + var_idx->cols - 1;
228 _responses->rows != 1 && _responses->cols != 1 ||
229 _responses->rows + _responses->cols - 1 != sample_all )
266 CV_CALL( cat_ofs = cvCreateMat( 1, cat_count->cols+1, CV_32SC1 ));
267 CV_CALL( cat_map = cvCreateMat( 1, cat_count->cols*10 + 128, CV_32SC1 ));
393 if( cat_map->cols < total_c_count + c_count )
397 MAX(cat_map->cols*3/2,total_c_count+c_count), CV_32SC1 ));
502 cat_map->cols = MAX( total_c_count, 1 );
586 int count = isubsample_idx->rows + isubsample_idx->cols - 1
[all...] |
