HomeSort by relevance Sort by last modified time
    Searched refs:cols (Results 251 - 275 of 601) sorted by null

<<11121314151617181920>>

  /external/eigen/test/
product_syrk.cpp 22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols);
27 Rhs1 rhs1 = Rhs1::Random(internal::random<int>(1,320), cols);
33 Index c = internal::random<Index>(0,cols-1);
qr_colpivoting.cpp 18 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols2 = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
26 createRandomPIMatrixOfRank(rank,rows,cols,m1);
29 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
41 MatrixType m2 = MatrixType::Random(cols,cols2);
43 m2 = MatrixType::Random(cols,cols2);
50 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
52 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1);
53 Matrix<Scalar,Rows,Cols> m1;
54 createRandomPIMatrixOfRank(rank,Rows,Cols,m1)
    [all...]
stable_norm.cpp 54 Index cols = m.cols(); local
59 MatrixType vzero = MatrixType::Zero(rows, cols),
60 vrand = MatrixType::Random(rows, cols),
61 vbig(rows, cols),
62 vsmall(rows,cols);
nomalloc.cpp 36 Index cols = m.cols(); local
38 MatrixType m1 = MatrixType::Random(rows, cols),
39 m2 = MatrixType::Random(rows, cols),
40 m3(rows, cols);
45 c = internal::random<Index>(0, cols-1);
49 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), (m1.array()*m1.array()).matrix());
product_trmv.cpp 22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m3(rows, cols);
30 m1 = MatrixType::Random(rows, cols);
  /external/eigen/unsupported/test/
matrix_exponential.cpp 111 typename MatrixType::Index cols = m.cols(); local
112 MatrixType m1(rows, cols), m2(rows, cols), m3(rows, cols),
118 m1 = MatrixType::Random(rows, cols);
  /external/opencv/ml/src/
_ml.h 76 if( MIN( (mat).rows, (mat).cols ) != 1 ) \
82 (num) = (mat).cols; \
98 (n) = (mat).cols; \
105 (m) = (mat).cols; \
110 (mat)->cols > 0 && (mat)->rows > 0)
229 int dims = (matrice)->cols; \
mlnbayes.cpp 63 for( int cls = 0; cls < cls_labels->cols; cls++ )
145 nclasses = cls_labels->cols;
183 if( cls_labels->cols != __cls_labels->cols ||
189 nclasses = cls_labels->cols;
297 nclasses = cls_labels->cols;
298 _var_count = avg[0]->cols;
300 if( !CV_IS_MAT(samples) || CV_MAT_TYPE(samples->type) != CV_32FC1 || samples->cols != var_all )
312 results->cols != 1 && results->rows != 1 ||
313 results->cols + results->rows - 1 != samples->rows
    [all...]
  /external/eigen/Eigen/src/Eigenvalues/
SelfAdjointEigenSolver.h 154 : m_eivec(matrix.rows(), matrix.cols()),
155 m_eivalues(matrix.cols()),
325 : m_eivec(matrix.rows(), matrix.cols()),
326 m_eivalues(matrix.cols()),
334 : m_eivec(matA.cols(), matA.cols()),
335 m_eivalues(matA.cols()),
336 m_subdiag(matA.cols() > 1 ? matA.cols() - 1 : 1),
387 eigen_assert(matrix.cols() == matrix.rows())
    [all...]
RealSchur.h 103 : m_matT(matrix.rows(),matrix.cols()),
104 m_matU(matrix.rows(),matrix.cols()),
206 assert(matrix.cols() == matrix.rows());
215 m_workspaceVector.resize(m_matT.cols());
222 Index iu = m_matT.cols() - 1;
254 if (iter > m_maxIterations * m_matT.cols()) break;
261 if(iter <= m_maxIterations * m_matT.cols())
275 const Index size = m_matT.cols();
306 const Index size = m_matT.cols();
408 const Index size = m_matT.cols();
    [all...]
Tridiagonalization.h 131 m_hCoeffs(matrix.cols() > 1 ? matrix.cols()-1 : 1),
352 eigen_assert(n==matA.cols());
430 eigen_assert(mat.cols()==mat.rows() && diag.size()==mat.rows() && subdiag.size()==mat.rows()-1);
446 CoeffVectorType hCoeffs(mat.cols()-1);
547 Index cols() const { return m_matrix.cols(); } function in struct:Eigen::internal::TridiagonalizationMatrixTReturnType
  /external/opencv/cv/src/
cvcalibration.cpp 295 CV_ASSERT( A->cols == B->rows );
298 L = A->cols;
299 N = B->cols;
305 dABdA->rows == A->rows*B->cols && dABdA->cols == A->rows*A->cols );
311 dABdB->rows == A->rows*B->cols && dABdB->cols == B->rows*B->cols );
401 CV_ASSERT( _rvec1->rows == 3 && _rvec1->cols == 1 && CV_ARE_SIZES_EQ(_rvec1, _rvec2) )
    [all...]
  /external/ceres-solver/internal/ceres/
schur_eliminator_impl.h 85 const int num_col_blocks = bs->cols.size();
99 lhs_num_rows += bs->cols[i].size;
119 const int e_block_size = bs->cols[chunk_block_id].size;
135 buffer_size += e_block_size * bs->cols[cell.block_id].size;
181 const int num_col_blocks = bs->cols.size();
193 const int block_size = bs->cols[i].size;
195 diag(D + bs->cols[i].position, block_size);
229 const int e_block_size = bs->cols[e_block_id].size;
238 diag(D + bs->cols[e_block_id].position, e_block_size);
311 const int e_block_size = bs->cols[e_block_id].size
    [all...]
  /packages/apps/Exchange/src/com/android/exchange/
EasOutboxService.java 268 String[] cols = Utility.getRowColumns(context, Body.CONTENT_URI, local
272 if (cols != null) {
273 refId = Long.parseLong(cols[0]);
275 cols = Utility.getRowColumns(context, Message.CONTENT_URI, refId,
278 if (cols != null) {
279 itemId = cols[0];
280 long boxId = Long.parseLong(cols[1]);
282 cols = Utility.getRowColumns(context, Mailbox.CONTENT_URI, boxId,
284 if (cols != null) {
285 collectionId = cols[0]
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderFrameSet.cpp 131 size_t cols = m_cols.m_sizes.size(); local
137 for (size_t c = 0; c < cols; c++) {
402 size_t cols = m_cols.m_sizes.size(); local
404 for (size_t c = 0; c < cols; ++c) {
423 int cols = frameSet()->totalCols(); local
424 if (rows && cols) {
427 result.setPreventResize(RightFrameEdge, m_cols.m_preventResize[cols]);
428 result.setAllowBorder(RightFrameEdge, m_cols.m_allowBorder[cols]);
456 unsigned cols = frameSet()->totalCols(); local
459 if (m_rows.m_sizes.size() != rows || m_cols.m_sizes.size() != cols) {
493 int cols = frameSet()->totalCols(); local
    [all...]
  /external/opencv/cvaux/src/
cvlevmartrif.cpp 90 if( Jacobian->rows == numPoints*6 || Jacobian->cols != 36+numPoints*4 )
205 if( resFunc->rows == 2*numPoints*3 || resFunc->cols != 1 )
294 numPoints = resultPoints4D->cols;
340 if( projMatrs[i]->rows != 3 || projMatrs[i]->cols != 4 )
345 if( projPoints[i]->rows != 2 || projPoints[i]->cols != numPoints )
350 if( resultProjMatrs[i]->rows != 3 || resultProjMatrs[i]->cols != 4 )
454 numPoints = points->cols;
  /external/chromium_org/third_party/mesa/src/src/mapi/mapi/
mapi_abi.py 47 def __init__(self, cols, attrs):
48 self._parse(cols)
85 def _parse(self, cols):
86 ret = cols.pop(0)
90 name = cols.pop(0)
93 if not cols:
94 raise Exception(cols)
95 elif len(cols) == 1 and cols[0] == 'void':
98 for val in cols
    [all...]
  /external/mesa3d/src/mapi/mapi/
mapi_abi.py 47 def __init__(self, cols, attrs):
48 self._parse(cols)
85 def _parse(self, cols):
86 ret = cols.pop(0)
90 name = cols.pop(0)
93 if not cols:
94 raise Exception(cols)
95 elif len(cols) == 1 and cols[0] == 'void':
98 for val in cols
    [all...]
  /external/eigen/Eigen/src/Core/
DenseBase.h 61 using Base::cols;
96 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
102 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
178 * \code rows()==1 || cols()==1 \endcode
179 * \sa rows(), cols(), IsVectorAtCompileTime. */
189 : int(IsRowMajor) ? this->rows() : this->cols();
200 : int(IsRowMajor) ? this->cols() : this->rows();
217 void resize(Index rows, Index cols)
220 EIGEN_ONLY_USED_FOR_DEBUG(cols);
221 eigen_assert(rows == this->rows() && cols == this->cols(
    [all...]
Block.h 118 m_blockCols(BlockCols==1 ? 1 : xpr.cols())
122 ||((BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) && i<xpr.cols())));
133 && startCol >= 0 && BlockCols >= 1 && startCol + BlockCols <= xpr.cols());
147 && startCol >= 0 && blockCols >= 0 && startCol + blockCols <= xpr.cols());
153 inline Index cols() const { return m_blockCols.value(); } function in class:Eigen::Block
275 BlockCols==1 ? 1 : xpr.cols()),
280 ||((BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) && i<xpr.cols())));
290 && startCol >= 0 && BlockCols >= 1 && startCol + BlockCols <= xpr.cols());
305 && startCol >= 0 && blockCols >= 0 && startCol + blockCols <= xpr.cols());
CwiseBinaryOp.h 131 eigen_assert(lhs.rows() == rhs.rows() && lhs.cols() == rhs.cols());
141 EIGEN_STRONG_INLINE Index cols() const { function in class:Eigen::CwiseBinaryOp
144 return m_rhs.cols();
146 return m_lhs.cols();
  /external/jmonkeyengine/engine/src/core/com/jme3/collision/bih/
BIHNode.java 169 int cols = 0; local
228 cols += added;
233 return cols;
250 int cols = 0; local
288 cols++;
293 return cols;
333 int cols = 0; local
420 cols++;
428 return cols;
  /external/eigen/test/eigen2/
eigen2_newstdvector.cpp 19 int cols = m.cols(); local
20 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
21 std::vector<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);
eigen2_qtvector.cpp 24 int cols = m.cols(); local
25 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
26 QVector<MatrixType> v(10, MatrixType(rows,cols)), w(20, y);
eigen2_stdvector.cpp 18 int cols = m.cols(); local
19 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
20 std::vector<MatrixType, aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);

Completed in 576 milliseconds

<<11121314151617181920>>