Searched refs:cols (Results 126 - 150 of 683) sorted by relevance

1234567891011>>

/external/eigen/test/
H A Dblock.cpp44 Index cols = m.cols(); local
46 MatrixType m1 = MatrixType::Random(rows, cols),
48 m2 = MatrixType::Random(rows, cols),
49 m3(rows, cols),
50 ones = MatrixType::Ones(rows, cols);
57 Index c1 = internal::random<Index>(0,cols-1);
58 Index c2 = internal::random<Index>(c1,cols-1);
81 RowVectorType br1(m1.block(r1,0,1,cols));
94 if (rows>=5 && cols>
184 Index cols = m.cols(); local
218 Index cols = m.cols(); local
[all...]
H A Dcwiseop.cpp73 Index cols = m.cols(); local
75 MatrixType m1 = MatrixType::Random(rows, cols),
77 m2 = MatrixType::Random(rows, cols),
78 m3(rows, cols),
79 m4(rows, cols),
80 mzero = MatrixType::Zero(rows, cols),
81 mones = MatrixType::Ones(rows, cols),
89 c = internal::random<Index>(0, cols-1);
94 m3 = MatrixType::Constant(rows, cols, s
[all...]
H A Dinverse.cpp22 Index cols = m.cols(); local
26 MatrixType m1(rows, cols),
27 m2(rows, cols),
65 MatrixType m3 = v3*v3.transpose(), m4(rows,cols);
H A Djacobi.cpp19 Index cols = m.cols(); local
28 const MatrixType a(MatrixType::Random(rows, cols));
48 Index p = internal::random<Index>(0, cols-1);
51 q = internal::random<Index>(0, cols-1);
H A Dvectorwiseop.cpp22 Index cols = m.cols(); local
24 c = internal::random<Index>(0, cols-1);
26 ArrayType m1 = ArrayType::Random(rows, cols),
27 m2(rows, cols),
28 m3(rows, cols);
31 RowVectorType rowvec = RowVectorType::Random(cols);
127 Index cols = m.cols(); local
129 c = internal::random<Index>(0, cols
[all...]
H A Dtriangular.cpp23 typename MatrixType::Index cols = m.cols(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols),
28 m4(rows, cols),
29 r1(rows, cols),
30 r2(rows, cols);
36 if (rows*cols>1)
66 m1 = MatrixType::Random(rows, cols);
128 Index cols = m.cols(); local
[all...]
/external/eigen/test/eigen2/
H A Deigen2_cwiseop.cpp29 int cols = m.cols(); local
31 MatrixType m1 = MatrixType::Random(rows, cols),
32 m2 = MatrixType::Random(rows, cols),
33 m3(rows, cols),
34 m4(rows, cols),
35 mzero = MatrixType::Zero(rows, cols),
36 mones = MatrixType::Ones(rows, cols),
47 c = ei_random<int>(0, cols-1);
52 m3 = MatrixType::Constant(rows, cols, s
[all...]
H A Deigen2_adjoint.cpp23 int cols = m.cols(); local
29 MatrixType m1 = MatrixType::Random(rows, cols),
30 m2 = MatrixType::Random(rows, cols),
31 m3(rows, cols),
32 mzero = MatrixType::Zero(rows, cols),
68 c = ei_random<int>(0, cols-1);
H A Deigen2_eigensolver.cpp23 int cols = m.cols(); local
33 MatrixType a = MatrixType::Random(rows,cols);
34 MatrixType a1 = MatrixType::Random(rows,cols);
37 MatrixType b = MatrixType::Random(rows,cols);
38 MatrixType b1 = MatrixType::Random(rows,cols);
106 int cols = m.cols(); local
116 MatrixType a = MatrixType::Random(rows,cols);
117 MatrixType a1 = MatrixType::Random(rows,cols);
[all...]
/external/opencv/cv/src/
H A Dcvkdtree.cpp90 assert(d->cols == tr->dims());
93 assert(results->cols == k);
94 assert(dist->cols == k);
120 int rn = results->rows * results->cols;
146 (&tmp[0], &tmp[0] + tmp.size(), mat->cols,
174 assert(bounds_min->rows * bounds_min->cols == dims());
175 assert(bounds_max->rows * bounds_max->cols == dims());
216 if (desc->cols != dims)
218 if (results->rows != desc->rows && results->cols != k)
220 if (dist->rows != desc->rows && dist->cols !
[all...]
H A Dcvadapthresh.cpp53 int i, j, rows, cols; local
67 cols = src->cols;
72 CV_CALL( mean = cvCreateMat( rows, cols, CV_8UC1 ));
92 for( j = 0; j < cols; j++ )
H A Dcvtemplmatch.cpp103 if( img->cols < templ->cols || img->rows < templ->rows )
108 corr->cols > img->cols + templ->cols - 1 )
112 blocksize.width = cvRound(templ->cols*block_scale);
113 blocksize.width = MAX( blocksize.width, min_block_size - templ->cols + 1 );
114 blocksize.width = MIN( blocksize.width, corr->cols );
119 dftsize.width = cvGetOptimalDFTSize(blocksize.width + templ->cols - 1);
127 blocksize.width = dftsize.width - templ->cols
[all...]
/external/eigen/Eigen/src/Core/products/
H A DSelfadjointMatrixMatrix.h22 void pack(Scalar* blockA, const const_blas_data_mapper<Scalar,Index,StorageOrder>& lhs, Index cols, Index i, Index& count) argument
42 for(Index k=i+BlockRows; k<cols; k++)
46 void operator()(Scalar* blockA, const Scalar* _lhs, Index lhsStride, Index cols, Index rows) argument
53 pack<Pack1>(blockA, lhs, cols, i, count);
58 pack<Pack2>(blockA, lhs, cols, peeled_mc, count);
70 for(Index k=i+1; k<cols; k++)
80 void operator()(Scalar* blockB, const Scalar* _rhs, Index rhsStride, Index rows, Index cols, Index k2) argument
85 Index packet_cols = (cols/nr)*nr;
166 for(Index j2=packet_cols; j2<cols; ++j2)
210 Index rows, Index cols,
209 run( Index rows, Index cols, const Scalar* lhs, Index lhsStride, const Scalar* rhs, Index rhsStride, Scalar* res, Index resStride, const Scalar& alpha) argument
243 run( Index rows, Index cols, const Scalar* _lhs, Index lhsStride, const Scalar* _rhs, Index rhsStride, Scalar* res, Index resStride, const Scalar& alpha) argument
334 run( Index rows, Index cols, const Scalar* _lhs, Index lhsStride, const Scalar* _rhs, Index rhsStride, Scalar* res, Index resStride, const Scalar& alpha) argument
[all...]
/external/ceres-solver/internal/ceres/
H A Dlinear_least_squares_problems.cc193 int* cols = A->mutable_cols(); local
201 cols[nnz] = 0;
205 cols[nnz] = 2;
212 cols[nnz] = 0;
216 cols[nnz] = 3;
223 cols[nnz] = 1;
227 cols[nnz] = 4;
234 cols[nnz] = 1;
238 cols[nnz] = 2;
245 cols[nn
[all...]
H A Ddynamic_compressed_row_sparse_matrix_test.cc85 std::vector<int> rows, cols; local
91 cols.push_back(c);
101 std::copy(cols.begin(), cols.end(), tsm->mutable_cols());
134 EXPECT_EQ(dense_from_dcrsm.cols(), num_cols);
151 ConstIntVectorRef crsm_cols(crsm->cols(), crsm->num_nonzeros());
152 ConstIntVectorRef dcrsm_cols(dcrsm->cols(), dcrsm->num_nonzeros());
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_linear.c42 size_t bytes = t->cols * t->block.size;
66 size_t bytes = t->cols * t->block.size;
93 t->cols = t->tile.width / t->block.width;
95 t->tile.size = t->cols * t->rows * t->block.size;
99 t->stride = t->cols * t->tiles_x * t->block.size;
/external/eigen/Eigen/src/Core/
H A DEigenBase.h43 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
46 inline Index cols() const { return derived().cols(); } function in struct:Eigen::EigenBase
47 /** \returns the number of coefficients, which is rows()*cols().
48 * \sa rows(), cols(), SizeAtCompileTime. */
49 inline Index size() const { return rows() * cols(); }
60 typename Dest::PlainObject res(rows(),cols());
70 typename Dest::PlainObject res(rows(),cols());
/external/eigen/bench/
H A DBenchUtil.h24 mat.setRandom();// = MatrixType::random(mat.rows(), mat.cols());
51 dst.resize(src.rows(),src.cols());
52 for (int j=0; j<src.cols(); ++j)
66 for (int j=0; j<src.cols(); ++j)
78 dst.resize(src.rows(),src.cols());
79 for (int j=0; j<src.cols(); ++j)
H A DbenchEigenSolver.cpp37 int cols = m.cols(); local
45 MatrixType a = MatrixType::Random(rows,cols);
52 int c = internal::random<int>(0,covMat.cols()-1);
95 gmm::dense_matrix<Scalar> gmmCovMat(covMat.rows(),covMat.cols());
96 gmm::dense_matrix<Scalar> eigvect(covMat.rows(),covMat.cols());
133 gsl_matrix* gslCovMat = gsl_matrix_alloc(covMat.rows(),covMat.cols());
134 gsl_matrix* gslCopy = gsl_matrix_alloc(covMat.rows(),covMat.cols());
135 gsl_matrix* eigvect = gsl_matrix_alloc(covMat.rows(),covMat.cols());
139 gsl_matrix_complex* eigvectz = gsl_matrix_complex_alloc(covMat.rows(),covMat.cols());
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_linear.c42 size_t bytes = t->cols * t->block.size;
66 size_t bytes = t->cols * t->block.size;
93 t->cols = t->tile.width / t->block.width;
95 t->tile.size = t->cols * t->rows * t->block.size;
99 t->stride = t->cols * t->tiles_x * t->block.size;
/external/qemu/distrib/sdl-1.2.15/src/video/
H A DSDL_yuv_sw.c110 int rows, int cols, int mod );
114 int rows, int cols, int mod );
128 int rows, int cols, int mod );
132 int rows, int cols, int mod );
138 int rows, int cols, int mod )
147 int cols_2 = cols / 2;
150 row2 = row1 + cols + mod;
151 lum2 = lum + cols;
153 mod += cols + mod;
198 lum += cols;
135 Color16DitherYV12Mod1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
205 Color24DitherYV12Mod1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
289 Color32DitherYV12Mod1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
364 Color16DitherYV12Mod2X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
437 Color24DitherYV12Mod2X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
535 Color32DitherYV12Mod2X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
612 Color16DitherYUY2Mod1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
656 Color24DitherYUY2Mod1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
706 Color32DitherYUY2Mod1X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
754 Color16DitherYUY2Mod2X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
798 Color24DitherYUY2Mod2X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
854 Color32DitherYUY2Mod2X( int *colortab, Uint32 *rgb_2_pix, unsigned char *lum, unsigned char *cr, unsigned char *cb, unsigned char *out, int rows, int cols, int mod ) argument
[all...]
/external/eigen/Eigen/src/plugins/
H A DBlockMethods.h82 return Block<Derived>(derived(), 0, cols() - cCols, cRows, cCols);
88 return Block<const Derived>(derived(), 0, cols() - cCols, cRows, cCols);
104 return Block<Derived, CRows, CCols>(derived(), 0, cols() - CCols);
111 return Block<const Derived, CRows, CCols>(derived(), 0, cols() - CCols);
134 return Block<Derived, CRows, CCols>(derived(), 0, cols() - cCols, cRows, cCols);
141 return Block<const Derived, CRows, CCols>(derived(), 0, cols() - cCols, cRows, cCols);
233 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
239 return Block<const Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
254 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
261 return Block<const Derived, CRows, CCols>(derived(), rows() - CRows, cols()
[all...]
/external/eigen/unsupported/Eigen/src/Skyline/
H A DSkylineMatrixBase.h38 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
44 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
104 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
110 inline Index cols() const { function in class:Eigen::SkylineMatrixBase
111 return derived().cols();
114 /** \returns the number of coefficients, which is \a rows()*cols().
115 * \sa rows(), cols(), SizeAtCompileTime. */
117 return rows() * cols();
129 return (int(Flags) & RowMajorBit) ? this->rows() : this->cols();
133 * i.e., the number of rows for a columns major matrix, and the number of cols otherwis
[all...]
/external/chromium_org/third_party/skia/src/images/
H A Dbmpdecoderhelper.cpp41 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/debug/gdb/
H A Dprinters.py60 self.cols = val['m_storage']['m_cols']
62 self.cols = int(template_params[2])
81 def __init__ (self, rows, cols, dataPtr, rowMajor):
83 self.cols = cols
97 if self.currentCol >= self.cols:
109 if self.currentCol >= self.cols:
116 if (self.cols == 1): #if it's a column vector
124 return self._iterator(self.rows, self.cols, self.data, self.rowMajor)
127 return "Eigen::%s<%s,%d,%d,%s> (data ptr: %s)" % (self.variety, self.innerType, self.rows, self.cols, "RowMajo
[all...]

Completed in 335 milliseconds

1234567891011>>