| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 20 * by the average magnitude of all the original elements in the current row.
21 * 2) After the elimination of the row, only the @p fill largest elements in
130 int QuickSplit(VectorV &row, VectorI &ind, int ncut);
135 inline bool operator() (const Index& row, const Index& col, const Scalar&) const
137 return row!=col;
166 * \param fillfactor This is used to compute the number @p fill_in of largest elements to keep on each row.
177 * On output, the vector row is permuted such that its elements satisfy
178 * abs(row(i)) >= abs(row(ncut)) if i<ncut
179 * abs(row(i)) <= abs(row(ncut)) if i>ncut
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseVector.h | 88 inline Scalar coeff(Index row, Index col) const
90 eigen_assert((IsColVector ? col : row)==0);
91 return coeff(IsColVector ? row : col);
95 inline Scalar& coeffRef(Index row, Index col)
97 eigen_assert((IsColVector ? col : row)==0);
98 return coeff(IsColVector ? row : col);
140 inline Scalar& insert(Index row, Index col)
142 Index inner = IsColVector ? row : col;
143 Index outer = IsColVector ? col : row;
353 inline Index row() const { return IsColVector ? index() : 0; function in class:Eigen::SparseVector::InnerIterator
385 inline Index row() const { return IsColVector ? index() : 0; } function in class:Eigen::SparseVector::ReverseInnerIterator
[all...] |
| /frameworks/base/core/java/com/android/internal/view/menu/ |
| IconMenuView.java | 56 /** Height of each row */
62 /** Maximum number of items per row */
112 * The layout to use for menu items. Each index is the row number (0 is the
113 * top-most). Each value contains the number of items in that row.
218 * @return int[] Where the value of index i contains the number of items for row i
227 * the last row.
256 for (int row = 0; row < numRows; row++) {
257 int numItemsOnRow = layout[row];
[all...] |
| /frameworks/native/opengl/tests/hwc/ |
| hwcStress.cpp | 40 * of vectors. The array is accessed in row major order, so each
41 * row is a vector of smart pointers. All the pointers of a single
42 * row point to graphic buffers which use the same pixel format and
47 * graphic buffer within the same row. Since the graphic buffers
48 * in a particular row have the same pixel format and dimension,
225 * such that there is a unique row to be used for each
229 * selected from any of the columns of the selected row.
546 * vectors. All the graphic buffers in a particular row are of the same
549 * in the same row, will be filled with a unique color.
565 for (unsigned int row = 0; row < rows; row++)
[all...] |
| /packages/apps/Browser/src/com/android/browser/view/ |
| BookmarkExpandableView.java | 277 int mRowCount = 1; // assume at least 1 child fits in a row
323 LinearLayout row = (LinearLayout) convertView; local
324 if (row.getChildCount() > rowCount) {
325 row.removeViews(rowCount, row.getChildCount() - rowCount);
329 if (row.getChildCount() > i) {
330 cv = row.getChildAt(i);
334 View v = childAdapter.getView(realChildPosition, cv, row);
340 row.addView(v);
342 row.removeViewAt(i)
[all...] |
| /cts/tests/tests/provider/src/android/provider/cts/ |
| MediaStore_VideoTest.java | 45 for (Uri row : mRowsAdded) {
46 mContentResolver.delete(row, null, null);
|
| /external/chromium_org/chrome/browser/resources/instant/ |
| instant.css | 30 .row {
|
| /external/chromium_org/chrome/browser/ui/views/ |
| hung_renderer_view.cc | 125 base::string16 HungPagesTableModel::GetText(int row, int column_id) {
126 DCHECK(row >= 0 && row < RowCount());
127 base::string16 title = tab_observers_[row]->web_contents()->GetTitle();
137 gfx::ImageSkia HungPagesTableModel::GetIcon(int row) {
138 DCHECK(row >= 0 && row < RowCount());
140 tab_observers_[row]->web_contents())->GetFavicon().AsImageSkia();
|
| /external/chromium_org/third_party/icu/source/common/ |
| propsvec.h | 34 * Logically, each row has a certain number of uint32_t values,
38 * In each internal row,
39 * row[0] contains the start code point and
40 * row[1] contains the limit code point,
43 * Initially, there is only one "normal" row for
47 * It would be possible to store only one range boundary per row,
71 * @param columns Number of value integers (uint32_t) per row.
113 * - for each (non-unique) row, call the handler function
115 * The handler's rowIndex is the index of the row in the compacted
123 * and the row is arbitrary (but not NULL)
[all...] |
| /external/chromium_org/ui/gfx/ |
| interpolated_transform_unittest.cc | 167 for (int row = 0; row < 3; ++row) {
169 float entry = m.get(row, col);
218 for (int row = 0; row < 3; ++row) {
220 float entry = m.get(row, col);
|
| /external/icu4c/common/ |
| propsvec.h | 34 * Logically, each row has a certain number of uint32_t values,
38 * In each internal row,
39 * row[0] contains the start code point and
40 * row[1] contains the limit code point,
43 * Initially, there is only one "normal" row for
47 * It would be possible to store only one range boundary per row,
71 * @param columns Number of value integers (uint32_t) per row.
113 * - for each (non-unique) row, call the handler function
115 * The handler's rowIndex is the index of the row in the compacted
123 * and the row is arbitrary (but not NULL)
[all...] |
| /external/markdown/markdown/extensions/ |
| imagelinks.py | 72 for row in rows:
73 for photo_url, title in row:
99 rows.append([]) # start a new row
|
| /external/pixman/demos/ |
| conical-test.c | 80 int row = i / GRADIENTS_PER_ROW; local
89 0, 0, 0, 0, column * SIZE, row * SIZE,
|
| /development/samples/ApiDemos/src/com/example/android/apis/media/ |
| AudioFxDemo.java | 121 LinearLayout row = new LinearLayout(this); local
122 row.setOrientation(LinearLayout.HORIZONTAL);
155 row.addView(minDbTextView);
156 row.addView(bar);
157 row.addView(maxDbTextView);
159 mLinearLayout.addView(row);
|
| /development/samples/TicTacToeLib/src/com/example/android/tictactoe/library/ |
| GameActivity.java | 192 int row = -1;
local
198 row = j;
221 if (col != -1 || row != -1 || diag != -1) {
222 setFinished(player, col, row, diag);
234 private void setFinished(State player, int col, int row, int diagonal) {
239 mGameView.setFinished(col, row, diagonal);
|
| /external/ceres-solver/internal/ceres/ |
| schur_eliminator_test.cc | 108 int row = 0; local
112 P.block(row, row, block_size, block_size) =
114 .block(row, row, block_size, block_size)
117 row += block_size;
|
| /external/chromium_org/chrome/browser/extensions/api/music_manager_private/ |
| device_id_win.cc | 56 void ProcessInterfaceRow(const PMIB_IF_ROW2 row) {
57 if (row->Type == IF_TYPE_TUNNEL ||
58 !row->InterfaceAndOperStatusFlags.HardwareInterface) {
62 ProcessPhysicalAddress(row->InterfaceIndex,
63 row->PhysicalAddress,
64 row->PhysicalAddressLength);
|
| /external/chromium_org/chrome/browser/importer/ |
| profile_writer_unittest.cc | 58 history::URLRow row(GURL(url), 0);
59 row.set_title(title);
60 row.set_visit_count(visit_count);
61 row.set_typed_count(typed_count);
62 row.set_last_visit(base::Time::NowFromSystemTime() -
64 return row;
|
| /external/chromium_org/chrome/browser/resources/ |
| certificate_viewer.css | 54 display: table-row;
112 .tree-row[selected] {
117 .tree-item > .tree-row {
|
| /external/chromium_org/chrome/browser/resources/task_manager/ |
| task_manager.css | 70 /* Bullets on the left of row. */
71 .table-row > .table-row-cell:first-child::before {
81 .table-row-cell {
|
| /external/chromium_org/ui/webui/resources/css/ |
| table.css | 41 .table-row {
47 .table-row-cell {
52 .table-row-cell > * {
|
| /external/eigen/Eigen/src/Core/ |
| CwiseBinaryOp.h | 172 EIGEN_STRONG_INLINE const Scalar coeff(Index row, Index col) const
174 return derived().functor()(derived().lhs().coeff(row, col),
175 derived().rhs().coeff(row, col));
179 EIGEN_STRONG_INLINE PacketScalar packet(Index row, Index col) const
181 return derived().functor().packetOp(derived().lhs().template packet<LoadMode>(row, col),
182 derived().rhs().template packet<LoadMode>(row, col));
|
| Replicate.h | 92 inline Scalar coeff(Index row, Index col) const
96 : RowFactor==1 ? row
97 : row%m_matrix.rows();
105 inline PacketScalar packet(Index row, Index col) const
108 : RowFactor==1 ? row
109 : row%m_matrix.rows();
160 * \return an expression of the replication of each column (or row) of \c *this
|
| /external/eigen/test/ |
| product_syrk.cpp | 76 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.row(c),s1)._expression()),
77 ((s1 * m1.row(c).transpose() * m1.row(c).transpose().adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
80 VERIFY_IS_APPROX((m2.template selfadjointView<Upper>().rankUpdate(m1.row(c).adjoint(),s1)._expression()),
81 ((s1 * m1.row(c).adjoint() * m1.row(c).adjoint().adjoint()).eval().template triangularView<Upper>().toDenseMatrix()));
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_mvref_common.c | 137 mv.as_mv.row *= -1;
176 return !(mi_row + mv->row < 0 ||
178 mi_row + mv->row >= mi_rows ||
207 const MODE_INFO *const candidate_mi = xd->mi_8x8[mv_ref->col + mv_ref->row
235 mv_ref->row
265 mv_ref->row
|
