| /external/chromium_org/third_party/WebKit/Source/core/Resources/pagepopups/ |
| colorSuggestionPicker.css | 62 -webkit-flex-flow: row wrap;
|
| /external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
| AccessibilityTableCell.cpp | 112 // since our table might have multiple sections, we have to offset our row appropriately
142 // Try to find if the first cell in this row is a <th>. If it is,
161 int row = renderCell->rowIndex(); local
167 RenderTableCell* headerCell = section->primaryCellAt(row, 0);
|
| /external/chromium_org/ui/keyboard/resources/ |
| constants.js | 21 // TODO(bshe): The number of rows should equal to the number of kb-row elements
|
| /external/chromium_org/ui/keyboard/resources/webui/ |
| constants.js | 22 // TODO(bshe): The number of rows should equal to the number of kb-row elements
|
| /external/chromium_org/ui/oak/ |
| oak_aura_window_display.cc | 100 base::string16 OakAuraWindowDisplay::GetText(int row, int column_id) {
105 switch (row) {
|
| /external/doclava/res/assets/templates/assets/ |
| search_autocomplete.js | 9 function set_row_selected(row, selected)
11 var c1 = row.cells[0];
12 // var c2 = row.cells[1];
22 function set_row_values(toroot, row, match)
24 var link = row.cells[0].childNodes[0];
27 // row.cells[1].innerHTML = match.type;
77 r.className = "show-row";
92 r.className = "show-row";
96 filtered.rows[ROW_COUNT].className = "hide-row";
|
| /external/eigen/Eigen/src/Householder/ |
| Householder.h | 123 tmp += this->row(0);
124 this->row(0) -= tau * tmp;
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseCwiseBinaryOp.h | 144 EIGEN_STRONG_INLINE Index row() const { return Lhs::IsRowMajor ? m_lhsIter.row() : index(); } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
200 EIGEN_STRONG_INLINE Index row() const { return m_lhsIter.row(); } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
240 EIGEN_STRONG_INLINE Index row() const { return m_lhsIter.row(); } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
280 EIGEN_STRONG_INLINE Index row() const { return m_rhsIter.row(); } function in class:Eigen::internal::sparse_cwise_binary_op_inner_iterator_selector
|
| /external/eigen/test/eigen2/ |
| eigen2_swap.cpp | 72 VERIFY_RAISES_ASSERT(m1.swap(m1.row(0)));
74 VERIFY_RAISES_ASSERT(m1.row(0).swap(m1));
|
| /external/eigen/test/ |
| swap.cpp | 72 VERIFY_RAISES_ASSERT(m1.swap(m1.row(0)));
74 VERIFY_RAISES_ASSERT(m1.row(0).swap(m1));
|
| /external/guava/guava/src/com/google/common/collect/ |
| ForwardingTable.java | 115 public Map<C, V> row(R rowKey) { method in class:ForwardingTable
116 return delegate().row(rowKey);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SingletonImmutableTableTest.java | 57 assertEquals(ImmutableMap.of(), testTable.row('A'));
58 assertEquals(ImmutableMap.of(1, "blah"), testTable.row('a'));
|
| /external/jmonkeyengine/engine/src/core/com/jme3/math/ |
| Eigen3f.java | 116 // use the largest row to compute and order the eigen vectors.
198 int row = 0;
local
206 row = 1;
210 if (row == 0) {
224 if (row == 0) {
237 row = 0;
245 row = 1;
249 if (row == 0) {
261 if (row == 0) {
274 * max row of the matrix in the Vector store.
[all...] |
| /external/libpng/contrib/gregbook/ |
| rpng-win.c | 539 ulg i, row, lastrow; local
555 for (lastrow = row = 0; row < image_height; ++row) {
556 src = image_data + row*image_rowbytes;
557 dest = wimage_data + row*wimage_rowbytes;
593 if (((row+1) & 0xf) == 0) {
600 lastrow = row + 1;
|
| /external/libvpx/libvpx/vp8/common/ |
| debugmodes.c | 119 fprintf(mvs, "%5d:%-5d", mi[mb_index].mbmi.mv.as_mv.row / 2, mi[mb_index].mbmi.mv.as_mv.col / 2);
146 fprintf(mvs, "%3d:%-3d ", mi[mb_index].bmi[bindex].mv.as_mv.row, mi[mb_index].bmi[bindex].mv.as_mv.col);
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/ |
| h264bsd_inter_prediction.c | 220 /* set row bits 15:0 */
368 u32 row, col; local
378 row = mbNum / currImage->width;
379 col = mbNum - row * currImage->width;
380 row *= 16;
393 h264bsdPredictSamples(data, pMb->mv, &refImage, col, row, 0, 0,
401 h264bsdPredictSamples(data, pMb->mv, &refImage, col, row, 0, 0,
404 h264bsdPredictSamples(data, pMb->mv+8, &refImage, col, row, 0, 8,
412 h264bsdPredictSamples(data, pMb->mv, &refImage, col, row, 0, 0,
415 h264bsdPredictSamples(data, pMb->mv+4, &refImage, col, row, 8, 0
[all...] |
| /external/chromium_org/chrome/browser/resources/file_manager/css/ |
| file_manager.css | 297 #directory-tree .tree-row {
305 #directory-tree .tree-children .tree-row {
309 #directory-tree .tree-row > .expand-icon {
318 #directory-tree:focus .tree-row[selected] > .expand-icon {
322 #directory-tree .tree-row > .volume-icon {
330 #directory-tree .tree-row > .label {
338 #directory-tree .tree-item.accepts > .tree-row,
339 #directory-tree .tree-row[lead][selected],
340 #directory-tree .tree-row[lead],
341 #directory-tree .tree-row[selected]
[all...] |
| /frameworks/base/tools/aapt/ |
| Images.cpp | 204 png_bytep row, int width, bool transparent, bool required,
214 if (TICK_TYPE_TICK == tick_type(row+i*4, transparent, outError)) {
302 png_bytep row, int width, bool transparent, bool required,
309 if (TICK_TYPE_LAYOUT_BOUNDS == tick_type(row + 4, transparent, outError)) {
315 int tick = tick_type(row + i * 4, transparent, outError);
323 if (TICK_TYPE_LAYOUT_BOUNDS == tick_type(row + (width - 2) * 4, transparent, outError)) {
329 int tick = tick_type(row+i*4, transparent, outError);
595 if (yDivs[0] == 0) { // Row 1 is strechable
618 // The first row always starts with the top being at y=0 and the bottom
620 // the first row is stretchable along the Y axis, otherwise it is fixed
768 png_bytep row = rows[j]; local
828 png_bytep row = imageInfo.rows[j]; local
951 png_bytep row = imageInfo.rows[j]; local
[all...] |
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/ |
| TerrainQuad.java | [all...] |
| /external/chromium_org/chrome/browser/predictors/ |
| autocomplete_action_predictor.cc | 268 std::vector<AutocompleteActionPredictorTable::Row>* rows =
269 new std::vector<AutocompleteActionPredictorTable::Row>();
299 std::vector<AutocompleteActionPredictorTable::Row::Id> id_list;
340 std::vector<AutocompleteActionPredictorTable::Row> rows_to_add;
341 std::vector<AutocompleteActionPredictorTable::Row> rows_to_update;
356 AutocompleteActionPredictorTable::Row row; local
357 row.user_text = key.user_text;
358 row.url = key.url;
362 row.id = base::GenerateGUID()
[all...] |
| /external/chromium_org/content/browser/accessibility/ |
| browser_accessibility_win.h | 290 CONTENT_EXPORT STDMETHODIMP get_accessibleAt(long row,
303 CONTENT_EXPORT STDMETHODIMP get_columnExtentAt(long row,
324 CONTENT_EXPORT STDMETHODIMP get_rowDescription(long row,
327 CONTENT_EXPORT STDMETHODIMP get_rowExtentAt(long row,
354 CONTENT_EXPORT STDMETHODIMP get_isRowSelected(long row,
357 CONTENT_EXPORT STDMETHODIMP get_isSelected(long row,
362 long* row,
368 CONTENT_EXPORT STDMETHODIMP selectRow(long row) {
376 CONTENT_EXPORT STDMETHODIMP unselectRow(long row) {
396 CONTENT_EXPORT STDMETHODIMP get_cellAt(long row,
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/ui/ |
| ConfigTab.java | 217 toolTip.setMessage(/*"("+col+","+row+") "+*/toolTipMessage);
222 * Get the current cell position (column, row) from a point position.
233 int row = this.table.getTopIndex(); local
234 while (row<this.rowsCount && height<y) {
236 row++;
242 row--;
246 TableItem tableItem = this.table.getItem(row);
260 return new Point(col, row);
329 int row = 0; local
499 createToolTip(toolTipText, toolTipMessage, toolTipStyle, new Point(col, row));
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| DeleteSelectionCommand.cpp | 58 static bool isTableRowEmpty(Node* row)
60 if (!isTableRow(row))
63 for (Node* child = row->firstChild(); child; child = child->nextSibling())
671 Node* row = m_endTableRow->previousSibling(); local
684 Node* row = m_startTableRow->nextSibling(); local
[all...] |
| /external/jpeg/ |
| jquant2.c | 120 * of a true 3-D array, we use a row of pointers to 2-D arrays. Each
123 * on 80x86 machines, the pointer row is in near memory but the actual
165 * We can get away with a single array (holding one row's worth of errors)
166 * by using it to store the current row's errors at pixel columns not yet
167 * processed, but the next row's errors at columns already processed. We
207 boolean on_odd_row; /* flag to remember which row we are on */
231 int row; local
235 for (row = 0; row < num_rows; row++)
924 int row; local
964 int row; local
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| jquant2.c | 120 * of a true 3-D array, we use a row of pointers to 2-D arrays. Each
123 * on 80x86 machines, the pointer row is in near memory but the actual
165 * We can get away with a single array (holding one row's worth of errors)
166 * by using it to store the current row's errors at pixel columns not yet
167 * processed, but the next row's errors at columns already processed. We
207 boolean on_odd_row; /* flag to remember which row we are on */
231 int row; local
235 for (row = 0; row < num_rows; row++)
924 int row; local
964 int row; local
[all...] |
