| /external/eigen/test/eigen2/ |
| 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,cols)
[all...] |
| 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, cols)
[all...] |
| /external/eigen/test/ |
| nomalloc.cpp | 35 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());
|
| product_extra.cpp | 22 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...] |
| sparse_basic.cpp | 17 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,cols)
[all...] |
| sparse_product.cpp | 25 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, rows)
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixExponential.h | 170 m_U(M.rows(),M.cols()),
171 m_V(M.rows(),M.cols()),
172 m_tmp1(M.rows(),M.cols()),
173 m_tmp2(M.rows(),M.cols()),
174 m_Id(MatrixType::Identity(M.rows(), M.cols())),
428 Index rows() const { return m_src.rows(); } function in struct:Eigen::MatrixExponentialReturnValue
448 eigen_assert(rows() == cols());
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineInplaceLU.h | 37 : /*m_matrix(matrix.rows(), matrix.cols()),*/ m_flags(flags), m_status(0), m_lu(matrix) {
121 const size_t rows = m_lu.rows(); local
124 eigen_assert(rows == cols && "We do not (yet) support rectangular LU.");
127 for (Index row = 0; row < rows; row++) {
138 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
157 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
170 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
185 const size_t rows = m_lu.rows(); local
308 const size_t rows = m_lu.rows(); local
[all...] |
| SkylineMatrix.h | 74 inline Index rows() const { function in class:Eigen::SkylineMatrix
456 const Index stop = m_rowStartIndex[rows()];
464 for (Index innerIdx = rows(); innerIdx > outer; innerIdx--) {
486 const Index stop = m_rowStartIndex[rows()];
536 if (rows() > cols())
537 m_data.resize(cols(), cols(), rows(), m_colStartIndex[cols()] + 1, m_rowStartIndex[rows()] + 1);
539 m_data.resize(rows(), cols(), rows(), m_colStartIndex[cols()] + 1, m_rowStartIndex[rows()] + 1)
[all...] |
| 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()*cols()
[all...] |
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| DynamicSparseMatrix.h | 25 * nonzero and outer_size is the number of columns if the matrix is column-major and the number of rows
80 inline Index rows() const { return IsRowMajor ? outerSize() : m_innerSize; } function in class:Eigen::DynamicSparseMatrix
197 void resize(Index rows, Index cols)
199 const Index outerSize = IsRowMajor ? rows : cols;
200 m_innerSize = IsRowMajor ? cols : rows;
208 void resizeAndKeepData(Index rows, Index cols)
210 const Index outerSize = IsRowMajor ? rows : cols;
211 const Index innerSize = IsRowMajor ? cols : rows;
233 EIGEN_DEPRECATED inline DynamicSparseMatrix(Index rows, Index cols)
236 resize(rows, cols)
[all...] |
| /external/mesa3d/src/gallium/winsys/sw/fbdev/ |
| 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/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowAbstractCursor.java | 25 protected Map<Integer, Map<String, Object>> rows = new HashMap<Integer, Map<String, Object>>(); field in class:ShadowAbstractCursor
76 currentRow = rows.get(currentRowNumber);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| cgitb.py | 139 rows = ['<tr><td bgcolor="#d8bbff">%s%s %s</td></tr>' %
147 rows.append('<tr><td bgcolor="#ffccee">%s</td></tr>' % line)
150 rows.append('<tr><td>%s</td></tr>' % grey(line))
168 rows.append('<tr><td>%s</td></tr>' % small(grey(', '.join(dump))))
171 %s</table>''' % '\n'.join(rows))
223 rows = [' %s %s' % (file, call)] variable
228 rows.append(num+line.rstrip())
242 rows.append('\n'.join(dump))
243 frames.append('\n%s\n' % '\n'.join(rows))
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| cgitb.py | 139 rows = ['<tr><td bgcolor="#d8bbff">%s%s %s</td></tr>' %
147 rows.append('<tr><td bgcolor="#ffccee">%s</td></tr>' % line)
150 rows.append('<tr><td>%s</td></tr>' % grey(line))
168 rows.append('<tr><td>%s</td></tr>' % small(grey(', '.join(dump))))
171 %s</table>''' % '\n'.join(rows))
223 rows = [' %s %s' % (file, call)] variable
228 rows.append(num+line.rstrip())
242 rows.append('\n'.join(dump))
243 frames.append('\n%s\n' % '\n'.join(rows))
|
| /cts/tests/tests/content/src/android/content/cts/ |
| ContentQueryMapTest.java | 112 Map<String, ContentValues> rows = mContentQueryMap.getRows(); local
113 assertEquals(ORIGINAL_ROW_COUNT, rows.size());
114 assertTrue(rows.containsKey(NAME0));
115 assertEquals(VALUE0, rows.get(NAME0).getAsString(DummyProvider.VALUE));
116 assertTrue(rows.containsKey(NAME1));
117 assertEquals(VALUE1, rows.get(NAME1).getAsString(DummyProvider.VALUE));
122 rows = mContentQueryMap.getRows();
123 assertFalse(rows.containsKey(NAME0));
125 rows = mContentQueryMap.getRows();
126 assertFalse(rows.containsKey(NAME0))
[all...] |
| /development/samples/training/threadsample/src/com/example/android/threadsample/ |
| DataProvider.java | 94 * URIs and an integer code. These are custom MIME types that apply to tables and rows
237 * @param sortOrder A clause defining the order in which the retrieved rows should be sorted
238 * @return The query results, as a {@link android.database.Cursor} of rows and columns
349 * @return The number of rows inserted.
369 // Deletes all the existing rows in the table
396 // The semantics of bulkInsert is to return the number of rows inserted.
424 * @return the number of rows deleted
433 * Updates one or more rows in a table.
436 * @param values The values to use to update the row or rows. You only need to specify column
439 * @param selection An SQL WHERE clause (without the WHERE keyword) specifying the rows t
460 int rows = localSQLiteDatabase.update( local
[all...] |
| /external/ceres-solver/internal/ceres/ |
| covariance_test.cc | 107 const int* rows = crsm->rows(); local
109 EXPECT_EQ(rows[r], expected_rows[r])
111 << rows[r] << " "
352 << "rows: " << row_begin << " " << row_end << " "
|
| 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...] |
| solver_impl_test.cc | 871 int* rows = expected_block_sparse_jacobian.mutable_rows(); local
874 rows[0] = 0;
877 rows[1] = 2;
879 rows[2] = 0;
882 rows[3] = 2;
884 rows[4] = 1;
887 rows[5] = 2;
889 rows[6] = 1;
892 rows[7] = 0;
894 rows[8] = 2
968 int* rows = expected_block_sparse_jacobian.mutable_rows(); local
[all...] |
| /external/chromium/chrome/browser/importer/ |
| mork_reader.cc | 143 // Rows will have value arrays of the same size, with indexes that
461 // Columns for entry (non-meta) history rows
498 std::vector<history::URLRow>* rows) {
540 rows->push_back(row);
579 std::vector<history::URLRow> rows; local
581 AddToHistory(i->second, data, &rows);
582 if (!rows.empty())
583 bridge->SetHistoryItems(rows, history::SOURCE_FIREFOX_IMPORTED);
|
| /external/chromium_org/ash/wm/overview/ |
| window_overview.cc | 387 size_t rows = ((windows.size() + columns - 1) / columns); local
390 static_cast<int>(total_bounds.height() * kCardAspectRatio / rows)));
398 rows * window_size.height()) / 2;
|
| /external/chromium_org/chrome/browser/history/ |
| 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);
367 // rows from the database.
[all...] |
| typed_url_syncable_service_unittest.cc | 153 URLRows* rows,
247 URLRows* rows,
270 // Create new URL rows, populate the mock backend with its visits, and
278 rows->push_back(MakeTypedUrlRow(
281 SetVisitsForUrl(rows->back().id(), &visit_vectors->back());
282 changed_urls.push_back(rows->back());
502 URLRows rows; local
506 rows.push_back(url_rows[i]);
510 typed_url_sync_service_->OnUrlsDeleted(false, false, &rows);
|
| /external/chromium_org/chrome/browser/predictors/ |
| autocomplete_action_predictor.cc | 233 DeleteRowsWithURLs(urls_deleted_details->rows);
266 // rows from the caches and the database once the history service is
268 std::vector<AutocompleteActionPredictorTable::Row>* rows = local
272 base::Bind(&AutocompleteActionPredictorTable::GetAllRows, table_, rows),
274 base::Owned(rows)));
295 const history::URLRows& rows) {
302 if (std::find_if(rows.begin(), rows.end(),
303 history::URLRow::URLRowHasURL(it->first.url)) != rows.end()) {
396 const AutocompleteActionPredictorTable::Rows& rows_to_add
[all...] |
