| /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/eigen/bench/ |
| 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/ceres-solver/internal/ceres/ |
| partitioned_matrix_view.cc | 63 for (int r = 0; r < bs->rows.size(); ++r) {
64 const vector<Cell>& cells = bs->rows[r].cells;
101 const Cell& cell = bs->rows[r].cells[0];
102 const int row_block_pos = bs->rows[r].block.position;
103 const int row_block_size = bs->rows[r].block.size;
123 for (int r = 0; r < bs->rows.size(); ++r) {
124 const int row_block_pos = bs->rows[r].block.position;
125 const int row_block_size = bs->rows[r].block.size;
126 const vector<Cell>& cells = bs->rows[r].cells;
146 const Cell& cell = bs->rows[r].cells[0]
[all...] |
| 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...] |
| compressed_row_sparse_matrix_test.cc | 164 EXPECT_EQ(crsm->num_rows() + 1, crs_matrix.rows.size());
169 EXPECT_EQ(crsm->rows()[i], crs_matrix.rows[i]);
224 int* rows = matrix_->mutable_rows(); local
228 rows[0] = 0;
232 rows[1] = 1;
236 rows[2] = 2;
242 rows[3] = 4;
250 rows[4] = 7;
283 int* rows = matrix.mutable_rows() local
[all...] |
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 79 FullPivLU(Index rows, Index cols);
198 * b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition.
339 return rank() == rows();
351 return isInjective() && (m_lu.rows() == m_lu.cols());
364 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
366 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
371 inline Index rows() const { return m_lu.rows(); } function in class:Eigen::FullPivLU
392 FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols
423 const Index rows = matrix.rows(); local
675 const Index rows = dec().rows(), cols = dec().cols(), local
[all...] |
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| 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...] |
| /external/chromium_org/content/test/data/ |
| simple_database.html | 62 sendValueToTest("multiple rows with index: " + index);
99 for (var i = 0; i < result.rows.length; i++) {
102 items += result.rows.item(i).data;
118 // rows from the database by index. E.g., LIMIT 2,10 will give us 10 records
124 if (result.rows.length >= 1)
125 callback(result.rows.item(0).id);
|
| /external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
| AccessibilityARIAGridRow.cpp | 63 // The contiguous disclosed rows will be the rows in the table that
69 // Search for rows that match the correct level.
70 // Only take the subsequent rows from this one that are +1 from this row's level.
76 AccessibilityChildrenVector& allRows = static_cast<AccessibilityTable*>(parent)->rows();
103 AccessibilityChildrenVector& allRows = static_cast<AccessibilityTable*>(parent)->rows();
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLTableSectionElement.cpp | 62 RefPtr<HTMLCollection> children = rows();
84 RefPtr<HTMLCollection> children = rows();
98 int rows = 0; local
102 rows++;
106 return rows;
149 PassRefPtr<HTMLCollection> HTMLTableSectionElement::rows() function in class:WebCore::HTMLTableSectionElement
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_linear.c | 51 ptr = (char*)src_ptr + src_stride * t->rows * y + bytes * x;
52 for (z = 0; z < t->rows; z++) {
73 ptr = (char*)dst_ptr + dst_stride * t->rows * y + bytes * x;
74 for (z = 0; z < t->rows; z++) {
94 t->rows = t->tile.height / t->block.height;
95 t->tile.size = t->cols * t->rows * t->block.size;
|
| /external/eigen/demos/mix_eigen_and_c/ |
| binary_library.cpp | 72 C_MatrixXd* MatrixXd_new(int rows, int cols)
74 return eigen_to_c(*new MatrixXd(rows,cols));
92 void MatrixXd_resize(C_MatrixXd *m, int rows, int cols)
94 c_to_eigen(m).resize(rows,cols);
137 C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols)
139 return eigen_to_c(*new Map<MatrixXd>(array,rows,cols));
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_linear.c | 51 ptr = (char*)src_ptr + src_stride * t->rows * y + bytes * x;
52 for (z = 0; z < t->rows; z++) {
73 ptr = (char*)dst_ptr + dst_stride * t->rows * y + bytes * x;
74 for (z = 0; z < t->rows; z++) {
94 t->rows = t->tile.height / t->block.height;
95 t->tile.size = t->cols * t->rows * t->block.size;
|
| /frameworks/base/core/java/android/database/sqlite/ |
| SQLiteStatement.java | 23 * cannot return multiple rows or columns, but single value (1 x 1) result sets
54 * Execute this SQL statement, if the the number of rows affected by execution of this SQL
57 * @return the number of rows affected by this SQL statement execution.
102 * @throws android.database.sqlite.SQLiteDoneException if the query returns zero rows
123 * @throws android.database.sqlite.SQLiteDoneException if the query returns zero rows
144 * @throws android.database.sqlite.SQLiteDoneException if the query returns zero rows
|
| /cts/tools/signature-tools/templates/ |
| ApiOverviewPage.st | 36 $Table(name="Removed Packages", rows=removed_packages:{$it.from:ModelElementRow()$})$
42 $Table(name="Added Packages", rows=added_packages:{$it.to:PackageAddedLink()$}:SimpleTableRow())$
47 $Table(name="Changed Packages", rows=changed_packages:{$it.to:PackageChangedLink()$}:SimpleTableRow())$
|
| /external/chromium/chrome/browser/ui/cocoa/ |
| table_model_array_controller.h | 24 // objects as group rows.
27 // Clicking on a group row selects all rows belonging to that group, like it
29 // In order to show group rows, this class must be the delegate of the
|
| /external/chromium_org/chrome/browser/resources/net_internals/ |
| logs_view.js | 34 this.rows = [];
106 logDiv.id = 'logs-view.log-cell.' + this.rows.length;
129 this.rows.push(row);
174 for (var row in this.rows) {
175 if (isShowAll != this.rows[row].logVisible) {
176 this.onButtonClicked_(this.rows[row]);
191 for (var row in this.rows) {
192 if (this.rows[row].logVisible) {
193 visibleLogRows.push(this.rows[row]);
195 hiddenLogRows.push(this.rows[row])
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/filters/custom/ |
| CustomFilterMesh.h | 44 static PassRefPtr<CustomFilterMesh> create(GraphicsContext3D* context, unsigned cols, unsigned rows, const FloatRect& meshBox, CustomFilterMeshType meshType)
46 return adoptRef(new CustomFilterMesh(context, cols, rows, meshBox, meshType));
60 CustomFilterMesh(GraphicsContext3D*, unsigned cols, unsigned rows, const FloatRect& meshBox, CustomFilterMeshType);
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| tkt-78e04e52ea.test | 47 } {0 0 0 {SCAN TABLE (~500000 rows)}}
60 } {0 0 0 {SEARCH TABLE t2 USING COVERING INDEX (x=?) (~10 rows)}}
66 } {0 0 0 {SCAN TABLE t2 (~100000 rows)}}
|
| tkt3442.test | 52 } {0 0 0 {SEARCH TABLE listhash USING INDEX ididx (id=?) (~1 rows)}}
55 } {0 0 0 {SEARCH TABLE listhash USING INDEX ididx (id=?) (~1 rows)}}
64 } {0 0 0 {SEARCH TABLE listhash USING INDEX ididx (id=?) (~1 rows)}}
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseRedux.h | 19 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
31 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
39 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| ConstrainedConjGrad.h | 59 Index rows = C.rows(), cols = C.cols(); local
61 TmpVec d(rows), e(rows), l(cols), p(rows), q(rows), r(rows);
66 for (Index i = 0; i < rows; ++i)
119 std::vector<bool> satured(C.rows());
124 SparseMatrix<Scalar,RowMajor> CINV(C.rows(), C.cols())
[all...] |
| /external/chromium/chrome/browser/ |
| plugin_exceptions_table_model.cc | 29 bool PluginExceptionsTableModel::CanRemoveRows(const Rows& rows) const {
30 return !rows.empty();
33 void PluginExceptionsTableModel::RemoveRows(const Rows& rows) {
36 // Iterate over the rows starting with the highest ones so we can delete
38 for (Rows::const_reverse_iterator it = rows.rbegin();
39 it != rows.rend(); ++it) {
|
| /external/chromium_org/chrome/browser/history/android/ |
| sql_handler.h | 32 // be invoked. The Delete() method is called to delete rows.
45 // Updates the rows whose URLID or URL is in the given |ids_set| with new
55 // Deletes the rows whose id is in |ids_set|, returns false if any deletion
56 // failed, otherwise return true even all/some of rows are not found.
|
| /external/chromium_org/chrome/browser/predictors/ |
| autocomplete_action_predictor_table.h | 62 typedef std::vector<Row> Rows;
66 void GetAllRows(Rows* row_buffer);
69 void AddAndUpdateRows(const Rows& rows_to_add, const Rows& rows_to_update);
|
