| /external/eigen/unsupported/test/ |
| splines.cpp | 216 for (Eigen::DenseIndex i=0; i<points.cols(); ++i)
228 for (Eigen::DenseIndex i=0; i<points.cols(); ++i)
|
| /external/opencv/cv/src/ |
| cvsurf.cpp | 120 int* xofs = (int*)cvStackAlloc(sum->cols*sizeof(xofs[0]));
134 hessian_cols = (sum->cols)*SIZE0/scale;
138 icvResizeHaarPattern( dx_s, Dx, NX, SIZE0, size, sum->cols );
139 icvResizeHaarPattern( dy_s, Dy, NY, SIZE0, size, sum->cols );
140 icvResizeHaarPattern( dxy_s, Dxy, NXY, SIZE0, size, sum->cols );
160 const int* sum_ptr = sum->data.i + sum->cols*(i*scale/SIZE0);
191 hessian_cols = hessians[k]->cols;
192 icvResizeHaarPattern( dm, &Dm, 1, SIZE0, size, mask_sum ? mask_sum->cols : sum->cols );
207 mask_sum->cols*((i-SIZE0/2)*scale/SIZE0)
[all...] |
| cvhough.cpp | 111 width = img->cols;
244 w = img->cols;
511 width = image->cols;
789 if( !CV_IS_MAT_CONT( mat->type ) || (mat->rows != 1 && mat->cols != 1) )
798 mat->rows + mat->cols - 1, &lines_header, &lines_block ));
830 if( mat->cols > mat->rows )
831 mat->cols = lines->total;
869 int rows, cols, arows, acols; local
876 CV_CALL( edges = cvCreateMat( img->rows, img->cols, CV_8UC1 ));
879 CV_CALL( dx = cvCreateMat( img->rows, img->cols, CV_16SC1 ))
[all...] |
| cvinpaint.cpp | 90 for( j = 0; j < f->cols; j++ )
120 for (j=0; j<f->cols; j++) {
252 if ((i<=0)||(j<=0)||(i>f->rows)||(j>f->cols)) continue;
268 for(j=0; j<f->cols; j++) {
294 if ((i<=1)||(j<=1)||(i>t->rows-1)||(j>t->cols-1)) continue;
336 int lm=l-1+(l==1),lp=l-1-(l==t->cols-2);
337 if (k>0&&l>0&&k<t->rows-1&&l<t->cols-1) {
407 if ((i<=1)||(j<=1)||(i>t->rows-1)||(j>t->cols-1)) continue;
449 int lm=l-1+(l==1),lp=l-1-(l==t->cols-2);
450 if (k>0&&l>0&&k<t->rows-1&&l<t->cols-1)
[all...] |
| /external/opencv/cxcore/src/ |
| cxminmaxloc.cpp | 407 if( minloc.x >= mat->cols )
409 minloc.y = minloc.x / mat->cols;
410 minloc.x -= minloc.y * mat->cols;
413 if( maxloc.x >= mat->cols )
415 maxloc.y = maxloc.x / mat->cols;
416 maxloc.x -= maxloc.y * mat->cols;
419 if( matmask && ((unsigned)minloc.x >= (unsigned)mat->cols ||
422 (unsigned)maxloc.x >= (unsigned)mat->cols ||
|
| cxsvd.cpp | 1230 t_svd; /* special case: a->rows < a->cols */
1245 if( a->rows >= a->cols )
1248 n = a->cols;
1250 w_cols = w->cols;
1260 m = a->cols;
1262 w_rows = w->cols;
1283 u_cols = u->cols;
1287 u_rows = u->cols;
[all...] |
| /external/opencv/cvaux/src/ |
| cvlevmarprojbandle.cpp | 91 numPoints = points4D->cols;
108 if( projMatr->rows != 3 || projMatr->cols != 4 )
118 if( status->rows != 1 || status->cols != numPoints )
128 if( derivProj->cols != 12 )
249 numPoints = presPoints->cols;
266 if( projMatr->rows != 3 || projMatr->cols != 4 )
276 if( presPoints->rows != 1 || presPoints->cols != numPoints )
332 if( derivPoint->rows != 2 || derivPoint->cols != currVisPoint*4 )
390 numPoints = presPoints[0]->cols;
478 numPoints = presPoints[0]->cols;
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| EigenSolver.h | 147 : m_eivec(matrix.rows(), matrix.cols()),
148 m_eivalues(matrix.cols()),
151 m_realSchur(matrix.cols()),
152 m_matT(matrix.rows(), matrix.cols()),
153 m_tmp(matrix.cols())
337 Index n = m_eivec.cols();
369 eigen_assert(matrix.cols() == matrix.rows());
381 m_eivalues.resize(matrix.cols());
383 while (i < matrix.cols())
385 if (i == matrix.cols() - 1 || m_matT.coeff(i+1, i) == Scalar(0))
[all...] |
| ComplexEigenSolver.h | 126 : m_eivec(matrix.rows(),matrix.cols()),
127 m_eivalues(matrix.cols()),
131 m_matX(matrix.rows(),matrix.cols())
255 eigen_assert(matrix.cols() == matrix.rows());
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 75 static const int Cols = Traits::ColsAtCompileTime;
81 typedef Matrix<ComplexScalar, Rows, Cols, Options, MaxRows, MaxCols> ComplexMatrix;
369 m_fT.resize(m_T.rows(), m_T.cols());
438 eigen_assert(A.rows() == A.cols());
440 eigen_assert(B.rows() == B.cols());
443 eigen_assert(C.cols() == B.rows());
529 Index cols() const { return m_A.cols(); } function in class:Eigen::MatrixFunctionReturnValue
553 eigen_assert(rows() == cols());
560 eigen_assert(rows() == cols());
[all...] |
| MatrixSquareRoot.h | 42 eigen_assert(A.rows() == A.cols());
82 result.resize(m_A.rows(), m_A.cols());
262 eigen_assert(A.rows() == A.cols());
288 result.resize(m_A.rows(), m_A.cols());
293 for (Index j = 1; j < m_A.cols(); j++) {
347 eigen_assert(A.rows() == A.cols());
358 MatrixType sqrtT = MatrixType::Zero(m_A.rows(), m_A.cols());
380 eigen_assert(A.rows() == A.cols());
441 Index cols() const { return m_src.cols(); } function in class:Eigen::MatrixSquareRootReturnValue
[all...] |
| /device/google/accessory/arduino/USB_Host_Shield/ |
| Max_LCD.h | 84 void begin(uint8_t cols, uint8_t rows, uint8_t charsize = LCD_5x8DOTS);
|
| /external/ceres-solver/internal/ceres/ |
| compressed_row_sparse_matrix.h | 62 // as the rows and cols matrices do not match the values of
106 const int* cols() const { return &cols_[0]; } function in class:ceres::internal::CompressedRowSparseMatrix
|
| triplet_sparse_matrix.h | 92 const int* cols() const { return cols_.get(); } function in class:ceres::internal::TripletSparseMatrix
|
| /external/chromium_org/third_party/skia/src/utils/ |
| SkPatchGrid.cpp | 11 SkPatchGrid::SkPatchGrid(int rows, int cols, VertexType flags, SkXfermode* xfer)
21 this->reset(rows, cols, flags, xfer);
122 void SkPatchGrid::reset(int rows, int cols, VertexType flags, SkXfermode* xMode) {
129 fCols = cols;
|
| /external/eigen/Eigen/src/Core/ |
| ArrayWrapper.h | 54 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::ArrayWrapper
174 inline Index cols() const { return m_expression.cols(); } function in class:Eigen::MatrixWrapper
|
| DiagonalMatrix.h | 57 inline Index cols() const { return diagonal().size(); } function in class:Eigen::DiagonalBase
295 if(cols() != rows()) return false;
297 for(Index j = 0; j < cols(); ++j)
302 for(Index j = 0; j < cols(); ++j)
|
| Ref.h | 143 : int(Flags)&RowMajorBit ? this->cols()
165 eigen_assert(expr.rows()==1 || expr.cols()==1);
170 eigen_assert(expr.rows()==1 || expr.cols()==1);
174 ::new (static_cast<Base*>(this)) Base(expr.data(), expr.rows(), expr.cols());
|
| Replicate.h | 90 inline Index cols() const { return m_matrix.cols() * m_colFactor.value(); } function in class:Eigen::Replicate
100 : colId%m_matrix.cols();
112 : colId%m_matrix.cols();
|
| /external/eigen/Eigen/src/SparseCore/ |
| MappedSparseMatrix.h | 50 inline Index cols() const { return IsRowMajor ? m_innerSize : m_outerSize; } function in class:Eigen::MappedSparseMatrix
108 inline MappedSparseMatrix(Index rows, Index cols, Index nnz, Index* outerIndexPtr, Index* innerIndexPtr, Scalar* valuePtr)
109 : m_outerSize(IsRowMajor?rows:cols), m_innerSize(IsRowMajor?cols:rows), m_nnz(nnz), m_outerIndex(outerIndexPtr),
|
| SparsePermutation.h | 53 inline int cols() const { return m_matrix.cols(); } function in struct:Eigen::internal::permut_sparsematrix_product_retval
59 SparseMatrix<Scalar,SrcStorageOrder,Index> tmp(m_matrix.rows(), m_matrix.cols());
79 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> tmp(m_matrix.rows(), m_matrix.cols());
|
| /external/eigen/test/ |
| visitor.cpp | 18 Index cols = p.cols(); local
22 m = MatrixType::Random(rows, cols);
30 for(Index j = 0; j < cols; j++)
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| ConstrainedConjGrad.h | 55 Index rows = C.rows(), cols = C.cols(); local
57 TmpVec d(rows), e(rows), l(cols), p(rows), q(rows), r(rows);
124 SparseMatrix<Scalar,RowMajor> CINV(C.rows(), C.cols());
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| rwupdt.h | 14 const Index n = r.cols();
|
| /external/opencv/ml/src/ |
| mlestimate.cpp | 129 crVal->sampleIdxTrain->cols = crVal->samples_all - k;
131 crVal->sampleIdxEval->cols = k;
193 k = crVal->sampleIdxEval->cols;
462 if (sampleIdx->rows != 1 && sampleIdx->cols != 1)
465 s_len = sampleIdx->rows + sampleIdx->cols - 1;
614 crVal->sampleIdxEval->cols = 0;
615 crVal->sampleIdxTrain->cols = 0;
691 samples_all = ((tflag) ? trueData->rows : trueData->cols);
|
