| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/include/cloog/ |
| matrix.h | 13 * row. NbRows and NbColumns are respectively the number of rows and columns of
25 * would be represented by the following rows:
39 { unsigned NbRows; /* Number of rows. */
41 cloog_int_t ** p; /* Array of pointers to the matrix rows. */
42 cloog_int_t * p_Init; /* Matrix rows contiguously in memory. */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/include/cloog/ |
| matrix.h | 13 * row. NbRows and NbColumns are respectively the number of rows and columns of
25 * would be represented by the following rows:
39 { unsigned NbRows; /* Number of rows. */
41 cloog_int_t ** p; /* Array of pointers to the matrix rows. */
42 cloog_int_t * p_Init; /* Matrix rows contiguously in memory. */
|
| /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/Eigen/src/QR/ |
| FullPivHouseholderQR.h | 94 FullPivHouseholderQR(Index rows, Index cols)
95 : m_qr(rows, cols),
96 m_hCoeffs((std::min)(rows,cols)),
97 m_rows_transpositions((std::min)(rows,cols)),
98 m_cols_transpositions((std::min)(rows,cols)),
110 * FullPivHouseholderQR<MatrixType> qr(matrix.rows(), matrix.cols());
117 : m_qr(matrix.rows(), matrix.cols()),
118 m_hCoeffs((std::min)(matrix.rows(), matrix.cols())),
119 m_rows_transpositions((std::min)(matrix.rows(), matrix.cols())),
120 m_cols_transpositions((std::min)(matrix.rows(), matrix.cols()))
292 inline Index rows() const { return m_qr.rows(); } function in class:Eigen::FullPivHouseholderQR
498 const Index rows = dec().rows(), cols = dec().cols(); local
558 const Index rows = m_qr.rows(); local
570 const Index rows = m_qr.rows(); local
583 Index rows() const { return m_qr.rows(); } function in struct:Eigen::internal::FullPivHouseholderQRMatrixQReturnType
[all...] |
| HouseholderQR.h | 76 HouseholderQR(Index rows, Index cols)
77 : m_qr(rows, cols),
78 m_hCoeffs((std::min)(rows,cols)),
88 * HouseholderQR<MatrixType> qr(matrix.rows(), matrix.cols());
95 : m_qr(matrix.rows(), matrix.cols()),
96 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())),
182 inline Index rows() const { return m_qr.rows(); } function in class:Eigen::HouseholderQR
203 eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!");
211 eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!")
224 Index rows = mat.rows(); local
263 Index rows = mat.rows(); local
313 const Index rows = dec().rows(), cols = dec().cols(); local
346 Index rows = matrix.rows(); local
[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/chromium_org/third_party/libvpx/source/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/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++)
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/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/eigen/test/ |
| vectorwiseop.cpp | 21 Index rows = m.rows(); local
23 Index r = internal::random<Index>(0, rows-1),
26 ArrayType m1 = ArrayType::Random(rows, cols),
27 m2(rows, cols),
28 m3(rows, cols);
30 ColVectorType colvec = ColVectorType::Random(rows);
126 Index rows = m.rows(); local
128 Index r = internal::random<Index>(0, rows-1)
[all...] |
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 46 inline Index rows() const { return m_A.rows() * m_B.rows(); } function in class:Eigen::KroneckerProduct
51 return m_A.coeff(row / m_B.rows(), col / m_B.cols()) *
52 m_B.coeff(row % m_B.rows(), col % m_B.cols());
94 inline Index rows() const { return m_A.rows() * m_B.rows(); } function in class:Eigen::KroneckerProductSparse
116 const Index Br = m_B.rows(),
118 for (Index i=0; i < m_A.rows(); ++i
[all...] |
| /external/eigen/unsupported/test/ |
| 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(), m.cols())
144 Index rows = m.rows(); local
[all...] |
| /external/chromium_org/third_party/webrtc/modules/desktop_capture/ |
| desktop_region.cc | 50 for (Rows::iterator it = rows_.begin(); it != rows_.end(); ++it) {
59 // Iterate over rows of the tow regions and compare each row.
60 Rows::const_iterator it1 = rows_.begin();
61 Rows::const_iterator it2 = region.rows_.begin();
77 for (Rows::iterator row = rows_.begin(); row != rows_.end(); ++row) {
93 // we iterate over the rows until it reaches |rect.bottom()|.
96 // Iterate over all rows that may intersect with |rect| and add new rows when
98 Rows::iterator row = rows_.upper_bound(top);
107 row, Rows::value_type(bottom, new Row(top, bottom)))
[all...] |
| /external/chromium_org/third_party/skia/tools/bug_chomper/res/third_party/ |
| 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 = table.rows; //getElementsByTagName("tr"
298 var rows = jQuery.tableDnD.currentTable.rows; variable
[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
149 /** \returns the number of rows. \sa cols() */
150 inline Index rows() const { return derived().rows(); } function in class:Eigen::SparseMatrixBase
151 /** \returns the number of columns. \sa rows() */
153 /** \returns the number of coefficients, which is \a rows()*cols()
[all...] |
| /external/skia/tools/bug_chomper/res/third_party/ |
| 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 = table.rows; //getElementsByTagName("tr"
298 var rows = jQuery.tableDnD.currentTable.rows; variable
[all...] |
| /external/eigen/unsupported/Eigen/src/SVD/ |
| JacobiSVD.h | 79 if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols())
82 ::new (&m_qr) QRType(svd.rows(), svd.cols());
84 if (svd.m_computeFullU) m_workspace.resize(svd.rows());
89 if(matrix.rows() > matrix.cols())
124 if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols())
127 ::new (&m_qr) QRType(svd.cols(), svd.rows());
129 m_adjoint.resize(svd.cols(), svd.rows());
135 if(matrix.cols() > matrix.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 | 89 // rhs = [b;0] to account for the additional rows in the lhs.
90 if (rhs_.rows() != lhs_.rows()) {
91 rhs_.resize(lhs_.rows());
96 if (work_.rows() == 1) {
98 LAPACK::EstimateWorkSizeForQR(lhs_.rows(), lhs_.cols());
106 summary.termination_type = LAPACK::SolveInPlaceUsingQR(lhs_.rows(),
109 work_.rows(),
138 // rhs = [b;0] to account for the additional rows in the lhs.
141 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_;
113 test_db_, AutocompleteActionPredictorTable::Rows());
130 AutocompleteActionPredictorTable::Rows(1, test_db_[0]),
131 AutocompleteActionPredictorTable::Rows());
142 AutocompleteActionPredictorTable::Rows rows_to_add;
147 AutocompleteActionPredictorTable::Rows());
153 AutocompleteActionPredictorTable::Rows(1, test_db_[2]),
154 AutocompleteActionPredictorTable::Rows(1, row1));
167 AutocompleteActionPredictorTable::Rows rows_to_update;
171 AutocompleteActionPredictorTable::Rows(),
[all...] |
