| /external/eigen/test/ |
| cholesky.cpp | 44 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,cols), m2(rows,cols)
199 Index rows = m.rows(); local
[all...] |
| /frameworks/base/core/java/android/database/sqlite/ |
| SQLiteQuery.java | 25 * Represents a query that reads the resulting rows into a {@link SQLiteQuery}.
43 * Reads rows into a buffer.
49 * @param countAllRows True to count all rows that the query would
51 * @return Number of rows that were enumerated. Might not be all rows
|
| /external/eigen/Eigen/src/QR/ |
| FullPivHouseholderQR.h | 93 FullPivHouseholderQR(Index rows, Index cols)
94 : m_qr(rows, cols),
95 m_hCoeffs((std::min)(rows,cols)),
96 m_rows_transpositions(rows),
99 m_temp((std::min)(rows,cols)),
104 : m_qr(matrix.rows(), matrix.cols()),
105 m_hCoeffs((std::min)(matrix.rows(), matrix.cols())),
106 m_rows_transpositions(matrix.rows()),
109 m_temp((std::min)(matrix.rows(), matrix.cols())),
247 return rank() == rows();
275 inline Index rows() const { return m_qr.rows(); } function in class:Eigen::FullPivHouseholderQR
381 Index rows = matrix.rows(); local
468 const Index rows = dec().rows(), cols = dec().cols(); local
539 const Index rows = m_qr.rows(); local
550 const Index rows = m_qr.rows(); local
563 Index rows() const { return m_qr.rows(); } function in struct:Eigen::internal::FullPivHouseholderQRMatrixQReturnType
[all...] |
| /external/doclava/res/assets/templates/ |
| diff.cs | 71 if (tr.rowIndex + 1 < table.rows.length) {
72 var tbody = table.rows[tr.rowIndex + 1].parentNode;
79 if (tr.rowIndex + 1 < table.rows.length
80 && $(table.rows[tr.rowIndex + 1]).hasClass("class-entry")) {
81 var tbody = table.rows[tr.rowIndex + 1].parentNode;
99 while (i < table.rows.length && $(table.rows[i]).hasClass("method-entry")) {
100 $(table.rows[i++]).show();
107 while (i < table.rows.length && $(table.rows[i]).hasClass("method-entry"))
[all...] |
| /external/eigen/bench/ |
| sparse_dense_product.cpp | 54 int rows = SIZE; local
58 EigenSparseMatrix sm1(rows,cols);
65 //fillMatrix(density, rows, cols, sm1);
66 fillMatrix2(7, rows, cols, sm1);
72 DenseMatrix m1(rows,cols);
93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
106 // std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/float(m1.rows()*m1.cols())*100 << "%\n";
119 //GmmDynSparse gmmT3(rows,cols);
120 GmmSparse m1(rows,cols);
138 UBlasSparse m1(rows,cols)
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_eigensolver.cpp | 22 int rows = m.rows(); local
33 MatrixType a = MatrixType::Random(rows,cols);
34 MatrixType a1 = MatrixType::Random(rows,cols);
37 MatrixType b = MatrixType::Random(rows,cols);
38 MatrixType b1 = MatrixType::Random(rows,cols);
56 gEval = GslTraits<RealScalar>::createVector(rows);
105 int rows = m.rows(); local
116 MatrixType a = MatrixType::Random(rows,cols)
[all...] |
| /external/chromium_org/media/base/ |
| video_util.h | 25 // NOTE: rows is *not* the same as height!
26 MEDIA_EXPORT void CopyYPlane(const uint8* source, int stride, int rows,
28 MEDIA_EXPORT void CopyUPlane(const uint8* source, int stride, int rows,
30 MEDIA_EXPORT void CopyVPlane(const uint8* source, int stride, int rows,
32 MEDIA_EXPORT void CopyAPlane(const uint8* source, int stride, int rows,
36 MEDIA_EXPORT void MakeOpaqueAPlane(int stride, int rows, VideoFrame* frame);
41 int rows, VideoFrame* frame);
|
| /external/libvpx/libvpx/examples/ |
| vp8_set_maps.txt | 35 roi.rows = cfg.g_h/16;
54 roi.roi_map = malloc(roi.rows * roi.cols);
55 for(i=0;i<roi.rows*roi.cols;i++)
66 active.rows = cfg.g_h/16;
70 active.active_map = malloc(active.rows * active.cols);
71 for(i=0;i<active.rows*active.cols;i++)
81 active.rows = cfg.g_h/16;
|
| /external/libvpx/libvpx/vp8/common/ |
| debugmodes.c | 16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame)
28 for (mb_row = 0; mb_row < rows; mb_row++)
47 for (mb_row = 0; mb_row < rows; mb_row++)
67 for (mb_row = 0; mb_row < rows; mb_row++)
89 for (b_row = 0; b_row < 4 * rows; b_row++)
115 for (mb_row = 0; mb_row < rows; mb_row++)
137 for (b_row = 0; b_row < 4 * rows; b_row++)
|
| /external/chromium/chrome/browser/geolocation/ |
| geolocation_exceptions_table_model.cc | 78 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) {
94 for (Rows::const_reverse_iterator i(rows.rbegin()); i != rows.rend(); ++i)
[all...] |
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 79 if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols())
81 m_qr = FullPivHouseholderQR<MatrixType>(svd.rows(), svd.cols());
83 if (svd.m_computeFullU) m_workspace.resize(svd.rows());
88 if(matrix.rows() > matrix.cols())
122 if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols())
124 m_qr = FullPivHouseholderQR<TransposeTypeWithSameStorageOrder>(svd.cols(), svd.rows());
126 m_adjoint.resize(svd.cols(), svd.rows());
132 if(matrix.cols() > matrix.rows())
652 inline Index rows() const { return m_rows; } function in class:Eigen::JacobiSVD
[all...] |
| /external/eigen/Eigen/src/Core/ |
| CwiseNullaryOp.h | 57 CwiseNullaryOp(Index rows, Index cols, const NullaryOp& func = NullaryOp())
58 : m_rows(rows), m_cols(cols), m_functor(func)
60 eigen_assert(rows >= 0
61 && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows)
66 EIGEN_STRONG_INLINE Index rows() const { return m_rows.value(); } function in class:Eigen::CwiseNullaryOp
69 EIGEN_STRONG_INLINE const Scalar coeff(Index rows, Index cols) const
71 return m_functor(rows, cols);
103 * The parameters \a rows and \a cols are the number of rows and of columns of
107 * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be use
[all...] |
| CommaInitializer.h | 41 : m_xpr(xpr), m_row(0), m_col(other.cols()), m_currentBlockRows(other.rows())
43 m_xpr.block(0, 0, other.rows(), other.cols()) = other;
54 eigen_assert(m_row<m_xpr.rows()
55 && "Too many rows passed to comma initializer (operator<<)");
72 m_currentBlockRows = other.rows();
73 eigen_assert(m_row+m_currentBlockRows<=m_xpr.rows()
74 && "Too many rows passed to comma initializer (operator<<)");
78 eigen_assert(m_currentBlockRows==other.rows());
84 m_xpr.block(m_row, m_col, other.rows(), other.cols()) = other;
91 eigen_assert((m_row+m_currentBlockRows) == m_xpr.rows()
[all...] |
| Random.h | 31 * The parameters \a rows and \a cols are the number of rows and of columns of
35 * it is redundant to pass \a rows and \a cols as arguments, so Random() should be used
49 DenseBase<Derived>::Random(Index rows, Index cols)
51 return NullaryExpr(rows, cols, internal::scalar_random_op<Scalar>());
112 return *this = Random(rows(), cols());
134 * \param rows the new number of rows
144 PlainObjectBase<Derived>::setRandom(Index rows, Index cols)
146 resize(rows, cols)
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrixBase.h | 51 /**< The number of rows at compile-time. This is just a copy of the value provided
54 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
60 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
66 * rows times the number of columns, or to \a Dynamic if this is not
76 /**< This is set to true if either the number of rows or the number of
146 /** \returns the number of rows. \sa cols() */
147 inline Index rows() const { return derived().rows(); } function in class:Eigen::SparseMatrixBase
148 /** \returns the number of columns. \sa rows() */
150 /** \returns the number of coefficients, which is \a rows()*cols()
[all...] |
| SparseSparseProductWithPruning.h | 28 Index rows = lhs.innerSize(); local
34 AmbiVector<Scalar,Index> tempVector(rows);
46 res.resize(cols, rows);
48 res.resize(rows, cols);
51 double ratioColRes = double(estimated_nnz_prod)/double(lhs.rows()*rhs.cols());
55 //double ratioColRes = (double(rhs.innerVector(j).nonZeros()) + double(lhs.nonZeros())/double(lhs.cols()))/double(lhs.rows());
90 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
104 SparseTemporaryType _res(res.rows(), res.cols());
117 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
136 // SparseTemporaryType _res(res.cols(), res.rows());
[all...] |
| /external/ceres-solver/internal/ceres/ |
| triplet_sparse_matrix_test.cc | 78 EXPECT_EQ(m.rows()[0], 0);
79 EXPECT_EQ(m.rows()[1], 1);
119 EXPECT_EQ(cpy.rows()[0], 0);
120 EXPECT_EQ(cpy.rows()[1], 1);
165 EXPECT_EQ(cpy.rows()[0], 0);
166 EXPECT_EQ(cpy.rows()[1], 1);
215 EXPECT_EQ(m.rows()[0], 0);
216 EXPECT_EQ(m.rows()[1], 1);
217 EXPECT_EQ(m.rows()[2], 2);
218 EXPECT_EQ(m.rows()[3], 3)
[all...] |
| dense_qr_solver.cc | 88 // rhs = [b;0] to account for the additional rows in the lhs.
89 if (rhs_.rows() != lhs_.rows()) {
90 rhs_.resize(lhs_.rows());
95 if (work_.rows() == 1) {
97 LAPACK::EstimateWorkSizeForQR(lhs_.rows(), lhs_.cols());
103 const int info = LAPACK::SolveUsingQR(lhs_.rows(),
106 work_.rows(),
140 // rhs = [b;0] to account for the additional rows in the lhs.
143 if (rhs_.rows() != augmented_num_rows)
[all...] |
| /external/opencv/cv/src/ |
| cvkdtree.cpp | 91 assert(results->rows == d->rows);
92 assert(results->rows == dist->rows);
96 for (int j = 0; j < d->rows; ++j) {
120 int rn = results->rows * results->cols;
141 std::vector<int> tmp(mat->rows);
174 assert(bounds_min->rows * bounds_min->cols == dims());
175 assert(bounds_max->rows * bounds_max->cols == dims());
218 if (results->rows != desc->rows && results->cols != k
[all...] |
| /external/valgrind/main/drd/tests/ |
| omp_matinv.c | 41 /** Allocate memory for a matrix with the specified number of rows and
44 static elem_t* new_matrix(const int rows, const int cols)
46 assert(rows > 0);
48 return malloc(rows * cols * sizeof(elem_t));
58 static void init_matrix(elem_t* const a, const int rows, const int cols)
61 for (i = 0; i < rows; i++)
63 for (j = 0; j < rows; j++)
72 const elem_t* const a, const int rows, const int cols)
76 for (i = 0; i < rows; i++)
154 * has at least as many columns as rows, the result of this algorithm is tha
[all...] |
| /packages/apps/Launcher3/ |
| print_db.py | 13 ROWS = 4
54 rows = []
56 rows.append(row)
57 return columns,rows
63 rows = []
65 rows.append(row)
66 return columns,rows
150 global SCREENS, COLUMNS, ROWS, HOTSEAT_SIZE
153 columns,rows = get_favorites(conn)
156 data = [dict(zip(columns,row)) for row in rows]
[all...] |
| /external/chromium_org/chrome/browser/predictors/ |
| autocomplete_action_predictor_table_unittest.cc | 52 AutocompleteActionPredictorTable::Rows test_db_;
114 test_db_, AutocompleteActionPredictorTable::Rows());
131 AutocompleteActionPredictorTable::Rows(1, test_db_[0]),
132 AutocompleteActionPredictorTable::Rows());
143 AutocompleteActionPredictorTable::Rows rows_to_add;
148 AutocompleteActionPredictorTable::Rows());
154 AutocompleteActionPredictorTable::Rows(1, test_db_[2]),
155 AutocompleteActionPredictorTable::Rows(1, row1));
168 AutocompleteActionPredictorTable::Rows rows_to_update;
172 AutocompleteActionPredictorTable::Rows(),
[all...] |
| /external/chromium_org/chrome/browser/resources/ |
| about_stats.js | 136 // The function sorts rows after the row with onclick event handler.
149 var rows = new Array();
153 for (var i = startIndex; i < table.rows.length; i++)
154 rows.push(table.rows[i]);
186 rows.sort(sortFunc);
190 for (var i = rows.length - 1; i >= 0; i--)
191 tbody.appendChild(rows[i]);
194 for (var i = 0; i < rows.length; i++)
195 tbody.appendChild(rows[i])
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/rtree/ |
| rtree6.test | 77 0 0 0 {SCAN TABLE t1 VIRTUAL TABLE INDEX 2:Ca (~0 rows)}
78 0 1 1 {SEARCH TABLE t2 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
84 0 0 0 {SCAN TABLE t1 VIRTUAL TABLE INDEX 2:Ca (~0 rows)}
85 0 1 1 {SEARCH TABLE t2 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
91 0 0 0 {SCAN TABLE t1 VIRTUAL TABLE INDEX 2: (~0 rows)}
92 0 1 1 {SEARCH TABLE t2 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
98 0 0 0 {SCAN TABLE t1 VIRTUAL TABLE INDEX 2:CaEb (~0 rows)}
99 0 1 1 {SCAN TABLE t2 (~100000 rows)}
105 0 0 0 {SCAN TABLE t1 VIRTUAL TABLE INDEX 2: (~0 rows)}
106 0 1 1 {SEARCH TABLE t2 USING INTEGER PRIMARY KEY (rowid=?) (~1 rows)}
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| Block.h | 20 * \param cRows the number of rows in the corner
45 return Block<Derived>(derived(), rows() - cRows, 0, cRows, cCols);
47 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
65 return Block<Derived>(derived(), rows() - cRows, 0, cRows, cCols);
67 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
76 * The template parameters CRows and CCols arethe number of rows and columns in the corner.
97 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, 0);
99 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
118 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, 0);
120 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols)
[all...] |
