| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_utilities_indexing.h | 35 inline void db_SetupMatrixRefs(double **ar,long rows,long cols,double *a)
38 for(i=0;i<rows;i++) ar[i]=&a[i*cols];
41 inline void db_SymmetricExtendUpperToLower(double **A,int rows,int cols)
|
| /external/opencv/ml/src/ |
| mlcnn.cpp | 132 if( params->etalons->cols != last_layer->n_output_planes* \
144 if( params->etalons->rows != cnn_model->cls_labels->cols ) \
231 const int n_images = responses->cols;
338 nclasses = cnn_model->cls_labels->cols;
363 etalon = cvMat( cnn_model->etalons->cols, 1, CV_32FC1, cnn_model->etalons->data.fl );
364 for( i = 0; i < nclasses; i++, etalon.data.fl += cnn_model->etalons->cols )
426 for( i = 0; i < cls_labels->cols; i++ )
[all...] |
| mlknearest.cpp | 324 _samples->cols != var_count )
328 _results->cols != 1 && _results->rows != 1 ||
329 _results->cols + _results->rows - 1 != _samples->rows) )
344 _neighbor_responses->rows != _samples->rows || _neighbor_responses->cols != k )
352 _dist->rows != _samples->rows || _dist->cols != k )
|
| /external/chromium_org/tools/gen_keyboard_overlay_data/ |
| gen_keyboard_overlay_data.py | 285 def FetchSpreadsheetFeeds(client, key, sheets, cols):
292 cols: A list of columns to read data from.
311 if (k not in cols) or (not entry.custom[k].text):
353 cols = ['scancode', 'x', 'y', 'w', 'h']
355 layout_names, cols)
361 for col in cols:
|
| /external/e2fsprogs/ext2ed/ |
| file_com.c | 320 long offset=0,last_offset,l=0,cols=0; local
336 if (cols==SHOW_PAD_COLS-1) {
338 l++;cols=0;
352 l++;cols=0;
368 offset++;cols++;ch_ptr++;
|
| /external/eigen/Eigen/src/Householder/ |
| HouseholderSequence.h | 174 Index rows() const { return Side==OnTheLeft ? m_vectors.rows() : m_vectors.cols(); }
180 Index cols() const { return rows(); } function in class:Eigen::HouseholderSequence
260 for(Index k = 0; k<cols()-vecs ; ++k)
302 Matrix<Scalar,1,Dest::ColsAtCompileTime,RowMajor,1,Dest::MaxColsAtCompileTime> workspace(dst.cols());
310 workspace.resize(dst.cols());
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 124 Index cols() const { return m_lu.cols(); } function in class:Eigen::IncompleteLUT
173 eigen_assert(cols()==b.rows()
248 eigen_assert((amat.rows() == amat.cols()) && "The factorization should be done on a square matrix");
249 Index n = amat.cols(); // Size of the matrix
|
| /external/eigen/Eigen/src/LU/ |
| Inverse.h | 287 inline Index cols() const { return m_matrix.cols(); } function in struct:Eigen::internal::inverse_impl
323 eigen_assert(rows() == cols());
355 eigen_assert(rows() == cols());
394 eigen_assert(rows() == cols());
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseDenseProduct.h | 106 EIGEN_STRONG_INLINE Index cols() const { return Tr ? m_lhs.cols() : m_rhs.cols(); } function in class:Eigen::SparseDenseOuterProduct
175 for(Index c=0; c<rhs.cols(); ++c)
199 for(Index c=0; c<rhs.cols(); ++c)
|
| /external/eigen/test/ |
| ref.cpp | 50 Index rows = m.rows(), cols = m.cols(); local
52 MatrixType m1 = MatrixType::Random(rows, cols),
56 Index j = internal::random<Index>(0,cols-1);
58 Index bcols = internal::random<Index>(1,cols-j);
|
| sparse_solver.h | 21 Rhs x(b.rows(), b.cols());
63 DenseRhs x(db.rows(), db.cols());
66 x.block(0,0,x.rows(),x.cols()) = solver.solve(db.block(0,0,db.rows(),db.cols()));
79 Rhs x(b.rows(), b.cols());
|
| /external/eigen/Eigen/src/SuperLUSupport/ |
| SuperLUSupport.h | 160 res.ncol = mat.cols();
174 res.nrow = mat.cols();
181 res.ncol = mat.cols();
205 template<typename Scalar, int Rows, int Cols, int Options, int MRows, int MCols>
206 struct SluMatrixMapHelper<Matrix<Scalar,Rows,Cols,Options,MRows,MCols> >
208 typedef Matrix<Scalar,Rows,Cols,Options,MRows,MCols> MatrixType;
217 res.ncol = mat.cols();
233 res.nrow = mat.cols();
240 res.ncol = mat.cols();
316 inline Index cols() const { return m_matrix.cols(); function in class:Eigen::SuperLUBase
[all...] |
| /external/opencv/cv/src/ |
| cvcorner.cpp | 291 max_dy = buf_size / src->cols;
299 Dx->cols = Dy->cols = size.width;
487 if( CV_MAT_CN(eigenv->type)*eigenv->cols != src->cols*6 ||
596 max_dy = buf_size / src->cols;
605 Dx->cols = Dy->cols = D2x->cols = D2y->cols = Dxy->cols = size.width
[all...] |
| cvstereobm.cpp | 188 int width = left->cols, height = left->rows;
396 int width = left->cols, height = left->rows;
586 state->SADWindowSize >= MIN(left0->cols, left0->rows) )
598 state->preFilteredImg0->cols*state->preFilteredImg0->rows < left0->cols*left0->rows )
603 state->preFilteredImg0 = cvCreateMat( left0->rows, left0->cols, CV_8U );
604 state->preFilteredImg1 = cvCreateMat( left0->rows, left0->cols, CV_8U );
606 left = cvMat(left0->rows, left0->cols, CV_8U, state->preFilteredImg0->data.ptr);
607 right = cvMat(right0->rows, right0->cols, CV_8U, state->preFilteredImg1->data.ptr);
612 width = left0->cols;
[all...] |
| cvmotempl.cpp | 213 CV_CALL( dX_min = cvCreateMat( mhi->rows, mhi->cols, CV_32F ));
214 CV_CALL( dY_max = cvCreateMat( mhi->rows, mhi->cols, CV_32F ));
345 mhi_cols = mhi->cols;
442 CV_CALL( mask8u = cvCreateMat( mhi->rows + 2, mhi->cols + 2, CV_8UC1 ));
455 for( x = 0; x < mhi->cols; x++ )
467 for( x = 0; x < mhi->cols; x++ )
504 for( x = 0; x < mhi->cols; x++ )
|
| /external/opencv/cxcore/src/ |
| cxdxt.cpp | [all...] |
| cxmatmul.cpp | [all...] |
| /external/eigen/Eigen/src/Core/ |
| PermutationMatrix.h | 111 inline Index cols() const { return Index(indices().size()); } function in class:Eigen::PermutationBase
223 eigen_assert(lhs.cols() == rhs.rows());
263 * \param SizeAtCompileTime the number of rows/cols, or Dynamic
264 * \param MaxSizeAtCompileTime the maximum number of rows/cols, or Dynamic. This optional parameter defaults to SizeAtCompileTime. Most of the time, you should not have to specify it.
551 inline Index cols() const { return m_matrix.cols(); } function in struct:Eigen::internal::permut_matrix_product_retval
555 const Index n = Side==OnTheLeft ? rows() : cols();
640 inline int cols() const { return m_permutation.cols(); } function in class:Eigen::Transpose
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 129 inline Index cols() const { return m_size; } function in class:Eigen::PardisoImpl
288 eigen_assert(a.rows() == a.cols());
311 eigen_assert(m_size == a.cols());
334 eigen_assert(m_size == a.rows() && m_size == a.cols());
356 Index nrhs = Index(b.cols());
493 m_matrix.resize(matrix.rows(), matrix.cols());
552 m_matrix.resize(matrix.rows(), matrix.cols());
|
| /external/qemu/distrib/sdl-1.2.15/src/video/x11/ |
| SDL_x11wm.c | 145 XColor cols[256]; local
147 cols[i].pixel = i;
148 XQueryColors(GFX_Display, dcmap, cols, 256);
150 got[i].r = cols[i].red >> 8;
151 got[i].g = cols[i].green >> 8;
152 got[i].b = cols[i].blue >> 8;
155 cols + i)) {
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/x86/ |
| postproc_sse2.asm | 92 ; int cols,
144 cmp edx, dword arg(4) ;cols
150 ; done with the all cols, start the across filtering in place
196 cmp edx, dword arg(4) ;cols
234 ; int pitch, int rows, int cols,int flimit)
266 ;for(c=0; c<cols; c+=8)
447 sub dword arg(3), 8 ; cols -= 8
466 ; int pitch, int rows, int cols,int flimit)
541 movsxd rdx, dword arg(3) ;cols
|
| /external/libvpx/libvpx/vp8/common/x86/ |
| postproc_sse2.asm | 92 ; int cols,
144 cmp edx, dword arg(4) ;cols
150 ; done with the all cols, start the across filtering in place
196 cmp edx, dword arg(4) ;cols
234 ; int pitch, int rows, int cols,int flimit)
266 ;for(c=0; c<cols; c+=8)
447 sub dword arg(3), 8 ; cols -= 8
466 ; int pitch, int rows, int cols,int flimit)
541 movsxd rdx, dword arg(3) ;cols
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/x86/ |
| postproc_sse2.asm | 92 ; int cols,
144 cmp edx, dword arg(4) ;cols
150 ; done with the all cols, start the across filtering in place
196 cmp edx, dword arg(4) ;cols
234 ; int pitch, int rows, int cols,int flimit)
266 ;for(c=0; c<cols; c+=8)
447 sub dword arg(3), 8 ; cols -= 8
466 ; int pitch, int rows, int cols,int flimit)
541 movsxd rdx, dword arg(3) ;cols
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| SVD.h | 54 : m_matU(matrix.rows(), (std::min)(matrix.rows(), matrix.cols())),
55 m_matV(matrix.cols(),matrix.cols()),
56 m_sigma((std::min)(matrix.rows(),matrix.cols()))
97 const int n = matrix.cols();
474 int n = m_matU.cols();
518 for (int j=0; j<b.cols(); ++j)
522 for (int i = 0; i <m_matU.cols(); ++i)
549 ei_assert(m_matU.cols() == m_matV.cols() && "Polar decomposition is only for square matrices")
[all...] |
| /external/libvpx/libvpx/vp8/common/ |
| postproc.c | 132 int cols,
149 for (col = 0; col < cols; col++)
176 p_src[cols] = p_src[cols + 1] = p_src[cols - 1];
178 for (col = 0; col < cols; col++)
217 void vp8_mbpost_proc_across_ip_c(unsigned char *src, int pitch, int rows, int cols, int flimit)
235 for (i = cols; i<cols+17; i++)
236 s[i]=s[cols-1]
[all...] |
