| /external/opencv/cv/src/ |
| cvkdtree.cpp | 90 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 != k
[all...] |
| cvadapthresh.cpp | 53 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++ )
|
| cvtemplmatch.cpp | 103 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 + 1
[all...] |
| /external/ceres-solver/internal/ceres/ |
| linear_least_squares_problems.cc | 193 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[nnz] = 1
[all...] |
| compressed_row_sparse_matrix.cc | 46 // duplicates in the pair of arrays rows and cols, i.e., there is no
49 // rows[i] == rows[j] && cols[i] == cols[j]
53 RowColLessThan(const int* rows, const int* cols)
54 : rows(rows), cols(cols) {
59 return (cols[x] < cols[y]);
65 const int* cols; member in struct:ceres::internal::__anon4015::RowColLessThan
106 sort(index.begin(), index.end(), RowColLessThan(m.rows(), m.cols()));
304 int* cols = matrix->mutable_cols(); local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_linear.c | 42 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/ |
| EigenBase.h | 43 /** \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/ |
| BenchUtil.h | 24 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)
|
| benchEigenSolver.cpp | 37 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/eigen/test/ |
| inverse.cpp | 21 Index cols = m.cols(); local
27 MatrixType m1(rows, cols),
28 m2(rows, cols),
63 MatrixType m3 = v3*v3.transpose(), m4(rows,cols);
|
| jacobi.cpp | 20 Index cols = m.cols(); local
29 const MatrixType a(MatrixType::Random(rows, cols));
49 Index p = internal::random<Index>(0, cols-1);
52 q = internal::random<Index>(0, cols-1);
|
| triangular.cpp | 23 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);
131 Index cols = m.cols(); local
[all...] |
| householder.cpp | 22 Index cols = m.cols(); local
36 Matrix<Scalar, EIGEN_SIZE_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols));
54 MatrixType m1(rows, cols),
55 m2(rows, cols);
64 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(m1.block(1,0,rows-1,cols).norm(), m1.norm());
84 m1.setRandom(rows, cols);
85 HBlockMatrixType hbm = m1.block(shift,0,brows,cols);
88 m2.block(shift,0,brows,cols) = qr.matrixQR();
96 m5.block(shift,0,brows,cols).template triangularView<StrictlyLower>().setZero()
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_linear.c | 42 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/ |
| SDL_yuv_sw.c | 110 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;
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/DOM/resources/dom-perf/ |
| events.js | 52 function EventsTest(rows, cols) {
55 this.cols = cols;
66 html_string += me.CreateRow(i, me.cols, add_event_listeners);
79 // Returns an html string with an outer div containing |cols| inner divs,
81 this.CreateRow = function(row_id, cols, add_event_listeners) {
83 for (var i = 0; i < cols; i++)
113 for (var col = 0; col < me.cols; col++)
151 if (node_count != me.rows * me.cols)
188 if (node_count != me.rows * me.cols)
[all...] |
| /external/eigen/Eigen/src/misc/ |
| SparseSolve.h | 39 inline Index rows() const { return m_dec.cols(); }
40 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::sparse_solve_retval_base
63 using Base::cols; \
92 inline Index rows() const { return m_dec.cols(); }
93 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::solve_retval_with_guess
|
| /external/eigen/test/eigen2/ |
| eigen2_adjoint.cpp | 23 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);
|
| eigen2_eigensolver.cpp | 23 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/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineMatrixBase.h | 38 * \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 otherwise *
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixMatrix.h | 22 void pack(Scalar* blockA, const const_blas_data_mapper<Scalar,Index,StorageOrder>& lhs, Index cols, Index i, Index& count)
42 for(Index k=i+BlockRows; k<cols; k++)
46 void operator()(Scalar* blockA, const Scalar* _lhs, Index lhsStride, Index cols, Index rows)
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)
85 Index packet_cols = (cols/nr)*nr;
166 for(Index j2=packet_cols; j2<cols; ++j2)
210 Index rows, Index cols,
[all...] |
| /external/chromium_org/third_party/skia/src/images/ |
| 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; ++i)
[all...] |
| /external/eigen/debug/gdb/ |
| printers.py | 60 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, "RowMajor" if self.rowMajor else "ColMajor", self.data
[all...] |
| /external/skia/src/images/ |
| 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; ++i)
[all...] |
| /external/opencv/ml/src/ |
| 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 = layer_sizes->data.i[j] 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...] |
