| /external/eigen/Eigen/src/Core/ |
| DiagonalMatrix.h | 56 inline Index cols() const { return diagonal().size(); } function in class:Eigen::DiagonalBase
277 if(cols() != rows()) return false;
279 for(Index j = 0; j < cols(); ++j)
284 for(Index j = 0; j < cols(); ++j)
|
| Replicate.h | 90 inline Index cols() const { return m_matrix.cols() * m_colFactor.value(); } function in class:Eigen::Replicate
100 : col%m_matrix.cols();
112 : col%m_matrix.cols();
|
| CwiseUnaryView.h | 72 EIGEN_STRONG_INLINE Index cols() const { return m_matrix.cols(); } function in class:Eigen::CwiseUnaryView
|
| Fuzzy.h | 54 return x.matrix() == Derived::Zero(x.rows(), x.cols()).matrix();
72 return x.matrix() == Derived::Zero(x.rows(), x.cols()).matrix();
|
| /external/eigen/Eigen/src/SparseCore/ |
| MappedSparseMatrix.h | 50 inline Index cols() const { return IsRowMajor ? m_innerSize : m_outerSize; } function in class:Eigen::MappedSparseMatrix
106 inline MappedSparseMatrix(Index rows, Index cols, Index nnz, Index* outerIndexPtr, Index* innerIndexPtr, Scalar* valuePtr)
107 : 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());
|
| SparseVector.h | 78 EIGEN_STRONG_INLINE Index cols() const { return IsColVector ? 1 : m_size; } function in class:Eigen::SparseVector
177 void resize(Index rows, Index cols)
179 eigen_assert(rows==1 || cols==1);
180 resize(IsColVector ? rows : cols);
195 inline SparseVector(Index rows, Index cols) : m_size(0) { resize(rows,cols); }
|
| SparseTriangularView.h | 41 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::SparseTriangularView
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| ConstrainedConjGrad.h | 59 Index rows = C.rows(), cols = C.cols(); local
61 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);
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLTextAreaElement.cpp | 172 int cols = value.toInt(); local
173 if (cols <= 0)
174 cols = defaultCols;
175 if (m_cols != cols) {
176 m_cols = cols;
495 void HTMLTextAreaElement::setCols(int cols)
497 setAttribute(colsAttr, String::number(cols));
|
| HTMLTextAreaElement.idl | 24 attribute long cols;
|
| /external/opencv/cxcore/src/ |
| cxmatrix.cpp | 144 int size = MIN(mat->rows,mat->cols);
553 CV_ASSERT( CV_IS_MAT(matrix) && matrix->rows == matrix->cols );
[all...] |
| cxarray.cpp | 124 cvCreateMatHeader( int rows, int cols, int type )
135 if( rows <= 0 || cols <= 0 )
138 min_step = CV_ELEM_SIZE(type)*cols;
148 arr->cols = cols;
166 cvInitMatHeader( CvMat* arr, int rows, int cols,
181 if( rows <= 0 || cols <= 0 )
182 CV_ERROR( CV_StsBadSize, "Non-positive cols or rows" );
187 arr->cols = cols;
1583 int cols; local
[all...] |
| /external/opencv/cv/src/ |
| cvmorph.cpp | 229 _ksize.width == element->cols && _ksize.height == element->rows) )
384 int i, j, cols, rows; local
396 anchor.x = element->cols/2;
401 if( (unsigned)anchor.x >= (unsigned)element->cols ||
409 cols = element->cols;
411 if( rows == 1 || cols == 1 )
417 c = cols/2;
427 j2 = cols;
437 j2 = MIN( c + dx + 1, cols );
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| CoeffBasedProduct.h | 155 eigen_assert(lhs.cols() == rhs.rows()
161 EIGEN_STRONG_INLINE Index cols() const { return m_rhs.cols(); } function in class:Eigen::CoeffBasedProduct
265 eigen_assert(lhs.cols()>0 && "you are using a non initialized matrix");
267 for(Index i = 1; i < lhs.cols(); ++i)
417 eigen_assert(lhs.cols()>0 && "you are using a non initialized matrix");
419 for(Index i = 1; i < lhs.cols(); ++i)
430 eigen_assert(lhs.cols()>0 && "you are using a non initialized matrix");
432 for(Index i = 1; i < lhs.cols(); ++i)
|
| TriangularSolverMatrix.h | 22 Index size, Index cols,
32 ::run(size, cols, tri, triStride, _other, otherStride, blocking);
47 Index cols = otherSize; local
61 std::size_t sizeB = kc*cols;
77 Index subcols = cols>0 ? l2/(4 * sizeof(Scalar) * otherStride) : 0;
99 for(Index j2=0; j2<cols; j2+=subcols)
101 Index actual_cols = (std::min)(cols-j2,subcols);
170 gebp_kernel(_other+i2, otherStride, blockA, blockB, actual_mc, actual_kc, cols, Scalar(-1), -1, -1, 0, 0, blockW);
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixSquareRoot.h | 42 eigen_assert(A.rows() == A.cols());
270 eigen_assert(A.rows() == A.cols());
299 result.resize(m_A.rows(), m_A.cols());
304 for (Index j = 1; j < m_A.cols(); j++) {
363 eigen_assert(A.rows() == A.cols());
397 eigen_assert(A.rows() == A.cols());
459 Index cols() const { return m_src.cols(); } function in class:Eigen::MatrixSquareRootReturnValue
478 eigen_assert(rows() == cols());
|
| /frameworks/support/v4/java/android/support/v4/content/ |
| FileProvider.java | 418 String[] cols = new String[projection.length]; local
423 cols[i] = OpenableColumns.DISPLAY_NAME;
426 cols[i] = OpenableColumns.SIZE;
431 cols = copyOf(cols, i);
434 final MatrixCursor cursor = new MatrixCursor(cols, 1);
[all...] |
| /external/ceres-solver/internal/ceres/ |
| solver_impl_test.cc | 872 int* cols = expected_block_sparse_jacobian.mutable_cols(); local
875 cols[0] = 0;
878 cols[1] = 1;
880 cols[2] = 1;
883 cols[3] = 2;
885 cols[4] = 2;
888 cols[5] = 3;
890 cols[6] = 3;
893 cols[7] = 4;
895 cols[8] = 4
969 int* cols = expected_block_sparse_jacobian.mutable_cols(); local
[all...] |
| compressed_row_jacobian_writer.cc | 77 int* cols = jacobian->mutable_cols(); local
126 cols[column_block_begin + c] = parameter_block->delta_offset() + c;
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| fts3_common.tcl | 196 set cols ""
199 append cols " $iCol\[[join $lPos { }]\]"
201 lappend lDoc "\[${docid}${cols}\]"
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 90 : m_matrix(matrix.rows(), matrix.cols()),
171 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::LLT
202 int n = mat.cols();
268 eigen_assert(mat.rows()==mat.cols());
293 eigen_assert(m.rows()==m.cols());
385 eigen_assert(a.rows()==a.cols());
407 eigen_assert(v.size()==m_matrix.cols());
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 128 inline Index cols() const { return m_size; } function in class:Eigen::PardisoImpl
216 int rhsCols = b.cols();
310 eigen_assert(a.rows() == a.cols());
333 eigen_assert(m_size == a.cols());
356 eigen_assert(m_size == a.rows() && m_size == a.cols());
378 Index nrhs = Index(b.cols());
515 m_matrix.resize(matrix.rows(), matrix.cols());
574 m_matrix.resize(matrix.rows(), matrix.cols());
|
