| /external/chromium_org/third_party/WebKit/Tools/GardeningServer/scripts/ui/ |
| failures.js | 72 function cellByBuildType(row, configuration)
74 return row.cells[configuration.debug ? 2 : 1];
90 var row = this._resultRows[result];
91 $(row).show();
92 if (row)
93 return row;
95 row = this._resultRows[result] = this._body.insertRow(0);
96 row.className = result;
97 row.insertCell();
98 row.insertCell()
[all...] |
| /external/eigen/Eigen/src/Core/ |
| SelfCwiseBinaryOp.h | 65 inline Scalar& coeffRef(Index row, Index col)
68 return m_matrix.const_cast_derived().coeffRef(row, col);
70 inline const Scalar& coeffRef(Index row, Index col) const
72 return m_matrix.coeffRef(row, col);
88 void copyCoeff(Index row, Index col, const DenseBase<OtherDerived>& other)
91 eigen_internal_assert(row >= 0 && row < rows()
93 Scalar& tmp = m_matrix.coeffRef(row,col);
94 tmp = m_functor(tmp, _other.coeff(row,col));
107 void copyPacket(Index row, Index col, const DenseBase<OtherDerived>& other
[all...] |
| /external/eigen/doc/ |
| I15_StorageOrders.dox | 5 There are two different storage orders for matrices and two-dimensional arrays: column-major and row-major.
14 \section TopicStorageOrdersIntro Column-major and row-major storage
17 have to somehow be laid out linearly. There are two main ways to do this, by row and by column.
19 We say that a matrix is stored in \b row-major order if it is stored row by row. The entire first row is
20 stored first, followed by the entire second row, and so on. Consider for example the matrix
30 If this matrix is stored in row-major order, then the entries are laid out in memory as follows:
59 parameter is set to \c RowMajor, then the matrix or array is stored in row-major order; if it is set to
[all...] |
| /frameworks/base/core/tests/coretests/src/android/widget/focus/ |
| ScrollingThroughListOfFocusablesTest.java | 83 // move to next row
146 assertTrue("bottom of last row of last item should be at " +
165 // (make sure we are at last row of second item)
179 // move up to next row
186 // now we are at top row, should have caused scrolling, and fading edge...
194 assertEquals("top of selected row should be just below top vertical fading edge",
211 * @param row
215 int row) {
216 assertEquals("expecting selected row",
217 row, internalFocused.getSelectedRow())
[all...] |
| /frameworks/base/include/androidfw/ |
| CursorWindow.h | 43 * window has first chunk of RowSlots, which are offsets to the row directory, followed by
45 * the pre-allocated chunk isn't big enough to refer to all rows. Each row directory has a
98 * Allocate a row slot and its directory.
99 * The row is initialized will null entries for each field.
104 status_t putBlob(uint32_t row, uint32_t column, const void* value, size_t size);
105 status_t putString(uint32_t row, uint32_t column, const char* value, size_t sizeIncludingNull);
106 status_t putLong(uint32_t row, uint32_t column, int64_t value);
107 status_t putDouble(uint32_t row, uint32_t column, double value);
108 status_t putNull(uint32_t row, uint32_t column);
111 * Gets the field slot at the specified row and column
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| SearchDialogBase.py | 43 self.row = 0
54 l.grid(row=self.row, column=0, sticky="nw")
56 e.grid(row=self.row, column=1, sticky="nwe")
57 self.row = self.row + 1
63 l.grid(row=self.row, column=0, sticky="nw")
65 f.grid(row=self.row, column=1, columnspan=1, sticky="nwe"
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| SearchDialogBase.py | 43 self.row = 0
54 l.grid(row=self.row, column=0, sticky="nw")
56 e.grid(row=self.row, column=1, sticky="nwe")
57 self.row = self.row + 1
63 l.grid(row=self.row, column=0, sticky="nw")
65 f.grid(row=self.row, column=1, columnspan=1, sticky="nwe"
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ArrayTable.java | 42 * <p>The allowed row and column keys must be supplied when the table is
43 * created. The table always contains a mapping for every row key / column pair.
44 * The value corresponding to a given row and column is null unless another
47 * <p>The table's size is constant: the product of the number of supplied row
52 * <p>The ordering of the row and column keys provided when the table is
61 * <p>Null row keys or column keys are not permitted.
64 * where the array indices correspond to the position of a row or column in the
86 * @param rowKeys row keys that may be stored in the generated table
99 * iterable, to specify the allowed row keys and/or column keys. Note that
107 * <p>If {@code table} includes a mapping with row key {@code r} and
[all...] |
| /external/chromium_org/third_party/sqlite/src/test/ |
| speed1.test | 94 speed_trial speed1-insert1 50000 row $sql
105 speed_trial speed1-insert2 50000 row $sql
120 speed_trial speed1-select1 [expr {50*50000}] row $sql
132 speed_trial speed1-select2 [expr {50*50000}] row $sql
138 speed_trial speed1-createidx 150000 row {
166 speed_trial speed1-select4 100000 row $sql
177 speed_trial speed1-select5 100000 row $sql
187 speed_trial speed1-select6 50000 row $sql
192 speed_trial speed1-vacuum 100000 row VACUUM
206 # 50000 single-row updates. An index is used to find the row quickly
[all...] |
| speed1p.explain | 99 speed_trial_tcl speed1p-insert1 50000 row $script
117 speed_trial_tcl speed1p-insert2 50000 row $script
138 speed_trial_tcl speed1p-select1 [expr {50*50000}] row $script
155 speed_trial_tcl speed1p-select2 [expr {50*50000}] row $script
163 speed_trial speed1p-createidx 150000 row {
203 speed_trial_tcl speed1p-select4 100000 row $script
220 speed_trial_tcl speed1p-select5 100000 row $script
233 speed_trial_tcl speed1p-select6 50000 row $script
238 speed_trial speed1p-vacuum 100000 row VACUUM
258 # 50000 single-row updates. An index is used to find the row quickly
[all...] |
| speed1p.test | 96 speed_trial_tcl speed1p-insert1 50000 row $script
113 speed_trial_tcl speed1p-insert2 50000 row $script
133 speed_trial_tcl speed1p-select1 [expr {50*50000}] row $script
149 speed_trial_tcl speed1p-select2 [expr {50*50000}] row $script
155 speed_trial speed1p-createidx 150000 row {
193 speed_trial_tcl speed1p-select4 100000 row $script
209 speed_trial_tcl speed1p-select5 100000 row $script
221 speed_trial_tcl speed1p-select6 50000 row $script
226 speed_trial speed1p-vacuum 100000 row VACUUM
245 # 50000 single-row updates. An index is used to find the row quickly
[all...] |
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineProduct.h | 139 for (Index row = 0; row < lhs.rows(); row++) {
140 dst(row, col) = lhs.coeffDiag(row) * rhs(row, col);
144 for (Index row = 0; row < lhs.rows(); row++) {
145 typename _Lhs::InnerLowerIterator lIt(lhs, row);
[all...] |
| /cts/tests/tests/widget/src/android/widget/cts/ |
| GridLayoutTest.java | 181 int row = i + 1; local
182 GridLayout.LayoutParams lp = new GridLayout.LayoutParams(spec(row), spec(0));
188 table[row][0] = v;
205 int row = i + 1; local
207 GridLayout.LayoutParams lp = new GridLayout.LayoutParams(spec(row), spec(col));
211 v.setTextSize(10 + 5 * row * col);
213 table[row][col] = v;
219 private void testAlignment(int row, int col, Alignment a, View v0, View v1, String group) {
222 assertEquals("View at row " + row + ", column " + col + " was not " + a.name
240 int row = i + 1; local
247 int row = i + 1; local
[all...] |
| /external/jpeg/ |
| jcmainct.c | 31 JDIMENSION cur_iMCU_row; /* number of current iMCU row */
32 JDIMENSION rowgroup_ctr; /* counts row groups received in iMCU row */
127 /* If we don't have a full iMCU row buffered, return to application for
128 * more data. Note that preprocessor will always pad to fill the iMCU row
134 /* Send the completed row to the compressor */
136 /* If compressor did not consume the whole row, then we must need to
138 * we pretend we didn't yet consume the last input row; otherwise, if
139 * it happened to be the last row of the image, the application would
148 /* We did finish the row. Undo our little suspension hack if a previou
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| jcmainct.c | 31 JDIMENSION cur_iMCU_row; /* number of current iMCU row */
32 JDIMENSION rowgroup_ctr; /* counts row groups received in iMCU row */
127 /* If we don't have a full iMCU row buffered, return to application for
128 * more data. Note that preprocessor will always pad to fill the iMCU row
134 /* Send the completed row to the compressor */
136 /* If compressor did not consume the whole row, then we must need to
138 * we pretend we didn't yet consume the last input row; otherwise, if
139 * it happened to be the last row of the image, the application would
148 /* We did finish the row. Undo our little suspension hack if a previou
[all...] |
| /external/chromium_org/chrome/browser/history/android/ |
| favicon_sql_handler.cc | 32 bool FaviconSQLHandler::Update(const HistoryAndBookmarkRow& row,
34 if (!row.favicon_valid())
43 row.favicon(),
100 bool FaviconSQLHandler::Insert(HistoryAndBookmarkRow* row) {
101 if (!row->is_value_set_explicitly(HistoryAndBookmarkRow::FAVICON) ||
102 !row->favicon_valid())
105 DCHECK(row->is_value_set_explicitly(HistoryAndBookmarkRow::URL));
112 row->favicon(),
117 return thumbnail_db_->AddIconMapping(row->url(), id);
|
| /external/chromium_org/third_party/libpng/ |
| pngwtran.c | 2 /* pngwtran.c - transforms the data in a row for PNG writers
37 /* png_uint_32 width; width of row */
38 /* png_uint_32 rowbytes; number of bytes in row */
43 png_ptr->row_buf + 1); /* start of pixel data for row */
92 png_do_pack(png_row_infop row_info, png_bytep row, png_uint_32 bit_depth)
98 row != NULL && row_info != NULL &&
111 sp = row;
112 dp = row;
142 sp = row;
143 dp = row;
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkConvolver.cpp | 24 // by calling AdvanceRow. It will keep track of which row in the buffer it
28 // The number of pixels in each row is given in |sourceRowPixelWidth|.
44 // Moves to the next row in the buffer, returning a pointer to the beginning
47 unsigned char* row = &fBuffer[fNextRow * fRowByteWidth]; local
50 // Set the pointer to the next row to use, wrapping around if necessary.
55 return row;
66 // Row 0 Coord 8
67 // Row 1 Coord 9
68 // Row 2 Coord 6 <- fNextRow = 2, fNextRowCoordinate = 10.
69 // Row 3 Coord
[all...] |
| /external/libpng/ |
| pngwtran.c | 2 /* pngwtran.c - transforms the data in a row for PNG writers
37 /* png_uint_32 width; width of row */
38 /* png_uint_32 rowbytes; number of bytes in row */
43 png_ptr->row_buf + 1); /* start of pixel data for row */
92 png_do_pack(png_row_infop row_info, png_bytep row, png_uint_32 bit_depth)
98 row != NULL && row_info != NULL &&
111 sp = row;
112 dp = row;
142 sp = row;
143 dp = row;
[all...] |
| /external/qemu/distrib/libpng-1.2.19/ |
| pngwtran.c | 2 /* pngwtran.c - transforms the data in a row for PNG writers
32 /* png_uint_32 width; width of row */
33 /* png_uint_32 rowbytes; number of bytes in row */
38 png_ptr->row_buf + 1); /* start of pixel data for row */
87 png_do_pack(png_row_infop row_info, png_bytep row, png_uint_32 bit_depth)
92 row != NULL && row_info != NULL &&
105 sp = row;
106 dp = row;
136 sp = row;
137 dp = row;
[all...] |
| /external/skia/src/core/ |
| SkConvolver.cpp | 24 // by calling AdvanceRow. It will keep track of which row in the buffer it
28 // The number of pixels in each row is given in |sourceRowPixelWidth|.
44 // Moves to the next row in the buffer, returning a pointer to the beginning
47 unsigned char* row = &fBuffer[fNextRow * fRowByteWidth]; local
50 // Set the pointer to the next row to use, wrapping around if necessary.
55 return row;
66 // Row 0 Coord 8
67 // Row 1 Coord 9
68 // Row 2 Coord 6 <- fNextRow = 2, fNextRowCoordinate = 10.
69 // Row 3 Coord
[all...] |
| /frameworks/base/core/java/android/database/ |
| CrossProcessCursor.java | 32 * In particular, the window contains the row indicated by {@link Cursor#getPosition}.
34 * row moved outside the range covered by the window.
45 * row position until all of the data in the cursor is exhausted
48 * The filled window uses the same row indices as the original cursor.
49 * For example, if you fill a window starting from row 5 from the cursor,
50 * you can query the contents of row 5 from the window just by asking it
51 * for row 5 because there is a direct correspondence between the row indices
58 * @param position The zero-based index of the first row to copy into the window.
|
| /external/chromium_org/chrome/browser/resources/instant/ |
| instant.js | 48 var row = createElementWithClass('div', 'row');
49 row.id = '';
51 var label = createElementWithClass('label', 'row-label');
54 row.appendChild(label);
56 var input = createElementWithClass('input', 'row-input');
64 row.appendChild(input);
66 var units = createElementWithClass('div', 'row-units');
68 row.appendChild(units);
70 $('instant-form').appendChild(row);
[all...] |
| /external/libvpx/libvpx/vpx_scale/generic/ |
| yv12extend.c | 132 int row; local
144 for (row = 0; row < src_ybc->y_height; ++row) {
153 for (row = 0; row < src_ybc->uv_height; ++row) {
162 for (row = 0; row < src_ybc->uv_height; ++row) {
173 int row; local
[all...] |
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| Companion.h | 63 EIGEN_STRONG_INLINE const _Scalar operator()(Index row, Index col ) const
67 if( 0 < row ){ return m_bl_diag[col]; }
70 else{ return m_monic[row]; }
105 * \returns true if the row and the column, having colNorm and rowNorm
108 * the column and the row in order to balance them.
114 * \returns true if the row and the column, having colNorm and rowNorm
117 * the column and the row in order to balance them.
127 * A matrix with non zero row and non zero column is balanced
128 * for a certain norm if the i-th row and the i-th column
151 // then the balancing coefficient for the row is \f$ 1/2^{\sigma} \f
[all...] |
