Searched defs:rows (Results 151 - 175 of 316) sorted by relevance

1234567891011>>

/external/eigen/Eigen/src/SparseCore/
H A DSparseView.h44 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::SparseView
/external/eigen/bench/
H A DBenchSparseUtil.h27 void fillMatrix(float density, int rows, int cols, EigenSparseMatrix& dst) argument
29 dst.reserve(double(rows)*cols*density);
32 for(int i = 0; i < rows; i++)
42 void fillMatrix2(int nnzPerCol, int rows, int cols, EigenSparseMatrix& dst) argument
51 int k = internal::random<int>(0,rows-1);
53 k = internal::random<int>(0,rows-1);
76 GmmDynSparse tmp(src.rows(), src.cols());
130 dst.resize(src.rows(), src.cols(), false);
H A DbenchEigenSolver.cpp36 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(),covMa
[all...]
H A Dsparse_cholesky.cpp44 void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatrix& dst) argument
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)
/external/eigen/demos/mix_eigen_and_c/
H A Dbinary_library.cpp72 C_MatrixXd* MatrixXd_new(int rows, int cols) argument
74 return eigen_to_c(*new MatrixXd(rows,cols));
92 void MatrixXd_resize(C_MatrixXd *m, int rows, int cols) argument
94 c_to_eigen(m).resize(rows,cols);
137 C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols) argument
139 return eigen_to_c(*new Map<MatrixXd>(array,rows,cols));
/external/eigen/test/
H A Darray.cpp20 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,col
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...]
H A Darray_for_matrix.cpp20 Index rows = m.rows(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols),
25 m3(rows, cols);
27 ColVectorType cv1 = ColVectorType::Random(rows);
35 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1);
36 VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,s2) );
63 VERIFY_IS_APPROX(m1.block(0,0,rows,0).rowwise().prod(), ColVectorType::Ones(rows));
81 Index rows = m.rows(); local
149 Index rows = m.rows(); local
[all...]
H A Dbasicstuff.cpp21 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols),
29 mzero = MatrixType::Zero(rows, cols),
30 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);
31 VectorType v1 = VectorType::Random(rows),
32 vzero = VectorType::Zero(rows);
139 Index rows = m.rows(); local
[all...]
H A Dblock.cpp23 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
28 m2 = MatrixType::Random(rows, cols),
29 m3(rows, cols),
30 ones = MatrixType::Ones(rows, cols);
31 VectorType v1 = VectorType::Random(rows);
35 Index r1 = internal::random<Index>(0,rows-1);
36 Index r2 = internal::random<Index>(r1,rows-1);
59 VectorType bc1(m1.block(0,c1,rows,
154 Index rows = m.rows(); local
188 Index rows = m.rows(); local
[all...]
H A Dcholesky.cpp44 VectorType vec = VectorType::Random(symm.rows());
67 Index rows = m.rows(); local
75 MatrixType a0 = MatrixType::Random(rows,cols);
76 VectorType vecB = VectorType::Random(rows), vecX(rows);
77 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
82 MatrixType a1 = MatrixType::Random(rows,cols);
171 MatrixType m1 = MatrixType::Random(rows,col
199 Index rows = m.rows(); local
[all...]
H A Dhouseholder.cpp21 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...]
H A Dnomalloc.cpp35 Index rows = m.rows(); local
38 MatrixType m1 = MatrixType::Random(rows, cols),
39 m2 = MatrixType::Random(rows, cols),
40 m3(rows, cols);
44 Index r = internal::random<Index>(0, rows-1),
49 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), (m1.array()*m1.array()).matrix());
H A Dproduct.h35 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, row
[all...]
H A Dproduct_extra.cpp22 Index rows = m.rows(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols),
28 mzero = MatrixType::Zero(rows, cols),
29 identity = MatrixType::Identity(rows, rows),
30 square = MatrixType::Random(rows, rows),
[all...]
H A Dproduct_notemporary.cpp41 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);
H A Dsparse_basic.cpp17 const Index rows = ref.rows(); local
22 double density = (std::max)(8./(rows*cols), 0.01);
27 SparseMatrixType m(rows, cols);
28 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
29 DenseVector vec1 = DenseVector::Random(rows);
57 int i = internal::random<int>(0,rows-1);
59 int h = internal::random<int>(1,rows-i-1);
86 for(int r=0; r<rows; r++)
95 DenseMatrix m1(rows,col
[all...]
H A Dsparse_product.cpp25 int r = internal::random(0,m2.rows()-1);
40 const Index rows = internal::random<int>(1,n); local
46 double density = (std::max)(8./(rows*cols), 0.01);
55 DenseMatrix refMat2 = DenseMatrix::Zero(rows, depth);
56 DenseMatrix refMat2t = DenseMatrix::Zero(depth, rows);
59 DenseMatrix refMat4 = DenseMatrix::Zero(rows, cols);
60 DenseMatrix refMat4t = DenseMatrix::Zero(cols, rows);
62 DenseMatrix refMat6 = DenseMatrix::Random(rows, rows);
63 DenseMatrix dm4 = DenseMatrix::Zero(rows, row
[all...]
/external/eigen/test/eigen2/
H A Deigen2_sparse_basic.cpp48 const int rows = ref.rows(); local
53 double density = std::max(8./(rows*cols), 0.01);
58 SparseMatrixType m(rows, cols);
59 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
60 DenseVector vec1 = DenseVector::Random(rows);
88 int i = ei_random<int>(0,rows-1);
90 int h = ei_random<int>(1,rows-i-1);
117 for(int r=0; r<rows; r++)
167 DenseMatrix m1(rows,col
[all...]
H A Deigen2_submatrices.cpp21 int rows = m1.rows(); local
25 VERIFY_IS_APPROX(mi, m1.block(1,1,rows-1,cols-1));
48 int rows = m.rows(); local
51 MatrixType m1 = MatrixType::Random(rows, cols),
52 m2 = MatrixType::Random(rows, cols),
53 m3(rows, cols),
54 mzero = MatrixType::Zero(rows, cols),
55 ones = MatrixType::Ones(rows, col
[all...]
H A Dproduct.h36 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/unsupported/Eigen/src/Skyline/
H A DSkylineMatrixBase.h35 /**< The number of rows at compile-time. This is just a copy of the value provided
38 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
44 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
50 * rows times the number of columns, or to \a Dynamic if this is not
60 /**< This is set to true if either the number of rows or the number of
104 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
105 inline Index rows() const { function in class:Eigen::SkylineMatrixBase
106 return derived().rows();
109 /** \returns the number of columns. \sa rows(), ColsAtCompileTime*/
114 /** \returns the number of coefficients, which is \a rows()*col
[all...]
/external/opencv/cxcore/src/
H A Dcximage.cpp88 CV_CALL( img = cvCreateImageHeader( cvSize(m->cols,m->rows),
215 CvMatrix::CvMatrix( int rows, int cols, int type, CvMemStorage* storage, bool alloc_data ) argument
220 cvInitMatHeader( matrix, rows, cols, type, alloc_data ?
221 cvMemStorageAlloc( storage, rows*cols*CV_ELEM_SIZE(type) ) : 0 );
242 CV_CALL( m = cvCreateMat( src->rows, src->cols, src->type ));
275 CV_CALL( temp_mat = cvCreateMat( m->rows, m->cols,
/external/webkit/Source/WebCore/html/
H A DHTMLTextAreaElement.h39 int rows() const { return m_rows; } function in class:WebCore::HTMLTextAreaElement
/external/chromium/chrome/browser/geolocation/
H A Dgeolocation_exceptions_table_model.cc78 const Rows& rows) const {
79 for (Rows::const_iterator i(rows.begin()); i != rows.end(); ++i) {
85 if (!rows.count(j))
90 return !rows.empty();
93 void GeolocationExceptionsTableModel::RemoveRows(const Rows& rows) { argument
94 for (Rows::const_reverse_iterator i(rows.rbegin()); i != rows.rend(); ++i) {
120 if ((row == 0) || rows.count(row - 1))
215 // The rows ar
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/scripts_cvs/searchcvs/www/projectName/
H A Dsearchcvs.php76 $rows = $row[0]; variable
78 $title = "<span>$rows results total</span>Showing results " . ($offset + 1) . "-" . ($offset + $pagesize > $rows ? $rows : $offset + $pagesize) . " for " . ($_GET["q"] == "" ? "last $days days of commits" : "$et" . sanitize($_GET["q"], "text"));
79 $title = ($rows == 0 ? "No results found for " . sanitize($_GET["q"], "text") . "" : $title);
84 dopager($rows, $page, $pagesize);
103 dopager($rows, $page, $pagesize);
146 print $rows;
227 function dopager($rows, $page, $pagesize)
230 $endpage = ($page + 5 > $rows/
[all...]

Completed in 637 milliseconds

1234567891011>>