/external/eigen/test/ |
H A D | mapstride.cpp | 56 Index rows = _m.rows(), cols = _m.cols(); local 58 MatrixType m = MatrixType::Random(rows,cols); 60 Index arraysize = 2*(rows+4)*(cols+4); 69 Map<MatrixType, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1)); 88 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4)); 101 Map<MatrixType, Alignment, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2));
|
H A D | product_notemporary.cpp | 41 Index rows = m.rows(); local 44 ColMajorMatrixType m1 = MatrixType::Random(rows, cols), 45 m2 = MatrixType::Random(rows, cols), 46 m3(rows, cols); 47 RowVectorType rv1 = RowVectorType::Random(rows), rvres(rows); 49 RowMajorMatrixType rm3(rows, cols); 58 r1 = internal::random<Index>(8,rows-r0);
|
/external/libvpx/libvpx/examples/ |
H A D | set_maps.c | 69 roi.rows = (cfg->g_h + 15) / 16; 87 roi.roi_map = (uint8_t *)malloc(roi.rows * roi.cols); 88 for (i = 0; i < roi.rows * roi.cols; ++i) 102 map.rows = (cfg->g_h + 15) / 16; 105 map.active_map = (uint8_t *)malloc(map.rows * map.cols); 106 for (i = 0; i < map.rows * map.cols; ++i) 119 map.rows = (cfg->g_h + 15) / 16;
|
/external/opencv/ml/src/ |
H A D | _ml.h | 76 if( MIN( (mat).rows, (mat).cols ) != 1 ) \ 79 if( (mat).rows == 1 ) \ 87 (num) = (mat).rows; \ 97 (m) = (mat).rows; \ 104 (n) = (mat).rows; \ 110 (mat)->cols > 0 && (mat)->rows > 0) 230 int nsamples = (matrice)->rows; \
|
/external/opencv/cv/src/ |
H A D | 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 [all...] |
H A D | cvcalibration.cpp | 89 if( !param || param->rows != nparams || nerrs != (err ? err->rows : 0) ) 260 int i, j, nparams = param->rows; 295 CV_ASSERT( A->cols == B->rows ); 297 M = A->rows; 305 dABdA->rows == A->rows*B->cols && dABdA->cols == A->rows*A->cols ); 311 dABdB->rows == A->rows* [all...] |
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | IncompleteCholesky.h | 49 Index rows() const { return m_L.rows(); } function in class:Eigen::IncompleteCholesky 95 if (m_perm.rows() == b.rows()) 102 if (m_perm.rows() == b.rows()) 111 eigen_assert(cols()==b.rows() 112 && "IncompleteLLT::solve(): invalid number of rows of the right hand side matrix b"); 141 if (m_perm.rows() == mat.rows() ) // T [all...] |
H A D | IncompleteLU.h | 34 Index rows() const { return m_lu.rows(); } function in class:Eigen::IncompleteLU 84 eigen_assert(cols()==b.rows() 85 && "IncompleteLU::solve(): invalid number of rows of the right hand side matrix b");
|
/external/opencv/cvaux/src/ |
H A D | cvlevmartrif.cpp | 83 numPoints = (vectX->rows - 36)/4; 90 if( Jacobian->rows == numPoints*6 || Jacobian->cols != 36+numPoints*4 ) 198 numPoints = (vectX->rows - 36)/4; 205 if( resFunc->rows == 2*numPoints*3 || resFunc->cols != 1 ) 300 if( resultPoints4D->rows != 4 ) 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 ) 462 numCoord = points->rows;
|
H A D | cvtrifocal.cpp | 107 for( i=0;i<matrix->rows;i++ ) 144 if( normPoints->rows != 2 || normPoints->rows != points->rows ) 149 if(cameraMatr->rows != 3 || cameraMatr->cols != 3) 207 if( points1->rows != 2 || points2->rows != 2 || points3->rows != 2 ) 213 !(projMatr1->rows == 3 && projMatr2->rows [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | block_jacobi_preconditioner.cc | 76 for (int r = 0; r < bs->rows.size(); ++r) { 77 const int row_block_size = bs->rows[r].block.size; 78 const vector<Cell>& cells = bs->rows[r].cells;
|
H A D | block_random_access_sparse_matrix.cc | 55 // rows/columns. 81 int* rows = tsm_->mutable_rows(); local 108 rows[pos] = col_layout[row_block_id] + r; 111 DCHECK_LT(rows[pos], tsm_->num_rows());
|
H A D | implicit_schur_complement.cc | 147 for (int r = 0; r < block_diagonal_structure->rows.size(); ++r) { 148 const int row_block_pos = block_diagonal_structure->rows[r].block.position; 149 const int row_block_size = block_diagonal_structure->rows[r].block.size; 150 const Cell& cell = block_diagonal_structure->rows[r].cells[0];
|
/external/eigen/Eigen/src/Core/products/ |
H A D | TriangularMatrixMatrix_MKL.h | 102 Index rows = IsLower ? _rows : diagSize; \ 110 if (rows != depth) { \ 114 if (((nthr==1) && (((std::max)(rows,depth)-diagSize)/(double)diagSize < 0.5))) { \ 122 Map<const MatrixLhs, 0, OuterStride<> > lhsMap(_lhs,rows,depth,OuterStride<>(lhsStride)); \ 127 rows, cols, depth, aa_tmp.data(), aStride, _rhs, rhsStride, res, resStride, alpha, gemm_blocking, 0); \ 161 Map<const MatrixLhs, 0, OuterStride<> > lhs(_lhs,rows,depth,OuterStride<>(lhsStride)); \ 181 Map<MatrixX##EIGPREFIX, 0, OuterStride<> > res_tmp(res,rows,cols,OuterStride<>(resStride)); \ 216 Index rows = _rows; \ 241 rows, cols, depth, _lhs, lhsStride, aa_tmp.data(), aStride, res, resStride, alpha, gemm_blocking, 0); \ 257 m = (MKL_INT)rows; \ [all...] |
H A D | GeneralMatrixMatrix.h | 28 Index rows, Index cols, Index depth, 41 ::run(cols,rows,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking,info); 55 static void run(Index rows, Index cols, Index depth, argument 69 Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction 94 const Index actual_kc = (std::min)(k+kc,depth)-k; // => rows of B', and cols of the A' 129 for(Index i=mc; i<rows; i+=mc) 131 const Index actual_mc = (std::min)(i+mc,rows)-i; 175 for(Index i2=0; i2<rows; i2+=mc) 177 const Index actual_mc = (std::min)(i2+mc,rows)-i2; 216 void operator() (Index row, Index rows, Inde argument 27 run( Index rows, Index cols, Index depth, const LhsScalar* lhs, Index lhsStride, const RhsScalar* rhs, Index rhsStride, ResScalar* res, Index resStride, ResScalar alpha, level3_blocking<RhsScalar,LhsScalar>& blocking, GemmParallelInfo<Index>* info = 0) argument 330 gemm_blocking_space(DenseIndex rows, DenseIndex cols, DenseIndex depth) argument [all...] |
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | Minor.h | 65 eigen_assert(row >= 0 && row < matrix.rows() 71 inline Index rows() const { return m_matrix.rows() - 1; } function in class:Eigen::Minor
|
/external/eigen/Eigen/src/Householder/ |
H A D | BlockHouseholder.h | 27 eigen_assert(triFactor.rows() == nbVecs && triFactor.cols() == nbVecs && vectors.rows()>=nbVecs); 31 Index rs = vectors.rows() - i;
|
/external/eigen/Eigen/src/QR/ |
H A D | ColPivHouseholderQR_MKL.h | 54 Index rows = matrix.rows();\ 71 LAPACKE_##MKLPREFIX##geqp3( matrix_order, rows, cols, (MKLTYPE*)m_qr.data(), lda, (lapack_int*)m_colsPermutation.indices().data(), (MKLTYPE*)m_hCoeffs.data()); \
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseMatrixBase.h | 51 /**< The number of rows at compile-time. This is just a copy of the value provided 54 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */ 60 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */ 66 * rows times the number of columns, or to \a Dynamic if this is not 76 /**< This is set to true if either the number of rows or the number of 149 /** \returns the number of rows. \sa cols() */ 150 inline Index rows() const { return derived().rows(); } function in class:Eigen::SparseMatrixBase 151 /** \returns the number of columns. \sa rows() */ 153 /** \returns the number of coefficients, which is \a rows()*col [all...] |
/external/eigen/unsupported/Eigen/src/AutoDiff/ |
H A D | AutoDiffJacobian.h | 60 ActiveValue av(jac.rows()); 63 for (Index j=0; j<jac.rows(); j++) 71 for (Index i=0; i<jac.rows(); i++)
|
/external/pdfium/core/src/fxge/agg/agg23/ |
H A D | agg_rendering_buffer.h | 81 int8u** rows = m_rows; local 83 *rows++ = row_ptr; 129 int8u const* const* rows() const function in class:agg::rendering_buffer
|
/external/opencv/cxcore/src/ |
H A D | cxutils.cpp | 78 if( (labels->rows != 1 && (labels->cols != 1 || !CV_IS_MAT_CONT(labels->type))) || 79 labels->rows + labels->cols - 1 != samples->rows ) 81 "cluster_idx should be 1D vector of the same number of elements as samples' number of rows" ); 86 sample_count = samples->rows; 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 ) 303 if( coeffs->rows > 918 int rows, cols; local [all...] |
/external/chromium_org/chrome/browser/history/ |
H A D | expire_history_backend_unittest.cc | 158 virtual void NotifySyncURLsModified(URLRows* rows) OVERRIDE {} 161 URLRows* rows) OVERRIDE {} 330 const history::URLRows& rows(details->rows); 332 rows.begin(), rows.end(), history::URLRow::URLRowHasURL(row.url())); 333 if (it_row != rows.end()) { 342 const history::URLRows& rows = local 346 std::find_if(rows.begin(), rows 357 const history::URLRows& rows = local 524 URLRow rows[3]; local [all...] |
/external/chromium_org/third_party/libwebp/dsp/ |
H A D | enc_neon.c | 45 // to the corresponding rows of 'dst'. 93 static WEBP_INLINE void TransformPass(int16x8x2_t* const rows) { argument 94 // {rows} = in0 | in4 98 vcombine_s16(vget_high_s16(rows->val[0]), vget_high_s16(rows->val[1])); 103 const int16x4_t a = vqadd_s16(vget_low_s16(rows->val[0]), 104 vget_low_s16(rows->val[1])); // in0 + in8 105 const int16x4_t b = vqsub_s16(vget_low_s16(rows->val[0]), 106 vget_low_s16(rows->val[1])); // in0 - in8 116 Transpose8x2(E0, E1, rows); 121 int16x8x2_t rows; local 565 DistoTranspose4x4(const int32x4x4_t rows) argument 599 DistoVerticalPass(const int32x4x4_t rows) argument [all...] |
/external/webp/src/dsp/ |
H A D | enc_neon.c | 45 // to the corresponding rows of 'dst'. 93 static WEBP_INLINE void TransformPass(int16x8x2_t* const rows) { argument 94 // {rows} = in0 | in4 98 vcombine_s16(vget_high_s16(rows->val[0]), vget_high_s16(rows->val[1])); 103 const int16x4_t a = vqadd_s16(vget_low_s16(rows->val[0]), 104 vget_low_s16(rows->val[1])); // in0 + in8 105 const int16x4_t b = vqsub_s16(vget_low_s16(rows->val[0]), 106 vget_low_s16(rows->val[1])); // in0 - in8 116 Transpose8x2(E0, E1, rows); 121 int16x8x2_t rows; local 565 DistoTranspose4x4(const int32x4x4_t rows) argument 599 DistoVerticalPass(const int32x4x4_t rows) argument [all...] |