| /external/eigen/test/eigen2/ |
| eigen2_eigensolver.cpp | 22 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,cols)
[all...] |
| eigen2_sparse_product.cpp | 14 const int rows = ref.rows(); local
19 double density = std::max(8./(rows*cols), 0.01);
25 DenseMatrix refMat2 = DenseMatrix::Zero(rows, rows);
26 DenseMatrix refMat3 = DenseMatrix::Zero(rows, rows);
27 DenseMatrix refMat4 = DenseMatrix::Zero(rows, rows);
28 DenseMatrix dm4 = DenseMatrix::Zero(rows, rows)
[all...] |
| eigen2_triangular.cpp | 20 int rows = m.rows(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols),
25 m3(rows, cols),
26 m4(rows, cols),
27 r1(rows, cols),
28 r2(rows, cols),
29 mzero = MatrixType::Zero(rows, cols),
30 mones = MatrixType::Ones(rows, cols)
[all...] |
| eigen2_visitor.cpp | 16 int rows = p.rows(); local
21 m = MatrixType::Random(rows, cols);
30 for(int i = 0; i < rows; i++)
|
| product.h | 36 int rows = m.rows(); local
41 MatrixType m1 = MatrixType::Random(rows, cols),
42 m2 = MatrixType::Random(rows, cols),
43 m3(rows, cols),
44 mzero = MatrixType::Zero(rows, cols);
46 identity = RowSquareMatrixType::Identity(rows, rows),
47 square = RowSquareMatrixType::Random(rows, rows),
[all...] |
| /external/eigen/test/ |
| eigensolver_selfadjoint.cpp | 21 Index rows = m.rows(); local
32 MatrixType a = MatrixType::Random(rows,cols);
33 MatrixType a1 = MatrixType::Random(rows,cols);
37 MatrixType b = MatrixType::Random(rows,cols);
38 MatrixType b1 = MatrixType::Random(rows,cols);
85 MatrixType id = MatrixType::Identity(rows, cols);
105 if (rows > 1)
|
| householder.cpp | 21 Index rows = m.rows(); local
36 Matrix<Scalar, EIGEN_SIZE_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols));
43 VectorType v1 = VectorType::Random(rows), v2;
48 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(v1.tail(rows-1).norm(), v1.norm());
49 v1 = VectorType::Random(rows);
54 MatrixType m1(rows, cols),
55 m2(rows, cols);
57 v1 = VectorType::Random(rows);
[all...] |
| integer_types.cpp | 27 Index rows = m.rows(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
61 Index rows = m.rows(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, cols)
[all...] |
| lu.cpp | 22 Index rows, cols, cols2; local
25 rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE);
29 rows = MatrixType::RowsAtCompileTime;
52 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
55 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1));
57 MatrixType m1(rows, cols), m3(rows, cols2);
59 createRandomPIMatrixOfRank(rank, rows, cols, m1);
69 MatrixType u(rows,cols)
137 Index rows = internal::random<Index>(1,4); local
[all...] |
| permutationmatrices.cpp | 18 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime,
20 typedef PermutationMatrix<Rows> LeftPermutationType;
21 typedef Matrix<int, Rows, 1> LeftPermutationVectorType;
27 Index rows = m.rows(); local
30 MatrixType m_original = MatrixType::Random(rows,cols);
32 randomPermutationVector(lv, rows);
39 for (int i=0; i<rows; i++)
43 Matrix<Scalar,Rows,Rows> lm(lp)
[all...] |
| product.h | 35 Index rows = m.rows(); local
40 MatrixType m1 = MatrixType::Random(rows, cols),
41 m2 = MatrixType::Random(rows, cols),
42 m3(rows, cols);
44 identity = RowSquareMatrixType::Identity(rows, rows),
45 square = RowSquareMatrixType::Random(rows, rows),
46 res = RowSquareMatrixType::Random(rows, rows)
[all...] |
| product_notemporary.cpp | 41 Index rows = m.rows(); local
44 ColMajorMatrixType m1 = MatrixType::Random(rows, cols),
45 m2 = MatrixType::Random(rows, cols),
46 m3(rows, cols);
47 RowVectorType rv1 = RowVectorType::Random(rows), rvres(rows);
49 RowMajorMatrixType rm3(rows, cols);
58 r1 = internal::random<Index>(8,rows-r0);
|
| product_selfadjoint.cpp | 22 Index rows = m.rows(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
28 VectorType v1 = VectorType::Random(rows),
29 v2 = VectorType::Random(rows),
30 v3(rows);
31 RowVectorType r1 = RowVectorType::Random(rows),
32 r2 = RowVectorType::Random(rows);
33 RhsMatrixType m4 = RhsMatrixType::Random(rows,10)
[all...] |
| qr.cpp | 17 Index rows = m.rows(); local
24 MatrixType a = MatrixType::Random(rows,cols);
36 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
38 Matrix<Scalar,Rows,Cols> m1 = Matrix<Scalar,Rows,Cols>::Random();
39 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
41 Matrix<Scalar,Rows,Cols> r = qr.matrixQR();
43 for(int i = 0; i < Rows; i++) for(int j = 0; j < Cols; j++) if(i>j) r(i,j) = Scalar(0);
48 Matrix<Scalar,Rows,Cols2> m3 = m1*m2
[all...] |
| qr_colpivoting.cpp | 18 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols2 = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
26 createRandomPIMatrixOfRank(rank,rows,cols,m1);
50 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
52 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1);
53 Matrix<Scalar,Rows,Cols> m1;
54 createRandomPIMatrixOfRank(rank,Rows,Cols,m1);
55 ColPivHouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
58 VERIFY(qr.isInjective() == (rank == Rows));
62 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>()
[all...] |
| qr_fullpivoting.cpp | 18 Index rows = internal::random<Index>(20,200), cols = internal::random<int>(20,200), cols2 = internal::random<int>(20,200); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
25 createRandomPIMatrixOfRank(rank,rows,cols,m1);
39 for(int i = 0; i < rows; i++) for(int j = 0; j < cols; j++) if(i>j) r(i,j) = Scalar(0);
|
| triangular.cpp | 22 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*cols>1
130 Index rows = m.rows(); local
[all...] |
| visitor.cpp | 17 Index rows = p.rows(); local
22 m = MatrixType::Random(rows, cols);
31 for(Index i = 0; i < rows; i++)
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IncompleteLU.h | 34 Index rows() const { return m_lu.rows(); } function in class:Eigen::IncompleteLU
84 eigen_assert(cols()==b.rows()
85 && "IncompleteLU::solve(): invalid number of rows of the right hand side matrix b");
|
| /external/eigen/unsupported/test/ |
| sparse_extra.cpp | 54 const Index rows = ref.rows(); local
59 double density = (std::max)(8./(rows*cols), 0.01);
64 SparseMatrixType m(rows, cols);
65 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
66 DenseVector vec1 = DenseVector::Random(rows);
119 SparseMatrixType m1(rows,cols), m2(rows,cols);
120 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows);
[all...] |
| /external/freetype/src/sfnt/ |
| pngshim.c | 196 png_byte* *rows; local
200 y_offset < 0 || y_offset + metrics->height > map->rows ||
310 if ( FT_NEW_ARRAY( rows, imgHeight ) )
317 rows[i] = map->buffer + ( y_offset + i ) * map->pitch + x_offset * 4;
319 png_read_image( png, rows );
321 FT_FREE( rows );
|
| /external/openssl/crypto/bio/ |
| b_dump.c | 82 int i,j,rows,trc; local
103 rows=(len/dump_width);
104 if ((rows*dump_width)<len)
105 rows++;
106 for(i=0;i<rows;i++)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/ |
| Table_Suite.py | 42 class rows(aetools.ComponentItem): class in inherits:aetools.ComponentItem
43 """rows - """
46 row = rows
66 rows._superclassnames = []
67 rows._privpropdict = {
69 rows._privelemdict = {
89 'crow' : rows,
|
| /external/ceres-solver/internal/ceres/ |
| compressed_row_jacobian_writer.cc | 76 int* rows = jacobian->mutable_rows(); local
79 rows[0] = 0;
108 rows[row_pos + j + 1] = rows[row_pos + j] + num_derivatives;
123 const int column_block_begin = rows[row_pos + r] + col_pos;
133 CHECK_EQ(num_jacobian_nonzeros, rows[total_num_residuals]);
163 const int* jacobian_rows = jacobian->rows();
|
| 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) {
58 if (rows[x] == rows[y]) {
61 return (rows[x] < rows[y])
64 const int* rows; member in struct:ceres::internal::__anon4018::RowColLessThan
303 int* rows = matrix->mutable_rows(); local
[all...] |
