/external/icu4c/common/ |
propsvec.h | 34 * Logically, each row has a certain number of uint32_t values, 38 * In each internal row, 39 * row[0] contains the start code point and 40 * row[1] contains the limit code point, 43 * Initially, there is only one "normal" row for 47 * It would be possible to store only one range boundary per row, 71 * @param columns Number of value integers (uint32_t) per row. 113 * - for each (non-unique) row, call the handler function 115 * The handler's rowIndex is the index of the row in the compacted 123 * and the row is arbitrary (but not NULL) [all...] |
/external/markdown/markdown/extensions/ |
imagelinks.py | 72 for row in rows: 73 for photo_url, title in row: 99 rows.append([]) # start a new row
|
/external/webkit/Source/WebCore/rendering/mathml/ |
RenderMathMLRow.cpp | 39 RenderMathMLRow::RenderMathMLRow(Node* row) 40 : RenderMathMLBlock(row) 73 // Calculate the non-operator max height of the row.
|
/development/samples/ApiDemos/src/com/example/android/apis/media/ |
AudioFxDemo.java | 121 LinearLayout row = new LinearLayout(this); local 122 row.setOrientation(LinearLayout.HORIZONTAL); 155 row.addView(minDbTextView); 156 row.addView(bar); 157 row.addView(maxDbTextView); 159 mLinearLayout.addView(row);
|
/development/samples/TicTacToeLib/src/com/example/android/tictactoe/library/ |
GameActivity.java | 192 int row = -1;
local 198 row = j;
221 if (col != -1 || row != -1 || diag != -1) {
222 setFinished(player, col, row, diag);
234 private void setFinished(State player, int col, int row, int diagonal) {
239 mGameView.setFinished(col, row, diagonal);
|
/external/ceres-solver/internal/ceres/ |
schur_eliminator_test.cc | 115 int row = 0; local 119 P.block(row, row, block_size, block_size) = 121 .block(row, row, block_size, block_size) 124 row += block_size;
|
visibility_based_preconditioner.cc | 259 // Iterate over each row of the matrix. The block structure of the 261 // blocks. Thus all row blocks containing an e_block/point occur 263 // parameter block in each row block. These structural assumptions 282 const CompressedRow& row = bs.rows[r]; local 283 if (row.cells.front().block_id != e_block_id) { 287 // Iterate over the blocks in the row, ignoring the first block 290 for (int c = 1; c < row.cells.size(); ++c) { 291 const Cell& cell = row.cells[c]; 313 const CompressedRow& row = bs.rows[r]; local 314 CHECK_GE(row.cells.front().block_id, num_eliminate_blocks) [all...] |
/external/eigen/Eigen/src/Core/ |
CwiseBinaryOp.h | 172 EIGEN_STRONG_INLINE const Scalar coeff(Index row, Index col) const 174 return derived().functor()(derived().lhs().coeff(row, col), 175 derived().rhs().coeff(row, col)); 179 EIGEN_STRONG_INLINE PacketScalar packet(Index row, Index col) const 181 return derived().functor().packetOp(derived().lhs().template packet<LoadMode>(row, col), 182 derived().rhs().template packet<LoadMode>(row, col));
|
Replicate.h | 92 inline Scalar coeff(Index row, Index col) const 96 : RowFactor==1 ? row 97 : row%m_matrix.rows(); 105 inline PacketScalar packet(Index row, Index col) const 108 : RowFactor==1 ? row 109 : row%m_matrix.rows(); 160 * \return an expression of the replication of each column (or row) of \c *this
|
Block.h | 107 /** Column or Row constructor 111 // It is a row if and only if BlockRows==1 and BlockCols==XprType::ColsAtCompileTime, 155 inline Scalar& coeffRef(Index row, Index col) 159 .coeffRef(row + m_startRow.value(), col + m_startCol.value()); 162 inline const Scalar& coeffRef(Index row, Index col) const 165 .coeffRef(row + m_startRow.value(), col + m_startCol.value()); 168 EIGEN_STRONG_INLINE const CoeffReturnType coeff(Index row, Index col) const 170 return m_xpr.coeff(row + m_startRow.value(), col + m_startCol.value()); 196 inline PacketScalar packet(Index row, Index col) const 199 (row + m_startRow.value(), col + m_startCol.value()) [all...] |
/external/eigen/test/ |
product_syrk.cpp | 76 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.row(c),s1)._expression()), 77 ((s1 * m1.row(c).transpose() * m1.row(c).transpose().adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); 80 VERIFY_IS_APPROX((m2.template selfadjointView<Upper>().rankUpdate(m1.row(c).adjoint(),s1)._expression()), 81 ((s1 * m1.row(c).adjoint() * m1.row(c).adjoint().adjoint()).eval().template triangularView<Upper>().toDenseMatrix()));
|
/external/qemu/ |
vnchextile.h | 16 uint8_t *row = vs->server.ds->data + y * ds_get_linesize(vs->ds) + x * ds_get_bytes_per_pixel(vs->ds); local 17 pixel_t *irow = (pixel_t *)row; 88 irow = (pixel_t *)row; 114 irow = (pixel_t *)row; 200 vs->write_pixels(vs, row, w * ds_get_bytes_per_pixel(vs->ds)); 201 row += ds_get_linesize(vs->ds);
|
/packages/apps/Calendar/src/com/android/calendar/selectcalendars/ |
SelectCalendarsSyncFragment.java | 163 for (CalendarRow row : changes.values()) { 164 if (row.synced == row.originalSynced) { 167 long id = row.id; 170 Uri uri = ContentUris.withAppendedId(Calendars.CONTENT_URI, row.id); 173 int synced = row.synced ? 1 : 0;
|
/external/libpng/contrib/gregbook/ |
rpng-x.c | 691 ulg i, row, lastrow = 0; local 708 for (lastrow = row = 0; row < image_height; ++row) { 709 src = image_data + row*image_rowbytes; 710 dest = ximage->data + row*ximage_rowbytes; 771 if (((row+1) & 0xf) == 0) { 775 lastrow = row + 1; 782 for (lastrow = row = 0; row < image_height; ++row) [all...] |
/packages/providers/TelephonyProvider/src/com/android/providers/telephony/ |
SmsProvider.java | 237 Object[] row = new Object[13]; local 238 row[0] = message.getServiceCenterAddress(); 239 row[1] = message.getDisplayOriginatingAddress(); 240 row[2] = String.valueOf(message.getMessageClass()); 241 row[3] = message.getDisplayMessageBody(); 242 row[4] = message.getTimestampMillis(); 243 row[5] = Sms.STATUS_NONE; 244 row[6] = message.getIndexOnIcc(); 245 row[7] = message.isStatusReportMessage(); 246 row[8] = "sms" [all...] |
/external/icu4c/test/intltest/ |
restsnew.cpp | 326 int32_t count, row=0, col=0; local 347 row=0; 351 row=count; 357 expected+=itoa(row, buf); 358 ResourceBundle rowbundle=bundle.get(row, err); 365 expected+=itoa(row, buf); 537 int32_t count, row=0, col=0; local 559 row=0; 563 row=count; 569 expected+=itoa(row, buf) 636 int32_t i,j,row,col, actual_bundle; local [all...] |
/external/chromium/chrome/browser/ui/gtk/ |
gtk_tree.cc | 27 int row = GetRowNumForPath(path); local 29 return row; 36 int row = GetRowNumForPath(child_path); local 38 return row; 41 void SelectAndFocusRowNum(int row, GtkTreeView* tree_view) { 48 if (!gtk_tree_model_iter_nth_child(model, &iter, NULL, row)) { 111 // Every group consists of a header and a separator row, and there is a blank 112 // row between groups. 176 void TableAdapter::AddNodeToList(int row) { 178 int list_store_index = GetListStoreIndexForModelRow(row); [all...] |
/external/emma/core/java12/com/vladium/emma/report/txt/ |
ReportGenerator.java | 144 // [all] coverage summary row: 147 // header row: 150 // coverage row: 157 row ("total packages:" + m_separator + item.getChildCount ()); 158 row ("total classes:" + m_separator + item.getAggregate (IItem.TOTAL_CLASS_COUNT)); 159 row ("total methods:" + m_separator + item.getAggregate (IItem.TOTAL_METHOD_COUNT)); 163 row ("total executable files:" + m_separator + item.getAggregate (IItem.TOTAL_SRCFILE_COUNT)); 166 row ("total executable lines:" + m_separator + item.getAggregate (IItem.TOTAL_LINE_COUNT)); 183 // header row: 188 // coverage row 340 row (new StringBuffer (text).append (":")); method 415 private void row (final StringBuffer str) method in class:ReportGenerator 430 private void row (final String str) method in class:ReportGenerator [all...] |
/external/opencv/otherlibs/highgui/ |
grfmt_jpeg2000.cpp | 458 jas_matrix_t *row = jas_matrix_create( 1, w ); local 459 if(!row) 467 jas_matrix_setv( row, x, data[x * ncmpts + i] ); 468 jas_image_writecmpt( img, i, 0, y, w, 1, row ); 472 jas_matrix_destroy( row ); 481 jas_matrix_t *row = jas_matrix_create( 1, w ); local 482 if(!row) 490 jas_matrix_setv( row, x, data[x * ncmpts + i] ); 491 jas_image_writecmpt( img, i, 0, y, w, 1, row ); 495 jas_matrix_destroy( row ); [all...] |
/external/libpng/ |
pngtrans.c | 2 /* pngtrans.c - transforms the data in a row (used by both readers and writers) 205 png_do_invert(png_row_infop row_info, png_bytep row) 213 if (row == NULL || row_info == NULL) 218 png_bytep rp = row; 231 png_bytep rp = row; 244 png_bytep rp = row; 261 png_do_swap(png_row_infop row_info, png_bytep row) 267 row != NULL && row_info != NULL && 271 png_bytep rp = row; 393 png_do_packswap(png_row_infop row_info, png_bytep row) [all...] |
/external/qemu/distrib/libpng-1.2.19/ |
pngtrans.c | 2 /* pngtrans.c - transforms the data in a row (used by both readers and writers) 176 png_do_invert(png_row_infop row_info, png_bytep row) 183 if (row == NULL || row_info == NULL) 188 png_bytep rp = row; 201 png_bytep rp = row; 214 png_bytep rp = row; 231 png_do_swap(png_row_infop row_info, png_bytep row) 236 row != NULL && row_info != NULL && 240 png_bytep rp = row; 362 png_do_packswap(png_row_infop row_info, png_bytep row) [all...] |
/external/guava/guava/src/com/google/common/collect/ |
RegularImmutableTable.java | 97 * expected and that isn't documented in the Javadoc. If a row Comparator 98 * is provided, cellSet() iterates across the columns in the first row, 99 * the columns in the second row, etc. If a column Comparator is provided 100 * but a row Comparator isn't, cellSet() iterates across the rows in the 234 @Override public ImmutableMap<C, V> row(R rowKey) { method 251 Map<C, V> row = rowMap.get(rowKey); local 252 return (row != null) && row.containsKey(columnKey); 265 Map<C, V> row = rowMap.get(rowKey); local 266 return (row == null) ? null : row.get(columnKey) [all...] |
/external/skia/legacy/src/core/ |
SkRegion_rects.cpp | 70 struct Row { 76 SkTDArray<Row> fRows; 95 SkRegion::RunType* row = (SkRegion::RunType*)fAlloc.allocThrow(size); 96 SkRegion::RunType* rowHead = row; 101 // record the L R values for this row 108 *row++ = edge->fX; 122 *row++ = currR; 123 *row++ = edge->fX; 131 *row++ = currR; 134 int rowCount = row - rowHead [all...] |
/external/skia/src/core/ |
SkRegion_rects.cpp | 70 struct Row { 76 SkTDArray<Row> fRows; 95 SkRegion::RunType* row = (SkRegion::RunType*)fAlloc.allocThrow(size); 96 SkRegion::RunType* rowHead = row; 101 // record the L R values for this row 108 *row++ = edge->fX; 122 *row++ = currR; 123 *row++ = edge->fX; 131 *row++ = currR; 134 int rowCount = row - rowHead [all...] |
/external/webkit/Source/WebCore/html/ |
HTMLTableElement.cpp | 189 HTMLTableRowElement* row = 0; local 194 row = HTMLTableRowsCollection::rowAfter(this, lastRow); 195 if (!row) { 202 lastRow = row; 208 parent = row ? row->parentNode() : lastRow->parentNode(); 221 parent->insertBefore(newRow, row, ec); 227 HTMLTableRowElement* row = 0; local 229 row = HTMLTableRowsCollection::lastRow(this); 232 row = HTMLTableRowsCollection::rowAfter(this, row) [all...] |