HomeSort by relevance Sort by last modified time
    Searched refs:cols (Results 426 - 450 of 667) sorted by null

<<11121314151617181920>>

  /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
  /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...]
LU.h 28 MatrixType::ColsAtCompileTime, // the number of rows in the "kernel matrix" is the number of cols of the original matrix
61 solve(MatrixType::Identity(this->rows(), this->cols()), result);
  /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...]
  /external/mksh/src/
misc.c 1217 unsigned int i, r, c, rows, cols, nspace, max_col; local
1247 cols = x_cols / (max_col + 1);
1250 if (cols < 2) {
1257 rows = (n + cols - 1) / cols;
1258 if (prefcol && cols > rows) {
1259 cols = rows;
1260 rows = (n + cols - 1) / cols;
1263 nspace = (x_cols - max_col * cols) / cols
    [all...]
  /external/opencv/cxcore/include/
cxtypes.h 570 int cols; member in union:CvMat::__anon7654
575 int cols; member in struct:CvMat
585 ((const CvMat*)(mat))->cols > 0 && ((const CvMat*)(mat))->rows > 0)
603 ((mat1)->rows == (mat2)->rows && (mat1)->cols == (mat2)->cols)
606 (((mat)->rows|(mat)->cols) == 1)
621 CV_INLINE CvMat cvMat( int rows, int cols, int type, void* data CV_DEFAULT(NULL))
628 m.cols = cols;
630 m.step = rows > 1 ? m.cols*CV_ELEM_SIZE(type) : 0
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/main/
uniform_query.cpp 386 unsigned rows, unsigned cols, unsigned count,
394 const unsigned elems = rows * cols * count;
395 const char *const extra = (cols == 1) ? "uniform" : "uniform matrix";
825 * Note: cols=2, rows=4 ==> array[2] of vec4
829 GLuint cols, GLuint rows,
859 if (vectors != cols || components != rows) {
912 for (unsigned c = 0; c < cols; c++) {
  /external/eigen/Eigen/src/Cholesky/
LDLT.h 102 : m_matrix(matrix.rows(), matrix.cols()),
224 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::LDLT
265 eigen_assert(mat.rows()==mat.cols());
357 eigen_assert(mat.cols() == size && w.size()==size);
437 eigen_assert(a.rows()==a.cols());
  /external/eigen/Eigen/src/SparseCore/
SparseSelfAdjointView.h 62 eigen_assert(rows()==cols() && "SelfAdjointView is only for squared matrices");
66 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::SparseSelfAdjointView
132 SparseMatrix<DestScalar,ColMajor,Index> tmp(_dest.rows(),_dest.cols());
483 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::SparseSymmetricPermutationProduct
  /external/eigen/bench/
sparse_setter.cpp 64 int cols = SIZE; local
73 pool.reserve(cols*NBPERROW);
75 for (int i=0; i<cols*NBPERROW; )
78 Vector2i ij(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1));
88 int n = cols*NBPERROW*KK;
100 for (int j=0; j<cols; ++j)
  /external/mesa3d/src/mesa/main/
uniform_query.cpp 386 unsigned rows, unsigned cols, unsigned count,
394 const unsigned elems = rows * cols * count;
395 const char *const extra = (cols == 1) ? "uniform" : "uniform matrix";
825 * Note: cols=2, rows=4 ==> array[2] of vec4
829 GLuint cols, GLuint rows,
859 if (vectors != cols || components != rows) {
912 for (unsigned c = 0; c < cols; c++) {
  /external/chromium_org/third_party/libvpx/source/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++)
218 void vp8_mbpost_proc_across_ip_c(unsigned char *src, int pitch, int rows, int cols, int flimit)
237 s[i+cols]=s[cols-1];
246 for (c = 0; c < cols + 8; c++
    [all...]
  /external/eigen/Eigen/src/Core/
SelfAdjointView.h 76 inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::SelfAdjointView
260 for(Index j = 0; j < dst.cols(); ++j)
  /external/opencv/cv/src/
cvcamshift.cpp 87 if( windowIn.x < 0 || windowIn.x + windowIn.width > mat->cols ||
116 else if( nx + cur_rect.width > mat->cols )
117 nx = mat->cols - cur_rect.width;
  /external/ceres-solver/internal/ceres/
iterative_schur_complement_solver.cc 86 A->block_structure()->cols.size() - num_eliminate_blocks;
normal_prior_test.cc 49 for (int c = 0; c < m->cols(); ++c) {
schur_complement_solver.cc 101 const int num_col_blocks = bs->cols.size();
107 blocks[j] = bs->cols[i].size;
185 const int num_col_blocks = bs->cols.size();
190 blocks_[i - num_eliminate_blocks] = bs->cols[i].size;
visibility.cc 60 visibility->resize(block_structure.cols.size() - num_eliminate_blocks);
  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLTextAreaElement.h 40 int cols() const { return m_cols; } function in class:blink::FINAL
  /external/chromium_org/third_party/libvpx/source/libvpx/test/
vp9_subtract_test.cc 20 typedef void (*SubtractFunc)(int rows, int cols,
  /external/chromium_org/third_party/libvpx/source/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/eigen/Eigen/src/CholmodSupport/
CholmodSupport.h 57 res.ncol = mat.cols();
128 res.ncol = mat.cols();
194 inline Index cols() const { return m_cholmodFactor->n; } function in class:Eigen::CholmodBase
309 dest = Matrix<Scalar,Dest::RowsAtCompileTime,Dest::ColsAtCompileTime>::Map(reinterpret_cast<Scalar*>(x_cd->x),b.rows(),b.cols());
  /external/eigen/Eigen/src/LU/
Determinant.h 94 eigen_assert(rows() == cols());
  /external/eigen/Eigen/src/OrderingMethods/
Ordering.h 130 Index n = mat.cols();

Completed in 836 milliseconds

<<11121314151617181920>>