/external/eigen/test/eigen2/ |
H A D | eigen2_sparse_basic.cpp | 48 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 D | eigen2_submatrices.cpp | 21 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 D | 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/ |
H A D | householder.cpp | 21 Index rows = m.rows(); local 34 Matrix<Scalar, EIGEN_SIZE_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols)); 41 VectorType v1 = VectorType::Random(rows), v2; 46 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(v1.tail(rows-1).norm(), v1.norm()); 47 v1 = VectorType::Random(rows); 52 MatrixType m1(rows, cols), 53 m2(rows, cols); 55 v1 = VectorType::Random(rows); [all...] |
H A D | jacobisvd.cpp | 21 Index rows = m.rows(); local 33 MatrixType sigma = MatrixType::Zero(rows,cols); 49 Index rows = m.rows(); local 51 Index diagSize = (std::min)(rows, cols); 72 Index rows = m.rows(); local 83 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols)); 96 for(int k=0;k<x.rows(); [all...] |
H A D | nomalloc.cpp | 40 Index rows = m.rows(); local 43 MatrixType m1 = MatrixType::Random(rows, cols), 44 m2 = MatrixType::Random(rows, cols), 45 m3(rows, cols); 49 Index r = internal::random<Index>(0, rows-1), 54 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), (m1.array()*m1.array()).matrix());
|
H A D | product_extra.cpp | 21 Index rows = m.rows(); local 24 MatrixType m1 = MatrixType::Random(rows, cols), 25 m2 = MatrixType::Random(rows, cols), 26 m3(rows, cols), 27 mzero = MatrixType::Zero(rows, cols), 28 identity = MatrixType::Identity(rows, rows), 29 square = MatrixType::Random(rows, rows), [all...] |
H A D | 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);
|
H A D | 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/ |
H A D | ConstrainedConjGrad.h | 55 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/eigen/unsupported/Eigen/src/Skyline/ |
H A D | SkylineMatrixBase.h | 35 /**< 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/eigen/unsupported/test/ |
H A D | jacobisvd.cpp | 40 if (QRPreconditioner == NoQRPreconditioner && m.rows() != m.cols()) 55 MatrixType m = pickrandom ? MatrixType::Random(a.rows(), a.cols()) : a; 71 Index rows = m.rows(); local 79 MatrixType a = MatrixType::Zero(rows, cols);
|
H A D | svd_common.h | 30 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/freetype/src/sfnt/ |
H A D | pngshim.c | 198 png_byte* *rows = NULL; /* pacify compiler */ local 210 y_offset + metrics->height > map->rows || 267 map->rows = metrics->height; 272 size = map->rows * map->pitch; 343 if ( FT_NEW_ARRAY( rows, imgHeight ) ) 350 rows[i] = map->buffer + ( y_offset + i ) * map->pitch + x_offset * 4; 352 png_read_image( png, rows ); 354 FT_FREE( rows );
|
/external/libhevc/decoder/x86/ |
H A D | ihevcd_fmt_conv_ssse3_intr.c | 63 WORD32 num_rows, num_cols, src_strd, dst_strd, cols, rows; local 208 rows = num_rows & 0x3; 209 if(rows) 211 for(i = 0; i < rows; i++)
|
/external/mesa3d/src/gallium/winsys/sw/fbdev/ |
H A D | fbdev_sw_winsys.c | 59 unsigned rows; member in struct:fbdev_sw_winsys 94 if (dst->y + dst->height > fbdev->rows) { 96 if (dst->y >= fbdev->rows) 99 height = fbdev->rows - dst->y; 224 fbdev->rows = fbdev->finfo.smem_len / fbdev->finfo.line_length;
|
/external/opencv/cxcore/src/ |
H A D | cximage.cpp | 88 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/pdfium/core/src/fxge/agg/agg23/ |
H A D | agg_rendering_buffer.h | 81 int8u** rows = m_rows; local 83 *rows++ = row_ptr; 129 int8u const* const* rows() const function in class:agg::rendering_buffer
|
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/sfnt/ |
H A D | 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/skia/tools/bug_chomper/res/third_party/ |
H A D | jquery.tablednd.js | 2 * TableDnD plug-in for JQuery, allows you to drag and drop table rows 25 * and the row that was dropped. You can work out the new order of the rows by using 26 * table.rows. 41 * Add class="nodrop" to any rows for which you don't want to allow dropping, and class="nodrag" to any rows 46 * an ID as must all the rows. 86 // Now make the rows draggable 100 /** This function makes all the rows on the table draggable apart from those marked as "NoDrag" */ 102 // Now initialise the rows 103 var rows 298 var rows = jQuery.tableDnD.currentTable.rows; variable [all...] |
/external/smack/src/org/jivesoftware/smackx/ |
H A D | ReportedData.java | 34 * in columns and rows. 41 private List<Row> rows = new ArrayList<Row>(); field in class:ReportedData 77 // Add the rows to the report based on the form's items 91 rows.add(new Row(fieldList)); 108 rows.add(row); 121 * Returns an Iterator for the rows returned from a search. 123 * @return an Iterator for the rows returned from a search. 126 return Collections.unmodifiableList(new ArrayList<Row>(rows)).iterator();
|
/external/ceres-solver/internal/ceres/ |
H A D | incomplete_lq_factorization.cc | 46 const int row_begin = matrix->rows()[row]; 47 const int row_end = matrix->rows()[row + 1]; 69 const int* a_rows = a.rows(); 73 const int* b_rows = b.rows(); 119 int* rows = matrix->mutable_rows(); local 122 int num_nonzeros = rows[matrix->num_rows()]; 126 rows[matrix->num_rows()] = num_nonzeros; 160 rows[matrix->num_rows()] = num_nonzeros; 172 const int* rows = matrix.rows(); local [all...] |
/external/chromium_org/chrome/browser/history/ |
H A D | thumbnail_database_unittest.cc | 89 size_t rows = 0; local 90 EXPECT_TRUE(sql::test::CountTableRows(db, "favicons", &rows)); 91 EXPECT_EQ(0u, rows); 92 EXPECT_TRUE(sql::test::CountTableRows(db, "favicon_bitmaps", &rows)); 93 EXPECT_EQ(0u, rows); 94 EXPECT_TRUE(sql::test::CountTableRows(db, "icon_mapping", &rows)); 95 EXPECT_EQ(0u, rows); 379 // rows from the database.
|
H A D | typed_url_syncable_service.cc | 178 URLRows* rows) { 209 DCHECK(rows); 210 // Delete rows. 211 for (URLRows::const_iterator row = rows->begin(); 212 row != rows->end(); ++row) { 176 OnUrlsDeleted(bool all_history, bool expired, URLRows* rows) argument
|
H A D | typed_url_syncable_service_unittest.cc | 123 URLRows* rows, 216 URLRows* rows, 237 // Create new URL rows, populate the mock backend with its visits, and 245 rows->push_back(MakeTypedUrlRow( 248 SetVisitsForUrl(rows->back().id(), &visit_vectors->back()); 249 changed_urls.push_back(rows->back()); 459 URLRows rows; local 463 rows.push_back(url_rows[i]); 467 typed_url_sync_service_->OnUrlsDeleted(false, false, &rows); 213 InitiateServerState( unsigned int num_typed_urls, unsigned int num_reload_urls, URLRows* rows, std::vector<VisitVector>* visit_vectors, const std::vector<const char*>& urls) argument
|