| /external/eigen/test/ |
| nullary.cpp | 20 for (Index i = 0; i < A.rows(); ++i) {
25 for (Index i = 0; i < A.rows(); ++i) {
100 const Index rows = m.rows(); local
104 A.setIdentity(rows, cols);
106 VERIFY(equalsIdentity(MatrixType::Identity(rows, cols)));
|
| product_symm.cpp | 23 Index rows = size; local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols), m3;
32 Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows);
|
| product_syrk.cpp | 21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols);
28 Rhs2 rhs2 = Rhs2::Random(rows, internal::random<int>(1,320));
29 Rhs3 rhs3 = Rhs3::Random(internal::random<int>(1,320), rows);
|
| redux.cpp | 18 Index rows = m.rows(); local
21 MatrixType m1 = MatrixType::Random(rows, cols);
25 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + Scalar(0.2) * m1;
27 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows, cols).sum(), Scalar(1));
28 VERIFY_IS_APPROX(MatrixType::Ones(rows, cols).sum(), Scalar(float(rows*cols))); // the float() here to shut up excessive MSVC warning about int->complex conversion being lossy
31 for(int i = 0; i < rows; i++)
38 const Scalar mean = s/Scalar(RealScalar(rows*cols));
47 Index r0 = internal::random<Index>(0,rows-1)
[all...] |
| sparse_permutations.cpp | 16 const Index rows = ref.rows(); local
24 double density = (std::max)(8./(rows*cols), 0.01);
26 SparseMatrixType mat(rows, cols), up(rows,cols), lo(rows,cols);
28 DenseMatrix mat_d = DenseMatrix::Zero(rows, cols), up_sym_d, lo_sym_d, res_d;
|
| stable_norm.cpp | 53 Index rows = m.rows(); local
59 MatrixType vzero = MatrixType::Zero(rows, cols),
60 vrand = MatrixType::Random(rows, cols),
61 vbig(rows, cols),
62 vsmall(rows,cols);
|
| /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/eigen/unsupported/Eigen/src/SparseExtra/ |
| BlockOfDynamicSparseMatrix.h | 101 EIGEN_STRONG_INLINE Index rows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); } function in class:Eigen::SparseInnerVectorSet
|
| /external/eigen/unsupported/test/ |
| matrix_exponential.cpp | 110 typename MatrixType::Index rows = m.rows(); local
112 MatrixType m1(rows, cols), m2(rows, cols), m3(rows, cols),
113 identity = MatrixType::Identity(rows, rows);
118 m1 = MatrixType::Random(rows, cols);
|
| /external/javasqlite/src/main/java/SQLite/ |
| TableResult.java | 39 * Number of rows in the result set.
57 * Rows of the result set. Each row is stored as a String array.
60 public Vector rows; field in class:TableResult
63 * Maximum number of rows to hold in the table.
69 * Flag to indicate Maximum number of rows condition.
83 * Create an empty result set with maximum number of rows.
98 rows = new Vector();
130 rows.addElement(rowdata);
150 String row[] = (String[]) rows.elementAt(i);
|
| /external/jmonkeyengine/engine/src/test/jme3test/texture/ |
| TestTexture3DLoading.java | 40 int rows = 4;//4 * 4 local
42 q.scaleTextureCoordinates(new Vector2f(rows, rows));
46 material.setInt("Rows", rows);
|
| /external/ceres-solver/internal/ceres/ |
| block_random_access_crs_matrix.cc | 59 // rows/columns.
81 int* rows = crsm_->mutable_rows(); local
92 rows[0] = 0;
109 rows[row_pos + j + 1] = rows[row_pos + j] + num_cols;
118 const int column_block_begin = rows[row_pos + r] + col_pos;
|
| compressed_col_sparse_matrix_utils_test.cc | 91 int* rows,
106 rows[offset] = row_pos + r;
134 int* rows = tsm.mutable_rows(); local
142 rows + offset, cols + offset);
200 rows.resize(7);
204 rows[0] = 0;
208 rows[1] = 1;
212 rows[2] = 1;
214 rows[3] = 2;
218 rows[4] = 0
229 vector<int> rows; member in class:ceres::internal::SolveUpperTriangularTest
[all...] |
| compressed_row_sparse_matrix.h | 62 // as the rows and cols matrices do not match the values of
74 // Build a square sparse diagonal matrix with num_rows rows and
109 const int* rows() const { return &rows_[0]; } function in class:ceres::internal::CompressedRowSparseMatrix
|
| dense_sparse_matrix.cc | 68 const int *rows = m.rows(); local
73 m_(rows[i], cols[i]) += values[i];
112 m_.resize(m_.rows() + m_.cols(), m_.cols());
114 m_.block(0, 0, tmp.rows(), tmp.cols()) = tmp;
131 return m_.rows() - m_.cols();
133 return m_.rows();
142 return (m_.rows() - m_.cols()) * m_.cols();
144 return m_.rows() * m_.cols();
151 ? m_.rows() - m_.cols(
[all...] |
| triplet_sparse_matrix.h | 83 // the same number of rows as num_rows_;
91 const int* rows() const { return rows_.get(); } function in class:ceres::internal::TripletSparseMatrix
|
| /external/chromium/chrome/browser/ |
| plugin_exceptions_table_model_unittest.cc | 165 RemoveRowsTableModel::Rows rows; local
166 rows.insert(1);
167 table_model_->RemoveRows(rows);
179 RemoveRowsTableModel::Rows rows; local
180 rows.insert(0);
181 table_model_->RemoveRows(rows);
197 rows.clear();
198 rows.insert(0)
[all...] |
| /external/chromium_org/chrome/browser/history/ |
| top_sites_database_unittest.cc | 67 size_t rows = 0; local
68 EXPECT_TRUE(sql::test::CountTableRows(db, "thumbnails", &rows));
69 EXPECT_EQ(0u, rows);
|
| url_database_unittest.cc | 263 // We should get 2 rows for |keyword|.
264 std::vector<KeywordSearchTermRow> rows; local
265 ASSERT_TRUE(GetKeywordSearchTermRows(keyword, &rows));
266 ASSERT_EQ(2u, rows.size());
267 if (rows[0].url_id == url_id1) {
268 EXPECT_EQ(keyword, rows[0].term);
269 EXPECT_EQ(keyword, rows[1].term);
270 EXPECT_EQ(url_id2, rows[1].url_id);
272 EXPECT_EQ(keyword, rows[0].term);
273 EXPECT_EQ(url_id1, rows[1].url_id)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLTextAreaElement.h | 40 int rows() const { return m_rows; } function in class:WebCore::FINAL
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
| GridCoordinate.h | 41 // A span in a single direction (either rows or columns). Note that |initialPositionIndex|
117 // This represents a grid area that spans in both rows' and columns' direction.
122 , rows(0, 0)
128 , rows(r)
134 return columns == o.columns && rows == o.rows;
143 GridSpan rows; member in struct:WebCore::GridCoordinate
|
| /external/chromium_org/third_party/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/chromium_org/third_party/openssl/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++)
|
| /external/eigen/Eigen/src/Core/ |
| ArrayWrapper.h | 53 inline Index rows() const { return m_expression.rows(); } function in class:Eigen::ArrayWrapper
166 inline Index rows() const { return m_expression.rows(); } function in class:Eigen::MatrixWrapper
|
| CwiseUnaryOp.h | 70 EIGEN_STRONG_INLINE Index rows() const { return m_xpr.rows(); } function in class:Eigen::CwiseUnaryOp
|
