| /external/skia/src/utils/ |
| SkMeshUtils.cpp | 14 int texW, int texH, int rows, int cols) {
15 if (rows < 2 || cols < 2) {
27 fTexCount = rows * cols;
28 rows -= 1;
30 fIndexCount = rows * cols * 6;
47 for (int x = 0; x < rows; x++) {
49 *idx++ = index + rows + 1;
53 *idx++ = index + rows + 1;
54 *idx++ = index + rows + 2;
65 const SkScalar dx = SkIntToScalar(texW) / rows;
[all...] |
| SkBoundaryPatch.cpp | 37 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) {
38 if (rows < 2 || cols < 2) {
42 const SkScalar invR = SkScalarInvert(SkIntToScalar(rows - 1));
47 for (int x = 0; x < rows; x++) {
|
| /external/skia/include/utils/ |
| SkMeshUtils.h | 16 bool init(int texW, int texH, int rows, int cols) {
17 return this->init(NULL, NULL, texW, texH, rows, cols);
21 int texW, int texH, int rows, int cols);
38 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
|
| SkBoundaryPatch.h | 29 bool evalPatch(SkPoint verts[], int rows, int cols);
|
| /external/webkit/WebCore/storage/ |
| SQLResultSet.idl | 35 readonly attribute SQLResultSetRowList rows;
|
| SQLResultSet.h | 45 SQLResultSetRowList* rows() const;
|
| SQLResultSet.cpp | 52 // If the query didn't result in any rows being added, raise an INVALID_ACCESS_ERR exception
65 SQLResultSetRowList* SQLResultSet::rows() const function in class:WebCore::SQLResultSet
|
| /libcore/sqlite-jdbc/src/main/java/SQLite/ |
| TableResult.java | 39 * Number of rows in the result set.
57 * Rows of the result set. Each row is stored as a String array.
60 public Vector rows; field in class:TableResult
63 * Maximum number of rows to hold in the table.
69 * Flag to indicate Maximum number of rows condition.
83 * Create an empty result set with maximum number of rows.
98 rows = new Vector();
130 rows.addElement(rowdata);
150 String row[] = (String[]) rows.elementAt(i);
|
| /external/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++)
|
| /build/tools/ |
| compare_fileslist.py | 46 rows = []
54 rows.append(row)
55 rows = sorted(rows, key=lambda x: x[0])
89 for row in rows:
|
| /external/webkit/WebCore/html/ |
| HTMLTableSectionElement.cpp | 82 RefPtr<HTMLCollection> children = rows();
104 RefPtr<HTMLCollection> children = rows();
117 int rows = 0; local
121 rows++;
125 return rows;
168 PassRefPtr<HTMLCollection> HTMLTableSectionElement::rows() function in class:WebCore::HTMLTableSectionElement
|
| HTMLTableSectionElement.idl | 31 readonly attribute HTMLCollection rows;
|
| HTMLTableSectionElement.h | 61 PassRefPtr<HTMLCollection> rows();
|
| HTMLFrameSetElement.idl | 27 attribute [ConvertNullToNullString] DOMString rows;
|
| /external/clearsilver/python/examples/base/ |
| odb_mysql.py | 27 rows = cursor.fetchall()
29 for row in rows:
40 rows = cursor.fetchall()
43 for row in rows:
|
| odb_sqlite.py | 51 rows = cursor.fetchall()
53 for row in rows: tables.append(row[0])
59 rows = cursor.fetchall()
61 for row in rows: tables.append(row[0])
68 rows = cursor.fetchall()
71 for row in rows:
|
| /frameworks/base/graphics/java/android/graphics/utils/ |
| BoundaryPatch.java | 66 * @param rows The number of points across to approximate the boundary.
71 public void setCubicBoundary(float[] pts, int offset, int rows, int cols) {
72 if (rows < 2 || cols < 2) {
73 throw new RuntimeException("rows and cols must be >= 2");
76 if (mRows != rows || mCols != cols) {
77 mRows = rows;
170 int texW, int texH, int rows, int cols,
|
| /external/freetype/src/base/ |
| ftbitmap.c | 63 size = (FT_ULong)( pitch * source->rows );
73 target_size = (FT_ULong)( target_pitch * target->rows );
112 height = bitmap->rows;
176 if ( FT_QALLOC_MULT( buffer, new_pitch, bitmap->rows + ypixels ) )
184 for ( i = 0; i < bitmap->rows; i++ )
193 for ( i = 0; i < bitmap->rows; i++ )
292 p = bitmap->buffer + pitch * ( bitmap->rows - 1 );
296 for ( y = 0; y < bitmap->rows ; y++ )
350 * Make the above `ystr' rows or'ed with it.
366 bitmap->rows += ystr
[all...] |
| /external/chromium/third_party/icu/source/common/ |
| propsvec.c | 31 int32_t rows; member in struct:UPropsVectors
67 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP);
69 /* set the all-Unicode row and the special-value rows */
71 uprv_memset(row, 0, pv->rows*columns*4);
94 int32_t columns, i, start, limit, prevRow, rows; local
97 rows=limit=pv->rows;
183 /* find the rows whose ranges overlap with the input range */
185 /* find the first and last rows, always successful */
190 * Rows need to be split if they partially overlap with th
199 int32_t count, rows; local
333 int32_t i, columns, valueColumns, rows, count; local
[all...] |
| /external/icu4c/common/ |
| propsvec.c | 31 int32_t rows; member in struct:UPropsVectors
67 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP);
69 /* set the all-Unicode row and the special-value rows */
71 uprv_memset(row, 0, pv->rows*columns*4);
94 int32_t columns, i, start, limit, prevRow, rows; local
97 rows=limit=pv->rows;
183 /* find the rows whose ranges overlap with the input range */
185 /* find the first and last rows, always successful */
190 * Rows need to be split if they partially overlap with th
199 int32_t count, rows; local
335 int32_t i, columns, valueColumns, rows, count; local
[all...] |
| /external/libvpx/vp8/common/ppc/ |
| systemdependent.c | 28 int rows,
33 extern void (*vp8_mbpost_proc_down)(unsigned char *dst, int pitch, int rows, int cols, int flimit);
34 extern void vp8_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols, int flimit);
35 extern void (*vp8_mbpost_proc_across_ip)(unsigned char *src, int pitch, int rows, int cols, int flimit);
36 extern void vp8_mbpost_proc_across_ip_c(unsigned char *src, int pitch, int rows, int cols, int flimit);
44 int rows,
|
| /external/qemu/distrib/sdl-1.2.12/src/video/ |
| SDL_yuv_mmx.c | 83 int rows, int cols, int mod )
88 unsigned char* y = lum +cols*rows; // Pointer to the end
244 int rows, int cols, int mod )
249 unsigned char* y = lum +cols*rows; /* Pointer to the end */
|
| /frameworks/base/tools/aapt/ |
| Images.cpp | 36 image_info() : rows(NULL), is9Patch(false), allocRows(NULL) { }
38 if (rows && rows != allocRows) {
39 free(rows);
54 png_bytepp rows; member in struct:image_info
104 outImageInfo->rows = (png_bytepp)malloc(
107 outImageInfo->allocRows = outImageInfo->rows;
109 png_set_rows(read_ptr, read_info, outImageInfo->rows);
113 outImageInfo->rows[i] = (png_bytep)
117 png_read_image(read_ptr, outImageInfo->rows);
938 png_bytepp rows; local
[all...] |
| /frameworks/base/tools/preload/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /external/libvpx/vpx/ |
| vp8cx.h | 167 unsigned int rows; /**< number of rows */ member in struct:vpx_roi_map
184 unsigned int rows; /**< number of rows */ member in struct:vpx_active_map
|
