Searched refs:rows (Results 1 - 25 of 325) sorted by relevance

1234567891011>>

/external/chromium/chrome/browser/
H A Dremove_rows_table_model.h13 // A table model that also supports removing rows. Used for example for the
19 // Returns whether or not the rows can be removed.
20 virtual bool CanRemoveRows(const Rows& rows) const = 0;
22 // Remove the rows from the table.
23 virtual void RemoveRows(const Rows& rows) = 0;
25 // Removes all the rows.
/external/skia/src/utils/
H A DSkMeshUtils.cpp21 int texW, int texH, int rows, int cols) {
22 if (rows < 2 || cols < 2) {
34 fTexCount = rows * cols;
35 rows -= 1;
37 fIndexCount = rows * cols * 6;
54 for (int x = 0; x < rows; x++) {
56 *idx++ = index + rows + 1;
60 *idx++ = index + rows + 1;
61 *idx++ = index + rows + 2;
72 const SkScalar dx = SkIntToScalar(texW) / rows;
20 init(SkPoint tex[], uint16_t indices[], int texW, int texH, int rows, int cols) argument
88 Draw(SkCanvas* canvas, const SkBitmap& bitmap, int rows, int cols, const SkPoint verts[], const SkColor colors[], const SkPaint& paint) argument
[all...]
/external/llvm/include/llvm/CodeGen/PBQP/
H A DMath.h116 Matrix(unsigned rows, unsigned cols) :
117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) {
122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) :
123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) {
124 std::fill(data, data + (rows * cols), initVal);
129 rows(
[all...]
/external/skia/include/utils/
H A DSkMeshUtils.h23 bool init(int texW, int texH, int rows, int cols) { argument
24 return this->init(NULL, NULL, texW, texH, rows, cols);
28 int texW, int texH, int rows, int cols);
45 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
/external/markdown/markdown/extensions/
H A Dtables.py25 rows = block.split('\n')
26 return (len(rows) > 2 and '|' in rows[0] and
27 '|' in rows[1] and '-' in rows[1] and
28 rows[1][0] in ['|', ':', '-'])
34 rows = block[2:]
55 for row in rows:
/external/chromium/chrome/browser/geolocation/
H A Dgeolocation_exceptions_table_model_unittest.cc65 GeolocationExceptionsTableModel::Rows rows; local
66 rows.insert(0U);
67 EXPECT_TRUE(model_->CanRemoveRows(rows));
76 EXPECT_FALSE(model_->CanRemoveRows(rows));
79 rows.clear();
80 rows.insert(1U);
81 rows.insert(2U);
82 EXPECT_TRUE(model_->CanRemoveRows(rows));
91 GeolocationExceptionsTableModel::Rows rows; local
92 rows
[all...]
H A Dgeolocation_exceptions_table_model.h25 // Return whether the given set of rows can be removed. A parent with setting
28 virtual bool CanRemoveRows(const Rows& rows) const;
35 virtual void RemoveRows(const Rows& rows);
/external/chromium/chrome/browser/notifications/
H A Dnotification_exceptions_table_model_unittest.cc109 RemoveRowsTableModel::Rows rows; local
110 rows.insert(0); // allowed.com
111 rows.insert(3); // e-allowed2.com
112 model_->RemoveRows(rows);
119 RemoveRowsTableModel::Rows rows; local
120 rows.insert(0);
121 rows.insert(1);
122 rows.insert(2);
123 model_->RemoveRows(rows);
H A Dnotification_exceptions_table_model.h24 virtual bool CanRemoveRows(const Rows& rows) const;
25 virtual void RemoveRows(const Rows& rows);
/external/doclava/res/assets/templates/
H A Ddiff.cs71 if (tr.rowIndex + 1 < table.rows.length) {
72 var tbody = table.rows[tr.rowIndex + 1].parentNode;
79 if (tr.rowIndex + 1 < table.rows.length
80 && $(table.rows[tr.rowIndex + 1]).hasClass("class-entry")) {
81 var tbody = table.rows[tr.rowIndex + 1].parentNode;
99 while (i < table.rows.length && $(table.rows[i]).hasClass("method-entry")) {
100 $(table.rows[i++]).show();
107 while (i < table.rows.length && $(table.rows[
[all...]
/external/javasqlite/src/main/java/SQLite/
H A DTableResult.java39 * Number of rows in the result set.
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/jmonkeyengine/engine/src/test/jme3test/texture/
H A DTestTexture3DLoading.java40 int rows = 4;//4 * 4
42 q.scaleTextureCoordinates(new Vector2f(rows, rows));
46 material.setInt("Rows", rows);
/external/opencv/cvaux/src/
H A Dcvvideo.cpp65 frame->rows != even->rows*2 || odd->rows != even->rows )
/external/webkit/LayoutTests/dom/html/level2/html/
H A DHTMLTableElement30.js81 with an index of four. After the new row is inserted the number of rows
83 Also the number of rows in the TFOOT section before
85 of rows in the TFOOT section is two.
111 rowsnodeList = testNode.rows;
118 rowsnodeList = vsection1.rows;
124 rowsnodeList = testNode.rows;
131 rowsnodeList = vsection1.rows;
H A DHTMLTableElement28.js82 section of the TABLE. The number of rows in the THEAD section before
84 of rows in the THEAD section is two.
112 rowsnodeList = vsection1.rows;
120 rowsnodeList = vsection2.rows;
H A DHTMLTableElement32.js81 with an index of 0(first row). Currently there are four rows in the
83 three rows in the table.
106 rowsnodeList = testNode.rows;
112 rowsnodeList = testNode.rows;
H A DHTMLTableElement33.js81 with an index of 3(last row). Currently there are four rows in the
105 rowsnodeList = testNode.rows;
111 rowsnodeList = testNode.rows;
/external/webkit/LayoutTests/dom/xhtml/level2/html/
H A DHTMLTableElement30.js81 with an index of four. After the new row is inserted the number of rows
83 Also the number of rows in the TFOOT section before
85 of rows in the TFOOT section is two.
111 rowsnodeList = testNode.rows;
118 rowsnodeList = vsection1.rows;
124 rowsnodeList = testNode.rows;
131 rowsnodeList = vsection1.rows;
/external/libvpx/vp8/common/
H A Ddebugmodes.c16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame) argument
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++)
/external/valgrind/main/drd/tests/
H A Dmatinv.c35 int rows; member in struct:gj_threadinfo
53 /** Allocate memory for a matrix with the specified number of rows and
56 static elem_t* new_matrix(const int rows, const int cols) argument
58 assert(rows > 0);
60 return malloc(rows * cols * sizeof(elem_t));
70 static void init_matrix(elem_t* const a, const int rows, const int cols) argument
73 for (i = 0; i < rows; i++)
75 for (j = 0; j < rows; j++)
84 const elem_t* const a, const int rows, const int cols)
88 for (i = 0; i < rows;
83 print_matrix(const char* const label, const elem_t* const a, const int rows, const int cols) argument
174 const int rows = p->rows; local
223 gj(elem_t* const a, const int rows, const int cols) argument
[all...]
/external/icu4c/common/
H A Dpropsvec.c31 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 */
191 * input range (only possible for the first and last rows)
199 int32_t count, rows; local
335 int32_t i, columns, valueColumns, rows, count; local
[all...]
/external/webkit/Source/WebCore/inspector/front-end/
H A DResourceTimingView.js75 var rows = [];
84 rows.push(row);
120 for (var i = 0; i < rows.length; ++i) {
125 td.textContent = rows[i].title;
136 bar.className = "network-timing-bar " + rows[i].className;
137 bar.style.left = scale * rows[i].start + "px";
138 bar.style.right = scale * (total - rows[i].end) + "px";
139 bar.style.backgroundColor = rows[i].color;
145 if (total - rows[i].end < rows[
[all...]
/external/opencv/cv/src/
H A Dcvkdtree.cpp91 assert(results->rows == d->rows);
92 assert(results->rows == dist->rows);
96 for (int j = 0; j < d->rows; ++j) {
120 int rn = results->rows * results->cols;
141 std::vector<int> tmp(mat->rows);
174 assert(bounds_min->rows * bounds_min->cols == dims());
175 assert(bounds_max->rows * bounds_max->cols == dims());
218 if (results->rows !
[all...]
/external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/util/
H A Dsorttable.js21 -To avoid including the non-data rows (e.g., radio buttions) into sorting,
55 the.appendChild(table.rows[0]);
61 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
63 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
64 // "total" rows, for example). This is B&R, since what you're supposed
65 // to do is put them in a tfoot. So, if there are sortbottom rows,
68 for (var i=0; i<table.rows.length; i++) {
69 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
70 sortbottomrows[sortbottomrows.length] = table.rows[
[all...]
/external/webkit/Source/WebCore/html/
H A DHTMLTableSectionElement.cpp66 RefPtr<HTMLCollection> children = rows();
88 RefPtr<HTMLCollection> children = rows();
101 int rows = 0; local
105 rows++;
109 return rows;
152 PassRefPtr<HTMLCollection> HTMLTableSectionElement::rows() function in class:WebCore::HTMLTableSectionElement

Completed in 906 milliseconds

1234567891011>>