| /external/eigen/test/ |
| jacobi.cpp | 19 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);
|
| 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);
143 Index cols = m.cols(); local
[all...] |
| eigensolver_generalized_real.cpp | 23 Index cols = m.cols(); local
29 MatrixType a = MatrixType::Random(rows,cols);
30 MatrixType b = MatrixType::Random(rows,cols);
31 MatrixType a1 = MatrixType::Random(rows,cols);
32 MatrixType b1 = MatrixType::Random(rows,cols);
60 for(Index k=0; k<cols; ++k)
|
| sparse_block.cpp | 29 const Index cols = ref.cols(); local
36 double density = (std::max)(8./(rows*cols), 0.01);
44 SparseMatrixType m(rows, cols);
45 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
53 Index j = internal::random<Index>(0,cols-2);
55 Index w = internal::random<Index>(1,cols-j);
108 for(Index c=0; c<cols; c++)
123 DenseMatrix refMat2 = DenseMatrix::Zero(rows, cols);
124 SparseMatrixType m2(rows, cols);
[all...] |
| lu.cpp | 26 Index rows, cols, cols2; local
37 cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE);
42 cols2 = cols = MatrixType::ColsAtCompileTime;
56 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
59 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1));
61 MatrixType m1(rows, cols), m3(rows, cols2);
62 CMatrixType m2(cols, cols2);
63 createRandomPIMatrixOfRank(rank, rows, cols, m1)
[all...] |
| eigensolver_complex.cpp | 19 if(match || col==diffs.cols())
25 Index n = diffs.cols();
60 VERIFY(vec1.cols() == 1);
61 VERIFY(vec2.cols() == 1);
79 Index cols = m.cols(); local
84 MatrixType a = MatrixType::Random(rows,cols);
114 MatrixType z = MatrixType::Zero(rows,cols);
118 MatrixType id = MatrixType::Identity(rows, cols);
151 MatrixType a = MatrixType::Random(m.rows(),m.cols());
[all...] |
| householder.cpp | 22 Index cols = m.cols(); local
34 Matrix<Scalar, EIGEN_SIZE_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols));
52 MatrixType m1(rows, cols),
53 m2(rows, cols);
62 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(m1.block(1,0,rows-1,cols).norm(), m1.norm());
82 m1.setRandom(rows, cols);
83 HBlockMatrixType hbm = m1.block(shift,0,brows,cols);
86 m2.block(shift,0,brows,cols) = qr.matrixQR();
94 m5.block(shift,0,brows,cols).template triangularView<StrictlyLower>().setZero()
[all...] |
| vectorwiseop.cpp | 24 Index cols = m.cols(); local
26 c = internal::random<Index>(0, cols-1);
28 ArrayType m1 = ArrayType::Random(rows, cols),
29 m2(rows, cols),
30 m3(rows, cols);
33 RowVectorType rowvec = RowVectorType::Random(cols);
118 Array<bool,Dynamic,Dynamic> mb(rows,cols);
141 Index cols = m.cols(); local
[all...] |
| /external/gemmlowp/doc/ |
| quantization_example.cc | 30 for (int j = 0; j < m.cols(); j++) {
47 for (int j = 0; j < m.cols(); j++) {
120 assert(lhs.cols() == rhs.rows());
122 assert(rhs.cols() == result->cols());
124 for (int k = 0; k < rhs.cols(); k++) {
126 for (int j = 0; j < lhs.cols(); j++) {
156 MatrixWithStorage(int rows, int cols)
157 : storage(rows * cols), matrix_map(storage.data(), rows, cols) {}
[all...] |
| /external/libvpx/libvpx/vp9/common/ |
| vp9_debugmodes.c | 30 int cols = cm->mi_cols; local
36 for (mi_col = 0; mi_col < cols; mi_col++) {
52 int cols = cm->mi_cols; local
64 for (mi_col = 0; mi_col < cols; mi_col++) {
78 for (mi_col = 0; mi_col < cols; mi_col++) {
|
| /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/opencv/cv/src/ |
| 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/eigen/Eigen/src/Core/ |
| DenseStorage.h | 203 EIGEN_DEVICE_FUNC DenseStorage(Index size, Index rows, Index cols) {
205 eigen_internal_assert(size==rows*cols && rows==_Rows && cols==_Cols);
208 EIGEN_UNUSED_VARIABLE(cols);
212 EIGEN_DEVICE_FUNC static Index cols(void) {return _Cols;} function in class:Eigen::DenseStorage
230 EIGEN_DEVICE_FUNC static Index cols(void) {return _Cols;} function in class:Eigen::DenseStorage
268 EIGEN_DEVICE_FUNC DenseStorage(Index, Index rows, Index cols) : m_rows(rows), m_cols(cols) {}
272 EIGEN_DEVICE_FUNC Index cols() const {return m_cols;} function in class:Eigen::DenseStorage
273 EIGEN_DEVICE_FUNC void conservativeResize(Index, Index rows, Index cols) { m_rows = rows; m_cols = cols;
301 EIGEN_DEVICE_FUNC Index cols(void) const {return _Cols;} function in class:Eigen::DenseStorage
330 EIGEN_DEVICE_FUNC Index cols(void) const {return m_cols;} function in class:Eigen::DenseStorage
395 EIGEN_DEVICE_FUNC Index cols(void) const {return m_cols;} function in class:Eigen::DenseStorage
471 EIGEN_DEVICE_FUNC Index cols(void) const {return m_cols;} function in class:Eigen::DenseStorage
545 EIGEN_DEVICE_FUNC static Index cols(void) {return _Cols;} function in class:Eigen::DenseStorage
[all...] |
| Reverse.h | 93 EIGEN_DEVICE_FUNC inline Index cols() const { return m_matrix.cols(); } function in class:Eigen::Reverse
141 if(cols()>rows())
143 Index half = cols()/2;
145 if((cols()%2)==1)
157 Index half2 = cols()/2;
185 Index half = xpr.cols()/2;
|
| MapBase.h | 71 using Base::cols;
90 /** \copydoc DenseBase::cols() */
91 EIGEN_DEVICE_FUNC inline Index cols() const { return m_cols.value(); } function in class:Eigen::MapBase
170 inline MapBase(PointerType dataPtr, Index rows, Index cols)
171 : m_data(dataPtr), m_rows(rows), m_cols(cols)
175 && cols >= 0 && (ColsAtCompileTime == Dynamic || ColsAtCompileTime == cols)));
191 || (cols() * rows() * innerStride() * sizeof(Scalar)) < internal::traits<Derived>::Alignment ) && "data is not aligned");
230 using Base::cols;
281 EIGEN_DEVICE_FUNC inline MapBase(PointerType dataPtr, Index rows, Index cols) : Base(dataPtr, rows, cols) {
[all...] |
| Solve.h | 72 EIGEN_DEVICE_FUNC Index rows() const { return m_dec.cols(); }
73 EIGEN_DEVICE_FUNC Index cols() const { return m_rhs.cols(); } function in class:Eigen::Solve
124 : m_result(solve.rows(), solve.cols())
143 Index dstCols = src.cols();
144 if((dst.rows()!=dstRows) || (dst.cols()!=dstCols))
159 Index dstCols = src.cols();
160 if((dst.rows()!=dstRows) || (dst.cols()!=dstCols))
176 Index dstCols = src.cols();
177 if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)
[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/gemmlowp/test/ |
| test.h | 62 Matrix(int rows, int cols) : Map(nullptr, 0, 0, 0) { Resize(rows, cols); }
77 void Resize(int rows, int cols) {
79 cols_ = cols;
80 stride_ = kOrder == MapOrder::ColMajor ? rows : cols;
111 for (int c = 0; c < m->cols(); c++) {
121 for (int c = 0; c < m->cols(); c++) {
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU.h | 133 inline Index cols() const { return m_mat.cols(); } function in class:Eigen::SparseLU
226 X.resize(B.rows(),B.cols());
229 for(Index j = 0; j < B.cols(); ++j)
237 for (Index j = 0; j < B.cols(); ++j)
261 for (Index j = 0; j < this->cols(); ++j)
290 for (Index j = 0; j < this->cols(); ++j)
316 for (Index j = 0; j < this->cols(); ++j)
344 for (Index j = 0; j < this->cols(); ++j)
428 ei_declare_aligned_stack_constructed_variable(StorageIndex,outerIndexPtr,mat.cols()+1,mat.isCompressed()?const_cast<StorageIndex*>(mat.outerIndexPtr()):0)
710 Index cols() { return m_mapL.cols(); } function in struct:Eigen::SparseLUMatrixLReturnType
727 Index cols() { return m_mapL.cols(); } function in struct:Eigen::SparseLUMatrixUReturnType
[all...] |
| /external/eigen/bench/ |
| 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/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
100 if self.currentCol >= self.cols:
112 if self.currentCol >= self.cols:
119 if (self.cols == 1): #if it's a column vector
127 return self._iterator(self.rows, self.cols, self.data, self.rowMajor)
130 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/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...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/scripts/ |
| byext.py | 86 cols = columns.keys()
87 cols.sort()
92 for col in cols:
109 cols.insert(0, "ext")
111 for col in cols:
116 for col in cols:
|
| /external/eigen/Eigen/src/Geometry/ |
| Homogeneous.h | 76 EIGEN_DEVICE_FUNC inline Index cols() const { return m_matrix.cols() + (int(Direction)==Horizontal ? 1 : 0); } function in class:Eigen::Homogeneous
200 Direction==Horizontal ? _expression().cols()-1 : _expression().cols()).cwiseQuotient(
206 Direction==Horizontal ? _expression().cols()-1:0,
208 Direction==Horizontal ? 1 : _expression().cols()),
210 Direction==Horizontal ? _expression().cols()-1 : 1));
266 EIGEN_DEVICE_FUNC inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::homogeneous_left_product_impl
274 (m_lhs,0,0,m_lhs.rows(),m_lhs.cols()-1) * m_rhs
304 EIGEN_DEVICE_FUNC inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::homogeneous_right_product_impl
[all...] |
