| /external/eigen/Eigen/src/Core/ |
| CwiseUnaryView.h | 71 EIGEN_STRONG_INLINE Index rows() const { return m_matrix.rows(); } function in class:Eigen::CwiseUnaryView
|
| EigenBase.h | 43 /** \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());
|
| Select.h | 68 eigen_assert(m_condition.rows() == m_then.rows() && m_condition.rows() == m_else.rows());
72 Index rows() const { return m_condition.rows(); } function in class:Eigen::Select
142 derived(), thenMatrix.derived(), ThenDerived::Constant(rows(),cols(),elseScalar));
157 derived(), ElseDerived::Constant(rows(),cols(),thenScalar), elseMatrix.derived());
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| Minor.h | 65 eigen_assert(row >= 0 && row < matrix.rows()
71 inline Index rows() const { return m_matrix.rows() - 1; } function in class:Eigen::Minor
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BasicPreconditioners.h | 51 Index rows() const { return m_invdiag.size(); } function in class:Eigen::DiagonalPreconditioner
93 eigen_assert(m_invdiag.size()==b.rows()
94 && "DiagonalPreconditioner::solve(): invalid number of rows of the right hand side matrix b");
|
| /external/eigen/Eigen/src/SparseCore/ |
| ConservativeSparseSparseProduct.h | 24 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 int t200 = rows/(log2(200)*1.39);
80 int t = (rows*100)/139;
103 for(int i=0; i<rows; ++i)
139 ColMajorMatrix resCol(lhs.rows(),rhs.cols());
154 RowMajorMatrix resRow(lhs.rows(), rhs.cols());
167 RowMajorMatrix resRow(lhs.rows(), rhs.cols())
[all...] |
| SparsePermutation.h | 52 inline int rows() const { return m_matrix.rows(); } function in struct:Eigen::internal::permut_sparsematrix_product_retval
59 SparseMatrix<Scalar,SrcStorageOrder,Index> tmp(m_matrix.rows(), m_matrix.cols());
79 SparseMatrix<Scalar,int(SrcStorageOrder)==RowMajor?ColMajor:RowMajor,Index> tmp(m_matrix.rows(), m_matrix.cols());
117 /** \returns the matrix with the permutation applied to the rows
137 /** \returns the matrix with the inverse permutation applied to the rows.
|
| SparseTriangularView.h | 40 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::SparseTriangularView
|
| SparseView.h | 44 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::SparseView
|
| /external/eigen/Eigen/src/misc/ |
| Image.h | 27 // dimension is the number of rows of the original matrix
31 MatrixType::MaxColsAtCompileTime // so it has the same number of rows and at most as many columns.
49 inline Index rows() const { return m_dec.rows(); } function in struct:Eigen::internal::image_retval_base
77 using Base::rows; \
|
| SparseSolve.h | 39 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::sparse_solve_retval_base
62 using Base::rows; \
92 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::solve_retval_with_guess
|
| /external/eigen/bench/ |
| benchCholesky.cpp | 31 int rows = m.rows(); local
35 for (int j=0; j<rows; ++j)
37 int r = std::max(rows - j -1,0);
41 int repeats = (REPEAT*1000)/(rows*rows);
46 MatrixType a = MatrixType::Random(rows,cols);
52 int r = internal::random<int>(0,covMat.rows()-1);
80 std::cout << covMat.rows() << " \t"
92 gsl_matrix* gslCovMat = gsl_matrix_alloc(covMat.rows(),covMat.cols())
[all...] |
| benchEigenSolver.cpp | 36 int rows = m.rows(); local
39 int stdRepeats = std::max(1,int((REPEAT*1000)/(rows*rows*sqrt(rows))));
45 MatrixType a = MatrixType::Random(rows,cols);
51 int r = internal::random<int>(0,covMat.rows()-1);
85 std::cout << covMat.rows() << " \t"
95 gmm::dense_matrix<Scalar> gmmCovMat(covMat.rows(),covMat.cols());
96 gmm::dense_matrix<Scalar> eigvect(covMat.rows(),covMat.cols())
[all...] |
| sparse_cholesky.cpp | 44 void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatrix& dst)
46 dst.startFill(rows*cols*density);
50 for(int i = j+1; i < rows; i++)
79 int rows = SIZE; local
92 EigenSparseSelfAdjointMatrix sm1(rows, cols);
94 fillSpdMatrix(density, rows, cols, sm1);
103 DenseMatrix m1(rows,cols);
118 for (int i=j; i<rows; ++i)
|
| sparse_lu.cpp | 74 int rows = SIZE; local
87 EigenSparseMatrix sm1(rows, cols);
88 fillMatrix(density, rows, cols, sm1);
96 DenseMatrix m1(rows,cols);
|
| sparse_product.cpp | 53 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
56 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
57 // // lhs._valuePtr(), lhs.rows(), DST, dst_stride);
100 int rows = SIZE; local
104 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols), sm3(rows,cols), sm4(rows,cols);
111 fillMatrix2(nnzPerCol, rows, cols, sm1);
112 fillMatrix2(nnzPerCol, rows, cols, sm2)
[all...] |
| sparse_randomsetter.cpp | 47 int rows = sm1.rows(); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
67 int rows = SIZE; local
71 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols);
74 nentries = rows*cols*density;
81 dummy = internal::random<int>(0,rows-1) + internal::random<int>(0,cols-1);
97 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
106 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1
[all...] |
| sparse_trisolver.cpp | 40 void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst)
42 dst.startFill(rows*cols*density);
58 int rows = SIZE; local
63 EigenSparseTriMatrix sm1(rows,cols);
72 EigenSparseTriMatrix sm1(rows, cols);
73 fillMatrix(density, rows, cols, sm1);
81 DenseMatrix m1(rows,cols);
82 Matrix<Scalar,Dynamic,Dynamic,Dynamic,Dynamic,RowMajorBit> m2(rows,cols);
138 GmmSparse m1(rows,cols);
163 MtlSparse m1(rows,cols)
[all...] |
| /external/eigen/test/ |
| adjoint.cpp | 25 Index rows = m.rows(); local
28 MatrixType m1 = MatrixType::Random(rows, cols),
29 m2 = MatrixType::Random(rows, cols),
30 m3(rows, cols),
31 square = SquareMatrixType::Random(rows, rows);
32 VectorType v1 = VectorType::Random(rows),
33 v2 = VectorType::Random(rows),
34 v3 = VectorType::Random(rows),
[all...] |
| array.cpp | 20 Index rows = m.rows(); local
23 ArrayType m1 = ArrayType::Random(rows, cols),
24 m2 = ArrayType::Random(rows, cols),
25 m3(rows, cols);
27 ColVectorType cv1 = ColVectorType::Random(rows);
35 VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1);
37 VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1));
38 VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1);
39 VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) )
91 Index rows = m.rows(); local
156 Index rows = m.rows(); local
218 Index rows = m.rows(); local
238 Index rows = m.rows(); local
[all...] |
| cwiseop.cpp | 38 Index rows = m.rows(); local
41 MatrixType m1 = MatrixType::Random(rows, cols),
42 m2 = MatrixType::Random(rows, cols),
43 m3(rows, cols),
44 m4(rows, cols),
45 mzero = MatrixType::Zero(rows, cols),
46 mones = MatrixType::Ones(rows, cols),
48 ::Identity(rows, rows);
[all...] |
| diagonalmatrices.cpp | 17 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
18 typedef Matrix<Scalar, Rows, 1> VectorType;
20 typedef Matrix<Scalar, Rows, Rows> SquareMatrixType;
21 typedef DiagonalMatrix<Scalar, Rows> LeftDiagonalMatrix;
23 typedef Matrix<Scalar, Rows==Dynamic?Dynamic:2*Rows, Cols==Dynamic?Dynamic:2*Cols> BigMatrix;
24 Index rows = m.rows(); local
27 MatrixType m1 = MatrixType::Random(rows, cols)
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_adjoint.cpp | 22 int rows = m.rows(); local
29 MatrixType m1 = MatrixType::Random(rows, cols),
30 m2 = MatrixType::Random(rows, cols),
31 m3(rows, cols),
32 mzero = MatrixType::Zero(rows, cols),
33 identity = SquareMatrixType::Identity(rows, rows),
34 square = SquareMatrixType::Random(rows, rows);
[all...] |
| eigen2_cholesky.cpp | 24 int rows = m.rows(); local
32 MatrixType a0 = MatrixType::Random(rows,cols);
33 VectorType vecB = VectorType::Random(rows), vecX(rows);
34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
37 MatrixType a1 = MatrixType::Random(rows,cols);
52 VectorType vecX(rows), _vecX, _vecB;
91 if (rows>4
[all...] |
| eigen2_cwiseop.cpp | 28 int rows = m.rows(); 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),
38 ::Identity(rows, rows),
[all...] |
