Searched defs:rows (Results 51 - 75 of 316) sorted by relevance

1234567891011>>

/external/eigen/Eigen/src/misc/
H A DKernel.h26 MatrixType::ColsAtCompileTime, // the number of rows in the "kernel matrix"
50 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::kernel_retval_base
75 using Base::rows; \
H A DSolve.h44 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::solve_retval_base
69 using Base::rows; \
/external/eigen/bench/
H A Dspmv.cpp28 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
31 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
32 // // lhs._valuePtr(), lhs.rows(), DST, dst_stride);
40 int rows = size; local
51 rows = atoi(argv[i]+1);
76 std::cout << argv[0] << " r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeats>\n";
80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
82 EigenSparseMatrix sm(rows,cols);
83 DenseVector dv(cols), res(rows);
91 fillMatrix2(nnzPerCol, rows, col
[all...]
/external/eigen/test/
H A Darray_replicate.cpp24 Index rows = m.rows(); local
27 MatrixType m1 = MatrixType::Random(rows, cols),
28 m2 = MatrixType::Random(rows, cols);
30 VectorType v1 = VectorType::Random(rows);
38 x1.resize(rows*f1,cols*f2);
41 x1.block(i*rows,j*cols,rows,cols) = m1;
44 x2.resize(2*rows,3*cols);
49 x2.resize(rows,f
[all...]
H A Darray_reverse.cpp22 Index rows = m.rows(); local
27 MatrixType m1 = MatrixType::Random(rows, cols);
28 VectorType v1 = VectorType::Random(rows);
32 for ( int i = 0; i < rows; i++ ) {
34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j));
40 for ( int i = 0; i < rows; i++ ) {
42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j));
48 for ( int i = 0; i < rows; i++ ) {
50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows
[all...]
H A Deigensolver_generic.cpp21 Index rows = m.rows(); local
30 MatrixType a = MatrixType::Random(rows,cols);
31 MatrixType a1 = MatrixType::Random(rows,cols);
45 VERIFY_IS_APPROX(ei1.eigenvectors().colwise().norm(), RealVectorType::Ones(rows).transpose());
53 MatrixType id = MatrixType::Identity(rows, cols);
56 if (rows > 2)
73 MatrixType a = MatrixType::Random(m.rows(),m.cols());
H A Djacobi.cpp19 Index rows = m.rows(); local
29 const MatrixType a(MatrixType::Random(rows, cols));
36 Index p = internal::random<Index>(0, rows-1);
39 q = internal::random<Index>(0, rows-1);
H A Dmapstride.cpp56 Index rows = _m.rows(), cols = _m.cols(); local
58 MatrixType m = MatrixType::Random(rows,cols);
60 Index arraysize = 2*(rows+4)*(cols+4);
69 Map<MatrixType, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1));
88 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4));
101 Map<MatrixType, Alignment, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2));
H A Dnullary.cpp20 for (Index i = 0; i < A.rows(); ++i) {
25 for (Index i = 0; i < A.rows(); ++i) {
100 const Index rows = m.rows(); local
104 A.setIdentity(rows, cols);
106 VERIFY(equalsIdentity(MatrixType::Identity(rows, cols)));
H A Dproduct_syrk.cpp21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols);
28 Rhs2 rhs2 = Rhs2::Random(rows, internal::random<int>(1,320));
29 Rhs3 rhs3 = Rhs3::Random(internal::random<int>(1,320), rows);
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 Dsparse_vector.cpp12 template<typename Scalar> void sparse_vector(int rows, int cols) argument
14 double densityMat = (std::max)(8./(rows*cols), 0.01);
15 double densityVec = (std::max)(8./float(rows), 0.1);
22 SparseMatrixType m1(rows,rows);
23 SparseVectorType v1(rows), v2(rows), v3(rows);
24 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows);
[all...]
H A Dvectorwiseop.cpp22 Index rows = m.rows(); local
24 Index r = internal::random<Index>(0, rows-1),
27 ArrayType m1 = ArrayType::Random(rows, cols),
28 m2(rows, cols),
29 m3(rows, cols);
31 ColVectorType colvec = ColVectorType::Random(rows);
115 Index rows = m.rows(); local
117 Index r = internal::random<Index>(0, rows
[all...]
/external/eigen/test/eigen2/
H A Deigen2_array.cpp23 int rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols);
35 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
36 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
58 int rows = m.rows(); local
61 int r = ei_random<int>(0, rows
[all...]
H A Deigen2_basicstuff.cpp17 int rows = m.rows(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m2 = MatrixType::Random(rows, cols),
24 m3(rows, cols),
25 mzero = MatrixType::Zero(rows, cols),
27 ::Identity(rows, rows),
28 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);
[all...]
H A Deigen2_lu.cpp17 for(int a = 0; a < 3*(m.rows()+m.cols()); a++)
20 int i = Eigen::ei_random<int>(0,m.rows()-1); // i is a random row number
23 j = Eigen::ei_random<int>(0,m.rows()-1);
41 int rows = ei_random<int>(20,200), cols = ei_random<int>(20,200), cols2 = ei_random<int>(20,200); local
42 int rank = ei_random<int>(1, std::min(rows, cols)-1);
44 MatrixType m1(rows, cols), m2(cols, cols2), m3(rows, cols2), k(1,1);
45 m1 = MatrixType::Random(rows,cols);
46 if(rows <= cols)
47 for(int i = rank; i < rows;
[all...]
H A Deigen2_sparse_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);
75 SparseMatrix<Scalar> m2(rows, cols);
76 DenseMatrix refMat2(rows, cols);
116 SparseMatrix<Scalar> m2(rows, col
[all...]
H A Deigen2_sparse_vector.cpp12 template<typename Scalar> void sparse_vector(int rows, int cols) argument
14 double densityMat = std::max(8./(rows*cols), 0.01);
15 double densityVec = std::max(8./float(rows), 0.1);
22 SparseMatrixType m1(rows,cols);
23 SparseVectorType v1(rows), v2(rows), v3(rows);
24 DenseMatrix refM1 = DenseMatrix::Zero(rows, cols);
25 DenseVector refV1 = DenseVector::Random(rows),
26 refV2 = DenseVector::Random(rows),
[all...]
/external/replicaisland/src/com/replica/replicaisland/
H A DTiledWorld.java35 public TiledWorld(int cols, int rows) { argument
37 mTilesArray = new int[cols][rows];
38 mRowCount = rows;
42 for (int y = 0; y < rows; y++) {
/external/skia/include/utils/
H A DSkMeshUtils.h23 bool init(int texW, int texH, int rows, int cols) { argument
24 return this->init(NULL, NULL, texW, texH, rows, cols);
28 int texW, int texH, int rows, int cols);
45 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
/external/skia/src/utils/
H A DSkMeshUtils.cpp21 int texW, int texH, int rows, int cols) {
22 if (rows < 2 || cols < 2) {
34 fTexCount = rows * cols;
35 rows -= 1;
37 fIndexCount = rows * cols * 6;
54 for (int x = 0; x < rows; x++) {
56 *idx++ = index + rows + 1;
60 *idx++ = index + rows + 1;
61 *idx++ = index + rows + 2;
72 const SkScalar dx = SkIntToScalar(texW) / rows;
20 init(SkPoint tex[], uint16_t indices[], int texW, int texH, int rows, int cols) argument
88 Draw(SkCanvas* canvas, const SkBitmap& bitmap, int rows, int cols, const SkPoint verts[], const SkColor colors[], const SkPaint& paint) argument
[all...]
/external/chromium/chrome/browser/notifications/
H A Dnotification_exceptions_table_model.cc39 const Rows& rows) const {
40 return !rows.empty();
43 void NotificationExceptionsTableModel::RemoveRows(const Rows& rows) { argument
45 // This is O(n^2) in rows.size(). Since n is small, that's ok.
46 for (Rows::const_reverse_iterator i(rows.rbegin()); i != rows.rend(); ++i) {
/external/eigen/Eigen/src/Core/
H A DArrayWrapper.h53 inline Index rows() const { return m_expression.rows(); } function in class:Eigen::ArrayWrapper
166 inline Index rows() const { return m_expression.rows(); } function in class:Eigen::MatrixWrapper
H A DCwiseUnaryOp.h70 EIGEN_STRONG_INLINE Index rows() const { return m_xpr.rows(); } function in class:Eigen::CwiseUnaryOp
H A DDenseStorage.h94 static inline DenseIndex rows(void) {return _Rows;} function in class:Eigen::DenseStorage
110 static inline DenseIndex rows(void) {return _Rows;} function in class:Eigen::DenseStorage
138 inline DenseStorage(DenseIndex, DenseIndex rows, DenseIndex cols) : m_rows(rows), m_cols(cols) {} argument
141 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
143 inline void conservativeResize(DenseIndex, DenseIndex rows, DenseIndex cols) { m_rows = rows; m_cols = cols; } argument
144 inline void resize(DenseIndex, DenseIndex rows, DenseIndex cols) { m_rows = rows; m_cols = cols; } argument
158 inline DenseStorage(DenseIndex, DenseIndex rows, DenseInde argument
160 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
162 conservativeResize(DenseIndex, DenseIndex rows, DenseIndex) argument
163 resize(DenseIndex, DenseIndex rows, DenseIndex) argument
179 inline DenseIndex rows(void) const {return _Rows;} function in class:Eigen::DenseStorage
197 DenseStorage(DenseIndex size, DenseIndex rows, DenseIndex cols) argument
203 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
205 conservativeResize(DenseIndex size, DenseIndex rows, DenseIndex cols) argument
211 resize(DenseIndex size, DenseIndex rows, DenseIndex cols) argument
241 static inline DenseIndex rows(void) {return _Rows;} function in class:Eigen::DenseStorage
273 DenseStorage(DenseIndex size, DenseIndex rows, DenseIndex) argument
277 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
279 conservativeResize(DenseIndex size, DenseIndex rows, DenseIndex) argument
284 resize(DenseIndex size, DenseIndex rows, DenseIndex) argument
[all...]

Completed in 300 milliseconds

1234567891011>>