| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD_MKL.h | 50 allocate(matrix.rows(), matrix.cols(), computationOptions); \
|
| /external/eigen/bench/spbench/ |
| test_sparseLU.cpp | 55 n = A.cols();
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMcovar.h | 33 const Index n = r.cols();
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| covar.h | 20 const Index n = r.cols();
|
| qrsolv.h | 22 Index n = s.cols();
|
| r1updt.h | 20 const Index n = s.cols();
|
| /external/eigen/unsupported/bench/ |
| bench_svd.cpp | 36 MatrixType m = MatrixType::Random(a.rows(), a.cols());
|
| /external/libvpx/libvpx/test/ |
| vp9_subtract_test.cc | 20 typedef void (*subtract_fn_t)(int rows, int cols,
|
| /external/libvpx/libvpx/vp9/encoder/x86/ |
| vp9_subtract_sse2.asm | 15 ; void vp9_subtract_block(int rows, int cols,
22 rows, cols, diff, diff_stride, src, src_stride, \
|
| /external/ltrace/ |
| options.c | 177 int cols; local
178 cols = strtol(c, &endptr, 0);
179 if (cols > 0 && !*endptr) {
180 options.align = cols * 5 / 8;
|
| /external/opencv/cv/src/ |
| _cvmatrix.h | 49 #define icvSetZero_32f( dst, cols, rows ) memset((dst),0,(rows)*(cols)*sizeof(float))
51 #define icvSetZero_64d( dst, cols, rows ) memset((dst),0,(rows)*(cols)*sizeof(double))
|
| /external/opencv/cvaux/src/ |
| cvbgfg_common.cpp | 92 double q = (mask->rows + mask->cols)/perimScale; // calculate perimeter len threshold
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixVector.h | 52 Index rows, Index cols,
60 Index rows, Index cols,
129 skipColumns = (std::min)(skipColumns,cols);
134 || (skipColumns + columnsAtOnce >= cols)
148 Index columnBound = ((cols-skipColumns)/columnsAtOnce)*columnsAtOnce + skipColumns;
243 Index end = cols;
315 Index rows, Index cols,
324 Index rows, Index cols,
352 const Index depth = cols;
|
| SelfadjointProduct.h | 103 ::run(mat.cols(), actualOther.cols(),
|
| /external/opencv/ml/src/ |
| mlem.cpp | 161 p->cols != params.nclusters )
173 m->cols != train_data.dims )
184 w->rows != 1 && w->cols != 1 ||
185 w->rows + w->cols - 1 != params.nclusters )
197 cov->rows != cov->cols || cov->cols != train_data.dims )
226 dims = means->cols;
286 if( _probs->cols == 1 )
333 labels->cols != 1 && labels->rows != 1 || labels->cols + labels->rows - 1 != nsamples )
[all...] |
| /external/ceres-solver/internal/ceres/ |
| compressed_row_jacobian_writer.cc | 115 int* cols = jacobian->mutable_cols(); local
164 cols[column_block_begin + c] = parameter_block->delta_offset() + c;
|
| partitioned_matrix_view_test.cc | 152 EXPECT_EQ(bs->cols.size(), 2);
166 EXPECT_EQ(bs->cols.size(), 3);
|
| triplet_sparse_matrix.cc | 196 cols_.get()[num_nonzeros_] = B.cols()[i];
207 cols_.get()[num_nonzeros_] = B.cols()[i] + num_cols_;
|
| visibility_test.cc | 102 bs.cols.resize(num_cols);
178 bs.cols.resize(num_cols);
|
| /external/chromium_org/third_party/angle/tests/compiler_tests/ |
| VariablePacker_test.cpp | 151 int cols = gl::VariableColumnCount(type); local
152 int squareSize = std::max(rows, cols);
|
| /external/eigen/Eigen/src/Core/ |
| IO.h | 195 for(Index j = 0; j < m.cols(); ++j)
212 for(Index j = 1; j < m.cols(); ++j)
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BiCGSTAB.h | 41 int n = mat.cols();
228 for(int j=0; j<b.cols(); ++j)
|
| ConjugateGradient.h | 41 int n = mat.cols();
219 for(int j=0; j<b.cols(); ++j)
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_SupernodalMatrix.h | 83 Index cols() { return m_col; } function in class:Eigen::internal::MappedSuperNodalMatrix
237 Index nrhs = X.cols();
|
| SparseLU_kernel_bmod.h | 74 internal::sparselu_gemm<Scalar>(l.rows(), l.cols(), B.cols(), B.data(), B.outerStride(), u.data(), u.outerStride(), l.data(), l.outerStride());
|
