/external/eigen/test/ |
H A D | householder.cpp | 22 Index cols = m.cols(); local 34 Matrix<Scalar, EIGEN_SIZE_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols)); 52 MatrixType m1(rows, cols), 53 m2(rows, cols); 62 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(m1.block(1,0,rows-1,cols).norm(), m1.norm()); 82 m1.setRandom(rows, cols); 83 HBlockMatrixType hbm = m1.block(shift,0,brows,cols); 86 m2.block(shift,0,brows,cols) = qr.matrixQR(); 94 m5.block(shift,0,brows,cols) [all...] |
H A D | eigensolver_generic.cpp | 22 Index cols = m.cols(); local 29 MatrixType a = MatrixType::Random(rows,cols); 30 MatrixType a1 = MatrixType::Random(rows,cols); 63 MatrixType id = MatrixType::Identity(rows, cols); 83 MatrixType a = MatrixType::Random(m.rows(),m.cols());
|
H A D | nullary.cpp | 21 for (Index j = i+1; j < A.cols(); ++j) { 26 for (Index j = 0; j < (std::min)(i, A.cols()); ++j) { 107 const Index cols = m.cols(); local 110 A.setIdentity(rows, cols); 112 VERIFY(equalsIdentity(MatrixType::Identity(rows, cols)));
|
H A D | dontalign.cpp | 28 Index cols = m.cols(); local 30 MatrixType a = MatrixType::Random(rows,cols);
|
H A D | diagonal.cpp | 18 Index cols = m.cols(); local 20 MatrixType m1 = MatrixType::Random(rows, cols), 21 m2 = MatrixType::Random(rows, cols);
|
H A D | product_symm.cpp | 22 Index cols = size; local 24 MatrixType m1 = MatrixType::Random(rows, cols), 25 m2 = MatrixType::Random(rows, cols), m3; 29 Rhs1 rhs1 = Rhs1::Random(cols, othersize), rhs12(cols, othersize), rhs13(cols, othersize); 31 Rhs3 rhs3 = Rhs3::Random(cols, othersize), rhs32(cols, othersize), rhs33(cols, othersize);
|
H A D | product_trmm.cpp | 14 int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), 24 TriMatrix mat(rows,cols), tri(rows,cols), triTr(cols,rows); 26 OnTheRight ge_right(cols,otherCols); 64 void trmv(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) argument 66 trmm<Scalar,Mode,TriOrder,ColMajor,ColMajor,1>(rows,cols,1); 70 void trmm(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int otherCols = internal::random<int>(1,EIGEN_TEST_MAX_SIZE)) argument 72 trmm<Scalar,Mode,TriOrder,OtherOrder,ResOrder,Dynamic>(rows,cols,otherCols); 13 trmm(int rows=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int cols=internal::random<int>(1,EIGEN_TEST_MAX_SIZE), int otherCols = OtherCols==Dynamic?internal::random<int>(1,EIGEN_TEST_MAX_SIZE):OtherCols) argument
|
/external/skia/src/images/ |
H A D | bmpdecoderhelper.cpp | 41 int cols = 0; local 56 cols = GetInt(); 78 if (cols < 0 || cols > 256) { 82 if (cols == 0 && bpp_ <= 8) { 83 cols = 1 << bpp_; 85 if (bpp_ <= 8 || cols > 0) { 90 if (cols > 0) { 91 if (pos_ + (cols * colLen) > len_) { 94 for (int i = 0; i < cols; [all...] |
/external/eigen/unsupported/test/ |
H A D | svd_common.h | 31 Index cols = m.cols(); local 42 MatrixType sigma = MatrixType::Zero(rows, cols); 61 Index cols = m.cols(); local 62 Index diagSize = (std::min)(rows, cols); 85 Index cols = m.cols(); local 95 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols)); 133 Index diagSize = (std::min)(m.rows(), m.cols()); 145 Index cols = m.cols(); local [all...] |
/external/opencv/ml/src/ |
H A D | mlann_mlp.cpp | 180 for( i = 1; i < layer_sizes->cols; i++ ) 198 if( i < layer_sizes->cols - 1 ) 223 _layer_sizes->cols != 1 && _layer_sizes->rows != 1 || 230 l_count = _layer_sizes->rows + _layer_sizes->cols - 1; 286 if( _inputs->cols != layer_sizes->data.i[0] ) 290 if( _outputs->cols != layer_sizes->data.i[layer_sizes->cols - 1] ) 305 l_count = layer_sizes->cols; 313 cvInitMatHeader( layer_out, dn, layer_in->cols, CV_64F, buf ); 321 int cols local 343 int i, j, cols = _src->cols; local 371 int i, j, cols = _src->cols; local 399 int i, j, n = sums->rows, cols = sums->cols; local 479 int i, j, n = _xf->rows, cols = _xf->cols; local [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | program_test.cc | 273 int* cols = expected_block_sparse_jacobian.mutable_cols(); local 276 cols[0] = 0; 279 cols[1] = 1; 281 cols[2] = 1; 284 cols[3] = 2; 286 cols[4] = 2; 289 cols[5] = 3; 291 cols[6] = 3; 294 cols[7] = 4; 296 cols[ 370 int* cols = expected_block_sparse_jacobian.mutable_cols(); local [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ppc/ |
H A D | systemdependent.c | 22 int cols, 27 extern void (*vp8_mbpost_proc_down)(unsigned char *dst, int pitch, int rows, int cols, int flimit); 28 extern void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols, int flimit); 29 extern void (*vp8_mbpost_proc_across_ip)(unsigned char *src, int pitch, int rows, int cols, int flimit); 30 extern void vp8_mbpost_proc_across_ip_c(unsigned char *src, int pitch, int rows, int cols, int flimit); 38 int cols,
|
/external/eigen/bench/ |
H A D | benchCholesky.cpp | 32 int cols = m.cols(); local 46 MatrixType a = MatrixType::Random(rows,cols); 53 int c = internal::random<int>(0,covMat.cols()-1); 92 gsl_matrix* gslCovMat = gsl_matrix_alloc(covMat.rows(),covMat.cols()); 93 gsl_matrix* gslCopy = gsl_matrix_alloc(covMat.rows(),covMat.cols());
|
/external/eigen/demos/mix_eigen_and_c/ |
H A D | binary_library.cpp | 72 C_MatrixXd* MatrixXd_new(int rows, int cols) argument 74 return eigen_to_c(*new MatrixXd(rows,cols)); 92 void MatrixXd_resize(C_MatrixXd *m, int rows, int cols) argument 94 c_to_eigen(m).resize(rows,cols); 137 C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols) argument 139 return eigen_to_c(*new Map<MatrixXd>(array,rows,cols));
|
/external/eigen/unsupported/Eigen/src/SVD/ |
H A D | SVDBase.h | 161 inline Index cols() const { return m_cols; } function in class:Eigen::SVDBase 166 bool allocate(Index rows, Index cols, unsigned int computationOptions) ; 194 bool SVDBase<MatrixType>::allocate(Index rows, Index cols, unsigned int computationOptions) argument 196 eigen_assert(rows >= 0 && cols >= 0); 200 cols == m_cols && 207 m_cols = cols;
|
/external/libvpx/libvpx/vp8/common/ppc/ |
H A D | systemdependent.c | 22 int cols, 27 extern void (*vp8_mbpost_proc_down)(unsigned char *dst, int pitch, int rows, int cols, int flimit); 28 extern void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols, int flimit); 29 extern void (*vp8_mbpost_proc_across_ip)(unsigned char *src, int pitch, int rows, int cols, int flimit); 30 extern void vp8_mbpost_proc_across_ip_c(unsigned char *src, int pitch, int rows, int cols, int flimit); 38 int cols,
|
/external/ceres-solver/examples/ |
H A D | libmv_homography.cc | 203 assert(4 <= x1.cols()); 205 assert(x1.cols() == x2.cols()); 207 int n = x1.cols(); 295 for (int i = 0; i < x1_.cols(); i++) { 300 average_distance /= x1_.cols(); 322 assert(4 <= x1.cols()); 324 assert(x1.cols() == x2.cols()); 337 for (int i = 0; i < x1.cols(); [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | Random.h | 31 * The parameters \a rows and \a cols are the number of rows and of columns of 35 * it is redundant to pass \a rows and \a cols as arguments, so Random() should be used 49 DenseBase<Derived>::Random(Index rows, Index cols) argument 51 return NullaryExpr(rows, cols, internal::scalar_random_op<Scalar>()); 112 return *this = Random(rows(), cols());
|
/external/eigen/Eigen/src/Eigenvalues/ |
H A D | ComplexSchur_MKL.h | 52 eigen_assert(matrix.cols() == matrix.rows()); \ 55 if(matrix.cols() == 1) \ 64 lapack_int n = matrix.cols(), sdim, info; \
|
/external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
H A D | KroneckerTensorProduct.h | 47 inline Index cols() const { return m_A.cols() * m_B.cols(); } function in class:Eigen::KroneckerProduct 51 return m_A.coeff(row / m_B.rows(), col / m_B.cols()) * 52 m_B.coeff(row % m_B.rows(), col % m_B.cols()); 95 inline Index cols() const { return m_A.cols() * m_B.cols(); } function in class:Eigen::KroneckerProductSparse 117 Bc = m_B.cols(); 119 for (Index j=0; j < m_A.cols(); [all...] |
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkBoundaryPatch.cpp | 44 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) { argument 45 if (rows < 2 || cols < 2) { 50 const SkScalar invC = SkScalarInvert(SkIntToScalar(cols - 1)); 52 for (int y = 0; y < cols; y++) {
|
/external/eigen/Eigen/src/Geometry/ |
H A D | Homogeneous.h | 76 inline Index cols() const { return m_matrix.cols() + (int(Direction)==Horizontal ? 1 : 0); } function in class:Eigen::Homogeneous 81 || (int(Direction)==Horizontal && col==m_matrix.cols())) 180 Direction==Horizontal ? _expression().cols()-1 : _expression().cols()).cwiseQuotient( 186 Direction==Horizontal ? _expression().cols()-1:0, 188 Direction==Horizontal ? 1 : _expression().cols()), 190 Direction==Horizontal ? _expression().cols()-1 : 1)); 247 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::homogeneous_left_product_impl 286 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::homogeneous_right_product_impl [all...] |
/external/eigen/Eigen/src/Householder/ |
H A D | Householder.h | 105 * this->cols() * essential.size() entries 123 Map<typename internal::plain_row_type<PlainObject>::type> tmp(workspace,cols()); 124 Block<Derived, EssentialPart::SizeAtCompileTime, Derived::ColsAtCompileTime> bottom(derived(), 1, 0, rows()-1, cols()); 142 * this->cols() * essential.size() entries 154 if(cols() == 1) 161 Block<Derived, Derived::RowsAtCompileTime, EssentialPart::SizeAtCompileTime> right(derived(), 0, 1, rows(), cols()-1);
|
/external/eigen/doc/examples/ |
H A D | Tutorial_simple_example_dynamic_size.cpp | 11 for (int j=0; j<m.cols(); ++j) // loop over columns
|
/external/eigen/test/eigen2/ |
H A D | eigen2_sparse_vector.cpp | 12 template<typename Scalar> void sparse_vector(int rows, int cols) argument 14 double densityMat = std::max(8./(rows*cols), 0.01); 22 SparseMatrixType m1(rows,cols); 24 DenseMatrix refM1 = DenseMatrix::Zero(rows, cols);
|