Searched refs:rows (Results 176 - 200 of 989) sorted by relevance

1234567891011>>

/external/eigen/test/
H A Dsparse_solvers.cpp17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
27 for (int i=j ; i<sparseMat.rows(); ++i)
33 template<typename Scalar> void sparse_solvers(int rows, int cols) argument
35 double density = (std::max)(8./(rows*cols), 0.01);
40 DenseVector vec1 = DenseVector::Random(rows);
48 SparseMatrix<Scalar> m2(rows, cols);
49 DenseMatrix refMat2 = DenseMatrix::Zero(rows, cols);
64 //Index rows, Index cols, Index nnz, Index* outerIndexPtr, Index* innerIndexPtr, Scalar* valuePtr
65 MappedSparseMatrix<Scalar> mm2(rows, cols, cm2.nonZeros(), cm2.outerIndexPtr(), cm2.innerIndexPtr(), cm2.valuePtr());
80 SparseMatrix<Scalar> matB(rows, row
[all...]
H A Dtriangular.cpp22 typename MatrixType::Index rows = m.rows(); 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);
31 VectorType v2 = VectorType::Random(rows);
36 if (rows*col
127 Index rows = m.rows(); local
[all...]
H A Ddiagonal.cpp17 Index rows = m.rows(); local
20 MatrixType m1 = MatrixType::Random(rows, cols),
21 m2 = MatrixType::Random(rows, cols);
28 if (rows>2)
H A Djacobi.cpp18 Index rows = m.rows(); local
28 const MatrixType a(MatrixType::Random(rows, cols));
35 Index p = internal::random<Index>(0, rows-1);
38 q = internal::random<Index>(0, rows-1);
H A Dvectorwiseop.cpp21 Index rows = m.rows(); local
23 Index r = internal::random<Index>(0, rows-1),
26 ArrayType m1 = ArrayType::Random(rows, cols),
27 m2(rows, cols),
28 m3(rows, cols);
30 ColVectorType colvec = ColVectorType::Random(rows);
126 Index rows = m.rows(); local
128 Index r = internal::random<Index>(0, rows
[all...]
H A Dpermutationmatrices.cpp26 Index rows = m.rows(); local
29 MatrixType m_original = MatrixType::Random(rows,cols);
31 randomPermutationVector(lv, rows);
38 for (int i=0; i<rows; i++)
56 randomPermutationVector(lv2, rows);
64 identityp.setIdentity(rows);
84 if(rows>1 && cols>1)
87 Index i = internal::random<Index>(0, rows-1);
89 do j = internal::random<Index>(0, rows
[all...]
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DConstrainedConjGrad.h55 Index rows = C.rows(), cols = C.cols(); local
57 TmpVec d(rows), e(rows), l(cols), p(rows), q(rows), r(rows);
64 for (Index i = 0; i < rows; ++i)
119 std::vector<bool> satured(C.rows());
124 SparseMatrix<Scalar,RowMajor> CINV(C.rows(),
[all...]
/external/libvpx/libvpx/test/
H A Dactive_map_test.cc54 map.rows = (kHeight + 15) / 16;
56 ASSERT_EQ(map.rows, 9u);
62 map.rows = (kHeight + 15) / 16;
/external/chromium_org/media/base/
H A Dvideo_util.cc34 void CopyPlane(size_t plane, const uint8* source, int stride, int rows, argument
43 int rows_to_copy = std::min(frame->rows(plane), rows);
53 void CopyYPlane(const uint8* source, int stride, int rows, VideoFrame* frame) { argument
54 CopyPlane(VideoFrame::kYPlane, source, stride, rows, frame);
57 void CopyUPlane(const uint8* source, int stride, int rows, VideoFrame* frame) { argument
58 CopyPlane(VideoFrame::kUPlane, source, stride, rows, frame);
61 void CopyVPlane(const uint8* source, int stride, int rows, VideoFrame* frame) { argument
62 CopyPlane(VideoFrame::kVPlane, source, stride, rows, frame);
65 void CopyAPlane(const uint8* source, int stride, int rows, VideoFram argument
69 MakeOpaqueAPlane(int stride, int rows, VideoFrame* frame) argument
118 const int rows = frame->rows(plane); local
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DConservativeSparseSparseProduct.h24 Index rows = lhs.innerSize(); local
28 std::vector<bool> mask(rows,false);
29 Matrix<Scalar,Dynamic,1> values(rows);
30 Matrix<Index,Dynamic,1> indices(rows);
79 Index t200 = rows/(log2(200)*1.39);
80 Index t = (rows*100)/139;
103 for(Index i=0; i<rows; ++i)
139 ColMajorMatrix resCol(lhs.rows(),rhs.cols());
154 RowMajorMatrix resRow(lhs.rows(), rhs.cols());
167 RowMajorMatrix resRow(lhs.rows(), rh
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/arm/neon/
H A Dvp9_subtract_neon.c17 void vp9_subtract_block_neon(int rows, int cols, argument
24 for (r = 0; r < rows; ++r) {
48 for (r = 0; r < rows; ++r) {
62 for (r = 0; r < rows; ++r) {
72 for (r = 0; r < rows; ++r) {
/external/eigen/Eigen/src/Core/
H A DEigenBase.h43 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
44 inline Index rows() const { return derived().rows(); } function in struct:Eigen::EigenBase
45 /** \returns the number of columns. \sa rows(), ColsAtCompileTime*/
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());
H A DBandMatrix.h50 using Base::rows;
72 Index len = coeffs().rows();
76 len = (std::min)(rows(),std::max<Index>(0,coeffs().rows() - (supers()-i)));
78 else if (i>=rows()-subs())
79 len = std::max<Index>(0,coeffs().rows() - (i + 1 - rows() + subs()));
85 { return Block<CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
89 { return Block<const CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
136 dst.resize(rows(),col
207 BandMatrix(Index rows=Rows, Index cols=Cols, Index supers=Supers, Index subs=Subs) argument
214 inline Index rows() const { return m_rows.value(); } function in class:Eigen::internal::BandMatrix
269 BandMatrixWrapper(const CoefficientsType& coeffs, Index rows=_Rows, Index cols=_Cols, Index supers=_Supers, Index subs=_Subs) argument
278 inline Index rows() const { return m_rows.value(); } function in class:Eigen::internal::BandMatrixWrapper
[all...]
/external/eigen/bench/
H A DBenchUtil.h24 mat.setRandom();// = MatrixType::random(mat.rows(), mat.cols());
51 dst.resize(src.rows(),src.cols());
53 for (int i=0; i<src.rows(); ++i)
67 for (int i=0; i<src.rows(); ++i)
78 dst.resize(src.rows(),src.cols());
80 for (int i=0; i<src.rows(); ++i)
/external/opencv/cv/src/
H A Dcvadapthresh.cpp53 int i, j, rows, cols; local
66 rows = src->rows;
72 CV_CALL( mean = cvCreateMat( rows, cols, CV_8UC1 ));
86 for( i = 0; i < rows; i++ )
/external/eigen/test/eigen2/
H A Deigen2_eigensolver.cpp22 int rows = m.rows(); 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);
56 gEval = GslTraits<RealScalar>::createVector(rows);
105 int rows = m.rows(); local
116 MatrixType a = MatrixType::Random(rows,col
[all...]
/external/ceres-solver/internal/ceres/
H A Ddynamic_compressed_row_sparse_matrix_test.cc52 // should have no effect on the number of rows, columns or nonzeros.
85 std::vector<int> rows, cols; local
90 rows.push_back(r);
100 std::copy(rows.begin(), rows.end(), tsm->mutable_rows());
133 EXPECT_EQ(dense_from_dcrsm.rows(), num_rows);
147 ConstIntVectorRef crsm_rows(crsm->rows(), crsm->num_rows() + 1);
148 ConstIntVectorRef dcrsm_rows(dcrsm->rows(), dcrsm->num_rows() + 1);
H A Dcovariance_impl.cc139 const int* rows = covariance_matrix_->rows(); local
141 const int row_size = rows[row_begin + 1] - rows[row_begin];
142 const int* cols_begin = cols + rows[row_begin];
171 ConstMatrixRef cov(covariance_matrix_->values() + rows[row_begin],
266 // Compute the number of rows. Map each parameter block to the
322 int* rows = covariance_matrix_->mutable_rows(); local
325 // Iterate over parameter blocks and in turn over the rows of the
329 // set of compressed rows correspondin
509 const int* rows = covariance_matrix_->rows(); local
641 const int* rows = covariance_matrix_->rows(); local
693 const int* rows = covariance_matrix_->rows(); local
[all...]
/external/chromium_org/media/cast/test/utility/
H A Dbarcode.cc72 // Now replicate this one row into all rows in kYPlane.
73 for (int row = 0; row < output_frame->rows(VideoFrame::kYPlane); row++) {
157 int rows = frame->rows(VideoFrame::kYPlane); local
161 std::max(0, rows / 2 - 5),
162 std::min(rows, rows / 2 + 5))) {
167 if (DecodeBarCodeRows(frame, output, 0, std::min(5, rows))) {
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/
H A DGridCoordinate.h41 // A span in a single direction (either rows or columns). Note that |resolvedInitialPosition|
138 // This represents a grid area that spans in both rows' and columns' direction.
143 , rows(0, 0)
149 , rows(r)
155 return columns == o.columns && rows == o.rows;
171 return rows.resolvedInitialPosition;
173 return rows.resolvedFinalPosition;
180 GridSpan rows; member in struct:blink::GridCoordinate
/external/eigen/Eigen/src/plugins/
H A DBlockMethods.h23 /** \internal expression type of a block of whole rows */
29 /** \internal expression type of a block of whole rows */
44 * \param blockRows the number of rows in the block
72 * \param cRows the number of rows in the corner
93 * \tparam CRows the number of rows in the corner
116 * \tparam CRows number of rows in corner as specified at compile-time
118 * \param cRows number of rows in corner as specified at run-time
121 * This function is mainly useful for corners where the number of rows is specified at compile-time
148 * \param cRows the number of rows in the corner
169 * The template parameters CRows and CCols are the number of rows an
[all...]
/external/eigen/unsupported/test/
H A Dsvd_common.h30 Index rows = m.rows(); local
42 MatrixType sigma = MatrixType::Zero(rows, cols);
60 Index rows = m.rows(); local
62 Index diagSize = (std::min)(rows, cols);
84 Index rows = m.rows(); local
95 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols));
133 Index diagSize = (std::min)(m.rows(),
144 Index rows = m.rows(); local
[all...]
/external/eigen/Eigen/src/SparseQR/
H A DSparseQR.h106 /** \returns the number of rows of the represented matrix.
108 inline Index rows() const { return m_pmat.rows(); } function in class:Eigen::SparseQR
168 eigen_assert(this->rows() == B.rows() && "SparseQR::solve() : invalid number of rows in the right hand side matrix");
178 y.resize((std::max)(cols(),Index(y.rows())),y.cols());
180 y.bottomRows(y.rows()-rank).setZero();
210 eigen_assert(this->rows() == B.rows()
583 inline Index rows() const { return m_transpose ? m_qr.rows() : m_qr.cols(); } function in struct:Eigen::SparseQR_QProduct
648 inline Index rows() const { return m_qr.rows(); } function in struct:Eigen::SparseQRMatrixQReturnType
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/decoder/
H A Dvp9_dthread.c142 // Number of superblock rows and cols
157 // Initialize cur_sb_col to -1 for all SB rows.
196 // Wait till all rows are finished
217 void vp9_loop_filter_alloc(VP9LfSync *lf_sync, VP9_COMMON *cm, int rows, argument
219 lf_sync->rows = rows;
225 vpx_malloc(sizeof(*lf_sync->mutex_) * rows));
226 for (i = 0; i < rows; ++i) {
231 vpx_malloc(sizeof(*lf_sync->cond_) * rows));
232 for (i = 0; i < rows;
[all...]
/external/eigen/debug/gdb/
H A Dprinters.py55 self.rows = val['m_storage']['m_rows']
57 self.rows = int(template_params[1])
81 def __init__ (self, rows, cols, dataPtr, rowMajor):
82 self.rows = rows
101 if self.currentRow >= self.rows:
105 if self.currentRow >= self.rows:
118 elif (self.rows == 1): #if it's a row 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, sel
[all...]

Completed in 1561 milliseconds

1234567891011>>