| /external/ceres-solver/internal/ceres/ |
| schur_complement_solver.cc | 200 // Add to the chunk until the first block in the row is
201 // different than the one in the first row for the chunk.
203 const CompressedRow& row = bs->rows[r]; local
204 if (row.cells.front().block_id != e_block_id) {
208 // Iterate over the blocks in the row, ignoring the first
210 for (int c = 1; c < row.cells.size(); ++c) {
211 const Cell& cell = row.cells[c];
228 const CompressedRow& row = bs->rows[r]; local
229 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks);
230 for (int i = 0; i < row.cells.size(); ++i)
[all...] |
| block_random_access_crs_matrix.cc | 58 // Build the row/column layout vector and count the number of scalar
86 // pattern of the underlying compressed sparse row matrix. Along the
94 // Add entries to layout_ for all the blocks for this row.
107 // Count the number of non-zeros in the row block.
112 // Fill out the sparsity pattern for each row.
146 int* row,
156 *row = 0;
|
| /external/chromium/chrome/browser/ui/gtk/ |
| gtk_tree.cc | 27 int row = GetRowNumForPath(path); local
29 return row;
36 int row = GetRowNumForPath(child_path); local
38 return row;
41 void SelectAndFocusRowNum(int row, GtkTreeView* tree_view) {
48 if (!gtk_tree_model_iter_nth_child(model, &iter, NULL, row)) {
111 // Every group consists of a header and a separator row, and there is a blank
112 // row between groups.
176 void TableAdapter::AddNodeToList(int row) {
178 int list_store_index = GetListStoreIndexForModelRow(row);
[all...] |
| /external/chromium_org/chrome/browser/ui/gtk/ |
| gtk_tree.cc | 29 int row = GetRowNumForPath(path); local
31 return row;
38 int row = GetRowNumForPath(child_path); local
40 return row;
43 void SelectAndFocusRowNum(int row, GtkTreeView* tree_view) {
50 if (!gtk_tree_model_iter_nth_child(model, &iter, NULL, row)) {
113 // Every group consists of a header and a separator row, and there is a blank
114 // row between groups.
178 void TableAdapter::AddNodeToList(int row) {
180 int list_store_index = GetListStoreIndexForModelRow(row);
[all...] |
| /external/chromium_org/chrome/browser/ui/search_engines/ |
| template_url_table_model.cc | 186 base::string16 TemplateURLTableModel::GetText(int row, int col_id) {
187 DCHECK(row >= 0 && row < RowCount());
188 const TemplateURL* url = entries_[row]->template_url();
205 gfx::ImageSkia TemplateURLTableModel::GetIcon(int row) {
206 DCHECK(row >= 0 && row < RowCount());
207 return entries_[row]->GetIcon();
242 int TemplateURLTableModel::GetGroupID(int row) {
243 DCHECK(row >= 0 && row < RowCount())
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_sparse_basic.cpp | 103 // VERIFY_IS_APPROX(m.block(i,j,h,w).row(r), refMat.block(i,j,h,w).row(r));
106 // VERIFY_IS_APPROX(m.block(i,j,h,w).row(r).coeff(c), refMat.block(i,j,h,w).row(r).coeff(c));
119 VERIFY_IS_APPROX(m.row(r) + m.row(r), (m + m).row(r));
120 VERIFY_IS_APPROX(m.row(r) + m.row(r), refMat.row(r) + refMat.row(r))
[all...] |
| /packages/apps/Mms/src/com/android/mms/ |
| SuggestionsProvider.java | 93 ArrayList<Row> mRows = new ArrayList<Row>();
115 private class Row {
119 public Row(int row, String snippet) {
121 mRowNumber = row;
143 mRows.add(new Row(i, snippet));
208 * a "word" by taking the substring of the full row text in the words table
296 Row row = mRows.get(mCurrentRow) local
[all...] |
| /external/chromium/chrome/browser/importer/ |
| mork_reader.cc | 159 // Table / table row.
239 // Parses a table row of the form [123(^45^67)..]
240 // (row id 123 has the value with id 67 for the column with id 45).
251 // Points to the current row we're parsing inside of the |table_|, will be
252 // NULL if we're not inside a row.
265 // junk before the first row that looks like cell values but isn't.
269 in_meta_row = true; // The meta row is enclosed in { }
278 // Start of a new row. Consume the row id, up to the first '('.
279 // Row edits also have a table namespace, separated from the row i
[all...] |
| /ndk/tests/build/issue20862-libpng-O0/jni/ |
| pngrtran.c | 2 /* pngrtran.c - transforms the data in a row for PNG readers
[all...] |
| /external/chromium_org/ui/views/controls/tree/ |
| tree_view.cc | 327 ui::TreeModelNode* TreeView::GetNodeForRow(int row) {
329 InternalNode* node = GetNodeByRow(row, &depth);
394 int row = (local_point.y() - kVerticalInset) / row_height_; local
396 InternalNode* node = GetNodeByRow(row, &depth);
399 gfx::Rect bounds(GetBoundsForNodeImpl(node, row, depth));
524 void TreeView::SetSelectedRow(int row) {
525 SetSelectedNode(GetNodeForRow(row));
528 string16 TreeView::GetTextForRow(int row) {
529 return GetNodeForRow(row)->GetTitle();
640 int row = (event.y() - kVerticalInset) / row_height_ local
864 int row, depth; local
884 int row = -1; local
954 int row = GetRowForInternalNode(selected_node_, &depth); local
[all...] |
| /packages/apps/Gallery/src/com/android/camera/ |
| GridViewSpecial.java | 503 int row = pos / mColumns; local
504 int col = pos - (row * mColumns);
508 int top = row * mBlockHeight;
523 int row = (mScrollY + y - spacing) / (mSpec.mCellHeight + spacing); local
526 return (row * mColumns) + col;
696 int row = mCurrentSelection / mColumns; local
697 int col = mCurrentSelection - (row * mColumns);
702 int yTop = spacing + (row * mBlockHeight);
720 // mCache maps from row number to the ImageBlock.
725 private final Runnable mRedrawCallback; // Called after a row is loaded
794 int row = pos \/ mColumns; local
880 int row = index \/ mColumns; local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableTable.java | 97 * expected and that isn't documented in the Javadoc. If a row Comparator
98 * is provided, cellSet() iterates across the columns in the first row,
99 * the columns in the second row, etc. If a column Comparator is provided
100 * but a row Comparator isn't, cellSet() iterates across the rows in the
234 @Override public ImmutableMap<C, V> row(R rowKey) { method
251 Map<C, V> row = rowMap.get(rowKey); local
252 return (row != null) && row.containsKey(columnKey);
265 Map<C, V> row = rowMap.get(rowKey); local
266 return (row == null) ? null : row.get(columnKey)
[all...] |
| HashBasedTable.java | 36 * all optional operations are supported. Null row keys, columns keys, and
39 * <p>Lookups by row key are often faster than lookups by column key, because
41 * column(columnKey).get(rowKey)} still runs quickly, since the row key is
43 * iteration across all row keys occurs.
79 * @param expectedRows the expected number of distinct row keys
81 * mappings in each row
99 * @throws NullPointerException if any of the row keys, column keys, or values
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/ |
| MoreKeysKeyboard.java | 67 * @param rowHeight more keys keyboard row height in pixel, including vertical gap.
123 // Adjustment of the top row.
129 // Need to subtract the bottom row's gutter only.
157 final int row = n / mNumColumns; local
158 if (!isTopRow(row)) {
177 final int row = n / mNumColumns; local
179 if (isTopRow(row)) {
229 public int getX(final int n, final int row) {
231 if (isTopRow(row)) {
237 public int getY(final int row) {
343 final int row = n \/ params.mNumColumns; local
[all...] |
| /cts/tools/dasm/src/java_cup/ |
| parse_reduce_table.java | 6 * It has one row for each state in the parse machines, and a column for
63 for (int row = 0; row < num_states(); row++)
65 result += "From state #" + row + "\n";
67 for (int col = 0; col < under_state[row].size(); col++)
70 goto_st = under_state[row].under_non_term[col];
|
| /external/chromium/chrome/browser/ |
| plugin_exceptions_table_model.cc | 81 string16 PluginExceptionsTableModel::GetText(int row, int column_id) {
82 DCHECK_GE(row, 0);
83 DCHECK_LT(row, static_cast<int>(settings_.size()));
84 SettingsEntry& entry = settings_[row];
115 int PluginExceptionsTableModel::GetGroupID(int row) {
116 DCHECK_LT(row, static_cast<int>(settings_.size()));
117 return settings_[row].plugin_id;
|
| /external/chromium_org/third_party/WebKit/Source/web/resources/ |
| calendarPicker.js | [all...] |
| /external/chromium_org/third_party/angle/extensions/ |
| ANGLE_pack_reverse_row_order.txt | 54 ReadPixels. In some systems the GL can perform the row reversal during
78 In Section 4.3.1 (Reading Pixels) add a row to table 4.7:
91 rectangles to the GL. That is, the ith group of the jth row
92 (corresponding to the ith pixel in the jth row) is placed in memory just
93 where the ith group of the jth row would be taken from when transferring
137 PACK_REVERSE_ROW_ORDER_ANGLE B GetIntegerv FALSE Pixel pack row order reversal 4.3.1
155 /* Enable row order reversal */
|
| /external/chromium_org/third_party/libwebp/dec/ |
| alpha.c | 77 // and apply filter per image-row.
91 int row, int num_rows) {
95 if (row < 0 || num_rows < 0 || row + num_rows > height) {
99 if (row == 0) {
109 // Return a pointer to the current decoded row.
110 return dec->alpha_plane_ + row * width;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_rect.c | 133 uint16_t *row = (uint16_t *)dst; local
135 *row++ = uc->us;
141 uint32_t *row = (uint32_t *)dst; local
143 *row++ = uc->ui;
153 ubyte *row = dst; local
155 memcpy(row, uc, blocksize);
156 row += blocksize;
|
| /external/chromium_org/third_party/opus/src/silk/ |
| macros.h | 91 /* Row based */
92 #define matrix_ptr(Matrix_base_adr, row, column, N) \
93 (*((Matrix_base_adr) + ((row)*(N)+(column))))
94 #define matrix_adr(Matrix_base_adr, row, column, N) \
95 ((Matrix_base_adr) + ((row)*(N)+(column)))
99 # define matrix_c_ptr(Matrix_base_adr, row, column, M) \
100 (*((Matrix_base_adr) + ((row)+(M)*(column))))
|
| /external/chromium_org/third_party/re2/benchlog/ |
| mktable | 128 my %row;
129 $row{"name"} = $1;
130 $row{"iter"} = $2;
131 $row{"ns/op"} = $3;
133 $row{"MB/s"} = $1;
135 $sysdat{$row{"name"}} = \%row;
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| fts2n.test | 41 INSERT INTO t1(rowid, c) VALUES(2, 'Another lovely row');
104 execsql "SELECT rowid FROM t1 WHERE t1 MATCH '\"a* l* row\"'"
119 INSERT INTO t2(rowid, c) VALUES(2, 'Another lovely row');
161 # hit counts for each row. offsets() returns 4 elements for every
162 # hit. We'll have 6 hits for row 1, 1 for row 2, and 6*(2^5)==192 for
170 INSERT INTO t3(rowid, c) VALUES(2, 'Another lovely row');
|
| speed3.test | 29 # is not the first overflow page for the row. The improvement
154 # Delete all content in a table, one row at a time.
158 speed_trial speed3-1.incrvacuum $::NROW row {DELETE FROM main.t1 WHERE 1}
159 speed_trial speed3-1.normal $::NROW row {DELETE FROM aux.t1 WHERE 1}
163 # chain) from each table row.
168 speed_trial speed3-2.incrvacuum $::NROW row {SELECT c FROM main.t1}
169 speed_trial speed3-2.normal $::NROW row {SELECT c FROM aux.t1}
|
| /external/eigen/Eigen/src/Core/ |
| 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
|
