| /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/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...] |
| /external/webkit/Source/WebCore/editing/ |
| DeleteSelectionCommand.cpp | 58 static bool isTableRowEmpty(Node* row)
60 if (!isTableRow(row))
63 for (Node* child = row->firstChild(); child; child = child->nextSibling())
658 Node* row = m_endTableRow->previousSibling(); local
659 while (row && row != m_startTableRow) {
660 RefPtr<Node> previousRow = row->previousSibling();
661 if (isTableRowEmpty(row))
671 Node* row = m_startTableRow->nextSibling(); local
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| pickinter.c | 58 bestmv->as_mv.row <<= 3;
78 int yoffset = this_mv.as_mv.row & 7;
80 in_what += (this_mv.as_mv.row >> 3) * pre_stride + (this_mv.as_mv.col >> 3);
399 x->MVcount[0][mv_max+((xd->mode_info_context->mbmi.mv.as_mv.row -
400 best_ref_mv->as_mv.row) >> 1)]++;
448 (*parent_ref_mv).as_mv.row = store_mode_info[parent_mb_index].mv.as_mv.row
539 if( abs(mv_l.as_mv.row) < 8 && abs(mv_l.as_mv.col) < 8)
547 if( abs(mv_al.as_mv.row) < 8 && abs(mv_al.as_mv.col) < 8)
555 if( abs(mv_a.as_mv.row) < 8 && abs(mv_a.as_mv.col) < 8
[all...] |
| mr_dissim.c | 34 mvx[cnt] = x->mbmi.mv.as_mv.row; \
42 mvx[cnt] = x->mbmi.mv.as_mv.row; \
58 /* Note: The first row & first column in mip are outside the frame, which
194 mmvx = MAX(abs(min_mvx - here->mbmi.mv.as_mv.row),
195 abs(max_mvx - here->mbmi.mv.as_mv.row));
|
| /external/qemu/distrib/libpng-1.2.19/ |
| pngvcrd.c | 100 /* Combines the row recently read in with the previous row.
105 the row. The pattern always repeats every 8 pixels, so just 8
115 png_combine_row(png_structp png_ptr, png_bytep row, int mask)
133 png_memcpy(row, png_ptr->row_buf + 1,
155 dstptr = row;
263 dstptr = row + offset_table[png_ptr->pass]*pixel_bytes;
291 dstptr = row;
407 dstptr = row + offset_table[png_ptr->pass]*pixel_bytes;
440 dstptr = row;
1011 png_bytep row = png_ptr->row_buf + 1; local
[all...] |
| /external/opencv/cv/src/ |
| cvcalibinit.cpp | 102 int row; // Board row index member in struct:CvCBCorner
115 int row, col; // row and column of this quad member in struct:CvCBQuad
155 static int icvTrimRow(CvCBQuad **quads, int count, int row, int dir);
486 // Checks that each board row and column is pretty much monotonous curve:
487 // It analyzes each row and each column of the chessboard as following:
488 // for each corner c lying between end points in the same row/column it checks that
490 // of the neighbor corners in the same row/column.
573 start->row = 0
585 int row = q->row; local
693 int row = quads[i]->row; local
[all...] |
| /external/emma/core/java12/com/vladium/emma/report/html/ |
| ReportGenerator.java | 181 // header row:
183 // coverage row:
216 HTMLTable.IRow row = statsTable.newRow (); local
217 row.newCell ().setText ("total packages:", true);
218 row.newCell ().setText ("" + item.getChildCount (), false);
222 row = statsTable.newRow ();
223 row.newCell ().setText ("total executable files:", true);
224 row.newCell ().setText ("" + item.getAggregate (IItem.TOTAL_SRCFILE_COUNT), false);
227 row = statsTable.newRow ();
228 row.newCell ().setText ("total classes:", true)
909 final HTMLTable.IRow row = table.newRow (); local
969 final HTMLTable.IRow row = table.newRow (); local
1033 final HTMLTable.IRow row = table.newRow (); local
1278 final HTMLTable.IRow row = srcTable.newTitleRow (); local
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/ |
| BaseStatusBar.java | 315 protected View updateNotificationVetoButton(View row, StatusBarNotification n) {
316 View vetoButton = row.findViewById(R.id.veto);
738 // create the row view
741 View row = inflater.inflate(R.layout.status_bar_notification_row, parent, false);
744 row.setTag(sbn.getPackageName());
746 workAroundBadLayerDrawableOpacity(row);
747 View vetoButton = updateNotificationVetoButton(row, sbn);
754 ViewGroup content = (ViewGroup)row.findViewById(R.id.content);
755 ViewGroup adaptive = (ViewGroup)row.findViewById(R.id.adaptive);
[all...] |
| /cts/tests/tests/widget/src/android/widget/cts/ |
| ResourceCursorAdapterTest.java | 143 * @param rowCount the row count
155 Object[] row = new Object[colCount + 1]; local
158 row[j] = "" + i + "" + j;
160 row[colCount] = i;
161 cursor.addRow(row);
|
| ResourceCursorTreeAdapterTest.java | 143 * @param rowCount the row count
155 Object[] row = new Object[colCount + 1]; local
158 row[j] = "" + rowCount + "" + colCount;
160 row[colCount] = i;
161 cursor.addRow(row);
|
| SimpleCursorTreeAdapterTest.java | 175 * @param rowCount the row count
188 Object[] row = new Object[colCount + 1]; local
191 row[j] = prefix + i + "" + j;
193 row[colCount] = i;
194 cursor.addRow(row);
|
| /external/chromium/chrome/browser/autocomplete/ |
| autocomplete_popup_view_mac.h | 85 // Opens the URL corresponding to the given |row|. If |force_background| is
89 void OpenURLForRow(int row, bool force_background);
|
| /external/eigen/bench/ |
| eig33.cpp | 131 // evecs.col(0) = tmp.row(0).cross(tmp.row(1)).normalized();
135 // evecs.col(1) = tmp.row(0).cross(tmp.row(1)).normalized();
139 // evecs.col(2) = tmp.row(0).cross(tmp.row(1)).normalized();
151 evecs.col (2) = tmp.row (0).cross (tmp.row (1)).normalized ();
155 evecs.col(1) = tmp.row (0).cross(tmp.row (1))
[all...] |
| /external/eigen/test/ |
| product.h | 122 res.row(i) = m1.row(i) * m2.transpose();
141 Scalar x = square2.row(c) * square2.col(c2);
142 VERIFY_IS_APPROX(x, square2.row(c).transpose().cwiseProduct(square2.col(c2)).sum());
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| ConstrainedConjGrad.h | 76 /* which is the i-th row of inv(C * trans(C)) */
87 l = C.transpose() * e; // l is the i-th row of CINV
138 Scalar al = C.row(i).dot(x) - f.coeff(i);
146 Scalar bb = CINV.row(i).dot(z);
148 // FIXME: we should allow that: z += -bb * C.row(i);
175 Scalar bb = C.row(i).dot(p) - f[i];
177 lambda = (std::min)(lambda, (f.coeff(i)-C.row(i).dot(x)) / bb);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| NewCustomTableTest.java | 59 ASSERT.that(table.row("foo").keySet()).hasContentsInOrder(2, 3);
|
| /external/libpng/ |
| example.c | 349 for (row = 0; row < height; row++)
350 row_pointers[row] = NULL;
352 for (row = 0; row < height; row++)
353 row_pointers[row] = png_malloc(png_ptr, png_get_rowbytes(png_ptr,
365 #ifdef single /* Read the image a single row at a time */
474 * want to display any rows that were generated in the row
[all...] |
| /external/linux-tools-perf/util/ |
| svghelper.h | 22 extern void svg_interrupt(u64 start, int row);
|
| /external/qemu/distrib/zlib-1.2.3/ |
| crc32.c | 376 unsigned long row; local
386 row = 1;
388 odd[n] = row;
389 row <<= 1;
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| ExtrasMenuActivity.java | 44 final int row = prefs.getInt(PreferenceConstants.PREFERENCE_LEVEL_ROW, 0);
46 if (row != 0 || index != 0) {
58 final int row = prefs.getInt(PreferenceConstants.PREFERENCE_LEVEL_ROW, 0);
60 if (row != 0 || index != 0) {
|
| /external/skia/legacy/src/utils/ |
| SkColorMatrix.cpp | 104 static void setrow(SkScalar row[], SkScalar r, SkScalar g, SkScalar b) {
105 row[0] = r;
106 row[1] = g;
107 row[2] = b;
|
| /external/skia/src/effects/ |
| SkColorMatrix.cpp | 105 static void setrow(SkScalar row[], SkScalar r, SkScalar g, SkScalar b) {
106 row[0] = r;
107 row[1] = g;
108 row[2] = b;
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/ |
| h264bsd_image.c | 182 u32 row, col; local
199 row = mbNum / picWidth;
203 lum = (image->data + row * picWidth * 256 + col * 16);
204 cb = (image->data + picSize * 256 + row * picWidth * 64 + col * 8);
|
